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>
33 #include <isl_options_private.h>
35 static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type)
38 case isl_dim_param: return dim->nparam;
39 case isl_dim_in: return dim->n_in;
40 case isl_dim_out: return dim->n_out;
41 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
46 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
49 case isl_dim_param: return 1;
50 case isl_dim_in: return 1 + dim->nparam;
51 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
56 unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap,
57 enum isl_dim_type type)
62 case isl_dim_cst: return 1;
65 case isl_dim_out: return isl_space_dim(bmap->dim, type);
66 case isl_dim_div: return bmap->n_div;
67 case isl_dim_all: return isl_basic_map_total_dim(bmap);
72 unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type)
74 return map ? n(map->dim, type) : 0;
77 unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type)
79 return set ? n(set->dim, type) : 0;
82 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
83 enum isl_dim_type type)
85 isl_space *dim = bmap->dim;
87 case isl_dim_cst: return 0;
88 case isl_dim_param: return 1;
89 case isl_dim_in: return 1 + dim->nparam;
90 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
91 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
96 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
97 enum isl_dim_type type)
99 return isl_basic_map_offset(bset, type);
102 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
104 return pos(map->dim, type);
107 unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset,
108 enum isl_dim_type type)
110 return isl_basic_map_dim(bset, type);
113 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset)
115 return isl_basic_set_dim(bset, isl_dim_set);
118 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset)
120 return isl_basic_set_dim(bset, isl_dim_param);
123 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
127 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
130 unsigned isl_set_n_dim(__isl_keep isl_set *set)
132 return isl_set_dim(set, isl_dim_set);
135 unsigned isl_set_n_param(__isl_keep isl_set *set)
137 return isl_set_dim(set, isl_dim_param);
140 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
142 return bmap ? bmap->dim->n_in : 0;
145 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
147 return bmap ? bmap->dim->n_out : 0;
150 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
152 return bmap ? bmap->dim->nparam : 0;
155 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
157 return bmap ? bmap->n_div : 0;
160 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
162 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0;
165 unsigned isl_map_n_in(const struct isl_map *map)
167 return map ? map->dim->n_in : 0;
170 unsigned isl_map_n_out(const struct isl_map *map)
172 return map ? map->dim->n_out : 0;
175 unsigned isl_map_n_param(const struct isl_map *map)
177 return map ? map->dim->nparam : 0;
180 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
185 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
188 return isl_space_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
191 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
192 struct isl_basic_set *bset)
197 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
200 return isl_space_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
203 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
208 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
211 return isl_space_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
214 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
215 struct isl_basic_set *bset)
220 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
223 return isl_space_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
226 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
228 return bmap ? bmap->ctx : NULL;
231 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
233 return bset ? bset->ctx : NULL;
236 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
238 return map ? map->ctx : NULL;
241 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
243 return set ? set->ctx : NULL;
246 __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap)
250 return isl_space_copy(bmap->dim);
253 __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset)
257 return isl_space_copy(bset->dim);
260 __isl_give isl_local_space *isl_basic_map_get_local_space(
261 __isl_keep isl_basic_map *bmap)
270 total = isl_basic_map_total_dim(bmap);
271 ls = isl_local_space_alloc(isl_space_copy(bmap->dim), bmap->n_div);
275 for (i = 0; i < bmap->n_div; ++i)
276 isl_seq_cpy(ls->div->row[i], bmap->div[i], 2 + total);
281 __isl_give isl_local_space *isl_basic_set_get_local_space(
282 __isl_keep isl_basic_set *bset)
284 return isl_basic_map_get_local_space(bset);
287 __isl_give isl_basic_map *isl_basic_map_from_local_space(
288 __isl_take isl_local_space *ls)
297 n_div = isl_local_space_dim(ls, isl_dim_div);
298 bmap = isl_basic_map_alloc_space(isl_local_space_get_space(ls),
299 n_div, 0, 2 * n_div);
301 for (i = 0; i < n_div; ++i)
302 if (isl_basic_map_alloc_div(bmap) < 0)
305 for (i = 0; i < n_div; ++i) {
306 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
307 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
311 isl_local_space_free(ls);
314 isl_local_space_free(ls);
315 isl_basic_map_free(bmap);
319 __isl_give isl_basic_set *isl_basic_set_from_local_space(
320 __isl_take isl_local_space *ls)
322 return isl_basic_map_from_local_space(ls);
325 __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map)
329 return isl_space_copy(map->dim);
332 __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set)
336 return isl_space_copy(set->dim);
339 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
340 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
342 bmap = isl_basic_map_cow(bmap);
345 bmap->dim = isl_space_set_tuple_name(bmap->dim, type, s);
348 bmap = isl_basic_map_finalize(bmap);
351 isl_basic_map_free(bmap);
355 __isl_give isl_basic_set *isl_basic_set_set_tuple_name(
356 __isl_take isl_basic_set *bset, const char *s)
358 return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
361 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
362 enum isl_dim_type type)
364 return bmap ? isl_space_get_tuple_name(bmap->dim, type) : NULL;
367 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
368 enum isl_dim_type type, const char *s)
372 map = isl_map_cow(map);
376 map->dim = isl_space_set_tuple_name(map->dim, type, s);
380 for (i = 0; i < map->n; ++i) {
381 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
392 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
393 enum isl_dim_type type)
395 return map ? isl_space_get_tuple_name(map->dim, type) : NULL;
398 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
401 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
404 __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map,
405 enum isl_dim_type type, __isl_take isl_id *id)
407 map = isl_map_cow(map);
409 return isl_id_free(id);
411 map->dim = isl_space_set_tuple_id(map->dim, type, id);
413 return isl_map_reset_space(map, isl_space_copy(map->dim));
416 __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set,
417 __isl_take isl_id *id)
419 return isl_map_set_tuple_id(set, isl_dim_set, id);
422 __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map,
423 enum isl_dim_type type)
425 map = isl_map_cow(map);
429 map->dim = isl_space_reset_tuple_id(map->dim, type);
431 return isl_map_reset_space(map, isl_space_copy(map->dim));
434 __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set)
436 return isl_map_reset_tuple_id(set, isl_dim_set);
439 int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type)
441 return map ? isl_space_has_tuple_id(map->dim, type) : -1;
444 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
445 enum isl_dim_type type)
447 return map ? isl_space_get_tuple_id(map->dim, type) : NULL;
450 int isl_set_has_tuple_id(__isl_keep isl_set *set)
452 return isl_map_has_tuple_id(set, isl_dim_set);
455 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
457 return isl_map_get_tuple_id(set, isl_dim_set);
460 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
462 return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL;
465 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
467 return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL;
470 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
471 enum isl_dim_type type, unsigned pos)
473 return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL;
476 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
477 enum isl_dim_type type, unsigned pos)
479 return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL;
482 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
483 enum isl_dim_type type, unsigned pos)
485 return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL;
488 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
489 enum isl_dim_type type, unsigned pos)
491 return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL;
494 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
495 __isl_take isl_basic_map *bmap,
496 enum isl_dim_type type, unsigned pos, const char *s)
498 bmap = isl_basic_map_cow(bmap);
501 bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s);
506 isl_basic_map_free(bmap);
510 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
511 enum isl_dim_type type, unsigned pos, const char *s)
515 map = isl_map_cow(map);
519 map->dim = isl_space_set_dim_name(map->dim, type, pos, s);
523 for (i = 0; i < map->n; ++i) {
524 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
535 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
536 __isl_take isl_basic_set *bset,
537 enum isl_dim_type type, unsigned pos, const char *s)
539 return (isl_basic_set *)isl_basic_map_set_dim_name(
540 (isl_basic_map *)bset, type, pos, s);
543 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
544 enum isl_dim_type type, unsigned pos, const char *s)
546 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
549 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap,
550 enum isl_dim_type type, unsigned pos)
552 return bmap ? isl_space_has_dim_id(bmap->dim, type, pos) : -1;
555 int isl_map_has_dim_id(__isl_keep isl_map *map,
556 enum isl_dim_type type, unsigned pos)
558 return map ? isl_space_has_dim_id(map->dim, type, pos) : -1;
561 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
562 enum isl_dim_type type, unsigned pos)
564 return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL;
567 int isl_set_has_dim_id(__isl_keep isl_set *set,
568 enum isl_dim_type type, unsigned pos)
570 return isl_map_has_dim_id(set, type, pos);
573 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
574 enum isl_dim_type type, unsigned pos)
576 return isl_map_get_dim_id(set, type, pos);
579 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
580 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
582 map = isl_map_cow(map);
584 return isl_id_free(id);
586 map->dim = isl_space_set_dim_id(map->dim, type, pos, id);
588 return isl_map_reset_space(map, isl_space_copy(map->dim));
591 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
592 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
594 return isl_map_set_dim_id(set, type, pos, id);
597 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
598 __isl_keep isl_id *id)
602 return isl_space_find_dim_by_id(map->dim, type, id);
605 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
606 __isl_keep isl_id *id)
608 return isl_map_find_dim_by_id(set, type, id);
611 int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type,
616 return isl_space_find_dim_by_name(map->dim, type, name);
619 int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type,
622 return isl_map_find_dim_by_name(set, type, name);
625 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
629 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
632 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
634 return isl_basic_map_is_rational(bset);
637 /* Is this basic set a parameter domain?
639 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
643 return isl_space_is_params(bset->dim);
646 /* Is this set a parameter domain?
648 int isl_set_is_params(__isl_keep isl_set *set)
652 return isl_space_is_params(set->dim);
655 /* Is this map actually a parameter domain?
656 * Users should never call this function. Outside of isl,
657 * a map can never be a parameter domain.
659 int isl_map_is_params(__isl_keep isl_map *map)
663 return isl_space_is_params(map->dim);
666 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
667 struct isl_basic_map *bmap, unsigned extra,
668 unsigned n_eq, unsigned n_ineq)
671 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
676 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
677 if (isl_blk_is_error(bmap->block))
680 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
685 bmap->block2 = isl_blk_empty();
688 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
689 if (isl_blk_is_error(bmap->block2))
692 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
697 for (i = 0; i < n_ineq + n_eq; ++i)
698 bmap->ineq[i] = bmap->block.data + i * row_size;
700 for (i = 0; i < extra; ++i)
701 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
705 bmap->c_size = n_eq + n_ineq;
706 bmap->eq = bmap->ineq + n_ineq;
715 isl_basic_map_free(bmap);
719 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
720 unsigned nparam, unsigned dim, unsigned extra,
721 unsigned n_eq, unsigned n_ineq)
723 struct isl_basic_map *bmap;
726 space = isl_space_set_alloc(ctx, nparam, dim);
730 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
731 return (struct isl_basic_set *)bmap;
734 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
735 unsigned extra, unsigned n_eq, unsigned n_ineq)
737 struct isl_basic_map *bmap;
740 isl_assert(dim->ctx, dim->n_in == 0, goto error);
741 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
742 return (struct isl_basic_set *)bmap;
748 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
749 unsigned extra, unsigned n_eq, unsigned n_ineq)
751 struct isl_basic_map *bmap;
755 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
760 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
766 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
767 unsigned nparam, unsigned in, unsigned out, unsigned extra,
768 unsigned n_eq, unsigned n_ineq)
770 struct isl_basic_map *bmap;
773 dim = isl_space_alloc(ctx, nparam, in, out);
777 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
781 static void dup_constraints(
782 struct isl_basic_map *dst, struct isl_basic_map *src)
785 unsigned total = isl_basic_map_total_dim(src);
787 for (i = 0; i < src->n_eq; ++i) {
788 int j = isl_basic_map_alloc_equality(dst);
789 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
792 for (i = 0; i < src->n_ineq; ++i) {
793 int j = isl_basic_map_alloc_inequality(dst);
794 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
797 for (i = 0; i < src->n_div; ++i) {
798 int j = isl_basic_map_alloc_div(dst);
799 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
801 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
804 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
806 struct isl_basic_map *dup;
810 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
811 bmap->n_div, bmap->n_eq, bmap->n_ineq);
814 dup_constraints(dup, bmap);
815 dup->flags = bmap->flags;
816 dup->sample = isl_vec_copy(bmap->sample);
820 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
822 struct isl_basic_map *dup;
824 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
825 return (struct isl_basic_set *)dup;
828 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
833 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
837 return isl_basic_set_dup(bset);
840 struct isl_set *isl_set_copy(struct isl_set *set)
849 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
854 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
858 bmap = isl_basic_map_dup(bmap);
860 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
864 struct isl_map *isl_map_copy(struct isl_map *map)
873 void isl_basic_map_free(struct isl_basic_map *bmap)
881 isl_ctx_deref(bmap->ctx);
883 isl_blk_free(bmap->ctx, bmap->block2);
885 isl_blk_free(bmap->ctx, bmap->block);
886 isl_vec_free(bmap->sample);
887 isl_space_free(bmap->dim);
891 void isl_basic_set_free(struct isl_basic_set *bset)
893 isl_basic_map_free((struct isl_basic_map *)bset);
896 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
898 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
901 __isl_give isl_map *isl_map_align_params_map_map_and(
902 __isl_take isl_map *map1, __isl_take isl_map *map2,
903 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
904 __isl_take isl_map *map2))
908 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
909 return fn(map1, map2);
910 if (!isl_space_has_named_params(map1->dim) ||
911 !isl_space_has_named_params(map2->dim))
912 isl_die(map1->ctx, isl_error_invalid,
913 "unaligned unnamed parameters", goto error);
914 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
915 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
916 return fn(map1, map2);
923 int isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1,
924 __isl_keep isl_map *map2,
925 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
931 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
932 return fn(map1, map2);
933 if (!isl_space_has_named_params(map1->dim) ||
934 !isl_space_has_named_params(map2->dim))
935 isl_die(map1->ctx, isl_error_invalid,
936 "unaligned unnamed parameters", return -1);
937 map1 = isl_map_copy(map1);
938 map2 = isl_map_copy(map2);
939 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
940 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
947 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
953 isl_assert(ctx, room_for_con(bmap, 1), return -1);
954 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
956 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
957 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
958 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
959 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
960 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
961 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
963 int j = isl_basic_map_alloc_inequality(bmap);
967 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
968 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
975 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
976 bmap->extra - bmap->n_div);
980 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
982 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
985 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
989 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
994 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
996 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
999 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
1004 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
1006 if (pos != bmap->n_eq - 1) {
1008 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
1009 bmap->eq[bmap->n_eq - 1] = t;
1015 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1017 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1020 void isl_basic_map_inequality_to_equality(
1021 struct isl_basic_map *bmap, unsigned pos)
1025 t = bmap->ineq[pos];
1026 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1027 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1032 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1033 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1034 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1035 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1038 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1040 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1043 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1045 struct isl_ctx *ctx;
1049 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1050 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1051 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1052 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1053 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1054 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1055 1 + isl_basic_map_total_dim(bmap),
1056 bmap->extra - bmap->n_div);
1057 return bmap->n_ineq++;
1060 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1062 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1065 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1069 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1074 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1076 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1079 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1084 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1086 if (pos != bmap->n_ineq - 1) {
1087 t = bmap->ineq[pos];
1088 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1089 bmap->ineq[bmap->n_ineq - 1] = t;
1090 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1096 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1098 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1101 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1106 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1109 k = isl_basic_map_alloc_equality(bmap);
1112 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1115 isl_basic_map_free(bmap);
1119 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1122 return (isl_basic_set *)
1123 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1126 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1131 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1134 k = isl_basic_map_alloc_inequality(bmap);
1137 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1140 isl_basic_map_free(bmap);
1144 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1147 return (isl_basic_set *)
1148 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1151 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1155 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1156 isl_seq_clr(bmap->div[bmap->n_div] +
1157 1 + 1 + isl_basic_map_total_dim(bmap),
1158 bmap->extra - bmap->n_div);
1159 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1160 return bmap->n_div++;
1163 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1165 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1168 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1172 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1177 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1179 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1182 /* Copy constraint from src to dst, putting the vars of src at offset
1183 * dim_off in dst and the divs of src at offset div_off in dst.
1184 * If both sets are actually map, then dim_off applies to the input
1187 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1188 struct isl_basic_map *src_map, isl_int *src,
1189 unsigned in_off, unsigned out_off, unsigned div_off)
1191 unsigned src_nparam = isl_basic_map_n_param(src_map);
1192 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1193 unsigned src_in = isl_basic_map_n_in(src_map);
1194 unsigned dst_in = isl_basic_map_n_in(dst_map);
1195 unsigned src_out = isl_basic_map_n_out(src_map);
1196 unsigned dst_out = isl_basic_map_n_out(dst_map);
1197 isl_int_set(dst[0], src[0]);
1198 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1199 if (dst_nparam > src_nparam)
1200 isl_seq_clr(dst+1+src_nparam,
1201 dst_nparam - src_nparam);
1202 isl_seq_clr(dst+1+dst_nparam, in_off);
1203 isl_seq_cpy(dst+1+dst_nparam+in_off,
1205 isl_min(dst_in-in_off, src_in));
1206 if (dst_in-in_off > src_in)
1207 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1208 dst_in - in_off - src_in);
1209 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1210 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1211 src+1+src_nparam+src_in,
1212 isl_min(dst_out-out_off, src_out));
1213 if (dst_out-out_off > src_out)
1214 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1215 dst_out - out_off - src_out);
1216 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1217 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1218 src+1+src_nparam+src_in+src_out,
1219 isl_min(dst_map->extra-div_off, src_map->n_div));
1220 if (dst_map->n_div-div_off > src_map->n_div)
1221 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1222 div_off+src_map->n_div,
1223 dst_map->n_div - div_off - src_map->n_div);
1226 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1227 struct isl_basic_map *src_map, isl_int *src,
1228 unsigned in_off, unsigned out_off, unsigned div_off)
1230 isl_int_set(dst[0], src[0]);
1231 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1234 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1235 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1240 if (!bmap1 || !bmap2)
1243 div_off = bmap1->n_div;
1245 for (i = 0; i < bmap2->n_eq; ++i) {
1246 int i1 = isl_basic_map_alloc_equality(bmap1);
1249 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1250 i_pos, o_pos, div_off);
1253 for (i = 0; i < bmap2->n_ineq; ++i) {
1254 int i1 = isl_basic_map_alloc_inequality(bmap1);
1257 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1258 i_pos, o_pos, div_off);
1261 for (i = 0; i < bmap2->n_div; ++i) {
1262 int i1 = isl_basic_map_alloc_div(bmap1);
1265 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1266 i_pos, o_pos, div_off);
1269 isl_basic_map_free(bmap2);
1274 isl_basic_map_free(bmap1);
1275 isl_basic_map_free(bmap2);
1279 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1280 struct isl_basic_set *bset2, unsigned pos)
1282 return (struct isl_basic_set *)
1283 add_constraints((struct isl_basic_map *)bset1,
1284 (struct isl_basic_map *)bset2, 0, pos);
1287 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1288 __isl_take isl_space *dim, unsigned extra,
1289 unsigned n_eq, unsigned n_ineq)
1291 struct isl_basic_map *ext;
1301 dims_ok = isl_space_is_equal(base->dim, dim) &&
1302 base->extra >= base->n_div + extra;
1304 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1305 room_for_ineq(base, n_ineq)) {
1306 isl_space_free(dim);
1310 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1311 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1312 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1313 extra += base->extra;
1315 n_ineq += base->n_ineq;
1317 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1323 ext->sample = isl_vec_copy(base->sample);
1324 flags = base->flags;
1325 ext = add_constraints(ext, base, 0, 0);
1328 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1334 isl_space_free(dim);
1335 isl_basic_map_free(base);
1339 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1340 __isl_take isl_space *dim, unsigned extra,
1341 unsigned n_eq, unsigned n_ineq)
1343 return (struct isl_basic_set *)
1344 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1345 extra, n_eq, n_ineq);
1348 struct isl_basic_map *isl_basic_map_extend_constraints(
1349 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1353 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1357 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1358 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1359 unsigned n_eq, unsigned n_ineq)
1361 struct isl_basic_map *bmap;
1366 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1370 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1373 isl_basic_map_free(base);
1377 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1378 unsigned nparam, unsigned dim, unsigned extra,
1379 unsigned n_eq, unsigned n_ineq)
1381 return (struct isl_basic_set *)
1382 isl_basic_map_extend((struct isl_basic_map *)base,
1383 nparam, 0, dim, extra, n_eq, n_ineq);
1386 struct isl_basic_set *isl_basic_set_extend_constraints(
1387 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1389 return (struct isl_basic_set *)
1390 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1394 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1396 return (struct isl_basic_set *)
1397 isl_basic_map_cow((struct isl_basic_map *)bset);
1400 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1405 if (bmap->ref > 1) {
1407 bmap = isl_basic_map_dup(bmap);
1410 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1414 struct isl_set *isl_set_cow(struct isl_set *set)
1422 return isl_set_dup(set);
1425 struct isl_map *isl_map_cow(struct isl_map *map)
1433 return isl_map_dup(map);
1436 static void swap_vars(struct isl_blk blk, isl_int *a,
1437 unsigned a_len, unsigned b_len)
1439 isl_seq_cpy(blk.data, a+a_len, b_len);
1440 isl_seq_cpy(blk.data+b_len, a, a_len);
1441 isl_seq_cpy(a, blk.data, b_len+a_len);
1444 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1445 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1453 isl_assert(bmap->ctx,
1454 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1456 if (n1 == 0 || n2 == 0)
1459 bmap = isl_basic_map_cow(bmap);
1463 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1464 if (isl_blk_is_error(blk))
1467 for (i = 0; i < bmap->n_eq; ++i)
1469 bmap->eq[i] + pos, n1, n2);
1471 for (i = 0; i < bmap->n_ineq; ++i)
1473 bmap->ineq[i] + pos, n1, n2);
1475 for (i = 0; i < bmap->n_div; ++i)
1477 bmap->div[i]+1 + pos, n1, n2);
1479 isl_blk_free(bmap->ctx, blk);
1481 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1482 bmap = isl_basic_map_gauss(bmap, NULL);
1483 return isl_basic_map_finalize(bmap);
1485 isl_basic_map_free(bmap);
1489 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1490 __isl_take isl_basic_set *bset, unsigned n)
1495 nparam = isl_basic_set_n_param(bset);
1496 dim = isl_basic_set_n_dim(bset);
1497 isl_assert(bset->ctx, n <= dim, goto error);
1499 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1501 isl_basic_set_free(bset);
1505 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1511 total = isl_basic_map_total_dim(bmap);
1512 isl_basic_map_free_div(bmap, bmap->n_div);
1513 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1515 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1517 i = isl_basic_map_alloc_equality(bmap);
1521 isl_int_set_si(bmap->eq[i][0], 1);
1522 isl_seq_clr(bmap->eq[i]+1, total);
1523 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1524 isl_vec_free(bmap->sample);
1525 bmap->sample = NULL;
1526 return isl_basic_map_finalize(bmap);
1528 isl_basic_map_free(bmap);
1532 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1534 return (struct isl_basic_set *)
1535 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1538 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1541 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1542 isl_int *t = bmap->div[a];
1543 bmap->div[a] = bmap->div[b];
1546 for (i = 0; i < bmap->n_eq; ++i)
1547 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1549 for (i = 0; i < bmap->n_ineq; ++i)
1550 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1552 for (i = 0; i < bmap->n_div; ++i)
1553 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1554 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1557 /* Eliminate the specified n dimensions starting at first from the
1558 * constraints using Fourier-Motzkin. The dimensions themselves
1561 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1562 enum isl_dim_type type, unsigned first, unsigned n)
1571 map = isl_map_cow(map);
1575 for (i = 0; i < map->n; ++i) {
1576 map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n);
1586 /* Eliminate the specified n dimensions starting at first from the
1587 * constraints using Fourier-Motzkin. The dimensions themselves
1590 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1591 enum isl_dim_type type, unsigned first, unsigned n)
1593 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1596 /* Eliminate the specified n dimensions starting at first from the
1597 * constraints using Fourier-Motzkin. The dimensions themselves
1600 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1601 unsigned first, unsigned n)
1603 return isl_set_eliminate(set, isl_dim_set, first, n);
1606 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1607 __isl_take isl_basic_map *bmap)
1611 bmap = isl_basic_map_eliminate_vars(bmap,
1612 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1616 return isl_basic_map_finalize(bmap);
1619 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1620 __isl_take isl_basic_set *bset)
1622 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1623 (struct isl_basic_map *)bset);
1626 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1635 map = isl_map_cow(map);
1639 for (i = 0; i < map->n; ++i) {
1640 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1650 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1652 return isl_map_remove_divs(set);
1655 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1656 enum isl_dim_type type, unsigned first, unsigned n)
1660 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1662 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1664 bmap = isl_basic_map_eliminate_vars(bmap,
1665 isl_basic_map_offset(bmap, type) - 1 + first, n);
1668 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1670 bmap = isl_basic_map_drop(bmap, type, first, n);
1673 isl_basic_map_free(bmap);
1677 /* Return true if the definition of the given div (recursively) involves
1678 * any of the given variables.
1680 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1681 unsigned first, unsigned n)
1684 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1686 if (isl_int_is_zero(bmap->div[div][0]))
1688 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1691 for (i = bmap->n_div - 1; i >= 0; --i) {
1692 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1694 if (div_involves_vars(bmap, i, first, n))
1701 /* Remove all divs (recursively) involving any of the given dimensions
1702 * in their definitions.
1704 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1705 __isl_take isl_basic_map *bmap,
1706 enum isl_dim_type type, unsigned first, unsigned n)
1712 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1714 first += isl_basic_map_offset(bmap, type);
1716 for (i = bmap->n_div - 1; i >= 0; --i) {
1717 if (!div_involves_vars(bmap, i, first, n))
1719 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1727 isl_basic_map_free(bmap);
1731 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1732 enum isl_dim_type type, unsigned first, unsigned n)
1741 map = isl_map_cow(map);
1745 for (i = 0; i < map->n; ++i) {
1746 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1757 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1758 enum isl_dim_type type, unsigned first, unsigned n)
1760 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1764 /* Does the desciption of "bmap" depend on the specified dimensions?
1765 * We also check whether the dimensions appear in any of the div definitions.
1766 * In principle there is no need for this check. If the dimensions appear
1767 * in a div definition, they also appear in the defining constraints of that
1770 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1771 enum isl_dim_type type, unsigned first, unsigned n)
1778 if (first + n > isl_basic_map_dim(bmap, type))
1779 isl_die(bmap->ctx, isl_error_invalid,
1780 "index out of bounds", return -1);
1782 first += isl_basic_map_offset(bmap, type);
1783 for (i = 0; i < bmap->n_eq; ++i)
1784 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1786 for (i = 0; i < bmap->n_ineq; ++i)
1787 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1789 for (i = 0; i < bmap->n_div; ++i) {
1790 if (isl_int_is_zero(bmap->div[i][0]))
1792 if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0)
1799 int isl_map_involves_dims(__isl_keep isl_map *map,
1800 enum isl_dim_type type, unsigned first, unsigned n)
1807 if (first + n > isl_map_dim(map, type))
1808 isl_die(map->ctx, isl_error_invalid,
1809 "index out of bounds", return -1);
1811 for (i = 0; i < map->n; ++i) {
1812 int involves = isl_basic_map_involves_dims(map->p[i],
1814 if (involves < 0 || involves)
1821 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1822 enum isl_dim_type type, unsigned first, unsigned n)
1824 return isl_basic_map_involves_dims(bset, type, first, n);
1827 int isl_set_involves_dims(__isl_keep isl_set *set,
1828 enum isl_dim_type type, unsigned first, unsigned n)
1830 return isl_map_involves_dims(set, type, first, n);
1833 /* Return true if the definition of the given div is unknown or depends
1836 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1839 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1841 if (isl_int_is_zero(bmap->div[div][0]))
1844 for (i = bmap->n_div - 1; i >= 0; --i) {
1845 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1847 if (div_is_unknown(bmap, i))
1854 /* Remove all divs that are unknown or defined in terms of unknown divs.
1856 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1857 __isl_take isl_basic_map *bmap)
1864 for (i = bmap->n_div - 1; i >= 0; --i) {
1865 if (!div_is_unknown(bmap, i))
1867 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1876 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1885 map = isl_map_cow(map);
1889 for (i = 0; i < map->n; ++i) {
1890 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1900 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1902 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1905 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1906 __isl_take isl_basic_set *bset,
1907 enum isl_dim_type type, unsigned first, unsigned n)
1909 return (isl_basic_set *)
1910 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1913 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1914 enum isl_dim_type type, unsigned first, unsigned n)
1921 map = isl_map_cow(map);
1924 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1926 for (i = 0; i < map->n; ++i) {
1927 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1928 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1932 map = isl_map_drop(map, type, first, n);
1939 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1940 enum isl_dim_type type, unsigned first, unsigned n)
1942 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1945 /* Project out n inputs starting at first using Fourier-Motzkin */
1946 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1947 unsigned first, unsigned n)
1949 return isl_map_remove_dims(map, isl_dim_in, first, n);
1952 static void dump_term(struct isl_basic_map *bmap,
1953 isl_int c, int pos, FILE *out)
1956 unsigned in = isl_basic_map_n_in(bmap);
1957 unsigned dim = in + isl_basic_map_n_out(bmap);
1958 unsigned nparam = isl_basic_map_n_param(bmap);
1960 isl_int_print(out, c, 0);
1962 if (!isl_int_is_one(c))
1963 isl_int_print(out, c, 0);
1964 if (pos < 1 + nparam) {
1965 name = isl_space_get_dim_name(bmap->dim,
1966 isl_dim_param, pos - 1);
1968 fprintf(out, "%s", name);
1970 fprintf(out, "p%d", pos - 1);
1971 } else if (pos < 1 + nparam + in)
1972 fprintf(out, "i%d", pos - 1 - nparam);
1973 else if (pos < 1 + nparam + dim)
1974 fprintf(out, "o%d", pos - 1 - nparam - in);
1976 fprintf(out, "e%d", pos - 1 - nparam - dim);
1980 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1981 int sign, FILE *out)
1985 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1989 for (i = 0, first = 1; i < len; ++i) {
1990 if (isl_int_sgn(c[i]) * sign <= 0)
1993 fprintf(out, " + ");
1995 isl_int_abs(v, c[i]);
1996 dump_term(bmap, v, i, out);
2003 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2004 const char *op, FILE *out, int indent)
2008 fprintf(out, "%*s", indent, "");
2010 dump_constraint_sign(bmap, c, 1, out);
2011 fprintf(out, " %s ", op);
2012 dump_constraint_sign(bmap, c, -1, out);
2016 for (i = bmap->n_div; i < bmap->extra; ++i) {
2017 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2019 fprintf(out, "%*s", indent, "");
2020 fprintf(out, "ERROR: unused div coefficient not zero\n");
2025 static void dump_constraints(struct isl_basic_map *bmap,
2026 isl_int **c, unsigned n,
2027 const char *op, FILE *out, int indent)
2031 for (i = 0; i < n; ++i)
2032 dump_constraint(bmap, c[i], op, out, indent);
2035 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2039 unsigned total = isl_basic_map_total_dim(bmap);
2041 for (j = 0; j < 1 + total; ++j) {
2042 if (isl_int_is_zero(exp[j]))
2044 if (!first && isl_int_is_pos(exp[j]))
2046 dump_term(bmap, exp[j], j, out);
2051 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2055 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2056 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2058 for (i = 0; i < bmap->n_div; ++i) {
2059 fprintf(out, "%*s", indent, "");
2060 fprintf(out, "e%d = [(", i);
2061 dump_affine(bmap, bmap->div[i]+1, out);
2063 isl_int_print(out, bmap->div[i][0], 0);
2064 fprintf(out, "]\n");
2068 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2069 FILE *out, int indent)
2072 fprintf(out, "null basic set\n");
2076 fprintf(out, "%*s", indent, "");
2077 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2078 bset->ref, bset->dim->nparam, bset->dim->n_out,
2079 bset->extra, bset->flags);
2080 dump((struct isl_basic_map *)bset, out, indent);
2083 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2084 FILE *out, int indent)
2087 fprintf(out, "null basic map\n");
2091 fprintf(out, "%*s", indent, "");
2092 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2093 "flags: %x, n_name: %d\n",
2095 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2096 bmap->extra, bmap->flags, bmap->dim->n_id);
2097 dump(bmap, out, indent);
2100 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2105 total = isl_basic_map_total_dim(bmap);
2106 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2107 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2108 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2109 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2113 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2116 struct isl_set *set;
2120 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2121 isl_assert(dim->ctx, n >= 0, goto error);
2122 set = isl_alloc(dim->ctx, struct isl_set,
2123 sizeof(struct isl_set) +
2124 (n - 1) * sizeof(struct isl_basic_set *));
2128 set->ctx = dim->ctx;
2129 isl_ctx_ref(set->ctx);
2137 isl_space_free(dim);
2141 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2142 unsigned nparam, unsigned dim, int n, unsigned flags)
2144 struct isl_set *set;
2147 dims = isl_space_alloc(ctx, nparam, 0, dim);
2151 set = isl_set_alloc_space(dims, n, flags);
2155 /* Make sure "map" has room for at least "n" more basic maps.
2157 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2160 struct isl_map *grown = NULL;
2164 isl_assert(map->ctx, n >= 0, goto error);
2165 if (map->n + n <= map->size)
2167 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2170 for (i = 0; i < map->n; ++i) {
2171 grown->p[i] = isl_basic_map_copy(map->p[i]);
2179 isl_map_free(grown);
2184 /* Make sure "set" has room for at least "n" more basic sets.
2186 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2188 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2191 struct isl_set *isl_set_dup(struct isl_set *set)
2194 struct isl_set *dup;
2199 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2202 for (i = 0; i < set->n; ++i)
2203 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2207 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2209 return isl_map_from_basic_map(bset);
2212 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2214 struct isl_map *map;
2219 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2220 return isl_map_add_basic_map(map, bmap);
2223 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2224 __isl_take isl_basic_set *bset)
2226 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2227 (struct isl_basic_map *)bset);
2230 void isl_set_free(struct isl_set *set)
2240 isl_ctx_deref(set->ctx);
2241 for (i = 0; i < set->n; ++i)
2242 isl_basic_set_free(set->p[i]);
2243 isl_space_free(set->dim);
2247 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2252 fprintf(out, "null set\n");
2256 fprintf(out, "%*s", indent, "");
2257 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2258 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2260 for (i = 0; i < set->n; ++i) {
2261 fprintf(out, "%*s", indent, "");
2262 fprintf(out, "basic set %d:\n", i);
2263 isl_basic_set_print_internal(set->p[i], out, indent+4);
2267 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2272 fprintf(out, "null map\n");
2276 fprintf(out, "%*s", indent, "");
2277 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2278 "flags: %x, n_name: %d\n",
2279 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2280 map->dim->n_out, map->flags, map->dim->n_id);
2281 for (i = 0; i < map->n; ++i) {
2282 fprintf(out, "%*s", indent, "");
2283 fprintf(out, "basic map %d:\n", i);
2284 isl_basic_map_print_internal(map->p[i], out, indent+4);
2288 struct isl_basic_map *isl_basic_map_intersect_domain(
2289 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2291 struct isl_basic_map *bmap_domain;
2296 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2297 bset->dim, isl_dim_param), goto error);
2299 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2300 isl_assert(bset->ctx,
2301 isl_basic_map_compatible_domain(bmap, bset), goto error);
2303 bmap = isl_basic_map_cow(bmap);
2306 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2307 bset->n_div, bset->n_eq, bset->n_ineq);
2308 bmap_domain = isl_basic_map_from_domain(bset);
2309 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2311 bmap = isl_basic_map_simplify(bmap);
2312 return isl_basic_map_finalize(bmap);
2314 isl_basic_map_free(bmap);
2315 isl_basic_set_free(bset);
2319 struct isl_basic_map *isl_basic_map_intersect_range(
2320 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2322 struct isl_basic_map *bmap_range;
2327 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2328 bset->dim, isl_dim_param), goto error);
2330 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2331 isl_assert(bset->ctx,
2332 isl_basic_map_compatible_range(bmap, bset), goto error);
2334 if (isl_basic_set_is_universe(bset)) {
2335 isl_basic_set_free(bset);
2339 bmap = isl_basic_map_cow(bmap);
2342 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2343 bset->n_div, bset->n_eq, bset->n_ineq);
2344 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2345 bmap = add_constraints(bmap, bmap_range, 0, 0);
2347 bmap = isl_basic_map_simplify(bmap);
2348 return isl_basic_map_finalize(bmap);
2350 isl_basic_map_free(bmap);
2351 isl_basic_set_free(bset);
2355 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2361 total = 1 + isl_basic_map_total_dim(bmap);
2362 if (total != vec->size)
2367 for (i = 0; i < bmap->n_eq; ++i) {
2368 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2369 if (!isl_int_is_zero(s)) {
2375 for (i = 0; i < bmap->n_ineq; ++i) {
2376 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2377 if (isl_int_is_neg(s)) {
2388 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2390 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2393 struct isl_basic_map *isl_basic_map_intersect(
2394 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2396 struct isl_vec *sample = NULL;
2398 if (!bmap1 || !bmap2)
2401 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2402 bmap2->dim, isl_dim_param), goto error);
2403 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2404 isl_space_dim(bmap1->dim, isl_dim_param) &&
2405 isl_space_dim(bmap2->dim, isl_dim_all) !=
2406 isl_space_dim(bmap2->dim, isl_dim_param))
2407 return isl_basic_map_intersect(bmap2, bmap1);
2409 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2410 isl_space_dim(bmap2->dim, isl_dim_param))
2411 isl_assert(bmap1->ctx,
2412 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2414 if (bmap1->sample &&
2415 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2416 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2417 sample = isl_vec_copy(bmap1->sample);
2418 else if (bmap2->sample &&
2419 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2420 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2421 sample = isl_vec_copy(bmap2->sample);
2423 bmap1 = isl_basic_map_cow(bmap1);
2426 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2427 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2428 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2431 isl_vec_free(sample);
2433 isl_vec_free(bmap1->sample);
2434 bmap1->sample = sample;
2437 bmap1 = isl_basic_map_simplify(bmap1);
2438 return isl_basic_map_finalize(bmap1);
2441 isl_vec_free(sample);
2442 isl_basic_map_free(bmap1);
2443 isl_basic_map_free(bmap2);
2447 struct isl_basic_set *isl_basic_set_intersect(
2448 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2450 return (struct isl_basic_set *)
2451 isl_basic_map_intersect(
2452 (struct isl_basic_map *)bset1,
2453 (struct isl_basic_map *)bset2);
2456 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2457 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2459 return isl_basic_set_intersect(bset1, bset2);
2462 /* Special case of isl_map_intersect, where both map1 and map2
2463 * are convex, without any divs and such that either map1 or map2
2464 * contains a single constraint. This constraint is then simply
2465 * added to the other map.
2467 static __isl_give isl_map *map_intersect_add_constraint(
2468 __isl_take isl_map *map1, __isl_take isl_map *map2)
2470 isl_assert(map1->ctx, map1->n == 1, goto error);
2471 isl_assert(map2->ctx, map1->n == 1, goto error);
2472 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2473 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2475 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2476 return isl_map_intersect(map2, map1);
2478 isl_assert(map2->ctx,
2479 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2481 map1 = isl_map_cow(map1);
2484 if (isl_map_plain_is_empty(map1)) {
2488 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2489 if (map2->p[0]->n_eq == 1)
2490 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2492 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2493 map2->p[0]->ineq[0]);
2495 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2496 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2500 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2501 isl_basic_map_free(map1->p[0]);
2514 /* map2 may be either a parameter domain or a map living in the same
2517 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2518 __isl_take isl_map *map2)
2521 struct isl_map *result;
2527 if (isl_map_plain_is_empty(map1) &&
2528 isl_space_is_equal(map1->dim, map2->dim)) {
2532 if (isl_map_plain_is_empty(map2) &&
2533 isl_space_is_equal(map1->dim, map2->dim)) {
2538 if (map1->n == 1 && map2->n == 1 &&
2539 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2540 isl_space_is_equal(map1->dim, map2->dim) &&
2541 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2542 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2543 return map_intersect_add_constraint(map1, map2);
2545 if (isl_space_dim(map2->dim, isl_dim_all) !=
2546 isl_space_dim(map2->dim, isl_dim_param))
2547 isl_assert(map1->ctx,
2548 isl_space_is_equal(map1->dim, map2->dim), goto error);
2550 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2551 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2552 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2554 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2555 map1->n * map2->n, flags);
2558 for (i = 0; i < map1->n; ++i)
2559 for (j = 0; j < map2->n; ++j) {
2560 struct isl_basic_map *part;
2561 part = isl_basic_map_intersect(
2562 isl_basic_map_copy(map1->p[i]),
2563 isl_basic_map_copy(map2->p[j]));
2564 if (isl_basic_map_is_empty(part))
2565 isl_basic_map_free(part);
2567 result = isl_map_add_basic_map(result, part);
2580 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2581 __isl_take isl_map *map2)
2585 if (!isl_space_is_equal(map1->dim, map2->dim))
2586 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
2587 "spaces don't match", goto error);
2588 return map_intersect_internal(map1, map2);
2595 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2596 __isl_take isl_map *map2)
2598 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2601 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2603 return (struct isl_set *)
2604 isl_map_intersect((struct isl_map *)set1,
2605 (struct isl_map *)set2);
2608 /* map_intersect_internal accepts intersections
2609 * with parameter domains, so we can just call that function.
2611 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2612 __isl_take isl_set *params)
2614 return map_intersect_internal(map, params);
2617 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2618 __isl_take isl_map *map2)
2620 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2623 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2624 __isl_take isl_set *params)
2626 return isl_map_intersect_params(set, params);
2629 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2632 struct isl_basic_set *bset;
2637 bmap = isl_basic_map_cow(bmap);
2640 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2641 in = isl_basic_map_n_in(bmap);
2642 bset = isl_basic_set_from_basic_map(bmap);
2643 bset = isl_basic_set_swap_vars(bset, in);
2644 return isl_basic_map_from_basic_set(bset, dim);
2647 static __isl_give isl_basic_map *basic_map_space_reset(
2648 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2652 if (!isl_space_is_named_or_nested(bmap->dim, type))
2655 space = isl_basic_map_get_space(bmap);
2656 space = isl_space_reset(space, type);
2657 bmap = isl_basic_map_reset_space(bmap, space);
2661 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2662 enum isl_dim_type type, unsigned pos, unsigned n)
2665 struct isl_basic_map *res;
2666 struct isl_dim_map *dim_map;
2667 unsigned total, off;
2668 enum isl_dim_type t;
2671 return basic_map_space_reset(bmap, type);
2676 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2678 total = isl_basic_map_total_dim(bmap) + n;
2679 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2681 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2683 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2685 unsigned size = isl_basic_map_dim(bmap, t);
2686 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2688 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2689 pos, size - pos, off + pos + n);
2691 off += isl_space_dim(res_dim, t);
2693 isl_dim_map_div(dim_map, bmap, off);
2695 res = isl_basic_map_alloc_space(res_dim,
2696 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2697 if (isl_basic_map_is_rational(bmap))
2698 res = isl_basic_map_set_rational(res);
2699 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2700 return isl_basic_map_finalize(res);
2703 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2704 enum isl_dim_type type, unsigned n)
2708 return isl_basic_map_insert(bmap, type,
2709 isl_basic_map_dim(bmap, type), n);
2712 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2713 enum isl_dim_type type, unsigned n)
2717 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2718 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2720 isl_basic_set_free(bset);
2724 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2725 enum isl_dim_type type)
2729 if (!map || !isl_space_is_named_or_nested(map->dim, type))
2732 space = isl_map_get_space(map);
2733 space = isl_space_reset(space, type);
2734 map = isl_map_reset_space(map, space);
2738 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2739 enum isl_dim_type type, unsigned pos, unsigned n)
2744 return map_space_reset(map, type);
2746 map = isl_map_cow(map);
2750 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
2754 for (i = 0; i < map->n; ++i) {
2755 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2766 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2767 enum isl_dim_type type, unsigned pos, unsigned n)
2769 return isl_map_insert_dims(set, type, pos, n);
2772 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2773 enum isl_dim_type type, unsigned n)
2777 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2780 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2781 enum isl_dim_type type, unsigned n)
2785 isl_assert(set->ctx, type != isl_dim_in, goto error);
2786 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2792 __isl_give isl_basic_map *isl_basic_map_move_dims(
2793 __isl_take isl_basic_map *bmap,
2794 enum isl_dim_type dst_type, unsigned dst_pos,
2795 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2797 struct isl_dim_map *dim_map;
2798 struct isl_basic_map *res;
2799 enum isl_dim_type t;
2800 unsigned total, off;
2807 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2810 if (dst_type == src_type && dst_pos == src_pos)
2813 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2815 if (pos(bmap->dim, dst_type) + dst_pos ==
2816 pos(bmap->dim, src_type) + src_pos +
2817 ((src_type < dst_type) ? n : 0)) {
2818 bmap = isl_basic_map_cow(bmap);
2822 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2823 src_type, src_pos, n);
2827 bmap = isl_basic_map_finalize(bmap);
2832 total = isl_basic_map_total_dim(bmap);
2833 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2836 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2837 unsigned size = isl_space_dim(bmap->dim, t);
2838 if (t == dst_type) {
2839 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2842 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2845 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2846 dst_pos, size - dst_pos, off);
2847 off += size - dst_pos;
2848 } else if (t == src_type) {
2849 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2852 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2853 src_pos + n, size - src_pos - n, off);
2854 off += size - src_pos - n;
2856 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2860 isl_dim_map_div(dim_map, bmap, off);
2862 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2863 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2864 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2866 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2867 src_type, src_pos, n);
2871 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2872 bmap = isl_basic_map_gauss(bmap, NULL);
2873 bmap = isl_basic_map_finalize(bmap);
2877 isl_basic_map_free(bmap);
2881 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2882 enum isl_dim_type dst_type, unsigned dst_pos,
2883 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2885 return (isl_basic_set *)isl_basic_map_move_dims(
2886 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2889 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2890 enum isl_dim_type dst_type, unsigned dst_pos,
2891 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2895 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2896 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2897 src_type, src_pos, n);
2903 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2904 enum isl_dim_type dst_type, unsigned dst_pos,
2905 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2914 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2917 if (dst_type == src_type && dst_pos == src_pos)
2920 isl_assert(map->ctx, dst_type != src_type, goto error);
2922 map = isl_map_cow(map);
2926 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2930 for (i = 0; i < map->n; ++i) {
2931 map->p[i] = isl_basic_map_move_dims(map->p[i],
2933 src_type, src_pos, n);
2944 /* Move the specified dimensions to the last columns right before
2945 * the divs. Don't change the dimension specification of bmap.
2946 * That's the responsibility of the caller.
2948 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2949 enum isl_dim_type type, unsigned first, unsigned n)
2951 struct isl_dim_map *dim_map;
2952 struct isl_basic_map *res;
2953 enum isl_dim_type t;
2954 unsigned total, off;
2958 if (pos(bmap->dim, type) + first + n ==
2959 1 + isl_space_dim(bmap->dim, isl_dim_all))
2962 total = isl_basic_map_total_dim(bmap);
2963 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2966 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2967 unsigned size = isl_space_dim(bmap->dim, t);
2969 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2972 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2973 first, n, total - bmap->n_div - n);
2974 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2975 first + n, size - (first + n), off);
2976 off += size - (first + n);
2978 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2982 isl_dim_map_div(dim_map, bmap, off + n);
2984 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2985 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2986 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2990 /* Turn the n dimensions of type type, starting at first
2991 * into existentially quantified variables.
2993 __isl_give isl_basic_map *isl_basic_map_project_out(
2994 __isl_take isl_basic_map *bmap,
2995 enum isl_dim_type type, unsigned first, unsigned n)
3003 return basic_map_space_reset(bmap, type);
3008 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3009 return isl_basic_map_remove_dims(bmap, type, first, n);
3011 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3014 bmap = move_last(bmap, type, first, n);
3015 bmap = isl_basic_map_cow(bmap);
3019 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3020 old = bmap->block2.data;
3021 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3022 (bmap->extra + n) * (1 + row_size));
3023 if (!bmap->block2.data)
3025 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3028 for (i = 0; i < n; ++i) {
3029 new_div[i] = bmap->block2.data +
3030 (bmap->extra + i) * (1 + row_size);
3031 isl_seq_clr(new_div[i], 1 + row_size);
3033 for (i = 0; i < bmap->extra; ++i)
3034 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3036 bmap->div = new_div;
3040 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3043 bmap = isl_basic_map_simplify(bmap);
3044 bmap = isl_basic_map_drop_redundant_divs(bmap);
3045 return isl_basic_map_finalize(bmap);
3047 isl_basic_map_free(bmap);
3051 /* Turn the n dimensions of type type, starting at first
3052 * into existentially quantified variables.
3054 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3055 enum isl_dim_type type, unsigned first, unsigned n)
3057 return (isl_basic_set *)isl_basic_map_project_out(
3058 (isl_basic_map *)bset, type, first, n);
3061 /* Turn the n dimensions of type type, starting at first
3062 * into existentially quantified variables.
3064 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3065 enum isl_dim_type type, unsigned first, unsigned n)
3073 return map_space_reset(map, type);
3075 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3077 map = isl_map_cow(map);
3081 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3085 for (i = 0; i < map->n; ++i) {
3086 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3097 /* Turn the n dimensions of type type, starting at first
3098 * into existentially quantified variables.
3100 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3101 enum isl_dim_type type, unsigned first, unsigned n)
3103 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3106 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3110 for (i = 0; i < n; ++i) {
3111 j = isl_basic_map_alloc_div(bmap);
3114 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3118 isl_basic_map_free(bmap);
3122 struct isl_basic_map *isl_basic_map_apply_range(
3123 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3125 isl_space *dim_result = NULL;
3126 struct isl_basic_map *bmap;
3127 unsigned n_in, n_out, n, nparam, total, pos;
3128 struct isl_dim_map *dim_map1, *dim_map2;
3130 if (!bmap1 || !bmap2)
3133 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3134 isl_space_copy(bmap2->dim));
3136 n_in = isl_basic_map_n_in(bmap1);
3137 n_out = isl_basic_map_n_out(bmap2);
3138 n = isl_basic_map_n_out(bmap1);
3139 nparam = isl_basic_map_n_param(bmap1);
3141 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3142 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3143 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3144 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3145 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3146 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3147 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3148 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3149 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3150 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3151 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3153 bmap = isl_basic_map_alloc_space(dim_result,
3154 bmap1->n_div + bmap2->n_div + n,
3155 bmap1->n_eq + bmap2->n_eq,
3156 bmap1->n_ineq + bmap2->n_ineq);
3157 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3158 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3159 bmap = add_divs(bmap, n);
3160 bmap = isl_basic_map_simplify(bmap);
3161 bmap = isl_basic_map_drop_redundant_divs(bmap);
3162 return isl_basic_map_finalize(bmap);
3164 isl_basic_map_free(bmap1);
3165 isl_basic_map_free(bmap2);
3169 struct isl_basic_set *isl_basic_set_apply(
3170 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3175 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3178 return (struct isl_basic_set *)
3179 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3181 isl_basic_set_free(bset);
3182 isl_basic_map_free(bmap);
3186 struct isl_basic_map *isl_basic_map_apply_domain(
3187 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3189 if (!bmap1 || !bmap2)
3192 isl_assert(bmap1->ctx,
3193 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3194 isl_assert(bmap1->ctx,
3195 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3198 bmap1 = isl_basic_map_reverse(bmap1);
3199 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3200 return isl_basic_map_reverse(bmap1);
3202 isl_basic_map_free(bmap1);
3203 isl_basic_map_free(bmap2);
3207 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3208 * A \cap B -> f(A) + f(B)
3210 struct isl_basic_map *isl_basic_map_sum(
3211 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3213 unsigned n_in, n_out, nparam, total, pos;
3214 struct isl_basic_map *bmap = NULL;
3215 struct isl_dim_map *dim_map1, *dim_map2;
3218 if (!bmap1 || !bmap2)
3221 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3224 nparam = isl_basic_map_n_param(bmap1);
3225 n_in = isl_basic_map_n_in(bmap1);
3226 n_out = isl_basic_map_n_out(bmap1);
3228 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3229 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3230 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3231 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3232 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3233 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3234 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3235 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3236 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3237 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3238 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3240 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3241 bmap1->n_div + bmap2->n_div + 2 * n_out,
3242 bmap1->n_eq + bmap2->n_eq + n_out,
3243 bmap1->n_ineq + bmap2->n_ineq);
3244 for (i = 0; i < n_out; ++i) {
3245 int j = isl_basic_map_alloc_equality(bmap);
3248 isl_seq_clr(bmap->eq[j], 1+total);
3249 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3250 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3251 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3253 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3254 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3255 bmap = add_divs(bmap, 2 * n_out);
3257 bmap = isl_basic_map_simplify(bmap);
3258 return isl_basic_map_finalize(bmap);
3260 isl_basic_map_free(bmap);
3261 isl_basic_map_free(bmap1);
3262 isl_basic_map_free(bmap2);
3266 /* Given two maps A -> f(A) and B -> g(B), construct a map
3267 * A \cap B -> f(A) + f(B)
3269 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3271 struct isl_map *result;
3277 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3279 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3280 map1->n * map2->n, 0);
3283 for (i = 0; i < map1->n; ++i)
3284 for (j = 0; j < map2->n; ++j) {
3285 struct isl_basic_map *part;
3286 part = isl_basic_map_sum(
3287 isl_basic_map_copy(map1->p[i]),
3288 isl_basic_map_copy(map2->p[j]));
3289 if (isl_basic_map_is_empty(part))
3290 isl_basic_map_free(part);
3292 result = isl_map_add_basic_map(result, part);
3305 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3306 __isl_take isl_set *set2)
3308 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3311 /* Given a basic map A -> f(A), construct A -> -f(A).
3313 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3318 bmap = isl_basic_map_cow(bmap);
3322 n = isl_basic_map_dim(bmap, isl_dim_out);
3323 off = isl_basic_map_offset(bmap, isl_dim_out);
3324 for (i = 0; i < bmap->n_eq; ++i)
3325 for (j = 0; j < n; ++j)
3326 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3327 for (i = 0; i < bmap->n_ineq; ++i)
3328 for (j = 0; j < n; ++j)
3329 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3330 for (i = 0; i < bmap->n_div; ++i)
3331 for (j = 0; j < n; ++j)
3332 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3333 bmap = isl_basic_map_gauss(bmap, NULL);
3334 return isl_basic_map_finalize(bmap);
3337 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3339 return isl_basic_map_neg(bset);
3342 /* Given a map A -> f(A), construct A -> -f(A).
3344 struct isl_map *isl_map_neg(struct isl_map *map)
3348 map = isl_map_cow(map);
3352 for (i = 0; i < map->n; ++i) {
3353 map->p[i] = isl_basic_map_neg(map->p[i]);
3364 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3366 return (isl_set *)isl_map_neg((isl_map *)set);
3369 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3370 * A -> floor(f(A)/d).
3372 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3375 unsigned n_in, n_out, nparam, total, pos;
3376 struct isl_basic_map *result = NULL;
3377 struct isl_dim_map *dim_map;
3383 nparam = isl_basic_map_n_param(bmap);
3384 n_in = isl_basic_map_n_in(bmap);
3385 n_out = isl_basic_map_n_out(bmap);
3387 total = nparam + n_in + n_out + bmap->n_div + n_out;
3388 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3389 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3390 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3391 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3392 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3394 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3395 bmap->n_div + n_out,
3396 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3397 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3398 result = add_divs(result, n_out);
3399 for (i = 0; i < n_out; ++i) {
3401 j = isl_basic_map_alloc_inequality(result);
3404 isl_seq_clr(result->ineq[j], 1+total);
3405 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3406 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3407 j = isl_basic_map_alloc_inequality(result);
3410 isl_seq_clr(result->ineq[j], 1+total);
3411 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3412 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3413 isl_int_sub_ui(result->ineq[j][0], d, 1);
3416 result = isl_basic_map_simplify(result);
3417 return isl_basic_map_finalize(result);
3419 isl_basic_map_free(result);
3423 /* Given a map A -> f(A) and an integer d, construct a map
3424 * A -> floor(f(A)/d).
3426 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3430 map = isl_map_cow(map);
3434 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3435 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3436 for (i = 0; i < map->n; ++i) {
3437 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3448 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3454 i = isl_basic_map_alloc_equality(bmap);
3457 nparam = isl_basic_map_n_param(bmap);
3458 n_in = isl_basic_map_n_in(bmap);
3459 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3460 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3461 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3462 return isl_basic_map_finalize(bmap);
3464 isl_basic_map_free(bmap);
3468 /* Add a constraints to "bmap" expressing i_pos < o_pos
3470 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3476 i = isl_basic_map_alloc_inequality(bmap);
3479 nparam = isl_basic_map_n_param(bmap);
3480 n_in = isl_basic_map_n_in(bmap);
3481 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3482 isl_int_set_si(bmap->ineq[i][0], -1);
3483 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3484 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3485 return isl_basic_map_finalize(bmap);
3487 isl_basic_map_free(bmap);
3491 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3493 static __isl_give isl_basic_map *var_less_or_equal(
3494 __isl_take isl_basic_map *bmap, unsigned pos)
3500 i = isl_basic_map_alloc_inequality(bmap);
3503 nparam = isl_basic_map_n_param(bmap);
3504 n_in = isl_basic_map_n_in(bmap);
3505 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3506 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3507 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3508 return isl_basic_map_finalize(bmap);
3510 isl_basic_map_free(bmap);
3514 /* Add a constraints to "bmap" expressing i_pos > o_pos
3516 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3522 i = isl_basic_map_alloc_inequality(bmap);
3525 nparam = isl_basic_map_n_param(bmap);
3526 n_in = isl_basic_map_n_in(bmap);
3527 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3528 isl_int_set_si(bmap->ineq[i][0], -1);
3529 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3530 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3531 return isl_basic_map_finalize(bmap);
3533 isl_basic_map_free(bmap);
3537 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3539 static __isl_give isl_basic_map *var_more_or_equal(
3540 __isl_take isl_basic_map *bmap, unsigned pos)
3546 i = isl_basic_map_alloc_inequality(bmap);
3549 nparam = isl_basic_map_n_param(bmap);
3550 n_in = isl_basic_map_n_in(bmap);
3551 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3552 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3553 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3554 return isl_basic_map_finalize(bmap);
3556 isl_basic_map_free(bmap);
3560 __isl_give isl_basic_map *isl_basic_map_equal(
3561 __isl_take isl_space *dim, unsigned n_equal)
3564 struct isl_basic_map *bmap;
3565 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3568 for (i = 0; i < n_equal && bmap; ++i)
3569 bmap = var_equal(bmap, i);
3570 return isl_basic_map_finalize(bmap);
3573 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3575 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3579 struct isl_basic_map *bmap;
3580 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3583 for (i = 0; i < pos && bmap; ++i)
3584 bmap = var_equal(bmap, i);
3586 bmap = var_less(bmap, pos);
3587 return isl_basic_map_finalize(bmap);
3590 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3592 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3593 __isl_take isl_space *dim, unsigned pos)
3596 isl_basic_map *bmap;
3598 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3599 for (i = 0; i < pos; ++i)
3600 bmap = var_equal(bmap, i);
3601 bmap = var_less_or_equal(bmap, pos);
3602 return isl_basic_map_finalize(bmap);
3605 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3607 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3611 struct isl_basic_map *bmap;
3612 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3615 for (i = 0; i < pos && bmap; ++i)
3616 bmap = var_equal(bmap, i);
3618 bmap = var_more(bmap, pos);
3619 return isl_basic_map_finalize(bmap);
3622 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3624 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3625 __isl_take isl_space *dim, unsigned pos)
3628 isl_basic_map *bmap;
3630 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3631 for (i = 0; i < pos; ++i)
3632 bmap = var_equal(bmap, i);
3633 bmap = var_more_or_equal(bmap, pos);
3634 return isl_basic_map_finalize(bmap);
3637 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3638 unsigned n, int equal)
3640 struct isl_map *map;
3643 if (n == 0 && equal)
3644 return isl_map_universe(dims);
3646 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3648 for (i = 0; i + 1 < n; ++i)
3649 map = isl_map_add_basic_map(map,
3650 isl_basic_map_less_at(isl_space_copy(dims), i));
3653 map = isl_map_add_basic_map(map,
3654 isl_basic_map_less_or_equal_at(dims, n - 1));
3656 map = isl_map_add_basic_map(map,
3657 isl_basic_map_less_at(dims, n - 1));
3659 isl_space_free(dims);
3664 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3668 return map_lex_lte_first(dims, dims->n_out, equal);
3671 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3673 return map_lex_lte_first(dim, n, 0);
3676 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3678 return map_lex_lte_first(dim, n, 1);
3681 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3683 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3686 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3688 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3691 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3692 unsigned n, int equal)
3694 struct isl_map *map;
3697 if (n == 0 && equal)
3698 return isl_map_universe(dims);
3700 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3702 for (i = 0; i + 1 < n; ++i)
3703 map = isl_map_add_basic_map(map,
3704 isl_basic_map_more_at(isl_space_copy(dims), i));
3707 map = isl_map_add_basic_map(map,
3708 isl_basic_map_more_or_equal_at(dims, n - 1));
3710 map = isl_map_add_basic_map(map,
3711 isl_basic_map_more_at(dims, n - 1));
3713 isl_space_free(dims);
3718 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3722 return map_lex_gte_first(dims, dims->n_out, equal);
3725 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3727 return map_lex_gte_first(dim, n, 0);
3730 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3732 return map_lex_gte_first(dim, n, 1);
3735 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
3737 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
3740 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
3742 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
3745 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3746 __isl_take isl_set *set2)
3749 map = isl_map_lex_le(isl_set_get_space(set1));
3750 map = isl_map_intersect_domain(map, set1);
3751 map = isl_map_intersect_range(map, set2);
3755 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3756 __isl_take isl_set *set2)
3759 map = isl_map_lex_lt(isl_set_get_space(set1));
3760 map = isl_map_intersect_domain(map, set1);
3761 map = isl_map_intersect_range(map, set2);
3765 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3766 __isl_take isl_set *set2)
3769 map = isl_map_lex_ge(isl_set_get_space(set1));
3770 map = isl_map_intersect_domain(map, set1);
3771 map = isl_map_intersect_range(map, set2);
3775 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3776 __isl_take isl_set *set2)
3779 map = isl_map_lex_gt(isl_set_get_space(set1));
3780 map = isl_map_intersect_domain(map, set1);
3781 map = isl_map_intersect_range(map, set2);
3785 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3786 __isl_take isl_map *map2)
3789 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
3790 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3791 map = isl_map_apply_range(map, isl_map_reverse(map2));
3795 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3796 __isl_take isl_map *map2)
3799 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
3800 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3801 map = isl_map_apply_range(map, isl_map_reverse(map2));
3805 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3806 __isl_take isl_map *map2)
3809 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
3810 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3811 map = isl_map_apply_range(map, isl_map_reverse(map2));
3815 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3816 __isl_take isl_map *map2)
3819 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
3820 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3821 map = isl_map_apply_range(map, isl_map_reverse(map2));
3825 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
3826 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
3828 struct isl_basic_map *bmap;
3830 bset = isl_basic_set_cow(bset);
3834 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
3835 isl_space_free(bset->dim);
3836 bmap = (struct isl_basic_map *) bset;
3838 return isl_basic_map_finalize(bmap);
3840 isl_basic_set_free(bset);
3841 isl_space_free(dim);
3845 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3849 if (bmap->dim->n_in == 0)
3850 return (struct isl_basic_set *)bmap;
3851 bmap = isl_basic_map_cow(bmap);
3854 bmap->dim = isl_space_as_set_space(bmap->dim);
3857 bmap = isl_basic_map_finalize(bmap);
3858 return (struct isl_basic_set *)bmap;
3860 isl_basic_map_free(bmap);
3864 /* For a div d = floor(f/m), add the constraints
3867 * -(f-(n-1)) + m d >= 0
3869 * Note that the second constraint is the negation of
3873 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3874 unsigned pos, isl_int *div)
3877 unsigned total = isl_basic_map_total_dim(bmap);
3879 i = isl_basic_map_alloc_inequality(bmap);
3882 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3883 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3885 j = isl_basic_map_alloc_inequality(bmap);
3888 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3889 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3890 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3894 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3895 unsigned pos, isl_int *div)
3897 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3901 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3903 unsigned total = isl_basic_map_total_dim(bmap);
3904 unsigned div_pos = total - bmap->n_div + div;
3906 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3910 struct isl_basic_set *isl_basic_map_underlying_set(
3911 struct isl_basic_map *bmap)
3915 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3917 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
3918 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
3919 return (struct isl_basic_set *)bmap;
3920 bmap = isl_basic_map_cow(bmap);
3923 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
3926 bmap->extra -= bmap->n_div;
3928 bmap = isl_basic_map_finalize(bmap);
3929 return (struct isl_basic_set *)bmap;
3934 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3935 __isl_take isl_basic_set *bset)
3937 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3940 struct isl_basic_map *isl_basic_map_overlying_set(
3941 struct isl_basic_set *bset, struct isl_basic_map *like)
3943 struct isl_basic_map *bmap;
3944 struct isl_ctx *ctx;
3951 isl_assert(ctx, bset->n_div == 0, goto error);
3952 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3953 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3955 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
3956 isl_basic_map_free(like);
3957 return (struct isl_basic_map *)bset;
3959 bset = isl_basic_set_cow(bset);
3962 total = bset->dim->n_out + bset->extra;
3963 bmap = (struct isl_basic_map *)bset;
3964 isl_space_free(bmap->dim);
3965 bmap->dim = isl_space_copy(like->dim);
3968 bmap->n_div = like->n_div;
3969 bmap->extra += like->n_div;
3973 ltotal = total - bmap->extra + like->extra;
3976 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3977 bmap->extra * (1 + 1 + total));
3978 if (isl_blk_is_error(bmap->block2))
3980 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3984 for (i = 0; i < bmap->extra; ++i)
3985 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3986 for (i = 0; i < like->n_div; ++i) {
3987 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3988 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3990 bmap = isl_basic_map_extend_constraints(bmap,
3991 0, 2 * like->n_div);
3992 for (i = 0; i < like->n_div; ++i) {
3993 if (isl_int_is_zero(bmap->div[i][0]))
3995 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3999 isl_basic_map_free(like);
4000 bmap = isl_basic_map_simplify(bmap);
4001 bmap = isl_basic_map_finalize(bmap);
4004 isl_basic_map_free(like);
4005 isl_basic_set_free(bset);
4009 struct isl_basic_set *isl_basic_set_from_underlying_set(
4010 struct isl_basic_set *bset, struct isl_basic_set *like)
4012 return (struct isl_basic_set *)
4013 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4016 struct isl_set *isl_set_from_underlying_set(
4017 struct isl_set *set, struct isl_basic_set *like)
4023 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4025 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4026 isl_basic_set_free(like);
4029 set = isl_set_cow(set);
4032 for (i = 0; i < set->n; ++i) {
4033 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4034 isl_basic_set_copy(like));
4038 isl_space_free(set->dim);
4039 set->dim = isl_space_copy(like->dim);
4042 isl_basic_set_free(like);
4045 isl_basic_set_free(like);
4050 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4054 map = isl_map_cow(map);
4057 map->dim = isl_space_cow(map->dim);
4061 for (i = 1; i < map->n; ++i)
4062 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4064 for (i = 0; i < map->n; ++i) {
4065 map->p[i] = (struct isl_basic_map *)
4066 isl_basic_map_underlying_set(map->p[i]);
4071 map->dim = isl_space_underlying(map->dim, 0);
4073 isl_space_free(map->dim);
4074 map->dim = isl_space_copy(map->p[0]->dim);
4078 return (struct isl_set *)map;
4084 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4086 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4089 __isl_give isl_basic_map *isl_basic_map_reset_space(
4090 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4092 bmap = isl_basic_map_cow(bmap);
4096 isl_space_free(bmap->dim);
4099 bmap = isl_basic_map_finalize(bmap);
4103 isl_basic_map_free(bmap);
4104 isl_space_free(dim);
4108 __isl_give isl_basic_set *isl_basic_set_reset_space(
4109 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4111 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4115 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4116 __isl_take isl_space *dim)
4120 map = isl_map_cow(map);
4124 for (i = 0; i < map->n; ++i) {
4125 map->p[i] = isl_basic_map_reset_space(map->p[i],
4126 isl_space_copy(dim));
4130 isl_space_free(map->dim);
4136 isl_space_free(dim);
4140 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4141 __isl_take isl_space *dim)
4143 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4146 /* Compute the parameter domain of the given basic set.
4148 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4153 if (isl_basic_set_is_params(bset))
4156 n = isl_basic_set_dim(bset, isl_dim_set);
4157 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4158 space = isl_basic_set_get_space(bset);
4159 space = isl_space_params(space);
4160 bset = isl_basic_set_reset_space(bset, space);
4164 /* Compute the parameter domain of the given set.
4166 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4171 if (isl_set_is_params(set))
4174 n = isl_set_dim(set, isl_dim_set);
4175 set = isl_set_project_out(set, isl_dim_set, 0, n);
4176 space = isl_set_get_space(set);
4177 space = isl_space_params(space);
4178 set = isl_set_reset_space(set, space);
4182 /* Construct a zero-dimensional set with the given parameter domain.
4184 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4187 space = isl_set_get_space(set);
4188 space = isl_space_set_from_params(space);
4189 set = isl_set_reset_space(set, space);
4193 /* Compute the parameter domain of the given map.
4195 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4200 n = isl_map_dim(map, isl_dim_in);
4201 map = isl_map_project_out(map, isl_dim_in, 0, n);
4202 n = isl_map_dim(map, isl_dim_out);
4203 map = isl_map_project_out(map, isl_dim_out, 0, n);
4204 space = isl_map_get_space(map);
4205 space = isl_space_params(space);
4206 map = isl_map_reset_space(map, space);
4210 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4213 struct isl_basic_set *domain;
4219 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4221 n_in = isl_basic_map_n_in(bmap);
4222 n_out = isl_basic_map_n_out(bmap);
4223 domain = isl_basic_set_from_basic_map(bmap);
4224 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4226 domain = isl_basic_set_reset_space(domain, dim);
4231 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4235 return isl_space_may_be_set(bmap->dim);
4238 /* Is this basic map actually a set?
4239 * Users should never call this function. Outside of isl,
4240 * the type should indicate whether something is a set or a map.
4242 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4246 return isl_space_is_set(bmap->dim);
4249 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4253 if (isl_basic_map_is_set(bmap))
4255 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4258 __isl_give isl_basic_map *isl_basic_map_domain_map(
4259 __isl_take isl_basic_map *bmap)
4263 isl_basic_map *domain;
4264 int nparam, n_in, n_out;
4267 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4268 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4269 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4271 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4272 domain = isl_basic_map_universe(dim);
4274 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4275 bmap = isl_basic_map_apply_range(bmap, domain);
4276 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4278 total = isl_basic_map_total_dim(bmap);
4280 for (i = 0; i < n_in; ++i) {
4281 k = isl_basic_map_alloc_equality(bmap);
4284 isl_seq_clr(bmap->eq[k], 1 + total);
4285 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4286 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4289 bmap = isl_basic_map_gauss(bmap, NULL);
4290 return isl_basic_map_finalize(bmap);
4292 isl_basic_map_free(bmap);
4296 __isl_give isl_basic_map *isl_basic_map_range_map(
4297 __isl_take isl_basic_map *bmap)
4301 isl_basic_map *range;
4302 int nparam, n_in, n_out;
4305 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4306 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4307 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4309 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4310 range = isl_basic_map_universe(dim);
4312 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4313 bmap = isl_basic_map_apply_range(bmap, range);
4314 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4316 total = isl_basic_map_total_dim(bmap);
4318 for (i = 0; i < n_out; ++i) {
4319 k = isl_basic_map_alloc_equality(bmap);
4322 isl_seq_clr(bmap->eq[k], 1 + total);
4323 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4324 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4327 bmap = isl_basic_map_gauss(bmap, NULL);
4328 return isl_basic_map_finalize(bmap);
4330 isl_basic_map_free(bmap);
4334 int isl_map_may_be_set(__isl_keep isl_map *map)
4338 return isl_space_may_be_set(map->dim);
4341 /* Is this map actually a set?
4342 * Users should never call this function. Outside of isl,
4343 * the type should indicate whether something is a set or a map.
4345 int isl_map_is_set(__isl_keep isl_map *map)
4349 return isl_space_is_set(map->dim);
4352 struct isl_set *isl_map_range(struct isl_map *map)
4355 struct isl_set *set;
4359 if (isl_map_is_set(map))
4360 return (isl_set *)map;
4362 map = isl_map_cow(map);
4366 set = (struct isl_set *) map;
4367 set->dim = isl_space_range(set->dim);
4370 for (i = 0; i < map->n; ++i) {
4371 set->p[i] = isl_basic_map_range(map->p[i]);
4375 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4376 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4383 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4386 isl_space *domain_dim;
4388 map = isl_map_cow(map);
4392 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4393 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4394 map->dim = isl_space_join(map->dim, domain_dim);
4397 for (i = 0; i < map->n; ++i) {
4398 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4402 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4403 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4410 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4413 isl_space *range_dim;
4415 map = isl_map_cow(map);
4419 range_dim = isl_space_range(isl_map_get_space(map));
4420 range_dim = isl_space_from_range(range_dim);
4421 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4422 map->dim = isl_space_join(map->dim, range_dim);
4425 for (i = 0; i < map->n; ++i) {
4426 map->p[i] = isl_basic_map_range_map(map->p[i]);
4430 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4431 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4438 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4439 __isl_take isl_space *dim)
4442 struct isl_map *map = NULL;
4444 set = isl_set_cow(set);
4447 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4448 map = (struct isl_map *)set;
4449 for (i = 0; i < set->n; ++i) {
4450 map->p[i] = isl_basic_map_from_basic_set(
4451 set->p[i], isl_space_copy(dim));
4455 isl_space_free(map->dim);
4459 isl_space_free(dim);
4464 __isl_give isl_basic_map *isl_basic_map_from_domain(
4465 __isl_take isl_basic_set *bset)
4467 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4470 __isl_give isl_basic_map *isl_basic_map_from_range(
4471 __isl_take isl_basic_set *bset)
4474 space = isl_basic_set_get_space(bset);
4475 space = isl_space_from_range(space);
4476 bset = isl_basic_set_reset_space(bset, space);
4477 return (isl_basic_map *)bset;
4480 struct isl_map *isl_map_from_range(struct isl_set *set)
4483 space = isl_set_get_space(set);
4484 space = isl_space_from_range(space);
4485 set = isl_set_reset_space(set, space);
4486 return (struct isl_map *)set;
4489 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4491 return isl_map_reverse(isl_map_from_range(set));
4494 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4495 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4497 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4500 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4501 __isl_take isl_set *range)
4503 return isl_map_apply_range(isl_map_reverse(domain), range);
4506 struct isl_set *isl_set_from_map(struct isl_map *map)
4509 struct isl_set *set = NULL;
4513 map = isl_map_cow(map);
4516 map->dim = isl_space_as_set_space(map->dim);
4519 set = (struct isl_set *)map;
4520 for (i = 0; i < map->n; ++i) {
4521 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4531 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4534 struct isl_map *map;
4539 isl_die(dim->ctx, isl_error_internal,
4540 "negative number of basic maps", goto error);
4541 map = isl_alloc(dim->ctx, struct isl_map,
4542 sizeof(struct isl_map) +
4543 (n - 1) * sizeof(struct isl_basic_map *));
4547 map->ctx = dim->ctx;
4548 isl_ctx_ref(map->ctx);
4556 isl_space_free(dim);
4560 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4561 unsigned nparam, unsigned in, unsigned out, int n,
4564 struct isl_map *map;
4567 dims = isl_space_alloc(ctx, nparam, in, out);
4571 map = isl_map_alloc_space(dims, n, flags);
4575 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4577 struct isl_basic_map *bmap;
4578 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4579 bmap = isl_basic_map_set_to_empty(bmap);
4583 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4585 struct isl_basic_set *bset;
4586 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4587 bset = isl_basic_set_set_to_empty(bset);
4591 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4593 struct isl_basic_map *bmap;
4596 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4597 bmap = isl_basic_map_set_to_empty(bmap);
4601 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4603 struct isl_basic_map *bmap;
4606 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4607 bmap = isl_basic_map_set_to_empty(bmap);
4611 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4613 struct isl_basic_set *bset;
4616 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4617 bset = isl_basic_set_set_to_empty(bset);
4621 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4623 struct isl_basic_map *bmap;
4624 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4625 bmap = isl_basic_map_finalize(bmap);
4629 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4631 struct isl_basic_set *bset;
4632 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4633 bset = isl_basic_set_finalize(bset);
4637 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4640 unsigned total = isl_space_dim(dim, isl_dim_all);
4641 isl_basic_map *bmap;
4643 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4644 for (i = 0; i < total; ++i) {
4645 int k = isl_basic_map_alloc_inequality(bmap);
4648 isl_seq_clr(bmap->ineq[k], 1 + total);
4649 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4653 isl_basic_map_free(bmap);
4657 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4659 return isl_basic_map_nat_universe(dim);
4662 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4664 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4667 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4669 return isl_map_nat_universe(dim);
4672 __isl_give isl_basic_map *isl_basic_map_universe_like(
4673 __isl_keep isl_basic_map *model)
4677 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4680 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4684 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4687 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4688 __isl_keep isl_set *model)
4692 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4695 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4697 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4700 struct isl_map *isl_map_empty_like(struct isl_map *model)
4704 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4707 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4711 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4714 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4716 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4719 struct isl_set *isl_set_empty_like(struct isl_set *model)
4723 return isl_set_empty(isl_space_copy(model->dim));
4726 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4728 struct isl_map *map;
4731 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4732 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4736 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
4738 struct isl_set *set;
4741 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4742 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4746 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4750 return isl_set_universe(isl_space_copy(model->dim));
4753 struct isl_map *isl_map_dup(struct isl_map *map)
4756 struct isl_map *dup;
4760 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
4761 for (i = 0; i < map->n; ++i)
4762 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4766 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4767 __isl_take isl_basic_map *bmap)
4771 if (isl_basic_map_plain_is_empty(bmap)) {
4772 isl_basic_map_free(bmap);
4775 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
4776 isl_assert(map->ctx, map->n < map->size, goto error);
4777 map->p[map->n] = bmap;
4779 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4785 isl_basic_map_free(bmap);
4789 void isl_map_free(struct isl_map *map)
4799 isl_ctx_deref(map->ctx);
4800 for (i = 0; i < map->n; ++i)
4801 isl_basic_map_free(map->p[i]);
4802 isl_space_free(map->dim);
4806 struct isl_map *isl_map_extend(struct isl_map *base,
4807 unsigned nparam, unsigned n_in, unsigned n_out)
4811 base = isl_map_cow(base);
4815 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
4818 for (i = 0; i < base->n; ++i) {
4819 base->p[i] = isl_basic_map_extend_space(base->p[i],
4820 isl_space_copy(base->dim), 0, 0, 0);
4830 struct isl_set *isl_set_extend(struct isl_set *base,
4831 unsigned nparam, unsigned dim)
4833 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4837 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4838 struct isl_basic_map *bmap, unsigned pos, int value)
4842 bmap = isl_basic_map_cow(bmap);
4843 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4844 j = isl_basic_map_alloc_equality(bmap);
4847 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4848 isl_int_set_si(bmap->eq[j][pos], -1);
4849 isl_int_set_si(bmap->eq[j][0], value);
4850 bmap = isl_basic_map_simplify(bmap);
4851 return isl_basic_map_finalize(bmap);
4853 isl_basic_map_free(bmap);
4857 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4858 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4862 bmap = isl_basic_map_cow(bmap);
4863 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4864 j = isl_basic_map_alloc_equality(bmap);
4867 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4868 isl_int_set_si(bmap->eq[j][pos], -1);
4869 isl_int_set(bmap->eq[j][0], value);
4870 bmap = isl_basic_map_simplify(bmap);
4871 return isl_basic_map_finalize(bmap);
4873 isl_basic_map_free(bmap);
4877 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4878 enum isl_dim_type type, unsigned pos, int value)
4882 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4883 return isl_basic_map_fix_pos_si(bmap,
4884 isl_basic_map_offset(bmap, type) + pos, value);
4886 isl_basic_map_free(bmap);
4890 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4891 enum isl_dim_type type, unsigned pos, isl_int value)
4895 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4896 return isl_basic_map_fix_pos(bmap,
4897 isl_basic_map_offset(bmap, type) + pos, value);
4899 isl_basic_map_free(bmap);
4903 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4904 enum isl_dim_type type, unsigned pos, int value)
4906 return (struct isl_basic_set *)
4907 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4911 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4912 enum isl_dim_type type, unsigned pos, isl_int value)
4914 return (struct isl_basic_set *)
4915 isl_basic_map_fix((struct isl_basic_map *)bset,
4919 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4920 unsigned input, int value)
4922 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4925 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4926 unsigned dim, int value)
4928 return (struct isl_basic_set *)
4929 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4930 isl_dim_set, dim, value);
4933 struct isl_map *isl_map_fix_si(struct isl_map *map,
4934 enum isl_dim_type type, unsigned pos, int value)
4938 map = isl_map_cow(map);
4942 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4943 for (i = 0; i < map->n; ++i) {
4944 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4948 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4955 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4956 enum isl_dim_type type, unsigned pos, int value)
4958 return (struct isl_set *)
4959 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4962 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4963 enum isl_dim_type type, unsigned pos, isl_int value)
4967 map = isl_map_cow(map);
4971 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4972 for (i = 0; i < map->n; ++i) {
4973 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4977 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4984 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4985 enum isl_dim_type type, unsigned pos, isl_int value)
4987 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4990 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4991 unsigned input, int value)
4993 return isl_map_fix_si(map, isl_dim_in, input, value);
4996 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4998 return (struct isl_set *)
4999 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5002 static __isl_give isl_basic_map *basic_map_bound_si(
5003 __isl_take isl_basic_map *bmap,
5004 enum isl_dim_type type, unsigned pos, int value, int upper)
5010 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5011 pos += isl_basic_map_offset(bmap, type);
5012 bmap = isl_basic_map_cow(bmap);
5013 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5014 j = isl_basic_map_alloc_inequality(bmap);
5017 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5019 isl_int_set_si(bmap->ineq[j][pos], -1);
5020 isl_int_set_si(bmap->ineq[j][0], value);
5022 isl_int_set_si(bmap->ineq[j][pos], 1);
5023 isl_int_set_si(bmap->ineq[j][0], -value);
5025 bmap = isl_basic_map_simplify(bmap);
5026 return isl_basic_map_finalize(bmap);
5028 isl_basic_map_free(bmap);
5032 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5033 __isl_take isl_basic_map *bmap,
5034 enum isl_dim_type type, unsigned pos, int value)
5036 return basic_map_bound_si(bmap, type, pos, value, 0);
5039 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5040 unsigned dim, isl_int value)
5044 bset = isl_basic_set_cow(bset);
5045 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5046 j = isl_basic_set_alloc_inequality(bset);
5049 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5050 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5051 isl_int_neg(bset->ineq[j][0], value);
5052 bset = isl_basic_set_simplify(bset);
5053 return isl_basic_set_finalize(bset);
5055 isl_basic_set_free(bset);
5059 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5060 enum isl_dim_type type, unsigned pos, int value, int upper)
5064 map = isl_map_cow(map);
5068 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5069 for (i = 0; i < map->n; ++i) {
5070 map->p[i] = basic_map_bound_si(map->p[i],
5071 type, pos, value, upper);
5075 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5082 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5083 enum isl_dim_type type, unsigned pos, int value)
5085 return map_bound_si(map, type, pos, value, 0);
5088 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5089 enum isl_dim_type type, unsigned pos, int value)
5091 return map_bound_si(map, type, pos, value, 1);
5094 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5095 enum isl_dim_type type, unsigned pos, int value)
5097 return (struct isl_set *)
5098 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5101 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5102 enum isl_dim_type type, unsigned pos, int value)
5104 return isl_map_upper_bound_si(set, type, pos, value);
5107 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5112 set = isl_set_cow(set);
5116 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5117 for (i = 0; i < set->n; ++i) {
5118 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5128 struct isl_map *isl_map_reverse(struct isl_map *map)
5132 map = isl_map_cow(map);
5136 map->dim = isl_space_reverse(map->dim);
5139 for (i = 0; i < map->n; ++i) {
5140 map->p[i] = isl_basic_map_reverse(map->p[i]);
5144 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5151 static struct isl_map *isl_basic_map_partial_lexopt(
5152 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5153 struct isl_set **empty, int max)
5157 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5158 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5160 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5162 isl_basic_map_free(bmap);
5163 isl_basic_set_free(dom);
5169 struct isl_map *isl_basic_map_partial_lexmax(
5170 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5171 struct isl_set **empty)
5173 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5176 struct isl_map *isl_basic_map_partial_lexmin(
5177 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5178 struct isl_set **empty)
5180 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5183 struct isl_set *isl_basic_set_partial_lexmin(
5184 struct isl_basic_set *bset, struct isl_basic_set *dom,
5185 struct isl_set **empty)
5187 return (struct isl_set *)
5188 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5192 struct isl_set *isl_basic_set_partial_lexmax(
5193 struct isl_basic_set *bset, struct isl_basic_set *dom,
5194 struct isl_set **empty)
5196 return (struct isl_set *)
5197 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5201 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5202 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5203 __isl_give isl_set **empty)
5205 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5208 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5209 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5210 __isl_give isl_set **empty)
5212 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5215 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5216 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5217 __isl_give isl_set **empty)
5219 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5222 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5223 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5224 __isl_give isl_set **empty)
5226 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5229 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5230 __isl_take isl_basic_map *bmap, int max)
5232 isl_basic_set *dom = NULL;
5233 isl_space *dom_space;
5237 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5238 dom = isl_basic_set_universe(dom_space);
5239 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5241 isl_basic_map_free(bmap);
5245 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5246 __isl_take isl_basic_map *bmap)
5248 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5251 /* Given a basic map "bmap", compute the lexicographically minimal
5252 * (or maximal) image element for each domain element in dom.
5253 * Set *empty to those elements in dom that do not have an image element.
5255 * We first make sure the basic sets in dom are disjoint and then
5256 * simply collect the results over each of the basic sets separately.
5257 * We could probably improve the efficiency a bit by moving the union
5258 * domain down into the parametric integer programming.
5260 static __isl_give isl_map *basic_map_partial_lexopt(
5261 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5262 __isl_give isl_set **empty, int max)
5265 struct isl_map *res;
5267 dom = isl_set_make_disjoint(dom);
5271 if (isl_set_plain_is_empty(dom)) {
5272 res = isl_map_empty_like_basic_map(bmap);
5273 *empty = isl_set_empty_like(dom);
5275 isl_basic_map_free(bmap);
5279 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5280 isl_basic_set_copy(dom->p[0]), empty, max);
5282 for (i = 1; i < dom->n; ++i) {
5283 struct isl_map *res_i;
5284 struct isl_set *empty_i;
5286 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5287 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5289 res = isl_map_union_disjoint(res, res_i);
5290 *empty = isl_set_union_disjoint(*empty, empty_i);
5294 isl_basic_map_free(bmap);
5299 isl_basic_map_free(bmap);
5303 /* Given a map "map", compute the lexicographically minimal
5304 * (or maximal) image element for each domain element in dom.
5305 * Set *empty to those elements in dom that do not have an image element.
5307 * We first compute the lexicographically minimal or maximal element
5308 * in the first basic map. This results in a partial solution "res"
5309 * and a subset "todo" of dom that still need to be handled.
5310 * We then consider each of the remaining maps in "map" and successively
5311 * improve both "res" and "todo".
5313 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5314 * Assume we are computing the lexicographical maximum.
5315 * We first compute the lexicographically maximal element in basic map i.
5316 * This results in a partial solution res_i and a subset todo_i.
5317 * Then we combine these results with those obtain for the first k basic maps
5318 * to obtain a result that is valid for the first k+1 basic maps.
5319 * In particular, the set where there is no solution is the set where
5320 * there is no solution for the first k basic maps and also no solution
5321 * for the ith basic map, i.e.,
5323 * todo^i = todo^k * todo_i
5325 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5326 * solutions, arbitrarily breaking ties in favor of res^k.
5327 * That is, when res^k(a) >= res_i(a), we pick res^k and
5328 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5329 * the lexicographic order.)
5330 * In practice, we compute
5332 * res^k * (res_i . "<=")
5336 * res_i * (res^k . "<")
5338 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5339 * where only one of res^k and res_i provides a solution and we simply pick
5346 * Note that we only compute these intersections when dom(res^k) intersects
5347 * dom(res_i). Otherwise, the only effect of these intersections is to
5348 * potentially break up res^k and res_i into smaller pieces.
5349 * We want to avoid such splintering as much as possible.
5350 * In fact, an earlier implementation of this function would look for
5351 * better results in the domain of res^k and for extra results in todo^k,
5352 * but this would always result in a splintering according to todo^k,
5353 * even when the domain of basic map i is disjoint from the domains of
5354 * the previous basic maps.
5356 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5357 __isl_take isl_map *map, __isl_take isl_set *dom,
5358 __isl_give isl_set **empty, int max)
5361 struct isl_map *res;
5362 struct isl_set *todo;
5367 if (isl_map_plain_is_empty(map)) {
5375 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5376 isl_set_copy(dom), &todo, max);
5378 for (i = 1; i < map->n; ++i) {
5382 isl_space *dim = isl_space_range(isl_map_get_space(res));
5384 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5385 isl_set_copy(dom), &todo_i, max);
5388 lt = isl_map_lex_lt(isl_space_copy(dim));
5389 le = isl_map_lex_le(dim);
5391 lt = isl_map_lex_gt(isl_space_copy(dim));
5392 le = isl_map_lex_ge(dim);
5394 lt = isl_map_apply_range(isl_map_copy(res), lt);
5395 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5396 le = isl_map_apply_range(isl_map_copy(res_i), le);
5397 le = isl_map_intersect(le, isl_map_copy(res));
5399 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5400 res = isl_map_intersect_domain(res,
5401 isl_set_copy(todo_i));
5402 res_i = isl_map_intersect_domain(res_i,
5403 isl_set_copy(todo));
5406 res = isl_map_union_disjoint(res, res_i);
5407 res = isl_map_union_disjoint(res, lt);
5408 res = isl_map_union_disjoint(res, le);
5410 todo = isl_set_intersect(todo, todo_i);
5430 /* Given a map "map", compute the lexicographically minimal
5431 * (or maximal) image element for each domain element in dom.
5432 * Set *empty to those elements in dom that do not have an image element.
5434 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5436 static __isl_give isl_map *isl_map_partial_lexopt(
5437 __isl_take isl_map *map, __isl_take isl_set *dom,
5438 __isl_give isl_set **empty, int max)
5442 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5443 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5444 if (!isl_space_has_named_params(map->dim) ||
5445 !isl_space_has_named_params(dom->dim))
5446 isl_die(map->ctx, isl_error_invalid,
5447 "unaligned unnamed parameters", goto error);
5448 map = isl_map_align_params(map, isl_map_get_space(dom));
5449 dom = isl_map_align_params(dom, isl_map_get_space(map));
5450 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5459 __isl_give isl_map *isl_map_partial_lexmax(
5460 __isl_take isl_map *map, __isl_take isl_set *dom,
5461 __isl_give isl_set **empty)
5463 return isl_map_partial_lexopt(map, dom, empty, 1);
5466 __isl_give isl_map *isl_map_partial_lexmin(
5467 __isl_take isl_map *map, __isl_take isl_set *dom,
5468 __isl_give isl_set **empty)
5470 return isl_map_partial_lexopt(map, dom, empty, 0);
5473 __isl_give isl_set *isl_set_partial_lexmin(
5474 __isl_take isl_set *set, __isl_take isl_set *dom,
5475 __isl_give isl_set **empty)
5477 return (struct isl_set *)
5478 isl_map_partial_lexmin((struct isl_map *)set,
5482 __isl_give isl_set *isl_set_partial_lexmax(
5483 __isl_take isl_set *set, __isl_take isl_set *dom,
5484 __isl_give isl_set **empty)
5486 return (struct isl_set *)
5487 isl_map_partial_lexmax((struct isl_map *)set,
5491 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5493 struct isl_basic_set *dom = NULL;
5498 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5499 dom = isl_basic_set_universe(dom_dim);
5500 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5502 isl_basic_map_free(bmap);
5506 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5508 return isl_basic_map_lexopt(bmap, 0);
5511 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5513 return isl_basic_map_lexopt(bmap, 1);
5516 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5518 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5521 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5523 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5526 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5528 struct isl_set *dom = NULL;
5533 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5534 dom = isl_set_universe(dom_dim);
5535 return isl_map_partial_lexopt(map, dom, NULL, max);
5541 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5543 return isl_map_lexopt(map, 0);
5546 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5548 return isl_map_lexopt(map, 1);
5551 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5553 return (isl_set *)isl_map_lexmin((isl_map *)set);
5556 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5558 return (isl_set *)isl_map_lexmax((isl_map *)set);
5561 /* Extract the first and only affine expression from list
5562 * and then add it to *pwaff with the given dom.
5563 * This domain is known to be disjoint from other domains
5564 * because of the way isl_basic_map_foreach_lexmax works.
5566 static int update_dim_opt(__isl_take isl_basic_set *dom,
5567 __isl_take isl_aff_list *list, void *user)
5569 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5571 isl_pw_aff **pwaff = user;
5572 isl_pw_aff *pwaff_i;
5574 if (isl_aff_list_n_aff(list) != 1)
5575 isl_die(ctx, isl_error_internal,
5576 "expecting single element list", goto error);
5578 aff = isl_aff_list_get_aff(list, 0);
5579 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5581 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5583 isl_aff_list_free(list);
5587 isl_basic_set_free(dom);
5588 isl_aff_list_free(list);
5592 /* Given a basic map with one output dimension, compute the minimum or
5593 * maximum of that dimension as an isl_pw_aff.
5595 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5596 * call update_dim_opt on each leaf of the result.
5598 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5601 isl_space *dim = isl_basic_map_get_space(bmap);
5605 dim = isl_space_from_domain(isl_space_domain(dim));
5606 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5607 pwaff = isl_pw_aff_empty(dim);
5609 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5611 return isl_pw_aff_free(pwaff);
5616 /* Compute the minimum or maximum of the given output dimension
5617 * as a function of the parameters and the input dimensions,
5618 * but independently of the other output dimensions.
5620 * We first project out the other output dimension and then compute
5621 * the "lexicographic" maximum in each basic map, combining the results
5622 * using isl_pw_aff_union_max.
5624 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
5631 n_out = isl_map_dim(map, isl_dim_out);
5632 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
5633 map = isl_map_project_out(map, isl_dim_out, 0, pos);
5638 isl_space *dim = isl_map_get_space(map);
5639 dim = isl_space_domain(isl_space_from_range(dim));
5641 return isl_pw_aff_empty(dim);
5644 pwaff = basic_map_dim_opt(map->p[0], max);
5645 for (i = 1; i < map->n; ++i) {
5646 isl_pw_aff *pwaff_i;
5648 pwaff_i = basic_map_dim_opt(map->p[i], max);
5649 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
5657 /* Compute the maximum of the given output dimension as a function of the
5658 * parameters and input dimensions, but independently of
5659 * the other output dimensions.
5661 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
5663 return map_dim_opt(map, pos, 1);
5666 /* Compute the minimum or maximum of the given set dimension
5667 * as a function of the parameters,
5668 * but independently of the other set dimensions.
5670 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
5673 return map_dim_opt(set, pos, max);
5676 /* Compute the maximum of the given set dimension as a function of the
5677 * parameters, but independently of the other set dimensions.
5679 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5681 return set_dim_opt(set, pos, 1);
5684 /* Compute the minimum of the given set dimension as a function of the
5685 * parameters, but independently of the other set dimensions.
5687 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
5689 return set_dim_opt(set, pos, 0);
5692 /* Apply a preimage specified by "mat" on the parameters of "bset".
5693 * bset is assumed to have only parameters and divs.
5695 static struct isl_basic_set *basic_set_parameter_preimage(
5696 struct isl_basic_set *bset, struct isl_mat *mat)
5703 bset->dim = isl_space_cow(bset->dim);
5707 nparam = isl_basic_set_dim(bset, isl_dim_param);
5709 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5711 bset->dim->nparam = 0;
5712 bset->dim->n_out = nparam;
5713 bset = isl_basic_set_preimage(bset, mat);
5715 bset->dim->nparam = bset->dim->n_out;
5716 bset->dim->n_out = 0;
5721 isl_basic_set_free(bset);
5725 /* Apply a preimage specified by "mat" on the parameters of "set".
5726 * set is assumed to have only parameters and divs.
5728 static struct isl_set *set_parameter_preimage(
5729 struct isl_set *set, struct isl_mat *mat)
5731 isl_space *dim = NULL;
5737 dim = isl_space_copy(set->dim);
5738 dim = isl_space_cow(dim);
5742 nparam = isl_set_dim(set, isl_dim_param);
5744 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5747 dim->n_out = nparam;
5748 isl_set_reset_space(set, dim);
5749 set = isl_set_preimage(set, mat);
5752 dim = isl_space_copy(set->dim);
5753 dim = isl_space_cow(dim);
5756 dim->nparam = dim->n_out;
5758 isl_set_reset_space(set, dim);
5761 isl_space_free(dim);
5768 /* Intersect the basic set "bset" with the affine space specified by the
5769 * equalities in "eq".
5771 static struct isl_basic_set *basic_set_append_equalities(
5772 struct isl_basic_set *bset, struct isl_mat *eq)
5780 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
5785 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
5786 for (i = 0; i < eq->n_row; ++i) {
5787 k = isl_basic_set_alloc_equality(bset);
5790 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5791 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5795 bset = isl_basic_set_gauss(bset, NULL);
5796 bset = isl_basic_set_finalize(bset);
5801 isl_basic_set_free(bset);
5805 /* Intersect the set "set" with the affine space specified by the
5806 * equalities in "eq".
5808 static struct isl_set *set_append_equalities(struct isl_set *set,
5816 for (i = 0; i < set->n; ++i) {
5817 set->p[i] = basic_set_append_equalities(set->p[i],
5830 /* Project the given basic set onto its parameter domain, possibly introducing
5831 * new, explicit, existential variables in the constraints.
5832 * The input has parameters and (possibly implicit) existential variables.
5833 * The output has the same parameters, but only
5834 * explicit existentially quantified variables.
5836 * The actual projection is performed by pip, but pip doesn't seem
5837 * to like equalities very much, so we first remove the equalities
5838 * among the parameters by performing a variable compression on
5839 * the parameters. Afterward, an inverse transformation is performed
5840 * and the equalities among the parameters are inserted back in.
5842 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5846 struct isl_mat *T, *T2;
5847 struct isl_set *set;
5848 unsigned nparam, n_div;
5850 bset = isl_basic_set_cow(bset);
5854 if (bset->n_eq == 0)
5855 return isl_basic_set_lexmin(bset);
5857 isl_basic_set_gauss(bset, NULL);
5859 nparam = isl_basic_set_dim(bset, isl_dim_param);
5860 n_div = isl_basic_set_dim(bset, isl_dim_div);
5862 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5863 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5866 if (i == bset->n_eq)
5867 return isl_basic_set_lexmin(bset);
5869 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5871 eq = isl_mat_cow(eq);
5872 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5873 if (T && T->n_col == 0) {
5877 bset = isl_basic_set_set_to_empty(bset);
5878 return isl_set_from_basic_set(bset);
5880 bset = basic_set_parameter_preimage(bset, T);
5882 set = isl_basic_set_lexmin(bset);
5883 set = set_parameter_preimage(set, T2);
5884 set = set_append_equalities(set, eq);
5888 /* Compute an explicit representation for all the existentially
5889 * quantified variables.
5890 * The input and output dimensions are first turned into parameters.
5891 * compute_divs then returns a map with the same parameters and
5892 * no input or output dimensions and the dimension specification
5893 * is reset to that of the input.
5895 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5897 struct isl_basic_set *bset;
5898 struct isl_set *set;
5899 struct isl_map *map;
5900 isl_space *dim, *orig_dim = NULL;
5905 bmap = isl_basic_map_cow(bmap);
5909 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5910 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5911 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5912 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5916 orig_dim = bmap->dim;
5918 bset = (struct isl_basic_set *)bmap;
5920 set = parameter_compute_divs(bset);
5921 map = (struct isl_map *)set;
5922 map = isl_map_reset_space(map, orig_dim);
5926 isl_basic_map_free(bmap);
5930 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5938 off = isl_space_dim(bmap->dim, isl_dim_all);
5939 for (i = 0; i < bmap->n_div; ++i) {
5940 if (isl_int_is_zero(bmap->div[i][0]))
5942 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5948 static int map_divs_known(__isl_keep isl_map *map)
5955 for (i = 0; i < map->n; ++i) {
5956 int known = isl_basic_map_divs_known(map->p[i]);
5964 /* If bmap contains any unknown divs, then compute explicit
5965 * expressions for them. However, this computation may be
5966 * quite expensive, so first try to remove divs that aren't
5969 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5972 struct isl_map *map;
5974 known = isl_basic_map_divs_known(bmap);
5978 return isl_map_from_basic_map(bmap);
5980 bmap = isl_basic_map_drop_redundant_divs(bmap);
5982 known = isl_basic_map_divs_known(bmap);
5986 return isl_map_from_basic_map(bmap);
5988 map = compute_divs(bmap);
5991 isl_basic_map_free(bmap);
5995 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5999 struct isl_map *res;
6006 known = map_divs_known(map);
6014 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6015 for (i = 1 ; i < map->n; ++i) {
6017 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6018 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6019 res = isl_map_union_disjoint(res, r2);
6021 res = isl_map_union(res, r2);
6028 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6030 return (struct isl_set *)
6031 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6034 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6036 return (struct isl_set *)
6037 isl_map_compute_divs((struct isl_map *)set);
6040 struct isl_set *isl_map_domain(struct isl_map *map)
6043 struct isl_set *set;
6048 map = isl_map_cow(map);
6052 set = (struct isl_set *)map;
6053 set->dim = isl_space_domain(set->dim);
6056 for (i = 0; i < map->n; ++i) {
6057 set->p[i] = isl_basic_map_domain(map->p[i]);
6061 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6062 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6069 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6070 __isl_take isl_map *map2)
6074 struct isl_map *map = NULL;
6088 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6090 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6091 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6092 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6094 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6095 map1->n + map2->n, flags);
6098 for (i = 0; i < map1->n; ++i) {
6099 map = isl_map_add_basic_map(map,
6100 isl_basic_map_copy(map1->p[i]));
6104 for (i = 0; i < map2->n; ++i) {
6105 map = isl_map_add_basic_map(map,
6106 isl_basic_map_copy(map2->p[i]));
6120 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6121 __isl_take isl_map *map2)
6123 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6126 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6128 map1 = isl_map_union_disjoint(map1, map2);
6132 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6136 struct isl_set *isl_set_union_disjoint(
6137 struct isl_set *set1, struct isl_set *set2)
6139 return (struct isl_set *)
6140 isl_map_union_disjoint(
6141 (struct isl_map *)set1, (struct isl_map *)set2);
6144 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6146 return (struct isl_set *)
6147 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6150 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6151 __isl_take isl_set *set)
6154 struct isl_map *result;
6160 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6161 isl_die(set->ctx, isl_error_invalid,
6162 "parameters don't match", goto error);
6164 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6165 !isl_map_compatible_range(map, set))
6166 isl_die(set->ctx, isl_error_invalid,
6167 "incompatible spaces", goto error);
6169 if (isl_set_plain_is_universe(set)) {
6174 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6175 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6176 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6178 result = isl_map_alloc_space(isl_space_copy(map->dim),
6179 map->n * set->n, flags);
6182 for (i = 0; i < map->n; ++i)
6183 for (j = 0; j < set->n; ++j) {
6184 result = isl_map_add_basic_map(result,
6185 isl_basic_map_intersect_range(
6186 isl_basic_map_copy(map->p[i]),
6187 isl_basic_set_copy(set->p[j])));
6200 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6201 __isl_take isl_set *set)
6203 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6206 struct isl_map *isl_map_intersect_domain(
6207 struct isl_map *map, struct isl_set *set)
6209 return isl_map_reverse(
6210 isl_map_intersect_range(isl_map_reverse(map), set));
6213 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6214 __isl_take isl_map *map2)
6218 map1 = isl_map_reverse(map1);
6219 map1 = isl_map_apply_range(map1, map2);
6220 return isl_map_reverse(map1);
6227 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6228 __isl_take isl_map *map2)
6230 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6233 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6234 __isl_take isl_map *map2)
6236 isl_space *dim_result;
6237 struct isl_map *result;
6243 dim_result = isl_space_join(isl_space_copy(map1->dim),
6244 isl_space_copy(map2->dim));
6246 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6249 for (i = 0; i < map1->n; ++i)
6250 for (j = 0; j < map2->n; ++j) {
6251 result = isl_map_add_basic_map(result,
6252 isl_basic_map_apply_range(
6253 isl_basic_map_copy(map1->p[i]),
6254 isl_basic_map_copy(map2->p[j])));
6260 if (result && result->n <= 1)
6261 ISL_F_SET(result, ISL_MAP_DISJOINT);
6269 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6270 __isl_take isl_map *map2)
6272 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6276 * returns range - domain
6278 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6280 isl_space *dims, *target_dim;
6281 struct isl_basic_set *bset;
6288 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6289 bmap->dim, isl_dim_out),
6291 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6292 dim = isl_basic_map_n_in(bmap);
6293 nparam = isl_basic_map_n_param(bmap);
6294 bset = isl_basic_set_from_basic_map(bmap);
6295 bset = isl_basic_set_cow(bset);
6296 dims = isl_basic_set_get_space(bset);
6297 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6298 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6299 bset = isl_basic_set_swap_vars(bset, 2*dim);
6300 for (i = 0; i < dim; ++i) {
6301 int j = isl_basic_map_alloc_equality(
6302 (struct isl_basic_map *)bset);
6305 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6306 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6307 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6308 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6310 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6311 bset = isl_basic_set_reset_space(bset, target_dim);
6314 isl_basic_map_free(bmap);
6319 * returns range - domain
6321 struct isl_set *isl_map_deltas(struct isl_map *map)
6325 struct isl_set *result;
6330 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6331 map->dim, isl_dim_out),
6333 dim = isl_map_get_space(map);
6334 dim = isl_space_domain(dim);
6335 result = isl_set_alloc_space(dim, map->n, 0);
6338 for (i = 0; i < map->n; ++i)
6339 result = isl_set_add_basic_set(result,
6340 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6349 * returns [domain -> range] -> range - domain
6351 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6352 __isl_take isl_basic_map *bmap)
6356 isl_basic_map *domain;
6360 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6361 isl_die(bmap->ctx, isl_error_invalid,
6362 "domain and range don't match", goto error);
6364 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6365 n = isl_basic_map_dim(bmap, isl_dim_in);
6367 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6368 domain = isl_basic_map_universe(dim);
6370 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6371 bmap = isl_basic_map_apply_range(bmap, domain);
6372 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6374 total = isl_basic_map_total_dim(bmap);
6376 for (i = 0; i < n; ++i) {
6377 k = isl_basic_map_alloc_equality(bmap);
6380 isl_seq_clr(bmap->eq[k], 1 + total);
6381 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6382 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6383 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6386 bmap = isl_basic_map_gauss(bmap, NULL);
6387 return isl_basic_map_finalize(bmap);
6389 isl_basic_map_free(bmap);
6394 * returns [domain -> range] -> range - domain
6396 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6399 isl_space *domain_dim;
6404 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6405 isl_die(map->ctx, isl_error_invalid,
6406 "domain and range don't match", goto error);
6408 map = isl_map_cow(map);
6412 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6413 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6414 map->dim = isl_space_join(map->dim, domain_dim);
6417 for (i = 0; i < map->n; ++i) {
6418 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6422 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6429 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6431 struct isl_basic_map *bmap;
6439 nparam = dims->nparam;
6441 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6445 for (i = 0; i < dim; ++i) {
6446 int j = isl_basic_map_alloc_equality(bmap);
6449 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6450 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6451 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6453 return isl_basic_map_finalize(bmap);
6455 isl_basic_map_free(bmap);
6459 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6463 if (dim->n_in != dim->n_out)
6464 isl_die(dim->ctx, isl_error_invalid,
6465 "number of input and output dimensions needs to be "
6466 "the same", goto error);
6467 return basic_map_identity(dim);
6469 isl_space_free(dim);
6473 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6475 if (!model || !model->dim)
6477 return isl_basic_map_identity(isl_space_copy(model->dim));
6480 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6482 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6485 struct isl_map *isl_map_identity_like(struct isl_map *model)
6487 if (!model || !model->dim)
6489 return isl_map_identity(isl_space_copy(model->dim));
6492 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6494 if (!model || !model->dim)
6496 return isl_map_identity(isl_space_copy(model->dim));
6499 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6501 isl_space *dim = isl_set_get_space(set);
6503 id = isl_map_identity(isl_space_map_from_set(dim));
6504 return isl_map_intersect_range(id, set);
6507 /* Construct a basic set with all set dimensions having only non-negative
6510 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6511 __isl_take isl_space *space)
6516 struct isl_basic_set *bset;
6520 nparam = space->nparam;
6522 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6525 for (i = 0; i < dim; ++i) {
6526 int k = isl_basic_set_alloc_inequality(bset);
6529 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6530 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6534 isl_basic_set_free(bset);
6538 /* Construct the half-space x_pos >= 0.
6540 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6544 isl_basic_set *nonneg;
6546 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6547 k = isl_basic_set_alloc_inequality(nonneg);
6550 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6551 isl_int_set_si(nonneg->ineq[k][pos], 1);
6553 return isl_basic_set_finalize(nonneg);
6555 isl_basic_set_free(nonneg);
6559 /* Construct the half-space x_pos <= -1.
6561 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6566 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6567 k = isl_basic_set_alloc_inequality(neg);
6570 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6571 isl_int_set_si(neg->ineq[k][0], -1);
6572 isl_int_set_si(neg->ineq[k][pos], -1);
6574 return isl_basic_set_finalize(neg);
6576 isl_basic_set_free(neg);
6580 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6581 enum isl_dim_type type, unsigned first, unsigned n)
6584 isl_basic_set *nonneg;
6592 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6594 for (i = 0; i < n; ++i) {
6595 nonneg = nonneg_halfspace(isl_set_get_space(set),
6596 pos(set->dim, type) + first + i);
6597 neg = neg_halfspace(isl_set_get_space(set),
6598 pos(set->dim, type) + first + i);
6600 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6609 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6610 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6617 if (isl_set_plain_is_empty(set)) {
6622 return fn(set, signs, user);
6625 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6627 half = isl_set_intersect(half, isl_set_copy(set));
6628 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6632 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6634 half = isl_set_intersect(half, set);
6635 return foreach_orthant(half, signs, first + 1, len, fn, user);
6641 /* Call "fn" on the intersections of "set" with each of the orthants
6642 * (except for obviously empty intersections). The orthant is identified
6643 * by the signs array, with each entry having value 1 or -1 according
6644 * to the sign of the corresponding variable.
6646 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6647 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6657 if (isl_set_plain_is_empty(set))
6660 nparam = isl_set_dim(set, isl_dim_param);
6661 nvar = isl_set_dim(set, isl_dim_set);
6663 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6665 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6673 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6675 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6678 int isl_basic_map_is_subset(
6679 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6682 struct isl_map *map1;
6683 struct isl_map *map2;
6685 if (!bmap1 || !bmap2)
6688 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6689 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6691 is_subset = isl_map_is_subset(map1, map2);
6699 int isl_basic_map_is_equal(
6700 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6704 if (!bmap1 || !bmap2)
6706 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6709 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6713 int isl_basic_set_is_equal(
6714 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6716 return isl_basic_map_is_equal(
6717 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6720 int isl_map_is_empty(struct isl_map *map)
6727 for (i = 0; i < map->n; ++i) {
6728 is_empty = isl_basic_map_is_empty(map->p[i]);
6737 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6739 return map ? map->n == 0 : -1;
6742 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6744 return isl_map_plain_is_empty(map);
6747 int isl_set_plain_is_empty(struct isl_set *set)
6749 return set ? set->n == 0 : -1;
6752 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6754 return isl_set_plain_is_empty(set);
6757 int isl_set_is_empty(struct isl_set *set)
6759 return isl_map_is_empty((struct isl_map *)set);
6762 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6767 return isl_space_is_equal(map1->dim, map2->dim);
6770 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6775 return isl_space_is_equal(set1->dim, set2->dim);
6778 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6784 is_subset = isl_map_is_subset(map1, map2);
6787 is_subset = isl_map_is_subset(map2, map1);
6791 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6793 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
6796 int isl_basic_map_is_strict_subset(
6797 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6801 if (!bmap1 || !bmap2)
6803 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6806 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6807 if (is_subset == -1)
6812 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6818 is_subset = isl_map_is_subset(map1, map2);
6821 is_subset = isl_map_is_subset(map2, map1);
6822 if (is_subset == -1)
6827 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6829 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6832 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6836 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6839 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6843 return bset->n_eq == 0 && bset->n_ineq == 0;
6846 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6853 for (i = 0; i < map->n; ++i) {
6854 int r = isl_basic_map_is_universe(map->p[i]);
6862 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6864 return isl_map_plain_is_universe((isl_map *) set);
6867 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6869 return isl_set_plain_is_universe(set);
6872 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6874 struct isl_basic_set *bset = NULL;
6875 struct isl_vec *sample = NULL;
6882 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6885 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6886 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6887 copy = isl_basic_map_remove_redundancies(copy);
6888 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6889 isl_basic_map_free(copy);
6893 total = 1 + isl_basic_map_total_dim(bmap);
6894 if (bmap->sample && bmap->sample->size == total) {
6895 int contains = isl_basic_map_contains(bmap, bmap->sample);
6901 isl_vec_free(bmap->sample);
6902 bmap->sample = NULL;
6903 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6906 sample = isl_basic_set_sample_vec(bset);
6909 empty = sample->size == 0;
6910 isl_vec_free(bmap->sample);
6911 bmap->sample = sample;
6913 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6918 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6922 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6925 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6927 return isl_basic_map_plain_is_empty(bmap);
6930 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6934 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6937 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6939 return isl_basic_set_plain_is_empty(bset);
6942 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6944 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6947 struct isl_map *isl_basic_map_union(
6948 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6950 struct isl_map *map;
6951 if (!bmap1 || !bmap2)
6954 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
6956 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
6959 map = isl_map_add_basic_map(map, bmap1);
6960 map = isl_map_add_basic_map(map, bmap2);
6963 isl_basic_map_free(bmap1);
6964 isl_basic_map_free(bmap2);
6968 struct isl_set *isl_basic_set_union(
6969 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6971 return (struct isl_set *)isl_basic_map_union(
6972 (struct isl_basic_map *)bset1,
6973 (struct isl_basic_map *)bset2);
6976 /* Order divs such that any div only depends on previous divs */
6977 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6985 off = isl_space_dim(bmap->dim, isl_dim_all);
6987 for (i = 0; i < bmap->n_div; ++i) {
6989 if (isl_int_is_zero(bmap->div[i][0]))
6991 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6995 isl_basic_map_swap_div(bmap, i, i + pos);
7001 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7003 return (struct isl_basic_set *)
7004 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7007 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7014 for (i = 0; i < map->n; ++i) {
7015 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7026 /* Apply the expansion computed by isl_merge_divs.
7027 * The expansion itself is given by "exp" while the resulting
7028 * list of divs is given by "div".
7030 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7031 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7036 bset = isl_basic_set_cow(bset);
7040 if (div->n_row < bset->n_div)
7041 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7042 "not an expansion", goto error);
7044 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7045 div->n_row - bset->n_div, 0,
7046 2 * (div->n_row - bset->n_div));
7048 n_div = bset->n_div;
7049 for (i = n_div; i < div->n_row; ++i)
7050 if (isl_basic_set_alloc_div(bset) < 0)
7054 for (i = div->n_row - 1; i >= 0; --i) {
7055 if (j >= 0 && exp[j] == i) {
7057 isl_basic_map_swap_div(bset, i, j);
7060 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7061 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7069 isl_basic_set_free(bset);
7074 /* Look for a div in dst that corresponds to the div "div" in src.
7075 * The divs before "div" in src and dst are assumed to be the same.
7077 * Returns -1 if no corresponding div was found and the position
7078 * of the corresponding div in dst otherwise.
7080 static int find_div(struct isl_basic_map *dst,
7081 struct isl_basic_map *src, unsigned div)
7085 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7087 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7088 for (i = div; i < dst->n_div; ++i)
7089 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7090 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7091 dst->n_div - div) == -1)
7096 struct isl_basic_map *isl_basic_map_align_divs(
7097 struct isl_basic_map *dst, struct isl_basic_map *src)
7100 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7105 if (src->n_div == 0)
7108 for (i = 0; i < src->n_div; ++i)
7109 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7111 src = isl_basic_map_order_divs(src);
7112 dst = isl_basic_map_cow(dst);
7113 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7114 src->n_div, 0, 2 * src->n_div);
7117 for (i = 0; i < src->n_div; ++i) {
7118 int j = find_div(dst, src, i);
7120 j = isl_basic_map_alloc_div(dst);
7123 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7124 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7125 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7129 isl_basic_map_swap_div(dst, i, j);
7133 isl_basic_map_free(dst);
7137 struct isl_basic_set *isl_basic_set_align_divs(
7138 struct isl_basic_set *dst, struct isl_basic_set *src)
7140 return (struct isl_basic_set *)isl_basic_map_align_divs(
7141 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7144 struct isl_map *isl_map_align_divs(struct isl_map *map)
7152 map = isl_map_compute_divs(map);
7153 map = isl_map_cow(map);
7157 for (i = 1; i < map->n; ++i)
7158 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7159 for (i = 1; i < map->n; ++i)
7160 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7162 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7166 struct isl_set *isl_set_align_divs(struct isl_set *set)
7168 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7171 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7172 __isl_take isl_map *map)
7176 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7177 map = isl_map_intersect_domain(map, set);
7178 set = isl_map_range(map);
7186 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7187 __isl_take isl_map *map)
7189 return isl_map_align_params_map_map_and(set, map, &set_apply);
7192 /* There is no need to cow as removing empty parts doesn't change
7193 * the meaning of the set.
7195 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7202 for (i = map->n-1; i >= 0; --i) {
7203 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
7205 isl_basic_map_free(map->p[i]);
7206 if (i != map->n-1) {
7207 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7208 map->p[i] = map->p[map->n-1];
7216 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7218 return (struct isl_set *)
7219 isl_map_remove_empty_parts((struct isl_map *)set);
7222 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7224 struct isl_basic_map *bmap;
7225 if (!map || map->n == 0)
7227 bmap = map->p[map->n-1];
7228 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7229 return isl_basic_map_copy(bmap);
7232 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7234 return (struct isl_basic_set *)
7235 isl_map_copy_basic_map((struct isl_map *)set);
7238 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7239 __isl_keep isl_basic_map *bmap)
7245 for (i = map->n-1; i >= 0; --i) {
7246 if (map->p[i] != bmap)
7248 map = isl_map_cow(map);
7251 isl_basic_map_free(map->p[i]);
7252 if (i != map->n-1) {
7253 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7254 map->p[i] = map->p[map->n-1];
7265 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7266 struct isl_basic_set *bset)
7268 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7269 (struct isl_basic_map *)bset);
7272 /* Given two basic sets bset1 and bset2, compute the maximal difference
7273 * between the values of dimension pos in bset1 and those in bset2
7274 * for any common value of the parameters and dimensions preceding pos.
7276 static enum isl_lp_result basic_set_maximal_difference_at(
7277 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7278 int pos, isl_int *opt)
7281 struct isl_basic_map *bmap1 = NULL;
7282 struct isl_basic_map *bmap2 = NULL;
7283 struct isl_ctx *ctx;
7284 struct isl_vec *obj;
7287 unsigned dim1, dim2;
7288 enum isl_lp_result res;
7290 if (!bset1 || !bset2)
7291 return isl_lp_error;
7293 nparam = isl_basic_set_n_param(bset1);
7294 dim1 = isl_basic_set_n_dim(bset1);
7295 dim2 = isl_basic_set_n_dim(bset2);
7296 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7297 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7298 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7299 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7300 if (!bmap1 || !bmap2)
7302 bmap1 = isl_basic_map_cow(bmap1);
7303 bmap1 = isl_basic_map_extend(bmap1, nparam,
7304 pos, (dim1 - pos) + (dim2 - pos),
7305 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7306 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7309 total = isl_basic_map_total_dim(bmap1);
7311 obj = isl_vec_alloc(ctx, 1 + total);
7312 isl_seq_clr(obj->block.data, 1 + total);
7313 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7314 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7317 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7319 isl_basic_map_free(bmap1);
7323 isl_basic_map_free(bmap1);
7324 isl_basic_map_free(bmap2);
7325 return isl_lp_error;
7328 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7329 * for any common value of the parameters and dimensions preceding pos
7330 * in both basic sets, the values of dimension pos in bset1 are
7331 * smaller or larger than those in bset2.
7334 * 1 if bset1 follows bset2
7335 * -1 if bset1 precedes bset2
7336 * 0 if bset1 and bset2 are incomparable
7337 * -2 if some error occurred.
7339 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7340 struct isl_basic_set *bset2, int pos)
7343 enum isl_lp_result res;
7348 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7350 if (res == isl_lp_empty)
7352 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7353 res == isl_lp_unbounded)
7355 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7364 /* Given two basic sets bset1 and bset2, check whether
7365 * for any common value of the parameters and dimensions preceding pos
7366 * there is a value of dimension pos in bset1 that is larger
7367 * than a value of the same dimension in bset2.
7370 * 1 if there exists such a pair
7371 * 0 if there is no such pair, but there is a pair of equal values
7373 * -2 if some error occurred.
7375 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7376 __isl_keep isl_basic_set *bset2, int pos)
7379 enum isl_lp_result res;
7384 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7386 if (res == isl_lp_empty)
7388 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7389 res == isl_lp_unbounded)
7391 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7393 else if (res == isl_lp_ok)
7402 /* Given two sets set1 and set2, check whether
7403 * for any common value of the parameters and dimensions preceding pos
7404 * there is a value of dimension pos in set1 that is larger
7405 * than a value of the same dimension in set2.
7408 * 1 if there exists such a pair
7409 * 0 if there is no such pair, but there is a pair of equal values
7411 * -2 if some error occurred.
7413 int isl_set_follows_at(__isl_keep isl_set *set1,
7414 __isl_keep isl_set *set2, int pos)
7422 for (i = 0; i < set1->n; ++i)
7423 for (j = 0; j < set2->n; ++j) {
7425 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7426 if (f == 1 || f == -2)
7435 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7436 unsigned pos, isl_int *val)
7444 total = isl_basic_map_total_dim(bmap);
7445 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7446 for (; d+1 > pos; --d)
7447 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7451 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7453 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7455 if (!isl_int_is_one(bmap->eq[i][1+d]))
7458 isl_int_neg(*val, bmap->eq[i][0]);
7464 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7465 unsigned pos, isl_int *val)
7477 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7480 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7481 for (i = 1; fixed == 1 && i < map->n; ++i) {
7482 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7483 if (fixed == 1 && isl_int_ne(tmp, v))
7487 isl_int_set(*val, v);
7493 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7494 unsigned pos, isl_int *val)
7496 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7500 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7503 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7506 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7507 enum isl_dim_type type, unsigned pos, isl_int *val)
7509 if (pos >= isl_basic_map_dim(bmap, type))
7511 return isl_basic_map_plain_has_fixed_var(bmap,
7512 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7515 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7516 enum isl_dim_type type, unsigned pos, isl_int *val)
7518 if (pos >= isl_map_dim(map, type))
7520 return isl_map_plain_has_fixed_var(map,
7521 map_offset(map, type) - 1 + pos, val);
7524 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7525 enum isl_dim_type type, unsigned pos, isl_int *val)
7527 return isl_map_plain_is_fixed(set, type, pos, val);
7530 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7531 enum isl_dim_type type, unsigned pos, isl_int *val)
7533 return isl_map_plain_is_fixed(map, type, pos, val);
7536 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7537 * then return this fixed value in *val.
7539 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7540 unsigned dim, isl_int *val)
7542 return isl_basic_set_plain_has_fixed_var(bset,
7543 isl_basic_set_n_param(bset) + dim, val);
7546 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7547 * then return this fixed value in *val.
7549 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7550 unsigned dim, isl_int *val)
7552 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7555 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7556 unsigned dim, isl_int *val)
7558 return isl_set_plain_dim_is_fixed(set, dim, val);
7561 /* Check if input variable in has fixed value and if so and if val is not NULL,
7562 * then return this fixed value in *val.
7564 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7565 unsigned in, isl_int *val)
7567 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7570 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7571 * and if val is not NULL, then return this lower bound in *val.
7573 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7574 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7576 int i, i_eq = -1, i_ineq = -1;
7583 total = isl_basic_set_total_dim(bset);
7584 nparam = isl_basic_set_n_param(bset);
7585 for (i = 0; i < bset->n_eq; ++i) {
7586 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7592 for (i = 0; i < bset->n_ineq; ++i) {
7593 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7595 if (i_eq != -1 || i_ineq != -1)
7599 if (i_eq == -1 && i_ineq == -1)
7601 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7602 /* The coefficient should always be one due to normalization. */
7603 if (!isl_int_is_one(c[1+nparam+dim]))
7605 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7607 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7608 total - nparam - dim - 1) != -1)
7611 isl_int_neg(*val, c[0]);
7615 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7616 unsigned dim, isl_int *val)
7628 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7632 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7634 for (i = 1; fixed == 1 && i < set->n; ++i) {
7635 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7637 if (fixed == 1 && isl_int_ne(tmp, v))
7641 isl_int_set(*val, v);
7652 /* uset_gist depends on constraints without existentially quantified
7653 * variables sorting first.
7655 static int qsort_constraint_cmp(const void *p1, const void *p2)
7657 const struct constraint *c1 = (const struct constraint *)p1;
7658 const struct constraint *c2 = (const struct constraint *)p2;
7660 unsigned size = isl_min(c1->size, c2->size);
7662 l1 = isl_seq_last_non_zero(c1->c, size);
7663 l2 = isl_seq_last_non_zero(c2->c, size);
7668 return isl_seq_cmp(c1->c, c2->c, size);
7671 static struct isl_basic_map *isl_basic_map_sort_constraints(
7672 struct isl_basic_map *bmap)
7675 struct constraint *c;
7680 total = isl_basic_map_total_dim(bmap);
7681 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7684 for (i = 0; i < bmap->n_ineq; ++i) {
7686 c[i].c = bmap->ineq[i];
7688 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7689 for (i = 0; i < bmap->n_ineq; ++i)
7690 bmap->ineq[i] = c[i].c;
7694 isl_basic_map_free(bmap);
7698 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7699 __isl_take isl_basic_set *bset)
7701 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7702 (struct isl_basic_map *)bset);
7705 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7709 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7711 bmap = isl_basic_map_remove_redundancies(bmap);
7712 bmap = isl_basic_map_sort_constraints(bmap);
7713 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7717 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7719 return (struct isl_basic_set *)isl_basic_map_normalize(
7720 (struct isl_basic_map *)bset);
7723 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7724 const __isl_keep isl_basic_map *bmap2)
7731 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7732 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7733 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7734 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7735 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7736 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7737 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7738 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7739 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7740 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7741 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7743 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7745 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7747 if (bmap1->n_eq != bmap2->n_eq)
7748 return bmap1->n_eq - bmap2->n_eq;
7749 if (bmap1->n_ineq != bmap2->n_ineq)
7750 return bmap1->n_ineq - bmap2->n_ineq;
7751 if (bmap1->n_div != bmap2->n_div)
7752 return bmap1->n_div - bmap2->n_div;
7753 total = isl_basic_map_total_dim(bmap1);
7754 for (i = 0; i < bmap1->n_eq; ++i) {
7755 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7759 for (i = 0; i < bmap1->n_ineq; ++i) {
7760 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7764 for (i = 0; i < bmap1->n_div; ++i) {
7765 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7772 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
7773 const __isl_keep isl_basic_set *bset2)
7775 return isl_basic_map_plain_cmp(bset1, bset2);
7778 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
7779 const __isl_keep isl_set *set2)
7785 if (set1->n != set2->n)
7786 return set1->n - set2->n;
7788 for (i = 0; i < set1->n; ++i) {
7789 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
7797 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7798 __isl_keep isl_basic_map *bmap2)
7800 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7803 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7804 __isl_keep isl_basic_set *bset2)
7806 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7807 (isl_basic_map *)bset2);
7810 static int qsort_bmap_cmp(const void *p1, const void *p2)
7812 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7813 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7815 return isl_basic_map_plain_cmp(bmap1, bmap2);
7818 /* We normalize in place, but if anything goes wrong we need
7819 * to return NULL, so we need to make sure we don't change the
7820 * meaning of any possible other copies of map.
7822 struct isl_map *isl_map_normalize(struct isl_map *map)
7825 struct isl_basic_map *bmap;
7829 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7831 for (i = 0; i < map->n; ++i) {
7832 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7835 isl_basic_map_free(map->p[i]);
7838 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7839 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7840 map = isl_map_remove_empty_parts(map);
7843 for (i = map->n - 1; i >= 1; --i) {
7844 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7846 isl_basic_map_free(map->p[i-1]);
7847 for (j = i; j < map->n; ++j)
7848 map->p[j-1] = map->p[j];
7858 struct isl_set *isl_set_normalize(struct isl_set *set)
7860 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7863 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7873 if (!isl_space_is_equal(map1->dim, map2->dim))
7876 map1 = isl_map_copy(map1);
7877 map2 = isl_map_copy(map2);
7878 map1 = isl_map_normalize(map1);
7879 map2 = isl_map_normalize(map2);
7882 equal = map1->n == map2->n;
7883 for (i = 0; equal && i < map1->n; ++i) {
7884 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7897 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7899 return isl_map_plain_is_equal(map1, map2);
7902 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7904 return isl_map_plain_is_equal((struct isl_map *)set1,
7905 (struct isl_map *)set2);
7908 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7910 return isl_set_plain_is_equal(set1, set2);
7913 /* Return an interval that ranges from min to max (inclusive)
7915 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7916 isl_int min, isl_int max)
7919 struct isl_basic_set *bset = NULL;
7921 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7925 k = isl_basic_set_alloc_inequality(bset);
7928 isl_int_set_si(bset->ineq[k][1], 1);
7929 isl_int_neg(bset->ineq[k][0], min);
7931 k = isl_basic_set_alloc_inequality(bset);
7934 isl_int_set_si(bset->ineq[k][1], -1);
7935 isl_int_set(bset->ineq[k][0], max);
7939 isl_basic_set_free(bset);
7943 /* Return the Cartesian product of the basic sets in list (in the given order).
7945 __isl_give isl_basic_set *isl_basic_set_list_product(
7946 __isl_take struct isl_basic_set_list *list)
7954 struct isl_basic_set *product = NULL;
7958 isl_assert(list->ctx, list->n > 0, goto error);
7959 isl_assert(list->ctx, list->p[0], goto error);
7960 nparam = isl_basic_set_n_param(list->p[0]);
7961 dim = isl_basic_set_n_dim(list->p[0]);
7962 extra = list->p[0]->n_div;
7963 n_eq = list->p[0]->n_eq;
7964 n_ineq = list->p[0]->n_ineq;
7965 for (i = 1; i < list->n; ++i) {
7966 isl_assert(list->ctx, list->p[i], goto error);
7967 isl_assert(list->ctx,
7968 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7969 dim += isl_basic_set_n_dim(list->p[i]);
7970 extra += list->p[i]->n_div;
7971 n_eq += list->p[i]->n_eq;
7972 n_ineq += list->p[i]->n_ineq;
7974 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7979 for (i = 0; i < list->n; ++i) {
7980 isl_basic_set_add_constraints(product,
7981 isl_basic_set_copy(list->p[i]), dim);
7982 dim += isl_basic_set_n_dim(list->p[i]);
7984 isl_basic_set_list_free(list);
7987 isl_basic_set_free(product);
7988 isl_basic_set_list_free(list);
7992 struct isl_basic_map *isl_basic_map_product(
7993 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7995 isl_space *dim_result = NULL;
7996 struct isl_basic_map *bmap;
7997 unsigned in1, in2, out1, out2, nparam, total, pos;
7998 struct isl_dim_map *dim_map1, *dim_map2;
8000 if (!bmap1 || !bmap2)
8003 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8004 bmap2->dim, isl_dim_param), goto error);
8005 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8006 isl_space_copy(bmap2->dim));
8008 in1 = isl_basic_map_n_in(bmap1);
8009 in2 = isl_basic_map_n_in(bmap2);
8010 out1 = isl_basic_map_n_out(bmap1);
8011 out2 = isl_basic_map_n_out(bmap2);
8012 nparam = isl_basic_map_n_param(bmap1);
8014 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8015 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8016 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8017 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8018 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8019 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8020 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8021 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8022 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8023 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8024 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8026 bmap = isl_basic_map_alloc_space(dim_result,
8027 bmap1->n_div + bmap2->n_div,
8028 bmap1->n_eq + bmap2->n_eq,
8029 bmap1->n_ineq + bmap2->n_ineq);
8030 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8031 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8032 bmap = isl_basic_map_simplify(bmap);
8033 return isl_basic_map_finalize(bmap);
8035 isl_basic_map_free(bmap1);
8036 isl_basic_map_free(bmap2);
8040 __isl_give isl_basic_map *isl_basic_map_flat_product(
8041 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8043 isl_basic_map *prod;
8045 prod = isl_basic_map_product(bmap1, bmap2);
8046 prod = isl_basic_map_flatten(prod);
8050 __isl_give isl_basic_set *isl_basic_set_flat_product(
8051 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8053 return isl_basic_map_flat_range_product(bset1, bset2);
8056 __isl_give isl_basic_map *isl_basic_map_domain_product(
8057 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8059 isl_space *space_result = NULL;
8060 isl_basic_map *bmap;
8061 unsigned in1, in2, out, nparam, total, pos;
8062 struct isl_dim_map *dim_map1, *dim_map2;
8064 if (!bmap1 || !bmap2)
8067 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8068 isl_space_copy(bmap2->dim));
8070 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8071 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8072 out = isl_basic_map_dim(bmap1, isl_dim_out);
8073 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8075 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8076 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8077 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8078 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8079 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8080 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8081 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8082 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8083 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8084 isl_dim_map_div(dim_map1, bmap1, pos += out);
8085 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8087 bmap = isl_basic_map_alloc_space(space_result,
8088 bmap1->n_div + bmap2->n_div,
8089 bmap1->n_eq + bmap2->n_eq,
8090 bmap1->n_ineq + bmap2->n_ineq);
8091 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8092 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8093 bmap = isl_basic_map_simplify(bmap);
8094 return isl_basic_map_finalize(bmap);
8096 isl_basic_map_free(bmap1);
8097 isl_basic_map_free(bmap2);
8101 __isl_give isl_basic_map *isl_basic_map_range_product(
8102 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8104 isl_space *dim_result = NULL;
8105 isl_basic_map *bmap;
8106 unsigned in, out1, out2, nparam, total, pos;
8107 struct isl_dim_map *dim_map1, *dim_map2;
8109 if (!bmap1 || !bmap2)
8112 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8113 isl_space_copy(bmap2->dim));
8115 in = isl_basic_map_dim(bmap1, isl_dim_in);
8116 out1 = isl_basic_map_n_out(bmap1);
8117 out2 = isl_basic_map_n_out(bmap2);
8118 nparam = isl_basic_map_n_param(bmap1);
8120 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8121 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8122 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8123 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8124 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8125 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8126 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8127 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8128 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8129 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8130 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8132 bmap = isl_basic_map_alloc_space(dim_result,
8133 bmap1->n_div + bmap2->n_div,
8134 bmap1->n_eq + bmap2->n_eq,
8135 bmap1->n_ineq + bmap2->n_ineq);
8136 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8137 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8138 bmap = isl_basic_map_simplify(bmap);
8139 return isl_basic_map_finalize(bmap);
8141 isl_basic_map_free(bmap1);
8142 isl_basic_map_free(bmap2);
8146 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8147 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8149 isl_basic_map *prod;
8151 prod = isl_basic_map_range_product(bmap1, bmap2);
8152 prod = isl_basic_map_flatten_range(prod);
8156 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8157 __isl_take isl_map *map2,
8158 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8159 __isl_take isl_space *right),
8160 __isl_give isl_basic_map *(*basic_map_product)(
8161 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8164 struct isl_map *result;
8170 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8171 map2->dim, isl_dim_param), goto error);
8173 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8174 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8175 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8177 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8178 isl_space_copy(map2->dim)),
8179 map1->n * map2->n, flags);
8182 for (i = 0; i < map1->n; ++i)
8183 for (j = 0; j < map2->n; ++j) {
8184 struct isl_basic_map *part;
8185 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8186 isl_basic_map_copy(map2->p[j]));
8187 if (isl_basic_map_is_empty(part))
8188 isl_basic_map_free(part);
8190 result = isl_map_add_basic_map(result, part);
8203 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8205 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8206 __isl_take isl_map *map2)
8208 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8211 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8212 __isl_take isl_map *map2)
8214 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8217 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8219 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8220 __isl_take isl_map *map2)
8224 prod = isl_map_product(map1, map2);
8225 prod = isl_map_flatten(prod);
8229 /* Given two set A and B, construct its Cartesian product A x B.
8231 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8233 return isl_map_range_product(set1, set2);
8236 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8237 __isl_take isl_set *set2)
8239 return isl_map_flat_range_product(set1, set2);
8242 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8244 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8245 __isl_take isl_map *map2)
8247 return map_product(map1, map2, &isl_space_domain_product,
8248 &isl_basic_map_domain_product);
8251 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8253 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8254 __isl_take isl_map *map2)
8256 return map_product(map1, map2, &isl_space_range_product,
8257 &isl_basic_map_range_product);
8260 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8261 __isl_take isl_map *map2)
8263 return isl_map_align_params_map_map_and(map1, map2,
8264 &map_domain_product_aligned);
8267 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8268 __isl_take isl_map *map2)
8270 return isl_map_align_params_map_map_and(map1, map2,
8271 &map_range_product_aligned);
8274 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8276 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8277 __isl_take isl_map *map2)
8281 prod = isl_map_domain_product(map1, map2);
8282 prod = isl_map_flatten_domain(prod);
8286 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8288 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8289 __isl_take isl_map *map2)
8293 prod = isl_map_range_product(map1, map2);
8294 prod = isl_map_flatten_range(prod);
8298 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8301 uint32_t hash = isl_hash_init();
8306 bmap = isl_basic_map_copy(bmap);
8307 bmap = isl_basic_map_normalize(bmap);
8310 total = isl_basic_map_total_dim(bmap);
8311 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8312 for (i = 0; i < bmap->n_eq; ++i) {
8314 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8315 isl_hash_hash(hash, c_hash);
8317 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8318 for (i = 0; i < bmap->n_ineq; ++i) {
8320 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8321 isl_hash_hash(hash, c_hash);
8323 isl_hash_byte(hash, bmap->n_div & 0xFF);
8324 for (i = 0; i < bmap->n_div; ++i) {
8326 if (isl_int_is_zero(bmap->div[i][0]))
8328 isl_hash_byte(hash, i & 0xFF);
8329 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8330 isl_hash_hash(hash, c_hash);
8332 isl_basic_map_free(bmap);
8336 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8338 return isl_basic_map_get_hash((isl_basic_map *)bset);
8341 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8348 map = isl_map_copy(map);
8349 map = isl_map_normalize(map);
8353 hash = isl_hash_init();
8354 for (i = 0; i < map->n; ++i) {
8356 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8357 isl_hash_hash(hash, bmap_hash);
8365 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8367 return isl_map_get_hash((isl_map *)set);
8370 /* Check if the value for dimension dim is completely determined
8371 * by the values of the other parameters and variables.
8372 * That is, check if dimension dim is involved in an equality.
8374 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8381 nparam = isl_basic_set_n_param(bset);
8382 for (i = 0; i < bset->n_eq; ++i)
8383 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8388 /* Check if the value for dimension dim is completely determined
8389 * by the values of the other parameters and variables.
8390 * That is, check if dimension dim is involved in an equality
8391 * for each of the subsets.
8393 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8399 for (i = 0; i < set->n; ++i) {
8401 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8408 int isl_set_n_basic_set(__isl_keep isl_set *set)
8410 return set ? set->n : 0;
8413 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8414 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8421 for (i = 0; i < map->n; ++i)
8422 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8428 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8429 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8436 for (i = 0; i < set->n; ++i)
8437 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8443 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8450 bset = isl_basic_set_cow(bset);
8454 dim = isl_basic_set_get_space(bset);
8455 dim = isl_space_lift(dim, bset->n_div);
8458 isl_space_free(bset->dim);
8460 bset->extra -= bset->n_div;
8463 bset = isl_basic_set_finalize(bset);
8467 isl_basic_set_free(bset);
8471 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8477 set = isl_set_align_divs(set);
8482 set = isl_set_cow(set);
8486 n_div = set->p[0]->n_div;
8487 dim = isl_set_get_space(set);
8488 dim = isl_space_lift(dim, n_div);
8491 isl_space_free(set->dim);
8494 for (i = 0; i < set->n; ++i) {
8495 set->p[i] = isl_basic_set_lift(set->p[i]);
8506 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8509 struct isl_basic_map *bmap;
8516 set = isl_set_align_divs(set);
8521 dim = isl_set_get_space(set);
8522 if (set->n == 0 || set->p[0]->n_div == 0) {
8524 return isl_map_identity(isl_space_map_from_set(dim));
8527 n_div = set->p[0]->n_div;
8528 dim = isl_space_map_from_set(dim);
8529 n_param = isl_space_dim(dim, isl_dim_param);
8530 n_set = isl_space_dim(dim, isl_dim_in);
8531 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8532 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8533 for (i = 0; i < n_set; ++i)
8534 bmap = var_equal(bmap, i);
8536 total = n_param + n_set + n_set + n_div;
8537 for (i = 0; i < n_div; ++i) {
8538 k = isl_basic_map_alloc_inequality(bmap);
8541 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8542 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8543 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8544 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8545 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8546 set->p[0]->div[i][0]);
8548 l = isl_basic_map_alloc_inequality(bmap);
8551 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8552 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8553 set->p[0]->div[i][0]);
8554 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8558 bmap = isl_basic_map_simplify(bmap);
8559 bmap = isl_basic_map_finalize(bmap);
8560 return isl_map_from_basic_map(bmap);
8563 isl_basic_map_free(bmap);
8567 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8575 dim = isl_basic_set_total_dim(bset);
8576 size += bset->n_eq * (1 + dim);
8577 size += bset->n_ineq * (1 + dim);
8578 size += bset->n_div * (2 + dim);
8583 int isl_set_size(__isl_keep isl_set *set)
8591 for (i = 0; i < set->n; ++i)
8592 size += isl_basic_set_size(set->p[i]);
8597 /* Check if there is any lower bound (if lower == 0) and/or upper
8598 * bound (if upper == 0) on the specified dim.
8600 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8601 enum isl_dim_type type, unsigned pos, int lower, int upper)
8608 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8610 pos += isl_basic_map_offset(bmap, type);
8612 for (i = 0; i < bmap->n_div; ++i) {
8613 if (isl_int_is_zero(bmap->div[i][0]))
8615 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8619 for (i = 0; i < bmap->n_eq; ++i)
8620 if (!isl_int_is_zero(bmap->eq[i][pos]))
8623 for (i = 0; i < bmap->n_ineq; ++i) {
8624 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8631 return lower && upper;
8634 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8635 enum isl_dim_type type, unsigned pos)
8637 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8640 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8641 enum isl_dim_type type, unsigned pos)
8643 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8646 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8647 enum isl_dim_type type, unsigned pos)
8649 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8652 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8653 enum isl_dim_type type, unsigned pos)
8660 for (i = 0; i < map->n; ++i) {
8662 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8663 if (bounded < 0 || !bounded)
8670 /* Return 1 if the specified dim is involved in both an upper bound
8671 * and a lower bound.
8673 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8674 enum isl_dim_type type, unsigned pos)
8676 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8679 static int has_bound(__isl_keep isl_map *map,
8680 enum isl_dim_type type, unsigned pos,
8681 int (*fn)(__isl_keep isl_basic_map *bmap,
8682 enum isl_dim_type type, unsigned pos))
8689 for (i = 0; i < map->n; ++i) {
8691 bounded = fn(map->p[i], type, pos);
8692 if (bounded < 0 || bounded)
8699 /* Return 1 if the specified dim is involved in any lower bound.
8701 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8702 enum isl_dim_type type, unsigned pos)
8704 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8707 /* Return 1 if the specified dim is involved in any upper bound.
8709 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8710 enum isl_dim_type type, unsigned pos)
8712 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8715 /* For each of the "n" variables starting at "first", determine
8716 * the sign of the variable and put the results in the first "n"
8717 * elements of the array "signs".
8719 * 1 means that the variable is non-negative
8720 * -1 means that the variable is non-positive
8721 * 0 means the variable attains both positive and negative values.
8723 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8724 unsigned first, unsigned n, int *signs)
8726 isl_vec *bound = NULL;
8727 struct isl_tab *tab = NULL;
8728 struct isl_tab_undo *snap;
8731 if (!bset || !signs)
8734 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8735 tab = isl_tab_from_basic_set(bset, 0);
8739 isl_seq_clr(bound->el, bound->size);
8740 isl_int_set_si(bound->el[0], -1);
8742 snap = isl_tab_snap(tab);
8743 for (i = 0; i < n; ++i) {
8746 isl_int_set_si(bound->el[1 + first + i], -1);
8747 if (isl_tab_add_ineq(tab, bound->el) < 0)
8750 isl_int_set_si(bound->el[1 + first + i], 0);
8751 if (isl_tab_rollback(tab, snap) < 0)
8759 isl_int_set_si(bound->el[1 + first + i], 1);
8760 if (isl_tab_add_ineq(tab, bound->el) < 0)
8763 isl_int_set_si(bound->el[1 + first + i], 0);
8764 if (isl_tab_rollback(tab, snap) < 0)
8767 signs[i] = empty ? -1 : 0;
8771 isl_vec_free(bound);
8775 isl_vec_free(bound);
8779 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8780 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8782 if (!bset || !signs)
8784 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8787 first += pos(bset->dim, type) - 1;
8788 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8791 /* Check if the given basic map is obviously single-valued.
8792 * In particular, for each output dimension, check that there is
8793 * an equality that defines the output dimension in terms of
8794 * earlier dimensions.
8796 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8806 total = 1 + isl_basic_map_total_dim(bmap);
8807 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8808 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8810 for (i = 0; i < n_out; ++i) {
8811 for (j = 0; j < bmap->n_eq; ++j) {
8812 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8814 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8815 total - (o_out + i + 1)) == -1)
8818 if (j >= bmap->n_eq)
8825 /* Check if the given map is obviously single-valued.
8827 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8836 return isl_basic_map_plain_is_single_valued(map->p[0]);
8839 /* Check if the given map is single-valued.
8844 * and check if the result is a subset of the identity mapping.
8846 int isl_map_is_single_valued(__isl_keep isl_map *map)
8853 sv = isl_map_plain_is_single_valued(map);
8857 test = isl_map_reverse(isl_map_copy(map));
8858 test = isl_map_apply_range(test, isl_map_copy(map));
8860 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
8861 id = isl_map_identity(dim);
8863 sv = isl_map_is_subset(test, id);
8871 int isl_map_is_injective(__isl_keep isl_map *map)
8875 map = isl_map_copy(map);
8876 map = isl_map_reverse(map);
8877 in = isl_map_is_single_valued(map);
8883 /* Check if the given map is obviously injective.
8885 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8889 map = isl_map_copy(map);
8890 map = isl_map_reverse(map);
8891 in = isl_map_plain_is_single_valued(map);
8897 int isl_map_is_bijective(__isl_keep isl_map *map)
8901 sv = isl_map_is_single_valued(map);
8905 return isl_map_is_injective(map);
8908 int isl_set_is_singleton(__isl_keep isl_set *set)
8910 return isl_map_is_single_valued((isl_map *)set);
8913 int isl_map_is_translation(__isl_keep isl_map *map)
8918 delta = isl_map_deltas(isl_map_copy(map));
8919 ok = isl_set_is_singleton(delta);
8920 isl_set_free(delta);
8925 static int unique(isl_int *p, unsigned pos, unsigned len)
8927 if (isl_seq_first_non_zero(p, pos) != -1)
8929 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8934 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8943 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8946 nvar = isl_basic_set_dim(bset, isl_dim_set);
8947 ovar = isl_space_offset(bset->dim, isl_dim_set);
8948 for (j = 0; j < nvar; ++j) {
8949 int lower = 0, upper = 0;
8950 for (i = 0; i < bset->n_eq; ++i) {
8951 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8953 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8959 for (i = 0; i < bset->n_ineq; ++i) {
8960 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8962 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8964 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8969 if (!lower || !upper)
8976 int isl_set_is_box(__isl_keep isl_set *set)
8983 return isl_basic_set_is_box(set->p[0]);
8986 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8991 return isl_space_is_wrapping(bset->dim);
8994 int isl_set_is_wrapping(__isl_keep isl_set *set)
8999 return isl_space_is_wrapping(set->dim);
9002 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9004 bmap = isl_basic_map_cow(bmap);
9008 bmap->dim = isl_space_wrap(bmap->dim);
9012 bmap = isl_basic_map_finalize(bmap);
9014 return (isl_basic_set *)bmap;
9016 isl_basic_map_free(bmap);
9020 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9024 map = isl_map_cow(map);
9028 for (i = 0; i < map->n; ++i) {
9029 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9033 map->dim = isl_space_wrap(map->dim);
9037 return (isl_set *)map;
9043 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9045 bset = isl_basic_set_cow(bset);
9049 bset->dim = isl_space_unwrap(bset->dim);
9053 bset = isl_basic_set_finalize(bset);
9055 return (isl_basic_map *)bset;
9057 isl_basic_set_free(bset);
9061 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9068 if (!isl_set_is_wrapping(set))
9069 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9072 set = isl_set_cow(set);
9076 for (i = 0; i < set->n; ++i) {
9077 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9082 set->dim = isl_space_unwrap(set->dim);
9086 return (isl_map *)set;
9092 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9093 enum isl_dim_type type)
9098 if (!isl_space_is_named_or_nested(bmap->dim, type))
9101 bmap = isl_basic_map_cow(bmap);
9105 bmap->dim = isl_space_reset(bmap->dim, type);
9109 bmap = isl_basic_map_finalize(bmap);
9113 isl_basic_map_free(bmap);
9117 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9118 enum isl_dim_type type)
9125 if (!isl_space_is_named_or_nested(map->dim, type))
9128 map = isl_map_cow(map);
9132 for (i = 0; i < map->n; ++i) {
9133 map->p[i] = isl_basic_map_reset(map->p[i], type);
9137 map->dim = isl_space_reset(map->dim, type);
9147 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9152 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9155 bmap = isl_basic_map_cow(bmap);
9159 bmap->dim = isl_space_flatten(bmap->dim);
9163 bmap = isl_basic_map_finalize(bmap);
9167 isl_basic_map_free(bmap);
9171 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9173 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9176 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9177 __isl_take isl_basic_map *bmap)
9182 if (!bmap->dim->nested[0])
9185 bmap = isl_basic_map_cow(bmap);
9189 bmap->dim = isl_space_flatten_domain(bmap->dim);
9193 bmap = isl_basic_map_finalize(bmap);
9197 isl_basic_map_free(bmap);
9201 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9202 __isl_take isl_basic_map *bmap)
9207 if (!bmap->dim->nested[1])
9210 bmap = isl_basic_map_cow(bmap);
9214 bmap->dim = isl_space_flatten_range(bmap->dim);
9218 bmap = isl_basic_map_finalize(bmap);
9222 isl_basic_map_free(bmap);
9226 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9233 if (!map->dim->nested[0] && !map->dim->nested[1])
9236 map = isl_map_cow(map);
9240 for (i = 0; i < map->n; ++i) {
9241 map->p[i] = isl_basic_map_flatten(map->p[i]);
9245 map->dim = isl_space_flatten(map->dim);
9255 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9257 return (isl_set *)isl_map_flatten((isl_map *)set);
9260 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9262 isl_space *dim, *flat_dim;
9265 dim = isl_set_get_space(set);
9266 flat_dim = isl_space_flatten(isl_space_copy(dim));
9267 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9268 map = isl_map_intersect_domain(map, set);
9273 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9280 if (!map->dim->nested[0])
9283 map = isl_map_cow(map);
9287 for (i = 0; i < map->n; ++i) {
9288 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9292 map->dim = isl_space_flatten_domain(map->dim);
9302 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9309 if (!map->dim->nested[1])
9312 map = isl_map_cow(map);
9316 for (i = 0; i < map->n; ++i) {
9317 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9321 map->dim = isl_space_flatten_range(map->dim);
9331 /* Reorder the dimensions of "bmap" according to the given dim_map
9332 * and set the dimension specification to "dim".
9334 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9335 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9340 bmap = isl_basic_map_cow(bmap);
9341 if (!bmap || !dim || !dim_map)
9344 flags = bmap->flags;
9345 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9346 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9347 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9348 res = isl_basic_map_alloc_space(dim,
9349 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9350 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9353 res = isl_basic_map_finalize(res);
9357 isl_basic_map_free(bmap);
9358 isl_space_free(dim);
9362 /* Reorder the dimensions of "map" according to given reordering.
9364 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9365 __isl_take isl_reordering *r)
9368 struct isl_dim_map *dim_map;
9370 map = isl_map_cow(map);
9371 dim_map = isl_dim_map_from_reordering(r);
9372 if (!map || !r || !dim_map)
9375 for (i = 0; i < map->n; ++i) {
9376 struct isl_dim_map *dim_map_i;
9378 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9380 map->p[i] = isl_basic_map_realign(map->p[i],
9381 isl_space_copy(r->dim), dim_map_i);
9387 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9389 isl_reordering_free(r);
9395 isl_reordering_free(r);
9399 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9400 __isl_take isl_reordering *r)
9402 return (isl_set *)isl_map_realign((isl_map *)set, r);
9405 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9406 __isl_take isl_space *model)
9413 ctx = isl_space_get_ctx(model);
9414 if (!isl_space_has_named_params(model))
9415 isl_die(ctx, isl_error_invalid,
9416 "model has unnamed parameters", goto error);
9417 if (!isl_space_has_named_params(map->dim))
9418 isl_die(ctx, isl_error_invalid,
9419 "relation has unnamed parameters", goto error);
9420 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9421 isl_reordering *exp;
9423 model = isl_space_drop_dims(model, isl_dim_in,
9424 0, isl_space_dim(model, isl_dim_in));
9425 model = isl_space_drop_dims(model, isl_dim_out,
9426 0, isl_space_dim(model, isl_dim_out));
9427 exp = isl_parameter_alignment_reordering(map->dim, model);
9428 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9429 map = isl_map_realign(map, exp);
9432 isl_space_free(model);
9435 isl_space_free(model);
9440 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9441 __isl_take isl_space *model)
9443 return isl_map_align_params(set, model);
9446 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9447 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9448 enum isl_dim_type c2, enum isl_dim_type c3,
9449 enum isl_dim_type c4, enum isl_dim_type c5)
9451 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9452 struct isl_mat *mat;
9458 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9459 isl_basic_map_total_dim(bmap) + 1);
9462 for (i = 0; i < bmap->n_eq; ++i)
9463 for (j = 0, pos = 0; j < 5; ++j) {
9464 int off = isl_basic_map_offset(bmap, c[j]);
9465 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9466 isl_int_set(mat->row[i][pos],
9467 bmap->eq[i][off + k]);
9475 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9476 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9477 enum isl_dim_type c2, enum isl_dim_type c3,
9478 enum isl_dim_type c4, enum isl_dim_type c5)
9480 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9481 struct isl_mat *mat;
9487 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9488 isl_basic_map_total_dim(bmap) + 1);
9491 for (i = 0; i < bmap->n_ineq; ++i)
9492 for (j = 0, pos = 0; j < 5; ++j) {
9493 int off = isl_basic_map_offset(bmap, c[j]);
9494 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9495 isl_int_set(mat->row[i][pos],
9496 bmap->ineq[i][off + k]);
9504 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9505 __isl_take isl_space *dim,
9506 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9507 enum isl_dim_type c2, enum isl_dim_type c3,
9508 enum isl_dim_type c4, enum isl_dim_type c5)
9510 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9511 isl_basic_map *bmap;
9517 if (!dim || !eq || !ineq)
9520 if (eq->n_col != ineq->n_col)
9521 isl_die(dim->ctx, isl_error_invalid,
9522 "equalities and inequalities matrices should have "
9523 "same number of columns", goto error);
9525 total = 1 + isl_space_dim(dim, isl_dim_all);
9527 if (eq->n_col < total)
9528 isl_die(dim->ctx, isl_error_invalid,
9529 "number of columns too small", goto error);
9531 extra = eq->n_col - total;
9533 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9534 eq->n_row, ineq->n_row);
9537 for (i = 0; i < extra; ++i) {
9538 k = isl_basic_map_alloc_div(bmap);
9541 isl_int_set_si(bmap->div[k][0], 0);
9543 for (i = 0; i < eq->n_row; ++i) {
9544 l = isl_basic_map_alloc_equality(bmap);
9547 for (j = 0, pos = 0; j < 5; ++j) {
9548 int off = isl_basic_map_offset(bmap, c[j]);
9549 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9550 isl_int_set(bmap->eq[l][off + k],
9556 for (i = 0; i < ineq->n_row; ++i) {
9557 l = isl_basic_map_alloc_inequality(bmap);
9560 for (j = 0, pos = 0; j < 5; ++j) {
9561 int off = isl_basic_map_offset(bmap, c[j]);
9562 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9563 isl_int_set(bmap->ineq[l][off + k],
9570 isl_space_free(dim);
9576 isl_space_free(dim);
9582 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9583 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9584 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9586 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9587 c1, c2, c3, c4, isl_dim_in);
9590 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9591 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9592 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9594 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9595 c1, c2, c3, c4, isl_dim_in);
9598 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9599 __isl_take isl_space *dim,
9600 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9601 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9603 return (isl_basic_set*)
9604 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9605 c1, c2, c3, c4, isl_dim_in);
9608 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9613 return isl_space_can_zip(bmap->dim);
9616 int isl_map_can_zip(__isl_keep isl_map *map)
9621 return isl_space_can_zip(map->dim);
9624 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9625 * (A -> C) -> (B -> D).
9627 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9636 if (!isl_basic_map_can_zip(bmap))
9637 isl_die(bmap->ctx, isl_error_invalid,
9638 "basic map cannot be zipped", goto error);
9639 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9640 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
9641 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
9642 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
9643 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9646 bmap->dim = isl_space_zip(bmap->dim);
9651 isl_basic_map_free(bmap);
9655 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9656 * (A -> C) -> (B -> D).
9658 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9665 if (!isl_map_can_zip(map))
9666 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9669 map = isl_map_cow(map);
9673 for (i = 0; i < map->n; ++i) {
9674 map->p[i] = isl_basic_map_zip(map->p[i]);
9679 map->dim = isl_space_zip(map->dim);
9689 /* Construct a basic map mapping the domain of the affine expression
9690 * to a one-dimensional range prescribed by the affine expression.
9692 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9696 isl_local_space *ls;
9697 isl_basic_map *bmap;
9702 ls = isl_aff_get_local_space(aff);
9703 bmap = isl_basic_map_from_local_space(ls);
9704 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9705 k = isl_basic_map_alloc_equality(bmap);
9709 pos = isl_basic_map_offset(bmap, isl_dim_out);
9710 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9711 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9712 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9713 aff->v->size - (pos + 1));
9716 bmap = isl_basic_map_finalize(bmap);
9720 isl_basic_map_free(bmap);
9724 /* Construct a basic map mapping the domain the multi-affine expression
9725 * to its range, with each dimension in the range equated to the
9726 * corresponding affine expression.
9728 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
9729 __isl_take isl_multi_aff *maff)
9733 isl_basic_map *bmap;
9738 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
9739 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
9740 "invalid space", return isl_multi_aff_free(maff));
9742 space = isl_space_domain(isl_multi_aff_get_space(maff));
9743 bmap = isl_basic_map_universe(isl_space_from_domain(space));
9745 for (i = 0; i < maff->n; ++i) {
9747 isl_basic_map *bmap_i;
9749 aff = isl_aff_copy(maff->p[i]);
9750 bmap_i = isl_basic_map_from_aff(aff);
9752 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9755 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
9757 isl_multi_aff_free(maff);
9761 /* Construct a basic map mapping a domain in the given space to
9762 * to an n-dimensional range, with n the number of elements in the list,
9763 * where each coordinate in the range is prescribed by the
9764 * corresponding affine expression.
9765 * The domains of all affine expressions in the list are assumed to match
9768 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9769 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
9773 isl_basic_map *bmap;
9778 dim = isl_space_from_domain(domain_dim);
9779 bmap = isl_basic_map_universe(dim);
9781 for (i = 0; i < list->n; ++i) {
9783 isl_basic_map *bmap_i;
9785 aff = isl_aff_copy(list->p[i]);
9786 bmap_i = isl_basic_map_from_aff(aff);
9788 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9791 isl_aff_list_free(list);
9795 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9796 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9798 return isl_map_equate(set, type1, pos1, type2, pos2);
9801 /* Add a constraint imposing that the given two dimensions are equal.
9803 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9804 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9806 isl_basic_map *bmap = NULL;
9812 if (pos1 >= isl_map_dim(map, type1))
9813 isl_die(map->ctx, isl_error_invalid,
9814 "index out of bounds", goto error);
9815 if (pos2 >= isl_map_dim(map, type2))
9816 isl_die(map->ctx, isl_error_invalid,
9817 "index out of bounds", goto error);
9819 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9820 i = isl_basic_map_alloc_equality(bmap);
9823 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9824 pos1 += isl_basic_map_offset(bmap, type1);
9825 pos2 += isl_basic_map_offset(bmap, type2);
9826 isl_int_set_si(bmap->eq[i][pos1], -1);
9827 isl_int_set_si(bmap->eq[i][pos2], 1);
9828 bmap = isl_basic_map_finalize(bmap);
9830 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9834 isl_basic_map_free(bmap);
9839 /* Add a constraint imposing that the given two dimensions have opposite values.
9841 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9842 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9844 isl_basic_map *bmap = NULL;
9850 if (pos1 >= isl_map_dim(map, type1))
9851 isl_die(map->ctx, isl_error_invalid,
9852 "index out of bounds", goto error);
9853 if (pos2 >= isl_map_dim(map, type2))
9854 isl_die(map->ctx, isl_error_invalid,
9855 "index out of bounds", goto error);
9857 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9858 i = isl_basic_map_alloc_equality(bmap);
9861 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9862 pos1 += isl_basic_map_offset(bmap, type1);
9863 pos2 += isl_basic_map_offset(bmap, type2);
9864 isl_int_set_si(bmap->eq[i][pos1], 1);
9865 isl_int_set_si(bmap->eq[i][pos2], 1);
9866 bmap = isl_basic_map_finalize(bmap);
9868 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9872 isl_basic_map_free(bmap);
9877 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
9881 isl_local_space *ls;
9886 if (!isl_basic_map_divs_known(bmap))
9887 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
9888 "some divs are unknown", return NULL);
9890 ls = isl_basic_map_get_local_space(bmap);
9891 div = isl_local_space_get_div(ls, pos);
9892 isl_local_space_free(ls);
9897 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
9900 return isl_basic_map_get_div(bset, pos);
9903 /* Plug in "subs" for dimension "type", "pos" of "bset".
9905 * Let i be the dimension to replace and let "subs" be of the form
9909 * Any integer division with a non-zero coefficient for i,
9911 * floor((a i + g)/m)
9915 * floor((a f + d g)/(m d))
9917 * Constraints of the form
9925 __isl_give isl_basic_set *isl_basic_set_substitute(
9926 __isl_take isl_basic_set *bset,
9927 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
9933 if (bset && isl_basic_set_plain_is_empty(bset))
9936 bset = isl_basic_set_cow(bset);
9940 ctx = isl_basic_set_get_ctx(bset);
9941 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
9942 isl_die(ctx, isl_error_invalid,
9943 "spaces don't match", goto error);
9944 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
9945 isl_die(ctx, isl_error_unsupported,
9946 "cannot handle divs yet", goto error);
9948 pos += isl_basic_set_offset(bset, type);
9952 for (i = 0; i < bset->n_eq; ++i) {
9953 if (isl_int_is_zero(bset->eq[i][pos]))
9955 isl_int_set(v, bset->eq[i][pos]);
9956 isl_int_set_si(bset->eq[i][pos], 0);
9957 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
9958 v, subs->v->el + 1, subs->v->size - 1);
9961 for (i = 0; i < bset->n_ineq; ++i) {
9962 if (isl_int_is_zero(bset->ineq[i][pos]))
9964 isl_int_set(v, bset->ineq[i][pos]);
9965 isl_int_set_si(bset->ineq[i][pos], 0);
9966 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
9967 v, subs->v->el + 1, subs->v->size - 1);
9970 for (i = 0; i < bset->n_div; ++i) {
9971 if (isl_int_is_zero(bset->div[i][1 + pos]))
9973 isl_int_set(v, bset->div[i][1 + pos]);
9974 isl_int_set_si(bset->div[i][1 + pos], 0);
9975 isl_seq_combine(bset->div[i] + 1,
9976 subs->v->el[0], bset->div[i] + 1,
9977 v, subs->v->el + 1, subs->v->size - 1);
9978 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
9983 bset = isl_basic_set_simplify(bset);
9984 return isl_basic_set_finalize(bset);
9986 isl_basic_set_free(bset);
9990 /* Plug in "subs" for dimension "type", "pos" of "set".
9992 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
9993 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
9997 if (set && isl_set_plain_is_empty(set))
10000 set = isl_set_cow(set);
10004 for (i = set->n - 1; i >= 0; --i) {
10005 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10008 if (isl_basic_set_plain_is_empty(set->p[i])) {
10009 isl_basic_set_free(set->p[i]);
10010 if (i != set->n - 1)
10011 set->p[i] = set->p[set->n - 1];