2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
14 #include <isl_ctx_private.h>
15 #include <isl_map_private.h>
17 #include "isl_space_private.h"
18 #include "isl_equalities.h"
19 #include <isl_list_private.h>
24 #include "isl_map_piplib.h"
25 #include <isl_reordering.h>
26 #include "isl_sample.h"
29 #include <isl_mat_private.h>
30 #include <isl_dim_map.h>
31 #include <isl_local_space_private.h>
32 #include <isl_aff_private.h>
33 #include <isl_options_private.h>
35 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
38 case isl_dim_param
: return dim
->nparam
;
39 case isl_dim_in
: return dim
->n_in
;
40 case isl_dim_out
: return dim
->n_out
;
41 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
46 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
49 case isl_dim_param
: return 1;
50 case isl_dim_in
: return 1 + dim
->nparam
;
51 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
56 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
57 enum isl_dim_type type
)
62 case isl_dim_cst
: return 1;
65 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
66 case isl_dim_div
: return bmap
->n_div
;
67 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
72 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
74 return map
? n(map
->dim
, type
) : 0;
77 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
79 return set
? n(set
->dim
, type
) : 0;
82 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
83 enum isl_dim_type type
)
85 isl_space
*dim
= bmap
->dim
;
87 case isl_dim_cst
: return 0;
88 case isl_dim_param
: return 1;
89 case isl_dim_in
: return 1 + dim
->nparam
;
90 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
91 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
96 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
97 enum isl_dim_type type
)
99 return isl_basic_map_offset(bset
, type
);
102 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
104 return pos(map
->dim
, type
);
107 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
108 enum isl_dim_type type
)
110 return isl_basic_map_dim(bset
, type
);
113 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
115 return isl_basic_set_dim(bset
, isl_dim_set
);
118 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
120 return isl_basic_set_dim(bset
, isl_dim_param
);
123 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
127 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
130 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
132 return isl_set_dim(set
, isl_dim_set
);
135 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
137 return isl_set_dim(set
, isl_dim_param
);
140 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
142 return bmap
? bmap
->dim
->n_in
: 0;
145 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
147 return bmap
? bmap
->dim
->n_out
: 0;
150 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
152 return bmap
? bmap
->dim
->nparam
: 0;
155 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
157 return bmap
? bmap
->n_div
: 0;
160 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
162 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
165 unsigned isl_map_n_in(const struct isl_map
*map
)
167 return map
? map
->dim
->n_in
: 0;
170 unsigned isl_map_n_out(const struct isl_map
*map
)
172 return map
? map
->dim
->n_out
: 0;
175 unsigned isl_map_n_param(const struct isl_map
*map
)
177 return map
? map
->dim
->nparam
: 0;
180 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
185 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
188 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
191 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
192 struct isl_basic_set
*bset
)
197 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
200 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
203 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
208 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
211 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
214 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
215 struct isl_basic_set
*bset
)
220 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
223 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
226 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
228 return bmap
? bmap
->ctx
: NULL
;
231 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
233 return bset
? bset
->ctx
: NULL
;
236 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
238 return map
? map
->ctx
: NULL
;
241 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
243 return set
? set
->ctx
: NULL
;
246 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
250 return isl_space_copy(bmap
->dim
);
253 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
257 return isl_space_copy(bset
->dim
);
260 /* Extract the divs in "bmap" as a matrix.
262 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
273 ctx
= isl_basic_map_get_ctx(bmap
);
274 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
275 cols
= 1 + 1 + total
+ bmap
->n_div
;
276 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
280 for (i
= 0; i
< bmap
->n_div
; ++i
)
281 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
286 __isl_give isl_local_space
*isl_basic_map_get_local_space(
287 __isl_keep isl_basic_map
*bmap
)
294 div
= isl_basic_map_get_divs(bmap
);
295 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
298 __isl_give isl_local_space
*isl_basic_set_get_local_space(
299 __isl_keep isl_basic_set
*bset
)
301 return isl_basic_map_get_local_space(bset
);
304 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
305 __isl_take isl_local_space
*ls
)
314 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
315 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
316 n_div
, 0, 2 * n_div
);
318 for (i
= 0; i
< n_div
; ++i
)
319 if (isl_basic_map_alloc_div(bmap
) < 0)
322 for (i
= 0; i
< n_div
; ++i
) {
323 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
324 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
328 isl_local_space_free(ls
);
331 isl_local_space_free(ls
);
332 isl_basic_map_free(bmap
);
336 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
337 __isl_take isl_local_space
*ls
)
339 return isl_basic_map_from_local_space(ls
);
342 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
346 return isl_space_copy(map
->dim
);
349 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
353 return isl_space_copy(set
->dim
);
356 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
357 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
359 bmap
= isl_basic_map_cow(bmap
);
362 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
365 bmap
= isl_basic_map_finalize(bmap
);
368 isl_basic_map_free(bmap
);
372 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
373 __isl_take isl_basic_set
*bset
, const char *s
)
375 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
378 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
379 enum isl_dim_type type
)
381 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
384 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
385 enum isl_dim_type type
, const char *s
)
389 map
= isl_map_cow(map
);
393 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
397 for (i
= 0; i
< map
->n
; ++i
) {
398 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
409 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
410 enum isl_dim_type type
)
412 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
415 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
418 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
421 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
422 enum isl_dim_type type
, __isl_take isl_id
*id
)
424 map
= isl_map_cow(map
);
426 return isl_id_free(id
);
428 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
430 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
433 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
434 __isl_take isl_id
*id
)
436 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
439 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
440 enum isl_dim_type type
)
442 map
= isl_map_cow(map
);
446 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
448 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
451 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
453 return isl_map_reset_tuple_id(set
, isl_dim_set
);
456 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
458 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
461 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
462 enum isl_dim_type type
)
464 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
467 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
469 return isl_map_has_tuple_id(set
, isl_dim_set
);
472 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
474 return isl_map_get_tuple_id(set
, isl_dim_set
);
477 /* Does the set tuple have a name?
479 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
481 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
485 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
487 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
490 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
492 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
495 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
496 enum isl_dim_type type
, unsigned pos
)
498 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
501 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
502 enum isl_dim_type type
, unsigned pos
)
504 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
507 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
508 enum isl_dim_type type
, unsigned pos
)
510 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
513 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
514 enum isl_dim_type type
, unsigned pos
)
516 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
519 /* Does the given dimension have a name?
521 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
522 enum isl_dim_type type
, unsigned pos
)
524 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
527 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
528 __isl_take isl_basic_map
*bmap
,
529 enum isl_dim_type type
, unsigned pos
, const char *s
)
531 bmap
= isl_basic_map_cow(bmap
);
534 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
539 isl_basic_map_free(bmap
);
543 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
544 enum isl_dim_type type
, unsigned pos
, const char *s
)
548 map
= isl_map_cow(map
);
552 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
556 for (i
= 0; i
< map
->n
; ++i
) {
557 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
568 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
569 __isl_take isl_basic_set
*bset
,
570 enum isl_dim_type type
, unsigned pos
, const char *s
)
572 return (isl_basic_set
*)isl_basic_map_set_dim_name(
573 (isl_basic_map
*)bset
, type
, pos
, s
);
576 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
577 enum isl_dim_type type
, unsigned pos
, const char *s
)
579 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
582 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
583 enum isl_dim_type type
, unsigned pos
)
585 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
588 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
589 enum isl_dim_type type
, unsigned pos
)
591 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
594 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
595 enum isl_dim_type type
, unsigned pos
)
597 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
600 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
601 enum isl_dim_type type
, unsigned pos
)
603 return isl_map_has_dim_id(set
, type
, pos
);
606 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
607 enum isl_dim_type type
, unsigned pos
)
609 return isl_map_get_dim_id(set
, type
, pos
);
612 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
613 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
615 map
= isl_map_cow(map
);
617 return isl_id_free(id
);
619 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
621 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
624 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
625 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
627 return isl_map_set_dim_id(set
, type
, pos
, id
);
630 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
631 __isl_keep isl_id
*id
)
635 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
638 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
639 __isl_keep isl_id
*id
)
641 return isl_map_find_dim_by_id(set
, type
, id
);
644 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
649 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
652 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
655 return isl_map_find_dim_by_name(set
, type
, name
);
658 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
662 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
665 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
667 return isl_basic_map_is_rational(bset
);
670 /* Is this basic set a parameter domain?
672 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
676 return isl_space_is_params(bset
->dim
);
679 /* Is this set a parameter domain?
681 int isl_set_is_params(__isl_keep isl_set
*set
)
685 return isl_space_is_params(set
->dim
);
688 /* Is this map actually a parameter domain?
689 * Users should never call this function. Outside of isl,
690 * a map can never be a parameter domain.
692 int isl_map_is_params(__isl_keep isl_map
*map
)
696 return isl_space_is_params(map
->dim
);
699 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
700 struct isl_basic_map
*bmap
, unsigned extra
,
701 unsigned n_eq
, unsigned n_ineq
)
704 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
709 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
710 if (isl_blk_is_error(bmap
->block
))
713 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
718 bmap
->block2
= isl_blk_empty();
721 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
722 if (isl_blk_is_error(bmap
->block2
))
725 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
730 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
731 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
733 for (i
= 0; i
< extra
; ++i
)
734 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
738 bmap
->c_size
= n_eq
+ n_ineq
;
739 bmap
->eq
= bmap
->ineq
+ n_ineq
;
748 isl_basic_map_free(bmap
);
752 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
753 unsigned nparam
, unsigned dim
, unsigned extra
,
754 unsigned n_eq
, unsigned n_ineq
)
756 struct isl_basic_map
*bmap
;
759 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
763 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
764 return (struct isl_basic_set
*)bmap
;
767 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
768 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
770 struct isl_basic_map
*bmap
;
773 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
774 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
775 return (struct isl_basic_set
*)bmap
;
781 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
782 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
784 struct isl_basic_map
*bmap
;
788 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
793 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
799 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
800 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
801 unsigned n_eq
, unsigned n_ineq
)
803 struct isl_basic_map
*bmap
;
806 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
810 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
814 static void dup_constraints(
815 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
818 unsigned total
= isl_basic_map_total_dim(src
);
820 for (i
= 0; i
< src
->n_eq
; ++i
) {
821 int j
= isl_basic_map_alloc_equality(dst
);
822 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
825 for (i
= 0; i
< src
->n_ineq
; ++i
) {
826 int j
= isl_basic_map_alloc_inequality(dst
);
827 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
830 for (i
= 0; i
< src
->n_div
; ++i
) {
831 int j
= isl_basic_map_alloc_div(dst
);
832 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
834 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
837 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
839 struct isl_basic_map
*dup
;
843 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
844 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
847 dup_constraints(dup
, bmap
);
848 dup
->flags
= bmap
->flags
;
849 dup
->sample
= isl_vec_copy(bmap
->sample
);
853 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
855 struct isl_basic_map
*dup
;
857 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
858 return (struct isl_basic_set
*)dup
;
861 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
866 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
870 return isl_basic_set_dup(bset
);
873 struct isl_set
*isl_set_copy(struct isl_set
*set
)
882 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
887 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
891 bmap
= isl_basic_map_dup(bmap
);
893 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
897 struct isl_map
*isl_map_copy(struct isl_map
*map
)
906 void isl_basic_map_free(struct isl_basic_map
*bmap
)
914 isl_ctx_deref(bmap
->ctx
);
916 isl_blk_free(bmap
->ctx
, bmap
->block2
);
918 isl_blk_free(bmap
->ctx
, bmap
->block
);
919 isl_vec_free(bmap
->sample
);
920 isl_space_free(bmap
->dim
);
924 void isl_basic_set_free(struct isl_basic_set
*bset
)
926 isl_basic_map_free((struct isl_basic_map
*)bset
);
929 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
931 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
934 __isl_give isl_map
*isl_map_align_params_map_map_and(
935 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
936 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
937 __isl_take isl_map
*map2
))
941 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
942 return fn(map1
, map2
);
943 if (!isl_space_has_named_params(map1
->dim
) ||
944 !isl_space_has_named_params(map2
->dim
))
945 isl_die(map1
->ctx
, isl_error_invalid
,
946 "unaligned unnamed parameters", goto error
);
947 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
948 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
949 return fn(map1
, map2
);
956 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
957 __isl_keep isl_map
*map2
,
958 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
964 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
965 return fn(map1
, map2
);
966 if (!isl_space_has_named_params(map1
->dim
) ||
967 !isl_space_has_named_params(map2
->dim
))
968 isl_die(map1
->ctx
, isl_error_invalid
,
969 "unaligned unnamed parameters", return -1);
970 map1
= isl_map_copy(map1
);
971 map2
= isl_map_copy(map2
);
972 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
973 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
980 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
986 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
987 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
989 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
990 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
991 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
992 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
993 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
994 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
996 int j
= isl_basic_map_alloc_inequality(bmap
);
1000 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1001 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1008 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1009 bmap
->extra
- bmap
->n_div
);
1010 return bmap
->n_eq
++;
1013 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1015 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1018 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1022 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1027 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1029 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1032 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1037 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1039 if (pos
!= bmap
->n_eq
- 1) {
1041 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1042 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1048 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1050 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1053 void isl_basic_map_inequality_to_equality(
1054 struct isl_basic_map
*bmap
, unsigned pos
)
1058 t
= bmap
->ineq
[pos
];
1059 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1060 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1065 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1066 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1067 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1068 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1071 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1073 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1076 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1078 struct isl_ctx
*ctx
;
1082 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1083 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1084 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1085 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1086 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1087 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1088 1 + isl_basic_map_total_dim(bmap
),
1089 bmap
->extra
- bmap
->n_div
);
1090 return bmap
->n_ineq
++;
1093 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1095 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1098 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1102 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1107 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1109 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1112 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1117 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1119 if (pos
!= bmap
->n_ineq
- 1) {
1120 t
= bmap
->ineq
[pos
];
1121 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1122 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1123 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1129 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1131 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1134 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1139 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1142 k
= isl_basic_map_alloc_equality(bmap
);
1145 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1148 isl_basic_map_free(bmap
);
1152 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1155 return (isl_basic_set
*)
1156 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1159 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1164 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1167 k
= isl_basic_map_alloc_inequality(bmap
);
1170 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1173 isl_basic_map_free(bmap
);
1177 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1180 return (isl_basic_set
*)
1181 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1184 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1188 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1189 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1190 1 + 1 + isl_basic_map_total_dim(bmap
),
1191 bmap
->extra
- bmap
->n_div
);
1192 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1193 return bmap
->n_div
++;
1196 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1198 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1201 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1205 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1210 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1212 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1215 /* Copy constraint from src to dst, putting the vars of src at offset
1216 * dim_off in dst and the divs of src at offset div_off in dst.
1217 * If both sets are actually map, then dim_off applies to the input
1220 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1221 struct isl_basic_map
*src_map
, isl_int
*src
,
1222 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1224 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1225 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1226 unsigned src_in
= isl_basic_map_n_in(src_map
);
1227 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1228 unsigned src_out
= isl_basic_map_n_out(src_map
);
1229 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1230 isl_int_set(dst
[0], src
[0]);
1231 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1232 if (dst_nparam
> src_nparam
)
1233 isl_seq_clr(dst
+1+src_nparam
,
1234 dst_nparam
- src_nparam
);
1235 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1236 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1238 isl_min(dst_in
-in_off
, src_in
));
1239 if (dst_in
-in_off
> src_in
)
1240 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1241 dst_in
- in_off
- src_in
);
1242 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1243 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1244 src
+1+src_nparam
+src_in
,
1245 isl_min(dst_out
-out_off
, src_out
));
1246 if (dst_out
-out_off
> src_out
)
1247 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1248 dst_out
- out_off
- src_out
);
1249 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1250 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1251 src
+1+src_nparam
+src_in
+src_out
,
1252 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1253 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1254 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1255 div_off
+src_map
->n_div
,
1256 dst_map
->n_div
- div_off
- src_map
->n_div
);
1259 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1260 struct isl_basic_map
*src_map
, isl_int
*src
,
1261 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1263 isl_int_set(dst
[0], src
[0]);
1264 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1267 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1268 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1273 if (!bmap1
|| !bmap2
)
1276 div_off
= bmap1
->n_div
;
1278 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1279 int i1
= isl_basic_map_alloc_equality(bmap1
);
1282 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1283 i_pos
, o_pos
, div_off
);
1286 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1287 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1290 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1291 i_pos
, o_pos
, div_off
);
1294 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1295 int i1
= isl_basic_map_alloc_div(bmap1
);
1298 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1299 i_pos
, o_pos
, div_off
);
1302 isl_basic_map_free(bmap2
);
1307 isl_basic_map_free(bmap1
);
1308 isl_basic_map_free(bmap2
);
1312 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1313 struct isl_basic_set
*bset2
, unsigned pos
)
1315 return (struct isl_basic_set
*)
1316 add_constraints((struct isl_basic_map
*)bset1
,
1317 (struct isl_basic_map
*)bset2
, 0, pos
);
1320 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1321 __isl_take isl_space
*dim
, unsigned extra
,
1322 unsigned n_eq
, unsigned n_ineq
)
1324 struct isl_basic_map
*ext
;
1334 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1335 base
->extra
>= base
->n_div
+ extra
;
1337 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1338 room_for_ineq(base
, n_ineq
)) {
1339 isl_space_free(dim
);
1343 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1344 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1345 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1346 extra
+= base
->extra
;
1348 n_ineq
+= base
->n_ineq
;
1350 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1356 ext
->sample
= isl_vec_copy(base
->sample
);
1357 flags
= base
->flags
;
1358 ext
= add_constraints(ext
, base
, 0, 0);
1361 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1367 isl_space_free(dim
);
1368 isl_basic_map_free(base
);
1372 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1373 __isl_take isl_space
*dim
, unsigned extra
,
1374 unsigned n_eq
, unsigned n_ineq
)
1376 return (struct isl_basic_set
*)
1377 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1378 extra
, n_eq
, n_ineq
);
1381 struct isl_basic_map
*isl_basic_map_extend_constraints(
1382 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1386 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1390 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1391 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1392 unsigned n_eq
, unsigned n_ineq
)
1394 struct isl_basic_map
*bmap
;
1399 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1403 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1406 isl_basic_map_free(base
);
1410 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1411 unsigned nparam
, unsigned dim
, unsigned extra
,
1412 unsigned n_eq
, unsigned n_ineq
)
1414 return (struct isl_basic_set
*)
1415 isl_basic_map_extend((struct isl_basic_map
*)base
,
1416 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1419 struct isl_basic_set
*isl_basic_set_extend_constraints(
1420 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1422 return (struct isl_basic_set
*)
1423 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1427 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1429 return (struct isl_basic_set
*)
1430 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1433 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1438 if (bmap
->ref
> 1) {
1440 bmap
= isl_basic_map_dup(bmap
);
1443 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1447 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1455 return isl_set_dup(set
);
1458 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1466 return isl_map_dup(map
);
1469 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1470 unsigned a_len
, unsigned b_len
)
1472 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1473 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1474 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1477 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1478 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1486 isl_assert(bmap
->ctx
,
1487 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1489 if (n1
== 0 || n2
== 0)
1492 bmap
= isl_basic_map_cow(bmap
);
1496 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1497 if (isl_blk_is_error(blk
))
1500 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1502 bmap
->eq
[i
] + pos
, n1
, n2
);
1504 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1506 bmap
->ineq
[i
] + pos
, n1
, n2
);
1508 for (i
= 0; i
< bmap
->n_div
; ++i
)
1510 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1512 isl_blk_free(bmap
->ctx
, blk
);
1514 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1515 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1516 return isl_basic_map_finalize(bmap
);
1518 isl_basic_map_free(bmap
);
1522 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1523 __isl_take isl_basic_set
*bset
, unsigned n
)
1528 nparam
= isl_basic_set_n_param(bset
);
1529 dim
= isl_basic_set_n_dim(bset
);
1530 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1532 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1534 isl_basic_set_free(bset
);
1538 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1544 total
= isl_basic_map_total_dim(bmap
);
1545 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1546 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1548 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1550 i
= isl_basic_map_alloc_equality(bmap
);
1554 isl_int_set_si(bmap
->eq
[i
][0], 1);
1555 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1556 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1557 isl_vec_free(bmap
->sample
);
1558 bmap
->sample
= NULL
;
1559 return isl_basic_map_finalize(bmap
);
1561 isl_basic_map_free(bmap
);
1565 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1567 return (struct isl_basic_set
*)
1568 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1571 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1574 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1575 isl_int
*t
= bmap
->div
[a
];
1576 bmap
->div
[a
] = bmap
->div
[b
];
1579 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1580 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1582 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1583 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1585 for (i
= 0; i
< bmap
->n_div
; ++i
)
1586 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1587 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1590 /* Eliminate the specified n dimensions starting at first from the
1591 * constraints using Fourier-Motzkin. The dimensions themselves
1594 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1595 enum isl_dim_type type
, unsigned first
, unsigned n
)
1604 map
= isl_map_cow(map
);
1608 for (i
= 0; i
< map
->n
; ++i
) {
1609 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1619 /* Eliminate the specified n dimensions starting at first from the
1620 * constraints using Fourier-Motzkin. The dimensions themselves
1623 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1624 enum isl_dim_type type
, unsigned first
, unsigned n
)
1626 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1629 /* Eliminate the specified n dimensions starting at first from the
1630 * constraints using Fourier-Motzkin. The dimensions themselves
1633 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1634 unsigned first
, unsigned n
)
1636 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1639 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1640 __isl_take isl_basic_map
*bmap
)
1644 bmap
= isl_basic_map_eliminate_vars(bmap
,
1645 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1649 return isl_basic_map_finalize(bmap
);
1652 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1653 __isl_take isl_basic_set
*bset
)
1655 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1656 (struct isl_basic_map
*)bset
);
1659 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1668 map
= isl_map_cow(map
);
1672 for (i
= 0; i
< map
->n
; ++i
) {
1673 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1683 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1685 return isl_map_remove_divs(set
);
1688 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1689 enum isl_dim_type type
, unsigned first
, unsigned n
)
1693 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1695 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1697 bmap
= isl_basic_map_eliminate_vars(bmap
,
1698 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1701 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1703 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1706 isl_basic_map_free(bmap
);
1710 /* Return true if the definition of the given div (recursively) involves
1711 * any of the given variables.
1713 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1714 unsigned first
, unsigned n
)
1717 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1719 if (isl_int_is_zero(bmap
->div
[div
][0]))
1721 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1724 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1725 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1727 if (div_involves_vars(bmap
, i
, first
, n
))
1734 /* Remove all divs (recursively) involving any of the given dimensions
1735 * in their definitions.
1737 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1738 __isl_take isl_basic_map
*bmap
,
1739 enum isl_dim_type type
, unsigned first
, unsigned n
)
1745 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1747 first
+= isl_basic_map_offset(bmap
, type
);
1749 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1750 if (!div_involves_vars(bmap
, i
, first
, n
))
1752 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1760 isl_basic_map_free(bmap
);
1764 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1765 enum isl_dim_type type
, unsigned first
, unsigned n
)
1774 map
= isl_map_cow(map
);
1778 for (i
= 0; i
< map
->n
; ++i
) {
1779 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1790 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1791 enum isl_dim_type type
, unsigned first
, unsigned n
)
1793 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1797 /* Does the desciption of "bmap" depend on the specified dimensions?
1798 * We also check whether the dimensions appear in any of the div definitions.
1799 * In principle there is no need for this check. If the dimensions appear
1800 * in a div definition, they also appear in the defining constraints of that
1803 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
1804 enum isl_dim_type type
, unsigned first
, unsigned n
)
1811 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
1812 isl_die(bmap
->ctx
, isl_error_invalid
,
1813 "index out of bounds", return -1);
1815 first
+= isl_basic_map_offset(bmap
, type
);
1816 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1817 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
1819 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1820 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
1822 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1823 if (isl_int_is_zero(bmap
->div
[i
][0]))
1825 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
1832 int isl_map_involves_dims(__isl_keep isl_map
*map
,
1833 enum isl_dim_type type
, unsigned first
, unsigned n
)
1840 if (first
+ n
> isl_map_dim(map
, type
))
1841 isl_die(map
->ctx
, isl_error_invalid
,
1842 "index out of bounds", return -1);
1844 for (i
= 0; i
< map
->n
; ++i
) {
1845 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
1847 if (involves
< 0 || involves
)
1854 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
1855 enum isl_dim_type type
, unsigned first
, unsigned n
)
1857 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
1860 int isl_set_involves_dims(__isl_keep isl_set
*set
,
1861 enum isl_dim_type type
, unsigned first
, unsigned n
)
1863 return isl_map_involves_dims(set
, type
, first
, n
);
1866 /* Return true if the definition of the given div is unknown or depends
1869 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1872 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1874 if (isl_int_is_zero(bmap
->div
[div
][0]))
1877 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1878 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1880 if (div_is_unknown(bmap
, i
))
1887 /* Remove all divs that are unknown or defined in terms of unknown divs.
1889 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1890 __isl_take isl_basic_map
*bmap
)
1897 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1898 if (!div_is_unknown(bmap
, i
))
1900 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1909 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1918 map
= isl_map_cow(map
);
1922 for (i
= 0; i
< map
->n
; ++i
) {
1923 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1933 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1935 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1938 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1939 __isl_take isl_basic_set
*bset
,
1940 enum isl_dim_type type
, unsigned first
, unsigned n
)
1942 return (isl_basic_set
*)
1943 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1946 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1947 enum isl_dim_type type
, unsigned first
, unsigned n
)
1954 map
= isl_map_cow(map
);
1957 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1959 for (i
= 0; i
< map
->n
; ++i
) {
1960 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1961 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1965 map
= isl_map_drop(map
, type
, first
, n
);
1972 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1973 enum isl_dim_type type
, unsigned first
, unsigned n
)
1975 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1978 /* Project out n inputs starting at first using Fourier-Motzkin */
1979 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1980 unsigned first
, unsigned n
)
1982 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1985 static void dump_term(struct isl_basic_map
*bmap
,
1986 isl_int c
, int pos
, FILE *out
)
1989 unsigned in
= isl_basic_map_n_in(bmap
);
1990 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1991 unsigned nparam
= isl_basic_map_n_param(bmap
);
1993 isl_int_print(out
, c
, 0);
1995 if (!isl_int_is_one(c
))
1996 isl_int_print(out
, c
, 0);
1997 if (pos
< 1 + nparam
) {
1998 name
= isl_space_get_dim_name(bmap
->dim
,
1999 isl_dim_param
, pos
- 1);
2001 fprintf(out
, "%s", name
);
2003 fprintf(out
, "p%d", pos
- 1);
2004 } else if (pos
< 1 + nparam
+ in
)
2005 fprintf(out
, "i%d", pos
- 1 - nparam
);
2006 else if (pos
< 1 + nparam
+ dim
)
2007 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2009 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2013 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2014 int sign
, FILE *out
)
2018 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2022 for (i
= 0, first
= 1; i
< len
; ++i
) {
2023 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2026 fprintf(out
, " + ");
2028 isl_int_abs(v
, c
[i
]);
2029 dump_term(bmap
, v
, i
, out
);
2036 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2037 const char *op
, FILE *out
, int indent
)
2041 fprintf(out
, "%*s", indent
, "");
2043 dump_constraint_sign(bmap
, c
, 1, out
);
2044 fprintf(out
, " %s ", op
);
2045 dump_constraint_sign(bmap
, c
, -1, out
);
2049 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2050 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2052 fprintf(out
, "%*s", indent
, "");
2053 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2058 static void dump_constraints(struct isl_basic_map
*bmap
,
2059 isl_int
**c
, unsigned n
,
2060 const char *op
, FILE *out
, int indent
)
2064 for (i
= 0; i
< n
; ++i
)
2065 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2068 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2072 unsigned total
= isl_basic_map_total_dim(bmap
);
2074 for (j
= 0; j
< 1 + total
; ++j
) {
2075 if (isl_int_is_zero(exp
[j
]))
2077 if (!first
&& isl_int_is_pos(exp
[j
]))
2079 dump_term(bmap
, exp
[j
], j
, out
);
2084 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2088 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2089 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2091 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2092 fprintf(out
, "%*s", indent
, "");
2093 fprintf(out
, "e%d = [(", i
);
2094 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2096 isl_int_print(out
, bmap
->div
[i
][0], 0);
2097 fprintf(out
, "]\n");
2101 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2102 FILE *out
, int indent
)
2105 fprintf(out
, "null basic set\n");
2109 fprintf(out
, "%*s", indent
, "");
2110 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2111 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2112 bset
->extra
, bset
->flags
);
2113 dump((struct isl_basic_map
*)bset
, out
, indent
);
2116 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2117 FILE *out
, int indent
)
2120 fprintf(out
, "null basic map\n");
2124 fprintf(out
, "%*s", indent
, "");
2125 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2126 "flags: %x, n_name: %d\n",
2128 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2129 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2130 dump(bmap
, out
, indent
);
2133 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2138 total
= isl_basic_map_total_dim(bmap
);
2139 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2140 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2141 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2142 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2146 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2149 struct isl_set
*set
;
2153 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2154 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2155 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2156 sizeof(struct isl_set
) +
2157 (n
- 1) * sizeof(struct isl_basic_set
*));
2161 set
->ctx
= dim
->ctx
;
2162 isl_ctx_ref(set
->ctx
);
2170 isl_space_free(dim
);
2174 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2175 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2177 struct isl_set
*set
;
2180 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2184 set
= isl_set_alloc_space(dims
, n
, flags
);
2188 /* Make sure "map" has room for at least "n" more basic maps.
2190 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2193 struct isl_map
*grown
= NULL
;
2197 isl_assert(map
->ctx
, n
>= 0, goto error
);
2198 if (map
->n
+ n
<= map
->size
)
2200 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2203 for (i
= 0; i
< map
->n
; ++i
) {
2204 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2212 isl_map_free(grown
);
2217 /* Make sure "set" has room for at least "n" more basic sets.
2219 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2221 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2224 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2227 struct isl_set
*dup
;
2232 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2235 for (i
= 0; i
< set
->n
; ++i
)
2236 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2240 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2242 return isl_map_from_basic_map(bset
);
2245 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2247 struct isl_map
*map
;
2252 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2253 return isl_map_add_basic_map(map
, bmap
);
2256 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2257 __isl_take isl_basic_set
*bset
)
2259 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2260 (struct isl_basic_map
*)bset
);
2263 void isl_set_free(struct isl_set
*set
)
2273 isl_ctx_deref(set
->ctx
);
2274 for (i
= 0; i
< set
->n
; ++i
)
2275 isl_basic_set_free(set
->p
[i
]);
2276 isl_space_free(set
->dim
);
2280 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2285 fprintf(out
, "null set\n");
2289 fprintf(out
, "%*s", indent
, "");
2290 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2291 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2293 for (i
= 0; i
< set
->n
; ++i
) {
2294 fprintf(out
, "%*s", indent
, "");
2295 fprintf(out
, "basic set %d:\n", i
);
2296 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2300 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2305 fprintf(out
, "null map\n");
2309 fprintf(out
, "%*s", indent
, "");
2310 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2311 "flags: %x, n_name: %d\n",
2312 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2313 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2314 for (i
= 0; i
< map
->n
; ++i
) {
2315 fprintf(out
, "%*s", indent
, "");
2316 fprintf(out
, "basic map %d:\n", i
);
2317 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2321 struct isl_basic_map
*isl_basic_map_intersect_domain(
2322 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2324 struct isl_basic_map
*bmap_domain
;
2329 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2330 bset
->dim
, isl_dim_param
), goto error
);
2332 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2333 isl_assert(bset
->ctx
,
2334 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2336 bmap
= isl_basic_map_cow(bmap
);
2339 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2340 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2341 bmap_domain
= isl_basic_map_from_domain(bset
);
2342 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2344 bmap
= isl_basic_map_simplify(bmap
);
2345 return isl_basic_map_finalize(bmap
);
2347 isl_basic_map_free(bmap
);
2348 isl_basic_set_free(bset
);
2352 struct isl_basic_map
*isl_basic_map_intersect_range(
2353 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2355 struct isl_basic_map
*bmap_range
;
2360 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2361 bset
->dim
, isl_dim_param
), goto error
);
2363 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2364 isl_assert(bset
->ctx
,
2365 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2367 if (isl_basic_set_is_universe(bset
)) {
2368 isl_basic_set_free(bset
);
2372 bmap
= isl_basic_map_cow(bmap
);
2375 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2376 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2377 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2378 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2380 bmap
= isl_basic_map_simplify(bmap
);
2381 return isl_basic_map_finalize(bmap
);
2383 isl_basic_map_free(bmap
);
2384 isl_basic_set_free(bset
);
2388 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2394 total
= 1 + isl_basic_map_total_dim(bmap
);
2395 if (total
!= vec
->size
)
2400 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2401 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2402 if (!isl_int_is_zero(s
)) {
2408 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2409 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2410 if (isl_int_is_neg(s
)) {
2421 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2423 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2426 struct isl_basic_map
*isl_basic_map_intersect(
2427 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2429 struct isl_vec
*sample
= NULL
;
2431 if (!bmap1
|| !bmap2
)
2434 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2435 bmap2
->dim
, isl_dim_param
), goto error
);
2436 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2437 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2438 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2439 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2440 return isl_basic_map_intersect(bmap2
, bmap1
);
2442 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2443 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2444 isl_assert(bmap1
->ctx
,
2445 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2447 if (bmap1
->sample
&&
2448 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2449 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2450 sample
= isl_vec_copy(bmap1
->sample
);
2451 else if (bmap2
->sample
&&
2452 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2453 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2454 sample
= isl_vec_copy(bmap2
->sample
);
2456 bmap1
= isl_basic_map_cow(bmap1
);
2459 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2460 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2461 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2464 isl_vec_free(sample
);
2466 isl_vec_free(bmap1
->sample
);
2467 bmap1
->sample
= sample
;
2470 bmap1
= isl_basic_map_simplify(bmap1
);
2471 return isl_basic_map_finalize(bmap1
);
2474 isl_vec_free(sample
);
2475 isl_basic_map_free(bmap1
);
2476 isl_basic_map_free(bmap2
);
2480 struct isl_basic_set
*isl_basic_set_intersect(
2481 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2483 return (struct isl_basic_set
*)
2484 isl_basic_map_intersect(
2485 (struct isl_basic_map
*)bset1
,
2486 (struct isl_basic_map
*)bset2
);
2489 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2490 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2492 return isl_basic_set_intersect(bset1
, bset2
);
2495 /* Special case of isl_map_intersect, where both map1 and map2
2496 * are convex, without any divs and such that either map1 or map2
2497 * contains a single constraint. This constraint is then simply
2498 * added to the other map.
2500 static __isl_give isl_map
*map_intersect_add_constraint(
2501 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2503 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2504 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2505 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2506 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2508 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2509 return isl_map_intersect(map2
, map1
);
2511 isl_assert(map2
->ctx
,
2512 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2514 map1
= isl_map_cow(map1
);
2517 if (isl_map_plain_is_empty(map1
)) {
2521 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2522 if (map2
->p
[0]->n_eq
== 1)
2523 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2525 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2526 map2
->p
[0]->ineq
[0]);
2528 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2529 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2533 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2534 isl_basic_map_free(map1
->p
[0]);
2547 /* map2 may be either a parameter domain or a map living in the same
2550 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2551 __isl_take isl_map
*map2
)
2554 struct isl_map
*result
;
2560 if (isl_map_plain_is_empty(map1
) &&
2561 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2565 if (isl_map_plain_is_empty(map2
) &&
2566 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2571 if (map1
->n
== 1 && map2
->n
== 1 &&
2572 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2573 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2574 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2575 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2576 return map_intersect_add_constraint(map1
, map2
);
2578 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2579 isl_space_dim(map2
->dim
, isl_dim_param
))
2580 isl_assert(map1
->ctx
,
2581 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2583 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2584 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2585 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2587 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2588 map1
->n
* map2
->n
, flags
);
2591 for (i
= 0; i
< map1
->n
; ++i
)
2592 for (j
= 0; j
< map2
->n
; ++j
) {
2593 struct isl_basic_map
*part
;
2594 part
= isl_basic_map_intersect(
2595 isl_basic_map_copy(map1
->p
[i
]),
2596 isl_basic_map_copy(map2
->p
[j
]));
2597 if (isl_basic_map_is_empty(part
))
2598 isl_basic_map_free(part
);
2600 result
= isl_map_add_basic_map(result
, part
);
2613 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2614 __isl_take isl_map
*map2
)
2618 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2619 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2620 "spaces don't match", goto error
);
2621 return map_intersect_internal(map1
, map2
);
2628 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2629 __isl_take isl_map
*map2
)
2631 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2634 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2636 return (struct isl_set
*)
2637 isl_map_intersect((struct isl_map
*)set1
,
2638 (struct isl_map
*)set2
);
2641 /* map_intersect_internal accepts intersections
2642 * with parameter domains, so we can just call that function.
2644 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2645 __isl_take isl_set
*params
)
2647 return map_intersect_internal(map
, params
);
2650 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2651 __isl_take isl_map
*map2
)
2653 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2656 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2657 __isl_take isl_set
*params
)
2659 return isl_map_intersect_params(set
, params
);
2662 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2665 struct isl_basic_set
*bset
;
2670 bmap
= isl_basic_map_cow(bmap
);
2673 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2674 in
= isl_basic_map_n_in(bmap
);
2675 bset
= isl_basic_set_from_basic_map(bmap
);
2676 bset
= isl_basic_set_swap_vars(bset
, in
);
2677 return isl_basic_map_from_basic_set(bset
, dim
);
2680 static __isl_give isl_basic_map
*basic_map_space_reset(
2681 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2685 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2688 space
= isl_basic_map_get_space(bmap
);
2689 space
= isl_space_reset(space
, type
);
2690 bmap
= isl_basic_map_reset_space(bmap
, space
);
2694 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2695 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2698 struct isl_basic_map
*res
;
2699 struct isl_dim_map
*dim_map
;
2700 unsigned total
, off
;
2701 enum isl_dim_type t
;
2704 return basic_map_space_reset(bmap
, type
);
2709 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
2711 total
= isl_basic_map_total_dim(bmap
) + n
;
2712 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2714 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2716 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2718 unsigned size
= isl_basic_map_dim(bmap
, t
);
2719 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2721 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2722 pos
, size
- pos
, off
+ pos
+ n
);
2724 off
+= isl_space_dim(res_dim
, t
);
2726 isl_dim_map_div(dim_map
, bmap
, off
);
2728 res
= isl_basic_map_alloc_space(res_dim
,
2729 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2730 if (isl_basic_map_is_rational(bmap
))
2731 res
= isl_basic_map_set_rational(res
);
2732 if (isl_basic_map_plain_is_empty(bmap
)) {
2733 isl_basic_map_free(bmap
);
2734 return isl_basic_map_set_to_empty(res
);
2736 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2737 return isl_basic_map_finalize(res
);
2740 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2741 enum isl_dim_type type
, unsigned n
)
2745 return isl_basic_map_insert(bmap
, type
,
2746 isl_basic_map_dim(bmap
, type
), n
);
2749 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2750 enum isl_dim_type type
, unsigned n
)
2754 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2755 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2757 isl_basic_set_free(bset
);
2761 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
2762 enum isl_dim_type type
)
2766 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
2769 space
= isl_map_get_space(map
);
2770 space
= isl_space_reset(space
, type
);
2771 map
= isl_map_reset_space(map
, space
);
2775 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
2776 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2781 return map_space_reset(map
, type
);
2783 map
= isl_map_cow(map
);
2787 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
2791 for (i
= 0; i
< map
->n
; ++i
) {
2792 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2803 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
2804 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2806 return isl_map_insert_dims(set
, type
, pos
, n
);
2809 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2810 enum isl_dim_type type
, unsigned n
)
2814 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
2817 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2818 enum isl_dim_type type
, unsigned n
)
2822 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2823 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2829 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2830 __isl_take isl_basic_map
*bmap
,
2831 enum isl_dim_type dst_type
, unsigned dst_pos
,
2832 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2834 struct isl_dim_map
*dim_map
;
2835 struct isl_basic_map
*res
;
2836 enum isl_dim_type t
;
2837 unsigned total
, off
;
2844 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2847 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2850 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2852 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2853 pos(bmap
->dim
, src_type
) + src_pos
+
2854 ((src_type
< dst_type
) ? n
: 0)) {
2855 bmap
= isl_basic_map_cow(bmap
);
2859 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
2860 src_type
, src_pos
, n
);
2864 bmap
= isl_basic_map_finalize(bmap
);
2869 total
= isl_basic_map_total_dim(bmap
);
2870 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2873 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2874 unsigned size
= isl_space_dim(bmap
->dim
, t
);
2875 if (t
== dst_type
) {
2876 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2879 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2882 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2883 dst_pos
, size
- dst_pos
, off
);
2884 off
+= size
- dst_pos
;
2885 } else if (t
== src_type
) {
2886 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2889 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2890 src_pos
+ n
, size
- src_pos
- n
, off
);
2891 off
+= size
- src_pos
- n
;
2893 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2897 isl_dim_map_div(dim_map
, bmap
, off
);
2899 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
2900 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2901 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2903 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
2904 src_type
, src_pos
, n
);
2908 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2909 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2910 bmap
= isl_basic_map_finalize(bmap
);
2914 isl_basic_map_free(bmap
);
2918 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2919 enum isl_dim_type dst_type
, unsigned dst_pos
,
2920 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2922 return (isl_basic_set
*)isl_basic_map_move_dims(
2923 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2926 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2927 enum isl_dim_type dst_type
, unsigned dst_pos
,
2928 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2932 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2933 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2934 src_type
, src_pos
, n
);
2940 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2941 enum isl_dim_type dst_type
, unsigned dst_pos
,
2942 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2951 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2954 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2957 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2959 map
= isl_map_cow(map
);
2963 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2967 for (i
= 0; i
< map
->n
; ++i
) {
2968 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2970 src_type
, src_pos
, n
);
2981 /* Move the specified dimensions to the last columns right before
2982 * the divs. Don't change the dimension specification of bmap.
2983 * That's the responsibility of the caller.
2985 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2986 enum isl_dim_type type
, unsigned first
, unsigned n
)
2988 struct isl_dim_map
*dim_map
;
2989 struct isl_basic_map
*res
;
2990 enum isl_dim_type t
;
2991 unsigned total
, off
;
2995 if (pos(bmap
->dim
, type
) + first
+ n
==
2996 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
2999 total
= isl_basic_map_total_dim(bmap
);
3000 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3003 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3004 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3006 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3009 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3010 first
, n
, total
- bmap
->n_div
- n
);
3011 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3012 first
+ n
, size
- (first
+ n
), off
);
3013 off
+= size
- (first
+ n
);
3015 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3019 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3021 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3022 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3023 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3027 /* Turn the n dimensions of type type, starting at first
3028 * into existentially quantified variables.
3030 __isl_give isl_basic_map
*isl_basic_map_project_out(
3031 __isl_take isl_basic_map
*bmap
,
3032 enum isl_dim_type type
, unsigned first
, unsigned n
)
3040 return basic_map_space_reset(bmap
, type
);
3045 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3046 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3048 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3051 bmap
= move_last(bmap
, type
, first
, n
);
3052 bmap
= isl_basic_map_cow(bmap
);
3056 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3057 old
= bmap
->block2
.data
;
3058 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3059 (bmap
->extra
+ n
) * (1 + row_size
));
3060 if (!bmap
->block2
.data
)
3062 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3065 for (i
= 0; i
< n
; ++i
) {
3066 new_div
[i
] = bmap
->block2
.data
+
3067 (bmap
->extra
+ i
) * (1 + row_size
);
3068 isl_seq_clr(new_div
[i
], 1 + row_size
);
3070 for (i
= 0; i
< bmap
->extra
; ++i
)
3071 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3073 bmap
->div
= new_div
;
3077 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3080 bmap
= isl_basic_map_simplify(bmap
);
3081 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3082 return isl_basic_map_finalize(bmap
);
3084 isl_basic_map_free(bmap
);
3088 /* Turn the n dimensions of type type, starting at first
3089 * into existentially quantified variables.
3091 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3092 enum isl_dim_type type
, unsigned first
, unsigned n
)
3094 return (isl_basic_set
*)isl_basic_map_project_out(
3095 (isl_basic_map
*)bset
, type
, first
, n
);
3098 /* Turn the n dimensions of type type, starting at first
3099 * into existentially quantified variables.
3101 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3102 enum isl_dim_type type
, unsigned first
, unsigned n
)
3110 return map_space_reset(map
, type
);
3112 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3114 map
= isl_map_cow(map
);
3118 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3122 for (i
= 0; i
< map
->n
; ++i
) {
3123 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3134 /* Turn the n dimensions of type type, starting at first
3135 * into existentially quantified variables.
3137 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3138 enum isl_dim_type type
, unsigned first
, unsigned n
)
3140 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3143 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3147 for (i
= 0; i
< n
; ++i
) {
3148 j
= isl_basic_map_alloc_div(bmap
);
3151 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3155 isl_basic_map_free(bmap
);
3159 struct isl_basic_map
*isl_basic_map_apply_range(
3160 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3162 isl_space
*dim_result
= NULL
;
3163 struct isl_basic_map
*bmap
;
3164 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3165 struct isl_dim_map
*dim_map1
, *dim_map2
;
3167 if (!bmap1
|| !bmap2
)
3170 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3171 isl_space_copy(bmap2
->dim
));
3173 n_in
= isl_basic_map_n_in(bmap1
);
3174 n_out
= isl_basic_map_n_out(bmap2
);
3175 n
= isl_basic_map_n_out(bmap1
);
3176 nparam
= isl_basic_map_n_param(bmap1
);
3178 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3179 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3180 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3181 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3182 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3183 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3184 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3185 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3186 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3187 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3188 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3190 bmap
= isl_basic_map_alloc_space(dim_result
,
3191 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3192 bmap1
->n_eq
+ bmap2
->n_eq
,
3193 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3194 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3195 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3196 bmap
= add_divs(bmap
, n
);
3197 bmap
= isl_basic_map_simplify(bmap
);
3198 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3199 return isl_basic_map_finalize(bmap
);
3201 isl_basic_map_free(bmap1
);
3202 isl_basic_map_free(bmap2
);
3206 struct isl_basic_set
*isl_basic_set_apply(
3207 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3212 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3215 return (struct isl_basic_set
*)
3216 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3218 isl_basic_set_free(bset
);
3219 isl_basic_map_free(bmap
);
3223 struct isl_basic_map
*isl_basic_map_apply_domain(
3224 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3226 if (!bmap1
|| !bmap2
)
3229 isl_assert(bmap1
->ctx
,
3230 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3231 isl_assert(bmap1
->ctx
,
3232 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3235 bmap1
= isl_basic_map_reverse(bmap1
);
3236 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3237 return isl_basic_map_reverse(bmap1
);
3239 isl_basic_map_free(bmap1
);
3240 isl_basic_map_free(bmap2
);
3244 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3245 * A \cap B -> f(A) + f(B)
3247 struct isl_basic_map
*isl_basic_map_sum(
3248 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3250 unsigned n_in
, n_out
, nparam
, total
, pos
;
3251 struct isl_basic_map
*bmap
= NULL
;
3252 struct isl_dim_map
*dim_map1
, *dim_map2
;
3255 if (!bmap1
|| !bmap2
)
3258 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3261 nparam
= isl_basic_map_n_param(bmap1
);
3262 n_in
= isl_basic_map_n_in(bmap1
);
3263 n_out
= isl_basic_map_n_out(bmap1
);
3265 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3266 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3267 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3268 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3269 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3270 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3271 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3272 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3273 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3274 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3275 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3277 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3278 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3279 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3280 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3281 for (i
= 0; i
< n_out
; ++i
) {
3282 int j
= isl_basic_map_alloc_equality(bmap
);
3285 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3286 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3287 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3288 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3290 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3291 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3292 bmap
= add_divs(bmap
, 2 * n_out
);
3294 bmap
= isl_basic_map_simplify(bmap
);
3295 return isl_basic_map_finalize(bmap
);
3297 isl_basic_map_free(bmap
);
3298 isl_basic_map_free(bmap1
);
3299 isl_basic_map_free(bmap2
);
3303 /* Given two maps A -> f(A) and B -> g(B), construct a map
3304 * A \cap B -> f(A) + f(B)
3306 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3308 struct isl_map
*result
;
3314 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3316 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3317 map1
->n
* map2
->n
, 0);
3320 for (i
= 0; i
< map1
->n
; ++i
)
3321 for (j
= 0; j
< map2
->n
; ++j
) {
3322 struct isl_basic_map
*part
;
3323 part
= isl_basic_map_sum(
3324 isl_basic_map_copy(map1
->p
[i
]),
3325 isl_basic_map_copy(map2
->p
[j
]));
3326 if (isl_basic_map_is_empty(part
))
3327 isl_basic_map_free(part
);
3329 result
= isl_map_add_basic_map(result
, part
);
3342 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3343 __isl_take isl_set
*set2
)
3345 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3348 /* Given a basic map A -> f(A), construct A -> -f(A).
3350 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3355 bmap
= isl_basic_map_cow(bmap
);
3359 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3360 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3361 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3362 for (j
= 0; j
< n
; ++j
)
3363 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3364 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3365 for (j
= 0; j
< n
; ++j
)
3366 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3367 for (i
= 0; i
< bmap
->n_div
; ++i
)
3368 for (j
= 0; j
< n
; ++j
)
3369 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3370 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3371 return isl_basic_map_finalize(bmap
);
3374 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3376 return isl_basic_map_neg(bset
);
3379 /* Given a map A -> f(A), construct A -> -f(A).
3381 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3385 map
= isl_map_cow(map
);
3389 for (i
= 0; i
< map
->n
; ++i
) {
3390 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3401 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3403 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3406 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3407 * A -> floor(f(A)/d).
3409 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3412 unsigned n_in
, n_out
, nparam
, total
, pos
;
3413 struct isl_basic_map
*result
= NULL
;
3414 struct isl_dim_map
*dim_map
;
3420 nparam
= isl_basic_map_n_param(bmap
);
3421 n_in
= isl_basic_map_n_in(bmap
);
3422 n_out
= isl_basic_map_n_out(bmap
);
3424 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3425 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3426 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3427 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3428 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3429 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3431 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3432 bmap
->n_div
+ n_out
,
3433 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3434 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3435 result
= add_divs(result
, n_out
);
3436 for (i
= 0; i
< n_out
; ++i
) {
3438 j
= isl_basic_map_alloc_inequality(result
);
3441 isl_seq_clr(result
->ineq
[j
], 1+total
);
3442 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3443 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3444 j
= isl_basic_map_alloc_inequality(result
);
3447 isl_seq_clr(result
->ineq
[j
], 1+total
);
3448 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3449 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3450 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3453 result
= isl_basic_map_simplify(result
);
3454 return isl_basic_map_finalize(result
);
3456 isl_basic_map_free(result
);
3460 /* Given a map A -> f(A) and an integer d, construct a map
3461 * A -> floor(f(A)/d).
3463 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3467 map
= isl_map_cow(map
);
3471 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3472 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3473 for (i
= 0; i
< map
->n
; ++i
) {
3474 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3485 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3491 i
= isl_basic_map_alloc_equality(bmap
);
3494 nparam
= isl_basic_map_n_param(bmap
);
3495 n_in
= isl_basic_map_n_in(bmap
);
3496 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3497 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3498 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3499 return isl_basic_map_finalize(bmap
);
3501 isl_basic_map_free(bmap
);
3505 /* Add a constraints to "bmap" expressing i_pos < o_pos
3507 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3513 i
= isl_basic_map_alloc_inequality(bmap
);
3516 nparam
= isl_basic_map_n_param(bmap
);
3517 n_in
= isl_basic_map_n_in(bmap
);
3518 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3519 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3520 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3521 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3522 return isl_basic_map_finalize(bmap
);
3524 isl_basic_map_free(bmap
);
3528 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3530 static __isl_give isl_basic_map
*var_less_or_equal(
3531 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3537 i
= isl_basic_map_alloc_inequality(bmap
);
3540 nparam
= isl_basic_map_n_param(bmap
);
3541 n_in
= isl_basic_map_n_in(bmap
);
3542 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3543 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3544 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3545 return isl_basic_map_finalize(bmap
);
3547 isl_basic_map_free(bmap
);
3551 /* Add a constraints to "bmap" expressing i_pos > o_pos
3553 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3559 i
= isl_basic_map_alloc_inequality(bmap
);
3562 nparam
= isl_basic_map_n_param(bmap
);
3563 n_in
= isl_basic_map_n_in(bmap
);
3564 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3565 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3566 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3567 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3568 return isl_basic_map_finalize(bmap
);
3570 isl_basic_map_free(bmap
);
3574 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3576 static __isl_give isl_basic_map
*var_more_or_equal(
3577 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3583 i
= isl_basic_map_alloc_inequality(bmap
);
3586 nparam
= isl_basic_map_n_param(bmap
);
3587 n_in
= isl_basic_map_n_in(bmap
);
3588 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3589 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3590 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3591 return isl_basic_map_finalize(bmap
);
3593 isl_basic_map_free(bmap
);
3597 __isl_give isl_basic_map
*isl_basic_map_equal(
3598 __isl_take isl_space
*dim
, unsigned n_equal
)
3601 struct isl_basic_map
*bmap
;
3602 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3605 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3606 bmap
= var_equal(bmap
, i
);
3607 return isl_basic_map_finalize(bmap
);
3610 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3612 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3616 struct isl_basic_map
*bmap
;
3617 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3620 for (i
= 0; i
< pos
&& bmap
; ++i
)
3621 bmap
= var_equal(bmap
, i
);
3623 bmap
= var_less(bmap
, pos
);
3624 return isl_basic_map_finalize(bmap
);
3627 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3629 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3630 __isl_take isl_space
*dim
, unsigned pos
)
3633 isl_basic_map
*bmap
;
3635 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3636 for (i
= 0; i
< pos
; ++i
)
3637 bmap
= var_equal(bmap
, i
);
3638 bmap
= var_less_or_equal(bmap
, pos
);
3639 return isl_basic_map_finalize(bmap
);
3642 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3644 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3648 struct isl_basic_map
*bmap
;
3649 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3652 for (i
= 0; i
< pos
&& bmap
; ++i
)
3653 bmap
= var_equal(bmap
, i
);
3655 bmap
= var_more(bmap
, pos
);
3656 return isl_basic_map_finalize(bmap
);
3659 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3661 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3662 __isl_take isl_space
*dim
, unsigned pos
)
3665 isl_basic_map
*bmap
;
3667 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3668 for (i
= 0; i
< pos
; ++i
)
3669 bmap
= var_equal(bmap
, i
);
3670 bmap
= var_more_or_equal(bmap
, pos
);
3671 return isl_basic_map_finalize(bmap
);
3674 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3675 unsigned n
, int equal
)
3677 struct isl_map
*map
;
3680 if (n
== 0 && equal
)
3681 return isl_map_universe(dims
);
3683 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3685 for (i
= 0; i
+ 1 < n
; ++i
)
3686 map
= isl_map_add_basic_map(map
,
3687 isl_basic_map_less_at(isl_space_copy(dims
), i
));
3690 map
= isl_map_add_basic_map(map
,
3691 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3693 map
= isl_map_add_basic_map(map
,
3694 isl_basic_map_less_at(dims
, n
- 1));
3696 isl_space_free(dims
);
3701 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
3705 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3708 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
3710 return map_lex_lte_first(dim
, n
, 0);
3713 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
3715 return map_lex_lte_first(dim
, n
, 1);
3718 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
3720 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
3723 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
3725 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
3728 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
3729 unsigned n
, int equal
)
3731 struct isl_map
*map
;
3734 if (n
== 0 && equal
)
3735 return isl_map_universe(dims
);
3737 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3739 for (i
= 0; i
+ 1 < n
; ++i
)
3740 map
= isl_map_add_basic_map(map
,
3741 isl_basic_map_more_at(isl_space_copy(dims
), i
));
3744 map
= isl_map_add_basic_map(map
,
3745 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3747 map
= isl_map_add_basic_map(map
,
3748 isl_basic_map_more_at(dims
, n
- 1));
3750 isl_space_free(dims
);
3755 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
3759 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3762 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
3764 return map_lex_gte_first(dim
, n
, 0);
3767 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
3769 return map_lex_gte_first(dim
, n
, 1);
3772 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
3774 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
3777 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
3779 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
3782 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3783 __isl_take isl_set
*set2
)
3786 map
= isl_map_lex_le(isl_set_get_space(set1
));
3787 map
= isl_map_intersect_domain(map
, set1
);
3788 map
= isl_map_intersect_range(map
, set2
);
3792 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3793 __isl_take isl_set
*set2
)
3796 map
= isl_map_lex_lt(isl_set_get_space(set1
));
3797 map
= isl_map_intersect_domain(map
, set1
);
3798 map
= isl_map_intersect_range(map
, set2
);
3802 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3803 __isl_take isl_set
*set2
)
3806 map
= isl_map_lex_ge(isl_set_get_space(set1
));
3807 map
= isl_map_intersect_domain(map
, set1
);
3808 map
= isl_map_intersect_range(map
, set2
);
3812 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3813 __isl_take isl_set
*set2
)
3816 map
= isl_map_lex_gt(isl_set_get_space(set1
));
3817 map
= isl_map_intersect_domain(map
, set1
);
3818 map
= isl_map_intersect_range(map
, set2
);
3822 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3823 __isl_take isl_map
*map2
)
3826 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
3827 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3828 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3832 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3833 __isl_take isl_map
*map2
)
3836 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
3837 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3838 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3842 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3843 __isl_take isl_map
*map2
)
3846 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
3847 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3848 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3852 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3853 __isl_take isl_map
*map2
)
3856 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
3857 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3858 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3862 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
3863 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
3865 struct isl_basic_map
*bmap
;
3867 bset
= isl_basic_set_cow(bset
);
3871 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
3872 isl_space_free(bset
->dim
);
3873 bmap
= (struct isl_basic_map
*) bset
;
3875 return isl_basic_map_finalize(bmap
);
3877 isl_basic_set_free(bset
);
3878 isl_space_free(dim
);
3882 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3886 if (bmap
->dim
->n_in
== 0)
3887 return (struct isl_basic_set
*)bmap
;
3888 bmap
= isl_basic_map_cow(bmap
);
3891 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
3894 bmap
= isl_basic_map_finalize(bmap
);
3895 return (struct isl_basic_set
*)bmap
;
3897 isl_basic_map_free(bmap
);
3901 /* For a div d = floor(f/m), add the constraints
3904 * -(f-(n-1)) + m d >= 0
3906 * Note that the second constraint is the negation of
3910 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3911 unsigned pos
, isl_int
*div
)
3914 unsigned total
= isl_basic_map_total_dim(bmap
);
3916 i
= isl_basic_map_alloc_inequality(bmap
);
3919 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3920 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3922 j
= isl_basic_map_alloc_inequality(bmap
);
3925 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3926 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3927 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3931 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3932 unsigned pos
, isl_int
*div
)
3934 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3938 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3940 unsigned total
= isl_basic_map_total_dim(bmap
);
3941 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3943 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3947 struct isl_basic_set
*isl_basic_map_underlying_set(
3948 struct isl_basic_map
*bmap
)
3952 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3954 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3955 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3956 return (struct isl_basic_set
*)bmap
;
3957 bmap
= isl_basic_map_cow(bmap
);
3960 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
3963 bmap
->extra
-= bmap
->n_div
;
3965 bmap
= isl_basic_map_finalize(bmap
);
3966 return (struct isl_basic_set
*)bmap
;
3971 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3972 __isl_take isl_basic_set
*bset
)
3974 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3977 struct isl_basic_map
*isl_basic_map_overlying_set(
3978 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3980 struct isl_basic_map
*bmap
;
3981 struct isl_ctx
*ctx
;
3988 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3989 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3990 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3992 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3993 isl_basic_map_free(like
);
3994 return (struct isl_basic_map
*)bset
;
3996 bset
= isl_basic_set_cow(bset
);
3999 total
= bset
->dim
->n_out
+ bset
->extra
;
4000 bmap
= (struct isl_basic_map
*)bset
;
4001 isl_space_free(bmap
->dim
);
4002 bmap
->dim
= isl_space_copy(like
->dim
);
4005 bmap
->n_div
= like
->n_div
;
4006 bmap
->extra
+= like
->n_div
;
4010 ltotal
= total
- bmap
->extra
+ like
->extra
;
4013 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4014 bmap
->extra
* (1 + 1 + total
));
4015 if (isl_blk_is_error(bmap
->block2
))
4017 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4021 for (i
= 0; i
< bmap
->extra
; ++i
)
4022 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4023 for (i
= 0; i
< like
->n_div
; ++i
) {
4024 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4025 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4027 bmap
= isl_basic_map_extend_constraints(bmap
,
4028 0, 2 * like
->n_div
);
4029 for (i
= 0; i
< like
->n_div
; ++i
) {
4030 if (isl_int_is_zero(bmap
->div
[i
][0]))
4032 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4036 isl_basic_map_free(like
);
4037 bmap
= isl_basic_map_simplify(bmap
);
4038 bmap
= isl_basic_map_finalize(bmap
);
4041 isl_basic_map_free(like
);
4042 isl_basic_set_free(bset
);
4046 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4047 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4049 return (struct isl_basic_set
*)
4050 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4053 struct isl_set
*isl_set_from_underlying_set(
4054 struct isl_set
*set
, struct isl_basic_set
*like
)
4060 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4062 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4063 isl_basic_set_free(like
);
4066 set
= isl_set_cow(set
);
4069 for (i
= 0; i
< set
->n
; ++i
) {
4070 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4071 isl_basic_set_copy(like
));
4075 isl_space_free(set
->dim
);
4076 set
->dim
= isl_space_copy(like
->dim
);
4079 isl_basic_set_free(like
);
4082 isl_basic_set_free(like
);
4087 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4091 map
= isl_map_cow(map
);
4094 map
->dim
= isl_space_cow(map
->dim
);
4098 for (i
= 1; i
< map
->n
; ++i
)
4099 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4101 for (i
= 0; i
< map
->n
; ++i
) {
4102 map
->p
[i
] = (struct isl_basic_map
*)
4103 isl_basic_map_underlying_set(map
->p
[i
]);
4108 map
->dim
= isl_space_underlying(map
->dim
, 0);
4110 isl_space_free(map
->dim
);
4111 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4115 return (struct isl_set
*)map
;
4121 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4123 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4126 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4127 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4129 bmap
= isl_basic_map_cow(bmap
);
4133 isl_space_free(bmap
->dim
);
4136 bmap
= isl_basic_map_finalize(bmap
);
4140 isl_basic_map_free(bmap
);
4141 isl_space_free(dim
);
4145 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4146 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4148 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4152 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4153 __isl_take isl_space
*dim
)
4157 map
= isl_map_cow(map
);
4161 for (i
= 0; i
< map
->n
; ++i
) {
4162 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4163 isl_space_copy(dim
));
4167 isl_space_free(map
->dim
);
4173 isl_space_free(dim
);
4177 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4178 __isl_take isl_space
*dim
)
4180 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4183 /* Compute the parameter domain of the given basic set.
4185 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4190 if (isl_basic_set_is_params(bset
))
4193 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4194 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4195 space
= isl_basic_set_get_space(bset
);
4196 space
= isl_space_params(space
);
4197 bset
= isl_basic_set_reset_space(bset
, space
);
4201 /* Compute the parameter domain of the given set.
4203 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4208 if (isl_set_is_params(set
))
4211 n
= isl_set_dim(set
, isl_dim_set
);
4212 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4213 space
= isl_set_get_space(set
);
4214 space
= isl_space_params(space
);
4215 set
= isl_set_reset_space(set
, space
);
4219 /* Construct a zero-dimensional set with the given parameter domain.
4221 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4224 space
= isl_set_get_space(set
);
4225 space
= isl_space_set_from_params(space
);
4226 set
= isl_set_reset_space(set
, space
);
4230 /* Compute the parameter domain of the given map.
4232 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4237 n
= isl_map_dim(map
, isl_dim_in
);
4238 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4239 n
= isl_map_dim(map
, isl_dim_out
);
4240 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4241 space
= isl_map_get_space(map
);
4242 space
= isl_space_params(space
);
4243 map
= isl_map_reset_space(map
, space
);
4247 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4250 struct isl_basic_set
*domain
;
4256 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4258 n_in
= isl_basic_map_n_in(bmap
);
4259 n_out
= isl_basic_map_n_out(bmap
);
4260 domain
= isl_basic_set_from_basic_map(bmap
);
4261 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4263 domain
= isl_basic_set_reset_space(domain
, dim
);
4268 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4272 return isl_space_may_be_set(bmap
->dim
);
4275 /* Is this basic map actually a set?
4276 * Users should never call this function. Outside of isl,
4277 * the type should indicate whether something is a set or a map.
4279 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4283 return isl_space_is_set(bmap
->dim
);
4286 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4290 if (isl_basic_map_is_set(bmap
))
4292 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4295 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4296 __isl_take isl_basic_map
*bmap
)
4300 isl_basic_map
*domain
;
4301 int nparam
, n_in
, n_out
;
4304 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4305 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4306 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4308 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4309 domain
= isl_basic_map_universe(dim
);
4311 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4312 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4313 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4315 total
= isl_basic_map_total_dim(bmap
);
4317 for (i
= 0; i
< n_in
; ++i
) {
4318 k
= isl_basic_map_alloc_equality(bmap
);
4321 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4322 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4323 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4326 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4327 return isl_basic_map_finalize(bmap
);
4329 isl_basic_map_free(bmap
);
4333 __isl_give isl_basic_map
*isl_basic_map_range_map(
4334 __isl_take isl_basic_map
*bmap
)
4338 isl_basic_map
*range
;
4339 int nparam
, n_in
, n_out
;
4342 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4343 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4344 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4346 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4347 range
= isl_basic_map_universe(dim
);
4349 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4350 bmap
= isl_basic_map_apply_range(bmap
, range
);
4351 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4353 total
= isl_basic_map_total_dim(bmap
);
4355 for (i
= 0; i
< n_out
; ++i
) {
4356 k
= isl_basic_map_alloc_equality(bmap
);
4359 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4360 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4361 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4364 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4365 return isl_basic_map_finalize(bmap
);
4367 isl_basic_map_free(bmap
);
4371 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4375 return isl_space_may_be_set(map
->dim
);
4378 /* Is this map actually a set?
4379 * Users should never call this function. Outside of isl,
4380 * the type should indicate whether something is a set or a map.
4382 int isl_map_is_set(__isl_keep isl_map
*map
)
4386 return isl_space_is_set(map
->dim
);
4389 struct isl_set
*isl_map_range(struct isl_map
*map
)
4392 struct isl_set
*set
;
4396 if (isl_map_is_set(map
))
4397 return (isl_set
*)map
;
4399 map
= isl_map_cow(map
);
4403 set
= (struct isl_set
*) map
;
4404 set
->dim
= isl_space_range(set
->dim
);
4407 for (i
= 0; i
< map
->n
; ++i
) {
4408 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4412 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4413 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4420 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4423 isl_space
*domain_dim
;
4425 map
= isl_map_cow(map
);
4429 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4430 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4431 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4434 for (i
= 0; i
< map
->n
; ++i
) {
4435 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4439 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4440 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4447 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4450 isl_space
*range_dim
;
4452 map
= isl_map_cow(map
);
4456 range_dim
= isl_space_range(isl_map_get_space(map
));
4457 range_dim
= isl_space_from_range(range_dim
);
4458 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4459 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4462 for (i
= 0; i
< map
->n
; ++i
) {
4463 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4467 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4468 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4475 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4476 __isl_take isl_space
*dim
)
4479 struct isl_map
*map
= NULL
;
4481 set
= isl_set_cow(set
);
4484 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4485 map
= (struct isl_map
*)set
;
4486 for (i
= 0; i
< set
->n
; ++i
) {
4487 map
->p
[i
] = isl_basic_map_from_basic_set(
4488 set
->p
[i
], isl_space_copy(dim
));
4492 isl_space_free(map
->dim
);
4496 isl_space_free(dim
);
4501 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4502 __isl_take isl_basic_set
*bset
)
4504 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4507 __isl_give isl_basic_map
*isl_basic_map_from_range(
4508 __isl_take isl_basic_set
*bset
)
4511 space
= isl_basic_set_get_space(bset
);
4512 space
= isl_space_from_range(space
);
4513 bset
= isl_basic_set_reset_space(bset
, space
);
4514 return (isl_basic_map
*)bset
;
4517 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4520 space
= isl_set_get_space(set
);
4521 space
= isl_space_from_range(space
);
4522 set
= isl_set_reset_space(set
, space
);
4523 return (struct isl_map
*)set
;
4526 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4528 return isl_map_reverse(isl_map_from_range(set
));
4531 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4532 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4534 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4537 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4538 __isl_take isl_set
*range
)
4540 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4543 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4546 struct isl_set
*set
= NULL
;
4550 map
= isl_map_cow(map
);
4553 map
->dim
= isl_space_as_set_space(map
->dim
);
4556 set
= (struct isl_set
*)map
;
4557 for (i
= 0; i
< map
->n
; ++i
) {
4558 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4568 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4571 struct isl_map
*map
;
4576 isl_die(dim
->ctx
, isl_error_internal
,
4577 "negative number of basic maps", goto error
);
4578 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4579 sizeof(struct isl_map
) +
4580 (n
- 1) * sizeof(struct isl_basic_map
*));
4584 map
->ctx
= dim
->ctx
;
4585 isl_ctx_ref(map
->ctx
);
4593 isl_space_free(dim
);
4597 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4598 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4601 struct isl_map
*map
;
4604 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4608 map
= isl_map_alloc_space(dims
, n
, flags
);
4612 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4614 struct isl_basic_map
*bmap
;
4615 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4616 bmap
= isl_basic_map_set_to_empty(bmap
);
4620 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4622 struct isl_basic_set
*bset
;
4623 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4624 bset
= isl_basic_set_set_to_empty(bset
);
4628 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4630 struct isl_basic_map
*bmap
;
4633 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4634 bmap
= isl_basic_map_set_to_empty(bmap
);
4638 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4640 struct isl_basic_map
*bmap
;
4643 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4644 bmap
= isl_basic_map_set_to_empty(bmap
);
4648 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4650 struct isl_basic_set
*bset
;
4653 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4654 bset
= isl_basic_set_set_to_empty(bset
);
4658 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4660 struct isl_basic_map
*bmap
;
4661 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4662 bmap
= isl_basic_map_finalize(bmap
);
4666 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
4668 struct isl_basic_set
*bset
;
4669 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
4670 bset
= isl_basic_set_finalize(bset
);
4674 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
4677 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
4678 isl_basic_map
*bmap
;
4680 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
4681 for (i
= 0; i
< total
; ++i
) {
4682 int k
= isl_basic_map_alloc_inequality(bmap
);
4685 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4686 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4690 isl_basic_map_free(bmap
);
4694 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
4696 return isl_basic_map_nat_universe(dim
);
4699 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
4701 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4704 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
4706 return isl_map_nat_universe(dim
);
4709 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4710 __isl_keep isl_basic_map
*model
)
4714 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4717 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4721 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4724 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4725 __isl_keep isl_set
*model
)
4729 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4732 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
4734 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4737 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4741 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4744 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4748 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4751 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
4753 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4756 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4760 return isl_set_empty(isl_space_copy(model
->dim
));
4763 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
4765 struct isl_map
*map
;
4768 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
4769 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4773 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
4775 struct isl_set
*set
;
4778 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
4779 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4783 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4787 return isl_set_universe(isl_space_copy(model
->dim
));
4790 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4793 struct isl_map
*dup
;
4797 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
4798 for (i
= 0; i
< map
->n
; ++i
)
4799 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4803 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4804 __isl_take isl_basic_map
*bmap
)
4808 if (isl_basic_map_plain_is_empty(bmap
)) {
4809 isl_basic_map_free(bmap
);
4812 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
4813 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4814 map
->p
[map
->n
] = bmap
;
4816 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4822 isl_basic_map_free(bmap
);
4826 void isl_map_free(struct isl_map
*map
)
4836 isl_ctx_deref(map
->ctx
);
4837 for (i
= 0; i
< map
->n
; ++i
)
4838 isl_basic_map_free(map
->p
[i
]);
4839 isl_space_free(map
->dim
);
4843 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4844 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4848 base
= isl_map_cow(base
);
4852 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
4855 for (i
= 0; i
< base
->n
; ++i
) {
4856 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
4857 isl_space_copy(base
->dim
), 0, 0, 0);
4867 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4868 unsigned nparam
, unsigned dim
)
4870 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4874 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4875 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4879 bmap
= isl_basic_map_cow(bmap
);
4880 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4881 j
= isl_basic_map_alloc_equality(bmap
);
4884 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4885 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4886 isl_int_set_si(bmap
->eq
[j
][0], value
);
4887 bmap
= isl_basic_map_simplify(bmap
);
4888 return isl_basic_map_finalize(bmap
);
4890 isl_basic_map_free(bmap
);
4894 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4895 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4899 bmap
= isl_basic_map_cow(bmap
);
4900 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4901 j
= isl_basic_map_alloc_equality(bmap
);
4904 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4905 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4906 isl_int_set(bmap
->eq
[j
][0], value
);
4907 bmap
= isl_basic_map_simplify(bmap
);
4908 return isl_basic_map_finalize(bmap
);
4910 isl_basic_map_free(bmap
);
4914 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4915 enum isl_dim_type type
, unsigned pos
, int value
)
4919 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4920 return isl_basic_map_fix_pos_si(bmap
,
4921 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4923 isl_basic_map_free(bmap
);
4927 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4928 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4932 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4933 return isl_basic_map_fix_pos(bmap
,
4934 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4936 isl_basic_map_free(bmap
);
4940 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4941 enum isl_dim_type type
, unsigned pos
, int value
)
4943 return (struct isl_basic_set
*)
4944 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4948 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4949 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4951 return (struct isl_basic_set
*)
4952 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4956 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4957 unsigned input
, int value
)
4959 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4962 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4963 unsigned dim
, int value
)
4965 return (struct isl_basic_set
*)
4966 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4967 isl_dim_set
, dim
, value
);
4970 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
4972 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
4979 isl_basic_map_free(map
->p
[i
]);
4980 if (i
!= map
->n
- 1) {
4981 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4982 map
->p
[i
] = map
->p
[map
->n
- 1];
4989 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4990 enum isl_dim_type type
, unsigned pos
, int value
)
4994 map
= isl_map_cow(map
);
4998 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4999 for (i
= map
->n
- 1; i
>= 0; --i
) {
5000 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5001 if (remove_if_empty(map
, i
) < 0)
5004 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5011 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5012 enum isl_dim_type type
, unsigned pos
, int value
)
5014 return (struct isl_set
*)
5015 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5018 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5019 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5023 map
= isl_map_cow(map
);
5027 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5028 for (i
= 0; i
< map
->n
; ++i
) {
5029 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5033 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5040 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5041 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5043 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5046 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5047 unsigned input
, int value
)
5049 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5052 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5054 return (struct isl_set
*)
5055 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5058 static __isl_give isl_basic_map
*basic_map_bound_si(
5059 __isl_take isl_basic_map
*bmap
,
5060 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5066 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5067 pos
+= isl_basic_map_offset(bmap
, type
);
5068 bmap
= isl_basic_map_cow(bmap
);
5069 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5070 j
= isl_basic_map_alloc_inequality(bmap
);
5073 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5075 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5076 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5078 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5079 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5081 bmap
= isl_basic_map_simplify(bmap
);
5082 return isl_basic_map_finalize(bmap
);
5084 isl_basic_map_free(bmap
);
5088 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5089 __isl_take isl_basic_map
*bmap
,
5090 enum isl_dim_type type
, unsigned pos
, int value
)
5092 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5095 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5096 unsigned dim
, isl_int value
)
5100 bset
= isl_basic_set_cow(bset
);
5101 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5102 j
= isl_basic_set_alloc_inequality(bset
);
5105 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5106 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5107 isl_int_neg(bset
->ineq
[j
][0], value
);
5108 bset
= isl_basic_set_simplify(bset
);
5109 return isl_basic_set_finalize(bset
);
5111 isl_basic_set_free(bset
);
5115 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5116 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5120 map
= isl_map_cow(map
);
5124 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5125 for (i
= 0; i
< map
->n
; ++i
) {
5126 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5127 type
, pos
, value
, upper
);
5131 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5138 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5139 enum isl_dim_type type
, unsigned pos
, int value
)
5141 return map_bound_si(map
, type
, pos
, value
, 0);
5144 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5145 enum isl_dim_type type
, unsigned pos
, int value
)
5147 return map_bound_si(map
, type
, pos
, value
, 1);
5150 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5151 enum isl_dim_type type
, unsigned pos
, int value
)
5153 return (struct isl_set
*)
5154 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5157 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5158 enum isl_dim_type type
, unsigned pos
, int value
)
5160 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5163 /* Bound the given variable of "bmap" from below (or above is "upper"
5164 * is set) to "value".
5166 static __isl_give isl_basic_map
*basic_map_bound(
5167 __isl_take isl_basic_map
*bmap
,
5168 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5174 if (pos
>= isl_basic_map_dim(bmap
, type
))
5175 isl_die(bmap
->ctx
, isl_error_invalid
,
5176 "index out of bounds", goto error
);
5177 pos
+= isl_basic_map_offset(bmap
, type
);
5178 bmap
= isl_basic_map_cow(bmap
);
5179 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5180 j
= isl_basic_map_alloc_inequality(bmap
);
5183 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5185 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5186 isl_int_set(bmap
->ineq
[j
][0], value
);
5188 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5189 isl_int_neg(bmap
->ineq
[j
][0], value
);
5191 bmap
= isl_basic_map_simplify(bmap
);
5192 return isl_basic_map_finalize(bmap
);
5194 isl_basic_map_free(bmap
);
5198 /* Bound the given variable of "map" from below (or above is "upper"
5199 * is set) to "value".
5201 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5202 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5206 map
= isl_map_cow(map
);
5210 if (pos
>= isl_map_dim(map
, type
))
5211 isl_die(map
->ctx
, isl_error_invalid
,
5212 "index out of bounds", goto error
);
5213 for (i
= map
->n
- 1; i
>= 0; --i
) {
5214 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5215 if (remove_if_empty(map
, i
) < 0)
5218 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5225 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5226 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5228 return map_bound(map
, type
, pos
, value
, 0);
5231 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5232 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5234 return map_bound(map
, type
, pos
, value
, 1);
5237 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5238 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5240 return isl_map_lower_bound(set
, type
, pos
, value
);
5243 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5244 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5246 return isl_map_upper_bound(set
, type
, pos
, value
);
5249 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5254 set
= isl_set_cow(set
);
5258 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5259 for (i
= 0; i
< set
->n
; ++i
) {
5260 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5270 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5274 map
= isl_map_cow(map
);
5278 map
->dim
= isl_space_reverse(map
->dim
);
5281 for (i
= 0; i
< map
->n
; ++i
) {
5282 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5286 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5293 static struct isl_map
*isl_basic_map_partial_lexopt(
5294 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5295 struct isl_set
**empty
, int max
)
5299 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5300 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5302 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5304 isl_basic_map_free(bmap
);
5305 isl_basic_set_free(dom
);
5311 struct isl_map
*isl_basic_map_partial_lexmax(
5312 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5313 struct isl_set
**empty
)
5315 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5318 struct isl_map
*isl_basic_map_partial_lexmin(
5319 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5320 struct isl_set
**empty
)
5322 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5325 struct isl_set
*isl_basic_set_partial_lexmin(
5326 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5327 struct isl_set
**empty
)
5329 return (struct isl_set
*)
5330 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5334 struct isl_set
*isl_basic_set_partial_lexmax(
5335 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5336 struct isl_set
**empty
)
5338 return (struct isl_set
*)
5339 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5343 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5344 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5345 __isl_give isl_set
**empty
)
5347 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5350 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5351 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5352 __isl_give isl_set
**empty
)
5354 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5357 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5358 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5359 __isl_give isl_set
**empty
)
5361 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5364 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5365 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5366 __isl_give isl_set
**empty
)
5368 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5371 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5372 __isl_take isl_basic_map
*bmap
, int max
)
5374 isl_basic_set
*dom
= NULL
;
5375 isl_space
*dom_space
;
5379 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5380 dom
= isl_basic_set_universe(dom_space
);
5381 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5383 isl_basic_map_free(bmap
);
5387 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5388 __isl_take isl_basic_map
*bmap
)
5390 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5393 /* Given a basic map "bmap", compute the lexicographically minimal
5394 * (or maximal) image element for each domain element in dom.
5395 * Set *empty to those elements in dom that do not have an image element.
5397 * We first make sure the basic sets in dom are disjoint and then
5398 * simply collect the results over each of the basic sets separately.
5399 * We could probably improve the efficiency a bit by moving the union
5400 * domain down into the parametric integer programming.
5402 static __isl_give isl_map
*basic_map_partial_lexopt(
5403 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
5404 __isl_give isl_set
**empty
, int max
)
5407 struct isl_map
*res
;
5409 dom
= isl_set_make_disjoint(dom
);
5413 if (isl_set_plain_is_empty(dom
)) {
5414 res
= isl_map_empty_like_basic_map(bmap
);
5415 *empty
= isl_set_empty_like(dom
);
5417 isl_basic_map_free(bmap
);
5421 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
5422 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
5424 for (i
= 1; i
< dom
->n
; ++i
) {
5425 struct isl_map
*res_i
;
5426 struct isl_set
*empty_i
;
5428 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
5429 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
5431 res
= isl_map_union_disjoint(res
, res_i
);
5432 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
5436 isl_basic_map_free(bmap
);
5441 isl_basic_map_free(bmap
);
5445 /* Given a map "map", compute the lexicographically minimal
5446 * (or maximal) image element for each domain element in dom.
5447 * Set *empty to those elements in dom that do not have an image element.
5449 * We first compute the lexicographically minimal or maximal element
5450 * in the first basic map. This results in a partial solution "res"
5451 * and a subset "todo" of dom that still need to be handled.
5452 * We then consider each of the remaining maps in "map" and successively
5453 * improve both "res" and "todo".
5455 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5456 * Assume we are computing the lexicographical maximum.
5457 * We first compute the lexicographically maximal element in basic map i.
5458 * This results in a partial solution res_i and a subset todo_i.
5459 * Then we combine these results with those obtain for the first k basic maps
5460 * to obtain a result that is valid for the first k+1 basic maps.
5461 * In particular, the set where there is no solution is the set where
5462 * there is no solution for the first k basic maps and also no solution
5463 * for the ith basic map, i.e.,
5465 * todo^i = todo^k * todo_i
5467 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5468 * solutions, arbitrarily breaking ties in favor of res^k.
5469 * That is, when res^k(a) >= res_i(a), we pick res^k and
5470 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5471 * the lexicographic order.)
5472 * In practice, we compute
5474 * res^k * (res_i . "<=")
5478 * res_i * (res^k . "<")
5480 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5481 * where only one of res^k and res_i provides a solution and we simply pick
5488 * Note that we only compute these intersections when dom(res^k) intersects
5489 * dom(res_i). Otherwise, the only effect of these intersections is to
5490 * potentially break up res^k and res_i into smaller pieces.
5491 * We want to avoid such splintering as much as possible.
5492 * In fact, an earlier implementation of this function would look for
5493 * better results in the domain of res^k and for extra results in todo^k,
5494 * but this would always result in a splintering according to todo^k,
5495 * even when the domain of basic map i is disjoint from the domains of
5496 * the previous basic maps.
5498 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5499 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5500 __isl_give isl_set
**empty
, int max
)
5503 struct isl_map
*res
;
5504 struct isl_set
*todo
;
5509 if (isl_map_plain_is_empty(map
)) {
5517 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5518 isl_set_copy(dom
), &todo
, max
);
5520 for (i
= 1; i
< map
->n
; ++i
) {
5524 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5526 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5527 isl_set_copy(dom
), &todo_i
, max
);
5530 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5531 le
= isl_map_lex_le(dim
);
5533 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5534 le
= isl_map_lex_ge(dim
);
5536 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5537 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5538 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5539 le
= isl_map_intersect(le
, isl_map_copy(res
));
5541 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5542 res
= isl_map_intersect_domain(res
,
5543 isl_set_copy(todo_i
));
5544 res_i
= isl_map_intersect_domain(res_i
,
5545 isl_set_copy(todo
));
5548 res
= isl_map_union_disjoint(res
, res_i
);
5549 res
= isl_map_union_disjoint(res
, lt
);
5550 res
= isl_map_union_disjoint(res
, le
);
5552 todo
= isl_set_intersect(todo
, todo_i
);
5572 /* Given a map "map", compute the lexicographically minimal
5573 * (or maximal) image element for each domain element in dom.
5574 * Set *empty to those elements in dom that do not have an image element.
5576 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5578 static __isl_give isl_map
*isl_map_partial_lexopt(
5579 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5580 __isl_give isl_set
**empty
, int max
)
5584 if (isl_space_match(map
->dim
, isl_dim_param
, dom
->dim
, isl_dim_param
))
5585 return isl_map_partial_lexopt_aligned(map
, dom
, empty
, max
);
5586 if (!isl_space_has_named_params(map
->dim
) ||
5587 !isl_space_has_named_params(dom
->dim
))
5588 isl_die(map
->ctx
, isl_error_invalid
,
5589 "unaligned unnamed parameters", goto error
);
5590 map
= isl_map_align_params(map
, isl_map_get_space(dom
));
5591 dom
= isl_map_align_params(dom
, isl_map_get_space(map
));
5592 return isl_map_partial_lexopt_aligned(map
, dom
, empty
, max
);
5601 __isl_give isl_map
*isl_map_partial_lexmax(
5602 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5603 __isl_give isl_set
**empty
)
5605 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5608 __isl_give isl_map
*isl_map_partial_lexmin(
5609 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5610 __isl_give isl_set
**empty
)
5612 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5615 __isl_give isl_set
*isl_set_partial_lexmin(
5616 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5617 __isl_give isl_set
**empty
)
5619 return (struct isl_set
*)
5620 isl_map_partial_lexmin((struct isl_map
*)set
,
5624 __isl_give isl_set
*isl_set_partial_lexmax(
5625 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5626 __isl_give isl_set
**empty
)
5628 return (struct isl_set
*)
5629 isl_map_partial_lexmax((struct isl_map
*)set
,
5633 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5635 struct isl_basic_set
*dom
= NULL
;
5640 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5641 dom
= isl_basic_set_universe(dom_dim
);
5642 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5644 isl_basic_map_free(bmap
);
5648 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5650 return isl_basic_map_lexopt(bmap
, 0);
5653 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5655 return isl_basic_map_lexopt(bmap
, 1);
5658 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5660 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
5663 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
5665 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
5668 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
5670 struct isl_set
*dom
= NULL
;
5675 dom_dim
= isl_space_domain(isl_space_copy(map
->dim
));
5676 dom
= isl_set_universe(dom_dim
);
5677 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
5683 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
5685 return isl_map_lexopt(map
, 0);
5688 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
5690 return isl_map_lexopt(map
, 1);
5693 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5695 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5698 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5700 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5703 /* Extract the first and only affine expression from list
5704 * and then add it to *pwaff with the given dom.
5705 * This domain is known to be disjoint from other domains
5706 * because of the way isl_basic_map_foreach_lexmax works.
5708 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
5709 __isl_take isl_aff_list
*list
, void *user
)
5711 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
5713 isl_pw_aff
**pwaff
= user
;
5714 isl_pw_aff
*pwaff_i
;
5716 if (isl_aff_list_n_aff(list
) != 1)
5717 isl_die(ctx
, isl_error_internal
,
5718 "expecting single element list", goto error
);
5720 aff
= isl_aff_list_get_aff(list
, 0);
5721 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
5723 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
5725 isl_aff_list_free(list
);
5729 isl_basic_set_free(dom
);
5730 isl_aff_list_free(list
);
5734 /* Given a basic map with one output dimension, compute the minimum or
5735 * maximum of that dimension as an isl_pw_aff.
5737 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5738 * call update_dim_opt on each leaf of the result.
5740 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
5743 isl_space
*dim
= isl_basic_map_get_space(bmap
);
5747 dim
= isl_space_from_domain(isl_space_domain(dim
));
5748 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
5749 pwaff
= isl_pw_aff_empty(dim
);
5751 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
5753 return isl_pw_aff_free(pwaff
);
5758 /* Compute the minimum or maximum of the given output dimension
5759 * as a function of the parameters and the input dimensions,
5760 * but independently of the other output dimensions.
5762 * We first project out the other output dimension and then compute
5763 * the "lexicographic" maximum in each basic map, combining the results
5764 * using isl_pw_aff_union_max.
5766 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
5773 n_out
= isl_map_dim(map
, isl_dim_out
);
5774 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
5775 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
5780 isl_space
*dim
= isl_map_get_space(map
);
5781 dim
= isl_space_domain(isl_space_from_range(dim
));
5783 return isl_pw_aff_empty(dim
);
5786 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
5787 for (i
= 1; i
< map
->n
; ++i
) {
5788 isl_pw_aff
*pwaff_i
;
5790 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
5791 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
5799 /* Compute the maximum of the given output dimension as a function of the
5800 * parameters and input dimensions, but independently of
5801 * the other output dimensions.
5803 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
5805 return map_dim_opt(map
, pos
, 1);
5808 /* Compute the minimum or maximum of the given set dimension
5809 * as a function of the parameters,
5810 * but independently of the other set dimensions.
5812 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
5815 return map_dim_opt(set
, pos
, max
);
5818 /* Compute the maximum of the given set dimension as a function of the
5819 * parameters, but independently of the other set dimensions.
5821 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
5823 return set_dim_opt(set
, pos
, 1);
5826 /* Compute the minimum of the given set dimension as a function of the
5827 * parameters, but independently of the other set dimensions.
5829 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
5831 return set_dim_opt(set
, pos
, 0);
5834 /* Apply a preimage specified by "mat" on the parameters of "bset".
5835 * bset is assumed to have only parameters and divs.
5837 static struct isl_basic_set
*basic_set_parameter_preimage(
5838 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
5845 bset
->dim
= isl_space_cow(bset
->dim
);
5849 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5851 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5853 bset
->dim
->nparam
= 0;
5854 bset
->dim
->n_out
= nparam
;
5855 bset
= isl_basic_set_preimage(bset
, mat
);
5857 bset
->dim
->nparam
= bset
->dim
->n_out
;
5858 bset
->dim
->n_out
= 0;
5863 isl_basic_set_free(bset
);
5867 /* Apply a preimage specified by "mat" on the parameters of "set".
5868 * set is assumed to have only parameters and divs.
5870 static struct isl_set
*set_parameter_preimage(
5871 struct isl_set
*set
, struct isl_mat
*mat
)
5873 isl_space
*dim
= NULL
;
5879 dim
= isl_space_copy(set
->dim
);
5880 dim
= isl_space_cow(dim
);
5884 nparam
= isl_set_dim(set
, isl_dim_param
);
5886 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5889 dim
->n_out
= nparam
;
5890 isl_set_reset_space(set
, dim
);
5891 set
= isl_set_preimage(set
, mat
);
5894 dim
= isl_space_copy(set
->dim
);
5895 dim
= isl_space_cow(dim
);
5898 dim
->nparam
= dim
->n_out
;
5900 isl_set_reset_space(set
, dim
);
5903 isl_space_free(dim
);
5910 /* Intersect the basic set "bset" with the affine space specified by the
5911 * equalities in "eq".
5913 static struct isl_basic_set
*basic_set_append_equalities(
5914 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5922 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
5927 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
5928 for (i
= 0; i
< eq
->n_row
; ++i
) {
5929 k
= isl_basic_set_alloc_equality(bset
);
5932 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5933 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5937 bset
= isl_basic_set_gauss(bset
, NULL
);
5938 bset
= isl_basic_set_finalize(bset
);
5943 isl_basic_set_free(bset
);
5947 /* Intersect the set "set" with the affine space specified by the
5948 * equalities in "eq".
5950 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5958 for (i
= 0; i
< set
->n
; ++i
) {
5959 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5972 /* Project the given basic set onto its parameter domain, possibly introducing
5973 * new, explicit, existential variables in the constraints.
5974 * The input has parameters and (possibly implicit) existential variables.
5975 * The output has the same parameters, but only
5976 * explicit existentially quantified variables.
5978 * The actual projection is performed by pip, but pip doesn't seem
5979 * to like equalities very much, so we first remove the equalities
5980 * among the parameters by performing a variable compression on
5981 * the parameters. Afterward, an inverse transformation is performed
5982 * and the equalities among the parameters are inserted back in.
5984 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5988 struct isl_mat
*T
, *T2
;
5989 struct isl_set
*set
;
5990 unsigned nparam
, n_div
;
5992 bset
= isl_basic_set_cow(bset
);
5996 if (bset
->n_eq
== 0)
5997 return isl_basic_set_lexmin(bset
);
5999 isl_basic_set_gauss(bset
, NULL
);
6001 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6002 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6004 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6005 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6008 if (i
== bset
->n_eq
)
6009 return isl_basic_set_lexmin(bset
);
6011 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6013 eq
= isl_mat_cow(eq
);
6014 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6015 if (T
&& T
->n_col
== 0) {
6019 bset
= isl_basic_set_set_to_empty(bset
);
6020 return isl_set_from_basic_set(bset
);
6022 bset
= basic_set_parameter_preimage(bset
, T
);
6024 set
= isl_basic_set_lexmin(bset
);
6025 set
= set_parameter_preimage(set
, T2
);
6026 set
= set_append_equalities(set
, eq
);
6030 /* Compute an explicit representation for all the existentially
6031 * quantified variables.
6032 * The input and output dimensions are first turned into parameters.
6033 * compute_divs then returns a map with the same parameters and
6034 * no input or output dimensions and the dimension specification
6035 * is reset to that of the input.
6037 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6039 struct isl_basic_set
*bset
;
6040 struct isl_set
*set
;
6041 struct isl_map
*map
;
6042 isl_space
*dim
, *orig_dim
= NULL
;
6047 bmap
= isl_basic_map_cow(bmap
);
6051 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6052 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6053 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6054 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6058 orig_dim
= bmap
->dim
;
6060 bset
= (struct isl_basic_set
*)bmap
;
6062 set
= parameter_compute_divs(bset
);
6063 map
= (struct isl_map
*)set
;
6064 map
= isl_map_reset_space(map
, orig_dim
);
6068 isl_basic_map_free(bmap
);
6072 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6080 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6081 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6082 if (isl_int_is_zero(bmap
->div
[i
][0]))
6084 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6090 static int map_divs_known(__isl_keep isl_map
*map
)
6097 for (i
= 0; i
< map
->n
; ++i
) {
6098 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6106 /* If bmap contains any unknown divs, then compute explicit
6107 * expressions for them. However, this computation may be
6108 * quite expensive, so first try to remove divs that aren't
6111 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6114 struct isl_map
*map
;
6116 known
= isl_basic_map_divs_known(bmap
);
6120 return isl_map_from_basic_map(bmap
);
6122 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6124 known
= isl_basic_map_divs_known(bmap
);
6128 return isl_map_from_basic_map(bmap
);
6130 map
= compute_divs(bmap
);
6133 isl_basic_map_free(bmap
);
6137 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6141 struct isl_map
*res
;
6148 known
= map_divs_known(map
);
6156 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6157 for (i
= 1 ; i
< map
->n
; ++i
) {
6159 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6160 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6161 res
= isl_map_union_disjoint(res
, r2
);
6163 res
= isl_map_union(res
, r2
);
6170 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6172 return (struct isl_set
*)
6173 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6176 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6178 return (struct isl_set
*)
6179 isl_map_compute_divs((struct isl_map
*)set
);
6182 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6185 struct isl_set
*set
;
6190 map
= isl_map_cow(map
);
6194 set
= (struct isl_set
*)map
;
6195 set
->dim
= isl_space_domain(set
->dim
);
6198 for (i
= 0; i
< map
->n
; ++i
) {
6199 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6203 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6204 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6211 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6212 __isl_take isl_map
*map2
)
6216 struct isl_map
*map
= NULL
;
6230 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6232 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6233 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6234 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6236 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6237 map1
->n
+ map2
->n
, flags
);
6240 for (i
= 0; i
< map1
->n
; ++i
) {
6241 map
= isl_map_add_basic_map(map
,
6242 isl_basic_map_copy(map1
->p
[i
]));
6246 for (i
= 0; i
< map2
->n
; ++i
) {
6247 map
= isl_map_add_basic_map(map
,
6248 isl_basic_map_copy(map2
->p
[i
]));
6262 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6263 __isl_take isl_map
*map2
)
6265 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6268 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6270 map1
= isl_map_union_disjoint(map1
, map2
);
6274 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6278 struct isl_set
*isl_set_union_disjoint(
6279 struct isl_set
*set1
, struct isl_set
*set2
)
6281 return (struct isl_set
*)
6282 isl_map_union_disjoint(
6283 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6286 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6288 return (struct isl_set
*)
6289 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6292 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6293 __isl_take isl_set
*set
)
6296 struct isl_map
*result
;
6302 if (!isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
6303 isl_die(set
->ctx
, isl_error_invalid
,
6304 "parameters don't match", goto error
);
6306 if (isl_space_dim(set
->dim
, isl_dim_set
) != 0 &&
6307 !isl_map_compatible_range(map
, set
))
6308 isl_die(set
->ctx
, isl_error_invalid
,
6309 "incompatible spaces", goto error
);
6311 if (isl_set_plain_is_universe(set
)) {
6316 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6317 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6318 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6320 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6321 map
->n
* set
->n
, flags
);
6324 for (i
= 0; i
< map
->n
; ++i
)
6325 for (j
= 0; j
< set
->n
; ++j
) {
6326 result
= isl_map_add_basic_map(result
,
6327 isl_basic_map_intersect_range(
6328 isl_basic_map_copy(map
->p
[i
]),
6329 isl_basic_set_copy(set
->p
[j
])));
6342 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6343 __isl_take isl_set
*set
)
6345 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6348 struct isl_map
*isl_map_intersect_domain(
6349 struct isl_map
*map
, struct isl_set
*set
)
6351 return isl_map_reverse(
6352 isl_map_intersect_range(isl_map_reverse(map
), set
));
6355 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6356 __isl_take isl_map
*map2
)
6360 map1
= isl_map_reverse(map1
);
6361 map1
= isl_map_apply_range(map1
, map2
);
6362 return isl_map_reverse(map1
);
6369 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6370 __isl_take isl_map
*map2
)
6372 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6375 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6376 __isl_take isl_map
*map2
)
6378 isl_space
*dim_result
;
6379 struct isl_map
*result
;
6385 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6386 isl_space_copy(map2
->dim
));
6388 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6391 for (i
= 0; i
< map1
->n
; ++i
)
6392 for (j
= 0; j
< map2
->n
; ++j
) {
6393 result
= isl_map_add_basic_map(result
,
6394 isl_basic_map_apply_range(
6395 isl_basic_map_copy(map1
->p
[i
]),
6396 isl_basic_map_copy(map2
->p
[j
])));
6402 if (result
&& result
->n
<= 1)
6403 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6411 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6412 __isl_take isl_map
*map2
)
6414 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6418 * returns range - domain
6420 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6422 isl_space
*dims
, *target_dim
;
6423 struct isl_basic_set
*bset
;
6430 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6431 bmap
->dim
, isl_dim_out
),
6433 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6434 dim
= isl_basic_map_n_in(bmap
);
6435 nparam
= isl_basic_map_n_param(bmap
);
6436 bset
= isl_basic_set_from_basic_map(bmap
);
6437 bset
= isl_basic_set_cow(bset
);
6438 dims
= isl_basic_set_get_space(bset
);
6439 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6440 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6441 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6442 for (i
= 0; i
< dim
; ++i
) {
6443 int j
= isl_basic_map_alloc_equality(
6444 (struct isl_basic_map
*)bset
);
6447 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6448 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6449 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6450 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6452 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6453 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6456 isl_basic_map_free(bmap
);
6461 * returns range - domain
6463 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6467 struct isl_set
*result
;
6472 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6473 map
->dim
, isl_dim_out
),
6475 dim
= isl_map_get_space(map
);
6476 dim
= isl_space_domain(dim
);
6477 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6480 for (i
= 0; i
< map
->n
; ++i
)
6481 result
= isl_set_add_basic_set(result
,
6482 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6491 * returns [domain -> range] -> range - domain
6493 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6494 __isl_take isl_basic_map
*bmap
)
6498 isl_basic_map
*domain
;
6502 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6503 isl_die(bmap
->ctx
, isl_error_invalid
,
6504 "domain and range don't match", goto error
);
6506 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6507 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6509 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6510 domain
= isl_basic_map_universe(dim
);
6512 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6513 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6514 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6516 total
= isl_basic_map_total_dim(bmap
);
6518 for (i
= 0; i
< n
; ++i
) {
6519 k
= isl_basic_map_alloc_equality(bmap
);
6522 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6523 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6524 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6525 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6528 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6529 return isl_basic_map_finalize(bmap
);
6531 isl_basic_map_free(bmap
);
6536 * returns [domain -> range] -> range - domain
6538 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6541 isl_space
*domain_dim
;
6546 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6547 isl_die(map
->ctx
, isl_error_invalid
,
6548 "domain and range don't match", goto error
);
6550 map
= isl_map_cow(map
);
6554 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6555 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6556 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6559 for (i
= 0; i
< map
->n
; ++i
) {
6560 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6564 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6571 __isl_give
struct isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6573 struct isl_basic_map
*bmap
;
6581 nparam
= dims
->nparam
;
6583 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6587 for (i
= 0; i
< dim
; ++i
) {
6588 int j
= isl_basic_map_alloc_equality(bmap
);
6591 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6592 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6593 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6595 return isl_basic_map_finalize(bmap
);
6597 isl_basic_map_free(bmap
);
6601 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6605 if (dim
->n_in
!= dim
->n_out
)
6606 isl_die(dim
->ctx
, isl_error_invalid
,
6607 "number of input and output dimensions needs to be "
6608 "the same", goto error
);
6609 return basic_map_identity(dim
);
6611 isl_space_free(dim
);
6615 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6617 if (!model
|| !model
->dim
)
6619 return isl_basic_map_identity(isl_space_copy(model
->dim
));
6622 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
6624 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
6627 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
6629 if (!model
|| !model
->dim
)
6631 return isl_map_identity(isl_space_copy(model
->dim
));
6634 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
6636 if (!model
|| !model
->dim
)
6638 return isl_map_identity(isl_space_copy(model
->dim
));
6641 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
6643 isl_space
*dim
= isl_set_get_space(set
);
6645 id
= isl_map_identity(isl_space_map_from_set(dim
));
6646 return isl_map_intersect_range(id
, set
);
6649 /* Construct a basic set with all set dimensions having only non-negative
6652 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
6653 __isl_take isl_space
*space
)
6658 struct isl_basic_set
*bset
;
6662 nparam
= space
->nparam
;
6664 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
6667 for (i
= 0; i
< dim
; ++i
) {
6668 int k
= isl_basic_set_alloc_inequality(bset
);
6671 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
6672 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
6676 isl_basic_set_free(bset
);
6680 /* Construct the half-space x_pos >= 0.
6682 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
6686 isl_basic_set
*nonneg
;
6688 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6689 k
= isl_basic_set_alloc_inequality(nonneg
);
6692 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
6693 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
6695 return isl_basic_set_finalize(nonneg
);
6697 isl_basic_set_free(nonneg
);
6701 /* Construct the half-space x_pos <= -1.
6703 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
6708 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6709 k
= isl_basic_set_alloc_inequality(neg
);
6712 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
6713 isl_int_set_si(neg
->ineq
[k
][0], -1);
6714 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
6716 return isl_basic_set_finalize(neg
);
6718 isl_basic_set_free(neg
);
6722 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
6723 enum isl_dim_type type
, unsigned first
, unsigned n
)
6726 isl_basic_set
*nonneg
;
6734 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
6736 for (i
= 0; i
< n
; ++i
) {
6737 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
6738 pos(set
->dim
, type
) + first
+ i
);
6739 neg
= neg_halfspace(isl_set_get_space(set
),
6740 pos(set
->dim
, type
) + first
+ i
);
6742 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
6751 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
6752 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6759 if (isl_set_plain_is_empty(set
)) {
6764 return fn(set
, signs
, user
);
6767 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
6769 half
= isl_set_intersect(half
, isl_set_copy(set
));
6770 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
6774 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
6776 half
= isl_set_intersect(half
, set
);
6777 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
6783 /* Call "fn" on the intersections of "set" with each of the orthants
6784 * (except for obviously empty intersections). The orthant is identified
6785 * by the signs array, with each entry having value 1 or -1 according
6786 * to the sign of the corresponding variable.
6788 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
6789 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6799 if (isl_set_plain_is_empty(set
))
6802 nparam
= isl_set_dim(set
, isl_dim_param
);
6803 nvar
= isl_set_dim(set
, isl_dim_set
);
6805 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
6807 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
6815 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6817 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6820 int isl_basic_map_is_subset(
6821 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6824 struct isl_map
*map1
;
6825 struct isl_map
*map2
;
6827 if (!bmap1
|| !bmap2
)
6830 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
6831 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
6833 is_subset
= isl_map_is_subset(map1
, map2
);
6841 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
6842 __isl_keep isl_basic_set
*bset2
)
6844 return isl_basic_map_is_subset(bset1
, bset2
);
6847 int isl_basic_map_is_equal(
6848 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6852 if (!bmap1
|| !bmap2
)
6854 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6857 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6861 int isl_basic_set_is_equal(
6862 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6864 return isl_basic_map_is_equal(
6865 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
6868 int isl_map_is_empty(struct isl_map
*map
)
6875 for (i
= 0; i
< map
->n
; ++i
) {
6876 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
6885 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
6887 return map
? map
->n
== 0 : -1;
6890 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
6892 return isl_map_plain_is_empty(map
);
6895 int isl_set_plain_is_empty(struct isl_set
*set
)
6897 return set
? set
->n
== 0 : -1;
6900 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
6902 return isl_set_plain_is_empty(set
);
6905 int isl_set_is_empty(struct isl_set
*set
)
6907 return isl_map_is_empty((struct isl_map
*)set
);
6910 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6915 return isl_space_is_equal(map1
->dim
, map2
->dim
);
6918 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6923 return isl_space_is_equal(set1
->dim
, set2
->dim
);
6926 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6932 is_subset
= isl_map_is_subset(map1
, map2
);
6935 is_subset
= isl_map_is_subset(map2
, map1
);
6939 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6941 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
6944 int isl_basic_map_is_strict_subset(
6945 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6949 if (!bmap1
|| !bmap2
)
6951 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6954 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6955 if (is_subset
== -1)
6960 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
6966 is_subset
= isl_map_is_subset(map1
, map2
);
6969 is_subset
= isl_map_is_subset(map2
, map1
);
6970 if (is_subset
== -1)
6975 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6977 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
6980 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6984 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6987 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6991 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6994 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7001 for (i
= 0; i
< map
->n
; ++i
) {
7002 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7010 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7012 return isl_map_plain_is_universe((isl_map
*) set
);
7015 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7017 return isl_set_plain_is_universe(set
);
7020 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7022 struct isl_basic_set
*bset
= NULL
;
7023 struct isl_vec
*sample
= NULL
;
7030 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7033 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7034 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7035 copy
= isl_basic_map_remove_redundancies(copy
);
7036 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
7037 isl_basic_map_free(copy
);
7041 total
= 1 + isl_basic_map_total_dim(bmap
);
7042 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7043 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7049 isl_vec_free(bmap
->sample
);
7050 bmap
->sample
= NULL
;
7051 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7054 sample
= isl_basic_set_sample_vec(bset
);
7057 empty
= sample
->size
== 0;
7058 isl_vec_free(bmap
->sample
);
7059 bmap
->sample
= sample
;
7061 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7066 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7070 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7073 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7075 return isl_basic_map_plain_is_empty(bmap
);
7078 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7082 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7085 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7087 return isl_basic_set_plain_is_empty(bset
);
7090 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7092 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7095 struct isl_map
*isl_basic_map_union(
7096 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7098 struct isl_map
*map
;
7099 if (!bmap1
|| !bmap2
)
7102 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7104 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7107 map
= isl_map_add_basic_map(map
, bmap1
);
7108 map
= isl_map_add_basic_map(map
, bmap2
);
7111 isl_basic_map_free(bmap1
);
7112 isl_basic_map_free(bmap2
);
7116 struct isl_set
*isl_basic_set_union(
7117 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7119 return (struct isl_set
*)isl_basic_map_union(
7120 (struct isl_basic_map
*)bset1
,
7121 (struct isl_basic_map
*)bset2
);
7124 /* Order divs such that any div only depends on previous divs */
7125 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7133 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7135 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7137 if (isl_int_is_zero(bmap
->div
[i
][0]))
7139 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7143 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7149 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7151 return (struct isl_basic_set
*)
7152 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7155 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7162 for (i
= 0; i
< map
->n
; ++i
) {
7163 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7174 /* Apply the expansion computed by isl_merge_divs.
7175 * The expansion itself is given by "exp" while the resulting
7176 * list of divs is given by "div".
7178 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7179 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7184 bset
= isl_basic_set_cow(bset
);
7188 if (div
->n_row
< bset
->n_div
)
7189 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7190 "not an expansion", goto error
);
7192 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7193 div
->n_row
- bset
->n_div
, 0,
7194 2 * (div
->n_row
- bset
->n_div
));
7196 n_div
= bset
->n_div
;
7197 for (i
= n_div
; i
< div
->n_row
; ++i
)
7198 if (isl_basic_set_alloc_div(bset
) < 0)
7202 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7203 if (j
>= 0 && exp
[j
] == i
) {
7205 isl_basic_map_swap_div(bset
, i
, j
);
7208 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7209 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7217 isl_basic_set_free(bset
);
7222 /* Look for a div in dst that corresponds to the div "div" in src.
7223 * The divs before "div" in src and dst are assumed to be the same.
7225 * Returns -1 if no corresponding div was found and the position
7226 * of the corresponding div in dst otherwise.
7228 static int find_div(struct isl_basic_map
*dst
,
7229 struct isl_basic_map
*src
, unsigned div
)
7233 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7235 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7236 for (i
= div
; i
< dst
->n_div
; ++i
)
7237 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7238 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7239 dst
->n_div
- div
) == -1)
7244 struct isl_basic_map
*isl_basic_map_align_divs(
7245 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7248 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7253 if (src
->n_div
== 0)
7256 for (i
= 0; i
< src
->n_div
; ++i
)
7257 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7259 src
= isl_basic_map_order_divs(src
);
7260 dst
= isl_basic_map_cow(dst
);
7261 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7262 src
->n_div
, 0, 2 * src
->n_div
);
7265 for (i
= 0; i
< src
->n_div
; ++i
) {
7266 int j
= find_div(dst
, src
, i
);
7268 j
= isl_basic_map_alloc_div(dst
);
7271 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7272 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7273 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7277 isl_basic_map_swap_div(dst
, i
, j
);
7281 isl_basic_map_free(dst
);
7285 struct isl_basic_set
*isl_basic_set_align_divs(
7286 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7288 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7289 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7292 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7300 map
= isl_map_compute_divs(map
);
7301 map
= isl_map_cow(map
);
7305 for (i
= 1; i
< map
->n
; ++i
)
7306 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7307 for (i
= 1; i
< map
->n
; ++i
)
7308 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7310 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7314 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7316 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7319 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7320 __isl_take isl_map
*map
)
7324 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7325 map
= isl_map_intersect_domain(map
, set
);
7326 set
= isl_map_range(map
);
7334 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7335 __isl_take isl_map
*map
)
7337 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7340 /* There is no need to cow as removing empty parts doesn't change
7341 * the meaning of the set.
7343 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7350 for (i
= map
->n
- 1; i
>= 0; --i
)
7351 remove_if_empty(map
, i
);
7356 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7358 return (struct isl_set
*)
7359 isl_map_remove_empty_parts((struct isl_map
*)set
);
7362 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7364 struct isl_basic_map
*bmap
;
7365 if (!map
|| map
->n
== 0)
7367 bmap
= map
->p
[map
->n
-1];
7368 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7369 return isl_basic_map_copy(bmap
);
7372 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7374 return (struct isl_basic_set
*)
7375 isl_map_copy_basic_map((struct isl_map
*)set
);
7378 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7379 __isl_keep isl_basic_map
*bmap
)
7385 for (i
= map
->n
-1; i
>= 0; --i
) {
7386 if (map
->p
[i
] != bmap
)
7388 map
= isl_map_cow(map
);
7391 isl_basic_map_free(map
->p
[i
]);
7392 if (i
!= map
->n
-1) {
7393 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7394 map
->p
[i
] = map
->p
[map
->n
-1];
7405 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7406 struct isl_basic_set
*bset
)
7408 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7409 (struct isl_basic_map
*)bset
);
7412 /* Given two basic sets bset1 and bset2, compute the maximal difference
7413 * between the values of dimension pos in bset1 and those in bset2
7414 * for any common value of the parameters and dimensions preceding pos.
7416 static enum isl_lp_result
basic_set_maximal_difference_at(
7417 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7418 int pos
, isl_int
*opt
)
7421 struct isl_basic_map
*bmap1
= NULL
;
7422 struct isl_basic_map
*bmap2
= NULL
;
7423 struct isl_ctx
*ctx
;
7424 struct isl_vec
*obj
;
7427 unsigned dim1
, dim2
;
7428 enum isl_lp_result res
;
7430 if (!bset1
|| !bset2
)
7431 return isl_lp_error
;
7433 nparam
= isl_basic_set_n_param(bset1
);
7434 dim1
= isl_basic_set_n_dim(bset1
);
7435 dim2
= isl_basic_set_n_dim(bset2
);
7436 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7437 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7438 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7439 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7440 if (!bmap1
|| !bmap2
)
7442 bmap1
= isl_basic_map_cow(bmap1
);
7443 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7444 pos
, (dim1
- pos
) + (dim2
- pos
),
7445 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7446 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7449 total
= isl_basic_map_total_dim(bmap1
);
7451 obj
= isl_vec_alloc(ctx
, 1 + total
);
7452 isl_seq_clr(obj
->block
.data
, 1 + total
);
7453 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7454 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7457 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7459 isl_basic_map_free(bmap1
);
7463 isl_basic_map_free(bmap1
);
7464 isl_basic_map_free(bmap2
);
7465 return isl_lp_error
;
7468 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7469 * for any common value of the parameters and dimensions preceding pos
7470 * in both basic sets, the values of dimension pos in bset1 are
7471 * smaller or larger than those in bset2.
7474 * 1 if bset1 follows bset2
7475 * -1 if bset1 precedes bset2
7476 * 0 if bset1 and bset2 are incomparable
7477 * -2 if some error occurred.
7479 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7480 struct isl_basic_set
*bset2
, int pos
)
7483 enum isl_lp_result res
;
7488 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7490 if (res
== isl_lp_empty
)
7492 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7493 res
== isl_lp_unbounded
)
7495 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7504 /* Given two basic sets bset1 and bset2, check whether
7505 * for any common value of the parameters and dimensions preceding pos
7506 * there is a value of dimension pos in bset1 that is larger
7507 * than a value of the same dimension in bset2.
7510 * 1 if there exists such a pair
7511 * 0 if there is no such pair, but there is a pair of equal values
7513 * -2 if some error occurred.
7515 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7516 __isl_keep isl_basic_set
*bset2
, int pos
)
7519 enum isl_lp_result res
;
7524 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7526 if (res
== isl_lp_empty
)
7528 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7529 res
== isl_lp_unbounded
)
7531 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7533 else if (res
== isl_lp_ok
)
7542 /* Given two sets set1 and set2, check whether
7543 * for any common value of the parameters and dimensions preceding pos
7544 * there is a value of dimension pos in set1 that is larger
7545 * than a value of the same dimension in set2.
7548 * 1 if there exists such a pair
7549 * 0 if there is no such pair, but there is a pair of equal values
7551 * -2 if some error occurred.
7553 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7554 __isl_keep isl_set
*set2
, int pos
)
7562 for (i
= 0; i
< set1
->n
; ++i
)
7563 for (j
= 0; j
< set2
->n
; ++j
) {
7565 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7566 if (f
== 1 || f
== -2)
7575 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7576 unsigned pos
, isl_int
*val
)
7584 total
= isl_basic_map_total_dim(bmap
);
7585 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7586 for (; d
+1 > pos
; --d
)
7587 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7591 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7593 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7595 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7598 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7604 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7605 unsigned pos
, isl_int
*val
)
7617 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
7620 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
7621 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
7622 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
7623 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7627 isl_int_set(*val
, v
);
7633 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
7634 unsigned pos
, isl_int
*val
)
7636 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
7640 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
7643 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
7646 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
7647 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7649 if (pos
>= isl_basic_map_dim(bmap
, type
))
7651 return isl_basic_map_plain_has_fixed_var(bmap
,
7652 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
7655 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
7656 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7658 if (pos
>= isl_map_dim(map
, type
))
7660 return isl_map_plain_has_fixed_var(map
,
7661 map_offset(map
, type
) - 1 + pos
, val
);
7664 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
7665 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7667 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
7670 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
7671 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7673 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
7676 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7677 * then return this fixed value in *val.
7679 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
7680 unsigned dim
, isl_int
*val
)
7682 return isl_basic_set_plain_has_fixed_var(bset
,
7683 isl_basic_set_n_param(bset
) + dim
, val
);
7686 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7687 * then return this fixed value in *val.
7689 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
7690 unsigned dim
, isl_int
*val
)
7692 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
7695 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
7696 unsigned dim
, isl_int
*val
)
7698 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
7701 /* Check if input variable in has fixed value and if so and if val is not NULL,
7702 * then return this fixed value in *val.
7704 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
7705 unsigned in
, isl_int
*val
)
7707 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
7710 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7711 * and if val is not NULL, then return this lower bound in *val.
7713 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7714 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
7716 int i
, i_eq
= -1, i_ineq
= -1;
7723 total
= isl_basic_set_total_dim(bset
);
7724 nparam
= isl_basic_set_n_param(bset
);
7725 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7726 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
7732 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7733 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
7735 if (i_eq
!= -1 || i_ineq
!= -1)
7739 if (i_eq
== -1 && i_ineq
== -1)
7741 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
7742 /* The coefficient should always be one due to normalization. */
7743 if (!isl_int_is_one(c
[1+nparam
+dim
]))
7745 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
7747 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
7748 total
- nparam
- dim
- 1) != -1)
7751 isl_int_neg(*val
, c
[0]);
7755 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
7756 unsigned dim
, isl_int
*val
)
7768 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7772 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7774 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
7775 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
7777 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7781 isl_int_set(*val
, v
);
7792 /* uset_gist depends on constraints without existentially quantified
7793 * variables sorting first.
7795 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
7797 const struct constraint
*c1
= (const struct constraint
*)p1
;
7798 const struct constraint
*c2
= (const struct constraint
*)p2
;
7800 unsigned size
= isl_min(c1
->size
, c2
->size
);
7802 l1
= isl_seq_last_non_zero(c1
->c
, size
);
7803 l2
= isl_seq_last_non_zero(c2
->c
, size
);
7808 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
7811 static struct isl_basic_map
*isl_basic_map_sort_constraints(
7812 struct isl_basic_map
*bmap
)
7815 struct constraint
*c
;
7820 total
= isl_basic_map_total_dim(bmap
);
7821 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
7824 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7826 c
[i
].c
= bmap
->ineq
[i
];
7828 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
7829 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7830 bmap
->ineq
[i
] = c
[i
].c
;
7834 isl_basic_map_free(bmap
);
7838 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
7839 __isl_take isl_basic_set
*bset
)
7841 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
7842 (struct isl_basic_map
*)bset
);
7845 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
7849 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
7851 bmap
= isl_basic_map_remove_redundancies(bmap
);
7852 bmap
= isl_basic_map_sort_constraints(bmap
);
7853 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
7857 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
7859 return (struct isl_basic_set
*)isl_basic_map_normalize(
7860 (struct isl_basic_map
*)bset
);
7863 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
7864 const __isl_keep isl_basic_map
*bmap2
)
7871 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
7872 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
7873 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
7874 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
7875 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
7876 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
7877 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7878 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
7879 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7880 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
7881 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7883 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
7885 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7887 if (bmap1
->n_eq
!= bmap2
->n_eq
)
7888 return bmap1
->n_eq
- bmap2
->n_eq
;
7889 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
7890 return bmap1
->n_ineq
- bmap2
->n_ineq
;
7891 if (bmap1
->n_div
!= bmap2
->n_div
)
7892 return bmap1
->n_div
- bmap2
->n_div
;
7893 total
= isl_basic_map_total_dim(bmap1
);
7894 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
7895 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
7899 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
7900 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
7904 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
7905 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
7912 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
7913 const __isl_keep isl_basic_set
*bset2
)
7915 return isl_basic_map_plain_cmp(bset1
, bset2
);
7918 int isl_set_plain_cmp(const __isl_keep isl_set
*set1
,
7919 const __isl_keep isl_set
*set2
)
7925 if (set1
->n
!= set2
->n
)
7926 return set1
->n
- set2
->n
;
7928 for (i
= 0; i
< set1
->n
; ++i
) {
7929 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
7937 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
7938 __isl_keep isl_basic_map
*bmap2
)
7940 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
7943 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
7944 __isl_keep isl_basic_set
*bset2
)
7946 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
7947 (isl_basic_map
*)bset2
);
7950 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
7952 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
7953 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
7955 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
7958 /* We normalize in place, but if anything goes wrong we need
7959 * to return NULL, so we need to make sure we don't change the
7960 * meaning of any possible other copies of map.
7962 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
7965 struct isl_basic_map
*bmap
;
7969 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
7971 for (i
= 0; i
< map
->n
; ++i
) {
7972 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
7975 isl_basic_map_free(map
->p
[i
]);
7978 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
7979 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
7980 map
= isl_map_remove_empty_parts(map
);
7983 for (i
= map
->n
- 1; i
>= 1; --i
) {
7984 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
7986 isl_basic_map_free(map
->p
[i
-1]);
7987 for (j
= i
; j
< map
->n
; ++j
)
7988 map
->p
[j
-1] = map
->p
[j
];
7998 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8000 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8003 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8013 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8016 map1
= isl_map_copy(map1
);
8017 map2
= isl_map_copy(map2
);
8018 map1
= isl_map_normalize(map1
);
8019 map2
= isl_map_normalize(map2
);
8022 equal
= map1
->n
== map2
->n
;
8023 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8024 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8037 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8039 return isl_map_plain_is_equal(map1
, map2
);
8042 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8044 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8045 (struct isl_map
*)set2
);
8048 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8050 return isl_set_plain_is_equal(set1
, set2
);
8053 /* Return an interval that ranges from min to max (inclusive)
8055 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8056 isl_int min
, isl_int max
)
8059 struct isl_basic_set
*bset
= NULL
;
8061 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8065 k
= isl_basic_set_alloc_inequality(bset
);
8068 isl_int_set_si(bset
->ineq
[k
][1], 1);
8069 isl_int_neg(bset
->ineq
[k
][0], min
);
8071 k
= isl_basic_set_alloc_inequality(bset
);
8074 isl_int_set_si(bset
->ineq
[k
][1], -1);
8075 isl_int_set(bset
->ineq
[k
][0], max
);
8079 isl_basic_set_free(bset
);
8083 /* Return the Cartesian product of the basic sets in list (in the given order).
8085 __isl_give isl_basic_set
*isl_basic_set_list_product(
8086 __isl_take
struct isl_basic_set_list
*list
)
8094 struct isl_basic_set
*product
= NULL
;
8098 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8099 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8100 nparam
= isl_basic_set_n_param(list
->p
[0]);
8101 dim
= isl_basic_set_n_dim(list
->p
[0]);
8102 extra
= list
->p
[0]->n_div
;
8103 n_eq
= list
->p
[0]->n_eq
;
8104 n_ineq
= list
->p
[0]->n_ineq
;
8105 for (i
= 1; i
< list
->n
; ++i
) {
8106 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8107 isl_assert(list
->ctx
,
8108 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8109 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8110 extra
+= list
->p
[i
]->n_div
;
8111 n_eq
+= list
->p
[i
]->n_eq
;
8112 n_ineq
+= list
->p
[i
]->n_ineq
;
8114 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8119 for (i
= 0; i
< list
->n
; ++i
) {
8120 isl_basic_set_add_constraints(product
,
8121 isl_basic_set_copy(list
->p
[i
]), dim
);
8122 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8124 isl_basic_set_list_free(list
);
8127 isl_basic_set_free(product
);
8128 isl_basic_set_list_free(list
);
8132 struct isl_basic_map
*isl_basic_map_product(
8133 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8135 isl_space
*dim_result
= NULL
;
8136 struct isl_basic_map
*bmap
;
8137 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8138 struct isl_dim_map
*dim_map1
, *dim_map2
;
8140 if (!bmap1
|| !bmap2
)
8143 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8144 bmap2
->dim
, isl_dim_param
), goto error
);
8145 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8146 isl_space_copy(bmap2
->dim
));
8148 in1
= isl_basic_map_n_in(bmap1
);
8149 in2
= isl_basic_map_n_in(bmap2
);
8150 out1
= isl_basic_map_n_out(bmap1
);
8151 out2
= isl_basic_map_n_out(bmap2
);
8152 nparam
= isl_basic_map_n_param(bmap1
);
8154 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8155 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8156 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8157 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8158 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8159 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8160 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8161 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8162 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8163 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8164 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8166 bmap
= isl_basic_map_alloc_space(dim_result
,
8167 bmap1
->n_div
+ bmap2
->n_div
,
8168 bmap1
->n_eq
+ bmap2
->n_eq
,
8169 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8170 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8171 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8172 bmap
= isl_basic_map_simplify(bmap
);
8173 return isl_basic_map_finalize(bmap
);
8175 isl_basic_map_free(bmap1
);
8176 isl_basic_map_free(bmap2
);
8180 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8181 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8183 isl_basic_map
*prod
;
8185 prod
= isl_basic_map_product(bmap1
, bmap2
);
8186 prod
= isl_basic_map_flatten(prod
);
8190 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8191 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8193 return isl_basic_map_flat_range_product(bset1
, bset2
);
8196 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8197 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8199 isl_space
*space_result
= NULL
;
8200 isl_basic_map
*bmap
;
8201 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8202 struct isl_dim_map
*dim_map1
, *dim_map2
;
8204 if (!bmap1
|| !bmap2
)
8207 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8208 isl_space_copy(bmap2
->dim
));
8210 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8211 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8212 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8213 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8215 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8216 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8217 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8218 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8219 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8220 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8221 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8222 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8223 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8224 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8225 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8227 bmap
= isl_basic_map_alloc_space(space_result
,
8228 bmap1
->n_div
+ bmap2
->n_div
,
8229 bmap1
->n_eq
+ bmap2
->n_eq
,
8230 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8231 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8232 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8233 bmap
= isl_basic_map_simplify(bmap
);
8234 return isl_basic_map_finalize(bmap
);
8236 isl_basic_map_free(bmap1
);
8237 isl_basic_map_free(bmap2
);
8241 __isl_give isl_basic_map
*isl_basic_map_range_product(
8242 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8244 isl_space
*dim_result
= NULL
;
8245 isl_basic_map
*bmap
;
8246 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8247 struct isl_dim_map
*dim_map1
, *dim_map2
;
8249 if (!bmap1
|| !bmap2
)
8252 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8253 isl_space_copy(bmap2
->dim
));
8255 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8256 out1
= isl_basic_map_n_out(bmap1
);
8257 out2
= isl_basic_map_n_out(bmap2
);
8258 nparam
= isl_basic_map_n_param(bmap1
);
8260 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8261 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8262 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8263 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8264 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8265 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8266 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8267 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8268 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8269 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8270 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8272 bmap
= isl_basic_map_alloc_space(dim_result
,
8273 bmap1
->n_div
+ bmap2
->n_div
,
8274 bmap1
->n_eq
+ bmap2
->n_eq
,
8275 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8276 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8277 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8278 bmap
= isl_basic_map_simplify(bmap
);
8279 return isl_basic_map_finalize(bmap
);
8281 isl_basic_map_free(bmap1
);
8282 isl_basic_map_free(bmap2
);
8286 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8287 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8289 isl_basic_map
*prod
;
8291 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8292 prod
= isl_basic_map_flatten_range(prod
);
8296 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8297 __isl_take isl_map
*map2
,
8298 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8299 __isl_take isl_space
*right
),
8300 __isl_give isl_basic_map
*(*basic_map_product
)(
8301 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8304 struct isl_map
*result
;
8310 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8311 map2
->dim
, isl_dim_param
), goto error
);
8313 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8314 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8315 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8317 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8318 isl_space_copy(map2
->dim
)),
8319 map1
->n
* map2
->n
, flags
);
8322 for (i
= 0; i
< map1
->n
; ++i
)
8323 for (j
= 0; j
< map2
->n
; ++j
) {
8324 struct isl_basic_map
*part
;
8325 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8326 isl_basic_map_copy(map2
->p
[j
]));
8327 if (isl_basic_map_is_empty(part
))
8328 isl_basic_map_free(part
);
8330 result
= isl_map_add_basic_map(result
, part
);
8343 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8345 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8346 __isl_take isl_map
*map2
)
8348 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8351 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8352 __isl_take isl_map
*map2
)
8354 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8357 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8359 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8360 __isl_take isl_map
*map2
)
8364 prod
= isl_map_product(map1
, map2
);
8365 prod
= isl_map_flatten(prod
);
8369 /* Given two set A and B, construct its Cartesian product A x B.
8371 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8373 return isl_map_range_product(set1
, set2
);
8376 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8377 __isl_take isl_set
*set2
)
8379 return isl_map_flat_range_product(set1
, set2
);
8382 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8384 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8385 __isl_take isl_map
*map2
)
8387 return map_product(map1
, map2
, &isl_space_domain_product
,
8388 &isl_basic_map_domain_product
);
8391 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8393 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8394 __isl_take isl_map
*map2
)
8396 return map_product(map1
, map2
, &isl_space_range_product
,
8397 &isl_basic_map_range_product
);
8400 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8401 __isl_take isl_map
*map2
)
8403 return isl_map_align_params_map_map_and(map1
, map2
,
8404 &map_domain_product_aligned
);
8407 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8408 __isl_take isl_map
*map2
)
8410 return isl_map_align_params_map_map_and(map1
, map2
,
8411 &map_range_product_aligned
);
8414 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8416 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8417 __isl_take isl_map
*map2
)
8421 prod
= isl_map_domain_product(map1
, map2
);
8422 prod
= isl_map_flatten_domain(prod
);
8426 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8428 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8429 __isl_take isl_map
*map2
)
8433 prod
= isl_map_range_product(map1
, map2
);
8434 prod
= isl_map_flatten_range(prod
);
8438 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8441 uint32_t hash
= isl_hash_init();
8446 bmap
= isl_basic_map_copy(bmap
);
8447 bmap
= isl_basic_map_normalize(bmap
);
8450 total
= isl_basic_map_total_dim(bmap
);
8451 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8452 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8454 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8455 isl_hash_hash(hash
, c_hash
);
8457 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8458 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8460 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8461 isl_hash_hash(hash
, c_hash
);
8463 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8464 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8466 if (isl_int_is_zero(bmap
->div
[i
][0]))
8468 isl_hash_byte(hash
, i
& 0xFF);
8469 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8470 isl_hash_hash(hash
, c_hash
);
8472 isl_basic_map_free(bmap
);
8476 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8478 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8481 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8488 map
= isl_map_copy(map
);
8489 map
= isl_map_normalize(map
);
8493 hash
= isl_hash_init();
8494 for (i
= 0; i
< map
->n
; ++i
) {
8496 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8497 isl_hash_hash(hash
, bmap_hash
);
8505 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8507 return isl_map_get_hash((isl_map
*)set
);
8510 /* Check if the value for dimension dim is completely determined
8511 * by the values of the other parameters and variables.
8512 * That is, check if dimension dim is involved in an equality.
8514 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8521 nparam
= isl_basic_set_n_param(bset
);
8522 for (i
= 0; i
< bset
->n_eq
; ++i
)
8523 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8528 /* Check if the value for dimension dim is completely determined
8529 * by the values of the other parameters and variables.
8530 * That is, check if dimension dim is involved in an equality
8531 * for each of the subsets.
8533 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8539 for (i
= 0; i
< set
->n
; ++i
) {
8541 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8548 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8550 return set
? set
->n
: 0;
8553 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8554 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8561 for (i
= 0; i
< map
->n
; ++i
)
8562 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8568 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8569 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8576 for (i
= 0; i
< set
->n
; ++i
)
8577 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8583 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8590 bset
= isl_basic_set_cow(bset
);
8594 dim
= isl_basic_set_get_space(bset
);
8595 dim
= isl_space_lift(dim
, bset
->n_div
);
8598 isl_space_free(bset
->dim
);
8600 bset
->extra
-= bset
->n_div
;
8603 bset
= isl_basic_set_finalize(bset
);
8607 isl_basic_set_free(bset
);
8611 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
8617 set
= isl_set_align_divs(set
);
8622 set
= isl_set_cow(set
);
8626 n_div
= set
->p
[0]->n_div
;
8627 dim
= isl_set_get_space(set
);
8628 dim
= isl_space_lift(dim
, n_div
);
8631 isl_space_free(set
->dim
);
8634 for (i
= 0; i
< set
->n
; ++i
) {
8635 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
8646 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
8649 struct isl_basic_map
*bmap
;
8656 set
= isl_set_align_divs(set
);
8661 dim
= isl_set_get_space(set
);
8662 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
8664 return isl_map_identity(isl_space_map_from_set(dim
));
8667 n_div
= set
->p
[0]->n_div
;
8668 dim
= isl_space_map_from_set(dim
);
8669 n_param
= isl_space_dim(dim
, isl_dim_param
);
8670 n_set
= isl_space_dim(dim
, isl_dim_in
);
8671 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
8672 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
8673 for (i
= 0; i
< n_set
; ++i
)
8674 bmap
= var_equal(bmap
, i
);
8676 total
= n_param
+ n_set
+ n_set
+ n_div
;
8677 for (i
= 0; i
< n_div
; ++i
) {
8678 k
= isl_basic_map_alloc_inequality(bmap
);
8681 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
8682 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
8683 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
8684 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
8685 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
8686 set
->p
[0]->div
[i
][0]);
8688 l
= isl_basic_map_alloc_inequality(bmap
);
8691 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
8692 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
8693 set
->p
[0]->div
[i
][0]);
8694 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
8698 bmap
= isl_basic_map_simplify(bmap
);
8699 bmap
= isl_basic_map_finalize(bmap
);
8700 return isl_map_from_basic_map(bmap
);
8703 isl_basic_map_free(bmap
);
8707 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
8715 dim
= isl_basic_set_total_dim(bset
);
8716 size
+= bset
->n_eq
* (1 + dim
);
8717 size
+= bset
->n_ineq
* (1 + dim
);
8718 size
+= bset
->n_div
* (2 + dim
);
8723 int isl_set_size(__isl_keep isl_set
*set
)
8731 for (i
= 0; i
< set
->n
; ++i
)
8732 size
+= isl_basic_set_size(set
->p
[i
]);
8737 /* Check if there is any lower bound (if lower == 0) and/or upper
8738 * bound (if upper == 0) on the specified dim.
8740 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8741 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
8748 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
8750 pos
+= isl_basic_map_offset(bmap
, type
);
8752 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8753 if (isl_int_is_zero(bmap
->div
[i
][0]))
8755 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
8759 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8760 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
8763 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8764 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
8771 return lower
&& upper
;
8774 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8775 enum isl_dim_type type
, unsigned pos
)
8777 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
8780 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
8781 enum isl_dim_type type
, unsigned pos
)
8783 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
8786 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
8787 enum isl_dim_type type
, unsigned pos
)
8789 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
8792 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
8793 enum isl_dim_type type
, unsigned pos
)
8800 for (i
= 0; i
< map
->n
; ++i
) {
8802 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
8803 if (bounded
< 0 || !bounded
)
8810 /* Return 1 if the specified dim is involved in both an upper bound
8811 * and a lower bound.
8813 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
8814 enum isl_dim_type type
, unsigned pos
)
8816 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
8819 static int has_bound(__isl_keep isl_map
*map
,
8820 enum isl_dim_type type
, unsigned pos
,
8821 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
8822 enum isl_dim_type type
, unsigned pos
))
8829 for (i
= 0; i
< map
->n
; ++i
) {
8831 bounded
= fn(map
->p
[i
], type
, pos
);
8832 if (bounded
< 0 || bounded
)
8839 /* Return 1 if the specified dim is involved in any lower bound.
8841 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
8842 enum isl_dim_type type
, unsigned pos
)
8844 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
8847 /* Return 1 if the specified dim is involved in any upper bound.
8849 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
8850 enum isl_dim_type type
, unsigned pos
)
8852 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
8855 /* For each of the "n" variables starting at "first", determine
8856 * the sign of the variable and put the results in the first "n"
8857 * elements of the array "signs".
8859 * 1 means that the variable is non-negative
8860 * -1 means that the variable is non-positive
8861 * 0 means the variable attains both positive and negative values.
8863 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
8864 unsigned first
, unsigned n
, int *signs
)
8866 isl_vec
*bound
= NULL
;
8867 struct isl_tab
*tab
= NULL
;
8868 struct isl_tab_undo
*snap
;
8871 if (!bset
|| !signs
)
8874 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
8875 tab
= isl_tab_from_basic_set(bset
, 0);
8879 isl_seq_clr(bound
->el
, bound
->size
);
8880 isl_int_set_si(bound
->el
[0], -1);
8882 snap
= isl_tab_snap(tab
);
8883 for (i
= 0; i
< n
; ++i
) {
8886 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
8887 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8890 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8891 if (isl_tab_rollback(tab
, snap
) < 0)
8899 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
8900 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8903 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8904 if (isl_tab_rollback(tab
, snap
) < 0)
8907 signs
[i
] = empty
? -1 : 0;
8911 isl_vec_free(bound
);
8915 isl_vec_free(bound
);
8919 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
8920 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
8922 if (!bset
|| !signs
)
8924 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
8927 first
+= pos(bset
->dim
, type
) - 1;
8928 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
8931 /* Check if the given basic map is obviously single-valued.
8932 * In particular, for each output dimension, check that there is
8933 * an equality that defines the output dimension in terms of
8934 * earlier dimensions.
8936 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
8946 total
= 1 + isl_basic_map_total_dim(bmap
);
8947 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
8948 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
8950 for (i
= 0; i
< n_out
; ++i
) {
8951 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
8952 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
8954 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
8955 total
- (o_out
+ i
+ 1)) == -1)
8958 if (j
>= bmap
->n_eq
)
8965 /* Check if the given map is obviously single-valued.
8967 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
8976 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
8979 /* Check if the given map is single-valued.
8984 * and check if the result is a subset of the identity mapping.
8986 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
8993 sv
= isl_map_plain_is_single_valued(map
);
8997 test
= isl_map_reverse(isl_map_copy(map
));
8998 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9000 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9001 id
= isl_map_identity(dim
);
9003 sv
= isl_map_is_subset(test
, id
);
9011 int isl_map_is_injective(__isl_keep isl_map
*map
)
9015 map
= isl_map_copy(map
);
9016 map
= isl_map_reverse(map
);
9017 in
= isl_map_is_single_valued(map
);
9023 /* Check if the given map is obviously injective.
9025 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9029 map
= isl_map_copy(map
);
9030 map
= isl_map_reverse(map
);
9031 in
= isl_map_plain_is_single_valued(map
);
9037 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9041 sv
= isl_map_is_single_valued(map
);
9045 return isl_map_is_injective(map
);
9048 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9050 return isl_map_is_single_valued((isl_map
*)set
);
9053 int isl_map_is_translation(__isl_keep isl_map
*map
)
9058 delta
= isl_map_deltas(isl_map_copy(map
));
9059 ok
= isl_set_is_singleton(delta
);
9060 isl_set_free(delta
);
9065 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9067 if (isl_seq_first_non_zero(p
, pos
) != -1)
9069 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9074 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9083 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9086 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9087 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9088 for (j
= 0; j
< nvar
; ++j
) {
9089 int lower
= 0, upper
= 0;
9090 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9091 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9093 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9099 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9100 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9102 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9104 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9109 if (!lower
|| !upper
)
9116 int isl_set_is_box(__isl_keep isl_set
*set
)
9123 return isl_basic_set_is_box(set
->p
[0]);
9126 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9131 return isl_space_is_wrapping(bset
->dim
);
9134 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9139 return isl_space_is_wrapping(set
->dim
);
9142 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9144 bmap
= isl_basic_map_cow(bmap
);
9148 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9152 bmap
= isl_basic_map_finalize(bmap
);
9154 return (isl_basic_set
*)bmap
;
9156 isl_basic_map_free(bmap
);
9160 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9164 map
= isl_map_cow(map
);
9168 for (i
= 0; i
< map
->n
; ++i
) {
9169 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9173 map
->dim
= isl_space_wrap(map
->dim
);
9177 return (isl_set
*)map
;
9183 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9185 bset
= isl_basic_set_cow(bset
);
9189 bset
->dim
= isl_space_unwrap(bset
->dim
);
9193 bset
= isl_basic_set_finalize(bset
);
9195 return (isl_basic_map
*)bset
;
9197 isl_basic_set_free(bset
);
9201 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9208 if (!isl_set_is_wrapping(set
))
9209 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9212 set
= isl_set_cow(set
);
9216 for (i
= 0; i
< set
->n
; ++i
) {
9217 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9222 set
->dim
= isl_space_unwrap(set
->dim
);
9226 return (isl_map
*)set
;
9232 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9233 enum isl_dim_type type
)
9238 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9241 bmap
= isl_basic_map_cow(bmap
);
9245 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9249 bmap
= isl_basic_map_finalize(bmap
);
9253 isl_basic_map_free(bmap
);
9257 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9258 enum isl_dim_type type
)
9265 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9268 map
= isl_map_cow(map
);
9272 for (i
= 0; i
< map
->n
; ++i
) {
9273 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9277 map
->dim
= isl_space_reset(map
->dim
, type
);
9287 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9292 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9295 bmap
= isl_basic_map_cow(bmap
);
9299 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9303 bmap
= isl_basic_map_finalize(bmap
);
9307 isl_basic_map_free(bmap
);
9311 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9313 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9316 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9317 __isl_take isl_basic_map
*bmap
)
9322 if (!bmap
->dim
->nested
[0])
9325 bmap
= isl_basic_map_cow(bmap
);
9329 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9333 bmap
= isl_basic_map_finalize(bmap
);
9337 isl_basic_map_free(bmap
);
9341 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9342 __isl_take isl_basic_map
*bmap
)
9347 if (!bmap
->dim
->nested
[1])
9350 bmap
= isl_basic_map_cow(bmap
);
9354 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9358 bmap
= isl_basic_map_finalize(bmap
);
9362 isl_basic_map_free(bmap
);
9366 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9373 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9376 map
= isl_map_cow(map
);
9380 for (i
= 0; i
< map
->n
; ++i
) {
9381 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9385 map
->dim
= isl_space_flatten(map
->dim
);
9395 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9397 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9400 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9402 isl_space
*dim
, *flat_dim
;
9405 dim
= isl_set_get_space(set
);
9406 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9407 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9408 map
= isl_map_intersect_domain(map
, set
);
9413 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9420 if (!map
->dim
->nested
[0])
9423 map
= isl_map_cow(map
);
9427 for (i
= 0; i
< map
->n
; ++i
) {
9428 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9432 map
->dim
= isl_space_flatten_domain(map
->dim
);
9442 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9449 if (!map
->dim
->nested
[1])
9452 map
= isl_map_cow(map
);
9456 for (i
= 0; i
< map
->n
; ++i
) {
9457 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9461 map
->dim
= isl_space_flatten_range(map
->dim
);
9471 /* Reorder the dimensions of "bmap" according to the given dim_map
9472 * and set the dimension specification to "dim".
9474 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9475 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9480 bmap
= isl_basic_map_cow(bmap
);
9481 if (!bmap
|| !dim
|| !dim_map
)
9484 flags
= bmap
->flags
;
9485 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9486 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9487 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9488 res
= isl_basic_map_alloc_space(dim
,
9489 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9490 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9493 res
= isl_basic_map_finalize(res
);
9497 isl_basic_map_free(bmap
);
9498 isl_space_free(dim
);
9502 /* Reorder the dimensions of "map" according to given reordering.
9504 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9505 __isl_take isl_reordering
*r
)
9508 struct isl_dim_map
*dim_map
;
9510 map
= isl_map_cow(map
);
9511 dim_map
= isl_dim_map_from_reordering(r
);
9512 if (!map
|| !r
|| !dim_map
)
9515 for (i
= 0; i
< map
->n
; ++i
) {
9516 struct isl_dim_map
*dim_map_i
;
9518 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9520 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9521 isl_space_copy(r
->dim
), dim_map_i
);
9527 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9529 isl_reordering_free(r
);
9535 isl_reordering_free(r
);
9539 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
9540 __isl_take isl_reordering
*r
)
9542 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
9545 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
9546 __isl_take isl_space
*model
)
9553 ctx
= isl_space_get_ctx(model
);
9554 if (!isl_space_has_named_params(model
))
9555 isl_die(ctx
, isl_error_invalid
,
9556 "model has unnamed parameters", goto error
);
9557 if (!isl_space_has_named_params(map
->dim
))
9558 isl_die(ctx
, isl_error_invalid
,
9559 "relation has unnamed parameters", goto error
);
9560 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9561 isl_reordering
*exp
;
9563 model
= isl_space_drop_dims(model
, isl_dim_in
,
9564 0, isl_space_dim(model
, isl_dim_in
));
9565 model
= isl_space_drop_dims(model
, isl_dim_out
,
9566 0, isl_space_dim(model
, isl_dim_out
));
9567 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
9568 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
9569 map
= isl_map_realign(map
, exp
);
9572 isl_space_free(model
);
9575 isl_space_free(model
);
9580 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
9581 __isl_take isl_space
*model
)
9583 return isl_map_align_params(set
, model
);
9586 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
9587 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9588 enum isl_dim_type c2
, enum isl_dim_type c3
,
9589 enum isl_dim_type c4
, enum isl_dim_type c5
)
9591 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9592 struct isl_mat
*mat
;
9598 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
9599 isl_basic_map_total_dim(bmap
) + 1);
9602 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9603 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9604 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9605 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9606 isl_int_set(mat
->row
[i
][pos
],
9607 bmap
->eq
[i
][off
+ k
]);
9615 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
9616 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9617 enum isl_dim_type c2
, enum isl_dim_type c3
,
9618 enum isl_dim_type c4
, enum isl_dim_type c5
)
9620 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9621 struct isl_mat
*mat
;
9627 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
9628 isl_basic_map_total_dim(bmap
) + 1);
9631 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
9632 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9633 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9634 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9635 isl_int_set(mat
->row
[i
][pos
],
9636 bmap
->ineq
[i
][off
+ k
]);
9644 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
9645 __isl_take isl_space
*dim
,
9646 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9647 enum isl_dim_type c2
, enum isl_dim_type c3
,
9648 enum isl_dim_type c4
, enum isl_dim_type c5
)
9650 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9651 isl_basic_map
*bmap
;
9657 if (!dim
|| !eq
|| !ineq
)
9660 if (eq
->n_col
!= ineq
->n_col
)
9661 isl_die(dim
->ctx
, isl_error_invalid
,
9662 "equalities and inequalities matrices should have "
9663 "same number of columns", goto error
);
9665 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
9667 if (eq
->n_col
< total
)
9668 isl_die(dim
->ctx
, isl_error_invalid
,
9669 "number of columns too small", goto error
);
9671 extra
= eq
->n_col
- total
;
9673 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
9674 eq
->n_row
, ineq
->n_row
);
9677 for (i
= 0; i
< extra
; ++i
) {
9678 k
= isl_basic_map_alloc_div(bmap
);
9681 isl_int_set_si(bmap
->div
[k
][0], 0);
9683 for (i
= 0; i
< eq
->n_row
; ++i
) {
9684 l
= isl_basic_map_alloc_equality(bmap
);
9687 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9688 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9689 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9690 isl_int_set(bmap
->eq
[l
][off
+ k
],
9696 for (i
= 0; i
< ineq
->n_row
; ++i
) {
9697 l
= isl_basic_map_alloc_inequality(bmap
);
9700 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9701 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9702 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9703 isl_int_set(bmap
->ineq
[l
][off
+ k
],
9710 isl_space_free(dim
);
9716 isl_space_free(dim
);
9722 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
9723 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9724 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9726 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
9727 c1
, c2
, c3
, c4
, isl_dim_in
);
9730 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
9731 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9732 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9734 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
9735 c1
, c2
, c3
, c4
, isl_dim_in
);
9738 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
9739 __isl_take isl_space
*dim
,
9740 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9741 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9743 return (isl_basic_set
*)
9744 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
9745 c1
, c2
, c3
, c4
, isl_dim_in
);
9748 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
9753 return isl_space_can_zip(bmap
->dim
);
9756 int isl_map_can_zip(__isl_keep isl_map
*map
)
9761 return isl_space_can_zip(map
->dim
);
9764 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9765 * (A -> C) -> (B -> D).
9767 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
9776 if (!isl_basic_map_can_zip(bmap
))
9777 isl_die(bmap
->ctx
, isl_error_invalid
,
9778 "basic map cannot be zipped", goto error
);
9779 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
9780 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
9781 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
9782 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
9783 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
9786 bmap
->dim
= isl_space_zip(bmap
->dim
);
9791 isl_basic_map_free(bmap
);
9795 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9796 * (A -> C) -> (B -> D).
9798 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
9805 if (!isl_map_can_zip(map
))
9806 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
9809 map
= isl_map_cow(map
);
9813 for (i
= 0; i
< map
->n
; ++i
) {
9814 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
9819 map
->dim
= isl_space_zip(map
->dim
);
9829 /* Can we apply isl_basic_map_curry to "bmap"?
9830 * That is, does it have a nested relation in its domain?
9832 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
9837 return isl_space_can_curry(bmap
->dim
);
9840 /* Can we apply isl_map_curry to "map"?
9841 * That is, does it have a nested relation in its domain?
9843 int isl_map_can_curry(__isl_keep isl_map
*map
)
9848 return isl_space_can_curry(map
->dim
);
9851 /* Given a basic map (A -> B) -> C, return the corresponding basic map
9854 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
9860 if (!isl_basic_map_can_curry(bmap
))
9861 isl_die(bmap
->ctx
, isl_error_invalid
,
9862 "basic map cannot be curried", goto error
);
9863 bmap
->dim
= isl_space_curry(bmap
->dim
);
9868 isl_basic_map_free(bmap
);
9872 /* Given a map (A -> B) -> C, return the corresponding map
9875 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
9882 if (!isl_map_can_curry(map
))
9883 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
9886 map
= isl_map_cow(map
);
9890 for (i
= 0; i
< map
->n
; ++i
) {
9891 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
9896 map
->dim
= isl_space_curry(map
->dim
);
9906 /* Construct a basic map mapping the domain of the affine expression
9907 * to a one-dimensional range prescribed by the affine expression.
9909 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
9913 isl_local_space
*ls
;
9914 isl_basic_map
*bmap
;
9919 ls
= isl_aff_get_local_space(aff
);
9920 bmap
= isl_basic_map_from_local_space(ls
);
9921 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
9922 k
= isl_basic_map_alloc_equality(bmap
);
9926 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
9927 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
9928 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
9929 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
9930 aff
->v
->size
- (pos
+ 1));
9933 bmap
= isl_basic_map_finalize(bmap
);
9937 isl_basic_map_free(bmap
);
9941 /* Construct a map mapping the domain of the affine expression
9942 * to a one-dimensional range prescribed by the affine expression.
9944 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
9946 isl_basic_map
*bmap
;
9948 bmap
= isl_basic_map_from_aff(aff
);
9949 return isl_map_from_basic_map(bmap
);
9952 /* Construct a basic map mapping the domain the multi-affine expression
9953 * to its range, with each dimension in the range equated to the
9954 * corresponding affine expression.
9956 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
9957 __isl_take isl_multi_aff
*maff
)
9961 isl_basic_map
*bmap
;
9966 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
9967 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
9968 "invalid space", return isl_multi_aff_free(maff
));
9970 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
9971 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
9973 for (i
= 0; i
< maff
->n
; ++i
) {
9975 isl_basic_map
*bmap_i
;
9977 aff
= isl_aff_copy(maff
->p
[i
]);
9978 bmap_i
= isl_basic_map_from_aff(aff
);
9980 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
9983 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
9985 isl_multi_aff_free(maff
);
9989 /* Construct a map mapping the domain the multi-affine expression
9990 * to its range, with each dimension in the range equated to the
9991 * corresponding affine expression.
9993 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
9995 isl_basic_map
*bmap
;
9997 bmap
= isl_basic_map_from_multi_aff(maff
);
9998 return isl_map_from_basic_map(bmap
);
10001 /* Construct a basic map mapping a domain in the given space to
10002 * to an n-dimensional range, with n the number of elements in the list,
10003 * where each coordinate in the range is prescribed by the
10004 * corresponding affine expression.
10005 * The domains of all affine expressions in the list are assumed to match
10008 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10009 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10013 isl_basic_map
*bmap
;
10018 dim
= isl_space_from_domain(domain_dim
);
10019 bmap
= isl_basic_map_universe(dim
);
10021 for (i
= 0; i
< list
->n
; ++i
) {
10023 isl_basic_map
*bmap_i
;
10025 aff
= isl_aff_copy(list
->p
[i
]);
10026 bmap_i
= isl_basic_map_from_aff(aff
);
10028 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10031 isl_aff_list_free(list
);
10035 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10036 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10038 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10041 /* Add a constraint imposing that the given two dimensions are equal.
10043 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10044 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10046 isl_basic_map
*bmap
= NULL
;
10052 if (pos1
>= isl_map_dim(map
, type1
))
10053 isl_die(map
->ctx
, isl_error_invalid
,
10054 "index out of bounds", goto error
);
10055 if (pos2
>= isl_map_dim(map
, type2
))
10056 isl_die(map
->ctx
, isl_error_invalid
,
10057 "index out of bounds", goto error
);
10059 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10060 i
= isl_basic_map_alloc_equality(bmap
);
10063 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10064 pos1
+= isl_basic_map_offset(bmap
, type1
);
10065 pos2
+= isl_basic_map_offset(bmap
, type2
);
10066 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10067 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10068 bmap
= isl_basic_map_finalize(bmap
);
10070 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10074 isl_basic_map_free(bmap
);
10079 /* Add a constraint imposing that the given two dimensions have opposite values.
10081 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10082 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10084 isl_basic_map
*bmap
= NULL
;
10090 if (pos1
>= isl_map_dim(map
, type1
))
10091 isl_die(map
->ctx
, isl_error_invalid
,
10092 "index out of bounds", goto error
);
10093 if (pos2
>= isl_map_dim(map
, type2
))
10094 isl_die(map
->ctx
, isl_error_invalid
,
10095 "index out of bounds", goto error
);
10097 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10098 i
= isl_basic_map_alloc_equality(bmap
);
10101 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10102 pos1
+= isl_basic_map_offset(bmap
, type1
);
10103 pos2
+= isl_basic_map_offset(bmap
, type2
);
10104 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10105 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10106 bmap
= isl_basic_map_finalize(bmap
);
10108 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10112 isl_basic_map_free(bmap
);
10117 /* Add a constraint imposing that the value of the first dimension is
10118 * greater than that of the second.
10120 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10121 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10123 isl_basic_map
*bmap
= NULL
;
10129 if (pos1
>= isl_map_dim(map
, type1
))
10130 isl_die(map
->ctx
, isl_error_invalid
,
10131 "index out of bounds", goto error
);
10132 if (pos2
>= isl_map_dim(map
, type2
))
10133 isl_die(map
->ctx
, isl_error_invalid
,
10134 "index out of bounds", goto error
);
10136 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10137 i
= isl_basic_map_alloc_inequality(bmap
);
10140 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10141 pos1
+= isl_basic_map_offset(bmap
, type1
);
10142 pos2
+= isl_basic_map_offset(bmap
, type2
);
10143 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10144 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10145 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10146 bmap
= isl_basic_map_finalize(bmap
);
10148 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10152 isl_basic_map_free(bmap
);
10157 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10161 isl_local_space
*ls
;
10166 if (!isl_basic_map_divs_known(bmap
))
10167 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10168 "some divs are unknown", return NULL
);
10170 ls
= isl_basic_map_get_local_space(bmap
);
10171 div
= isl_local_space_get_div(ls
, pos
);
10172 isl_local_space_free(ls
);
10177 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10180 return isl_basic_map_get_div(bset
, pos
);
10183 /* Plug in "subs" for dimension "type", "pos" of "bset".
10185 * Let i be the dimension to replace and let "subs" be of the form
10189 * Any integer division with a non-zero coefficient for i,
10191 * floor((a i + g)/m)
10195 * floor((a f + d g)/(m d))
10197 * Constraints of the form
10205 __isl_give isl_basic_set
*isl_basic_set_substitute(
10206 __isl_take isl_basic_set
*bset
,
10207 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10213 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10216 bset
= isl_basic_set_cow(bset
);
10217 if (!bset
|| !subs
)
10220 ctx
= isl_basic_set_get_ctx(bset
);
10221 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10222 isl_die(ctx
, isl_error_invalid
,
10223 "spaces don't match", goto error
);
10224 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10225 isl_die(ctx
, isl_error_unsupported
,
10226 "cannot handle divs yet", goto error
);
10228 pos
+= isl_basic_set_offset(bset
, type
);
10232 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10233 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10235 isl_int_set(v
, bset
->eq
[i
][pos
]);
10236 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10237 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10238 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10241 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10242 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10244 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10245 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10246 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10247 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10250 for (i
= 0; i
< bset
->n_div
; ++i
) {
10251 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10253 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10254 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10255 isl_seq_combine(bset
->div
[i
] + 1,
10256 subs
->v
->el
[0], bset
->div
[i
] + 1,
10257 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10258 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10263 bset
= isl_basic_set_simplify(bset
);
10264 return isl_basic_set_finalize(bset
);
10266 isl_basic_set_free(bset
);
10270 /* Plug in "subs" for dimension "type", "pos" of "set".
10272 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10273 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10277 if (set
&& isl_set_plain_is_empty(set
))
10280 set
= isl_set_cow(set
);
10284 for (i
= set
->n
- 1; i
>= 0; --i
) {
10285 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10286 if (remove_if_empty(set
, i
) < 0)