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_dim_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>
34 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
37 case isl_dim_param
: return dim
->nparam
;
38 case isl_dim_in
: return dim
->n_in
;
39 case isl_dim_out
: return dim
->n_out
;
40 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
45 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
48 case isl_dim_param
: return 1;
49 case isl_dim_in
: return 1 + dim
->nparam
;
50 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
55 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
56 enum isl_dim_type type
)
61 case isl_dim_cst
: return 1;
64 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
65 case isl_dim_div
: return bmap
->n_div
;
66 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
71 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
73 return map
? n(map
->dim
, type
) : 0;
76 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
78 return set
? n(set
->dim
, type
) : 0;
81 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
82 enum isl_dim_type type
)
84 struct isl_dim
*dim
= bmap
->dim
;
86 case isl_dim_cst
: return 0;
87 case isl_dim_param
: return 1;
88 case isl_dim_in
: return 1 + dim
->nparam
;
89 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
90 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
95 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
96 enum isl_dim_type type
)
98 return isl_basic_map_offset(bset
, type
);
101 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
103 return pos(map
->dim
, type
);
106 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
107 enum isl_dim_type type
)
109 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
112 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
114 return isl_basic_set_dim(bset
, isl_dim_set
);
117 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
119 return isl_basic_set_dim(bset
, isl_dim_param
);
122 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
124 return isl_dim_total(bset
->dim
) + bset
->n_div
;
127 unsigned isl_set_n_dim(const struct isl_set
*set
)
129 return isl_set_dim(set
, isl_dim_set
);
132 unsigned isl_set_n_param(const struct isl_set
*set
)
134 return isl_set_dim(set
, isl_dim_param
);
137 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
139 return bmap
? bmap
->dim
->n_in
: 0;
142 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
144 return bmap
? bmap
->dim
->n_out
: 0;
147 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
149 return bmap
? bmap
->dim
->nparam
: 0;
152 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
154 return bmap
? bmap
->n_div
: 0;
157 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
159 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
162 unsigned isl_map_n_in(const struct isl_map
*map
)
164 return map
? map
->dim
->n_in
: 0;
167 unsigned isl_map_n_out(const struct isl_map
*map
)
169 return map
? map
->dim
->n_out
: 0;
172 unsigned isl_map_n_param(const struct isl_map
*map
)
174 return map
? map
->dim
->nparam
: 0;
177 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
182 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
185 return isl_dim_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
188 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
189 struct isl_basic_set
*bset
)
194 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
197 return isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
200 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
205 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
208 return isl_dim_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
211 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
212 struct isl_basic_set
*bset
)
217 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
220 return isl_dim_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
223 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
225 return bmap
? bmap
->ctx
: NULL
;
228 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
230 return bset
? bset
->ctx
: NULL
;
233 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
235 return map
? map
->ctx
: NULL
;
238 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
240 return set
? set
->ctx
: NULL
;
243 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
247 return isl_dim_copy(bmap
->dim
);
250 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
254 return isl_dim_copy(bset
->dim
);
257 __isl_give isl_local_space
*isl_basic_map_get_local_space(
258 __isl_keep isl_basic_map
*bmap
)
267 total
= isl_basic_map_total_dim(bmap
);
268 ls
= isl_local_space_alloc(isl_dim_copy(bmap
->dim
), bmap
->n_div
);
272 for (i
= 0; i
< bmap
->n_div
; ++i
)
273 isl_seq_cpy(ls
->div
->row
[i
], bmap
->div
[i
], 2 + total
);
278 __isl_give isl_local_space
*isl_basic_set_get_local_space(
279 __isl_keep isl_basic_set
*bset
)
281 return isl_basic_map_get_local_space(bset
);
284 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
285 __isl_take isl_local_space
*ls
)
294 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
295 bmap
= isl_basic_map_alloc_dim(isl_local_space_get_dim(ls
),
296 n_div
, 0, 2 * n_div
);
298 for (i
= 0; i
< n_div
; ++i
)
299 if (isl_basic_map_alloc_div(bmap
) < 0)
302 for (i
= 0; i
< n_div
; ++i
) {
303 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
304 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
308 isl_local_space_free(ls
);
311 isl_local_space_free(ls
);
312 isl_basic_map_free(bmap
);
316 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
317 __isl_take isl_local_space
*ls
)
319 return isl_basic_map_from_local_space(ls
);
322 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
326 return isl_dim_copy(map
->dim
);
329 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
333 return isl_dim_copy(set
->dim
);
336 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
337 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
339 bmap
= isl_basic_map_cow(bmap
);
342 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
345 bmap
= isl_basic_map_finalize(bmap
);
348 isl_basic_map_free(bmap
);
352 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
353 __isl_take isl_basic_set
*bset
, const char *s
)
355 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
358 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
359 enum isl_dim_type type
)
361 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
364 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
365 enum isl_dim_type type
, const char *s
)
369 map
= isl_map_cow(map
);
373 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
377 for (i
= 0; i
< map
->n
; ++i
) {
378 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
389 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
390 enum isl_dim_type type
)
392 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
395 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
398 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
401 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
403 return bset
? isl_dim_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
406 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
408 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
411 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
412 enum isl_dim_type type
, unsigned pos
)
414 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
417 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
418 enum isl_dim_type type
, unsigned pos
)
420 return bset
? isl_dim_get_name(bset
->dim
, type
, pos
) : NULL
;
423 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
424 enum isl_dim_type type
, unsigned pos
)
426 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
429 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
430 enum isl_dim_type type
, unsigned pos
)
432 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
435 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
436 __isl_take isl_basic_map
*bmap
,
437 enum isl_dim_type type
, unsigned pos
, const char *s
)
441 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
446 isl_basic_map_free(bmap
);
450 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
451 enum isl_dim_type type
, unsigned pos
, const char *s
)
458 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
462 for (i
= 0; i
< map
->n
; ++i
) {
463 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
474 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
475 __isl_take isl_basic_set
*bset
,
476 enum isl_dim_type type
, unsigned pos
, const char *s
)
478 return (isl_basic_set
*)isl_basic_map_set_dim_name(
479 (isl_basic_map
*)bset
, type
, pos
, s
);
482 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
483 enum isl_dim_type type
, unsigned pos
, const char *s
)
485 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
488 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
492 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
495 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
497 return isl_basic_map_is_rational(bset
);
500 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
501 struct isl_basic_map
*bmap
, unsigned extra
,
502 unsigned n_eq
, unsigned n_ineq
)
505 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
510 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
511 if (isl_blk_is_error(bmap
->block
))
514 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
519 bmap
->block2
= isl_blk_empty();
522 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
523 if (isl_blk_is_error(bmap
->block2
))
526 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
531 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
532 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
534 for (i
= 0; i
< extra
; ++i
)
535 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
539 bmap
->c_size
= n_eq
+ n_ineq
;
540 bmap
->eq
= bmap
->ineq
+ n_ineq
;
549 isl_basic_map_free(bmap
);
553 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
554 unsigned nparam
, unsigned dim
, unsigned extra
,
555 unsigned n_eq
, unsigned n_ineq
)
557 struct isl_basic_map
*bmap
;
558 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
559 return (struct isl_basic_set
*)bmap
;
562 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
563 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
565 struct isl_basic_map
*bmap
;
568 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
569 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
570 return (struct isl_basic_set
*)bmap
;
576 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
577 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
579 struct isl_basic_map
*bmap
;
583 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
588 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
594 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
595 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
596 unsigned n_eq
, unsigned n_ineq
)
598 struct isl_basic_map
*bmap
;
601 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
605 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
609 static void dup_constraints(
610 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
613 unsigned total
= isl_basic_map_total_dim(src
);
615 for (i
= 0; i
< src
->n_eq
; ++i
) {
616 int j
= isl_basic_map_alloc_equality(dst
);
617 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
620 for (i
= 0; i
< src
->n_ineq
; ++i
) {
621 int j
= isl_basic_map_alloc_inequality(dst
);
622 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
625 for (i
= 0; i
< src
->n_div
; ++i
) {
626 int j
= isl_basic_map_alloc_div(dst
);
627 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
629 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
632 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
634 struct isl_basic_map
*dup
;
638 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
639 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
642 dup_constraints(dup
, bmap
);
643 dup
->flags
= bmap
->flags
;
644 dup
->sample
= isl_vec_copy(bmap
->sample
);
648 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
650 struct isl_basic_map
*dup
;
652 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
653 return (struct isl_basic_set
*)dup
;
656 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
661 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
665 return isl_basic_set_dup(bset
);
668 struct isl_set
*isl_set_copy(struct isl_set
*set
)
677 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
682 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
686 bmap
= isl_basic_map_dup(bmap
);
688 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
692 struct isl_map
*isl_map_copy(struct isl_map
*map
)
701 void isl_basic_map_free(struct isl_basic_map
*bmap
)
709 isl_ctx_deref(bmap
->ctx
);
711 isl_blk_free(bmap
->ctx
, bmap
->block2
);
713 isl_blk_free(bmap
->ctx
, bmap
->block
);
714 isl_vec_free(bmap
->sample
);
715 isl_dim_free(bmap
->dim
);
719 void isl_basic_set_free(struct isl_basic_set
*bset
)
721 isl_basic_map_free((struct isl_basic_map
*)bset
);
724 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
726 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
729 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
735 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
736 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
738 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
739 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
740 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
741 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
742 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
743 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
745 int j
= isl_basic_map_alloc_inequality(bmap
);
749 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
750 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
757 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
758 bmap
->extra
- bmap
->n_div
);
762 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
764 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
767 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
771 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
776 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
778 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
781 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
786 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
788 if (pos
!= bmap
->n_eq
- 1) {
790 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
791 bmap
->eq
[bmap
->n_eq
- 1] = t
;
797 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
799 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
802 void isl_basic_map_inequality_to_equality(
803 struct isl_basic_map
*bmap
, unsigned pos
)
808 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
809 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
814 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
815 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
816 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
817 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
820 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
822 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
825 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
831 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
832 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
833 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
834 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
835 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
836 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
837 1 + isl_basic_map_total_dim(bmap
),
838 bmap
->extra
- bmap
->n_div
);
839 return bmap
->n_ineq
++;
842 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
844 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
847 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
851 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
856 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
858 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
861 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
866 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
868 if (pos
!= bmap
->n_ineq
- 1) {
870 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
871 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
872 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
878 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
880 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
883 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
888 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
891 k
= isl_basic_map_alloc_equality(bmap
);
894 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
897 isl_basic_map_free(bmap
);
901 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
904 return (isl_basic_set
*)
905 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
908 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
913 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
916 k
= isl_basic_map_alloc_inequality(bmap
);
919 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
922 isl_basic_map_free(bmap
);
926 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
929 return (isl_basic_set
*)
930 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
933 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
937 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
938 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
939 1 + 1 + isl_basic_map_total_dim(bmap
),
940 bmap
->extra
- bmap
->n_div
);
941 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
942 return bmap
->n_div
++;
945 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
947 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
950 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
954 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
959 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
961 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
964 /* Copy constraint from src to dst, putting the vars of src at offset
965 * dim_off in dst and the divs of src at offset div_off in dst.
966 * If both sets are actually map, then dim_off applies to the input
969 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
970 struct isl_basic_map
*src_map
, isl_int
*src
,
971 unsigned in_off
, unsigned out_off
, unsigned div_off
)
973 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
974 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
975 unsigned src_in
= isl_basic_map_n_in(src_map
);
976 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
977 unsigned src_out
= isl_basic_map_n_out(src_map
);
978 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
979 isl_int_set(dst
[0], src
[0]);
980 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
981 if (dst_nparam
> src_nparam
)
982 isl_seq_clr(dst
+1+src_nparam
,
983 dst_nparam
- src_nparam
);
984 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
985 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
987 isl_min(dst_in
-in_off
, src_in
));
988 if (dst_in
-in_off
> src_in
)
989 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
990 dst_in
- in_off
- src_in
);
991 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
992 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
993 src
+1+src_nparam
+src_in
,
994 isl_min(dst_out
-out_off
, src_out
));
995 if (dst_out
-out_off
> src_out
)
996 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
997 dst_out
- out_off
- src_out
);
998 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
999 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1000 src
+1+src_nparam
+src_in
+src_out
,
1001 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1002 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1003 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1004 div_off
+src_map
->n_div
,
1005 dst_map
->n_div
- div_off
- src_map
->n_div
);
1008 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1009 struct isl_basic_map
*src_map
, isl_int
*src
,
1010 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1012 isl_int_set(dst
[0], src
[0]);
1013 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1016 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1017 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1022 if (!bmap1
|| !bmap2
)
1025 div_off
= bmap1
->n_div
;
1027 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1028 int i1
= isl_basic_map_alloc_equality(bmap1
);
1031 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1032 i_pos
, o_pos
, div_off
);
1035 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1036 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1039 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1040 i_pos
, o_pos
, div_off
);
1043 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1044 int i1
= isl_basic_map_alloc_div(bmap1
);
1047 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1048 i_pos
, o_pos
, div_off
);
1051 isl_basic_map_free(bmap2
);
1056 isl_basic_map_free(bmap1
);
1057 isl_basic_map_free(bmap2
);
1061 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1062 struct isl_basic_set
*bset2
, unsigned pos
)
1064 return (struct isl_basic_set
*)
1065 add_constraints((struct isl_basic_map
*)bset1
,
1066 (struct isl_basic_map
*)bset2
, 0, pos
);
1069 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1070 struct isl_dim
*dim
, unsigned extra
,
1071 unsigned n_eq
, unsigned n_ineq
)
1073 struct isl_basic_map
*ext
;
1083 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1084 base
->extra
>= base
->n_div
+ extra
;
1086 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1087 room_for_ineq(base
, n_ineq
)) {
1092 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1093 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1094 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1095 extra
+= base
->extra
;
1097 n_ineq
+= base
->n_ineq
;
1099 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1105 ext
->sample
= isl_vec_copy(base
->sample
);
1106 flags
= base
->flags
;
1107 ext
= add_constraints(ext
, base
, 0, 0);
1110 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1117 isl_basic_map_free(base
);
1121 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1122 struct isl_dim
*dim
, unsigned extra
,
1123 unsigned n_eq
, unsigned n_ineq
)
1125 return (struct isl_basic_set
*)
1126 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1127 extra
, n_eq
, n_ineq
);
1130 struct isl_basic_map
*isl_basic_map_extend_constraints(
1131 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1135 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1139 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1140 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1141 unsigned n_eq
, unsigned n_ineq
)
1143 struct isl_basic_map
*bmap
;
1144 struct isl_dim
*dim
;
1148 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1152 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1155 isl_basic_map_free(base
);
1159 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1160 unsigned nparam
, unsigned dim
, unsigned extra
,
1161 unsigned n_eq
, unsigned n_ineq
)
1163 return (struct isl_basic_set
*)
1164 isl_basic_map_extend((struct isl_basic_map
*)base
,
1165 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1168 struct isl_basic_set
*isl_basic_set_extend_constraints(
1169 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1171 return (struct isl_basic_set
*)
1172 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1176 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1178 return (struct isl_basic_set
*)
1179 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1182 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1187 if (bmap
->ref
> 1) {
1189 bmap
= isl_basic_map_dup(bmap
);
1192 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1196 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1204 return isl_set_dup(set
);
1207 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1215 return isl_map_dup(map
);
1218 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1219 unsigned a_len
, unsigned b_len
)
1221 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1222 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1223 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1226 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1227 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1235 isl_assert(bmap
->ctx
,
1236 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1238 if (n1
== 0 || n2
== 0)
1241 bmap
= isl_basic_map_cow(bmap
);
1245 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1246 if (isl_blk_is_error(blk
))
1249 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1251 bmap
->eq
[i
] + pos
, n1
, n2
);
1253 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1255 bmap
->ineq
[i
] + pos
, n1
, n2
);
1257 for (i
= 0; i
< bmap
->n_div
; ++i
)
1259 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1261 isl_blk_free(bmap
->ctx
, blk
);
1263 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1264 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1265 return isl_basic_map_finalize(bmap
);
1267 isl_basic_map_free(bmap
);
1271 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1272 __isl_take isl_basic_set
*bset
, unsigned n
)
1277 nparam
= isl_basic_set_n_param(bset
);
1278 dim
= isl_basic_set_n_dim(bset
);
1279 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1281 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1283 isl_basic_set_free(bset
);
1287 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1293 total
= isl_basic_map_total_dim(bmap
);
1294 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1295 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1297 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1299 i
= isl_basic_map_alloc_equality(bmap
);
1303 isl_int_set_si(bmap
->eq
[i
][0], 1);
1304 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1305 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1306 isl_vec_free(bmap
->sample
);
1307 bmap
->sample
= NULL
;
1308 return isl_basic_map_finalize(bmap
);
1310 isl_basic_map_free(bmap
);
1314 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1316 return (struct isl_basic_set
*)
1317 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1320 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1323 unsigned off
= isl_dim_total(bmap
->dim
);
1324 isl_int
*t
= bmap
->div
[a
];
1325 bmap
->div
[a
] = bmap
->div
[b
];
1328 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1329 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1331 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1332 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1334 for (i
= 0; i
< bmap
->n_div
; ++i
)
1335 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1336 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1339 /* Eliminate the specified n dimensions starting at first from the
1340 * constraints using Fourier-Motzkin. The dimensions themselves
1343 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1344 enum isl_dim_type type
, unsigned first
, unsigned n
)
1353 map
= isl_map_cow(map
);
1356 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1357 first
+= pos(map
->dim
, type
) - 1;
1359 for (i
= 0; i
< map
->n
; ++i
) {
1360 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1370 /* Eliminate the specified n dimensions starting at first from the
1371 * constraints using Fourier-Motzkin. The dimensions themselves
1374 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1375 enum isl_dim_type type
, unsigned first
, unsigned n
)
1377 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1380 /* Eliminate the specified n dimensions starting at first from the
1381 * constraints using Fourier-Motzkin. The dimensions themselves
1384 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1385 unsigned first
, unsigned n
)
1387 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1390 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1391 __isl_take isl_basic_map
*bmap
)
1395 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1400 return isl_basic_map_finalize(bmap
);
1403 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1404 __isl_take isl_basic_set
*bset
)
1406 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1407 (struct isl_basic_map
*)bset
);
1410 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1419 map
= isl_map_cow(map
);
1423 for (i
= 0; i
< map
->n
; ++i
) {
1424 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1434 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1436 return isl_map_remove_divs(set
);
1439 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1440 enum isl_dim_type type
, unsigned first
, unsigned n
)
1444 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1446 if (n
== 0 && !isl_dim_is_named_or_nested(bmap
->dim
, type
))
1448 bmap
= isl_basic_map_eliminate_vars(bmap
,
1449 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1452 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1454 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1457 isl_basic_map_free(bmap
);
1461 /* Return true if the definition of the given div (recursively) involves
1462 * any of the given variables.
1464 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1465 unsigned first
, unsigned n
)
1468 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1470 if (isl_int_is_zero(bmap
->div
[div
][0]))
1472 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1475 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1476 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1478 if (div_involves_vars(bmap
, i
, first
, n
))
1485 /* Remove all divs (recursively) involving any of the given dimensions
1486 * in their definitions.
1488 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1489 __isl_take isl_basic_map
*bmap
,
1490 enum isl_dim_type type
, unsigned first
, unsigned n
)
1496 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1498 first
+= isl_basic_map_offset(bmap
, type
);
1500 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1501 if (!div_involves_vars(bmap
, i
, first
, n
))
1503 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1511 isl_basic_map_free(bmap
);
1515 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1516 enum isl_dim_type type
, unsigned first
, unsigned n
)
1525 map
= isl_map_cow(map
);
1529 for (i
= 0; i
< map
->n
; ++i
) {
1530 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1541 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1542 enum isl_dim_type type
, unsigned first
, unsigned n
)
1544 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1548 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
1549 enum isl_dim_type type
, unsigned first
, unsigned n
)
1556 if (first
+ n
> isl_basic_set_dim(bset
, type
))
1557 isl_die(bset
->ctx
, isl_error_invalid
,
1558 "index out of bounds", return -1);
1560 first
+= isl_basic_set_offset(bset
, type
);
1561 for (i
= 0; i
< bset
->n_eq
; ++i
)
1562 if (isl_seq_first_non_zero(bset
->eq
[i
] + first
, n
) >= 0)
1564 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1565 if (isl_seq_first_non_zero(bset
->ineq
[i
] + first
, n
) >= 0)
1571 int isl_set_involves_dims(__isl_keep isl_set
*set
,
1572 enum isl_dim_type type
, unsigned first
, unsigned n
)
1579 if (first
+ n
> isl_set_dim(set
, type
))
1580 isl_die(set
->ctx
, isl_error_invalid
,
1581 "index out of bounds", return -1);
1583 for (i
= 0; i
< set
->n
; ++i
) {
1584 int involves
= isl_basic_set_involves_dims(set
->p
[i
],
1586 if (involves
< 0 || !involves
)
1593 /* Return true if the definition of the given div is unknown or depends
1596 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1599 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1601 if (isl_int_is_zero(bmap
->div
[div
][0]))
1604 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1605 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1607 if (div_is_unknown(bmap
, i
))
1614 /* Remove all divs that are unknown or defined in terms of unknown divs.
1616 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1617 __isl_take isl_basic_map
*bmap
)
1624 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1625 if (!div_is_unknown(bmap
, i
))
1627 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1633 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1642 map
= isl_map_cow(map
);
1646 for (i
= 0; i
< map
->n
; ++i
) {
1647 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1657 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1659 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1662 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1663 __isl_take isl_basic_set
*bset
,
1664 enum isl_dim_type type
, unsigned first
, unsigned n
)
1666 return (isl_basic_set
*)
1667 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1670 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1671 enum isl_dim_type type
, unsigned first
, unsigned n
)
1678 map
= isl_map_cow(map
);
1681 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1683 for (i
= 0; i
< map
->n
; ++i
) {
1684 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1685 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1689 map
= isl_map_drop(map
, type
, first
, n
);
1696 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1697 enum isl_dim_type type
, unsigned first
, unsigned n
)
1699 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1702 /* Project out n inputs starting at first using Fourier-Motzkin */
1703 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1704 unsigned first
, unsigned n
)
1706 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1709 static void dump_term(struct isl_basic_map
*bmap
,
1710 isl_int c
, int pos
, FILE *out
)
1713 unsigned in
= isl_basic_map_n_in(bmap
);
1714 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1715 unsigned nparam
= isl_basic_map_n_param(bmap
);
1717 isl_int_print(out
, c
, 0);
1719 if (!isl_int_is_one(c
))
1720 isl_int_print(out
, c
, 0);
1721 if (pos
< 1 + nparam
) {
1722 name
= isl_dim_get_name(bmap
->dim
,
1723 isl_dim_param
, pos
- 1);
1725 fprintf(out
, "%s", name
);
1727 fprintf(out
, "p%d", pos
- 1);
1728 } else if (pos
< 1 + nparam
+ in
)
1729 fprintf(out
, "i%d", pos
- 1 - nparam
);
1730 else if (pos
< 1 + nparam
+ dim
)
1731 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1733 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1737 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1738 int sign
, FILE *out
)
1742 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1746 for (i
= 0, first
= 1; i
< len
; ++i
) {
1747 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1750 fprintf(out
, " + ");
1752 isl_int_abs(v
, c
[i
]);
1753 dump_term(bmap
, v
, i
, out
);
1760 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1761 const char *op
, FILE *out
, int indent
)
1765 fprintf(out
, "%*s", indent
, "");
1767 dump_constraint_sign(bmap
, c
, 1, out
);
1768 fprintf(out
, " %s ", op
);
1769 dump_constraint_sign(bmap
, c
, -1, out
);
1773 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1774 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1776 fprintf(out
, "%*s", indent
, "");
1777 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1782 static void dump_constraints(struct isl_basic_map
*bmap
,
1783 isl_int
**c
, unsigned n
,
1784 const char *op
, FILE *out
, int indent
)
1788 for (i
= 0; i
< n
; ++i
)
1789 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1792 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1796 unsigned total
= isl_basic_map_total_dim(bmap
);
1798 for (j
= 0; j
< 1 + total
; ++j
) {
1799 if (isl_int_is_zero(exp
[j
]))
1801 if (!first
&& isl_int_is_pos(exp
[j
]))
1803 dump_term(bmap
, exp
[j
], j
, out
);
1808 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1812 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1813 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1815 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1816 fprintf(out
, "%*s", indent
, "");
1817 fprintf(out
, "e%d = [(", i
);
1818 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1820 isl_int_print(out
, bmap
->div
[i
][0], 0);
1821 fprintf(out
, "]\n");
1825 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
1826 FILE *out
, int indent
)
1829 fprintf(out
, "null basic set\n");
1833 fprintf(out
, "%*s", indent
, "");
1834 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1835 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1836 bset
->extra
, bset
->flags
);
1837 dump((struct isl_basic_map
*)bset
, out
, indent
);
1840 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
1841 FILE *out
, int indent
)
1844 fprintf(out
, "null basic map\n");
1848 fprintf(out
, "%*s", indent
, "");
1849 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1850 "flags: %x, n_name: %d\n",
1852 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1853 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1854 dump(bmap
, out
, indent
);
1857 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1862 total
= isl_basic_map_total_dim(bmap
);
1863 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1864 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1865 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1866 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1870 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1872 struct isl_set
*set
;
1876 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1877 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1878 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1879 sizeof(struct isl_set
) +
1880 (n
- 1) * sizeof(struct isl_basic_set
*));
1884 set
->ctx
= dim
->ctx
;
1885 isl_ctx_ref(set
->ctx
);
1897 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1898 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1900 struct isl_set
*set
;
1901 struct isl_dim
*dims
;
1903 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1907 set
= isl_set_alloc_dim(dims
, n
, flags
);
1911 /* Make sure "map" has room for at least "n" more basic maps.
1913 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1916 struct isl_map
*grown
= NULL
;
1920 isl_assert(map
->ctx
, n
>= 0, goto error
);
1921 if (map
->n
+ n
<= map
->size
)
1923 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1926 for (i
= 0; i
< map
->n
; ++i
) {
1927 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1935 isl_map_free(grown
);
1940 /* Make sure "set" has room for at least "n" more basic sets.
1942 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1944 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1947 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1950 struct isl_set
*dup
;
1955 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1958 for (i
= 0; i
< set
->n
; ++i
)
1959 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1963 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1965 return isl_map_from_basic_map(bset
);
1968 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1970 struct isl_map
*map
;
1975 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1976 return isl_map_add_basic_map(map
, bmap
);
1979 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1980 __isl_take isl_basic_set
*bset
)
1982 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1983 (struct isl_basic_map
*)bset
);
1986 void isl_set_free(struct isl_set
*set
)
1996 isl_ctx_deref(set
->ctx
);
1997 for (i
= 0; i
< set
->n
; ++i
)
1998 isl_basic_set_free(set
->p
[i
]);
1999 isl_dim_free(set
->dim
);
2003 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2008 fprintf(out
, "null set\n");
2012 fprintf(out
, "%*s", indent
, "");
2013 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2014 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2016 for (i
= 0; i
< set
->n
; ++i
) {
2017 fprintf(out
, "%*s", indent
, "");
2018 fprintf(out
, "basic set %d:\n", i
);
2019 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2023 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2028 fprintf(out
, "null map\n");
2032 fprintf(out
, "%*s", indent
, "");
2033 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2034 "flags: %x, n_name: %d\n",
2035 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2036 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
2037 for (i
= 0; i
< map
->n
; ++i
) {
2038 fprintf(out
, "%*s", indent
, "");
2039 fprintf(out
, "basic map %d:\n", i
);
2040 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2044 struct isl_basic_map
*isl_basic_map_intersect_domain(
2045 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2047 struct isl_basic_map
*bmap_domain
;
2052 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2053 bset
->dim
, isl_dim_param
), goto error
);
2055 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2056 isl_assert(bset
->ctx
,
2057 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2059 bmap
= isl_basic_map_cow(bmap
);
2062 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2063 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2064 bmap_domain
= isl_basic_map_from_domain(bset
);
2065 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2067 bmap
= isl_basic_map_simplify(bmap
);
2068 return isl_basic_map_finalize(bmap
);
2070 isl_basic_map_free(bmap
);
2071 isl_basic_set_free(bset
);
2075 struct isl_basic_map
*isl_basic_map_intersect_range(
2076 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2078 struct isl_basic_map
*bmap_range
;
2083 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2084 bset
->dim
, isl_dim_param
), goto error
);
2086 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2087 isl_assert(bset
->ctx
,
2088 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2090 if (isl_basic_set_is_universe(bset
)) {
2091 isl_basic_set_free(bset
);
2095 bmap
= isl_basic_map_cow(bmap
);
2098 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2099 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2100 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2101 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2103 bmap
= isl_basic_map_simplify(bmap
);
2104 return isl_basic_map_finalize(bmap
);
2106 isl_basic_map_free(bmap
);
2107 isl_basic_set_free(bset
);
2111 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2117 total
= 1 + isl_basic_map_total_dim(bmap
);
2118 if (total
!= vec
->size
)
2123 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2124 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2125 if (!isl_int_is_zero(s
)) {
2131 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2132 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2133 if (isl_int_is_neg(s
)) {
2144 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2146 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2149 struct isl_basic_map
*isl_basic_map_intersect(
2150 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2152 struct isl_vec
*sample
= NULL
;
2154 if (!bmap1
|| !bmap2
)
2157 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2158 bmap2
->dim
, isl_dim_param
), goto error
);
2159 if (isl_dim_total(bmap1
->dim
) ==
2160 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2161 isl_dim_total(bmap2
->dim
) !=
2162 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2163 return isl_basic_map_intersect(bmap2
, bmap1
);
2165 if (isl_dim_total(bmap2
->dim
) !=
2166 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2167 isl_assert(bmap1
->ctx
,
2168 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2170 if (bmap1
->sample
&&
2171 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2172 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2173 sample
= isl_vec_copy(bmap1
->sample
);
2174 else if (bmap2
->sample
&&
2175 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2176 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2177 sample
= isl_vec_copy(bmap2
->sample
);
2179 bmap1
= isl_basic_map_cow(bmap1
);
2182 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2183 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2184 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2187 isl_vec_free(sample
);
2189 isl_vec_free(bmap1
->sample
);
2190 bmap1
->sample
= sample
;
2193 bmap1
= isl_basic_map_simplify(bmap1
);
2194 return isl_basic_map_finalize(bmap1
);
2197 isl_vec_free(sample
);
2198 isl_basic_map_free(bmap1
);
2199 isl_basic_map_free(bmap2
);
2203 struct isl_basic_set
*isl_basic_set_intersect(
2204 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2206 return (struct isl_basic_set
*)
2207 isl_basic_map_intersect(
2208 (struct isl_basic_map
*)bset1
,
2209 (struct isl_basic_map
*)bset2
);
2212 /* Special case of isl_map_intersect, where both map1 and map2
2213 * are convex, without any divs and such that either map1 or map2
2214 * contains a single constraint. This constraint is then simply
2215 * added to the other map.
2217 static __isl_give isl_map
*map_intersect_add_constraint(
2218 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2220 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2221 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2222 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2223 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2225 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2226 return isl_map_intersect(map2
, map1
);
2228 isl_assert(map2
->ctx
,
2229 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2231 map1
= isl_map_cow(map1
);
2234 if (isl_map_plain_is_empty(map1
)) {
2238 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2239 if (map2
->p
[0]->n_eq
== 1)
2240 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2242 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2243 map2
->p
[0]->ineq
[0]);
2245 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2246 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2250 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2251 isl_basic_map_free(map1
->p
[0]);
2264 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2267 struct isl_map
*result
;
2273 if (isl_map_plain_is_empty(map1
) &&
2274 isl_dim_equal(map1
->dim
, map2
->dim
)) {
2278 if (isl_map_plain_is_empty(map2
) &&
2279 isl_dim_equal(map1
->dim
, map2
->dim
)) {
2284 if (map1
->n
== 1 && map2
->n
== 1 &&
2285 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2286 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2287 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2288 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2289 return map_intersect_add_constraint(map1
, map2
);
2290 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2291 map2
->dim
, isl_dim_param
), goto error
);
2292 if (isl_dim_total(map1
->dim
) ==
2293 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2294 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2295 return isl_map_intersect(map2
, map1
);
2297 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2298 isl_assert(map1
->ctx
,
2299 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2301 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2302 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2303 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2305 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2306 map1
->n
* map2
->n
, flags
);
2309 for (i
= 0; i
< map1
->n
; ++i
)
2310 for (j
= 0; j
< map2
->n
; ++j
) {
2311 struct isl_basic_map
*part
;
2312 part
= isl_basic_map_intersect(
2313 isl_basic_map_copy(map1
->p
[i
]),
2314 isl_basic_map_copy(map2
->p
[j
]));
2315 if (isl_basic_map_is_empty(part
))
2316 isl_basic_map_free(part
);
2318 result
= isl_map_add_basic_map(result
, part
);
2331 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2333 return (struct isl_set
*)
2334 isl_map_intersect((struct isl_map
*)set1
,
2335 (struct isl_map
*)set2
);
2338 /* The current implementation of isl_map_intersect accepts intersections
2339 * with parameter domains, so we can just call that for now.
2341 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map
,
2342 __isl_take isl_set
*params
)
2344 return isl_map_intersect(map
, params
);
2347 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2348 __isl_take isl_set
*params
)
2350 return isl_map_intersect_params(set
, params
);
2353 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2355 struct isl_dim
*dim
;
2356 struct isl_basic_set
*bset
;
2361 bmap
= isl_basic_map_cow(bmap
);
2364 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2365 in
= isl_basic_map_n_in(bmap
);
2366 bset
= isl_basic_set_from_basic_map(bmap
);
2367 bset
= isl_basic_set_swap_vars(bset
, in
);
2368 return isl_basic_map_from_basic_set(bset
, dim
);
2371 static __isl_give isl_basic_map
*basic_map_space_reset(
2372 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2376 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
2379 space
= isl_basic_map_get_dim(bmap
);
2380 space
= isl_dim_reset(space
, type
);
2381 bmap
= isl_basic_map_reset_dim(bmap
, space
);
2385 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2386 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2388 struct isl_dim
*res_dim
;
2389 struct isl_basic_map
*res
;
2390 struct isl_dim_map
*dim_map
;
2391 unsigned total
, off
;
2392 enum isl_dim_type t
;
2395 return basic_map_space_reset(bmap
, type
);
2400 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2402 total
= isl_basic_map_total_dim(bmap
) + n
;
2403 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2405 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2407 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2409 unsigned size
= isl_basic_map_dim(bmap
, t
);
2410 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2412 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2413 pos
, size
- pos
, off
+ pos
+ n
);
2415 off
+= isl_dim_size(res_dim
, t
);
2417 isl_dim_map_div(dim_map
, bmap
, off
);
2419 res
= isl_basic_map_alloc_dim(res_dim
,
2420 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2421 if (isl_basic_map_is_rational(bmap
))
2422 res
= isl_basic_map_set_rational(res
);
2423 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2424 return isl_basic_map_finalize(res
);
2427 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2428 enum isl_dim_type type
, unsigned n
)
2432 return isl_basic_map_insert(bmap
, type
,
2433 isl_basic_map_dim(bmap
, type
), n
);
2436 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2437 enum isl_dim_type type
, unsigned n
)
2441 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2442 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2444 isl_basic_set_free(bset
);
2448 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
2449 enum isl_dim_type type
)
2453 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
2456 space
= isl_map_get_dim(map
);
2457 space
= isl_dim_reset(space
, type
);
2458 map
= isl_map_reset_dim(map
, space
);
2462 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2463 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2468 return map_space_reset(map
, type
);
2470 map
= isl_map_cow(map
);
2474 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2478 for (i
= 0; i
< map
->n
; ++i
) {
2479 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2490 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2491 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2493 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2496 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2497 enum isl_dim_type type
, unsigned n
)
2501 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2504 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2505 enum isl_dim_type type
, unsigned n
)
2509 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2510 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2516 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2517 __isl_take isl_basic_map
*bmap
,
2518 enum isl_dim_type dst_type
, unsigned dst_pos
,
2519 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2521 struct isl_dim_map
*dim_map
;
2522 struct isl_basic_map
*res
;
2523 enum isl_dim_type t
;
2524 unsigned total
, off
;
2531 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2534 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2537 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2539 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2540 pos(bmap
->dim
, src_type
) + src_pos
+
2541 ((src_type
< dst_type
) ? n
: 0)) {
2542 bmap
= isl_basic_map_cow(bmap
);
2546 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2547 src_type
, src_pos
, n
);
2551 bmap
= isl_basic_map_finalize(bmap
);
2556 total
= isl_basic_map_total_dim(bmap
);
2557 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2560 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2561 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2562 if (t
== dst_type
) {
2563 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2566 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2569 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2570 dst_pos
, size
- dst_pos
, off
);
2571 off
+= size
- dst_pos
;
2572 } else if (t
== src_type
) {
2573 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2576 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2577 src_pos
+ n
, size
- src_pos
- n
, off
);
2578 off
+= size
- src_pos
- n
;
2580 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2584 isl_dim_map_div(dim_map
, bmap
, off
);
2586 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2587 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2588 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2590 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2591 src_type
, src_pos
, n
);
2595 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2596 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2597 bmap
= isl_basic_map_finalize(bmap
);
2601 isl_basic_map_free(bmap
);
2605 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2606 enum isl_dim_type dst_type
, unsigned dst_pos
,
2607 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2609 return (isl_basic_set
*)isl_basic_map_move_dims(
2610 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2613 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2614 enum isl_dim_type dst_type
, unsigned dst_pos
,
2615 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2619 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2620 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2621 src_type
, src_pos
, n
);
2627 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2628 enum isl_dim_type dst_type
, unsigned dst_pos
,
2629 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2638 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2641 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2644 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2646 map
= isl_map_cow(map
);
2650 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2654 for (i
= 0; i
< map
->n
; ++i
) {
2655 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2657 src_type
, src_pos
, n
);
2668 /* Move the specified dimensions to the last columns right before
2669 * the divs. Don't change the dimension specification of bmap.
2670 * That's the responsibility of the caller.
2672 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2673 enum isl_dim_type type
, unsigned first
, unsigned n
)
2675 struct isl_dim_map
*dim_map
;
2676 struct isl_basic_map
*res
;
2677 enum isl_dim_type t
;
2678 unsigned total
, off
;
2682 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2685 total
= isl_basic_map_total_dim(bmap
);
2686 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2689 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2690 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2692 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2695 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2696 first
, n
, total
- bmap
->n_div
- n
);
2697 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2698 first
+ n
, size
- (first
+ n
), off
);
2699 off
+= size
- (first
+ n
);
2701 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2705 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2707 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2708 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2709 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2713 /* Turn the n dimensions of type type, starting at first
2714 * into existentially quantified variables.
2716 __isl_give isl_basic_map
*isl_basic_map_project_out(
2717 __isl_take isl_basic_map
*bmap
,
2718 enum isl_dim_type type
, unsigned first
, unsigned n
)
2731 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2732 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2734 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2737 bmap
= move_last(bmap
, type
, first
, n
);
2738 bmap
= isl_basic_map_cow(bmap
);
2742 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2743 old
= bmap
->block2
.data
;
2744 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2745 (bmap
->extra
+ n
) * (1 + row_size
));
2746 if (!bmap
->block2
.data
)
2748 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2751 for (i
= 0; i
< n
; ++i
) {
2752 new_div
[i
] = bmap
->block2
.data
+
2753 (bmap
->extra
+ i
) * (1 + row_size
);
2754 isl_seq_clr(new_div
[i
], 1 + row_size
);
2756 for (i
= 0; i
< bmap
->extra
; ++i
)
2757 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2759 bmap
->div
= new_div
;
2763 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2766 bmap
= isl_basic_map_simplify(bmap
);
2767 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2768 return isl_basic_map_finalize(bmap
);
2770 isl_basic_map_free(bmap
);
2774 /* Turn the n dimensions of type type, starting at first
2775 * into existentially quantified variables.
2777 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2778 enum isl_dim_type type
, unsigned first
, unsigned n
)
2780 return (isl_basic_set
*)isl_basic_map_project_out(
2781 (isl_basic_map
*)bset
, type
, first
, n
);
2784 /* Turn the n dimensions of type type, starting at first
2785 * into existentially quantified variables.
2787 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2788 enum isl_dim_type type
, unsigned first
, unsigned n
)
2798 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2800 map
= isl_map_cow(map
);
2804 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2808 for (i
= 0; i
< map
->n
; ++i
) {
2809 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2820 /* Turn the n dimensions of type type, starting at first
2821 * into existentially quantified variables.
2823 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2824 enum isl_dim_type type
, unsigned first
, unsigned n
)
2826 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2829 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2833 for (i
= 0; i
< n
; ++i
) {
2834 j
= isl_basic_map_alloc_div(bmap
);
2837 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2841 isl_basic_map_free(bmap
);
2845 struct isl_basic_map
*isl_basic_map_apply_range(
2846 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2848 struct isl_dim
*dim_result
= NULL
;
2849 struct isl_basic_map
*bmap
;
2850 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2851 struct isl_dim_map
*dim_map1
, *dim_map2
;
2853 if (!bmap1
|| !bmap2
)
2856 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2857 isl_dim_copy(bmap2
->dim
));
2859 n_in
= isl_basic_map_n_in(bmap1
);
2860 n_out
= isl_basic_map_n_out(bmap2
);
2861 n
= isl_basic_map_n_out(bmap1
);
2862 nparam
= isl_basic_map_n_param(bmap1
);
2864 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2865 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2866 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2867 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2868 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2869 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2870 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2871 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2872 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2873 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2874 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2876 bmap
= isl_basic_map_alloc_dim(dim_result
,
2877 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2878 bmap1
->n_eq
+ bmap2
->n_eq
,
2879 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2880 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2881 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2882 bmap
= add_divs(bmap
, n
);
2883 bmap
= isl_basic_map_simplify(bmap
);
2884 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2885 return isl_basic_map_finalize(bmap
);
2887 isl_basic_map_free(bmap1
);
2888 isl_basic_map_free(bmap2
);
2892 struct isl_basic_set
*isl_basic_set_apply(
2893 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2898 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2901 return (struct isl_basic_set
*)
2902 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2904 isl_basic_set_free(bset
);
2905 isl_basic_map_free(bmap
);
2909 struct isl_basic_map
*isl_basic_map_apply_domain(
2910 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2912 if (!bmap1
|| !bmap2
)
2915 isl_assert(bmap1
->ctx
,
2916 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2917 isl_assert(bmap1
->ctx
,
2918 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2921 bmap1
= isl_basic_map_reverse(bmap1
);
2922 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2923 return isl_basic_map_reverse(bmap1
);
2925 isl_basic_map_free(bmap1
);
2926 isl_basic_map_free(bmap2
);
2930 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2931 * A \cap B -> f(A) + f(B)
2933 struct isl_basic_map
*isl_basic_map_sum(
2934 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2936 unsigned n_in
, n_out
, nparam
, total
, pos
;
2937 struct isl_basic_map
*bmap
= NULL
;
2938 struct isl_dim_map
*dim_map1
, *dim_map2
;
2941 if (!bmap1
|| !bmap2
)
2944 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2947 nparam
= isl_basic_map_n_param(bmap1
);
2948 n_in
= isl_basic_map_n_in(bmap1
);
2949 n_out
= isl_basic_map_n_out(bmap1
);
2951 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2952 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2953 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2954 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2955 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2956 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2957 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2958 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2959 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2960 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2961 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2963 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2964 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2965 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2966 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2967 for (i
= 0; i
< n_out
; ++i
) {
2968 int j
= isl_basic_map_alloc_equality(bmap
);
2971 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2972 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2973 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2974 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2976 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2977 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2978 bmap
= add_divs(bmap
, 2 * n_out
);
2980 bmap
= isl_basic_map_simplify(bmap
);
2981 return isl_basic_map_finalize(bmap
);
2983 isl_basic_map_free(bmap
);
2984 isl_basic_map_free(bmap1
);
2985 isl_basic_map_free(bmap2
);
2989 /* Given two maps A -> f(A) and B -> g(B), construct a map
2990 * A \cap B -> f(A) + f(B)
2992 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2994 struct isl_map
*result
;
3000 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3002 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3003 map1
->n
* map2
->n
, 0);
3006 for (i
= 0; i
< map1
->n
; ++i
)
3007 for (j
= 0; j
< map2
->n
; ++j
) {
3008 struct isl_basic_map
*part
;
3009 part
= isl_basic_map_sum(
3010 isl_basic_map_copy(map1
->p
[i
]),
3011 isl_basic_map_copy(map2
->p
[j
]));
3012 if (isl_basic_map_is_empty(part
))
3013 isl_basic_map_free(part
);
3015 result
= isl_map_add_basic_map(result
, part
);
3028 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3029 __isl_take isl_set
*set2
)
3031 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3034 /* Given a basic map A -> f(A), construct A -> -f(A).
3036 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3041 bmap
= isl_basic_map_cow(bmap
);
3045 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3046 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3047 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3048 for (j
= 0; j
< n
; ++j
)
3049 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3050 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3051 for (j
= 0; j
< n
; ++j
)
3052 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3053 for (i
= 0; i
< bmap
->n_div
; ++i
)
3054 for (j
= 0; j
< n
; ++j
)
3055 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3056 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3057 return isl_basic_map_finalize(bmap
);
3060 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3062 return isl_basic_map_neg(bset
);
3065 /* Given a map A -> f(A), construct A -> -f(A).
3067 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3071 map
= isl_map_cow(map
);
3075 for (i
= 0; i
< map
->n
; ++i
) {
3076 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3087 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3089 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3092 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3093 * A -> floor(f(A)/d).
3095 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3098 unsigned n_in
, n_out
, nparam
, total
, pos
;
3099 struct isl_basic_map
*result
= NULL
;
3100 struct isl_dim_map
*dim_map
;
3106 nparam
= isl_basic_map_n_param(bmap
);
3107 n_in
= isl_basic_map_n_in(bmap
);
3108 n_out
= isl_basic_map_n_out(bmap
);
3110 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3111 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3112 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3113 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3114 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3115 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3117 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
3118 bmap
->n_div
+ n_out
,
3119 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3120 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3121 result
= add_divs(result
, n_out
);
3122 for (i
= 0; i
< n_out
; ++i
) {
3124 j
= isl_basic_map_alloc_inequality(result
);
3127 isl_seq_clr(result
->ineq
[j
], 1+total
);
3128 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3129 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3130 j
= isl_basic_map_alloc_inequality(result
);
3133 isl_seq_clr(result
->ineq
[j
], 1+total
);
3134 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3135 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3136 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3139 result
= isl_basic_map_simplify(result
);
3140 return isl_basic_map_finalize(result
);
3142 isl_basic_map_free(result
);
3146 /* Given a map A -> f(A) and an integer d, construct a map
3147 * A -> floor(f(A)/d).
3149 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3153 map
= isl_map_cow(map
);
3157 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3158 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3159 for (i
= 0; i
< map
->n
; ++i
) {
3160 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3171 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3177 i
= isl_basic_map_alloc_equality(bmap
);
3180 nparam
= isl_basic_map_n_param(bmap
);
3181 n_in
= isl_basic_map_n_in(bmap
);
3182 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3183 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3184 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3185 return isl_basic_map_finalize(bmap
);
3187 isl_basic_map_free(bmap
);
3191 /* Add a constraints to "bmap" expressing i_pos < o_pos
3193 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3199 i
= isl_basic_map_alloc_inequality(bmap
);
3202 nparam
= isl_basic_map_n_param(bmap
);
3203 n_in
= isl_basic_map_n_in(bmap
);
3204 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3205 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3206 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3207 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3208 return isl_basic_map_finalize(bmap
);
3210 isl_basic_map_free(bmap
);
3214 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3216 static __isl_give isl_basic_map
*var_less_or_equal(
3217 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3223 i
= isl_basic_map_alloc_inequality(bmap
);
3226 nparam
= isl_basic_map_n_param(bmap
);
3227 n_in
= isl_basic_map_n_in(bmap
);
3228 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3229 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3230 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3231 return isl_basic_map_finalize(bmap
);
3233 isl_basic_map_free(bmap
);
3237 /* Add a constraints to "bmap" expressing i_pos > o_pos
3239 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3245 i
= isl_basic_map_alloc_inequality(bmap
);
3248 nparam
= isl_basic_map_n_param(bmap
);
3249 n_in
= isl_basic_map_n_in(bmap
);
3250 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3251 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3252 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3253 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3254 return isl_basic_map_finalize(bmap
);
3256 isl_basic_map_free(bmap
);
3260 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3262 static __isl_give isl_basic_map
*var_more_or_equal(
3263 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3269 i
= isl_basic_map_alloc_inequality(bmap
);
3272 nparam
= isl_basic_map_n_param(bmap
);
3273 n_in
= isl_basic_map_n_in(bmap
);
3274 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3275 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3276 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3277 return isl_basic_map_finalize(bmap
);
3279 isl_basic_map_free(bmap
);
3283 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3286 struct isl_basic_map
*bmap
;
3287 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3290 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3291 bmap
= var_equal(bmap
, i
);
3292 return isl_basic_map_finalize(bmap
);
3295 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3297 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3300 struct isl_basic_map
*bmap
;
3301 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3304 for (i
= 0; i
< pos
&& bmap
; ++i
)
3305 bmap
= var_equal(bmap
, i
);
3307 bmap
= var_less(bmap
, pos
);
3308 return isl_basic_map_finalize(bmap
);
3311 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3313 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3314 __isl_take isl_dim
*dim
, unsigned pos
)
3317 isl_basic_map
*bmap
;
3319 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3320 for (i
= 0; i
< pos
; ++i
)
3321 bmap
= var_equal(bmap
, i
);
3322 bmap
= var_less_or_equal(bmap
, pos
);
3323 return isl_basic_map_finalize(bmap
);
3326 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3328 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3331 struct isl_basic_map
*bmap
;
3332 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3335 for (i
= 0; i
< pos
&& bmap
; ++i
)
3336 bmap
= var_equal(bmap
, i
);
3338 bmap
= var_more(bmap
, pos
);
3339 return isl_basic_map_finalize(bmap
);
3342 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3344 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3345 __isl_take isl_dim
*dim
, unsigned pos
)
3348 isl_basic_map
*bmap
;
3350 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3351 for (i
= 0; i
< pos
; ++i
)
3352 bmap
= var_equal(bmap
, i
);
3353 bmap
= var_more_or_equal(bmap
, pos
);
3354 return isl_basic_map_finalize(bmap
);
3357 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3358 unsigned n
, int equal
)
3360 struct isl_map
*map
;
3363 if (n
== 0 && equal
)
3364 return isl_map_universe(dims
);
3366 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3368 for (i
= 0; i
+ 1 < n
; ++i
)
3369 map
= isl_map_add_basic_map(map
,
3370 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3373 map
= isl_map_add_basic_map(map
,
3374 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3376 map
= isl_map_add_basic_map(map
,
3377 isl_basic_map_less_at(dims
, n
- 1));
3384 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3388 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3391 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3393 return map_lex_lte_first(dim
, n
, 0);
3396 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3398 return map_lex_lte_first(dim
, n
, 1);
3401 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3403 return map_lex_lte(isl_dim_map_from_set(set_dim
), 0);
3406 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3408 return map_lex_lte(isl_dim_map_from_set(set_dim
), 1);
3411 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3412 unsigned n
, int equal
)
3414 struct isl_map
*map
;
3417 if (n
== 0 && equal
)
3418 return isl_map_universe(dims
);
3420 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3422 for (i
= 0; i
+ 1 < n
; ++i
)
3423 map
= isl_map_add_basic_map(map
,
3424 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3427 map
= isl_map_add_basic_map(map
,
3428 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3430 map
= isl_map_add_basic_map(map
,
3431 isl_basic_map_more_at(dims
, n
- 1));
3438 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3442 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3445 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3447 return map_lex_gte_first(dim
, n
, 0);
3450 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3452 return map_lex_gte_first(dim
, n
, 1);
3455 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3457 return map_lex_gte(isl_dim_map_from_set(set_dim
), 0);
3460 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3462 return map_lex_gte(isl_dim_map_from_set(set_dim
), 1);
3465 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3466 __isl_take isl_set
*set2
)
3469 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3470 map
= isl_map_intersect_domain(map
, set1
);
3471 map
= isl_map_intersect_range(map
, set2
);
3475 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3476 __isl_take isl_set
*set2
)
3479 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3480 map
= isl_map_intersect_domain(map
, set1
);
3481 map
= isl_map_intersect_range(map
, set2
);
3485 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3486 __isl_take isl_set
*set2
)
3489 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3490 map
= isl_map_intersect_domain(map
, set1
);
3491 map
= isl_map_intersect_range(map
, set2
);
3495 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3496 __isl_take isl_set
*set2
)
3499 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3500 map
= isl_map_intersect_domain(map
, set1
);
3501 map
= isl_map_intersect_range(map
, set2
);
3505 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3506 __isl_take isl_map
*map2
)
3509 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3510 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3511 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3515 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3516 __isl_take isl_map
*map2
)
3519 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3520 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3521 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3525 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3526 __isl_take isl_map
*map2
)
3529 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3530 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3531 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3535 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3536 __isl_take isl_map
*map2
)
3539 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3540 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3541 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3545 struct isl_basic_map
*isl_basic_map_from_basic_set(
3546 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3548 struct isl_basic_map
*bmap
;
3550 bset
= isl_basic_set_cow(bset
);
3554 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3555 isl_dim_free(bset
->dim
);
3556 bmap
= (struct isl_basic_map
*) bset
;
3558 return isl_basic_map_finalize(bmap
);
3560 isl_basic_set_free(bset
);
3565 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3569 if (bmap
->dim
->n_in
== 0)
3570 return (struct isl_basic_set
*)bmap
;
3571 bmap
= isl_basic_map_cow(bmap
);
3574 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3577 bmap
= isl_basic_map_finalize(bmap
);
3578 return (struct isl_basic_set
*)bmap
;
3580 isl_basic_map_free(bmap
);
3584 /* For a div d = floor(f/m), add the constraints
3587 * -(f-(n-1)) + m d >= 0
3589 * Note that the second constraint is the negation of
3593 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3594 unsigned pos
, isl_int
*div
)
3597 unsigned total
= isl_basic_map_total_dim(bmap
);
3599 i
= isl_basic_map_alloc_inequality(bmap
);
3602 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3603 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3605 j
= isl_basic_map_alloc_inequality(bmap
);
3608 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3609 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3610 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3614 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3615 unsigned pos
, isl_int
*div
)
3617 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3621 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3623 unsigned total
= isl_basic_map_total_dim(bmap
);
3624 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3626 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3630 struct isl_basic_set
*isl_basic_map_underlying_set(
3631 struct isl_basic_map
*bmap
)
3635 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3637 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3638 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3639 return (struct isl_basic_set
*)bmap
;
3640 bmap
= isl_basic_map_cow(bmap
);
3643 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3646 bmap
->extra
-= bmap
->n_div
;
3648 bmap
= isl_basic_map_finalize(bmap
);
3649 return (struct isl_basic_set
*)bmap
;
3654 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3655 __isl_take isl_basic_set
*bset
)
3657 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3660 struct isl_basic_map
*isl_basic_map_overlying_set(
3661 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3663 struct isl_basic_map
*bmap
;
3664 struct isl_ctx
*ctx
;
3671 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3672 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3673 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3675 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3676 isl_basic_map_free(like
);
3677 return (struct isl_basic_map
*)bset
;
3679 bset
= isl_basic_set_cow(bset
);
3682 total
= bset
->dim
->n_out
+ bset
->extra
;
3683 bmap
= (struct isl_basic_map
*)bset
;
3684 isl_dim_free(bmap
->dim
);
3685 bmap
->dim
= isl_dim_copy(like
->dim
);
3688 bmap
->n_div
= like
->n_div
;
3689 bmap
->extra
+= like
->n_div
;
3693 ltotal
= total
- bmap
->extra
+ like
->extra
;
3696 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3697 bmap
->extra
* (1 + 1 + total
));
3698 if (isl_blk_is_error(bmap
->block2
))
3700 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
3704 for (i
= 0; i
< bmap
->extra
; ++i
)
3705 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3706 for (i
= 0; i
< like
->n_div
; ++i
) {
3707 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3708 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3710 bmap
= isl_basic_map_extend_constraints(bmap
,
3711 0, 2 * like
->n_div
);
3712 for (i
= 0; i
< like
->n_div
; ++i
) {
3713 if (isl_int_is_zero(bmap
->div
[i
][0]))
3715 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3719 isl_basic_map_free(like
);
3720 bmap
= isl_basic_map_simplify(bmap
);
3721 bmap
= isl_basic_map_finalize(bmap
);
3724 isl_basic_map_free(like
);
3725 isl_basic_set_free(bset
);
3729 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3730 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3732 return (struct isl_basic_set
*)
3733 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3736 struct isl_set
*isl_set_from_underlying_set(
3737 struct isl_set
*set
, struct isl_basic_set
*like
)
3743 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3745 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3746 isl_basic_set_free(like
);
3749 set
= isl_set_cow(set
);
3752 for (i
= 0; i
< set
->n
; ++i
) {
3753 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3754 isl_basic_set_copy(like
));
3758 isl_dim_free(set
->dim
);
3759 set
->dim
= isl_dim_copy(like
->dim
);
3762 isl_basic_set_free(like
);
3765 isl_basic_set_free(like
);
3770 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3774 map
= isl_map_cow(map
);
3777 map
->dim
= isl_dim_cow(map
->dim
);
3781 for (i
= 1; i
< map
->n
; ++i
)
3782 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3784 for (i
= 0; i
< map
->n
; ++i
) {
3785 map
->p
[i
] = (struct isl_basic_map
*)
3786 isl_basic_map_underlying_set(map
->p
[i
]);
3791 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3793 isl_dim_free(map
->dim
);
3794 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3798 return (struct isl_set
*)map
;
3804 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3806 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3809 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3810 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3812 bmap
= isl_basic_map_cow(bmap
);
3816 isl_dim_free(bmap
->dim
);
3819 bmap
= isl_basic_map_finalize(bmap
);
3823 isl_basic_map_free(bmap
);
3828 __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3829 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3831 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3835 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3836 __isl_take isl_dim
*dim
)
3840 map
= isl_map_cow(map
);
3844 for (i
= 0; i
< map
->n
; ++i
) {
3845 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3850 isl_dim_free(map
->dim
);
3860 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3861 __isl_take isl_dim
*dim
)
3863 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3866 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3869 struct isl_basic_set
*domain
;
3875 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3877 n_in
= isl_basic_map_n_in(bmap
);
3878 n_out
= isl_basic_map_n_out(bmap
);
3879 domain
= isl_basic_set_from_basic_map(bmap
);
3880 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3882 domain
= isl_basic_set_reset_dim(domain
, dim
);
3887 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
3891 return isl_dim_may_be_set(bmap
->dim
);
3894 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3898 if (isl_basic_map_may_be_set(bmap
))
3900 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3903 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3904 __isl_take isl_basic_map
*bmap
)
3908 isl_basic_map
*domain
;
3909 int nparam
, n_in
, n_out
;
3912 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3913 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3914 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3916 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3917 domain
= isl_basic_map_universe(dim
);
3919 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3920 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3921 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3923 total
= isl_basic_map_total_dim(bmap
);
3925 for (i
= 0; i
< n_in
; ++i
) {
3926 k
= isl_basic_map_alloc_equality(bmap
);
3929 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3930 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3931 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3934 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3935 return isl_basic_map_finalize(bmap
);
3937 isl_basic_map_free(bmap
);
3941 __isl_give isl_basic_map
*isl_basic_map_range_map(
3942 __isl_take isl_basic_map
*bmap
)
3946 isl_basic_map
*range
;
3947 int nparam
, n_in
, n_out
;
3950 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3951 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3952 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3954 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3955 range
= isl_basic_map_universe(dim
);
3957 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3958 bmap
= isl_basic_map_apply_range(bmap
, range
);
3959 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3961 total
= isl_basic_map_total_dim(bmap
);
3963 for (i
= 0; i
< n_out
; ++i
) {
3964 k
= isl_basic_map_alloc_equality(bmap
);
3967 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3968 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3969 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3972 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3973 return isl_basic_map_finalize(bmap
);
3975 isl_basic_map_free(bmap
);
3979 int isl_map_may_be_set(__isl_keep isl_map
*map
)
3983 return isl_dim_may_be_set(map
->dim
);
3986 struct isl_set
*isl_map_range(struct isl_map
*map
)
3989 struct isl_set
*set
;
3993 if (isl_map_may_be_set(map
))
3994 return (isl_set
*)map
;
3996 map
= isl_map_cow(map
);
4000 set
= (struct isl_set
*) map
;
4001 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
4004 for (i
= 0; i
< map
->n
; ++i
) {
4005 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4009 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4010 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4017 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4020 isl_dim
*domain_dim
;
4022 map
= isl_map_cow(map
);
4026 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
4027 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
4028 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
4031 for (i
= 0; i
< map
->n
; ++i
) {
4032 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4036 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4037 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4044 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4049 map
= isl_map_cow(map
);
4053 range_dim
= isl_dim_range(isl_map_get_dim(map
));
4054 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
4055 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
4058 for (i
= 0; i
< map
->n
; ++i
) {
4059 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4063 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4064 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4071 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
4074 struct isl_map
*map
= NULL
;
4076 set
= isl_set_cow(set
);
4079 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
4080 map
= (struct isl_map
*)set
;
4081 for (i
= 0; i
< set
->n
; ++i
) {
4082 map
->p
[i
] = isl_basic_map_from_basic_set(
4083 set
->p
[i
], isl_dim_copy(dim
));
4087 isl_dim_free(map
->dim
);
4096 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4097 __isl_take isl_basic_set
*bset
)
4099 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4102 __isl_give isl_basic_map
*isl_basic_map_from_range(
4103 __isl_take isl_basic_set
*bset
)
4105 return (isl_basic_map
*)bset
;
4108 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4110 return (struct isl_map
*)set
;
4113 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4115 return isl_map_reverse(isl_map_from_range(set
));
4118 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4119 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4121 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain
),
4122 isl_basic_map_from_range(range
));
4125 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4126 __isl_take isl_set
*range
)
4128 return isl_map_apply_range(isl_map_from_domain(domain
),
4129 isl_map_from_range(range
));
4132 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4135 struct isl_set
*set
= NULL
;
4139 map
= isl_map_cow(map
);
4142 map
->dim
= isl_dim_as_set_dim(map
->dim
);
4145 set
= (struct isl_set
*)map
;
4146 for (i
= 0; i
< map
->n
; ++i
) {
4147 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4157 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
4159 struct isl_map
*map
;
4163 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4164 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4165 sizeof(struct isl_map
) +
4166 (n
- 1) * sizeof(struct isl_basic_map
*));
4170 map
->ctx
= dim
->ctx
;
4171 isl_ctx_ref(map
->ctx
);
4183 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4184 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4187 struct isl_map
*map
;
4188 struct isl_dim
*dims
;
4190 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4194 map
= isl_map_alloc_dim(dims
, n
, flags
);
4198 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4200 struct isl_basic_map
*bmap
;
4201 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4202 bmap
= isl_basic_map_set_to_empty(bmap
);
4206 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4208 struct isl_basic_set
*bset
;
4209 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4210 bset
= isl_basic_set_set_to_empty(bset
);
4214 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4216 struct isl_basic_map
*bmap
;
4219 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4220 bmap
= isl_basic_map_set_to_empty(bmap
);
4224 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4226 struct isl_basic_map
*bmap
;
4229 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4230 bmap
= isl_basic_map_set_to_empty(bmap
);
4234 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4236 struct isl_basic_set
*bset
;
4239 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4240 bset
= isl_basic_set_set_to_empty(bset
);
4244 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4246 struct isl_basic_map
*bmap
;
4247 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4248 bmap
= isl_basic_map_finalize(bmap
);
4252 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4254 struct isl_basic_set
*bset
;
4255 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4256 bset
= isl_basic_set_finalize(bset
);
4260 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_dim
*dim
)
4263 unsigned total
= isl_dim_total(dim
);
4264 isl_basic_map
*bmap
;
4266 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, total
);
4267 for (i
= 0; i
< total
; ++i
) {
4268 int k
= isl_basic_map_alloc_inequality(bmap
);
4271 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4272 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4276 isl_basic_map_free(bmap
);
4280 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_dim
*dim
)
4282 return isl_basic_map_nat_universe(dim
);
4285 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_dim
*dim
)
4287 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4290 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_dim
*dim
)
4292 return isl_map_nat_universe(dim
);
4295 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4296 __isl_keep isl_basic_map
*model
)
4300 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4303 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4307 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4310 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4311 __isl_keep isl_set
*model
)
4315 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4318 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4320 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4323 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4327 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4330 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4334 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4337 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4339 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4342 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4346 return isl_set_empty(isl_dim_copy(model
->dim
));
4349 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4351 struct isl_map
*map
;
4354 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4355 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4359 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4361 struct isl_set
*set
;
4364 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4365 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4369 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4373 return isl_set_universe(isl_dim_copy(model
->dim
));
4376 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4379 struct isl_map
*dup
;
4383 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4384 for (i
= 0; i
< map
->n
; ++i
)
4385 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4389 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4390 __isl_take isl_basic_map
*bmap
)
4394 if (isl_basic_map_plain_is_empty(bmap
)) {
4395 isl_basic_map_free(bmap
);
4398 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4399 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4400 map
->p
[map
->n
] = bmap
;
4402 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4408 isl_basic_map_free(bmap
);
4412 void isl_map_free(struct isl_map
*map
)
4422 isl_ctx_deref(map
->ctx
);
4423 for (i
= 0; i
< map
->n
; ++i
)
4424 isl_basic_map_free(map
->p
[i
]);
4425 isl_dim_free(map
->dim
);
4429 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4430 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4434 base
= isl_map_cow(base
);
4438 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4441 for (i
= 0; i
< base
->n
; ++i
) {
4442 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4443 isl_dim_copy(base
->dim
), 0, 0, 0);
4453 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4454 unsigned nparam
, unsigned dim
)
4456 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4460 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4461 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4465 bmap
= isl_basic_map_cow(bmap
);
4466 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4467 j
= isl_basic_map_alloc_equality(bmap
);
4470 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4471 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4472 isl_int_set_si(bmap
->eq
[j
][0], value
);
4473 bmap
= isl_basic_map_simplify(bmap
);
4474 return isl_basic_map_finalize(bmap
);
4476 isl_basic_map_free(bmap
);
4480 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4481 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4485 bmap
= isl_basic_map_cow(bmap
);
4486 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4487 j
= isl_basic_map_alloc_equality(bmap
);
4490 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4491 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4492 isl_int_set(bmap
->eq
[j
][0], value
);
4493 bmap
= isl_basic_map_simplify(bmap
);
4494 return isl_basic_map_finalize(bmap
);
4496 isl_basic_map_free(bmap
);
4500 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4501 enum isl_dim_type type
, unsigned pos
, int value
)
4505 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4506 return isl_basic_map_fix_pos_si(bmap
,
4507 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4509 isl_basic_map_free(bmap
);
4513 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4514 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4518 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4519 return isl_basic_map_fix_pos(bmap
,
4520 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4522 isl_basic_map_free(bmap
);
4526 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4527 enum isl_dim_type type
, unsigned pos
, int value
)
4529 return (struct isl_basic_set
*)
4530 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4534 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4535 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4537 return (struct isl_basic_set
*)
4538 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4542 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4543 unsigned input
, int value
)
4545 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4548 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4549 unsigned dim
, int value
)
4551 return (struct isl_basic_set
*)
4552 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4553 isl_dim_set
, dim
, value
);
4556 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4557 enum isl_dim_type type
, unsigned pos
, int value
)
4561 map
= isl_map_cow(map
);
4565 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4566 for (i
= 0; i
< map
->n
; ++i
) {
4567 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4571 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4578 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4579 enum isl_dim_type type
, unsigned pos
, int value
)
4581 return (struct isl_set
*)
4582 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4585 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4586 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4590 map
= isl_map_cow(map
);
4594 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4595 for (i
= 0; i
< map
->n
; ++i
) {
4596 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4600 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4607 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4608 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4610 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4613 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4614 unsigned input
, int value
)
4616 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4619 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4621 return (struct isl_set
*)
4622 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4625 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4626 __isl_take isl_basic_map
*bmap
,
4627 enum isl_dim_type type
, unsigned pos
, int value
)
4633 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4634 pos
+= isl_basic_map_offset(bmap
, type
);
4635 bmap
= isl_basic_map_cow(bmap
);
4636 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4637 j
= isl_basic_map_alloc_inequality(bmap
);
4640 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4641 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4642 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4643 bmap
= isl_basic_map_simplify(bmap
);
4644 return isl_basic_map_finalize(bmap
);
4646 isl_basic_map_free(bmap
);
4650 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4651 unsigned dim
, isl_int value
)
4655 bset
= isl_basic_set_cow(bset
);
4656 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4657 j
= isl_basic_set_alloc_inequality(bset
);
4660 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4661 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4662 isl_int_neg(bset
->ineq
[j
][0], value
);
4663 bset
= isl_basic_set_simplify(bset
);
4664 return isl_basic_set_finalize(bset
);
4666 isl_basic_set_free(bset
);
4670 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4671 enum isl_dim_type type
, unsigned pos
, int value
)
4675 map
= isl_map_cow(map
);
4679 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4680 for (i
= 0; i
< map
->n
; ++i
) {
4681 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4686 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4693 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4694 enum isl_dim_type type
, unsigned pos
, int value
)
4696 return (struct isl_set
*)
4697 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4700 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4705 set
= isl_set_cow(set
);
4709 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4710 for (i
= 0; i
< set
->n
; ++i
) {
4711 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4721 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4725 map
= isl_map_cow(map
);
4729 map
->dim
= isl_dim_reverse(map
->dim
);
4732 for (i
= 0; i
< map
->n
; ++i
) {
4733 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4737 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4744 static struct isl_map
*isl_basic_map_partial_lexopt(
4745 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4746 struct isl_set
**empty
, int max
)
4750 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4751 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4753 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4755 isl_basic_map_free(bmap
);
4756 isl_basic_set_free(dom
);
4762 struct isl_map
*isl_basic_map_partial_lexmax(
4763 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4764 struct isl_set
**empty
)
4766 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4769 struct isl_map
*isl_basic_map_partial_lexmin(
4770 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4771 struct isl_set
**empty
)
4773 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4776 struct isl_set
*isl_basic_set_partial_lexmin(
4777 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4778 struct isl_set
**empty
)
4780 return (struct isl_set
*)
4781 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4785 struct isl_set
*isl_basic_set_partial_lexmax(
4786 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4787 struct isl_set
**empty
)
4789 return (struct isl_set
*)
4790 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4794 /* Given a basic map "bmap", compute the lexicographically minimal
4795 * (or maximal) image element for each domain element in dom.
4796 * Set *empty to those elements in dom that do not have an image element.
4798 * We first make sure the basic sets in dom are disjoint and then
4799 * simply collect the results over each of the basic sets separately.
4800 * We could probably improve the efficiency a bit by moving the union
4801 * domain down into the parametric integer programming.
4803 static __isl_give isl_map
*basic_map_partial_lexopt(
4804 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4805 __isl_give isl_set
**empty
, int max
)
4808 struct isl_map
*res
;
4810 dom
= isl_set_make_disjoint(dom
);
4814 if (isl_set_plain_is_empty(dom
)) {
4815 res
= isl_map_empty_like_basic_map(bmap
);
4816 *empty
= isl_set_empty_like(dom
);
4818 isl_basic_map_free(bmap
);
4822 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4823 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4825 for (i
= 1; i
< dom
->n
; ++i
) {
4826 struct isl_map
*res_i
;
4827 struct isl_set
*empty_i
;
4829 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4830 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4832 res
= isl_map_union_disjoint(res
, res_i
);
4833 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4837 isl_basic_map_free(bmap
);
4842 isl_basic_map_free(bmap
);
4846 /* Given a map "map", compute the lexicographically minimal
4847 * (or maximal) image element for each domain element in dom.
4848 * Set *empty to those elements in dom that do not have an image element.
4850 * We first compute the lexicographically minimal or maximal element
4851 * in the first basic map. This results in a partial solution "res"
4852 * and a subset "todo" of dom that still need to be handled.
4853 * We then consider each of the remaining maps in "map" and successively
4854 * improve both "res" and "todo".
4856 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4857 * Assume we are computing the lexicographical maximum.
4858 * We first compute the lexicographically maximal element in basic map i.
4859 * This results in a partial solution res_i and a subset todo_i.
4860 * Then we combine these results with those obtain for the first k basic maps
4861 * to obtain a result that is valid for the first k+1 basic maps.
4862 * In particular, the set where there is no solution is the set where
4863 * there is no solution for the first k basic maps and also no solution
4864 * for the ith basic map, i.e.,
4866 * todo^i = todo^k * todo_i
4868 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4869 * solutions, arbitrarily breaking ties in favor of res^k.
4870 * That is, when res^k(a) >= res_i(a), we pick res^k and
4871 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4872 * the lexicographic order.)
4873 * In practice, we compute
4875 * res^k * (res_i . "<=")
4879 * res_i * (res^k . "<")
4881 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4882 * where only one of res^k and res_i provides a solution and we simply pick
4889 * Note that we only compute these intersections when dom(res^k) intersects
4890 * dom(res_i). Otherwise, the only effect of these intersections is to
4891 * potentially break up res^k and res_i into smaller pieces.
4892 * We want to avoid such splintering as much as possible.
4893 * In fact, an earlier implementation of this function would look for
4894 * better results in the domain of res^k and for extra results in todo^k,
4895 * but this would always result in a splintering according to todo^k,
4896 * even when the domain of basic map i is disjoint from the domains of
4897 * the previous basic maps.
4899 static __isl_give isl_map
*isl_map_partial_lexopt(
4900 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4901 __isl_give isl_set
**empty
, int max
)
4904 struct isl_map
*res
;
4905 struct isl_set
*todo
;
4910 if (isl_map_plain_is_empty(map
)) {
4918 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4919 isl_set_copy(dom
), &todo
, max
);
4921 for (i
= 1; i
< map
->n
; ++i
) {
4925 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
4927 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4928 isl_set_copy(dom
), &todo_i
, max
);
4931 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
4932 le
= isl_map_lex_le(dim
);
4934 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
4935 le
= isl_map_lex_ge(dim
);
4937 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4938 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
4939 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
4940 le
= isl_map_intersect(le
, isl_map_copy(res
));
4942 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
4943 res
= isl_map_intersect_domain(res
,
4944 isl_set_copy(todo_i
));
4945 res_i
= isl_map_intersect_domain(res_i
,
4946 isl_set_copy(todo
));
4949 res
= isl_map_union_disjoint(res
, res_i
);
4950 res
= isl_map_union_disjoint(res
, lt
);
4951 res
= isl_map_union_disjoint(res
, le
);
4953 todo
= isl_set_intersect(todo
, todo_i
);
4973 __isl_give isl_map
*isl_map_partial_lexmax(
4974 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4975 __isl_give isl_set
**empty
)
4977 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4980 __isl_give isl_map
*isl_map_partial_lexmin(
4981 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4982 __isl_give isl_set
**empty
)
4984 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4987 __isl_give isl_set
*isl_set_partial_lexmin(
4988 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4989 __isl_give isl_set
**empty
)
4991 return (struct isl_set
*)
4992 isl_map_partial_lexmin((struct isl_map
*)set
,
4996 __isl_give isl_set
*isl_set_partial_lexmax(
4997 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4998 __isl_give isl_set
**empty
)
5000 return (struct isl_set
*)
5001 isl_map_partial_lexmax((struct isl_map
*)set
,
5005 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5007 struct isl_basic_set
*dom
= NULL
;
5008 struct isl_dim
*dom_dim
;
5012 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
5013 dom
= isl_basic_set_universe(dom_dim
);
5014 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5016 isl_basic_map_free(bmap
);
5020 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5022 return isl_basic_map_lexopt(bmap
, 0);
5025 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5027 return isl_basic_map_lexopt(bmap
, 1);
5030 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5032 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
5035 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
5037 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
5040 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
5042 struct isl_set
*dom
= NULL
;
5043 struct isl_dim
*dom_dim
;
5047 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
5048 dom
= isl_set_universe(dom_dim
);
5049 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
5055 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
5057 return isl_map_lexopt(map
, 0);
5060 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
5062 return isl_map_lexopt(map
, 1);
5065 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5067 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5070 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5072 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5075 /* Construct a map that equates the two given dimensions in the given space.
5077 static __isl_give isl_map
*equate(__isl_take isl_dim
*dim
,
5078 enum isl_dim_type src_type
, int src_pos
,
5079 enum isl_dim_type dst_type
, int dst_pos
)
5081 isl_basic_map
*bmap
;
5084 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
5085 k
= isl_basic_map_alloc_equality(bmap
);
5088 isl_seq_clr(bmap
->eq
[k
], 1 + isl_basic_map_total_dim(bmap
));
5089 src_pos
+= isl_basic_map_offset(bmap
, src_type
);
5090 dst_pos
+= isl_basic_map_offset(bmap
, dst_type
);
5091 isl_int_set_si(bmap
->eq
[k
][src_pos
], 1);
5092 isl_int_set_si(bmap
->eq
[k
][dst_pos
], -1);
5094 return isl_map_from_basic_map(bmap
);
5096 isl_basic_map_free(bmap
);
5100 /* Extract the first and only affine expression from list
5101 * and then add it to *pwaff with the given dom.
5102 * This domain is known to be disjoint from other domains
5103 * because of the way isl_basic_set_foreach_lexmax works.
5105 static int update_dim_max(__isl_take isl_basic_set
*dom
,
5106 __isl_take isl_aff_list
*list
, void *user
)
5108 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
5110 isl_pw_aff
**pwaff
= user
;
5111 isl_pw_aff
*pwaff_i
;
5113 if (isl_aff_list_n_aff(list
) != 1)
5114 isl_die(ctx
, isl_error_internal
,
5115 "expecting single element list", goto error
);
5117 aff
= isl_aff_list_get_aff(list
, 0);
5118 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
5120 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
5122 isl_aff_list_free(list
);
5126 isl_basic_set_free(dom
);
5127 isl_aff_list_free(list
);
5131 /* Given a one-dimensional basic set, compute the maximum of that
5132 * dimension as an isl_pw_aff.
5134 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5135 * call update_dim_max on each leaf of the result.
5137 static __isl_give isl_pw_aff
*basic_set_dim_max(__isl_keep isl_basic_set
*bset
)
5139 isl_dim
*dim
= isl_basic_set_get_dim(bset
);
5143 dim
= isl_dim_domain(isl_dim_from_range(dim
));
5144 pwaff
= isl_pw_aff_empty(dim
);
5146 r
= isl_basic_set_foreach_lexmax(bset
, &update_dim_max
, &pwaff
);
5148 return isl_pw_aff_free(pwaff
);
5153 /* Compute the maximum of the given set dimension as a function of the
5154 * parameters, but independently of the other set dimensions.
5156 * We first project the set onto the given dimension and then compute
5157 * the "lexicographic" maximum in each basic set, combining the results
5158 * using isl_pw_aff_max.
5160 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
5166 map
= isl_map_from_domain(set
);
5167 map
= isl_map_add_dims(map
, isl_dim_out
, 1);
5168 map
= isl_map_intersect(map
,
5169 equate(isl_map_get_dim(map
), isl_dim_in
, pos
,
5171 set
= isl_map_range(map
);
5176 isl_dim
*dim
= isl_set_get_dim(set
);
5177 dim
= isl_dim_domain(isl_dim_from_range(dim
));
5179 return isl_pw_aff_empty(dim
);
5182 pwaff
= basic_set_dim_max(set
->p
[0]);
5183 for (i
= 1; i
< set
->n
; ++i
) {
5184 isl_pw_aff
*pwaff_i
;
5186 pwaff_i
= basic_set_dim_max(set
->p
[i
]);
5187 pwaff
= isl_pw_aff_max(pwaff
, pwaff_i
);
5195 /* Apply a preimage specified by "mat" on the parameters of "bset".
5196 * bset is assumed to have only parameters and divs.
5198 static struct isl_basic_set
*basic_set_parameter_preimage(
5199 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
5206 bset
->dim
= isl_dim_cow(bset
->dim
);
5210 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5212 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5214 bset
->dim
->nparam
= 0;
5215 bset
->dim
->n_out
= nparam
;
5216 bset
= isl_basic_set_preimage(bset
, mat
);
5218 bset
->dim
->nparam
= bset
->dim
->n_out
;
5219 bset
->dim
->n_out
= 0;
5224 isl_basic_set_free(bset
);
5228 /* Apply a preimage specified by "mat" on the parameters of "set".
5229 * set is assumed to have only parameters and divs.
5231 static struct isl_set
*set_parameter_preimage(
5232 struct isl_set
*set
, struct isl_mat
*mat
)
5234 struct isl_dim
*dim
= NULL
;
5240 dim
= isl_dim_copy(set
->dim
);
5241 dim
= isl_dim_cow(dim
);
5245 nparam
= isl_set_dim(set
, isl_dim_param
);
5247 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5250 dim
->n_out
= nparam
;
5251 isl_set_reset_dim(set
, dim
);
5252 set
= isl_set_preimage(set
, mat
);
5255 dim
= isl_dim_copy(set
->dim
);
5256 dim
= isl_dim_cow(dim
);
5259 dim
->nparam
= dim
->n_out
;
5261 isl_set_reset_dim(set
, dim
);
5271 /* Intersect the basic set "bset" with the affine space specified by the
5272 * equalities in "eq".
5274 static struct isl_basic_set
*basic_set_append_equalities(
5275 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5283 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
5288 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
5289 for (i
= 0; i
< eq
->n_row
; ++i
) {
5290 k
= isl_basic_set_alloc_equality(bset
);
5293 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5294 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5298 bset
= isl_basic_set_gauss(bset
, NULL
);
5299 bset
= isl_basic_set_finalize(bset
);
5304 isl_basic_set_free(bset
);
5308 /* Intersect the set "set" with the affine space specified by the
5309 * equalities in "eq".
5311 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5319 for (i
= 0; i
< set
->n
; ++i
) {
5320 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5333 /* Project the given basic set onto its parameter domain, possibly introducing
5334 * new, explicit, existential variables in the constraints.
5335 * The input has parameters and (possibly implicit) existential variables.
5336 * The output has the same parameters, but only
5337 * explicit existentially quantified variables.
5339 * The actual projection is performed by pip, but pip doesn't seem
5340 * to like equalities very much, so we first remove the equalities
5341 * among the parameters by performing a variable compression on
5342 * the parameters. Afterward, an inverse transformation is performed
5343 * and the equalities among the parameters are inserted back in.
5345 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5349 struct isl_mat
*T
, *T2
;
5350 struct isl_set
*set
;
5351 unsigned nparam
, n_div
;
5353 bset
= isl_basic_set_cow(bset
);
5357 if (bset
->n_eq
== 0)
5358 return isl_basic_set_lexmin(bset
);
5360 isl_basic_set_gauss(bset
, NULL
);
5362 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5363 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5365 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5366 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5369 if (i
== bset
->n_eq
)
5370 return isl_basic_set_lexmin(bset
);
5372 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5374 eq
= isl_mat_cow(eq
);
5375 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5376 if (T
&& T
->n_col
== 0) {
5380 bset
= isl_basic_set_set_to_empty(bset
);
5381 return isl_set_from_basic_set(bset
);
5383 bset
= basic_set_parameter_preimage(bset
, T
);
5385 set
= isl_basic_set_lexmin(bset
);
5386 set
= set_parameter_preimage(set
, T2
);
5387 set
= set_append_equalities(set
, eq
);
5391 /* Compute an explicit representation for all the existentially
5392 * quantified variables.
5393 * The input and output dimensions are first turned into parameters.
5394 * compute_divs then returns a map with the same parameters and
5395 * no input or output dimensions and the dimension specification
5396 * is reset to that of the input.
5398 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5400 struct isl_basic_set
*bset
;
5401 struct isl_set
*set
;
5402 struct isl_map
*map
;
5403 struct isl_dim
*dim
, *orig_dim
= NULL
;
5408 bmap
= isl_basic_map_cow(bmap
);
5412 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5413 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5414 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5415 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5419 orig_dim
= bmap
->dim
;
5421 bset
= (struct isl_basic_set
*)bmap
;
5423 set
= parameter_compute_divs(bset
);
5424 map
= (struct isl_map
*)set
;
5425 map
= isl_map_reset_dim(map
, orig_dim
);
5429 isl_basic_map_free(bmap
);
5433 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5441 off
= isl_dim_total(bmap
->dim
);
5442 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5443 if (isl_int_is_zero(bmap
->div
[i
][0]))
5445 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5451 static int map_divs_known(__isl_keep isl_map
*map
)
5458 for (i
= 0; i
< map
->n
; ++i
) {
5459 int known
= isl_basic_map_divs_known(map
->p
[i
]);
5467 /* If bmap contains any unknown divs, then compute explicit
5468 * expressions for them. However, this computation may be
5469 * quite expensive, so first try to remove divs that aren't
5472 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5475 struct isl_map
*map
;
5477 known
= isl_basic_map_divs_known(bmap
);
5481 return isl_map_from_basic_map(bmap
);
5483 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5485 known
= isl_basic_map_divs_known(bmap
);
5489 return isl_map_from_basic_map(bmap
);
5491 map
= compute_divs(bmap
);
5494 isl_basic_map_free(bmap
);
5498 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5502 struct isl_map
*res
;
5509 known
= map_divs_known(map
);
5517 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5518 for (i
= 1 ; i
< map
->n
; ++i
) {
5520 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5521 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5522 res
= isl_map_union_disjoint(res
, r2
);
5524 res
= isl_map_union(res
, r2
);
5531 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5533 return (struct isl_set
*)
5534 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5537 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5539 return (struct isl_set
*)
5540 isl_map_compute_divs((struct isl_map
*)set
);
5543 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5546 struct isl_set
*set
;
5551 map
= isl_map_cow(map
);
5555 set
= (struct isl_set
*)map
;
5556 set
->dim
= isl_dim_domain(set
->dim
);
5559 for (i
= 0; i
< map
->n
; ++i
) {
5560 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5564 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5565 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5572 struct isl_map
*isl_map_union_disjoint(
5573 struct isl_map
*map1
, struct isl_map
*map2
)
5577 struct isl_map
*map
= NULL
;
5591 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5593 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5594 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5595 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5597 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5598 map1
->n
+ map2
->n
, flags
);
5601 for (i
= 0; i
< map1
->n
; ++i
) {
5602 map
= isl_map_add_basic_map(map
,
5603 isl_basic_map_copy(map1
->p
[i
]));
5607 for (i
= 0; i
< map2
->n
; ++i
) {
5608 map
= isl_map_add_basic_map(map
,
5609 isl_basic_map_copy(map2
->p
[i
]));
5623 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5625 map1
= isl_map_union_disjoint(map1
, map2
);
5629 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5633 struct isl_set
*isl_set_union_disjoint(
5634 struct isl_set
*set1
, struct isl_set
*set2
)
5636 return (struct isl_set
*)
5637 isl_map_union_disjoint(
5638 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5641 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5643 return (struct isl_set
*)
5644 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5647 struct isl_map
*isl_map_intersect_range(
5648 struct isl_map
*map
, struct isl_set
*set
)
5651 struct isl_map
*result
;
5657 if (!isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
5658 isl_die(set
->ctx
, isl_error_invalid
,
5659 "parameters don't match", goto error
);
5661 if (isl_dim_size(set
->dim
, isl_dim_set
) != 0 &&
5662 !isl_map_compatible_range(map
, set
))
5663 isl_die(set
->ctx
, isl_error_invalid
,
5664 "incompatible spaces", goto error
);
5666 if (isl_set_plain_is_universe(set
)) {
5671 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5672 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5673 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5675 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5676 map
->n
* set
->n
, flags
);
5679 for (i
= 0; i
< map
->n
; ++i
)
5680 for (j
= 0; j
< set
->n
; ++j
) {
5681 result
= isl_map_add_basic_map(result
,
5682 isl_basic_map_intersect_range(
5683 isl_basic_map_copy(map
->p
[i
]),
5684 isl_basic_set_copy(set
->p
[j
])));
5697 struct isl_map
*isl_map_intersect_domain(
5698 struct isl_map
*map
, struct isl_set
*set
)
5700 return isl_map_reverse(
5701 isl_map_intersect_range(isl_map_reverse(map
), set
));
5704 struct isl_map
*isl_map_apply_domain(
5705 struct isl_map
*map1
, struct isl_map
*map2
)
5709 map1
= isl_map_reverse(map1
);
5710 map1
= isl_map_apply_range(map1
, map2
);
5711 return isl_map_reverse(map1
);
5718 struct isl_map
*isl_map_apply_range(
5719 struct isl_map
*map1
, struct isl_map
*map2
)
5721 struct isl_dim
*dim_result
;
5722 struct isl_map
*result
;
5728 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5729 isl_dim_copy(map2
->dim
));
5731 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5734 for (i
= 0; i
< map1
->n
; ++i
)
5735 for (j
= 0; j
< map2
->n
; ++j
) {
5736 result
= isl_map_add_basic_map(result
,
5737 isl_basic_map_apply_range(
5738 isl_basic_map_copy(map1
->p
[i
]),
5739 isl_basic_map_copy(map2
->p
[j
])));
5745 if (result
&& result
->n
<= 1)
5746 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5755 * returns range - domain
5757 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5759 isl_dim
*dims
, *target_dim
;
5760 struct isl_basic_set
*bset
;
5767 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5768 bmap
->dim
, isl_dim_out
),
5770 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5771 dim
= isl_basic_map_n_in(bmap
);
5772 nparam
= isl_basic_map_n_param(bmap
);
5773 bset
= isl_basic_set_from_basic_map(bmap
);
5774 bset
= isl_basic_set_cow(bset
);
5775 dims
= isl_basic_set_get_dim(bset
);
5776 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5777 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5778 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5779 for (i
= 0; i
< dim
; ++i
) {
5780 int j
= isl_basic_map_alloc_equality(
5781 (struct isl_basic_map
*)bset
);
5784 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5785 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5786 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5787 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5789 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5790 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5793 isl_basic_map_free(bmap
);
5798 * returns range - domain
5800 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5804 struct isl_set
*result
;
5809 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5810 map
->dim
, isl_dim_out
),
5812 dim
= isl_map_get_dim(map
);
5813 dim
= isl_dim_domain(dim
);
5814 result
= isl_set_alloc_dim(dim
, map
->n
, 0);
5817 for (i
= 0; i
< map
->n
; ++i
)
5818 result
= isl_set_add_basic_set(result
,
5819 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5828 * returns [domain -> range] -> range - domain
5830 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
5831 __isl_take isl_basic_map
*bmap
)
5835 isl_basic_map
*domain
;
5839 if (!isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
5840 isl_die(bmap
->ctx
, isl_error_invalid
,
5841 "domain and range don't match", goto error
);
5843 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5844 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
5846 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
5847 domain
= isl_basic_map_universe(dim
);
5849 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5850 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5851 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
5853 total
= isl_basic_map_total_dim(bmap
);
5855 for (i
= 0; i
< n
; ++i
) {
5856 k
= isl_basic_map_alloc_equality(bmap
);
5859 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5860 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
5861 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
5862 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
5865 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5866 return isl_basic_map_finalize(bmap
);
5868 isl_basic_map_free(bmap
);
5873 * returns [domain -> range] -> range - domain
5875 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
5878 isl_dim
*domain_dim
;
5883 if (!isl_dim_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
5884 isl_die(map
->ctx
, isl_error_invalid
,
5885 "domain and range don't match", goto error
);
5887 map
= isl_map_cow(map
);
5891 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
5892 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
5893 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
5896 for (i
= 0; i
< map
->n
; ++i
) {
5897 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
5901 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5908 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5910 struct isl_basic_map
*bmap
;
5918 nparam
= dims
->nparam
;
5920 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5924 for (i
= 0; i
< dim
; ++i
) {
5925 int j
= isl_basic_map_alloc_equality(bmap
);
5928 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5929 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5930 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5932 return isl_basic_map_finalize(bmap
);
5934 isl_basic_map_free(bmap
);
5938 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_dim
*dim
)
5942 if (dim
->n_in
!= dim
->n_out
)
5943 isl_die(dim
->ctx
, isl_error_invalid
,
5944 "number of input and output dimensions needs to be "
5945 "the same", goto error
);
5946 return basic_map_identity(dim
);
5952 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5954 if (!model
|| !model
->dim
)
5956 return isl_basic_map_identity(isl_dim_copy(model
->dim
));
5959 __isl_give isl_map
*isl_map_identity(__isl_take isl_dim
*dim
)
5961 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
5964 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5966 if (!model
|| !model
->dim
)
5968 return isl_map_identity(isl_dim_copy(model
->dim
));
5971 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5973 if (!model
|| !model
->dim
)
5975 return isl_map_identity(isl_dim_copy(model
->dim
));
5978 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5980 isl_dim
*dim
= isl_set_get_dim(set
);
5982 id
= isl_map_identity(isl_dim_map_from_set(dim
));
5983 return isl_map_intersect_range(id
, set
);
5986 /* Construct a basic set with all set dimensions having only non-negative
5989 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5994 struct isl_basic_set
*bset
;
5998 nparam
= dims
->nparam
;
6000 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
6003 for (i
= 0; i
< dim
; ++i
) {
6004 int k
= isl_basic_set_alloc_inequality(bset
);
6007 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
6008 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
6012 isl_basic_set_free(bset
);
6016 /* Construct the half-space x_pos >= 0.
6018 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
6022 isl_basic_set
*nonneg
;
6024 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
6025 k
= isl_basic_set_alloc_inequality(nonneg
);
6028 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
6029 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
6031 return isl_basic_set_finalize(nonneg
);
6033 isl_basic_set_free(nonneg
);
6037 /* Construct the half-space x_pos <= -1.
6039 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
6044 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
6045 k
= isl_basic_set_alloc_inequality(neg
);
6048 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
6049 isl_int_set_si(neg
->ineq
[k
][0], -1);
6050 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
6052 return isl_basic_set_finalize(neg
);
6054 isl_basic_set_free(neg
);
6058 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
6059 enum isl_dim_type type
, unsigned first
, unsigned n
)
6062 isl_basic_set
*nonneg
;
6070 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
6072 for (i
= 0; i
< n
; ++i
) {
6073 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
6074 pos(set
->dim
, type
) + first
+ i
);
6075 neg
= neg_halfspace(isl_set_get_dim(set
),
6076 pos(set
->dim
, type
) + first
+ i
);
6078 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
6087 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
6088 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6095 if (isl_set_plain_is_empty(set
)) {
6100 return fn(set
, signs
, user
);
6103 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
6105 half
= isl_set_intersect(half
, isl_set_copy(set
));
6106 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
6110 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
6112 half
= isl_set_intersect(half
, set
);
6113 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
6119 /* Call "fn" on the intersections of "set" with each of the orthants
6120 * (except for obviously empty intersections). The orthant is identified
6121 * by the signs array, with each entry having value 1 or -1 according
6122 * to the sign of the corresponding variable.
6124 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
6125 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6135 if (isl_set_plain_is_empty(set
))
6138 nparam
= isl_set_dim(set
, isl_dim_param
);
6139 nvar
= isl_set_dim(set
, isl_dim_set
);
6141 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
6143 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
6151 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6153 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6156 int isl_basic_map_is_subset(
6157 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6160 struct isl_map
*map1
;
6161 struct isl_map
*map2
;
6163 if (!bmap1
|| !bmap2
)
6166 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
6167 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
6169 is_subset
= isl_map_is_subset(map1
, map2
);
6177 int isl_basic_map_is_equal(
6178 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6182 if (!bmap1
|| !bmap2
)
6184 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6187 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6191 int isl_basic_set_is_equal(
6192 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6194 return isl_basic_map_is_equal(
6195 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
6198 int isl_map_is_empty(struct isl_map
*map
)
6205 for (i
= 0; i
< map
->n
; ++i
) {
6206 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
6215 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
6217 return map
? map
->n
== 0 : -1;
6220 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
6222 return isl_map_plain_is_empty(map
);
6225 int isl_set_plain_is_empty(struct isl_set
*set
)
6227 return set
? set
->n
== 0 : -1;
6230 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
6232 return isl_set_plain_is_empty(set
);
6235 int isl_set_is_empty(struct isl_set
*set
)
6237 return isl_map_is_empty((struct isl_map
*)set
);
6240 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6245 return isl_dim_equal(map1
->dim
, map2
->dim
);
6248 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6253 return isl_dim_equal(set1
->dim
, set2
->dim
);
6256 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6262 is_subset
= isl_map_is_subset(map1
, map2
);
6265 is_subset
= isl_map_is_subset(map2
, map1
);
6269 int isl_basic_map_is_strict_subset(
6270 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6274 if (!bmap1
|| !bmap2
)
6276 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6279 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6280 if (is_subset
== -1)
6285 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
6291 is_subset
= isl_map_is_subset(map1
, map2
);
6294 is_subset
= isl_map_is_subset(map2
, map1
);
6295 if (is_subset
== -1)
6300 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6302 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
6305 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6309 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6312 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6316 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6319 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
6326 for (i
= 0; i
< map
->n
; ++i
) {
6327 int r
= isl_basic_map_is_universe(map
->p
[i
]);
6335 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
6337 return isl_map_plain_is_universe((isl_map
*) set
);
6340 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6342 return isl_set_plain_is_universe(set
);
6345 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6347 struct isl_basic_set
*bset
= NULL
;
6348 struct isl_vec
*sample
= NULL
;
6355 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6358 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6359 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6360 copy
= isl_basic_map_remove_redundancies(copy
);
6361 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6362 isl_basic_map_free(copy
);
6366 total
= 1 + isl_basic_map_total_dim(bmap
);
6367 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6368 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6374 isl_vec_free(bmap
->sample
);
6375 bmap
->sample
= NULL
;
6376 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6379 sample
= isl_basic_set_sample_vec(bset
);
6382 empty
= sample
->size
== 0;
6383 isl_vec_free(bmap
->sample
);
6384 bmap
->sample
= sample
;
6386 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6391 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
6395 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6398 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
6400 return isl_basic_map_plain_is_empty(bmap
);
6403 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
6407 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6410 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
6412 return isl_basic_set_plain_is_empty(bset
);
6415 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6417 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6420 struct isl_map
*isl_basic_map_union(
6421 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6423 struct isl_map
*map
;
6424 if (!bmap1
|| !bmap2
)
6427 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6429 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6432 map
= isl_map_add_basic_map(map
, bmap1
);
6433 map
= isl_map_add_basic_map(map
, bmap2
);
6436 isl_basic_map_free(bmap1
);
6437 isl_basic_map_free(bmap2
);
6441 struct isl_set
*isl_basic_set_union(
6442 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6444 return (struct isl_set
*)isl_basic_map_union(
6445 (struct isl_basic_map
*)bset1
,
6446 (struct isl_basic_map
*)bset2
);
6449 /* Order divs such that any div only depends on previous divs */
6450 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6458 off
= isl_dim_total(bmap
->dim
);
6460 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6462 if (isl_int_is_zero(bmap
->div
[i
][0]))
6464 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6468 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6474 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6476 return (struct isl_basic_set
*)
6477 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6480 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6487 for (i
= 0; i
< map
->n
; ++i
) {
6488 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6499 /* Apply the expansion computed by isl_merge_divs.
6500 * The expansion itself is given by "exp" while the resulting
6501 * list of divs is given by "div".
6503 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
6504 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
6509 bset
= isl_basic_set_cow(bset
);
6513 if (div
->n_row
< bset
->n_div
)
6514 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
6515 "not an expansion", goto error
);
6517 bset
= isl_basic_map_extend_dim(bset
, isl_dim_copy(bset
->dim
),
6518 div
->n_row
- bset
->n_div
, 0,
6519 2 * (div
->n_row
- bset
->n_div
));
6521 n_div
= bset
->n_div
;
6522 for (i
= n_div
; i
< div
->n_row
; ++i
)
6523 if (isl_basic_set_alloc_div(bset
) < 0)
6527 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
6528 if (j
>= 0 && exp
[j
] == i
) {
6530 isl_basic_map_swap_div(bset
, i
, j
);
6533 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
6534 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
6542 isl_basic_set_free(bset
);
6547 /* Look for a div in dst that corresponds to the div "div" in src.
6548 * The divs before "div" in src and dst are assumed to be the same.
6550 * Returns -1 if no corresponding div was found and the position
6551 * of the corresponding div in dst otherwise.
6553 static int find_div(struct isl_basic_map
*dst
,
6554 struct isl_basic_map
*src
, unsigned div
)
6558 unsigned total
= isl_dim_total(src
->dim
);
6560 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6561 for (i
= div
; i
< dst
->n_div
; ++i
)
6562 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6563 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6564 dst
->n_div
- div
) == -1)
6569 struct isl_basic_map
*isl_basic_map_align_divs(
6570 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6573 unsigned total
= isl_dim_total(src
->dim
);
6578 if (src
->n_div
== 0)
6581 for (i
= 0; i
< src
->n_div
; ++i
)
6582 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6584 src
= isl_basic_map_order_divs(src
);
6585 dst
= isl_basic_map_cow(dst
);
6586 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6587 src
->n_div
, 0, 2 * src
->n_div
);
6590 for (i
= 0; i
< src
->n_div
; ++i
) {
6591 int j
= find_div(dst
, src
, i
);
6593 j
= isl_basic_map_alloc_div(dst
);
6596 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6597 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6598 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6602 isl_basic_map_swap_div(dst
, i
, j
);
6606 isl_basic_map_free(dst
);
6610 struct isl_basic_set
*isl_basic_set_align_divs(
6611 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6613 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6614 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6617 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6625 map
= isl_map_compute_divs(map
);
6626 map
= isl_map_cow(map
);
6630 for (i
= 1; i
< map
->n
; ++i
)
6631 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6632 for (i
= 1; i
< map
->n
; ++i
)
6633 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6635 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6639 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6641 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6644 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6648 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6649 map
= isl_map_intersect_domain(map
, set
);
6650 set
= isl_map_range(map
);
6658 /* There is no need to cow as removing empty parts doesn't change
6659 * the meaning of the set.
6661 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6668 for (i
= map
->n
-1; i
>= 0; --i
) {
6669 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6671 isl_basic_map_free(map
->p
[i
]);
6672 if (i
!= map
->n
-1) {
6673 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6674 map
->p
[i
] = map
->p
[map
->n
-1];
6682 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6684 return (struct isl_set
*)
6685 isl_map_remove_empty_parts((struct isl_map
*)set
);
6688 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6690 struct isl_basic_map
*bmap
;
6691 if (!map
|| map
->n
== 0)
6693 bmap
= map
->p
[map
->n
-1];
6694 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6695 return isl_basic_map_copy(bmap
);
6698 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6700 return (struct isl_basic_set
*)
6701 isl_map_copy_basic_map((struct isl_map
*)set
);
6704 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6705 __isl_keep isl_basic_map
*bmap
)
6711 for (i
= map
->n
-1; i
>= 0; --i
) {
6712 if (map
->p
[i
] != bmap
)
6714 map
= isl_map_cow(map
);
6717 isl_basic_map_free(map
->p
[i
]);
6718 if (i
!= map
->n
-1) {
6719 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6720 map
->p
[i
] = map
->p
[map
->n
-1];
6731 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6732 struct isl_basic_set
*bset
)
6734 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6735 (struct isl_basic_map
*)bset
);
6738 /* Given two basic sets bset1 and bset2, compute the maximal difference
6739 * between the values of dimension pos in bset1 and those in bset2
6740 * for any common value of the parameters and dimensions preceding pos.
6742 static enum isl_lp_result
basic_set_maximal_difference_at(
6743 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6744 int pos
, isl_int
*opt
)
6746 struct isl_dim
*dims
;
6747 struct isl_basic_map
*bmap1
= NULL
;
6748 struct isl_basic_map
*bmap2
= NULL
;
6749 struct isl_ctx
*ctx
;
6750 struct isl_vec
*obj
;
6753 unsigned dim1
, dim2
;
6754 enum isl_lp_result res
;
6756 if (!bset1
|| !bset2
)
6757 return isl_lp_error
;
6759 nparam
= isl_basic_set_n_param(bset1
);
6760 dim1
= isl_basic_set_n_dim(bset1
);
6761 dim2
= isl_basic_set_n_dim(bset2
);
6762 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6763 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6764 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6765 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6766 if (!bmap1
|| !bmap2
)
6768 bmap1
= isl_basic_map_cow(bmap1
);
6769 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6770 pos
, (dim1
- pos
) + (dim2
- pos
),
6771 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6772 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6775 total
= isl_basic_map_total_dim(bmap1
);
6777 obj
= isl_vec_alloc(ctx
, 1 + total
);
6778 isl_seq_clr(obj
->block
.data
, 1 + total
);
6779 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6780 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6783 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6785 isl_basic_map_free(bmap1
);
6789 isl_basic_map_free(bmap1
);
6790 isl_basic_map_free(bmap2
);
6791 return isl_lp_error
;
6794 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6795 * for any common value of the parameters and dimensions preceding pos
6796 * in both basic sets, the values of dimension pos in bset1 are
6797 * smaller or larger than those in bset2.
6800 * 1 if bset1 follows bset2
6801 * -1 if bset1 precedes bset2
6802 * 0 if bset1 and bset2 are incomparable
6803 * -2 if some error occurred.
6805 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6806 struct isl_basic_set
*bset2
, int pos
)
6809 enum isl_lp_result res
;
6814 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6816 if (res
== isl_lp_empty
)
6818 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6819 res
== isl_lp_unbounded
)
6821 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6830 /* Given two basic sets bset1 and bset2, check whether
6831 * for any common value of the parameters and dimensions preceding pos
6832 * there is a value of dimension pos in bset1 that is larger
6833 * than a value of the same dimension in bset2.
6836 * 1 if there exists such a pair
6837 * 0 if there is no such pair, but there is a pair of equal values
6839 * -2 if some error occurred.
6841 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6842 __isl_keep isl_basic_set
*bset2
, int pos
)
6845 enum isl_lp_result res
;
6850 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6852 if (res
== isl_lp_empty
)
6854 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6855 res
== isl_lp_unbounded
)
6857 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6859 else if (res
== isl_lp_ok
)
6868 /* Given two sets set1 and set2, check whether
6869 * for any common value of the parameters and dimensions preceding pos
6870 * there is a value of dimension pos in set1 that is larger
6871 * than a value of the same dimension in set2.
6874 * 1 if there exists such a pair
6875 * 0 if there is no such pair, but there is a pair of equal values
6877 * -2 if some error occurred.
6879 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6880 __isl_keep isl_set
*set2
, int pos
)
6888 for (i
= 0; i
< set1
->n
; ++i
)
6889 for (j
= 0; j
< set2
->n
; ++j
) {
6891 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6892 if (f
== 1 || f
== -2)
6901 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
6902 unsigned pos
, isl_int
*val
)
6910 total
= isl_basic_map_total_dim(bmap
);
6911 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6912 for (; d
+1 > pos
; --d
)
6913 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6917 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6919 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6921 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6924 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6930 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
6931 unsigned pos
, isl_int
*val
)
6943 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
6946 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
6947 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6948 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6949 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6953 isl_int_set(*val
, v
);
6959 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
6960 unsigned pos
, isl_int
*val
)
6962 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
6966 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
6969 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6972 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
6973 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6975 if (pos
>= isl_basic_map_dim(bmap
, type
))
6977 return isl_basic_map_plain_has_fixed_var(bmap
,
6978 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6981 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
6982 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6984 if (pos
>= isl_map_dim(map
, type
))
6986 return isl_map_plain_has_fixed_var(map
,
6987 map_offset(map
, type
) - 1 + pos
, val
);
6990 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
6991 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6993 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
6996 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6997 * then return this fixed value in *val.
6999 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
7000 unsigned dim
, isl_int
*val
)
7002 return isl_basic_set_plain_has_fixed_var(bset
,
7003 isl_basic_set_n_param(bset
) + dim
, val
);
7006 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7007 * then return this fixed value in *val.
7009 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
7010 unsigned dim
, isl_int
*val
)
7012 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
7015 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
7016 unsigned dim
, isl_int
*val
)
7018 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
7021 /* Check if input variable in has fixed value and if so and if val is not NULL,
7022 * then return this fixed value in *val.
7024 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
7025 unsigned in
, isl_int
*val
)
7027 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
7030 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7031 * and if val is not NULL, then return this lower bound in *val.
7033 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7034 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
7036 int i
, i_eq
= -1, i_ineq
= -1;
7043 total
= isl_basic_set_total_dim(bset
);
7044 nparam
= isl_basic_set_n_param(bset
);
7045 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7046 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
7052 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7053 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
7055 if (i_eq
!= -1 || i_ineq
!= -1)
7059 if (i_eq
== -1 && i_ineq
== -1)
7061 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
7062 /* The coefficient should always be one due to normalization. */
7063 if (!isl_int_is_one(c
[1+nparam
+dim
]))
7065 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
7067 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
7068 total
- nparam
- dim
- 1) != -1)
7071 isl_int_neg(*val
, c
[0]);
7075 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
7076 unsigned dim
, isl_int
*val
)
7088 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7092 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7094 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
7095 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
7097 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7101 isl_int_set(*val
, v
);
7112 /* uset_gist depends on constraints without existentially quantified
7113 * variables sorting first.
7115 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
7117 const struct constraint
*c1
= (const struct constraint
*)p1
;
7118 const struct constraint
*c2
= (const struct constraint
*)p2
;
7120 unsigned size
= isl_min(c1
->size
, c2
->size
);
7122 l1
= isl_seq_last_non_zero(c1
->c
, size
);
7123 l2
= isl_seq_last_non_zero(c2
->c
, size
);
7128 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
7131 static struct isl_basic_map
*isl_basic_map_sort_constraints(
7132 struct isl_basic_map
*bmap
)
7135 struct constraint
*c
;
7140 total
= isl_basic_map_total_dim(bmap
);
7141 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
7144 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7146 c
[i
].c
= bmap
->ineq
[i
];
7148 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
7149 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7150 bmap
->ineq
[i
] = c
[i
].c
;
7154 isl_basic_map_free(bmap
);
7158 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
7159 __isl_take isl_basic_set
*bset
)
7161 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
7162 (struct isl_basic_map
*)bset
);
7165 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
7169 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
7171 bmap
= isl_basic_map_remove_redundancies(bmap
);
7172 bmap
= isl_basic_map_sort_constraints(bmap
);
7173 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
7177 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
7179 return (struct isl_basic_set
*)isl_basic_map_normalize(
7180 (struct isl_basic_map
*)bset
);
7183 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
7184 const __isl_keep isl_basic_map
*bmap2
)
7191 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
7192 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
7193 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
7194 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
7195 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
7196 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
7197 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7198 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
7199 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7200 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
7201 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7203 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
7205 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7207 if (bmap1
->n_eq
!= bmap2
->n_eq
)
7208 return bmap1
->n_eq
- bmap2
->n_eq
;
7209 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
7210 return bmap1
->n_ineq
- bmap2
->n_ineq
;
7211 if (bmap1
->n_div
!= bmap2
->n_div
)
7212 return bmap1
->n_div
- bmap2
->n_div
;
7213 total
= isl_basic_map_total_dim(bmap1
);
7214 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
7215 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
7219 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
7220 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
7224 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
7225 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
7232 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
7233 __isl_keep isl_basic_map
*bmap2
)
7235 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
7238 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
7239 __isl_keep isl_basic_set
*bset2
)
7241 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
7242 (isl_basic_map
*)bset2
);
7245 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
7247 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
7248 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
7250 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
7253 /* We normalize in place, but if anything goes wrong we need
7254 * to return NULL, so we need to make sure we don't change the
7255 * meaning of any possible other copies of map.
7257 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
7260 struct isl_basic_map
*bmap
;
7264 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
7266 for (i
= 0; i
< map
->n
; ++i
) {
7267 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
7270 isl_basic_map_free(map
->p
[i
]);
7273 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
7274 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
7275 map
= isl_map_remove_empty_parts(map
);
7278 for (i
= map
->n
- 1; i
>= 1; --i
) {
7279 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
7281 isl_basic_map_free(map
->p
[i
-1]);
7282 for (j
= i
; j
< map
->n
; ++j
)
7283 map
->p
[j
-1] = map
->p
[j
];
7293 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
7295 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
7298 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7308 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
7311 map1
= isl_map_copy(map1
);
7312 map2
= isl_map_copy(map2
);
7313 map1
= isl_map_normalize(map1
);
7314 map2
= isl_map_normalize(map2
);
7317 equal
= map1
->n
== map2
->n
;
7318 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
7319 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
7332 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7334 return isl_map_plain_is_equal(map1
, map2
);
7337 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7339 return isl_map_plain_is_equal((struct isl_map
*)set1
,
7340 (struct isl_map
*)set2
);
7343 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7345 return isl_set_plain_is_equal(set1
, set2
);
7348 /* Return an interval that ranges from min to max (inclusive)
7350 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
7351 isl_int min
, isl_int max
)
7354 struct isl_basic_set
*bset
= NULL
;
7356 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
7360 k
= isl_basic_set_alloc_inequality(bset
);
7363 isl_int_set_si(bset
->ineq
[k
][1], 1);
7364 isl_int_neg(bset
->ineq
[k
][0], min
);
7366 k
= isl_basic_set_alloc_inequality(bset
);
7369 isl_int_set_si(bset
->ineq
[k
][1], -1);
7370 isl_int_set(bset
->ineq
[k
][0], max
);
7374 isl_basic_set_free(bset
);
7378 /* Return the Cartesian product of the basic sets in list (in the given order).
7380 __isl_give isl_basic_set
*isl_basic_set_list_product(
7381 __isl_take
struct isl_basic_set_list
*list
)
7389 struct isl_basic_set
*product
= NULL
;
7393 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
7394 isl_assert(list
->ctx
, list
->p
[0], goto error
);
7395 nparam
= isl_basic_set_n_param(list
->p
[0]);
7396 dim
= isl_basic_set_n_dim(list
->p
[0]);
7397 extra
= list
->p
[0]->n_div
;
7398 n_eq
= list
->p
[0]->n_eq
;
7399 n_ineq
= list
->p
[0]->n_ineq
;
7400 for (i
= 1; i
< list
->n
; ++i
) {
7401 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
7402 isl_assert(list
->ctx
,
7403 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
7404 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7405 extra
+= list
->p
[i
]->n_div
;
7406 n_eq
+= list
->p
[i
]->n_eq
;
7407 n_ineq
+= list
->p
[i
]->n_ineq
;
7409 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
7414 for (i
= 0; i
< list
->n
; ++i
) {
7415 isl_basic_set_add_constraints(product
,
7416 isl_basic_set_copy(list
->p
[i
]), dim
);
7417 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7419 isl_basic_set_list_free(list
);
7422 isl_basic_set_free(product
);
7423 isl_basic_set_list_free(list
);
7427 struct isl_basic_map
*isl_basic_map_product(
7428 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7430 struct isl_dim
*dim_result
= NULL
;
7431 struct isl_basic_map
*bmap
;
7432 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
7433 struct isl_dim_map
*dim_map1
, *dim_map2
;
7435 if (!bmap1
|| !bmap2
)
7438 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
7439 bmap2
->dim
, isl_dim_param
), goto error
);
7440 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
7441 isl_dim_copy(bmap2
->dim
));
7443 in1
= isl_basic_map_n_in(bmap1
);
7444 in2
= isl_basic_map_n_in(bmap2
);
7445 out1
= isl_basic_map_n_out(bmap1
);
7446 out2
= isl_basic_map_n_out(bmap2
);
7447 nparam
= isl_basic_map_n_param(bmap1
);
7449 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7450 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7451 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7452 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7453 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7454 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7455 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7456 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7457 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7458 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7459 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7461 bmap
= isl_basic_map_alloc_dim(dim_result
,
7462 bmap1
->n_div
+ bmap2
->n_div
,
7463 bmap1
->n_eq
+ bmap2
->n_eq
,
7464 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7465 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7466 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7467 bmap
= isl_basic_map_simplify(bmap
);
7468 return isl_basic_map_finalize(bmap
);
7470 isl_basic_map_free(bmap1
);
7471 isl_basic_map_free(bmap2
);
7475 __isl_give isl_basic_map
*isl_basic_map_flat_product(
7476 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7478 isl_basic_map
*prod
;
7480 prod
= isl_basic_map_product(bmap1
, bmap2
);
7481 prod
= isl_basic_map_flatten(prod
);
7485 __isl_give isl_basic_set
*isl_basic_set_flat_product(
7486 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
7488 return isl_basic_map_flat_range_product(bset1
, bset2
);
7491 __isl_give isl_basic_map
*isl_basic_map_range_product(
7492 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7494 isl_dim
*dim_result
= NULL
;
7495 isl_basic_map
*bmap
;
7496 unsigned in
, out1
, out2
, nparam
, total
, pos
;
7497 struct isl_dim_map
*dim_map1
, *dim_map2
;
7499 if (!bmap1
|| !bmap2
)
7502 dim_result
= isl_dim_range_product(isl_dim_copy(bmap1
->dim
),
7503 isl_dim_copy(bmap2
->dim
));
7505 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7506 out1
= isl_basic_map_n_out(bmap1
);
7507 out2
= isl_basic_map_n_out(bmap2
);
7508 nparam
= isl_basic_map_n_param(bmap1
);
7510 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7511 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7512 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7513 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7514 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7515 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7516 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
7517 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
7518 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7519 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7520 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7522 bmap
= isl_basic_map_alloc_dim(dim_result
,
7523 bmap1
->n_div
+ bmap2
->n_div
,
7524 bmap1
->n_eq
+ bmap2
->n_eq
,
7525 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7526 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7527 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7528 bmap
= isl_basic_map_simplify(bmap
);
7529 return isl_basic_map_finalize(bmap
);
7531 isl_basic_map_free(bmap1
);
7532 isl_basic_map_free(bmap2
);
7536 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
7537 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7539 isl_basic_map
*prod
;
7541 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
7542 prod
= isl_basic_map_flatten_range(prod
);
7546 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
7547 __isl_take isl_map
*map2
,
7548 __isl_give isl_dim
*(*dim_product
)(__isl_take isl_dim
*left
,
7549 __isl_take isl_dim
*right
),
7550 __isl_give isl_basic_map
*(*basic_map_product
)(
7551 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
7554 struct isl_map
*result
;
7560 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7561 map2
->dim
, isl_dim_param
), goto error
);
7563 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7564 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7565 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7567 result
= isl_map_alloc_dim(dim_product(isl_dim_copy(map1
->dim
),
7568 isl_dim_copy(map2
->dim
)),
7569 map1
->n
* map2
->n
, flags
);
7572 for (i
= 0; i
< map1
->n
; ++i
)
7573 for (j
= 0; j
< map2
->n
; ++j
) {
7574 struct isl_basic_map
*part
;
7575 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
7576 isl_basic_map_copy(map2
->p
[j
]));
7577 if (isl_basic_map_is_empty(part
))
7578 isl_basic_map_free(part
);
7580 result
= isl_map_add_basic_map(result
, part
);
7593 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7595 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
7597 return map_product(map1
, map2
, &isl_dim_product
, &isl_basic_map_product
);
7600 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7602 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7603 __isl_take isl_map
*map2
)
7607 prod
= isl_map_product(map1
, map2
);
7608 prod
= isl_map_flatten(prod
);
7612 /* Given two set A and B, construct its Cartesian product A x B.
7614 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7616 return isl_map_range_product(set1
, set2
);
7619 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7620 __isl_take isl_set
*set2
)
7622 return isl_map_flat_range_product(set1
, set2
);
7625 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7627 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
7628 __isl_take isl_map
*map2
)
7630 return map_product(map1
, map2
, &isl_dim_range_product
,
7631 &isl_basic_map_range_product
);
7634 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7636 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
7637 __isl_take isl_map
*map2
)
7641 prod
= isl_map_range_product(map1
, map2
);
7642 prod
= isl_map_flatten_range(prod
);
7646 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7649 uint32_t hash
= isl_hash_init();
7654 bmap
= isl_basic_map_copy(bmap
);
7655 bmap
= isl_basic_map_normalize(bmap
);
7658 total
= isl_basic_map_total_dim(bmap
);
7659 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7660 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7662 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7663 isl_hash_hash(hash
, c_hash
);
7665 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7666 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7668 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7669 isl_hash_hash(hash
, c_hash
);
7671 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7672 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7674 if (isl_int_is_zero(bmap
->div
[i
][0]))
7676 isl_hash_byte(hash
, i
& 0xFF);
7677 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7678 isl_hash_hash(hash
, c_hash
);
7680 isl_basic_map_free(bmap
);
7684 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7686 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7689 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7696 map
= isl_map_copy(map
);
7697 map
= isl_map_normalize(map
);
7701 hash
= isl_hash_init();
7702 for (i
= 0; i
< map
->n
; ++i
) {
7704 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7705 isl_hash_hash(hash
, bmap_hash
);
7713 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7715 return isl_map_get_hash((isl_map
*)set
);
7718 /* Check if the value for dimension dim is completely determined
7719 * by the values of the other parameters and variables.
7720 * That is, check if dimension dim is involved in an equality.
7722 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7729 nparam
= isl_basic_set_n_param(bset
);
7730 for (i
= 0; i
< bset
->n_eq
; ++i
)
7731 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7736 /* Check if the value for dimension dim is completely determined
7737 * by the values of the other parameters and variables.
7738 * That is, check if dimension dim is involved in an equality
7739 * for each of the subsets.
7741 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7747 for (i
= 0; i
< set
->n
; ++i
) {
7749 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7756 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7758 return set
? set
->n
: 0;
7761 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7762 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7769 for (i
= 0; i
< map
->n
; ++i
)
7770 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7776 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7777 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7784 for (i
= 0; i
< set
->n
; ++i
)
7785 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7791 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7793 struct isl_dim
*dim
;
7798 bset
= isl_basic_set_cow(bset
);
7802 dim
= isl_basic_set_get_dim(bset
);
7803 dim
= isl_dim_lift(dim
, bset
->n_div
);
7806 isl_dim_free(bset
->dim
);
7808 bset
->extra
-= bset
->n_div
;
7811 bset
= isl_basic_set_finalize(bset
);
7815 isl_basic_set_free(bset
);
7819 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7822 struct isl_dim
*dim
;
7825 set
= isl_set_align_divs(set
);
7830 set
= isl_set_cow(set
);
7834 n_div
= set
->p
[0]->n_div
;
7835 dim
= isl_set_get_dim(set
);
7836 dim
= isl_dim_lift(dim
, n_div
);
7839 isl_dim_free(set
->dim
);
7842 for (i
= 0; i
< set
->n
; ++i
) {
7843 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7854 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7856 struct isl_dim
*dim
;
7857 struct isl_basic_map
*bmap
;
7864 set
= isl_set_align_divs(set
);
7869 dim
= isl_set_get_dim(set
);
7870 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7872 return isl_map_identity(isl_dim_map_from_set(dim
));
7875 n_div
= set
->p
[0]->n_div
;
7876 dim
= isl_dim_map_from_set(dim
);
7877 n_param
= isl_dim_size(dim
, isl_dim_param
);
7878 n_set
= isl_dim_size(dim
, isl_dim_in
);
7879 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7880 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7881 for (i
= 0; i
< n_set
; ++i
)
7882 bmap
= var_equal(bmap
, i
);
7884 total
= n_param
+ n_set
+ n_set
+ n_div
;
7885 for (i
= 0; i
< n_div
; ++i
) {
7886 k
= isl_basic_map_alloc_inequality(bmap
);
7889 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7890 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7891 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7892 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7893 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7894 set
->p
[0]->div
[i
][0]);
7896 l
= isl_basic_map_alloc_inequality(bmap
);
7899 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7900 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7901 set
->p
[0]->div
[i
][0]);
7902 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7906 bmap
= isl_basic_map_simplify(bmap
);
7907 bmap
= isl_basic_map_finalize(bmap
);
7908 return isl_map_from_basic_map(bmap
);
7911 isl_basic_map_free(bmap
);
7915 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7923 dim
= isl_basic_set_total_dim(bset
);
7924 size
+= bset
->n_eq
* (1 + dim
);
7925 size
+= bset
->n_ineq
* (1 + dim
);
7926 size
+= bset
->n_div
* (2 + dim
);
7931 int isl_set_size(__isl_keep isl_set
*set
)
7939 for (i
= 0; i
< set
->n
; ++i
)
7940 size
+= isl_basic_set_size(set
->p
[i
]);
7945 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7946 enum isl_dim_type type
, unsigned pos
)
7954 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7956 pos
+= isl_basic_map_offset(bmap
, type
);
7958 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7959 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7963 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7964 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7971 return lower
&& upper
;
7974 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7975 enum isl_dim_type type
, unsigned pos
)
7982 for (i
= 0; i
< map
->n
; ++i
) {
7984 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7985 if (bounded
< 0 || !bounded
)
7992 /* Return 1 if the specified dim is involved in both an upper bound
7993 * and a lower bound.
7995 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7996 enum isl_dim_type type
, unsigned pos
)
7998 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
8001 /* For each of the "n" variables starting at "first", determine
8002 * the sign of the variable and put the results in the first "n"
8003 * elements of the array "signs".
8005 * 1 means that the variable is non-negative
8006 * -1 means that the variable is non-positive
8007 * 0 means the variable attains both positive and negative values.
8009 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
8010 unsigned first
, unsigned n
, int *signs
)
8012 isl_vec
*bound
= NULL
;
8013 struct isl_tab
*tab
= NULL
;
8014 struct isl_tab_undo
*snap
;
8017 if (!bset
|| !signs
)
8020 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
8021 tab
= isl_tab_from_basic_set(bset
);
8025 isl_seq_clr(bound
->el
, bound
->size
);
8026 isl_int_set_si(bound
->el
[0], -1);
8028 snap
= isl_tab_snap(tab
);
8029 for (i
= 0; i
< n
; ++i
) {
8032 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
8033 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8036 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8037 if (isl_tab_rollback(tab
, snap
) < 0)
8045 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
8046 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8049 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8050 if (isl_tab_rollback(tab
, snap
) < 0)
8053 signs
[i
] = empty
? -1 : 0;
8057 isl_vec_free(bound
);
8061 isl_vec_free(bound
);
8065 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
8066 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
8068 if (!bset
|| !signs
)
8070 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
8073 first
+= pos(bset
->dim
, type
) - 1;
8074 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
8077 /* Check if the given basic map is obviously single-valued.
8078 * In particular, for each output dimension, check that there is
8079 * an equality that defines the output dimension in terms of
8080 * earlier dimensions.
8082 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
8092 total
= 1 + isl_basic_map_total_dim(bmap
);
8093 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
8094 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
8096 for (i
= 0; i
< n_out
; ++i
) {
8097 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
8098 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
8100 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
8101 total
- (o_out
+ i
+ 1)) == -1)
8104 if (j
>= bmap
->n_eq
)
8111 /* Check if the given map is obviously single-valued.
8113 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
8122 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
8125 /* Check if the given map is single-valued.
8130 * and check if the result is a subset of the identity mapping.
8132 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
8139 sv
= isl_map_plain_is_single_valued(map
);
8143 test
= isl_map_reverse(isl_map_copy(map
));
8144 test
= isl_map_apply_range(test
, isl_map_copy(map
));
8146 dim
= isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map
)));
8147 id
= isl_map_identity(dim
);
8149 sv
= isl_map_is_subset(test
, id
);
8157 int isl_map_is_injective(__isl_keep isl_map
*map
)
8161 map
= isl_map_copy(map
);
8162 map
= isl_map_reverse(map
);
8163 in
= isl_map_is_single_valued(map
);
8169 /* Check if the given map is obviously injective.
8171 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
8175 map
= isl_map_copy(map
);
8176 map
= isl_map_reverse(map
);
8177 in
= isl_map_plain_is_single_valued(map
);
8183 int isl_map_is_bijective(__isl_keep isl_map
*map
)
8187 sv
= isl_map_is_single_valued(map
);
8191 return isl_map_is_injective(map
);
8194 int isl_set_is_singleton(__isl_keep isl_set
*set
)
8196 return isl_map_is_single_valued((isl_map
*)set
);
8199 int isl_map_is_translation(__isl_keep isl_map
*map
)
8204 delta
= isl_map_deltas(isl_map_copy(map
));
8205 ok
= isl_set_is_singleton(delta
);
8206 isl_set_free(delta
);
8211 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
8213 if (isl_seq_first_non_zero(p
, pos
) != -1)
8215 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
8220 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
8229 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
8232 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
8233 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
8234 for (j
= 0; j
< nvar
; ++j
) {
8235 int lower
= 0, upper
= 0;
8236 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8237 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
8239 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
8245 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8246 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
8248 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
8250 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
8255 if (!lower
|| !upper
)
8262 int isl_set_is_box(__isl_keep isl_set
*set
)
8269 return isl_basic_set_is_box(set
->p
[0]);
8272 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
8277 return isl_dim_is_wrapping(bset
->dim
);
8280 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
8285 return isl_dim_is_wrapping(set
->dim
);
8288 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
8290 bmap
= isl_basic_map_cow(bmap
);
8294 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
8298 bmap
= isl_basic_map_finalize(bmap
);
8300 return (isl_basic_set
*)bmap
;
8302 isl_basic_map_free(bmap
);
8306 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
8310 map
= isl_map_cow(map
);
8314 for (i
= 0; i
< map
->n
; ++i
) {
8315 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
8319 map
->dim
= isl_dim_wrap(map
->dim
);
8323 return (isl_set
*)map
;
8329 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
8331 bset
= isl_basic_set_cow(bset
);
8335 bset
->dim
= isl_dim_unwrap(bset
->dim
);
8339 bset
= isl_basic_set_finalize(bset
);
8341 return (isl_basic_map
*)bset
;
8343 isl_basic_set_free(bset
);
8347 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
8354 if (!isl_set_is_wrapping(set
))
8355 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
8358 set
= isl_set_cow(set
);
8362 for (i
= 0; i
< set
->n
; ++i
) {
8363 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
8368 set
->dim
= isl_dim_unwrap(set
->dim
);
8372 return (isl_map
*)set
;
8378 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
8379 enum isl_dim_type type
)
8384 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
8387 bmap
= isl_basic_map_cow(bmap
);
8391 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
8395 bmap
= isl_basic_map_finalize(bmap
);
8399 isl_basic_map_free(bmap
);
8403 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
8404 enum isl_dim_type type
)
8411 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
8414 map
= isl_map_cow(map
);
8418 for (i
= 0; i
< map
->n
; ++i
) {
8419 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
8423 map
->dim
= isl_dim_reset(map
->dim
, type
);
8433 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
8438 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
8441 bmap
= isl_basic_map_cow(bmap
);
8445 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
8449 bmap
= isl_basic_map_finalize(bmap
);
8453 isl_basic_map_free(bmap
);
8457 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
8459 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
8462 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
8463 __isl_take isl_basic_map
*bmap
)
8468 if (!bmap
->dim
->nested
[1])
8471 bmap
= isl_basic_map_cow(bmap
);
8475 bmap
->dim
= isl_dim_flatten_range(bmap
->dim
);
8479 bmap
= isl_basic_map_finalize(bmap
);
8483 isl_basic_map_free(bmap
);
8487 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
8494 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
8497 map
= isl_map_cow(map
);
8501 for (i
= 0; i
< map
->n
; ++i
) {
8502 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
8506 map
->dim
= isl_dim_flatten(map
->dim
);
8516 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
8518 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
8521 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
8523 isl_dim
*dim
, *flat_dim
;
8526 dim
= isl_set_get_dim(set
);
8527 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
8528 map
= isl_map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
8529 map
= isl_map_intersect_domain(map
, set
);
8534 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
8541 if (!map
->dim
->nested
[1])
8544 map
= isl_map_cow(map
);
8548 for (i
= 0; i
< map
->n
; ++i
) {
8549 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
8553 map
->dim
= isl_dim_flatten_range(map
->dim
);
8563 /* Reorder the dimensions of "bmap" according to the given dim_map
8564 * and set the dimension specification to "dim".
8566 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
8567 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
8571 bmap
= isl_basic_map_cow(bmap
);
8572 if (!bmap
|| !dim
|| !dim_map
)
8575 res
= isl_basic_map_alloc_dim(dim
,
8576 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8577 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
8578 res
= isl_basic_map_finalize(res
);
8582 isl_basic_map_free(bmap
);
8587 /* Reorder the dimensions of "map" according to given reordering.
8589 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8590 __isl_take isl_reordering
*r
)
8593 struct isl_dim_map
*dim_map
;
8595 map
= isl_map_cow(map
);
8596 dim_map
= isl_dim_map_from_reordering(r
);
8597 if (!map
|| !r
|| !dim_map
)
8600 for (i
= 0; i
< map
->n
; ++i
) {
8601 struct isl_dim_map
*dim_map_i
;
8603 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
8605 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8606 isl_dim_copy(r
->dim
), dim_map_i
);
8612 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8614 isl_reordering_free(r
);
8620 isl_reordering_free(r
);
8624 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8625 __isl_take isl_reordering
*r
)
8627 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8630 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
8631 __isl_take isl_dim
*model
)
8638 ctx
= isl_dim_get_ctx(model
);
8639 if (!isl_dim_has_named_params(model
))
8640 isl_die(ctx
, isl_error_invalid
,
8641 "model has unnamed parameters", goto error
);
8642 if (!isl_dim_has_named_params(map
->dim
))
8643 isl_die(ctx
, isl_error_invalid
,
8644 "relation has unnamed parameters", goto error
);
8645 if (!isl_dim_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
8646 isl_reordering
*exp
;
8648 model
= isl_dim_drop(model
, isl_dim_in
,
8649 0, isl_dim_size(model
, isl_dim_in
));
8650 model
= isl_dim_drop(model
, isl_dim_out
,
8651 0, isl_dim_size(model
, isl_dim_out
));
8652 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
8653 exp
= isl_reordering_extend_dim(exp
, isl_map_get_dim(map
));
8654 map
= isl_map_realign(map
, exp
);
8657 isl_dim_free(model
);
8660 isl_dim_free(model
);
8665 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
8666 __isl_take isl_dim
*model
)
8668 return isl_map_align_params(set
, model
);
8671 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8672 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8673 enum isl_dim_type c2
, enum isl_dim_type c3
,
8674 enum isl_dim_type c4
, enum isl_dim_type c5
)
8676 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8677 struct isl_mat
*mat
;
8683 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8684 isl_basic_map_total_dim(bmap
) + 1);
8687 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8688 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8689 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8690 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8691 isl_int_set(mat
->row
[i
][pos
],
8692 bmap
->eq
[i
][off
+ k
]);
8700 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8701 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8702 enum isl_dim_type c2
, enum isl_dim_type c3
,
8703 enum isl_dim_type c4
, enum isl_dim_type c5
)
8705 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8706 struct isl_mat
*mat
;
8712 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8713 isl_basic_map_total_dim(bmap
) + 1);
8716 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8717 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8718 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8719 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8720 isl_int_set(mat
->row
[i
][pos
],
8721 bmap
->ineq
[i
][off
+ k
]);
8729 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8730 __isl_take isl_dim
*dim
,
8731 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8732 enum isl_dim_type c2
, enum isl_dim_type c3
,
8733 enum isl_dim_type c4
, enum isl_dim_type c5
)
8735 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8736 isl_basic_map
*bmap
;
8742 if (!dim
|| !eq
|| !ineq
)
8745 if (eq
->n_col
!= ineq
->n_col
)
8746 isl_die(dim
->ctx
, isl_error_invalid
,
8747 "equalities and inequalities matrices should have "
8748 "same number of columns", goto error
);
8750 total
= 1 + isl_dim_total(dim
);
8752 if (eq
->n_col
< total
)
8753 isl_die(dim
->ctx
, isl_error_invalid
,
8754 "number of columns too small", goto error
);
8756 extra
= eq
->n_col
- total
;
8758 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
8759 eq
->n_row
, ineq
->n_row
);
8762 for (i
= 0; i
< extra
; ++i
) {
8763 k
= isl_basic_map_alloc_div(bmap
);
8766 isl_int_set_si(bmap
->div
[k
][0], 0);
8768 for (i
= 0; i
< eq
->n_row
; ++i
) {
8769 l
= isl_basic_map_alloc_equality(bmap
);
8772 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8773 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8774 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8775 isl_int_set(bmap
->eq
[l
][off
+ k
],
8781 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8782 l
= isl_basic_map_alloc_inequality(bmap
);
8785 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8786 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8787 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8788 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8807 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8808 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8809 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8811 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8812 c1
, c2
, c3
, c4
, isl_dim_in
);
8815 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8816 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8817 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8819 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8820 c1
, c2
, c3
, c4
, isl_dim_in
);
8823 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8824 __isl_take isl_dim
*dim
,
8825 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8826 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8828 return (isl_basic_set
*)
8829 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8830 c1
, c2
, c3
, c4
, isl_dim_in
);
8833 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
8838 return isl_dim_can_zip(bmap
->dim
);
8841 int isl_map_can_zip(__isl_keep isl_map
*map
)
8846 return isl_dim_can_zip(map
->dim
);
8849 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8850 * (A -> C) -> (B -> D).
8852 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
8861 if (!isl_basic_map_can_zip(bmap
))
8862 isl_die(bmap
->ctx
, isl_error_invalid
,
8863 "basic map cannot be zipped", goto error
);
8864 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
8865 isl_dim_size(bmap
->dim
->nested
[0], isl_dim_in
);
8866 n1
= isl_dim_size(bmap
->dim
->nested
[0], isl_dim_out
);
8867 n2
= isl_dim_size(bmap
->dim
->nested
[1], isl_dim_in
);
8868 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
8871 bmap
->dim
= isl_dim_zip(bmap
->dim
);
8876 isl_basic_map_free(bmap
);
8880 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8881 * (A -> C) -> (B -> D).
8883 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
8890 if (!isl_map_can_zip(map
))
8891 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
8894 map
= isl_map_cow(map
);
8898 for (i
= 0; i
< map
->n
; ++i
) {
8899 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
8904 map
->dim
= isl_dim_zip(map
->dim
);
8914 /* Construct a basic map mapping the domain of the affine expression
8915 * to a one-dimensional range prescribed by the affine expression.
8917 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
8921 isl_local_space
*ls
;
8922 isl_basic_map
*bmap
;
8927 ls
= isl_aff_get_local_space(aff
);
8928 ls
= isl_local_space_from_domain(ls
);
8929 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
8930 bmap
= isl_basic_map_from_local_space(ls
);
8931 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
8932 k
= isl_basic_map_alloc_equality(bmap
);
8936 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
8937 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
8938 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
8939 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
8940 aff
->v
->size
- (pos
+ 1));
8943 bmap
= isl_basic_map_finalize(bmap
);
8947 isl_basic_map_free(bmap
);
8951 /* Construct a basic map mapping a domain in the given space to
8952 * to an n-dimensional range, with n the number of elements in the list,
8953 * where each coordinate in the range is prescribed by the
8954 * corresponding affine expression.
8955 * The domains of all affine expressions in the list are assumed to match
8958 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
8959 __isl_take isl_dim
*domain_dim
, __isl_take isl_aff_list
*list
)
8963 isl_basic_map
*bmap
;
8968 dim
= isl_dim_from_domain(domain_dim
);
8969 bmap
= isl_basic_map_universe(dim
);
8971 for (i
= 0; i
< list
->n
; ++i
) {
8973 isl_basic_map
*bmap_i
;
8975 aff
= isl_aff_copy(list
->p
[i
]);
8976 bmap_i
= isl_basic_map_from_aff(aff
);
8978 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
8981 isl_aff_list_free(list
);