2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
21 #include <isl_list_private.h>
26 #include "isl_map_piplib.h"
27 #include <isl_reordering.h>
28 #include "isl_sample.h"
31 #include <isl_mat_private.h>
32 #include <isl_dim_map.h>
33 #include <isl_local_space_private.h>
34 #include <isl_aff_private.h>
35 #include <isl_options_private.h>
37 static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type)
40 case isl_dim_param: return dim->nparam;
41 case isl_dim_in: return dim->n_in;
42 case isl_dim_out: return dim->n_out;
43 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
48 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
51 case isl_dim_param: return 1;
52 case isl_dim_in: return 1 + dim->nparam;
53 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
58 unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap,
59 enum isl_dim_type type)
64 case isl_dim_cst: return 1;
67 case isl_dim_out: return isl_space_dim(bmap->dim, type);
68 case isl_dim_div: return bmap->n_div;
69 case isl_dim_all: return isl_basic_map_total_dim(bmap);
74 unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type)
76 return map ? n(map->dim, type) : 0;
79 unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type)
81 return set ? n(set->dim, type) : 0;
84 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
85 enum isl_dim_type type)
87 isl_space *dim = bmap->dim;
89 case isl_dim_cst: return 0;
90 case isl_dim_param: return 1;
91 case isl_dim_in: return 1 + dim->nparam;
92 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
93 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
98 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
99 enum isl_dim_type type)
101 return isl_basic_map_offset(bset, type);
104 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
106 return pos(map->dim, type);
109 unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset,
110 enum isl_dim_type type)
112 return isl_basic_map_dim(bset, type);
115 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset)
117 return isl_basic_set_dim(bset, isl_dim_set);
120 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset)
122 return isl_basic_set_dim(bset, isl_dim_param);
125 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
129 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
132 unsigned isl_set_n_dim(__isl_keep isl_set *set)
134 return isl_set_dim(set, isl_dim_set);
137 unsigned isl_set_n_param(__isl_keep isl_set *set)
139 return isl_set_dim(set, isl_dim_param);
142 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
144 return bmap ? bmap->dim->n_in : 0;
147 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
149 return bmap ? bmap->dim->n_out : 0;
152 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
154 return bmap ? bmap->dim->nparam : 0;
157 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
159 return bmap ? bmap->n_div : 0;
162 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
164 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0;
167 unsigned isl_map_n_in(const struct isl_map *map)
169 return map ? map->dim->n_in : 0;
172 unsigned isl_map_n_out(const struct isl_map *map)
174 return map ? map->dim->n_out : 0;
177 unsigned isl_map_n_param(const struct isl_map *map)
179 return map ? map->dim->nparam : 0;
182 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
187 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
190 return isl_space_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
193 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
194 struct isl_basic_set *bset)
199 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
202 return isl_space_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
205 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
210 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
213 return isl_space_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
216 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
217 struct isl_basic_set *bset)
222 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
225 return isl_space_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
228 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
230 return bmap ? bmap->ctx : NULL;
233 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
235 return bset ? bset->ctx : NULL;
238 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
240 return map ? map->ctx : NULL;
243 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
245 return set ? set->ctx : NULL;
248 __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap)
252 return isl_space_copy(bmap->dim);
255 __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset)
259 return isl_space_copy(bset->dim);
262 /* Extract the divs in "bmap" as a matrix.
264 __isl_give isl_mat *isl_basic_map_get_divs(__isl_keep isl_basic_map *bmap)
275 ctx = isl_basic_map_get_ctx(bmap);
276 total = isl_space_dim(bmap->dim, isl_dim_all);
277 cols = 1 + 1 + total + bmap->n_div;
278 div = isl_mat_alloc(ctx, bmap->n_div, cols);
282 for (i = 0; i < bmap->n_div; ++i)
283 isl_seq_cpy(div->row[i], bmap->div[i], cols);
288 __isl_give isl_local_space *isl_basic_map_get_local_space(
289 __isl_keep isl_basic_map *bmap)
296 div = isl_basic_map_get_divs(bmap);
297 return isl_local_space_alloc_div(isl_space_copy(bmap->dim), div);
300 __isl_give isl_local_space *isl_basic_set_get_local_space(
301 __isl_keep isl_basic_set *bset)
303 return isl_basic_map_get_local_space(bset);
306 __isl_give isl_basic_map *isl_basic_map_from_local_space(
307 __isl_take isl_local_space *ls)
316 n_div = isl_local_space_dim(ls, isl_dim_div);
317 bmap = isl_basic_map_alloc_space(isl_local_space_get_space(ls),
318 n_div, 0, 2 * n_div);
320 for (i = 0; i < n_div; ++i)
321 if (isl_basic_map_alloc_div(bmap) < 0)
324 for (i = 0; i < n_div; ++i) {
325 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
326 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
330 isl_local_space_free(ls);
333 isl_local_space_free(ls);
334 isl_basic_map_free(bmap);
338 __isl_give isl_basic_set *isl_basic_set_from_local_space(
339 __isl_take isl_local_space *ls)
341 return isl_basic_map_from_local_space(ls);
344 __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map)
348 return isl_space_copy(map->dim);
351 __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set)
355 return isl_space_copy(set->dim);
358 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
359 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
361 bmap = isl_basic_map_cow(bmap);
364 bmap->dim = isl_space_set_tuple_name(bmap->dim, type, s);
367 bmap = isl_basic_map_finalize(bmap);
370 isl_basic_map_free(bmap);
374 __isl_give isl_basic_set *isl_basic_set_set_tuple_name(
375 __isl_take isl_basic_set *bset, const char *s)
377 return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
380 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
381 enum isl_dim_type type)
383 return bmap ? isl_space_get_tuple_name(bmap->dim, type) : NULL;
386 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
387 enum isl_dim_type type, const char *s)
391 map = isl_map_cow(map);
395 map->dim = isl_space_set_tuple_name(map->dim, type, s);
399 for (i = 0; i < map->n; ++i) {
400 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
411 /* Does the input or output tuple have a name?
413 int isl_map_has_tuple_name(__isl_keep isl_map *map, enum isl_dim_type type)
415 return map ? isl_space_has_tuple_name(map->dim, type) : -1;
418 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
419 enum isl_dim_type type)
421 return map ? isl_space_get_tuple_name(map->dim, type) : NULL;
424 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
427 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
430 __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map,
431 enum isl_dim_type type, __isl_take isl_id *id)
433 map = isl_map_cow(map);
435 return isl_id_free(id);
437 map->dim = isl_space_set_tuple_id(map->dim, type, id);
439 return isl_map_reset_space(map, isl_space_copy(map->dim));
442 __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set,
443 __isl_take isl_id *id)
445 return isl_map_set_tuple_id(set, isl_dim_set, id);
448 __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map,
449 enum isl_dim_type type)
451 map = isl_map_cow(map);
455 map->dim = isl_space_reset_tuple_id(map->dim, type);
457 return isl_map_reset_space(map, isl_space_copy(map->dim));
460 __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set)
462 return isl_map_reset_tuple_id(set, isl_dim_set);
465 int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type)
467 return map ? isl_space_has_tuple_id(map->dim, type) : -1;
470 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
471 enum isl_dim_type type)
473 return map ? isl_space_get_tuple_id(map->dim, type) : NULL;
476 int isl_set_has_tuple_id(__isl_keep isl_set *set)
478 return isl_map_has_tuple_id(set, isl_dim_set);
481 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
483 return isl_map_get_tuple_id(set, isl_dim_set);
486 /* Does the set tuple have a name?
488 int isl_set_has_tuple_name(__isl_keep isl_set *set)
490 return set ? isl_space_has_tuple_name(set->dim, isl_dim_set) : -1;
494 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
496 return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL;
499 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
501 return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL;
504 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
505 enum isl_dim_type type, unsigned pos)
507 return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL;
510 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
511 enum isl_dim_type type, unsigned pos)
513 return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL;
516 /* Does the given dimension have a name?
518 int isl_map_has_dim_name(__isl_keep isl_map *map,
519 enum isl_dim_type type, unsigned pos)
521 return map ? isl_space_has_dim_name(map->dim, type, pos) : -1;
524 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
525 enum isl_dim_type type, unsigned pos)
527 return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL;
530 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
531 enum isl_dim_type type, unsigned pos)
533 return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL;
536 /* Does the given dimension have a name?
538 int isl_set_has_dim_name(__isl_keep isl_set *set,
539 enum isl_dim_type type, unsigned pos)
541 return set ? isl_space_has_dim_name(set->dim, type, pos) : -1;
544 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
545 __isl_take isl_basic_map *bmap,
546 enum isl_dim_type type, unsigned pos, const char *s)
548 bmap = isl_basic_map_cow(bmap);
551 bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s);
554 return isl_basic_map_finalize(bmap);
556 isl_basic_map_free(bmap);
560 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
561 enum isl_dim_type type, unsigned pos, const char *s)
565 map = isl_map_cow(map);
569 map->dim = isl_space_set_dim_name(map->dim, type, pos, s);
573 for (i = 0; i < map->n; ++i) {
574 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
585 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
586 __isl_take isl_basic_set *bset,
587 enum isl_dim_type type, unsigned pos, const char *s)
589 return (isl_basic_set *)isl_basic_map_set_dim_name(
590 (isl_basic_map *)bset, type, pos, s);
593 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
594 enum isl_dim_type type, unsigned pos, const char *s)
596 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
599 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap,
600 enum isl_dim_type type, unsigned pos)
602 return bmap ? isl_space_has_dim_id(bmap->dim, type, pos) : -1;
605 __isl_give isl_id *isl_basic_set_get_dim_id(__isl_keep isl_basic_set *bset,
606 enum isl_dim_type type, unsigned pos)
608 return bset ? isl_space_get_dim_id(bset->dim, type, pos) : NULL;
611 int isl_map_has_dim_id(__isl_keep isl_map *map,
612 enum isl_dim_type type, unsigned pos)
614 return map ? isl_space_has_dim_id(map->dim, type, pos) : -1;
617 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
618 enum isl_dim_type type, unsigned pos)
620 return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL;
623 int isl_set_has_dim_id(__isl_keep isl_set *set,
624 enum isl_dim_type type, unsigned pos)
626 return isl_map_has_dim_id(set, type, pos);
629 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
630 enum isl_dim_type type, unsigned pos)
632 return isl_map_get_dim_id(set, type, pos);
635 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
636 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
638 map = isl_map_cow(map);
640 return isl_id_free(id);
642 map->dim = isl_space_set_dim_id(map->dim, type, pos, id);
644 return isl_map_reset_space(map, isl_space_copy(map->dim));
647 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
648 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
650 return isl_map_set_dim_id(set, type, pos, id);
653 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
654 __isl_keep isl_id *id)
658 return isl_space_find_dim_by_id(map->dim, type, id);
661 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
662 __isl_keep isl_id *id)
664 return isl_map_find_dim_by_id(set, type, id);
667 int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type,
672 return isl_space_find_dim_by_name(map->dim, type, name);
675 int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type,
678 return isl_map_find_dim_by_name(set, type, name);
681 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
685 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
688 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
690 return isl_basic_map_is_rational(bset);
693 /* Is this basic set a parameter domain?
695 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
699 return isl_space_is_params(bset->dim);
702 /* Is this set a parameter domain?
704 int isl_set_is_params(__isl_keep isl_set *set)
708 return isl_space_is_params(set->dim);
711 /* Is this map actually a parameter domain?
712 * Users should never call this function. Outside of isl,
713 * a map can never be a parameter domain.
715 int isl_map_is_params(__isl_keep isl_map *map)
719 return isl_space_is_params(map->dim);
722 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
723 struct isl_basic_map *bmap, unsigned extra,
724 unsigned n_eq, unsigned n_ineq)
727 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
732 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
733 if (isl_blk_is_error(bmap->block))
736 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
741 bmap->block2 = isl_blk_empty();
744 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
745 if (isl_blk_is_error(bmap->block2))
748 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
753 for (i = 0; i < n_ineq + n_eq; ++i)
754 bmap->ineq[i] = bmap->block.data + i * row_size;
756 for (i = 0; i < extra; ++i)
757 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
761 bmap->c_size = n_eq + n_ineq;
762 bmap->eq = bmap->ineq + n_ineq;
771 isl_basic_map_free(bmap);
775 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
776 unsigned nparam, unsigned dim, unsigned extra,
777 unsigned n_eq, unsigned n_ineq)
779 struct isl_basic_map *bmap;
782 space = isl_space_set_alloc(ctx, nparam, dim);
786 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
787 return (struct isl_basic_set *)bmap;
790 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
791 unsigned extra, unsigned n_eq, unsigned n_ineq)
793 struct isl_basic_map *bmap;
796 isl_assert(dim->ctx, dim->n_in == 0, goto error);
797 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
798 return (struct isl_basic_set *)bmap;
804 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
805 unsigned extra, unsigned n_eq, unsigned n_ineq)
807 struct isl_basic_map *bmap;
811 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
816 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
822 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
823 unsigned nparam, unsigned in, unsigned out, unsigned extra,
824 unsigned n_eq, unsigned n_ineq)
826 struct isl_basic_map *bmap;
829 dim = isl_space_alloc(ctx, nparam, in, out);
833 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
837 static void dup_constraints(
838 struct isl_basic_map *dst, struct isl_basic_map *src)
841 unsigned total = isl_basic_map_total_dim(src);
843 for (i = 0; i < src->n_eq; ++i) {
844 int j = isl_basic_map_alloc_equality(dst);
845 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
848 for (i = 0; i < src->n_ineq; ++i) {
849 int j = isl_basic_map_alloc_inequality(dst);
850 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
853 for (i = 0; i < src->n_div; ++i) {
854 int j = isl_basic_map_alloc_div(dst);
855 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
857 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
860 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
862 struct isl_basic_map *dup;
866 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
867 bmap->n_div, bmap->n_eq, bmap->n_ineq);
870 dup_constraints(dup, bmap);
871 dup->flags = bmap->flags;
872 dup->sample = isl_vec_copy(bmap->sample);
876 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
878 struct isl_basic_map *dup;
880 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
881 return (struct isl_basic_set *)dup;
884 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
889 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
893 return isl_basic_set_dup(bset);
896 struct isl_set *isl_set_copy(struct isl_set *set)
905 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
910 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
914 bmap = isl_basic_map_dup(bmap);
916 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
920 struct isl_map *isl_map_copy(struct isl_map *map)
929 void isl_basic_map_free(struct isl_basic_map *bmap)
937 isl_ctx_deref(bmap->ctx);
939 isl_blk_free(bmap->ctx, bmap->block2);
941 isl_blk_free(bmap->ctx, bmap->block);
942 isl_vec_free(bmap->sample);
943 isl_space_free(bmap->dim);
947 void isl_basic_set_free(struct isl_basic_set *bset)
949 isl_basic_map_free((struct isl_basic_map *)bset);
952 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
954 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
957 __isl_give isl_map *isl_map_align_params_map_map_and(
958 __isl_take isl_map *map1, __isl_take isl_map *map2,
959 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
960 __isl_take isl_map *map2))
964 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
965 return fn(map1, map2);
966 if (!isl_space_has_named_params(map1->dim) ||
967 !isl_space_has_named_params(map2->dim))
968 isl_die(map1->ctx, isl_error_invalid,
969 "unaligned unnamed parameters", goto error);
970 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
971 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
972 return fn(map1, map2);
979 int isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1,
980 __isl_keep isl_map *map2,
981 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
987 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
988 return fn(map1, map2);
989 if (!isl_space_has_named_params(map1->dim) ||
990 !isl_space_has_named_params(map2->dim))
991 isl_die(map1->ctx, isl_error_invalid,
992 "unaligned unnamed parameters", return -1);
993 map1 = isl_map_copy(map1);
994 map2 = isl_map_copy(map2);
995 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
996 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
1003 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
1005 struct isl_ctx *ctx;
1009 isl_assert(ctx, room_for_con(bmap, 1), return -1);
1010 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
1012 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1013 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1014 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1015 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1016 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1017 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
1019 int j = isl_basic_map_alloc_inequality(bmap);
1023 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
1024 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1031 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
1032 bmap->extra - bmap->n_div);
1033 return bmap->n_eq++;
1036 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
1038 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
1041 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
1045 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
1050 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
1052 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
1055 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
1060 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
1062 if (pos != bmap->n_eq - 1) {
1064 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
1065 bmap->eq[bmap->n_eq - 1] = t;
1071 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1073 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1076 void isl_basic_map_inequality_to_equality(
1077 struct isl_basic_map *bmap, unsigned pos)
1081 t = bmap->ineq[pos];
1082 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1083 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1088 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1089 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1090 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1091 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1094 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1096 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1099 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1101 struct isl_ctx *ctx;
1105 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1106 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1107 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1108 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1109 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1110 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1111 1 + isl_basic_map_total_dim(bmap),
1112 bmap->extra - bmap->n_div);
1113 return bmap->n_ineq++;
1116 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1118 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1121 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1125 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1130 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1132 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1135 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1140 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1142 if (pos != bmap->n_ineq - 1) {
1143 t = bmap->ineq[pos];
1144 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1145 bmap->ineq[bmap->n_ineq - 1] = t;
1146 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1152 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1154 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1157 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1162 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1165 k = isl_basic_map_alloc_equality(bmap);
1168 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1171 isl_basic_map_free(bmap);
1175 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1178 return (isl_basic_set *)
1179 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1182 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1187 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1190 k = isl_basic_map_alloc_inequality(bmap);
1193 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1196 isl_basic_map_free(bmap);
1200 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1203 return (isl_basic_set *)
1204 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1207 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1211 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1212 isl_seq_clr(bmap->div[bmap->n_div] +
1213 1 + 1 + isl_basic_map_total_dim(bmap),
1214 bmap->extra - bmap->n_div);
1215 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1216 return bmap->n_div++;
1219 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1221 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1224 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1228 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1233 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1235 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1238 /* Copy constraint from src to dst, putting the vars of src at offset
1239 * dim_off in dst and the divs of src at offset div_off in dst.
1240 * If both sets are actually map, then dim_off applies to the input
1243 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1244 struct isl_basic_map *src_map, isl_int *src,
1245 unsigned in_off, unsigned out_off, unsigned div_off)
1247 unsigned src_nparam = isl_basic_map_n_param(src_map);
1248 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1249 unsigned src_in = isl_basic_map_n_in(src_map);
1250 unsigned dst_in = isl_basic_map_n_in(dst_map);
1251 unsigned src_out = isl_basic_map_n_out(src_map);
1252 unsigned dst_out = isl_basic_map_n_out(dst_map);
1253 isl_int_set(dst[0], src[0]);
1254 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1255 if (dst_nparam > src_nparam)
1256 isl_seq_clr(dst+1+src_nparam,
1257 dst_nparam - src_nparam);
1258 isl_seq_clr(dst+1+dst_nparam, in_off);
1259 isl_seq_cpy(dst+1+dst_nparam+in_off,
1261 isl_min(dst_in-in_off, src_in));
1262 if (dst_in-in_off > src_in)
1263 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1264 dst_in - in_off - src_in);
1265 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1266 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1267 src+1+src_nparam+src_in,
1268 isl_min(dst_out-out_off, src_out));
1269 if (dst_out-out_off > src_out)
1270 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1271 dst_out - out_off - src_out);
1272 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1273 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1274 src+1+src_nparam+src_in+src_out,
1275 isl_min(dst_map->extra-div_off, src_map->n_div));
1276 if (dst_map->n_div-div_off > src_map->n_div)
1277 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1278 div_off+src_map->n_div,
1279 dst_map->n_div - div_off - src_map->n_div);
1282 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1283 struct isl_basic_map *src_map, isl_int *src,
1284 unsigned in_off, unsigned out_off, unsigned div_off)
1286 isl_int_set(dst[0], src[0]);
1287 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1290 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1291 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1296 if (!bmap1 || !bmap2)
1299 div_off = bmap1->n_div;
1301 for (i = 0; i < bmap2->n_eq; ++i) {
1302 int i1 = isl_basic_map_alloc_equality(bmap1);
1305 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1306 i_pos, o_pos, div_off);
1309 for (i = 0; i < bmap2->n_ineq; ++i) {
1310 int i1 = isl_basic_map_alloc_inequality(bmap1);
1313 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1314 i_pos, o_pos, div_off);
1317 for (i = 0; i < bmap2->n_div; ++i) {
1318 int i1 = isl_basic_map_alloc_div(bmap1);
1321 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1322 i_pos, o_pos, div_off);
1325 isl_basic_map_free(bmap2);
1330 isl_basic_map_free(bmap1);
1331 isl_basic_map_free(bmap2);
1335 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1336 struct isl_basic_set *bset2, unsigned pos)
1338 return (struct isl_basic_set *)
1339 add_constraints((struct isl_basic_map *)bset1,
1340 (struct isl_basic_map *)bset2, 0, pos);
1343 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1344 __isl_take isl_space *dim, unsigned extra,
1345 unsigned n_eq, unsigned n_ineq)
1347 struct isl_basic_map *ext;
1357 dims_ok = isl_space_is_equal(base->dim, dim) &&
1358 base->extra >= base->n_div + extra;
1360 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1361 room_for_ineq(base, n_ineq)) {
1362 isl_space_free(dim);
1366 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1367 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1368 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1369 extra += base->extra;
1371 n_ineq += base->n_ineq;
1373 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1379 ext->sample = isl_vec_copy(base->sample);
1380 flags = base->flags;
1381 ext = add_constraints(ext, base, 0, 0);
1384 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1390 isl_space_free(dim);
1391 isl_basic_map_free(base);
1395 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1396 __isl_take isl_space *dim, unsigned extra,
1397 unsigned n_eq, unsigned n_ineq)
1399 return (struct isl_basic_set *)
1400 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1401 extra, n_eq, n_ineq);
1404 struct isl_basic_map *isl_basic_map_extend_constraints(
1405 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1409 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1413 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1414 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1415 unsigned n_eq, unsigned n_ineq)
1417 struct isl_basic_map *bmap;
1422 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1426 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1429 isl_basic_map_free(base);
1433 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1434 unsigned nparam, unsigned dim, unsigned extra,
1435 unsigned n_eq, unsigned n_ineq)
1437 return (struct isl_basic_set *)
1438 isl_basic_map_extend((struct isl_basic_map *)base,
1439 nparam, 0, dim, extra, n_eq, n_ineq);
1442 struct isl_basic_set *isl_basic_set_extend_constraints(
1443 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1445 return (struct isl_basic_set *)
1446 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1450 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1452 return (struct isl_basic_set *)
1453 isl_basic_map_cow((struct isl_basic_map *)bset);
1456 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1461 if (bmap->ref > 1) {
1463 bmap = isl_basic_map_dup(bmap);
1466 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1470 struct isl_set *isl_set_cow(struct isl_set *set)
1478 return isl_set_dup(set);
1481 struct isl_map *isl_map_cow(struct isl_map *map)
1489 return isl_map_dup(map);
1492 static void swap_vars(struct isl_blk blk, isl_int *a,
1493 unsigned a_len, unsigned b_len)
1495 isl_seq_cpy(blk.data, a+a_len, b_len);
1496 isl_seq_cpy(blk.data+b_len, a, a_len);
1497 isl_seq_cpy(a, blk.data, b_len+a_len);
1500 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1501 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1509 isl_assert(bmap->ctx,
1510 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1512 if (n1 == 0 || n2 == 0)
1515 bmap = isl_basic_map_cow(bmap);
1519 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1520 if (isl_blk_is_error(blk))
1523 for (i = 0; i < bmap->n_eq; ++i)
1525 bmap->eq[i] + pos, n1, n2);
1527 for (i = 0; i < bmap->n_ineq; ++i)
1529 bmap->ineq[i] + pos, n1, n2);
1531 for (i = 0; i < bmap->n_div; ++i)
1533 bmap->div[i]+1 + pos, n1, n2);
1535 isl_blk_free(bmap->ctx, blk);
1537 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1538 bmap = isl_basic_map_gauss(bmap, NULL);
1539 return isl_basic_map_finalize(bmap);
1541 isl_basic_map_free(bmap);
1545 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1546 __isl_take isl_basic_set *bset, unsigned n)
1551 nparam = isl_basic_set_n_param(bset);
1552 dim = isl_basic_set_n_dim(bset);
1553 isl_assert(bset->ctx, n <= dim, goto error);
1555 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1557 isl_basic_set_free(bset);
1561 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1567 total = isl_basic_map_total_dim(bmap);
1568 isl_basic_map_free_div(bmap, bmap->n_div);
1569 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1571 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1573 i = isl_basic_map_alloc_equality(bmap);
1577 isl_int_set_si(bmap->eq[i][0], 1);
1578 isl_seq_clr(bmap->eq[i]+1, total);
1579 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1580 isl_vec_free(bmap->sample);
1581 bmap->sample = NULL;
1582 return isl_basic_map_finalize(bmap);
1584 isl_basic_map_free(bmap);
1588 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1590 return (struct isl_basic_set *)
1591 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1594 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1597 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1598 isl_int *t = bmap->div[a];
1599 bmap->div[a] = bmap->div[b];
1602 for (i = 0; i < bmap->n_eq; ++i)
1603 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1605 for (i = 0; i < bmap->n_ineq; ++i)
1606 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1608 for (i = 0; i < bmap->n_div; ++i)
1609 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1610 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1613 /* Eliminate the specified n dimensions starting at first from the
1614 * constraints, without removing the dimensions from the space.
1615 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1617 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1618 enum isl_dim_type type, unsigned first, unsigned n)
1627 if (first + n > isl_map_dim(map, type) || first + n < first)
1628 isl_die(map->ctx, isl_error_invalid,
1629 "index out of bounds", goto error);
1631 map = isl_map_cow(map);
1635 for (i = 0; i < map->n; ++i) {
1636 map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n);
1646 /* Eliminate the specified n dimensions starting at first from the
1647 * constraints, without removing the dimensions from the space.
1648 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1650 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1651 enum isl_dim_type type, unsigned first, unsigned n)
1653 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1656 /* Eliminate the specified n dimensions starting at first from the
1657 * constraints, without removing the dimensions from the space.
1658 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1660 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1661 unsigned first, unsigned n)
1663 return isl_set_eliminate(set, isl_dim_set, first, n);
1666 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1667 __isl_take isl_basic_map *bmap)
1671 bmap = isl_basic_map_eliminate_vars(bmap,
1672 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1676 return isl_basic_map_finalize(bmap);
1679 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1680 __isl_take isl_basic_set *bset)
1682 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1683 (struct isl_basic_map *)bset);
1686 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1695 map = isl_map_cow(map);
1699 for (i = 0; i < map->n; ++i) {
1700 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1710 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1712 return isl_map_remove_divs(set);
1715 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1716 enum isl_dim_type type, unsigned first, unsigned n)
1720 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1722 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1724 bmap = isl_basic_map_eliminate_vars(bmap,
1725 isl_basic_map_offset(bmap, type) - 1 + first, n);
1728 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1730 bmap = isl_basic_map_drop(bmap, type, first, n);
1733 isl_basic_map_free(bmap);
1737 /* Return true if the definition of the given div (recursively) involves
1738 * any of the given variables.
1740 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1741 unsigned first, unsigned n)
1744 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1746 if (isl_int_is_zero(bmap->div[div][0]))
1748 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1751 for (i = bmap->n_div - 1; i >= 0; --i) {
1752 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1754 if (div_involves_vars(bmap, i, first, n))
1761 /* Try and add a lower and/or upper bound on "div" to "bmap"
1762 * based on inequality "i".
1763 * "total" is the total number of variables (excluding the divs).
1764 * "v" is a temporary object that can be used during the calculations.
1765 * If "lb" is set, then a lower bound should be constructed.
1766 * If "ub" is set, then an upper bound should be constructed.
1768 * The calling function has already checked that the inequality does not
1769 * reference "div", but we still need to check that the inequality is
1770 * of the right form. We'll consider the case where we want to construct
1771 * a lower bound. The construction of upper bounds is similar.
1773 * Let "div" be of the form
1775 * q = floor((a + f(x))/d)
1777 * We essentially check if constraint "i" is of the form
1781 * so that we can use it to derive a lower bound on "div".
1782 * However, we allow a slightly more general form
1786 * with the condition that the coefficients of g(x) - f(x) are all
1788 * Rewriting this constraint as
1792 * adding a + f(x) to both sides and dividing by d, we obtain
1794 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1796 * Taking the floor on both sides, we obtain
1798 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1802 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1804 * In the case of an upper bound, we construct the constraint
1806 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1809 static __isl_give isl_basic_map *insert_bounds_on_div_from_ineq(
1810 __isl_take isl_basic_map *bmap, int div, int i,
1811 unsigned total, isl_int v, int lb, int ub)
1815 for (j = 0; (lb || ub) && j < total + bmap->n_div; ++j) {
1817 isl_int_sub(v, bmap->ineq[i][1 + j],
1818 bmap->div[div][1 + 1 + j]);
1819 lb = isl_int_is_divisible_by(v, bmap->div[div][0]);
1822 isl_int_add(v, bmap->ineq[i][1 + j],
1823 bmap->div[div][1 + 1 + j]);
1824 ub = isl_int_is_divisible_by(v, bmap->div[div][0]);
1830 bmap = isl_basic_map_extend_constraints(bmap, 0, lb + ub);
1832 int k = isl_basic_map_alloc_inequality(bmap);
1835 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
1836 isl_int_sub(bmap->ineq[k][j], bmap->ineq[i][j],
1837 bmap->div[div][1 + j]);
1838 isl_int_cdiv_q(bmap->ineq[k][j],
1839 bmap->ineq[k][j], bmap->div[div][0]);
1841 isl_int_set_si(bmap->ineq[k][1 + total + div], 1);
1844 int k = isl_basic_map_alloc_inequality(bmap);
1847 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
1848 isl_int_add(bmap->ineq[k][j], bmap->ineq[i][j],
1849 bmap->div[div][1 + j]);
1850 isl_int_fdiv_q(bmap->ineq[k][j],
1851 bmap->ineq[k][j], bmap->div[div][0]);
1853 isl_int_set_si(bmap->ineq[k][1 + total + div], -1);
1858 isl_basic_map_free(bmap);
1862 /* This function is called right before "div" is eliminated from "bmap"
1863 * using Fourier-Motzkin.
1864 * Look through the constraints of "bmap" for constraints on the argument
1865 * of the integer division and use them to construct constraints on the
1866 * integer division itself. These constraints can then be combined
1867 * during the Fourier-Motzkin elimination.
1868 * Note that it is only useful to introduce lower bounds on "div"
1869 * if "bmap" already contains upper bounds on "div" as the newly
1870 * introduce lower bounds can then be combined with the pre-existing
1871 * upper bounds. Similarly for upper bounds.
1872 * We therefore first check if "bmap" contains any lower and/or upper bounds
1875 * It is interesting to note that the introduction of these constraints
1876 * can indeed lead to more accurate results, even when compared to
1877 * deriving constraints on the argument of "div" from constraints on "div".
1878 * Consider, for example, the set
1880 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1882 * The second constraint can be rewritten as
1884 * 2 * [(-i-2j+3)/4] + k >= 0
1886 * from which we can derive
1888 * -i - 2j + 3 >= -2k
1894 * Combined with the first constraint, we obtain
1896 * -3 <= 3 + 2k or k >= -3
1898 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1899 * the first constraint, we obtain
1901 * [(i + 2j)/4] >= [-3/4] = -1
1903 * Combining this constraint with the second constraint, we obtain
1907 static __isl_give isl_basic_map *insert_bounds_on_div(
1908 __isl_take isl_basic_map *bmap, int div)
1911 int check_lb, check_ub;
1918 if (isl_int_is_zero(bmap->div[div][0]))
1921 total = isl_space_dim(bmap->dim, isl_dim_all);
1925 for (i = 0; (!check_lb || !check_ub) && i < bmap->n_ineq; ++i) {
1926 int s = isl_int_sgn(bmap->ineq[i][1 + total + div]);
1933 if (!check_lb && !check_ub)
1938 for (i = 0; bmap && i < bmap->n_ineq; ++i) {
1939 if (!isl_int_is_zero(bmap->ineq[i][1 + total + div]))
1942 bmap = insert_bounds_on_div_from_ineq(bmap, div, i, total, v,
1943 check_lb, check_ub);
1951 /* Remove all divs (recursively) involving any of the given dimensions
1952 * in their definitions.
1954 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1955 __isl_take isl_basic_map *bmap,
1956 enum isl_dim_type type, unsigned first, unsigned n)
1962 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1964 first += isl_basic_map_offset(bmap, type);
1966 for (i = bmap->n_div - 1; i >= 0; --i) {
1967 if (!div_involves_vars(bmap, i, first, n))
1969 bmap = insert_bounds_on_div(bmap, i);
1970 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1978 isl_basic_map_free(bmap);
1982 __isl_give isl_basic_set *isl_basic_set_remove_divs_involving_dims(
1983 __isl_take isl_basic_set *bset,
1984 enum isl_dim_type type, unsigned first, unsigned n)
1986 return isl_basic_map_remove_divs_involving_dims(bset, type, first, n);
1989 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1990 enum isl_dim_type type, unsigned first, unsigned n)
1999 map = isl_map_cow(map);
2003 for (i = 0; i < map->n; ++i) {
2004 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
2015 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
2016 enum isl_dim_type type, unsigned first, unsigned n)
2018 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
2022 /* Does the desciption of "bmap" depend on the specified dimensions?
2023 * We also check whether the dimensions appear in any of the div definitions.
2024 * In principle there is no need for this check. If the dimensions appear
2025 * in a div definition, they also appear in the defining constraints of that
2028 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
2029 enum isl_dim_type type, unsigned first, unsigned n)
2036 if (first + n > isl_basic_map_dim(bmap, type))
2037 isl_die(bmap->ctx, isl_error_invalid,
2038 "index out of bounds", return -1);
2040 first += isl_basic_map_offset(bmap, type);
2041 for (i = 0; i < bmap->n_eq; ++i)
2042 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
2044 for (i = 0; i < bmap->n_ineq; ++i)
2045 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
2047 for (i = 0; i < bmap->n_div; ++i) {
2048 if (isl_int_is_zero(bmap->div[i][0]))
2050 if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0)
2057 int isl_map_involves_dims(__isl_keep isl_map *map,
2058 enum isl_dim_type type, unsigned first, unsigned n)
2065 if (first + n > isl_map_dim(map, type))
2066 isl_die(map->ctx, isl_error_invalid,
2067 "index out of bounds", return -1);
2069 for (i = 0; i < map->n; ++i) {
2070 int involves = isl_basic_map_involves_dims(map->p[i],
2072 if (involves < 0 || involves)
2079 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
2080 enum isl_dim_type type, unsigned first, unsigned n)
2082 return isl_basic_map_involves_dims(bset, type, first, n);
2085 int isl_set_involves_dims(__isl_keep isl_set *set,
2086 enum isl_dim_type type, unsigned first, unsigned n)
2088 return isl_map_involves_dims(set, type, first, n);
2091 /* Return true if the definition of the given div is unknown or depends
2094 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
2097 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
2099 if (isl_int_is_zero(bmap->div[div][0]))
2102 for (i = bmap->n_div - 1; i >= 0; --i) {
2103 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
2105 if (div_is_unknown(bmap, i))
2112 /* Remove all divs that are unknown or defined in terms of unknown divs.
2114 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
2115 __isl_take isl_basic_map *bmap)
2122 for (i = bmap->n_div - 1; i >= 0; --i) {
2123 if (!div_is_unknown(bmap, i))
2125 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
2134 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
2143 map = isl_map_cow(map);
2147 for (i = 0; i < map->n; ++i) {
2148 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
2158 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
2160 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
2163 __isl_give isl_basic_set *isl_basic_set_remove_dims(
2164 __isl_take isl_basic_set *bset,
2165 enum isl_dim_type type, unsigned first, unsigned n)
2167 return (isl_basic_set *)
2168 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
2171 struct isl_map *isl_map_remove_dims(struct isl_map *map,
2172 enum isl_dim_type type, unsigned first, unsigned n)
2179 map = isl_map_cow(map);
2182 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2184 for (i = 0; i < map->n; ++i) {
2185 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
2186 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
2190 map = isl_map_drop(map, type, first, n);
2197 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
2198 enum isl_dim_type type, unsigned first, unsigned n)
2200 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
2203 /* Project out n inputs starting at first using Fourier-Motzkin */
2204 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
2205 unsigned first, unsigned n)
2207 return isl_map_remove_dims(map, isl_dim_in, first, n);
2210 static void dump_term(struct isl_basic_map *bmap,
2211 isl_int c, int pos, FILE *out)
2214 unsigned in = isl_basic_map_n_in(bmap);
2215 unsigned dim = in + isl_basic_map_n_out(bmap);
2216 unsigned nparam = isl_basic_map_n_param(bmap);
2218 isl_int_print(out, c, 0);
2220 if (!isl_int_is_one(c))
2221 isl_int_print(out, c, 0);
2222 if (pos < 1 + nparam) {
2223 name = isl_space_get_dim_name(bmap->dim,
2224 isl_dim_param, pos - 1);
2226 fprintf(out, "%s", name);
2228 fprintf(out, "p%d", pos - 1);
2229 } else if (pos < 1 + nparam + in)
2230 fprintf(out, "i%d", pos - 1 - nparam);
2231 else if (pos < 1 + nparam + dim)
2232 fprintf(out, "o%d", pos - 1 - nparam - in);
2234 fprintf(out, "e%d", pos - 1 - nparam - dim);
2238 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2239 int sign, FILE *out)
2243 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2247 for (i = 0, first = 1; i < len; ++i) {
2248 if (isl_int_sgn(c[i]) * sign <= 0)
2251 fprintf(out, " + ");
2253 isl_int_abs(v, c[i]);
2254 dump_term(bmap, v, i, out);
2261 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2262 const char *op, FILE *out, int indent)
2266 fprintf(out, "%*s", indent, "");
2268 dump_constraint_sign(bmap, c, 1, out);
2269 fprintf(out, " %s ", op);
2270 dump_constraint_sign(bmap, c, -1, out);
2274 for (i = bmap->n_div; i < bmap->extra; ++i) {
2275 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2277 fprintf(out, "%*s", indent, "");
2278 fprintf(out, "ERROR: unused div coefficient not zero\n");
2283 static void dump_constraints(struct isl_basic_map *bmap,
2284 isl_int **c, unsigned n,
2285 const char *op, FILE *out, int indent)
2289 for (i = 0; i < n; ++i)
2290 dump_constraint(bmap, c[i], op, out, indent);
2293 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2297 unsigned total = isl_basic_map_total_dim(bmap);
2299 for (j = 0; j < 1 + total; ++j) {
2300 if (isl_int_is_zero(exp[j]))
2302 if (!first && isl_int_is_pos(exp[j]))
2304 dump_term(bmap, exp[j], j, out);
2309 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2313 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2314 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2316 for (i = 0; i < bmap->n_div; ++i) {
2317 fprintf(out, "%*s", indent, "");
2318 fprintf(out, "e%d = [(", i);
2319 dump_affine(bmap, bmap->div[i]+1, out);
2321 isl_int_print(out, bmap->div[i][0], 0);
2322 fprintf(out, "]\n");
2326 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2327 FILE *out, int indent)
2330 fprintf(out, "null basic set\n");
2334 fprintf(out, "%*s", indent, "");
2335 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2336 bset->ref, bset->dim->nparam, bset->dim->n_out,
2337 bset->extra, bset->flags);
2338 dump((struct isl_basic_map *)bset, out, indent);
2341 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2342 FILE *out, int indent)
2345 fprintf(out, "null basic map\n");
2349 fprintf(out, "%*s", indent, "");
2350 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2351 "flags: %x, n_name: %d\n",
2353 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2354 bmap->extra, bmap->flags, bmap->dim->n_id);
2355 dump(bmap, out, indent);
2358 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2363 total = isl_basic_map_total_dim(bmap);
2364 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2365 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2366 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2367 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2371 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2374 struct isl_set *set;
2378 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2379 isl_assert(dim->ctx, n >= 0, goto error);
2380 set = isl_alloc(dim->ctx, struct isl_set,
2381 sizeof(struct isl_set) +
2382 (n - 1) * sizeof(struct isl_basic_set *));
2386 set->ctx = dim->ctx;
2387 isl_ctx_ref(set->ctx);
2395 isl_space_free(dim);
2399 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2400 unsigned nparam, unsigned dim, int n, unsigned flags)
2402 struct isl_set *set;
2405 dims = isl_space_alloc(ctx, nparam, 0, dim);
2409 set = isl_set_alloc_space(dims, n, flags);
2413 /* Make sure "map" has room for at least "n" more basic maps.
2415 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2418 struct isl_map *grown = NULL;
2422 isl_assert(map->ctx, n >= 0, goto error);
2423 if (map->n + n <= map->size)
2425 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2428 for (i = 0; i < map->n; ++i) {
2429 grown->p[i] = isl_basic_map_copy(map->p[i]);
2437 isl_map_free(grown);
2442 /* Make sure "set" has room for at least "n" more basic sets.
2444 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2446 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2449 struct isl_set *isl_set_dup(struct isl_set *set)
2452 struct isl_set *dup;
2457 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2460 for (i = 0; i < set->n; ++i)
2461 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2465 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2467 return isl_map_from_basic_map(bset);
2470 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2472 struct isl_map *map;
2477 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2478 return isl_map_add_basic_map(map, bmap);
2481 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2482 __isl_take isl_basic_set *bset)
2484 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2485 (struct isl_basic_map *)bset);
2488 void *isl_set_free(__isl_take isl_set *set)
2498 isl_ctx_deref(set->ctx);
2499 for (i = 0; i < set->n; ++i)
2500 isl_basic_set_free(set->p[i]);
2501 isl_space_free(set->dim);
2507 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2512 fprintf(out, "null set\n");
2516 fprintf(out, "%*s", indent, "");
2517 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2518 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2520 for (i = 0; i < set->n; ++i) {
2521 fprintf(out, "%*s", indent, "");
2522 fprintf(out, "basic set %d:\n", i);
2523 isl_basic_set_print_internal(set->p[i], out, indent+4);
2527 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2532 fprintf(out, "null map\n");
2536 fprintf(out, "%*s", indent, "");
2537 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2538 "flags: %x, n_name: %d\n",
2539 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2540 map->dim->n_out, map->flags, map->dim->n_id);
2541 for (i = 0; i < map->n; ++i) {
2542 fprintf(out, "%*s", indent, "");
2543 fprintf(out, "basic map %d:\n", i);
2544 isl_basic_map_print_internal(map->p[i], out, indent+4);
2548 struct isl_basic_map *isl_basic_map_intersect_domain(
2549 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2551 struct isl_basic_map *bmap_domain;
2556 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2557 bset->dim, isl_dim_param), goto error);
2559 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2560 isl_assert(bset->ctx,
2561 isl_basic_map_compatible_domain(bmap, bset), goto error);
2563 bmap = isl_basic_map_cow(bmap);
2566 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2567 bset->n_div, bset->n_eq, bset->n_ineq);
2568 bmap_domain = isl_basic_map_from_domain(bset);
2569 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2571 bmap = isl_basic_map_simplify(bmap);
2572 return isl_basic_map_finalize(bmap);
2574 isl_basic_map_free(bmap);
2575 isl_basic_set_free(bset);
2579 struct isl_basic_map *isl_basic_map_intersect_range(
2580 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2582 struct isl_basic_map *bmap_range;
2587 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2588 bset->dim, isl_dim_param), goto error);
2590 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2591 isl_assert(bset->ctx,
2592 isl_basic_map_compatible_range(bmap, bset), goto error);
2594 if (isl_basic_set_is_universe(bset)) {
2595 isl_basic_set_free(bset);
2599 bmap = isl_basic_map_cow(bmap);
2602 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2603 bset->n_div, bset->n_eq, bset->n_ineq);
2604 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2605 bmap = add_constraints(bmap, bmap_range, 0, 0);
2607 bmap = isl_basic_map_simplify(bmap);
2608 return isl_basic_map_finalize(bmap);
2610 isl_basic_map_free(bmap);
2611 isl_basic_set_free(bset);
2615 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2621 total = 1 + isl_basic_map_total_dim(bmap);
2622 if (total != vec->size)
2627 for (i = 0; i < bmap->n_eq; ++i) {
2628 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2629 if (!isl_int_is_zero(s)) {
2635 for (i = 0; i < bmap->n_ineq; ++i) {
2636 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2637 if (isl_int_is_neg(s)) {
2648 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2650 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2653 struct isl_basic_map *isl_basic_map_intersect(
2654 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2656 struct isl_vec *sample = NULL;
2658 if (!bmap1 || !bmap2)
2661 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2662 bmap2->dim, isl_dim_param), goto error);
2663 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2664 isl_space_dim(bmap1->dim, isl_dim_param) &&
2665 isl_space_dim(bmap2->dim, isl_dim_all) !=
2666 isl_space_dim(bmap2->dim, isl_dim_param))
2667 return isl_basic_map_intersect(bmap2, bmap1);
2669 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2670 isl_space_dim(bmap2->dim, isl_dim_param))
2671 isl_assert(bmap1->ctx,
2672 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2674 if (bmap1->sample &&
2675 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2676 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2677 sample = isl_vec_copy(bmap1->sample);
2678 else if (bmap2->sample &&
2679 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2680 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2681 sample = isl_vec_copy(bmap2->sample);
2683 bmap1 = isl_basic_map_cow(bmap1);
2686 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2687 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2688 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2691 isl_vec_free(sample);
2693 isl_vec_free(bmap1->sample);
2694 bmap1->sample = sample;
2697 bmap1 = isl_basic_map_simplify(bmap1);
2698 return isl_basic_map_finalize(bmap1);
2701 isl_vec_free(sample);
2702 isl_basic_map_free(bmap1);
2703 isl_basic_map_free(bmap2);
2707 struct isl_basic_set *isl_basic_set_intersect(
2708 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2710 return (struct isl_basic_set *)
2711 isl_basic_map_intersect(
2712 (struct isl_basic_map *)bset1,
2713 (struct isl_basic_map *)bset2);
2716 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2717 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2719 return isl_basic_set_intersect(bset1, bset2);
2722 /* Special case of isl_map_intersect, where both map1 and map2
2723 * are convex, without any divs and such that either map1 or map2
2724 * contains a single constraint. This constraint is then simply
2725 * added to the other map.
2727 static __isl_give isl_map *map_intersect_add_constraint(
2728 __isl_take isl_map *map1, __isl_take isl_map *map2)
2730 isl_assert(map1->ctx, map1->n == 1, goto error);
2731 isl_assert(map2->ctx, map1->n == 1, goto error);
2732 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2733 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2735 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2736 return isl_map_intersect(map2, map1);
2738 isl_assert(map2->ctx,
2739 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2741 map1 = isl_map_cow(map1);
2744 if (isl_map_plain_is_empty(map1)) {
2748 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2749 if (map2->p[0]->n_eq == 1)
2750 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2752 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2753 map2->p[0]->ineq[0]);
2755 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2756 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2760 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2761 isl_basic_map_free(map1->p[0]);
2774 /* map2 may be either a parameter domain or a map living in the same
2777 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2778 __isl_take isl_map *map2)
2781 struct isl_map *result;
2787 if (isl_map_plain_is_empty(map1) &&
2788 isl_space_is_equal(map1->dim, map2->dim)) {
2792 if (isl_map_plain_is_empty(map2) &&
2793 isl_space_is_equal(map1->dim, map2->dim)) {
2798 if (map1->n == 1 && map2->n == 1 &&
2799 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2800 isl_space_is_equal(map1->dim, map2->dim) &&
2801 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2802 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2803 return map_intersect_add_constraint(map1, map2);
2805 if (isl_space_dim(map2->dim, isl_dim_all) !=
2806 isl_space_dim(map2->dim, isl_dim_param))
2807 isl_assert(map1->ctx,
2808 isl_space_is_equal(map1->dim, map2->dim), goto error);
2810 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2811 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2812 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2814 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2815 map1->n * map2->n, flags);
2818 for (i = 0; i < map1->n; ++i)
2819 for (j = 0; j < map2->n; ++j) {
2820 struct isl_basic_map *part;
2821 part = isl_basic_map_intersect(
2822 isl_basic_map_copy(map1->p[i]),
2823 isl_basic_map_copy(map2->p[j]));
2824 if (isl_basic_map_is_empty(part) < 0)
2826 result = isl_map_add_basic_map(result, part);
2839 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2840 __isl_take isl_map *map2)
2844 if (!isl_space_is_equal(map1->dim, map2->dim))
2845 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
2846 "spaces don't match", goto error);
2847 return map_intersect_internal(map1, map2);
2854 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2855 __isl_take isl_map *map2)
2857 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2860 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2862 return (struct isl_set *)
2863 isl_map_intersect((struct isl_map *)set1,
2864 (struct isl_map *)set2);
2867 /* map_intersect_internal accepts intersections
2868 * with parameter domains, so we can just call that function.
2870 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2871 __isl_take isl_set *params)
2873 return map_intersect_internal(map, params);
2876 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2877 __isl_take isl_map *map2)
2879 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2882 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2883 __isl_take isl_set *params)
2885 return isl_map_intersect_params(set, params);
2888 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2891 struct isl_basic_set *bset;
2896 bmap = isl_basic_map_cow(bmap);
2899 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2900 in = isl_basic_map_n_in(bmap);
2901 bset = isl_basic_set_from_basic_map(bmap);
2902 bset = isl_basic_set_swap_vars(bset, in);
2903 return isl_basic_map_from_basic_set(bset, dim);
2906 static __isl_give isl_basic_map *basic_map_space_reset(
2907 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2911 if (!isl_space_is_named_or_nested(bmap->dim, type))
2914 space = isl_basic_map_get_space(bmap);
2915 space = isl_space_reset(space, type);
2916 bmap = isl_basic_map_reset_space(bmap, space);
2920 __isl_give isl_basic_map *isl_basic_map_insert_dims(
2921 __isl_take isl_basic_map *bmap, enum isl_dim_type type,
2922 unsigned pos, unsigned n)
2925 struct isl_basic_map *res;
2926 struct isl_dim_map *dim_map;
2927 unsigned total, off;
2928 enum isl_dim_type t;
2931 return basic_map_space_reset(bmap, type);
2936 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2938 total = isl_basic_map_total_dim(bmap) + n;
2939 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2941 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2943 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2945 unsigned size = isl_basic_map_dim(bmap, t);
2946 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2948 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2949 pos, size - pos, off + pos + n);
2951 off += isl_space_dim(res_dim, t);
2953 isl_dim_map_div(dim_map, bmap, off);
2955 res = isl_basic_map_alloc_space(res_dim,
2956 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2957 if (isl_basic_map_is_rational(bmap))
2958 res = isl_basic_map_set_rational(res);
2959 if (isl_basic_map_plain_is_empty(bmap)) {
2960 isl_basic_map_free(bmap);
2961 return isl_basic_map_set_to_empty(res);
2963 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2964 return isl_basic_map_finalize(res);
2967 __isl_give isl_basic_set *isl_basic_set_insert_dims(
2968 __isl_take isl_basic_set *bset,
2969 enum isl_dim_type type, unsigned pos, unsigned n)
2971 return isl_basic_map_insert_dims(bset, type, pos, n);
2974 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2975 enum isl_dim_type type, unsigned n)
2979 return isl_basic_map_insert_dims(bmap, type,
2980 isl_basic_map_dim(bmap, type), n);
2983 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2984 enum isl_dim_type type, unsigned n)
2988 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2989 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2991 isl_basic_set_free(bset);
2995 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2996 enum isl_dim_type type)
3000 if (!map || !isl_space_is_named_or_nested(map->dim, type))
3003 space = isl_map_get_space(map);
3004 space = isl_space_reset(space, type);
3005 map = isl_map_reset_space(map, space);
3009 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
3010 enum isl_dim_type type, unsigned pos, unsigned n)
3015 return map_space_reset(map, type);
3017 map = isl_map_cow(map);
3021 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
3025 for (i = 0; i < map->n; ++i) {
3026 map->p[i] = isl_basic_map_insert_dims(map->p[i], type, pos, n);
3037 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
3038 enum isl_dim_type type, unsigned pos, unsigned n)
3040 return isl_map_insert_dims(set, type, pos, n);
3043 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
3044 enum isl_dim_type type, unsigned n)
3048 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
3051 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
3052 enum isl_dim_type type, unsigned n)
3056 isl_assert(set->ctx, type != isl_dim_in, goto error);
3057 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
3063 __isl_give isl_basic_map *isl_basic_map_move_dims(
3064 __isl_take isl_basic_map *bmap,
3065 enum isl_dim_type dst_type, unsigned dst_pos,
3066 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3068 struct isl_dim_map *dim_map;
3069 struct isl_basic_map *res;
3070 enum isl_dim_type t;
3071 unsigned total, off;
3078 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
3081 if (dst_type == src_type && dst_pos == src_pos)
3084 isl_assert(bmap->ctx, dst_type != src_type, goto error);
3086 if (pos(bmap->dim, dst_type) + dst_pos ==
3087 pos(bmap->dim, src_type) + src_pos +
3088 ((src_type < dst_type) ? n : 0)) {
3089 bmap = isl_basic_map_cow(bmap);
3093 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3094 src_type, src_pos, n);
3098 bmap = isl_basic_map_finalize(bmap);
3103 total = isl_basic_map_total_dim(bmap);
3104 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3107 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3108 unsigned size = isl_space_dim(bmap->dim, t);
3109 if (t == dst_type) {
3110 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3113 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
3116 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3117 dst_pos, size - dst_pos, off);
3118 off += size - dst_pos;
3119 } else if (t == src_type) {
3120 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3123 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3124 src_pos + n, size - src_pos - n, off);
3125 off += size - src_pos - n;
3127 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3131 isl_dim_map_div(dim_map, bmap, off);
3133 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3134 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3135 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3137 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3138 src_type, src_pos, n);
3142 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
3143 bmap = isl_basic_map_gauss(bmap, NULL);
3144 bmap = isl_basic_map_finalize(bmap);
3148 isl_basic_map_free(bmap);
3152 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
3153 enum isl_dim_type dst_type, unsigned dst_pos,
3154 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3156 return (isl_basic_set *)isl_basic_map_move_dims(
3157 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
3160 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
3161 enum isl_dim_type dst_type, unsigned dst_pos,
3162 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3166 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
3167 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
3168 src_type, src_pos, n);
3174 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
3175 enum isl_dim_type dst_type, unsigned dst_pos,
3176 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3185 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
3188 if (dst_type == src_type && dst_pos == src_pos)
3191 isl_assert(map->ctx, dst_type != src_type, goto error);
3193 map = isl_map_cow(map);
3197 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
3201 for (i = 0; i < map->n; ++i) {
3202 map->p[i] = isl_basic_map_move_dims(map->p[i],
3204 src_type, src_pos, n);
3215 /* Move the specified dimensions to the last columns right before
3216 * the divs. Don't change the dimension specification of bmap.
3217 * That's the responsibility of the caller.
3219 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
3220 enum isl_dim_type type, unsigned first, unsigned n)
3222 struct isl_dim_map *dim_map;
3223 struct isl_basic_map *res;
3224 enum isl_dim_type t;
3225 unsigned total, off;
3229 if (pos(bmap->dim, type) + first + n ==
3230 1 + isl_space_dim(bmap->dim, isl_dim_all))
3233 total = isl_basic_map_total_dim(bmap);
3234 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3237 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3238 unsigned size = isl_space_dim(bmap->dim, t);
3240 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3243 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3244 first, n, total - bmap->n_div - n);
3245 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3246 first + n, size - (first + n), off);
3247 off += size - (first + n);
3249 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3253 isl_dim_map_div(dim_map, bmap, off + n);
3255 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3256 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3257 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3261 /* Turn the n dimensions of type type, starting at first
3262 * into existentially quantified variables.
3264 __isl_give isl_basic_map *isl_basic_map_project_out(
3265 __isl_take isl_basic_map *bmap,
3266 enum isl_dim_type type, unsigned first, unsigned n)
3274 return basic_map_space_reset(bmap, type);
3279 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3280 return isl_basic_map_remove_dims(bmap, type, first, n);
3282 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3285 bmap = move_last(bmap, type, first, n);
3286 bmap = isl_basic_map_cow(bmap);
3290 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3291 old = bmap->block2.data;
3292 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3293 (bmap->extra + n) * (1 + row_size));
3294 if (!bmap->block2.data)
3296 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3299 for (i = 0; i < n; ++i) {
3300 new_div[i] = bmap->block2.data +
3301 (bmap->extra + i) * (1 + row_size);
3302 isl_seq_clr(new_div[i], 1 + row_size);
3304 for (i = 0; i < bmap->extra; ++i)
3305 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3307 bmap->div = new_div;
3311 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3314 bmap = isl_basic_map_simplify(bmap);
3315 bmap = isl_basic_map_drop_redundant_divs(bmap);
3316 return isl_basic_map_finalize(bmap);
3318 isl_basic_map_free(bmap);
3322 /* Turn the n dimensions of type type, starting at first
3323 * into existentially quantified variables.
3325 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3326 enum isl_dim_type type, unsigned first, unsigned n)
3328 return (isl_basic_set *)isl_basic_map_project_out(
3329 (isl_basic_map *)bset, type, first, n);
3332 /* Turn the n dimensions of type type, starting at first
3333 * into existentially quantified variables.
3335 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3336 enum isl_dim_type type, unsigned first, unsigned n)
3344 return map_space_reset(map, type);
3346 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3348 map = isl_map_cow(map);
3352 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3356 for (i = 0; i < map->n; ++i) {
3357 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3368 /* Turn the n dimensions of type type, starting at first
3369 * into existentially quantified variables.
3371 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3372 enum isl_dim_type type, unsigned first, unsigned n)
3374 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3377 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3381 for (i = 0; i < n; ++i) {
3382 j = isl_basic_map_alloc_div(bmap);
3385 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3389 isl_basic_map_free(bmap);
3393 struct isl_basic_map *isl_basic_map_apply_range(
3394 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3396 isl_space *dim_result = NULL;
3397 struct isl_basic_map *bmap;
3398 unsigned n_in, n_out, n, nparam, total, pos;
3399 struct isl_dim_map *dim_map1, *dim_map2;
3401 if (!bmap1 || !bmap2)
3404 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3405 isl_space_copy(bmap2->dim));
3407 n_in = isl_basic_map_n_in(bmap1);
3408 n_out = isl_basic_map_n_out(bmap2);
3409 n = isl_basic_map_n_out(bmap1);
3410 nparam = isl_basic_map_n_param(bmap1);
3412 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3413 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3414 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3415 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3416 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3417 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3418 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3419 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3420 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3421 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3422 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3424 bmap = isl_basic_map_alloc_space(dim_result,
3425 bmap1->n_div + bmap2->n_div + n,
3426 bmap1->n_eq + bmap2->n_eq,
3427 bmap1->n_ineq + bmap2->n_ineq);
3428 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3429 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3430 bmap = add_divs(bmap, n);
3431 bmap = isl_basic_map_simplify(bmap);
3432 bmap = isl_basic_map_drop_redundant_divs(bmap);
3433 return isl_basic_map_finalize(bmap);
3435 isl_basic_map_free(bmap1);
3436 isl_basic_map_free(bmap2);
3440 struct isl_basic_set *isl_basic_set_apply(
3441 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3446 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3449 return (struct isl_basic_set *)
3450 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3452 isl_basic_set_free(bset);
3453 isl_basic_map_free(bmap);
3457 struct isl_basic_map *isl_basic_map_apply_domain(
3458 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3460 if (!bmap1 || !bmap2)
3463 isl_assert(bmap1->ctx,
3464 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3465 isl_assert(bmap1->ctx,
3466 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3469 bmap1 = isl_basic_map_reverse(bmap1);
3470 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3471 return isl_basic_map_reverse(bmap1);
3473 isl_basic_map_free(bmap1);
3474 isl_basic_map_free(bmap2);
3478 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3479 * A \cap B -> f(A) + f(B)
3481 struct isl_basic_map *isl_basic_map_sum(
3482 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3484 unsigned n_in, n_out, nparam, total, pos;
3485 struct isl_basic_map *bmap = NULL;
3486 struct isl_dim_map *dim_map1, *dim_map2;
3489 if (!bmap1 || !bmap2)
3492 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3495 nparam = isl_basic_map_n_param(bmap1);
3496 n_in = isl_basic_map_n_in(bmap1);
3497 n_out = isl_basic_map_n_out(bmap1);
3499 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3500 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3501 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3502 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3503 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3504 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3505 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3506 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3507 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3508 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3509 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3511 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3512 bmap1->n_div + bmap2->n_div + 2 * n_out,
3513 bmap1->n_eq + bmap2->n_eq + n_out,
3514 bmap1->n_ineq + bmap2->n_ineq);
3515 for (i = 0; i < n_out; ++i) {
3516 int j = isl_basic_map_alloc_equality(bmap);
3519 isl_seq_clr(bmap->eq[j], 1+total);
3520 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3521 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3522 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3524 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3525 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3526 bmap = add_divs(bmap, 2 * n_out);
3528 bmap = isl_basic_map_simplify(bmap);
3529 return isl_basic_map_finalize(bmap);
3531 isl_basic_map_free(bmap);
3532 isl_basic_map_free(bmap1);
3533 isl_basic_map_free(bmap2);
3537 /* Given two maps A -> f(A) and B -> g(B), construct a map
3538 * A \cap B -> f(A) + f(B)
3540 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3542 struct isl_map *result;
3548 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3550 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3551 map1->n * map2->n, 0);
3554 for (i = 0; i < map1->n; ++i)
3555 for (j = 0; j < map2->n; ++j) {
3556 struct isl_basic_map *part;
3557 part = isl_basic_map_sum(
3558 isl_basic_map_copy(map1->p[i]),
3559 isl_basic_map_copy(map2->p[j]));
3560 if (isl_basic_map_is_empty(part))
3561 isl_basic_map_free(part);
3563 result = isl_map_add_basic_map(result, part);
3576 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3577 __isl_take isl_set *set2)
3579 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3582 /* Given a basic map A -> f(A), construct A -> -f(A).
3584 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3589 bmap = isl_basic_map_cow(bmap);
3593 n = isl_basic_map_dim(bmap, isl_dim_out);
3594 off = isl_basic_map_offset(bmap, isl_dim_out);
3595 for (i = 0; i < bmap->n_eq; ++i)
3596 for (j = 0; j < n; ++j)
3597 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3598 for (i = 0; i < bmap->n_ineq; ++i)
3599 for (j = 0; j < n; ++j)
3600 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3601 for (i = 0; i < bmap->n_div; ++i)
3602 for (j = 0; j < n; ++j)
3603 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3604 bmap = isl_basic_map_gauss(bmap, NULL);
3605 return isl_basic_map_finalize(bmap);
3608 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3610 return isl_basic_map_neg(bset);
3613 /* Given a map A -> f(A), construct A -> -f(A).
3615 struct isl_map *isl_map_neg(struct isl_map *map)
3619 map = isl_map_cow(map);
3623 for (i = 0; i < map->n; ++i) {
3624 map->p[i] = isl_basic_map_neg(map->p[i]);
3635 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3637 return (isl_set *)isl_map_neg((isl_map *)set);
3640 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3641 * A -> floor(f(A)/d).
3643 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3646 unsigned n_in, n_out, nparam, total, pos;
3647 struct isl_basic_map *result = NULL;
3648 struct isl_dim_map *dim_map;
3654 nparam = isl_basic_map_n_param(bmap);
3655 n_in = isl_basic_map_n_in(bmap);
3656 n_out = isl_basic_map_n_out(bmap);
3658 total = nparam + n_in + n_out + bmap->n_div + n_out;
3659 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3660 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3661 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3662 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3663 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3665 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3666 bmap->n_div + n_out,
3667 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3668 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3669 result = add_divs(result, n_out);
3670 for (i = 0; i < n_out; ++i) {
3672 j = isl_basic_map_alloc_inequality(result);
3675 isl_seq_clr(result->ineq[j], 1+total);
3676 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3677 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3678 j = isl_basic_map_alloc_inequality(result);
3681 isl_seq_clr(result->ineq[j], 1+total);
3682 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3683 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3684 isl_int_sub_ui(result->ineq[j][0], d, 1);
3687 result = isl_basic_map_simplify(result);
3688 return isl_basic_map_finalize(result);
3690 isl_basic_map_free(result);
3694 /* Given a map A -> f(A) and an integer d, construct a map
3695 * A -> floor(f(A)/d).
3697 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3701 map = isl_map_cow(map);
3705 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3706 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3707 for (i = 0; i < map->n; ++i) {
3708 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3719 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3725 i = isl_basic_map_alloc_equality(bmap);
3728 nparam = isl_basic_map_n_param(bmap);
3729 n_in = isl_basic_map_n_in(bmap);
3730 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3731 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3732 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3733 return isl_basic_map_finalize(bmap);
3735 isl_basic_map_free(bmap);
3739 /* Add a constraints to "bmap" expressing i_pos < o_pos
3741 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3747 i = isl_basic_map_alloc_inequality(bmap);
3750 nparam = isl_basic_map_n_param(bmap);
3751 n_in = isl_basic_map_n_in(bmap);
3752 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3753 isl_int_set_si(bmap->ineq[i][0], -1);
3754 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3755 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3756 return isl_basic_map_finalize(bmap);
3758 isl_basic_map_free(bmap);
3762 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3764 static __isl_give isl_basic_map *var_less_or_equal(
3765 __isl_take isl_basic_map *bmap, unsigned pos)
3771 i = isl_basic_map_alloc_inequality(bmap);
3774 nparam = isl_basic_map_n_param(bmap);
3775 n_in = isl_basic_map_n_in(bmap);
3776 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3777 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3778 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3779 return isl_basic_map_finalize(bmap);
3781 isl_basic_map_free(bmap);
3785 /* Add a constraints to "bmap" expressing i_pos > o_pos
3787 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3793 i = isl_basic_map_alloc_inequality(bmap);
3796 nparam = isl_basic_map_n_param(bmap);
3797 n_in = isl_basic_map_n_in(bmap);
3798 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3799 isl_int_set_si(bmap->ineq[i][0], -1);
3800 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3801 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3802 return isl_basic_map_finalize(bmap);
3804 isl_basic_map_free(bmap);
3808 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3810 static __isl_give isl_basic_map *var_more_or_equal(
3811 __isl_take isl_basic_map *bmap, unsigned pos)
3817 i = isl_basic_map_alloc_inequality(bmap);
3820 nparam = isl_basic_map_n_param(bmap);
3821 n_in = isl_basic_map_n_in(bmap);
3822 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3823 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3824 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3825 return isl_basic_map_finalize(bmap);
3827 isl_basic_map_free(bmap);
3831 __isl_give isl_basic_map *isl_basic_map_equal(
3832 __isl_take isl_space *dim, unsigned n_equal)
3835 struct isl_basic_map *bmap;
3836 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3839 for (i = 0; i < n_equal && bmap; ++i)
3840 bmap = var_equal(bmap, i);
3841 return isl_basic_map_finalize(bmap);
3844 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3846 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3850 struct isl_basic_map *bmap;
3851 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3854 for (i = 0; i < pos && bmap; ++i)
3855 bmap = var_equal(bmap, i);
3857 bmap = var_less(bmap, pos);
3858 return isl_basic_map_finalize(bmap);
3861 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3863 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3864 __isl_take isl_space *dim, unsigned pos)
3867 isl_basic_map *bmap;
3869 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3870 for (i = 0; i < pos; ++i)
3871 bmap = var_equal(bmap, i);
3872 bmap = var_less_or_equal(bmap, pos);
3873 return isl_basic_map_finalize(bmap);
3876 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3878 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3882 struct isl_basic_map *bmap;
3883 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3886 for (i = 0; i < pos && bmap; ++i)
3887 bmap = var_equal(bmap, i);
3889 bmap = var_more(bmap, pos);
3890 return isl_basic_map_finalize(bmap);
3893 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3895 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3896 __isl_take isl_space *dim, unsigned pos)
3899 isl_basic_map *bmap;
3901 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3902 for (i = 0; i < pos; ++i)
3903 bmap = var_equal(bmap, i);
3904 bmap = var_more_or_equal(bmap, pos);
3905 return isl_basic_map_finalize(bmap);
3908 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3909 unsigned n, int equal)
3911 struct isl_map *map;
3914 if (n == 0 && equal)
3915 return isl_map_universe(dims);
3917 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3919 for (i = 0; i + 1 < n; ++i)
3920 map = isl_map_add_basic_map(map,
3921 isl_basic_map_less_at(isl_space_copy(dims), i));
3924 map = isl_map_add_basic_map(map,
3925 isl_basic_map_less_or_equal_at(dims, n - 1));
3927 map = isl_map_add_basic_map(map,
3928 isl_basic_map_less_at(dims, n - 1));
3930 isl_space_free(dims);
3935 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3939 return map_lex_lte_first(dims, dims->n_out, equal);
3942 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3944 return map_lex_lte_first(dim, n, 0);
3947 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3949 return map_lex_lte_first(dim, n, 1);
3952 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3954 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3957 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3959 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3962 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3963 unsigned n, int equal)
3965 struct isl_map *map;
3968 if (n == 0 && equal)
3969 return isl_map_universe(dims);
3971 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3973 for (i = 0; i + 1 < n; ++i)
3974 map = isl_map_add_basic_map(map,
3975 isl_basic_map_more_at(isl_space_copy(dims), i));
3978 map = isl_map_add_basic_map(map,
3979 isl_basic_map_more_or_equal_at(dims, n - 1));
3981 map = isl_map_add_basic_map(map,
3982 isl_basic_map_more_at(dims, n - 1));
3984 isl_space_free(dims);
3989 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3993 return map_lex_gte_first(dims, dims->n_out, equal);
3996 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3998 return map_lex_gte_first(dim, n, 0);
4001 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
4003 return map_lex_gte_first(dim, n, 1);
4006 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
4008 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
4011 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
4013 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
4016 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
4017 __isl_take isl_set *set2)
4020 map = isl_map_lex_le(isl_set_get_space(set1));
4021 map = isl_map_intersect_domain(map, set1);
4022 map = isl_map_intersect_range(map, set2);
4026 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
4027 __isl_take isl_set *set2)
4030 map = isl_map_lex_lt(isl_set_get_space(set1));
4031 map = isl_map_intersect_domain(map, set1);
4032 map = isl_map_intersect_range(map, set2);
4036 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
4037 __isl_take isl_set *set2)
4040 map = isl_map_lex_ge(isl_set_get_space(set1));
4041 map = isl_map_intersect_domain(map, set1);
4042 map = isl_map_intersect_range(map, set2);
4046 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
4047 __isl_take isl_set *set2)
4050 map = isl_map_lex_gt(isl_set_get_space(set1));
4051 map = isl_map_intersect_domain(map, set1);
4052 map = isl_map_intersect_range(map, set2);
4056 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
4057 __isl_take isl_map *map2)
4060 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
4061 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4062 map = isl_map_apply_range(map, isl_map_reverse(map2));
4066 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
4067 __isl_take isl_map *map2)
4070 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
4071 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4072 map = isl_map_apply_range(map, isl_map_reverse(map2));
4076 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
4077 __isl_take isl_map *map2)
4080 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
4081 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4082 map = isl_map_apply_range(map, isl_map_reverse(map2));
4086 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
4087 __isl_take isl_map *map2)
4090 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
4091 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4092 map = isl_map_apply_range(map, isl_map_reverse(map2));
4096 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
4097 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4099 struct isl_basic_map *bmap;
4101 bset = isl_basic_set_cow(bset);
4105 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
4106 isl_space_free(bset->dim);
4107 bmap = (struct isl_basic_map *) bset;
4109 return isl_basic_map_finalize(bmap);
4111 isl_basic_set_free(bset);
4112 isl_space_free(dim);
4116 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
4120 if (bmap->dim->n_in == 0)
4121 return (struct isl_basic_set *)bmap;
4122 bmap = isl_basic_map_cow(bmap);
4125 bmap->dim = isl_space_as_set_space(bmap->dim);
4128 bmap = isl_basic_map_finalize(bmap);
4129 return (struct isl_basic_set *)bmap;
4131 isl_basic_map_free(bmap);
4135 /* For a div d = floor(f/m), add the constraints
4138 * -(f-(n-1)) + m d >= 0
4140 * Note that the second constraint is the negation of
4144 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
4145 unsigned pos, isl_int *div)
4148 unsigned total = isl_basic_map_total_dim(bmap);
4150 i = isl_basic_map_alloc_inequality(bmap);
4153 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
4154 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
4156 j = isl_basic_map_alloc_inequality(bmap);
4159 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
4160 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
4161 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
4165 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
4166 unsigned pos, isl_int *div)
4168 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
4172 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
4174 unsigned total = isl_basic_map_total_dim(bmap);
4175 unsigned div_pos = total - bmap->n_div + div;
4177 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
4181 struct isl_basic_set *isl_basic_map_underlying_set(
4182 struct isl_basic_map *bmap)
4186 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
4188 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
4189 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
4190 return (struct isl_basic_set *)bmap;
4191 bmap = isl_basic_map_cow(bmap);
4194 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
4197 bmap->extra -= bmap->n_div;
4199 bmap = isl_basic_map_finalize(bmap);
4200 return (struct isl_basic_set *)bmap;
4205 __isl_give isl_basic_set *isl_basic_set_underlying_set(
4206 __isl_take isl_basic_set *bset)
4208 return isl_basic_map_underlying_set((isl_basic_map *)bset);
4211 struct isl_basic_map *isl_basic_map_overlying_set(
4212 struct isl_basic_set *bset, struct isl_basic_map *like)
4214 struct isl_basic_map *bmap;
4215 struct isl_ctx *ctx;
4222 isl_assert(ctx, bset->n_div == 0, goto error);
4223 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
4224 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
4226 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
4227 isl_basic_map_free(like);
4228 return (struct isl_basic_map *)bset;
4230 bset = isl_basic_set_cow(bset);
4233 total = bset->dim->n_out + bset->extra;
4234 bmap = (struct isl_basic_map *)bset;
4235 isl_space_free(bmap->dim);
4236 bmap->dim = isl_space_copy(like->dim);
4239 bmap->n_div = like->n_div;
4240 bmap->extra += like->n_div;
4244 ltotal = total - bmap->extra + like->extra;
4247 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
4248 bmap->extra * (1 + 1 + total));
4249 if (isl_blk_is_error(bmap->block2))
4251 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
4255 for (i = 0; i < bmap->extra; ++i)
4256 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
4257 for (i = 0; i < like->n_div; ++i) {
4258 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
4259 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
4261 bmap = isl_basic_map_extend_constraints(bmap,
4262 0, 2 * like->n_div);
4263 for (i = 0; i < like->n_div; ++i) {
4264 if (isl_int_is_zero(bmap->div[i][0]))
4266 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4270 isl_basic_map_free(like);
4271 bmap = isl_basic_map_simplify(bmap);
4272 bmap = isl_basic_map_finalize(bmap);
4275 isl_basic_map_free(like);
4276 isl_basic_set_free(bset);
4280 struct isl_basic_set *isl_basic_set_from_underlying_set(
4281 struct isl_basic_set *bset, struct isl_basic_set *like)
4283 return (struct isl_basic_set *)
4284 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4287 struct isl_set *isl_set_from_underlying_set(
4288 struct isl_set *set, struct isl_basic_set *like)
4294 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4296 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4297 isl_basic_set_free(like);
4300 set = isl_set_cow(set);
4303 for (i = 0; i < set->n; ++i) {
4304 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4305 isl_basic_set_copy(like));
4309 isl_space_free(set->dim);
4310 set->dim = isl_space_copy(like->dim);
4313 isl_basic_set_free(like);
4316 isl_basic_set_free(like);
4321 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4325 map = isl_map_cow(map);
4328 map->dim = isl_space_cow(map->dim);
4332 for (i = 1; i < map->n; ++i)
4333 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4335 for (i = 0; i < map->n; ++i) {
4336 map->p[i] = (struct isl_basic_map *)
4337 isl_basic_map_underlying_set(map->p[i]);
4342 map->dim = isl_space_underlying(map->dim, 0);
4344 isl_space_free(map->dim);
4345 map->dim = isl_space_copy(map->p[0]->dim);
4349 return (struct isl_set *)map;
4355 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4357 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4360 __isl_give isl_basic_map *isl_basic_map_reset_space(
4361 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4363 bmap = isl_basic_map_cow(bmap);
4367 isl_space_free(bmap->dim);
4370 bmap = isl_basic_map_finalize(bmap);
4374 isl_basic_map_free(bmap);
4375 isl_space_free(dim);
4379 __isl_give isl_basic_set *isl_basic_set_reset_space(
4380 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4382 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4386 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4387 __isl_take isl_space *dim)
4391 map = isl_map_cow(map);
4395 for (i = 0; i < map->n; ++i) {
4396 map->p[i] = isl_basic_map_reset_space(map->p[i],
4397 isl_space_copy(dim));
4401 isl_space_free(map->dim);
4407 isl_space_free(dim);
4411 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4412 __isl_take isl_space *dim)
4414 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4417 /* Compute the parameter domain of the given basic set.
4419 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4424 if (isl_basic_set_is_params(bset))
4427 n = isl_basic_set_dim(bset, isl_dim_set);
4428 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4429 space = isl_basic_set_get_space(bset);
4430 space = isl_space_params(space);
4431 bset = isl_basic_set_reset_space(bset, space);
4435 /* Compute the parameter domain of the given set.
4437 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4442 if (isl_set_is_params(set))
4445 n = isl_set_dim(set, isl_dim_set);
4446 set = isl_set_project_out(set, isl_dim_set, 0, n);
4447 space = isl_set_get_space(set);
4448 space = isl_space_params(space);
4449 set = isl_set_reset_space(set, space);
4453 /* Construct a zero-dimensional set with the given parameter domain.
4455 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4458 space = isl_set_get_space(set);
4459 space = isl_space_set_from_params(space);
4460 set = isl_set_reset_space(set, space);
4464 /* Compute the parameter domain of the given map.
4466 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4471 n = isl_map_dim(map, isl_dim_in);
4472 map = isl_map_project_out(map, isl_dim_in, 0, n);
4473 n = isl_map_dim(map, isl_dim_out);
4474 map = isl_map_project_out(map, isl_dim_out, 0, n);
4475 space = isl_map_get_space(map);
4476 space = isl_space_params(space);
4477 map = isl_map_reset_space(map, space);
4481 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4484 struct isl_basic_set *domain;
4490 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4492 n_in = isl_basic_map_n_in(bmap);
4493 n_out = isl_basic_map_n_out(bmap);
4494 domain = isl_basic_set_from_basic_map(bmap);
4495 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4497 domain = isl_basic_set_reset_space(domain, dim);
4502 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4506 return isl_space_may_be_set(bmap->dim);
4509 /* Is this basic map actually a set?
4510 * Users should never call this function. Outside of isl,
4511 * the type should indicate whether something is a set or a map.
4513 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4517 return isl_space_is_set(bmap->dim);
4520 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4524 if (isl_basic_map_is_set(bmap))
4526 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4529 __isl_give isl_basic_map *isl_basic_map_domain_map(
4530 __isl_take isl_basic_map *bmap)
4534 isl_basic_map *domain;
4535 int nparam, n_in, n_out;
4538 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4539 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4540 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4542 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4543 domain = isl_basic_map_universe(dim);
4545 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4546 bmap = isl_basic_map_apply_range(bmap, domain);
4547 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4549 total = isl_basic_map_total_dim(bmap);
4551 for (i = 0; i < n_in; ++i) {
4552 k = isl_basic_map_alloc_equality(bmap);
4555 isl_seq_clr(bmap->eq[k], 1 + total);
4556 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4557 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4560 bmap = isl_basic_map_gauss(bmap, NULL);
4561 return isl_basic_map_finalize(bmap);
4563 isl_basic_map_free(bmap);
4567 __isl_give isl_basic_map *isl_basic_map_range_map(
4568 __isl_take isl_basic_map *bmap)
4572 isl_basic_map *range;
4573 int nparam, n_in, n_out;
4576 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4577 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4578 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4580 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4581 range = isl_basic_map_universe(dim);
4583 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4584 bmap = isl_basic_map_apply_range(bmap, range);
4585 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4587 total = isl_basic_map_total_dim(bmap);
4589 for (i = 0; i < n_out; ++i) {
4590 k = isl_basic_map_alloc_equality(bmap);
4593 isl_seq_clr(bmap->eq[k], 1 + total);
4594 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4595 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4598 bmap = isl_basic_map_gauss(bmap, NULL);
4599 return isl_basic_map_finalize(bmap);
4601 isl_basic_map_free(bmap);
4605 int isl_map_may_be_set(__isl_keep isl_map *map)
4609 return isl_space_may_be_set(map->dim);
4612 /* Is this map actually a set?
4613 * Users should never call this function. Outside of isl,
4614 * the type should indicate whether something is a set or a map.
4616 int isl_map_is_set(__isl_keep isl_map *map)
4620 return isl_space_is_set(map->dim);
4623 struct isl_set *isl_map_range(struct isl_map *map)
4626 struct isl_set *set;
4630 if (isl_map_is_set(map))
4631 return (isl_set *)map;
4633 map = isl_map_cow(map);
4637 set = (struct isl_set *) map;
4638 set->dim = isl_space_range(set->dim);
4641 for (i = 0; i < map->n; ++i) {
4642 set->p[i] = isl_basic_map_range(map->p[i]);
4646 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4647 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4654 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4657 isl_space *domain_dim;
4659 map = isl_map_cow(map);
4663 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4664 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4665 map->dim = isl_space_join(map->dim, domain_dim);
4668 for (i = 0; i < map->n; ++i) {
4669 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4673 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4674 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4681 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4684 isl_space *range_dim;
4686 map = isl_map_cow(map);
4690 range_dim = isl_space_range(isl_map_get_space(map));
4691 range_dim = isl_space_from_range(range_dim);
4692 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4693 map->dim = isl_space_join(map->dim, range_dim);
4696 for (i = 0; i < map->n; ++i) {
4697 map->p[i] = isl_basic_map_range_map(map->p[i]);
4701 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4702 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4709 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4710 __isl_take isl_space *dim)
4713 struct isl_map *map = NULL;
4715 set = isl_set_cow(set);
4718 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4719 map = (struct isl_map *)set;
4720 for (i = 0; i < set->n; ++i) {
4721 map->p[i] = isl_basic_map_from_basic_set(
4722 set->p[i], isl_space_copy(dim));
4726 isl_space_free(map->dim);
4730 isl_space_free(dim);
4735 __isl_give isl_basic_map *isl_basic_map_from_domain(
4736 __isl_take isl_basic_set *bset)
4738 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4741 __isl_give isl_basic_map *isl_basic_map_from_range(
4742 __isl_take isl_basic_set *bset)
4745 space = isl_basic_set_get_space(bset);
4746 space = isl_space_from_range(space);
4747 bset = isl_basic_set_reset_space(bset, space);
4748 return (isl_basic_map *)bset;
4751 struct isl_map *isl_map_from_range(struct isl_set *set)
4754 space = isl_set_get_space(set);
4755 space = isl_space_from_range(space);
4756 set = isl_set_reset_space(set, space);
4757 return (struct isl_map *)set;
4760 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4762 return isl_map_reverse(isl_map_from_range(set));
4765 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4766 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4768 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4771 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4772 __isl_take isl_set *range)
4774 return isl_map_apply_range(isl_map_reverse(domain), range);
4777 struct isl_set *isl_set_from_map(struct isl_map *map)
4780 struct isl_set *set = NULL;
4784 map = isl_map_cow(map);
4787 map->dim = isl_space_as_set_space(map->dim);
4790 set = (struct isl_set *)map;
4791 for (i = 0; i < map->n; ++i) {
4792 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4802 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4805 struct isl_map *map;
4810 isl_die(dim->ctx, isl_error_internal,
4811 "negative number of basic maps", goto error);
4812 map = isl_alloc(dim->ctx, struct isl_map,
4813 sizeof(struct isl_map) +
4814 (n - 1) * sizeof(struct isl_basic_map *));
4818 map->ctx = dim->ctx;
4819 isl_ctx_ref(map->ctx);
4827 isl_space_free(dim);
4831 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4832 unsigned nparam, unsigned in, unsigned out, int n,
4835 struct isl_map *map;
4838 dims = isl_space_alloc(ctx, nparam, in, out);
4842 map = isl_map_alloc_space(dims, n, flags);
4846 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4848 struct isl_basic_map *bmap;
4849 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4850 bmap = isl_basic_map_set_to_empty(bmap);
4854 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4856 struct isl_basic_set *bset;
4857 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4858 bset = isl_basic_set_set_to_empty(bset);
4862 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4864 struct isl_basic_map *bmap;
4867 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4868 bmap = isl_basic_map_set_to_empty(bmap);
4872 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4874 struct isl_basic_map *bmap;
4877 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4878 bmap = isl_basic_map_set_to_empty(bmap);
4882 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4884 struct isl_basic_set *bset;
4887 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4888 bset = isl_basic_set_set_to_empty(bset);
4892 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4894 struct isl_basic_map *bmap;
4895 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4896 bmap = isl_basic_map_finalize(bmap);
4900 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4902 struct isl_basic_set *bset;
4903 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4904 bset = isl_basic_set_finalize(bset);
4908 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4911 unsigned total = isl_space_dim(dim, isl_dim_all);
4912 isl_basic_map *bmap;
4914 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4915 for (i = 0; i < total; ++i) {
4916 int k = isl_basic_map_alloc_inequality(bmap);
4919 isl_seq_clr(bmap->ineq[k], 1 + total);
4920 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4924 isl_basic_map_free(bmap);
4928 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4930 return isl_basic_map_nat_universe(dim);
4933 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4935 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4938 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4940 return isl_map_nat_universe(dim);
4943 __isl_give isl_basic_map *isl_basic_map_universe_like(
4944 __isl_keep isl_basic_map *model)
4948 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4951 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4955 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4958 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4959 __isl_keep isl_set *model)
4963 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4966 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4968 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4971 struct isl_map *isl_map_empty_like(struct isl_map *model)
4975 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4978 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4982 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4985 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4987 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4990 struct isl_set *isl_set_empty_like(struct isl_set *model)
4994 return isl_set_empty(isl_space_copy(model->dim));
4997 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4999 struct isl_map *map;
5002 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5003 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
5007 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
5009 struct isl_set *set;
5012 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5013 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
5017 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
5021 return isl_set_universe(isl_space_copy(model->dim));
5024 struct isl_map *isl_map_dup(struct isl_map *map)
5027 struct isl_map *dup;
5031 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
5032 for (i = 0; i < map->n; ++i)
5033 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
5037 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
5038 __isl_take isl_basic_map *bmap)
5042 if (isl_basic_map_plain_is_empty(bmap)) {
5043 isl_basic_map_free(bmap);
5046 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
5047 isl_assert(map->ctx, map->n < map->size, goto error);
5048 map->p[map->n] = bmap;
5050 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5056 isl_basic_map_free(bmap);
5060 void isl_map_free(struct isl_map *map)
5070 isl_ctx_deref(map->ctx);
5071 for (i = 0; i < map->n; ++i)
5072 isl_basic_map_free(map->p[i]);
5073 isl_space_free(map->dim);
5077 struct isl_map *isl_map_extend(struct isl_map *base,
5078 unsigned nparam, unsigned n_in, unsigned n_out)
5082 base = isl_map_cow(base);
5086 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
5089 for (i = 0; i < base->n; ++i) {
5090 base->p[i] = isl_basic_map_extend_space(base->p[i],
5091 isl_space_copy(base->dim), 0, 0, 0);
5101 struct isl_set *isl_set_extend(struct isl_set *base,
5102 unsigned nparam, unsigned dim)
5104 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
5108 static struct isl_basic_map *isl_basic_map_fix_pos_si(
5109 struct isl_basic_map *bmap, unsigned pos, int value)
5113 bmap = isl_basic_map_cow(bmap);
5114 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5115 j = isl_basic_map_alloc_equality(bmap);
5118 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5119 isl_int_set_si(bmap->eq[j][pos], -1);
5120 isl_int_set_si(bmap->eq[j][0], value);
5121 bmap = isl_basic_map_simplify(bmap);
5122 return isl_basic_map_finalize(bmap);
5124 isl_basic_map_free(bmap);
5128 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
5129 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
5133 bmap = isl_basic_map_cow(bmap);
5134 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5135 j = isl_basic_map_alloc_equality(bmap);
5138 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5139 isl_int_set_si(bmap->eq[j][pos], -1);
5140 isl_int_set(bmap->eq[j][0], value);
5141 bmap = isl_basic_map_simplify(bmap);
5142 return isl_basic_map_finalize(bmap);
5144 isl_basic_map_free(bmap);
5148 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
5149 enum isl_dim_type type, unsigned pos, int value)
5153 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5154 return isl_basic_map_fix_pos_si(bmap,
5155 isl_basic_map_offset(bmap, type) + pos, value);
5157 isl_basic_map_free(bmap);
5161 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
5162 enum isl_dim_type type, unsigned pos, isl_int value)
5166 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5167 return isl_basic_map_fix_pos(bmap,
5168 isl_basic_map_offset(bmap, type) + pos, value);
5170 isl_basic_map_free(bmap);
5174 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
5175 enum isl_dim_type type, unsigned pos, int value)
5177 return (struct isl_basic_set *)
5178 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5182 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
5183 enum isl_dim_type type, unsigned pos, isl_int value)
5185 return (struct isl_basic_set *)
5186 isl_basic_map_fix((struct isl_basic_map *)bset,
5190 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
5191 unsigned input, int value)
5193 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
5196 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
5197 unsigned dim, int value)
5199 return (struct isl_basic_set *)
5200 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5201 isl_dim_set, dim, value);
5204 static int remove_if_empty(__isl_keep isl_map *map, int i)
5206 int empty = isl_basic_map_plain_is_empty(map->p[i]);
5213 isl_basic_map_free(map->p[i]);
5214 if (i != map->n - 1) {
5215 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5216 map->p[i] = map->p[map->n - 1];
5223 struct isl_map *isl_map_fix_si(struct isl_map *map,
5224 enum isl_dim_type type, unsigned pos, int value)
5228 map = isl_map_cow(map);
5232 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5233 for (i = map->n - 1; i >= 0; --i) {
5234 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
5235 if (remove_if_empty(map, i) < 0)
5238 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5245 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
5246 enum isl_dim_type type, unsigned pos, int value)
5248 return (struct isl_set *)
5249 isl_map_fix_si((struct isl_map *)set, type, pos, value);
5252 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
5253 enum isl_dim_type type, unsigned pos, isl_int value)
5257 map = isl_map_cow(map);
5261 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5262 for (i = 0; i < map->n; ++i) {
5263 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
5267 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5274 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
5275 enum isl_dim_type type, unsigned pos, isl_int value)
5277 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
5280 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
5281 unsigned input, int value)
5283 return isl_map_fix_si(map, isl_dim_in, input, value);
5286 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5288 return (struct isl_set *)
5289 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5292 static __isl_give isl_basic_map *basic_map_bound_si(
5293 __isl_take isl_basic_map *bmap,
5294 enum isl_dim_type type, unsigned pos, int value, int upper)
5300 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5301 pos += isl_basic_map_offset(bmap, type);
5302 bmap = isl_basic_map_cow(bmap);
5303 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5304 j = isl_basic_map_alloc_inequality(bmap);
5307 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5309 isl_int_set_si(bmap->ineq[j][pos], -1);
5310 isl_int_set_si(bmap->ineq[j][0], value);
5312 isl_int_set_si(bmap->ineq[j][pos], 1);
5313 isl_int_set_si(bmap->ineq[j][0], -value);
5315 bmap = isl_basic_map_simplify(bmap);
5316 return isl_basic_map_finalize(bmap);
5318 isl_basic_map_free(bmap);
5322 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5323 __isl_take isl_basic_map *bmap,
5324 enum isl_dim_type type, unsigned pos, int value)
5326 return basic_map_bound_si(bmap, type, pos, value, 0);
5329 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5330 unsigned dim, isl_int value)
5334 bset = isl_basic_set_cow(bset);
5335 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5336 j = isl_basic_set_alloc_inequality(bset);
5339 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5340 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5341 isl_int_neg(bset->ineq[j][0], value);
5342 bset = isl_basic_set_simplify(bset);
5343 return isl_basic_set_finalize(bset);
5345 isl_basic_set_free(bset);
5349 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5350 enum isl_dim_type type, unsigned pos, int value, int upper)
5354 map = isl_map_cow(map);
5358 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5359 for (i = 0; i < map->n; ++i) {
5360 map->p[i] = basic_map_bound_si(map->p[i],
5361 type, pos, value, upper);
5365 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5372 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5373 enum isl_dim_type type, unsigned pos, int value)
5375 return map_bound_si(map, type, pos, value, 0);
5378 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5379 enum isl_dim_type type, unsigned pos, int value)
5381 return map_bound_si(map, type, pos, value, 1);
5384 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5385 enum isl_dim_type type, unsigned pos, int value)
5387 return (struct isl_set *)
5388 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5391 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5392 enum isl_dim_type type, unsigned pos, int value)
5394 return isl_map_upper_bound_si(set, type, pos, value);
5397 /* Bound the given variable of "bmap" from below (or above is "upper"
5398 * is set) to "value".
5400 static __isl_give isl_basic_map *basic_map_bound(
5401 __isl_take isl_basic_map *bmap,
5402 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5408 if (pos >= isl_basic_map_dim(bmap, type))
5409 isl_die(bmap->ctx, isl_error_invalid,
5410 "index out of bounds", goto error);
5411 pos += isl_basic_map_offset(bmap, type);
5412 bmap = isl_basic_map_cow(bmap);
5413 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5414 j = isl_basic_map_alloc_inequality(bmap);
5417 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5419 isl_int_set_si(bmap->ineq[j][pos], -1);
5420 isl_int_set(bmap->ineq[j][0], value);
5422 isl_int_set_si(bmap->ineq[j][pos], 1);
5423 isl_int_neg(bmap->ineq[j][0], value);
5425 bmap = isl_basic_map_simplify(bmap);
5426 return isl_basic_map_finalize(bmap);
5428 isl_basic_map_free(bmap);
5432 /* Bound the given variable of "map" from below (or above is "upper"
5433 * is set) to "value".
5435 static __isl_give isl_map *map_bound(__isl_take isl_map *map,
5436 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5440 map = isl_map_cow(map);
5444 if (pos >= isl_map_dim(map, type))
5445 isl_die(map->ctx, isl_error_invalid,
5446 "index out of bounds", goto error);
5447 for (i = map->n - 1; i >= 0; --i) {
5448 map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper);
5449 if (remove_if_empty(map, i) < 0)
5452 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5459 __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map,
5460 enum isl_dim_type type, unsigned pos, isl_int value)
5462 return map_bound(map, type, pos, value, 0);
5465 __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map,
5466 enum isl_dim_type type, unsigned pos, isl_int value)
5468 return map_bound(map, type, pos, value, 1);
5471 __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set,
5472 enum isl_dim_type type, unsigned pos, isl_int value)
5474 return isl_map_lower_bound(set, type, pos, value);
5477 __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set,
5478 enum isl_dim_type type, unsigned pos, isl_int value)
5480 return isl_map_upper_bound(set, type, pos, value);
5483 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5488 set = isl_set_cow(set);
5492 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5493 for (i = 0; i < set->n; ++i) {
5494 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5504 struct isl_map *isl_map_reverse(struct isl_map *map)
5508 map = isl_map_cow(map);
5512 map->dim = isl_space_reverse(map->dim);
5515 for (i = 0; i < map->n; ++i) {
5516 map->p[i] = isl_basic_map_reverse(map->p[i]);
5520 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5527 static struct isl_map *isl_basic_map_partial_lexopt(
5528 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5529 struct isl_set **empty, int max)
5533 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5534 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5536 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5538 isl_basic_map_free(bmap);
5539 isl_basic_set_free(dom);
5545 struct isl_map *isl_basic_map_partial_lexmax(
5546 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5547 struct isl_set **empty)
5549 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5552 struct isl_map *isl_basic_map_partial_lexmin(
5553 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5554 struct isl_set **empty)
5556 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5559 struct isl_set *isl_basic_set_partial_lexmin(
5560 struct isl_basic_set *bset, struct isl_basic_set *dom,
5561 struct isl_set **empty)
5563 return (struct isl_set *)
5564 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5568 struct isl_set *isl_basic_set_partial_lexmax(
5569 struct isl_basic_set *bset, struct isl_basic_set *dom,
5570 struct isl_set **empty)
5572 return (struct isl_set *)
5573 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5577 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5578 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5579 __isl_give isl_set **empty)
5581 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5584 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5585 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5586 __isl_give isl_set **empty)
5588 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5591 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5592 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5593 __isl_give isl_set **empty)
5595 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5598 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5599 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5600 __isl_give isl_set **empty)
5602 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5605 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5606 __isl_take isl_basic_map *bmap, int max)
5608 isl_basic_set *dom = NULL;
5609 isl_space *dom_space;
5613 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5614 dom = isl_basic_set_universe(dom_space);
5615 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5617 isl_basic_map_free(bmap);
5621 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5622 __isl_take isl_basic_map *bmap)
5624 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5628 #define TYPE isl_pw_multi_aff
5630 #define SUFFIX _pw_multi_aff
5632 #define EMPTY isl_pw_multi_aff_empty
5634 #define ADD isl_pw_multi_aff_union_add
5635 #include "isl_map_lexopt_templ.c"
5637 /* Given a map "map", compute the lexicographically minimal
5638 * (or maximal) image element for each domain element in dom,
5639 * in the form of an isl_pw_multi_aff.
5640 * Set *empty to those elements in dom that do not have an image element.
5642 * We first compute the lexicographically minimal or maximal element
5643 * in the first basic map. This results in a partial solution "res"
5644 * and a subset "todo" of dom that still need to be handled.
5645 * We then consider each of the remaining maps in "map" and successively
5646 * update both "res" and "todo".
5648 static __isl_give isl_pw_multi_aff *isl_map_partial_lexopt_aligned_pw_multi_aff(
5649 __isl_take isl_map *map, __isl_take isl_set *dom,
5650 __isl_give isl_set **empty, int max)
5653 isl_pw_multi_aff *res;
5659 if (isl_map_plain_is_empty(map)) {
5664 return isl_pw_multi_aff_from_map(map);
5667 res = basic_map_partial_lexopt_pw_multi_aff(
5668 isl_basic_map_copy(map->p[0]),
5669 isl_set_copy(dom), &todo, max);
5671 for (i = 1; i < map->n; ++i) {
5672 isl_pw_multi_aff *res_i;
5675 res_i = basic_map_partial_lexopt_pw_multi_aff(
5676 isl_basic_map_copy(map->p[i]),
5677 isl_set_copy(dom), &todo_i, max);
5680 res = isl_pw_multi_aff_union_lexmax(res, res_i);
5682 res = isl_pw_multi_aff_union_lexmin(res, res_i);
5684 todo = isl_set_intersect(todo, todo_i);
5705 #define TYPE isl_map
5709 #define EMPTY isl_map_empty
5711 #define ADD isl_map_union_disjoint
5712 #include "isl_map_lexopt_templ.c"
5714 /* Given a map "map", compute the lexicographically minimal
5715 * (or maximal) image element for each domain element in dom.
5716 * Set *empty to those elements in dom that do not have an image element.
5718 * We first compute the lexicographically minimal or maximal element
5719 * in the first basic map. This results in a partial solution "res"
5720 * and a subset "todo" of dom that still need to be handled.
5721 * We then consider each of the remaining maps in "map" and successively
5722 * update both "res" and "todo".
5724 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5725 * Assume we are computing the lexicographical maximum.
5726 * We first compute the lexicographically maximal element in basic map i.
5727 * This results in a partial solution res_i and a subset todo_i.
5728 * Then we combine these results with those obtain for the first k basic maps
5729 * to obtain a result that is valid for the first k+1 basic maps.
5730 * In particular, the set where there is no solution is the set where
5731 * there is no solution for the first k basic maps and also no solution
5732 * for the ith basic map, i.e.,
5734 * todo^i = todo^k * todo_i
5736 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5737 * solutions, arbitrarily breaking ties in favor of res^k.
5738 * That is, when res^k(a) >= res_i(a), we pick res^k and
5739 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5740 * the lexicographic order.)
5741 * In practice, we compute
5743 * res^k * (res_i . "<=")
5747 * res_i * (res^k . "<")
5749 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5750 * where only one of res^k and res_i provides a solution and we simply pick
5757 * Note that we only compute these intersections when dom(res^k) intersects
5758 * dom(res_i). Otherwise, the only effect of these intersections is to
5759 * potentially break up res^k and res_i into smaller pieces.
5760 * We want to avoid such splintering as much as possible.
5761 * In fact, an earlier implementation of this function would look for
5762 * better results in the domain of res^k and for extra results in todo^k,
5763 * but this would always result in a splintering according to todo^k,
5764 * even when the domain of basic map i is disjoint from the domains of
5765 * the previous basic maps.
5767 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5768 __isl_take isl_map *map, __isl_take isl_set *dom,
5769 __isl_give isl_set **empty, int max)
5772 struct isl_map *res;
5773 struct isl_set *todo;
5778 if (isl_map_plain_is_empty(map)) {
5786 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5787 isl_set_copy(dom), &todo, max);
5789 for (i = 1; i < map->n; ++i) {
5793 isl_space *dim = isl_space_range(isl_map_get_space(res));
5795 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5796 isl_set_copy(dom), &todo_i, max);
5799 lt = isl_map_lex_lt(isl_space_copy(dim));
5800 le = isl_map_lex_le(dim);
5802 lt = isl_map_lex_gt(isl_space_copy(dim));
5803 le = isl_map_lex_ge(dim);
5805 lt = isl_map_apply_range(isl_map_copy(res), lt);
5806 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5807 le = isl_map_apply_range(isl_map_copy(res_i), le);
5808 le = isl_map_intersect(le, isl_map_copy(res));
5810 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5811 res = isl_map_intersect_domain(res,
5812 isl_set_copy(todo_i));
5813 res_i = isl_map_intersect_domain(res_i,
5814 isl_set_copy(todo));
5817 res = isl_map_union_disjoint(res, res_i);
5818 res = isl_map_union_disjoint(res, lt);
5819 res = isl_map_union_disjoint(res, le);
5821 todo = isl_set_intersect(todo, todo_i);
5841 __isl_give isl_map *isl_map_partial_lexmax(
5842 __isl_take isl_map *map, __isl_take isl_set *dom,
5843 __isl_give isl_set **empty)
5845 return isl_map_partial_lexopt(map, dom, empty, 1);
5848 __isl_give isl_map *isl_map_partial_lexmin(
5849 __isl_take isl_map *map, __isl_take isl_set *dom,
5850 __isl_give isl_set **empty)
5852 return isl_map_partial_lexopt(map, dom, empty, 0);
5855 __isl_give isl_set *isl_set_partial_lexmin(
5856 __isl_take isl_set *set, __isl_take isl_set *dom,
5857 __isl_give isl_set **empty)
5859 return (struct isl_set *)
5860 isl_map_partial_lexmin((struct isl_map *)set,
5864 __isl_give isl_set *isl_set_partial_lexmax(
5865 __isl_take isl_set *set, __isl_take isl_set *dom,
5866 __isl_give isl_set **empty)
5868 return (struct isl_set *)
5869 isl_map_partial_lexmax((struct isl_map *)set,
5873 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5875 struct isl_basic_set *dom = NULL;
5880 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5881 dom = isl_basic_set_universe(dom_dim);
5882 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5884 isl_basic_map_free(bmap);
5888 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5890 return isl_basic_map_lexopt(bmap, 0);
5893 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5895 return isl_basic_map_lexopt(bmap, 1);
5898 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5900 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5903 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5905 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5908 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5910 return (isl_set *)isl_map_lexmin((isl_map *)set);
5913 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5915 return (isl_set *)isl_map_lexmax((isl_map *)set);
5918 /* Extract the first and only affine expression from list
5919 * and then add it to *pwaff with the given dom.
5920 * This domain is known to be disjoint from other domains
5921 * because of the way isl_basic_map_foreach_lexmax works.
5923 static int update_dim_opt(__isl_take isl_basic_set *dom,
5924 __isl_take isl_aff_list *list, void *user)
5926 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5928 isl_pw_aff **pwaff = user;
5929 isl_pw_aff *pwaff_i;
5931 if (isl_aff_list_n_aff(list) != 1)
5932 isl_die(ctx, isl_error_internal,
5933 "expecting single element list", goto error);
5935 aff = isl_aff_list_get_aff(list, 0);
5936 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5938 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5940 isl_aff_list_free(list);
5944 isl_basic_set_free(dom);
5945 isl_aff_list_free(list);
5949 /* Given a basic map with one output dimension, compute the minimum or
5950 * maximum of that dimension as an isl_pw_aff.
5952 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5953 * call update_dim_opt on each leaf of the result.
5955 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5958 isl_space *dim = isl_basic_map_get_space(bmap);
5962 dim = isl_space_from_domain(isl_space_domain(dim));
5963 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5964 pwaff = isl_pw_aff_empty(dim);
5966 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5968 return isl_pw_aff_free(pwaff);
5973 /* Compute the minimum or maximum of the given output dimension
5974 * as a function of the parameters and the input dimensions,
5975 * but independently of the other output dimensions.
5977 * We first project out the other output dimension and then compute
5978 * the "lexicographic" maximum in each basic map, combining the results
5979 * using isl_pw_aff_union_max.
5981 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
5988 n_out = isl_map_dim(map, isl_dim_out);
5989 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
5990 map = isl_map_project_out(map, isl_dim_out, 0, pos);
5995 isl_space *dim = isl_map_get_space(map);
5996 dim = isl_space_domain(isl_space_from_range(dim));
5998 return isl_pw_aff_empty(dim);
6001 pwaff = basic_map_dim_opt(map->p[0], max);
6002 for (i = 1; i < map->n; ++i) {
6003 isl_pw_aff *pwaff_i;
6005 pwaff_i = basic_map_dim_opt(map->p[i], max);
6006 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
6014 /* Compute the maximum of the given output dimension as a function of the
6015 * parameters and input dimensions, but independently of
6016 * the other output dimensions.
6018 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
6020 return map_dim_opt(map, pos, 1);
6023 /* Compute the minimum or maximum of the given set dimension
6024 * as a function of the parameters,
6025 * but independently of the other set dimensions.
6027 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
6030 return map_dim_opt(set, pos, max);
6033 /* Compute the maximum of the given set dimension as a function of the
6034 * parameters, but independently of the other set dimensions.
6036 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
6038 return set_dim_opt(set, pos, 1);
6041 /* Compute the minimum of the given set dimension as a function of the
6042 * parameters, but independently of the other set dimensions.
6044 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
6046 return set_dim_opt(set, pos, 0);
6049 /* Apply a preimage specified by "mat" on the parameters of "bset".
6050 * bset is assumed to have only parameters and divs.
6052 static struct isl_basic_set *basic_set_parameter_preimage(
6053 struct isl_basic_set *bset, struct isl_mat *mat)
6060 bset->dim = isl_space_cow(bset->dim);
6064 nparam = isl_basic_set_dim(bset, isl_dim_param);
6066 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
6068 bset->dim->nparam = 0;
6069 bset->dim->n_out = nparam;
6070 bset = isl_basic_set_preimage(bset, mat);
6072 bset->dim->nparam = bset->dim->n_out;
6073 bset->dim->n_out = 0;
6078 isl_basic_set_free(bset);
6082 /* Apply a preimage specified by "mat" on the parameters of "set".
6083 * set is assumed to have only parameters and divs.
6085 static struct isl_set *set_parameter_preimage(
6086 struct isl_set *set, struct isl_mat *mat)
6088 isl_space *dim = NULL;
6094 dim = isl_space_copy(set->dim);
6095 dim = isl_space_cow(dim);
6099 nparam = isl_set_dim(set, isl_dim_param);
6101 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
6104 dim->n_out = nparam;
6105 isl_set_reset_space(set, dim);
6106 set = isl_set_preimage(set, mat);
6109 dim = isl_space_copy(set->dim);
6110 dim = isl_space_cow(dim);
6113 dim->nparam = dim->n_out;
6115 isl_set_reset_space(set, dim);
6118 isl_space_free(dim);
6125 /* Intersect the basic set "bset" with the affine space specified by the
6126 * equalities in "eq".
6128 static struct isl_basic_set *basic_set_append_equalities(
6129 struct isl_basic_set *bset, struct isl_mat *eq)
6137 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
6142 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
6143 for (i = 0; i < eq->n_row; ++i) {
6144 k = isl_basic_set_alloc_equality(bset);
6147 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
6148 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
6152 bset = isl_basic_set_gauss(bset, NULL);
6153 bset = isl_basic_set_finalize(bset);
6158 isl_basic_set_free(bset);
6162 /* Intersect the set "set" with the affine space specified by the
6163 * equalities in "eq".
6165 static struct isl_set *set_append_equalities(struct isl_set *set,
6173 for (i = 0; i < set->n; ++i) {
6174 set->p[i] = basic_set_append_equalities(set->p[i],
6187 /* Project the given basic set onto its parameter domain, possibly introducing
6188 * new, explicit, existential variables in the constraints.
6189 * The input has parameters and (possibly implicit) existential variables.
6190 * The output has the same parameters, but only
6191 * explicit existentially quantified variables.
6193 * The actual projection is performed by pip, but pip doesn't seem
6194 * to like equalities very much, so we first remove the equalities
6195 * among the parameters by performing a variable compression on
6196 * the parameters. Afterward, an inverse transformation is performed
6197 * and the equalities among the parameters are inserted back in.
6199 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
6203 struct isl_mat *T, *T2;
6204 struct isl_set *set;
6205 unsigned nparam, n_div;
6207 bset = isl_basic_set_cow(bset);
6211 if (bset->n_eq == 0)
6212 return isl_basic_set_lexmin(bset);
6214 isl_basic_set_gauss(bset, NULL);
6216 nparam = isl_basic_set_dim(bset, isl_dim_param);
6217 n_div = isl_basic_set_dim(bset, isl_dim_div);
6219 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
6220 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
6223 if (i == bset->n_eq)
6224 return isl_basic_set_lexmin(bset);
6226 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
6228 eq = isl_mat_cow(eq);
6229 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
6230 if (T && T->n_col == 0) {
6234 bset = isl_basic_set_set_to_empty(bset);
6235 return isl_set_from_basic_set(bset);
6237 bset = basic_set_parameter_preimage(bset, T);
6239 set = isl_basic_set_lexmin(bset);
6240 set = set_parameter_preimage(set, T2);
6241 set = set_append_equalities(set, eq);
6245 /* Compute an explicit representation for all the existentially
6246 * quantified variables.
6247 * The input and output dimensions are first turned into parameters.
6248 * compute_divs then returns a map with the same parameters and
6249 * no input or output dimensions and the dimension specification
6250 * is reset to that of the input.
6252 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
6254 struct isl_basic_set *bset;
6255 struct isl_set *set;
6256 struct isl_map *map;
6257 isl_space *dim, *orig_dim = NULL;
6262 bmap = isl_basic_map_cow(bmap);
6266 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6267 n_in = isl_basic_map_dim(bmap, isl_dim_in);
6268 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6269 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
6273 orig_dim = bmap->dim;
6275 bset = (struct isl_basic_set *)bmap;
6277 set = parameter_compute_divs(bset);
6278 map = (struct isl_map *)set;
6279 map = isl_map_reset_space(map, orig_dim);
6283 isl_basic_map_free(bmap);
6287 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
6295 off = isl_space_dim(bmap->dim, isl_dim_all);
6296 for (i = 0; i < bmap->n_div; ++i) {
6297 if (isl_int_is_zero(bmap->div[i][0]))
6299 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
6305 static int map_divs_known(__isl_keep isl_map *map)
6312 for (i = 0; i < map->n; ++i) {
6313 int known = isl_basic_map_divs_known(map->p[i]);
6321 /* If bmap contains any unknown divs, then compute explicit
6322 * expressions for them. However, this computation may be
6323 * quite expensive, so first try to remove divs that aren't
6326 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
6329 struct isl_map *map;
6331 known = isl_basic_map_divs_known(bmap);
6335 return isl_map_from_basic_map(bmap);
6337 bmap = isl_basic_map_drop_redundant_divs(bmap);
6339 known = isl_basic_map_divs_known(bmap);
6343 return isl_map_from_basic_map(bmap);
6345 map = compute_divs(bmap);
6348 isl_basic_map_free(bmap);
6352 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6356 struct isl_map *res;
6363 known = map_divs_known(map);
6371 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6372 for (i = 1 ; i < map->n; ++i) {
6374 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6375 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6376 res = isl_map_union_disjoint(res, r2);
6378 res = isl_map_union(res, r2);
6385 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6387 return (struct isl_set *)
6388 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6391 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6393 return (struct isl_set *)
6394 isl_map_compute_divs((struct isl_map *)set);
6397 struct isl_set *isl_map_domain(struct isl_map *map)
6400 struct isl_set *set;
6405 map = isl_map_cow(map);
6409 set = (struct isl_set *)map;
6410 set->dim = isl_space_domain(set->dim);
6413 for (i = 0; i < map->n; ++i) {
6414 set->p[i] = isl_basic_map_domain(map->p[i]);
6418 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6419 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6426 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6427 __isl_take isl_map *map2)
6431 struct isl_map *map = NULL;
6445 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6447 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6448 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6449 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6451 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6452 map1->n + map2->n, flags);
6455 for (i = 0; i < map1->n; ++i) {
6456 map = isl_map_add_basic_map(map,
6457 isl_basic_map_copy(map1->p[i]));
6461 for (i = 0; i < map2->n; ++i) {
6462 map = isl_map_add_basic_map(map,
6463 isl_basic_map_copy(map2->p[i]));
6477 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6478 __isl_take isl_map *map2)
6480 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6483 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6485 map1 = isl_map_union_disjoint(map1, map2);
6489 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6493 struct isl_set *isl_set_union_disjoint(
6494 struct isl_set *set1, struct isl_set *set2)
6496 return (struct isl_set *)
6497 isl_map_union_disjoint(
6498 (struct isl_map *)set1, (struct isl_map *)set2);
6501 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6503 return (struct isl_set *)
6504 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6507 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6508 __isl_take isl_set *set)
6511 struct isl_map *result;
6517 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6518 isl_die(set->ctx, isl_error_invalid,
6519 "parameters don't match", goto error);
6521 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6522 !isl_map_compatible_range(map, set))
6523 isl_die(set->ctx, isl_error_invalid,
6524 "incompatible spaces", goto error);
6526 if (isl_set_plain_is_universe(set)) {
6531 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6532 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6533 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6535 result = isl_map_alloc_space(isl_space_copy(map->dim),
6536 map->n * set->n, flags);
6539 for (i = 0; i < map->n; ++i)
6540 for (j = 0; j < set->n; ++j) {
6541 result = isl_map_add_basic_map(result,
6542 isl_basic_map_intersect_range(
6543 isl_basic_map_copy(map->p[i]),
6544 isl_basic_set_copy(set->p[j])));
6557 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6558 __isl_take isl_set *set)
6560 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6563 struct isl_map *isl_map_intersect_domain(
6564 struct isl_map *map, struct isl_set *set)
6566 return isl_map_reverse(
6567 isl_map_intersect_range(isl_map_reverse(map), set));
6570 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6571 __isl_take isl_map *map2)
6575 map1 = isl_map_reverse(map1);
6576 map1 = isl_map_apply_range(map1, map2);
6577 return isl_map_reverse(map1);
6584 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6585 __isl_take isl_map *map2)
6587 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6590 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6591 __isl_take isl_map *map2)
6593 isl_space *dim_result;
6594 struct isl_map *result;
6600 dim_result = isl_space_join(isl_space_copy(map1->dim),
6601 isl_space_copy(map2->dim));
6603 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6606 for (i = 0; i < map1->n; ++i)
6607 for (j = 0; j < map2->n; ++j) {
6608 result = isl_map_add_basic_map(result,
6609 isl_basic_map_apply_range(
6610 isl_basic_map_copy(map1->p[i]),
6611 isl_basic_map_copy(map2->p[j])));
6617 if (result && result->n <= 1)
6618 ISL_F_SET(result, ISL_MAP_DISJOINT);
6626 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6627 __isl_take isl_map *map2)
6629 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6633 * returns range - domain
6635 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6637 isl_space *dims, *target_dim;
6638 struct isl_basic_set *bset;
6645 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6646 bmap->dim, isl_dim_out),
6648 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6649 dim = isl_basic_map_n_in(bmap);
6650 nparam = isl_basic_map_n_param(bmap);
6651 bset = isl_basic_set_from_basic_map(bmap);
6652 bset = isl_basic_set_cow(bset);
6653 dims = isl_basic_set_get_space(bset);
6654 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6655 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6656 bset = isl_basic_set_swap_vars(bset, 2*dim);
6657 for (i = 0; i < dim; ++i) {
6658 int j = isl_basic_map_alloc_equality(
6659 (struct isl_basic_map *)bset);
6662 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6663 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6664 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6665 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6667 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6668 bset = isl_basic_set_reset_space(bset, target_dim);
6671 isl_basic_map_free(bmap);
6676 * returns range - domain
6678 __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map)
6682 struct isl_set *result;
6687 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6688 map->dim, isl_dim_out),
6690 dim = isl_map_get_space(map);
6691 dim = isl_space_domain(dim);
6692 result = isl_set_alloc_space(dim, map->n, 0);
6695 for (i = 0; i < map->n; ++i)
6696 result = isl_set_add_basic_set(result,
6697 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6706 * returns [domain -> range] -> range - domain
6708 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6709 __isl_take isl_basic_map *bmap)
6713 isl_basic_map *domain;
6717 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6718 isl_die(bmap->ctx, isl_error_invalid,
6719 "domain and range don't match", goto error);
6721 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6722 n = isl_basic_map_dim(bmap, isl_dim_in);
6724 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6725 domain = isl_basic_map_universe(dim);
6727 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6728 bmap = isl_basic_map_apply_range(bmap, domain);
6729 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6731 total = isl_basic_map_total_dim(bmap);
6733 for (i = 0; i < n; ++i) {
6734 k = isl_basic_map_alloc_equality(bmap);
6737 isl_seq_clr(bmap->eq[k], 1 + total);
6738 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6739 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6740 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6743 bmap = isl_basic_map_gauss(bmap, NULL);
6744 return isl_basic_map_finalize(bmap);
6746 isl_basic_map_free(bmap);
6751 * returns [domain -> range] -> range - domain
6753 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6756 isl_space *domain_dim;
6761 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6762 isl_die(map->ctx, isl_error_invalid,
6763 "domain and range don't match", goto error);
6765 map = isl_map_cow(map);
6769 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6770 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6771 map->dim = isl_space_join(map->dim, domain_dim);
6774 for (i = 0; i < map->n; ++i) {
6775 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6779 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6786 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6788 struct isl_basic_map *bmap;
6796 nparam = dims->nparam;
6798 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6802 for (i = 0; i < dim; ++i) {
6803 int j = isl_basic_map_alloc_equality(bmap);
6806 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6807 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6808 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6810 return isl_basic_map_finalize(bmap);
6812 isl_basic_map_free(bmap);
6816 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6820 if (dim->n_in != dim->n_out)
6821 isl_die(dim->ctx, isl_error_invalid,
6822 "number of input and output dimensions needs to be "
6823 "the same", goto error);
6824 return basic_map_identity(dim);
6826 isl_space_free(dim);
6830 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6832 if (!model || !model->dim)
6834 return isl_basic_map_identity(isl_space_copy(model->dim));
6837 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6839 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6842 struct isl_map *isl_map_identity_like(struct isl_map *model)
6844 if (!model || !model->dim)
6846 return isl_map_identity(isl_space_copy(model->dim));
6849 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6851 if (!model || !model->dim)
6853 return isl_map_identity(isl_space_copy(model->dim));
6856 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6858 isl_space *dim = isl_set_get_space(set);
6860 id = isl_map_identity(isl_space_map_from_set(dim));
6861 return isl_map_intersect_range(id, set);
6864 /* Construct a basic set with all set dimensions having only non-negative
6867 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6868 __isl_take isl_space *space)
6873 struct isl_basic_set *bset;
6877 nparam = space->nparam;
6879 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6882 for (i = 0; i < dim; ++i) {
6883 int k = isl_basic_set_alloc_inequality(bset);
6886 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6887 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6891 isl_basic_set_free(bset);
6895 /* Construct the half-space x_pos >= 0.
6897 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6901 isl_basic_set *nonneg;
6903 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6904 k = isl_basic_set_alloc_inequality(nonneg);
6907 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6908 isl_int_set_si(nonneg->ineq[k][pos], 1);
6910 return isl_basic_set_finalize(nonneg);
6912 isl_basic_set_free(nonneg);
6916 /* Construct the half-space x_pos <= -1.
6918 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6923 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6924 k = isl_basic_set_alloc_inequality(neg);
6927 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6928 isl_int_set_si(neg->ineq[k][0], -1);
6929 isl_int_set_si(neg->ineq[k][pos], -1);
6931 return isl_basic_set_finalize(neg);
6933 isl_basic_set_free(neg);
6937 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6938 enum isl_dim_type type, unsigned first, unsigned n)
6941 isl_basic_set *nonneg;
6949 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6951 for (i = 0; i < n; ++i) {
6952 nonneg = nonneg_halfspace(isl_set_get_space(set),
6953 pos(set->dim, type) + first + i);
6954 neg = neg_halfspace(isl_set_get_space(set),
6955 pos(set->dim, type) + first + i);
6957 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6966 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6967 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6974 if (isl_set_plain_is_empty(set)) {
6979 return fn(set, signs, user);
6982 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6984 half = isl_set_intersect(half, isl_set_copy(set));
6985 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6989 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6991 half = isl_set_intersect(half, set);
6992 return foreach_orthant(half, signs, first + 1, len, fn, user);
6998 /* Call "fn" on the intersections of "set" with each of the orthants
6999 * (except for obviously empty intersections). The orthant is identified
7000 * by the signs array, with each entry having value 1 or -1 according
7001 * to the sign of the corresponding variable.
7003 int isl_set_foreach_orthant(__isl_keep isl_set *set,
7004 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7014 if (isl_set_plain_is_empty(set))
7017 nparam = isl_set_dim(set, isl_dim_param);
7018 nvar = isl_set_dim(set, isl_dim_set);
7020 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
7022 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
7030 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
7032 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
7035 int isl_basic_map_is_subset(
7036 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7039 struct isl_map *map1;
7040 struct isl_map *map2;
7042 if (!bmap1 || !bmap2)
7045 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
7046 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
7048 is_subset = isl_map_is_subset(map1, map2);
7056 int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
7057 __isl_keep isl_basic_set *bset2)
7059 return isl_basic_map_is_subset(bset1, bset2);
7062 int isl_basic_map_is_equal(
7063 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7067 if (!bmap1 || !bmap2)
7069 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7072 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7076 int isl_basic_set_is_equal(
7077 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7079 return isl_basic_map_is_equal(
7080 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
7083 int isl_map_is_empty(struct isl_map *map)
7090 for (i = 0; i < map->n; ++i) {
7091 is_empty = isl_basic_map_is_empty(map->p[i]);
7100 int isl_map_plain_is_empty(__isl_keep isl_map *map)
7102 return map ? map->n == 0 : -1;
7105 int isl_map_fast_is_empty(__isl_keep isl_map *map)
7107 return isl_map_plain_is_empty(map);
7110 int isl_set_plain_is_empty(struct isl_set *set)
7112 return set ? set->n == 0 : -1;
7115 int isl_set_fast_is_empty(__isl_keep isl_set *set)
7117 return isl_set_plain_is_empty(set);
7120 int isl_set_is_empty(struct isl_set *set)
7122 return isl_map_is_empty((struct isl_map *)set);
7125 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7130 return isl_space_is_equal(map1->dim, map2->dim);
7133 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7138 return isl_space_is_equal(set1->dim, set2->dim);
7141 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7147 is_subset = isl_map_is_subset(map1, map2);
7150 is_subset = isl_map_is_subset(map2, map1);
7154 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7156 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
7159 int isl_basic_map_is_strict_subset(
7160 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7164 if (!bmap1 || !bmap2)
7166 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7169 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7170 if (is_subset == -1)
7175 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
7181 is_subset = isl_map_is_subset(map1, map2);
7184 is_subset = isl_map_is_subset(map2, map1);
7185 if (is_subset == -1)
7190 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7192 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
7195 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
7199 return bmap->n_eq == 0 && bmap->n_ineq == 0;
7202 int isl_basic_set_is_universe(struct isl_basic_set *bset)
7206 return bset->n_eq == 0 && bset->n_ineq == 0;
7209 int isl_map_plain_is_universe(__isl_keep isl_map *map)
7216 for (i = 0; i < map->n; ++i) {
7217 int r = isl_basic_map_is_universe(map->p[i]);
7225 int isl_set_plain_is_universe(__isl_keep isl_set *set)
7227 return isl_map_plain_is_universe((isl_map *) set);
7230 int isl_set_fast_is_universe(__isl_keep isl_set *set)
7232 return isl_set_plain_is_universe(set);
7235 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
7237 struct isl_basic_set *bset = NULL;
7238 struct isl_vec *sample = NULL;
7245 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
7248 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
7249 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
7250 copy = isl_basic_map_remove_redundancies(copy);
7251 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
7252 isl_basic_map_free(copy);
7256 total = 1 + isl_basic_map_total_dim(bmap);
7257 if (bmap->sample && bmap->sample->size == total) {
7258 int contains = isl_basic_map_contains(bmap, bmap->sample);
7264 isl_vec_free(bmap->sample);
7265 bmap->sample = NULL;
7266 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
7269 sample = isl_basic_set_sample_vec(bset);
7272 empty = sample->size == 0;
7273 isl_vec_free(bmap->sample);
7274 bmap->sample = sample;
7276 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
7281 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
7285 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
7288 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
7290 return isl_basic_map_plain_is_empty(bmap);
7293 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
7297 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
7300 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
7302 return isl_basic_set_plain_is_empty(bset);
7305 int isl_basic_set_is_empty(struct isl_basic_set *bset)
7307 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
7310 struct isl_map *isl_basic_map_union(
7311 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7313 struct isl_map *map;
7314 if (!bmap1 || !bmap2)
7317 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
7319 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
7322 map = isl_map_add_basic_map(map, bmap1);
7323 map = isl_map_add_basic_map(map, bmap2);
7326 isl_basic_map_free(bmap1);
7327 isl_basic_map_free(bmap2);
7331 struct isl_set *isl_basic_set_union(
7332 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7334 return (struct isl_set *)isl_basic_map_union(
7335 (struct isl_basic_map *)bset1,
7336 (struct isl_basic_map *)bset2);
7339 /* Order divs such that any div only depends on previous divs */
7340 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
7348 off = isl_space_dim(bmap->dim, isl_dim_all);
7350 for (i = 0; i < bmap->n_div; ++i) {
7352 if (isl_int_is_zero(bmap->div[i][0]))
7354 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
7358 isl_basic_map_swap_div(bmap, i, i + pos);
7364 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7366 return (struct isl_basic_set *)
7367 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7370 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7377 for (i = 0; i < map->n; ++i) {
7378 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7389 /* Apply the expansion computed by isl_merge_divs.
7390 * The expansion itself is given by "exp" while the resulting
7391 * list of divs is given by "div".
7393 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7394 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7399 bset = isl_basic_set_cow(bset);
7403 if (div->n_row < bset->n_div)
7404 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7405 "not an expansion", goto error);
7407 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7408 div->n_row - bset->n_div, 0,
7409 2 * (div->n_row - bset->n_div));
7411 n_div = bset->n_div;
7412 for (i = n_div; i < div->n_row; ++i)
7413 if (isl_basic_set_alloc_div(bset) < 0)
7417 for (i = div->n_row - 1; i >= 0; --i) {
7418 if (j >= 0 && exp[j] == i) {
7420 isl_basic_map_swap_div(bset, i, j);
7423 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7424 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7432 isl_basic_set_free(bset);
7437 /* Look for a div in dst that corresponds to the div "div" in src.
7438 * The divs before "div" in src and dst are assumed to be the same.
7440 * Returns -1 if no corresponding div was found and the position
7441 * of the corresponding div in dst otherwise.
7443 static int find_div(struct isl_basic_map *dst,
7444 struct isl_basic_map *src, unsigned div)
7448 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7450 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7451 for (i = div; i < dst->n_div; ++i)
7452 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7453 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7454 dst->n_div - div) == -1)
7459 struct isl_basic_map *isl_basic_map_align_divs(
7460 struct isl_basic_map *dst, struct isl_basic_map *src)
7463 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7468 if (src->n_div == 0)
7471 for (i = 0; i < src->n_div; ++i)
7472 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7474 src = isl_basic_map_order_divs(src);
7475 dst = isl_basic_map_cow(dst);
7476 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7477 src->n_div, 0, 2 * src->n_div);
7480 for (i = 0; i < src->n_div; ++i) {
7481 int j = find_div(dst, src, i);
7483 j = isl_basic_map_alloc_div(dst);
7486 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7487 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7488 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7492 isl_basic_map_swap_div(dst, i, j);
7496 isl_basic_map_free(dst);
7500 struct isl_basic_set *isl_basic_set_align_divs(
7501 struct isl_basic_set *dst, struct isl_basic_set *src)
7503 return (struct isl_basic_set *)isl_basic_map_align_divs(
7504 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7507 struct isl_map *isl_map_align_divs(struct isl_map *map)
7515 map = isl_map_compute_divs(map);
7516 map = isl_map_cow(map);
7520 for (i = 1; i < map->n; ++i)
7521 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7522 for (i = 1; i < map->n; ++i)
7523 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7525 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7529 struct isl_set *isl_set_align_divs(struct isl_set *set)
7531 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7534 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7535 __isl_take isl_map *map)
7539 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7540 map = isl_map_intersect_domain(map, set);
7541 set = isl_map_range(map);
7549 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7550 __isl_take isl_map *map)
7552 return isl_map_align_params_map_map_and(set, map, &set_apply);
7555 /* There is no need to cow as removing empty parts doesn't change
7556 * the meaning of the set.
7558 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7565 for (i = map->n - 1; i >= 0; --i)
7566 remove_if_empty(map, i);
7571 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7573 return (struct isl_set *)
7574 isl_map_remove_empty_parts((struct isl_map *)set);
7577 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7579 struct isl_basic_map *bmap;
7580 if (!map || map->n == 0)
7582 bmap = map->p[map->n-1];
7583 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7584 return isl_basic_map_copy(bmap);
7587 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7589 return (struct isl_basic_set *)
7590 isl_map_copy_basic_map((struct isl_map *)set);
7593 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7594 __isl_keep isl_basic_map *bmap)
7600 for (i = map->n-1; i >= 0; --i) {
7601 if (map->p[i] != bmap)
7603 map = isl_map_cow(map);
7606 isl_basic_map_free(map->p[i]);
7607 if (i != map->n-1) {
7608 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7609 map->p[i] = map->p[map->n-1];
7620 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7621 struct isl_basic_set *bset)
7623 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7624 (struct isl_basic_map *)bset);
7627 /* Given two basic sets bset1 and bset2, compute the maximal difference
7628 * between the values of dimension pos in bset1 and those in bset2
7629 * for any common value of the parameters and dimensions preceding pos.
7631 static enum isl_lp_result basic_set_maximal_difference_at(
7632 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7633 int pos, isl_int *opt)
7636 struct isl_basic_map *bmap1 = NULL;
7637 struct isl_basic_map *bmap2 = NULL;
7638 struct isl_ctx *ctx;
7639 struct isl_vec *obj;
7642 unsigned dim1, dim2;
7643 enum isl_lp_result res;
7645 if (!bset1 || !bset2)
7646 return isl_lp_error;
7648 nparam = isl_basic_set_n_param(bset1);
7649 dim1 = isl_basic_set_n_dim(bset1);
7650 dim2 = isl_basic_set_n_dim(bset2);
7651 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7652 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7653 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7654 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7655 if (!bmap1 || !bmap2)
7657 bmap1 = isl_basic_map_cow(bmap1);
7658 bmap1 = isl_basic_map_extend(bmap1, nparam,
7659 pos, (dim1 - pos) + (dim2 - pos),
7660 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7661 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7664 total = isl_basic_map_total_dim(bmap1);
7666 obj = isl_vec_alloc(ctx, 1 + total);
7667 isl_seq_clr(obj->block.data, 1 + total);
7668 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7669 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7672 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7674 isl_basic_map_free(bmap1);
7678 isl_basic_map_free(bmap1);
7679 isl_basic_map_free(bmap2);
7680 return isl_lp_error;
7683 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7684 * for any common value of the parameters and dimensions preceding pos
7685 * in both basic sets, the values of dimension pos in bset1 are
7686 * smaller or larger than those in bset2.
7689 * 1 if bset1 follows bset2
7690 * -1 if bset1 precedes bset2
7691 * 0 if bset1 and bset2 are incomparable
7692 * -2 if some error occurred.
7694 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7695 struct isl_basic_set *bset2, int pos)
7698 enum isl_lp_result res;
7703 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7705 if (res == isl_lp_empty)
7707 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7708 res == isl_lp_unbounded)
7710 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7719 /* Given two basic sets bset1 and bset2, check whether
7720 * for any common value of the parameters and dimensions preceding pos
7721 * there is a value of dimension pos in bset1 that is larger
7722 * than a value of the same dimension in bset2.
7725 * 1 if there exists such a pair
7726 * 0 if there is no such pair, but there is a pair of equal values
7728 * -2 if some error occurred.
7730 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7731 __isl_keep isl_basic_set *bset2, int pos)
7734 enum isl_lp_result res;
7739 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7741 if (res == isl_lp_empty)
7743 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7744 res == isl_lp_unbounded)
7746 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7748 else if (res == isl_lp_ok)
7757 /* Given two sets set1 and set2, check whether
7758 * for any common value of the parameters and dimensions preceding pos
7759 * there is a value of dimension pos in set1 that is larger
7760 * than a value of the same dimension in set2.
7763 * 1 if there exists such a pair
7764 * 0 if there is no such pair, but there is a pair of equal values
7766 * -2 if some error occurred.
7768 int isl_set_follows_at(__isl_keep isl_set *set1,
7769 __isl_keep isl_set *set2, int pos)
7777 for (i = 0; i < set1->n; ++i)
7778 for (j = 0; j < set2->n; ++j) {
7780 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7781 if (f == 1 || f == -2)
7790 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7791 unsigned pos, isl_int *val)
7799 total = isl_basic_map_total_dim(bmap);
7800 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7801 for (; d+1 > pos; --d)
7802 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7806 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7808 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7810 if (!isl_int_is_one(bmap->eq[i][1+d]))
7813 isl_int_neg(*val, bmap->eq[i][0]);
7819 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7820 unsigned pos, isl_int *val)
7832 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7835 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7836 for (i = 1; fixed == 1 && i < map->n; ++i) {
7837 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7838 if (fixed == 1 && isl_int_ne(tmp, v))
7842 isl_int_set(*val, v);
7848 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7849 unsigned pos, isl_int *val)
7851 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7855 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7858 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7861 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7862 enum isl_dim_type type, unsigned pos, isl_int *val)
7864 if (pos >= isl_basic_map_dim(bmap, type))
7866 return isl_basic_map_plain_has_fixed_var(bmap,
7867 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7870 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7871 enum isl_dim_type type, unsigned pos, isl_int *val)
7873 if (pos >= isl_map_dim(map, type))
7875 return isl_map_plain_has_fixed_var(map,
7876 map_offset(map, type) - 1 + pos, val);
7879 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7880 enum isl_dim_type type, unsigned pos, isl_int *val)
7882 return isl_map_plain_is_fixed(set, type, pos, val);
7885 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7886 enum isl_dim_type type, unsigned pos, isl_int *val)
7888 return isl_map_plain_is_fixed(map, type, pos, val);
7891 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7892 * then return this fixed value in *val.
7894 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7895 unsigned dim, isl_int *val)
7897 return isl_basic_set_plain_has_fixed_var(bset,
7898 isl_basic_set_n_param(bset) + dim, val);
7901 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7902 * then return this fixed value in *val.
7904 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7905 unsigned dim, isl_int *val)
7907 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7910 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7911 unsigned dim, isl_int *val)
7913 return isl_set_plain_dim_is_fixed(set, dim, val);
7916 /* Check if input variable in has fixed value and if so and if val is not NULL,
7917 * then return this fixed value in *val.
7919 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7920 unsigned in, isl_int *val)
7922 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7925 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7926 * and if val is not NULL, then return this lower bound in *val.
7928 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7929 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7931 int i, i_eq = -1, i_ineq = -1;
7938 total = isl_basic_set_total_dim(bset);
7939 nparam = isl_basic_set_n_param(bset);
7940 for (i = 0; i < bset->n_eq; ++i) {
7941 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7947 for (i = 0; i < bset->n_ineq; ++i) {
7948 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7950 if (i_eq != -1 || i_ineq != -1)
7954 if (i_eq == -1 && i_ineq == -1)
7956 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7957 /* The coefficient should always be one due to normalization. */
7958 if (!isl_int_is_one(c[1+nparam+dim]))
7960 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7962 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7963 total - nparam - dim - 1) != -1)
7966 isl_int_neg(*val, c[0]);
7970 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7971 unsigned dim, isl_int *val)
7983 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7987 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7989 for (i = 1; fixed == 1 && i < set->n; ++i) {
7990 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7992 if (fixed == 1 && isl_int_ne(tmp, v))
7996 isl_int_set(*val, v);
8007 /* uset_gist depends on constraints without existentially quantified
8008 * variables sorting first.
8010 static int qsort_constraint_cmp(const void *p1, const void *p2)
8012 const struct constraint *c1 = (const struct constraint *)p1;
8013 const struct constraint *c2 = (const struct constraint *)p2;
8015 unsigned size = isl_min(c1->size, c2->size);
8017 l1 = isl_seq_last_non_zero(c1->c, size);
8018 l2 = isl_seq_last_non_zero(c2->c, size);
8023 return isl_seq_cmp(c1->c, c2->c, size);
8026 static struct isl_basic_map *isl_basic_map_sort_constraints(
8027 struct isl_basic_map *bmap)
8030 struct constraint *c;
8035 total = isl_basic_map_total_dim(bmap);
8036 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
8039 for (i = 0; i < bmap->n_ineq; ++i) {
8041 c[i].c = bmap->ineq[i];
8043 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
8044 for (i = 0; i < bmap->n_ineq; ++i)
8045 bmap->ineq[i] = c[i].c;
8049 isl_basic_map_free(bmap);
8053 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
8054 __isl_take isl_basic_set *bset)
8056 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
8057 (struct isl_basic_map *)bset);
8060 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
8064 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
8066 bmap = isl_basic_map_remove_redundancies(bmap);
8067 bmap = isl_basic_map_sort_constraints(bmap);
8068 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
8072 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
8074 return (struct isl_basic_set *)isl_basic_map_normalize(
8075 (struct isl_basic_map *)bset);
8078 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
8079 const __isl_keep isl_basic_map *bmap2)
8086 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
8087 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
8088 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
8089 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
8090 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
8091 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
8092 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8093 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
8094 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8095 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
8096 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8098 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
8100 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8102 if (bmap1->n_eq != bmap2->n_eq)
8103 return bmap1->n_eq - bmap2->n_eq;
8104 if (bmap1->n_ineq != bmap2->n_ineq)
8105 return bmap1->n_ineq - bmap2->n_ineq;
8106 if (bmap1->n_div != bmap2->n_div)
8107 return bmap1->n_div - bmap2->n_div;
8108 total = isl_basic_map_total_dim(bmap1);
8109 for (i = 0; i < bmap1->n_eq; ++i) {
8110 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
8114 for (i = 0; i < bmap1->n_ineq; ++i) {
8115 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
8119 for (i = 0; i < bmap1->n_div; ++i) {
8120 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
8127 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
8128 const __isl_keep isl_basic_set *bset2)
8130 return isl_basic_map_plain_cmp(bset1, bset2);
8133 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
8134 const __isl_keep isl_set *set2)
8140 if (set1->n != set2->n)
8141 return set1->n - set2->n;
8143 for (i = 0; i < set1->n; ++i) {
8144 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
8152 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
8153 __isl_keep isl_basic_map *bmap2)
8155 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
8158 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
8159 __isl_keep isl_basic_set *bset2)
8161 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
8162 (isl_basic_map *)bset2);
8165 static int qsort_bmap_cmp(const void *p1, const void *p2)
8167 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
8168 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
8170 return isl_basic_map_plain_cmp(bmap1, bmap2);
8173 /* We normalize in place, but if anything goes wrong we need
8174 * to return NULL, so we need to make sure we don't change the
8175 * meaning of any possible other copies of map.
8177 struct isl_map *isl_map_normalize(struct isl_map *map)
8180 struct isl_basic_map *bmap;
8184 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
8186 for (i = 0; i < map->n; ++i) {
8187 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
8190 isl_basic_map_free(map->p[i]);
8193 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
8194 ISL_F_SET(map, ISL_MAP_NORMALIZED);
8195 map = isl_map_remove_empty_parts(map);
8198 for (i = map->n - 1; i >= 1; --i) {
8199 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
8201 isl_basic_map_free(map->p[i-1]);
8202 for (j = i; j < map->n; ++j)
8203 map->p[j-1] = map->p[j];
8213 struct isl_set *isl_set_normalize(struct isl_set *set)
8215 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
8218 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8228 if (!isl_space_is_equal(map1->dim, map2->dim))
8231 map1 = isl_map_copy(map1);
8232 map2 = isl_map_copy(map2);
8233 map1 = isl_map_normalize(map1);
8234 map2 = isl_map_normalize(map2);
8237 equal = map1->n == map2->n;
8238 for (i = 0; equal && i < map1->n; ++i) {
8239 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
8252 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8254 return isl_map_plain_is_equal(map1, map2);
8257 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8259 return isl_map_plain_is_equal((struct isl_map *)set1,
8260 (struct isl_map *)set2);
8263 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8265 return isl_set_plain_is_equal(set1, set2);
8268 /* Return an interval that ranges from min to max (inclusive)
8270 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
8271 isl_int min, isl_int max)
8274 struct isl_basic_set *bset = NULL;
8276 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
8280 k = isl_basic_set_alloc_inequality(bset);
8283 isl_int_set_si(bset->ineq[k][1], 1);
8284 isl_int_neg(bset->ineq[k][0], min);
8286 k = isl_basic_set_alloc_inequality(bset);
8289 isl_int_set_si(bset->ineq[k][1], -1);
8290 isl_int_set(bset->ineq[k][0], max);
8294 isl_basic_set_free(bset);
8298 /* Return the Cartesian product of the basic sets in list (in the given order).
8300 __isl_give isl_basic_set *isl_basic_set_list_product(
8301 __isl_take struct isl_basic_set_list *list)
8309 struct isl_basic_set *product = NULL;
8313 isl_assert(list->ctx, list->n > 0, goto error);
8314 isl_assert(list->ctx, list->p[0], goto error);
8315 nparam = isl_basic_set_n_param(list->p[0]);
8316 dim = isl_basic_set_n_dim(list->p[0]);
8317 extra = list->p[0]->n_div;
8318 n_eq = list->p[0]->n_eq;
8319 n_ineq = list->p[0]->n_ineq;
8320 for (i = 1; i < list->n; ++i) {
8321 isl_assert(list->ctx, list->p[i], goto error);
8322 isl_assert(list->ctx,
8323 nparam == isl_basic_set_n_param(list->p[i]), goto error);
8324 dim += isl_basic_set_n_dim(list->p[i]);
8325 extra += list->p[i]->n_div;
8326 n_eq += list->p[i]->n_eq;
8327 n_ineq += list->p[i]->n_ineq;
8329 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
8334 for (i = 0; i < list->n; ++i) {
8335 isl_basic_set_add_constraints(product,
8336 isl_basic_set_copy(list->p[i]), dim);
8337 dim += isl_basic_set_n_dim(list->p[i]);
8339 isl_basic_set_list_free(list);
8342 isl_basic_set_free(product);
8343 isl_basic_set_list_free(list);
8347 struct isl_basic_map *isl_basic_map_product(
8348 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
8350 isl_space *dim_result = NULL;
8351 struct isl_basic_map *bmap;
8352 unsigned in1, in2, out1, out2, nparam, total, pos;
8353 struct isl_dim_map *dim_map1, *dim_map2;
8355 if (!bmap1 || !bmap2)
8358 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8359 bmap2->dim, isl_dim_param), goto error);
8360 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8361 isl_space_copy(bmap2->dim));
8363 in1 = isl_basic_map_n_in(bmap1);
8364 in2 = isl_basic_map_n_in(bmap2);
8365 out1 = isl_basic_map_n_out(bmap1);
8366 out2 = isl_basic_map_n_out(bmap2);
8367 nparam = isl_basic_map_n_param(bmap1);
8369 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8370 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8371 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8372 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8373 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8374 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8375 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8376 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8377 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8378 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8379 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8381 bmap = isl_basic_map_alloc_space(dim_result,
8382 bmap1->n_div + bmap2->n_div,
8383 bmap1->n_eq + bmap2->n_eq,
8384 bmap1->n_ineq + bmap2->n_ineq);
8385 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8386 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8387 bmap = isl_basic_map_simplify(bmap);
8388 return isl_basic_map_finalize(bmap);
8390 isl_basic_map_free(bmap1);
8391 isl_basic_map_free(bmap2);
8395 __isl_give isl_basic_map *isl_basic_map_flat_product(
8396 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8398 isl_basic_map *prod;
8400 prod = isl_basic_map_product(bmap1, bmap2);
8401 prod = isl_basic_map_flatten(prod);
8405 __isl_give isl_basic_set *isl_basic_set_flat_product(
8406 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8408 return isl_basic_map_flat_range_product(bset1, bset2);
8411 __isl_give isl_basic_map *isl_basic_map_domain_product(
8412 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8414 isl_space *space_result = NULL;
8415 isl_basic_map *bmap;
8416 unsigned in1, in2, out, nparam, total, pos;
8417 struct isl_dim_map *dim_map1, *dim_map2;
8419 if (!bmap1 || !bmap2)
8422 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8423 isl_space_copy(bmap2->dim));
8425 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8426 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8427 out = isl_basic_map_dim(bmap1, isl_dim_out);
8428 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8430 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8431 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8432 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8433 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8434 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8435 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8436 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8437 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8438 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8439 isl_dim_map_div(dim_map1, bmap1, pos += out);
8440 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8442 bmap = isl_basic_map_alloc_space(space_result,
8443 bmap1->n_div + bmap2->n_div,
8444 bmap1->n_eq + bmap2->n_eq,
8445 bmap1->n_ineq + bmap2->n_ineq);
8446 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8447 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8448 bmap = isl_basic_map_simplify(bmap);
8449 return isl_basic_map_finalize(bmap);
8451 isl_basic_map_free(bmap1);
8452 isl_basic_map_free(bmap2);
8456 __isl_give isl_basic_map *isl_basic_map_range_product(
8457 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8459 isl_space *dim_result = NULL;
8460 isl_basic_map *bmap;
8461 unsigned in, out1, out2, nparam, total, pos;
8462 struct isl_dim_map *dim_map1, *dim_map2;
8464 if (!bmap1 || !bmap2)
8467 if (!isl_space_match(bmap1->dim, isl_dim_param,
8468 bmap2->dim, isl_dim_param))
8469 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
8470 "parameters don't match", goto error);
8472 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8473 isl_space_copy(bmap2->dim));
8475 in = isl_basic_map_dim(bmap1, isl_dim_in);
8476 out1 = isl_basic_map_n_out(bmap1);
8477 out2 = isl_basic_map_n_out(bmap2);
8478 nparam = isl_basic_map_n_param(bmap1);
8480 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8481 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8482 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8483 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8484 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8485 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8486 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8487 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8488 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8489 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8490 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8492 bmap = isl_basic_map_alloc_space(dim_result,
8493 bmap1->n_div + bmap2->n_div,
8494 bmap1->n_eq + bmap2->n_eq,
8495 bmap1->n_ineq + bmap2->n_ineq);
8496 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8497 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8498 bmap = isl_basic_map_simplify(bmap);
8499 return isl_basic_map_finalize(bmap);
8501 isl_basic_map_free(bmap1);
8502 isl_basic_map_free(bmap2);
8506 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8507 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8509 isl_basic_map *prod;
8511 prod = isl_basic_map_range_product(bmap1, bmap2);
8512 prod = isl_basic_map_flatten_range(prod);
8516 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8517 __isl_take isl_map *map2,
8518 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8519 __isl_take isl_space *right),
8520 __isl_give isl_basic_map *(*basic_map_product)(
8521 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8524 struct isl_map *result;
8530 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8531 map2->dim, isl_dim_param), goto error);
8533 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8534 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8535 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8537 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8538 isl_space_copy(map2->dim)),
8539 map1->n * map2->n, flags);
8542 for (i = 0; i < map1->n; ++i)
8543 for (j = 0; j < map2->n; ++j) {
8544 struct isl_basic_map *part;
8545 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8546 isl_basic_map_copy(map2->p[j]));
8547 if (isl_basic_map_is_empty(part))
8548 isl_basic_map_free(part);
8550 result = isl_map_add_basic_map(result, part);
8563 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8565 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8566 __isl_take isl_map *map2)
8568 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8571 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8572 __isl_take isl_map *map2)
8574 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8577 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8579 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8580 __isl_take isl_map *map2)
8584 prod = isl_map_product(map1, map2);
8585 prod = isl_map_flatten(prod);
8589 /* Given two set A and B, construct its Cartesian product A x B.
8591 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8593 return isl_map_range_product(set1, set2);
8596 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8597 __isl_take isl_set *set2)
8599 return isl_map_flat_range_product(set1, set2);
8602 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8604 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8605 __isl_take isl_map *map2)
8607 return map_product(map1, map2, &isl_space_domain_product,
8608 &isl_basic_map_domain_product);
8611 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8613 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8614 __isl_take isl_map *map2)
8616 return map_product(map1, map2, &isl_space_range_product,
8617 &isl_basic_map_range_product);
8620 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8621 __isl_take isl_map *map2)
8623 return isl_map_align_params_map_map_and(map1, map2,
8624 &map_domain_product_aligned);
8627 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8628 __isl_take isl_map *map2)
8630 return isl_map_align_params_map_map_and(map1, map2,
8631 &map_range_product_aligned);
8634 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8636 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8637 __isl_take isl_map *map2)
8641 prod = isl_map_domain_product(map1, map2);
8642 prod = isl_map_flatten_domain(prod);
8646 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8648 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8649 __isl_take isl_map *map2)
8653 prod = isl_map_range_product(map1, map2);
8654 prod = isl_map_flatten_range(prod);
8658 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8661 uint32_t hash = isl_hash_init();
8666 bmap = isl_basic_map_copy(bmap);
8667 bmap = isl_basic_map_normalize(bmap);
8670 total = isl_basic_map_total_dim(bmap);
8671 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8672 for (i = 0; i < bmap->n_eq; ++i) {
8674 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8675 isl_hash_hash(hash, c_hash);
8677 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8678 for (i = 0; i < bmap->n_ineq; ++i) {
8680 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8681 isl_hash_hash(hash, c_hash);
8683 isl_hash_byte(hash, bmap->n_div & 0xFF);
8684 for (i = 0; i < bmap->n_div; ++i) {
8686 if (isl_int_is_zero(bmap->div[i][0]))
8688 isl_hash_byte(hash, i & 0xFF);
8689 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8690 isl_hash_hash(hash, c_hash);
8692 isl_basic_map_free(bmap);
8696 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8698 return isl_basic_map_get_hash((isl_basic_map *)bset);
8701 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8708 map = isl_map_copy(map);
8709 map = isl_map_normalize(map);
8713 hash = isl_hash_init();
8714 for (i = 0; i < map->n; ++i) {
8716 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8717 isl_hash_hash(hash, bmap_hash);
8725 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8727 return isl_map_get_hash((isl_map *)set);
8730 /* Check if the value for dimension dim is completely determined
8731 * by the values of the other parameters and variables.
8732 * That is, check if dimension dim is involved in an equality.
8734 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8741 nparam = isl_basic_set_n_param(bset);
8742 for (i = 0; i < bset->n_eq; ++i)
8743 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8748 /* Check if the value for dimension dim is completely determined
8749 * by the values of the other parameters and variables.
8750 * That is, check if dimension dim is involved in an equality
8751 * for each of the subsets.
8753 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8759 for (i = 0; i < set->n; ++i) {
8761 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8768 int isl_set_n_basic_set(__isl_keep isl_set *set)
8770 return set ? set->n : 0;
8773 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8774 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8781 for (i = 0; i < map->n; ++i)
8782 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8788 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8789 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8796 for (i = 0; i < set->n; ++i)
8797 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8803 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8810 bset = isl_basic_set_cow(bset);
8814 dim = isl_basic_set_get_space(bset);
8815 dim = isl_space_lift(dim, bset->n_div);
8818 isl_space_free(bset->dim);
8820 bset->extra -= bset->n_div;
8823 bset = isl_basic_set_finalize(bset);
8827 isl_basic_set_free(bset);
8831 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8837 set = isl_set_align_divs(set);
8842 set = isl_set_cow(set);
8846 n_div = set->p[0]->n_div;
8847 dim = isl_set_get_space(set);
8848 dim = isl_space_lift(dim, n_div);
8851 isl_space_free(set->dim);
8854 for (i = 0; i < set->n; ++i) {
8855 set->p[i] = isl_basic_set_lift(set->p[i]);
8866 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8869 struct isl_basic_map *bmap;
8876 set = isl_set_align_divs(set);
8881 dim = isl_set_get_space(set);
8882 if (set->n == 0 || set->p[0]->n_div == 0) {
8884 return isl_map_identity(isl_space_map_from_set(dim));
8887 n_div = set->p[0]->n_div;
8888 dim = isl_space_map_from_set(dim);
8889 n_param = isl_space_dim(dim, isl_dim_param);
8890 n_set = isl_space_dim(dim, isl_dim_in);
8891 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8892 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8893 for (i = 0; i < n_set; ++i)
8894 bmap = var_equal(bmap, i);
8896 total = n_param + n_set + n_set + n_div;
8897 for (i = 0; i < n_div; ++i) {
8898 k = isl_basic_map_alloc_inequality(bmap);
8901 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8902 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8903 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8904 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8905 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8906 set->p[0]->div[i][0]);
8908 l = isl_basic_map_alloc_inequality(bmap);
8911 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8912 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8913 set->p[0]->div[i][0]);
8914 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8918 bmap = isl_basic_map_simplify(bmap);
8919 bmap = isl_basic_map_finalize(bmap);
8920 return isl_map_from_basic_map(bmap);
8923 isl_basic_map_free(bmap);
8927 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8935 dim = isl_basic_set_total_dim(bset);
8936 size += bset->n_eq * (1 + dim);
8937 size += bset->n_ineq * (1 + dim);
8938 size += bset->n_div * (2 + dim);
8943 int isl_set_size(__isl_keep isl_set *set)
8951 for (i = 0; i < set->n; ++i)
8952 size += isl_basic_set_size(set->p[i]);
8957 /* Check if there is any lower bound (if lower == 0) and/or upper
8958 * bound (if upper == 0) on the specified dim.
8960 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8961 enum isl_dim_type type, unsigned pos, int lower, int upper)
8968 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8970 pos += isl_basic_map_offset(bmap, type);
8972 for (i = 0; i < bmap->n_div; ++i) {
8973 if (isl_int_is_zero(bmap->div[i][0]))
8975 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8979 for (i = 0; i < bmap->n_eq; ++i)
8980 if (!isl_int_is_zero(bmap->eq[i][pos]))
8983 for (i = 0; i < bmap->n_ineq; ++i) {
8984 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8991 return lower && upper;
8994 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8995 enum isl_dim_type type, unsigned pos)
8997 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
9000 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
9001 enum isl_dim_type type, unsigned pos)
9003 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
9006 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
9007 enum isl_dim_type type, unsigned pos)
9009 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
9012 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
9013 enum isl_dim_type type, unsigned pos)
9020 for (i = 0; i < map->n; ++i) {
9022 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
9023 if (bounded < 0 || !bounded)
9030 /* Return 1 if the specified dim is involved in both an upper bound
9031 * and a lower bound.
9033 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
9034 enum isl_dim_type type, unsigned pos)
9036 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
9039 static int has_any_bound(__isl_keep isl_map *map,
9040 enum isl_dim_type type, unsigned pos,
9041 int (*fn)(__isl_keep isl_basic_map *bmap,
9042 enum isl_dim_type type, unsigned pos))
9049 for (i = 0; i < map->n; ++i) {
9051 bounded = fn(map->p[i], type, pos);
9052 if (bounded < 0 || bounded)
9059 /* Return 1 if the specified dim is involved in any lower bound.
9061 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set,
9062 enum isl_dim_type type, unsigned pos)
9064 return has_any_bound(set, type, pos,
9065 &isl_basic_map_dim_has_lower_bound);
9068 /* Return 1 if the specified dim is involved in any upper bound.
9070 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set *set,
9071 enum isl_dim_type type, unsigned pos)
9073 return has_any_bound(set, type, pos,
9074 &isl_basic_map_dim_has_upper_bound);
9077 /* For each of the "n" variables starting at "first", determine
9078 * the sign of the variable and put the results in the first "n"
9079 * elements of the array "signs".
9081 * 1 means that the variable is non-negative
9082 * -1 means that the variable is non-positive
9083 * 0 means the variable attains both positive and negative values.
9085 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
9086 unsigned first, unsigned n, int *signs)
9088 isl_vec *bound = NULL;
9089 struct isl_tab *tab = NULL;
9090 struct isl_tab_undo *snap;
9093 if (!bset || !signs)
9096 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
9097 tab = isl_tab_from_basic_set(bset, 0);
9101 isl_seq_clr(bound->el, bound->size);
9102 isl_int_set_si(bound->el[0], -1);
9104 snap = isl_tab_snap(tab);
9105 for (i = 0; i < n; ++i) {
9108 isl_int_set_si(bound->el[1 + first + i], -1);
9109 if (isl_tab_add_ineq(tab, bound->el) < 0)
9112 isl_int_set_si(bound->el[1 + first + i], 0);
9113 if (isl_tab_rollback(tab, snap) < 0)
9121 isl_int_set_si(bound->el[1 + first + i], 1);
9122 if (isl_tab_add_ineq(tab, bound->el) < 0)
9125 isl_int_set_si(bound->el[1 + first + i], 0);
9126 if (isl_tab_rollback(tab, snap) < 0)
9129 signs[i] = empty ? -1 : 0;
9133 isl_vec_free(bound);
9137 isl_vec_free(bound);
9141 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
9142 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
9144 if (!bset || !signs)
9146 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
9149 first += pos(bset->dim, type) - 1;
9150 return isl_basic_set_vars_get_sign(bset, first, n, signs);
9153 /* Check if the given basic map is obviously single-valued.
9154 * In particular, for each output dimension, check that there is
9155 * an equality that defines the output dimension in terms of
9156 * earlier dimensions.
9158 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
9168 total = 1 + isl_basic_map_total_dim(bmap);
9169 n_out = isl_basic_map_dim(bmap, isl_dim_out);
9170 o_out = isl_basic_map_offset(bmap, isl_dim_out);
9172 for (i = 0; i < n_out; ++i) {
9173 for (j = 0; j < bmap->n_eq; ++j) {
9174 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
9176 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
9177 total - (o_out + i + 1)) == -1)
9180 if (j >= bmap->n_eq)
9187 /* Check if the given basic map is single-valued.
9192 * and check if the result is a subset of the identity mapping.
9194 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap)
9197 isl_basic_map *test;
9201 sv = isl_basic_map_plain_is_single_valued(bmap);
9205 test = isl_basic_map_reverse(isl_basic_map_copy(bmap));
9206 test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap));
9208 space = isl_basic_map_get_space(bmap);
9209 space = isl_space_map_from_set(isl_space_range(space));
9210 id = isl_basic_map_identity(space);
9212 sv = isl_basic_map_is_subset(test, id);
9214 isl_basic_map_free(test);
9215 isl_basic_map_free(id);
9220 /* Check if the given map is obviously single-valued.
9222 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
9231 return isl_basic_map_plain_is_single_valued(map->p[0]);
9234 /* Check if the given map is single-valued.
9239 * and check if the result is a subset of the identity mapping.
9241 int isl_map_is_single_valued(__isl_keep isl_map *map)
9248 sv = isl_map_plain_is_single_valued(map);
9252 test = isl_map_reverse(isl_map_copy(map));
9253 test = isl_map_apply_range(test, isl_map_copy(map));
9255 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
9256 id = isl_map_identity(dim);
9258 sv = isl_map_is_subset(test, id);
9266 int isl_map_is_injective(__isl_keep isl_map *map)
9270 map = isl_map_copy(map);
9271 map = isl_map_reverse(map);
9272 in = isl_map_is_single_valued(map);
9278 /* Check if the given map is obviously injective.
9280 int isl_map_plain_is_injective(__isl_keep isl_map *map)
9284 map = isl_map_copy(map);
9285 map = isl_map_reverse(map);
9286 in = isl_map_plain_is_single_valued(map);
9292 int isl_map_is_bijective(__isl_keep isl_map *map)
9296 sv = isl_map_is_single_valued(map);
9300 return isl_map_is_injective(map);
9303 int isl_set_is_singleton(__isl_keep isl_set *set)
9305 return isl_map_is_single_valued((isl_map *)set);
9308 int isl_map_is_translation(__isl_keep isl_map *map)
9313 delta = isl_map_deltas(isl_map_copy(map));
9314 ok = isl_set_is_singleton(delta);
9315 isl_set_free(delta);
9320 static int unique(isl_int *p, unsigned pos, unsigned len)
9322 if (isl_seq_first_non_zero(p, pos) != -1)
9324 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
9329 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
9338 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
9341 nvar = isl_basic_set_dim(bset, isl_dim_set);
9342 ovar = isl_space_offset(bset->dim, isl_dim_set);
9343 for (j = 0; j < nvar; ++j) {
9344 int lower = 0, upper = 0;
9345 for (i = 0; i < bset->n_eq; ++i) {
9346 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
9348 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
9354 for (i = 0; i < bset->n_ineq; ++i) {
9355 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
9357 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
9359 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
9364 if (!lower || !upper)
9371 int isl_set_is_box(__isl_keep isl_set *set)
9378 return isl_basic_set_is_box(set->p[0]);
9381 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
9386 return isl_space_is_wrapping(bset->dim);
9389 int isl_set_is_wrapping(__isl_keep isl_set *set)
9394 return isl_space_is_wrapping(set->dim);
9397 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9399 bmap = isl_basic_map_cow(bmap);
9403 bmap->dim = isl_space_wrap(bmap->dim);
9407 bmap = isl_basic_map_finalize(bmap);
9409 return (isl_basic_set *)bmap;
9411 isl_basic_map_free(bmap);
9415 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9419 map = isl_map_cow(map);
9423 for (i = 0; i < map->n; ++i) {
9424 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9428 map->dim = isl_space_wrap(map->dim);
9432 return (isl_set *)map;
9438 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9440 bset = isl_basic_set_cow(bset);
9444 bset->dim = isl_space_unwrap(bset->dim);
9448 bset = isl_basic_set_finalize(bset);
9450 return (isl_basic_map *)bset;
9452 isl_basic_set_free(bset);
9456 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9463 if (!isl_set_is_wrapping(set))
9464 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9467 set = isl_set_cow(set);
9471 for (i = 0; i < set->n; ++i) {
9472 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9477 set->dim = isl_space_unwrap(set->dim);
9481 return (isl_map *)set;
9487 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9488 enum isl_dim_type type)
9493 if (!isl_space_is_named_or_nested(bmap->dim, type))
9496 bmap = isl_basic_map_cow(bmap);
9500 bmap->dim = isl_space_reset(bmap->dim, type);
9504 bmap = isl_basic_map_finalize(bmap);
9508 isl_basic_map_free(bmap);
9512 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9513 enum isl_dim_type type)
9520 if (!isl_space_is_named_or_nested(map->dim, type))
9523 map = isl_map_cow(map);
9527 for (i = 0; i < map->n; ++i) {
9528 map->p[i] = isl_basic_map_reset(map->p[i], type);
9532 map->dim = isl_space_reset(map->dim, type);
9542 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9547 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9550 bmap = isl_basic_map_cow(bmap);
9554 bmap->dim = isl_space_flatten(bmap->dim);
9558 bmap = isl_basic_map_finalize(bmap);
9562 isl_basic_map_free(bmap);
9566 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9568 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9571 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9572 __isl_take isl_basic_map *bmap)
9577 if (!bmap->dim->nested[0])
9580 bmap = isl_basic_map_cow(bmap);
9584 bmap->dim = isl_space_flatten_domain(bmap->dim);
9588 bmap = isl_basic_map_finalize(bmap);
9592 isl_basic_map_free(bmap);
9596 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9597 __isl_take isl_basic_map *bmap)
9602 if (!bmap->dim->nested[1])
9605 bmap = isl_basic_map_cow(bmap);
9609 bmap->dim = isl_space_flatten_range(bmap->dim);
9613 bmap = isl_basic_map_finalize(bmap);
9617 isl_basic_map_free(bmap);
9621 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9628 if (!map->dim->nested[0] && !map->dim->nested[1])
9631 map = isl_map_cow(map);
9635 for (i = 0; i < map->n; ++i) {
9636 map->p[i] = isl_basic_map_flatten(map->p[i]);
9640 map->dim = isl_space_flatten(map->dim);
9650 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9652 return (isl_set *)isl_map_flatten((isl_map *)set);
9655 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9657 isl_space *dim, *flat_dim;
9660 dim = isl_set_get_space(set);
9661 flat_dim = isl_space_flatten(isl_space_copy(dim));
9662 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9663 map = isl_map_intersect_domain(map, set);
9668 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9675 if (!map->dim->nested[0])
9678 map = isl_map_cow(map);
9682 for (i = 0; i < map->n; ++i) {
9683 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9687 map->dim = isl_space_flatten_domain(map->dim);
9697 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9704 if (!map->dim->nested[1])
9707 map = isl_map_cow(map);
9711 for (i = 0; i < map->n; ++i) {
9712 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9716 map->dim = isl_space_flatten_range(map->dim);
9726 /* Reorder the dimensions of "bmap" according to the given dim_map
9727 * and set the dimension specification to "dim".
9729 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9730 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9735 bmap = isl_basic_map_cow(bmap);
9736 if (!bmap || !dim || !dim_map)
9739 flags = bmap->flags;
9740 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9741 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9742 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9743 res = isl_basic_map_alloc_space(dim,
9744 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9745 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9748 res = isl_basic_map_finalize(res);
9752 isl_basic_map_free(bmap);
9753 isl_space_free(dim);
9757 /* Reorder the dimensions of "map" according to given reordering.
9759 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9760 __isl_take isl_reordering *r)
9763 struct isl_dim_map *dim_map;
9765 map = isl_map_cow(map);
9766 dim_map = isl_dim_map_from_reordering(r);
9767 if (!map || !r || !dim_map)
9770 for (i = 0; i < map->n; ++i) {
9771 struct isl_dim_map *dim_map_i;
9773 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9775 map->p[i] = isl_basic_map_realign(map->p[i],
9776 isl_space_copy(r->dim), dim_map_i);
9782 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9784 isl_reordering_free(r);
9790 isl_reordering_free(r);
9794 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9795 __isl_take isl_reordering *r)
9797 return (isl_set *)isl_map_realign((isl_map *)set, r);
9800 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9801 __isl_take isl_space *model)
9808 ctx = isl_space_get_ctx(model);
9809 if (!isl_space_has_named_params(model))
9810 isl_die(ctx, isl_error_invalid,
9811 "model has unnamed parameters", goto error);
9812 if (!isl_space_has_named_params(map->dim))
9813 isl_die(ctx, isl_error_invalid,
9814 "relation has unnamed parameters", goto error);
9815 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9816 isl_reordering *exp;
9818 model = isl_space_drop_dims(model, isl_dim_in,
9819 0, isl_space_dim(model, isl_dim_in));
9820 model = isl_space_drop_dims(model, isl_dim_out,
9821 0, isl_space_dim(model, isl_dim_out));
9822 exp = isl_parameter_alignment_reordering(map->dim, model);
9823 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9824 map = isl_map_realign(map, exp);
9827 isl_space_free(model);
9830 isl_space_free(model);
9835 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9836 __isl_take isl_space *model)
9838 return isl_map_align_params(set, model);
9841 /* Align the parameters of "bmap" to those of "model", introducing
9842 * additional parameters if needed.
9844 __isl_give isl_basic_map *isl_basic_map_align_params(
9845 __isl_take isl_basic_map *bmap, __isl_take isl_space *model)
9849 if (!bmap || !model)
9852 ctx = isl_space_get_ctx(model);
9853 if (!isl_space_has_named_params(model))
9854 isl_die(ctx, isl_error_invalid,
9855 "model has unnamed parameters", goto error);
9856 if (!isl_space_has_named_params(bmap->dim))
9857 isl_die(ctx, isl_error_invalid,
9858 "relation has unnamed parameters", goto error);
9859 if (!isl_space_match(bmap->dim, isl_dim_param, model, isl_dim_param)) {
9860 isl_reordering *exp;
9861 struct isl_dim_map *dim_map;
9863 model = isl_space_drop_dims(model, isl_dim_in,
9864 0, isl_space_dim(model, isl_dim_in));
9865 model = isl_space_drop_dims(model, isl_dim_out,
9866 0, isl_space_dim(model, isl_dim_out));
9867 exp = isl_parameter_alignment_reordering(bmap->dim, model);
9868 exp = isl_reordering_extend_space(exp,
9869 isl_basic_map_get_space(bmap));
9870 dim_map = isl_dim_map_from_reordering(exp);
9871 bmap = isl_basic_map_realign(bmap,
9872 exp ? isl_space_copy(exp->dim) : NULL,
9873 isl_dim_map_extend(dim_map, bmap));
9874 isl_reordering_free(exp);
9878 isl_space_free(model);
9881 isl_space_free(model);
9882 isl_basic_map_free(bmap);
9886 /* Align the parameters of "bset" to those of "model", introducing
9887 * additional parameters if needed.
9889 __isl_give isl_basic_set *isl_basic_set_align_params(
9890 __isl_take isl_basic_set *bset, __isl_take isl_space *model)
9892 return isl_basic_map_align_params(bset, model);
9895 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9896 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9897 enum isl_dim_type c2, enum isl_dim_type c3,
9898 enum isl_dim_type c4, enum isl_dim_type c5)
9900 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9901 struct isl_mat *mat;
9907 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9908 isl_basic_map_total_dim(bmap) + 1);
9911 for (i = 0; i < bmap->n_eq; ++i)
9912 for (j = 0, pos = 0; j < 5; ++j) {
9913 int off = isl_basic_map_offset(bmap, c[j]);
9914 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9915 isl_int_set(mat->row[i][pos],
9916 bmap->eq[i][off + k]);
9924 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9925 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9926 enum isl_dim_type c2, enum isl_dim_type c3,
9927 enum isl_dim_type c4, enum isl_dim_type c5)
9929 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9930 struct isl_mat *mat;
9936 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9937 isl_basic_map_total_dim(bmap) + 1);
9940 for (i = 0; i < bmap->n_ineq; ++i)
9941 for (j = 0, pos = 0; j < 5; ++j) {
9942 int off = isl_basic_map_offset(bmap, c[j]);
9943 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9944 isl_int_set(mat->row[i][pos],
9945 bmap->ineq[i][off + k]);
9953 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9954 __isl_take isl_space *dim,
9955 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9956 enum isl_dim_type c2, enum isl_dim_type c3,
9957 enum isl_dim_type c4, enum isl_dim_type c5)
9959 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9960 isl_basic_map *bmap;
9966 if (!dim || !eq || !ineq)
9969 if (eq->n_col != ineq->n_col)
9970 isl_die(dim->ctx, isl_error_invalid,
9971 "equalities and inequalities matrices should have "
9972 "same number of columns", goto error);
9974 total = 1 + isl_space_dim(dim, isl_dim_all);
9976 if (eq->n_col < total)
9977 isl_die(dim->ctx, isl_error_invalid,
9978 "number of columns too small", goto error);
9980 extra = eq->n_col - total;
9982 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9983 eq->n_row, ineq->n_row);
9986 for (i = 0; i < extra; ++i) {
9987 k = isl_basic_map_alloc_div(bmap);
9990 isl_int_set_si(bmap->div[k][0], 0);
9992 for (i = 0; i < eq->n_row; ++i) {
9993 l = isl_basic_map_alloc_equality(bmap);
9996 for (j = 0, pos = 0; j < 5; ++j) {
9997 int off = isl_basic_map_offset(bmap, c[j]);
9998 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9999 isl_int_set(bmap->eq[l][off + k],
10005 for (i = 0; i < ineq->n_row; ++i) {
10006 l = isl_basic_map_alloc_inequality(bmap);
10009 for (j = 0, pos = 0; j < 5; ++j) {
10010 int off = isl_basic_map_offset(bmap, c[j]);
10011 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10012 isl_int_set(bmap->ineq[l][off + k],
10013 ineq->row[i][pos]);
10019 isl_space_free(dim);
10021 isl_mat_free(ineq);
10025 isl_space_free(dim);
10027 isl_mat_free(ineq);
10031 __isl_give isl_mat *isl_basic_set_equalities_matrix(
10032 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10033 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10035 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
10036 c1, c2, c3, c4, isl_dim_in);
10039 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
10040 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10041 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10043 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
10044 c1, c2, c3, c4, isl_dim_in);
10047 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
10048 __isl_take isl_space *dim,
10049 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
10050 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10052 return (isl_basic_set*)
10053 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
10054 c1, c2, c3, c4, isl_dim_in);
10057 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
10062 return isl_space_can_zip(bmap->dim);
10065 int isl_map_can_zip(__isl_keep isl_map *map)
10070 return isl_space_can_zip(map->dim);
10073 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10074 * (A -> C) -> (B -> D).
10076 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
10085 if (!isl_basic_map_can_zip(bmap))
10086 isl_die(bmap->ctx, isl_error_invalid,
10087 "basic map cannot be zipped", goto error);
10088 pos = isl_basic_map_offset(bmap, isl_dim_in) +
10089 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
10090 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
10091 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
10092 bmap = isl_basic_map_cow(bmap);
10093 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
10096 bmap->dim = isl_space_zip(bmap->dim);
10101 isl_basic_map_free(bmap);
10105 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10106 * (A -> C) -> (B -> D).
10108 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
10115 if (!isl_map_can_zip(map))
10116 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
10119 map = isl_map_cow(map);
10123 for (i = 0; i < map->n; ++i) {
10124 map->p[i] = isl_basic_map_zip(map->p[i]);
10129 map->dim = isl_space_zip(map->dim);
10139 /* Can we apply isl_basic_map_curry to "bmap"?
10140 * That is, does it have a nested relation in its domain?
10142 int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap)
10147 return isl_space_can_curry(bmap->dim);
10150 /* Can we apply isl_map_curry to "map"?
10151 * That is, does it have a nested relation in its domain?
10153 int isl_map_can_curry(__isl_keep isl_map *map)
10158 return isl_space_can_curry(map->dim);
10161 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10164 __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap)
10170 if (!isl_basic_map_can_curry(bmap))
10171 isl_die(bmap->ctx, isl_error_invalid,
10172 "basic map cannot be curried", goto error);
10173 bmap->dim = isl_space_curry(bmap->dim);
10178 isl_basic_map_free(bmap);
10182 /* Given a map (A -> B) -> C, return the corresponding map
10185 __isl_give isl_map *isl_map_curry(__isl_take isl_map *map)
10192 if (!isl_map_can_curry(map))
10193 isl_die(map->ctx, isl_error_invalid, "map cannot be curried",
10196 map = isl_map_cow(map);
10200 for (i = 0; i < map->n; ++i) {
10201 map->p[i] = isl_basic_map_curry(map->p[i]);
10206 map->dim = isl_space_curry(map->dim);
10216 /* Construct a basic map mapping the domain of the affine expression
10217 * to a one-dimensional range prescribed by the affine expression.
10219 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
10223 isl_local_space *ls;
10224 isl_basic_map *bmap;
10229 ls = isl_aff_get_local_space(aff);
10230 bmap = isl_basic_map_from_local_space(ls);
10231 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
10232 k = isl_basic_map_alloc_equality(bmap);
10236 pos = isl_basic_map_offset(bmap, isl_dim_out);
10237 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
10238 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
10239 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
10240 aff->v->size - (pos + 1));
10243 bmap = isl_basic_map_finalize(bmap);
10247 isl_basic_map_free(bmap);
10251 /* Construct a map mapping the domain of the affine expression
10252 * to a one-dimensional range prescribed by the affine expression.
10254 __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff)
10256 isl_basic_map *bmap;
10258 bmap = isl_basic_map_from_aff(aff);
10259 return isl_map_from_basic_map(bmap);
10262 /* Construct a basic map mapping the domain the multi-affine expression
10263 * to its range, with each dimension in the range equated to the
10264 * corresponding affine expression.
10266 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
10267 __isl_take isl_multi_aff *maff)
10271 isl_basic_map *bmap;
10276 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
10277 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
10278 "invalid space", return isl_multi_aff_free(maff));
10280 space = isl_space_domain(isl_multi_aff_get_space(maff));
10281 bmap = isl_basic_map_universe(isl_space_from_domain(space));
10283 for (i = 0; i < maff->n; ++i) {
10285 isl_basic_map *bmap_i;
10287 aff = isl_aff_copy(maff->p[i]);
10288 bmap_i = isl_basic_map_from_aff(aff);
10290 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10293 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
10295 isl_multi_aff_free(maff);
10299 /* Construct a map mapping the domain the multi-affine expression
10300 * to its range, with each dimension in the range equated to the
10301 * corresponding affine expression.
10303 __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff)
10305 isl_basic_map *bmap;
10307 bmap = isl_basic_map_from_multi_aff(maff);
10308 return isl_map_from_basic_map(bmap);
10311 /* Construct a basic map mapping a domain in the given space to
10312 * to an n-dimensional range, with n the number of elements in the list,
10313 * where each coordinate in the range is prescribed by the
10314 * corresponding affine expression.
10315 * The domains of all affine expressions in the list are assumed to match
10318 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
10319 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
10323 isl_basic_map *bmap;
10328 dim = isl_space_from_domain(domain_dim);
10329 bmap = isl_basic_map_universe(dim);
10331 for (i = 0; i < list->n; ++i) {
10333 isl_basic_map *bmap_i;
10335 aff = isl_aff_copy(list->p[i]);
10336 bmap_i = isl_basic_map_from_aff(aff);
10338 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10341 isl_aff_list_free(list);
10345 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
10346 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10348 return isl_map_equate(set, type1, pos1, type2, pos2);
10351 /* Construct a basic map where the given dimensions are equal to each other.
10353 static __isl_give isl_basic_map *equator(__isl_take isl_space *space,
10354 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10356 isl_basic_map *bmap = NULL;
10362 if (pos1 >= isl_space_dim(space, type1))
10363 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10364 "index out of bounds", goto error);
10365 if (pos2 >= isl_space_dim(space, type2))
10366 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10367 "index out of bounds", goto error);
10369 if (type1 == type2 && pos1 == pos2)
10370 return isl_basic_map_universe(space);
10372 bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0);
10373 i = isl_basic_map_alloc_equality(bmap);
10376 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10377 pos1 += isl_basic_map_offset(bmap, type1);
10378 pos2 += isl_basic_map_offset(bmap, type2);
10379 isl_int_set_si(bmap->eq[i][pos1], -1);
10380 isl_int_set_si(bmap->eq[i][pos2], 1);
10381 bmap = isl_basic_map_finalize(bmap);
10382 isl_space_free(space);
10385 isl_space_free(space);
10386 isl_basic_map_free(bmap);
10390 /* Add a constraint imposing that the given two dimensions are equal.
10392 __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap,
10393 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10397 eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
10399 bmap = isl_basic_map_intersect(bmap, eq);
10404 /* Add a constraint imposing that the given two dimensions are equal.
10406 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
10407 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10409 isl_basic_map *bmap;
10411 bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2);
10413 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10418 /* Add a constraint imposing that the given two dimensions have opposite values.
10420 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
10421 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10423 isl_basic_map *bmap = NULL;
10429 if (pos1 >= isl_map_dim(map, type1))
10430 isl_die(map->ctx, isl_error_invalid,
10431 "index out of bounds", goto error);
10432 if (pos2 >= isl_map_dim(map, type2))
10433 isl_die(map->ctx, isl_error_invalid,
10434 "index out of bounds", goto error);
10436 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
10437 i = isl_basic_map_alloc_equality(bmap);
10440 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10441 pos1 += isl_basic_map_offset(bmap, type1);
10442 pos2 += isl_basic_map_offset(bmap, type2);
10443 isl_int_set_si(bmap->eq[i][pos1], 1);
10444 isl_int_set_si(bmap->eq[i][pos2], 1);
10445 bmap = isl_basic_map_finalize(bmap);
10447 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10451 isl_basic_map_free(bmap);
10456 /* Add a constraint imposing that the value of the first dimension is
10457 * greater than that of the second.
10459 __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map,
10460 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10462 isl_basic_map *bmap = NULL;
10468 if (pos1 >= isl_map_dim(map, type1))
10469 isl_die(map->ctx, isl_error_invalid,
10470 "index out of bounds", goto error);
10471 if (pos2 >= isl_map_dim(map, type2))
10472 isl_die(map->ctx, isl_error_invalid,
10473 "index out of bounds", goto error);
10475 if (type1 == type2 && pos1 == pos2) {
10476 isl_space *space = isl_map_get_space(map);
10478 return isl_map_empty(space);
10481 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 0, 1);
10482 i = isl_basic_map_alloc_inequality(bmap);
10485 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
10486 pos1 += isl_basic_map_offset(bmap, type1);
10487 pos2 += isl_basic_map_offset(bmap, type2);
10488 isl_int_set_si(bmap->ineq[i][pos1], 1);
10489 isl_int_set_si(bmap->ineq[i][pos2], -1);
10490 isl_int_set_si(bmap->ineq[i][0], -1);
10491 bmap = isl_basic_map_finalize(bmap);
10493 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10497 isl_basic_map_free(bmap);
10502 /* Add a constraint imposing that the value of the first dimension is
10503 * smaller than that of the second.
10505 __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map,
10506 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10508 return isl_map_order_gt(map, type2, pos2, type1, pos1);
10511 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
10515 isl_local_space *ls;
10520 if (!isl_basic_map_divs_known(bmap))
10521 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
10522 "some divs are unknown", return NULL);
10524 ls = isl_basic_map_get_local_space(bmap);
10525 div = isl_local_space_get_div(ls, pos);
10526 isl_local_space_free(ls);
10531 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
10534 return isl_basic_map_get_div(bset, pos);
10537 /* Plug in "subs" for dimension "type", "pos" of "bset".
10539 * Let i be the dimension to replace and let "subs" be of the form
10543 * Any integer division with a non-zero coefficient for i,
10545 * floor((a i + g)/m)
10549 * floor((a f + d g)/(m d))
10551 * Constraints of the form
10559 __isl_give isl_basic_set *isl_basic_set_substitute(
10560 __isl_take isl_basic_set *bset,
10561 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10567 if (bset && isl_basic_set_plain_is_empty(bset))
10570 bset = isl_basic_set_cow(bset);
10571 if (!bset || !subs)
10574 ctx = isl_basic_set_get_ctx(bset);
10575 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
10576 isl_die(ctx, isl_error_invalid,
10577 "spaces don't match", goto error);
10578 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
10579 isl_die(ctx, isl_error_unsupported,
10580 "cannot handle divs yet", goto error);
10582 pos += isl_basic_set_offset(bset, type);
10586 for (i = 0; i < bset->n_eq; ++i) {
10587 if (isl_int_is_zero(bset->eq[i][pos]))
10589 isl_int_set(v, bset->eq[i][pos]);
10590 isl_int_set_si(bset->eq[i][pos], 0);
10591 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
10592 v, subs->v->el + 1, subs->v->size - 1);
10595 for (i = 0; i < bset->n_ineq; ++i) {
10596 if (isl_int_is_zero(bset->ineq[i][pos]))
10598 isl_int_set(v, bset->ineq[i][pos]);
10599 isl_int_set_si(bset->ineq[i][pos], 0);
10600 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
10601 v, subs->v->el + 1, subs->v->size - 1);
10604 for (i = 0; i < bset->n_div; ++i) {
10605 if (isl_int_is_zero(bset->div[i][1 + pos]))
10607 isl_int_set(v, bset->div[i][1 + pos]);
10608 isl_int_set_si(bset->div[i][1 + pos], 0);
10609 isl_seq_combine(bset->div[i] + 1,
10610 subs->v->el[0], bset->div[i] + 1,
10611 v, subs->v->el + 1, subs->v->size - 1);
10612 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
10617 bset = isl_basic_set_simplify(bset);
10618 return isl_basic_set_finalize(bset);
10620 isl_basic_set_free(bset);
10624 /* Plug in "subs" for dimension "type", "pos" of "set".
10626 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
10627 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10631 if (set && isl_set_plain_is_empty(set))
10634 set = isl_set_cow(set);
10638 for (i = set->n - 1; i >= 0; --i) {
10639 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10640 if (remove_if_empty(set, i) < 0)