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 return 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 /* Remove all divs that are unknown or defined in terms of unknown divs.
2138 __isl_give isl_basic_set *isl_basic_set_remove_unknown_divs(
2139 __isl_take isl_basic_set *bset)
2141 return isl_basic_map_remove_unknown_divs(bset);
2144 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
2153 map = isl_map_cow(map);
2157 for (i = 0; i < map->n; ++i) {
2158 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
2168 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
2170 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
2173 __isl_give isl_basic_set *isl_basic_set_remove_dims(
2174 __isl_take isl_basic_set *bset,
2175 enum isl_dim_type type, unsigned first, unsigned n)
2177 return (isl_basic_set *)
2178 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
2181 struct isl_map *isl_map_remove_dims(struct isl_map *map,
2182 enum isl_dim_type type, unsigned first, unsigned n)
2189 map = isl_map_cow(map);
2192 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2194 for (i = 0; i < map->n; ++i) {
2195 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
2196 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
2200 map = isl_map_drop(map, type, first, n);
2207 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
2208 enum isl_dim_type type, unsigned first, unsigned n)
2210 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
2213 /* Project out n inputs starting at first using Fourier-Motzkin */
2214 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
2215 unsigned first, unsigned n)
2217 return isl_map_remove_dims(map, isl_dim_in, first, n);
2220 static void dump_term(struct isl_basic_map *bmap,
2221 isl_int c, int pos, FILE *out)
2224 unsigned in = isl_basic_map_n_in(bmap);
2225 unsigned dim = in + isl_basic_map_n_out(bmap);
2226 unsigned nparam = isl_basic_map_n_param(bmap);
2228 isl_int_print(out, c, 0);
2230 if (!isl_int_is_one(c))
2231 isl_int_print(out, c, 0);
2232 if (pos < 1 + nparam) {
2233 name = isl_space_get_dim_name(bmap->dim,
2234 isl_dim_param, pos - 1);
2236 fprintf(out, "%s", name);
2238 fprintf(out, "p%d", pos - 1);
2239 } else if (pos < 1 + nparam + in)
2240 fprintf(out, "i%d", pos - 1 - nparam);
2241 else if (pos < 1 + nparam + dim)
2242 fprintf(out, "o%d", pos - 1 - nparam - in);
2244 fprintf(out, "e%d", pos - 1 - nparam - dim);
2248 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2249 int sign, FILE *out)
2253 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2257 for (i = 0, first = 1; i < len; ++i) {
2258 if (isl_int_sgn(c[i]) * sign <= 0)
2261 fprintf(out, " + ");
2263 isl_int_abs(v, c[i]);
2264 dump_term(bmap, v, i, out);
2271 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2272 const char *op, FILE *out, int indent)
2276 fprintf(out, "%*s", indent, "");
2278 dump_constraint_sign(bmap, c, 1, out);
2279 fprintf(out, " %s ", op);
2280 dump_constraint_sign(bmap, c, -1, out);
2284 for (i = bmap->n_div; i < bmap->extra; ++i) {
2285 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2287 fprintf(out, "%*s", indent, "");
2288 fprintf(out, "ERROR: unused div coefficient not zero\n");
2293 static void dump_constraints(struct isl_basic_map *bmap,
2294 isl_int **c, unsigned n,
2295 const char *op, FILE *out, int indent)
2299 for (i = 0; i < n; ++i)
2300 dump_constraint(bmap, c[i], op, out, indent);
2303 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2307 unsigned total = isl_basic_map_total_dim(bmap);
2309 for (j = 0; j < 1 + total; ++j) {
2310 if (isl_int_is_zero(exp[j]))
2312 if (!first && isl_int_is_pos(exp[j]))
2314 dump_term(bmap, exp[j], j, out);
2319 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2323 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2324 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2326 for (i = 0; i < bmap->n_div; ++i) {
2327 fprintf(out, "%*s", indent, "");
2328 fprintf(out, "e%d = [(", i);
2329 dump_affine(bmap, bmap->div[i]+1, out);
2331 isl_int_print(out, bmap->div[i][0], 0);
2332 fprintf(out, "]\n");
2336 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2337 FILE *out, int indent)
2340 fprintf(out, "null basic set\n");
2344 fprintf(out, "%*s", indent, "");
2345 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2346 bset->ref, bset->dim->nparam, bset->dim->n_out,
2347 bset->extra, bset->flags);
2348 dump((struct isl_basic_map *)bset, out, indent);
2351 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2352 FILE *out, int indent)
2355 fprintf(out, "null basic map\n");
2359 fprintf(out, "%*s", indent, "");
2360 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2361 "flags: %x, n_name: %d\n",
2363 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2364 bmap->extra, bmap->flags, bmap->dim->n_id);
2365 dump(bmap, out, indent);
2368 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2373 total = isl_basic_map_total_dim(bmap);
2374 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2375 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2376 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2377 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2381 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2384 struct isl_set *set;
2388 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2389 isl_assert(dim->ctx, n >= 0, goto error);
2390 set = isl_alloc(dim->ctx, struct isl_set,
2391 sizeof(struct isl_set) +
2392 (n - 1) * sizeof(struct isl_basic_set *));
2396 set->ctx = dim->ctx;
2397 isl_ctx_ref(set->ctx);
2405 isl_space_free(dim);
2409 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2410 unsigned nparam, unsigned dim, int n, unsigned flags)
2412 struct isl_set *set;
2415 dims = isl_space_alloc(ctx, nparam, 0, dim);
2419 set = isl_set_alloc_space(dims, n, flags);
2423 /* Make sure "map" has room for at least "n" more basic maps.
2425 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2428 struct isl_map *grown = NULL;
2432 isl_assert(map->ctx, n >= 0, goto error);
2433 if (map->n + n <= map->size)
2435 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2438 for (i = 0; i < map->n; ++i) {
2439 grown->p[i] = isl_basic_map_copy(map->p[i]);
2447 isl_map_free(grown);
2452 /* Make sure "set" has room for at least "n" more basic sets.
2454 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2456 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2459 struct isl_set *isl_set_dup(struct isl_set *set)
2462 struct isl_set *dup;
2467 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2470 for (i = 0; i < set->n; ++i)
2471 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2475 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2477 return isl_map_from_basic_map(bset);
2480 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2482 struct isl_map *map;
2487 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2488 return isl_map_add_basic_map(map, bmap);
2491 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2492 __isl_take isl_basic_set *bset)
2494 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2495 (struct isl_basic_map *)bset);
2498 void *isl_set_free(__isl_take isl_set *set)
2508 isl_ctx_deref(set->ctx);
2509 for (i = 0; i < set->n; ++i)
2510 isl_basic_set_free(set->p[i]);
2511 isl_space_free(set->dim);
2517 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2522 fprintf(out, "null set\n");
2526 fprintf(out, "%*s", indent, "");
2527 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2528 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2530 for (i = 0; i < set->n; ++i) {
2531 fprintf(out, "%*s", indent, "");
2532 fprintf(out, "basic set %d:\n", i);
2533 isl_basic_set_print_internal(set->p[i], out, indent+4);
2537 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2542 fprintf(out, "null map\n");
2546 fprintf(out, "%*s", indent, "");
2547 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2548 "flags: %x, n_name: %d\n",
2549 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2550 map->dim->n_out, map->flags, map->dim->n_id);
2551 for (i = 0; i < map->n; ++i) {
2552 fprintf(out, "%*s", indent, "");
2553 fprintf(out, "basic map %d:\n", i);
2554 isl_basic_map_print_internal(map->p[i], out, indent+4);
2558 struct isl_basic_map *isl_basic_map_intersect_domain(
2559 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2561 struct isl_basic_map *bmap_domain;
2566 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2567 bset->dim, isl_dim_param), goto error);
2569 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2570 isl_assert(bset->ctx,
2571 isl_basic_map_compatible_domain(bmap, bset), goto error);
2573 bmap = isl_basic_map_cow(bmap);
2576 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2577 bset->n_div, bset->n_eq, bset->n_ineq);
2578 bmap_domain = isl_basic_map_from_domain(bset);
2579 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2581 bmap = isl_basic_map_simplify(bmap);
2582 return isl_basic_map_finalize(bmap);
2584 isl_basic_map_free(bmap);
2585 isl_basic_set_free(bset);
2589 struct isl_basic_map *isl_basic_map_intersect_range(
2590 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2592 struct isl_basic_map *bmap_range;
2597 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2598 bset->dim, isl_dim_param), goto error);
2600 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2601 isl_assert(bset->ctx,
2602 isl_basic_map_compatible_range(bmap, bset), goto error);
2604 if (isl_basic_set_is_universe(bset)) {
2605 isl_basic_set_free(bset);
2609 bmap = isl_basic_map_cow(bmap);
2612 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2613 bset->n_div, bset->n_eq, bset->n_ineq);
2614 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2615 bmap = add_constraints(bmap, bmap_range, 0, 0);
2617 bmap = isl_basic_map_simplify(bmap);
2618 return isl_basic_map_finalize(bmap);
2620 isl_basic_map_free(bmap);
2621 isl_basic_set_free(bset);
2625 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2631 total = 1 + isl_basic_map_total_dim(bmap);
2632 if (total != vec->size)
2637 for (i = 0; i < bmap->n_eq; ++i) {
2638 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2639 if (!isl_int_is_zero(s)) {
2645 for (i = 0; i < bmap->n_ineq; ++i) {
2646 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2647 if (isl_int_is_neg(s)) {
2658 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2660 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2663 struct isl_basic_map *isl_basic_map_intersect(
2664 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2666 struct isl_vec *sample = NULL;
2668 if (!bmap1 || !bmap2)
2671 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2672 bmap2->dim, isl_dim_param), goto error);
2673 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2674 isl_space_dim(bmap1->dim, isl_dim_param) &&
2675 isl_space_dim(bmap2->dim, isl_dim_all) !=
2676 isl_space_dim(bmap2->dim, isl_dim_param))
2677 return isl_basic_map_intersect(bmap2, bmap1);
2679 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2680 isl_space_dim(bmap2->dim, isl_dim_param))
2681 isl_assert(bmap1->ctx,
2682 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2684 if (bmap1->sample &&
2685 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2686 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2687 sample = isl_vec_copy(bmap1->sample);
2688 else if (bmap2->sample &&
2689 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2690 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2691 sample = isl_vec_copy(bmap2->sample);
2693 bmap1 = isl_basic_map_cow(bmap1);
2696 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2697 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2698 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2701 isl_vec_free(sample);
2703 isl_vec_free(bmap1->sample);
2704 bmap1->sample = sample;
2707 bmap1 = isl_basic_map_simplify(bmap1);
2708 return isl_basic_map_finalize(bmap1);
2711 isl_vec_free(sample);
2712 isl_basic_map_free(bmap1);
2713 isl_basic_map_free(bmap2);
2717 struct isl_basic_set *isl_basic_set_intersect(
2718 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2720 return (struct isl_basic_set *)
2721 isl_basic_map_intersect(
2722 (struct isl_basic_map *)bset1,
2723 (struct isl_basic_map *)bset2);
2726 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2727 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2729 return isl_basic_set_intersect(bset1, bset2);
2732 /* Special case of isl_map_intersect, where both map1 and map2
2733 * are convex, without any divs and such that either map1 or map2
2734 * contains a single constraint. This constraint is then simply
2735 * added to the other map.
2737 static __isl_give isl_map *map_intersect_add_constraint(
2738 __isl_take isl_map *map1, __isl_take isl_map *map2)
2740 isl_assert(map1->ctx, map1->n == 1, goto error);
2741 isl_assert(map2->ctx, map1->n == 1, goto error);
2742 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2743 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2745 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2746 return isl_map_intersect(map2, map1);
2748 isl_assert(map2->ctx,
2749 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2751 map1 = isl_map_cow(map1);
2754 if (isl_map_plain_is_empty(map1)) {
2758 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2759 if (map2->p[0]->n_eq == 1)
2760 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2762 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2763 map2->p[0]->ineq[0]);
2765 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2766 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2770 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2771 isl_basic_map_free(map1->p[0]);
2784 /* map2 may be either a parameter domain or a map living in the same
2787 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2788 __isl_take isl_map *map2)
2791 struct isl_map *result;
2797 if ((isl_map_plain_is_empty(map1) ||
2798 isl_map_plain_is_universe(map2)) &&
2799 isl_space_is_equal(map1->dim, map2->dim)) {
2803 if ((isl_map_plain_is_empty(map2) ||
2804 isl_map_plain_is_universe(map1)) &&
2805 isl_space_is_equal(map1->dim, map2->dim)) {
2810 if (map1->n == 1 && map2->n == 1 &&
2811 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2812 isl_space_is_equal(map1->dim, map2->dim) &&
2813 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2814 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2815 return map_intersect_add_constraint(map1, map2);
2817 if (isl_space_dim(map2->dim, isl_dim_all) !=
2818 isl_space_dim(map2->dim, isl_dim_param))
2819 isl_assert(map1->ctx,
2820 isl_space_is_equal(map1->dim, map2->dim), goto error);
2822 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2823 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2824 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2826 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2827 map1->n * map2->n, flags);
2830 for (i = 0; i < map1->n; ++i)
2831 for (j = 0; j < map2->n; ++j) {
2832 struct isl_basic_map *part;
2833 part = isl_basic_map_intersect(
2834 isl_basic_map_copy(map1->p[i]),
2835 isl_basic_map_copy(map2->p[j]));
2836 if (isl_basic_map_is_empty(part) < 0)
2838 result = isl_map_add_basic_map(result, part);
2851 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2852 __isl_take isl_map *map2)
2856 if (!isl_space_is_equal(map1->dim, map2->dim))
2857 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
2858 "spaces don't match", goto error);
2859 return map_intersect_internal(map1, map2);
2866 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2867 __isl_take isl_map *map2)
2869 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2872 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2874 return (struct isl_set *)
2875 isl_map_intersect((struct isl_map *)set1,
2876 (struct isl_map *)set2);
2879 /* map_intersect_internal accepts intersections
2880 * with parameter domains, so we can just call that function.
2882 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2883 __isl_take isl_set *params)
2885 return map_intersect_internal(map, params);
2888 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2889 __isl_take isl_map *map2)
2891 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2894 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2895 __isl_take isl_set *params)
2897 return isl_map_intersect_params(set, params);
2900 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2903 struct isl_basic_set *bset;
2908 bmap = isl_basic_map_cow(bmap);
2911 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2912 in = isl_basic_map_n_in(bmap);
2913 bset = isl_basic_set_from_basic_map(bmap);
2914 bset = isl_basic_set_swap_vars(bset, in);
2915 return isl_basic_map_from_basic_set(bset, dim);
2918 static __isl_give isl_basic_map *basic_map_space_reset(
2919 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2923 if (!isl_space_is_named_or_nested(bmap->dim, type))
2926 space = isl_basic_map_get_space(bmap);
2927 space = isl_space_reset(space, type);
2928 bmap = isl_basic_map_reset_space(bmap, space);
2932 __isl_give isl_basic_map *isl_basic_map_insert_dims(
2933 __isl_take isl_basic_map *bmap, enum isl_dim_type type,
2934 unsigned pos, unsigned n)
2937 struct isl_basic_map *res;
2938 struct isl_dim_map *dim_map;
2939 unsigned total, off;
2940 enum isl_dim_type t;
2943 return basic_map_space_reset(bmap, type);
2948 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2950 total = isl_basic_map_total_dim(bmap) + n;
2951 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2953 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2955 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2957 unsigned size = isl_basic_map_dim(bmap, t);
2958 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2960 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2961 pos, size - pos, off + pos + n);
2963 off += isl_space_dim(res_dim, t);
2965 isl_dim_map_div(dim_map, bmap, off);
2967 res = isl_basic_map_alloc_space(res_dim,
2968 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2969 if (isl_basic_map_is_rational(bmap))
2970 res = isl_basic_map_set_rational(res);
2971 if (isl_basic_map_plain_is_empty(bmap)) {
2972 isl_basic_map_free(bmap);
2973 return isl_basic_map_set_to_empty(res);
2975 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2976 return isl_basic_map_finalize(res);
2979 __isl_give isl_basic_set *isl_basic_set_insert_dims(
2980 __isl_take isl_basic_set *bset,
2981 enum isl_dim_type type, unsigned pos, unsigned n)
2983 return isl_basic_map_insert_dims(bset, type, pos, n);
2986 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2987 enum isl_dim_type type, unsigned n)
2991 return isl_basic_map_insert_dims(bmap, type,
2992 isl_basic_map_dim(bmap, type), n);
2995 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2996 enum isl_dim_type type, unsigned n)
3000 isl_assert(bset->ctx, type != isl_dim_in, goto error);
3001 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
3003 isl_basic_set_free(bset);
3007 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
3008 enum isl_dim_type type)
3012 if (!map || !isl_space_is_named_or_nested(map->dim, type))
3015 space = isl_map_get_space(map);
3016 space = isl_space_reset(space, type);
3017 map = isl_map_reset_space(map, space);
3021 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
3022 enum isl_dim_type type, unsigned pos, unsigned n)
3027 return map_space_reset(map, type);
3029 map = isl_map_cow(map);
3033 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
3037 for (i = 0; i < map->n; ++i) {
3038 map->p[i] = isl_basic_map_insert_dims(map->p[i], type, pos, n);
3049 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
3050 enum isl_dim_type type, unsigned pos, unsigned n)
3052 return isl_map_insert_dims(set, type, pos, n);
3055 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
3056 enum isl_dim_type type, unsigned n)
3060 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
3063 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
3064 enum isl_dim_type type, unsigned n)
3068 isl_assert(set->ctx, type != isl_dim_in, goto error);
3069 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
3075 __isl_give isl_basic_map *isl_basic_map_move_dims(
3076 __isl_take isl_basic_map *bmap,
3077 enum isl_dim_type dst_type, unsigned dst_pos,
3078 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3080 struct isl_dim_map *dim_map;
3081 struct isl_basic_map *res;
3082 enum isl_dim_type t;
3083 unsigned total, off;
3090 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
3093 if (dst_type == src_type && dst_pos == src_pos)
3096 isl_assert(bmap->ctx, dst_type != src_type, goto error);
3098 if (pos(bmap->dim, dst_type) + dst_pos ==
3099 pos(bmap->dim, src_type) + src_pos +
3100 ((src_type < dst_type) ? n : 0)) {
3101 bmap = isl_basic_map_cow(bmap);
3105 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3106 src_type, src_pos, n);
3110 bmap = isl_basic_map_finalize(bmap);
3115 total = isl_basic_map_total_dim(bmap);
3116 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3119 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3120 unsigned size = isl_space_dim(bmap->dim, t);
3121 if (t == dst_type) {
3122 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3125 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
3128 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3129 dst_pos, size - dst_pos, off);
3130 off += size - dst_pos;
3131 } else if (t == src_type) {
3132 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3135 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3136 src_pos + n, size - src_pos - n, off);
3137 off += size - src_pos - n;
3139 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3143 isl_dim_map_div(dim_map, bmap, off);
3145 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3146 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3147 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3149 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3150 src_type, src_pos, n);
3154 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
3155 bmap = isl_basic_map_gauss(bmap, NULL);
3156 bmap = isl_basic_map_finalize(bmap);
3160 isl_basic_map_free(bmap);
3164 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
3165 enum isl_dim_type dst_type, unsigned dst_pos,
3166 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3168 return (isl_basic_set *)isl_basic_map_move_dims(
3169 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
3172 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
3173 enum isl_dim_type dst_type, unsigned dst_pos,
3174 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3178 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
3179 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
3180 src_type, src_pos, n);
3186 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
3187 enum isl_dim_type dst_type, unsigned dst_pos,
3188 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3197 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
3200 if (dst_type == src_type && dst_pos == src_pos)
3203 isl_assert(map->ctx, dst_type != src_type, goto error);
3205 map = isl_map_cow(map);
3209 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
3213 for (i = 0; i < map->n; ++i) {
3214 map->p[i] = isl_basic_map_move_dims(map->p[i],
3216 src_type, src_pos, n);
3227 /* Move the specified dimensions to the last columns right before
3228 * the divs. Don't change the dimension specification of bmap.
3229 * That's the responsibility of the caller.
3231 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
3232 enum isl_dim_type type, unsigned first, unsigned n)
3234 struct isl_dim_map *dim_map;
3235 struct isl_basic_map *res;
3236 enum isl_dim_type t;
3237 unsigned total, off;
3241 if (pos(bmap->dim, type) + first + n ==
3242 1 + isl_space_dim(bmap->dim, isl_dim_all))
3245 total = isl_basic_map_total_dim(bmap);
3246 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3249 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3250 unsigned size = isl_space_dim(bmap->dim, t);
3252 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3255 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3256 first, n, total - bmap->n_div - n);
3257 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3258 first + n, size - (first + n), off);
3259 off += size - (first + n);
3261 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3265 isl_dim_map_div(dim_map, bmap, off + n);
3267 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3268 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3269 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3273 /* Turn the n dimensions of type type, starting at first
3274 * into existentially quantified variables.
3276 __isl_give isl_basic_map *isl_basic_map_project_out(
3277 __isl_take isl_basic_map *bmap,
3278 enum isl_dim_type type, unsigned first, unsigned n)
3286 return basic_map_space_reset(bmap, type);
3291 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3292 return isl_basic_map_remove_dims(bmap, type, first, n);
3294 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3297 bmap = move_last(bmap, type, first, n);
3298 bmap = isl_basic_map_cow(bmap);
3302 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3303 old = bmap->block2.data;
3304 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3305 (bmap->extra + n) * (1 + row_size));
3306 if (!bmap->block2.data)
3308 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3311 for (i = 0; i < n; ++i) {
3312 new_div[i] = bmap->block2.data +
3313 (bmap->extra + i) * (1 + row_size);
3314 isl_seq_clr(new_div[i], 1 + row_size);
3316 for (i = 0; i < bmap->extra; ++i)
3317 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3319 bmap->div = new_div;
3323 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3326 bmap = isl_basic_map_simplify(bmap);
3327 bmap = isl_basic_map_drop_redundant_divs(bmap);
3328 return isl_basic_map_finalize(bmap);
3330 isl_basic_map_free(bmap);
3334 /* Turn the n dimensions of type type, starting at first
3335 * into existentially quantified variables.
3337 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3338 enum isl_dim_type type, unsigned first, unsigned n)
3340 return (isl_basic_set *)isl_basic_map_project_out(
3341 (isl_basic_map *)bset, type, first, n);
3344 /* Turn the n dimensions of type type, starting at first
3345 * into existentially quantified variables.
3347 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3348 enum isl_dim_type type, unsigned first, unsigned n)
3356 return map_space_reset(map, type);
3358 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3360 map = isl_map_cow(map);
3364 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3368 for (i = 0; i < map->n; ++i) {
3369 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3380 /* Turn the n dimensions of type type, starting at first
3381 * into existentially quantified variables.
3383 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3384 enum isl_dim_type type, unsigned first, unsigned n)
3386 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3389 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3393 for (i = 0; i < n; ++i) {
3394 j = isl_basic_map_alloc_div(bmap);
3397 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3401 isl_basic_map_free(bmap);
3405 struct isl_basic_map *isl_basic_map_apply_range(
3406 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3408 isl_space *dim_result = NULL;
3409 struct isl_basic_map *bmap;
3410 unsigned n_in, n_out, n, nparam, total, pos;
3411 struct isl_dim_map *dim_map1, *dim_map2;
3413 if (!bmap1 || !bmap2)
3416 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3417 isl_space_copy(bmap2->dim));
3419 n_in = isl_basic_map_n_in(bmap1);
3420 n_out = isl_basic_map_n_out(bmap2);
3421 n = isl_basic_map_n_out(bmap1);
3422 nparam = isl_basic_map_n_param(bmap1);
3424 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3425 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3426 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3427 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3428 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3429 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3430 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3431 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3432 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3433 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3434 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3436 bmap = isl_basic_map_alloc_space(dim_result,
3437 bmap1->n_div + bmap2->n_div + n,
3438 bmap1->n_eq + bmap2->n_eq,
3439 bmap1->n_ineq + bmap2->n_ineq);
3440 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3441 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3442 bmap = add_divs(bmap, n);
3443 bmap = isl_basic_map_simplify(bmap);
3444 bmap = isl_basic_map_drop_redundant_divs(bmap);
3445 return isl_basic_map_finalize(bmap);
3447 isl_basic_map_free(bmap1);
3448 isl_basic_map_free(bmap2);
3452 struct isl_basic_set *isl_basic_set_apply(
3453 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3458 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3461 return (struct isl_basic_set *)
3462 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3464 isl_basic_set_free(bset);
3465 isl_basic_map_free(bmap);
3469 struct isl_basic_map *isl_basic_map_apply_domain(
3470 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3472 if (!bmap1 || !bmap2)
3475 isl_assert(bmap1->ctx,
3476 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3477 isl_assert(bmap1->ctx,
3478 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3481 bmap1 = isl_basic_map_reverse(bmap1);
3482 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3483 return isl_basic_map_reverse(bmap1);
3485 isl_basic_map_free(bmap1);
3486 isl_basic_map_free(bmap2);
3490 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3491 * A \cap B -> f(A) + f(B)
3493 struct isl_basic_map *isl_basic_map_sum(
3494 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3496 unsigned n_in, n_out, nparam, total, pos;
3497 struct isl_basic_map *bmap = NULL;
3498 struct isl_dim_map *dim_map1, *dim_map2;
3501 if (!bmap1 || !bmap2)
3504 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3507 nparam = isl_basic_map_n_param(bmap1);
3508 n_in = isl_basic_map_n_in(bmap1);
3509 n_out = isl_basic_map_n_out(bmap1);
3511 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3512 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3513 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3514 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3515 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3516 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3517 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3518 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3519 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3520 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3521 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3523 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3524 bmap1->n_div + bmap2->n_div + 2 * n_out,
3525 bmap1->n_eq + bmap2->n_eq + n_out,
3526 bmap1->n_ineq + bmap2->n_ineq);
3527 for (i = 0; i < n_out; ++i) {
3528 int j = isl_basic_map_alloc_equality(bmap);
3531 isl_seq_clr(bmap->eq[j], 1+total);
3532 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3533 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3534 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3536 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3537 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3538 bmap = add_divs(bmap, 2 * n_out);
3540 bmap = isl_basic_map_simplify(bmap);
3541 return isl_basic_map_finalize(bmap);
3543 isl_basic_map_free(bmap);
3544 isl_basic_map_free(bmap1);
3545 isl_basic_map_free(bmap2);
3549 /* Given two maps A -> f(A) and B -> g(B), construct a map
3550 * A \cap B -> f(A) + f(B)
3552 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3554 struct isl_map *result;
3560 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3562 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3563 map1->n * map2->n, 0);
3566 for (i = 0; i < map1->n; ++i)
3567 for (j = 0; j < map2->n; ++j) {
3568 struct isl_basic_map *part;
3569 part = isl_basic_map_sum(
3570 isl_basic_map_copy(map1->p[i]),
3571 isl_basic_map_copy(map2->p[j]));
3572 if (isl_basic_map_is_empty(part))
3573 isl_basic_map_free(part);
3575 result = isl_map_add_basic_map(result, part);
3588 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3589 __isl_take isl_set *set2)
3591 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3594 /* Given a basic map A -> f(A), construct A -> -f(A).
3596 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3601 bmap = isl_basic_map_cow(bmap);
3605 n = isl_basic_map_dim(bmap, isl_dim_out);
3606 off = isl_basic_map_offset(bmap, isl_dim_out);
3607 for (i = 0; i < bmap->n_eq; ++i)
3608 for (j = 0; j < n; ++j)
3609 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3610 for (i = 0; i < bmap->n_ineq; ++i)
3611 for (j = 0; j < n; ++j)
3612 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3613 for (i = 0; i < bmap->n_div; ++i)
3614 for (j = 0; j < n; ++j)
3615 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3616 bmap = isl_basic_map_gauss(bmap, NULL);
3617 return isl_basic_map_finalize(bmap);
3620 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3622 return isl_basic_map_neg(bset);
3625 /* Given a map A -> f(A), construct A -> -f(A).
3627 struct isl_map *isl_map_neg(struct isl_map *map)
3631 map = isl_map_cow(map);
3635 for (i = 0; i < map->n; ++i) {
3636 map->p[i] = isl_basic_map_neg(map->p[i]);
3647 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3649 return (isl_set *)isl_map_neg((isl_map *)set);
3652 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3653 * A -> floor(f(A)/d).
3655 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3658 unsigned n_in, n_out, nparam, total, pos;
3659 struct isl_basic_map *result = NULL;
3660 struct isl_dim_map *dim_map;
3666 nparam = isl_basic_map_n_param(bmap);
3667 n_in = isl_basic_map_n_in(bmap);
3668 n_out = isl_basic_map_n_out(bmap);
3670 total = nparam + n_in + n_out + bmap->n_div + n_out;
3671 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3672 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3673 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3674 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3675 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3677 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3678 bmap->n_div + n_out,
3679 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3680 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3681 result = add_divs(result, n_out);
3682 for (i = 0; i < n_out; ++i) {
3684 j = isl_basic_map_alloc_inequality(result);
3687 isl_seq_clr(result->ineq[j], 1+total);
3688 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3689 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3690 j = isl_basic_map_alloc_inequality(result);
3693 isl_seq_clr(result->ineq[j], 1+total);
3694 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3695 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3696 isl_int_sub_ui(result->ineq[j][0], d, 1);
3699 result = isl_basic_map_simplify(result);
3700 return isl_basic_map_finalize(result);
3702 isl_basic_map_free(result);
3706 /* Given a map A -> f(A) and an integer d, construct a map
3707 * A -> floor(f(A)/d).
3709 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3713 map = isl_map_cow(map);
3717 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3718 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3719 for (i = 0; i < map->n; ++i) {
3720 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3731 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3737 i = isl_basic_map_alloc_equality(bmap);
3740 nparam = isl_basic_map_n_param(bmap);
3741 n_in = isl_basic_map_n_in(bmap);
3742 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3743 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3744 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3745 return isl_basic_map_finalize(bmap);
3747 isl_basic_map_free(bmap);
3751 /* Add a constraints to "bmap" expressing i_pos < o_pos
3753 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3759 i = isl_basic_map_alloc_inequality(bmap);
3762 nparam = isl_basic_map_n_param(bmap);
3763 n_in = isl_basic_map_n_in(bmap);
3764 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3765 isl_int_set_si(bmap->ineq[i][0], -1);
3766 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3767 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3768 return isl_basic_map_finalize(bmap);
3770 isl_basic_map_free(bmap);
3774 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3776 static __isl_give isl_basic_map *var_less_or_equal(
3777 __isl_take isl_basic_map *bmap, unsigned pos)
3783 i = isl_basic_map_alloc_inequality(bmap);
3786 nparam = isl_basic_map_n_param(bmap);
3787 n_in = isl_basic_map_n_in(bmap);
3788 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3789 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3790 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3791 return isl_basic_map_finalize(bmap);
3793 isl_basic_map_free(bmap);
3797 /* Add a constraints to "bmap" expressing i_pos > o_pos
3799 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3805 i = isl_basic_map_alloc_inequality(bmap);
3808 nparam = isl_basic_map_n_param(bmap);
3809 n_in = isl_basic_map_n_in(bmap);
3810 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3811 isl_int_set_si(bmap->ineq[i][0], -1);
3812 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3813 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3814 return isl_basic_map_finalize(bmap);
3816 isl_basic_map_free(bmap);
3820 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3822 static __isl_give isl_basic_map *var_more_or_equal(
3823 __isl_take isl_basic_map *bmap, unsigned pos)
3829 i = isl_basic_map_alloc_inequality(bmap);
3832 nparam = isl_basic_map_n_param(bmap);
3833 n_in = isl_basic_map_n_in(bmap);
3834 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3835 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3836 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3837 return isl_basic_map_finalize(bmap);
3839 isl_basic_map_free(bmap);
3843 __isl_give isl_basic_map *isl_basic_map_equal(
3844 __isl_take isl_space *dim, unsigned n_equal)
3847 struct isl_basic_map *bmap;
3848 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3851 for (i = 0; i < n_equal && bmap; ++i)
3852 bmap = var_equal(bmap, i);
3853 return isl_basic_map_finalize(bmap);
3856 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3858 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3862 struct isl_basic_map *bmap;
3863 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3866 for (i = 0; i < pos && bmap; ++i)
3867 bmap = var_equal(bmap, i);
3869 bmap = var_less(bmap, pos);
3870 return isl_basic_map_finalize(bmap);
3873 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3875 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3876 __isl_take isl_space *dim, unsigned pos)
3879 isl_basic_map *bmap;
3881 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3882 for (i = 0; i < pos; ++i)
3883 bmap = var_equal(bmap, i);
3884 bmap = var_less_or_equal(bmap, pos);
3885 return isl_basic_map_finalize(bmap);
3888 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3890 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3894 struct isl_basic_map *bmap;
3895 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3898 for (i = 0; i < pos && bmap; ++i)
3899 bmap = var_equal(bmap, i);
3901 bmap = var_more(bmap, pos);
3902 return isl_basic_map_finalize(bmap);
3905 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3907 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3908 __isl_take isl_space *dim, unsigned pos)
3911 isl_basic_map *bmap;
3913 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3914 for (i = 0; i < pos; ++i)
3915 bmap = var_equal(bmap, i);
3916 bmap = var_more_or_equal(bmap, pos);
3917 return isl_basic_map_finalize(bmap);
3920 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3921 unsigned n, int equal)
3923 struct isl_map *map;
3926 if (n == 0 && equal)
3927 return isl_map_universe(dims);
3929 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3931 for (i = 0; i + 1 < n; ++i)
3932 map = isl_map_add_basic_map(map,
3933 isl_basic_map_less_at(isl_space_copy(dims), i));
3936 map = isl_map_add_basic_map(map,
3937 isl_basic_map_less_or_equal_at(dims, n - 1));
3939 map = isl_map_add_basic_map(map,
3940 isl_basic_map_less_at(dims, n - 1));
3942 isl_space_free(dims);
3947 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3951 return map_lex_lte_first(dims, dims->n_out, equal);
3954 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3956 return map_lex_lte_first(dim, n, 0);
3959 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3961 return map_lex_lte_first(dim, n, 1);
3964 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3966 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3969 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3971 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3974 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3975 unsigned n, int equal)
3977 struct isl_map *map;
3980 if (n == 0 && equal)
3981 return isl_map_universe(dims);
3983 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3985 for (i = 0; i + 1 < n; ++i)
3986 map = isl_map_add_basic_map(map,
3987 isl_basic_map_more_at(isl_space_copy(dims), i));
3990 map = isl_map_add_basic_map(map,
3991 isl_basic_map_more_or_equal_at(dims, n - 1));
3993 map = isl_map_add_basic_map(map,
3994 isl_basic_map_more_at(dims, n - 1));
3996 isl_space_free(dims);
4001 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
4005 return map_lex_gte_first(dims, dims->n_out, equal);
4008 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
4010 return map_lex_gte_first(dim, n, 0);
4013 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
4015 return map_lex_gte_first(dim, n, 1);
4018 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
4020 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
4023 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
4025 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
4028 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
4029 __isl_take isl_set *set2)
4032 map = isl_map_lex_le(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_lt_set(__isl_take isl_set *set1,
4039 __isl_take isl_set *set2)
4042 map = isl_map_lex_lt(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_ge_set(__isl_take isl_set *set1,
4049 __isl_take isl_set *set2)
4052 map = isl_map_lex_ge(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_set_lex_gt_set(__isl_take isl_set *set1,
4059 __isl_take isl_set *set2)
4062 map = isl_map_lex_gt(isl_set_get_space(set1));
4063 map = isl_map_intersect_domain(map, set1);
4064 map = isl_map_intersect_range(map, set2);
4068 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
4069 __isl_take isl_map *map2)
4072 map = isl_map_lex_le(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_lt_map(__isl_take isl_map *map1,
4079 __isl_take isl_map *map2)
4082 map = isl_map_lex_lt(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_ge_map(__isl_take isl_map *map1,
4089 __isl_take isl_map *map2)
4092 map = isl_map_lex_ge(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_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
4099 __isl_take isl_map *map2)
4102 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
4103 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4104 map = isl_map_apply_range(map, isl_map_reverse(map2));
4108 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
4109 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4111 struct isl_basic_map *bmap;
4113 bset = isl_basic_set_cow(bset);
4117 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
4118 isl_space_free(bset->dim);
4119 bmap = (struct isl_basic_map *) bset;
4121 return isl_basic_map_finalize(bmap);
4123 isl_basic_set_free(bset);
4124 isl_space_free(dim);
4128 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
4132 if (bmap->dim->n_in == 0)
4133 return (struct isl_basic_set *)bmap;
4134 bmap = isl_basic_map_cow(bmap);
4137 bmap->dim = isl_space_as_set_space(bmap->dim);
4140 bmap = isl_basic_map_finalize(bmap);
4141 return (struct isl_basic_set *)bmap;
4143 isl_basic_map_free(bmap);
4147 /* For a div d = floor(f/m), add the constraints
4150 * -(f-(n-1)) + m d >= 0
4152 * Note that the second constraint is the negation of
4156 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
4157 unsigned pos, isl_int *div)
4160 unsigned total = isl_basic_map_total_dim(bmap);
4162 i = isl_basic_map_alloc_inequality(bmap);
4165 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
4166 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
4168 j = isl_basic_map_alloc_inequality(bmap);
4171 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
4172 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
4173 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
4177 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
4178 unsigned pos, isl_int *div)
4180 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
4184 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
4186 unsigned total = isl_basic_map_total_dim(bmap);
4187 unsigned div_pos = total - bmap->n_div + div;
4189 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
4193 struct isl_basic_set *isl_basic_map_underlying_set(
4194 struct isl_basic_map *bmap)
4198 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
4200 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
4201 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
4202 return (struct isl_basic_set *)bmap;
4203 bmap = isl_basic_map_cow(bmap);
4206 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
4209 bmap->extra -= bmap->n_div;
4211 bmap = isl_basic_map_finalize(bmap);
4212 return (struct isl_basic_set *)bmap;
4217 __isl_give isl_basic_set *isl_basic_set_underlying_set(
4218 __isl_take isl_basic_set *bset)
4220 return isl_basic_map_underlying_set((isl_basic_map *)bset);
4223 struct isl_basic_map *isl_basic_map_overlying_set(
4224 struct isl_basic_set *bset, struct isl_basic_map *like)
4226 struct isl_basic_map *bmap;
4227 struct isl_ctx *ctx;
4234 isl_assert(ctx, bset->n_div == 0, goto error);
4235 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
4236 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
4238 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
4239 isl_basic_map_free(like);
4240 return (struct isl_basic_map *)bset;
4242 bset = isl_basic_set_cow(bset);
4245 total = bset->dim->n_out + bset->extra;
4246 bmap = (struct isl_basic_map *)bset;
4247 isl_space_free(bmap->dim);
4248 bmap->dim = isl_space_copy(like->dim);
4251 bmap->n_div = like->n_div;
4252 bmap->extra += like->n_div;
4256 ltotal = total - bmap->extra + like->extra;
4259 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
4260 bmap->extra * (1 + 1 + total));
4261 if (isl_blk_is_error(bmap->block2))
4263 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
4267 for (i = 0; i < bmap->extra; ++i)
4268 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
4269 for (i = 0; i < like->n_div; ++i) {
4270 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
4271 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
4273 bmap = isl_basic_map_extend_constraints(bmap,
4274 0, 2 * like->n_div);
4275 for (i = 0; i < like->n_div; ++i) {
4276 if (isl_int_is_zero(bmap->div[i][0]))
4278 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4282 isl_basic_map_free(like);
4283 bmap = isl_basic_map_simplify(bmap);
4284 bmap = isl_basic_map_finalize(bmap);
4287 isl_basic_map_free(like);
4288 isl_basic_set_free(bset);
4292 struct isl_basic_set *isl_basic_set_from_underlying_set(
4293 struct isl_basic_set *bset, struct isl_basic_set *like)
4295 return (struct isl_basic_set *)
4296 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4299 struct isl_set *isl_set_from_underlying_set(
4300 struct isl_set *set, struct isl_basic_set *like)
4306 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4308 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4309 isl_basic_set_free(like);
4312 set = isl_set_cow(set);
4315 for (i = 0; i < set->n; ++i) {
4316 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4317 isl_basic_set_copy(like));
4321 isl_space_free(set->dim);
4322 set->dim = isl_space_copy(like->dim);
4325 isl_basic_set_free(like);
4328 isl_basic_set_free(like);
4333 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4337 map = isl_map_cow(map);
4340 map->dim = isl_space_cow(map->dim);
4344 for (i = 1; i < map->n; ++i)
4345 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4347 for (i = 0; i < map->n; ++i) {
4348 map->p[i] = (struct isl_basic_map *)
4349 isl_basic_map_underlying_set(map->p[i]);
4354 map->dim = isl_space_underlying(map->dim, 0);
4356 isl_space_free(map->dim);
4357 map->dim = isl_space_copy(map->p[0]->dim);
4361 return (struct isl_set *)map;
4367 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4369 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4372 __isl_give isl_basic_map *isl_basic_map_reset_space(
4373 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4375 bmap = isl_basic_map_cow(bmap);
4379 isl_space_free(bmap->dim);
4382 bmap = isl_basic_map_finalize(bmap);
4386 isl_basic_map_free(bmap);
4387 isl_space_free(dim);
4391 __isl_give isl_basic_set *isl_basic_set_reset_space(
4392 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4394 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4398 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4399 __isl_take isl_space *dim)
4403 map = isl_map_cow(map);
4407 for (i = 0; i < map->n; ++i) {
4408 map->p[i] = isl_basic_map_reset_space(map->p[i],
4409 isl_space_copy(dim));
4413 isl_space_free(map->dim);
4419 isl_space_free(dim);
4423 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4424 __isl_take isl_space *dim)
4426 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4429 /* Compute the parameter domain of the given basic set.
4431 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4436 if (isl_basic_set_is_params(bset))
4439 n = isl_basic_set_dim(bset, isl_dim_set);
4440 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4441 space = isl_basic_set_get_space(bset);
4442 space = isl_space_params(space);
4443 bset = isl_basic_set_reset_space(bset, space);
4447 /* Compute the parameter domain of the given set.
4449 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4454 if (isl_set_is_params(set))
4457 n = isl_set_dim(set, isl_dim_set);
4458 set = isl_set_project_out(set, isl_dim_set, 0, n);
4459 space = isl_set_get_space(set);
4460 space = isl_space_params(space);
4461 set = isl_set_reset_space(set, space);
4465 /* Construct a zero-dimensional set with the given parameter domain.
4467 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4470 space = isl_set_get_space(set);
4471 space = isl_space_set_from_params(space);
4472 set = isl_set_reset_space(set, space);
4476 /* Compute the parameter domain of the given map.
4478 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4483 n = isl_map_dim(map, isl_dim_in);
4484 map = isl_map_project_out(map, isl_dim_in, 0, n);
4485 n = isl_map_dim(map, isl_dim_out);
4486 map = isl_map_project_out(map, isl_dim_out, 0, n);
4487 space = isl_map_get_space(map);
4488 space = isl_space_params(space);
4489 map = isl_map_reset_space(map, space);
4493 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4496 struct isl_basic_set *domain;
4502 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4504 n_in = isl_basic_map_n_in(bmap);
4505 n_out = isl_basic_map_n_out(bmap);
4506 domain = isl_basic_set_from_basic_map(bmap);
4507 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4509 domain = isl_basic_set_reset_space(domain, dim);
4514 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4518 return isl_space_may_be_set(bmap->dim);
4521 /* Is this basic map actually a set?
4522 * Users should never call this function. Outside of isl,
4523 * the type should indicate whether something is a set or a map.
4525 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4529 return isl_space_is_set(bmap->dim);
4532 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4536 if (isl_basic_map_is_set(bmap))
4538 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4541 __isl_give isl_basic_map *isl_basic_map_domain_map(
4542 __isl_take isl_basic_map *bmap)
4546 isl_basic_map *domain;
4547 int nparam, n_in, n_out;
4550 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4551 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4552 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4554 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4555 domain = isl_basic_map_universe(dim);
4557 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4558 bmap = isl_basic_map_apply_range(bmap, domain);
4559 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4561 total = isl_basic_map_total_dim(bmap);
4563 for (i = 0; i < n_in; ++i) {
4564 k = isl_basic_map_alloc_equality(bmap);
4567 isl_seq_clr(bmap->eq[k], 1 + total);
4568 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4569 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4572 bmap = isl_basic_map_gauss(bmap, NULL);
4573 return isl_basic_map_finalize(bmap);
4575 isl_basic_map_free(bmap);
4579 __isl_give isl_basic_map *isl_basic_map_range_map(
4580 __isl_take isl_basic_map *bmap)
4584 isl_basic_map *range;
4585 int nparam, n_in, n_out;
4588 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4589 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4590 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4592 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4593 range = isl_basic_map_universe(dim);
4595 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4596 bmap = isl_basic_map_apply_range(bmap, range);
4597 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4599 total = isl_basic_map_total_dim(bmap);
4601 for (i = 0; i < n_out; ++i) {
4602 k = isl_basic_map_alloc_equality(bmap);
4605 isl_seq_clr(bmap->eq[k], 1 + total);
4606 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4607 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4610 bmap = isl_basic_map_gauss(bmap, NULL);
4611 return isl_basic_map_finalize(bmap);
4613 isl_basic_map_free(bmap);
4617 int isl_map_may_be_set(__isl_keep isl_map *map)
4621 return isl_space_may_be_set(map->dim);
4624 /* Is this map actually a set?
4625 * Users should never call this function. Outside of isl,
4626 * the type should indicate whether something is a set or a map.
4628 int isl_map_is_set(__isl_keep isl_map *map)
4632 return isl_space_is_set(map->dim);
4635 struct isl_set *isl_map_range(struct isl_map *map)
4638 struct isl_set *set;
4642 if (isl_map_is_set(map))
4643 return (isl_set *)map;
4645 map = isl_map_cow(map);
4649 set = (struct isl_set *) map;
4650 set->dim = isl_space_range(set->dim);
4653 for (i = 0; i < map->n; ++i) {
4654 set->p[i] = isl_basic_map_range(map->p[i]);
4658 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4659 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4666 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4669 isl_space *domain_dim;
4671 map = isl_map_cow(map);
4675 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4676 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4677 map->dim = isl_space_join(map->dim, domain_dim);
4680 for (i = 0; i < map->n; ++i) {
4681 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4685 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4686 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4693 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4696 isl_space *range_dim;
4698 map = isl_map_cow(map);
4702 range_dim = isl_space_range(isl_map_get_space(map));
4703 range_dim = isl_space_from_range(range_dim);
4704 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4705 map->dim = isl_space_join(map->dim, range_dim);
4708 for (i = 0; i < map->n; ++i) {
4709 map->p[i] = isl_basic_map_range_map(map->p[i]);
4713 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4714 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4721 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4722 __isl_take isl_space *dim)
4725 struct isl_map *map = NULL;
4727 set = isl_set_cow(set);
4730 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4731 map = (struct isl_map *)set;
4732 for (i = 0; i < set->n; ++i) {
4733 map->p[i] = isl_basic_map_from_basic_set(
4734 set->p[i], isl_space_copy(dim));
4738 isl_space_free(map->dim);
4742 isl_space_free(dim);
4747 __isl_give isl_basic_map *isl_basic_map_from_domain(
4748 __isl_take isl_basic_set *bset)
4750 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4753 __isl_give isl_basic_map *isl_basic_map_from_range(
4754 __isl_take isl_basic_set *bset)
4757 space = isl_basic_set_get_space(bset);
4758 space = isl_space_from_range(space);
4759 bset = isl_basic_set_reset_space(bset, space);
4760 return (isl_basic_map *)bset;
4763 struct isl_map *isl_map_from_range(struct isl_set *set)
4766 space = isl_set_get_space(set);
4767 space = isl_space_from_range(space);
4768 set = isl_set_reset_space(set, space);
4769 return (struct isl_map *)set;
4772 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4774 return isl_map_reverse(isl_map_from_range(set));
4777 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4778 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4780 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4783 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4784 __isl_take isl_set *range)
4786 return isl_map_apply_range(isl_map_reverse(domain), range);
4789 struct isl_set *isl_set_from_map(struct isl_map *map)
4792 struct isl_set *set = NULL;
4796 map = isl_map_cow(map);
4799 map->dim = isl_space_as_set_space(map->dim);
4802 set = (struct isl_set *)map;
4803 for (i = 0; i < map->n; ++i) {
4804 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4814 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4817 struct isl_map *map;
4822 isl_die(dim->ctx, isl_error_internal,
4823 "negative number of basic maps", goto error);
4824 map = isl_alloc(dim->ctx, struct isl_map,
4825 sizeof(struct isl_map) +
4826 (n - 1) * sizeof(struct isl_basic_map *));
4830 map->ctx = dim->ctx;
4831 isl_ctx_ref(map->ctx);
4839 isl_space_free(dim);
4843 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4844 unsigned nparam, unsigned in, unsigned out, int n,
4847 struct isl_map *map;
4850 dims = isl_space_alloc(ctx, nparam, in, out);
4854 map = isl_map_alloc_space(dims, n, flags);
4858 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4860 struct isl_basic_map *bmap;
4861 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4862 bmap = isl_basic_map_set_to_empty(bmap);
4866 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4868 struct isl_basic_set *bset;
4869 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4870 bset = isl_basic_set_set_to_empty(bset);
4874 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_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_map *isl_basic_map_empty_like_map(struct isl_map *model)
4886 struct isl_basic_map *bmap;
4889 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4890 bmap = isl_basic_map_set_to_empty(bmap);
4894 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4896 struct isl_basic_set *bset;
4899 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4900 bset = isl_basic_set_set_to_empty(bset);
4904 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4906 struct isl_basic_map *bmap;
4907 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4908 bmap = isl_basic_map_finalize(bmap);
4912 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4914 struct isl_basic_set *bset;
4915 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4916 bset = isl_basic_set_finalize(bset);
4920 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4923 unsigned total = isl_space_dim(dim, isl_dim_all);
4924 isl_basic_map *bmap;
4926 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4927 for (i = 0; i < total; ++i) {
4928 int k = isl_basic_map_alloc_inequality(bmap);
4931 isl_seq_clr(bmap->ineq[k], 1 + total);
4932 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4936 isl_basic_map_free(bmap);
4940 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4942 return isl_basic_map_nat_universe(dim);
4945 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4947 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4950 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4952 return isl_map_nat_universe(dim);
4955 __isl_give isl_basic_map *isl_basic_map_universe_like(
4956 __isl_keep isl_basic_map *model)
4960 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4963 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4967 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4970 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4971 __isl_keep isl_set *model)
4975 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4978 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4980 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4983 struct isl_map *isl_map_empty_like(struct isl_map *model)
4987 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4990 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4994 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4997 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4999 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
5002 struct isl_set *isl_set_empty_like(struct isl_set *model)
5006 return isl_set_empty(isl_space_copy(model->dim));
5009 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
5011 struct isl_map *map;
5014 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5015 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
5019 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
5021 struct isl_set *set;
5024 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5025 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
5029 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
5033 return isl_set_universe(isl_space_copy(model->dim));
5036 struct isl_map *isl_map_dup(struct isl_map *map)
5039 struct isl_map *dup;
5043 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
5044 for (i = 0; i < map->n; ++i)
5045 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
5049 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
5050 __isl_take isl_basic_map *bmap)
5054 if (isl_basic_map_plain_is_empty(bmap)) {
5055 isl_basic_map_free(bmap);
5058 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
5059 isl_assert(map->ctx, map->n < map->size, goto error);
5060 map->p[map->n] = bmap;
5062 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5068 isl_basic_map_free(bmap);
5072 void *isl_map_free(struct isl_map *map)
5082 isl_ctx_deref(map->ctx);
5083 for (i = 0; i < map->n; ++i)
5084 isl_basic_map_free(map->p[i]);
5085 isl_space_free(map->dim);
5091 struct isl_map *isl_map_extend(struct isl_map *base,
5092 unsigned nparam, unsigned n_in, unsigned n_out)
5096 base = isl_map_cow(base);
5100 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
5103 for (i = 0; i < base->n; ++i) {
5104 base->p[i] = isl_basic_map_extend_space(base->p[i],
5105 isl_space_copy(base->dim), 0, 0, 0);
5115 struct isl_set *isl_set_extend(struct isl_set *base,
5116 unsigned nparam, unsigned dim)
5118 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
5122 static struct isl_basic_map *isl_basic_map_fix_pos_si(
5123 struct isl_basic_map *bmap, unsigned pos, int value)
5127 bmap = isl_basic_map_cow(bmap);
5128 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5129 j = isl_basic_map_alloc_equality(bmap);
5132 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5133 isl_int_set_si(bmap->eq[j][pos], -1);
5134 isl_int_set_si(bmap->eq[j][0], value);
5135 bmap = isl_basic_map_simplify(bmap);
5136 return isl_basic_map_finalize(bmap);
5138 isl_basic_map_free(bmap);
5142 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
5143 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
5147 bmap = isl_basic_map_cow(bmap);
5148 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5149 j = isl_basic_map_alloc_equality(bmap);
5152 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5153 isl_int_set_si(bmap->eq[j][pos], -1);
5154 isl_int_set(bmap->eq[j][0], value);
5155 bmap = isl_basic_map_simplify(bmap);
5156 return isl_basic_map_finalize(bmap);
5158 isl_basic_map_free(bmap);
5162 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
5163 enum isl_dim_type type, unsigned pos, int value)
5167 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5168 return isl_basic_map_fix_pos_si(bmap,
5169 isl_basic_map_offset(bmap, type) + pos, value);
5171 isl_basic_map_free(bmap);
5175 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
5176 enum isl_dim_type type, unsigned pos, isl_int value)
5180 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5181 return isl_basic_map_fix_pos(bmap,
5182 isl_basic_map_offset(bmap, type) + pos, value);
5184 isl_basic_map_free(bmap);
5188 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
5189 enum isl_dim_type type, unsigned pos, int value)
5191 return (struct isl_basic_set *)
5192 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5196 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
5197 enum isl_dim_type type, unsigned pos, isl_int value)
5199 return (struct isl_basic_set *)
5200 isl_basic_map_fix((struct isl_basic_map *)bset,
5204 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
5205 unsigned input, int value)
5207 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
5210 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
5211 unsigned dim, int value)
5213 return (struct isl_basic_set *)
5214 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5215 isl_dim_set, dim, value);
5218 static int remove_if_empty(__isl_keep isl_map *map, int i)
5220 int empty = isl_basic_map_plain_is_empty(map->p[i]);
5227 isl_basic_map_free(map->p[i]);
5228 if (i != map->n - 1) {
5229 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5230 map->p[i] = map->p[map->n - 1];
5237 struct isl_map *isl_map_fix_si(struct isl_map *map,
5238 enum isl_dim_type type, unsigned pos, int value)
5242 map = isl_map_cow(map);
5246 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5247 for (i = map->n - 1; i >= 0; --i) {
5248 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
5249 if (remove_if_empty(map, i) < 0)
5252 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5259 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
5260 enum isl_dim_type type, unsigned pos, int value)
5262 return (struct isl_set *)
5263 isl_map_fix_si((struct isl_map *)set, type, pos, value);
5266 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
5267 enum isl_dim_type type, unsigned pos, isl_int value)
5271 map = isl_map_cow(map);
5275 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5276 for (i = 0; i < map->n; ++i) {
5277 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
5281 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5288 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
5289 enum isl_dim_type type, unsigned pos, isl_int value)
5291 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
5294 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
5295 unsigned input, int value)
5297 return isl_map_fix_si(map, isl_dim_in, input, value);
5300 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5302 return (struct isl_set *)
5303 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5306 static __isl_give isl_basic_map *basic_map_bound_si(
5307 __isl_take isl_basic_map *bmap,
5308 enum isl_dim_type type, unsigned pos, int value, int upper)
5314 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5315 pos += isl_basic_map_offset(bmap, type);
5316 bmap = isl_basic_map_cow(bmap);
5317 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5318 j = isl_basic_map_alloc_inequality(bmap);
5321 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5323 isl_int_set_si(bmap->ineq[j][pos], -1);
5324 isl_int_set_si(bmap->ineq[j][0], value);
5326 isl_int_set_si(bmap->ineq[j][pos], 1);
5327 isl_int_set_si(bmap->ineq[j][0], -value);
5329 bmap = isl_basic_map_simplify(bmap);
5330 return isl_basic_map_finalize(bmap);
5332 isl_basic_map_free(bmap);
5336 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5337 __isl_take isl_basic_map *bmap,
5338 enum isl_dim_type type, unsigned pos, int value)
5340 return basic_map_bound_si(bmap, type, pos, value, 0);
5343 /* Constrain the values of the given dimension to be no greater than "value".
5345 __isl_give isl_basic_map *isl_basic_map_upper_bound_si(
5346 __isl_take isl_basic_map *bmap,
5347 enum isl_dim_type type, unsigned pos, int value)
5349 return basic_map_bound_si(bmap, type, pos, value, 1);
5352 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5353 unsigned dim, isl_int value)
5357 bset = isl_basic_set_cow(bset);
5358 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5359 j = isl_basic_set_alloc_inequality(bset);
5362 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5363 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5364 isl_int_neg(bset->ineq[j][0], value);
5365 bset = isl_basic_set_simplify(bset);
5366 return isl_basic_set_finalize(bset);
5368 isl_basic_set_free(bset);
5372 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5373 enum isl_dim_type type, unsigned pos, int value, int upper)
5377 map = isl_map_cow(map);
5381 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5382 for (i = 0; i < map->n; ++i) {
5383 map->p[i] = basic_map_bound_si(map->p[i],
5384 type, pos, value, upper);
5388 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5395 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5396 enum isl_dim_type type, unsigned pos, int value)
5398 return map_bound_si(map, type, pos, value, 0);
5401 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5402 enum isl_dim_type type, unsigned pos, int value)
5404 return map_bound_si(map, type, pos, value, 1);
5407 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5408 enum isl_dim_type type, unsigned pos, int value)
5410 return (struct isl_set *)
5411 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5414 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5415 enum isl_dim_type type, unsigned pos, int value)
5417 return isl_map_upper_bound_si(set, type, pos, value);
5420 /* Bound the given variable of "bmap" from below (or above is "upper"
5421 * is set) to "value".
5423 static __isl_give isl_basic_map *basic_map_bound(
5424 __isl_take isl_basic_map *bmap,
5425 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5431 if (pos >= isl_basic_map_dim(bmap, type))
5432 isl_die(bmap->ctx, isl_error_invalid,
5433 "index out of bounds", goto error);
5434 pos += isl_basic_map_offset(bmap, type);
5435 bmap = isl_basic_map_cow(bmap);
5436 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5437 j = isl_basic_map_alloc_inequality(bmap);
5440 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5442 isl_int_set_si(bmap->ineq[j][pos], -1);
5443 isl_int_set(bmap->ineq[j][0], value);
5445 isl_int_set_si(bmap->ineq[j][pos], 1);
5446 isl_int_neg(bmap->ineq[j][0], value);
5448 bmap = isl_basic_map_simplify(bmap);
5449 return isl_basic_map_finalize(bmap);
5451 isl_basic_map_free(bmap);
5455 /* Bound the given variable of "map" from below (or above is "upper"
5456 * is set) to "value".
5458 static __isl_give isl_map *map_bound(__isl_take isl_map *map,
5459 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5463 map = isl_map_cow(map);
5467 if (pos >= isl_map_dim(map, type))
5468 isl_die(map->ctx, isl_error_invalid,
5469 "index out of bounds", goto error);
5470 for (i = map->n - 1; i >= 0; --i) {
5471 map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper);
5472 if (remove_if_empty(map, i) < 0)
5475 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5482 __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map,
5483 enum isl_dim_type type, unsigned pos, isl_int value)
5485 return map_bound(map, type, pos, value, 0);
5488 __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map,
5489 enum isl_dim_type type, unsigned pos, isl_int value)
5491 return map_bound(map, type, pos, value, 1);
5494 __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set,
5495 enum isl_dim_type type, unsigned pos, isl_int value)
5497 return isl_map_lower_bound(set, type, pos, value);
5500 __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set,
5501 enum isl_dim_type type, unsigned pos, isl_int value)
5503 return isl_map_upper_bound(set, type, pos, value);
5506 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5511 set = isl_set_cow(set);
5515 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5516 for (i = 0; i < set->n; ++i) {
5517 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5527 struct isl_map *isl_map_reverse(struct isl_map *map)
5531 map = isl_map_cow(map);
5535 map->dim = isl_space_reverse(map->dim);
5538 for (i = 0; i < map->n; ++i) {
5539 map->p[i] = isl_basic_map_reverse(map->p[i]);
5543 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5550 static struct isl_map *isl_basic_map_partial_lexopt(
5551 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5552 struct isl_set **empty, int max)
5556 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5557 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5559 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5561 isl_basic_map_free(bmap);
5562 isl_basic_set_free(dom);
5568 struct isl_map *isl_basic_map_partial_lexmax(
5569 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5570 struct isl_set **empty)
5572 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5575 struct isl_map *isl_basic_map_partial_lexmin(
5576 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5577 struct isl_set **empty)
5579 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5582 struct isl_set *isl_basic_set_partial_lexmin(
5583 struct isl_basic_set *bset, struct isl_basic_set *dom,
5584 struct isl_set **empty)
5586 return (struct isl_set *)
5587 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5591 struct isl_set *isl_basic_set_partial_lexmax(
5592 struct isl_basic_set *bset, struct isl_basic_set *dom,
5593 struct isl_set **empty)
5595 return (struct isl_set *)
5596 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5600 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5601 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5602 __isl_give isl_set **empty)
5604 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5607 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5608 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5609 __isl_give isl_set **empty)
5611 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5614 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5615 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5616 __isl_give isl_set **empty)
5618 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5621 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5622 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5623 __isl_give isl_set **empty)
5625 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5628 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5629 __isl_take isl_basic_map *bmap, int max)
5631 isl_basic_set *dom = NULL;
5632 isl_space *dom_space;
5636 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5637 dom = isl_basic_set_universe(dom_space);
5638 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5640 isl_basic_map_free(bmap);
5644 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5645 __isl_take isl_basic_map *bmap)
5647 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5651 #define TYPE isl_pw_multi_aff
5653 #define SUFFIX _pw_multi_aff
5655 #define EMPTY isl_pw_multi_aff_empty
5657 #define ADD isl_pw_multi_aff_union_add
5658 #include "isl_map_lexopt_templ.c"
5660 /* Given a map "map", compute the lexicographically minimal
5661 * (or maximal) image element for each domain element in dom,
5662 * in the form of an isl_pw_multi_aff.
5663 * Set *empty to those elements in dom that do not have an image element.
5665 * We first compute the lexicographically minimal or maximal element
5666 * in the first basic map. This results in a partial solution "res"
5667 * and a subset "todo" of dom that still need to be handled.
5668 * We then consider each of the remaining maps in "map" and successively
5669 * update both "res" and "todo".
5671 static __isl_give isl_pw_multi_aff *isl_map_partial_lexopt_aligned_pw_multi_aff(
5672 __isl_take isl_map *map, __isl_take isl_set *dom,
5673 __isl_give isl_set **empty, int max)
5676 isl_pw_multi_aff *res;
5682 if (isl_map_plain_is_empty(map)) {
5687 return isl_pw_multi_aff_from_map(map);
5690 res = basic_map_partial_lexopt_pw_multi_aff(
5691 isl_basic_map_copy(map->p[0]),
5692 isl_set_copy(dom), &todo, max);
5694 for (i = 1; i < map->n; ++i) {
5695 isl_pw_multi_aff *res_i;
5698 res_i = basic_map_partial_lexopt_pw_multi_aff(
5699 isl_basic_map_copy(map->p[i]),
5700 isl_set_copy(dom), &todo_i, max);
5703 res = isl_pw_multi_aff_union_lexmax(res, res_i);
5705 res = isl_pw_multi_aff_union_lexmin(res, res_i);
5707 todo = isl_set_intersect(todo, todo_i);
5728 #define TYPE isl_map
5732 #define EMPTY isl_map_empty
5734 #define ADD isl_map_union_disjoint
5735 #include "isl_map_lexopt_templ.c"
5737 /* Given a map "map", compute the lexicographically minimal
5738 * (or maximal) image element for each domain element in dom.
5739 * Set *empty to those elements in dom that do not have an image element.
5741 * We first compute the lexicographically minimal or maximal element
5742 * in the first basic map. This results in a partial solution "res"
5743 * and a subset "todo" of dom that still need to be handled.
5744 * We then consider each of the remaining maps in "map" and successively
5745 * update both "res" and "todo".
5747 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5748 * Assume we are computing the lexicographical maximum.
5749 * We first compute the lexicographically maximal element in basic map i.
5750 * This results in a partial solution res_i and a subset todo_i.
5751 * Then we combine these results with those obtain for the first k basic maps
5752 * to obtain a result that is valid for the first k+1 basic maps.
5753 * In particular, the set where there is no solution is the set where
5754 * there is no solution for the first k basic maps and also no solution
5755 * for the ith basic map, i.e.,
5757 * todo^i = todo^k * todo_i
5759 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5760 * solutions, arbitrarily breaking ties in favor of res^k.
5761 * That is, when res^k(a) >= res_i(a), we pick res^k and
5762 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5763 * the lexicographic order.)
5764 * In practice, we compute
5766 * res^k * (res_i . "<=")
5770 * res_i * (res^k . "<")
5772 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5773 * where only one of res^k and res_i provides a solution and we simply pick
5780 * Note that we only compute these intersections when dom(res^k) intersects
5781 * dom(res_i). Otherwise, the only effect of these intersections is to
5782 * potentially break up res^k and res_i into smaller pieces.
5783 * We want to avoid such splintering as much as possible.
5784 * In fact, an earlier implementation of this function would look for
5785 * better results in the domain of res^k and for extra results in todo^k,
5786 * but this would always result in a splintering according to todo^k,
5787 * even when the domain of basic map i is disjoint from the domains of
5788 * the previous basic maps.
5790 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5791 __isl_take isl_map *map, __isl_take isl_set *dom,
5792 __isl_give isl_set **empty, int max)
5795 struct isl_map *res;
5796 struct isl_set *todo;
5801 if (isl_map_plain_is_empty(map)) {
5809 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5810 isl_set_copy(dom), &todo, max);
5812 for (i = 1; i < map->n; ++i) {
5816 isl_space *dim = isl_space_range(isl_map_get_space(res));
5818 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5819 isl_set_copy(dom), &todo_i, max);
5822 lt = isl_map_lex_lt(isl_space_copy(dim));
5823 le = isl_map_lex_le(dim);
5825 lt = isl_map_lex_gt(isl_space_copy(dim));
5826 le = isl_map_lex_ge(dim);
5828 lt = isl_map_apply_range(isl_map_copy(res), lt);
5829 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5830 le = isl_map_apply_range(isl_map_copy(res_i), le);
5831 le = isl_map_intersect(le, isl_map_copy(res));
5833 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5834 res = isl_map_intersect_domain(res,
5835 isl_set_copy(todo_i));
5836 res_i = isl_map_intersect_domain(res_i,
5837 isl_set_copy(todo));
5840 res = isl_map_union_disjoint(res, res_i);
5841 res = isl_map_union_disjoint(res, lt);
5842 res = isl_map_union_disjoint(res, le);
5844 todo = isl_set_intersect(todo, todo_i);
5864 __isl_give isl_map *isl_map_partial_lexmax(
5865 __isl_take isl_map *map, __isl_take isl_set *dom,
5866 __isl_give isl_set **empty)
5868 return isl_map_partial_lexopt(map, dom, empty, 1);
5871 __isl_give isl_map *isl_map_partial_lexmin(
5872 __isl_take isl_map *map, __isl_take isl_set *dom,
5873 __isl_give isl_set **empty)
5875 return isl_map_partial_lexopt(map, dom, empty, 0);
5878 __isl_give isl_set *isl_set_partial_lexmin(
5879 __isl_take isl_set *set, __isl_take isl_set *dom,
5880 __isl_give isl_set **empty)
5882 return (struct isl_set *)
5883 isl_map_partial_lexmin((struct isl_map *)set,
5887 __isl_give isl_set *isl_set_partial_lexmax(
5888 __isl_take isl_set *set, __isl_take isl_set *dom,
5889 __isl_give isl_set **empty)
5891 return (struct isl_set *)
5892 isl_map_partial_lexmax((struct isl_map *)set,
5896 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5898 struct isl_basic_set *dom = NULL;
5903 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5904 dom = isl_basic_set_universe(dom_dim);
5905 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5907 isl_basic_map_free(bmap);
5911 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5913 return isl_basic_map_lexopt(bmap, 0);
5916 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5918 return isl_basic_map_lexopt(bmap, 1);
5921 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5923 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5926 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5928 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5931 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5933 return (isl_set *)isl_map_lexmin((isl_map *)set);
5936 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5938 return (isl_set *)isl_map_lexmax((isl_map *)set);
5941 /* Extract the first and only affine expression from list
5942 * and then add it to *pwaff with the given dom.
5943 * This domain is known to be disjoint from other domains
5944 * because of the way isl_basic_map_foreach_lexmax works.
5946 static int update_dim_opt(__isl_take isl_basic_set *dom,
5947 __isl_take isl_aff_list *list, void *user)
5949 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5951 isl_pw_aff **pwaff = user;
5952 isl_pw_aff *pwaff_i;
5954 if (isl_aff_list_n_aff(list) != 1)
5955 isl_die(ctx, isl_error_internal,
5956 "expecting single element list", goto error);
5958 aff = isl_aff_list_get_aff(list, 0);
5959 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5961 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5963 isl_aff_list_free(list);
5967 isl_basic_set_free(dom);
5968 isl_aff_list_free(list);
5972 /* Given a basic map with one output dimension, compute the minimum or
5973 * maximum of that dimension as an isl_pw_aff.
5975 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5976 * call update_dim_opt on each leaf of the result.
5978 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5981 isl_space *dim = isl_basic_map_get_space(bmap);
5985 dim = isl_space_from_domain(isl_space_domain(dim));
5986 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5987 pwaff = isl_pw_aff_empty(dim);
5989 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5991 return isl_pw_aff_free(pwaff);
5996 /* Compute the minimum or maximum of the given output dimension
5997 * as a function of the parameters and the input dimensions,
5998 * but independently of the other output dimensions.
6000 * We first project out the other output dimension and then compute
6001 * the "lexicographic" maximum in each basic map, combining the results
6002 * using isl_pw_aff_union_max.
6004 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
6011 n_out = isl_map_dim(map, isl_dim_out);
6012 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
6013 map = isl_map_project_out(map, isl_dim_out, 0, pos);
6018 isl_space *dim = isl_map_get_space(map);
6019 dim = isl_space_domain(isl_space_from_range(dim));
6021 return isl_pw_aff_empty(dim);
6024 pwaff = basic_map_dim_opt(map->p[0], max);
6025 for (i = 1; i < map->n; ++i) {
6026 isl_pw_aff *pwaff_i;
6028 pwaff_i = basic_map_dim_opt(map->p[i], max);
6029 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
6037 /* Compute the maximum of the given output dimension as a function of the
6038 * parameters and input dimensions, but independently of
6039 * the other output dimensions.
6041 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
6043 return map_dim_opt(map, pos, 1);
6046 /* Compute the minimum or maximum of the given set dimension
6047 * as a function of the parameters,
6048 * but independently of the other set dimensions.
6050 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
6053 return map_dim_opt(set, pos, max);
6056 /* Compute the maximum of the given set dimension as a function of the
6057 * parameters, but independently of the other set dimensions.
6059 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
6061 return set_dim_opt(set, pos, 1);
6064 /* Compute the minimum of the given set dimension as a function of the
6065 * parameters, but independently of the other set dimensions.
6067 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
6069 return set_dim_opt(set, pos, 0);
6072 /* Apply a preimage specified by "mat" on the parameters of "bset".
6073 * bset is assumed to have only parameters and divs.
6075 static struct isl_basic_set *basic_set_parameter_preimage(
6076 struct isl_basic_set *bset, struct isl_mat *mat)
6083 bset->dim = isl_space_cow(bset->dim);
6087 nparam = isl_basic_set_dim(bset, isl_dim_param);
6089 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
6091 bset->dim->nparam = 0;
6092 bset->dim->n_out = nparam;
6093 bset = isl_basic_set_preimage(bset, mat);
6095 bset->dim->nparam = bset->dim->n_out;
6096 bset->dim->n_out = 0;
6101 isl_basic_set_free(bset);
6105 /* Apply a preimage specified by "mat" on the parameters of "set".
6106 * set is assumed to have only parameters and divs.
6108 static struct isl_set *set_parameter_preimage(
6109 struct isl_set *set, struct isl_mat *mat)
6111 isl_space *dim = NULL;
6117 dim = isl_space_copy(set->dim);
6118 dim = isl_space_cow(dim);
6122 nparam = isl_set_dim(set, isl_dim_param);
6124 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
6127 dim->n_out = nparam;
6128 isl_set_reset_space(set, dim);
6129 set = isl_set_preimage(set, mat);
6132 dim = isl_space_copy(set->dim);
6133 dim = isl_space_cow(dim);
6136 dim->nparam = dim->n_out;
6138 isl_set_reset_space(set, dim);
6141 isl_space_free(dim);
6148 /* Intersect the basic set "bset" with the affine space specified by the
6149 * equalities in "eq".
6151 static struct isl_basic_set *basic_set_append_equalities(
6152 struct isl_basic_set *bset, struct isl_mat *eq)
6160 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
6165 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
6166 for (i = 0; i < eq->n_row; ++i) {
6167 k = isl_basic_set_alloc_equality(bset);
6170 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
6171 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
6175 bset = isl_basic_set_gauss(bset, NULL);
6176 bset = isl_basic_set_finalize(bset);
6181 isl_basic_set_free(bset);
6185 /* Intersect the set "set" with the affine space specified by the
6186 * equalities in "eq".
6188 static struct isl_set *set_append_equalities(struct isl_set *set,
6196 for (i = 0; i < set->n; ++i) {
6197 set->p[i] = basic_set_append_equalities(set->p[i],
6210 /* Project the given basic set onto its parameter domain, possibly introducing
6211 * new, explicit, existential variables in the constraints.
6212 * The input has parameters and (possibly implicit) existential variables.
6213 * The output has the same parameters, but only
6214 * explicit existentially quantified variables.
6216 * The actual projection is performed by pip, but pip doesn't seem
6217 * to like equalities very much, so we first remove the equalities
6218 * among the parameters by performing a variable compression on
6219 * the parameters. Afterward, an inverse transformation is performed
6220 * and the equalities among the parameters are inserted back in.
6222 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
6226 struct isl_mat *T, *T2;
6227 struct isl_set *set;
6228 unsigned nparam, n_div;
6230 bset = isl_basic_set_cow(bset);
6234 if (bset->n_eq == 0)
6235 return isl_basic_set_lexmin(bset);
6237 isl_basic_set_gauss(bset, NULL);
6239 nparam = isl_basic_set_dim(bset, isl_dim_param);
6240 n_div = isl_basic_set_dim(bset, isl_dim_div);
6242 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
6243 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
6246 if (i == bset->n_eq)
6247 return isl_basic_set_lexmin(bset);
6249 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
6251 eq = isl_mat_cow(eq);
6252 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
6253 if (T && T->n_col == 0) {
6257 bset = isl_basic_set_set_to_empty(bset);
6258 return isl_set_from_basic_set(bset);
6260 bset = basic_set_parameter_preimage(bset, T);
6262 set = isl_basic_set_lexmin(bset);
6263 set = set_parameter_preimage(set, T2);
6264 set = set_append_equalities(set, eq);
6268 /* Compute an explicit representation for all the existentially
6269 * quantified variables.
6270 * The input and output dimensions are first turned into parameters.
6271 * compute_divs then returns a map with the same parameters and
6272 * no input or output dimensions and the dimension specification
6273 * is reset to that of the input.
6275 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
6277 struct isl_basic_set *bset;
6278 struct isl_set *set;
6279 struct isl_map *map;
6280 isl_space *dim, *orig_dim = NULL;
6285 bmap = isl_basic_map_cow(bmap);
6289 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6290 n_in = isl_basic_map_dim(bmap, isl_dim_in);
6291 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6292 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
6296 orig_dim = bmap->dim;
6298 bset = (struct isl_basic_set *)bmap;
6300 set = parameter_compute_divs(bset);
6301 map = (struct isl_map *)set;
6302 map = isl_map_reset_space(map, orig_dim);
6306 isl_basic_map_free(bmap);
6310 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
6318 off = isl_space_dim(bmap->dim, isl_dim_all);
6319 for (i = 0; i < bmap->n_div; ++i) {
6320 if (isl_int_is_zero(bmap->div[i][0]))
6322 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
6328 static int map_divs_known(__isl_keep isl_map *map)
6335 for (i = 0; i < map->n; ++i) {
6336 int known = isl_basic_map_divs_known(map->p[i]);
6344 /* If bmap contains any unknown divs, then compute explicit
6345 * expressions for them. However, this computation may be
6346 * quite expensive, so first try to remove divs that aren't
6349 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
6352 struct isl_map *map;
6354 known = isl_basic_map_divs_known(bmap);
6358 return isl_map_from_basic_map(bmap);
6360 bmap = isl_basic_map_drop_redundant_divs(bmap);
6362 known = isl_basic_map_divs_known(bmap);
6366 return isl_map_from_basic_map(bmap);
6368 map = compute_divs(bmap);
6371 isl_basic_map_free(bmap);
6375 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6379 struct isl_map *res;
6386 known = map_divs_known(map);
6394 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6395 for (i = 1 ; i < map->n; ++i) {
6397 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6398 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6399 res = isl_map_union_disjoint(res, r2);
6401 res = isl_map_union(res, r2);
6408 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6410 return (struct isl_set *)
6411 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6414 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6416 return (struct isl_set *)
6417 isl_map_compute_divs((struct isl_map *)set);
6420 struct isl_set *isl_map_domain(struct isl_map *map)
6423 struct isl_set *set;
6428 map = isl_map_cow(map);
6432 set = (struct isl_set *)map;
6433 set->dim = isl_space_domain(set->dim);
6436 for (i = 0; i < map->n; ++i) {
6437 set->p[i] = isl_basic_map_domain(map->p[i]);
6441 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6442 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6449 /* Return the union of "map1" and "map2", where we assume for now that
6450 * "map1" and "map2" are disjoint. Note that the basic maps inside
6451 * "map1" or "map2" may not be disjoint from each other.
6452 * Also note that this function is also called from isl_map_union,
6453 * which takes care of handling the situation where "map1" and "map2"
6454 * may not be disjoint.
6456 * If one of the inputs is empty, we can simply return the other input.
6457 * Similarly, if one of the inputs is universal, then it is equal to the union.
6459 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6460 __isl_take isl_map *map2)
6464 struct isl_map *map = NULL;
6479 is_universe = isl_map_plain_is_universe(map1);
6480 if (is_universe < 0)
6487 is_universe = isl_map_plain_is_universe(map2);
6488 if (is_universe < 0)
6495 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6497 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6498 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6499 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6501 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6502 map1->n + map2->n, flags);
6505 for (i = 0; i < map1->n; ++i) {
6506 map = isl_map_add_basic_map(map,
6507 isl_basic_map_copy(map1->p[i]));
6511 for (i = 0; i < map2->n; ++i) {
6512 map = isl_map_add_basic_map(map,
6513 isl_basic_map_copy(map2->p[i]));
6527 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6528 __isl_take isl_map *map2)
6530 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6533 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6535 map1 = isl_map_union_disjoint(map1, map2);
6539 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6543 struct isl_set *isl_set_union_disjoint(
6544 struct isl_set *set1, struct isl_set *set2)
6546 return (struct isl_set *)
6547 isl_map_union_disjoint(
6548 (struct isl_map *)set1, (struct isl_map *)set2);
6551 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6553 return (struct isl_set *)
6554 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6557 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6560 * "map" and "set" are assumed to be compatible and non-NULL.
6562 static __isl_give isl_map *map_intersect_set(__isl_take isl_map *map,
6563 __isl_take isl_set *set,
6564 __isl_give isl_basic_map *fn(__isl_take isl_basic_map *bmap,
6565 __isl_take isl_basic_set *bset))
6568 struct isl_map *result;
6571 if (isl_set_plain_is_universe(set)) {
6576 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6577 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6578 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6580 result = isl_map_alloc_space(isl_space_copy(map->dim),
6581 map->n * set->n, flags);
6582 for (i = 0; result && i < map->n; ++i)
6583 for (j = 0; j < set->n; ++j) {
6584 result = isl_map_add_basic_map(result,
6585 fn(isl_basic_map_copy(map->p[i]),
6586 isl_basic_set_copy(set->p[j])));
6596 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6597 __isl_take isl_set *set)
6602 if (!isl_map_compatible_range(map, set))
6603 isl_die(set->ctx, isl_error_invalid,
6604 "incompatible spaces", goto error);
6606 return map_intersect_set(map, set, &isl_basic_map_intersect_range);
6613 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6614 __isl_take isl_set *set)
6616 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6619 static __isl_give isl_map *map_intersect_domain(__isl_take isl_map *map,
6620 __isl_take isl_set *set)
6625 if (!isl_map_compatible_domain(map, set))
6626 isl_die(set->ctx, isl_error_invalid,
6627 "incompatible spaces", goto error);
6629 return map_intersect_set(map, set, &isl_basic_map_intersect_domain);
6636 __isl_give isl_map *isl_map_intersect_domain(__isl_take isl_map *map,
6637 __isl_take isl_set *set)
6639 return isl_map_align_params_map_map_and(map, set,
6640 &map_intersect_domain);
6643 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6644 __isl_take isl_map *map2)
6648 map1 = isl_map_reverse(map1);
6649 map1 = isl_map_apply_range(map1, map2);
6650 return isl_map_reverse(map1);
6657 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6658 __isl_take isl_map *map2)
6660 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6663 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6664 __isl_take isl_map *map2)
6666 isl_space *dim_result;
6667 struct isl_map *result;
6673 dim_result = isl_space_join(isl_space_copy(map1->dim),
6674 isl_space_copy(map2->dim));
6676 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6679 for (i = 0; i < map1->n; ++i)
6680 for (j = 0; j < map2->n; ++j) {
6681 result = isl_map_add_basic_map(result,
6682 isl_basic_map_apply_range(
6683 isl_basic_map_copy(map1->p[i]),
6684 isl_basic_map_copy(map2->p[j])));
6690 if (result && result->n <= 1)
6691 ISL_F_SET(result, ISL_MAP_DISJOINT);
6699 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6700 __isl_take isl_map *map2)
6702 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6706 * returns range - domain
6708 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6710 isl_space *dims, *target_dim;
6711 struct isl_basic_set *bset;
6718 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6719 bmap->dim, isl_dim_out),
6721 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6722 dim = isl_basic_map_n_in(bmap);
6723 nparam = isl_basic_map_n_param(bmap);
6724 bset = isl_basic_set_from_basic_map(bmap);
6725 bset = isl_basic_set_cow(bset);
6726 dims = isl_basic_set_get_space(bset);
6727 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6728 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6729 bset = isl_basic_set_swap_vars(bset, 2*dim);
6730 for (i = 0; i < dim; ++i) {
6731 int j = isl_basic_map_alloc_equality(
6732 (struct isl_basic_map *)bset);
6735 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6736 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6737 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6738 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6740 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6741 bset = isl_basic_set_reset_space(bset, target_dim);
6744 isl_basic_map_free(bmap);
6749 * returns range - domain
6751 __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map)
6755 struct isl_set *result;
6760 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6761 map->dim, isl_dim_out),
6763 dim = isl_map_get_space(map);
6764 dim = isl_space_domain(dim);
6765 result = isl_set_alloc_space(dim, map->n, 0);
6768 for (i = 0; i < map->n; ++i)
6769 result = isl_set_add_basic_set(result,
6770 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6779 * returns [domain -> range] -> range - domain
6781 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6782 __isl_take isl_basic_map *bmap)
6786 isl_basic_map *domain;
6790 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6791 isl_die(bmap->ctx, isl_error_invalid,
6792 "domain and range don't match", goto error);
6794 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6795 n = isl_basic_map_dim(bmap, isl_dim_in);
6797 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6798 domain = isl_basic_map_universe(dim);
6800 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6801 bmap = isl_basic_map_apply_range(bmap, domain);
6802 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6804 total = isl_basic_map_total_dim(bmap);
6806 for (i = 0; i < n; ++i) {
6807 k = isl_basic_map_alloc_equality(bmap);
6810 isl_seq_clr(bmap->eq[k], 1 + total);
6811 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6812 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6813 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6816 bmap = isl_basic_map_gauss(bmap, NULL);
6817 return isl_basic_map_finalize(bmap);
6819 isl_basic_map_free(bmap);
6824 * returns [domain -> range] -> range - domain
6826 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6829 isl_space *domain_dim;
6834 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6835 isl_die(map->ctx, isl_error_invalid,
6836 "domain and range don't match", goto error);
6838 map = isl_map_cow(map);
6842 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6843 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6844 map->dim = isl_space_join(map->dim, domain_dim);
6847 for (i = 0; i < map->n; ++i) {
6848 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6852 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6859 static __isl_give isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6861 struct isl_basic_map *bmap;
6869 nparam = dims->nparam;
6871 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6875 for (i = 0; i < dim; ++i) {
6876 int j = isl_basic_map_alloc_equality(bmap);
6879 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6880 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6881 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6883 return isl_basic_map_finalize(bmap);
6885 isl_basic_map_free(bmap);
6889 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6893 if (dim->n_in != dim->n_out)
6894 isl_die(dim->ctx, isl_error_invalid,
6895 "number of input and output dimensions needs to be "
6896 "the same", goto error);
6897 return basic_map_identity(dim);
6899 isl_space_free(dim);
6903 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6905 if (!model || !model->dim)
6907 return isl_basic_map_identity(isl_space_copy(model->dim));
6910 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6912 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6915 struct isl_map *isl_map_identity_like(struct isl_map *model)
6917 if (!model || !model->dim)
6919 return isl_map_identity(isl_space_copy(model->dim));
6922 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6924 if (!model || !model->dim)
6926 return isl_map_identity(isl_space_copy(model->dim));
6929 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6931 isl_space *dim = isl_set_get_space(set);
6933 id = isl_map_identity(isl_space_map_from_set(dim));
6934 return isl_map_intersect_range(id, set);
6937 /* Construct a basic set with all set dimensions having only non-negative
6940 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6941 __isl_take isl_space *space)
6946 struct isl_basic_set *bset;
6950 nparam = space->nparam;
6952 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6955 for (i = 0; i < dim; ++i) {
6956 int k = isl_basic_set_alloc_inequality(bset);
6959 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6960 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6964 isl_basic_set_free(bset);
6968 /* Construct the half-space x_pos >= 0.
6970 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6974 isl_basic_set *nonneg;
6976 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6977 k = isl_basic_set_alloc_inequality(nonneg);
6980 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6981 isl_int_set_si(nonneg->ineq[k][pos], 1);
6983 return isl_basic_set_finalize(nonneg);
6985 isl_basic_set_free(nonneg);
6989 /* Construct the half-space x_pos <= -1.
6991 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6996 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6997 k = isl_basic_set_alloc_inequality(neg);
7000 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
7001 isl_int_set_si(neg->ineq[k][0], -1);
7002 isl_int_set_si(neg->ineq[k][pos], -1);
7004 return isl_basic_set_finalize(neg);
7006 isl_basic_set_free(neg);
7010 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
7011 enum isl_dim_type type, unsigned first, unsigned n)
7014 isl_basic_set *nonneg;
7022 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
7024 for (i = 0; i < n; ++i) {
7025 nonneg = nonneg_halfspace(isl_set_get_space(set),
7026 pos(set->dim, type) + first + i);
7027 neg = neg_halfspace(isl_set_get_space(set),
7028 pos(set->dim, type) + first + i);
7030 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
7039 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
7040 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7047 if (isl_set_plain_is_empty(set)) {
7052 return fn(set, signs, user);
7055 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
7057 half = isl_set_intersect(half, isl_set_copy(set));
7058 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
7062 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
7064 half = isl_set_intersect(half, set);
7065 return foreach_orthant(half, signs, first + 1, len, fn, user);
7071 /* Call "fn" on the intersections of "set" with each of the orthants
7072 * (except for obviously empty intersections). The orthant is identified
7073 * by the signs array, with each entry having value 1 or -1 according
7074 * to the sign of the corresponding variable.
7076 int isl_set_foreach_orthant(__isl_keep isl_set *set,
7077 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7087 if (isl_set_plain_is_empty(set))
7090 nparam = isl_set_dim(set, isl_dim_param);
7091 nvar = isl_set_dim(set, isl_dim_set);
7093 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
7095 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
7103 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
7105 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
7108 int isl_basic_map_is_subset(
7109 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7112 struct isl_map *map1;
7113 struct isl_map *map2;
7115 if (!bmap1 || !bmap2)
7118 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
7119 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
7121 is_subset = isl_map_is_subset(map1, map2);
7129 int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
7130 __isl_keep isl_basic_set *bset2)
7132 return isl_basic_map_is_subset(bset1, bset2);
7135 int isl_basic_map_is_equal(
7136 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7140 if (!bmap1 || !bmap2)
7142 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7145 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7149 int isl_basic_set_is_equal(
7150 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7152 return isl_basic_map_is_equal(
7153 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
7156 int isl_map_is_empty(struct isl_map *map)
7163 for (i = 0; i < map->n; ++i) {
7164 is_empty = isl_basic_map_is_empty(map->p[i]);
7173 int isl_map_plain_is_empty(__isl_keep isl_map *map)
7175 return map ? map->n == 0 : -1;
7178 int isl_map_fast_is_empty(__isl_keep isl_map *map)
7180 return isl_map_plain_is_empty(map);
7183 int isl_set_plain_is_empty(struct isl_set *set)
7185 return set ? set->n == 0 : -1;
7188 int isl_set_fast_is_empty(__isl_keep isl_set *set)
7190 return isl_set_plain_is_empty(set);
7193 int isl_set_is_empty(struct isl_set *set)
7195 return isl_map_is_empty((struct isl_map *)set);
7198 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7203 return isl_space_is_equal(map1->dim, map2->dim);
7206 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7211 return isl_space_is_equal(set1->dim, set2->dim);
7214 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7220 is_subset = isl_map_is_subset(map1, map2);
7223 is_subset = isl_map_is_subset(map2, map1);
7227 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7229 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
7232 int isl_basic_map_is_strict_subset(
7233 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7237 if (!bmap1 || !bmap2)
7239 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7242 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7243 if (is_subset == -1)
7248 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
7254 is_subset = isl_map_is_subset(map1, map2);
7257 is_subset = isl_map_is_subset(map2, map1);
7258 if (is_subset == -1)
7263 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7265 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
7268 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
7272 return bmap->n_eq == 0 && bmap->n_ineq == 0;
7275 int isl_basic_set_is_universe(struct isl_basic_set *bset)
7279 return bset->n_eq == 0 && bset->n_ineq == 0;
7282 int isl_map_plain_is_universe(__isl_keep isl_map *map)
7289 for (i = 0; i < map->n; ++i) {
7290 int r = isl_basic_map_is_universe(map->p[i]);
7298 int isl_set_plain_is_universe(__isl_keep isl_set *set)
7300 return isl_map_plain_is_universe((isl_map *) set);
7303 int isl_set_fast_is_universe(__isl_keep isl_set *set)
7305 return isl_set_plain_is_universe(set);
7308 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
7310 struct isl_basic_set *bset = NULL;
7311 struct isl_vec *sample = NULL;
7318 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
7321 if (isl_basic_map_is_universe(bmap))
7324 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
7325 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
7326 copy = isl_basic_map_remove_redundancies(copy);
7327 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
7328 isl_basic_map_free(copy);
7332 total = 1 + isl_basic_map_total_dim(bmap);
7333 if (bmap->sample && bmap->sample->size == total) {
7334 int contains = isl_basic_map_contains(bmap, bmap->sample);
7340 isl_vec_free(bmap->sample);
7341 bmap->sample = NULL;
7342 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
7345 sample = isl_basic_set_sample_vec(bset);
7348 empty = sample->size == 0;
7349 isl_vec_free(bmap->sample);
7350 bmap->sample = sample;
7352 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
7357 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
7361 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
7364 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
7366 return isl_basic_map_plain_is_empty(bmap);
7369 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
7373 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
7376 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
7378 return isl_basic_set_plain_is_empty(bset);
7381 int isl_basic_set_is_empty(struct isl_basic_set *bset)
7383 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
7386 struct isl_map *isl_basic_map_union(
7387 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7389 struct isl_map *map;
7390 if (!bmap1 || !bmap2)
7393 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
7395 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
7398 map = isl_map_add_basic_map(map, bmap1);
7399 map = isl_map_add_basic_map(map, bmap2);
7402 isl_basic_map_free(bmap1);
7403 isl_basic_map_free(bmap2);
7407 struct isl_set *isl_basic_set_union(
7408 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7410 return (struct isl_set *)isl_basic_map_union(
7411 (struct isl_basic_map *)bset1,
7412 (struct isl_basic_map *)bset2);
7415 /* Order divs such that any div only depends on previous divs */
7416 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
7424 off = isl_space_dim(bmap->dim, isl_dim_all);
7426 for (i = 0; i < bmap->n_div; ++i) {
7428 if (isl_int_is_zero(bmap->div[i][0]))
7430 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
7434 isl_basic_map_swap_div(bmap, i, i + pos);
7440 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7442 return (struct isl_basic_set *)
7443 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7446 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7453 for (i = 0; i < map->n; ++i) {
7454 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7465 /* Apply the expansion computed by isl_merge_divs.
7466 * The expansion itself is given by "exp" while the resulting
7467 * list of divs is given by "div".
7469 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7470 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7475 bset = isl_basic_set_cow(bset);
7479 if (div->n_row < bset->n_div)
7480 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7481 "not an expansion", goto error);
7483 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7484 div->n_row - bset->n_div, 0,
7485 2 * (div->n_row - bset->n_div));
7487 n_div = bset->n_div;
7488 for (i = n_div; i < div->n_row; ++i)
7489 if (isl_basic_set_alloc_div(bset) < 0)
7493 for (i = div->n_row - 1; i >= 0; --i) {
7494 if (j >= 0 && exp[j] == i) {
7496 isl_basic_map_swap_div(bset, i, j);
7499 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7500 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7508 isl_basic_set_free(bset);
7513 /* Look for a div in dst that corresponds to the div "div" in src.
7514 * The divs before "div" in src and dst are assumed to be the same.
7516 * Returns -1 if no corresponding div was found and the position
7517 * of the corresponding div in dst otherwise.
7519 static int find_div(struct isl_basic_map *dst,
7520 struct isl_basic_map *src, unsigned div)
7524 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7526 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7527 for (i = div; i < dst->n_div; ++i)
7528 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7529 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7530 dst->n_div - div) == -1)
7535 struct isl_basic_map *isl_basic_map_align_divs(
7536 struct isl_basic_map *dst, struct isl_basic_map *src)
7539 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7544 if (src->n_div == 0)
7547 for (i = 0; i < src->n_div; ++i)
7548 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7550 src = isl_basic_map_order_divs(src);
7551 dst = isl_basic_map_cow(dst);
7552 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7553 src->n_div, 0, 2 * src->n_div);
7556 for (i = 0; i < src->n_div; ++i) {
7557 int j = find_div(dst, src, i);
7559 j = isl_basic_map_alloc_div(dst);
7562 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7563 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7564 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7568 isl_basic_map_swap_div(dst, i, j);
7572 isl_basic_map_free(dst);
7576 struct isl_basic_set *isl_basic_set_align_divs(
7577 struct isl_basic_set *dst, struct isl_basic_set *src)
7579 return (struct isl_basic_set *)isl_basic_map_align_divs(
7580 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7583 struct isl_map *isl_map_align_divs(struct isl_map *map)
7591 map = isl_map_compute_divs(map);
7592 map = isl_map_cow(map);
7596 for (i = 1; i < map->n; ++i)
7597 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7598 for (i = 1; i < map->n; ++i)
7599 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7601 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7605 struct isl_set *isl_set_align_divs(struct isl_set *set)
7607 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7610 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7611 __isl_take isl_map *map)
7615 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7616 map = isl_map_intersect_domain(map, set);
7617 set = isl_map_range(map);
7625 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7626 __isl_take isl_map *map)
7628 return isl_map_align_params_map_map_and(set, map, &set_apply);
7631 /* There is no need to cow as removing empty parts doesn't change
7632 * the meaning of the set.
7634 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7641 for (i = map->n - 1; i >= 0; --i)
7642 remove_if_empty(map, i);
7647 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7649 return (struct isl_set *)
7650 isl_map_remove_empty_parts((struct isl_map *)set);
7653 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7655 struct isl_basic_map *bmap;
7656 if (!map || map->n == 0)
7658 bmap = map->p[map->n-1];
7659 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7660 return isl_basic_map_copy(bmap);
7663 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7665 return (struct isl_basic_set *)
7666 isl_map_copy_basic_map((struct isl_map *)set);
7669 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7670 __isl_keep isl_basic_map *bmap)
7676 for (i = map->n-1; i >= 0; --i) {
7677 if (map->p[i] != bmap)
7679 map = isl_map_cow(map);
7682 isl_basic_map_free(map->p[i]);
7683 if (i != map->n-1) {
7684 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7685 map->p[i] = map->p[map->n-1];
7696 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7697 struct isl_basic_set *bset)
7699 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7700 (struct isl_basic_map *)bset);
7703 /* Given two basic sets bset1 and bset2, compute the maximal difference
7704 * between the values of dimension pos in bset1 and those in bset2
7705 * for any common value of the parameters and dimensions preceding pos.
7707 static enum isl_lp_result basic_set_maximal_difference_at(
7708 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7709 int pos, isl_int *opt)
7712 struct isl_basic_map *bmap1 = NULL;
7713 struct isl_basic_map *bmap2 = NULL;
7714 struct isl_ctx *ctx;
7715 struct isl_vec *obj;
7718 unsigned dim1, dim2;
7719 enum isl_lp_result res;
7721 if (!bset1 || !bset2)
7722 return isl_lp_error;
7724 nparam = isl_basic_set_n_param(bset1);
7725 dim1 = isl_basic_set_n_dim(bset1);
7726 dim2 = isl_basic_set_n_dim(bset2);
7727 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7728 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7729 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7730 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7731 if (!bmap1 || !bmap2)
7733 bmap1 = isl_basic_map_cow(bmap1);
7734 bmap1 = isl_basic_map_extend(bmap1, nparam,
7735 pos, (dim1 - pos) + (dim2 - pos),
7736 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7737 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7740 total = isl_basic_map_total_dim(bmap1);
7742 obj = isl_vec_alloc(ctx, 1 + total);
7743 isl_seq_clr(obj->block.data, 1 + total);
7744 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7745 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7748 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7750 isl_basic_map_free(bmap1);
7754 isl_basic_map_free(bmap1);
7755 isl_basic_map_free(bmap2);
7756 return isl_lp_error;
7759 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7760 * for any common value of the parameters and dimensions preceding pos
7761 * in both basic sets, the values of dimension pos in bset1 are
7762 * smaller or larger than those in bset2.
7765 * 1 if bset1 follows bset2
7766 * -1 if bset1 precedes bset2
7767 * 0 if bset1 and bset2 are incomparable
7768 * -2 if some error occurred.
7770 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7771 struct isl_basic_set *bset2, int pos)
7774 enum isl_lp_result res;
7779 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7781 if (res == isl_lp_empty)
7783 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7784 res == isl_lp_unbounded)
7786 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7795 /* Given two basic sets bset1 and bset2, check whether
7796 * for any common value of the parameters and dimensions preceding pos
7797 * there is a value of dimension pos in bset1 that is larger
7798 * than a value of the same dimension in bset2.
7801 * 1 if there exists such a pair
7802 * 0 if there is no such pair, but there is a pair of equal values
7804 * -2 if some error occurred.
7806 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7807 __isl_keep isl_basic_set *bset2, int pos)
7810 enum isl_lp_result res;
7815 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7817 if (res == isl_lp_empty)
7819 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7820 res == isl_lp_unbounded)
7822 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7824 else if (res == isl_lp_ok)
7833 /* Given two sets set1 and set2, check whether
7834 * for any common value of the parameters and dimensions preceding pos
7835 * there is a value of dimension pos in set1 that is larger
7836 * than a value of the same dimension in set2.
7839 * 1 if there exists such a pair
7840 * 0 if there is no such pair, but there is a pair of equal values
7842 * -2 if some error occurred.
7844 int isl_set_follows_at(__isl_keep isl_set *set1,
7845 __isl_keep isl_set *set2, int pos)
7853 for (i = 0; i < set1->n; ++i)
7854 for (j = 0; j < set2->n; ++j) {
7856 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7857 if (f == 1 || f == -2)
7866 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7867 unsigned pos, isl_int *val)
7875 total = isl_basic_map_total_dim(bmap);
7876 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7877 for (; d+1 > pos; --d)
7878 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7882 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7884 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7886 if (!isl_int_is_one(bmap->eq[i][1+d]))
7889 isl_int_neg(*val, bmap->eq[i][0]);
7895 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7896 unsigned pos, isl_int *val)
7908 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7911 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7912 for (i = 1; fixed == 1 && i < map->n; ++i) {
7913 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7914 if (fixed == 1 && isl_int_ne(tmp, v))
7918 isl_int_set(*val, v);
7924 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7925 unsigned pos, isl_int *val)
7927 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7931 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7934 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7937 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7938 enum isl_dim_type type, unsigned pos, isl_int *val)
7940 if (pos >= isl_basic_map_dim(bmap, type))
7942 return isl_basic_map_plain_has_fixed_var(bmap,
7943 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7946 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7947 enum isl_dim_type type, unsigned pos, isl_int *val)
7949 if (pos >= isl_map_dim(map, type))
7951 return isl_map_plain_has_fixed_var(map,
7952 map_offset(map, type) - 1 + pos, val);
7955 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7956 enum isl_dim_type type, unsigned pos, isl_int *val)
7958 return isl_map_plain_is_fixed(set, type, pos, val);
7961 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7962 enum isl_dim_type type, unsigned pos, isl_int *val)
7964 return isl_map_plain_is_fixed(map, type, pos, val);
7967 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7968 * then return this fixed value in *val.
7970 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7971 unsigned dim, isl_int *val)
7973 return isl_basic_set_plain_has_fixed_var(bset,
7974 isl_basic_set_n_param(bset) + dim, val);
7977 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7978 * then return this fixed value in *val.
7980 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7981 unsigned dim, isl_int *val)
7983 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7986 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7987 unsigned dim, isl_int *val)
7989 return isl_set_plain_dim_is_fixed(set, dim, val);
7992 /* Check if input variable in has fixed value and if so and if val is not NULL,
7993 * then return this fixed value in *val.
7995 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7996 unsigned in, isl_int *val)
7998 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
8001 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8002 * and if val is not NULL, then return this lower bound in *val.
8004 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8005 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
8007 int i, i_eq = -1, i_ineq = -1;
8014 total = isl_basic_set_total_dim(bset);
8015 nparam = isl_basic_set_n_param(bset);
8016 for (i = 0; i < bset->n_eq; ++i) {
8017 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
8023 for (i = 0; i < bset->n_ineq; ++i) {
8024 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
8026 if (i_eq != -1 || i_ineq != -1)
8030 if (i_eq == -1 && i_ineq == -1)
8032 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
8033 /* The coefficient should always be one due to normalization. */
8034 if (!isl_int_is_one(c[1+nparam+dim]))
8036 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
8038 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
8039 total - nparam - dim - 1) != -1)
8042 isl_int_neg(*val, c[0]);
8046 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
8047 unsigned dim, isl_int *val)
8059 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
8063 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
8065 for (i = 1; fixed == 1 && i < set->n; ++i) {
8066 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
8068 if (fixed == 1 && isl_int_ne(tmp, v))
8072 isl_int_set(*val, v);
8083 /* uset_gist depends on constraints without existentially quantified
8084 * variables sorting first.
8086 static int qsort_constraint_cmp(const void *p1, const void *p2)
8088 const struct constraint *c1 = (const struct constraint *)p1;
8089 const struct constraint *c2 = (const struct constraint *)p2;
8091 unsigned size = isl_min(c1->size, c2->size);
8093 l1 = isl_seq_last_non_zero(c1->c, size);
8094 l2 = isl_seq_last_non_zero(c2->c, size);
8099 return isl_seq_cmp(c1->c, c2->c, size);
8102 static struct isl_basic_map *isl_basic_map_sort_constraints(
8103 struct isl_basic_map *bmap)
8106 struct constraint *c;
8111 total = isl_basic_map_total_dim(bmap);
8112 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
8115 for (i = 0; i < bmap->n_ineq; ++i) {
8117 c[i].c = bmap->ineq[i];
8119 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
8120 for (i = 0; i < bmap->n_ineq; ++i)
8121 bmap->ineq[i] = c[i].c;
8125 isl_basic_map_free(bmap);
8129 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
8130 __isl_take isl_basic_set *bset)
8132 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
8133 (struct isl_basic_map *)bset);
8136 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
8140 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
8142 bmap = isl_basic_map_remove_redundancies(bmap);
8143 bmap = isl_basic_map_sort_constraints(bmap);
8144 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
8148 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
8150 return (struct isl_basic_set *)isl_basic_map_normalize(
8151 (struct isl_basic_map *)bset);
8154 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
8155 const __isl_keep isl_basic_map *bmap2)
8162 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
8163 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
8164 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
8165 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
8166 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
8167 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
8168 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8169 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
8170 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8171 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
8172 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8174 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
8176 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8178 if (bmap1->n_eq != bmap2->n_eq)
8179 return bmap1->n_eq - bmap2->n_eq;
8180 if (bmap1->n_ineq != bmap2->n_ineq)
8181 return bmap1->n_ineq - bmap2->n_ineq;
8182 if (bmap1->n_div != bmap2->n_div)
8183 return bmap1->n_div - bmap2->n_div;
8184 total = isl_basic_map_total_dim(bmap1);
8185 for (i = 0; i < bmap1->n_eq; ++i) {
8186 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
8190 for (i = 0; i < bmap1->n_ineq; ++i) {
8191 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
8195 for (i = 0; i < bmap1->n_div; ++i) {
8196 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
8203 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
8204 const __isl_keep isl_basic_set *bset2)
8206 return isl_basic_map_plain_cmp(bset1, bset2);
8209 int isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8215 if (set1->n != set2->n)
8216 return set1->n - set2->n;
8218 for (i = 0; i < set1->n; ++i) {
8219 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
8227 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
8228 __isl_keep isl_basic_map *bmap2)
8230 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
8233 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
8234 __isl_keep isl_basic_set *bset2)
8236 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
8237 (isl_basic_map *)bset2);
8240 static int qsort_bmap_cmp(const void *p1, const void *p2)
8242 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
8243 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
8245 return isl_basic_map_plain_cmp(bmap1, bmap2);
8248 /* We normalize in place, but if anything goes wrong we need
8249 * to return NULL, so we need to make sure we don't change the
8250 * meaning of any possible other copies of map.
8252 struct isl_map *isl_map_normalize(struct isl_map *map)
8255 struct isl_basic_map *bmap;
8259 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
8261 for (i = 0; i < map->n; ++i) {
8262 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
8265 isl_basic_map_free(map->p[i]);
8268 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
8269 ISL_F_SET(map, ISL_MAP_NORMALIZED);
8270 map = isl_map_remove_empty_parts(map);
8273 for (i = map->n - 1; i >= 1; --i) {
8274 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
8276 isl_basic_map_free(map->p[i-1]);
8277 for (j = i; j < map->n; ++j)
8278 map->p[j-1] = map->p[j];
8288 struct isl_set *isl_set_normalize(struct isl_set *set)
8290 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
8293 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8303 if (!isl_space_is_equal(map1->dim, map2->dim))
8306 map1 = isl_map_copy(map1);
8307 map2 = isl_map_copy(map2);
8308 map1 = isl_map_normalize(map1);
8309 map2 = isl_map_normalize(map2);
8312 equal = map1->n == map2->n;
8313 for (i = 0; equal && i < map1->n; ++i) {
8314 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
8327 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8329 return isl_map_plain_is_equal(map1, map2);
8332 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8334 return isl_map_plain_is_equal((struct isl_map *)set1,
8335 (struct isl_map *)set2);
8338 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8340 return isl_set_plain_is_equal(set1, set2);
8343 /* Return an interval that ranges from min to max (inclusive)
8345 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
8346 isl_int min, isl_int max)
8349 struct isl_basic_set *bset = NULL;
8351 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
8355 k = isl_basic_set_alloc_inequality(bset);
8358 isl_int_set_si(bset->ineq[k][1], 1);
8359 isl_int_neg(bset->ineq[k][0], min);
8361 k = isl_basic_set_alloc_inequality(bset);
8364 isl_int_set_si(bset->ineq[k][1], -1);
8365 isl_int_set(bset->ineq[k][0], max);
8369 isl_basic_set_free(bset);
8373 /* Return the Cartesian product of the basic sets in list (in the given order).
8375 __isl_give isl_basic_set *isl_basic_set_list_product(
8376 __isl_take struct isl_basic_set_list *list)
8384 struct isl_basic_set *product = NULL;
8388 isl_assert(list->ctx, list->n > 0, goto error);
8389 isl_assert(list->ctx, list->p[0], goto error);
8390 nparam = isl_basic_set_n_param(list->p[0]);
8391 dim = isl_basic_set_n_dim(list->p[0]);
8392 extra = list->p[0]->n_div;
8393 n_eq = list->p[0]->n_eq;
8394 n_ineq = list->p[0]->n_ineq;
8395 for (i = 1; i < list->n; ++i) {
8396 isl_assert(list->ctx, list->p[i], goto error);
8397 isl_assert(list->ctx,
8398 nparam == isl_basic_set_n_param(list->p[i]), goto error);
8399 dim += isl_basic_set_n_dim(list->p[i]);
8400 extra += list->p[i]->n_div;
8401 n_eq += list->p[i]->n_eq;
8402 n_ineq += list->p[i]->n_ineq;
8404 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
8409 for (i = 0; i < list->n; ++i) {
8410 isl_basic_set_add_constraints(product,
8411 isl_basic_set_copy(list->p[i]), dim);
8412 dim += isl_basic_set_n_dim(list->p[i]);
8414 isl_basic_set_list_free(list);
8417 isl_basic_set_free(product);
8418 isl_basic_set_list_free(list);
8422 struct isl_basic_map *isl_basic_map_product(
8423 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
8425 isl_space *dim_result = NULL;
8426 struct isl_basic_map *bmap;
8427 unsigned in1, in2, out1, out2, nparam, total, pos;
8428 struct isl_dim_map *dim_map1, *dim_map2;
8430 if (!bmap1 || !bmap2)
8433 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8434 bmap2->dim, isl_dim_param), goto error);
8435 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8436 isl_space_copy(bmap2->dim));
8438 in1 = isl_basic_map_n_in(bmap1);
8439 in2 = isl_basic_map_n_in(bmap2);
8440 out1 = isl_basic_map_n_out(bmap1);
8441 out2 = isl_basic_map_n_out(bmap2);
8442 nparam = isl_basic_map_n_param(bmap1);
8444 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8445 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8446 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8447 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8448 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8449 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8450 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8451 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8452 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8453 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8454 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8456 bmap = isl_basic_map_alloc_space(dim_result,
8457 bmap1->n_div + bmap2->n_div,
8458 bmap1->n_eq + bmap2->n_eq,
8459 bmap1->n_ineq + bmap2->n_ineq);
8460 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8461 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8462 bmap = isl_basic_map_simplify(bmap);
8463 return isl_basic_map_finalize(bmap);
8465 isl_basic_map_free(bmap1);
8466 isl_basic_map_free(bmap2);
8470 __isl_give isl_basic_map *isl_basic_map_flat_product(
8471 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8473 isl_basic_map *prod;
8475 prod = isl_basic_map_product(bmap1, bmap2);
8476 prod = isl_basic_map_flatten(prod);
8480 __isl_give isl_basic_set *isl_basic_set_flat_product(
8481 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8483 return isl_basic_map_flat_range_product(bset1, bset2);
8486 __isl_give isl_basic_map *isl_basic_map_domain_product(
8487 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8489 isl_space *space_result = NULL;
8490 isl_basic_map *bmap;
8491 unsigned in1, in2, out, nparam, total, pos;
8492 struct isl_dim_map *dim_map1, *dim_map2;
8494 if (!bmap1 || !bmap2)
8497 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8498 isl_space_copy(bmap2->dim));
8500 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8501 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8502 out = isl_basic_map_dim(bmap1, isl_dim_out);
8503 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8505 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8506 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8507 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8508 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8509 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8510 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8511 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8512 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8513 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8514 isl_dim_map_div(dim_map1, bmap1, pos += out);
8515 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8517 bmap = isl_basic_map_alloc_space(space_result,
8518 bmap1->n_div + bmap2->n_div,
8519 bmap1->n_eq + bmap2->n_eq,
8520 bmap1->n_ineq + bmap2->n_ineq);
8521 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8522 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8523 bmap = isl_basic_map_simplify(bmap);
8524 return isl_basic_map_finalize(bmap);
8526 isl_basic_map_free(bmap1);
8527 isl_basic_map_free(bmap2);
8531 __isl_give isl_basic_map *isl_basic_map_range_product(
8532 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8534 isl_space *dim_result = NULL;
8535 isl_basic_map *bmap;
8536 unsigned in, out1, out2, nparam, total, pos;
8537 struct isl_dim_map *dim_map1, *dim_map2;
8539 if (!bmap1 || !bmap2)
8542 if (!isl_space_match(bmap1->dim, isl_dim_param,
8543 bmap2->dim, isl_dim_param))
8544 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
8545 "parameters don't match", goto error);
8547 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8548 isl_space_copy(bmap2->dim));
8550 in = isl_basic_map_dim(bmap1, isl_dim_in);
8551 out1 = isl_basic_map_n_out(bmap1);
8552 out2 = isl_basic_map_n_out(bmap2);
8553 nparam = isl_basic_map_n_param(bmap1);
8555 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8556 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8557 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8558 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8559 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8560 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8561 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8562 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8563 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8564 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8565 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8567 bmap = isl_basic_map_alloc_space(dim_result,
8568 bmap1->n_div + bmap2->n_div,
8569 bmap1->n_eq + bmap2->n_eq,
8570 bmap1->n_ineq + bmap2->n_ineq);
8571 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8572 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8573 bmap = isl_basic_map_simplify(bmap);
8574 return isl_basic_map_finalize(bmap);
8576 isl_basic_map_free(bmap1);
8577 isl_basic_map_free(bmap2);
8581 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8582 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8584 isl_basic_map *prod;
8586 prod = isl_basic_map_range_product(bmap1, bmap2);
8587 prod = isl_basic_map_flatten_range(prod);
8591 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8592 __isl_take isl_map *map2,
8593 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8594 __isl_take isl_space *right),
8595 __isl_give isl_basic_map *(*basic_map_product)(
8596 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8599 struct isl_map *result;
8605 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8606 map2->dim, isl_dim_param), goto error);
8608 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8609 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8610 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8612 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8613 isl_space_copy(map2->dim)),
8614 map1->n * map2->n, flags);
8617 for (i = 0; i < map1->n; ++i)
8618 for (j = 0; j < map2->n; ++j) {
8619 struct isl_basic_map *part;
8620 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8621 isl_basic_map_copy(map2->p[j]));
8622 if (isl_basic_map_is_empty(part))
8623 isl_basic_map_free(part);
8625 result = isl_map_add_basic_map(result, part);
8638 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8640 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8641 __isl_take isl_map *map2)
8643 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8646 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8647 __isl_take isl_map *map2)
8649 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8652 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8654 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8655 __isl_take isl_map *map2)
8659 prod = isl_map_product(map1, map2);
8660 prod = isl_map_flatten(prod);
8664 /* Given two set A and B, construct its Cartesian product A x B.
8666 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8668 return isl_map_range_product(set1, set2);
8671 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8672 __isl_take isl_set *set2)
8674 return isl_map_flat_range_product(set1, set2);
8677 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8679 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8680 __isl_take isl_map *map2)
8682 return map_product(map1, map2, &isl_space_domain_product,
8683 &isl_basic_map_domain_product);
8686 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8688 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8689 __isl_take isl_map *map2)
8691 return map_product(map1, map2, &isl_space_range_product,
8692 &isl_basic_map_range_product);
8695 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8696 __isl_take isl_map *map2)
8698 return isl_map_align_params_map_map_and(map1, map2,
8699 &map_domain_product_aligned);
8702 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8703 __isl_take isl_map *map2)
8705 return isl_map_align_params_map_map_and(map1, map2,
8706 &map_range_product_aligned);
8709 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8711 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8712 __isl_take isl_map *map2)
8716 prod = isl_map_domain_product(map1, map2);
8717 prod = isl_map_flatten_domain(prod);
8721 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8723 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8724 __isl_take isl_map *map2)
8728 prod = isl_map_range_product(map1, map2);
8729 prod = isl_map_flatten_range(prod);
8733 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8736 uint32_t hash = isl_hash_init();
8741 bmap = isl_basic_map_copy(bmap);
8742 bmap = isl_basic_map_normalize(bmap);
8745 total = isl_basic_map_total_dim(bmap);
8746 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8747 for (i = 0; i < bmap->n_eq; ++i) {
8749 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8750 isl_hash_hash(hash, c_hash);
8752 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8753 for (i = 0; i < bmap->n_ineq; ++i) {
8755 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8756 isl_hash_hash(hash, c_hash);
8758 isl_hash_byte(hash, bmap->n_div & 0xFF);
8759 for (i = 0; i < bmap->n_div; ++i) {
8761 if (isl_int_is_zero(bmap->div[i][0]))
8763 isl_hash_byte(hash, i & 0xFF);
8764 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8765 isl_hash_hash(hash, c_hash);
8767 isl_basic_map_free(bmap);
8771 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8773 return isl_basic_map_get_hash((isl_basic_map *)bset);
8776 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8783 map = isl_map_copy(map);
8784 map = isl_map_normalize(map);
8788 hash = isl_hash_init();
8789 for (i = 0; i < map->n; ++i) {
8791 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8792 isl_hash_hash(hash, bmap_hash);
8800 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8802 return isl_map_get_hash((isl_map *)set);
8805 /* Check if the value for dimension dim is completely determined
8806 * by the values of the other parameters and variables.
8807 * That is, check if dimension dim is involved in an equality.
8809 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8816 nparam = isl_basic_set_n_param(bset);
8817 for (i = 0; i < bset->n_eq; ++i)
8818 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8823 /* Check if the value for dimension dim is completely determined
8824 * by the values of the other parameters and variables.
8825 * That is, check if dimension dim is involved in an equality
8826 * for each of the subsets.
8828 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8834 for (i = 0; i < set->n; ++i) {
8836 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8843 int isl_set_n_basic_set(__isl_keep isl_set *set)
8845 return set ? set->n : 0;
8848 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8849 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8856 for (i = 0; i < map->n; ++i)
8857 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8863 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8864 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8871 for (i = 0; i < set->n; ++i)
8872 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8878 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8885 bset = isl_basic_set_cow(bset);
8889 dim = isl_basic_set_get_space(bset);
8890 dim = isl_space_lift(dim, bset->n_div);
8893 isl_space_free(bset->dim);
8895 bset->extra -= bset->n_div;
8898 bset = isl_basic_set_finalize(bset);
8902 isl_basic_set_free(bset);
8906 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8912 set = isl_set_align_divs(set);
8917 set = isl_set_cow(set);
8921 n_div = set->p[0]->n_div;
8922 dim = isl_set_get_space(set);
8923 dim = isl_space_lift(dim, n_div);
8926 isl_space_free(set->dim);
8929 for (i = 0; i < set->n; ++i) {
8930 set->p[i] = isl_basic_set_lift(set->p[i]);
8941 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8944 struct isl_basic_map *bmap;
8951 set = isl_set_align_divs(set);
8956 dim = isl_set_get_space(set);
8957 if (set->n == 0 || set->p[0]->n_div == 0) {
8959 return isl_map_identity(isl_space_map_from_set(dim));
8962 n_div = set->p[0]->n_div;
8963 dim = isl_space_map_from_set(dim);
8964 n_param = isl_space_dim(dim, isl_dim_param);
8965 n_set = isl_space_dim(dim, isl_dim_in);
8966 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8967 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8968 for (i = 0; i < n_set; ++i)
8969 bmap = var_equal(bmap, i);
8971 total = n_param + n_set + n_set + n_div;
8972 for (i = 0; i < n_div; ++i) {
8973 k = isl_basic_map_alloc_inequality(bmap);
8976 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8977 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8978 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8979 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8980 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8981 set->p[0]->div[i][0]);
8983 l = isl_basic_map_alloc_inequality(bmap);
8986 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8987 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8988 set->p[0]->div[i][0]);
8989 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8993 bmap = isl_basic_map_simplify(bmap);
8994 bmap = isl_basic_map_finalize(bmap);
8995 return isl_map_from_basic_map(bmap);
8998 isl_basic_map_free(bmap);
9002 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
9010 dim = isl_basic_set_total_dim(bset);
9011 size += bset->n_eq * (1 + dim);
9012 size += bset->n_ineq * (1 + dim);
9013 size += bset->n_div * (2 + dim);
9018 int isl_set_size(__isl_keep isl_set *set)
9026 for (i = 0; i < set->n; ++i)
9027 size += isl_basic_set_size(set->p[i]);
9032 /* Check if there is any lower bound (if lower == 0) and/or upper
9033 * bound (if upper == 0) on the specified dim.
9035 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
9036 enum isl_dim_type type, unsigned pos, int lower, int upper)
9043 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
9045 pos += isl_basic_map_offset(bmap, type);
9047 for (i = 0; i < bmap->n_div; ++i) {
9048 if (isl_int_is_zero(bmap->div[i][0]))
9050 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
9054 for (i = 0; i < bmap->n_eq; ++i)
9055 if (!isl_int_is_zero(bmap->eq[i][pos]))
9058 for (i = 0; i < bmap->n_ineq; ++i) {
9059 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
9066 return lower && upper;
9069 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
9070 enum isl_dim_type type, unsigned pos)
9072 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
9075 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
9076 enum isl_dim_type type, unsigned pos)
9078 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
9081 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
9082 enum isl_dim_type type, unsigned pos)
9084 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
9087 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
9088 enum isl_dim_type type, unsigned pos)
9095 for (i = 0; i < map->n; ++i) {
9097 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
9098 if (bounded < 0 || !bounded)
9105 /* Return 1 if the specified dim is involved in both an upper bound
9106 * and a lower bound.
9108 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
9109 enum isl_dim_type type, unsigned pos)
9111 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
9114 static int has_any_bound(__isl_keep isl_map *map,
9115 enum isl_dim_type type, unsigned pos,
9116 int (*fn)(__isl_keep isl_basic_map *bmap,
9117 enum isl_dim_type type, unsigned pos))
9124 for (i = 0; i < map->n; ++i) {
9126 bounded = fn(map->p[i], type, pos);
9127 if (bounded < 0 || bounded)
9134 /* Return 1 if the specified dim is involved in any lower bound.
9136 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set,
9137 enum isl_dim_type type, unsigned pos)
9139 return has_any_bound(set, type, pos,
9140 &isl_basic_map_dim_has_lower_bound);
9143 /* Return 1 if the specified dim is involved in any upper bound.
9145 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set *set,
9146 enum isl_dim_type type, unsigned pos)
9148 return has_any_bound(set, type, pos,
9149 &isl_basic_map_dim_has_upper_bound);
9152 /* For each of the "n" variables starting at "first", determine
9153 * the sign of the variable and put the results in the first "n"
9154 * elements of the array "signs".
9156 * 1 means that the variable is non-negative
9157 * -1 means that the variable is non-positive
9158 * 0 means the variable attains both positive and negative values.
9160 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
9161 unsigned first, unsigned n, int *signs)
9163 isl_vec *bound = NULL;
9164 struct isl_tab *tab = NULL;
9165 struct isl_tab_undo *snap;
9168 if (!bset || !signs)
9171 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
9172 tab = isl_tab_from_basic_set(bset, 0);
9176 isl_seq_clr(bound->el, bound->size);
9177 isl_int_set_si(bound->el[0], -1);
9179 snap = isl_tab_snap(tab);
9180 for (i = 0; i < n; ++i) {
9183 isl_int_set_si(bound->el[1 + first + i], -1);
9184 if (isl_tab_add_ineq(tab, bound->el) < 0)
9187 isl_int_set_si(bound->el[1 + first + i], 0);
9188 if (isl_tab_rollback(tab, snap) < 0)
9196 isl_int_set_si(bound->el[1 + first + i], 1);
9197 if (isl_tab_add_ineq(tab, bound->el) < 0)
9200 isl_int_set_si(bound->el[1 + first + i], 0);
9201 if (isl_tab_rollback(tab, snap) < 0)
9204 signs[i] = empty ? -1 : 0;
9208 isl_vec_free(bound);
9212 isl_vec_free(bound);
9216 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
9217 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
9219 if (!bset || !signs)
9221 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
9224 first += pos(bset->dim, type) - 1;
9225 return isl_basic_set_vars_get_sign(bset, first, n, signs);
9228 /* Check if the given basic map is obviously single-valued.
9229 * In particular, for each output dimension, check that there is
9230 * an equality that defines the output dimension in terms of
9231 * earlier dimensions.
9233 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
9243 total = 1 + isl_basic_map_total_dim(bmap);
9244 n_out = isl_basic_map_dim(bmap, isl_dim_out);
9245 o_out = isl_basic_map_offset(bmap, isl_dim_out);
9247 for (i = 0; i < n_out; ++i) {
9248 for (j = 0; j < bmap->n_eq; ++j) {
9249 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
9251 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
9252 total - (o_out + i + 1)) == -1)
9255 if (j >= bmap->n_eq)
9262 /* Check if the given basic map is single-valued.
9267 * and check if the result is a subset of the identity mapping.
9269 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap)
9272 isl_basic_map *test;
9276 sv = isl_basic_map_plain_is_single_valued(bmap);
9280 test = isl_basic_map_reverse(isl_basic_map_copy(bmap));
9281 test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap));
9283 space = isl_basic_map_get_space(bmap);
9284 space = isl_space_map_from_set(isl_space_range(space));
9285 id = isl_basic_map_identity(space);
9287 sv = isl_basic_map_is_subset(test, id);
9289 isl_basic_map_free(test);
9290 isl_basic_map_free(id);
9295 /* Check if the given map is obviously single-valued.
9297 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
9306 return isl_basic_map_plain_is_single_valued(map->p[0]);
9309 /* Check if the given map is single-valued.
9314 * and check if the result is a subset of the identity mapping.
9316 int isl_map_is_single_valued(__isl_keep isl_map *map)
9323 sv = isl_map_plain_is_single_valued(map);
9327 test = isl_map_reverse(isl_map_copy(map));
9328 test = isl_map_apply_range(test, isl_map_copy(map));
9330 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
9331 id = isl_map_identity(dim);
9333 sv = isl_map_is_subset(test, id);
9341 int isl_map_is_injective(__isl_keep isl_map *map)
9345 map = isl_map_copy(map);
9346 map = isl_map_reverse(map);
9347 in = isl_map_is_single_valued(map);
9353 /* Check if the given map is obviously injective.
9355 int isl_map_plain_is_injective(__isl_keep isl_map *map)
9359 map = isl_map_copy(map);
9360 map = isl_map_reverse(map);
9361 in = isl_map_plain_is_single_valued(map);
9367 int isl_map_is_bijective(__isl_keep isl_map *map)
9371 sv = isl_map_is_single_valued(map);
9375 return isl_map_is_injective(map);
9378 int isl_set_is_singleton(__isl_keep isl_set *set)
9380 return isl_map_is_single_valued((isl_map *)set);
9383 int isl_map_is_translation(__isl_keep isl_map *map)
9388 delta = isl_map_deltas(isl_map_copy(map));
9389 ok = isl_set_is_singleton(delta);
9390 isl_set_free(delta);
9395 static int unique(isl_int *p, unsigned pos, unsigned len)
9397 if (isl_seq_first_non_zero(p, pos) != -1)
9399 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
9404 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
9413 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
9416 nvar = isl_basic_set_dim(bset, isl_dim_set);
9417 ovar = isl_space_offset(bset->dim, isl_dim_set);
9418 for (j = 0; j < nvar; ++j) {
9419 int lower = 0, upper = 0;
9420 for (i = 0; i < bset->n_eq; ++i) {
9421 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
9423 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
9429 for (i = 0; i < bset->n_ineq; ++i) {
9430 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
9432 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
9434 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
9439 if (!lower || !upper)
9446 int isl_set_is_box(__isl_keep isl_set *set)
9453 return isl_basic_set_is_box(set->p[0]);
9456 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
9461 return isl_space_is_wrapping(bset->dim);
9464 int isl_set_is_wrapping(__isl_keep isl_set *set)
9469 return isl_space_is_wrapping(set->dim);
9472 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9474 bmap = isl_basic_map_cow(bmap);
9478 bmap->dim = isl_space_wrap(bmap->dim);
9482 bmap = isl_basic_map_finalize(bmap);
9484 return (isl_basic_set *)bmap;
9486 isl_basic_map_free(bmap);
9490 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9494 map = isl_map_cow(map);
9498 for (i = 0; i < map->n; ++i) {
9499 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9503 map->dim = isl_space_wrap(map->dim);
9507 return (isl_set *)map;
9513 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9515 bset = isl_basic_set_cow(bset);
9519 bset->dim = isl_space_unwrap(bset->dim);
9523 bset = isl_basic_set_finalize(bset);
9525 return (isl_basic_map *)bset;
9527 isl_basic_set_free(bset);
9531 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9538 if (!isl_set_is_wrapping(set))
9539 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9542 set = isl_set_cow(set);
9546 for (i = 0; i < set->n; ++i) {
9547 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9552 set->dim = isl_space_unwrap(set->dim);
9556 return (isl_map *)set;
9562 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9563 enum isl_dim_type type)
9568 if (!isl_space_is_named_or_nested(bmap->dim, type))
9571 bmap = isl_basic_map_cow(bmap);
9575 bmap->dim = isl_space_reset(bmap->dim, type);
9579 bmap = isl_basic_map_finalize(bmap);
9583 isl_basic_map_free(bmap);
9587 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9588 enum isl_dim_type type)
9595 if (!isl_space_is_named_or_nested(map->dim, type))
9598 map = isl_map_cow(map);
9602 for (i = 0; i < map->n; ++i) {
9603 map->p[i] = isl_basic_map_reset(map->p[i], type);
9607 map->dim = isl_space_reset(map->dim, type);
9617 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9622 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9625 bmap = isl_basic_map_cow(bmap);
9629 bmap->dim = isl_space_flatten(bmap->dim);
9633 bmap = isl_basic_map_finalize(bmap);
9637 isl_basic_map_free(bmap);
9641 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9643 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9646 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9647 __isl_take isl_basic_map *bmap)
9652 if (!bmap->dim->nested[0])
9655 bmap = isl_basic_map_cow(bmap);
9659 bmap->dim = isl_space_flatten_domain(bmap->dim);
9663 bmap = isl_basic_map_finalize(bmap);
9667 isl_basic_map_free(bmap);
9671 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9672 __isl_take isl_basic_map *bmap)
9677 if (!bmap->dim->nested[1])
9680 bmap = isl_basic_map_cow(bmap);
9684 bmap->dim = isl_space_flatten_range(bmap->dim);
9688 bmap = isl_basic_map_finalize(bmap);
9692 isl_basic_map_free(bmap);
9696 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9703 if (!map->dim->nested[0] && !map->dim->nested[1])
9706 map = isl_map_cow(map);
9710 for (i = 0; i < map->n; ++i) {
9711 map->p[i] = isl_basic_map_flatten(map->p[i]);
9715 map->dim = isl_space_flatten(map->dim);
9725 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9727 return (isl_set *)isl_map_flatten((isl_map *)set);
9730 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9732 isl_space *dim, *flat_dim;
9735 dim = isl_set_get_space(set);
9736 flat_dim = isl_space_flatten(isl_space_copy(dim));
9737 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9738 map = isl_map_intersect_domain(map, set);
9743 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9750 if (!map->dim->nested[0])
9753 map = isl_map_cow(map);
9757 for (i = 0; i < map->n; ++i) {
9758 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9762 map->dim = isl_space_flatten_domain(map->dim);
9772 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9779 if (!map->dim->nested[1])
9782 map = isl_map_cow(map);
9786 for (i = 0; i < map->n; ++i) {
9787 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9791 map->dim = isl_space_flatten_range(map->dim);
9801 /* Reorder the dimensions of "bmap" according to the given dim_map
9802 * and set the dimension specification to "dim".
9804 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9805 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9810 bmap = isl_basic_map_cow(bmap);
9811 if (!bmap || !dim || !dim_map)
9814 flags = bmap->flags;
9815 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9816 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9817 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9818 res = isl_basic_map_alloc_space(dim,
9819 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9820 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9823 res = isl_basic_map_finalize(res);
9827 isl_basic_map_free(bmap);
9828 isl_space_free(dim);
9832 /* Reorder the dimensions of "map" according to given reordering.
9834 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9835 __isl_take isl_reordering *r)
9838 struct isl_dim_map *dim_map;
9840 map = isl_map_cow(map);
9841 dim_map = isl_dim_map_from_reordering(r);
9842 if (!map || !r || !dim_map)
9845 for (i = 0; i < map->n; ++i) {
9846 struct isl_dim_map *dim_map_i;
9848 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9850 map->p[i] = isl_basic_map_realign(map->p[i],
9851 isl_space_copy(r->dim), dim_map_i);
9857 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9859 isl_reordering_free(r);
9865 isl_reordering_free(r);
9869 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9870 __isl_take isl_reordering *r)
9872 return (isl_set *)isl_map_realign((isl_map *)set, r);
9875 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9876 __isl_take isl_space *model)
9883 ctx = isl_space_get_ctx(model);
9884 if (!isl_space_has_named_params(model))
9885 isl_die(ctx, isl_error_invalid,
9886 "model has unnamed parameters", goto error);
9887 if (!isl_space_has_named_params(map->dim))
9888 isl_die(ctx, isl_error_invalid,
9889 "relation has unnamed parameters", goto error);
9890 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9891 isl_reordering *exp;
9893 model = isl_space_drop_dims(model, isl_dim_in,
9894 0, isl_space_dim(model, isl_dim_in));
9895 model = isl_space_drop_dims(model, isl_dim_out,
9896 0, isl_space_dim(model, isl_dim_out));
9897 exp = isl_parameter_alignment_reordering(map->dim, model);
9898 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9899 map = isl_map_realign(map, exp);
9902 isl_space_free(model);
9905 isl_space_free(model);
9910 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9911 __isl_take isl_space *model)
9913 return isl_map_align_params(set, model);
9916 /* Align the parameters of "bmap" to those of "model", introducing
9917 * additional parameters if needed.
9919 __isl_give isl_basic_map *isl_basic_map_align_params(
9920 __isl_take isl_basic_map *bmap, __isl_take isl_space *model)
9924 if (!bmap || !model)
9927 ctx = isl_space_get_ctx(model);
9928 if (!isl_space_has_named_params(model))
9929 isl_die(ctx, isl_error_invalid,
9930 "model has unnamed parameters", goto error);
9931 if (!isl_space_has_named_params(bmap->dim))
9932 isl_die(ctx, isl_error_invalid,
9933 "relation has unnamed parameters", goto error);
9934 if (!isl_space_match(bmap->dim, isl_dim_param, model, isl_dim_param)) {
9935 isl_reordering *exp;
9936 struct isl_dim_map *dim_map;
9938 model = isl_space_drop_dims(model, isl_dim_in,
9939 0, isl_space_dim(model, isl_dim_in));
9940 model = isl_space_drop_dims(model, isl_dim_out,
9941 0, isl_space_dim(model, isl_dim_out));
9942 exp = isl_parameter_alignment_reordering(bmap->dim, model);
9943 exp = isl_reordering_extend_space(exp,
9944 isl_basic_map_get_space(bmap));
9945 dim_map = isl_dim_map_from_reordering(exp);
9946 bmap = isl_basic_map_realign(bmap,
9947 exp ? isl_space_copy(exp->dim) : NULL,
9948 isl_dim_map_extend(dim_map, bmap));
9949 isl_reordering_free(exp);
9953 isl_space_free(model);
9956 isl_space_free(model);
9957 isl_basic_map_free(bmap);
9961 /* Align the parameters of "bset" to those of "model", introducing
9962 * additional parameters if needed.
9964 __isl_give isl_basic_set *isl_basic_set_align_params(
9965 __isl_take isl_basic_set *bset, __isl_take isl_space *model)
9967 return isl_basic_map_align_params(bset, model);
9970 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9971 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9972 enum isl_dim_type c2, enum isl_dim_type c3,
9973 enum isl_dim_type c4, enum isl_dim_type c5)
9975 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9976 struct isl_mat *mat;
9982 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9983 isl_basic_map_total_dim(bmap) + 1);
9986 for (i = 0; i < bmap->n_eq; ++i)
9987 for (j = 0, pos = 0; j < 5; ++j) {
9988 int off = isl_basic_map_offset(bmap, c[j]);
9989 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9990 isl_int_set(mat->row[i][pos],
9991 bmap->eq[i][off + k]);
9999 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
10000 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
10001 enum isl_dim_type c2, enum isl_dim_type c3,
10002 enum isl_dim_type c4, enum isl_dim_type c5)
10004 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
10005 struct isl_mat *mat;
10011 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
10012 isl_basic_map_total_dim(bmap) + 1);
10015 for (i = 0; i < bmap->n_ineq; ++i)
10016 for (j = 0, pos = 0; j < 5; ++j) {
10017 int off = isl_basic_map_offset(bmap, c[j]);
10018 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10019 isl_int_set(mat->row[i][pos],
10020 bmap->ineq[i][off + k]);
10028 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
10029 __isl_take isl_space *dim,
10030 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
10031 enum isl_dim_type c2, enum isl_dim_type c3,
10032 enum isl_dim_type c4, enum isl_dim_type c5)
10034 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
10035 isl_basic_map *bmap;
10041 if (!dim || !eq || !ineq)
10044 if (eq->n_col != ineq->n_col)
10045 isl_die(dim->ctx, isl_error_invalid,
10046 "equalities and inequalities matrices should have "
10047 "same number of columns", goto error);
10049 total = 1 + isl_space_dim(dim, isl_dim_all);
10051 if (eq->n_col < total)
10052 isl_die(dim->ctx, isl_error_invalid,
10053 "number of columns too small", goto error);
10055 extra = eq->n_col - total;
10057 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
10058 eq->n_row, ineq->n_row);
10061 for (i = 0; i < extra; ++i) {
10062 k = isl_basic_map_alloc_div(bmap);
10065 isl_int_set_si(bmap->div[k][0], 0);
10067 for (i = 0; i < eq->n_row; ++i) {
10068 l = isl_basic_map_alloc_equality(bmap);
10071 for (j = 0, pos = 0; j < 5; ++j) {
10072 int off = isl_basic_map_offset(bmap, c[j]);
10073 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10074 isl_int_set(bmap->eq[l][off + k],
10080 for (i = 0; i < ineq->n_row; ++i) {
10081 l = isl_basic_map_alloc_inequality(bmap);
10084 for (j = 0, pos = 0; j < 5; ++j) {
10085 int off = isl_basic_map_offset(bmap, c[j]);
10086 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10087 isl_int_set(bmap->ineq[l][off + k],
10088 ineq->row[i][pos]);
10094 isl_space_free(dim);
10096 isl_mat_free(ineq);
10100 isl_space_free(dim);
10102 isl_mat_free(ineq);
10106 __isl_give isl_mat *isl_basic_set_equalities_matrix(
10107 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10108 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10110 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
10111 c1, c2, c3, c4, isl_dim_in);
10114 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
10115 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10116 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10118 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
10119 c1, c2, c3, c4, isl_dim_in);
10122 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
10123 __isl_take isl_space *dim,
10124 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
10125 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10127 return (isl_basic_set*)
10128 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
10129 c1, c2, c3, c4, isl_dim_in);
10132 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
10137 return isl_space_can_zip(bmap->dim);
10140 int isl_map_can_zip(__isl_keep isl_map *map)
10145 return isl_space_can_zip(map->dim);
10148 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10149 * (A -> C) -> (B -> D).
10151 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
10160 if (!isl_basic_map_can_zip(bmap))
10161 isl_die(bmap->ctx, isl_error_invalid,
10162 "basic map cannot be zipped", goto error);
10163 pos = isl_basic_map_offset(bmap, isl_dim_in) +
10164 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
10165 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
10166 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
10167 bmap = isl_basic_map_cow(bmap);
10168 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
10171 bmap->dim = isl_space_zip(bmap->dim);
10176 isl_basic_map_free(bmap);
10180 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10181 * (A -> C) -> (B -> D).
10183 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
10190 if (!isl_map_can_zip(map))
10191 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
10194 map = isl_map_cow(map);
10198 for (i = 0; i < map->n; ++i) {
10199 map->p[i] = isl_basic_map_zip(map->p[i]);
10204 map->dim = isl_space_zip(map->dim);
10214 /* Can we apply isl_basic_map_curry to "bmap"?
10215 * That is, does it have a nested relation in its domain?
10217 int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap)
10222 return isl_space_can_curry(bmap->dim);
10225 /* Can we apply isl_map_curry to "map"?
10226 * That is, does it have a nested relation in its domain?
10228 int isl_map_can_curry(__isl_keep isl_map *map)
10233 return isl_space_can_curry(map->dim);
10236 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10239 __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap)
10245 if (!isl_basic_map_can_curry(bmap))
10246 isl_die(bmap->ctx, isl_error_invalid,
10247 "basic map cannot be curried", goto error);
10248 bmap->dim = isl_space_curry(bmap->dim);
10253 isl_basic_map_free(bmap);
10257 /* Given a map (A -> B) -> C, return the corresponding map
10260 __isl_give isl_map *isl_map_curry(__isl_take isl_map *map)
10267 if (!isl_map_can_curry(map))
10268 isl_die(map->ctx, isl_error_invalid, "map cannot be curried",
10271 map = isl_map_cow(map);
10275 for (i = 0; i < map->n; ++i) {
10276 map->p[i] = isl_basic_map_curry(map->p[i]);
10281 map->dim = isl_space_curry(map->dim);
10291 /* Can we apply isl_basic_map_uncurry to "bmap"?
10292 * That is, does it have a nested relation in its domain?
10294 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map *bmap)
10299 return isl_space_can_uncurry(bmap->dim);
10302 /* Can we apply isl_map_uncurry to "map"?
10303 * That is, does it have a nested relation in its domain?
10305 int isl_map_can_uncurry(__isl_keep isl_map *map)
10310 return isl_space_can_uncurry(map->dim);
10313 /* Given a basic map A -> (B -> C), return the corresponding basic map
10316 __isl_give isl_basic_map *isl_basic_map_uncurry(__isl_take isl_basic_map *bmap)
10322 if (!isl_basic_map_can_uncurry(bmap))
10323 isl_die(bmap->ctx, isl_error_invalid,
10324 "basic map cannot be uncurried",
10325 return isl_basic_map_free(bmap));
10326 bmap->dim = isl_space_uncurry(bmap->dim);
10328 return isl_basic_map_free(bmap);
10332 /* Given a map A -> (B -> C), return the corresponding map
10335 __isl_give isl_map *isl_map_uncurry(__isl_take isl_map *map)
10342 if (!isl_map_can_uncurry(map))
10343 isl_die(map->ctx, isl_error_invalid, "map cannot be uncurried",
10344 return isl_map_free(map));
10346 map = isl_map_cow(map);
10350 for (i = 0; i < map->n; ++i) {
10351 map->p[i] = isl_basic_map_uncurry(map->p[i]);
10353 return isl_map_free(map);
10356 map->dim = isl_space_uncurry(map->dim);
10358 return isl_map_free(map);
10363 /* Construct a basic map mapping the domain of the affine expression
10364 * to a one-dimensional range prescribed by the affine expression.
10366 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
10370 isl_local_space *ls;
10371 isl_basic_map *bmap;
10376 ls = isl_aff_get_local_space(aff);
10377 bmap = isl_basic_map_from_local_space(ls);
10378 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
10379 k = isl_basic_map_alloc_equality(bmap);
10383 pos = isl_basic_map_offset(bmap, isl_dim_out);
10384 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
10385 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
10386 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
10387 aff->v->size - (pos + 1));
10390 bmap = isl_basic_map_finalize(bmap);
10394 isl_basic_map_free(bmap);
10398 /* Construct a map mapping the domain of the affine expression
10399 * to a one-dimensional range prescribed by the affine expression.
10401 __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff)
10403 isl_basic_map *bmap;
10405 bmap = isl_basic_map_from_aff(aff);
10406 return isl_map_from_basic_map(bmap);
10409 /* Construct a basic map mapping the domain the multi-affine expression
10410 * to its range, with each dimension in the range equated to the
10411 * corresponding affine expression.
10413 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
10414 __isl_take isl_multi_aff *maff)
10418 isl_basic_map *bmap;
10423 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
10424 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
10425 "invalid space", return isl_multi_aff_free(maff));
10427 space = isl_space_domain(isl_multi_aff_get_space(maff));
10428 bmap = isl_basic_map_universe(isl_space_from_domain(space));
10430 for (i = 0; i < maff->n; ++i) {
10432 isl_basic_map *bmap_i;
10434 aff = isl_aff_copy(maff->p[i]);
10435 bmap_i = isl_basic_map_from_aff(aff);
10437 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10440 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
10442 isl_multi_aff_free(maff);
10446 /* Construct a map mapping the domain the multi-affine expression
10447 * to its range, with each dimension in the range equated to the
10448 * corresponding affine expression.
10450 __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff)
10452 isl_basic_map *bmap;
10454 bmap = isl_basic_map_from_multi_aff(maff);
10455 return isl_map_from_basic_map(bmap);
10458 /* Construct a basic map mapping a domain in the given space to
10459 * to an n-dimensional range, with n the number of elements in the list,
10460 * where each coordinate in the range is prescribed by the
10461 * corresponding affine expression.
10462 * The domains of all affine expressions in the list are assumed to match
10465 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
10466 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
10470 isl_basic_map *bmap;
10475 dim = isl_space_from_domain(domain_dim);
10476 bmap = isl_basic_map_universe(dim);
10478 for (i = 0; i < list->n; ++i) {
10480 isl_basic_map *bmap_i;
10482 aff = isl_aff_copy(list->p[i]);
10483 bmap_i = isl_basic_map_from_aff(aff);
10485 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10488 isl_aff_list_free(list);
10492 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
10493 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10495 return isl_map_equate(set, type1, pos1, type2, pos2);
10498 /* Construct a basic map where the given dimensions are equal to each other.
10500 static __isl_give isl_basic_map *equator(__isl_take isl_space *space,
10501 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10503 isl_basic_map *bmap = NULL;
10509 if (pos1 >= isl_space_dim(space, type1))
10510 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10511 "index out of bounds", goto error);
10512 if (pos2 >= isl_space_dim(space, type2))
10513 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10514 "index out of bounds", goto error);
10516 if (type1 == type2 && pos1 == pos2)
10517 return isl_basic_map_universe(space);
10519 bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0);
10520 i = isl_basic_map_alloc_equality(bmap);
10523 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10524 pos1 += isl_basic_map_offset(bmap, type1);
10525 pos2 += isl_basic_map_offset(bmap, type2);
10526 isl_int_set_si(bmap->eq[i][pos1], -1);
10527 isl_int_set_si(bmap->eq[i][pos2], 1);
10528 bmap = isl_basic_map_finalize(bmap);
10529 isl_space_free(space);
10532 isl_space_free(space);
10533 isl_basic_map_free(bmap);
10537 /* Add a constraint imposing that the given two dimensions are equal.
10539 __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap,
10540 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10544 eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
10546 bmap = isl_basic_map_intersect(bmap, eq);
10551 /* Add a constraint imposing that the given two dimensions are equal.
10553 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
10554 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10556 isl_basic_map *bmap;
10558 bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2);
10560 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10565 /* Add a constraint imposing that the given two dimensions have opposite values.
10567 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
10568 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10570 isl_basic_map *bmap = NULL;
10576 if (pos1 >= isl_map_dim(map, type1))
10577 isl_die(map->ctx, isl_error_invalid,
10578 "index out of bounds", goto error);
10579 if (pos2 >= isl_map_dim(map, type2))
10580 isl_die(map->ctx, isl_error_invalid,
10581 "index out of bounds", goto error);
10583 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
10584 i = isl_basic_map_alloc_equality(bmap);
10587 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10588 pos1 += isl_basic_map_offset(bmap, type1);
10589 pos2 += isl_basic_map_offset(bmap, type2);
10590 isl_int_set_si(bmap->eq[i][pos1], 1);
10591 isl_int_set_si(bmap->eq[i][pos2], 1);
10592 bmap = isl_basic_map_finalize(bmap);
10594 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10598 isl_basic_map_free(bmap);
10603 /* Add a constraint imposing that the value of the first dimension is
10604 * greater than or equal to that of the second.
10606 __isl_give isl_basic_map *isl_basic_map_order_ge(__isl_take isl_basic_map *bmap,
10607 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10610 isl_local_space *ls;
10615 if (pos1 >= isl_basic_map_dim(bmap, type1))
10616 isl_die(bmap->ctx, isl_error_invalid,
10617 "index out of bounds", return isl_basic_map_free(bmap));
10618 if (pos2 >= isl_basic_map_dim(bmap, type2))
10619 isl_die(bmap->ctx, isl_error_invalid,
10620 "index out of bounds", return isl_basic_map_free(bmap));
10622 if (type1 == type2 && pos1 == pos2)
10625 ls = isl_local_space_from_space(isl_basic_map_get_space(bmap));
10626 c = isl_inequality_alloc(ls);
10627 c = isl_constraint_set_coefficient_si(c, type1, pos1, 1);
10628 c = isl_constraint_set_coefficient_si(c, type2, pos2, -1);
10629 bmap = isl_basic_map_add_constraint(bmap, c);
10634 /* Add a constraint imposing that the value of the first dimension is
10635 * greater than that of the second.
10637 __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map,
10638 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10640 isl_basic_map *bmap = NULL;
10646 if (pos1 >= isl_map_dim(map, type1))
10647 isl_die(map->ctx, isl_error_invalid,
10648 "index out of bounds", goto error);
10649 if (pos2 >= isl_map_dim(map, type2))
10650 isl_die(map->ctx, isl_error_invalid,
10651 "index out of bounds", goto error);
10653 if (type1 == type2 && pos1 == pos2) {
10654 isl_space *space = isl_map_get_space(map);
10656 return isl_map_empty(space);
10659 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 0, 1);
10660 i = isl_basic_map_alloc_inequality(bmap);
10663 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
10664 pos1 += isl_basic_map_offset(bmap, type1);
10665 pos2 += isl_basic_map_offset(bmap, type2);
10666 isl_int_set_si(bmap->ineq[i][pos1], 1);
10667 isl_int_set_si(bmap->ineq[i][pos2], -1);
10668 isl_int_set_si(bmap->ineq[i][0], -1);
10669 bmap = isl_basic_map_finalize(bmap);
10671 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10675 isl_basic_map_free(bmap);
10680 /* Add a constraint imposing that the value of the first dimension is
10681 * smaller than that of the second.
10683 __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map,
10684 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10686 return isl_map_order_gt(map, type2, pos2, type1, pos1);
10689 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
10693 isl_local_space *ls;
10698 if (!isl_basic_map_divs_known(bmap))
10699 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
10700 "some divs are unknown", return NULL);
10702 ls = isl_basic_map_get_local_space(bmap);
10703 div = isl_local_space_get_div(ls, pos);
10704 isl_local_space_free(ls);
10709 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
10712 return isl_basic_map_get_div(bset, pos);
10715 /* Plug in "subs" for dimension "type", "pos" of "bset".
10717 * Let i be the dimension to replace and let "subs" be of the form
10721 * Any integer division with a non-zero coefficient for i,
10723 * floor((a i + g)/m)
10727 * floor((a f + d g)/(m d))
10729 * Constraints of the form
10737 __isl_give isl_basic_set *isl_basic_set_substitute(
10738 __isl_take isl_basic_set *bset,
10739 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10745 if (bset && isl_basic_set_plain_is_empty(bset))
10748 bset = isl_basic_set_cow(bset);
10749 if (!bset || !subs)
10752 ctx = isl_basic_set_get_ctx(bset);
10753 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
10754 isl_die(ctx, isl_error_invalid,
10755 "spaces don't match", goto error);
10756 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
10757 isl_die(ctx, isl_error_unsupported,
10758 "cannot handle divs yet", goto error);
10760 pos += isl_basic_set_offset(bset, type);
10764 for (i = 0; i < bset->n_eq; ++i) {
10765 if (isl_int_is_zero(bset->eq[i][pos]))
10767 isl_int_set(v, bset->eq[i][pos]);
10768 isl_int_set_si(bset->eq[i][pos], 0);
10769 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
10770 v, subs->v->el + 1, subs->v->size - 1);
10773 for (i = 0; i < bset->n_ineq; ++i) {
10774 if (isl_int_is_zero(bset->ineq[i][pos]))
10776 isl_int_set(v, bset->ineq[i][pos]);
10777 isl_int_set_si(bset->ineq[i][pos], 0);
10778 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
10779 v, subs->v->el + 1, subs->v->size - 1);
10782 for (i = 0; i < bset->n_div; ++i) {
10783 if (isl_int_is_zero(bset->div[i][1 + pos]))
10785 isl_int_set(v, bset->div[i][1 + pos]);
10786 isl_int_set_si(bset->div[i][1 + pos], 0);
10787 isl_seq_combine(bset->div[i] + 1,
10788 subs->v->el[0], bset->div[i] + 1,
10789 v, subs->v->el + 1, subs->v->size - 1);
10790 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
10795 bset = isl_basic_set_simplify(bset);
10796 return isl_basic_set_finalize(bset);
10798 isl_basic_set_free(bset);
10802 /* Plug in "subs" for dimension "type", "pos" of "set".
10804 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
10805 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10809 if (set && isl_set_plain_is_empty(set))
10812 set = isl_set_cow(set);
10816 for (i = set->n - 1; i >= 0; --i) {
10817 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10818 if (remove_if_empty(set, i) < 0)