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(__isl_take 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);
949 void isl_basic_set_free(struct isl_basic_set *bset)
951 isl_basic_map_free((struct isl_basic_map *)bset);
954 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
956 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
959 __isl_give isl_map *isl_map_align_params_map_map_and(
960 __isl_take isl_map *map1, __isl_take isl_map *map2,
961 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
962 __isl_take isl_map *map2))
966 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
967 return fn(map1, map2);
968 if (!isl_space_has_named_params(map1->dim) ||
969 !isl_space_has_named_params(map2->dim))
970 isl_die(map1->ctx, isl_error_invalid,
971 "unaligned unnamed parameters", goto error);
972 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
973 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
974 return fn(map1, map2);
981 int isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1,
982 __isl_keep isl_map *map2,
983 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
989 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
990 return fn(map1, map2);
991 if (!isl_space_has_named_params(map1->dim) ||
992 !isl_space_has_named_params(map2->dim))
993 isl_die(map1->ctx, isl_error_invalid,
994 "unaligned unnamed parameters", return -1);
995 map1 = isl_map_copy(map1);
996 map2 = isl_map_copy(map2);
997 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
998 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
1005 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
1007 struct isl_ctx *ctx;
1011 isl_assert(ctx, room_for_con(bmap, 1), return -1);
1012 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
1014 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1015 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1016 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1017 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1018 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1019 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
1021 int j = isl_basic_map_alloc_inequality(bmap);
1025 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
1026 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1033 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
1034 bmap->extra - bmap->n_div);
1035 return bmap->n_eq++;
1038 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
1040 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
1043 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
1047 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
1052 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
1054 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
1057 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
1062 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
1064 if (pos != bmap->n_eq - 1) {
1066 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
1067 bmap->eq[bmap->n_eq - 1] = t;
1073 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1075 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1078 void isl_basic_map_inequality_to_equality(
1079 struct isl_basic_map *bmap, unsigned pos)
1083 t = bmap->ineq[pos];
1084 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1085 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1090 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1091 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1092 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1093 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1096 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1098 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1101 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1103 struct isl_ctx *ctx;
1107 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1108 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1109 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1110 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1111 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1112 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1113 1 + isl_basic_map_total_dim(bmap),
1114 bmap->extra - bmap->n_div);
1115 return bmap->n_ineq++;
1118 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1120 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1123 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1127 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1132 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1134 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1137 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1142 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1144 if (pos != bmap->n_ineq - 1) {
1145 t = bmap->ineq[pos];
1146 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1147 bmap->ineq[bmap->n_ineq - 1] = t;
1148 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1154 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1156 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1159 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1164 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1167 k = isl_basic_map_alloc_equality(bmap);
1170 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1173 isl_basic_map_free(bmap);
1177 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1180 return (isl_basic_set *)
1181 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1184 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1189 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1192 k = isl_basic_map_alloc_inequality(bmap);
1195 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1198 isl_basic_map_free(bmap);
1202 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1205 return (isl_basic_set *)
1206 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1209 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1213 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1214 isl_seq_clr(bmap->div[bmap->n_div] +
1215 1 + 1 + isl_basic_map_total_dim(bmap),
1216 bmap->extra - bmap->n_div);
1217 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1218 return bmap->n_div++;
1221 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1223 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1226 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1230 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1235 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1237 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1240 /* Copy constraint from src to dst, putting the vars of src at offset
1241 * dim_off in dst and the divs of src at offset div_off in dst.
1242 * If both sets are actually map, then dim_off applies to the input
1245 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1246 struct isl_basic_map *src_map, isl_int *src,
1247 unsigned in_off, unsigned out_off, unsigned div_off)
1249 unsigned src_nparam = isl_basic_map_n_param(src_map);
1250 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1251 unsigned src_in = isl_basic_map_n_in(src_map);
1252 unsigned dst_in = isl_basic_map_n_in(dst_map);
1253 unsigned src_out = isl_basic_map_n_out(src_map);
1254 unsigned dst_out = isl_basic_map_n_out(dst_map);
1255 isl_int_set(dst[0], src[0]);
1256 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1257 if (dst_nparam > src_nparam)
1258 isl_seq_clr(dst+1+src_nparam,
1259 dst_nparam - src_nparam);
1260 isl_seq_clr(dst+1+dst_nparam, in_off);
1261 isl_seq_cpy(dst+1+dst_nparam+in_off,
1263 isl_min(dst_in-in_off, src_in));
1264 if (dst_in-in_off > src_in)
1265 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1266 dst_in - in_off - src_in);
1267 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1268 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1269 src+1+src_nparam+src_in,
1270 isl_min(dst_out-out_off, src_out));
1271 if (dst_out-out_off > src_out)
1272 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1273 dst_out - out_off - src_out);
1274 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1275 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1276 src+1+src_nparam+src_in+src_out,
1277 isl_min(dst_map->extra-div_off, src_map->n_div));
1278 if (dst_map->n_div-div_off > src_map->n_div)
1279 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1280 div_off+src_map->n_div,
1281 dst_map->n_div - div_off - src_map->n_div);
1284 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1285 struct isl_basic_map *src_map, isl_int *src,
1286 unsigned in_off, unsigned out_off, unsigned div_off)
1288 isl_int_set(dst[0], src[0]);
1289 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1292 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1293 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1298 if (!bmap1 || !bmap2)
1301 div_off = bmap1->n_div;
1303 for (i = 0; i < bmap2->n_eq; ++i) {
1304 int i1 = isl_basic_map_alloc_equality(bmap1);
1307 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1308 i_pos, o_pos, div_off);
1311 for (i = 0; i < bmap2->n_ineq; ++i) {
1312 int i1 = isl_basic_map_alloc_inequality(bmap1);
1315 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1316 i_pos, o_pos, div_off);
1319 for (i = 0; i < bmap2->n_div; ++i) {
1320 int i1 = isl_basic_map_alloc_div(bmap1);
1323 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1324 i_pos, o_pos, div_off);
1327 isl_basic_map_free(bmap2);
1332 isl_basic_map_free(bmap1);
1333 isl_basic_map_free(bmap2);
1337 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1338 struct isl_basic_set *bset2, unsigned pos)
1340 return (struct isl_basic_set *)
1341 add_constraints((struct isl_basic_map *)bset1,
1342 (struct isl_basic_map *)bset2, 0, pos);
1345 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1346 __isl_take isl_space *dim, unsigned extra,
1347 unsigned n_eq, unsigned n_ineq)
1349 struct isl_basic_map *ext;
1359 dims_ok = isl_space_is_equal(base->dim, dim) &&
1360 base->extra >= base->n_div + extra;
1362 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1363 room_for_ineq(base, n_ineq)) {
1364 isl_space_free(dim);
1368 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1369 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1370 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1371 extra += base->extra;
1373 n_ineq += base->n_ineq;
1375 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1381 ext->sample = isl_vec_copy(base->sample);
1382 flags = base->flags;
1383 ext = add_constraints(ext, base, 0, 0);
1386 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1392 isl_space_free(dim);
1393 isl_basic_map_free(base);
1397 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1398 __isl_take isl_space *dim, unsigned extra,
1399 unsigned n_eq, unsigned n_ineq)
1401 return (struct isl_basic_set *)
1402 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1403 extra, n_eq, n_ineq);
1406 struct isl_basic_map *isl_basic_map_extend_constraints(
1407 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1411 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1415 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1416 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1417 unsigned n_eq, unsigned n_ineq)
1419 struct isl_basic_map *bmap;
1424 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1428 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1431 isl_basic_map_free(base);
1435 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1436 unsigned nparam, unsigned dim, unsigned extra,
1437 unsigned n_eq, unsigned n_ineq)
1439 return (struct isl_basic_set *)
1440 isl_basic_map_extend((struct isl_basic_map *)base,
1441 nparam, 0, dim, extra, n_eq, n_ineq);
1444 struct isl_basic_set *isl_basic_set_extend_constraints(
1445 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1447 return (struct isl_basic_set *)
1448 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1452 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1454 return (struct isl_basic_set *)
1455 isl_basic_map_cow((struct isl_basic_map *)bset);
1458 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1463 if (bmap->ref > 1) {
1465 bmap = isl_basic_map_dup(bmap);
1468 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1472 struct isl_set *isl_set_cow(struct isl_set *set)
1480 return isl_set_dup(set);
1483 struct isl_map *isl_map_cow(struct isl_map *map)
1491 return isl_map_dup(map);
1494 static void swap_vars(struct isl_blk blk, isl_int *a,
1495 unsigned a_len, unsigned b_len)
1497 isl_seq_cpy(blk.data, a+a_len, b_len);
1498 isl_seq_cpy(blk.data+b_len, a, a_len);
1499 isl_seq_cpy(a, blk.data, b_len+a_len);
1502 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1503 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1511 isl_assert(bmap->ctx,
1512 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1514 if (n1 == 0 || n2 == 0)
1517 bmap = isl_basic_map_cow(bmap);
1521 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1522 if (isl_blk_is_error(blk))
1525 for (i = 0; i < bmap->n_eq; ++i)
1527 bmap->eq[i] + pos, n1, n2);
1529 for (i = 0; i < bmap->n_ineq; ++i)
1531 bmap->ineq[i] + pos, n1, n2);
1533 for (i = 0; i < bmap->n_div; ++i)
1535 bmap->div[i]+1 + pos, n1, n2);
1537 isl_blk_free(bmap->ctx, blk);
1539 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1540 bmap = isl_basic_map_gauss(bmap, NULL);
1541 return isl_basic_map_finalize(bmap);
1543 isl_basic_map_free(bmap);
1547 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1548 __isl_take isl_basic_set *bset, unsigned n)
1553 nparam = isl_basic_set_n_param(bset);
1554 dim = isl_basic_set_n_dim(bset);
1555 isl_assert(bset->ctx, n <= dim, goto error);
1557 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1559 isl_basic_set_free(bset);
1563 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1569 total = isl_basic_map_total_dim(bmap);
1570 isl_basic_map_free_div(bmap, bmap->n_div);
1571 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1573 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1575 i = isl_basic_map_alloc_equality(bmap);
1579 isl_int_set_si(bmap->eq[i][0], 1);
1580 isl_seq_clr(bmap->eq[i]+1, total);
1581 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1582 isl_vec_free(bmap->sample);
1583 bmap->sample = NULL;
1584 return isl_basic_map_finalize(bmap);
1586 isl_basic_map_free(bmap);
1590 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1592 return (struct isl_basic_set *)
1593 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1596 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1599 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1600 isl_int *t = bmap->div[a];
1601 bmap->div[a] = bmap->div[b];
1604 for (i = 0; i < bmap->n_eq; ++i)
1605 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1607 for (i = 0; i < bmap->n_ineq; ++i)
1608 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1610 for (i = 0; i < bmap->n_div; ++i)
1611 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1612 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1615 /* Eliminate the specified n dimensions starting at first from the
1616 * constraints, without removing the dimensions from the space.
1617 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1619 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1620 enum isl_dim_type type, unsigned first, unsigned n)
1629 if (first + n > isl_map_dim(map, type) || first + n < first)
1630 isl_die(map->ctx, isl_error_invalid,
1631 "index out of bounds", goto error);
1633 map = isl_map_cow(map);
1637 for (i = 0; i < map->n; ++i) {
1638 map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n);
1648 /* Eliminate the specified n dimensions starting at first from the
1649 * constraints, without removing the dimensions from the space.
1650 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1652 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1653 enum isl_dim_type type, unsigned first, unsigned n)
1655 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1658 /* Eliminate the specified n dimensions starting at first from the
1659 * constraints, without removing the dimensions from the space.
1660 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1662 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1663 unsigned first, unsigned n)
1665 return isl_set_eliminate(set, isl_dim_set, first, n);
1668 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1669 __isl_take isl_basic_map *bmap)
1673 bmap = isl_basic_map_eliminate_vars(bmap,
1674 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1678 return isl_basic_map_finalize(bmap);
1681 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1682 __isl_take isl_basic_set *bset)
1684 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1685 (struct isl_basic_map *)bset);
1688 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1697 map = isl_map_cow(map);
1701 for (i = 0; i < map->n; ++i) {
1702 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1712 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1714 return isl_map_remove_divs(set);
1717 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1718 enum isl_dim_type type, unsigned first, unsigned n)
1722 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1724 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1726 bmap = isl_basic_map_eliminate_vars(bmap,
1727 isl_basic_map_offset(bmap, type) - 1 + first, n);
1730 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1732 bmap = isl_basic_map_drop(bmap, type, first, n);
1735 isl_basic_map_free(bmap);
1739 /* Return true if the definition of the given div (recursively) involves
1740 * any of the given variables.
1742 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1743 unsigned first, unsigned n)
1746 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1748 if (isl_int_is_zero(bmap->div[div][0]))
1750 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1753 for (i = bmap->n_div - 1; i >= 0; --i) {
1754 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1756 if (div_involves_vars(bmap, i, first, n))
1763 /* Try and add a lower and/or upper bound on "div" to "bmap"
1764 * based on inequality "i".
1765 * "total" is the total number of variables (excluding the divs).
1766 * "v" is a temporary object that can be used during the calculations.
1767 * If "lb" is set, then a lower bound should be constructed.
1768 * If "ub" is set, then an upper bound should be constructed.
1770 * The calling function has already checked that the inequality does not
1771 * reference "div", but we still need to check that the inequality is
1772 * of the right form. We'll consider the case where we want to construct
1773 * a lower bound. The construction of upper bounds is similar.
1775 * Let "div" be of the form
1777 * q = floor((a + f(x))/d)
1779 * We essentially check if constraint "i" is of the form
1783 * so that we can use it to derive a lower bound on "div".
1784 * However, we allow a slightly more general form
1788 * with the condition that the coefficients of g(x) - f(x) are all
1790 * Rewriting this constraint as
1794 * adding a + f(x) to both sides and dividing by d, we obtain
1796 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1798 * Taking the floor on both sides, we obtain
1800 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1804 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1806 * In the case of an upper bound, we construct the constraint
1808 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1811 static __isl_give isl_basic_map *insert_bounds_on_div_from_ineq(
1812 __isl_take isl_basic_map *bmap, int div, int i,
1813 unsigned total, isl_int v, int lb, int ub)
1817 for (j = 0; (lb || ub) && j < total + bmap->n_div; ++j) {
1819 isl_int_sub(v, bmap->ineq[i][1 + j],
1820 bmap->div[div][1 + 1 + j]);
1821 lb = isl_int_is_divisible_by(v, bmap->div[div][0]);
1824 isl_int_add(v, bmap->ineq[i][1 + j],
1825 bmap->div[div][1 + 1 + j]);
1826 ub = isl_int_is_divisible_by(v, bmap->div[div][0]);
1832 bmap = isl_basic_map_extend_constraints(bmap, 0, lb + ub);
1834 int k = isl_basic_map_alloc_inequality(bmap);
1837 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
1838 isl_int_sub(bmap->ineq[k][j], bmap->ineq[i][j],
1839 bmap->div[div][1 + j]);
1840 isl_int_cdiv_q(bmap->ineq[k][j],
1841 bmap->ineq[k][j], bmap->div[div][0]);
1843 isl_int_set_si(bmap->ineq[k][1 + total + div], 1);
1846 int k = isl_basic_map_alloc_inequality(bmap);
1849 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
1850 isl_int_add(bmap->ineq[k][j], bmap->ineq[i][j],
1851 bmap->div[div][1 + j]);
1852 isl_int_fdiv_q(bmap->ineq[k][j],
1853 bmap->ineq[k][j], bmap->div[div][0]);
1855 isl_int_set_si(bmap->ineq[k][1 + total + div], -1);
1860 isl_basic_map_free(bmap);
1864 /* This function is called right before "div" is eliminated from "bmap"
1865 * using Fourier-Motzkin.
1866 * Look through the constraints of "bmap" for constraints on the argument
1867 * of the integer division and use them to construct constraints on the
1868 * integer division itself. These constraints can then be combined
1869 * during the Fourier-Motzkin elimination.
1870 * Note that it is only useful to introduce lower bounds on "div"
1871 * if "bmap" already contains upper bounds on "div" as the newly
1872 * introduce lower bounds can then be combined with the pre-existing
1873 * upper bounds. Similarly for upper bounds.
1874 * We therefore first check if "bmap" contains any lower and/or upper bounds
1877 * It is interesting to note that the introduction of these constraints
1878 * can indeed lead to more accurate results, even when compared to
1879 * deriving constraints on the argument of "div" from constraints on "div".
1880 * Consider, for example, the set
1882 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1884 * The second constraint can be rewritten as
1886 * 2 * [(-i-2j+3)/4] + k >= 0
1888 * from which we can derive
1890 * -i - 2j + 3 >= -2k
1896 * Combined with the first constraint, we obtain
1898 * -3 <= 3 + 2k or k >= -3
1900 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1901 * the first constraint, we obtain
1903 * [(i + 2j)/4] >= [-3/4] = -1
1905 * Combining this constraint with the second constraint, we obtain
1909 static __isl_give isl_basic_map *insert_bounds_on_div(
1910 __isl_take isl_basic_map *bmap, int div)
1913 int check_lb, check_ub;
1920 if (isl_int_is_zero(bmap->div[div][0]))
1923 total = isl_space_dim(bmap->dim, isl_dim_all);
1927 for (i = 0; (!check_lb || !check_ub) && i < bmap->n_ineq; ++i) {
1928 int s = isl_int_sgn(bmap->ineq[i][1 + total + div]);
1935 if (!check_lb && !check_ub)
1940 for (i = 0; bmap && i < bmap->n_ineq; ++i) {
1941 if (!isl_int_is_zero(bmap->ineq[i][1 + total + div]))
1944 bmap = insert_bounds_on_div_from_ineq(bmap, div, i, total, v,
1945 check_lb, check_ub);
1953 /* Remove all divs (recursively) involving any of the given dimensions
1954 * in their definitions.
1956 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1957 __isl_take isl_basic_map *bmap,
1958 enum isl_dim_type type, unsigned first, unsigned n)
1964 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1966 first += isl_basic_map_offset(bmap, type);
1968 for (i = bmap->n_div - 1; i >= 0; --i) {
1969 if (!div_involves_vars(bmap, i, first, n))
1971 bmap = insert_bounds_on_div(bmap, i);
1972 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1980 isl_basic_map_free(bmap);
1984 __isl_give isl_basic_set *isl_basic_set_remove_divs_involving_dims(
1985 __isl_take isl_basic_set *bset,
1986 enum isl_dim_type type, unsigned first, unsigned n)
1988 return isl_basic_map_remove_divs_involving_dims(bset, type, first, n);
1991 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1992 enum isl_dim_type type, unsigned first, unsigned n)
2001 map = isl_map_cow(map);
2005 for (i = 0; i < map->n; ++i) {
2006 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
2017 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
2018 enum isl_dim_type type, unsigned first, unsigned n)
2020 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
2024 /* Does the desciption of "bmap" depend on the specified dimensions?
2025 * We also check whether the dimensions appear in any of the div definitions.
2026 * In principle there is no need for this check. If the dimensions appear
2027 * in a div definition, they also appear in the defining constraints of that
2030 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
2031 enum isl_dim_type type, unsigned first, unsigned n)
2038 if (first + n > isl_basic_map_dim(bmap, type))
2039 isl_die(bmap->ctx, isl_error_invalid,
2040 "index out of bounds", return -1);
2042 first += isl_basic_map_offset(bmap, type);
2043 for (i = 0; i < bmap->n_eq; ++i)
2044 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
2046 for (i = 0; i < bmap->n_ineq; ++i)
2047 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
2049 for (i = 0; i < bmap->n_div; ++i) {
2050 if (isl_int_is_zero(bmap->div[i][0]))
2052 if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0)
2059 int isl_map_involves_dims(__isl_keep isl_map *map,
2060 enum isl_dim_type type, unsigned first, unsigned n)
2067 if (first + n > isl_map_dim(map, type))
2068 isl_die(map->ctx, isl_error_invalid,
2069 "index out of bounds", return -1);
2071 for (i = 0; i < map->n; ++i) {
2072 int involves = isl_basic_map_involves_dims(map->p[i],
2074 if (involves < 0 || involves)
2081 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
2082 enum isl_dim_type type, unsigned first, unsigned n)
2084 return isl_basic_map_involves_dims(bset, type, first, n);
2087 int isl_set_involves_dims(__isl_keep isl_set *set,
2088 enum isl_dim_type type, unsigned first, unsigned n)
2090 return isl_map_involves_dims(set, type, first, n);
2093 /* Return true if the definition of the given div is unknown or depends
2096 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
2099 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
2101 if (isl_int_is_zero(bmap->div[div][0]))
2104 for (i = bmap->n_div - 1; i >= 0; --i) {
2105 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
2107 if (div_is_unknown(bmap, i))
2114 /* Remove all divs that are unknown or defined in terms of unknown divs.
2116 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
2117 __isl_take isl_basic_map *bmap)
2124 for (i = bmap->n_div - 1; i >= 0; --i) {
2125 if (!div_is_unknown(bmap, i))
2127 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
2136 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
2145 map = isl_map_cow(map);
2149 for (i = 0; i < map->n; ++i) {
2150 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
2160 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
2162 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
2165 __isl_give isl_basic_set *isl_basic_set_remove_dims(
2166 __isl_take isl_basic_set *bset,
2167 enum isl_dim_type type, unsigned first, unsigned n)
2169 return (isl_basic_set *)
2170 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
2173 struct isl_map *isl_map_remove_dims(struct isl_map *map,
2174 enum isl_dim_type type, unsigned first, unsigned n)
2181 map = isl_map_cow(map);
2184 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2186 for (i = 0; i < map->n; ++i) {
2187 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
2188 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
2192 map = isl_map_drop(map, type, first, n);
2199 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
2200 enum isl_dim_type type, unsigned first, unsigned n)
2202 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
2205 /* Project out n inputs starting at first using Fourier-Motzkin */
2206 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
2207 unsigned first, unsigned n)
2209 return isl_map_remove_dims(map, isl_dim_in, first, n);
2212 static void dump_term(struct isl_basic_map *bmap,
2213 isl_int c, int pos, FILE *out)
2216 unsigned in = isl_basic_map_n_in(bmap);
2217 unsigned dim = in + isl_basic_map_n_out(bmap);
2218 unsigned nparam = isl_basic_map_n_param(bmap);
2220 isl_int_print(out, c, 0);
2222 if (!isl_int_is_one(c))
2223 isl_int_print(out, c, 0);
2224 if (pos < 1 + nparam) {
2225 name = isl_space_get_dim_name(bmap->dim,
2226 isl_dim_param, pos - 1);
2228 fprintf(out, "%s", name);
2230 fprintf(out, "p%d", pos - 1);
2231 } else if (pos < 1 + nparam + in)
2232 fprintf(out, "i%d", pos - 1 - nparam);
2233 else if (pos < 1 + nparam + dim)
2234 fprintf(out, "o%d", pos - 1 - nparam - in);
2236 fprintf(out, "e%d", pos - 1 - nparam - dim);
2240 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2241 int sign, FILE *out)
2245 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2249 for (i = 0, first = 1; i < len; ++i) {
2250 if (isl_int_sgn(c[i]) * sign <= 0)
2253 fprintf(out, " + ");
2255 isl_int_abs(v, c[i]);
2256 dump_term(bmap, v, i, out);
2263 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2264 const char *op, FILE *out, int indent)
2268 fprintf(out, "%*s", indent, "");
2270 dump_constraint_sign(bmap, c, 1, out);
2271 fprintf(out, " %s ", op);
2272 dump_constraint_sign(bmap, c, -1, out);
2276 for (i = bmap->n_div; i < bmap->extra; ++i) {
2277 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2279 fprintf(out, "%*s", indent, "");
2280 fprintf(out, "ERROR: unused div coefficient not zero\n");
2285 static void dump_constraints(struct isl_basic_map *bmap,
2286 isl_int **c, unsigned n,
2287 const char *op, FILE *out, int indent)
2291 for (i = 0; i < n; ++i)
2292 dump_constraint(bmap, c[i], op, out, indent);
2295 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2299 unsigned total = isl_basic_map_total_dim(bmap);
2301 for (j = 0; j < 1 + total; ++j) {
2302 if (isl_int_is_zero(exp[j]))
2304 if (!first && isl_int_is_pos(exp[j]))
2306 dump_term(bmap, exp[j], j, out);
2311 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2315 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2316 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2318 for (i = 0; i < bmap->n_div; ++i) {
2319 fprintf(out, "%*s", indent, "");
2320 fprintf(out, "e%d = [(", i);
2321 dump_affine(bmap, bmap->div[i]+1, out);
2323 isl_int_print(out, bmap->div[i][0], 0);
2324 fprintf(out, "]\n");
2328 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2329 FILE *out, int indent)
2332 fprintf(out, "null basic set\n");
2336 fprintf(out, "%*s", indent, "");
2337 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2338 bset->ref, bset->dim->nparam, bset->dim->n_out,
2339 bset->extra, bset->flags);
2340 dump((struct isl_basic_map *)bset, out, indent);
2343 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2344 FILE *out, int indent)
2347 fprintf(out, "null basic map\n");
2351 fprintf(out, "%*s", indent, "");
2352 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2353 "flags: %x, n_name: %d\n",
2355 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2356 bmap->extra, bmap->flags, bmap->dim->n_id);
2357 dump(bmap, out, indent);
2360 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2365 total = isl_basic_map_total_dim(bmap);
2366 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2367 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2368 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2369 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2373 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2376 struct isl_set *set;
2380 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2381 isl_assert(dim->ctx, n >= 0, goto error);
2382 set = isl_alloc(dim->ctx, struct isl_set,
2383 sizeof(struct isl_set) +
2384 (n - 1) * sizeof(struct isl_basic_set *));
2388 set->ctx = dim->ctx;
2389 isl_ctx_ref(set->ctx);
2397 isl_space_free(dim);
2401 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2402 unsigned nparam, unsigned dim, int n, unsigned flags)
2404 struct isl_set *set;
2407 dims = isl_space_alloc(ctx, nparam, 0, dim);
2411 set = isl_set_alloc_space(dims, n, flags);
2415 /* Make sure "map" has room for at least "n" more basic maps.
2417 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2420 struct isl_map *grown = NULL;
2424 isl_assert(map->ctx, n >= 0, goto error);
2425 if (map->n + n <= map->size)
2427 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2430 for (i = 0; i < map->n; ++i) {
2431 grown->p[i] = isl_basic_map_copy(map->p[i]);
2439 isl_map_free(grown);
2444 /* Make sure "set" has room for at least "n" more basic sets.
2446 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2448 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2451 struct isl_set *isl_set_dup(struct isl_set *set)
2454 struct isl_set *dup;
2459 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2462 for (i = 0; i < set->n; ++i)
2463 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2467 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2469 return isl_map_from_basic_map(bset);
2472 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2474 struct isl_map *map;
2479 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2480 return isl_map_add_basic_map(map, bmap);
2483 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2484 __isl_take isl_basic_set *bset)
2486 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2487 (struct isl_basic_map *)bset);
2490 void *isl_set_free(__isl_take isl_set *set)
2500 isl_ctx_deref(set->ctx);
2501 for (i = 0; i < set->n; ++i)
2502 isl_basic_set_free(set->p[i]);
2503 isl_space_free(set->dim);
2509 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2514 fprintf(out, "null set\n");
2518 fprintf(out, "%*s", indent, "");
2519 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2520 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2522 for (i = 0; i < set->n; ++i) {
2523 fprintf(out, "%*s", indent, "");
2524 fprintf(out, "basic set %d:\n", i);
2525 isl_basic_set_print_internal(set->p[i], out, indent+4);
2529 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2534 fprintf(out, "null map\n");
2538 fprintf(out, "%*s", indent, "");
2539 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2540 "flags: %x, n_name: %d\n",
2541 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2542 map->dim->n_out, map->flags, map->dim->n_id);
2543 for (i = 0; i < map->n; ++i) {
2544 fprintf(out, "%*s", indent, "");
2545 fprintf(out, "basic map %d:\n", i);
2546 isl_basic_map_print_internal(map->p[i], out, indent+4);
2550 struct isl_basic_map *isl_basic_map_intersect_domain(
2551 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2553 struct isl_basic_map *bmap_domain;
2558 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2559 bset->dim, isl_dim_param), goto error);
2561 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2562 isl_assert(bset->ctx,
2563 isl_basic_map_compatible_domain(bmap, bset), goto error);
2565 bmap = isl_basic_map_cow(bmap);
2568 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2569 bset->n_div, bset->n_eq, bset->n_ineq);
2570 bmap_domain = isl_basic_map_from_domain(bset);
2571 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2573 bmap = isl_basic_map_simplify(bmap);
2574 return isl_basic_map_finalize(bmap);
2576 isl_basic_map_free(bmap);
2577 isl_basic_set_free(bset);
2581 struct isl_basic_map *isl_basic_map_intersect_range(
2582 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2584 struct isl_basic_map *bmap_range;
2589 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2590 bset->dim, isl_dim_param), goto error);
2592 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2593 isl_assert(bset->ctx,
2594 isl_basic_map_compatible_range(bmap, bset), goto error);
2596 if (isl_basic_set_is_universe(bset)) {
2597 isl_basic_set_free(bset);
2601 bmap = isl_basic_map_cow(bmap);
2604 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2605 bset->n_div, bset->n_eq, bset->n_ineq);
2606 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2607 bmap = add_constraints(bmap, bmap_range, 0, 0);
2609 bmap = isl_basic_map_simplify(bmap);
2610 return isl_basic_map_finalize(bmap);
2612 isl_basic_map_free(bmap);
2613 isl_basic_set_free(bset);
2617 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2623 total = 1 + isl_basic_map_total_dim(bmap);
2624 if (total != vec->size)
2629 for (i = 0; i < bmap->n_eq; ++i) {
2630 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2631 if (!isl_int_is_zero(s)) {
2637 for (i = 0; i < bmap->n_ineq; ++i) {
2638 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2639 if (isl_int_is_neg(s)) {
2650 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2652 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2655 struct isl_basic_map *isl_basic_map_intersect(
2656 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2658 struct isl_vec *sample = NULL;
2660 if (!bmap1 || !bmap2)
2663 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2664 bmap2->dim, isl_dim_param), goto error);
2665 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2666 isl_space_dim(bmap1->dim, isl_dim_param) &&
2667 isl_space_dim(bmap2->dim, isl_dim_all) !=
2668 isl_space_dim(bmap2->dim, isl_dim_param))
2669 return isl_basic_map_intersect(bmap2, bmap1);
2671 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2672 isl_space_dim(bmap2->dim, isl_dim_param))
2673 isl_assert(bmap1->ctx,
2674 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2676 if (bmap1->sample &&
2677 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2678 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2679 sample = isl_vec_copy(bmap1->sample);
2680 else if (bmap2->sample &&
2681 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2682 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2683 sample = isl_vec_copy(bmap2->sample);
2685 bmap1 = isl_basic_map_cow(bmap1);
2688 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2689 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2690 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2693 isl_vec_free(sample);
2695 isl_vec_free(bmap1->sample);
2696 bmap1->sample = sample;
2699 bmap1 = isl_basic_map_simplify(bmap1);
2700 return isl_basic_map_finalize(bmap1);
2703 isl_vec_free(sample);
2704 isl_basic_map_free(bmap1);
2705 isl_basic_map_free(bmap2);
2709 struct isl_basic_set *isl_basic_set_intersect(
2710 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2712 return (struct isl_basic_set *)
2713 isl_basic_map_intersect(
2714 (struct isl_basic_map *)bset1,
2715 (struct isl_basic_map *)bset2);
2718 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2719 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2721 return isl_basic_set_intersect(bset1, bset2);
2724 /* Special case of isl_map_intersect, where both map1 and map2
2725 * are convex, without any divs and such that either map1 or map2
2726 * contains a single constraint. This constraint is then simply
2727 * added to the other map.
2729 static __isl_give isl_map *map_intersect_add_constraint(
2730 __isl_take isl_map *map1, __isl_take isl_map *map2)
2732 isl_assert(map1->ctx, map1->n == 1, goto error);
2733 isl_assert(map2->ctx, map1->n == 1, goto error);
2734 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2735 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2737 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2738 return isl_map_intersect(map2, map1);
2740 isl_assert(map2->ctx,
2741 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2743 map1 = isl_map_cow(map1);
2746 if (isl_map_plain_is_empty(map1)) {
2750 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2751 if (map2->p[0]->n_eq == 1)
2752 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2754 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2755 map2->p[0]->ineq[0]);
2757 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2758 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2762 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2763 isl_basic_map_free(map1->p[0]);
2776 /* map2 may be either a parameter domain or a map living in the same
2779 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2780 __isl_take isl_map *map2)
2783 struct isl_map *result;
2789 if (isl_map_plain_is_empty(map1) &&
2790 isl_space_is_equal(map1->dim, map2->dim)) {
2794 if (isl_map_plain_is_empty(map2) &&
2795 isl_space_is_equal(map1->dim, map2->dim)) {
2800 if (map1->n == 1 && map2->n == 1 &&
2801 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2802 isl_space_is_equal(map1->dim, map2->dim) &&
2803 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2804 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2805 return map_intersect_add_constraint(map1, map2);
2807 if (isl_space_dim(map2->dim, isl_dim_all) !=
2808 isl_space_dim(map2->dim, isl_dim_param))
2809 isl_assert(map1->ctx,
2810 isl_space_is_equal(map1->dim, map2->dim), goto error);
2812 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2813 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2814 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2816 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2817 map1->n * map2->n, flags);
2820 for (i = 0; i < map1->n; ++i)
2821 for (j = 0; j < map2->n; ++j) {
2822 struct isl_basic_map *part;
2823 part = isl_basic_map_intersect(
2824 isl_basic_map_copy(map1->p[i]),
2825 isl_basic_map_copy(map2->p[j]));
2826 if (isl_basic_map_is_empty(part) < 0)
2828 result = isl_map_add_basic_map(result, part);
2841 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2842 __isl_take isl_map *map2)
2846 if (!isl_space_is_equal(map1->dim, map2->dim))
2847 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
2848 "spaces don't match", goto error);
2849 return map_intersect_internal(map1, map2);
2856 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2857 __isl_take isl_map *map2)
2859 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2862 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2864 return (struct isl_set *)
2865 isl_map_intersect((struct isl_map *)set1,
2866 (struct isl_map *)set2);
2869 /* map_intersect_internal accepts intersections
2870 * with parameter domains, so we can just call that function.
2872 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2873 __isl_take isl_set *params)
2875 return map_intersect_internal(map, params);
2878 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2879 __isl_take isl_map *map2)
2881 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2884 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2885 __isl_take isl_set *params)
2887 return isl_map_intersect_params(set, params);
2890 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2893 struct isl_basic_set *bset;
2898 bmap = isl_basic_map_cow(bmap);
2901 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2902 in = isl_basic_map_n_in(bmap);
2903 bset = isl_basic_set_from_basic_map(bmap);
2904 bset = isl_basic_set_swap_vars(bset, in);
2905 return isl_basic_map_from_basic_set(bset, dim);
2908 static __isl_give isl_basic_map *basic_map_space_reset(
2909 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2913 if (!isl_space_is_named_or_nested(bmap->dim, type))
2916 space = isl_basic_map_get_space(bmap);
2917 space = isl_space_reset(space, type);
2918 bmap = isl_basic_map_reset_space(bmap, space);
2922 __isl_give isl_basic_map *isl_basic_map_insert_dims(
2923 __isl_take isl_basic_map *bmap, enum isl_dim_type type,
2924 unsigned pos, unsigned n)
2927 struct isl_basic_map *res;
2928 struct isl_dim_map *dim_map;
2929 unsigned total, off;
2930 enum isl_dim_type t;
2933 return basic_map_space_reset(bmap, type);
2938 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2940 total = isl_basic_map_total_dim(bmap) + n;
2941 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2943 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2945 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2947 unsigned size = isl_basic_map_dim(bmap, t);
2948 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2950 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2951 pos, size - pos, off + pos + n);
2953 off += isl_space_dim(res_dim, t);
2955 isl_dim_map_div(dim_map, bmap, off);
2957 res = isl_basic_map_alloc_space(res_dim,
2958 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2959 if (isl_basic_map_is_rational(bmap))
2960 res = isl_basic_map_set_rational(res);
2961 if (isl_basic_map_plain_is_empty(bmap)) {
2962 isl_basic_map_free(bmap);
2963 return isl_basic_map_set_to_empty(res);
2965 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2966 return isl_basic_map_finalize(res);
2969 __isl_give isl_basic_set *isl_basic_set_insert_dims(
2970 __isl_take isl_basic_set *bset,
2971 enum isl_dim_type type, unsigned pos, unsigned n)
2973 return isl_basic_map_insert_dims(bset, type, pos, n);
2976 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2977 enum isl_dim_type type, unsigned n)
2981 return isl_basic_map_insert_dims(bmap, type,
2982 isl_basic_map_dim(bmap, type), n);
2985 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2986 enum isl_dim_type type, unsigned n)
2990 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2991 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2993 isl_basic_set_free(bset);
2997 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2998 enum isl_dim_type type)
3002 if (!map || !isl_space_is_named_or_nested(map->dim, type))
3005 space = isl_map_get_space(map);
3006 space = isl_space_reset(space, type);
3007 map = isl_map_reset_space(map, space);
3011 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
3012 enum isl_dim_type type, unsigned pos, unsigned n)
3017 return map_space_reset(map, type);
3019 map = isl_map_cow(map);
3023 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
3027 for (i = 0; i < map->n; ++i) {
3028 map->p[i] = isl_basic_map_insert_dims(map->p[i], type, pos, n);
3039 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
3040 enum isl_dim_type type, unsigned pos, unsigned n)
3042 return isl_map_insert_dims(set, type, pos, n);
3045 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
3046 enum isl_dim_type type, unsigned n)
3050 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
3053 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
3054 enum isl_dim_type type, unsigned n)
3058 isl_assert(set->ctx, type != isl_dim_in, goto error);
3059 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
3065 __isl_give isl_basic_map *isl_basic_map_move_dims(
3066 __isl_take isl_basic_map *bmap,
3067 enum isl_dim_type dst_type, unsigned dst_pos,
3068 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3070 struct isl_dim_map *dim_map;
3071 struct isl_basic_map *res;
3072 enum isl_dim_type t;
3073 unsigned total, off;
3080 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
3083 if (dst_type == src_type && dst_pos == src_pos)
3086 isl_assert(bmap->ctx, dst_type != src_type, goto error);
3088 if (pos(bmap->dim, dst_type) + dst_pos ==
3089 pos(bmap->dim, src_type) + src_pos +
3090 ((src_type < dst_type) ? n : 0)) {
3091 bmap = isl_basic_map_cow(bmap);
3095 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3096 src_type, src_pos, n);
3100 bmap = isl_basic_map_finalize(bmap);
3105 total = isl_basic_map_total_dim(bmap);
3106 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3109 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3110 unsigned size = isl_space_dim(bmap->dim, t);
3111 if (t == dst_type) {
3112 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3115 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
3118 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3119 dst_pos, size - dst_pos, off);
3120 off += size - dst_pos;
3121 } else if (t == src_type) {
3122 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3125 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3126 src_pos + n, size - src_pos - n, off);
3127 off += size - src_pos - n;
3129 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3133 isl_dim_map_div(dim_map, bmap, off);
3135 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3136 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3137 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3139 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3140 src_type, src_pos, n);
3144 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
3145 bmap = isl_basic_map_gauss(bmap, NULL);
3146 bmap = isl_basic_map_finalize(bmap);
3150 isl_basic_map_free(bmap);
3154 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
3155 enum isl_dim_type dst_type, unsigned dst_pos,
3156 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3158 return (isl_basic_set *)isl_basic_map_move_dims(
3159 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
3162 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
3163 enum isl_dim_type dst_type, unsigned dst_pos,
3164 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3168 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
3169 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
3170 src_type, src_pos, n);
3176 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
3177 enum isl_dim_type dst_type, unsigned dst_pos,
3178 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3187 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
3190 if (dst_type == src_type && dst_pos == src_pos)
3193 isl_assert(map->ctx, dst_type != src_type, goto error);
3195 map = isl_map_cow(map);
3199 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
3203 for (i = 0; i < map->n; ++i) {
3204 map->p[i] = isl_basic_map_move_dims(map->p[i],
3206 src_type, src_pos, n);
3217 /* Move the specified dimensions to the last columns right before
3218 * the divs. Don't change the dimension specification of bmap.
3219 * That's the responsibility of the caller.
3221 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
3222 enum isl_dim_type type, unsigned first, unsigned n)
3224 struct isl_dim_map *dim_map;
3225 struct isl_basic_map *res;
3226 enum isl_dim_type t;
3227 unsigned total, off;
3231 if (pos(bmap->dim, type) + first + n ==
3232 1 + isl_space_dim(bmap->dim, isl_dim_all))
3235 total = isl_basic_map_total_dim(bmap);
3236 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3239 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3240 unsigned size = isl_space_dim(bmap->dim, t);
3242 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3245 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3246 first, n, total - bmap->n_div - n);
3247 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3248 first + n, size - (first + n), off);
3249 off += size - (first + n);
3251 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3255 isl_dim_map_div(dim_map, bmap, off + n);
3257 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3258 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3259 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3263 /* Turn the n dimensions of type type, starting at first
3264 * into existentially quantified variables.
3266 __isl_give isl_basic_map *isl_basic_map_project_out(
3267 __isl_take isl_basic_map *bmap,
3268 enum isl_dim_type type, unsigned first, unsigned n)
3276 return basic_map_space_reset(bmap, type);
3281 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3282 return isl_basic_map_remove_dims(bmap, type, first, n);
3284 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3287 bmap = move_last(bmap, type, first, n);
3288 bmap = isl_basic_map_cow(bmap);
3292 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3293 old = bmap->block2.data;
3294 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3295 (bmap->extra + n) * (1 + row_size));
3296 if (!bmap->block2.data)
3298 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3301 for (i = 0; i < n; ++i) {
3302 new_div[i] = bmap->block2.data +
3303 (bmap->extra + i) * (1 + row_size);
3304 isl_seq_clr(new_div[i], 1 + row_size);
3306 for (i = 0; i < bmap->extra; ++i)
3307 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3309 bmap->div = new_div;
3313 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3316 bmap = isl_basic_map_simplify(bmap);
3317 bmap = isl_basic_map_drop_redundant_divs(bmap);
3318 return isl_basic_map_finalize(bmap);
3320 isl_basic_map_free(bmap);
3324 /* Turn the n dimensions of type type, starting at first
3325 * into existentially quantified variables.
3327 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3328 enum isl_dim_type type, unsigned first, unsigned n)
3330 return (isl_basic_set *)isl_basic_map_project_out(
3331 (isl_basic_map *)bset, type, first, n);
3334 /* Turn the n dimensions of type type, starting at first
3335 * into existentially quantified variables.
3337 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3338 enum isl_dim_type type, unsigned first, unsigned n)
3346 return map_space_reset(map, type);
3348 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3350 map = isl_map_cow(map);
3354 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3358 for (i = 0; i < map->n; ++i) {
3359 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3370 /* Turn the n dimensions of type type, starting at first
3371 * into existentially quantified variables.
3373 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3374 enum isl_dim_type type, unsigned first, unsigned n)
3376 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3379 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3383 for (i = 0; i < n; ++i) {
3384 j = isl_basic_map_alloc_div(bmap);
3387 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3391 isl_basic_map_free(bmap);
3395 struct isl_basic_map *isl_basic_map_apply_range(
3396 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3398 isl_space *dim_result = NULL;
3399 struct isl_basic_map *bmap;
3400 unsigned n_in, n_out, n, nparam, total, pos;
3401 struct isl_dim_map *dim_map1, *dim_map2;
3403 if (!bmap1 || !bmap2)
3406 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3407 isl_space_copy(bmap2->dim));
3409 n_in = isl_basic_map_n_in(bmap1);
3410 n_out = isl_basic_map_n_out(bmap2);
3411 n = isl_basic_map_n_out(bmap1);
3412 nparam = isl_basic_map_n_param(bmap1);
3414 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3415 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3416 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3417 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3418 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3419 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3420 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3421 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3422 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3423 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3424 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3426 bmap = isl_basic_map_alloc_space(dim_result,
3427 bmap1->n_div + bmap2->n_div + n,
3428 bmap1->n_eq + bmap2->n_eq,
3429 bmap1->n_ineq + bmap2->n_ineq);
3430 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3431 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3432 bmap = add_divs(bmap, n);
3433 bmap = isl_basic_map_simplify(bmap);
3434 bmap = isl_basic_map_drop_redundant_divs(bmap);
3435 return isl_basic_map_finalize(bmap);
3437 isl_basic_map_free(bmap1);
3438 isl_basic_map_free(bmap2);
3442 struct isl_basic_set *isl_basic_set_apply(
3443 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3448 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3451 return (struct isl_basic_set *)
3452 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3454 isl_basic_set_free(bset);
3455 isl_basic_map_free(bmap);
3459 struct isl_basic_map *isl_basic_map_apply_domain(
3460 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3462 if (!bmap1 || !bmap2)
3465 isl_assert(bmap1->ctx,
3466 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3467 isl_assert(bmap1->ctx,
3468 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3471 bmap1 = isl_basic_map_reverse(bmap1);
3472 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3473 return isl_basic_map_reverse(bmap1);
3475 isl_basic_map_free(bmap1);
3476 isl_basic_map_free(bmap2);
3480 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3481 * A \cap B -> f(A) + f(B)
3483 struct isl_basic_map *isl_basic_map_sum(
3484 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3486 unsigned n_in, n_out, nparam, total, pos;
3487 struct isl_basic_map *bmap = NULL;
3488 struct isl_dim_map *dim_map1, *dim_map2;
3491 if (!bmap1 || !bmap2)
3494 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3497 nparam = isl_basic_map_n_param(bmap1);
3498 n_in = isl_basic_map_n_in(bmap1);
3499 n_out = isl_basic_map_n_out(bmap1);
3501 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3502 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3503 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3504 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3505 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3506 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3507 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3508 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3509 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3510 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3511 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3513 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3514 bmap1->n_div + bmap2->n_div + 2 * n_out,
3515 bmap1->n_eq + bmap2->n_eq + n_out,
3516 bmap1->n_ineq + bmap2->n_ineq);
3517 for (i = 0; i < n_out; ++i) {
3518 int j = isl_basic_map_alloc_equality(bmap);
3521 isl_seq_clr(bmap->eq[j], 1+total);
3522 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3523 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3524 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3526 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3527 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3528 bmap = add_divs(bmap, 2 * n_out);
3530 bmap = isl_basic_map_simplify(bmap);
3531 return isl_basic_map_finalize(bmap);
3533 isl_basic_map_free(bmap);
3534 isl_basic_map_free(bmap1);
3535 isl_basic_map_free(bmap2);
3539 /* Given two maps A -> f(A) and B -> g(B), construct a map
3540 * A \cap B -> f(A) + f(B)
3542 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3544 struct isl_map *result;
3550 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3552 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3553 map1->n * map2->n, 0);
3556 for (i = 0; i < map1->n; ++i)
3557 for (j = 0; j < map2->n; ++j) {
3558 struct isl_basic_map *part;
3559 part = isl_basic_map_sum(
3560 isl_basic_map_copy(map1->p[i]),
3561 isl_basic_map_copy(map2->p[j]));
3562 if (isl_basic_map_is_empty(part))
3563 isl_basic_map_free(part);
3565 result = isl_map_add_basic_map(result, part);
3578 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3579 __isl_take isl_set *set2)
3581 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3584 /* Given a basic map A -> f(A), construct A -> -f(A).
3586 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3591 bmap = isl_basic_map_cow(bmap);
3595 n = isl_basic_map_dim(bmap, isl_dim_out);
3596 off = isl_basic_map_offset(bmap, isl_dim_out);
3597 for (i = 0; i < bmap->n_eq; ++i)
3598 for (j = 0; j < n; ++j)
3599 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3600 for (i = 0; i < bmap->n_ineq; ++i)
3601 for (j = 0; j < n; ++j)
3602 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3603 for (i = 0; i < bmap->n_div; ++i)
3604 for (j = 0; j < n; ++j)
3605 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3606 bmap = isl_basic_map_gauss(bmap, NULL);
3607 return isl_basic_map_finalize(bmap);
3610 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3612 return isl_basic_map_neg(bset);
3615 /* Given a map A -> f(A), construct A -> -f(A).
3617 struct isl_map *isl_map_neg(struct isl_map *map)
3621 map = isl_map_cow(map);
3625 for (i = 0; i < map->n; ++i) {
3626 map->p[i] = isl_basic_map_neg(map->p[i]);
3637 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3639 return (isl_set *)isl_map_neg((isl_map *)set);
3642 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3643 * A -> floor(f(A)/d).
3645 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3648 unsigned n_in, n_out, nparam, total, pos;
3649 struct isl_basic_map *result = NULL;
3650 struct isl_dim_map *dim_map;
3656 nparam = isl_basic_map_n_param(bmap);
3657 n_in = isl_basic_map_n_in(bmap);
3658 n_out = isl_basic_map_n_out(bmap);
3660 total = nparam + n_in + n_out + bmap->n_div + n_out;
3661 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3662 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3663 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3664 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3665 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3667 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3668 bmap->n_div + n_out,
3669 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3670 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3671 result = add_divs(result, n_out);
3672 for (i = 0; i < n_out; ++i) {
3674 j = isl_basic_map_alloc_inequality(result);
3677 isl_seq_clr(result->ineq[j], 1+total);
3678 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3679 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3680 j = isl_basic_map_alloc_inequality(result);
3683 isl_seq_clr(result->ineq[j], 1+total);
3684 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3685 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3686 isl_int_sub_ui(result->ineq[j][0], d, 1);
3689 result = isl_basic_map_simplify(result);
3690 return isl_basic_map_finalize(result);
3692 isl_basic_map_free(result);
3696 /* Given a map A -> f(A) and an integer d, construct a map
3697 * A -> floor(f(A)/d).
3699 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3703 map = isl_map_cow(map);
3707 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3708 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3709 for (i = 0; i < map->n; ++i) {
3710 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3721 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3727 i = isl_basic_map_alloc_equality(bmap);
3730 nparam = isl_basic_map_n_param(bmap);
3731 n_in = isl_basic_map_n_in(bmap);
3732 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3733 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3734 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3735 return isl_basic_map_finalize(bmap);
3737 isl_basic_map_free(bmap);
3741 /* Add a constraints to "bmap" expressing i_pos < o_pos
3743 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3749 i = isl_basic_map_alloc_inequality(bmap);
3752 nparam = isl_basic_map_n_param(bmap);
3753 n_in = isl_basic_map_n_in(bmap);
3754 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3755 isl_int_set_si(bmap->ineq[i][0], -1);
3756 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3757 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3758 return isl_basic_map_finalize(bmap);
3760 isl_basic_map_free(bmap);
3764 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3766 static __isl_give isl_basic_map *var_less_or_equal(
3767 __isl_take isl_basic_map *bmap, unsigned pos)
3773 i = isl_basic_map_alloc_inequality(bmap);
3776 nparam = isl_basic_map_n_param(bmap);
3777 n_in = isl_basic_map_n_in(bmap);
3778 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3779 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3780 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3781 return isl_basic_map_finalize(bmap);
3783 isl_basic_map_free(bmap);
3787 /* Add a constraints to "bmap" expressing i_pos > o_pos
3789 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3795 i = isl_basic_map_alloc_inequality(bmap);
3798 nparam = isl_basic_map_n_param(bmap);
3799 n_in = isl_basic_map_n_in(bmap);
3800 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3801 isl_int_set_si(bmap->ineq[i][0], -1);
3802 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3803 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3804 return isl_basic_map_finalize(bmap);
3806 isl_basic_map_free(bmap);
3810 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3812 static __isl_give isl_basic_map *var_more_or_equal(
3813 __isl_take isl_basic_map *bmap, unsigned pos)
3819 i = isl_basic_map_alloc_inequality(bmap);
3822 nparam = isl_basic_map_n_param(bmap);
3823 n_in = isl_basic_map_n_in(bmap);
3824 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3825 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3826 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3827 return isl_basic_map_finalize(bmap);
3829 isl_basic_map_free(bmap);
3833 __isl_give isl_basic_map *isl_basic_map_equal(
3834 __isl_take isl_space *dim, unsigned n_equal)
3837 struct isl_basic_map *bmap;
3838 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3841 for (i = 0; i < n_equal && bmap; ++i)
3842 bmap = var_equal(bmap, i);
3843 return isl_basic_map_finalize(bmap);
3846 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3848 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3852 struct isl_basic_map *bmap;
3853 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3856 for (i = 0; i < pos && bmap; ++i)
3857 bmap = var_equal(bmap, i);
3859 bmap = var_less(bmap, pos);
3860 return isl_basic_map_finalize(bmap);
3863 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3865 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3866 __isl_take isl_space *dim, unsigned pos)
3869 isl_basic_map *bmap;
3871 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3872 for (i = 0; i < pos; ++i)
3873 bmap = var_equal(bmap, i);
3874 bmap = var_less_or_equal(bmap, pos);
3875 return isl_basic_map_finalize(bmap);
3878 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3880 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3884 struct isl_basic_map *bmap;
3885 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3888 for (i = 0; i < pos && bmap; ++i)
3889 bmap = var_equal(bmap, i);
3891 bmap = var_more(bmap, pos);
3892 return isl_basic_map_finalize(bmap);
3895 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3897 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3898 __isl_take isl_space *dim, unsigned pos)
3901 isl_basic_map *bmap;
3903 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3904 for (i = 0; i < pos; ++i)
3905 bmap = var_equal(bmap, i);
3906 bmap = var_more_or_equal(bmap, pos);
3907 return isl_basic_map_finalize(bmap);
3910 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3911 unsigned n, int equal)
3913 struct isl_map *map;
3916 if (n == 0 && equal)
3917 return isl_map_universe(dims);
3919 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3921 for (i = 0; i + 1 < n; ++i)
3922 map = isl_map_add_basic_map(map,
3923 isl_basic_map_less_at(isl_space_copy(dims), i));
3926 map = isl_map_add_basic_map(map,
3927 isl_basic_map_less_or_equal_at(dims, n - 1));
3929 map = isl_map_add_basic_map(map,
3930 isl_basic_map_less_at(dims, n - 1));
3932 isl_space_free(dims);
3937 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3941 return map_lex_lte_first(dims, dims->n_out, equal);
3944 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3946 return map_lex_lte_first(dim, n, 0);
3949 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3951 return map_lex_lte_first(dim, n, 1);
3954 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3956 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3959 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3961 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3964 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3965 unsigned n, int equal)
3967 struct isl_map *map;
3970 if (n == 0 && equal)
3971 return isl_map_universe(dims);
3973 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3975 for (i = 0; i + 1 < n; ++i)
3976 map = isl_map_add_basic_map(map,
3977 isl_basic_map_more_at(isl_space_copy(dims), i));
3980 map = isl_map_add_basic_map(map,
3981 isl_basic_map_more_or_equal_at(dims, n - 1));
3983 map = isl_map_add_basic_map(map,
3984 isl_basic_map_more_at(dims, n - 1));
3986 isl_space_free(dims);
3991 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3995 return map_lex_gte_first(dims, dims->n_out, equal);
3998 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
4000 return map_lex_gte_first(dim, n, 0);
4003 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
4005 return map_lex_gte_first(dim, n, 1);
4008 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
4010 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
4013 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
4015 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
4018 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
4019 __isl_take isl_set *set2)
4022 map = isl_map_lex_le(isl_set_get_space(set1));
4023 map = isl_map_intersect_domain(map, set1);
4024 map = isl_map_intersect_range(map, set2);
4028 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
4029 __isl_take isl_set *set2)
4032 map = isl_map_lex_lt(isl_set_get_space(set1));
4033 map = isl_map_intersect_domain(map, set1);
4034 map = isl_map_intersect_range(map, set2);
4038 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
4039 __isl_take isl_set *set2)
4042 map = isl_map_lex_ge(isl_set_get_space(set1));
4043 map = isl_map_intersect_domain(map, set1);
4044 map = isl_map_intersect_range(map, set2);
4048 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
4049 __isl_take isl_set *set2)
4052 map = isl_map_lex_gt(isl_set_get_space(set1));
4053 map = isl_map_intersect_domain(map, set1);
4054 map = isl_map_intersect_range(map, set2);
4058 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
4059 __isl_take isl_map *map2)
4062 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
4063 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4064 map = isl_map_apply_range(map, isl_map_reverse(map2));
4068 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
4069 __isl_take isl_map *map2)
4072 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
4073 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4074 map = isl_map_apply_range(map, isl_map_reverse(map2));
4078 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
4079 __isl_take isl_map *map2)
4082 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
4083 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4084 map = isl_map_apply_range(map, isl_map_reverse(map2));
4088 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
4089 __isl_take isl_map *map2)
4092 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
4093 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4094 map = isl_map_apply_range(map, isl_map_reverse(map2));
4098 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
4099 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4101 struct isl_basic_map *bmap;
4103 bset = isl_basic_set_cow(bset);
4107 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
4108 isl_space_free(bset->dim);
4109 bmap = (struct isl_basic_map *) bset;
4111 return isl_basic_map_finalize(bmap);
4113 isl_basic_set_free(bset);
4114 isl_space_free(dim);
4118 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
4122 if (bmap->dim->n_in == 0)
4123 return (struct isl_basic_set *)bmap;
4124 bmap = isl_basic_map_cow(bmap);
4127 bmap->dim = isl_space_as_set_space(bmap->dim);
4130 bmap = isl_basic_map_finalize(bmap);
4131 return (struct isl_basic_set *)bmap;
4133 isl_basic_map_free(bmap);
4137 /* For a div d = floor(f/m), add the constraints
4140 * -(f-(n-1)) + m d >= 0
4142 * Note that the second constraint is the negation of
4146 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
4147 unsigned pos, isl_int *div)
4150 unsigned total = isl_basic_map_total_dim(bmap);
4152 i = isl_basic_map_alloc_inequality(bmap);
4155 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
4156 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
4158 j = isl_basic_map_alloc_inequality(bmap);
4161 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
4162 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
4163 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
4167 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
4168 unsigned pos, isl_int *div)
4170 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
4174 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
4176 unsigned total = isl_basic_map_total_dim(bmap);
4177 unsigned div_pos = total - bmap->n_div + div;
4179 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
4183 struct isl_basic_set *isl_basic_map_underlying_set(
4184 struct isl_basic_map *bmap)
4188 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
4190 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
4191 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
4192 return (struct isl_basic_set *)bmap;
4193 bmap = isl_basic_map_cow(bmap);
4196 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
4199 bmap->extra -= bmap->n_div;
4201 bmap = isl_basic_map_finalize(bmap);
4202 return (struct isl_basic_set *)bmap;
4207 __isl_give isl_basic_set *isl_basic_set_underlying_set(
4208 __isl_take isl_basic_set *bset)
4210 return isl_basic_map_underlying_set((isl_basic_map *)bset);
4213 struct isl_basic_map *isl_basic_map_overlying_set(
4214 struct isl_basic_set *bset, struct isl_basic_map *like)
4216 struct isl_basic_map *bmap;
4217 struct isl_ctx *ctx;
4224 isl_assert(ctx, bset->n_div == 0, goto error);
4225 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
4226 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
4228 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
4229 isl_basic_map_free(like);
4230 return (struct isl_basic_map *)bset;
4232 bset = isl_basic_set_cow(bset);
4235 total = bset->dim->n_out + bset->extra;
4236 bmap = (struct isl_basic_map *)bset;
4237 isl_space_free(bmap->dim);
4238 bmap->dim = isl_space_copy(like->dim);
4241 bmap->n_div = like->n_div;
4242 bmap->extra += like->n_div;
4246 ltotal = total - bmap->extra + like->extra;
4249 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
4250 bmap->extra * (1 + 1 + total));
4251 if (isl_blk_is_error(bmap->block2))
4253 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
4257 for (i = 0; i < bmap->extra; ++i)
4258 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
4259 for (i = 0; i < like->n_div; ++i) {
4260 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
4261 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
4263 bmap = isl_basic_map_extend_constraints(bmap,
4264 0, 2 * like->n_div);
4265 for (i = 0; i < like->n_div; ++i) {
4266 if (isl_int_is_zero(bmap->div[i][0]))
4268 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4272 isl_basic_map_free(like);
4273 bmap = isl_basic_map_simplify(bmap);
4274 bmap = isl_basic_map_finalize(bmap);
4277 isl_basic_map_free(like);
4278 isl_basic_set_free(bset);
4282 struct isl_basic_set *isl_basic_set_from_underlying_set(
4283 struct isl_basic_set *bset, struct isl_basic_set *like)
4285 return (struct isl_basic_set *)
4286 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4289 struct isl_set *isl_set_from_underlying_set(
4290 struct isl_set *set, struct isl_basic_set *like)
4296 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4298 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4299 isl_basic_set_free(like);
4302 set = isl_set_cow(set);
4305 for (i = 0; i < set->n; ++i) {
4306 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4307 isl_basic_set_copy(like));
4311 isl_space_free(set->dim);
4312 set->dim = isl_space_copy(like->dim);
4315 isl_basic_set_free(like);
4318 isl_basic_set_free(like);
4323 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4327 map = isl_map_cow(map);
4330 map->dim = isl_space_cow(map->dim);
4334 for (i = 1; i < map->n; ++i)
4335 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4337 for (i = 0; i < map->n; ++i) {
4338 map->p[i] = (struct isl_basic_map *)
4339 isl_basic_map_underlying_set(map->p[i]);
4344 map->dim = isl_space_underlying(map->dim, 0);
4346 isl_space_free(map->dim);
4347 map->dim = isl_space_copy(map->p[0]->dim);
4351 return (struct isl_set *)map;
4357 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4359 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4362 __isl_give isl_basic_map *isl_basic_map_reset_space(
4363 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4365 bmap = isl_basic_map_cow(bmap);
4369 isl_space_free(bmap->dim);
4372 bmap = isl_basic_map_finalize(bmap);
4376 isl_basic_map_free(bmap);
4377 isl_space_free(dim);
4381 __isl_give isl_basic_set *isl_basic_set_reset_space(
4382 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4384 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4388 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4389 __isl_take isl_space *dim)
4393 map = isl_map_cow(map);
4397 for (i = 0; i < map->n; ++i) {
4398 map->p[i] = isl_basic_map_reset_space(map->p[i],
4399 isl_space_copy(dim));
4403 isl_space_free(map->dim);
4409 isl_space_free(dim);
4413 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4414 __isl_take isl_space *dim)
4416 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4419 /* Compute the parameter domain of the given basic set.
4421 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4426 if (isl_basic_set_is_params(bset))
4429 n = isl_basic_set_dim(bset, isl_dim_set);
4430 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4431 space = isl_basic_set_get_space(bset);
4432 space = isl_space_params(space);
4433 bset = isl_basic_set_reset_space(bset, space);
4437 /* Compute the parameter domain of the given set.
4439 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4444 if (isl_set_is_params(set))
4447 n = isl_set_dim(set, isl_dim_set);
4448 set = isl_set_project_out(set, isl_dim_set, 0, n);
4449 space = isl_set_get_space(set);
4450 space = isl_space_params(space);
4451 set = isl_set_reset_space(set, space);
4455 /* Construct a zero-dimensional set with the given parameter domain.
4457 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4460 space = isl_set_get_space(set);
4461 space = isl_space_set_from_params(space);
4462 set = isl_set_reset_space(set, space);
4466 /* Compute the parameter domain of the given map.
4468 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4473 n = isl_map_dim(map, isl_dim_in);
4474 map = isl_map_project_out(map, isl_dim_in, 0, n);
4475 n = isl_map_dim(map, isl_dim_out);
4476 map = isl_map_project_out(map, isl_dim_out, 0, n);
4477 space = isl_map_get_space(map);
4478 space = isl_space_params(space);
4479 map = isl_map_reset_space(map, space);
4483 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4486 struct isl_basic_set *domain;
4492 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4494 n_in = isl_basic_map_n_in(bmap);
4495 n_out = isl_basic_map_n_out(bmap);
4496 domain = isl_basic_set_from_basic_map(bmap);
4497 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4499 domain = isl_basic_set_reset_space(domain, dim);
4504 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4508 return isl_space_may_be_set(bmap->dim);
4511 /* Is this basic map actually a set?
4512 * Users should never call this function. Outside of isl,
4513 * the type should indicate whether something is a set or a map.
4515 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4519 return isl_space_is_set(bmap->dim);
4522 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4526 if (isl_basic_map_is_set(bmap))
4528 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4531 __isl_give isl_basic_map *isl_basic_map_domain_map(
4532 __isl_take isl_basic_map *bmap)
4536 isl_basic_map *domain;
4537 int nparam, n_in, n_out;
4540 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4541 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4542 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4544 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4545 domain = isl_basic_map_universe(dim);
4547 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4548 bmap = isl_basic_map_apply_range(bmap, domain);
4549 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4551 total = isl_basic_map_total_dim(bmap);
4553 for (i = 0; i < n_in; ++i) {
4554 k = isl_basic_map_alloc_equality(bmap);
4557 isl_seq_clr(bmap->eq[k], 1 + total);
4558 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4559 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4562 bmap = isl_basic_map_gauss(bmap, NULL);
4563 return isl_basic_map_finalize(bmap);
4565 isl_basic_map_free(bmap);
4569 __isl_give isl_basic_map *isl_basic_map_range_map(
4570 __isl_take isl_basic_map *bmap)
4574 isl_basic_map *range;
4575 int nparam, n_in, n_out;
4578 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4579 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4580 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4582 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4583 range = isl_basic_map_universe(dim);
4585 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4586 bmap = isl_basic_map_apply_range(bmap, range);
4587 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4589 total = isl_basic_map_total_dim(bmap);
4591 for (i = 0; i < n_out; ++i) {
4592 k = isl_basic_map_alloc_equality(bmap);
4595 isl_seq_clr(bmap->eq[k], 1 + total);
4596 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4597 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4600 bmap = isl_basic_map_gauss(bmap, NULL);
4601 return isl_basic_map_finalize(bmap);
4603 isl_basic_map_free(bmap);
4607 int isl_map_may_be_set(__isl_keep isl_map *map)
4611 return isl_space_may_be_set(map->dim);
4614 /* Is this map actually a set?
4615 * Users should never call this function. Outside of isl,
4616 * the type should indicate whether something is a set or a map.
4618 int isl_map_is_set(__isl_keep isl_map *map)
4622 return isl_space_is_set(map->dim);
4625 struct isl_set *isl_map_range(struct isl_map *map)
4628 struct isl_set *set;
4632 if (isl_map_is_set(map))
4633 return (isl_set *)map;
4635 map = isl_map_cow(map);
4639 set = (struct isl_set *) map;
4640 set->dim = isl_space_range(set->dim);
4643 for (i = 0; i < map->n; ++i) {
4644 set->p[i] = isl_basic_map_range(map->p[i]);
4648 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4649 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4656 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4659 isl_space *domain_dim;
4661 map = isl_map_cow(map);
4665 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4666 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4667 map->dim = isl_space_join(map->dim, domain_dim);
4670 for (i = 0; i < map->n; ++i) {
4671 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4675 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4676 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4683 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4686 isl_space *range_dim;
4688 map = isl_map_cow(map);
4692 range_dim = isl_space_range(isl_map_get_space(map));
4693 range_dim = isl_space_from_range(range_dim);
4694 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4695 map->dim = isl_space_join(map->dim, range_dim);
4698 for (i = 0; i < map->n; ++i) {
4699 map->p[i] = isl_basic_map_range_map(map->p[i]);
4703 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4704 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4711 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4712 __isl_take isl_space *dim)
4715 struct isl_map *map = NULL;
4717 set = isl_set_cow(set);
4720 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4721 map = (struct isl_map *)set;
4722 for (i = 0; i < set->n; ++i) {
4723 map->p[i] = isl_basic_map_from_basic_set(
4724 set->p[i], isl_space_copy(dim));
4728 isl_space_free(map->dim);
4732 isl_space_free(dim);
4737 __isl_give isl_basic_map *isl_basic_map_from_domain(
4738 __isl_take isl_basic_set *bset)
4740 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4743 __isl_give isl_basic_map *isl_basic_map_from_range(
4744 __isl_take isl_basic_set *bset)
4747 space = isl_basic_set_get_space(bset);
4748 space = isl_space_from_range(space);
4749 bset = isl_basic_set_reset_space(bset, space);
4750 return (isl_basic_map *)bset;
4753 struct isl_map *isl_map_from_range(struct isl_set *set)
4756 space = isl_set_get_space(set);
4757 space = isl_space_from_range(space);
4758 set = isl_set_reset_space(set, space);
4759 return (struct isl_map *)set;
4762 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4764 return isl_map_reverse(isl_map_from_range(set));
4767 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4768 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4770 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4773 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4774 __isl_take isl_set *range)
4776 return isl_map_apply_range(isl_map_reverse(domain), range);
4779 struct isl_set *isl_set_from_map(struct isl_map *map)
4782 struct isl_set *set = NULL;
4786 map = isl_map_cow(map);
4789 map->dim = isl_space_as_set_space(map->dim);
4792 set = (struct isl_set *)map;
4793 for (i = 0; i < map->n; ++i) {
4794 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4804 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4807 struct isl_map *map;
4812 isl_die(dim->ctx, isl_error_internal,
4813 "negative number of basic maps", goto error);
4814 map = isl_alloc(dim->ctx, struct isl_map,
4815 sizeof(struct isl_map) +
4816 (n - 1) * sizeof(struct isl_basic_map *));
4820 map->ctx = dim->ctx;
4821 isl_ctx_ref(map->ctx);
4829 isl_space_free(dim);
4833 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4834 unsigned nparam, unsigned in, unsigned out, int n,
4837 struct isl_map *map;
4840 dims = isl_space_alloc(ctx, nparam, in, out);
4844 map = isl_map_alloc_space(dims, n, flags);
4848 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4850 struct isl_basic_map *bmap;
4851 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4852 bmap = isl_basic_map_set_to_empty(bmap);
4856 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4858 struct isl_basic_set *bset;
4859 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4860 bset = isl_basic_set_set_to_empty(bset);
4864 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4866 struct isl_basic_map *bmap;
4869 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4870 bmap = isl_basic_map_set_to_empty(bmap);
4874 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4876 struct isl_basic_map *bmap;
4879 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4880 bmap = isl_basic_map_set_to_empty(bmap);
4884 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4886 struct isl_basic_set *bset;
4889 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4890 bset = isl_basic_set_set_to_empty(bset);
4894 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4896 struct isl_basic_map *bmap;
4897 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4898 bmap = isl_basic_map_finalize(bmap);
4902 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4904 struct isl_basic_set *bset;
4905 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4906 bset = isl_basic_set_finalize(bset);
4910 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4913 unsigned total = isl_space_dim(dim, isl_dim_all);
4914 isl_basic_map *bmap;
4916 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4917 for (i = 0; i < total; ++i) {
4918 int k = isl_basic_map_alloc_inequality(bmap);
4921 isl_seq_clr(bmap->ineq[k], 1 + total);
4922 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4926 isl_basic_map_free(bmap);
4930 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4932 return isl_basic_map_nat_universe(dim);
4935 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4937 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4940 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4942 return isl_map_nat_universe(dim);
4945 __isl_give isl_basic_map *isl_basic_map_universe_like(
4946 __isl_keep isl_basic_map *model)
4950 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4953 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4957 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4960 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4961 __isl_keep isl_set *model)
4965 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4968 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4970 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4973 struct isl_map *isl_map_empty_like(struct isl_map *model)
4977 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4980 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4984 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4987 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4989 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4992 struct isl_set *isl_set_empty_like(struct isl_set *model)
4996 return isl_set_empty(isl_space_copy(model->dim));
4999 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
5001 struct isl_map *map;
5004 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5005 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
5009 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
5011 struct isl_set *set;
5014 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5015 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
5019 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
5023 return isl_set_universe(isl_space_copy(model->dim));
5026 struct isl_map *isl_map_dup(struct isl_map *map)
5029 struct isl_map *dup;
5033 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
5034 for (i = 0; i < map->n; ++i)
5035 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
5039 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
5040 __isl_take isl_basic_map *bmap)
5044 if (isl_basic_map_plain_is_empty(bmap)) {
5045 isl_basic_map_free(bmap);
5048 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
5049 isl_assert(map->ctx, map->n < map->size, goto error);
5050 map->p[map->n] = bmap;
5052 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5058 isl_basic_map_free(bmap);
5062 void isl_map_free(struct isl_map *map)
5072 isl_ctx_deref(map->ctx);
5073 for (i = 0; i < map->n; ++i)
5074 isl_basic_map_free(map->p[i]);
5075 isl_space_free(map->dim);
5079 struct isl_map *isl_map_extend(struct isl_map *base,
5080 unsigned nparam, unsigned n_in, unsigned n_out)
5084 base = isl_map_cow(base);
5088 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
5091 for (i = 0; i < base->n; ++i) {
5092 base->p[i] = isl_basic_map_extend_space(base->p[i],
5093 isl_space_copy(base->dim), 0, 0, 0);
5103 struct isl_set *isl_set_extend(struct isl_set *base,
5104 unsigned nparam, unsigned dim)
5106 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
5110 static struct isl_basic_map *isl_basic_map_fix_pos_si(
5111 struct isl_basic_map *bmap, unsigned pos, int value)
5115 bmap = isl_basic_map_cow(bmap);
5116 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5117 j = isl_basic_map_alloc_equality(bmap);
5120 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5121 isl_int_set_si(bmap->eq[j][pos], -1);
5122 isl_int_set_si(bmap->eq[j][0], value);
5123 bmap = isl_basic_map_simplify(bmap);
5124 return isl_basic_map_finalize(bmap);
5126 isl_basic_map_free(bmap);
5130 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
5131 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
5135 bmap = isl_basic_map_cow(bmap);
5136 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5137 j = isl_basic_map_alloc_equality(bmap);
5140 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5141 isl_int_set_si(bmap->eq[j][pos], -1);
5142 isl_int_set(bmap->eq[j][0], value);
5143 bmap = isl_basic_map_simplify(bmap);
5144 return isl_basic_map_finalize(bmap);
5146 isl_basic_map_free(bmap);
5150 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
5151 enum isl_dim_type type, unsigned pos, int value)
5155 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5156 return isl_basic_map_fix_pos_si(bmap,
5157 isl_basic_map_offset(bmap, type) + pos, value);
5159 isl_basic_map_free(bmap);
5163 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
5164 enum isl_dim_type type, unsigned pos, isl_int value)
5168 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5169 return isl_basic_map_fix_pos(bmap,
5170 isl_basic_map_offset(bmap, type) + pos, value);
5172 isl_basic_map_free(bmap);
5176 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
5177 enum isl_dim_type type, unsigned pos, int value)
5179 return (struct isl_basic_set *)
5180 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5184 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
5185 enum isl_dim_type type, unsigned pos, isl_int value)
5187 return (struct isl_basic_set *)
5188 isl_basic_map_fix((struct isl_basic_map *)bset,
5192 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
5193 unsigned input, int value)
5195 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
5198 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
5199 unsigned dim, int value)
5201 return (struct isl_basic_set *)
5202 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5203 isl_dim_set, dim, value);
5206 static int remove_if_empty(__isl_keep isl_map *map, int i)
5208 int empty = isl_basic_map_plain_is_empty(map->p[i]);
5215 isl_basic_map_free(map->p[i]);
5216 if (i != map->n - 1) {
5217 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5218 map->p[i] = map->p[map->n - 1];
5225 struct isl_map *isl_map_fix_si(struct isl_map *map,
5226 enum isl_dim_type type, unsigned pos, int value)
5230 map = isl_map_cow(map);
5234 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5235 for (i = map->n - 1; i >= 0; --i) {
5236 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
5237 if (remove_if_empty(map, i) < 0)
5240 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5247 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
5248 enum isl_dim_type type, unsigned pos, int value)
5250 return (struct isl_set *)
5251 isl_map_fix_si((struct isl_map *)set, type, pos, value);
5254 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
5255 enum isl_dim_type type, unsigned pos, isl_int value)
5259 map = isl_map_cow(map);
5263 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5264 for (i = 0; i < map->n; ++i) {
5265 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
5269 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5276 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
5277 enum isl_dim_type type, unsigned pos, isl_int value)
5279 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
5282 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
5283 unsigned input, int value)
5285 return isl_map_fix_si(map, isl_dim_in, input, value);
5288 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5290 return (struct isl_set *)
5291 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5294 static __isl_give isl_basic_map *basic_map_bound_si(
5295 __isl_take isl_basic_map *bmap,
5296 enum isl_dim_type type, unsigned pos, int value, int upper)
5302 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5303 pos += isl_basic_map_offset(bmap, type);
5304 bmap = isl_basic_map_cow(bmap);
5305 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5306 j = isl_basic_map_alloc_inequality(bmap);
5309 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5311 isl_int_set_si(bmap->ineq[j][pos], -1);
5312 isl_int_set_si(bmap->ineq[j][0], value);
5314 isl_int_set_si(bmap->ineq[j][pos], 1);
5315 isl_int_set_si(bmap->ineq[j][0], -value);
5317 bmap = isl_basic_map_simplify(bmap);
5318 return isl_basic_map_finalize(bmap);
5320 isl_basic_map_free(bmap);
5324 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5325 __isl_take isl_basic_map *bmap,
5326 enum isl_dim_type type, unsigned pos, int value)
5328 return basic_map_bound_si(bmap, type, pos, value, 0);
5331 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5332 unsigned dim, isl_int value)
5336 bset = isl_basic_set_cow(bset);
5337 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5338 j = isl_basic_set_alloc_inequality(bset);
5341 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5342 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5343 isl_int_neg(bset->ineq[j][0], value);
5344 bset = isl_basic_set_simplify(bset);
5345 return isl_basic_set_finalize(bset);
5347 isl_basic_set_free(bset);
5351 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5352 enum isl_dim_type type, unsigned pos, int value, int upper)
5356 map = isl_map_cow(map);
5360 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5361 for (i = 0; i < map->n; ++i) {
5362 map->p[i] = basic_map_bound_si(map->p[i],
5363 type, pos, value, upper);
5367 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5374 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5375 enum isl_dim_type type, unsigned pos, int value)
5377 return map_bound_si(map, type, pos, value, 0);
5380 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5381 enum isl_dim_type type, unsigned pos, int value)
5383 return map_bound_si(map, type, pos, value, 1);
5386 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5387 enum isl_dim_type type, unsigned pos, int value)
5389 return (struct isl_set *)
5390 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5393 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5394 enum isl_dim_type type, unsigned pos, int value)
5396 return isl_map_upper_bound_si(set, type, pos, value);
5399 /* Bound the given variable of "bmap" from below (or above is "upper"
5400 * is set) to "value".
5402 static __isl_give isl_basic_map *basic_map_bound(
5403 __isl_take isl_basic_map *bmap,
5404 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5410 if (pos >= isl_basic_map_dim(bmap, type))
5411 isl_die(bmap->ctx, isl_error_invalid,
5412 "index out of bounds", goto error);
5413 pos += isl_basic_map_offset(bmap, type);
5414 bmap = isl_basic_map_cow(bmap);
5415 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5416 j = isl_basic_map_alloc_inequality(bmap);
5419 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5421 isl_int_set_si(bmap->ineq[j][pos], -1);
5422 isl_int_set(bmap->ineq[j][0], value);
5424 isl_int_set_si(bmap->ineq[j][pos], 1);
5425 isl_int_neg(bmap->ineq[j][0], value);
5427 bmap = isl_basic_map_simplify(bmap);
5428 return isl_basic_map_finalize(bmap);
5430 isl_basic_map_free(bmap);
5434 /* Bound the given variable of "map" from below (or above is "upper"
5435 * is set) to "value".
5437 static __isl_give isl_map *map_bound(__isl_take isl_map *map,
5438 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5442 map = isl_map_cow(map);
5446 if (pos >= isl_map_dim(map, type))
5447 isl_die(map->ctx, isl_error_invalid,
5448 "index out of bounds", goto error);
5449 for (i = map->n - 1; i >= 0; --i) {
5450 map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper);
5451 if (remove_if_empty(map, i) < 0)
5454 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5461 __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map,
5462 enum isl_dim_type type, unsigned pos, isl_int value)
5464 return map_bound(map, type, pos, value, 0);
5467 __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map,
5468 enum isl_dim_type type, unsigned pos, isl_int value)
5470 return map_bound(map, type, pos, value, 1);
5473 __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set,
5474 enum isl_dim_type type, unsigned pos, isl_int value)
5476 return isl_map_lower_bound(set, type, pos, value);
5479 __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set,
5480 enum isl_dim_type type, unsigned pos, isl_int value)
5482 return isl_map_upper_bound(set, type, pos, value);
5485 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5490 set = isl_set_cow(set);
5494 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5495 for (i = 0; i < set->n; ++i) {
5496 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5506 struct isl_map *isl_map_reverse(struct isl_map *map)
5510 map = isl_map_cow(map);
5514 map->dim = isl_space_reverse(map->dim);
5517 for (i = 0; i < map->n; ++i) {
5518 map->p[i] = isl_basic_map_reverse(map->p[i]);
5522 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5529 static struct isl_map *isl_basic_map_partial_lexopt(
5530 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5531 struct isl_set **empty, int max)
5535 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5536 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5538 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5540 isl_basic_map_free(bmap);
5541 isl_basic_set_free(dom);
5547 struct isl_map *isl_basic_map_partial_lexmax(
5548 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5549 struct isl_set **empty)
5551 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5554 struct isl_map *isl_basic_map_partial_lexmin(
5555 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5556 struct isl_set **empty)
5558 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5561 struct isl_set *isl_basic_set_partial_lexmin(
5562 struct isl_basic_set *bset, struct isl_basic_set *dom,
5563 struct isl_set **empty)
5565 return (struct isl_set *)
5566 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5570 struct isl_set *isl_basic_set_partial_lexmax(
5571 struct isl_basic_set *bset, struct isl_basic_set *dom,
5572 struct isl_set **empty)
5574 return (struct isl_set *)
5575 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5579 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5580 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5581 __isl_give isl_set **empty)
5583 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5586 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5587 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5588 __isl_give isl_set **empty)
5590 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5593 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5594 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5595 __isl_give isl_set **empty)
5597 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5600 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5601 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5602 __isl_give isl_set **empty)
5604 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5607 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5608 __isl_take isl_basic_map *bmap, int max)
5610 isl_basic_set *dom = NULL;
5611 isl_space *dom_space;
5615 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5616 dom = isl_basic_set_universe(dom_space);
5617 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5619 isl_basic_map_free(bmap);
5623 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5624 __isl_take isl_basic_map *bmap)
5626 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5630 #define TYPE isl_pw_multi_aff
5632 #define SUFFIX _pw_multi_aff
5634 #define EMPTY isl_pw_multi_aff_empty
5636 #define ADD isl_pw_multi_aff_union_add
5637 #include "isl_map_lexopt_templ.c"
5639 /* Given a map "map", compute the lexicographically minimal
5640 * (or maximal) image element for each domain element in dom,
5641 * in the form of an isl_pw_multi_aff.
5642 * Set *empty to those elements in dom that do not have an image element.
5644 * We first compute the lexicographically minimal or maximal element
5645 * in the first basic map. This results in a partial solution "res"
5646 * and a subset "todo" of dom that still need to be handled.
5647 * We then consider each of the remaining maps in "map" and successively
5648 * update both "res" and "todo".
5650 static __isl_give isl_pw_multi_aff *isl_map_partial_lexopt_aligned_pw_multi_aff(
5651 __isl_take isl_map *map, __isl_take isl_set *dom,
5652 __isl_give isl_set **empty, int max)
5655 isl_pw_multi_aff *res;
5661 if (isl_map_plain_is_empty(map)) {
5666 return isl_pw_multi_aff_from_map(map);
5669 res = basic_map_partial_lexopt_pw_multi_aff(
5670 isl_basic_map_copy(map->p[0]),
5671 isl_set_copy(dom), &todo, max);
5673 for (i = 1; i < map->n; ++i) {
5674 isl_pw_multi_aff *res_i;
5677 res_i = basic_map_partial_lexopt_pw_multi_aff(
5678 isl_basic_map_copy(map->p[i]),
5679 isl_set_copy(dom), &todo_i, max);
5682 res = isl_pw_multi_aff_union_lexmax(res, res_i);
5684 res = isl_pw_multi_aff_union_lexmin(res, res_i);
5686 todo = isl_set_intersect(todo, todo_i);
5707 #define TYPE isl_map
5711 #define EMPTY isl_map_empty
5713 #define ADD isl_map_union_disjoint
5714 #include "isl_map_lexopt_templ.c"
5716 /* Given a map "map", compute the lexicographically minimal
5717 * (or maximal) image element for each domain element in dom.
5718 * Set *empty to those elements in dom that do not have an image element.
5720 * We first compute the lexicographically minimal or maximal element
5721 * in the first basic map. This results in a partial solution "res"
5722 * and a subset "todo" of dom that still need to be handled.
5723 * We then consider each of the remaining maps in "map" and successively
5724 * update both "res" and "todo".
5726 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5727 * Assume we are computing the lexicographical maximum.
5728 * We first compute the lexicographically maximal element in basic map i.
5729 * This results in a partial solution res_i and a subset todo_i.
5730 * Then we combine these results with those obtain for the first k basic maps
5731 * to obtain a result that is valid for the first k+1 basic maps.
5732 * In particular, the set where there is no solution is the set where
5733 * there is no solution for the first k basic maps and also no solution
5734 * for the ith basic map, i.e.,
5736 * todo^i = todo^k * todo_i
5738 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5739 * solutions, arbitrarily breaking ties in favor of res^k.
5740 * That is, when res^k(a) >= res_i(a), we pick res^k and
5741 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5742 * the lexicographic order.)
5743 * In practice, we compute
5745 * res^k * (res_i . "<=")
5749 * res_i * (res^k . "<")
5751 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5752 * where only one of res^k and res_i provides a solution and we simply pick
5759 * Note that we only compute these intersections when dom(res^k) intersects
5760 * dom(res_i). Otherwise, the only effect of these intersections is to
5761 * potentially break up res^k and res_i into smaller pieces.
5762 * We want to avoid such splintering as much as possible.
5763 * In fact, an earlier implementation of this function would look for
5764 * better results in the domain of res^k and for extra results in todo^k,
5765 * but this would always result in a splintering according to todo^k,
5766 * even when the domain of basic map i is disjoint from the domains of
5767 * the previous basic maps.
5769 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5770 __isl_take isl_map *map, __isl_take isl_set *dom,
5771 __isl_give isl_set **empty, int max)
5774 struct isl_map *res;
5775 struct isl_set *todo;
5780 if (isl_map_plain_is_empty(map)) {
5788 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5789 isl_set_copy(dom), &todo, max);
5791 for (i = 1; i < map->n; ++i) {
5795 isl_space *dim = isl_space_range(isl_map_get_space(res));
5797 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5798 isl_set_copy(dom), &todo_i, max);
5801 lt = isl_map_lex_lt(isl_space_copy(dim));
5802 le = isl_map_lex_le(dim);
5804 lt = isl_map_lex_gt(isl_space_copy(dim));
5805 le = isl_map_lex_ge(dim);
5807 lt = isl_map_apply_range(isl_map_copy(res), lt);
5808 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5809 le = isl_map_apply_range(isl_map_copy(res_i), le);
5810 le = isl_map_intersect(le, isl_map_copy(res));
5812 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5813 res = isl_map_intersect_domain(res,
5814 isl_set_copy(todo_i));
5815 res_i = isl_map_intersect_domain(res_i,
5816 isl_set_copy(todo));
5819 res = isl_map_union_disjoint(res, res_i);
5820 res = isl_map_union_disjoint(res, lt);
5821 res = isl_map_union_disjoint(res, le);
5823 todo = isl_set_intersect(todo, todo_i);
5843 __isl_give isl_map *isl_map_partial_lexmax(
5844 __isl_take isl_map *map, __isl_take isl_set *dom,
5845 __isl_give isl_set **empty)
5847 return isl_map_partial_lexopt(map, dom, empty, 1);
5850 __isl_give isl_map *isl_map_partial_lexmin(
5851 __isl_take isl_map *map, __isl_take isl_set *dom,
5852 __isl_give isl_set **empty)
5854 return isl_map_partial_lexopt(map, dom, empty, 0);
5857 __isl_give isl_set *isl_set_partial_lexmin(
5858 __isl_take isl_set *set, __isl_take isl_set *dom,
5859 __isl_give isl_set **empty)
5861 return (struct isl_set *)
5862 isl_map_partial_lexmin((struct isl_map *)set,
5866 __isl_give isl_set *isl_set_partial_lexmax(
5867 __isl_take isl_set *set, __isl_take isl_set *dom,
5868 __isl_give isl_set **empty)
5870 return (struct isl_set *)
5871 isl_map_partial_lexmax((struct isl_map *)set,
5875 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5877 struct isl_basic_set *dom = NULL;
5882 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5883 dom = isl_basic_set_universe(dom_dim);
5884 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5886 isl_basic_map_free(bmap);
5890 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5892 return isl_basic_map_lexopt(bmap, 0);
5895 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5897 return isl_basic_map_lexopt(bmap, 1);
5900 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5902 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5905 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5907 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5910 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5912 return (isl_set *)isl_map_lexmin((isl_map *)set);
5915 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5917 return (isl_set *)isl_map_lexmax((isl_map *)set);
5920 /* Extract the first and only affine expression from list
5921 * and then add it to *pwaff with the given dom.
5922 * This domain is known to be disjoint from other domains
5923 * because of the way isl_basic_map_foreach_lexmax works.
5925 static int update_dim_opt(__isl_take isl_basic_set *dom,
5926 __isl_take isl_aff_list *list, void *user)
5928 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5930 isl_pw_aff **pwaff = user;
5931 isl_pw_aff *pwaff_i;
5933 if (isl_aff_list_n_aff(list) != 1)
5934 isl_die(ctx, isl_error_internal,
5935 "expecting single element list", goto error);
5937 aff = isl_aff_list_get_aff(list, 0);
5938 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5940 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5942 isl_aff_list_free(list);
5946 isl_basic_set_free(dom);
5947 isl_aff_list_free(list);
5951 /* Given a basic map with one output dimension, compute the minimum or
5952 * maximum of that dimension as an isl_pw_aff.
5954 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5955 * call update_dim_opt on each leaf of the result.
5957 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5960 isl_space *dim = isl_basic_map_get_space(bmap);
5964 dim = isl_space_from_domain(isl_space_domain(dim));
5965 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5966 pwaff = isl_pw_aff_empty(dim);
5968 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5970 return isl_pw_aff_free(pwaff);
5975 /* Compute the minimum or maximum of the given output dimension
5976 * as a function of the parameters and the input dimensions,
5977 * but independently of the other output dimensions.
5979 * We first project out the other output dimension and then compute
5980 * the "lexicographic" maximum in each basic map, combining the results
5981 * using isl_pw_aff_union_max.
5983 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
5990 n_out = isl_map_dim(map, isl_dim_out);
5991 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
5992 map = isl_map_project_out(map, isl_dim_out, 0, pos);
5997 isl_space *dim = isl_map_get_space(map);
5998 dim = isl_space_domain(isl_space_from_range(dim));
6000 return isl_pw_aff_empty(dim);
6003 pwaff = basic_map_dim_opt(map->p[0], max);
6004 for (i = 1; i < map->n; ++i) {
6005 isl_pw_aff *pwaff_i;
6007 pwaff_i = basic_map_dim_opt(map->p[i], max);
6008 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
6016 /* Compute the maximum of the given output dimension as a function of the
6017 * parameters and input dimensions, but independently of
6018 * the other output dimensions.
6020 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
6022 return map_dim_opt(map, pos, 1);
6025 /* Compute the minimum or maximum of the given set dimension
6026 * as a function of the parameters,
6027 * but independently of the other set dimensions.
6029 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
6032 return map_dim_opt(set, pos, max);
6035 /* Compute the maximum of the given set dimension as a function of the
6036 * parameters, but independently of the other set dimensions.
6038 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
6040 return set_dim_opt(set, pos, 1);
6043 /* Compute the minimum of the given set dimension as a function of the
6044 * parameters, but independently of the other set dimensions.
6046 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
6048 return set_dim_opt(set, pos, 0);
6051 /* Apply a preimage specified by "mat" on the parameters of "bset".
6052 * bset is assumed to have only parameters and divs.
6054 static struct isl_basic_set *basic_set_parameter_preimage(
6055 struct isl_basic_set *bset, struct isl_mat *mat)
6062 bset->dim = isl_space_cow(bset->dim);
6066 nparam = isl_basic_set_dim(bset, isl_dim_param);
6068 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
6070 bset->dim->nparam = 0;
6071 bset->dim->n_out = nparam;
6072 bset = isl_basic_set_preimage(bset, mat);
6074 bset->dim->nparam = bset->dim->n_out;
6075 bset->dim->n_out = 0;
6080 isl_basic_set_free(bset);
6084 /* Apply a preimage specified by "mat" on the parameters of "set".
6085 * set is assumed to have only parameters and divs.
6087 static struct isl_set *set_parameter_preimage(
6088 struct isl_set *set, struct isl_mat *mat)
6090 isl_space *dim = NULL;
6096 dim = isl_space_copy(set->dim);
6097 dim = isl_space_cow(dim);
6101 nparam = isl_set_dim(set, isl_dim_param);
6103 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
6106 dim->n_out = nparam;
6107 isl_set_reset_space(set, dim);
6108 set = isl_set_preimage(set, mat);
6111 dim = isl_space_copy(set->dim);
6112 dim = isl_space_cow(dim);
6115 dim->nparam = dim->n_out;
6117 isl_set_reset_space(set, dim);
6120 isl_space_free(dim);
6127 /* Intersect the basic set "bset" with the affine space specified by the
6128 * equalities in "eq".
6130 static struct isl_basic_set *basic_set_append_equalities(
6131 struct isl_basic_set *bset, struct isl_mat *eq)
6139 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
6144 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
6145 for (i = 0; i < eq->n_row; ++i) {
6146 k = isl_basic_set_alloc_equality(bset);
6149 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
6150 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
6154 bset = isl_basic_set_gauss(bset, NULL);
6155 bset = isl_basic_set_finalize(bset);
6160 isl_basic_set_free(bset);
6164 /* Intersect the set "set" with the affine space specified by the
6165 * equalities in "eq".
6167 static struct isl_set *set_append_equalities(struct isl_set *set,
6175 for (i = 0; i < set->n; ++i) {
6176 set->p[i] = basic_set_append_equalities(set->p[i],
6189 /* Project the given basic set onto its parameter domain, possibly introducing
6190 * new, explicit, existential variables in the constraints.
6191 * The input has parameters and (possibly implicit) existential variables.
6192 * The output has the same parameters, but only
6193 * explicit existentially quantified variables.
6195 * The actual projection is performed by pip, but pip doesn't seem
6196 * to like equalities very much, so we first remove the equalities
6197 * among the parameters by performing a variable compression on
6198 * the parameters. Afterward, an inverse transformation is performed
6199 * and the equalities among the parameters are inserted back in.
6201 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
6205 struct isl_mat *T, *T2;
6206 struct isl_set *set;
6207 unsigned nparam, n_div;
6209 bset = isl_basic_set_cow(bset);
6213 if (bset->n_eq == 0)
6214 return isl_basic_set_lexmin(bset);
6216 isl_basic_set_gauss(bset, NULL);
6218 nparam = isl_basic_set_dim(bset, isl_dim_param);
6219 n_div = isl_basic_set_dim(bset, isl_dim_div);
6221 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
6222 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
6225 if (i == bset->n_eq)
6226 return isl_basic_set_lexmin(bset);
6228 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
6230 eq = isl_mat_cow(eq);
6231 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
6232 if (T && T->n_col == 0) {
6236 bset = isl_basic_set_set_to_empty(bset);
6237 return isl_set_from_basic_set(bset);
6239 bset = basic_set_parameter_preimage(bset, T);
6241 set = isl_basic_set_lexmin(bset);
6242 set = set_parameter_preimage(set, T2);
6243 set = set_append_equalities(set, eq);
6247 /* Compute an explicit representation for all the existentially
6248 * quantified variables.
6249 * The input and output dimensions are first turned into parameters.
6250 * compute_divs then returns a map with the same parameters and
6251 * no input or output dimensions and the dimension specification
6252 * is reset to that of the input.
6254 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
6256 struct isl_basic_set *bset;
6257 struct isl_set *set;
6258 struct isl_map *map;
6259 isl_space *dim, *orig_dim = NULL;
6264 bmap = isl_basic_map_cow(bmap);
6268 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6269 n_in = isl_basic_map_dim(bmap, isl_dim_in);
6270 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6271 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
6275 orig_dim = bmap->dim;
6277 bset = (struct isl_basic_set *)bmap;
6279 set = parameter_compute_divs(bset);
6280 map = (struct isl_map *)set;
6281 map = isl_map_reset_space(map, orig_dim);
6285 isl_basic_map_free(bmap);
6289 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
6297 off = isl_space_dim(bmap->dim, isl_dim_all);
6298 for (i = 0; i < bmap->n_div; ++i) {
6299 if (isl_int_is_zero(bmap->div[i][0]))
6301 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
6307 static int map_divs_known(__isl_keep isl_map *map)
6314 for (i = 0; i < map->n; ++i) {
6315 int known = isl_basic_map_divs_known(map->p[i]);
6323 /* If bmap contains any unknown divs, then compute explicit
6324 * expressions for them. However, this computation may be
6325 * quite expensive, so first try to remove divs that aren't
6328 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
6331 struct isl_map *map;
6333 known = isl_basic_map_divs_known(bmap);
6337 return isl_map_from_basic_map(bmap);
6339 bmap = isl_basic_map_drop_redundant_divs(bmap);
6341 known = isl_basic_map_divs_known(bmap);
6345 return isl_map_from_basic_map(bmap);
6347 map = compute_divs(bmap);
6350 isl_basic_map_free(bmap);
6354 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6358 struct isl_map *res;
6365 known = map_divs_known(map);
6373 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6374 for (i = 1 ; i < map->n; ++i) {
6376 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6377 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6378 res = isl_map_union_disjoint(res, r2);
6380 res = isl_map_union(res, r2);
6387 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6389 return (struct isl_set *)
6390 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6393 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6395 return (struct isl_set *)
6396 isl_map_compute_divs((struct isl_map *)set);
6399 struct isl_set *isl_map_domain(struct isl_map *map)
6402 struct isl_set *set;
6407 map = isl_map_cow(map);
6411 set = (struct isl_set *)map;
6412 set->dim = isl_space_domain(set->dim);
6415 for (i = 0; i < map->n; ++i) {
6416 set->p[i] = isl_basic_map_domain(map->p[i]);
6420 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6421 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6428 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6429 __isl_take isl_map *map2)
6433 struct isl_map *map = NULL;
6447 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6449 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6450 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6451 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6453 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6454 map1->n + map2->n, flags);
6457 for (i = 0; i < map1->n; ++i) {
6458 map = isl_map_add_basic_map(map,
6459 isl_basic_map_copy(map1->p[i]));
6463 for (i = 0; i < map2->n; ++i) {
6464 map = isl_map_add_basic_map(map,
6465 isl_basic_map_copy(map2->p[i]));
6479 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6480 __isl_take isl_map *map2)
6482 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6485 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6487 map1 = isl_map_union_disjoint(map1, map2);
6491 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6495 struct isl_set *isl_set_union_disjoint(
6496 struct isl_set *set1, struct isl_set *set2)
6498 return (struct isl_set *)
6499 isl_map_union_disjoint(
6500 (struct isl_map *)set1, (struct isl_map *)set2);
6503 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6505 return (struct isl_set *)
6506 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6509 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6510 __isl_take isl_set *set)
6513 struct isl_map *result;
6519 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6520 isl_die(set->ctx, isl_error_invalid,
6521 "parameters don't match", goto error);
6523 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6524 !isl_map_compatible_range(map, set))
6525 isl_die(set->ctx, isl_error_invalid,
6526 "incompatible spaces", goto error);
6528 if (isl_set_plain_is_universe(set)) {
6533 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6534 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6535 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6537 result = isl_map_alloc_space(isl_space_copy(map->dim),
6538 map->n * set->n, flags);
6541 for (i = 0; i < map->n; ++i)
6542 for (j = 0; j < set->n; ++j) {
6543 result = isl_map_add_basic_map(result,
6544 isl_basic_map_intersect_range(
6545 isl_basic_map_copy(map->p[i]),
6546 isl_basic_set_copy(set->p[j])));
6559 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6560 __isl_take isl_set *set)
6562 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6565 struct isl_map *isl_map_intersect_domain(
6566 struct isl_map *map, struct isl_set *set)
6568 return isl_map_reverse(
6569 isl_map_intersect_range(isl_map_reverse(map), set));
6572 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6573 __isl_take isl_map *map2)
6577 map1 = isl_map_reverse(map1);
6578 map1 = isl_map_apply_range(map1, map2);
6579 return isl_map_reverse(map1);
6586 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6587 __isl_take isl_map *map2)
6589 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6592 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6593 __isl_take isl_map *map2)
6595 isl_space *dim_result;
6596 struct isl_map *result;
6602 dim_result = isl_space_join(isl_space_copy(map1->dim),
6603 isl_space_copy(map2->dim));
6605 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6608 for (i = 0; i < map1->n; ++i)
6609 for (j = 0; j < map2->n; ++j) {
6610 result = isl_map_add_basic_map(result,
6611 isl_basic_map_apply_range(
6612 isl_basic_map_copy(map1->p[i]),
6613 isl_basic_map_copy(map2->p[j])));
6619 if (result && result->n <= 1)
6620 ISL_F_SET(result, ISL_MAP_DISJOINT);
6628 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6629 __isl_take isl_map *map2)
6631 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6635 * returns range - domain
6637 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6639 isl_space *dims, *target_dim;
6640 struct isl_basic_set *bset;
6647 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6648 bmap->dim, isl_dim_out),
6650 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6651 dim = isl_basic_map_n_in(bmap);
6652 nparam = isl_basic_map_n_param(bmap);
6653 bset = isl_basic_set_from_basic_map(bmap);
6654 bset = isl_basic_set_cow(bset);
6655 dims = isl_basic_set_get_space(bset);
6656 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6657 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6658 bset = isl_basic_set_swap_vars(bset, 2*dim);
6659 for (i = 0; i < dim; ++i) {
6660 int j = isl_basic_map_alloc_equality(
6661 (struct isl_basic_map *)bset);
6664 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6665 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6666 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6667 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6669 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6670 bset = isl_basic_set_reset_space(bset, target_dim);
6673 isl_basic_map_free(bmap);
6678 * returns range - domain
6680 __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map)
6684 struct isl_set *result;
6689 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6690 map->dim, isl_dim_out),
6692 dim = isl_map_get_space(map);
6693 dim = isl_space_domain(dim);
6694 result = isl_set_alloc_space(dim, map->n, 0);
6697 for (i = 0; i < map->n; ++i)
6698 result = isl_set_add_basic_set(result,
6699 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6708 * returns [domain -> range] -> range - domain
6710 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6711 __isl_take isl_basic_map *bmap)
6715 isl_basic_map *domain;
6719 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6720 isl_die(bmap->ctx, isl_error_invalid,
6721 "domain and range don't match", goto error);
6723 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6724 n = isl_basic_map_dim(bmap, isl_dim_in);
6726 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6727 domain = isl_basic_map_universe(dim);
6729 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6730 bmap = isl_basic_map_apply_range(bmap, domain);
6731 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6733 total = isl_basic_map_total_dim(bmap);
6735 for (i = 0; i < n; ++i) {
6736 k = isl_basic_map_alloc_equality(bmap);
6739 isl_seq_clr(bmap->eq[k], 1 + total);
6740 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6741 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6742 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6745 bmap = isl_basic_map_gauss(bmap, NULL);
6746 return isl_basic_map_finalize(bmap);
6748 isl_basic_map_free(bmap);
6753 * returns [domain -> range] -> range - domain
6755 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6758 isl_space *domain_dim;
6763 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6764 isl_die(map->ctx, isl_error_invalid,
6765 "domain and range don't match", goto error);
6767 map = isl_map_cow(map);
6771 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6772 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6773 map->dim = isl_space_join(map->dim, domain_dim);
6776 for (i = 0; i < map->n; ++i) {
6777 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6781 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6788 static __isl_give isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6790 struct isl_basic_map *bmap;
6798 nparam = dims->nparam;
6800 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6804 for (i = 0; i < dim; ++i) {
6805 int j = isl_basic_map_alloc_equality(bmap);
6808 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6809 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6810 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6812 return isl_basic_map_finalize(bmap);
6814 isl_basic_map_free(bmap);
6818 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6822 if (dim->n_in != dim->n_out)
6823 isl_die(dim->ctx, isl_error_invalid,
6824 "number of input and output dimensions needs to be "
6825 "the same", goto error);
6826 return basic_map_identity(dim);
6828 isl_space_free(dim);
6832 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6834 if (!model || !model->dim)
6836 return isl_basic_map_identity(isl_space_copy(model->dim));
6839 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6841 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6844 struct isl_map *isl_map_identity_like(struct isl_map *model)
6846 if (!model || !model->dim)
6848 return isl_map_identity(isl_space_copy(model->dim));
6851 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6853 if (!model || !model->dim)
6855 return isl_map_identity(isl_space_copy(model->dim));
6858 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6860 isl_space *dim = isl_set_get_space(set);
6862 id = isl_map_identity(isl_space_map_from_set(dim));
6863 return isl_map_intersect_range(id, set);
6866 /* Construct a basic set with all set dimensions having only non-negative
6869 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6870 __isl_take isl_space *space)
6875 struct isl_basic_set *bset;
6879 nparam = space->nparam;
6881 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6884 for (i = 0; i < dim; ++i) {
6885 int k = isl_basic_set_alloc_inequality(bset);
6888 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6889 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6893 isl_basic_set_free(bset);
6897 /* Construct the half-space x_pos >= 0.
6899 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6903 isl_basic_set *nonneg;
6905 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6906 k = isl_basic_set_alloc_inequality(nonneg);
6909 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6910 isl_int_set_si(nonneg->ineq[k][pos], 1);
6912 return isl_basic_set_finalize(nonneg);
6914 isl_basic_set_free(nonneg);
6918 /* Construct the half-space x_pos <= -1.
6920 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6925 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6926 k = isl_basic_set_alloc_inequality(neg);
6929 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6930 isl_int_set_si(neg->ineq[k][0], -1);
6931 isl_int_set_si(neg->ineq[k][pos], -1);
6933 return isl_basic_set_finalize(neg);
6935 isl_basic_set_free(neg);
6939 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6940 enum isl_dim_type type, unsigned first, unsigned n)
6943 isl_basic_set *nonneg;
6951 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6953 for (i = 0; i < n; ++i) {
6954 nonneg = nonneg_halfspace(isl_set_get_space(set),
6955 pos(set->dim, type) + first + i);
6956 neg = neg_halfspace(isl_set_get_space(set),
6957 pos(set->dim, type) + first + i);
6959 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6968 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6969 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6976 if (isl_set_plain_is_empty(set)) {
6981 return fn(set, signs, user);
6984 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6986 half = isl_set_intersect(half, isl_set_copy(set));
6987 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6991 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6993 half = isl_set_intersect(half, set);
6994 return foreach_orthant(half, signs, first + 1, len, fn, user);
7000 /* Call "fn" on the intersections of "set" with each of the orthants
7001 * (except for obviously empty intersections). The orthant is identified
7002 * by the signs array, with each entry having value 1 or -1 according
7003 * to the sign of the corresponding variable.
7005 int isl_set_foreach_orthant(__isl_keep isl_set *set,
7006 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7016 if (isl_set_plain_is_empty(set))
7019 nparam = isl_set_dim(set, isl_dim_param);
7020 nvar = isl_set_dim(set, isl_dim_set);
7022 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
7024 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
7032 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
7034 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
7037 int isl_basic_map_is_subset(
7038 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7041 struct isl_map *map1;
7042 struct isl_map *map2;
7044 if (!bmap1 || !bmap2)
7047 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
7048 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
7050 is_subset = isl_map_is_subset(map1, map2);
7058 int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
7059 __isl_keep isl_basic_set *bset2)
7061 return isl_basic_map_is_subset(bset1, bset2);
7064 int isl_basic_map_is_equal(
7065 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7069 if (!bmap1 || !bmap2)
7071 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7074 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7078 int isl_basic_set_is_equal(
7079 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7081 return isl_basic_map_is_equal(
7082 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
7085 int isl_map_is_empty(struct isl_map *map)
7092 for (i = 0; i < map->n; ++i) {
7093 is_empty = isl_basic_map_is_empty(map->p[i]);
7102 int isl_map_plain_is_empty(__isl_keep isl_map *map)
7104 return map ? map->n == 0 : -1;
7107 int isl_map_fast_is_empty(__isl_keep isl_map *map)
7109 return isl_map_plain_is_empty(map);
7112 int isl_set_plain_is_empty(struct isl_set *set)
7114 return set ? set->n == 0 : -1;
7117 int isl_set_fast_is_empty(__isl_keep isl_set *set)
7119 return isl_set_plain_is_empty(set);
7122 int isl_set_is_empty(struct isl_set *set)
7124 return isl_map_is_empty((struct isl_map *)set);
7127 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7132 return isl_space_is_equal(map1->dim, map2->dim);
7135 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7140 return isl_space_is_equal(set1->dim, set2->dim);
7143 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7149 is_subset = isl_map_is_subset(map1, map2);
7152 is_subset = isl_map_is_subset(map2, map1);
7156 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7158 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
7161 int isl_basic_map_is_strict_subset(
7162 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7166 if (!bmap1 || !bmap2)
7168 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7171 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7172 if (is_subset == -1)
7177 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
7183 is_subset = isl_map_is_subset(map1, map2);
7186 is_subset = isl_map_is_subset(map2, map1);
7187 if (is_subset == -1)
7192 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7194 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
7197 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
7201 return bmap->n_eq == 0 && bmap->n_ineq == 0;
7204 int isl_basic_set_is_universe(struct isl_basic_set *bset)
7208 return bset->n_eq == 0 && bset->n_ineq == 0;
7211 int isl_map_plain_is_universe(__isl_keep isl_map *map)
7218 for (i = 0; i < map->n; ++i) {
7219 int r = isl_basic_map_is_universe(map->p[i]);
7227 int isl_set_plain_is_universe(__isl_keep isl_set *set)
7229 return isl_map_plain_is_universe((isl_map *) set);
7232 int isl_set_fast_is_universe(__isl_keep isl_set *set)
7234 return isl_set_plain_is_universe(set);
7237 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
7239 struct isl_basic_set *bset = NULL;
7240 struct isl_vec *sample = NULL;
7247 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
7250 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
7251 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
7252 copy = isl_basic_map_remove_redundancies(copy);
7253 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
7254 isl_basic_map_free(copy);
7258 total = 1 + isl_basic_map_total_dim(bmap);
7259 if (bmap->sample && bmap->sample->size == total) {
7260 int contains = isl_basic_map_contains(bmap, bmap->sample);
7266 isl_vec_free(bmap->sample);
7267 bmap->sample = NULL;
7268 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
7271 sample = isl_basic_set_sample_vec(bset);
7274 empty = sample->size == 0;
7275 isl_vec_free(bmap->sample);
7276 bmap->sample = sample;
7278 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
7283 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
7287 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
7290 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
7292 return isl_basic_map_plain_is_empty(bmap);
7295 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
7299 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
7302 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
7304 return isl_basic_set_plain_is_empty(bset);
7307 int isl_basic_set_is_empty(struct isl_basic_set *bset)
7309 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
7312 struct isl_map *isl_basic_map_union(
7313 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7315 struct isl_map *map;
7316 if (!bmap1 || !bmap2)
7319 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
7321 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
7324 map = isl_map_add_basic_map(map, bmap1);
7325 map = isl_map_add_basic_map(map, bmap2);
7328 isl_basic_map_free(bmap1);
7329 isl_basic_map_free(bmap2);
7333 struct isl_set *isl_basic_set_union(
7334 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7336 return (struct isl_set *)isl_basic_map_union(
7337 (struct isl_basic_map *)bset1,
7338 (struct isl_basic_map *)bset2);
7341 /* Order divs such that any div only depends on previous divs */
7342 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
7350 off = isl_space_dim(bmap->dim, isl_dim_all);
7352 for (i = 0; i < bmap->n_div; ++i) {
7354 if (isl_int_is_zero(bmap->div[i][0]))
7356 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
7360 isl_basic_map_swap_div(bmap, i, i + pos);
7366 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7368 return (struct isl_basic_set *)
7369 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7372 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7379 for (i = 0; i < map->n; ++i) {
7380 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7391 /* Apply the expansion computed by isl_merge_divs.
7392 * The expansion itself is given by "exp" while the resulting
7393 * list of divs is given by "div".
7395 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7396 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7401 bset = isl_basic_set_cow(bset);
7405 if (div->n_row < bset->n_div)
7406 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7407 "not an expansion", goto error);
7409 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7410 div->n_row - bset->n_div, 0,
7411 2 * (div->n_row - bset->n_div));
7413 n_div = bset->n_div;
7414 for (i = n_div; i < div->n_row; ++i)
7415 if (isl_basic_set_alloc_div(bset) < 0)
7419 for (i = div->n_row - 1; i >= 0; --i) {
7420 if (j >= 0 && exp[j] == i) {
7422 isl_basic_map_swap_div(bset, i, j);
7425 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7426 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7434 isl_basic_set_free(bset);
7439 /* Look for a div in dst that corresponds to the div "div" in src.
7440 * The divs before "div" in src and dst are assumed to be the same.
7442 * Returns -1 if no corresponding div was found and the position
7443 * of the corresponding div in dst otherwise.
7445 static int find_div(struct isl_basic_map *dst,
7446 struct isl_basic_map *src, unsigned div)
7450 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7452 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7453 for (i = div; i < dst->n_div; ++i)
7454 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7455 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7456 dst->n_div - div) == -1)
7461 struct isl_basic_map *isl_basic_map_align_divs(
7462 struct isl_basic_map *dst, struct isl_basic_map *src)
7465 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7470 if (src->n_div == 0)
7473 for (i = 0; i < src->n_div; ++i)
7474 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7476 src = isl_basic_map_order_divs(src);
7477 dst = isl_basic_map_cow(dst);
7478 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7479 src->n_div, 0, 2 * src->n_div);
7482 for (i = 0; i < src->n_div; ++i) {
7483 int j = find_div(dst, src, i);
7485 j = isl_basic_map_alloc_div(dst);
7488 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7489 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7490 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7494 isl_basic_map_swap_div(dst, i, j);
7498 isl_basic_map_free(dst);
7502 struct isl_basic_set *isl_basic_set_align_divs(
7503 struct isl_basic_set *dst, struct isl_basic_set *src)
7505 return (struct isl_basic_set *)isl_basic_map_align_divs(
7506 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7509 struct isl_map *isl_map_align_divs(struct isl_map *map)
7517 map = isl_map_compute_divs(map);
7518 map = isl_map_cow(map);
7522 for (i = 1; i < map->n; ++i)
7523 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7524 for (i = 1; i < map->n; ++i)
7525 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7527 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7531 struct isl_set *isl_set_align_divs(struct isl_set *set)
7533 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7536 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7537 __isl_take isl_map *map)
7541 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7542 map = isl_map_intersect_domain(map, set);
7543 set = isl_map_range(map);
7551 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7552 __isl_take isl_map *map)
7554 return isl_map_align_params_map_map_and(set, map, &set_apply);
7557 /* There is no need to cow as removing empty parts doesn't change
7558 * the meaning of the set.
7560 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7567 for (i = map->n - 1; i >= 0; --i)
7568 remove_if_empty(map, i);
7573 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7575 return (struct isl_set *)
7576 isl_map_remove_empty_parts((struct isl_map *)set);
7579 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7581 struct isl_basic_map *bmap;
7582 if (!map || map->n == 0)
7584 bmap = map->p[map->n-1];
7585 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7586 return isl_basic_map_copy(bmap);
7589 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7591 return (struct isl_basic_set *)
7592 isl_map_copy_basic_map((struct isl_map *)set);
7595 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7596 __isl_keep isl_basic_map *bmap)
7602 for (i = map->n-1; i >= 0; --i) {
7603 if (map->p[i] != bmap)
7605 map = isl_map_cow(map);
7608 isl_basic_map_free(map->p[i]);
7609 if (i != map->n-1) {
7610 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7611 map->p[i] = map->p[map->n-1];
7622 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7623 struct isl_basic_set *bset)
7625 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7626 (struct isl_basic_map *)bset);
7629 /* Given two basic sets bset1 and bset2, compute the maximal difference
7630 * between the values of dimension pos in bset1 and those in bset2
7631 * for any common value of the parameters and dimensions preceding pos.
7633 static enum isl_lp_result basic_set_maximal_difference_at(
7634 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7635 int pos, isl_int *opt)
7638 struct isl_basic_map *bmap1 = NULL;
7639 struct isl_basic_map *bmap2 = NULL;
7640 struct isl_ctx *ctx;
7641 struct isl_vec *obj;
7644 unsigned dim1, dim2;
7645 enum isl_lp_result res;
7647 if (!bset1 || !bset2)
7648 return isl_lp_error;
7650 nparam = isl_basic_set_n_param(bset1);
7651 dim1 = isl_basic_set_n_dim(bset1);
7652 dim2 = isl_basic_set_n_dim(bset2);
7653 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7654 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7655 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7656 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7657 if (!bmap1 || !bmap2)
7659 bmap1 = isl_basic_map_cow(bmap1);
7660 bmap1 = isl_basic_map_extend(bmap1, nparam,
7661 pos, (dim1 - pos) + (dim2 - pos),
7662 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7663 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7666 total = isl_basic_map_total_dim(bmap1);
7668 obj = isl_vec_alloc(ctx, 1 + total);
7669 isl_seq_clr(obj->block.data, 1 + total);
7670 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7671 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7674 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7676 isl_basic_map_free(bmap1);
7680 isl_basic_map_free(bmap1);
7681 isl_basic_map_free(bmap2);
7682 return isl_lp_error;
7685 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7686 * for any common value of the parameters and dimensions preceding pos
7687 * in both basic sets, the values of dimension pos in bset1 are
7688 * smaller or larger than those in bset2.
7691 * 1 if bset1 follows bset2
7692 * -1 if bset1 precedes bset2
7693 * 0 if bset1 and bset2 are incomparable
7694 * -2 if some error occurred.
7696 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7697 struct isl_basic_set *bset2, int pos)
7700 enum isl_lp_result res;
7705 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7707 if (res == isl_lp_empty)
7709 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7710 res == isl_lp_unbounded)
7712 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7721 /* Given two basic sets bset1 and bset2, check whether
7722 * for any common value of the parameters and dimensions preceding pos
7723 * there is a value of dimension pos in bset1 that is larger
7724 * than a value of the same dimension in bset2.
7727 * 1 if there exists such a pair
7728 * 0 if there is no such pair, but there is a pair of equal values
7730 * -2 if some error occurred.
7732 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7733 __isl_keep isl_basic_set *bset2, int pos)
7736 enum isl_lp_result res;
7741 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7743 if (res == isl_lp_empty)
7745 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7746 res == isl_lp_unbounded)
7748 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7750 else if (res == isl_lp_ok)
7759 /* Given two sets set1 and set2, check whether
7760 * for any common value of the parameters and dimensions preceding pos
7761 * there is a value of dimension pos in set1 that is larger
7762 * than a value of the same dimension in set2.
7765 * 1 if there exists such a pair
7766 * 0 if there is no such pair, but there is a pair of equal values
7768 * -2 if some error occurred.
7770 int isl_set_follows_at(__isl_keep isl_set *set1,
7771 __isl_keep isl_set *set2, int pos)
7779 for (i = 0; i < set1->n; ++i)
7780 for (j = 0; j < set2->n; ++j) {
7782 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7783 if (f == 1 || f == -2)
7792 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7793 unsigned pos, isl_int *val)
7801 total = isl_basic_map_total_dim(bmap);
7802 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7803 for (; d+1 > pos; --d)
7804 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7808 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7810 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7812 if (!isl_int_is_one(bmap->eq[i][1+d]))
7815 isl_int_neg(*val, bmap->eq[i][0]);
7821 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7822 unsigned pos, isl_int *val)
7834 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7837 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7838 for (i = 1; fixed == 1 && i < map->n; ++i) {
7839 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7840 if (fixed == 1 && isl_int_ne(tmp, v))
7844 isl_int_set(*val, v);
7850 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7851 unsigned pos, isl_int *val)
7853 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7857 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7860 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7863 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7864 enum isl_dim_type type, unsigned pos, isl_int *val)
7866 if (pos >= isl_basic_map_dim(bmap, type))
7868 return isl_basic_map_plain_has_fixed_var(bmap,
7869 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7872 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7873 enum isl_dim_type type, unsigned pos, isl_int *val)
7875 if (pos >= isl_map_dim(map, type))
7877 return isl_map_plain_has_fixed_var(map,
7878 map_offset(map, type) - 1 + pos, val);
7881 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7882 enum isl_dim_type type, unsigned pos, isl_int *val)
7884 return isl_map_plain_is_fixed(set, type, pos, val);
7887 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7888 enum isl_dim_type type, unsigned pos, isl_int *val)
7890 return isl_map_plain_is_fixed(map, type, pos, val);
7893 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7894 * then return this fixed value in *val.
7896 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7897 unsigned dim, isl_int *val)
7899 return isl_basic_set_plain_has_fixed_var(bset,
7900 isl_basic_set_n_param(bset) + dim, val);
7903 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7904 * then return this fixed value in *val.
7906 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7907 unsigned dim, isl_int *val)
7909 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7912 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7913 unsigned dim, isl_int *val)
7915 return isl_set_plain_dim_is_fixed(set, dim, val);
7918 /* Check if input variable in has fixed value and if so and if val is not NULL,
7919 * then return this fixed value in *val.
7921 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7922 unsigned in, isl_int *val)
7924 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7927 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7928 * and if val is not NULL, then return this lower bound in *val.
7930 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7931 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7933 int i, i_eq = -1, i_ineq = -1;
7940 total = isl_basic_set_total_dim(bset);
7941 nparam = isl_basic_set_n_param(bset);
7942 for (i = 0; i < bset->n_eq; ++i) {
7943 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7949 for (i = 0; i < bset->n_ineq; ++i) {
7950 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7952 if (i_eq != -1 || i_ineq != -1)
7956 if (i_eq == -1 && i_ineq == -1)
7958 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7959 /* The coefficient should always be one due to normalization. */
7960 if (!isl_int_is_one(c[1+nparam+dim]))
7962 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7964 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7965 total - nparam - dim - 1) != -1)
7968 isl_int_neg(*val, c[0]);
7972 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7973 unsigned dim, isl_int *val)
7985 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7989 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7991 for (i = 1; fixed == 1 && i < set->n; ++i) {
7992 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7994 if (fixed == 1 && isl_int_ne(tmp, v))
7998 isl_int_set(*val, v);
8009 /* uset_gist depends on constraints without existentially quantified
8010 * variables sorting first.
8012 static int qsort_constraint_cmp(const void *p1, const void *p2)
8014 const struct constraint *c1 = (const struct constraint *)p1;
8015 const struct constraint *c2 = (const struct constraint *)p2;
8017 unsigned size = isl_min(c1->size, c2->size);
8019 l1 = isl_seq_last_non_zero(c1->c, size);
8020 l2 = isl_seq_last_non_zero(c2->c, size);
8025 return isl_seq_cmp(c1->c, c2->c, size);
8028 static struct isl_basic_map *isl_basic_map_sort_constraints(
8029 struct isl_basic_map *bmap)
8032 struct constraint *c;
8037 total = isl_basic_map_total_dim(bmap);
8038 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
8041 for (i = 0; i < bmap->n_ineq; ++i) {
8043 c[i].c = bmap->ineq[i];
8045 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
8046 for (i = 0; i < bmap->n_ineq; ++i)
8047 bmap->ineq[i] = c[i].c;
8051 isl_basic_map_free(bmap);
8055 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
8056 __isl_take isl_basic_set *bset)
8058 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
8059 (struct isl_basic_map *)bset);
8062 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
8066 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
8068 bmap = isl_basic_map_remove_redundancies(bmap);
8069 bmap = isl_basic_map_sort_constraints(bmap);
8070 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
8074 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
8076 return (struct isl_basic_set *)isl_basic_map_normalize(
8077 (struct isl_basic_map *)bset);
8080 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
8081 const __isl_keep isl_basic_map *bmap2)
8088 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
8089 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
8090 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
8091 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
8092 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
8093 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
8094 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8095 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
8096 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8097 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
8098 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8100 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
8102 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8104 if (bmap1->n_eq != bmap2->n_eq)
8105 return bmap1->n_eq - bmap2->n_eq;
8106 if (bmap1->n_ineq != bmap2->n_ineq)
8107 return bmap1->n_ineq - bmap2->n_ineq;
8108 if (bmap1->n_div != bmap2->n_div)
8109 return bmap1->n_div - bmap2->n_div;
8110 total = isl_basic_map_total_dim(bmap1);
8111 for (i = 0; i < bmap1->n_eq; ++i) {
8112 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
8116 for (i = 0; i < bmap1->n_ineq; ++i) {
8117 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
8121 for (i = 0; i < bmap1->n_div; ++i) {
8122 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
8129 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
8130 const __isl_keep isl_basic_set *bset2)
8132 return isl_basic_map_plain_cmp(bset1, bset2);
8135 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
8136 const __isl_keep isl_set *set2)
8142 if (set1->n != set2->n)
8143 return set1->n - set2->n;
8145 for (i = 0; i < set1->n; ++i) {
8146 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
8154 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
8155 __isl_keep isl_basic_map *bmap2)
8157 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
8160 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
8161 __isl_keep isl_basic_set *bset2)
8163 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
8164 (isl_basic_map *)bset2);
8167 static int qsort_bmap_cmp(const void *p1, const void *p2)
8169 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
8170 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
8172 return isl_basic_map_plain_cmp(bmap1, bmap2);
8175 /* We normalize in place, but if anything goes wrong we need
8176 * to return NULL, so we need to make sure we don't change the
8177 * meaning of any possible other copies of map.
8179 struct isl_map *isl_map_normalize(struct isl_map *map)
8182 struct isl_basic_map *bmap;
8186 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
8188 for (i = 0; i < map->n; ++i) {
8189 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
8192 isl_basic_map_free(map->p[i]);
8195 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
8196 ISL_F_SET(map, ISL_MAP_NORMALIZED);
8197 map = isl_map_remove_empty_parts(map);
8200 for (i = map->n - 1; i >= 1; --i) {
8201 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
8203 isl_basic_map_free(map->p[i-1]);
8204 for (j = i; j < map->n; ++j)
8205 map->p[j-1] = map->p[j];
8215 struct isl_set *isl_set_normalize(struct isl_set *set)
8217 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
8220 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8230 if (!isl_space_is_equal(map1->dim, map2->dim))
8233 map1 = isl_map_copy(map1);
8234 map2 = isl_map_copy(map2);
8235 map1 = isl_map_normalize(map1);
8236 map2 = isl_map_normalize(map2);
8239 equal = map1->n == map2->n;
8240 for (i = 0; equal && i < map1->n; ++i) {
8241 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
8254 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8256 return isl_map_plain_is_equal(map1, map2);
8259 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8261 return isl_map_plain_is_equal((struct isl_map *)set1,
8262 (struct isl_map *)set2);
8265 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8267 return isl_set_plain_is_equal(set1, set2);
8270 /* Return an interval that ranges from min to max (inclusive)
8272 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
8273 isl_int min, isl_int max)
8276 struct isl_basic_set *bset = NULL;
8278 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
8282 k = isl_basic_set_alloc_inequality(bset);
8285 isl_int_set_si(bset->ineq[k][1], 1);
8286 isl_int_neg(bset->ineq[k][0], min);
8288 k = isl_basic_set_alloc_inequality(bset);
8291 isl_int_set_si(bset->ineq[k][1], -1);
8292 isl_int_set(bset->ineq[k][0], max);
8296 isl_basic_set_free(bset);
8300 /* Return the Cartesian product of the basic sets in list (in the given order).
8302 __isl_give isl_basic_set *isl_basic_set_list_product(
8303 __isl_take struct isl_basic_set_list *list)
8311 struct isl_basic_set *product = NULL;
8315 isl_assert(list->ctx, list->n > 0, goto error);
8316 isl_assert(list->ctx, list->p[0], goto error);
8317 nparam = isl_basic_set_n_param(list->p[0]);
8318 dim = isl_basic_set_n_dim(list->p[0]);
8319 extra = list->p[0]->n_div;
8320 n_eq = list->p[0]->n_eq;
8321 n_ineq = list->p[0]->n_ineq;
8322 for (i = 1; i < list->n; ++i) {
8323 isl_assert(list->ctx, list->p[i], goto error);
8324 isl_assert(list->ctx,
8325 nparam == isl_basic_set_n_param(list->p[i]), goto error);
8326 dim += isl_basic_set_n_dim(list->p[i]);
8327 extra += list->p[i]->n_div;
8328 n_eq += list->p[i]->n_eq;
8329 n_ineq += list->p[i]->n_ineq;
8331 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
8336 for (i = 0; i < list->n; ++i) {
8337 isl_basic_set_add_constraints(product,
8338 isl_basic_set_copy(list->p[i]), dim);
8339 dim += isl_basic_set_n_dim(list->p[i]);
8341 isl_basic_set_list_free(list);
8344 isl_basic_set_free(product);
8345 isl_basic_set_list_free(list);
8349 struct isl_basic_map *isl_basic_map_product(
8350 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
8352 isl_space *dim_result = NULL;
8353 struct isl_basic_map *bmap;
8354 unsigned in1, in2, out1, out2, nparam, total, pos;
8355 struct isl_dim_map *dim_map1, *dim_map2;
8357 if (!bmap1 || !bmap2)
8360 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8361 bmap2->dim, isl_dim_param), goto error);
8362 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8363 isl_space_copy(bmap2->dim));
8365 in1 = isl_basic_map_n_in(bmap1);
8366 in2 = isl_basic_map_n_in(bmap2);
8367 out1 = isl_basic_map_n_out(bmap1);
8368 out2 = isl_basic_map_n_out(bmap2);
8369 nparam = isl_basic_map_n_param(bmap1);
8371 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8372 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8373 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8374 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8375 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8376 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8377 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8378 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8379 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8380 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8381 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8383 bmap = isl_basic_map_alloc_space(dim_result,
8384 bmap1->n_div + bmap2->n_div,
8385 bmap1->n_eq + bmap2->n_eq,
8386 bmap1->n_ineq + bmap2->n_ineq);
8387 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8388 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8389 bmap = isl_basic_map_simplify(bmap);
8390 return isl_basic_map_finalize(bmap);
8392 isl_basic_map_free(bmap1);
8393 isl_basic_map_free(bmap2);
8397 __isl_give isl_basic_map *isl_basic_map_flat_product(
8398 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8400 isl_basic_map *prod;
8402 prod = isl_basic_map_product(bmap1, bmap2);
8403 prod = isl_basic_map_flatten(prod);
8407 __isl_give isl_basic_set *isl_basic_set_flat_product(
8408 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8410 return isl_basic_map_flat_range_product(bset1, bset2);
8413 __isl_give isl_basic_map *isl_basic_map_domain_product(
8414 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8416 isl_space *space_result = NULL;
8417 isl_basic_map *bmap;
8418 unsigned in1, in2, out, nparam, total, pos;
8419 struct isl_dim_map *dim_map1, *dim_map2;
8421 if (!bmap1 || !bmap2)
8424 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8425 isl_space_copy(bmap2->dim));
8427 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8428 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8429 out = isl_basic_map_dim(bmap1, isl_dim_out);
8430 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8432 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8433 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8434 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8435 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8436 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8437 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8438 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8439 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8440 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8441 isl_dim_map_div(dim_map1, bmap1, pos += out);
8442 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8444 bmap = isl_basic_map_alloc_space(space_result,
8445 bmap1->n_div + bmap2->n_div,
8446 bmap1->n_eq + bmap2->n_eq,
8447 bmap1->n_ineq + bmap2->n_ineq);
8448 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8449 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8450 bmap = isl_basic_map_simplify(bmap);
8451 return isl_basic_map_finalize(bmap);
8453 isl_basic_map_free(bmap1);
8454 isl_basic_map_free(bmap2);
8458 __isl_give isl_basic_map *isl_basic_map_range_product(
8459 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8461 isl_space *dim_result = NULL;
8462 isl_basic_map *bmap;
8463 unsigned in, out1, out2, nparam, total, pos;
8464 struct isl_dim_map *dim_map1, *dim_map2;
8466 if (!bmap1 || !bmap2)
8469 if (!isl_space_match(bmap1->dim, isl_dim_param,
8470 bmap2->dim, isl_dim_param))
8471 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
8472 "parameters don't match", goto error);
8474 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8475 isl_space_copy(bmap2->dim));
8477 in = isl_basic_map_dim(bmap1, isl_dim_in);
8478 out1 = isl_basic_map_n_out(bmap1);
8479 out2 = isl_basic_map_n_out(bmap2);
8480 nparam = isl_basic_map_n_param(bmap1);
8482 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8483 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8484 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8485 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8486 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8487 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8488 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8489 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8490 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8491 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8492 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8494 bmap = isl_basic_map_alloc_space(dim_result,
8495 bmap1->n_div + bmap2->n_div,
8496 bmap1->n_eq + bmap2->n_eq,
8497 bmap1->n_ineq + bmap2->n_ineq);
8498 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8499 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8500 bmap = isl_basic_map_simplify(bmap);
8501 return isl_basic_map_finalize(bmap);
8503 isl_basic_map_free(bmap1);
8504 isl_basic_map_free(bmap2);
8508 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8509 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8511 isl_basic_map *prod;
8513 prod = isl_basic_map_range_product(bmap1, bmap2);
8514 prod = isl_basic_map_flatten_range(prod);
8518 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8519 __isl_take isl_map *map2,
8520 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8521 __isl_take isl_space *right),
8522 __isl_give isl_basic_map *(*basic_map_product)(
8523 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8526 struct isl_map *result;
8532 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8533 map2->dim, isl_dim_param), goto error);
8535 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8536 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8537 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8539 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8540 isl_space_copy(map2->dim)),
8541 map1->n * map2->n, flags);
8544 for (i = 0; i < map1->n; ++i)
8545 for (j = 0; j < map2->n; ++j) {
8546 struct isl_basic_map *part;
8547 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8548 isl_basic_map_copy(map2->p[j]));
8549 if (isl_basic_map_is_empty(part))
8550 isl_basic_map_free(part);
8552 result = isl_map_add_basic_map(result, part);
8565 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8567 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8568 __isl_take isl_map *map2)
8570 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8573 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8574 __isl_take isl_map *map2)
8576 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8579 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8581 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8582 __isl_take isl_map *map2)
8586 prod = isl_map_product(map1, map2);
8587 prod = isl_map_flatten(prod);
8591 /* Given two set A and B, construct its Cartesian product A x B.
8593 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8595 return isl_map_range_product(set1, set2);
8598 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8599 __isl_take isl_set *set2)
8601 return isl_map_flat_range_product(set1, set2);
8604 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8606 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8607 __isl_take isl_map *map2)
8609 return map_product(map1, map2, &isl_space_domain_product,
8610 &isl_basic_map_domain_product);
8613 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8615 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8616 __isl_take isl_map *map2)
8618 return map_product(map1, map2, &isl_space_range_product,
8619 &isl_basic_map_range_product);
8622 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8623 __isl_take isl_map *map2)
8625 return isl_map_align_params_map_map_and(map1, map2,
8626 &map_domain_product_aligned);
8629 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8630 __isl_take isl_map *map2)
8632 return isl_map_align_params_map_map_and(map1, map2,
8633 &map_range_product_aligned);
8636 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8638 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8639 __isl_take isl_map *map2)
8643 prod = isl_map_domain_product(map1, map2);
8644 prod = isl_map_flatten_domain(prod);
8648 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8650 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8651 __isl_take isl_map *map2)
8655 prod = isl_map_range_product(map1, map2);
8656 prod = isl_map_flatten_range(prod);
8660 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8663 uint32_t hash = isl_hash_init();
8668 bmap = isl_basic_map_copy(bmap);
8669 bmap = isl_basic_map_normalize(bmap);
8672 total = isl_basic_map_total_dim(bmap);
8673 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8674 for (i = 0; i < bmap->n_eq; ++i) {
8676 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8677 isl_hash_hash(hash, c_hash);
8679 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8680 for (i = 0; i < bmap->n_ineq; ++i) {
8682 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8683 isl_hash_hash(hash, c_hash);
8685 isl_hash_byte(hash, bmap->n_div & 0xFF);
8686 for (i = 0; i < bmap->n_div; ++i) {
8688 if (isl_int_is_zero(bmap->div[i][0]))
8690 isl_hash_byte(hash, i & 0xFF);
8691 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8692 isl_hash_hash(hash, c_hash);
8694 isl_basic_map_free(bmap);
8698 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8700 return isl_basic_map_get_hash((isl_basic_map *)bset);
8703 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8710 map = isl_map_copy(map);
8711 map = isl_map_normalize(map);
8715 hash = isl_hash_init();
8716 for (i = 0; i < map->n; ++i) {
8718 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8719 isl_hash_hash(hash, bmap_hash);
8727 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8729 return isl_map_get_hash((isl_map *)set);
8732 /* Check if the value for dimension dim is completely determined
8733 * by the values of the other parameters and variables.
8734 * That is, check if dimension dim is involved in an equality.
8736 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8743 nparam = isl_basic_set_n_param(bset);
8744 for (i = 0; i < bset->n_eq; ++i)
8745 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8750 /* Check if the value for dimension dim is completely determined
8751 * by the values of the other parameters and variables.
8752 * That is, check if dimension dim is involved in an equality
8753 * for each of the subsets.
8755 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8761 for (i = 0; i < set->n; ++i) {
8763 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8770 int isl_set_n_basic_set(__isl_keep isl_set *set)
8772 return set ? set->n : 0;
8775 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8776 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8783 for (i = 0; i < map->n; ++i)
8784 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8790 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8791 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8798 for (i = 0; i < set->n; ++i)
8799 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8805 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8812 bset = isl_basic_set_cow(bset);
8816 dim = isl_basic_set_get_space(bset);
8817 dim = isl_space_lift(dim, bset->n_div);
8820 isl_space_free(bset->dim);
8822 bset->extra -= bset->n_div;
8825 bset = isl_basic_set_finalize(bset);
8829 isl_basic_set_free(bset);
8833 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8839 set = isl_set_align_divs(set);
8844 set = isl_set_cow(set);
8848 n_div = set->p[0]->n_div;
8849 dim = isl_set_get_space(set);
8850 dim = isl_space_lift(dim, n_div);
8853 isl_space_free(set->dim);
8856 for (i = 0; i < set->n; ++i) {
8857 set->p[i] = isl_basic_set_lift(set->p[i]);
8868 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8871 struct isl_basic_map *bmap;
8878 set = isl_set_align_divs(set);
8883 dim = isl_set_get_space(set);
8884 if (set->n == 0 || set->p[0]->n_div == 0) {
8886 return isl_map_identity(isl_space_map_from_set(dim));
8889 n_div = set->p[0]->n_div;
8890 dim = isl_space_map_from_set(dim);
8891 n_param = isl_space_dim(dim, isl_dim_param);
8892 n_set = isl_space_dim(dim, isl_dim_in);
8893 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8894 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8895 for (i = 0; i < n_set; ++i)
8896 bmap = var_equal(bmap, i);
8898 total = n_param + n_set + n_set + n_div;
8899 for (i = 0; i < n_div; ++i) {
8900 k = isl_basic_map_alloc_inequality(bmap);
8903 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8904 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8905 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8906 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8907 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8908 set->p[0]->div[i][0]);
8910 l = isl_basic_map_alloc_inequality(bmap);
8913 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8914 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8915 set->p[0]->div[i][0]);
8916 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8920 bmap = isl_basic_map_simplify(bmap);
8921 bmap = isl_basic_map_finalize(bmap);
8922 return isl_map_from_basic_map(bmap);
8925 isl_basic_map_free(bmap);
8929 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8937 dim = isl_basic_set_total_dim(bset);
8938 size += bset->n_eq * (1 + dim);
8939 size += bset->n_ineq * (1 + dim);
8940 size += bset->n_div * (2 + dim);
8945 int isl_set_size(__isl_keep isl_set *set)
8953 for (i = 0; i < set->n; ++i)
8954 size += isl_basic_set_size(set->p[i]);
8959 /* Check if there is any lower bound (if lower == 0) and/or upper
8960 * bound (if upper == 0) on the specified dim.
8962 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8963 enum isl_dim_type type, unsigned pos, int lower, int upper)
8970 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8972 pos += isl_basic_map_offset(bmap, type);
8974 for (i = 0; i < bmap->n_div; ++i) {
8975 if (isl_int_is_zero(bmap->div[i][0]))
8977 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8981 for (i = 0; i < bmap->n_eq; ++i)
8982 if (!isl_int_is_zero(bmap->eq[i][pos]))
8985 for (i = 0; i < bmap->n_ineq; ++i) {
8986 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8993 return lower && upper;
8996 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8997 enum isl_dim_type type, unsigned pos)
8999 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
9002 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
9003 enum isl_dim_type type, unsigned pos)
9005 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
9008 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
9009 enum isl_dim_type type, unsigned pos)
9011 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
9014 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
9015 enum isl_dim_type type, unsigned pos)
9022 for (i = 0; i < map->n; ++i) {
9024 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
9025 if (bounded < 0 || !bounded)
9032 /* Return 1 if the specified dim is involved in both an upper bound
9033 * and a lower bound.
9035 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
9036 enum isl_dim_type type, unsigned pos)
9038 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
9041 static int has_any_bound(__isl_keep isl_map *map,
9042 enum isl_dim_type type, unsigned pos,
9043 int (*fn)(__isl_keep isl_basic_map *bmap,
9044 enum isl_dim_type type, unsigned pos))
9051 for (i = 0; i < map->n; ++i) {
9053 bounded = fn(map->p[i], type, pos);
9054 if (bounded < 0 || bounded)
9061 /* Return 1 if the specified dim is involved in any lower bound.
9063 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set,
9064 enum isl_dim_type type, unsigned pos)
9066 return has_any_bound(set, type, pos,
9067 &isl_basic_map_dim_has_lower_bound);
9070 /* Return 1 if the specified dim is involved in any upper bound.
9072 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set *set,
9073 enum isl_dim_type type, unsigned pos)
9075 return has_any_bound(set, type, pos,
9076 &isl_basic_map_dim_has_upper_bound);
9079 /* For each of the "n" variables starting at "first", determine
9080 * the sign of the variable and put the results in the first "n"
9081 * elements of the array "signs".
9083 * 1 means that the variable is non-negative
9084 * -1 means that the variable is non-positive
9085 * 0 means the variable attains both positive and negative values.
9087 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
9088 unsigned first, unsigned n, int *signs)
9090 isl_vec *bound = NULL;
9091 struct isl_tab *tab = NULL;
9092 struct isl_tab_undo *snap;
9095 if (!bset || !signs)
9098 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
9099 tab = isl_tab_from_basic_set(bset, 0);
9103 isl_seq_clr(bound->el, bound->size);
9104 isl_int_set_si(bound->el[0], -1);
9106 snap = isl_tab_snap(tab);
9107 for (i = 0; i < n; ++i) {
9110 isl_int_set_si(bound->el[1 + first + i], -1);
9111 if (isl_tab_add_ineq(tab, bound->el) < 0)
9114 isl_int_set_si(bound->el[1 + first + i], 0);
9115 if (isl_tab_rollback(tab, snap) < 0)
9123 isl_int_set_si(bound->el[1 + first + i], 1);
9124 if (isl_tab_add_ineq(tab, bound->el) < 0)
9127 isl_int_set_si(bound->el[1 + first + i], 0);
9128 if (isl_tab_rollback(tab, snap) < 0)
9131 signs[i] = empty ? -1 : 0;
9135 isl_vec_free(bound);
9139 isl_vec_free(bound);
9143 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
9144 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
9146 if (!bset || !signs)
9148 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
9151 first += pos(bset->dim, type) - 1;
9152 return isl_basic_set_vars_get_sign(bset, first, n, signs);
9155 /* Check if the given basic map is obviously single-valued.
9156 * In particular, for each output dimension, check that there is
9157 * an equality that defines the output dimension in terms of
9158 * earlier dimensions.
9160 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
9170 total = 1 + isl_basic_map_total_dim(bmap);
9171 n_out = isl_basic_map_dim(bmap, isl_dim_out);
9172 o_out = isl_basic_map_offset(bmap, isl_dim_out);
9174 for (i = 0; i < n_out; ++i) {
9175 for (j = 0; j < bmap->n_eq; ++j) {
9176 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
9178 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
9179 total - (o_out + i + 1)) == -1)
9182 if (j >= bmap->n_eq)
9189 /* Check if the given basic map is single-valued.
9194 * and check if the result is a subset of the identity mapping.
9196 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap)
9199 isl_basic_map *test;
9203 sv = isl_basic_map_plain_is_single_valued(bmap);
9207 test = isl_basic_map_reverse(isl_basic_map_copy(bmap));
9208 test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap));
9210 space = isl_basic_map_get_space(bmap);
9211 space = isl_space_map_from_set(isl_space_range(space));
9212 id = isl_basic_map_identity(space);
9214 sv = isl_basic_map_is_subset(test, id);
9216 isl_basic_map_free(test);
9217 isl_basic_map_free(id);
9222 /* Check if the given map is obviously single-valued.
9224 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
9233 return isl_basic_map_plain_is_single_valued(map->p[0]);
9236 /* Check if the given map is single-valued.
9241 * and check if the result is a subset of the identity mapping.
9243 int isl_map_is_single_valued(__isl_keep isl_map *map)
9250 sv = isl_map_plain_is_single_valued(map);
9254 test = isl_map_reverse(isl_map_copy(map));
9255 test = isl_map_apply_range(test, isl_map_copy(map));
9257 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
9258 id = isl_map_identity(dim);
9260 sv = isl_map_is_subset(test, id);
9268 int isl_map_is_injective(__isl_keep isl_map *map)
9272 map = isl_map_copy(map);
9273 map = isl_map_reverse(map);
9274 in = isl_map_is_single_valued(map);
9280 /* Check if the given map is obviously injective.
9282 int isl_map_plain_is_injective(__isl_keep isl_map *map)
9286 map = isl_map_copy(map);
9287 map = isl_map_reverse(map);
9288 in = isl_map_plain_is_single_valued(map);
9294 int isl_map_is_bijective(__isl_keep isl_map *map)
9298 sv = isl_map_is_single_valued(map);
9302 return isl_map_is_injective(map);
9305 int isl_set_is_singleton(__isl_keep isl_set *set)
9307 return isl_map_is_single_valued((isl_map *)set);
9310 int isl_map_is_translation(__isl_keep isl_map *map)
9315 delta = isl_map_deltas(isl_map_copy(map));
9316 ok = isl_set_is_singleton(delta);
9317 isl_set_free(delta);
9322 static int unique(isl_int *p, unsigned pos, unsigned len)
9324 if (isl_seq_first_non_zero(p, pos) != -1)
9326 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
9331 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
9340 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
9343 nvar = isl_basic_set_dim(bset, isl_dim_set);
9344 ovar = isl_space_offset(bset->dim, isl_dim_set);
9345 for (j = 0; j < nvar; ++j) {
9346 int lower = 0, upper = 0;
9347 for (i = 0; i < bset->n_eq; ++i) {
9348 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
9350 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
9356 for (i = 0; i < bset->n_ineq; ++i) {
9357 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
9359 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
9361 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
9366 if (!lower || !upper)
9373 int isl_set_is_box(__isl_keep isl_set *set)
9380 return isl_basic_set_is_box(set->p[0]);
9383 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
9388 return isl_space_is_wrapping(bset->dim);
9391 int isl_set_is_wrapping(__isl_keep isl_set *set)
9396 return isl_space_is_wrapping(set->dim);
9399 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9401 bmap = isl_basic_map_cow(bmap);
9405 bmap->dim = isl_space_wrap(bmap->dim);
9409 bmap = isl_basic_map_finalize(bmap);
9411 return (isl_basic_set *)bmap;
9413 isl_basic_map_free(bmap);
9417 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9421 map = isl_map_cow(map);
9425 for (i = 0; i < map->n; ++i) {
9426 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9430 map->dim = isl_space_wrap(map->dim);
9434 return (isl_set *)map;
9440 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9442 bset = isl_basic_set_cow(bset);
9446 bset->dim = isl_space_unwrap(bset->dim);
9450 bset = isl_basic_set_finalize(bset);
9452 return (isl_basic_map *)bset;
9454 isl_basic_set_free(bset);
9458 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9465 if (!isl_set_is_wrapping(set))
9466 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9469 set = isl_set_cow(set);
9473 for (i = 0; i < set->n; ++i) {
9474 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9479 set->dim = isl_space_unwrap(set->dim);
9483 return (isl_map *)set;
9489 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9490 enum isl_dim_type type)
9495 if (!isl_space_is_named_or_nested(bmap->dim, type))
9498 bmap = isl_basic_map_cow(bmap);
9502 bmap->dim = isl_space_reset(bmap->dim, type);
9506 bmap = isl_basic_map_finalize(bmap);
9510 isl_basic_map_free(bmap);
9514 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9515 enum isl_dim_type type)
9522 if (!isl_space_is_named_or_nested(map->dim, type))
9525 map = isl_map_cow(map);
9529 for (i = 0; i < map->n; ++i) {
9530 map->p[i] = isl_basic_map_reset(map->p[i], type);
9534 map->dim = isl_space_reset(map->dim, type);
9544 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9549 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9552 bmap = isl_basic_map_cow(bmap);
9556 bmap->dim = isl_space_flatten(bmap->dim);
9560 bmap = isl_basic_map_finalize(bmap);
9564 isl_basic_map_free(bmap);
9568 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9570 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9573 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9574 __isl_take isl_basic_map *bmap)
9579 if (!bmap->dim->nested[0])
9582 bmap = isl_basic_map_cow(bmap);
9586 bmap->dim = isl_space_flatten_domain(bmap->dim);
9590 bmap = isl_basic_map_finalize(bmap);
9594 isl_basic_map_free(bmap);
9598 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9599 __isl_take isl_basic_map *bmap)
9604 if (!bmap->dim->nested[1])
9607 bmap = isl_basic_map_cow(bmap);
9611 bmap->dim = isl_space_flatten_range(bmap->dim);
9615 bmap = isl_basic_map_finalize(bmap);
9619 isl_basic_map_free(bmap);
9623 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9630 if (!map->dim->nested[0] && !map->dim->nested[1])
9633 map = isl_map_cow(map);
9637 for (i = 0; i < map->n; ++i) {
9638 map->p[i] = isl_basic_map_flatten(map->p[i]);
9642 map->dim = isl_space_flatten(map->dim);
9652 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9654 return (isl_set *)isl_map_flatten((isl_map *)set);
9657 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9659 isl_space *dim, *flat_dim;
9662 dim = isl_set_get_space(set);
9663 flat_dim = isl_space_flatten(isl_space_copy(dim));
9664 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9665 map = isl_map_intersect_domain(map, set);
9670 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9677 if (!map->dim->nested[0])
9680 map = isl_map_cow(map);
9684 for (i = 0; i < map->n; ++i) {
9685 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9689 map->dim = isl_space_flatten_domain(map->dim);
9699 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9706 if (!map->dim->nested[1])
9709 map = isl_map_cow(map);
9713 for (i = 0; i < map->n; ++i) {
9714 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9718 map->dim = isl_space_flatten_range(map->dim);
9728 /* Reorder the dimensions of "bmap" according to the given dim_map
9729 * and set the dimension specification to "dim".
9731 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9732 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9737 bmap = isl_basic_map_cow(bmap);
9738 if (!bmap || !dim || !dim_map)
9741 flags = bmap->flags;
9742 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9743 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9744 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9745 res = isl_basic_map_alloc_space(dim,
9746 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9747 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9750 res = isl_basic_map_finalize(res);
9754 isl_basic_map_free(bmap);
9755 isl_space_free(dim);
9759 /* Reorder the dimensions of "map" according to given reordering.
9761 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9762 __isl_take isl_reordering *r)
9765 struct isl_dim_map *dim_map;
9767 map = isl_map_cow(map);
9768 dim_map = isl_dim_map_from_reordering(r);
9769 if (!map || !r || !dim_map)
9772 for (i = 0; i < map->n; ++i) {
9773 struct isl_dim_map *dim_map_i;
9775 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9777 map->p[i] = isl_basic_map_realign(map->p[i],
9778 isl_space_copy(r->dim), dim_map_i);
9784 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9786 isl_reordering_free(r);
9792 isl_reordering_free(r);
9796 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9797 __isl_take isl_reordering *r)
9799 return (isl_set *)isl_map_realign((isl_map *)set, r);
9802 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9803 __isl_take isl_space *model)
9810 ctx = isl_space_get_ctx(model);
9811 if (!isl_space_has_named_params(model))
9812 isl_die(ctx, isl_error_invalid,
9813 "model has unnamed parameters", goto error);
9814 if (!isl_space_has_named_params(map->dim))
9815 isl_die(ctx, isl_error_invalid,
9816 "relation has unnamed parameters", goto error);
9817 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9818 isl_reordering *exp;
9820 model = isl_space_drop_dims(model, isl_dim_in,
9821 0, isl_space_dim(model, isl_dim_in));
9822 model = isl_space_drop_dims(model, isl_dim_out,
9823 0, isl_space_dim(model, isl_dim_out));
9824 exp = isl_parameter_alignment_reordering(map->dim, model);
9825 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9826 map = isl_map_realign(map, exp);
9829 isl_space_free(model);
9832 isl_space_free(model);
9837 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9838 __isl_take isl_space *model)
9840 return isl_map_align_params(set, model);
9843 /* Align the parameters of "bmap" to those of "model", introducing
9844 * additional parameters if needed.
9846 __isl_give isl_basic_map *isl_basic_map_align_params(
9847 __isl_take isl_basic_map *bmap, __isl_take isl_space *model)
9851 if (!bmap || !model)
9854 ctx = isl_space_get_ctx(model);
9855 if (!isl_space_has_named_params(model))
9856 isl_die(ctx, isl_error_invalid,
9857 "model has unnamed parameters", goto error);
9858 if (!isl_space_has_named_params(bmap->dim))
9859 isl_die(ctx, isl_error_invalid,
9860 "relation has unnamed parameters", goto error);
9861 if (!isl_space_match(bmap->dim, isl_dim_param, model, isl_dim_param)) {
9862 isl_reordering *exp;
9863 struct isl_dim_map *dim_map;
9865 model = isl_space_drop_dims(model, isl_dim_in,
9866 0, isl_space_dim(model, isl_dim_in));
9867 model = isl_space_drop_dims(model, isl_dim_out,
9868 0, isl_space_dim(model, isl_dim_out));
9869 exp = isl_parameter_alignment_reordering(bmap->dim, model);
9870 exp = isl_reordering_extend_space(exp,
9871 isl_basic_map_get_space(bmap));
9872 dim_map = isl_dim_map_from_reordering(exp);
9873 bmap = isl_basic_map_realign(bmap,
9874 exp ? isl_space_copy(exp->dim) : NULL,
9875 isl_dim_map_extend(dim_map, bmap));
9876 isl_reordering_free(exp);
9880 isl_space_free(model);
9883 isl_space_free(model);
9884 isl_basic_map_free(bmap);
9888 /* Align the parameters of "bset" to those of "model", introducing
9889 * additional parameters if needed.
9891 __isl_give isl_basic_set *isl_basic_set_align_params(
9892 __isl_take isl_basic_set *bset, __isl_take isl_space *model)
9894 return isl_basic_map_align_params(bset, model);
9897 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9898 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9899 enum isl_dim_type c2, enum isl_dim_type c3,
9900 enum isl_dim_type c4, enum isl_dim_type c5)
9902 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9903 struct isl_mat *mat;
9909 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9910 isl_basic_map_total_dim(bmap) + 1);
9913 for (i = 0; i < bmap->n_eq; ++i)
9914 for (j = 0, pos = 0; j < 5; ++j) {
9915 int off = isl_basic_map_offset(bmap, c[j]);
9916 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9917 isl_int_set(mat->row[i][pos],
9918 bmap->eq[i][off + k]);
9926 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9927 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9928 enum isl_dim_type c2, enum isl_dim_type c3,
9929 enum isl_dim_type c4, enum isl_dim_type c5)
9931 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9932 struct isl_mat *mat;
9938 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9939 isl_basic_map_total_dim(bmap) + 1);
9942 for (i = 0; i < bmap->n_ineq; ++i)
9943 for (j = 0, pos = 0; j < 5; ++j) {
9944 int off = isl_basic_map_offset(bmap, c[j]);
9945 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9946 isl_int_set(mat->row[i][pos],
9947 bmap->ineq[i][off + k]);
9955 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9956 __isl_take isl_space *dim,
9957 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9958 enum isl_dim_type c2, enum isl_dim_type c3,
9959 enum isl_dim_type c4, enum isl_dim_type c5)
9961 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9962 isl_basic_map *bmap;
9968 if (!dim || !eq || !ineq)
9971 if (eq->n_col != ineq->n_col)
9972 isl_die(dim->ctx, isl_error_invalid,
9973 "equalities and inequalities matrices should have "
9974 "same number of columns", goto error);
9976 total = 1 + isl_space_dim(dim, isl_dim_all);
9978 if (eq->n_col < total)
9979 isl_die(dim->ctx, isl_error_invalid,
9980 "number of columns too small", goto error);
9982 extra = eq->n_col - total;
9984 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9985 eq->n_row, ineq->n_row);
9988 for (i = 0; i < extra; ++i) {
9989 k = isl_basic_map_alloc_div(bmap);
9992 isl_int_set_si(bmap->div[k][0], 0);
9994 for (i = 0; i < eq->n_row; ++i) {
9995 l = isl_basic_map_alloc_equality(bmap);
9998 for (j = 0, pos = 0; j < 5; ++j) {
9999 int off = isl_basic_map_offset(bmap, c[j]);
10000 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10001 isl_int_set(bmap->eq[l][off + k],
10007 for (i = 0; i < ineq->n_row; ++i) {
10008 l = isl_basic_map_alloc_inequality(bmap);
10011 for (j = 0, pos = 0; j < 5; ++j) {
10012 int off = isl_basic_map_offset(bmap, c[j]);
10013 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10014 isl_int_set(bmap->ineq[l][off + k],
10015 ineq->row[i][pos]);
10021 isl_space_free(dim);
10023 isl_mat_free(ineq);
10027 isl_space_free(dim);
10029 isl_mat_free(ineq);
10033 __isl_give isl_mat *isl_basic_set_equalities_matrix(
10034 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10035 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10037 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
10038 c1, c2, c3, c4, isl_dim_in);
10041 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
10042 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10043 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10045 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
10046 c1, c2, c3, c4, isl_dim_in);
10049 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
10050 __isl_take isl_space *dim,
10051 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
10052 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10054 return (isl_basic_set*)
10055 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
10056 c1, c2, c3, c4, isl_dim_in);
10059 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
10064 return isl_space_can_zip(bmap->dim);
10067 int isl_map_can_zip(__isl_keep isl_map *map)
10072 return isl_space_can_zip(map->dim);
10075 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10076 * (A -> C) -> (B -> D).
10078 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
10087 if (!isl_basic_map_can_zip(bmap))
10088 isl_die(bmap->ctx, isl_error_invalid,
10089 "basic map cannot be zipped", goto error);
10090 pos = isl_basic_map_offset(bmap, isl_dim_in) +
10091 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
10092 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
10093 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
10094 bmap = isl_basic_map_cow(bmap);
10095 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
10098 bmap->dim = isl_space_zip(bmap->dim);
10103 isl_basic_map_free(bmap);
10107 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10108 * (A -> C) -> (B -> D).
10110 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
10117 if (!isl_map_can_zip(map))
10118 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
10121 map = isl_map_cow(map);
10125 for (i = 0; i < map->n; ++i) {
10126 map->p[i] = isl_basic_map_zip(map->p[i]);
10131 map->dim = isl_space_zip(map->dim);
10141 /* Can we apply isl_basic_map_curry to "bmap"?
10142 * That is, does it have a nested relation in its domain?
10144 int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap)
10149 return isl_space_can_curry(bmap->dim);
10152 /* Can we apply isl_map_curry to "map"?
10153 * That is, does it have a nested relation in its domain?
10155 int isl_map_can_curry(__isl_keep isl_map *map)
10160 return isl_space_can_curry(map->dim);
10163 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10166 __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap)
10172 if (!isl_basic_map_can_curry(bmap))
10173 isl_die(bmap->ctx, isl_error_invalid,
10174 "basic map cannot be curried", goto error);
10175 bmap->dim = isl_space_curry(bmap->dim);
10180 isl_basic_map_free(bmap);
10184 /* Given a map (A -> B) -> C, return the corresponding map
10187 __isl_give isl_map *isl_map_curry(__isl_take isl_map *map)
10194 if (!isl_map_can_curry(map))
10195 isl_die(map->ctx, isl_error_invalid, "map cannot be curried",
10198 map = isl_map_cow(map);
10202 for (i = 0; i < map->n; ++i) {
10203 map->p[i] = isl_basic_map_curry(map->p[i]);
10208 map->dim = isl_space_curry(map->dim);
10218 /* Construct a basic map mapping the domain of the affine expression
10219 * to a one-dimensional range prescribed by the affine expression.
10221 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
10225 isl_local_space *ls;
10226 isl_basic_map *bmap;
10231 ls = isl_aff_get_local_space(aff);
10232 bmap = isl_basic_map_from_local_space(ls);
10233 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
10234 k = isl_basic_map_alloc_equality(bmap);
10238 pos = isl_basic_map_offset(bmap, isl_dim_out);
10239 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
10240 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
10241 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
10242 aff->v->size - (pos + 1));
10245 bmap = isl_basic_map_finalize(bmap);
10249 isl_basic_map_free(bmap);
10253 /* Construct a map mapping the domain of the affine expression
10254 * to a one-dimensional range prescribed by the affine expression.
10256 __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff)
10258 isl_basic_map *bmap;
10260 bmap = isl_basic_map_from_aff(aff);
10261 return isl_map_from_basic_map(bmap);
10264 /* Construct a basic map mapping the domain the multi-affine expression
10265 * to its range, with each dimension in the range equated to the
10266 * corresponding affine expression.
10268 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
10269 __isl_take isl_multi_aff *maff)
10273 isl_basic_map *bmap;
10278 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
10279 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
10280 "invalid space", return isl_multi_aff_free(maff));
10282 space = isl_space_domain(isl_multi_aff_get_space(maff));
10283 bmap = isl_basic_map_universe(isl_space_from_domain(space));
10285 for (i = 0; i < maff->n; ++i) {
10287 isl_basic_map *bmap_i;
10289 aff = isl_aff_copy(maff->p[i]);
10290 bmap_i = isl_basic_map_from_aff(aff);
10292 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10295 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
10297 isl_multi_aff_free(maff);
10301 /* Construct a map mapping the domain the multi-affine expression
10302 * to its range, with each dimension in the range equated to the
10303 * corresponding affine expression.
10305 __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff)
10307 isl_basic_map *bmap;
10309 bmap = isl_basic_map_from_multi_aff(maff);
10310 return isl_map_from_basic_map(bmap);
10313 /* Construct a basic map mapping a domain in the given space to
10314 * to an n-dimensional range, with n the number of elements in the list,
10315 * where each coordinate in the range is prescribed by the
10316 * corresponding affine expression.
10317 * The domains of all affine expressions in the list are assumed to match
10320 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
10321 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
10325 isl_basic_map *bmap;
10330 dim = isl_space_from_domain(domain_dim);
10331 bmap = isl_basic_map_universe(dim);
10333 for (i = 0; i < list->n; ++i) {
10335 isl_basic_map *bmap_i;
10337 aff = isl_aff_copy(list->p[i]);
10338 bmap_i = isl_basic_map_from_aff(aff);
10340 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10343 isl_aff_list_free(list);
10347 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
10348 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10350 return isl_map_equate(set, type1, pos1, type2, pos2);
10353 /* Construct a basic map where the given dimensions are equal to each other.
10355 static __isl_give isl_basic_map *equator(__isl_take isl_space *space,
10356 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10358 isl_basic_map *bmap = NULL;
10364 if (pos1 >= isl_space_dim(space, type1))
10365 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10366 "index out of bounds", goto error);
10367 if (pos2 >= isl_space_dim(space, type2))
10368 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10369 "index out of bounds", goto error);
10371 if (type1 == type2 && pos1 == pos2)
10372 return isl_basic_map_universe(space);
10374 bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0);
10375 i = isl_basic_map_alloc_equality(bmap);
10378 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10379 pos1 += isl_basic_map_offset(bmap, type1);
10380 pos2 += isl_basic_map_offset(bmap, type2);
10381 isl_int_set_si(bmap->eq[i][pos1], -1);
10382 isl_int_set_si(bmap->eq[i][pos2], 1);
10383 bmap = isl_basic_map_finalize(bmap);
10384 isl_space_free(space);
10387 isl_space_free(space);
10388 isl_basic_map_free(bmap);
10392 /* Add a constraint imposing that the given two dimensions are equal.
10394 __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap,
10395 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10399 eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
10401 bmap = isl_basic_map_intersect(bmap, eq);
10406 /* Add a constraint imposing that the given two dimensions are equal.
10408 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
10409 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10411 isl_basic_map *bmap;
10413 bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2);
10415 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10420 /* Add a constraint imposing that the given two dimensions have opposite values.
10422 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
10423 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10425 isl_basic_map *bmap = NULL;
10431 if (pos1 >= isl_map_dim(map, type1))
10432 isl_die(map->ctx, isl_error_invalid,
10433 "index out of bounds", goto error);
10434 if (pos2 >= isl_map_dim(map, type2))
10435 isl_die(map->ctx, isl_error_invalid,
10436 "index out of bounds", goto error);
10438 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
10439 i = isl_basic_map_alloc_equality(bmap);
10442 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10443 pos1 += isl_basic_map_offset(bmap, type1);
10444 pos2 += isl_basic_map_offset(bmap, type2);
10445 isl_int_set_si(bmap->eq[i][pos1], 1);
10446 isl_int_set_si(bmap->eq[i][pos2], 1);
10447 bmap = isl_basic_map_finalize(bmap);
10449 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10453 isl_basic_map_free(bmap);
10458 /* Add a constraint imposing that the value of the first dimension is
10459 * greater than that of the second.
10461 __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map,
10462 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10464 isl_basic_map *bmap = NULL;
10470 if (pos1 >= isl_map_dim(map, type1))
10471 isl_die(map->ctx, isl_error_invalid,
10472 "index out of bounds", goto error);
10473 if (pos2 >= isl_map_dim(map, type2))
10474 isl_die(map->ctx, isl_error_invalid,
10475 "index out of bounds", goto error);
10477 if (type1 == type2 && pos1 == pos2) {
10478 isl_space *space = isl_map_get_space(map);
10480 return isl_map_empty(space);
10483 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 0, 1);
10484 i = isl_basic_map_alloc_inequality(bmap);
10487 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
10488 pos1 += isl_basic_map_offset(bmap, type1);
10489 pos2 += isl_basic_map_offset(bmap, type2);
10490 isl_int_set_si(bmap->ineq[i][pos1], 1);
10491 isl_int_set_si(bmap->ineq[i][pos2], -1);
10492 isl_int_set_si(bmap->ineq[i][0], -1);
10493 bmap = isl_basic_map_finalize(bmap);
10495 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10499 isl_basic_map_free(bmap);
10504 /* Add a constraint imposing that the value of the first dimension is
10505 * smaller than that of the second.
10507 __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map,
10508 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10510 return isl_map_order_gt(map, type2, pos2, type1, pos1);
10513 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
10517 isl_local_space *ls;
10522 if (!isl_basic_map_divs_known(bmap))
10523 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
10524 "some divs are unknown", return NULL);
10526 ls = isl_basic_map_get_local_space(bmap);
10527 div = isl_local_space_get_div(ls, pos);
10528 isl_local_space_free(ls);
10533 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
10536 return isl_basic_map_get_div(bset, pos);
10539 /* Plug in "subs" for dimension "type", "pos" of "bset".
10541 * Let i be the dimension to replace and let "subs" be of the form
10545 * Any integer division with a non-zero coefficient for i,
10547 * floor((a i + g)/m)
10551 * floor((a f + d g)/(m d))
10553 * Constraints of the form
10561 __isl_give isl_basic_set *isl_basic_set_substitute(
10562 __isl_take isl_basic_set *bset,
10563 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10569 if (bset && isl_basic_set_plain_is_empty(bset))
10572 bset = isl_basic_set_cow(bset);
10573 if (!bset || !subs)
10576 ctx = isl_basic_set_get_ctx(bset);
10577 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
10578 isl_die(ctx, isl_error_invalid,
10579 "spaces don't match", goto error);
10580 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
10581 isl_die(ctx, isl_error_unsupported,
10582 "cannot handle divs yet", goto error);
10584 pos += isl_basic_set_offset(bset, type);
10588 for (i = 0; i < bset->n_eq; ++i) {
10589 if (isl_int_is_zero(bset->eq[i][pos]))
10591 isl_int_set(v, bset->eq[i][pos]);
10592 isl_int_set_si(bset->eq[i][pos], 0);
10593 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
10594 v, subs->v->el + 1, subs->v->size - 1);
10597 for (i = 0; i < bset->n_ineq; ++i) {
10598 if (isl_int_is_zero(bset->ineq[i][pos]))
10600 isl_int_set(v, bset->ineq[i][pos]);
10601 isl_int_set_si(bset->ineq[i][pos], 0);
10602 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
10603 v, subs->v->el + 1, subs->v->size - 1);
10606 for (i = 0; i < bset->n_div; ++i) {
10607 if (isl_int_is_zero(bset->div[i][1 + pos]))
10609 isl_int_set(v, bset->div[i][1 + pos]);
10610 isl_int_set_si(bset->div[i][1 + pos], 0);
10611 isl_seq_combine(bset->div[i] + 1,
10612 subs->v->el[0], bset->div[i] + 1,
10613 v, subs->v->el + 1, subs->v->size - 1);
10614 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
10619 bset = isl_basic_set_simplify(bset);
10620 return isl_basic_set_finalize(bset);
10622 isl_basic_set_free(bset);
10626 /* Plug in "subs" for dimension "type", "pos" of "set".
10628 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
10629 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10633 if (set && isl_set_plain_is_empty(set))
10636 set = isl_set_cow(set);
10640 for (i = set->n - 1; i >= 0; --i) {
10641 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10642 if (remove_if_empty(set, i) < 0)