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
15 #include <isl_ctx_private.h>
16 #include <isl_map_private.h>
18 #include "isl_dim_private.h"
19 #include "isl_equalities.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
31 #include <isl_dim_map.h>
32 #include <isl_local_space_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
->dim
->n_in
;
167 unsigned isl_map_n_out(const struct isl_map
*map
)
169 return map
->dim
->n_out
;
172 unsigned isl_map_n_param(const struct isl_map
*map
)
174 return map
->dim
->nparam
;
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
);
309 bmap
= isl_basic_map_finalize(bmap
);
312 isl_local_space_free(ls
);
313 isl_basic_map_free(bmap
);
317 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
318 __isl_take isl_local_space
*ls
)
320 return isl_basic_map_from_local_space(ls
);
323 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
327 return isl_dim_copy(map
->dim
);
330 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
334 return isl_dim_copy(set
->dim
);
337 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
338 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
340 bmap
= isl_basic_map_cow(bmap
);
343 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
346 bmap
= isl_basic_map_finalize(bmap
);
349 isl_basic_map_free(bmap
);
353 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
354 enum isl_dim_type type
)
356 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
359 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
360 enum isl_dim_type type
, const char *s
)
364 map
= isl_map_cow(map
);
368 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
372 for (i
= 0; i
< map
->n
; ++i
) {
373 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
384 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
385 enum isl_dim_type type
)
387 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
390 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
393 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
396 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
398 return bset
? isl_dim_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
401 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
403 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
406 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
407 enum isl_dim_type type
, unsigned pos
)
409 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
412 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
413 enum isl_dim_type type
, unsigned pos
)
415 return bset
? isl_dim_get_name(bset
->dim
, type
, pos
) : NULL
;
418 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
419 enum isl_dim_type type
, unsigned pos
)
421 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
424 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
425 enum isl_dim_type type
, unsigned pos
)
427 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
430 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
431 __isl_take isl_basic_map
*bmap
,
432 enum isl_dim_type type
, unsigned pos
, const char *s
)
436 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
441 isl_basic_map_free(bmap
);
445 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
446 enum isl_dim_type type
, unsigned pos
, const char *s
)
453 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
457 for (i
= 0; i
< map
->n
; ++i
) {
458 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
469 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
470 __isl_take isl_basic_set
*bset
,
471 enum isl_dim_type type
, unsigned pos
, const char *s
)
473 return (isl_basic_set
*)isl_basic_map_set_dim_name(
474 (isl_basic_map
*)bset
, type
, pos
, s
);
477 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
478 enum isl_dim_type type
, unsigned pos
, const char *s
)
480 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
483 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
487 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
490 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
492 return isl_basic_map_is_rational(bset
);
495 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
496 struct isl_basic_map
*bmap
, unsigned extra
,
497 unsigned n_eq
, unsigned n_ineq
)
500 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
505 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
506 if (isl_blk_is_error(bmap
->block
))
509 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
514 bmap
->block2
= isl_blk_empty();
517 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
518 if (isl_blk_is_error(bmap
->block2
))
521 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
526 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
527 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
529 for (i
= 0; i
< extra
; ++i
)
530 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
534 bmap
->c_size
= n_eq
+ n_ineq
;
535 bmap
->eq
= bmap
->ineq
+ n_ineq
;
544 isl_basic_map_free(bmap
);
548 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
549 unsigned nparam
, unsigned dim
, unsigned extra
,
550 unsigned n_eq
, unsigned n_ineq
)
552 struct isl_basic_map
*bmap
;
553 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
554 return (struct isl_basic_set
*)bmap
;
557 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
558 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
560 struct isl_basic_map
*bmap
;
563 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
564 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
565 return (struct isl_basic_set
*)bmap
;
571 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
572 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
574 struct isl_basic_map
*bmap
;
578 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
583 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
589 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
590 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
591 unsigned n_eq
, unsigned n_ineq
)
593 struct isl_basic_map
*bmap
;
596 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
600 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
604 static void dup_constraints(
605 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
608 unsigned total
= isl_basic_map_total_dim(src
);
610 for (i
= 0; i
< src
->n_eq
; ++i
) {
611 int j
= isl_basic_map_alloc_equality(dst
);
612 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
615 for (i
= 0; i
< src
->n_ineq
; ++i
) {
616 int j
= isl_basic_map_alloc_inequality(dst
);
617 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
620 for (i
= 0; i
< src
->n_div
; ++i
) {
621 int j
= isl_basic_map_alloc_div(dst
);
622 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
624 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
627 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
629 struct isl_basic_map
*dup
;
633 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
634 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
637 dup_constraints(dup
, bmap
);
638 dup
->flags
= bmap
->flags
;
639 dup
->sample
= isl_vec_copy(bmap
->sample
);
643 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
645 struct isl_basic_map
*dup
;
647 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
648 return (struct isl_basic_set
*)dup
;
651 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
656 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
660 return isl_basic_set_dup(bset
);
663 struct isl_set
*isl_set_copy(struct isl_set
*set
)
672 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
677 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
681 bmap
= isl_basic_map_dup(bmap
);
683 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
687 struct isl_map
*isl_map_copy(struct isl_map
*map
)
696 void isl_basic_map_free(struct isl_basic_map
*bmap
)
704 isl_ctx_deref(bmap
->ctx
);
706 isl_blk_free(bmap
->ctx
, bmap
->block2
);
708 isl_blk_free(bmap
->ctx
, bmap
->block
);
709 isl_vec_free(bmap
->sample
);
710 isl_dim_free(bmap
->dim
);
714 void isl_basic_set_free(struct isl_basic_set
*bset
)
716 isl_basic_map_free((struct isl_basic_map
*)bset
);
719 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
721 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
724 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
730 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
731 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
733 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
734 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
735 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
736 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
737 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
738 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
740 int j
= isl_basic_map_alloc_inequality(bmap
);
744 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
745 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
752 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
753 bmap
->extra
- bmap
->n_div
);
757 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
759 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
762 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
766 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
771 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
773 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
776 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
781 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
783 if (pos
!= bmap
->n_eq
- 1) {
785 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
786 bmap
->eq
[bmap
->n_eq
- 1] = t
;
792 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
794 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
797 void isl_basic_map_inequality_to_equality(
798 struct isl_basic_map
*bmap
, unsigned pos
)
803 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
804 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
809 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
810 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
811 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
812 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
815 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
817 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
820 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
826 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
827 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
828 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
829 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
830 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
831 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
832 1 + isl_basic_map_total_dim(bmap
),
833 bmap
->extra
- bmap
->n_div
);
834 return bmap
->n_ineq
++;
837 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
839 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
842 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
846 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
851 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
853 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
856 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
861 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
863 if (pos
!= bmap
->n_ineq
- 1) {
865 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
866 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
867 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
873 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
875 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
878 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
883 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
886 k
= isl_basic_map_alloc_equality(bmap
);
889 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
892 isl_basic_map_free(bmap
);
896 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
899 return (isl_basic_set
*)
900 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
903 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
908 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
911 k
= isl_basic_map_alloc_inequality(bmap
);
914 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
917 isl_basic_map_free(bmap
);
921 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
924 return (isl_basic_set
*)
925 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
928 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
932 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
933 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
934 1 + 1 + isl_basic_map_total_dim(bmap
),
935 bmap
->extra
- bmap
->n_div
);
936 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
937 return bmap
->n_div
++;
940 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
942 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
945 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
949 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
954 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
956 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
959 /* Copy constraint from src to dst, putting the vars of src at offset
960 * dim_off in dst and the divs of src at offset div_off in dst.
961 * If both sets are actually map, then dim_off applies to the input
964 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
965 struct isl_basic_map
*src_map
, isl_int
*src
,
966 unsigned in_off
, unsigned out_off
, unsigned div_off
)
968 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
969 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
970 unsigned src_in
= isl_basic_map_n_in(src_map
);
971 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
972 unsigned src_out
= isl_basic_map_n_out(src_map
);
973 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
974 isl_int_set(dst
[0], src
[0]);
975 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
976 if (dst_nparam
> src_nparam
)
977 isl_seq_clr(dst
+1+src_nparam
,
978 dst_nparam
- src_nparam
);
979 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
980 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
982 isl_min(dst_in
-in_off
, src_in
));
983 if (dst_in
-in_off
> src_in
)
984 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
985 dst_in
- in_off
- src_in
);
986 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
987 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
988 src
+1+src_nparam
+src_in
,
989 isl_min(dst_out
-out_off
, src_out
));
990 if (dst_out
-out_off
> src_out
)
991 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
992 dst_out
- out_off
- src_out
);
993 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
994 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
995 src
+1+src_nparam
+src_in
+src_out
,
996 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
997 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
998 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
999 div_off
+src_map
->n_div
,
1000 dst_map
->n_div
- div_off
- src_map
->n_div
);
1003 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1004 struct isl_basic_map
*src_map
, isl_int
*src
,
1005 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1007 isl_int_set(dst
[0], src
[0]);
1008 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1011 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1012 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1017 if (!bmap1
|| !bmap2
)
1020 div_off
= bmap1
->n_div
;
1022 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1023 int i1
= isl_basic_map_alloc_equality(bmap1
);
1026 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1027 i_pos
, o_pos
, div_off
);
1030 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1031 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1034 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1035 i_pos
, o_pos
, div_off
);
1038 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1039 int i1
= isl_basic_map_alloc_div(bmap1
);
1042 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1043 i_pos
, o_pos
, div_off
);
1046 isl_basic_map_free(bmap2
);
1051 isl_basic_map_free(bmap1
);
1052 isl_basic_map_free(bmap2
);
1056 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1057 struct isl_basic_set
*bset2
, unsigned pos
)
1059 return (struct isl_basic_set
*)
1060 add_constraints((struct isl_basic_map
*)bset1
,
1061 (struct isl_basic_map
*)bset2
, 0, pos
);
1064 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1065 struct isl_dim
*dim
, unsigned extra
,
1066 unsigned n_eq
, unsigned n_ineq
)
1068 struct isl_basic_map
*ext
;
1078 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1079 base
->extra
>= base
->n_div
+ extra
;
1081 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1082 room_for_ineq(base
, n_ineq
)) {
1087 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1088 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1089 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1090 extra
+= base
->extra
;
1092 n_ineq
+= base
->n_ineq
;
1094 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1100 ext
->sample
= isl_vec_copy(base
->sample
);
1101 flags
= base
->flags
;
1102 ext
= add_constraints(ext
, base
, 0, 0);
1105 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1112 isl_basic_map_free(base
);
1116 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1117 struct isl_dim
*dim
, unsigned extra
,
1118 unsigned n_eq
, unsigned n_ineq
)
1120 return (struct isl_basic_set
*)
1121 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1122 extra
, n_eq
, n_ineq
);
1125 struct isl_basic_map
*isl_basic_map_extend_constraints(
1126 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1130 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1134 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1135 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1136 unsigned n_eq
, unsigned n_ineq
)
1138 struct isl_basic_map
*bmap
;
1139 struct isl_dim
*dim
;
1143 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1147 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1150 isl_basic_map_free(base
);
1154 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1155 unsigned nparam
, unsigned dim
, unsigned extra
,
1156 unsigned n_eq
, unsigned n_ineq
)
1158 return (struct isl_basic_set
*)
1159 isl_basic_map_extend((struct isl_basic_map
*)base
,
1160 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1163 struct isl_basic_set
*isl_basic_set_extend_constraints(
1164 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1166 return (struct isl_basic_set
*)
1167 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1171 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1173 return (struct isl_basic_set
*)
1174 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1177 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1182 if (bmap
->ref
> 1) {
1184 bmap
= isl_basic_map_dup(bmap
);
1187 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1191 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1199 return isl_set_dup(set
);
1202 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1210 return isl_map_dup(map
);
1213 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1214 unsigned a_len
, unsigned b_len
)
1216 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1217 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1218 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1221 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1222 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1230 isl_assert(bmap
->ctx
,
1231 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1233 if (n1
== 0 || n2
== 0)
1236 bmap
= isl_basic_map_cow(bmap
);
1240 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1241 if (isl_blk_is_error(blk
))
1244 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1246 bmap
->eq
[i
] + pos
, n1
, n2
);
1248 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1250 bmap
->ineq
[i
] + pos
, n1
, n2
);
1252 for (i
= 0; i
< bmap
->n_div
; ++i
)
1254 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1256 isl_blk_free(bmap
->ctx
, blk
);
1258 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1259 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1260 return isl_basic_map_finalize(bmap
);
1262 isl_basic_map_free(bmap
);
1266 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1267 __isl_take isl_basic_set
*bset
, unsigned n
)
1272 nparam
= isl_basic_set_n_param(bset
);
1273 dim
= isl_basic_set_n_dim(bset
);
1274 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1276 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1278 isl_basic_set_free(bset
);
1282 static __isl_give isl_set
*isl_set_swap_vars(__isl_take isl_set
*set
,
1286 set
= isl_set_cow(set
);
1290 for (i
= 0; i
< set
->n
; ++i
) {
1291 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1297 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1301 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1307 total
= isl_basic_map_total_dim(bmap
);
1308 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1309 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1311 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1313 i
= isl_basic_map_alloc_equality(bmap
);
1317 isl_int_set_si(bmap
->eq
[i
][0], 1);
1318 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1319 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1320 isl_vec_free(bmap
->sample
);
1321 bmap
->sample
= NULL
;
1322 return isl_basic_map_finalize(bmap
);
1324 isl_basic_map_free(bmap
);
1328 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1330 return (struct isl_basic_set
*)
1331 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1334 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1337 unsigned off
= isl_dim_total(bmap
->dim
);
1338 isl_int
*t
= bmap
->div
[a
];
1339 bmap
->div
[a
] = bmap
->div
[b
];
1342 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1343 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1345 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1346 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1348 for (i
= 0; i
< bmap
->n_div
; ++i
)
1349 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1350 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1353 /* Eliminate the specified n dimensions starting at first from the
1354 * constraints using Fourier-Motzkin. The dimensions themselves
1357 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1358 enum isl_dim_type type
, unsigned first
, unsigned n
)
1367 map
= isl_map_cow(map
);
1370 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1371 first
+= pos(map
->dim
, type
) - 1;
1373 for (i
= 0; i
< map
->n
; ++i
) {
1374 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1384 /* Eliminate the specified n dimensions starting at first from the
1385 * constraints using Fourier-Motzkin. The dimensions themselves
1388 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1389 enum isl_dim_type type
, unsigned first
, unsigned n
)
1391 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1394 /* Eliminate the specified n dimensions starting at first from the
1395 * constraints using Fourier-Motzkin. The dimensions themselves
1398 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1399 unsigned first
, unsigned n
)
1401 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1404 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1405 __isl_take isl_basic_map
*bmap
)
1407 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1412 return isl_basic_map_finalize(bmap
);
1415 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1416 __isl_take isl_basic_set
*bset
)
1418 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1419 (struct isl_basic_map
*)bset
);
1422 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1431 map
= isl_map_cow(map
);
1435 for (i
= 0; i
< map
->n
; ++i
) {
1436 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1446 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1448 return isl_map_remove_divs(set
);
1451 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1452 enum isl_dim_type type
, unsigned first
, unsigned n
)
1456 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1460 bmap
= isl_basic_map_eliminate_vars(bmap
,
1461 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1464 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1466 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1469 isl_basic_map_free(bmap
);
1473 /* Return true if the definition of the given div (recursively) involves
1474 * any of the given variables.
1476 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1477 unsigned first
, unsigned n
)
1480 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1482 if (isl_int_is_zero(bmap
->div
[div
][0]))
1484 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1487 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1488 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1490 if (div_involves_vars(bmap
, i
, first
, n
))
1497 /* Remove all divs (recursively) involving any of the given dimensions
1498 * in their definitions.
1500 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1501 __isl_take isl_basic_map
*bmap
,
1502 enum isl_dim_type type
, unsigned first
, unsigned n
)
1508 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1510 first
+= isl_basic_map_offset(bmap
, type
);
1512 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1513 if (!div_involves_vars(bmap
, i
, first
, n
))
1515 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1520 isl_basic_map_free(bmap
);
1524 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1525 enum isl_dim_type type
, unsigned first
, unsigned n
)
1534 map
= isl_map_cow(map
);
1538 for (i
= 0; i
< map
->n
; ++i
) {
1539 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1550 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1551 enum isl_dim_type type
, unsigned first
, unsigned n
)
1553 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1557 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
1558 enum isl_dim_type type
, unsigned first
, unsigned n
)
1565 if (first
+ n
> isl_basic_set_dim(bset
, type
))
1566 isl_die(bset
->ctx
, isl_error_invalid
,
1567 "index out of bounds", return -1);
1569 first
+= isl_basic_set_offset(bset
, type
);
1570 for (i
= 0; i
< bset
->n_eq
; ++i
)
1571 if (isl_seq_first_non_zero(bset
->eq
[i
] + first
, n
) >= 0)
1573 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1574 if (isl_seq_first_non_zero(bset
->ineq
[i
] + first
, n
) >= 0)
1580 int isl_set_involves_dims(__isl_keep isl_set
*set
,
1581 enum isl_dim_type type
, unsigned first
, unsigned n
)
1588 if (first
+ n
> isl_set_dim(set
, type
))
1589 isl_die(set
->ctx
, isl_error_invalid
,
1590 "index out of bounds", return -1);
1592 for (i
= 0; i
< set
->n
; ++i
) {
1593 int involves
= isl_basic_set_involves_dims(set
->p
[i
],
1595 if (involves
< 0 || !involves
)
1602 /* Return true if the definition of the given div is unknown or depends
1605 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1608 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1610 if (isl_int_is_zero(bmap
->div
[div
][0]))
1613 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1614 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1616 if (div_is_unknown(bmap
, i
))
1623 /* Remove all divs that are unknown or defined in terms of unknown divs.
1625 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1626 __isl_take isl_basic_map
*bmap
)
1633 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1634 if (!div_is_unknown(bmap
, i
))
1636 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1642 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1651 map
= isl_map_cow(map
);
1655 for (i
= 0; i
< map
->n
; ++i
) {
1656 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1666 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1668 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1671 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1672 __isl_take isl_basic_set
*bset
,
1673 enum isl_dim_type type
, unsigned first
, unsigned n
)
1675 return (isl_basic_set
*)
1676 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1679 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1680 enum isl_dim_type type
, unsigned first
, unsigned n
)
1687 map
= isl_map_cow(map
);
1690 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1692 for (i
= 0; i
< map
->n
; ++i
) {
1693 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1694 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1698 map
= isl_map_drop(map
, type
, first
, n
);
1705 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1706 enum isl_dim_type type
, unsigned first
, unsigned n
)
1708 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1711 /* Project out n inputs starting at first using Fourier-Motzkin */
1712 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1713 unsigned first
, unsigned n
)
1715 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1718 static void dump_term(struct isl_basic_map
*bmap
,
1719 isl_int c
, int pos
, FILE *out
)
1722 unsigned in
= isl_basic_map_n_in(bmap
);
1723 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1724 unsigned nparam
= isl_basic_map_n_param(bmap
);
1726 isl_int_print(out
, c
, 0);
1728 if (!isl_int_is_one(c
))
1729 isl_int_print(out
, c
, 0);
1730 if (pos
< 1 + nparam
) {
1731 name
= isl_dim_get_name(bmap
->dim
,
1732 isl_dim_param
, pos
- 1);
1734 fprintf(out
, "%s", name
);
1736 fprintf(out
, "p%d", pos
- 1);
1737 } else if (pos
< 1 + nparam
+ in
)
1738 fprintf(out
, "i%d", pos
- 1 - nparam
);
1739 else if (pos
< 1 + nparam
+ dim
)
1740 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1742 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1746 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1747 int sign
, FILE *out
)
1751 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1755 for (i
= 0, first
= 1; i
< len
; ++i
) {
1756 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1759 fprintf(out
, " + ");
1761 isl_int_abs(v
, c
[i
]);
1762 dump_term(bmap
, v
, i
, out
);
1769 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1770 const char *op
, FILE *out
, int indent
)
1774 fprintf(out
, "%*s", indent
, "");
1776 dump_constraint_sign(bmap
, c
, 1, out
);
1777 fprintf(out
, " %s ", op
);
1778 dump_constraint_sign(bmap
, c
, -1, out
);
1782 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1783 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1785 fprintf(out
, "%*s", indent
, "");
1786 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1791 static void dump_constraints(struct isl_basic_map
*bmap
,
1792 isl_int
**c
, unsigned n
,
1793 const char *op
, FILE *out
, int indent
)
1797 for (i
= 0; i
< n
; ++i
)
1798 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1801 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1805 unsigned total
= isl_basic_map_total_dim(bmap
);
1807 for (j
= 0; j
< 1 + total
; ++j
) {
1808 if (isl_int_is_zero(exp
[j
]))
1810 if (!first
&& isl_int_is_pos(exp
[j
]))
1812 dump_term(bmap
, exp
[j
], j
, out
);
1817 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1821 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1822 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1824 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1825 fprintf(out
, "%*s", indent
, "");
1826 fprintf(out
, "e%d = [(", i
);
1827 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1829 isl_int_print(out
, bmap
->div
[i
][0], 0);
1830 fprintf(out
, "]\n");
1834 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
1835 FILE *out
, int indent
)
1838 fprintf(out
, "null basic set\n");
1842 fprintf(out
, "%*s", indent
, "");
1843 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1844 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1845 bset
->extra
, bset
->flags
);
1846 dump((struct isl_basic_map
*)bset
, out
, indent
);
1849 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
1850 FILE *out
, int indent
)
1853 fprintf(out
, "null basic map\n");
1857 fprintf(out
, "%*s", indent
, "");
1858 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1859 "flags: %x, n_name: %d\n",
1861 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1862 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1863 dump(bmap
, out
, indent
);
1866 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1871 total
= isl_basic_map_total_dim(bmap
);
1872 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1873 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1874 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1875 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1879 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1881 struct isl_set
*set
;
1885 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1886 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1887 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1888 sizeof(struct isl_set
) +
1889 (n
- 1) * sizeof(struct isl_basic_set
*));
1893 set
->ctx
= dim
->ctx
;
1894 isl_ctx_ref(set
->ctx
);
1906 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1907 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1909 struct isl_set
*set
;
1910 struct isl_dim
*dims
;
1912 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1916 set
= isl_set_alloc_dim(dims
, n
, flags
);
1920 /* Make sure "map" has room for at least "n" more basic maps.
1922 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1925 struct isl_map
*grown
= NULL
;
1929 isl_assert(map
->ctx
, n
>= 0, goto error
);
1930 if (map
->n
+ n
<= map
->size
)
1932 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1935 for (i
= 0; i
< map
->n
; ++i
) {
1936 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1944 isl_map_free(grown
);
1949 /* Make sure "set" has room for at least "n" more basic sets.
1951 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1953 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1956 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1959 struct isl_set
*dup
;
1964 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1967 for (i
= 0; i
< set
->n
; ++i
)
1968 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1972 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1974 return isl_map_from_basic_map(bset
);
1977 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1979 struct isl_map
*map
;
1984 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1985 return isl_map_add_basic_map(map
, bmap
);
1988 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1989 __isl_take isl_basic_set
*bset
)
1991 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1992 (struct isl_basic_map
*)bset
);
1995 void isl_set_free(struct isl_set
*set
)
2005 isl_ctx_deref(set
->ctx
);
2006 for (i
= 0; i
< set
->n
; ++i
)
2007 isl_basic_set_free(set
->p
[i
]);
2008 isl_dim_free(set
->dim
);
2012 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2017 fprintf(out
, "null set\n");
2021 fprintf(out
, "%*s", indent
, "");
2022 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2023 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2025 for (i
= 0; i
< set
->n
; ++i
) {
2026 fprintf(out
, "%*s", indent
, "");
2027 fprintf(out
, "basic set %d:\n", i
);
2028 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2032 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2037 fprintf(out
, "null map\n");
2041 fprintf(out
, "%*s", indent
, "");
2042 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2043 "flags: %x, n_name: %d\n",
2044 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2045 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
2046 for (i
= 0; i
< map
->n
; ++i
) {
2047 fprintf(out
, "%*s", indent
, "");
2048 fprintf(out
, "basic map %d:\n", i
);
2049 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2053 struct isl_basic_map
*isl_basic_map_intersect_domain(
2054 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2056 struct isl_basic_map
*bmap_domain
;
2061 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2062 bset
->dim
, isl_dim_param
), goto error
);
2064 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2065 isl_assert(bset
->ctx
,
2066 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2068 bmap
= isl_basic_map_cow(bmap
);
2071 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2072 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2073 bmap_domain
= isl_basic_map_from_domain(bset
);
2074 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2076 bmap
= isl_basic_map_simplify(bmap
);
2077 return isl_basic_map_finalize(bmap
);
2079 isl_basic_map_free(bmap
);
2080 isl_basic_set_free(bset
);
2084 struct isl_basic_map
*isl_basic_map_intersect_range(
2085 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2087 struct isl_basic_map
*bmap_range
;
2092 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2093 bset
->dim
, isl_dim_param
), goto error
);
2095 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2096 isl_assert(bset
->ctx
,
2097 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2099 if (isl_basic_set_is_universe(bset
)) {
2100 isl_basic_set_free(bset
);
2104 bmap
= isl_basic_map_cow(bmap
);
2107 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2108 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2109 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2110 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2112 bmap
= isl_basic_map_simplify(bmap
);
2113 return isl_basic_map_finalize(bmap
);
2115 isl_basic_map_free(bmap
);
2116 isl_basic_set_free(bset
);
2120 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2126 total
= 1 + isl_basic_map_total_dim(bmap
);
2127 if (total
!= vec
->size
)
2132 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2133 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2134 if (!isl_int_is_zero(s
)) {
2140 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2141 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2142 if (isl_int_is_neg(s
)) {
2153 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2155 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2158 struct isl_basic_map
*isl_basic_map_intersect(
2159 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2161 struct isl_vec
*sample
= NULL
;
2163 if (!bmap1
|| !bmap2
)
2166 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2167 bmap2
->dim
, isl_dim_param
), goto error
);
2168 if (isl_dim_total(bmap1
->dim
) ==
2169 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2170 isl_dim_total(bmap2
->dim
) !=
2171 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2172 return isl_basic_map_intersect(bmap2
, bmap1
);
2174 if (isl_dim_total(bmap2
->dim
) !=
2175 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2176 isl_assert(bmap1
->ctx
,
2177 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2179 if (bmap1
->sample
&&
2180 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2181 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2182 sample
= isl_vec_copy(bmap1
->sample
);
2183 else if (bmap2
->sample
&&
2184 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2185 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2186 sample
= isl_vec_copy(bmap2
->sample
);
2188 bmap1
= isl_basic_map_cow(bmap1
);
2191 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2192 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2193 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2196 isl_vec_free(sample
);
2198 isl_vec_free(bmap1
->sample
);
2199 bmap1
->sample
= sample
;
2202 bmap1
= isl_basic_map_simplify(bmap1
);
2203 return isl_basic_map_finalize(bmap1
);
2206 isl_vec_free(sample
);
2207 isl_basic_map_free(bmap1
);
2208 isl_basic_map_free(bmap2
);
2212 struct isl_basic_set
*isl_basic_set_intersect(
2213 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2215 return (struct isl_basic_set
*)
2216 isl_basic_map_intersect(
2217 (struct isl_basic_map
*)bset1
,
2218 (struct isl_basic_map
*)bset2
);
2221 /* Special case of isl_map_intersect, where both map1 and map2
2222 * are convex, without any divs and such that either map1 or map2
2223 * contains a single constraint. This constraint is then simply
2224 * added to the other map.
2226 static __isl_give isl_map
*map_intersect_add_constraint(
2227 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2229 struct isl_basic_map
*bmap1
;
2230 struct isl_basic_map
*bmap2
;
2232 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2233 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2234 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2235 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2237 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2238 return isl_map_intersect(map2
, map1
);
2240 isl_assert(map2
->ctx
,
2241 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2243 map1
= isl_map_cow(map1
);
2246 if (isl_map_plain_is_empty(map1
)) {
2250 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2251 if (map2
->p
[0]->n_eq
== 1)
2252 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2254 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2255 map2
->p
[0]->ineq
[0]);
2257 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2258 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2262 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2263 isl_basic_map_free(map1
->p
[0]);
2276 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2279 struct isl_map
*result
;
2285 if (isl_map_plain_is_empty(map1
)) {
2289 if (isl_map_plain_is_empty(map2
)) {
2294 if (map1
->n
== 1 && map2
->n
== 1 &&
2295 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2296 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2297 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2298 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2299 return map_intersect_add_constraint(map1
, map2
);
2300 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2301 map2
->dim
, isl_dim_param
), goto error
);
2302 if (isl_dim_total(map1
->dim
) ==
2303 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2304 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2305 return isl_map_intersect(map2
, map1
);
2307 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2308 isl_assert(map1
->ctx
,
2309 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2311 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2312 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2313 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2315 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2316 map1
->n
* map2
->n
, flags
);
2319 for (i
= 0; i
< map1
->n
; ++i
)
2320 for (j
= 0; j
< map2
->n
; ++j
) {
2321 struct isl_basic_map
*part
;
2322 part
= isl_basic_map_intersect(
2323 isl_basic_map_copy(map1
->p
[i
]),
2324 isl_basic_map_copy(map2
->p
[j
]));
2325 if (isl_basic_map_is_empty(part
))
2326 isl_basic_map_free(part
);
2328 result
= isl_map_add_basic_map(result
, part
);
2341 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2343 return (struct isl_set
*)
2344 isl_map_intersect((struct isl_map
*)set1
,
2345 (struct isl_map
*)set2
);
2348 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2350 struct isl_dim
*dim
;
2351 struct isl_basic_set
*bset
;
2356 bmap
= isl_basic_map_cow(bmap
);
2359 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2360 in
= isl_basic_map_n_in(bmap
);
2361 bset
= isl_basic_set_from_basic_map(bmap
);
2362 bset
= isl_basic_set_swap_vars(bset
, in
);
2363 return isl_basic_map_from_basic_set(bset
, dim
);
2366 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2367 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2369 struct isl_dim
*res_dim
;
2370 struct isl_basic_map
*res
;
2371 struct isl_dim_map
*dim_map
;
2372 unsigned total
, off
;
2373 enum isl_dim_type t
;
2381 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2383 total
= isl_basic_map_total_dim(bmap
) + n
;
2384 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2386 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2388 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2390 unsigned size
= isl_basic_map_dim(bmap
, t
);
2391 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2393 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2394 pos
, size
- pos
, off
+ pos
+ n
);
2396 off
+= isl_dim_size(res_dim
, t
);
2398 isl_dim_map_div(dim_map
, bmap
, off
);
2400 res
= isl_basic_map_alloc_dim(res_dim
,
2401 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2402 if (isl_basic_map_is_rational(bmap
))
2403 res
= isl_basic_map_set_rational(res
);
2404 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2405 return isl_basic_map_finalize(res
);
2408 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2409 enum isl_dim_type type
, unsigned n
)
2413 return isl_basic_map_insert(bmap
, type
,
2414 isl_basic_map_dim(bmap
, type
), n
);
2417 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2418 enum isl_dim_type type
, unsigned n
)
2422 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2423 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2425 isl_basic_set_free(bset
);
2429 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2430 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2437 map
= isl_map_cow(map
);
2441 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2445 for (i
= 0; i
< map
->n
; ++i
) {
2446 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2457 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2458 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2460 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2463 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2464 enum isl_dim_type type
, unsigned n
)
2468 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2471 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2472 enum isl_dim_type type
, unsigned n
)
2476 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2477 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2483 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2484 __isl_take isl_basic_map
*bmap
,
2485 enum isl_dim_type dst_type
, unsigned dst_pos
,
2486 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2489 struct isl_dim_map
*dim_map
;
2490 struct isl_basic_map
*res
;
2491 enum isl_dim_type t
;
2492 unsigned total
, off
;
2499 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2502 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2505 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2507 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2508 pos(bmap
->dim
, src_type
) + src_pos
+
2509 ((src_type
< dst_type
) ? n
: 0)) {
2510 bmap
= isl_basic_map_cow(bmap
);
2514 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2515 src_type
, src_pos
, n
);
2519 bmap
= isl_basic_map_finalize(bmap
);
2524 total
= isl_basic_map_total_dim(bmap
);
2525 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2528 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2529 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2530 if (t
== dst_type
) {
2531 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2534 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2537 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2538 dst_pos
, size
- dst_pos
, off
);
2539 off
+= size
- dst_pos
;
2540 } else if (t
== src_type
) {
2541 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2544 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2545 src_pos
+ n
, size
- src_pos
- n
, off
);
2546 off
+= size
- src_pos
- n
;
2548 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2552 isl_dim_map_div(dim_map
, bmap
, off
);
2554 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2555 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2556 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2558 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2559 src_type
, src_pos
, n
);
2563 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2564 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2565 bmap
= isl_basic_map_finalize(bmap
);
2569 isl_basic_map_free(bmap
);
2573 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2574 enum isl_dim_type dst_type
, unsigned dst_pos
,
2575 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2577 return (isl_basic_set
*)isl_basic_map_move_dims(
2578 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2581 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2582 enum isl_dim_type dst_type
, unsigned dst_pos
,
2583 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2587 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2588 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2589 src_type
, src_pos
, n
);
2595 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2596 enum isl_dim_type dst_type
, unsigned dst_pos
,
2597 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2606 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2609 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2612 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2614 map
= isl_map_cow(map
);
2618 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2622 for (i
= 0; i
< map
->n
; ++i
) {
2623 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2625 src_type
, src_pos
, n
);
2636 /* Move the specified dimensions to the last columns right before
2637 * the divs. Don't change the dimension specification of bmap.
2638 * That's the responsibility of the caller.
2640 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2641 enum isl_dim_type type
, unsigned first
, unsigned n
)
2643 struct isl_dim_map
*dim_map
;
2644 struct isl_basic_map
*res
;
2645 enum isl_dim_type t
;
2646 unsigned total
, off
;
2650 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2653 total
= isl_basic_map_total_dim(bmap
);
2654 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2657 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2658 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2660 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2663 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2664 first
, n
, total
- bmap
->n_div
- n
);
2665 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2666 first
+ n
, size
- (first
+ n
), off
);
2667 off
+= size
- (first
+ n
);
2669 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2673 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2675 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2676 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2677 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2681 /* Turn the n dimensions of type type, starting at first
2682 * into existentially quantified variables.
2684 __isl_give isl_basic_map
*isl_basic_map_project_out(
2685 __isl_take isl_basic_map
*bmap
,
2686 enum isl_dim_type type
, unsigned first
, unsigned n
)
2699 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2700 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2702 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2705 bmap
= move_last(bmap
, type
, first
, n
);
2706 bmap
= isl_basic_map_cow(bmap
);
2710 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2711 old
= bmap
->block2
.data
;
2712 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2713 (bmap
->extra
+ n
) * (1 + row_size
));
2714 if (!bmap
->block2
.data
)
2716 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2719 for (i
= 0; i
< n
; ++i
) {
2720 new_div
[i
] = bmap
->block2
.data
+
2721 (bmap
->extra
+ i
) * (1 + row_size
);
2722 isl_seq_clr(new_div
[i
], 1 + row_size
);
2724 for (i
= 0; i
< bmap
->extra
; ++i
)
2725 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2727 bmap
->div
= new_div
;
2731 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2734 bmap
= isl_basic_map_simplify(bmap
);
2735 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2736 return isl_basic_map_finalize(bmap
);
2738 isl_basic_map_free(bmap
);
2742 /* Turn the n dimensions of type type, starting at first
2743 * into existentially quantified variables.
2745 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2746 enum isl_dim_type type
, unsigned first
, unsigned n
)
2748 return (isl_basic_set
*)isl_basic_map_project_out(
2749 (isl_basic_map
*)bset
, type
, first
, n
);
2752 /* Turn the n dimensions of type type, starting at first
2753 * into existentially quantified variables.
2755 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2756 enum isl_dim_type type
, unsigned first
, unsigned n
)
2766 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2768 map
= isl_map_cow(map
);
2772 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2776 for (i
= 0; i
< map
->n
; ++i
) {
2777 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2788 /* Turn the n dimensions of type type, starting at first
2789 * into existentially quantified variables.
2791 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2792 enum isl_dim_type type
, unsigned first
, unsigned n
)
2794 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2797 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2801 for (i
= 0; i
< n
; ++i
) {
2802 j
= isl_basic_map_alloc_div(bmap
);
2805 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2809 isl_basic_map_free(bmap
);
2813 struct isl_basic_map
*isl_basic_map_apply_range(
2814 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2816 struct isl_dim
*dim_result
= NULL
;
2817 struct isl_basic_map
*bmap
;
2818 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2819 struct isl_dim_map
*dim_map1
, *dim_map2
;
2821 if (!bmap1
|| !bmap2
)
2824 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2825 isl_dim_copy(bmap2
->dim
));
2827 n_in
= isl_basic_map_n_in(bmap1
);
2828 n_out
= isl_basic_map_n_out(bmap2
);
2829 n
= isl_basic_map_n_out(bmap1
);
2830 nparam
= isl_basic_map_n_param(bmap1
);
2832 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2833 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2834 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2835 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2836 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2837 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2838 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2839 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2840 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2841 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2842 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2844 bmap
= isl_basic_map_alloc_dim(dim_result
,
2845 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2846 bmap1
->n_eq
+ bmap2
->n_eq
,
2847 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2848 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2849 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2850 bmap
= add_divs(bmap
, n
);
2851 bmap
= isl_basic_map_simplify(bmap
);
2852 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2853 return isl_basic_map_finalize(bmap
);
2855 isl_basic_map_free(bmap1
);
2856 isl_basic_map_free(bmap2
);
2860 struct isl_basic_set
*isl_basic_set_apply(
2861 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2866 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2869 return (struct isl_basic_set
*)
2870 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2872 isl_basic_set_free(bset
);
2873 isl_basic_map_free(bmap
);
2877 struct isl_basic_map
*isl_basic_map_apply_domain(
2878 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2880 if (!bmap1
|| !bmap2
)
2883 isl_assert(bmap1
->ctx
,
2884 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2885 isl_assert(bmap1
->ctx
,
2886 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2889 bmap1
= isl_basic_map_reverse(bmap1
);
2890 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2891 return isl_basic_map_reverse(bmap1
);
2893 isl_basic_map_free(bmap1
);
2894 isl_basic_map_free(bmap2
);
2898 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2899 * A \cap B -> f(A) + f(B)
2901 struct isl_basic_map
*isl_basic_map_sum(
2902 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2904 unsigned n_in
, n_out
, nparam
, total
, pos
;
2905 struct isl_basic_map
*bmap
= NULL
;
2906 struct isl_dim_map
*dim_map1
, *dim_map2
;
2909 if (!bmap1
|| !bmap2
)
2912 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2915 nparam
= isl_basic_map_n_param(bmap1
);
2916 n_in
= isl_basic_map_n_in(bmap1
);
2917 n_out
= isl_basic_map_n_out(bmap1
);
2919 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2920 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2921 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2922 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2923 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2924 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2925 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2926 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2927 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2928 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2929 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2931 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2932 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2933 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2934 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2935 for (i
= 0; i
< n_out
; ++i
) {
2936 int j
= isl_basic_map_alloc_equality(bmap
);
2939 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2940 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2941 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2942 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2944 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2945 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2946 bmap
= add_divs(bmap
, 2 * n_out
);
2948 bmap
= isl_basic_map_simplify(bmap
);
2949 return isl_basic_map_finalize(bmap
);
2951 isl_basic_map_free(bmap
);
2952 isl_basic_map_free(bmap1
);
2953 isl_basic_map_free(bmap2
);
2957 /* Given two maps A -> f(A) and B -> g(B), construct a map
2958 * A \cap B -> f(A) + f(B)
2960 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2962 struct isl_map
*result
;
2968 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2970 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2971 map1
->n
* map2
->n
, 0);
2974 for (i
= 0; i
< map1
->n
; ++i
)
2975 for (j
= 0; j
< map2
->n
; ++j
) {
2976 struct isl_basic_map
*part
;
2977 part
= isl_basic_map_sum(
2978 isl_basic_map_copy(map1
->p
[i
]),
2979 isl_basic_map_copy(map2
->p
[j
]));
2980 if (isl_basic_map_is_empty(part
))
2981 isl_basic_map_free(part
);
2983 result
= isl_map_add_basic_map(result
, part
);
2996 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2997 __isl_take isl_set
*set2
)
2999 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3002 /* Given a basic map A -> f(A), construct A -> -f(A).
3004 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3009 bmap
= isl_basic_map_cow(bmap
);
3013 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3014 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3015 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3016 for (j
= 0; j
< n
; ++j
)
3017 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3018 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3019 for (j
= 0; j
< n
; ++j
)
3020 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3021 for (i
= 0; i
< bmap
->n_div
; ++i
)
3022 for (j
= 0; j
< n
; ++j
)
3023 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3024 return isl_basic_map_finalize(bmap
);
3027 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3029 return isl_basic_map_neg(bset
);
3032 /* Given a map A -> f(A), construct A -> -f(A).
3034 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3038 map
= isl_map_cow(map
);
3042 for (i
= 0; i
< map
->n
; ++i
) {
3043 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3054 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3056 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3059 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3060 * A -> floor(f(A)/d).
3062 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3065 unsigned n_in
, n_out
, nparam
, total
, pos
;
3066 struct isl_basic_map
*result
= NULL
;
3067 struct isl_dim_map
*dim_map
;
3073 nparam
= isl_basic_map_n_param(bmap
);
3074 n_in
= isl_basic_map_n_in(bmap
);
3075 n_out
= isl_basic_map_n_out(bmap
);
3077 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3078 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3079 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3080 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3081 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3082 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3084 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
3085 bmap
->n_div
+ n_out
,
3086 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3087 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3088 result
= add_divs(result
, n_out
);
3089 for (i
= 0; i
< n_out
; ++i
) {
3091 j
= isl_basic_map_alloc_inequality(result
);
3094 isl_seq_clr(result
->ineq
[j
], 1+total
);
3095 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3096 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3097 j
= isl_basic_map_alloc_inequality(result
);
3100 isl_seq_clr(result
->ineq
[j
], 1+total
);
3101 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3102 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3103 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3106 result
= isl_basic_map_simplify(result
);
3107 return isl_basic_map_finalize(result
);
3109 isl_basic_map_free(result
);
3113 /* Given a map A -> f(A) and an integer d, construct a map
3114 * A -> floor(f(A)/d).
3116 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3120 map
= isl_map_cow(map
);
3124 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3125 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3126 for (i
= 0; i
< map
->n
; ++i
) {
3127 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3138 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3144 i
= isl_basic_map_alloc_equality(bmap
);
3147 nparam
= isl_basic_map_n_param(bmap
);
3148 n_in
= isl_basic_map_n_in(bmap
);
3149 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3150 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3151 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3152 return isl_basic_map_finalize(bmap
);
3154 isl_basic_map_free(bmap
);
3158 /* Add a constraints to "bmap" expressing i_pos < o_pos
3160 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3166 i
= isl_basic_map_alloc_inequality(bmap
);
3169 nparam
= isl_basic_map_n_param(bmap
);
3170 n_in
= isl_basic_map_n_in(bmap
);
3171 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3172 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3173 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3174 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3175 return isl_basic_map_finalize(bmap
);
3177 isl_basic_map_free(bmap
);
3181 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3183 static __isl_give isl_basic_map
*var_less_or_equal(
3184 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3190 i
= isl_basic_map_alloc_inequality(bmap
);
3193 nparam
= isl_basic_map_n_param(bmap
);
3194 n_in
= isl_basic_map_n_in(bmap
);
3195 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3196 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3197 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3198 return isl_basic_map_finalize(bmap
);
3200 isl_basic_map_free(bmap
);
3204 /* Add a constraints to "bmap" expressing i_pos > o_pos
3206 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3212 i
= isl_basic_map_alloc_inequality(bmap
);
3215 nparam
= isl_basic_map_n_param(bmap
);
3216 n_in
= isl_basic_map_n_in(bmap
);
3217 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3218 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3219 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3220 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3221 return isl_basic_map_finalize(bmap
);
3223 isl_basic_map_free(bmap
);
3227 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3229 static __isl_give isl_basic_map
*var_more_or_equal(
3230 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3236 i
= isl_basic_map_alloc_inequality(bmap
);
3239 nparam
= isl_basic_map_n_param(bmap
);
3240 n_in
= isl_basic_map_n_in(bmap
);
3241 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3242 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3243 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3244 return isl_basic_map_finalize(bmap
);
3246 isl_basic_map_free(bmap
);
3250 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3253 struct isl_basic_map
*bmap
;
3254 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3257 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3258 bmap
= var_equal(bmap
, i
);
3259 return isl_basic_map_finalize(bmap
);
3262 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3264 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3267 struct isl_basic_map
*bmap
;
3268 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3271 for (i
= 0; i
< pos
&& bmap
; ++i
)
3272 bmap
= var_equal(bmap
, i
);
3274 bmap
= var_less(bmap
, pos
);
3275 return isl_basic_map_finalize(bmap
);
3278 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3280 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3281 __isl_take isl_dim
*dim
, unsigned pos
)
3284 isl_basic_map
*bmap
;
3286 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3287 for (i
= 0; i
< pos
; ++i
)
3288 bmap
= var_equal(bmap
, i
);
3289 bmap
= var_less_or_equal(bmap
, pos
);
3290 return isl_basic_map_finalize(bmap
);
3293 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3295 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3298 struct isl_basic_map
*bmap
;
3299 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3302 for (i
= 0; i
< pos
&& bmap
; ++i
)
3303 bmap
= var_equal(bmap
, i
);
3305 bmap
= var_more(bmap
, pos
);
3306 return isl_basic_map_finalize(bmap
);
3309 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3311 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3312 __isl_take isl_dim
*dim
, unsigned pos
)
3315 isl_basic_map
*bmap
;
3317 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3318 for (i
= 0; i
< pos
; ++i
)
3319 bmap
= var_equal(bmap
, i
);
3320 bmap
= var_more_or_equal(bmap
, pos
);
3321 return isl_basic_map_finalize(bmap
);
3324 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3325 unsigned n
, int equal
)
3327 struct isl_map
*map
;
3330 if (n
== 0 && equal
)
3331 return isl_map_universe(dims
);
3333 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3335 for (i
= 0; i
+ 1 < n
; ++i
)
3336 map
= isl_map_add_basic_map(map
,
3337 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3340 map
= isl_map_add_basic_map(map
,
3341 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3343 map
= isl_map_add_basic_map(map
,
3344 isl_basic_map_less_at(dims
, n
- 1));
3351 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3355 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3358 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3360 return map_lex_lte_first(dim
, n
, 0);
3363 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3365 return map_lex_lte_first(dim
, n
, 1);
3368 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3370 return map_lex_lte(isl_dim_map_from_set(set_dim
), 0);
3373 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3375 return map_lex_lte(isl_dim_map_from_set(set_dim
), 1);
3378 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3379 unsigned n
, int equal
)
3381 struct isl_map
*map
;
3384 if (n
== 0 && equal
)
3385 return isl_map_universe(dims
);
3387 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3389 for (i
= 0; i
+ 1 < n
; ++i
)
3390 map
= isl_map_add_basic_map(map
,
3391 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3394 map
= isl_map_add_basic_map(map
,
3395 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3397 map
= isl_map_add_basic_map(map
,
3398 isl_basic_map_more_at(dims
, n
- 1));
3405 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3409 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3412 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3414 return map_lex_gte_first(dim
, n
, 0);
3417 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3419 return map_lex_gte_first(dim
, n
, 1);
3422 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3424 return map_lex_gte(isl_dim_map_from_set(set_dim
), 0);
3427 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3429 return map_lex_gte(isl_dim_map_from_set(set_dim
), 1);
3432 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3433 __isl_take isl_set
*set2
)
3436 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3437 map
= isl_map_intersect_domain(map
, set1
);
3438 map
= isl_map_intersect_range(map
, set2
);
3442 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3443 __isl_take isl_set
*set2
)
3446 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3447 map
= isl_map_intersect_domain(map
, set1
);
3448 map
= isl_map_intersect_range(map
, set2
);
3452 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3453 __isl_take isl_set
*set2
)
3456 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3457 map
= isl_map_intersect_domain(map
, set1
);
3458 map
= isl_map_intersect_range(map
, set2
);
3462 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3463 __isl_take isl_set
*set2
)
3466 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3467 map
= isl_map_intersect_domain(map
, set1
);
3468 map
= isl_map_intersect_range(map
, set2
);
3472 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3473 __isl_take isl_map
*map2
)
3476 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3477 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3478 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3482 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3483 __isl_take isl_map
*map2
)
3486 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3487 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3488 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3492 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3493 __isl_take isl_map
*map2
)
3496 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3497 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3498 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3502 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3503 __isl_take isl_map
*map2
)
3506 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3507 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3508 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3512 struct isl_basic_map
*isl_basic_map_from_basic_set(
3513 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3515 struct isl_basic_map
*bmap
;
3517 bset
= isl_basic_set_cow(bset
);
3521 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3522 isl_dim_free(bset
->dim
);
3523 bmap
= (struct isl_basic_map
*) bset
;
3525 return isl_basic_map_finalize(bmap
);
3527 isl_basic_set_free(bset
);
3532 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3536 if (bmap
->dim
->n_in
== 0)
3537 return (struct isl_basic_set
*)bmap
;
3538 bmap
= isl_basic_map_cow(bmap
);
3541 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3544 bmap
= isl_basic_map_finalize(bmap
);
3545 return (struct isl_basic_set
*)bmap
;
3547 isl_basic_map_free(bmap
);
3551 /* For a div d = floor(f/m), add the constraints
3554 * -(f-(n-1)) + m d >= 0
3556 * Note that the second constraint is the negation of
3560 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3561 unsigned pos
, isl_int
*div
)
3564 unsigned total
= isl_basic_map_total_dim(bmap
);
3566 i
= isl_basic_map_alloc_inequality(bmap
);
3569 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3570 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3572 j
= isl_basic_map_alloc_inequality(bmap
);
3575 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3576 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3577 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3581 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3582 unsigned pos
, isl_int
*div
)
3584 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3588 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3590 unsigned total
= isl_basic_map_total_dim(bmap
);
3591 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3593 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3597 struct isl_basic_set
*isl_basic_map_underlying_set(
3598 struct isl_basic_map
*bmap
)
3602 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3604 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3605 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3606 return (struct isl_basic_set
*)bmap
;
3607 bmap
= isl_basic_map_cow(bmap
);
3610 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3613 bmap
->extra
-= bmap
->n_div
;
3615 bmap
= isl_basic_map_finalize(bmap
);
3616 return (struct isl_basic_set
*)bmap
;
3621 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3622 __isl_take isl_basic_set
*bset
)
3624 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3627 struct isl_basic_map
*isl_basic_map_overlying_set(
3628 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3630 struct isl_basic_map
*bmap
;
3631 struct isl_ctx
*ctx
;
3638 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3639 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3640 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3642 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3643 isl_basic_map_free(like
);
3644 return (struct isl_basic_map
*)bset
;
3646 bset
= isl_basic_set_cow(bset
);
3649 total
= bset
->dim
->n_out
+ bset
->extra
;
3650 bmap
= (struct isl_basic_map
*)bset
;
3651 isl_dim_free(bmap
->dim
);
3652 bmap
->dim
= isl_dim_copy(like
->dim
);
3655 bmap
->n_div
= like
->n_div
;
3656 bmap
->extra
+= like
->n_div
;
3660 ltotal
= total
- bmap
->extra
+ like
->extra
;
3663 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3664 bmap
->extra
* (1 + 1 + total
));
3665 if (isl_blk_is_error(bmap
->block2
))
3667 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
3671 for (i
= 0; i
< bmap
->extra
; ++i
)
3672 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3673 for (i
= 0; i
< like
->n_div
; ++i
) {
3674 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3675 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3677 bmap
= isl_basic_map_extend_constraints(bmap
,
3678 0, 2 * like
->n_div
);
3679 for (i
= 0; i
< like
->n_div
; ++i
) {
3680 if (isl_int_is_zero(bmap
->div
[i
][0]))
3682 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3686 isl_basic_map_free(like
);
3687 bmap
= isl_basic_map_simplify(bmap
);
3688 bmap
= isl_basic_map_finalize(bmap
);
3691 isl_basic_map_free(like
);
3692 isl_basic_set_free(bset
);
3696 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3697 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3699 return (struct isl_basic_set
*)
3700 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3703 struct isl_set
*isl_set_from_underlying_set(
3704 struct isl_set
*set
, struct isl_basic_set
*like
)
3710 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3712 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3713 isl_basic_set_free(like
);
3716 set
= isl_set_cow(set
);
3719 for (i
= 0; i
< set
->n
; ++i
) {
3720 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3721 isl_basic_set_copy(like
));
3725 isl_dim_free(set
->dim
);
3726 set
->dim
= isl_dim_copy(like
->dim
);
3729 isl_basic_set_free(like
);
3732 isl_basic_set_free(like
);
3737 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3741 map
= isl_map_cow(map
);
3744 map
->dim
= isl_dim_cow(map
->dim
);
3748 for (i
= 1; i
< map
->n
; ++i
)
3749 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3751 for (i
= 0; i
< map
->n
; ++i
) {
3752 map
->p
[i
] = (struct isl_basic_map
*)
3753 isl_basic_map_underlying_set(map
->p
[i
]);
3758 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3760 isl_dim_free(map
->dim
);
3761 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3765 return (struct isl_set
*)map
;
3771 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3773 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3776 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3777 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3779 bmap
= isl_basic_map_cow(bmap
);
3783 isl_dim_free(bmap
->dim
);
3786 bmap
= isl_basic_map_finalize(bmap
);
3790 isl_basic_map_free(bmap
);
3795 __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3796 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3798 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3802 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3803 __isl_take isl_dim
*dim
)
3807 map
= isl_map_cow(map
);
3811 for (i
= 0; i
< map
->n
; ++i
) {
3812 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3817 isl_dim_free(map
->dim
);
3827 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3828 __isl_take isl_dim
*dim
)
3830 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3833 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3836 struct isl_basic_set
*domain
;
3842 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3844 n_in
= isl_basic_map_n_in(bmap
);
3845 n_out
= isl_basic_map_n_out(bmap
);
3846 domain
= isl_basic_set_from_basic_map(bmap
);
3847 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3849 domain
= isl_basic_set_reset_dim(domain
, dim
);
3854 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3856 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3859 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3860 __isl_take isl_basic_map
*bmap
)
3864 isl_basic_map
*domain
;
3865 isl_basic_set
*bset
;
3866 int nparam
, n_in
, n_out
;
3869 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3870 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3871 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3873 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3874 domain
= isl_basic_map_universe(dim
);
3876 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3877 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3878 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3880 total
= isl_basic_map_total_dim(bmap
);
3882 for (i
= 0; i
< n_in
; ++i
) {
3883 k
= isl_basic_map_alloc_equality(bmap
);
3886 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3887 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3888 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3891 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3892 return isl_basic_map_finalize(bmap
);
3894 isl_basic_map_free(bmap
);
3898 __isl_give isl_basic_map
*isl_basic_map_range_map(
3899 __isl_take isl_basic_map
*bmap
)
3903 isl_basic_map
*range
;
3904 isl_basic_set
*bset
;
3905 int nparam
, n_in
, n_out
;
3908 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3909 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3910 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3912 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3913 range
= isl_basic_map_universe(dim
);
3915 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3916 bmap
= isl_basic_map_apply_range(bmap
, range
);
3917 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3919 total
= isl_basic_map_total_dim(bmap
);
3921 for (i
= 0; i
< n_out
; ++i
) {
3922 k
= isl_basic_map_alloc_equality(bmap
);
3925 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3926 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3927 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3930 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3931 return isl_basic_map_finalize(bmap
);
3933 isl_basic_map_free(bmap
);
3937 struct isl_set
*isl_map_range(struct isl_map
*map
)
3940 struct isl_set
*set
;
3944 if (isl_map_dim(map
, isl_dim_in
) == 0 &&
3945 !isl_dim_is_named_or_nested(map
->dim
, isl_dim_in
))
3946 return (isl_set
*)map
;
3948 map
= isl_map_cow(map
);
3952 set
= (struct isl_set
*) map
;
3953 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3956 for (i
= 0; i
< map
->n
; ++i
) {
3957 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3961 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3962 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3969 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3972 isl_dim
*domain_dim
;
3974 map
= isl_map_cow(map
);
3978 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3979 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3980 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3983 for (i
= 0; i
< map
->n
; ++i
) {
3984 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3988 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3989 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3996 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4001 map
= isl_map_cow(map
);
4005 range_dim
= isl_dim_range(isl_map_get_dim(map
));
4006 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
4007 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
4010 for (i
= 0; i
< map
->n
; ++i
) {
4011 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4015 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4016 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4023 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
4026 struct isl_map
*map
= NULL
;
4028 set
= isl_set_cow(set
);
4031 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
4032 map
= (struct isl_map
*)set
;
4033 for (i
= 0; i
< set
->n
; ++i
) {
4034 map
->p
[i
] = isl_basic_map_from_basic_set(
4035 set
->p
[i
], isl_dim_copy(dim
));
4039 isl_dim_free(map
->dim
);
4048 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4049 __isl_take isl_basic_set
*bset
)
4051 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4054 __isl_give isl_basic_map
*isl_basic_map_from_range(
4055 __isl_take isl_basic_set
*bset
)
4057 return (isl_basic_map
*)bset
;
4060 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4062 return (struct isl_map
*)set
;
4065 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4067 return isl_map_reverse(isl_map_from_range(set
));
4070 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4071 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4073 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain
),
4074 isl_basic_map_from_range(range
));
4077 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4078 __isl_take isl_set
*range
)
4080 return isl_map_apply_range(isl_map_from_domain(domain
),
4081 isl_map_from_range(range
));
4084 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4087 struct isl_set
*set
= NULL
;
4091 map
= isl_map_cow(map
);
4094 map
->dim
= isl_dim_as_set_dim(map
->dim
);
4097 set
= (struct isl_set
*)map
;
4098 for (i
= 0; i
< map
->n
; ++i
) {
4099 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4109 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
4111 struct isl_map
*map
;
4115 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4116 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4117 sizeof(struct isl_map
) +
4118 (n
- 1) * sizeof(struct isl_basic_map
*));
4122 map
->ctx
= dim
->ctx
;
4123 isl_ctx_ref(map
->ctx
);
4135 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4136 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4139 struct isl_map
*map
;
4140 struct isl_dim
*dims
;
4142 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4146 map
= isl_map_alloc_dim(dims
, n
, flags
);
4150 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4152 struct isl_basic_map
*bmap
;
4153 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4154 bmap
= isl_basic_map_set_to_empty(bmap
);
4158 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4160 struct isl_basic_set
*bset
;
4161 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4162 bset
= isl_basic_set_set_to_empty(bset
);
4166 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4168 struct isl_basic_map
*bmap
;
4171 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4172 bmap
= isl_basic_map_set_to_empty(bmap
);
4176 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4178 struct isl_basic_map
*bmap
;
4181 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4182 bmap
= isl_basic_map_set_to_empty(bmap
);
4186 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4188 struct isl_basic_set
*bset
;
4191 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4192 bset
= isl_basic_set_set_to_empty(bset
);
4196 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4198 struct isl_basic_map
*bmap
;
4199 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4200 bmap
= isl_basic_map_finalize(bmap
);
4204 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4206 struct isl_basic_set
*bset
;
4207 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4208 bset
= isl_basic_set_finalize(bset
);
4212 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_dim
*dim
)
4215 unsigned total
= isl_dim_total(dim
);
4216 isl_basic_map
*bmap
;
4218 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, total
);
4219 for (i
= 0; i
< total
; ++i
) {
4220 int k
= isl_basic_map_alloc_inequality(bmap
);
4223 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4224 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4228 isl_basic_map_free(bmap
);
4232 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_dim
*dim
)
4234 return isl_basic_map_nat_universe(dim
);
4237 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_dim
*dim
)
4239 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4242 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_dim
*dim
)
4244 return isl_map_nat_universe(dim
);
4247 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4248 __isl_keep isl_basic_map
*model
)
4252 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4255 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4259 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4262 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4263 __isl_keep isl_set
*model
)
4267 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4270 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4272 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4275 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4279 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4282 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4286 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4289 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4291 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4294 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4298 return isl_set_empty(isl_dim_copy(model
->dim
));
4301 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4303 struct isl_map
*map
;
4306 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4307 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4311 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4313 struct isl_set
*set
;
4316 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4317 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4321 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4325 return isl_set_universe(isl_dim_copy(model
->dim
));
4328 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4331 struct isl_map
*dup
;
4335 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4336 for (i
= 0; i
< map
->n
; ++i
)
4337 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4341 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4342 __isl_take isl_basic_map
*bmap
)
4346 if (isl_basic_map_plain_is_empty(bmap
)) {
4347 isl_basic_map_free(bmap
);
4350 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4351 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4352 map
->p
[map
->n
] = bmap
;
4354 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4360 isl_basic_map_free(bmap
);
4364 void isl_map_free(struct isl_map
*map
)
4374 isl_ctx_deref(map
->ctx
);
4375 for (i
= 0; i
< map
->n
; ++i
)
4376 isl_basic_map_free(map
->p
[i
]);
4377 isl_dim_free(map
->dim
);
4381 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4382 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4386 base
= isl_map_cow(base
);
4390 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4393 for (i
= 0; i
< base
->n
; ++i
) {
4394 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4395 isl_dim_copy(base
->dim
), 0, 0, 0);
4405 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4406 unsigned nparam
, unsigned dim
)
4408 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4412 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4413 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4417 bmap
= isl_basic_map_cow(bmap
);
4418 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4419 j
= isl_basic_map_alloc_equality(bmap
);
4422 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4423 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4424 isl_int_set_si(bmap
->eq
[j
][0], value
);
4425 bmap
= isl_basic_map_simplify(bmap
);
4426 return isl_basic_map_finalize(bmap
);
4428 isl_basic_map_free(bmap
);
4432 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4433 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4437 bmap
= isl_basic_map_cow(bmap
);
4438 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4439 j
= isl_basic_map_alloc_equality(bmap
);
4442 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4443 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4444 isl_int_set(bmap
->eq
[j
][0], value
);
4445 bmap
= isl_basic_map_simplify(bmap
);
4446 return isl_basic_map_finalize(bmap
);
4448 isl_basic_map_free(bmap
);
4452 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4453 enum isl_dim_type type
, unsigned pos
, int value
)
4457 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4458 return isl_basic_map_fix_pos_si(bmap
,
4459 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4461 isl_basic_map_free(bmap
);
4465 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4466 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4470 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4471 return isl_basic_map_fix_pos(bmap
,
4472 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4474 isl_basic_map_free(bmap
);
4478 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4479 enum isl_dim_type type
, unsigned pos
, int value
)
4481 return (struct isl_basic_set
*)
4482 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4486 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4487 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4489 return (struct isl_basic_set
*)
4490 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4494 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4495 unsigned input
, int value
)
4497 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4500 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4501 unsigned dim
, int value
)
4503 return (struct isl_basic_set
*)
4504 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4505 isl_dim_set
, dim
, value
);
4508 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4509 enum isl_dim_type type
, unsigned pos
, int value
)
4513 map
= isl_map_cow(map
);
4517 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4518 for (i
= 0; i
< map
->n
; ++i
) {
4519 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4523 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4530 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4531 enum isl_dim_type type
, unsigned pos
, int value
)
4533 return (struct isl_set
*)
4534 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4537 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4538 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4542 map
= isl_map_cow(map
);
4546 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4547 for (i
= 0; i
< map
->n
; ++i
) {
4548 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4552 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4559 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4560 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4562 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4565 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4566 unsigned input
, int value
)
4568 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4571 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4573 return (struct isl_set
*)
4574 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4577 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4578 __isl_take isl_basic_map
*bmap
,
4579 enum isl_dim_type type
, unsigned pos
, int value
)
4585 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4586 pos
+= isl_basic_map_offset(bmap
, type
);
4587 bmap
= isl_basic_map_cow(bmap
);
4588 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4589 j
= isl_basic_map_alloc_inequality(bmap
);
4592 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4593 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4594 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4595 bmap
= isl_basic_map_simplify(bmap
);
4596 return isl_basic_map_finalize(bmap
);
4598 isl_basic_map_free(bmap
);
4602 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4603 unsigned dim
, isl_int value
)
4607 bset
= isl_basic_set_cow(bset
);
4608 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4609 j
= isl_basic_set_alloc_inequality(bset
);
4612 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4613 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4614 isl_int_neg(bset
->ineq
[j
][0], value
);
4615 bset
= isl_basic_set_simplify(bset
);
4616 return isl_basic_set_finalize(bset
);
4618 isl_basic_set_free(bset
);
4622 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4623 enum isl_dim_type type
, unsigned pos
, int value
)
4627 map
= isl_map_cow(map
);
4631 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4632 for (i
= 0; i
< map
->n
; ++i
) {
4633 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4638 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4645 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4646 enum isl_dim_type type
, unsigned pos
, int value
)
4648 return (struct isl_set
*)
4649 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4652 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4657 set
= isl_set_cow(set
);
4661 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4662 for (i
= 0; i
< set
->n
; ++i
) {
4663 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4673 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4677 map
= isl_map_cow(map
);
4681 map
->dim
= isl_dim_reverse(map
->dim
);
4684 for (i
= 0; i
< map
->n
; ++i
) {
4685 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4689 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4696 static struct isl_map
*isl_basic_map_partial_lexopt(
4697 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4698 struct isl_set
**empty
, int max
)
4702 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4703 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4705 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4707 isl_basic_map_free(bmap
);
4708 isl_basic_set_free(dom
);
4714 struct isl_map
*isl_basic_map_partial_lexmax(
4715 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4716 struct isl_set
**empty
)
4718 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4721 struct isl_map
*isl_basic_map_partial_lexmin(
4722 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4723 struct isl_set
**empty
)
4725 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4728 struct isl_set
*isl_basic_set_partial_lexmin(
4729 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4730 struct isl_set
**empty
)
4732 return (struct isl_set
*)
4733 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4737 struct isl_set
*isl_basic_set_partial_lexmax(
4738 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4739 struct isl_set
**empty
)
4741 return (struct isl_set
*)
4742 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4746 /* Given a basic map "bmap", compute the lexicographically minimal
4747 * (or maximal) image element for each domain element in dom.
4748 * Set *empty to those elements in dom that do not have an image element.
4750 * We first make sure the basic sets in dom are disjoint and then
4751 * simply collect the results over each of the basic sets separately.
4752 * We could probably improve the efficiency a bit by moving the union
4753 * domain down into the parametric integer programming.
4755 static __isl_give isl_map
*basic_map_partial_lexopt(
4756 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4757 __isl_give isl_set
**empty
, int max
)
4760 struct isl_map
*res
;
4762 dom
= isl_set_make_disjoint(dom
);
4766 if (isl_set_plain_is_empty(dom
)) {
4767 res
= isl_map_empty_like_basic_map(bmap
);
4768 *empty
= isl_set_empty_like(dom
);
4770 isl_basic_map_free(bmap
);
4774 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4775 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4777 for (i
= 1; i
< dom
->n
; ++i
) {
4778 struct isl_map
*res_i
;
4779 struct isl_set
*empty_i
;
4781 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4782 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4784 res
= isl_map_union_disjoint(res
, res_i
);
4785 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4789 isl_basic_map_free(bmap
);
4794 isl_basic_map_free(bmap
);
4798 /* Given a map "map", compute the lexicographically minimal
4799 * (or maximal) image element for each domain element in dom.
4800 * Set *empty to those elements in dom that do not have an image element.
4802 * We first compute the lexicographically minimal or maximal element
4803 * in the first basic map. This results in a partial solution "res"
4804 * and a subset "todo" of dom that still need to be handled.
4805 * We then consider each of the remaining maps in "map" and successively
4806 * improve both "res" and "todo".
4808 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4809 * Assume we are computing the lexicographical maximum.
4810 * We first compute the lexicographically maximal element in basic map i.
4811 * This results in a partial solution res_i and a subset todo_i.
4812 * Then we combine these results with those obtain for the first k basic maps
4813 * to obtain a result that is valid for the first k+1 basic maps.
4814 * In particular, the set where there is no solution is the set where
4815 * there is no solution for the first k basic maps and also no solution
4816 * for the ith basic map, i.e.,
4818 * todo^i = todo^k * todo_i
4820 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4821 * solutions, arbitrarily breaking ties in favor of res^k.
4822 * That is, when res^k(a) >= res_i(a), we pick res^k and
4823 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4824 * the lexicographic order.)
4825 * In practice, we compute
4827 * res^k * (res_i . "<=")
4831 * res_i * (res^k . "<")
4833 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4834 * where only one of res^k and res_i provides a solution and we simply pick
4841 * Note that we only compute these intersections when dom(res^k) intersects
4842 * dom(res_i). Otherwise, the only effect of these intersections is to
4843 * potentially break up res^k and res_i into smaller pieces.
4844 * We want to avoid such splintering as much as possible.
4845 * In fact, an earlier implementation of this function would look for
4846 * better results in the domain of res^k and for extra results in todo^k,
4847 * but this would always result in a splintering according to todo^k,
4848 * even when the domain of basic map i is disjoint from the domains of
4849 * the previous basic maps.
4851 static __isl_give isl_map
*isl_map_partial_lexopt(
4852 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4853 __isl_give isl_set
**empty
, int max
)
4856 struct isl_map
*res
;
4857 struct isl_set
*todo
;
4862 if (isl_map_plain_is_empty(map
)) {
4870 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4871 isl_set_copy(dom
), &todo
, max
);
4873 for (i
= 1; i
< map
->n
; ++i
) {
4877 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
4879 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4880 isl_set_copy(dom
), &todo_i
, max
);
4883 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
4884 le
= isl_map_lex_le(dim
);
4886 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
4887 le
= isl_map_lex_ge(dim
);
4889 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4890 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
4891 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
4892 le
= isl_map_intersect(le
, isl_map_copy(res
));
4894 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
4895 res
= isl_map_intersect_domain(res
,
4896 isl_set_copy(todo_i
));
4897 res_i
= isl_map_intersect_domain(res_i
,
4898 isl_set_copy(todo
));
4901 res
= isl_map_union_disjoint(res
, res_i
);
4902 res
= isl_map_union_disjoint(res
, lt
);
4903 res
= isl_map_union_disjoint(res
, le
);
4905 todo
= isl_set_intersect(todo
, todo_i
);
4925 __isl_give isl_map
*isl_map_partial_lexmax(
4926 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4927 __isl_give isl_set
**empty
)
4929 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4932 __isl_give isl_map
*isl_map_partial_lexmin(
4933 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4934 __isl_give isl_set
**empty
)
4936 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4939 __isl_give isl_set
*isl_set_partial_lexmin(
4940 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4941 __isl_give isl_set
**empty
)
4943 return (struct isl_set
*)
4944 isl_map_partial_lexmin((struct isl_map
*)set
,
4948 __isl_give isl_set
*isl_set_partial_lexmax(
4949 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4950 __isl_give isl_set
**empty
)
4952 return (struct isl_set
*)
4953 isl_map_partial_lexmax((struct isl_map
*)set
,
4957 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4959 struct isl_basic_set
*dom
= NULL
;
4960 struct isl_dim
*dom_dim
;
4964 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4965 dom
= isl_basic_set_universe(dom_dim
);
4966 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4968 isl_basic_map_free(bmap
);
4972 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4974 return isl_basic_map_lexopt(bmap
, 0);
4977 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4979 return isl_basic_map_lexopt(bmap
, 1);
4982 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4984 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4987 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4989 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4992 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4994 struct isl_set
*dom
= NULL
;
4995 struct isl_dim
*dom_dim
;
4999 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
5000 dom
= isl_set_universe(dom_dim
);
5001 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
5007 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
5009 return isl_map_lexopt(map
, 0);
5012 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
5014 return isl_map_lexopt(map
, 1);
5017 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5019 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5022 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5024 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5027 /* Apply a preimage specified by "mat" on the parameters of "bset".
5028 * bset is assumed to have only parameters and divs.
5030 static struct isl_basic_set
*basic_set_parameter_preimage(
5031 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
5038 bset
->dim
= isl_dim_cow(bset
->dim
);
5042 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5044 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5046 bset
->dim
->nparam
= 0;
5047 bset
->dim
->n_out
= nparam
;
5048 bset
= isl_basic_set_preimage(bset
, mat
);
5050 bset
->dim
->nparam
= bset
->dim
->n_out
;
5051 bset
->dim
->n_out
= 0;
5056 isl_basic_set_free(bset
);
5060 /* Apply a preimage specified by "mat" on the parameters of "set".
5061 * set is assumed to have only parameters and divs.
5063 static struct isl_set
*set_parameter_preimage(
5064 struct isl_set
*set
, struct isl_mat
*mat
)
5066 struct isl_dim
*dim
= NULL
;
5072 dim
= isl_dim_copy(set
->dim
);
5073 dim
= isl_dim_cow(dim
);
5077 nparam
= isl_set_dim(set
, isl_dim_param
);
5079 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5082 dim
->n_out
= nparam
;
5083 isl_set_reset_dim(set
, dim
);
5084 set
= isl_set_preimage(set
, mat
);
5087 dim
= isl_dim_copy(set
->dim
);
5088 dim
= isl_dim_cow(dim
);
5091 dim
->nparam
= dim
->n_out
;
5093 isl_set_reset_dim(set
, dim
);
5103 /* Intersect the basic set "bset" with the affine space specified by the
5104 * equalities in "eq".
5106 static struct isl_basic_set
*basic_set_append_equalities(
5107 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5115 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
5120 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
5121 for (i
= 0; i
< eq
->n_row
; ++i
) {
5122 k
= isl_basic_set_alloc_equality(bset
);
5125 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5126 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5130 bset
= isl_basic_set_gauss(bset
, NULL
);
5131 bset
= isl_basic_set_finalize(bset
);
5136 isl_basic_set_free(bset
);
5140 /* Intersect the set "set" with the affine space specified by the
5141 * equalities in "eq".
5143 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5151 for (i
= 0; i
< set
->n
; ++i
) {
5152 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5165 /* Project the given basic set onto its parameter domain, possibly introducing
5166 * new, explicit, existential variables in the constraints.
5167 * The input has parameters and (possibly implicit) existential variables.
5168 * The output has the same parameters, but only
5169 * explicit existentially quantified variables.
5171 * The actual projection is performed by pip, but pip doesn't seem
5172 * to like equalities very much, so we first remove the equalities
5173 * among the parameters by performing a variable compression on
5174 * the parameters. Afterward, an inverse transformation is performed
5175 * and the equalities among the parameters are inserted back in.
5177 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5181 struct isl_mat
*T
, *T2
;
5182 struct isl_set
*set
;
5183 unsigned nparam
, n_div
;
5185 bset
= isl_basic_set_cow(bset
);
5189 if (bset
->n_eq
== 0)
5190 return isl_basic_set_lexmin(bset
);
5192 isl_basic_set_gauss(bset
, NULL
);
5194 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5195 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5197 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5198 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5201 if (i
== bset
->n_eq
)
5202 return isl_basic_set_lexmin(bset
);
5204 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5206 eq
= isl_mat_cow(eq
);
5207 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5208 if (T
&& T
->n_col
== 0) {
5212 bset
= isl_basic_set_set_to_empty(bset
);
5213 return isl_set_from_basic_set(bset
);
5215 bset
= basic_set_parameter_preimage(bset
, T
);
5217 set
= isl_basic_set_lexmin(bset
);
5218 set
= set_parameter_preimage(set
, T2
);
5219 set
= set_append_equalities(set
, eq
);
5223 /* Compute an explicit representation for all the existentially
5224 * quantified variables.
5225 * The input and output dimensions are first turned into parameters.
5226 * compute_divs then returns a map with the same parameters and
5227 * no input or output dimensions and the dimension specification
5228 * is reset to that of the input.
5230 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5232 struct isl_basic_set
*bset
;
5233 struct isl_set
*set
;
5234 struct isl_map
*map
;
5235 struct isl_dim
*dim
, *orig_dim
= NULL
;
5240 bmap
= isl_basic_map_cow(bmap
);
5244 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5245 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5246 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5247 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5251 orig_dim
= bmap
->dim
;
5253 bset
= (struct isl_basic_set
*)bmap
;
5255 set
= parameter_compute_divs(bset
);
5256 map
= (struct isl_map
*)set
;
5257 map
= isl_map_reset_dim(map
, orig_dim
);
5261 isl_basic_map_free(bmap
);
5265 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5273 off
= isl_dim_total(bmap
->dim
);
5274 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5275 if (isl_int_is_zero(bmap
->div
[i
][0]))
5277 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5283 static int map_divs_known(__isl_keep isl_map
*map
)
5290 for (i
= 0; i
< map
->n
; ++i
) {
5291 int known
= basic_map_divs_known(map
->p
[i
]);
5299 /* If bmap contains any unknown divs, then compute explicit
5300 * expressions for them. However, this computation may be
5301 * quite expensive, so first try to remove divs that aren't
5304 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5308 struct isl_map
*map
;
5310 known
= basic_map_divs_known(bmap
);
5314 return isl_map_from_basic_map(bmap
);
5316 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5318 known
= basic_map_divs_known(bmap
);
5322 return isl_map_from_basic_map(bmap
);
5324 map
= compute_divs(bmap
);
5327 isl_basic_map_free(bmap
);
5331 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5335 struct isl_map
*res
;
5342 known
= map_divs_known(map
);
5350 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5351 for (i
= 1 ; i
< map
->n
; ++i
) {
5353 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5354 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5355 res
= isl_map_union_disjoint(res
, r2
);
5357 res
= isl_map_union(res
, r2
);
5364 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5366 return (struct isl_set
*)
5367 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5370 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5372 return (struct isl_set
*)
5373 isl_map_compute_divs((struct isl_map
*)set
);
5376 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5379 struct isl_set
*set
;
5384 map
= isl_map_cow(map
);
5388 set
= (struct isl_set
*)map
;
5389 set
->dim
= isl_dim_domain(set
->dim
);
5392 for (i
= 0; i
< map
->n
; ++i
) {
5393 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5397 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5398 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5405 struct isl_map
*isl_map_union_disjoint(
5406 struct isl_map
*map1
, struct isl_map
*map2
)
5410 struct isl_map
*map
= NULL
;
5424 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5426 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5427 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5428 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5430 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5431 map1
->n
+ map2
->n
, flags
);
5434 for (i
= 0; i
< map1
->n
; ++i
) {
5435 map
= isl_map_add_basic_map(map
,
5436 isl_basic_map_copy(map1
->p
[i
]));
5440 for (i
= 0; i
< map2
->n
; ++i
) {
5441 map
= isl_map_add_basic_map(map
,
5442 isl_basic_map_copy(map2
->p
[i
]));
5456 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5458 map1
= isl_map_union_disjoint(map1
, map2
);
5462 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5466 struct isl_set
*isl_set_union_disjoint(
5467 struct isl_set
*set1
, struct isl_set
*set2
)
5469 return (struct isl_set
*)
5470 isl_map_union_disjoint(
5471 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5474 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5476 return (struct isl_set
*)
5477 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5480 struct isl_map
*isl_map_intersect_range(
5481 struct isl_map
*map
, struct isl_set
*set
)
5484 struct isl_map
*result
;
5490 if (!isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
5491 isl_die(set
->ctx
, isl_error_invalid
,
5492 "parameters don't match", goto error
);
5494 if (isl_dim_size(set
->dim
, isl_dim_set
) != 0 &&
5495 !isl_map_compatible_range(map
, set
))
5496 isl_die(set
->ctx
, isl_error_invalid
,
5497 "incompatible spaces", goto error
);
5499 if (isl_set_plain_is_universe(set
)) {
5504 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5505 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5506 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5508 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5509 map
->n
* set
->n
, flags
);
5512 for (i
= 0; i
< map
->n
; ++i
)
5513 for (j
= 0; j
< set
->n
; ++j
) {
5514 result
= isl_map_add_basic_map(result
,
5515 isl_basic_map_intersect_range(
5516 isl_basic_map_copy(map
->p
[i
]),
5517 isl_basic_set_copy(set
->p
[j
])));
5530 struct isl_map
*isl_map_intersect_domain(
5531 struct isl_map
*map
, struct isl_set
*set
)
5533 return isl_map_reverse(
5534 isl_map_intersect_range(isl_map_reverse(map
), set
));
5537 struct isl_map
*isl_map_apply_domain(
5538 struct isl_map
*map1
, struct isl_map
*map2
)
5542 map1
= isl_map_reverse(map1
);
5543 map1
= isl_map_apply_range(map1
, map2
);
5544 return isl_map_reverse(map1
);
5551 struct isl_map
*isl_map_apply_range(
5552 struct isl_map
*map1
, struct isl_map
*map2
)
5554 struct isl_dim
*dim_result
;
5555 struct isl_map
*result
;
5561 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5562 isl_dim_copy(map2
->dim
));
5564 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5567 for (i
= 0; i
< map1
->n
; ++i
)
5568 for (j
= 0; j
< map2
->n
; ++j
) {
5569 result
= isl_map_add_basic_map(result
,
5570 isl_basic_map_apply_range(
5571 isl_basic_map_copy(map1
->p
[i
]),
5572 isl_basic_map_copy(map2
->p
[j
])));
5578 if (result
&& result
->n
<= 1)
5579 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5588 * returns range - domain
5590 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5592 isl_dim
*dims
, *target_dim
;
5593 struct isl_basic_set
*bset
;
5600 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5601 bmap
->dim
, isl_dim_out
),
5603 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5604 dim
= isl_basic_map_n_in(bmap
);
5605 nparam
= isl_basic_map_n_param(bmap
);
5606 bset
= isl_basic_set_from_basic_map(bmap
);
5607 bset
= isl_basic_set_cow(bset
);
5608 dims
= isl_basic_set_get_dim(bset
);
5609 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5610 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5611 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5612 for (i
= 0; i
< dim
; ++i
) {
5613 int j
= isl_basic_map_alloc_equality(
5614 (struct isl_basic_map
*)bset
);
5617 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5618 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5619 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5620 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5622 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5623 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5626 isl_basic_map_free(bmap
);
5631 * returns range - domain
5633 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5637 struct isl_set
*result
;
5642 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5643 map
->dim
, isl_dim_out
),
5645 dim
= isl_map_get_dim(map
);
5646 dim
= isl_dim_domain(dim
);
5647 result
= isl_set_alloc_dim(dim
, map
->n
, 0);
5650 for (i
= 0; i
< map
->n
; ++i
)
5651 result
= isl_set_add_basic_set(result
,
5652 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5661 * returns [domain -> range] -> range - domain
5663 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
5664 __isl_take isl_basic_map
*bmap
)
5668 isl_basic_map
*domain
;
5669 isl_basic_set
*bset
;
5673 if (!isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
5674 isl_die(bmap
->ctx
, isl_error_invalid
,
5675 "domain and range don't match", goto error
);
5677 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5678 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
5680 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
5681 domain
= isl_basic_map_universe(dim
);
5683 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5684 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5685 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
5687 total
= isl_basic_map_total_dim(bmap
);
5689 for (i
= 0; i
< n
; ++i
) {
5690 k
= isl_basic_map_alloc_equality(bmap
);
5693 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5694 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
5695 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
5696 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
5699 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5700 return isl_basic_map_finalize(bmap
);
5702 isl_basic_map_free(bmap
);
5707 * returns [domain -> range] -> range - domain
5709 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
5712 isl_dim
*domain_dim
;
5717 if (!isl_dim_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
5718 isl_die(map
->ctx
, isl_error_invalid
,
5719 "domain and range don't match", goto error
);
5721 map
= isl_map_cow(map
);
5725 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
5726 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
5727 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
5730 for (i
= 0; i
< map
->n
; ++i
) {
5731 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
5735 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5742 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5744 struct isl_basic_map
*bmap
;
5752 nparam
= dims
->nparam
;
5754 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5758 for (i
= 0; i
< dim
; ++i
) {
5759 int j
= isl_basic_map_alloc_equality(bmap
);
5762 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5763 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5764 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5766 return isl_basic_map_finalize(bmap
);
5768 isl_basic_map_free(bmap
);
5772 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_dim
*dim
)
5776 if (dim
->n_in
!= dim
->n_out
)
5777 isl_die(dim
->ctx
, isl_error_invalid
,
5778 "number of input and output dimensions needs to be "
5779 "the same", goto error
);
5780 return basic_map_identity(dim
);
5786 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5788 if (!model
|| !model
->dim
)
5790 return isl_basic_map_identity(isl_dim_copy(model
->dim
));
5793 __isl_give isl_map
*isl_map_identity(__isl_take isl_dim
*dim
)
5795 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
5798 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5800 if (!model
|| !model
->dim
)
5802 return isl_map_identity(isl_dim_copy(model
->dim
));
5805 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5807 if (!model
|| !model
->dim
)
5809 return isl_map_identity(isl_dim_copy(model
->dim
));
5812 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5814 isl_dim
*dim
= isl_set_get_dim(set
);
5816 id
= isl_map_identity(isl_dim_map_from_set(dim
));
5817 return isl_map_intersect_range(id
, set
);
5820 /* Construct a basic set with all set dimensions having only non-negative
5823 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5828 struct isl_basic_set
*bset
;
5832 nparam
= dims
->nparam
;
5834 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5837 for (i
= 0; i
< dim
; ++i
) {
5838 int k
= isl_basic_set_alloc_inequality(bset
);
5841 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5842 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5846 isl_basic_set_free(bset
);
5850 /* Construct the half-space x_pos >= 0.
5852 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
5856 isl_basic_set
*nonneg
;
5858 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5859 k
= isl_basic_set_alloc_inequality(nonneg
);
5862 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5863 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
5865 return isl_basic_set_finalize(nonneg
);
5867 isl_basic_set_free(nonneg
);
5871 /* Construct the half-space x_pos <= -1.
5873 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
5878 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5879 k
= isl_basic_set_alloc_inequality(neg
);
5882 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5883 isl_int_set_si(neg
->ineq
[k
][0], -1);
5884 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
5886 return isl_basic_set_finalize(neg
);
5888 isl_basic_set_free(neg
);
5892 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5893 enum isl_dim_type type
, unsigned first
, unsigned n
)
5896 isl_basic_set
*nonneg
;
5904 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5906 for (i
= 0; i
< n
; ++i
) {
5907 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
5908 pos(set
->dim
, type
) + first
+ i
);
5909 neg
= neg_halfspace(isl_set_get_dim(set
),
5910 pos(set
->dim
, type
) + first
+ i
);
5912 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5921 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
5922 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5929 if (isl_set_plain_is_empty(set
)) {
5934 return fn(set
, signs
, user
);
5937 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
5939 half
= isl_set_intersect(half
, isl_set_copy(set
));
5940 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
5944 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
5946 half
= isl_set_intersect(half
, set
);
5947 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
5953 /* Call "fn" on the intersections of "set" with each of the orthants
5954 * (except for obviously empty intersections). The orthant is identified
5955 * by the signs array, with each entry having value 1 or -1 according
5956 * to the sign of the corresponding variable.
5958 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
5959 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5969 if (isl_set_plain_is_empty(set
))
5972 nparam
= isl_set_dim(set
, isl_dim_param
);
5973 nvar
= isl_set_dim(set
, isl_dim_set
);
5975 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
5977 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
5985 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5987 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5990 int isl_basic_map_is_subset(
5991 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5994 struct isl_map
*map1
;
5995 struct isl_map
*map2
;
5997 if (!bmap1
|| !bmap2
)
6000 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
6001 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
6003 is_subset
= isl_map_is_subset(map1
, map2
);
6011 int isl_basic_map_is_equal(
6012 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6016 if (!bmap1
|| !bmap2
)
6018 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6021 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6025 int isl_basic_set_is_equal(
6026 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6028 return isl_basic_map_is_equal(
6029 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
6032 int isl_map_is_empty(struct isl_map
*map
)
6039 for (i
= 0; i
< map
->n
; ++i
) {
6040 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
6049 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
6051 return map
? map
->n
== 0 : -1;
6054 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
6056 return isl_map_plain_is_empty(map
);
6059 int isl_set_plain_is_empty(struct isl_set
*set
)
6061 return set
? set
->n
== 0 : -1;
6064 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
6066 return isl_set_plain_is_empty(set
);
6069 int isl_set_is_empty(struct isl_set
*set
)
6071 return isl_map_is_empty((struct isl_map
*)set
);
6074 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6079 return isl_dim_equal(map1
->dim
, map2
->dim
);
6082 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6087 return isl_dim_equal(set1
->dim
, set2
->dim
);
6090 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6096 is_subset
= isl_map_is_subset(map1
, map2
);
6099 is_subset
= isl_map_is_subset(map2
, map1
);
6103 int isl_basic_map_is_strict_subset(
6104 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6108 if (!bmap1
|| !bmap2
)
6110 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6113 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6114 if (is_subset
== -1)
6119 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
6125 is_subset
= isl_map_is_subset(map1
, map2
);
6128 is_subset
= isl_map_is_subset(map2
, map1
);
6129 if (is_subset
== -1)
6134 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6136 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
6139 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6143 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6146 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6150 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6153 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
6160 for (i
= 0; i
< map
->n
; ++i
) {
6161 int r
= isl_basic_map_is_universe(map
->p
[i
]);
6169 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
6171 return isl_map_plain_is_universe((isl_map
*) set
);
6174 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6176 return isl_set_plain_is_universe(set
);
6179 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6181 struct isl_basic_set
*bset
= NULL
;
6182 struct isl_vec
*sample
= NULL
;
6189 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6192 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6193 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6194 copy
= isl_basic_map_remove_redundancies(copy
);
6195 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6196 isl_basic_map_free(copy
);
6200 total
= 1 + isl_basic_map_total_dim(bmap
);
6201 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6202 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6208 isl_vec_free(bmap
->sample
);
6209 bmap
->sample
= NULL
;
6210 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6213 sample
= isl_basic_set_sample_vec(bset
);
6216 empty
= sample
->size
== 0;
6217 isl_vec_free(bmap
->sample
);
6218 bmap
->sample
= sample
;
6220 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6225 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
6229 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6232 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
6234 return isl_basic_map_plain_is_empty(bmap
);
6237 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
6241 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6244 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
6246 return isl_basic_set_plain_is_empty(bset
);
6249 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6251 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6254 struct isl_map
*isl_basic_map_union(
6255 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6257 struct isl_map
*map
;
6258 if (!bmap1
|| !bmap2
)
6261 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6263 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6266 map
= isl_map_add_basic_map(map
, bmap1
);
6267 map
= isl_map_add_basic_map(map
, bmap2
);
6270 isl_basic_map_free(bmap1
);
6271 isl_basic_map_free(bmap2
);
6275 struct isl_set
*isl_basic_set_union(
6276 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6278 return (struct isl_set
*)isl_basic_map_union(
6279 (struct isl_basic_map
*)bset1
,
6280 (struct isl_basic_map
*)bset2
);
6283 /* Order divs such that any div only depends on previous divs */
6284 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6292 off
= isl_dim_total(bmap
->dim
);
6294 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6296 if (isl_int_is_zero(bmap
->div
[i
][0]))
6298 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6302 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6308 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6310 return (struct isl_basic_set
*)
6311 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6314 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6321 for (i
= 0; i
< map
->n
; ++i
) {
6322 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6333 /* Look for a div in dst that corresponds to the div "div" in src.
6334 * The divs before "div" in src and dst are assumed to be the same.
6336 * Returns -1 if no corresponding div was found and the position
6337 * of the corresponding div in dst otherwise.
6339 static int find_div(struct isl_basic_map
*dst
,
6340 struct isl_basic_map
*src
, unsigned div
)
6344 unsigned total
= isl_dim_total(src
->dim
);
6346 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6347 for (i
= div
; i
< dst
->n_div
; ++i
)
6348 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6349 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6350 dst
->n_div
- div
) == -1)
6355 struct isl_basic_map
*isl_basic_map_align_divs(
6356 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6359 unsigned total
= isl_dim_total(src
->dim
);
6364 if (src
->n_div
== 0)
6367 for (i
= 0; i
< src
->n_div
; ++i
)
6368 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6370 src
= isl_basic_map_order_divs(src
);
6371 dst
= isl_basic_map_cow(dst
);
6372 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6373 src
->n_div
, 0, 2 * src
->n_div
);
6376 for (i
= 0; i
< src
->n_div
; ++i
) {
6377 int j
= find_div(dst
, src
, i
);
6379 j
= isl_basic_map_alloc_div(dst
);
6382 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6383 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6384 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6388 isl_basic_map_swap_div(dst
, i
, j
);
6392 isl_basic_map_free(dst
);
6396 struct isl_basic_set
*isl_basic_set_align_divs(
6397 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6399 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6400 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6403 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6411 map
= isl_map_compute_divs(map
);
6412 map
= isl_map_cow(map
);
6416 for (i
= 1; i
< map
->n
; ++i
)
6417 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6418 for (i
= 1; i
< map
->n
; ++i
)
6419 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6421 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6425 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6427 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6430 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6434 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6435 map
= isl_map_intersect_domain(map
, set
);
6436 set
= isl_map_range(map
);
6444 /* There is no need to cow as removing empty parts doesn't change
6445 * the meaning of the set.
6447 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6454 for (i
= map
->n
-1; i
>= 0; --i
) {
6455 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6457 isl_basic_map_free(map
->p
[i
]);
6458 if (i
!= map
->n
-1) {
6459 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6460 map
->p
[i
] = map
->p
[map
->n
-1];
6468 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6470 return (struct isl_set
*)
6471 isl_map_remove_empty_parts((struct isl_map
*)set
);
6474 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6476 struct isl_basic_map
*bmap
;
6477 if (!map
|| map
->n
== 0)
6479 bmap
= map
->p
[map
->n
-1];
6480 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6481 return isl_basic_map_copy(bmap
);
6484 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6486 return (struct isl_basic_set
*)
6487 isl_map_copy_basic_map((struct isl_map
*)set
);
6490 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6491 __isl_keep isl_basic_map
*bmap
)
6497 for (i
= map
->n
-1; i
>= 0; --i
) {
6498 if (map
->p
[i
] != bmap
)
6500 map
= isl_map_cow(map
);
6503 isl_basic_map_free(map
->p
[i
]);
6504 if (i
!= map
->n
-1) {
6505 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6506 map
->p
[i
] = map
->p
[map
->n
-1];
6517 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6518 struct isl_basic_set
*bset
)
6520 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6521 (struct isl_basic_map
*)bset
);
6524 /* Given two basic sets bset1 and bset2, compute the maximal difference
6525 * between the values of dimension pos in bset1 and those in bset2
6526 * for any common value of the parameters and dimensions preceding pos.
6528 static enum isl_lp_result
basic_set_maximal_difference_at(
6529 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6530 int pos
, isl_int
*opt
)
6532 struct isl_dim
*dims
;
6533 struct isl_basic_map
*bmap1
= NULL
;
6534 struct isl_basic_map
*bmap2
= NULL
;
6535 struct isl_ctx
*ctx
;
6536 struct isl_vec
*obj
;
6539 unsigned dim1
, dim2
;
6540 enum isl_lp_result res
;
6542 if (!bset1
|| !bset2
)
6543 return isl_lp_error
;
6545 nparam
= isl_basic_set_n_param(bset1
);
6546 dim1
= isl_basic_set_n_dim(bset1
);
6547 dim2
= isl_basic_set_n_dim(bset2
);
6548 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6549 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6550 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6551 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6552 if (!bmap1
|| !bmap2
)
6554 bmap1
= isl_basic_map_cow(bmap1
);
6555 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6556 pos
, (dim1
- pos
) + (dim2
- pos
),
6557 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6558 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6561 total
= isl_basic_map_total_dim(bmap1
);
6563 obj
= isl_vec_alloc(ctx
, 1 + total
);
6564 isl_seq_clr(obj
->block
.data
, 1 + total
);
6565 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6566 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6569 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6571 isl_basic_map_free(bmap1
);
6575 isl_basic_map_free(bmap1
);
6576 isl_basic_map_free(bmap2
);
6577 return isl_lp_error
;
6580 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6581 * for any common value of the parameters and dimensions preceding pos
6582 * in both basic sets, the values of dimension pos in bset1 are
6583 * smaller or larger than those in bset2.
6586 * 1 if bset1 follows bset2
6587 * -1 if bset1 precedes bset2
6588 * 0 if bset1 and bset2 are incomparable
6589 * -2 if some error occurred.
6591 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6592 struct isl_basic_set
*bset2
, int pos
)
6595 enum isl_lp_result res
;
6600 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6602 if (res
== isl_lp_empty
)
6604 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6605 res
== isl_lp_unbounded
)
6607 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6616 /* Given two basic sets bset1 and bset2, check whether
6617 * for any common value of the parameters and dimensions preceding pos
6618 * there is a value of dimension pos in bset1 that is larger
6619 * than a value of the same dimension in bset2.
6622 * 1 if there exists such a pair
6623 * 0 if there is no such pair, but there is a pair of equal values
6625 * -2 if some error occurred.
6627 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6628 __isl_keep isl_basic_set
*bset2
, int pos
)
6631 enum isl_lp_result res
;
6636 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6638 if (res
== isl_lp_empty
)
6640 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6641 res
== isl_lp_unbounded
)
6643 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6645 else if (res
== isl_lp_ok
)
6654 /* Given two sets set1 and set2, check whether
6655 * for any common value of the parameters and dimensions preceding pos
6656 * there is a value of dimension pos in set1 that is larger
6657 * than a value of the same dimension in set2.
6660 * 1 if there exists such a pair
6661 * 0 if there is no such pair, but there is a pair of equal values
6663 * -2 if some error occurred.
6665 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6666 __isl_keep isl_set
*set2
, int pos
)
6674 for (i
= 0; i
< set1
->n
; ++i
)
6675 for (j
= 0; j
< set2
->n
; ++j
) {
6677 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6678 if (f
== 1 || f
== -2)
6687 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
6688 unsigned pos
, isl_int
*val
)
6696 total
= isl_basic_map_total_dim(bmap
);
6697 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6698 for (; d
+1 > pos
; --d
)
6699 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6703 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6705 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6707 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6710 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6716 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
6717 unsigned pos
, isl_int
*val
)
6729 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
6732 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
6733 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6734 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6735 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6739 isl_int_set(*val
, v
);
6745 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
6746 unsigned pos
, isl_int
*val
)
6748 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
6752 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
6755 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6758 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
6759 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6761 if (pos
>= isl_basic_map_dim(bmap
, type
))
6763 return isl_basic_map_plain_has_fixed_var(bmap
,
6764 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6767 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
6768 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6770 if (pos
>= isl_map_dim(map
, type
))
6772 return isl_map_plain_has_fixed_var(map
,
6773 map_offset(map
, type
) - 1 + pos
, val
);
6776 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
6777 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6779 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
6782 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6783 * then return this fixed value in *val.
6785 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
6786 unsigned dim
, isl_int
*val
)
6788 return isl_basic_set_plain_has_fixed_var(bset
,
6789 isl_basic_set_n_param(bset
) + dim
, val
);
6792 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6793 * then return this fixed value in *val.
6795 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
6796 unsigned dim
, isl_int
*val
)
6798 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6801 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
6802 unsigned dim
, isl_int
*val
)
6804 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
6807 /* Check if input variable in has fixed value and if so and if val is not NULL,
6808 * then return this fixed value in *val.
6810 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
6811 unsigned in
, isl_int
*val
)
6813 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6816 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6817 * and if val is not NULL, then return this lower bound in *val.
6819 int isl_basic_set_plain_dim_has_fixed_lower_bound(
6820 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
6822 int i
, i_eq
= -1, i_ineq
= -1;
6829 total
= isl_basic_set_total_dim(bset
);
6830 nparam
= isl_basic_set_n_param(bset
);
6831 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6832 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6838 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6839 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6841 if (i_eq
!= -1 || i_ineq
!= -1)
6845 if (i_eq
== -1 && i_ineq
== -1)
6847 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6848 /* The coefficient should always be one due to normalization. */
6849 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6851 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6853 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6854 total
- nparam
- dim
- 1) != -1)
6857 isl_int_neg(*val
, c
[0]);
6861 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
6862 unsigned dim
, isl_int
*val
)
6874 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
6878 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
6880 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6881 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
6883 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6887 isl_int_set(*val
, v
);
6898 /* uset_gist depends on constraints without existentially quantified
6899 * variables sorting first.
6901 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6903 const struct constraint
*c1
= (const struct constraint
*)p1
;
6904 const struct constraint
*c2
= (const struct constraint
*)p2
;
6906 unsigned size
= isl_min(c1
->size
, c2
->size
);
6908 l1
= isl_seq_last_non_zero(c1
->c
, size
);
6909 l2
= isl_seq_last_non_zero(c2
->c
, size
);
6914 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6917 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6918 struct isl_basic_map
*bmap
)
6921 struct constraint
*c
;
6926 total
= isl_basic_map_total_dim(bmap
);
6927 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6930 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6932 c
[i
].c
= bmap
->ineq
[i
];
6934 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6935 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6936 bmap
->ineq
[i
] = c
[i
].c
;
6940 isl_basic_map_free(bmap
);
6944 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6945 __isl_take isl_basic_set
*bset
)
6947 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6948 (struct isl_basic_map
*)bset
);
6951 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6955 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6957 bmap
= isl_basic_map_remove_redundancies(bmap
);
6958 bmap
= isl_basic_map_sort_constraints(bmap
);
6959 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6963 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6965 return (struct isl_basic_set
*)isl_basic_map_normalize(
6966 (struct isl_basic_map
*)bset
);
6969 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
6970 const __isl_keep isl_basic_map
*bmap2
)
6977 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
6978 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
6979 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
6980 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6981 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6982 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6983 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6984 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6985 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6986 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6987 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6989 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6991 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6993 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6994 return bmap1
->n_eq
- bmap2
->n_eq
;
6995 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6996 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6997 if (bmap1
->n_div
!= bmap2
->n_div
)
6998 return bmap1
->n_div
- bmap2
->n_div
;
6999 total
= isl_basic_map_total_dim(bmap1
);
7000 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
7001 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
7005 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
7006 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
7010 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
7011 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
7018 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
7019 __isl_keep isl_basic_map
*bmap2
)
7021 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
7024 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
7025 __isl_keep isl_basic_set
*bset2
)
7027 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
7028 (isl_basic_map
*)bset2
);
7031 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
7033 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
7034 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
7036 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
7039 /* We normalize in place, but if anything goes wrong we need
7040 * to return NULL, so we need to make sure we don't change the
7041 * meaning of any possible other copies of map.
7043 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
7046 struct isl_basic_map
*bmap
;
7050 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
7052 for (i
= 0; i
< map
->n
; ++i
) {
7053 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
7056 isl_basic_map_free(map
->p
[i
]);
7059 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
7060 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
7061 map
= isl_map_remove_empty_parts(map
);
7064 for (i
= map
->n
- 1; i
>= 1; --i
) {
7065 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
7067 isl_basic_map_free(map
->p
[i
-1]);
7068 for (j
= i
; j
< map
->n
; ++j
)
7069 map
->p
[j
-1] = map
->p
[j
];
7079 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
7081 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
7084 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7094 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
7097 map1
= isl_map_copy(map1
);
7098 map2
= isl_map_copy(map2
);
7099 map1
= isl_map_normalize(map1
);
7100 map2
= isl_map_normalize(map2
);
7103 equal
= map1
->n
== map2
->n
;
7104 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
7105 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
7118 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7120 return isl_map_plain_is_equal(map1
, map2
);
7123 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7125 return isl_map_plain_is_equal((struct isl_map
*)set1
,
7126 (struct isl_map
*)set2
);
7129 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7131 return isl_set_plain_is_equal(set1
, set2
);
7134 /* Return an interval that ranges from min to max (inclusive)
7136 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
7137 isl_int min
, isl_int max
)
7140 struct isl_basic_set
*bset
= NULL
;
7142 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
7146 k
= isl_basic_set_alloc_inequality(bset
);
7149 isl_int_set_si(bset
->ineq
[k
][1], 1);
7150 isl_int_neg(bset
->ineq
[k
][0], min
);
7152 k
= isl_basic_set_alloc_inequality(bset
);
7155 isl_int_set_si(bset
->ineq
[k
][1], -1);
7156 isl_int_set(bset
->ineq
[k
][0], max
);
7160 isl_basic_set_free(bset
);
7164 /* Return the Cartesian product of the basic sets in list (in the given order).
7166 __isl_give isl_basic_set
*isl_basic_set_list_product(
7167 __isl_take
struct isl_basic_set_list
*list
)
7175 struct isl_basic_set
*product
= NULL
;
7179 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
7180 isl_assert(list
->ctx
, list
->p
[0], goto error
);
7181 nparam
= isl_basic_set_n_param(list
->p
[0]);
7182 dim
= isl_basic_set_n_dim(list
->p
[0]);
7183 extra
= list
->p
[0]->n_div
;
7184 n_eq
= list
->p
[0]->n_eq
;
7185 n_ineq
= list
->p
[0]->n_ineq
;
7186 for (i
= 1; i
< list
->n
; ++i
) {
7187 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
7188 isl_assert(list
->ctx
,
7189 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
7190 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7191 extra
+= list
->p
[i
]->n_div
;
7192 n_eq
+= list
->p
[i
]->n_eq
;
7193 n_ineq
+= list
->p
[i
]->n_ineq
;
7195 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
7200 for (i
= 0; i
< list
->n
; ++i
) {
7201 isl_basic_set_add_constraints(product
,
7202 isl_basic_set_copy(list
->p
[i
]), dim
);
7203 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7205 isl_basic_set_list_free(list
);
7208 isl_basic_set_free(product
);
7209 isl_basic_set_list_free(list
);
7213 struct isl_basic_map
*isl_basic_map_product(
7214 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7216 struct isl_dim
*dim_result
= NULL
;
7217 struct isl_basic_map
*bmap
;
7218 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
7219 struct isl_dim_map
*dim_map1
, *dim_map2
;
7221 if (!bmap1
|| !bmap2
)
7224 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
7225 bmap2
->dim
, isl_dim_param
), goto error
);
7226 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
7227 isl_dim_copy(bmap2
->dim
));
7229 in1
= isl_basic_map_n_in(bmap1
);
7230 in2
= isl_basic_map_n_in(bmap2
);
7231 out1
= isl_basic_map_n_out(bmap1
);
7232 out2
= isl_basic_map_n_out(bmap2
);
7233 nparam
= isl_basic_map_n_param(bmap1
);
7235 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7236 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7237 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7238 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7239 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7240 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7241 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7242 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7243 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7244 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7245 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7247 bmap
= isl_basic_map_alloc_dim(dim_result
,
7248 bmap1
->n_div
+ bmap2
->n_div
,
7249 bmap1
->n_eq
+ bmap2
->n_eq
,
7250 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7251 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7252 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7253 bmap
= isl_basic_map_simplify(bmap
);
7254 return isl_basic_map_finalize(bmap
);
7256 isl_basic_map_free(bmap1
);
7257 isl_basic_map_free(bmap2
);
7261 __isl_give isl_basic_map
*isl_basic_map_flat_product(
7262 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7264 isl_basic_map
*prod
;
7266 prod
= isl_basic_map_product(bmap1
, bmap2
);
7267 prod
= isl_basic_map_flatten(prod
);
7271 __isl_give isl_basic_set
*isl_basic_set_flat_product(
7272 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
7274 return isl_basic_map_flat_product(bset1
, bset2
);
7277 __isl_give isl_basic_map
*isl_basic_map_range_product(
7278 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7280 isl_dim
*dim_result
= NULL
;
7281 isl_basic_map
*bmap
;
7282 unsigned in
, out1
, out2
, nparam
, total
, pos
;
7283 struct isl_dim_map
*dim_map1
, *dim_map2
;
7285 if (!bmap1
|| !bmap2
)
7288 dim_result
= isl_dim_range_product(isl_dim_copy(bmap1
->dim
),
7289 isl_dim_copy(bmap2
->dim
));
7291 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7292 out1
= isl_basic_map_n_out(bmap1
);
7293 out2
= isl_basic_map_n_out(bmap2
);
7294 nparam
= isl_basic_map_n_param(bmap1
);
7296 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7297 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7298 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7299 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7300 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7301 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7302 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
7303 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
7304 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7305 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7306 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7308 bmap
= isl_basic_map_alloc_dim(dim_result
,
7309 bmap1
->n_div
+ bmap2
->n_div
,
7310 bmap1
->n_eq
+ bmap2
->n_eq
,
7311 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7312 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7313 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7314 bmap
= isl_basic_map_simplify(bmap
);
7315 return isl_basic_map_finalize(bmap
);
7317 isl_basic_map_free(bmap1
);
7318 isl_basic_map_free(bmap2
);
7322 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
7323 __isl_take isl_map
*map2
,
7324 __isl_give isl_dim
*(*dim_product
)(__isl_take isl_dim
*left
,
7325 __isl_take isl_dim
*right
),
7326 __isl_give isl_basic_map
*(*basic_map_product
)(
7327 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
7330 struct isl_map
*result
;
7336 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7337 map2
->dim
, isl_dim_param
), goto error
);
7339 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7340 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7341 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7343 result
= isl_map_alloc_dim(dim_product(isl_dim_copy(map1
->dim
),
7344 isl_dim_copy(map2
->dim
)),
7345 map1
->n
* map2
->n
, flags
);
7348 for (i
= 0; i
< map1
->n
; ++i
)
7349 for (j
= 0; j
< map2
->n
; ++j
) {
7350 struct isl_basic_map
*part
;
7351 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
7352 isl_basic_map_copy(map2
->p
[j
]));
7353 if (isl_basic_map_is_empty(part
))
7354 isl_basic_map_free(part
);
7356 result
= isl_map_add_basic_map(result
, part
);
7369 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7371 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
7373 return map_product(map1
, map2
, &isl_dim_product
, &isl_basic_map_product
);
7376 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7378 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7379 __isl_take isl_map
*map2
)
7383 prod
= isl_map_product(map1
, map2
);
7384 prod
= isl_map_flatten(prod
);
7388 /* Given two set A and B, construct its Cartesian product A x B.
7390 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7392 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
7393 (struct isl_map
*)set2
);
7396 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7397 __isl_take isl_set
*set2
)
7399 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
7402 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7404 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
7405 __isl_take isl_map
*map2
)
7407 return map_product(map1
, map2
, &isl_dim_range_product
,
7408 &isl_basic_map_range_product
);
7411 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7414 uint32_t hash
= isl_hash_init();
7419 bmap
= isl_basic_map_copy(bmap
);
7420 bmap
= isl_basic_map_normalize(bmap
);
7423 total
= isl_basic_map_total_dim(bmap
);
7424 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7425 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7427 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7428 isl_hash_hash(hash
, c_hash
);
7430 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7431 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7433 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7434 isl_hash_hash(hash
, c_hash
);
7436 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7437 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7439 if (isl_int_is_zero(bmap
->div
[i
][0]))
7441 isl_hash_byte(hash
, i
& 0xFF);
7442 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7443 isl_hash_hash(hash
, c_hash
);
7445 isl_basic_map_free(bmap
);
7449 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7451 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7454 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7461 map
= isl_map_copy(map
);
7462 map
= isl_map_normalize(map
);
7466 hash
= isl_hash_init();
7467 for (i
= 0; i
< map
->n
; ++i
) {
7469 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7470 isl_hash_hash(hash
, bmap_hash
);
7478 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7480 return isl_map_get_hash((isl_map
*)set
);
7483 /* Check if the value for dimension dim is completely determined
7484 * by the values of the other parameters and variables.
7485 * That is, check if dimension dim is involved in an equality.
7487 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7494 nparam
= isl_basic_set_n_param(bset
);
7495 for (i
= 0; i
< bset
->n_eq
; ++i
)
7496 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7501 /* Check if the value for dimension dim is completely determined
7502 * by the values of the other parameters and variables.
7503 * That is, check if dimension dim is involved in an equality
7504 * for each of the subsets.
7506 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7512 for (i
= 0; i
< set
->n
; ++i
) {
7514 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7521 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7523 return set
? set
->n
: 0;
7526 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7527 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7534 for (i
= 0; i
< map
->n
; ++i
)
7535 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7541 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7542 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7549 for (i
= 0; i
< set
->n
; ++i
)
7550 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7556 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7558 struct isl_dim
*dim
;
7563 bset
= isl_basic_set_cow(bset
);
7567 dim
= isl_basic_set_get_dim(bset
);
7568 dim
= isl_dim_lift(dim
, bset
->n_div
);
7571 isl_dim_free(bset
->dim
);
7573 bset
->extra
-= bset
->n_div
;
7576 bset
= isl_basic_set_finalize(bset
);
7580 isl_basic_set_free(bset
);
7584 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7587 struct isl_dim
*dim
;
7590 set
= isl_set_align_divs(set
);
7595 set
= isl_set_cow(set
);
7599 n_div
= set
->p
[0]->n_div
;
7600 dim
= isl_set_get_dim(set
);
7601 dim
= isl_dim_lift(dim
, n_div
);
7604 isl_dim_free(set
->dim
);
7607 for (i
= 0; i
< set
->n
; ++i
) {
7608 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7619 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7621 struct isl_dim
*dim
;
7622 struct isl_basic_map
*bmap
;
7629 set
= isl_set_align_divs(set
);
7634 dim
= isl_set_get_dim(set
);
7635 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7637 return isl_map_identity(isl_dim_map_from_set(dim
));
7640 n_div
= set
->p
[0]->n_div
;
7641 dim
= isl_dim_map_from_set(dim
);
7642 n_param
= isl_dim_size(dim
, isl_dim_param
);
7643 n_set
= isl_dim_size(dim
, isl_dim_in
);
7644 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7645 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7646 for (i
= 0; i
< n_set
; ++i
)
7647 bmap
= var_equal(bmap
, i
);
7649 total
= n_param
+ n_set
+ n_set
+ n_div
;
7650 for (i
= 0; i
< n_div
; ++i
) {
7651 k
= isl_basic_map_alloc_inequality(bmap
);
7654 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7655 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7656 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7657 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7658 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7659 set
->p
[0]->div
[i
][0]);
7661 l
= isl_basic_map_alloc_inequality(bmap
);
7664 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7665 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7666 set
->p
[0]->div
[i
][0]);
7667 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7671 bmap
= isl_basic_map_simplify(bmap
);
7672 bmap
= isl_basic_map_finalize(bmap
);
7673 return isl_map_from_basic_map(bmap
);
7676 isl_basic_map_free(bmap
);
7680 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7688 dim
= isl_basic_set_total_dim(bset
);
7689 size
+= bset
->n_eq
* (1 + dim
);
7690 size
+= bset
->n_ineq
* (1 + dim
);
7691 size
+= bset
->n_div
* (2 + dim
);
7696 int isl_set_size(__isl_keep isl_set
*set
)
7704 for (i
= 0; i
< set
->n
; ++i
)
7705 size
+= isl_basic_set_size(set
->p
[i
]);
7710 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7711 enum isl_dim_type type
, unsigned pos
)
7719 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7721 pos
+= isl_basic_map_offset(bmap
, type
);
7723 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7724 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7728 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7729 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7736 return lower
&& upper
;
7739 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7740 enum isl_dim_type type
, unsigned pos
)
7747 for (i
= 0; i
< map
->n
; ++i
) {
7749 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7750 if (bounded
< 0 || !bounded
)
7757 /* Return 1 if the specified dim is involved in both an upper bound
7758 * and a lower bound.
7760 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7761 enum isl_dim_type type
, unsigned pos
)
7763 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7766 /* For each of the "n" variables starting at "first", determine
7767 * the sign of the variable and put the results in the first "n"
7768 * elements of the array "signs".
7770 * 1 means that the variable is non-negative
7771 * -1 means that the variable is non-positive
7772 * 0 means the variable attains both positive and negative values.
7774 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7775 unsigned first
, unsigned n
, int *signs
)
7777 isl_vec
*bound
= NULL
;
7778 struct isl_tab
*tab
= NULL
;
7779 struct isl_tab_undo
*snap
;
7782 if (!bset
|| !signs
)
7785 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7786 tab
= isl_tab_from_basic_set(bset
);
7790 isl_seq_clr(bound
->el
, bound
->size
);
7791 isl_int_set_si(bound
->el
[0], -1);
7793 snap
= isl_tab_snap(tab
);
7794 for (i
= 0; i
< n
; ++i
) {
7797 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7798 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7801 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7802 if (isl_tab_rollback(tab
, snap
) < 0)
7810 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7811 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7814 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7815 if (isl_tab_rollback(tab
, snap
) < 0)
7818 signs
[i
] = empty
? -1 : 0;
7822 isl_vec_free(bound
);
7826 isl_vec_free(bound
);
7830 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7831 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7833 if (!bset
|| !signs
)
7835 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7838 first
+= pos(bset
->dim
, type
) - 1;
7839 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7842 /* Check if the given basic map is obviously single-valued.
7843 * In particular, for each output dimension, check that there is
7844 * an equality that defines the output dimension in terms of
7845 * earlier dimensions.
7847 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
7857 total
= 1 + isl_basic_map_total_dim(bmap
);
7858 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7859 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
7861 for (i
= 0; i
< n_out
; ++i
) {
7862 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
7863 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
7865 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
7866 total
- (o_out
+ i
+ 1)) == -1)
7869 if (j
>= bmap
->n_eq
)
7876 /* Check if the given map is obviously single-valued.
7878 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
7889 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
7892 /* Check if the given map is single-valued.
7897 * and check if the result is a subset of the identity mapping.
7899 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7906 sv
= isl_map_plain_is_single_valued(map
);
7910 test
= isl_map_reverse(isl_map_copy(map
));
7911 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7913 dim
= isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map
)));
7914 id
= isl_map_identity(dim
);
7916 sv
= isl_map_is_subset(test
, id
);
7924 int isl_map_is_injective(__isl_keep isl_map
*map
)
7928 map
= isl_map_copy(map
);
7929 map
= isl_map_reverse(map
);
7930 in
= isl_map_is_single_valued(map
);
7936 /* Check if the given map is obviously injective.
7938 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
7942 map
= isl_map_copy(map
);
7943 map
= isl_map_reverse(map
);
7944 in
= isl_map_plain_is_single_valued(map
);
7950 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7954 sv
= isl_map_is_single_valued(map
);
7958 return isl_map_is_injective(map
);
7961 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7963 return isl_map_is_single_valued((isl_map
*)set
);
7966 int isl_map_is_translation(__isl_keep isl_map
*map
)
7971 delta
= isl_map_deltas(isl_map_copy(map
));
7972 ok
= isl_set_is_singleton(delta
);
7973 isl_set_free(delta
);
7978 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7980 if (isl_seq_first_non_zero(p
, pos
) != -1)
7982 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7987 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7996 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7999 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
8000 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
8001 for (j
= 0; j
< nvar
; ++j
) {
8002 int lower
= 0, upper
= 0;
8003 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8004 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
8006 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
8012 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8013 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
8015 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
8017 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
8022 if (!lower
|| !upper
)
8029 int isl_set_is_box(__isl_keep isl_set
*set
)
8036 return isl_basic_set_is_box(set
->p
[0]);
8039 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
8044 return isl_dim_is_wrapping(bset
->dim
);
8047 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
8052 return isl_dim_is_wrapping(set
->dim
);
8055 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
8057 bmap
= isl_basic_map_cow(bmap
);
8061 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
8065 bmap
= isl_basic_map_finalize(bmap
);
8067 return (isl_basic_set
*)bmap
;
8069 isl_basic_map_free(bmap
);
8073 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
8077 map
= isl_map_cow(map
);
8081 for (i
= 0; i
< map
->n
; ++i
) {
8082 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
8086 map
->dim
= isl_dim_wrap(map
->dim
);
8090 return (isl_set
*)map
;
8096 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
8098 bset
= isl_basic_set_cow(bset
);
8102 bset
->dim
= isl_dim_unwrap(bset
->dim
);
8106 bset
= isl_basic_set_finalize(bset
);
8108 return (isl_basic_map
*)bset
;
8110 isl_basic_set_free(bset
);
8114 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
8121 if (!isl_set_is_wrapping(set
))
8122 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
8125 set
= isl_set_cow(set
);
8129 for (i
= 0; i
< set
->n
; ++i
) {
8130 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
8135 set
->dim
= isl_dim_unwrap(set
->dim
);
8139 return (isl_map
*)set
;
8145 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
8146 enum isl_dim_type type
)
8151 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
8154 bmap
= isl_basic_map_cow(bmap
);
8158 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
8162 bmap
= isl_basic_map_finalize(bmap
);
8166 isl_basic_map_free(bmap
);
8170 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
8171 enum isl_dim_type type
)
8178 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
8181 map
= isl_map_cow(map
);
8185 for (i
= 0; i
< map
->n
; ++i
) {
8186 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
8190 map
->dim
= isl_dim_reset(map
->dim
, type
);
8200 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
8205 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
8208 bmap
= isl_basic_map_cow(bmap
);
8212 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
8216 bmap
= isl_basic_map_finalize(bmap
);
8220 isl_basic_map_free(bmap
);
8224 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
8226 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
8229 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
8236 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
8239 map
= isl_map_cow(map
);
8243 for (i
= 0; i
< map
->n
; ++i
) {
8244 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
8248 map
->dim
= isl_dim_flatten(map
->dim
);
8258 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
8260 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
8263 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
8265 isl_dim
*dim
, *flat_dim
;
8268 dim
= isl_set_get_dim(set
);
8269 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
8270 map
= isl_map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
8271 map
= isl_map_intersect_domain(map
, set
);
8276 /* Reorder the dimensions of "bmap" according to the given dim_map
8277 * and set the dimension specification to "dim".
8279 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
8280 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
8284 bmap
= isl_basic_map_cow(bmap
);
8285 if (!bmap
|| !dim
|| !dim_map
)
8288 res
= isl_basic_map_alloc_dim(dim
,
8289 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8290 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
8291 res
= isl_basic_map_finalize(res
);
8295 isl_basic_map_free(bmap
);
8300 /* Reorder the dimensions of "map" according to given reordering.
8302 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8303 __isl_take isl_reordering
*r
)
8306 struct isl_dim_map
*dim_map
;
8308 map
= isl_map_cow(map
);
8309 dim_map
= isl_dim_map_from_reordering(r
);
8310 if (!map
|| !r
|| !dim_map
)
8313 for (i
= 0; i
< map
->n
; ++i
) {
8314 struct isl_dim_map
*dim_map_i
;
8316 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
8318 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8319 isl_dim_copy(r
->dim
), dim_map_i
);
8325 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8327 isl_reordering_free(r
);
8333 isl_reordering_free(r
);
8337 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8338 __isl_take isl_reordering
*r
)
8340 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8343 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
8344 __isl_take isl_dim
*model
)
8351 ctx
= isl_dim_get_ctx(model
);
8352 if (!isl_dim_has_named_params(model
))
8353 isl_die(ctx
, isl_error_invalid
,
8354 "model has unnamed parameters", goto error
);
8355 if (!isl_dim_has_named_params(map
->dim
))
8356 isl_die(ctx
, isl_error_invalid
,
8357 "relation has unnamed parameters", goto error
);
8358 if (!isl_dim_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
8359 isl_reordering
*exp
;
8361 model
= isl_dim_drop(model
, isl_dim_in
,
8362 0, isl_dim_size(model
, isl_dim_in
));
8363 model
= isl_dim_drop(model
, isl_dim_out
,
8364 0, isl_dim_size(model
, isl_dim_out
));
8365 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
8366 exp
= isl_reordering_extend_dim(exp
, isl_map_get_dim(map
));
8367 map
= isl_map_realign(map
, exp
);
8370 isl_dim_free(model
);
8373 isl_dim_free(model
);
8378 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
8379 __isl_take isl_dim
*model
)
8381 return isl_map_align_params(set
, model
);
8384 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8385 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8386 enum isl_dim_type c2
, enum isl_dim_type c3
,
8387 enum isl_dim_type c4
, enum isl_dim_type c5
)
8389 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8390 struct isl_mat
*mat
;
8396 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8397 isl_basic_map_total_dim(bmap
) + 1);
8400 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8401 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8402 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8403 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8404 isl_int_set(mat
->row
[i
][pos
],
8405 bmap
->eq
[i
][off
+ k
]);
8413 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8414 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8415 enum isl_dim_type c2
, enum isl_dim_type c3
,
8416 enum isl_dim_type c4
, enum isl_dim_type c5
)
8418 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8419 struct isl_mat
*mat
;
8425 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8426 isl_basic_map_total_dim(bmap
) + 1);
8429 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8430 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8431 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8432 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8433 isl_int_set(mat
->row
[i
][pos
],
8434 bmap
->ineq
[i
][off
+ k
]);
8442 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8443 __isl_take isl_dim
*dim
,
8444 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8445 enum isl_dim_type c2
, enum isl_dim_type c3
,
8446 enum isl_dim_type c4
, enum isl_dim_type c5
)
8448 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8449 isl_basic_map
*bmap
;
8455 if (!dim
|| !eq
|| !ineq
)
8458 if (eq
->n_col
!= ineq
->n_col
)
8459 isl_die(dim
->ctx
, isl_error_invalid
,
8460 "equalities and inequalities matrices should have "
8461 "same number of columns", goto error
);
8463 total
= 1 + isl_dim_total(dim
);
8465 if (eq
->n_col
< total
)
8466 isl_die(dim
->ctx
, isl_error_invalid
,
8467 "number of columns too small", goto error
);
8469 extra
= eq
->n_col
- total
;
8471 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
8472 eq
->n_row
, ineq
->n_row
);
8475 for (i
= 0; i
< extra
; ++i
) {
8476 k
= isl_basic_map_alloc_div(bmap
);
8479 isl_int_set_si(bmap
->div
[k
][0], 0);
8481 for (i
= 0; i
< eq
->n_row
; ++i
) {
8482 l
= isl_basic_map_alloc_equality(bmap
);
8485 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8486 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8487 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8488 isl_int_set(bmap
->eq
[l
][off
+ k
],
8494 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8495 l
= isl_basic_map_alloc_inequality(bmap
);
8498 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8499 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8500 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8501 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8520 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8521 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8522 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8524 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8525 c1
, c2
, c3
, c4
, isl_dim_in
);
8528 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8529 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8530 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8532 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8533 c1
, c2
, c3
, c4
, isl_dim_in
);
8536 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8537 __isl_take isl_dim
*dim
,
8538 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8539 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8541 return (isl_basic_set
*)
8542 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8543 c1
, c2
, c3
, c4
, isl_dim_in
);
8546 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
8551 return isl_dim_can_zip(bmap
->dim
);
8554 int isl_map_can_zip(__isl_keep isl_map
*map
)
8559 return isl_dim_can_zip(map
->dim
);
8562 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8563 * (A -> C) -> (B -> D).
8565 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
8574 if (!isl_basic_map_can_zip(bmap
))
8575 isl_die(bmap
->ctx
, isl_error_invalid
,
8576 "basic map cannot be zipped", goto error
);
8577 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
8578 isl_dim_size(bmap
->dim
->nested
[0], isl_dim_in
);
8579 n1
= isl_dim_size(bmap
->dim
->nested
[0], isl_dim_out
);
8580 n2
= isl_dim_size(bmap
->dim
->nested
[1], isl_dim_in
);
8581 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
8584 bmap
->dim
= isl_dim_zip(bmap
->dim
);
8589 isl_basic_map_free(bmap
);
8593 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8594 * (A -> C) -> (B -> D).
8596 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
8603 if (!isl_map_can_zip(map
))
8604 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
8607 map
= isl_map_cow(map
);
8611 for (i
= 0; i
< map
->n
; ++i
) {
8612 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
8617 map
->dim
= isl_dim_zip(map
->dim
);