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 if (isl_basic_map_plain_is_empty(bmap)) {
2700 isl_basic_map_free(bmap);
2701 return isl_basic_map_set_to_empty(res);
2703 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2704 return isl_basic_map_finalize(res);
2707 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2708 enum isl_dim_type type, unsigned n)
2712 return isl_basic_map_insert(bmap, type,
2713 isl_basic_map_dim(bmap, type), n);
2716 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2717 enum isl_dim_type type, unsigned n)
2721 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2722 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2724 isl_basic_set_free(bset);
2728 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2729 enum isl_dim_type type)
2733 if (!map || !isl_space_is_named_or_nested(map->dim, type))
2736 space = isl_map_get_space(map);
2737 space = isl_space_reset(space, type);
2738 map = isl_map_reset_space(map, space);
2742 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2743 enum isl_dim_type type, unsigned pos, unsigned n)
2748 return map_space_reset(map, type);
2750 map = isl_map_cow(map);
2754 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
2758 for (i = 0; i < map->n; ++i) {
2759 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2770 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2771 enum isl_dim_type type, unsigned pos, unsigned n)
2773 return isl_map_insert_dims(set, type, pos, n);
2776 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2777 enum isl_dim_type type, unsigned n)
2781 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2784 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2785 enum isl_dim_type type, unsigned n)
2789 isl_assert(set->ctx, type != isl_dim_in, goto error);
2790 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2796 __isl_give isl_basic_map *isl_basic_map_move_dims(
2797 __isl_take isl_basic_map *bmap,
2798 enum isl_dim_type dst_type, unsigned dst_pos,
2799 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2801 struct isl_dim_map *dim_map;
2802 struct isl_basic_map *res;
2803 enum isl_dim_type t;
2804 unsigned total, off;
2811 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2814 if (dst_type == src_type && dst_pos == src_pos)
2817 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2819 if (pos(bmap->dim, dst_type) + dst_pos ==
2820 pos(bmap->dim, src_type) + src_pos +
2821 ((src_type < dst_type) ? n : 0)) {
2822 bmap = isl_basic_map_cow(bmap);
2826 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2827 src_type, src_pos, n);
2831 bmap = isl_basic_map_finalize(bmap);
2836 total = isl_basic_map_total_dim(bmap);
2837 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2840 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2841 unsigned size = isl_space_dim(bmap->dim, t);
2842 if (t == dst_type) {
2843 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2846 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2849 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2850 dst_pos, size - dst_pos, off);
2851 off += size - dst_pos;
2852 } else if (t == src_type) {
2853 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2856 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2857 src_pos + n, size - src_pos - n, off);
2858 off += size - src_pos - n;
2860 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2864 isl_dim_map_div(dim_map, bmap, off);
2866 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2867 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2868 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2870 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2871 src_type, src_pos, n);
2875 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2876 bmap = isl_basic_map_gauss(bmap, NULL);
2877 bmap = isl_basic_map_finalize(bmap);
2881 isl_basic_map_free(bmap);
2885 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2886 enum isl_dim_type dst_type, unsigned dst_pos,
2887 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2889 return (isl_basic_set *)isl_basic_map_move_dims(
2890 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2893 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2894 enum isl_dim_type dst_type, unsigned dst_pos,
2895 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2899 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2900 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2901 src_type, src_pos, n);
2907 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2908 enum isl_dim_type dst_type, unsigned dst_pos,
2909 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2918 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2921 if (dst_type == src_type && dst_pos == src_pos)
2924 isl_assert(map->ctx, dst_type != src_type, goto error);
2926 map = isl_map_cow(map);
2930 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2934 for (i = 0; i < map->n; ++i) {
2935 map->p[i] = isl_basic_map_move_dims(map->p[i],
2937 src_type, src_pos, n);
2948 /* Move the specified dimensions to the last columns right before
2949 * the divs. Don't change the dimension specification of bmap.
2950 * That's the responsibility of the caller.
2952 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2953 enum isl_dim_type type, unsigned first, unsigned n)
2955 struct isl_dim_map *dim_map;
2956 struct isl_basic_map *res;
2957 enum isl_dim_type t;
2958 unsigned total, off;
2962 if (pos(bmap->dim, type) + first + n ==
2963 1 + isl_space_dim(bmap->dim, isl_dim_all))
2966 total = isl_basic_map_total_dim(bmap);
2967 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2970 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2971 unsigned size = isl_space_dim(bmap->dim, t);
2973 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2976 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2977 first, n, total - bmap->n_div - n);
2978 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2979 first + n, size - (first + n), off);
2980 off += size - (first + n);
2982 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2986 isl_dim_map_div(dim_map, bmap, off + n);
2988 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2989 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2990 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2994 /* Turn the n dimensions of type type, starting at first
2995 * into existentially quantified variables.
2997 __isl_give isl_basic_map *isl_basic_map_project_out(
2998 __isl_take isl_basic_map *bmap,
2999 enum isl_dim_type type, unsigned first, unsigned n)
3007 return basic_map_space_reset(bmap, type);
3012 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3013 return isl_basic_map_remove_dims(bmap, type, first, n);
3015 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3018 bmap = move_last(bmap, type, first, n);
3019 bmap = isl_basic_map_cow(bmap);
3023 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3024 old = bmap->block2.data;
3025 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3026 (bmap->extra + n) * (1 + row_size));
3027 if (!bmap->block2.data)
3029 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3032 for (i = 0; i < n; ++i) {
3033 new_div[i] = bmap->block2.data +
3034 (bmap->extra + i) * (1 + row_size);
3035 isl_seq_clr(new_div[i], 1 + row_size);
3037 for (i = 0; i < bmap->extra; ++i)
3038 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3040 bmap->div = new_div;
3044 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3047 bmap = isl_basic_map_simplify(bmap);
3048 bmap = isl_basic_map_drop_redundant_divs(bmap);
3049 return isl_basic_map_finalize(bmap);
3051 isl_basic_map_free(bmap);
3055 /* Turn the n dimensions of type type, starting at first
3056 * into existentially quantified variables.
3058 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3059 enum isl_dim_type type, unsigned first, unsigned n)
3061 return (isl_basic_set *)isl_basic_map_project_out(
3062 (isl_basic_map *)bset, type, first, n);
3065 /* Turn the n dimensions of type type, starting at first
3066 * into existentially quantified variables.
3068 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3069 enum isl_dim_type type, unsigned first, unsigned n)
3077 return map_space_reset(map, type);
3079 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3081 map = isl_map_cow(map);
3085 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3089 for (i = 0; i < map->n; ++i) {
3090 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3101 /* Turn the n dimensions of type type, starting at first
3102 * into existentially quantified variables.
3104 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3105 enum isl_dim_type type, unsigned first, unsigned n)
3107 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3110 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3114 for (i = 0; i < n; ++i) {
3115 j = isl_basic_map_alloc_div(bmap);
3118 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3122 isl_basic_map_free(bmap);
3126 struct isl_basic_map *isl_basic_map_apply_range(
3127 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3129 isl_space *dim_result = NULL;
3130 struct isl_basic_map *bmap;
3131 unsigned n_in, n_out, n, nparam, total, pos;
3132 struct isl_dim_map *dim_map1, *dim_map2;
3134 if (!bmap1 || !bmap2)
3137 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3138 isl_space_copy(bmap2->dim));
3140 n_in = isl_basic_map_n_in(bmap1);
3141 n_out = isl_basic_map_n_out(bmap2);
3142 n = isl_basic_map_n_out(bmap1);
3143 nparam = isl_basic_map_n_param(bmap1);
3145 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3146 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3147 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3148 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3149 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3150 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3151 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3152 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3153 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3154 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3155 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3157 bmap = isl_basic_map_alloc_space(dim_result,
3158 bmap1->n_div + bmap2->n_div + n,
3159 bmap1->n_eq + bmap2->n_eq,
3160 bmap1->n_ineq + bmap2->n_ineq);
3161 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3162 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3163 bmap = add_divs(bmap, n);
3164 bmap = isl_basic_map_simplify(bmap);
3165 bmap = isl_basic_map_drop_redundant_divs(bmap);
3166 return isl_basic_map_finalize(bmap);
3168 isl_basic_map_free(bmap1);
3169 isl_basic_map_free(bmap2);
3173 struct isl_basic_set *isl_basic_set_apply(
3174 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3179 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3182 return (struct isl_basic_set *)
3183 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3185 isl_basic_set_free(bset);
3186 isl_basic_map_free(bmap);
3190 struct isl_basic_map *isl_basic_map_apply_domain(
3191 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3193 if (!bmap1 || !bmap2)
3196 isl_assert(bmap1->ctx,
3197 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3198 isl_assert(bmap1->ctx,
3199 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3202 bmap1 = isl_basic_map_reverse(bmap1);
3203 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3204 return isl_basic_map_reverse(bmap1);
3206 isl_basic_map_free(bmap1);
3207 isl_basic_map_free(bmap2);
3211 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3212 * A \cap B -> f(A) + f(B)
3214 struct isl_basic_map *isl_basic_map_sum(
3215 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3217 unsigned n_in, n_out, nparam, total, pos;
3218 struct isl_basic_map *bmap = NULL;
3219 struct isl_dim_map *dim_map1, *dim_map2;
3222 if (!bmap1 || !bmap2)
3225 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3228 nparam = isl_basic_map_n_param(bmap1);
3229 n_in = isl_basic_map_n_in(bmap1);
3230 n_out = isl_basic_map_n_out(bmap1);
3232 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3233 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3234 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3235 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3236 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3237 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3238 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3239 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3240 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3241 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3242 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3244 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3245 bmap1->n_div + bmap2->n_div + 2 * n_out,
3246 bmap1->n_eq + bmap2->n_eq + n_out,
3247 bmap1->n_ineq + bmap2->n_ineq);
3248 for (i = 0; i < n_out; ++i) {
3249 int j = isl_basic_map_alloc_equality(bmap);
3252 isl_seq_clr(bmap->eq[j], 1+total);
3253 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3254 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3255 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3257 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3258 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3259 bmap = add_divs(bmap, 2 * n_out);
3261 bmap = isl_basic_map_simplify(bmap);
3262 return isl_basic_map_finalize(bmap);
3264 isl_basic_map_free(bmap);
3265 isl_basic_map_free(bmap1);
3266 isl_basic_map_free(bmap2);
3270 /* Given two maps A -> f(A) and B -> g(B), construct a map
3271 * A \cap B -> f(A) + f(B)
3273 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3275 struct isl_map *result;
3281 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3283 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3284 map1->n * map2->n, 0);
3287 for (i = 0; i < map1->n; ++i)
3288 for (j = 0; j < map2->n; ++j) {
3289 struct isl_basic_map *part;
3290 part = isl_basic_map_sum(
3291 isl_basic_map_copy(map1->p[i]),
3292 isl_basic_map_copy(map2->p[j]));
3293 if (isl_basic_map_is_empty(part))
3294 isl_basic_map_free(part);
3296 result = isl_map_add_basic_map(result, part);
3309 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3310 __isl_take isl_set *set2)
3312 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3315 /* Given a basic map A -> f(A), construct A -> -f(A).
3317 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3322 bmap = isl_basic_map_cow(bmap);
3326 n = isl_basic_map_dim(bmap, isl_dim_out);
3327 off = isl_basic_map_offset(bmap, isl_dim_out);
3328 for (i = 0; i < bmap->n_eq; ++i)
3329 for (j = 0; j < n; ++j)
3330 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3331 for (i = 0; i < bmap->n_ineq; ++i)
3332 for (j = 0; j < n; ++j)
3333 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3334 for (i = 0; i < bmap->n_div; ++i)
3335 for (j = 0; j < n; ++j)
3336 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3337 bmap = isl_basic_map_gauss(bmap, NULL);
3338 return isl_basic_map_finalize(bmap);
3341 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3343 return isl_basic_map_neg(bset);
3346 /* Given a map A -> f(A), construct A -> -f(A).
3348 struct isl_map *isl_map_neg(struct isl_map *map)
3352 map = isl_map_cow(map);
3356 for (i = 0; i < map->n; ++i) {
3357 map->p[i] = isl_basic_map_neg(map->p[i]);
3368 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3370 return (isl_set *)isl_map_neg((isl_map *)set);
3373 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3374 * A -> floor(f(A)/d).
3376 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3379 unsigned n_in, n_out, nparam, total, pos;
3380 struct isl_basic_map *result = NULL;
3381 struct isl_dim_map *dim_map;
3387 nparam = isl_basic_map_n_param(bmap);
3388 n_in = isl_basic_map_n_in(bmap);
3389 n_out = isl_basic_map_n_out(bmap);
3391 total = nparam + n_in + n_out + bmap->n_div + n_out;
3392 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3393 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3394 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3395 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3396 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3398 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3399 bmap->n_div + n_out,
3400 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3401 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3402 result = add_divs(result, n_out);
3403 for (i = 0; i < n_out; ++i) {
3405 j = isl_basic_map_alloc_inequality(result);
3408 isl_seq_clr(result->ineq[j], 1+total);
3409 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3410 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3411 j = isl_basic_map_alloc_inequality(result);
3414 isl_seq_clr(result->ineq[j], 1+total);
3415 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3416 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3417 isl_int_sub_ui(result->ineq[j][0], d, 1);
3420 result = isl_basic_map_simplify(result);
3421 return isl_basic_map_finalize(result);
3423 isl_basic_map_free(result);
3427 /* Given a map A -> f(A) and an integer d, construct a map
3428 * A -> floor(f(A)/d).
3430 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3434 map = isl_map_cow(map);
3438 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3439 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3440 for (i = 0; i < map->n; ++i) {
3441 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3452 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3458 i = isl_basic_map_alloc_equality(bmap);
3461 nparam = isl_basic_map_n_param(bmap);
3462 n_in = isl_basic_map_n_in(bmap);
3463 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3464 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3465 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3466 return isl_basic_map_finalize(bmap);
3468 isl_basic_map_free(bmap);
3472 /* Add a constraints to "bmap" expressing i_pos < o_pos
3474 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3480 i = isl_basic_map_alloc_inequality(bmap);
3483 nparam = isl_basic_map_n_param(bmap);
3484 n_in = isl_basic_map_n_in(bmap);
3485 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3486 isl_int_set_si(bmap->ineq[i][0], -1);
3487 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3488 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3489 return isl_basic_map_finalize(bmap);
3491 isl_basic_map_free(bmap);
3495 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3497 static __isl_give isl_basic_map *var_less_or_equal(
3498 __isl_take isl_basic_map *bmap, unsigned pos)
3504 i = isl_basic_map_alloc_inequality(bmap);
3507 nparam = isl_basic_map_n_param(bmap);
3508 n_in = isl_basic_map_n_in(bmap);
3509 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3510 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3511 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3512 return isl_basic_map_finalize(bmap);
3514 isl_basic_map_free(bmap);
3518 /* Add a constraints to "bmap" expressing i_pos > o_pos
3520 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3526 i = isl_basic_map_alloc_inequality(bmap);
3529 nparam = isl_basic_map_n_param(bmap);
3530 n_in = isl_basic_map_n_in(bmap);
3531 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3532 isl_int_set_si(bmap->ineq[i][0], -1);
3533 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3534 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3535 return isl_basic_map_finalize(bmap);
3537 isl_basic_map_free(bmap);
3541 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3543 static __isl_give isl_basic_map *var_more_or_equal(
3544 __isl_take isl_basic_map *bmap, unsigned pos)
3550 i = isl_basic_map_alloc_inequality(bmap);
3553 nparam = isl_basic_map_n_param(bmap);
3554 n_in = isl_basic_map_n_in(bmap);
3555 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3556 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3557 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3558 return isl_basic_map_finalize(bmap);
3560 isl_basic_map_free(bmap);
3564 __isl_give isl_basic_map *isl_basic_map_equal(
3565 __isl_take isl_space *dim, unsigned n_equal)
3568 struct isl_basic_map *bmap;
3569 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3572 for (i = 0; i < n_equal && bmap; ++i)
3573 bmap = var_equal(bmap, i);
3574 return isl_basic_map_finalize(bmap);
3577 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3579 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3583 struct isl_basic_map *bmap;
3584 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3587 for (i = 0; i < pos && bmap; ++i)
3588 bmap = var_equal(bmap, i);
3590 bmap = var_less(bmap, pos);
3591 return isl_basic_map_finalize(bmap);
3594 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3596 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3597 __isl_take isl_space *dim, unsigned pos)
3600 isl_basic_map *bmap;
3602 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3603 for (i = 0; i < pos; ++i)
3604 bmap = var_equal(bmap, i);
3605 bmap = var_less_or_equal(bmap, pos);
3606 return isl_basic_map_finalize(bmap);
3609 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3611 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3615 struct isl_basic_map *bmap;
3616 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3619 for (i = 0; i < pos && bmap; ++i)
3620 bmap = var_equal(bmap, i);
3622 bmap = var_more(bmap, pos);
3623 return isl_basic_map_finalize(bmap);
3626 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3628 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3629 __isl_take isl_space *dim, unsigned pos)
3632 isl_basic_map *bmap;
3634 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3635 for (i = 0; i < pos; ++i)
3636 bmap = var_equal(bmap, i);
3637 bmap = var_more_or_equal(bmap, pos);
3638 return isl_basic_map_finalize(bmap);
3641 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3642 unsigned n, int equal)
3644 struct isl_map *map;
3647 if (n == 0 && equal)
3648 return isl_map_universe(dims);
3650 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3652 for (i = 0; i + 1 < n; ++i)
3653 map = isl_map_add_basic_map(map,
3654 isl_basic_map_less_at(isl_space_copy(dims), i));
3657 map = isl_map_add_basic_map(map,
3658 isl_basic_map_less_or_equal_at(dims, n - 1));
3660 map = isl_map_add_basic_map(map,
3661 isl_basic_map_less_at(dims, n - 1));
3663 isl_space_free(dims);
3668 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3672 return map_lex_lte_first(dims, dims->n_out, equal);
3675 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3677 return map_lex_lte_first(dim, n, 0);
3680 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3682 return map_lex_lte_first(dim, n, 1);
3685 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3687 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3690 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3692 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3695 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3696 unsigned n, int equal)
3698 struct isl_map *map;
3701 if (n == 0 && equal)
3702 return isl_map_universe(dims);
3704 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3706 for (i = 0; i + 1 < n; ++i)
3707 map = isl_map_add_basic_map(map,
3708 isl_basic_map_more_at(isl_space_copy(dims), i));
3711 map = isl_map_add_basic_map(map,
3712 isl_basic_map_more_or_equal_at(dims, n - 1));
3714 map = isl_map_add_basic_map(map,
3715 isl_basic_map_more_at(dims, n - 1));
3717 isl_space_free(dims);
3722 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3726 return map_lex_gte_first(dims, dims->n_out, equal);
3729 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3731 return map_lex_gte_first(dim, n, 0);
3734 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3736 return map_lex_gte_first(dim, n, 1);
3739 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
3741 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
3744 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
3746 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
3749 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3750 __isl_take isl_set *set2)
3753 map = isl_map_lex_le(isl_set_get_space(set1));
3754 map = isl_map_intersect_domain(map, set1);
3755 map = isl_map_intersect_range(map, set2);
3759 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3760 __isl_take isl_set *set2)
3763 map = isl_map_lex_lt(isl_set_get_space(set1));
3764 map = isl_map_intersect_domain(map, set1);
3765 map = isl_map_intersect_range(map, set2);
3769 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3770 __isl_take isl_set *set2)
3773 map = isl_map_lex_ge(isl_set_get_space(set1));
3774 map = isl_map_intersect_domain(map, set1);
3775 map = isl_map_intersect_range(map, set2);
3779 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3780 __isl_take isl_set *set2)
3783 map = isl_map_lex_gt(isl_set_get_space(set1));
3784 map = isl_map_intersect_domain(map, set1);
3785 map = isl_map_intersect_range(map, set2);
3789 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3790 __isl_take isl_map *map2)
3793 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
3794 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3795 map = isl_map_apply_range(map, isl_map_reverse(map2));
3799 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3800 __isl_take isl_map *map2)
3803 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
3804 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3805 map = isl_map_apply_range(map, isl_map_reverse(map2));
3809 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3810 __isl_take isl_map *map2)
3813 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
3814 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3815 map = isl_map_apply_range(map, isl_map_reverse(map2));
3819 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3820 __isl_take isl_map *map2)
3823 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
3824 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3825 map = isl_map_apply_range(map, isl_map_reverse(map2));
3829 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
3830 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
3832 struct isl_basic_map *bmap;
3834 bset = isl_basic_set_cow(bset);
3838 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
3839 isl_space_free(bset->dim);
3840 bmap = (struct isl_basic_map *) bset;
3842 return isl_basic_map_finalize(bmap);
3844 isl_basic_set_free(bset);
3845 isl_space_free(dim);
3849 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3853 if (bmap->dim->n_in == 0)
3854 return (struct isl_basic_set *)bmap;
3855 bmap = isl_basic_map_cow(bmap);
3858 bmap->dim = isl_space_as_set_space(bmap->dim);
3861 bmap = isl_basic_map_finalize(bmap);
3862 return (struct isl_basic_set *)bmap;
3864 isl_basic_map_free(bmap);
3868 /* For a div d = floor(f/m), add the constraints
3871 * -(f-(n-1)) + m d >= 0
3873 * Note that the second constraint is the negation of
3877 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3878 unsigned pos, isl_int *div)
3881 unsigned total = isl_basic_map_total_dim(bmap);
3883 i = isl_basic_map_alloc_inequality(bmap);
3886 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3887 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3889 j = isl_basic_map_alloc_inequality(bmap);
3892 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3893 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3894 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3898 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3899 unsigned pos, isl_int *div)
3901 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3905 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3907 unsigned total = isl_basic_map_total_dim(bmap);
3908 unsigned div_pos = total - bmap->n_div + div;
3910 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3914 struct isl_basic_set *isl_basic_map_underlying_set(
3915 struct isl_basic_map *bmap)
3919 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3921 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
3922 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
3923 return (struct isl_basic_set *)bmap;
3924 bmap = isl_basic_map_cow(bmap);
3927 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
3930 bmap->extra -= bmap->n_div;
3932 bmap = isl_basic_map_finalize(bmap);
3933 return (struct isl_basic_set *)bmap;
3938 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3939 __isl_take isl_basic_set *bset)
3941 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3944 struct isl_basic_map *isl_basic_map_overlying_set(
3945 struct isl_basic_set *bset, struct isl_basic_map *like)
3947 struct isl_basic_map *bmap;
3948 struct isl_ctx *ctx;
3955 isl_assert(ctx, bset->n_div == 0, goto error);
3956 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3957 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3959 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
3960 isl_basic_map_free(like);
3961 return (struct isl_basic_map *)bset;
3963 bset = isl_basic_set_cow(bset);
3966 total = bset->dim->n_out + bset->extra;
3967 bmap = (struct isl_basic_map *)bset;
3968 isl_space_free(bmap->dim);
3969 bmap->dim = isl_space_copy(like->dim);
3972 bmap->n_div = like->n_div;
3973 bmap->extra += like->n_div;
3977 ltotal = total - bmap->extra + like->extra;
3980 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3981 bmap->extra * (1 + 1 + total));
3982 if (isl_blk_is_error(bmap->block2))
3984 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3988 for (i = 0; i < bmap->extra; ++i)
3989 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3990 for (i = 0; i < like->n_div; ++i) {
3991 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3992 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3994 bmap = isl_basic_map_extend_constraints(bmap,
3995 0, 2 * like->n_div);
3996 for (i = 0; i < like->n_div; ++i) {
3997 if (isl_int_is_zero(bmap->div[i][0]))
3999 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4003 isl_basic_map_free(like);
4004 bmap = isl_basic_map_simplify(bmap);
4005 bmap = isl_basic_map_finalize(bmap);
4008 isl_basic_map_free(like);
4009 isl_basic_set_free(bset);
4013 struct isl_basic_set *isl_basic_set_from_underlying_set(
4014 struct isl_basic_set *bset, struct isl_basic_set *like)
4016 return (struct isl_basic_set *)
4017 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4020 struct isl_set *isl_set_from_underlying_set(
4021 struct isl_set *set, struct isl_basic_set *like)
4027 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4029 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4030 isl_basic_set_free(like);
4033 set = isl_set_cow(set);
4036 for (i = 0; i < set->n; ++i) {
4037 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4038 isl_basic_set_copy(like));
4042 isl_space_free(set->dim);
4043 set->dim = isl_space_copy(like->dim);
4046 isl_basic_set_free(like);
4049 isl_basic_set_free(like);
4054 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4058 map = isl_map_cow(map);
4061 map->dim = isl_space_cow(map->dim);
4065 for (i = 1; i < map->n; ++i)
4066 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4068 for (i = 0; i < map->n; ++i) {
4069 map->p[i] = (struct isl_basic_map *)
4070 isl_basic_map_underlying_set(map->p[i]);
4075 map->dim = isl_space_underlying(map->dim, 0);
4077 isl_space_free(map->dim);
4078 map->dim = isl_space_copy(map->p[0]->dim);
4082 return (struct isl_set *)map;
4088 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4090 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4093 __isl_give isl_basic_map *isl_basic_map_reset_space(
4094 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4096 bmap = isl_basic_map_cow(bmap);
4100 isl_space_free(bmap->dim);
4103 bmap = isl_basic_map_finalize(bmap);
4107 isl_basic_map_free(bmap);
4108 isl_space_free(dim);
4112 __isl_give isl_basic_set *isl_basic_set_reset_space(
4113 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4115 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4119 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4120 __isl_take isl_space *dim)
4124 map = isl_map_cow(map);
4128 for (i = 0; i < map->n; ++i) {
4129 map->p[i] = isl_basic_map_reset_space(map->p[i],
4130 isl_space_copy(dim));
4134 isl_space_free(map->dim);
4140 isl_space_free(dim);
4144 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4145 __isl_take isl_space *dim)
4147 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4150 /* Compute the parameter domain of the given basic set.
4152 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4157 if (isl_basic_set_is_params(bset))
4160 n = isl_basic_set_dim(bset, isl_dim_set);
4161 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4162 space = isl_basic_set_get_space(bset);
4163 space = isl_space_params(space);
4164 bset = isl_basic_set_reset_space(bset, space);
4168 /* Compute the parameter domain of the given set.
4170 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4175 if (isl_set_is_params(set))
4178 n = isl_set_dim(set, isl_dim_set);
4179 set = isl_set_project_out(set, isl_dim_set, 0, n);
4180 space = isl_set_get_space(set);
4181 space = isl_space_params(space);
4182 set = isl_set_reset_space(set, space);
4186 /* Construct a zero-dimensional set with the given parameter domain.
4188 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4191 space = isl_set_get_space(set);
4192 space = isl_space_set_from_params(space);
4193 set = isl_set_reset_space(set, space);
4197 /* Compute the parameter domain of the given map.
4199 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4204 n = isl_map_dim(map, isl_dim_in);
4205 map = isl_map_project_out(map, isl_dim_in, 0, n);
4206 n = isl_map_dim(map, isl_dim_out);
4207 map = isl_map_project_out(map, isl_dim_out, 0, n);
4208 space = isl_map_get_space(map);
4209 space = isl_space_params(space);
4210 map = isl_map_reset_space(map, space);
4214 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4217 struct isl_basic_set *domain;
4223 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4225 n_in = isl_basic_map_n_in(bmap);
4226 n_out = isl_basic_map_n_out(bmap);
4227 domain = isl_basic_set_from_basic_map(bmap);
4228 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4230 domain = isl_basic_set_reset_space(domain, dim);
4235 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4239 return isl_space_may_be_set(bmap->dim);
4242 /* Is this basic map actually a set?
4243 * Users should never call this function. Outside of isl,
4244 * the type should indicate whether something is a set or a map.
4246 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4250 return isl_space_is_set(bmap->dim);
4253 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4257 if (isl_basic_map_is_set(bmap))
4259 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4262 __isl_give isl_basic_map *isl_basic_map_domain_map(
4263 __isl_take isl_basic_map *bmap)
4267 isl_basic_map *domain;
4268 int nparam, n_in, n_out;
4271 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4272 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4273 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4275 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4276 domain = isl_basic_map_universe(dim);
4278 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4279 bmap = isl_basic_map_apply_range(bmap, domain);
4280 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4282 total = isl_basic_map_total_dim(bmap);
4284 for (i = 0; i < n_in; ++i) {
4285 k = isl_basic_map_alloc_equality(bmap);
4288 isl_seq_clr(bmap->eq[k], 1 + total);
4289 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4290 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4293 bmap = isl_basic_map_gauss(bmap, NULL);
4294 return isl_basic_map_finalize(bmap);
4296 isl_basic_map_free(bmap);
4300 __isl_give isl_basic_map *isl_basic_map_range_map(
4301 __isl_take isl_basic_map *bmap)
4305 isl_basic_map *range;
4306 int nparam, n_in, n_out;
4309 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4310 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4311 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4313 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4314 range = isl_basic_map_universe(dim);
4316 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4317 bmap = isl_basic_map_apply_range(bmap, range);
4318 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4320 total = isl_basic_map_total_dim(bmap);
4322 for (i = 0; i < n_out; ++i) {
4323 k = isl_basic_map_alloc_equality(bmap);
4326 isl_seq_clr(bmap->eq[k], 1 + total);
4327 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4328 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4331 bmap = isl_basic_map_gauss(bmap, NULL);
4332 return isl_basic_map_finalize(bmap);
4334 isl_basic_map_free(bmap);
4338 int isl_map_may_be_set(__isl_keep isl_map *map)
4342 return isl_space_may_be_set(map->dim);
4345 /* Is this map actually a set?
4346 * Users should never call this function. Outside of isl,
4347 * the type should indicate whether something is a set or a map.
4349 int isl_map_is_set(__isl_keep isl_map *map)
4353 return isl_space_is_set(map->dim);
4356 struct isl_set *isl_map_range(struct isl_map *map)
4359 struct isl_set *set;
4363 if (isl_map_is_set(map))
4364 return (isl_set *)map;
4366 map = isl_map_cow(map);
4370 set = (struct isl_set *) map;
4371 set->dim = isl_space_range(set->dim);
4374 for (i = 0; i < map->n; ++i) {
4375 set->p[i] = isl_basic_map_range(map->p[i]);
4379 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4380 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4387 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4390 isl_space *domain_dim;
4392 map = isl_map_cow(map);
4396 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4397 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4398 map->dim = isl_space_join(map->dim, domain_dim);
4401 for (i = 0; i < map->n; ++i) {
4402 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4406 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4407 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4414 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4417 isl_space *range_dim;
4419 map = isl_map_cow(map);
4423 range_dim = isl_space_range(isl_map_get_space(map));
4424 range_dim = isl_space_from_range(range_dim);
4425 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4426 map->dim = isl_space_join(map->dim, range_dim);
4429 for (i = 0; i < map->n; ++i) {
4430 map->p[i] = isl_basic_map_range_map(map->p[i]);
4434 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4435 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4442 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4443 __isl_take isl_space *dim)
4446 struct isl_map *map = NULL;
4448 set = isl_set_cow(set);
4451 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4452 map = (struct isl_map *)set;
4453 for (i = 0; i < set->n; ++i) {
4454 map->p[i] = isl_basic_map_from_basic_set(
4455 set->p[i], isl_space_copy(dim));
4459 isl_space_free(map->dim);
4463 isl_space_free(dim);
4468 __isl_give isl_basic_map *isl_basic_map_from_domain(
4469 __isl_take isl_basic_set *bset)
4471 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4474 __isl_give isl_basic_map *isl_basic_map_from_range(
4475 __isl_take isl_basic_set *bset)
4478 space = isl_basic_set_get_space(bset);
4479 space = isl_space_from_range(space);
4480 bset = isl_basic_set_reset_space(bset, space);
4481 return (isl_basic_map *)bset;
4484 struct isl_map *isl_map_from_range(struct isl_set *set)
4487 space = isl_set_get_space(set);
4488 space = isl_space_from_range(space);
4489 set = isl_set_reset_space(set, space);
4490 return (struct isl_map *)set;
4493 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4495 return isl_map_reverse(isl_map_from_range(set));
4498 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4499 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4501 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4504 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4505 __isl_take isl_set *range)
4507 return isl_map_apply_range(isl_map_reverse(domain), range);
4510 struct isl_set *isl_set_from_map(struct isl_map *map)
4513 struct isl_set *set = NULL;
4517 map = isl_map_cow(map);
4520 map->dim = isl_space_as_set_space(map->dim);
4523 set = (struct isl_set *)map;
4524 for (i = 0; i < map->n; ++i) {
4525 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4535 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4538 struct isl_map *map;
4543 isl_die(dim->ctx, isl_error_internal,
4544 "negative number of basic maps", goto error);
4545 map = isl_alloc(dim->ctx, struct isl_map,
4546 sizeof(struct isl_map) +
4547 (n - 1) * sizeof(struct isl_basic_map *));
4551 map->ctx = dim->ctx;
4552 isl_ctx_ref(map->ctx);
4560 isl_space_free(dim);
4564 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4565 unsigned nparam, unsigned in, unsigned out, int n,
4568 struct isl_map *map;
4571 dims = isl_space_alloc(ctx, nparam, in, out);
4575 map = isl_map_alloc_space(dims, n, flags);
4579 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4581 struct isl_basic_map *bmap;
4582 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4583 bmap = isl_basic_map_set_to_empty(bmap);
4587 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4589 struct isl_basic_set *bset;
4590 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4591 bset = isl_basic_set_set_to_empty(bset);
4595 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4597 struct isl_basic_map *bmap;
4600 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4601 bmap = isl_basic_map_set_to_empty(bmap);
4605 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4607 struct isl_basic_map *bmap;
4610 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4611 bmap = isl_basic_map_set_to_empty(bmap);
4615 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4617 struct isl_basic_set *bset;
4620 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4621 bset = isl_basic_set_set_to_empty(bset);
4625 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4627 struct isl_basic_map *bmap;
4628 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4629 bmap = isl_basic_map_finalize(bmap);
4633 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4635 struct isl_basic_set *bset;
4636 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4637 bset = isl_basic_set_finalize(bset);
4641 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4644 unsigned total = isl_space_dim(dim, isl_dim_all);
4645 isl_basic_map *bmap;
4647 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4648 for (i = 0; i < total; ++i) {
4649 int k = isl_basic_map_alloc_inequality(bmap);
4652 isl_seq_clr(bmap->ineq[k], 1 + total);
4653 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4657 isl_basic_map_free(bmap);
4661 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4663 return isl_basic_map_nat_universe(dim);
4666 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4668 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4671 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4673 return isl_map_nat_universe(dim);
4676 __isl_give isl_basic_map *isl_basic_map_universe_like(
4677 __isl_keep isl_basic_map *model)
4681 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4684 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4688 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4691 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4692 __isl_keep isl_set *model)
4696 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4699 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4701 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4704 struct isl_map *isl_map_empty_like(struct isl_map *model)
4708 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4711 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4715 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4718 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4720 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4723 struct isl_set *isl_set_empty_like(struct isl_set *model)
4727 return isl_set_empty(isl_space_copy(model->dim));
4730 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4732 struct isl_map *map;
4735 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4736 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4740 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
4742 struct isl_set *set;
4745 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4746 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4750 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4754 return isl_set_universe(isl_space_copy(model->dim));
4757 struct isl_map *isl_map_dup(struct isl_map *map)
4760 struct isl_map *dup;
4764 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
4765 for (i = 0; i < map->n; ++i)
4766 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4770 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4771 __isl_take isl_basic_map *bmap)
4775 if (isl_basic_map_plain_is_empty(bmap)) {
4776 isl_basic_map_free(bmap);
4779 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
4780 isl_assert(map->ctx, map->n < map->size, goto error);
4781 map->p[map->n] = bmap;
4783 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4789 isl_basic_map_free(bmap);
4793 void isl_map_free(struct isl_map *map)
4803 isl_ctx_deref(map->ctx);
4804 for (i = 0; i < map->n; ++i)
4805 isl_basic_map_free(map->p[i]);
4806 isl_space_free(map->dim);
4810 struct isl_map *isl_map_extend(struct isl_map *base,
4811 unsigned nparam, unsigned n_in, unsigned n_out)
4815 base = isl_map_cow(base);
4819 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
4822 for (i = 0; i < base->n; ++i) {
4823 base->p[i] = isl_basic_map_extend_space(base->p[i],
4824 isl_space_copy(base->dim), 0, 0, 0);
4834 struct isl_set *isl_set_extend(struct isl_set *base,
4835 unsigned nparam, unsigned dim)
4837 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4841 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4842 struct isl_basic_map *bmap, unsigned pos, int value)
4846 bmap = isl_basic_map_cow(bmap);
4847 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4848 j = isl_basic_map_alloc_equality(bmap);
4851 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4852 isl_int_set_si(bmap->eq[j][pos], -1);
4853 isl_int_set_si(bmap->eq[j][0], value);
4854 bmap = isl_basic_map_simplify(bmap);
4855 return isl_basic_map_finalize(bmap);
4857 isl_basic_map_free(bmap);
4861 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4862 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4866 bmap = isl_basic_map_cow(bmap);
4867 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4868 j = isl_basic_map_alloc_equality(bmap);
4871 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4872 isl_int_set_si(bmap->eq[j][pos], -1);
4873 isl_int_set(bmap->eq[j][0], value);
4874 bmap = isl_basic_map_simplify(bmap);
4875 return isl_basic_map_finalize(bmap);
4877 isl_basic_map_free(bmap);
4881 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4882 enum isl_dim_type type, unsigned pos, int value)
4886 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4887 return isl_basic_map_fix_pos_si(bmap,
4888 isl_basic_map_offset(bmap, type) + pos, value);
4890 isl_basic_map_free(bmap);
4894 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4895 enum isl_dim_type type, unsigned pos, isl_int value)
4899 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4900 return isl_basic_map_fix_pos(bmap,
4901 isl_basic_map_offset(bmap, type) + pos, value);
4903 isl_basic_map_free(bmap);
4907 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4908 enum isl_dim_type type, unsigned pos, int value)
4910 return (struct isl_basic_set *)
4911 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4915 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4916 enum isl_dim_type type, unsigned pos, isl_int value)
4918 return (struct isl_basic_set *)
4919 isl_basic_map_fix((struct isl_basic_map *)bset,
4923 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4924 unsigned input, int value)
4926 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4929 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4930 unsigned dim, int value)
4932 return (struct isl_basic_set *)
4933 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4934 isl_dim_set, dim, value);
4937 struct isl_map *isl_map_fix_si(struct isl_map *map,
4938 enum isl_dim_type type, unsigned pos, int value)
4942 map = isl_map_cow(map);
4946 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4947 for (i = 0; i < map->n; ++i) {
4948 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4952 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4959 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4960 enum isl_dim_type type, unsigned pos, int value)
4962 return (struct isl_set *)
4963 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4966 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4967 enum isl_dim_type type, unsigned pos, isl_int value)
4971 map = isl_map_cow(map);
4975 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4976 for (i = 0; i < map->n; ++i) {
4977 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4981 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4988 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4989 enum isl_dim_type type, unsigned pos, isl_int value)
4991 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4994 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4995 unsigned input, int value)
4997 return isl_map_fix_si(map, isl_dim_in, input, value);
5000 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5002 return (struct isl_set *)
5003 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5006 static __isl_give isl_basic_map *basic_map_bound_si(
5007 __isl_take isl_basic_map *bmap,
5008 enum isl_dim_type type, unsigned pos, int value, int upper)
5014 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5015 pos += isl_basic_map_offset(bmap, type);
5016 bmap = isl_basic_map_cow(bmap);
5017 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5018 j = isl_basic_map_alloc_inequality(bmap);
5021 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5023 isl_int_set_si(bmap->ineq[j][pos], -1);
5024 isl_int_set_si(bmap->ineq[j][0], value);
5026 isl_int_set_si(bmap->ineq[j][pos], 1);
5027 isl_int_set_si(bmap->ineq[j][0], -value);
5029 bmap = isl_basic_map_simplify(bmap);
5030 return isl_basic_map_finalize(bmap);
5032 isl_basic_map_free(bmap);
5036 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5037 __isl_take isl_basic_map *bmap,
5038 enum isl_dim_type type, unsigned pos, int value)
5040 return basic_map_bound_si(bmap, type, pos, value, 0);
5043 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5044 unsigned dim, isl_int value)
5048 bset = isl_basic_set_cow(bset);
5049 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5050 j = isl_basic_set_alloc_inequality(bset);
5053 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5054 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5055 isl_int_neg(bset->ineq[j][0], value);
5056 bset = isl_basic_set_simplify(bset);
5057 return isl_basic_set_finalize(bset);
5059 isl_basic_set_free(bset);
5063 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5064 enum isl_dim_type type, unsigned pos, int value, int upper)
5068 map = isl_map_cow(map);
5072 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5073 for (i = 0; i < map->n; ++i) {
5074 map->p[i] = basic_map_bound_si(map->p[i],
5075 type, pos, value, upper);
5079 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5086 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5087 enum isl_dim_type type, unsigned pos, int value)
5089 return map_bound_si(map, type, pos, value, 0);
5092 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5093 enum isl_dim_type type, unsigned pos, int value)
5095 return map_bound_si(map, type, pos, value, 1);
5098 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5099 enum isl_dim_type type, unsigned pos, int value)
5101 return (struct isl_set *)
5102 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5105 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5106 enum isl_dim_type type, unsigned pos, int value)
5108 return isl_map_upper_bound_si(set, type, pos, value);
5111 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5116 set = isl_set_cow(set);
5120 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5121 for (i = 0; i < set->n; ++i) {
5122 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5132 struct isl_map *isl_map_reverse(struct isl_map *map)
5136 map = isl_map_cow(map);
5140 map->dim = isl_space_reverse(map->dim);
5143 for (i = 0; i < map->n; ++i) {
5144 map->p[i] = isl_basic_map_reverse(map->p[i]);
5148 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5155 static struct isl_map *isl_basic_map_partial_lexopt(
5156 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5157 struct isl_set **empty, int max)
5161 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5162 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5164 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5166 isl_basic_map_free(bmap);
5167 isl_basic_set_free(dom);
5173 struct isl_map *isl_basic_map_partial_lexmax(
5174 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5175 struct isl_set **empty)
5177 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5180 struct isl_map *isl_basic_map_partial_lexmin(
5181 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5182 struct isl_set **empty)
5184 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5187 struct isl_set *isl_basic_set_partial_lexmin(
5188 struct isl_basic_set *bset, struct isl_basic_set *dom,
5189 struct isl_set **empty)
5191 return (struct isl_set *)
5192 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5196 struct isl_set *isl_basic_set_partial_lexmax(
5197 struct isl_basic_set *bset, struct isl_basic_set *dom,
5198 struct isl_set **empty)
5200 return (struct isl_set *)
5201 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5205 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5206 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5207 __isl_give isl_set **empty)
5209 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5212 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5213 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5214 __isl_give isl_set **empty)
5216 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5219 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5220 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5221 __isl_give isl_set **empty)
5223 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5226 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5227 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5228 __isl_give isl_set **empty)
5230 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5233 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5234 __isl_take isl_basic_map *bmap, int max)
5236 isl_basic_set *dom = NULL;
5237 isl_space *dom_space;
5241 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5242 dom = isl_basic_set_universe(dom_space);
5243 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5245 isl_basic_map_free(bmap);
5249 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5250 __isl_take isl_basic_map *bmap)
5252 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5255 /* Given a basic map "bmap", compute the lexicographically minimal
5256 * (or maximal) image element for each domain element in dom.
5257 * Set *empty to those elements in dom that do not have an image element.
5259 * We first make sure the basic sets in dom are disjoint and then
5260 * simply collect the results over each of the basic sets separately.
5261 * We could probably improve the efficiency a bit by moving the union
5262 * domain down into the parametric integer programming.
5264 static __isl_give isl_map *basic_map_partial_lexopt(
5265 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5266 __isl_give isl_set **empty, int max)
5269 struct isl_map *res;
5271 dom = isl_set_make_disjoint(dom);
5275 if (isl_set_plain_is_empty(dom)) {
5276 res = isl_map_empty_like_basic_map(bmap);
5277 *empty = isl_set_empty_like(dom);
5279 isl_basic_map_free(bmap);
5283 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5284 isl_basic_set_copy(dom->p[0]), empty, max);
5286 for (i = 1; i < dom->n; ++i) {
5287 struct isl_map *res_i;
5288 struct isl_set *empty_i;
5290 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5291 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5293 res = isl_map_union_disjoint(res, res_i);
5294 *empty = isl_set_union_disjoint(*empty, empty_i);
5298 isl_basic_map_free(bmap);
5303 isl_basic_map_free(bmap);
5307 /* Given a map "map", compute the lexicographically minimal
5308 * (or maximal) image element for each domain element in dom.
5309 * Set *empty to those elements in dom that do not have an image element.
5311 * We first compute the lexicographically minimal or maximal element
5312 * in the first basic map. This results in a partial solution "res"
5313 * and a subset "todo" of dom that still need to be handled.
5314 * We then consider each of the remaining maps in "map" and successively
5315 * improve both "res" and "todo".
5317 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5318 * Assume we are computing the lexicographical maximum.
5319 * We first compute the lexicographically maximal element in basic map i.
5320 * This results in a partial solution res_i and a subset todo_i.
5321 * Then we combine these results with those obtain for the first k basic maps
5322 * to obtain a result that is valid for the first k+1 basic maps.
5323 * In particular, the set where there is no solution is the set where
5324 * there is no solution for the first k basic maps and also no solution
5325 * for the ith basic map, i.e.,
5327 * todo^i = todo^k * todo_i
5329 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5330 * solutions, arbitrarily breaking ties in favor of res^k.
5331 * That is, when res^k(a) >= res_i(a), we pick res^k and
5332 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5333 * the lexicographic order.)
5334 * In practice, we compute
5336 * res^k * (res_i . "<=")
5340 * res_i * (res^k . "<")
5342 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5343 * where only one of res^k and res_i provides a solution and we simply pick
5350 * Note that we only compute these intersections when dom(res^k) intersects
5351 * dom(res_i). Otherwise, the only effect of these intersections is to
5352 * potentially break up res^k and res_i into smaller pieces.
5353 * We want to avoid such splintering as much as possible.
5354 * In fact, an earlier implementation of this function would look for
5355 * better results in the domain of res^k and for extra results in todo^k,
5356 * but this would always result in a splintering according to todo^k,
5357 * even when the domain of basic map i is disjoint from the domains of
5358 * the previous basic maps.
5360 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5361 __isl_take isl_map *map, __isl_take isl_set *dom,
5362 __isl_give isl_set **empty, int max)
5365 struct isl_map *res;
5366 struct isl_set *todo;
5371 if (isl_map_plain_is_empty(map)) {
5379 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5380 isl_set_copy(dom), &todo, max);
5382 for (i = 1; i < map->n; ++i) {
5386 isl_space *dim = isl_space_range(isl_map_get_space(res));
5388 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5389 isl_set_copy(dom), &todo_i, max);
5392 lt = isl_map_lex_lt(isl_space_copy(dim));
5393 le = isl_map_lex_le(dim);
5395 lt = isl_map_lex_gt(isl_space_copy(dim));
5396 le = isl_map_lex_ge(dim);
5398 lt = isl_map_apply_range(isl_map_copy(res), lt);
5399 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5400 le = isl_map_apply_range(isl_map_copy(res_i), le);
5401 le = isl_map_intersect(le, isl_map_copy(res));
5403 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5404 res = isl_map_intersect_domain(res,
5405 isl_set_copy(todo_i));
5406 res_i = isl_map_intersect_domain(res_i,
5407 isl_set_copy(todo));
5410 res = isl_map_union_disjoint(res, res_i);
5411 res = isl_map_union_disjoint(res, lt);
5412 res = isl_map_union_disjoint(res, le);
5414 todo = isl_set_intersect(todo, todo_i);
5434 /* Given a map "map", compute the lexicographically minimal
5435 * (or maximal) image element for each domain element in dom.
5436 * Set *empty to those elements in dom that do not have an image element.
5438 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5440 static __isl_give isl_map *isl_map_partial_lexopt(
5441 __isl_take isl_map *map, __isl_take isl_set *dom,
5442 __isl_give isl_set **empty, int max)
5446 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5447 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5448 if (!isl_space_has_named_params(map->dim) ||
5449 !isl_space_has_named_params(dom->dim))
5450 isl_die(map->ctx, isl_error_invalid,
5451 "unaligned unnamed parameters", goto error);
5452 map = isl_map_align_params(map, isl_map_get_space(dom));
5453 dom = isl_map_align_params(dom, isl_map_get_space(map));
5454 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5463 __isl_give isl_map *isl_map_partial_lexmax(
5464 __isl_take isl_map *map, __isl_take isl_set *dom,
5465 __isl_give isl_set **empty)
5467 return isl_map_partial_lexopt(map, dom, empty, 1);
5470 __isl_give isl_map *isl_map_partial_lexmin(
5471 __isl_take isl_map *map, __isl_take isl_set *dom,
5472 __isl_give isl_set **empty)
5474 return isl_map_partial_lexopt(map, dom, empty, 0);
5477 __isl_give isl_set *isl_set_partial_lexmin(
5478 __isl_take isl_set *set, __isl_take isl_set *dom,
5479 __isl_give isl_set **empty)
5481 return (struct isl_set *)
5482 isl_map_partial_lexmin((struct isl_map *)set,
5486 __isl_give isl_set *isl_set_partial_lexmax(
5487 __isl_take isl_set *set, __isl_take isl_set *dom,
5488 __isl_give isl_set **empty)
5490 return (struct isl_set *)
5491 isl_map_partial_lexmax((struct isl_map *)set,
5495 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5497 struct isl_basic_set *dom = NULL;
5502 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5503 dom = isl_basic_set_universe(dom_dim);
5504 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5506 isl_basic_map_free(bmap);
5510 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5512 return isl_basic_map_lexopt(bmap, 0);
5515 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5517 return isl_basic_map_lexopt(bmap, 1);
5520 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5522 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5525 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5527 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5530 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5532 struct isl_set *dom = NULL;
5537 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5538 dom = isl_set_universe(dom_dim);
5539 return isl_map_partial_lexopt(map, dom, NULL, max);
5545 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5547 return isl_map_lexopt(map, 0);
5550 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5552 return isl_map_lexopt(map, 1);
5555 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5557 return (isl_set *)isl_map_lexmin((isl_map *)set);
5560 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5562 return (isl_set *)isl_map_lexmax((isl_map *)set);
5565 /* Extract the first and only affine expression from list
5566 * and then add it to *pwaff with the given dom.
5567 * This domain is known to be disjoint from other domains
5568 * because of the way isl_basic_map_foreach_lexmax works.
5570 static int update_dim_opt(__isl_take isl_basic_set *dom,
5571 __isl_take isl_aff_list *list, void *user)
5573 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5575 isl_pw_aff **pwaff = user;
5576 isl_pw_aff *pwaff_i;
5578 if (isl_aff_list_n_aff(list) != 1)
5579 isl_die(ctx, isl_error_internal,
5580 "expecting single element list", goto error);
5582 aff = isl_aff_list_get_aff(list, 0);
5583 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5585 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5587 isl_aff_list_free(list);
5591 isl_basic_set_free(dom);
5592 isl_aff_list_free(list);
5596 /* Given a basic map with one output dimension, compute the minimum or
5597 * maximum of that dimension as an isl_pw_aff.
5599 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5600 * call update_dim_opt on each leaf of the result.
5602 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5605 isl_space *dim = isl_basic_map_get_space(bmap);
5609 dim = isl_space_from_domain(isl_space_domain(dim));
5610 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5611 pwaff = isl_pw_aff_empty(dim);
5613 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5615 return isl_pw_aff_free(pwaff);
5620 /* Compute the minimum or maximum of the given output dimension
5621 * as a function of the parameters and the input dimensions,
5622 * but independently of the other output dimensions.
5624 * We first project out the other output dimension and then compute
5625 * the "lexicographic" maximum in each basic map, combining the results
5626 * using isl_pw_aff_union_max.
5628 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
5635 n_out = isl_map_dim(map, isl_dim_out);
5636 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
5637 map = isl_map_project_out(map, isl_dim_out, 0, pos);
5642 isl_space *dim = isl_map_get_space(map);
5643 dim = isl_space_domain(isl_space_from_range(dim));
5645 return isl_pw_aff_empty(dim);
5648 pwaff = basic_map_dim_opt(map->p[0], max);
5649 for (i = 1; i < map->n; ++i) {
5650 isl_pw_aff *pwaff_i;
5652 pwaff_i = basic_map_dim_opt(map->p[i], max);
5653 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
5661 /* Compute the maximum of the given output dimension as a function of the
5662 * parameters and input dimensions, but independently of
5663 * the other output dimensions.
5665 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
5667 return map_dim_opt(map, pos, 1);
5670 /* Compute the minimum or maximum of the given set dimension
5671 * as a function of the parameters,
5672 * but independently of the other set dimensions.
5674 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
5677 return map_dim_opt(set, pos, max);
5680 /* Compute the maximum of the given set dimension as a function of the
5681 * parameters, but independently of the other set dimensions.
5683 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5685 return set_dim_opt(set, pos, 1);
5688 /* Compute the minimum of the given set dimension as a function of the
5689 * parameters, but independently of the other set dimensions.
5691 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
5693 return set_dim_opt(set, pos, 0);
5696 /* Apply a preimage specified by "mat" on the parameters of "bset".
5697 * bset is assumed to have only parameters and divs.
5699 static struct isl_basic_set *basic_set_parameter_preimage(
5700 struct isl_basic_set *bset, struct isl_mat *mat)
5707 bset->dim = isl_space_cow(bset->dim);
5711 nparam = isl_basic_set_dim(bset, isl_dim_param);
5713 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5715 bset->dim->nparam = 0;
5716 bset->dim->n_out = nparam;
5717 bset = isl_basic_set_preimage(bset, mat);
5719 bset->dim->nparam = bset->dim->n_out;
5720 bset->dim->n_out = 0;
5725 isl_basic_set_free(bset);
5729 /* Apply a preimage specified by "mat" on the parameters of "set".
5730 * set is assumed to have only parameters and divs.
5732 static struct isl_set *set_parameter_preimage(
5733 struct isl_set *set, struct isl_mat *mat)
5735 isl_space *dim = NULL;
5741 dim = isl_space_copy(set->dim);
5742 dim = isl_space_cow(dim);
5746 nparam = isl_set_dim(set, isl_dim_param);
5748 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5751 dim->n_out = nparam;
5752 isl_set_reset_space(set, dim);
5753 set = isl_set_preimage(set, mat);
5756 dim = isl_space_copy(set->dim);
5757 dim = isl_space_cow(dim);
5760 dim->nparam = dim->n_out;
5762 isl_set_reset_space(set, dim);
5765 isl_space_free(dim);
5772 /* Intersect the basic set "bset" with the affine space specified by the
5773 * equalities in "eq".
5775 static struct isl_basic_set *basic_set_append_equalities(
5776 struct isl_basic_set *bset, struct isl_mat *eq)
5784 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
5789 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
5790 for (i = 0; i < eq->n_row; ++i) {
5791 k = isl_basic_set_alloc_equality(bset);
5794 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5795 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5799 bset = isl_basic_set_gauss(bset, NULL);
5800 bset = isl_basic_set_finalize(bset);
5805 isl_basic_set_free(bset);
5809 /* Intersect the set "set" with the affine space specified by the
5810 * equalities in "eq".
5812 static struct isl_set *set_append_equalities(struct isl_set *set,
5820 for (i = 0; i < set->n; ++i) {
5821 set->p[i] = basic_set_append_equalities(set->p[i],
5834 /* Project the given basic set onto its parameter domain, possibly introducing
5835 * new, explicit, existential variables in the constraints.
5836 * The input has parameters and (possibly implicit) existential variables.
5837 * The output has the same parameters, but only
5838 * explicit existentially quantified variables.
5840 * The actual projection is performed by pip, but pip doesn't seem
5841 * to like equalities very much, so we first remove the equalities
5842 * among the parameters by performing a variable compression on
5843 * the parameters. Afterward, an inverse transformation is performed
5844 * and the equalities among the parameters are inserted back in.
5846 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5850 struct isl_mat *T, *T2;
5851 struct isl_set *set;
5852 unsigned nparam, n_div;
5854 bset = isl_basic_set_cow(bset);
5858 if (bset->n_eq == 0)
5859 return isl_basic_set_lexmin(bset);
5861 isl_basic_set_gauss(bset, NULL);
5863 nparam = isl_basic_set_dim(bset, isl_dim_param);
5864 n_div = isl_basic_set_dim(bset, isl_dim_div);
5866 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5867 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5870 if (i == bset->n_eq)
5871 return isl_basic_set_lexmin(bset);
5873 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5875 eq = isl_mat_cow(eq);
5876 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5877 if (T && T->n_col == 0) {
5881 bset = isl_basic_set_set_to_empty(bset);
5882 return isl_set_from_basic_set(bset);
5884 bset = basic_set_parameter_preimage(bset, T);
5886 set = isl_basic_set_lexmin(bset);
5887 set = set_parameter_preimage(set, T2);
5888 set = set_append_equalities(set, eq);
5892 /* Compute an explicit representation for all the existentially
5893 * quantified variables.
5894 * The input and output dimensions are first turned into parameters.
5895 * compute_divs then returns a map with the same parameters and
5896 * no input or output dimensions and the dimension specification
5897 * is reset to that of the input.
5899 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5901 struct isl_basic_set *bset;
5902 struct isl_set *set;
5903 struct isl_map *map;
5904 isl_space *dim, *orig_dim = NULL;
5909 bmap = isl_basic_map_cow(bmap);
5913 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5914 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5915 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5916 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5920 orig_dim = bmap->dim;
5922 bset = (struct isl_basic_set *)bmap;
5924 set = parameter_compute_divs(bset);
5925 map = (struct isl_map *)set;
5926 map = isl_map_reset_space(map, orig_dim);
5930 isl_basic_map_free(bmap);
5934 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5942 off = isl_space_dim(bmap->dim, isl_dim_all);
5943 for (i = 0; i < bmap->n_div; ++i) {
5944 if (isl_int_is_zero(bmap->div[i][0]))
5946 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5952 static int map_divs_known(__isl_keep isl_map *map)
5959 for (i = 0; i < map->n; ++i) {
5960 int known = isl_basic_map_divs_known(map->p[i]);
5968 /* If bmap contains any unknown divs, then compute explicit
5969 * expressions for them. However, this computation may be
5970 * quite expensive, so first try to remove divs that aren't
5973 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5976 struct isl_map *map;
5978 known = isl_basic_map_divs_known(bmap);
5982 return isl_map_from_basic_map(bmap);
5984 bmap = isl_basic_map_drop_redundant_divs(bmap);
5986 known = isl_basic_map_divs_known(bmap);
5990 return isl_map_from_basic_map(bmap);
5992 map = compute_divs(bmap);
5995 isl_basic_map_free(bmap);
5999 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6003 struct isl_map *res;
6010 known = map_divs_known(map);
6018 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6019 for (i = 1 ; i < map->n; ++i) {
6021 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6022 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6023 res = isl_map_union_disjoint(res, r2);
6025 res = isl_map_union(res, r2);
6032 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6034 return (struct isl_set *)
6035 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6038 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6040 return (struct isl_set *)
6041 isl_map_compute_divs((struct isl_map *)set);
6044 struct isl_set *isl_map_domain(struct isl_map *map)
6047 struct isl_set *set;
6052 map = isl_map_cow(map);
6056 set = (struct isl_set *)map;
6057 set->dim = isl_space_domain(set->dim);
6060 for (i = 0; i < map->n; ++i) {
6061 set->p[i] = isl_basic_map_domain(map->p[i]);
6065 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6066 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6073 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6074 __isl_take isl_map *map2)
6078 struct isl_map *map = NULL;
6092 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6094 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6095 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6096 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6098 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6099 map1->n + map2->n, flags);
6102 for (i = 0; i < map1->n; ++i) {
6103 map = isl_map_add_basic_map(map,
6104 isl_basic_map_copy(map1->p[i]));
6108 for (i = 0; i < map2->n; ++i) {
6109 map = isl_map_add_basic_map(map,
6110 isl_basic_map_copy(map2->p[i]));
6124 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6125 __isl_take isl_map *map2)
6127 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6130 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6132 map1 = isl_map_union_disjoint(map1, map2);
6136 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6140 struct isl_set *isl_set_union_disjoint(
6141 struct isl_set *set1, struct isl_set *set2)
6143 return (struct isl_set *)
6144 isl_map_union_disjoint(
6145 (struct isl_map *)set1, (struct isl_map *)set2);
6148 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6150 return (struct isl_set *)
6151 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6154 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6155 __isl_take isl_set *set)
6158 struct isl_map *result;
6164 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6165 isl_die(set->ctx, isl_error_invalid,
6166 "parameters don't match", goto error);
6168 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6169 !isl_map_compatible_range(map, set))
6170 isl_die(set->ctx, isl_error_invalid,
6171 "incompatible spaces", goto error);
6173 if (isl_set_plain_is_universe(set)) {
6178 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6179 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6180 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6182 result = isl_map_alloc_space(isl_space_copy(map->dim),
6183 map->n * set->n, flags);
6186 for (i = 0; i < map->n; ++i)
6187 for (j = 0; j < set->n; ++j) {
6188 result = isl_map_add_basic_map(result,
6189 isl_basic_map_intersect_range(
6190 isl_basic_map_copy(map->p[i]),
6191 isl_basic_set_copy(set->p[j])));
6204 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6205 __isl_take isl_set *set)
6207 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6210 struct isl_map *isl_map_intersect_domain(
6211 struct isl_map *map, struct isl_set *set)
6213 return isl_map_reverse(
6214 isl_map_intersect_range(isl_map_reverse(map), set));
6217 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6218 __isl_take isl_map *map2)
6222 map1 = isl_map_reverse(map1);
6223 map1 = isl_map_apply_range(map1, map2);
6224 return isl_map_reverse(map1);
6231 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6232 __isl_take isl_map *map2)
6234 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6237 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6238 __isl_take isl_map *map2)
6240 isl_space *dim_result;
6241 struct isl_map *result;
6247 dim_result = isl_space_join(isl_space_copy(map1->dim),
6248 isl_space_copy(map2->dim));
6250 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6253 for (i = 0; i < map1->n; ++i)
6254 for (j = 0; j < map2->n; ++j) {
6255 result = isl_map_add_basic_map(result,
6256 isl_basic_map_apply_range(
6257 isl_basic_map_copy(map1->p[i]),
6258 isl_basic_map_copy(map2->p[j])));
6264 if (result && result->n <= 1)
6265 ISL_F_SET(result, ISL_MAP_DISJOINT);
6273 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6274 __isl_take isl_map *map2)
6276 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6280 * returns range - domain
6282 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6284 isl_space *dims, *target_dim;
6285 struct isl_basic_set *bset;
6292 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6293 bmap->dim, isl_dim_out),
6295 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6296 dim = isl_basic_map_n_in(bmap);
6297 nparam = isl_basic_map_n_param(bmap);
6298 bset = isl_basic_set_from_basic_map(bmap);
6299 bset = isl_basic_set_cow(bset);
6300 dims = isl_basic_set_get_space(bset);
6301 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6302 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6303 bset = isl_basic_set_swap_vars(bset, 2*dim);
6304 for (i = 0; i < dim; ++i) {
6305 int j = isl_basic_map_alloc_equality(
6306 (struct isl_basic_map *)bset);
6309 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6310 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6311 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6312 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6314 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6315 bset = isl_basic_set_reset_space(bset, target_dim);
6318 isl_basic_map_free(bmap);
6323 * returns range - domain
6325 struct isl_set *isl_map_deltas(struct isl_map *map)
6329 struct isl_set *result;
6334 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6335 map->dim, isl_dim_out),
6337 dim = isl_map_get_space(map);
6338 dim = isl_space_domain(dim);
6339 result = isl_set_alloc_space(dim, map->n, 0);
6342 for (i = 0; i < map->n; ++i)
6343 result = isl_set_add_basic_set(result,
6344 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6353 * returns [domain -> range] -> range - domain
6355 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6356 __isl_take isl_basic_map *bmap)
6360 isl_basic_map *domain;
6364 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6365 isl_die(bmap->ctx, isl_error_invalid,
6366 "domain and range don't match", goto error);
6368 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6369 n = isl_basic_map_dim(bmap, isl_dim_in);
6371 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6372 domain = isl_basic_map_universe(dim);
6374 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6375 bmap = isl_basic_map_apply_range(bmap, domain);
6376 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6378 total = isl_basic_map_total_dim(bmap);
6380 for (i = 0; i < n; ++i) {
6381 k = isl_basic_map_alloc_equality(bmap);
6384 isl_seq_clr(bmap->eq[k], 1 + total);
6385 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6386 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6387 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6390 bmap = isl_basic_map_gauss(bmap, NULL);
6391 return isl_basic_map_finalize(bmap);
6393 isl_basic_map_free(bmap);
6398 * returns [domain -> range] -> range - domain
6400 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6403 isl_space *domain_dim;
6408 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6409 isl_die(map->ctx, isl_error_invalid,
6410 "domain and range don't match", goto error);
6412 map = isl_map_cow(map);
6416 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6417 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6418 map->dim = isl_space_join(map->dim, domain_dim);
6421 for (i = 0; i < map->n; ++i) {
6422 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6426 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6433 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6435 struct isl_basic_map *bmap;
6443 nparam = dims->nparam;
6445 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6449 for (i = 0; i < dim; ++i) {
6450 int j = isl_basic_map_alloc_equality(bmap);
6453 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6454 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6455 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6457 return isl_basic_map_finalize(bmap);
6459 isl_basic_map_free(bmap);
6463 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6467 if (dim->n_in != dim->n_out)
6468 isl_die(dim->ctx, isl_error_invalid,
6469 "number of input and output dimensions needs to be "
6470 "the same", goto error);
6471 return basic_map_identity(dim);
6473 isl_space_free(dim);
6477 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6479 if (!model || !model->dim)
6481 return isl_basic_map_identity(isl_space_copy(model->dim));
6484 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6486 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6489 struct isl_map *isl_map_identity_like(struct isl_map *model)
6491 if (!model || !model->dim)
6493 return isl_map_identity(isl_space_copy(model->dim));
6496 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6498 if (!model || !model->dim)
6500 return isl_map_identity(isl_space_copy(model->dim));
6503 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6505 isl_space *dim = isl_set_get_space(set);
6507 id = isl_map_identity(isl_space_map_from_set(dim));
6508 return isl_map_intersect_range(id, set);
6511 /* Construct a basic set with all set dimensions having only non-negative
6514 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6515 __isl_take isl_space *space)
6520 struct isl_basic_set *bset;
6524 nparam = space->nparam;
6526 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6529 for (i = 0; i < dim; ++i) {
6530 int k = isl_basic_set_alloc_inequality(bset);
6533 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6534 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6538 isl_basic_set_free(bset);
6542 /* Construct the half-space x_pos >= 0.
6544 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6548 isl_basic_set *nonneg;
6550 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6551 k = isl_basic_set_alloc_inequality(nonneg);
6554 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6555 isl_int_set_si(nonneg->ineq[k][pos], 1);
6557 return isl_basic_set_finalize(nonneg);
6559 isl_basic_set_free(nonneg);
6563 /* Construct the half-space x_pos <= -1.
6565 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6570 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6571 k = isl_basic_set_alloc_inequality(neg);
6574 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6575 isl_int_set_si(neg->ineq[k][0], -1);
6576 isl_int_set_si(neg->ineq[k][pos], -1);
6578 return isl_basic_set_finalize(neg);
6580 isl_basic_set_free(neg);
6584 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6585 enum isl_dim_type type, unsigned first, unsigned n)
6588 isl_basic_set *nonneg;
6596 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6598 for (i = 0; i < n; ++i) {
6599 nonneg = nonneg_halfspace(isl_set_get_space(set),
6600 pos(set->dim, type) + first + i);
6601 neg = neg_halfspace(isl_set_get_space(set),
6602 pos(set->dim, type) + first + i);
6604 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6613 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6614 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6621 if (isl_set_plain_is_empty(set)) {
6626 return fn(set, signs, user);
6629 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6631 half = isl_set_intersect(half, isl_set_copy(set));
6632 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6636 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6638 half = isl_set_intersect(half, set);
6639 return foreach_orthant(half, signs, first + 1, len, fn, user);
6645 /* Call "fn" on the intersections of "set" with each of the orthants
6646 * (except for obviously empty intersections). The orthant is identified
6647 * by the signs array, with each entry having value 1 or -1 according
6648 * to the sign of the corresponding variable.
6650 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6651 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6661 if (isl_set_plain_is_empty(set))
6664 nparam = isl_set_dim(set, isl_dim_param);
6665 nvar = isl_set_dim(set, isl_dim_set);
6667 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6669 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6677 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6679 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6682 int isl_basic_map_is_subset(
6683 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6686 struct isl_map *map1;
6687 struct isl_map *map2;
6689 if (!bmap1 || !bmap2)
6692 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6693 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6695 is_subset = isl_map_is_subset(map1, map2);
6703 int isl_basic_map_is_equal(
6704 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6708 if (!bmap1 || !bmap2)
6710 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6713 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6717 int isl_basic_set_is_equal(
6718 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6720 return isl_basic_map_is_equal(
6721 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6724 int isl_map_is_empty(struct isl_map *map)
6731 for (i = 0; i < map->n; ++i) {
6732 is_empty = isl_basic_map_is_empty(map->p[i]);
6741 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6743 return map ? map->n == 0 : -1;
6746 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6748 return isl_map_plain_is_empty(map);
6751 int isl_set_plain_is_empty(struct isl_set *set)
6753 return set ? set->n == 0 : -1;
6756 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6758 return isl_set_plain_is_empty(set);
6761 int isl_set_is_empty(struct isl_set *set)
6763 return isl_map_is_empty((struct isl_map *)set);
6766 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6771 return isl_space_is_equal(map1->dim, map2->dim);
6774 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6779 return isl_space_is_equal(set1->dim, set2->dim);
6782 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6788 is_subset = isl_map_is_subset(map1, map2);
6791 is_subset = isl_map_is_subset(map2, map1);
6795 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6797 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
6800 int isl_basic_map_is_strict_subset(
6801 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6805 if (!bmap1 || !bmap2)
6807 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6810 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6811 if (is_subset == -1)
6816 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6822 is_subset = isl_map_is_subset(map1, map2);
6825 is_subset = isl_map_is_subset(map2, map1);
6826 if (is_subset == -1)
6831 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6833 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6836 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6840 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6843 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6847 return bset->n_eq == 0 && bset->n_ineq == 0;
6850 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6857 for (i = 0; i < map->n; ++i) {
6858 int r = isl_basic_map_is_universe(map->p[i]);
6866 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6868 return isl_map_plain_is_universe((isl_map *) set);
6871 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6873 return isl_set_plain_is_universe(set);
6876 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6878 struct isl_basic_set *bset = NULL;
6879 struct isl_vec *sample = NULL;
6886 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6889 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6890 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6891 copy = isl_basic_map_remove_redundancies(copy);
6892 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6893 isl_basic_map_free(copy);
6897 total = 1 + isl_basic_map_total_dim(bmap);
6898 if (bmap->sample && bmap->sample->size == total) {
6899 int contains = isl_basic_map_contains(bmap, bmap->sample);
6905 isl_vec_free(bmap->sample);
6906 bmap->sample = NULL;
6907 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6910 sample = isl_basic_set_sample_vec(bset);
6913 empty = sample->size == 0;
6914 isl_vec_free(bmap->sample);
6915 bmap->sample = sample;
6917 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6922 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6926 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6929 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6931 return isl_basic_map_plain_is_empty(bmap);
6934 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6938 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6941 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6943 return isl_basic_set_plain_is_empty(bset);
6946 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6948 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6951 struct isl_map *isl_basic_map_union(
6952 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6954 struct isl_map *map;
6955 if (!bmap1 || !bmap2)
6958 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
6960 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
6963 map = isl_map_add_basic_map(map, bmap1);
6964 map = isl_map_add_basic_map(map, bmap2);
6967 isl_basic_map_free(bmap1);
6968 isl_basic_map_free(bmap2);
6972 struct isl_set *isl_basic_set_union(
6973 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6975 return (struct isl_set *)isl_basic_map_union(
6976 (struct isl_basic_map *)bset1,
6977 (struct isl_basic_map *)bset2);
6980 /* Order divs such that any div only depends on previous divs */
6981 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6989 off = isl_space_dim(bmap->dim, isl_dim_all);
6991 for (i = 0; i < bmap->n_div; ++i) {
6993 if (isl_int_is_zero(bmap->div[i][0]))
6995 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6999 isl_basic_map_swap_div(bmap, i, i + pos);
7005 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7007 return (struct isl_basic_set *)
7008 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7011 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7018 for (i = 0; i < map->n; ++i) {
7019 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7030 /* Apply the expansion computed by isl_merge_divs.
7031 * The expansion itself is given by "exp" while the resulting
7032 * list of divs is given by "div".
7034 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7035 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7040 bset = isl_basic_set_cow(bset);
7044 if (div->n_row < bset->n_div)
7045 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7046 "not an expansion", goto error);
7048 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7049 div->n_row - bset->n_div, 0,
7050 2 * (div->n_row - bset->n_div));
7052 n_div = bset->n_div;
7053 for (i = n_div; i < div->n_row; ++i)
7054 if (isl_basic_set_alloc_div(bset) < 0)
7058 for (i = div->n_row - 1; i >= 0; --i) {
7059 if (j >= 0 && exp[j] == i) {
7061 isl_basic_map_swap_div(bset, i, j);
7064 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7065 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7073 isl_basic_set_free(bset);
7078 /* Look for a div in dst that corresponds to the div "div" in src.
7079 * The divs before "div" in src and dst are assumed to be the same.
7081 * Returns -1 if no corresponding div was found and the position
7082 * of the corresponding div in dst otherwise.
7084 static int find_div(struct isl_basic_map *dst,
7085 struct isl_basic_map *src, unsigned div)
7089 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7091 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7092 for (i = div; i < dst->n_div; ++i)
7093 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7094 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7095 dst->n_div - div) == -1)
7100 struct isl_basic_map *isl_basic_map_align_divs(
7101 struct isl_basic_map *dst, struct isl_basic_map *src)
7104 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7109 if (src->n_div == 0)
7112 for (i = 0; i < src->n_div; ++i)
7113 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7115 src = isl_basic_map_order_divs(src);
7116 dst = isl_basic_map_cow(dst);
7117 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7118 src->n_div, 0, 2 * src->n_div);
7121 for (i = 0; i < src->n_div; ++i) {
7122 int j = find_div(dst, src, i);
7124 j = isl_basic_map_alloc_div(dst);
7127 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7128 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7129 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7133 isl_basic_map_swap_div(dst, i, j);
7137 isl_basic_map_free(dst);
7141 struct isl_basic_set *isl_basic_set_align_divs(
7142 struct isl_basic_set *dst, struct isl_basic_set *src)
7144 return (struct isl_basic_set *)isl_basic_map_align_divs(
7145 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7148 struct isl_map *isl_map_align_divs(struct isl_map *map)
7156 map = isl_map_compute_divs(map);
7157 map = isl_map_cow(map);
7161 for (i = 1; i < map->n; ++i)
7162 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7163 for (i = 1; i < map->n; ++i)
7164 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7166 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7170 struct isl_set *isl_set_align_divs(struct isl_set *set)
7172 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7175 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7176 __isl_take isl_map *map)
7180 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7181 map = isl_map_intersect_domain(map, set);
7182 set = isl_map_range(map);
7190 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7191 __isl_take isl_map *map)
7193 return isl_map_align_params_map_map_and(set, map, &set_apply);
7196 /* There is no need to cow as removing empty parts doesn't change
7197 * the meaning of the set.
7199 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7206 for (i = map->n-1; i >= 0; --i) {
7207 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
7209 isl_basic_map_free(map->p[i]);
7210 if (i != map->n-1) {
7211 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7212 map->p[i] = map->p[map->n-1];
7220 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7222 return (struct isl_set *)
7223 isl_map_remove_empty_parts((struct isl_map *)set);
7226 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7228 struct isl_basic_map *bmap;
7229 if (!map || map->n == 0)
7231 bmap = map->p[map->n-1];
7232 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7233 return isl_basic_map_copy(bmap);
7236 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7238 return (struct isl_basic_set *)
7239 isl_map_copy_basic_map((struct isl_map *)set);
7242 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7243 __isl_keep isl_basic_map *bmap)
7249 for (i = map->n-1; i >= 0; --i) {
7250 if (map->p[i] != bmap)
7252 map = isl_map_cow(map);
7255 isl_basic_map_free(map->p[i]);
7256 if (i != map->n-1) {
7257 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7258 map->p[i] = map->p[map->n-1];
7269 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7270 struct isl_basic_set *bset)
7272 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7273 (struct isl_basic_map *)bset);
7276 /* Given two basic sets bset1 and bset2, compute the maximal difference
7277 * between the values of dimension pos in bset1 and those in bset2
7278 * for any common value of the parameters and dimensions preceding pos.
7280 static enum isl_lp_result basic_set_maximal_difference_at(
7281 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7282 int pos, isl_int *opt)
7285 struct isl_basic_map *bmap1 = NULL;
7286 struct isl_basic_map *bmap2 = NULL;
7287 struct isl_ctx *ctx;
7288 struct isl_vec *obj;
7291 unsigned dim1, dim2;
7292 enum isl_lp_result res;
7294 if (!bset1 || !bset2)
7295 return isl_lp_error;
7297 nparam = isl_basic_set_n_param(bset1);
7298 dim1 = isl_basic_set_n_dim(bset1);
7299 dim2 = isl_basic_set_n_dim(bset2);
7300 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7301 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7302 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7303 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7304 if (!bmap1 || !bmap2)
7306 bmap1 = isl_basic_map_cow(bmap1);
7307 bmap1 = isl_basic_map_extend(bmap1, nparam,
7308 pos, (dim1 - pos) + (dim2 - pos),
7309 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7310 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7313 total = isl_basic_map_total_dim(bmap1);
7315 obj = isl_vec_alloc(ctx, 1 + total);
7316 isl_seq_clr(obj->block.data, 1 + total);
7317 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7318 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7321 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7323 isl_basic_map_free(bmap1);
7327 isl_basic_map_free(bmap1);
7328 isl_basic_map_free(bmap2);
7329 return isl_lp_error;
7332 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7333 * for any common value of the parameters and dimensions preceding pos
7334 * in both basic sets, the values of dimension pos in bset1 are
7335 * smaller or larger than those in bset2.
7338 * 1 if bset1 follows bset2
7339 * -1 if bset1 precedes bset2
7340 * 0 if bset1 and bset2 are incomparable
7341 * -2 if some error occurred.
7343 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7344 struct isl_basic_set *bset2, int pos)
7347 enum isl_lp_result res;
7352 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7354 if (res == isl_lp_empty)
7356 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7357 res == isl_lp_unbounded)
7359 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7368 /* Given two basic sets bset1 and bset2, check whether
7369 * for any common value of the parameters and dimensions preceding pos
7370 * there is a value of dimension pos in bset1 that is larger
7371 * than a value of the same dimension in bset2.
7374 * 1 if there exists such a pair
7375 * 0 if there is no such pair, but there is a pair of equal values
7377 * -2 if some error occurred.
7379 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7380 __isl_keep isl_basic_set *bset2, int pos)
7383 enum isl_lp_result res;
7388 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7390 if (res == isl_lp_empty)
7392 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7393 res == isl_lp_unbounded)
7395 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7397 else if (res == isl_lp_ok)
7406 /* Given two sets set1 and set2, check whether
7407 * for any common value of the parameters and dimensions preceding pos
7408 * there is a value of dimension pos in set1 that is larger
7409 * than a value of the same dimension in set2.
7412 * 1 if there exists such a pair
7413 * 0 if there is no such pair, but there is a pair of equal values
7415 * -2 if some error occurred.
7417 int isl_set_follows_at(__isl_keep isl_set *set1,
7418 __isl_keep isl_set *set2, int pos)
7426 for (i = 0; i < set1->n; ++i)
7427 for (j = 0; j < set2->n; ++j) {
7429 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7430 if (f == 1 || f == -2)
7439 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7440 unsigned pos, isl_int *val)
7448 total = isl_basic_map_total_dim(bmap);
7449 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7450 for (; d+1 > pos; --d)
7451 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7455 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7457 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7459 if (!isl_int_is_one(bmap->eq[i][1+d]))
7462 isl_int_neg(*val, bmap->eq[i][0]);
7468 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7469 unsigned pos, isl_int *val)
7481 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7484 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7485 for (i = 1; fixed == 1 && i < map->n; ++i) {
7486 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7487 if (fixed == 1 && isl_int_ne(tmp, v))
7491 isl_int_set(*val, v);
7497 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7498 unsigned pos, isl_int *val)
7500 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7504 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7507 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7510 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7511 enum isl_dim_type type, unsigned pos, isl_int *val)
7513 if (pos >= isl_basic_map_dim(bmap, type))
7515 return isl_basic_map_plain_has_fixed_var(bmap,
7516 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7519 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7520 enum isl_dim_type type, unsigned pos, isl_int *val)
7522 if (pos >= isl_map_dim(map, type))
7524 return isl_map_plain_has_fixed_var(map,
7525 map_offset(map, type) - 1 + pos, val);
7528 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7529 enum isl_dim_type type, unsigned pos, isl_int *val)
7531 return isl_map_plain_is_fixed(set, type, pos, val);
7534 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7535 enum isl_dim_type type, unsigned pos, isl_int *val)
7537 return isl_map_plain_is_fixed(map, type, pos, val);
7540 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7541 * then return this fixed value in *val.
7543 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7544 unsigned dim, isl_int *val)
7546 return isl_basic_set_plain_has_fixed_var(bset,
7547 isl_basic_set_n_param(bset) + dim, val);
7550 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7551 * then return this fixed value in *val.
7553 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7554 unsigned dim, isl_int *val)
7556 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7559 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7560 unsigned dim, isl_int *val)
7562 return isl_set_plain_dim_is_fixed(set, dim, val);
7565 /* Check if input variable in has fixed value and if so and if val is not NULL,
7566 * then return this fixed value in *val.
7568 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7569 unsigned in, isl_int *val)
7571 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7574 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7575 * and if val is not NULL, then return this lower bound in *val.
7577 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7578 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7580 int i, i_eq = -1, i_ineq = -1;
7587 total = isl_basic_set_total_dim(bset);
7588 nparam = isl_basic_set_n_param(bset);
7589 for (i = 0; i < bset->n_eq; ++i) {
7590 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7596 for (i = 0; i < bset->n_ineq; ++i) {
7597 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7599 if (i_eq != -1 || i_ineq != -1)
7603 if (i_eq == -1 && i_ineq == -1)
7605 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7606 /* The coefficient should always be one due to normalization. */
7607 if (!isl_int_is_one(c[1+nparam+dim]))
7609 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7611 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7612 total - nparam - dim - 1) != -1)
7615 isl_int_neg(*val, c[0]);
7619 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7620 unsigned dim, isl_int *val)
7632 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7636 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7638 for (i = 1; fixed == 1 && i < set->n; ++i) {
7639 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7641 if (fixed == 1 && isl_int_ne(tmp, v))
7645 isl_int_set(*val, v);
7656 /* uset_gist depends on constraints without existentially quantified
7657 * variables sorting first.
7659 static int qsort_constraint_cmp(const void *p1, const void *p2)
7661 const struct constraint *c1 = (const struct constraint *)p1;
7662 const struct constraint *c2 = (const struct constraint *)p2;
7664 unsigned size = isl_min(c1->size, c2->size);
7666 l1 = isl_seq_last_non_zero(c1->c, size);
7667 l2 = isl_seq_last_non_zero(c2->c, size);
7672 return isl_seq_cmp(c1->c, c2->c, size);
7675 static struct isl_basic_map *isl_basic_map_sort_constraints(
7676 struct isl_basic_map *bmap)
7679 struct constraint *c;
7684 total = isl_basic_map_total_dim(bmap);
7685 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7688 for (i = 0; i < bmap->n_ineq; ++i) {
7690 c[i].c = bmap->ineq[i];
7692 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7693 for (i = 0; i < bmap->n_ineq; ++i)
7694 bmap->ineq[i] = c[i].c;
7698 isl_basic_map_free(bmap);
7702 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7703 __isl_take isl_basic_set *bset)
7705 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7706 (struct isl_basic_map *)bset);
7709 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7713 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7715 bmap = isl_basic_map_remove_redundancies(bmap);
7716 bmap = isl_basic_map_sort_constraints(bmap);
7717 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7721 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7723 return (struct isl_basic_set *)isl_basic_map_normalize(
7724 (struct isl_basic_map *)bset);
7727 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7728 const __isl_keep isl_basic_map *bmap2)
7735 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7736 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7737 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7738 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7739 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7740 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7741 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7742 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7743 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7744 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7745 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7747 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7749 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7751 if (bmap1->n_eq != bmap2->n_eq)
7752 return bmap1->n_eq - bmap2->n_eq;
7753 if (bmap1->n_ineq != bmap2->n_ineq)
7754 return bmap1->n_ineq - bmap2->n_ineq;
7755 if (bmap1->n_div != bmap2->n_div)
7756 return bmap1->n_div - bmap2->n_div;
7757 total = isl_basic_map_total_dim(bmap1);
7758 for (i = 0; i < bmap1->n_eq; ++i) {
7759 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7763 for (i = 0; i < bmap1->n_ineq; ++i) {
7764 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7768 for (i = 0; i < bmap1->n_div; ++i) {
7769 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7776 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
7777 const __isl_keep isl_basic_set *bset2)
7779 return isl_basic_map_plain_cmp(bset1, bset2);
7782 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
7783 const __isl_keep isl_set *set2)
7789 if (set1->n != set2->n)
7790 return set1->n - set2->n;
7792 for (i = 0; i < set1->n; ++i) {
7793 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
7801 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7802 __isl_keep isl_basic_map *bmap2)
7804 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7807 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7808 __isl_keep isl_basic_set *bset2)
7810 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7811 (isl_basic_map *)bset2);
7814 static int qsort_bmap_cmp(const void *p1, const void *p2)
7816 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7817 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7819 return isl_basic_map_plain_cmp(bmap1, bmap2);
7822 /* We normalize in place, but if anything goes wrong we need
7823 * to return NULL, so we need to make sure we don't change the
7824 * meaning of any possible other copies of map.
7826 struct isl_map *isl_map_normalize(struct isl_map *map)
7829 struct isl_basic_map *bmap;
7833 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7835 for (i = 0; i < map->n; ++i) {
7836 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7839 isl_basic_map_free(map->p[i]);
7842 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7843 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7844 map = isl_map_remove_empty_parts(map);
7847 for (i = map->n - 1; i >= 1; --i) {
7848 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7850 isl_basic_map_free(map->p[i-1]);
7851 for (j = i; j < map->n; ++j)
7852 map->p[j-1] = map->p[j];
7862 struct isl_set *isl_set_normalize(struct isl_set *set)
7864 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7867 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7877 if (!isl_space_is_equal(map1->dim, map2->dim))
7880 map1 = isl_map_copy(map1);
7881 map2 = isl_map_copy(map2);
7882 map1 = isl_map_normalize(map1);
7883 map2 = isl_map_normalize(map2);
7886 equal = map1->n == map2->n;
7887 for (i = 0; equal && i < map1->n; ++i) {
7888 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7901 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7903 return isl_map_plain_is_equal(map1, map2);
7906 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7908 return isl_map_plain_is_equal((struct isl_map *)set1,
7909 (struct isl_map *)set2);
7912 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7914 return isl_set_plain_is_equal(set1, set2);
7917 /* Return an interval that ranges from min to max (inclusive)
7919 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7920 isl_int min, isl_int max)
7923 struct isl_basic_set *bset = NULL;
7925 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7929 k = isl_basic_set_alloc_inequality(bset);
7932 isl_int_set_si(bset->ineq[k][1], 1);
7933 isl_int_neg(bset->ineq[k][0], min);
7935 k = isl_basic_set_alloc_inequality(bset);
7938 isl_int_set_si(bset->ineq[k][1], -1);
7939 isl_int_set(bset->ineq[k][0], max);
7943 isl_basic_set_free(bset);
7947 /* Return the Cartesian product of the basic sets in list (in the given order).
7949 __isl_give isl_basic_set *isl_basic_set_list_product(
7950 __isl_take struct isl_basic_set_list *list)
7958 struct isl_basic_set *product = NULL;
7962 isl_assert(list->ctx, list->n > 0, goto error);
7963 isl_assert(list->ctx, list->p[0], goto error);
7964 nparam = isl_basic_set_n_param(list->p[0]);
7965 dim = isl_basic_set_n_dim(list->p[0]);
7966 extra = list->p[0]->n_div;
7967 n_eq = list->p[0]->n_eq;
7968 n_ineq = list->p[0]->n_ineq;
7969 for (i = 1; i < list->n; ++i) {
7970 isl_assert(list->ctx, list->p[i], goto error);
7971 isl_assert(list->ctx,
7972 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7973 dim += isl_basic_set_n_dim(list->p[i]);
7974 extra += list->p[i]->n_div;
7975 n_eq += list->p[i]->n_eq;
7976 n_ineq += list->p[i]->n_ineq;
7978 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7983 for (i = 0; i < list->n; ++i) {
7984 isl_basic_set_add_constraints(product,
7985 isl_basic_set_copy(list->p[i]), dim);
7986 dim += isl_basic_set_n_dim(list->p[i]);
7988 isl_basic_set_list_free(list);
7991 isl_basic_set_free(product);
7992 isl_basic_set_list_free(list);
7996 struct isl_basic_map *isl_basic_map_product(
7997 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7999 isl_space *dim_result = NULL;
8000 struct isl_basic_map *bmap;
8001 unsigned in1, in2, out1, out2, nparam, total, pos;
8002 struct isl_dim_map *dim_map1, *dim_map2;
8004 if (!bmap1 || !bmap2)
8007 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8008 bmap2->dim, isl_dim_param), goto error);
8009 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8010 isl_space_copy(bmap2->dim));
8012 in1 = isl_basic_map_n_in(bmap1);
8013 in2 = isl_basic_map_n_in(bmap2);
8014 out1 = isl_basic_map_n_out(bmap1);
8015 out2 = isl_basic_map_n_out(bmap2);
8016 nparam = isl_basic_map_n_param(bmap1);
8018 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8019 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8020 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8021 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8022 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8023 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8024 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8025 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8026 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8027 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8028 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8030 bmap = isl_basic_map_alloc_space(dim_result,
8031 bmap1->n_div + bmap2->n_div,
8032 bmap1->n_eq + bmap2->n_eq,
8033 bmap1->n_ineq + bmap2->n_ineq);
8034 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8035 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8036 bmap = isl_basic_map_simplify(bmap);
8037 return isl_basic_map_finalize(bmap);
8039 isl_basic_map_free(bmap1);
8040 isl_basic_map_free(bmap2);
8044 __isl_give isl_basic_map *isl_basic_map_flat_product(
8045 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8047 isl_basic_map *prod;
8049 prod = isl_basic_map_product(bmap1, bmap2);
8050 prod = isl_basic_map_flatten(prod);
8054 __isl_give isl_basic_set *isl_basic_set_flat_product(
8055 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8057 return isl_basic_map_flat_range_product(bset1, bset2);
8060 __isl_give isl_basic_map *isl_basic_map_domain_product(
8061 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8063 isl_space *space_result = NULL;
8064 isl_basic_map *bmap;
8065 unsigned in1, in2, out, nparam, total, pos;
8066 struct isl_dim_map *dim_map1, *dim_map2;
8068 if (!bmap1 || !bmap2)
8071 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8072 isl_space_copy(bmap2->dim));
8074 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8075 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8076 out = isl_basic_map_dim(bmap1, isl_dim_out);
8077 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8079 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8080 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8081 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8082 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8083 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8084 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8085 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8086 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8087 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8088 isl_dim_map_div(dim_map1, bmap1, pos += out);
8089 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8091 bmap = isl_basic_map_alloc_space(space_result,
8092 bmap1->n_div + bmap2->n_div,
8093 bmap1->n_eq + bmap2->n_eq,
8094 bmap1->n_ineq + bmap2->n_ineq);
8095 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8096 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8097 bmap = isl_basic_map_simplify(bmap);
8098 return isl_basic_map_finalize(bmap);
8100 isl_basic_map_free(bmap1);
8101 isl_basic_map_free(bmap2);
8105 __isl_give isl_basic_map *isl_basic_map_range_product(
8106 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8108 isl_space *dim_result = NULL;
8109 isl_basic_map *bmap;
8110 unsigned in, out1, out2, nparam, total, pos;
8111 struct isl_dim_map *dim_map1, *dim_map2;
8113 if (!bmap1 || !bmap2)
8116 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8117 isl_space_copy(bmap2->dim));
8119 in = isl_basic_map_dim(bmap1, isl_dim_in);
8120 out1 = isl_basic_map_n_out(bmap1);
8121 out2 = isl_basic_map_n_out(bmap2);
8122 nparam = isl_basic_map_n_param(bmap1);
8124 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8125 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8126 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8127 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8128 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8129 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8130 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8131 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8132 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8133 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8134 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8136 bmap = isl_basic_map_alloc_space(dim_result,
8137 bmap1->n_div + bmap2->n_div,
8138 bmap1->n_eq + bmap2->n_eq,
8139 bmap1->n_ineq + bmap2->n_ineq);
8140 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8141 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8142 bmap = isl_basic_map_simplify(bmap);
8143 return isl_basic_map_finalize(bmap);
8145 isl_basic_map_free(bmap1);
8146 isl_basic_map_free(bmap2);
8150 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8151 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8153 isl_basic_map *prod;
8155 prod = isl_basic_map_range_product(bmap1, bmap2);
8156 prod = isl_basic_map_flatten_range(prod);
8160 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8161 __isl_take isl_map *map2,
8162 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8163 __isl_take isl_space *right),
8164 __isl_give isl_basic_map *(*basic_map_product)(
8165 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8168 struct isl_map *result;
8174 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8175 map2->dim, isl_dim_param), goto error);
8177 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8178 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8179 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8181 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8182 isl_space_copy(map2->dim)),
8183 map1->n * map2->n, flags);
8186 for (i = 0; i < map1->n; ++i)
8187 for (j = 0; j < map2->n; ++j) {
8188 struct isl_basic_map *part;
8189 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8190 isl_basic_map_copy(map2->p[j]));
8191 if (isl_basic_map_is_empty(part))
8192 isl_basic_map_free(part);
8194 result = isl_map_add_basic_map(result, part);
8207 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8209 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8210 __isl_take isl_map *map2)
8212 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8215 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8216 __isl_take isl_map *map2)
8218 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8221 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8223 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8224 __isl_take isl_map *map2)
8228 prod = isl_map_product(map1, map2);
8229 prod = isl_map_flatten(prod);
8233 /* Given two set A and B, construct its Cartesian product A x B.
8235 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8237 return isl_map_range_product(set1, set2);
8240 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8241 __isl_take isl_set *set2)
8243 return isl_map_flat_range_product(set1, set2);
8246 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8248 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8249 __isl_take isl_map *map2)
8251 return map_product(map1, map2, &isl_space_domain_product,
8252 &isl_basic_map_domain_product);
8255 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8257 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8258 __isl_take isl_map *map2)
8260 return map_product(map1, map2, &isl_space_range_product,
8261 &isl_basic_map_range_product);
8264 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8265 __isl_take isl_map *map2)
8267 return isl_map_align_params_map_map_and(map1, map2,
8268 &map_domain_product_aligned);
8271 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8272 __isl_take isl_map *map2)
8274 return isl_map_align_params_map_map_and(map1, map2,
8275 &map_range_product_aligned);
8278 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8280 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8281 __isl_take isl_map *map2)
8285 prod = isl_map_domain_product(map1, map2);
8286 prod = isl_map_flatten_domain(prod);
8290 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8292 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8293 __isl_take isl_map *map2)
8297 prod = isl_map_range_product(map1, map2);
8298 prod = isl_map_flatten_range(prod);
8302 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8305 uint32_t hash = isl_hash_init();
8310 bmap = isl_basic_map_copy(bmap);
8311 bmap = isl_basic_map_normalize(bmap);
8314 total = isl_basic_map_total_dim(bmap);
8315 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8316 for (i = 0; i < bmap->n_eq; ++i) {
8318 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8319 isl_hash_hash(hash, c_hash);
8321 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8322 for (i = 0; i < bmap->n_ineq; ++i) {
8324 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8325 isl_hash_hash(hash, c_hash);
8327 isl_hash_byte(hash, bmap->n_div & 0xFF);
8328 for (i = 0; i < bmap->n_div; ++i) {
8330 if (isl_int_is_zero(bmap->div[i][0]))
8332 isl_hash_byte(hash, i & 0xFF);
8333 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8334 isl_hash_hash(hash, c_hash);
8336 isl_basic_map_free(bmap);
8340 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8342 return isl_basic_map_get_hash((isl_basic_map *)bset);
8345 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8352 map = isl_map_copy(map);
8353 map = isl_map_normalize(map);
8357 hash = isl_hash_init();
8358 for (i = 0; i < map->n; ++i) {
8360 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8361 isl_hash_hash(hash, bmap_hash);
8369 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8371 return isl_map_get_hash((isl_map *)set);
8374 /* Check if the value for dimension dim is completely determined
8375 * by the values of the other parameters and variables.
8376 * That is, check if dimension dim is involved in an equality.
8378 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8385 nparam = isl_basic_set_n_param(bset);
8386 for (i = 0; i < bset->n_eq; ++i)
8387 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8392 /* Check if the value for dimension dim is completely determined
8393 * by the values of the other parameters and variables.
8394 * That is, check if dimension dim is involved in an equality
8395 * for each of the subsets.
8397 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8403 for (i = 0; i < set->n; ++i) {
8405 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8412 int isl_set_n_basic_set(__isl_keep isl_set *set)
8414 return set ? set->n : 0;
8417 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8418 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8425 for (i = 0; i < map->n; ++i)
8426 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8432 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8433 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8440 for (i = 0; i < set->n; ++i)
8441 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8447 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8454 bset = isl_basic_set_cow(bset);
8458 dim = isl_basic_set_get_space(bset);
8459 dim = isl_space_lift(dim, bset->n_div);
8462 isl_space_free(bset->dim);
8464 bset->extra -= bset->n_div;
8467 bset = isl_basic_set_finalize(bset);
8471 isl_basic_set_free(bset);
8475 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8481 set = isl_set_align_divs(set);
8486 set = isl_set_cow(set);
8490 n_div = set->p[0]->n_div;
8491 dim = isl_set_get_space(set);
8492 dim = isl_space_lift(dim, n_div);
8495 isl_space_free(set->dim);
8498 for (i = 0; i < set->n; ++i) {
8499 set->p[i] = isl_basic_set_lift(set->p[i]);
8510 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8513 struct isl_basic_map *bmap;
8520 set = isl_set_align_divs(set);
8525 dim = isl_set_get_space(set);
8526 if (set->n == 0 || set->p[0]->n_div == 0) {
8528 return isl_map_identity(isl_space_map_from_set(dim));
8531 n_div = set->p[0]->n_div;
8532 dim = isl_space_map_from_set(dim);
8533 n_param = isl_space_dim(dim, isl_dim_param);
8534 n_set = isl_space_dim(dim, isl_dim_in);
8535 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8536 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8537 for (i = 0; i < n_set; ++i)
8538 bmap = var_equal(bmap, i);
8540 total = n_param + n_set + n_set + n_div;
8541 for (i = 0; i < n_div; ++i) {
8542 k = isl_basic_map_alloc_inequality(bmap);
8545 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8546 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8547 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8548 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8549 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8550 set->p[0]->div[i][0]);
8552 l = isl_basic_map_alloc_inequality(bmap);
8555 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8556 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8557 set->p[0]->div[i][0]);
8558 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8562 bmap = isl_basic_map_simplify(bmap);
8563 bmap = isl_basic_map_finalize(bmap);
8564 return isl_map_from_basic_map(bmap);
8567 isl_basic_map_free(bmap);
8571 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8579 dim = isl_basic_set_total_dim(bset);
8580 size += bset->n_eq * (1 + dim);
8581 size += bset->n_ineq * (1 + dim);
8582 size += bset->n_div * (2 + dim);
8587 int isl_set_size(__isl_keep isl_set *set)
8595 for (i = 0; i < set->n; ++i)
8596 size += isl_basic_set_size(set->p[i]);
8601 /* Check if there is any lower bound (if lower == 0) and/or upper
8602 * bound (if upper == 0) on the specified dim.
8604 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8605 enum isl_dim_type type, unsigned pos, int lower, int upper)
8612 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8614 pos += isl_basic_map_offset(bmap, type);
8616 for (i = 0; i < bmap->n_div; ++i) {
8617 if (isl_int_is_zero(bmap->div[i][0]))
8619 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8623 for (i = 0; i < bmap->n_eq; ++i)
8624 if (!isl_int_is_zero(bmap->eq[i][pos]))
8627 for (i = 0; i < bmap->n_ineq; ++i) {
8628 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8635 return lower && upper;
8638 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8639 enum isl_dim_type type, unsigned pos)
8641 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8644 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8645 enum isl_dim_type type, unsigned pos)
8647 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8650 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8651 enum isl_dim_type type, unsigned pos)
8653 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8656 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8657 enum isl_dim_type type, unsigned pos)
8664 for (i = 0; i < map->n; ++i) {
8666 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8667 if (bounded < 0 || !bounded)
8674 /* Return 1 if the specified dim is involved in both an upper bound
8675 * and a lower bound.
8677 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8678 enum isl_dim_type type, unsigned pos)
8680 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8683 static int has_bound(__isl_keep isl_map *map,
8684 enum isl_dim_type type, unsigned pos,
8685 int (*fn)(__isl_keep isl_basic_map *bmap,
8686 enum isl_dim_type type, unsigned pos))
8693 for (i = 0; i < map->n; ++i) {
8695 bounded = fn(map->p[i], type, pos);
8696 if (bounded < 0 || bounded)
8703 /* Return 1 if the specified dim is involved in any lower bound.
8705 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8706 enum isl_dim_type type, unsigned pos)
8708 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8711 /* Return 1 if the specified dim is involved in any upper bound.
8713 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8714 enum isl_dim_type type, unsigned pos)
8716 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8719 /* For each of the "n" variables starting at "first", determine
8720 * the sign of the variable and put the results in the first "n"
8721 * elements of the array "signs".
8723 * 1 means that the variable is non-negative
8724 * -1 means that the variable is non-positive
8725 * 0 means the variable attains both positive and negative values.
8727 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8728 unsigned first, unsigned n, int *signs)
8730 isl_vec *bound = NULL;
8731 struct isl_tab *tab = NULL;
8732 struct isl_tab_undo *snap;
8735 if (!bset || !signs)
8738 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8739 tab = isl_tab_from_basic_set(bset, 0);
8743 isl_seq_clr(bound->el, bound->size);
8744 isl_int_set_si(bound->el[0], -1);
8746 snap = isl_tab_snap(tab);
8747 for (i = 0; i < n; ++i) {
8750 isl_int_set_si(bound->el[1 + first + i], -1);
8751 if (isl_tab_add_ineq(tab, bound->el) < 0)
8754 isl_int_set_si(bound->el[1 + first + i], 0);
8755 if (isl_tab_rollback(tab, snap) < 0)
8763 isl_int_set_si(bound->el[1 + first + i], 1);
8764 if (isl_tab_add_ineq(tab, bound->el) < 0)
8767 isl_int_set_si(bound->el[1 + first + i], 0);
8768 if (isl_tab_rollback(tab, snap) < 0)
8771 signs[i] = empty ? -1 : 0;
8775 isl_vec_free(bound);
8779 isl_vec_free(bound);
8783 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8784 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8786 if (!bset || !signs)
8788 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8791 first += pos(bset->dim, type) - 1;
8792 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8795 /* Check if the given basic map is obviously single-valued.
8796 * In particular, for each output dimension, check that there is
8797 * an equality that defines the output dimension in terms of
8798 * earlier dimensions.
8800 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8810 total = 1 + isl_basic_map_total_dim(bmap);
8811 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8812 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8814 for (i = 0; i < n_out; ++i) {
8815 for (j = 0; j < bmap->n_eq; ++j) {
8816 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8818 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8819 total - (o_out + i + 1)) == -1)
8822 if (j >= bmap->n_eq)
8829 /* Check if the given map is obviously single-valued.
8831 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8840 return isl_basic_map_plain_is_single_valued(map->p[0]);
8843 /* Check if the given map is single-valued.
8848 * and check if the result is a subset of the identity mapping.
8850 int isl_map_is_single_valued(__isl_keep isl_map *map)
8857 sv = isl_map_plain_is_single_valued(map);
8861 test = isl_map_reverse(isl_map_copy(map));
8862 test = isl_map_apply_range(test, isl_map_copy(map));
8864 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
8865 id = isl_map_identity(dim);
8867 sv = isl_map_is_subset(test, id);
8875 int isl_map_is_injective(__isl_keep isl_map *map)
8879 map = isl_map_copy(map);
8880 map = isl_map_reverse(map);
8881 in = isl_map_is_single_valued(map);
8887 /* Check if the given map is obviously injective.
8889 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8893 map = isl_map_copy(map);
8894 map = isl_map_reverse(map);
8895 in = isl_map_plain_is_single_valued(map);
8901 int isl_map_is_bijective(__isl_keep isl_map *map)
8905 sv = isl_map_is_single_valued(map);
8909 return isl_map_is_injective(map);
8912 int isl_set_is_singleton(__isl_keep isl_set *set)
8914 return isl_map_is_single_valued((isl_map *)set);
8917 int isl_map_is_translation(__isl_keep isl_map *map)
8922 delta = isl_map_deltas(isl_map_copy(map));
8923 ok = isl_set_is_singleton(delta);
8924 isl_set_free(delta);
8929 static int unique(isl_int *p, unsigned pos, unsigned len)
8931 if (isl_seq_first_non_zero(p, pos) != -1)
8933 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8938 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8947 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8950 nvar = isl_basic_set_dim(bset, isl_dim_set);
8951 ovar = isl_space_offset(bset->dim, isl_dim_set);
8952 for (j = 0; j < nvar; ++j) {
8953 int lower = 0, upper = 0;
8954 for (i = 0; i < bset->n_eq; ++i) {
8955 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8957 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8963 for (i = 0; i < bset->n_ineq; ++i) {
8964 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8966 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8968 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8973 if (!lower || !upper)
8980 int isl_set_is_box(__isl_keep isl_set *set)
8987 return isl_basic_set_is_box(set->p[0]);
8990 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8995 return isl_space_is_wrapping(bset->dim);
8998 int isl_set_is_wrapping(__isl_keep isl_set *set)
9003 return isl_space_is_wrapping(set->dim);
9006 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9008 bmap = isl_basic_map_cow(bmap);
9012 bmap->dim = isl_space_wrap(bmap->dim);
9016 bmap = isl_basic_map_finalize(bmap);
9018 return (isl_basic_set *)bmap;
9020 isl_basic_map_free(bmap);
9024 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9028 map = isl_map_cow(map);
9032 for (i = 0; i < map->n; ++i) {
9033 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9037 map->dim = isl_space_wrap(map->dim);
9041 return (isl_set *)map;
9047 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9049 bset = isl_basic_set_cow(bset);
9053 bset->dim = isl_space_unwrap(bset->dim);
9057 bset = isl_basic_set_finalize(bset);
9059 return (isl_basic_map *)bset;
9061 isl_basic_set_free(bset);
9065 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9072 if (!isl_set_is_wrapping(set))
9073 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9076 set = isl_set_cow(set);
9080 for (i = 0; i < set->n; ++i) {
9081 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9086 set->dim = isl_space_unwrap(set->dim);
9090 return (isl_map *)set;
9096 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9097 enum isl_dim_type type)
9102 if (!isl_space_is_named_or_nested(bmap->dim, type))
9105 bmap = isl_basic_map_cow(bmap);
9109 bmap->dim = isl_space_reset(bmap->dim, type);
9113 bmap = isl_basic_map_finalize(bmap);
9117 isl_basic_map_free(bmap);
9121 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9122 enum isl_dim_type type)
9129 if (!isl_space_is_named_or_nested(map->dim, type))
9132 map = isl_map_cow(map);
9136 for (i = 0; i < map->n; ++i) {
9137 map->p[i] = isl_basic_map_reset(map->p[i], type);
9141 map->dim = isl_space_reset(map->dim, type);
9151 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9156 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9159 bmap = isl_basic_map_cow(bmap);
9163 bmap->dim = isl_space_flatten(bmap->dim);
9167 bmap = isl_basic_map_finalize(bmap);
9171 isl_basic_map_free(bmap);
9175 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9177 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9180 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9181 __isl_take isl_basic_map *bmap)
9186 if (!bmap->dim->nested[0])
9189 bmap = isl_basic_map_cow(bmap);
9193 bmap->dim = isl_space_flatten_domain(bmap->dim);
9197 bmap = isl_basic_map_finalize(bmap);
9201 isl_basic_map_free(bmap);
9205 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9206 __isl_take isl_basic_map *bmap)
9211 if (!bmap->dim->nested[1])
9214 bmap = isl_basic_map_cow(bmap);
9218 bmap->dim = isl_space_flatten_range(bmap->dim);
9222 bmap = isl_basic_map_finalize(bmap);
9226 isl_basic_map_free(bmap);
9230 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9237 if (!map->dim->nested[0] && !map->dim->nested[1])
9240 map = isl_map_cow(map);
9244 for (i = 0; i < map->n; ++i) {
9245 map->p[i] = isl_basic_map_flatten(map->p[i]);
9249 map->dim = isl_space_flatten(map->dim);
9259 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9261 return (isl_set *)isl_map_flatten((isl_map *)set);
9264 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9266 isl_space *dim, *flat_dim;
9269 dim = isl_set_get_space(set);
9270 flat_dim = isl_space_flatten(isl_space_copy(dim));
9271 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9272 map = isl_map_intersect_domain(map, set);
9277 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9284 if (!map->dim->nested[0])
9287 map = isl_map_cow(map);
9291 for (i = 0; i < map->n; ++i) {
9292 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9296 map->dim = isl_space_flatten_domain(map->dim);
9306 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9313 if (!map->dim->nested[1])
9316 map = isl_map_cow(map);
9320 for (i = 0; i < map->n; ++i) {
9321 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9325 map->dim = isl_space_flatten_range(map->dim);
9335 /* Reorder the dimensions of "bmap" according to the given dim_map
9336 * and set the dimension specification to "dim".
9338 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9339 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9344 bmap = isl_basic_map_cow(bmap);
9345 if (!bmap || !dim || !dim_map)
9348 flags = bmap->flags;
9349 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9350 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9351 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9352 res = isl_basic_map_alloc_space(dim,
9353 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9354 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9357 res = isl_basic_map_finalize(res);
9361 isl_basic_map_free(bmap);
9362 isl_space_free(dim);
9366 /* Reorder the dimensions of "map" according to given reordering.
9368 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9369 __isl_take isl_reordering *r)
9372 struct isl_dim_map *dim_map;
9374 map = isl_map_cow(map);
9375 dim_map = isl_dim_map_from_reordering(r);
9376 if (!map || !r || !dim_map)
9379 for (i = 0; i < map->n; ++i) {
9380 struct isl_dim_map *dim_map_i;
9382 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9384 map->p[i] = isl_basic_map_realign(map->p[i],
9385 isl_space_copy(r->dim), dim_map_i);
9391 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9393 isl_reordering_free(r);
9399 isl_reordering_free(r);
9403 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9404 __isl_take isl_reordering *r)
9406 return (isl_set *)isl_map_realign((isl_map *)set, r);
9409 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9410 __isl_take isl_space *model)
9417 ctx = isl_space_get_ctx(model);
9418 if (!isl_space_has_named_params(model))
9419 isl_die(ctx, isl_error_invalid,
9420 "model has unnamed parameters", goto error);
9421 if (!isl_space_has_named_params(map->dim))
9422 isl_die(ctx, isl_error_invalid,
9423 "relation has unnamed parameters", goto error);
9424 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9425 isl_reordering *exp;
9427 model = isl_space_drop_dims(model, isl_dim_in,
9428 0, isl_space_dim(model, isl_dim_in));
9429 model = isl_space_drop_dims(model, isl_dim_out,
9430 0, isl_space_dim(model, isl_dim_out));
9431 exp = isl_parameter_alignment_reordering(map->dim, model);
9432 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9433 map = isl_map_realign(map, exp);
9436 isl_space_free(model);
9439 isl_space_free(model);
9444 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9445 __isl_take isl_space *model)
9447 return isl_map_align_params(set, model);
9450 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9451 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9452 enum isl_dim_type c2, enum isl_dim_type c3,
9453 enum isl_dim_type c4, enum isl_dim_type c5)
9455 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9456 struct isl_mat *mat;
9462 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9463 isl_basic_map_total_dim(bmap) + 1);
9466 for (i = 0; i < bmap->n_eq; ++i)
9467 for (j = 0, pos = 0; j < 5; ++j) {
9468 int off = isl_basic_map_offset(bmap, c[j]);
9469 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9470 isl_int_set(mat->row[i][pos],
9471 bmap->eq[i][off + k]);
9479 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9480 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9481 enum isl_dim_type c2, enum isl_dim_type c3,
9482 enum isl_dim_type c4, enum isl_dim_type c5)
9484 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9485 struct isl_mat *mat;
9491 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9492 isl_basic_map_total_dim(bmap) + 1);
9495 for (i = 0; i < bmap->n_ineq; ++i)
9496 for (j = 0, pos = 0; j < 5; ++j) {
9497 int off = isl_basic_map_offset(bmap, c[j]);
9498 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9499 isl_int_set(mat->row[i][pos],
9500 bmap->ineq[i][off + k]);
9508 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9509 __isl_take isl_space *dim,
9510 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9511 enum isl_dim_type c2, enum isl_dim_type c3,
9512 enum isl_dim_type c4, enum isl_dim_type c5)
9514 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9515 isl_basic_map *bmap;
9521 if (!dim || !eq || !ineq)
9524 if (eq->n_col != ineq->n_col)
9525 isl_die(dim->ctx, isl_error_invalid,
9526 "equalities and inequalities matrices should have "
9527 "same number of columns", goto error);
9529 total = 1 + isl_space_dim(dim, isl_dim_all);
9531 if (eq->n_col < total)
9532 isl_die(dim->ctx, isl_error_invalid,
9533 "number of columns too small", goto error);
9535 extra = eq->n_col - total;
9537 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9538 eq->n_row, ineq->n_row);
9541 for (i = 0; i < extra; ++i) {
9542 k = isl_basic_map_alloc_div(bmap);
9545 isl_int_set_si(bmap->div[k][0], 0);
9547 for (i = 0; i < eq->n_row; ++i) {
9548 l = isl_basic_map_alloc_equality(bmap);
9551 for (j = 0, pos = 0; j < 5; ++j) {
9552 int off = isl_basic_map_offset(bmap, c[j]);
9553 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9554 isl_int_set(bmap->eq[l][off + k],
9560 for (i = 0; i < ineq->n_row; ++i) {
9561 l = isl_basic_map_alloc_inequality(bmap);
9564 for (j = 0, pos = 0; j < 5; ++j) {
9565 int off = isl_basic_map_offset(bmap, c[j]);
9566 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9567 isl_int_set(bmap->ineq[l][off + k],
9574 isl_space_free(dim);
9580 isl_space_free(dim);
9586 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9587 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9588 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9590 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9591 c1, c2, c3, c4, isl_dim_in);
9594 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9595 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9596 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9598 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9599 c1, c2, c3, c4, isl_dim_in);
9602 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9603 __isl_take isl_space *dim,
9604 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9605 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9607 return (isl_basic_set*)
9608 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9609 c1, c2, c3, c4, isl_dim_in);
9612 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9617 return isl_space_can_zip(bmap->dim);
9620 int isl_map_can_zip(__isl_keep isl_map *map)
9625 return isl_space_can_zip(map->dim);
9628 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9629 * (A -> C) -> (B -> D).
9631 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9640 if (!isl_basic_map_can_zip(bmap))
9641 isl_die(bmap->ctx, isl_error_invalid,
9642 "basic map cannot be zipped", goto error);
9643 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9644 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
9645 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
9646 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
9647 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9650 bmap->dim = isl_space_zip(bmap->dim);
9655 isl_basic_map_free(bmap);
9659 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9660 * (A -> C) -> (B -> D).
9662 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9669 if (!isl_map_can_zip(map))
9670 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9673 map = isl_map_cow(map);
9677 for (i = 0; i < map->n; ++i) {
9678 map->p[i] = isl_basic_map_zip(map->p[i]);
9683 map->dim = isl_space_zip(map->dim);
9693 /* Construct a basic map mapping the domain of the affine expression
9694 * to a one-dimensional range prescribed by the affine expression.
9696 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9700 isl_local_space *ls;
9701 isl_basic_map *bmap;
9706 ls = isl_aff_get_local_space(aff);
9707 bmap = isl_basic_map_from_local_space(ls);
9708 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9709 k = isl_basic_map_alloc_equality(bmap);
9713 pos = isl_basic_map_offset(bmap, isl_dim_out);
9714 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9715 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9716 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9717 aff->v->size - (pos + 1));
9720 bmap = isl_basic_map_finalize(bmap);
9724 isl_basic_map_free(bmap);
9728 /* Construct a basic map mapping the domain the multi-affine expression
9729 * to its range, with each dimension in the range equated to the
9730 * corresponding affine expression.
9732 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
9733 __isl_take isl_multi_aff *maff)
9737 isl_basic_map *bmap;
9742 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
9743 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
9744 "invalid space", return isl_multi_aff_free(maff));
9746 space = isl_space_domain(isl_multi_aff_get_space(maff));
9747 bmap = isl_basic_map_universe(isl_space_from_domain(space));
9749 for (i = 0; i < maff->n; ++i) {
9751 isl_basic_map *bmap_i;
9753 aff = isl_aff_copy(maff->p[i]);
9754 bmap_i = isl_basic_map_from_aff(aff);
9756 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9759 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
9761 isl_multi_aff_free(maff);
9765 /* Construct a basic map mapping a domain in the given space to
9766 * to an n-dimensional range, with n the number of elements in the list,
9767 * where each coordinate in the range is prescribed by the
9768 * corresponding affine expression.
9769 * The domains of all affine expressions in the list are assumed to match
9772 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9773 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
9777 isl_basic_map *bmap;
9782 dim = isl_space_from_domain(domain_dim);
9783 bmap = isl_basic_map_universe(dim);
9785 for (i = 0; i < list->n; ++i) {
9787 isl_basic_map *bmap_i;
9789 aff = isl_aff_copy(list->p[i]);
9790 bmap_i = isl_basic_map_from_aff(aff);
9792 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9795 isl_aff_list_free(list);
9799 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9800 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9802 return isl_map_equate(set, type1, pos1, type2, pos2);
9805 /* Add a constraint imposing that the given two dimensions are equal.
9807 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9808 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9810 isl_basic_map *bmap = NULL;
9816 if (pos1 >= isl_map_dim(map, type1))
9817 isl_die(map->ctx, isl_error_invalid,
9818 "index out of bounds", goto error);
9819 if (pos2 >= isl_map_dim(map, type2))
9820 isl_die(map->ctx, isl_error_invalid,
9821 "index out of bounds", goto error);
9823 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9824 i = isl_basic_map_alloc_equality(bmap);
9827 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9828 pos1 += isl_basic_map_offset(bmap, type1);
9829 pos2 += isl_basic_map_offset(bmap, type2);
9830 isl_int_set_si(bmap->eq[i][pos1], -1);
9831 isl_int_set_si(bmap->eq[i][pos2], 1);
9832 bmap = isl_basic_map_finalize(bmap);
9834 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9838 isl_basic_map_free(bmap);
9843 /* Add a constraint imposing that the given two dimensions have opposite values.
9845 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9846 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9848 isl_basic_map *bmap = NULL;
9854 if (pos1 >= isl_map_dim(map, type1))
9855 isl_die(map->ctx, isl_error_invalid,
9856 "index out of bounds", goto error);
9857 if (pos2 >= isl_map_dim(map, type2))
9858 isl_die(map->ctx, isl_error_invalid,
9859 "index out of bounds", goto error);
9861 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9862 i = isl_basic_map_alloc_equality(bmap);
9865 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9866 pos1 += isl_basic_map_offset(bmap, type1);
9867 pos2 += isl_basic_map_offset(bmap, type2);
9868 isl_int_set_si(bmap->eq[i][pos1], 1);
9869 isl_int_set_si(bmap->eq[i][pos2], 1);
9870 bmap = isl_basic_map_finalize(bmap);
9872 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9876 isl_basic_map_free(bmap);
9881 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
9885 isl_local_space *ls;
9890 if (!isl_basic_map_divs_known(bmap))
9891 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
9892 "some divs are unknown", return NULL);
9894 ls = isl_basic_map_get_local_space(bmap);
9895 div = isl_local_space_get_div(ls, pos);
9896 isl_local_space_free(ls);
9901 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
9904 return isl_basic_map_get_div(bset, pos);
9907 /* Plug in "subs" for dimension "type", "pos" of "bset".
9909 * Let i be the dimension to replace and let "subs" be of the form
9913 * Any integer division with a non-zero coefficient for i,
9915 * floor((a i + g)/m)
9919 * floor((a f + d g)/(m d))
9921 * Constraints of the form
9929 __isl_give isl_basic_set *isl_basic_set_substitute(
9930 __isl_take isl_basic_set *bset,
9931 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
9937 if (bset && isl_basic_set_plain_is_empty(bset))
9940 bset = isl_basic_set_cow(bset);
9944 ctx = isl_basic_set_get_ctx(bset);
9945 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
9946 isl_die(ctx, isl_error_invalid,
9947 "spaces don't match", goto error);
9948 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
9949 isl_die(ctx, isl_error_unsupported,
9950 "cannot handle divs yet", goto error);
9952 pos += isl_basic_set_offset(bset, type);
9956 for (i = 0; i < bset->n_eq; ++i) {
9957 if (isl_int_is_zero(bset->eq[i][pos]))
9959 isl_int_set(v, bset->eq[i][pos]);
9960 isl_int_set_si(bset->eq[i][pos], 0);
9961 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
9962 v, subs->v->el + 1, subs->v->size - 1);
9965 for (i = 0; i < bset->n_ineq; ++i) {
9966 if (isl_int_is_zero(bset->ineq[i][pos]))
9968 isl_int_set(v, bset->ineq[i][pos]);
9969 isl_int_set_si(bset->ineq[i][pos], 0);
9970 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
9971 v, subs->v->el + 1, subs->v->size - 1);
9974 for (i = 0; i < bset->n_div; ++i) {
9975 if (isl_int_is_zero(bset->div[i][1 + pos]))
9977 isl_int_set(v, bset->div[i][1 + pos]);
9978 isl_int_set_si(bset->div[i][1 + pos], 0);
9979 isl_seq_combine(bset->div[i] + 1,
9980 subs->v->el[0], bset->div[i] + 1,
9981 v, subs->v->el + 1, subs->v->size - 1);
9982 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
9987 bset = isl_basic_set_simplify(bset);
9988 return isl_basic_set_finalize(bset);
9990 isl_basic_set_free(bset);
9994 /* Plug in "subs" for dimension "type", "pos" of "set".
9996 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
9997 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10001 if (set && isl_set_plain_is_empty(set))
10004 set = isl_set_cow(set);
10008 for (i = set->n - 1; i >= 0; --i) {
10009 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10012 if (isl_basic_set_plain_is_empty(set->p[i])) {
10013 isl_basic_set_free(set->p[i]);
10014 if (i != set->n - 1)
10015 set->p[i] = set->p[set->n - 1];