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>
33 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
36 case isl_dim_param
: return dim
->nparam
;
37 case isl_dim_in
: return dim
->n_in
;
38 case isl_dim_out
: return dim
->n_out
;
39 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
44 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
47 case isl_dim_param
: return 1;
48 case isl_dim_in
: return 1 + dim
->nparam
;
49 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
54 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
55 enum isl_dim_type type
)
60 case isl_dim_cst
: return 1;
63 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
64 case isl_dim_div
: return bmap
->n_div
;
65 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
70 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
72 return map
? n(map
->dim
, type
) : 0;
75 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
77 return set
? n(set
->dim
, type
) : 0;
80 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
81 enum isl_dim_type type
)
83 struct isl_dim
*dim
= bmap
->dim
;
85 case isl_dim_cst
: return 0;
86 case isl_dim_param
: return 1;
87 case isl_dim_in
: return 1 + dim
->nparam
;
88 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
89 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
94 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
95 enum isl_dim_type type
)
97 return isl_basic_map_offset(bset
, type
);
100 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
102 return pos(map
->dim
, type
);
105 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
106 enum isl_dim_type type
)
108 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
111 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
113 return isl_basic_set_dim(bset
, isl_dim_set
);
116 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
118 return isl_basic_set_dim(bset
, isl_dim_param
);
121 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
123 return isl_dim_total(bset
->dim
) + bset
->n_div
;
126 unsigned isl_set_n_dim(const struct isl_set
*set
)
128 return isl_set_dim(set
, isl_dim_set
);
131 unsigned isl_set_n_param(const struct isl_set
*set
)
133 return isl_set_dim(set
, isl_dim_param
);
136 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
138 return bmap
? bmap
->dim
->n_in
: 0;
141 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
143 return bmap
? bmap
->dim
->n_out
: 0;
146 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
148 return bmap
? bmap
->dim
->nparam
: 0;
151 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
153 return bmap
? bmap
->n_div
: 0;
156 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
158 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
161 unsigned isl_map_n_in(const struct isl_map
*map
)
163 return map
->dim
->n_in
;
166 unsigned isl_map_n_out(const struct isl_map
*map
)
168 return map
->dim
->n_out
;
171 unsigned isl_map_n_param(const struct isl_map
*map
)
173 return map
->dim
->nparam
;
176 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
181 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
184 return isl_dim_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
187 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
188 struct isl_basic_set
*bset
)
193 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
196 return isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
199 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
200 struct isl_basic_set
*bset
)
205 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
208 return isl_dim_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
211 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
213 return bmap
? bmap
->ctx
: NULL
;
216 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
218 return bset
? bset
->ctx
: NULL
;
221 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
223 return map
? map
->ctx
: NULL
;
226 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
228 return set
? set
->ctx
: NULL
;
231 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
235 return isl_dim_copy(bmap
->dim
);
238 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
242 return isl_dim_copy(bset
->dim
);
245 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
249 return isl_dim_copy(map
->dim
);
252 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
256 return isl_dim_copy(set
->dim
);
259 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
260 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
262 bmap
= isl_basic_map_cow(bmap
);
265 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
268 bmap
= isl_basic_map_finalize(bmap
);
271 isl_basic_map_free(bmap
);
275 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
276 enum isl_dim_type type
)
278 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
281 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
282 enum isl_dim_type type
, const char *s
)
286 map
= isl_map_cow(map
);
290 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
294 for (i
= 0; i
< map
->n
; ++i
) {
295 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
306 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
307 enum isl_dim_type type
)
309 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
312 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
315 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
318 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
320 return bset
? isl_dim_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
323 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
325 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
328 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
329 enum isl_dim_type type
, unsigned pos
)
331 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
334 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
335 enum isl_dim_type type
, unsigned pos
)
337 return bset
? isl_dim_get_name(bset
->dim
, type
, pos
) : NULL
;
340 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
341 enum isl_dim_type type
, unsigned pos
)
343 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
346 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
347 enum isl_dim_type type
, unsigned pos
)
349 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
352 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
353 __isl_take isl_basic_map
*bmap
,
354 enum isl_dim_type type
, unsigned pos
, const char *s
)
358 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
363 isl_basic_map_free(bmap
);
367 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
368 enum isl_dim_type type
, unsigned pos
, const char *s
)
375 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
379 for (i
= 0; i
< map
->n
; ++i
) {
380 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
391 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
392 __isl_take isl_basic_set
*bset
,
393 enum isl_dim_type type
, unsigned pos
, const char *s
)
395 return (isl_basic_set
*)isl_basic_map_set_dim_name(
396 (isl_basic_map
*)bset
, type
, pos
, s
);
399 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
400 enum isl_dim_type type
, unsigned pos
, const char *s
)
402 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
405 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
409 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
412 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
414 return isl_basic_map_is_rational(bset
);
417 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
418 struct isl_basic_map
*bmap
, unsigned extra
,
419 unsigned n_eq
, unsigned n_ineq
)
422 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
427 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
428 if (isl_blk_is_error(bmap
->block
))
431 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
436 bmap
->block2
= isl_blk_empty();
439 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
440 if (isl_blk_is_error(bmap
->block2
))
443 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
448 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
449 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
451 for (i
= 0; i
< extra
; ++i
)
452 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
456 bmap
->c_size
= n_eq
+ n_ineq
;
457 bmap
->eq
= bmap
->ineq
+ n_ineq
;
466 isl_basic_map_free(bmap
);
470 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
471 unsigned nparam
, unsigned dim
, unsigned extra
,
472 unsigned n_eq
, unsigned n_ineq
)
474 struct isl_basic_map
*bmap
;
475 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
476 return (struct isl_basic_set
*)bmap
;
479 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
480 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
482 struct isl_basic_map
*bmap
;
485 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
486 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
487 return (struct isl_basic_set
*)bmap
;
493 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
494 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
496 struct isl_basic_map
*bmap
;
500 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
505 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
511 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
512 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
513 unsigned n_eq
, unsigned n_ineq
)
515 struct isl_basic_map
*bmap
;
518 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
522 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
526 static void dup_constraints(
527 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
530 unsigned total
= isl_basic_map_total_dim(src
);
532 for (i
= 0; i
< src
->n_eq
; ++i
) {
533 int j
= isl_basic_map_alloc_equality(dst
);
534 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
537 for (i
= 0; i
< src
->n_ineq
; ++i
) {
538 int j
= isl_basic_map_alloc_inequality(dst
);
539 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
542 for (i
= 0; i
< src
->n_div
; ++i
) {
543 int j
= isl_basic_map_alloc_div(dst
);
544 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
546 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
549 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
551 struct isl_basic_map
*dup
;
555 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
556 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
559 dup_constraints(dup
, bmap
);
560 dup
->flags
= bmap
->flags
;
561 dup
->sample
= isl_vec_copy(bmap
->sample
);
565 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
567 struct isl_basic_map
*dup
;
569 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
570 return (struct isl_basic_set
*)dup
;
573 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
578 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
582 return isl_basic_set_dup(bset
);
585 struct isl_set
*isl_set_copy(struct isl_set
*set
)
594 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
599 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
603 bmap
= isl_basic_map_dup(bmap
);
605 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
609 struct isl_map
*isl_map_copy(struct isl_map
*map
)
618 void isl_basic_map_free(struct isl_basic_map
*bmap
)
626 isl_ctx_deref(bmap
->ctx
);
628 isl_blk_free(bmap
->ctx
, bmap
->block2
);
630 isl_blk_free(bmap
->ctx
, bmap
->block
);
631 isl_vec_free(bmap
->sample
);
632 isl_dim_free(bmap
->dim
);
636 void isl_basic_set_free(struct isl_basic_set
*bset
)
638 isl_basic_map_free((struct isl_basic_map
*)bset
);
641 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
643 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
646 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
652 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
653 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
655 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
656 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
657 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
658 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
659 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
660 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
662 int j
= isl_basic_map_alloc_inequality(bmap
);
666 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
667 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
674 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
675 bmap
->extra
- bmap
->n_div
);
679 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
681 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
684 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
688 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
693 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
695 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
698 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
703 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
705 if (pos
!= bmap
->n_eq
- 1) {
707 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
708 bmap
->eq
[bmap
->n_eq
- 1] = t
;
714 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
716 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
719 void isl_basic_map_inequality_to_equality(
720 struct isl_basic_map
*bmap
, unsigned pos
)
725 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
726 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
731 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
732 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
733 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
734 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
737 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
739 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
742 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
748 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
749 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
750 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
751 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
752 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
753 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
754 1 + isl_basic_map_total_dim(bmap
),
755 bmap
->extra
- bmap
->n_div
);
756 return bmap
->n_ineq
++;
759 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
761 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
764 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
768 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
773 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
775 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
778 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
783 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
785 if (pos
!= bmap
->n_ineq
- 1) {
787 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
788 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
789 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
795 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
797 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
800 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
805 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
808 k
= isl_basic_map_alloc_equality(bmap
);
811 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
814 isl_basic_map_free(bmap
);
818 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
821 return (isl_basic_set
*)
822 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
825 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
830 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
833 k
= isl_basic_map_alloc_inequality(bmap
);
836 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
839 isl_basic_map_free(bmap
);
843 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
846 return (isl_basic_set
*)
847 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
850 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
854 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
855 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
856 1 + 1 + isl_basic_map_total_dim(bmap
),
857 bmap
->extra
- bmap
->n_div
);
858 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
859 return bmap
->n_div
++;
862 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
864 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
867 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
871 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
876 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
878 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
881 /* Copy constraint from src to dst, putting the vars of src at offset
882 * dim_off in dst and the divs of src at offset div_off in dst.
883 * If both sets are actually map, then dim_off applies to the input
886 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
887 struct isl_basic_map
*src_map
, isl_int
*src
,
888 unsigned in_off
, unsigned out_off
, unsigned div_off
)
890 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
891 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
892 unsigned src_in
= isl_basic_map_n_in(src_map
);
893 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
894 unsigned src_out
= isl_basic_map_n_out(src_map
);
895 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
896 isl_int_set(dst
[0], src
[0]);
897 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
898 if (dst_nparam
> src_nparam
)
899 isl_seq_clr(dst
+1+src_nparam
,
900 dst_nparam
- src_nparam
);
901 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
902 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
904 isl_min(dst_in
-in_off
, src_in
));
905 if (dst_in
-in_off
> src_in
)
906 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
907 dst_in
- in_off
- src_in
);
908 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
909 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
910 src
+1+src_nparam
+src_in
,
911 isl_min(dst_out
-out_off
, src_out
));
912 if (dst_out
-out_off
> src_out
)
913 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
914 dst_out
- out_off
- src_out
);
915 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
916 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
917 src
+1+src_nparam
+src_in
+src_out
,
918 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
919 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
920 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
921 div_off
+src_map
->n_div
,
922 dst_map
->n_div
- div_off
- src_map
->n_div
);
925 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
926 struct isl_basic_map
*src_map
, isl_int
*src
,
927 unsigned in_off
, unsigned out_off
, unsigned div_off
)
929 isl_int_set(dst
[0], src
[0]);
930 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
933 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
934 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
939 if (!bmap1
|| !bmap2
)
942 div_off
= bmap1
->n_div
;
944 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
945 int i1
= isl_basic_map_alloc_equality(bmap1
);
948 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
949 i_pos
, o_pos
, div_off
);
952 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
953 int i1
= isl_basic_map_alloc_inequality(bmap1
);
956 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
957 i_pos
, o_pos
, div_off
);
960 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
961 int i1
= isl_basic_map_alloc_div(bmap1
);
964 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
965 i_pos
, o_pos
, div_off
);
968 isl_basic_map_free(bmap2
);
973 isl_basic_map_free(bmap1
);
974 isl_basic_map_free(bmap2
);
978 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
979 struct isl_basic_set
*bset2
, unsigned pos
)
981 return (struct isl_basic_set
*)
982 add_constraints((struct isl_basic_map
*)bset1
,
983 (struct isl_basic_map
*)bset2
, 0, pos
);
986 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
987 struct isl_dim
*dim
, unsigned extra
,
988 unsigned n_eq
, unsigned n_ineq
)
990 struct isl_basic_map
*ext
;
1000 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1001 base
->extra
>= base
->n_div
+ extra
;
1003 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1004 room_for_ineq(base
, n_ineq
)) {
1009 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1010 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1011 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1012 extra
+= base
->extra
;
1014 n_ineq
+= base
->n_ineq
;
1016 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1022 ext
->sample
= isl_vec_copy(base
->sample
);
1023 flags
= base
->flags
;
1024 ext
= add_constraints(ext
, base
, 0, 0);
1027 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1034 isl_basic_map_free(base
);
1038 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1039 struct isl_dim
*dim
, unsigned extra
,
1040 unsigned n_eq
, unsigned n_ineq
)
1042 return (struct isl_basic_set
*)
1043 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1044 extra
, n_eq
, n_ineq
);
1047 struct isl_basic_map
*isl_basic_map_extend_constraints(
1048 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1052 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1056 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1057 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1058 unsigned n_eq
, unsigned n_ineq
)
1060 struct isl_basic_map
*bmap
;
1061 struct isl_dim
*dim
;
1065 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1069 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1072 isl_basic_map_free(base
);
1076 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1077 unsigned nparam
, unsigned dim
, unsigned extra
,
1078 unsigned n_eq
, unsigned n_ineq
)
1080 return (struct isl_basic_set
*)
1081 isl_basic_map_extend((struct isl_basic_map
*)base
,
1082 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1085 struct isl_basic_set
*isl_basic_set_extend_constraints(
1086 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1088 return (struct isl_basic_set
*)
1089 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1093 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1095 return (struct isl_basic_set
*)
1096 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1099 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1104 if (bmap
->ref
> 1) {
1106 bmap
= isl_basic_map_dup(bmap
);
1109 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1113 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1121 return isl_set_dup(set
);
1124 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1132 return isl_map_dup(map
);
1135 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1136 unsigned a_len
, unsigned b_len
)
1138 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1139 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1140 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1143 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1144 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1152 isl_assert(bmap
->ctx
,
1153 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1155 if (n1
== 0 || n2
== 0)
1158 bmap
= isl_basic_map_cow(bmap
);
1162 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1163 if (isl_blk_is_error(blk
))
1166 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1168 bmap
->eq
[i
] + pos
, n1
, n2
);
1170 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1172 bmap
->ineq
[i
] + pos
, n1
, n2
);
1174 for (i
= 0; i
< bmap
->n_div
; ++i
)
1176 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1178 isl_blk_free(bmap
->ctx
, blk
);
1180 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1181 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1182 return isl_basic_map_finalize(bmap
);
1184 isl_basic_map_free(bmap
);
1188 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1189 __isl_take isl_basic_set
*bset
, unsigned n
)
1194 nparam
= isl_basic_set_n_param(bset
);
1195 dim
= isl_basic_set_n_dim(bset
);
1196 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1198 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1200 isl_basic_set_free(bset
);
1204 static __isl_give isl_set
*isl_set_swap_vars(__isl_take isl_set
*set
,
1208 set
= isl_set_cow(set
);
1212 for (i
= 0; i
< set
->n
; ++i
) {
1213 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1219 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1223 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1229 total
= isl_basic_map_total_dim(bmap
);
1230 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1231 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1233 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1235 i
= isl_basic_map_alloc_equality(bmap
);
1239 isl_int_set_si(bmap
->eq
[i
][0], 1);
1240 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1241 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1242 isl_vec_free(bmap
->sample
);
1243 bmap
->sample
= NULL
;
1244 return isl_basic_map_finalize(bmap
);
1246 isl_basic_map_free(bmap
);
1250 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1252 return (struct isl_basic_set
*)
1253 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1256 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1259 unsigned off
= isl_dim_total(bmap
->dim
);
1260 isl_int
*t
= bmap
->div
[a
];
1261 bmap
->div
[a
] = bmap
->div
[b
];
1264 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1265 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1267 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1268 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1270 for (i
= 0; i
< bmap
->n_div
; ++i
)
1271 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1272 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1275 /* Eliminate the specified n dimensions starting at first from the
1276 * constraints using Fourier-Motzkin. The dimensions themselves
1279 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1280 enum isl_dim_type type
, unsigned first
, unsigned n
)
1289 map
= isl_map_cow(map
);
1292 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1293 first
+= pos(map
->dim
, type
) - 1;
1295 for (i
= 0; i
< map
->n
; ++i
) {
1296 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1306 /* Eliminate the specified n dimensions starting at first from the
1307 * constraints using Fourier-Motzkin. The dimensions themselves
1310 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1311 enum isl_dim_type type
, unsigned first
, unsigned n
)
1313 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1316 /* Eliminate the specified n dimensions starting at first from the
1317 * constraints using Fourier-Motzkin. The dimensions themselves
1320 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1321 unsigned first
, unsigned n
)
1323 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1326 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1327 __isl_take isl_basic_map
*bmap
)
1329 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1334 return isl_basic_map_finalize(bmap
);
1337 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1338 __isl_take isl_basic_set
*bset
)
1340 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1341 (struct isl_basic_map
*)bset
);
1344 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1353 map
= isl_map_cow(map
);
1357 for (i
= 0; i
< map
->n
; ++i
) {
1358 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1368 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1370 return isl_map_remove_divs(set
);
1373 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1374 enum isl_dim_type type
, unsigned first
, unsigned n
)
1378 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1382 bmap
= isl_basic_map_eliminate_vars(bmap
,
1383 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1386 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1388 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1391 isl_basic_map_free(bmap
);
1395 /* Return true if the definition of the given div (recursively) involves
1396 * any of the given variables.
1398 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1399 unsigned first
, unsigned n
)
1402 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1404 if (isl_int_is_zero(bmap
->div
[div
][0]))
1406 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1409 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1410 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1412 if (div_involves_vars(bmap
, i
, first
, n
))
1419 /* Remove all divs (recursively) involving any of the given dimensions
1420 * in their definitions.
1422 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1423 __isl_take isl_basic_map
*bmap
,
1424 enum isl_dim_type type
, unsigned first
, unsigned n
)
1430 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1432 first
+= isl_basic_map_offset(bmap
, type
);
1434 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1435 if (!div_involves_vars(bmap
, i
, first
, n
))
1437 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1442 isl_basic_map_free(bmap
);
1446 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1447 enum isl_dim_type type
, unsigned first
, unsigned n
)
1456 map
= isl_map_cow(map
);
1460 for (i
= 0; i
< map
->n
; ++i
) {
1461 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1472 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1473 enum isl_dim_type type
, unsigned first
, unsigned n
)
1475 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1479 /* Return true if the definition of the given div is unknown or depends
1482 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1485 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1487 if (isl_int_is_zero(bmap
->div
[div
][0]))
1490 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1491 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1493 if (div_is_unknown(bmap
, i
))
1500 /* Remove all divs that are unknown or defined in terms of unknown divs.
1502 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1503 __isl_take isl_basic_map
*bmap
)
1510 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1511 if (!div_is_unknown(bmap
, i
))
1513 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1519 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1528 map
= isl_map_cow(map
);
1532 for (i
= 0; i
< map
->n
; ++i
) {
1533 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1543 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1545 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1548 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1549 __isl_take isl_basic_set
*bset
,
1550 enum isl_dim_type type
, unsigned first
, unsigned n
)
1552 return (isl_basic_set
*)
1553 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1556 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1557 enum isl_dim_type type
, unsigned first
, unsigned n
)
1564 map
= isl_map_cow(map
);
1567 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1569 for (i
= 0; i
< map
->n
; ++i
) {
1570 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1571 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1575 map
= isl_map_drop(map
, type
, first
, n
);
1582 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1583 enum isl_dim_type type
, unsigned first
, unsigned n
)
1585 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1588 /* Project out n inputs starting at first using Fourier-Motzkin */
1589 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1590 unsigned first
, unsigned n
)
1592 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1595 static void dump_term(struct isl_basic_map
*bmap
,
1596 isl_int c
, int pos
, FILE *out
)
1599 unsigned in
= isl_basic_map_n_in(bmap
);
1600 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1601 unsigned nparam
= isl_basic_map_n_param(bmap
);
1603 isl_int_print(out
, c
, 0);
1605 if (!isl_int_is_one(c
))
1606 isl_int_print(out
, c
, 0);
1607 if (pos
< 1 + nparam
) {
1608 name
= isl_dim_get_name(bmap
->dim
,
1609 isl_dim_param
, pos
- 1);
1611 fprintf(out
, "%s", name
);
1613 fprintf(out
, "p%d", pos
- 1);
1614 } else if (pos
< 1 + nparam
+ in
)
1615 fprintf(out
, "i%d", pos
- 1 - nparam
);
1616 else if (pos
< 1 + nparam
+ dim
)
1617 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1619 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1623 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1624 int sign
, FILE *out
)
1628 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1632 for (i
= 0, first
= 1; i
< len
; ++i
) {
1633 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1636 fprintf(out
, " + ");
1638 isl_int_abs(v
, c
[i
]);
1639 dump_term(bmap
, v
, i
, out
);
1646 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1647 const char *op
, FILE *out
, int indent
)
1651 fprintf(out
, "%*s", indent
, "");
1653 dump_constraint_sign(bmap
, c
, 1, out
);
1654 fprintf(out
, " %s ", op
);
1655 dump_constraint_sign(bmap
, c
, -1, out
);
1659 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1660 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1662 fprintf(out
, "%*s", indent
, "");
1663 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1668 static void dump_constraints(struct isl_basic_map
*bmap
,
1669 isl_int
**c
, unsigned n
,
1670 const char *op
, FILE *out
, int indent
)
1674 for (i
= 0; i
< n
; ++i
)
1675 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1678 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1682 unsigned total
= isl_basic_map_total_dim(bmap
);
1684 for (j
= 0; j
< 1 + total
; ++j
) {
1685 if (isl_int_is_zero(exp
[j
]))
1687 if (!first
&& isl_int_is_pos(exp
[j
]))
1689 dump_term(bmap
, exp
[j
], j
, out
);
1694 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1698 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1699 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1701 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1702 fprintf(out
, "%*s", indent
, "");
1703 fprintf(out
, "e%d = [(", i
);
1704 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1706 isl_int_print(out
, bmap
->div
[i
][0], 0);
1707 fprintf(out
, "]\n");
1711 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
1712 FILE *out
, int indent
)
1715 fprintf(out
, "null basic set\n");
1719 fprintf(out
, "%*s", indent
, "");
1720 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1721 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1722 bset
->extra
, bset
->flags
);
1723 dump((struct isl_basic_map
*)bset
, out
, indent
);
1726 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
1727 FILE *out
, int indent
)
1730 fprintf(out
, "null basic map\n");
1734 fprintf(out
, "%*s", indent
, "");
1735 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1736 "flags: %x, n_name: %d\n",
1738 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1739 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1740 dump(bmap
, out
, indent
);
1743 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1748 total
= isl_basic_map_total_dim(bmap
);
1749 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1750 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1751 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1752 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1756 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1758 struct isl_set
*set
;
1762 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1763 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1764 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1765 sizeof(struct isl_set
) +
1766 (n
- 1) * sizeof(struct isl_basic_set
*));
1770 set
->ctx
= dim
->ctx
;
1771 isl_ctx_ref(set
->ctx
);
1783 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1784 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1786 struct isl_set
*set
;
1787 struct isl_dim
*dims
;
1789 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1793 set
= isl_set_alloc_dim(dims
, n
, flags
);
1797 /* Make sure "map" has room for at least "n" more basic maps.
1799 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1802 struct isl_map
*grown
= NULL
;
1806 isl_assert(map
->ctx
, n
>= 0, goto error
);
1807 if (map
->n
+ n
<= map
->size
)
1809 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1812 for (i
= 0; i
< map
->n
; ++i
) {
1813 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1821 isl_map_free(grown
);
1826 /* Make sure "set" has room for at least "n" more basic sets.
1828 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1830 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1833 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1836 struct isl_set
*dup
;
1841 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1844 for (i
= 0; i
< set
->n
; ++i
)
1845 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1849 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1851 return isl_map_from_basic_map(bset
);
1854 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1856 struct isl_map
*map
;
1861 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1862 return isl_map_add_basic_map(map
, bmap
);
1865 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1866 __isl_take isl_basic_set
*bset
)
1868 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1869 (struct isl_basic_map
*)bset
);
1872 void isl_set_free(struct isl_set
*set
)
1882 isl_ctx_deref(set
->ctx
);
1883 for (i
= 0; i
< set
->n
; ++i
)
1884 isl_basic_set_free(set
->p
[i
]);
1885 isl_dim_free(set
->dim
);
1889 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
1894 fprintf(out
, "null set\n");
1898 fprintf(out
, "%*s", indent
, "");
1899 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1900 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1902 for (i
= 0; i
< set
->n
; ++i
) {
1903 fprintf(out
, "%*s", indent
, "");
1904 fprintf(out
, "basic set %d:\n", i
);
1905 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
1909 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
1914 fprintf(out
, "null map\n");
1918 fprintf(out
, "%*s", indent
, "");
1919 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1920 "flags: %x, n_name: %d\n",
1921 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1922 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1923 for (i
= 0; i
< map
->n
; ++i
) {
1924 fprintf(out
, "%*s", indent
, "");
1925 fprintf(out
, "basic map %d:\n", i
);
1926 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
1930 struct isl_basic_map
*isl_basic_map_intersect_domain(
1931 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1933 struct isl_basic_map
*bmap_domain
;
1938 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1939 bset
->dim
, isl_dim_param
), goto error
);
1941 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1942 isl_assert(bset
->ctx
,
1943 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1945 bmap
= isl_basic_map_cow(bmap
);
1948 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1949 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1950 bmap_domain
= isl_basic_map_from_domain(bset
);
1951 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1953 bmap
= isl_basic_map_simplify(bmap
);
1954 return isl_basic_map_finalize(bmap
);
1956 isl_basic_map_free(bmap
);
1957 isl_basic_set_free(bset
);
1961 struct isl_basic_map
*isl_basic_map_intersect_range(
1962 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1964 struct isl_basic_map
*bmap_range
;
1969 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1970 bset
->dim
, isl_dim_param
), goto error
);
1972 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1973 isl_assert(bset
->ctx
,
1974 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1976 bmap
= isl_basic_map_cow(bmap
);
1979 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1980 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1981 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1982 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1984 bmap
= isl_basic_map_simplify(bmap
);
1985 return isl_basic_map_finalize(bmap
);
1987 isl_basic_map_free(bmap
);
1988 isl_basic_set_free(bset
);
1992 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1998 total
= 1 + isl_basic_map_total_dim(bmap
);
1999 if (total
!= vec
->size
)
2004 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2005 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2006 if (!isl_int_is_zero(s
)) {
2012 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2013 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2014 if (isl_int_is_neg(s
)) {
2025 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2027 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2030 struct isl_basic_map
*isl_basic_map_intersect(
2031 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2033 struct isl_vec
*sample
= NULL
;
2035 if (!bmap1
|| !bmap2
)
2038 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2039 bmap2
->dim
, isl_dim_param
), goto error
);
2040 if (isl_dim_total(bmap1
->dim
) ==
2041 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2042 isl_dim_total(bmap2
->dim
) !=
2043 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2044 return isl_basic_map_intersect(bmap2
, bmap1
);
2046 if (isl_dim_total(bmap2
->dim
) !=
2047 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2048 isl_assert(bmap1
->ctx
,
2049 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2051 if (bmap1
->sample
&&
2052 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2053 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2054 sample
= isl_vec_copy(bmap1
->sample
);
2055 else if (bmap2
->sample
&&
2056 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2057 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2058 sample
= isl_vec_copy(bmap2
->sample
);
2060 bmap1
= isl_basic_map_cow(bmap1
);
2063 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2064 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2065 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2068 isl_vec_free(sample
);
2070 isl_vec_free(bmap1
->sample
);
2071 bmap1
->sample
= sample
;
2074 bmap1
= isl_basic_map_simplify(bmap1
);
2075 return isl_basic_map_finalize(bmap1
);
2078 isl_vec_free(sample
);
2079 isl_basic_map_free(bmap1
);
2080 isl_basic_map_free(bmap2
);
2084 struct isl_basic_set
*isl_basic_set_intersect(
2085 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2087 return (struct isl_basic_set
*)
2088 isl_basic_map_intersect(
2089 (struct isl_basic_map
*)bset1
,
2090 (struct isl_basic_map
*)bset2
);
2093 /* Special case of isl_map_intersect, where both map1 and map2
2094 * are convex, without any divs and such that either map1 or map2
2095 * contains a single constraint. This constraint is then simply
2096 * added to the other map.
2098 static __isl_give isl_map
*map_intersect_add_constraint(
2099 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2101 struct isl_basic_map
*bmap1
;
2102 struct isl_basic_map
*bmap2
;
2104 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2105 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2106 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2107 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2109 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2110 return isl_map_intersect(map2
, map1
);
2112 isl_assert(map2
->ctx
,
2113 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2115 map1
= isl_map_cow(map1
);
2118 if (isl_map_plain_is_empty(map1
)) {
2122 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2123 if (map2
->p
[0]->n_eq
== 1)
2124 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2126 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2127 map2
->p
[0]->ineq
[0]);
2129 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2130 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2134 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2135 isl_basic_map_free(map1
->p
[0]);
2148 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2151 struct isl_map
*result
;
2157 if (isl_map_plain_is_empty(map1
)) {
2161 if (isl_map_plain_is_empty(map2
)) {
2166 if (map1
->n
== 1 && map2
->n
== 1 &&
2167 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2168 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2169 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2170 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2171 return map_intersect_add_constraint(map1
, map2
);
2172 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2173 map2
->dim
, isl_dim_param
), goto error
);
2174 if (isl_dim_total(map1
->dim
) ==
2175 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2176 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2177 return isl_map_intersect(map2
, map1
);
2179 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2180 isl_assert(map1
->ctx
,
2181 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2183 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2184 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2185 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2187 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2188 map1
->n
* map2
->n
, flags
);
2191 for (i
= 0; i
< map1
->n
; ++i
)
2192 for (j
= 0; j
< map2
->n
; ++j
) {
2193 struct isl_basic_map
*part
;
2194 part
= isl_basic_map_intersect(
2195 isl_basic_map_copy(map1
->p
[i
]),
2196 isl_basic_map_copy(map2
->p
[j
]));
2197 if (isl_basic_map_is_empty(part
))
2198 isl_basic_map_free(part
);
2200 result
= isl_map_add_basic_map(result
, part
);
2213 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2215 return (struct isl_set
*)
2216 isl_map_intersect((struct isl_map
*)set1
,
2217 (struct isl_map
*)set2
);
2220 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2222 struct isl_dim
*dim
;
2223 struct isl_basic_set
*bset
;
2228 bmap
= isl_basic_map_cow(bmap
);
2231 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2232 in
= isl_basic_map_n_in(bmap
);
2233 bset
= isl_basic_set_from_basic_map(bmap
);
2234 bset
= isl_basic_set_swap_vars(bset
, in
);
2235 return isl_basic_map_from_basic_set(bset
, dim
);
2238 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2239 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2241 struct isl_dim
*res_dim
;
2242 struct isl_basic_map
*res
;
2243 struct isl_dim_map
*dim_map
;
2244 unsigned total
, off
;
2245 enum isl_dim_type t
;
2253 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2255 total
= isl_basic_map_total_dim(bmap
) + n
;
2256 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2258 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2260 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2262 unsigned size
= isl_basic_map_dim(bmap
, t
);
2263 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2265 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2266 pos
, size
- pos
, off
+ pos
+ n
);
2268 off
+= isl_dim_size(res_dim
, t
);
2270 isl_dim_map_div(dim_map
, bmap
, off
);
2272 res
= isl_basic_map_alloc_dim(res_dim
,
2273 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2274 if (isl_basic_map_is_rational(bmap
))
2275 res
= isl_basic_map_set_rational(res
);
2276 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2277 return isl_basic_map_finalize(res
);
2280 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2281 enum isl_dim_type type
, unsigned n
)
2285 return isl_basic_map_insert(bmap
, type
,
2286 isl_basic_map_dim(bmap
, type
), n
);
2289 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2290 enum isl_dim_type type
, unsigned n
)
2294 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2295 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2297 isl_basic_set_free(bset
);
2301 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2302 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2309 map
= isl_map_cow(map
);
2313 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2317 for (i
= 0; i
< map
->n
; ++i
) {
2318 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2329 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2330 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2332 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2335 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2336 enum isl_dim_type type
, unsigned n
)
2340 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2343 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2344 enum isl_dim_type type
, unsigned n
)
2348 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2349 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2355 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2356 __isl_take isl_basic_map
*bmap
,
2357 enum isl_dim_type dst_type
, unsigned dst_pos
,
2358 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2361 struct isl_dim_map
*dim_map
;
2362 struct isl_basic_map
*res
;
2363 enum isl_dim_type t
;
2364 unsigned total
, off
;
2371 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2374 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2377 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2379 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2380 pos(bmap
->dim
, src_type
) + src_pos
+
2381 ((src_type
< dst_type
) ? n
: 0)) {
2382 bmap
= isl_basic_map_cow(bmap
);
2386 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2387 src_type
, src_pos
, n
);
2391 bmap
= isl_basic_map_finalize(bmap
);
2396 total
= isl_basic_map_total_dim(bmap
);
2397 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2400 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2401 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2402 if (t
== dst_type
) {
2403 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2406 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2409 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2410 dst_pos
, size
- dst_pos
, off
);
2411 off
+= size
- dst_pos
;
2412 } else if (t
== src_type
) {
2413 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2416 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2417 src_pos
+ n
, size
- src_pos
- n
, off
);
2418 off
+= size
- src_pos
- n
;
2420 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2424 isl_dim_map_div(dim_map
, bmap
, off
);
2426 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2427 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2428 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2430 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2431 src_type
, src_pos
, n
);
2435 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2436 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2437 bmap
= isl_basic_map_finalize(bmap
);
2441 isl_basic_map_free(bmap
);
2445 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2446 enum isl_dim_type dst_type
, unsigned dst_pos
,
2447 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2449 return (isl_basic_set
*)isl_basic_map_move_dims(
2450 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2453 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2454 enum isl_dim_type dst_type
, unsigned dst_pos
,
2455 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2459 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2460 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2461 src_type
, src_pos
, n
);
2467 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2468 enum isl_dim_type dst_type
, unsigned dst_pos
,
2469 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2478 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2481 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2484 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2486 map
= isl_map_cow(map
);
2490 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2494 for (i
= 0; i
< map
->n
; ++i
) {
2495 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2497 src_type
, src_pos
, n
);
2508 /* Move the specified dimensions to the last columns right before
2509 * the divs. Don't change the dimension specification of bmap.
2510 * That's the responsibility of the caller.
2512 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2513 enum isl_dim_type type
, unsigned first
, unsigned n
)
2515 struct isl_dim_map
*dim_map
;
2516 struct isl_basic_map
*res
;
2517 enum isl_dim_type t
;
2518 unsigned total
, off
;
2522 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2525 total
= isl_basic_map_total_dim(bmap
);
2526 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2529 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2530 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2532 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2535 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2536 first
, n
, total
- bmap
->n_div
- n
);
2537 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2538 first
+ n
, size
- (first
+ n
), off
);
2539 off
+= size
- (first
+ n
);
2541 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2545 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2547 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2548 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2549 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2553 /* Turn the n dimensions of type type, starting at first
2554 * into existentially quantified variables.
2556 __isl_give isl_basic_map
*isl_basic_map_project_out(
2557 __isl_take isl_basic_map
*bmap
,
2558 enum isl_dim_type type
, unsigned first
, unsigned n
)
2571 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2572 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2574 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2577 bmap
= move_last(bmap
, type
, first
, n
);
2578 bmap
= isl_basic_map_cow(bmap
);
2582 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2583 old
= bmap
->block2
.data
;
2584 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2585 (bmap
->extra
+ n
) * (1 + row_size
));
2586 if (!bmap
->block2
.data
)
2588 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2591 for (i
= 0; i
< n
; ++i
) {
2592 new_div
[i
] = bmap
->block2
.data
+
2593 (bmap
->extra
+ i
) * (1 + row_size
);
2594 isl_seq_clr(new_div
[i
], 1 + row_size
);
2596 for (i
= 0; i
< bmap
->extra
; ++i
)
2597 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2599 bmap
->div
= new_div
;
2603 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2606 bmap
= isl_basic_map_simplify(bmap
);
2607 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2608 return isl_basic_map_finalize(bmap
);
2610 isl_basic_map_free(bmap
);
2614 /* Turn the n dimensions of type type, starting at first
2615 * into existentially quantified variables.
2617 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2618 enum isl_dim_type type
, unsigned first
, unsigned n
)
2620 return (isl_basic_set
*)isl_basic_map_project_out(
2621 (isl_basic_map
*)bset
, type
, first
, n
);
2624 /* Turn the n dimensions of type type, starting at first
2625 * into existentially quantified variables.
2627 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2628 enum isl_dim_type type
, unsigned first
, unsigned n
)
2638 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2640 map
= isl_map_cow(map
);
2644 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2648 for (i
= 0; i
< map
->n
; ++i
) {
2649 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2660 /* Turn the n dimensions of type type, starting at first
2661 * into existentially quantified variables.
2663 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2664 enum isl_dim_type type
, unsigned first
, unsigned n
)
2666 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2669 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2673 for (i
= 0; i
< n
; ++i
) {
2674 j
= isl_basic_map_alloc_div(bmap
);
2677 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2681 isl_basic_map_free(bmap
);
2685 struct isl_basic_map
*isl_basic_map_apply_range(
2686 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2688 struct isl_dim
*dim_result
= NULL
;
2689 struct isl_basic_map
*bmap
;
2690 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2691 struct isl_dim_map
*dim_map1
, *dim_map2
;
2693 if (!bmap1
|| !bmap2
)
2696 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2697 isl_dim_copy(bmap2
->dim
));
2699 n_in
= isl_basic_map_n_in(bmap1
);
2700 n_out
= isl_basic_map_n_out(bmap2
);
2701 n
= isl_basic_map_n_out(bmap1
);
2702 nparam
= isl_basic_map_n_param(bmap1
);
2704 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2705 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2706 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2707 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2708 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2709 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2710 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2711 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2712 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2713 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2714 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2716 bmap
= isl_basic_map_alloc_dim(dim_result
,
2717 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2718 bmap1
->n_eq
+ bmap2
->n_eq
,
2719 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2720 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2721 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2722 bmap
= add_divs(bmap
, n
);
2723 bmap
= isl_basic_map_simplify(bmap
);
2724 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2725 return isl_basic_map_finalize(bmap
);
2727 isl_basic_map_free(bmap1
);
2728 isl_basic_map_free(bmap2
);
2732 struct isl_basic_set
*isl_basic_set_apply(
2733 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2738 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2741 return (struct isl_basic_set
*)
2742 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2744 isl_basic_set_free(bset
);
2745 isl_basic_map_free(bmap
);
2749 struct isl_basic_map
*isl_basic_map_apply_domain(
2750 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2752 if (!bmap1
|| !bmap2
)
2755 isl_assert(bmap1
->ctx
,
2756 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2757 isl_assert(bmap1
->ctx
,
2758 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2761 bmap1
= isl_basic_map_reverse(bmap1
);
2762 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2763 return isl_basic_map_reverse(bmap1
);
2765 isl_basic_map_free(bmap1
);
2766 isl_basic_map_free(bmap2
);
2770 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2771 * A \cap B -> f(A) + f(B)
2773 struct isl_basic_map
*isl_basic_map_sum(
2774 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2776 unsigned n_in
, n_out
, nparam
, total
, pos
;
2777 struct isl_basic_map
*bmap
= NULL
;
2778 struct isl_dim_map
*dim_map1
, *dim_map2
;
2781 if (!bmap1
|| !bmap2
)
2784 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2787 nparam
= isl_basic_map_n_param(bmap1
);
2788 n_in
= isl_basic_map_n_in(bmap1
);
2789 n_out
= isl_basic_map_n_out(bmap1
);
2791 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2792 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2793 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2794 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2795 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2796 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2797 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2798 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2799 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2800 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2801 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2803 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2804 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2805 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2806 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2807 for (i
= 0; i
< n_out
; ++i
) {
2808 int j
= isl_basic_map_alloc_equality(bmap
);
2811 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2812 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2813 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2814 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2816 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2817 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2818 bmap
= add_divs(bmap
, 2 * n_out
);
2820 bmap
= isl_basic_map_simplify(bmap
);
2821 return isl_basic_map_finalize(bmap
);
2823 isl_basic_map_free(bmap
);
2824 isl_basic_map_free(bmap1
);
2825 isl_basic_map_free(bmap2
);
2829 /* Given two maps A -> f(A) and B -> g(B), construct a map
2830 * A \cap B -> f(A) + f(B)
2832 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2834 struct isl_map
*result
;
2840 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2842 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2843 map1
->n
* map2
->n
, 0);
2846 for (i
= 0; i
< map1
->n
; ++i
)
2847 for (j
= 0; j
< map2
->n
; ++j
) {
2848 struct isl_basic_map
*part
;
2849 part
= isl_basic_map_sum(
2850 isl_basic_map_copy(map1
->p
[i
]),
2851 isl_basic_map_copy(map2
->p
[j
]));
2852 if (isl_basic_map_is_empty(part
))
2853 isl_basic_map_free(part
);
2855 result
= isl_map_add_basic_map(result
, part
);
2868 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2869 __isl_take isl_set
*set2
)
2871 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2874 /* Given a basic map A -> f(A), construct A -> -f(A).
2876 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2881 bmap
= isl_basic_map_cow(bmap
);
2885 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2886 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2887 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2888 for (j
= 0; j
< n
; ++j
)
2889 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2890 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2891 for (j
= 0; j
< n
; ++j
)
2892 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2893 for (i
= 0; i
< bmap
->n_div
; ++i
)
2894 for (j
= 0; j
< n
; ++j
)
2895 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2896 return isl_basic_map_finalize(bmap
);
2899 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
2901 return isl_basic_map_neg(bset
);
2904 /* Given a map A -> f(A), construct A -> -f(A).
2906 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2910 map
= isl_map_cow(map
);
2914 for (i
= 0; i
< map
->n
; ++i
) {
2915 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2926 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2928 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2931 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2932 * A -> floor(f(A)/d).
2934 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2937 unsigned n_in
, n_out
, nparam
, total
, pos
;
2938 struct isl_basic_map
*result
= NULL
;
2939 struct isl_dim_map
*dim_map
;
2945 nparam
= isl_basic_map_n_param(bmap
);
2946 n_in
= isl_basic_map_n_in(bmap
);
2947 n_out
= isl_basic_map_n_out(bmap
);
2949 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2950 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2951 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2952 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2953 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2954 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2956 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2957 bmap
->n_div
+ n_out
,
2958 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2959 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
2960 result
= add_divs(result
, n_out
);
2961 for (i
= 0; i
< n_out
; ++i
) {
2963 j
= isl_basic_map_alloc_inequality(result
);
2966 isl_seq_clr(result
->ineq
[j
], 1+total
);
2967 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2968 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2969 j
= isl_basic_map_alloc_inequality(result
);
2972 isl_seq_clr(result
->ineq
[j
], 1+total
);
2973 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2974 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2975 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2978 result
= isl_basic_map_simplify(result
);
2979 return isl_basic_map_finalize(result
);
2981 isl_basic_map_free(result
);
2985 /* Given a map A -> f(A) and an integer d, construct a map
2986 * A -> floor(f(A)/d).
2988 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2992 map
= isl_map_cow(map
);
2996 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2997 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2998 for (i
= 0; i
< map
->n
; ++i
) {
2999 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3010 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3016 i
= isl_basic_map_alloc_equality(bmap
);
3019 nparam
= isl_basic_map_n_param(bmap
);
3020 n_in
= isl_basic_map_n_in(bmap
);
3021 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3022 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3023 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3024 return isl_basic_map_finalize(bmap
);
3026 isl_basic_map_free(bmap
);
3030 /* Add a constraints to "bmap" expressing i_pos < o_pos
3032 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3038 i
= isl_basic_map_alloc_inequality(bmap
);
3041 nparam
= isl_basic_map_n_param(bmap
);
3042 n_in
= isl_basic_map_n_in(bmap
);
3043 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3044 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3045 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3046 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3047 return isl_basic_map_finalize(bmap
);
3049 isl_basic_map_free(bmap
);
3053 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3055 static __isl_give isl_basic_map
*var_less_or_equal(
3056 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3062 i
= isl_basic_map_alloc_inequality(bmap
);
3065 nparam
= isl_basic_map_n_param(bmap
);
3066 n_in
= isl_basic_map_n_in(bmap
);
3067 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3068 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3069 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3070 return isl_basic_map_finalize(bmap
);
3072 isl_basic_map_free(bmap
);
3076 /* Add a constraints to "bmap" expressing i_pos > o_pos
3078 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3084 i
= isl_basic_map_alloc_inequality(bmap
);
3087 nparam
= isl_basic_map_n_param(bmap
);
3088 n_in
= isl_basic_map_n_in(bmap
);
3089 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3090 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3091 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3092 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3093 return isl_basic_map_finalize(bmap
);
3095 isl_basic_map_free(bmap
);
3099 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3101 static __isl_give isl_basic_map
*var_more_or_equal(
3102 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3108 i
= isl_basic_map_alloc_inequality(bmap
);
3111 nparam
= isl_basic_map_n_param(bmap
);
3112 n_in
= isl_basic_map_n_in(bmap
);
3113 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3114 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3115 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3116 return isl_basic_map_finalize(bmap
);
3118 isl_basic_map_free(bmap
);
3122 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3125 struct isl_basic_map
*bmap
;
3126 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3129 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3130 bmap
= var_equal(bmap
, i
);
3131 return isl_basic_map_finalize(bmap
);
3134 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3136 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3139 struct isl_basic_map
*bmap
;
3140 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3143 for (i
= 0; i
< pos
&& bmap
; ++i
)
3144 bmap
= var_equal(bmap
, i
);
3146 bmap
= var_less(bmap
, pos
);
3147 return isl_basic_map_finalize(bmap
);
3150 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3152 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3153 __isl_take isl_dim
*dim
, unsigned pos
)
3156 isl_basic_map
*bmap
;
3158 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3159 for (i
= 0; i
< pos
; ++i
)
3160 bmap
= var_equal(bmap
, i
);
3161 bmap
= var_less_or_equal(bmap
, pos
);
3162 return isl_basic_map_finalize(bmap
);
3165 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3167 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3170 struct isl_basic_map
*bmap
;
3171 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3174 for (i
= 0; i
< pos
&& bmap
; ++i
)
3175 bmap
= var_equal(bmap
, i
);
3177 bmap
= var_more(bmap
, pos
);
3178 return isl_basic_map_finalize(bmap
);
3181 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3183 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3184 __isl_take isl_dim
*dim
, unsigned pos
)
3187 isl_basic_map
*bmap
;
3189 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3190 for (i
= 0; i
< pos
; ++i
)
3191 bmap
= var_equal(bmap
, i
);
3192 bmap
= var_more_or_equal(bmap
, pos
);
3193 return isl_basic_map_finalize(bmap
);
3196 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3197 unsigned n
, int equal
)
3199 struct isl_map
*map
;
3202 if (n
== 0 && equal
)
3203 return isl_map_universe(dims
);
3205 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3207 for (i
= 0; i
+ 1 < n
; ++i
)
3208 map
= isl_map_add_basic_map(map
,
3209 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3212 map
= isl_map_add_basic_map(map
,
3213 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3215 map
= isl_map_add_basic_map(map
,
3216 isl_basic_map_less_at(dims
, n
- 1));
3223 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3227 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3230 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3232 return map_lex_lte_first(dim
, n
, 0);
3235 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3237 return map_lex_lte_first(dim
, n
, 1);
3240 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3242 return map_lex_lte(isl_dim_map_from_set(set_dim
), 0);
3245 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3247 return map_lex_lte(isl_dim_map_from_set(set_dim
), 1);
3250 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3251 unsigned n
, int equal
)
3253 struct isl_map
*map
;
3256 if (n
== 0 && equal
)
3257 return isl_map_universe(dims
);
3259 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3261 for (i
= 0; i
+ 1 < n
; ++i
)
3262 map
= isl_map_add_basic_map(map
,
3263 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3266 map
= isl_map_add_basic_map(map
,
3267 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3269 map
= isl_map_add_basic_map(map
,
3270 isl_basic_map_more_at(dims
, n
- 1));
3277 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3281 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3284 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3286 return map_lex_gte_first(dim
, n
, 0);
3289 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3291 return map_lex_gte_first(dim
, n
, 1);
3294 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3296 return map_lex_gte(isl_dim_map_from_set(set_dim
), 0);
3299 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3301 return map_lex_gte(isl_dim_map_from_set(set_dim
), 1);
3304 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3305 __isl_take isl_set
*set2
)
3308 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3309 map
= isl_map_intersect_domain(map
, set1
);
3310 map
= isl_map_intersect_range(map
, set2
);
3314 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3315 __isl_take isl_set
*set2
)
3318 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3319 map
= isl_map_intersect_domain(map
, set1
);
3320 map
= isl_map_intersect_range(map
, set2
);
3324 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3325 __isl_take isl_set
*set2
)
3328 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3329 map
= isl_map_intersect_domain(map
, set1
);
3330 map
= isl_map_intersect_range(map
, set2
);
3334 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3335 __isl_take isl_set
*set2
)
3338 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3339 map
= isl_map_intersect_domain(map
, set1
);
3340 map
= isl_map_intersect_range(map
, set2
);
3344 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3345 __isl_take isl_map
*map2
)
3348 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3349 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3350 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3354 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3355 __isl_take isl_map
*map2
)
3358 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3359 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3360 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3364 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3365 __isl_take isl_map
*map2
)
3368 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3369 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3370 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3374 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3375 __isl_take isl_map
*map2
)
3378 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3379 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3380 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3384 struct isl_basic_map
*isl_basic_map_from_basic_set(
3385 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3387 struct isl_basic_map
*bmap
;
3389 bset
= isl_basic_set_cow(bset
);
3393 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3394 isl_dim_free(bset
->dim
);
3395 bmap
= (struct isl_basic_map
*) bset
;
3397 return isl_basic_map_finalize(bmap
);
3399 isl_basic_set_free(bset
);
3404 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3408 if (bmap
->dim
->n_in
== 0)
3409 return (struct isl_basic_set
*)bmap
;
3410 bmap
= isl_basic_map_cow(bmap
);
3413 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3416 bmap
= isl_basic_map_finalize(bmap
);
3417 return (struct isl_basic_set
*)bmap
;
3419 isl_basic_map_free(bmap
);
3423 /* For a div d = floor(f/m), add the constraints
3426 * -(f-(n-1)) + m d >= 0
3428 * Note that the second constraint is the negation of
3432 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3433 unsigned pos
, isl_int
*div
)
3436 unsigned total
= isl_basic_map_total_dim(bmap
);
3438 i
= isl_basic_map_alloc_inequality(bmap
);
3441 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3442 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3444 j
= isl_basic_map_alloc_inequality(bmap
);
3447 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3448 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3449 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3453 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3454 unsigned pos
, isl_int
*div
)
3456 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3460 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3462 unsigned total
= isl_basic_map_total_dim(bmap
);
3463 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3465 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3469 struct isl_basic_set
*isl_basic_map_underlying_set(
3470 struct isl_basic_map
*bmap
)
3474 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3476 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3477 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3478 return (struct isl_basic_set
*)bmap
;
3479 bmap
= isl_basic_map_cow(bmap
);
3482 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3485 bmap
->extra
-= bmap
->n_div
;
3487 bmap
= isl_basic_map_finalize(bmap
);
3488 return (struct isl_basic_set
*)bmap
;
3493 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3494 __isl_take isl_basic_set
*bset
)
3496 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3499 struct isl_basic_map
*isl_basic_map_overlying_set(
3500 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3502 struct isl_basic_map
*bmap
;
3503 struct isl_ctx
*ctx
;
3510 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3511 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3512 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3514 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3515 isl_basic_map_free(like
);
3516 return (struct isl_basic_map
*)bset
;
3518 bset
= isl_basic_set_cow(bset
);
3521 total
= bset
->dim
->n_out
+ bset
->extra
;
3522 bmap
= (struct isl_basic_map
*)bset
;
3523 isl_dim_free(bmap
->dim
);
3524 bmap
->dim
= isl_dim_copy(like
->dim
);
3527 bmap
->n_div
= like
->n_div
;
3528 bmap
->extra
+= like
->n_div
;
3532 ltotal
= total
- bmap
->extra
+ like
->extra
;
3535 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3536 bmap
->extra
* (1 + 1 + total
));
3537 if (isl_blk_is_error(bmap
->block2
))
3539 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
3543 for (i
= 0; i
< bmap
->extra
; ++i
)
3544 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3545 for (i
= 0; i
< like
->n_div
; ++i
) {
3546 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3547 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3549 bmap
= isl_basic_map_extend_constraints(bmap
,
3550 0, 2 * like
->n_div
);
3551 for (i
= 0; i
< like
->n_div
; ++i
) {
3552 if (isl_int_is_zero(bmap
->div
[i
][0]))
3554 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3558 isl_basic_map_free(like
);
3559 bmap
= isl_basic_map_simplify(bmap
);
3560 bmap
= isl_basic_map_finalize(bmap
);
3563 isl_basic_map_free(like
);
3564 isl_basic_set_free(bset
);
3568 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3569 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3571 return (struct isl_basic_set
*)
3572 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3575 struct isl_set
*isl_set_from_underlying_set(
3576 struct isl_set
*set
, struct isl_basic_set
*like
)
3582 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3584 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3585 isl_basic_set_free(like
);
3588 set
= isl_set_cow(set
);
3591 for (i
= 0; i
< set
->n
; ++i
) {
3592 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3593 isl_basic_set_copy(like
));
3597 isl_dim_free(set
->dim
);
3598 set
->dim
= isl_dim_copy(like
->dim
);
3601 isl_basic_set_free(like
);
3604 isl_basic_set_free(like
);
3609 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3613 map
= isl_map_cow(map
);
3616 map
->dim
= isl_dim_cow(map
->dim
);
3620 for (i
= 1; i
< map
->n
; ++i
)
3621 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3623 for (i
= 0; i
< map
->n
; ++i
) {
3624 map
->p
[i
] = (struct isl_basic_map
*)
3625 isl_basic_map_underlying_set(map
->p
[i
]);
3630 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3632 isl_dim_free(map
->dim
);
3633 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3637 return (struct isl_set
*)map
;
3643 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3645 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3648 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3649 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3651 bmap
= isl_basic_map_cow(bmap
);
3655 isl_dim_free(bmap
->dim
);
3658 bmap
= isl_basic_map_finalize(bmap
);
3662 isl_basic_map_free(bmap
);
3667 __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3668 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3670 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3674 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3675 __isl_take isl_dim
*dim
)
3679 map
= isl_map_cow(map
);
3683 for (i
= 0; i
< map
->n
; ++i
) {
3684 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3689 isl_dim_free(map
->dim
);
3699 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3700 __isl_take isl_dim
*dim
)
3702 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3705 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3708 struct isl_basic_set
*domain
;
3714 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3716 n_in
= isl_basic_map_n_in(bmap
);
3717 n_out
= isl_basic_map_n_out(bmap
);
3718 domain
= isl_basic_set_from_basic_map(bmap
);
3719 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3721 domain
= isl_basic_set_reset_dim(domain
, dim
);
3726 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3728 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3731 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3732 __isl_take isl_basic_map
*bmap
)
3736 isl_basic_map
*domain
;
3737 isl_basic_set
*bset
;
3738 int nparam
, n_in
, n_out
;
3741 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3742 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3743 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3745 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3746 domain
= isl_basic_map_universe(dim
);
3748 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3749 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3750 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3752 total
= isl_basic_map_total_dim(bmap
);
3754 for (i
= 0; i
< n_in
; ++i
) {
3755 k
= isl_basic_map_alloc_equality(bmap
);
3758 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3759 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3760 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3763 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3764 return isl_basic_map_finalize(bmap
);
3766 isl_basic_map_free(bmap
);
3770 __isl_give isl_basic_map
*isl_basic_map_range_map(
3771 __isl_take isl_basic_map
*bmap
)
3775 isl_basic_map
*range
;
3776 isl_basic_set
*bset
;
3777 int nparam
, n_in
, n_out
;
3780 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3781 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3782 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3784 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3785 range
= isl_basic_map_universe(dim
);
3787 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3788 bmap
= isl_basic_map_apply_range(bmap
, range
);
3789 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3791 total
= isl_basic_map_total_dim(bmap
);
3793 for (i
= 0; i
< n_out
; ++i
) {
3794 k
= isl_basic_map_alloc_equality(bmap
);
3797 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3798 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3799 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3802 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3803 return isl_basic_map_finalize(bmap
);
3805 isl_basic_map_free(bmap
);
3809 struct isl_set
*isl_map_range(struct isl_map
*map
)
3812 struct isl_set
*set
;
3816 if (isl_map_dim(map
, isl_dim_in
) == 0 &&
3817 !isl_dim_is_named_or_nested(map
->dim
, isl_dim_in
))
3818 return (isl_set
*)map
;
3820 map
= isl_map_cow(map
);
3824 set
= (struct isl_set
*) map
;
3825 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3828 for (i
= 0; i
< map
->n
; ++i
) {
3829 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3833 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3834 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3841 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3844 isl_dim
*domain_dim
;
3846 map
= isl_map_cow(map
);
3850 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3851 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3852 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3855 for (i
= 0; i
< map
->n
; ++i
) {
3856 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3860 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3861 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3868 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3873 map
= isl_map_cow(map
);
3877 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3878 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3879 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3882 for (i
= 0; i
< map
->n
; ++i
) {
3883 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3887 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3888 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3895 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3898 struct isl_map
*map
= NULL
;
3900 set
= isl_set_cow(set
);
3903 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3904 map
= (struct isl_map
*)set
;
3905 for (i
= 0; i
< set
->n
; ++i
) {
3906 map
->p
[i
] = isl_basic_map_from_basic_set(
3907 set
->p
[i
], isl_dim_copy(dim
));
3911 isl_dim_free(map
->dim
);
3920 __isl_give isl_basic_map
*isl_basic_map_from_domain(
3921 __isl_take isl_basic_set
*bset
)
3923 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
3926 __isl_give isl_basic_map
*isl_basic_map_from_range(
3927 __isl_take isl_basic_set
*bset
)
3929 return (isl_basic_map
*)bset
;
3932 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3934 return (struct isl_map
*)set
;
3937 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3939 return isl_map_reverse(isl_map_from_range(set
));
3942 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
3943 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
3945 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain
),
3946 isl_basic_map_from_range(range
));
3949 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3950 __isl_take isl_set
*range
)
3952 return isl_map_apply_range(isl_map_from_domain(domain
),
3953 isl_map_from_range(range
));
3956 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3959 struct isl_set
*set
= NULL
;
3963 map
= isl_map_cow(map
);
3966 map
->dim
= isl_dim_as_set_dim(map
->dim
);
3969 set
= (struct isl_set
*)map
;
3970 for (i
= 0; i
< map
->n
; ++i
) {
3971 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3981 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3983 struct isl_map
*map
;
3987 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3988 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3989 sizeof(struct isl_map
) +
3990 (n
- 1) * sizeof(struct isl_basic_map
*));
3994 map
->ctx
= dim
->ctx
;
3995 isl_ctx_ref(map
->ctx
);
4007 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4008 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4011 struct isl_map
*map
;
4012 struct isl_dim
*dims
;
4014 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4018 map
= isl_map_alloc_dim(dims
, n
, flags
);
4022 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4024 struct isl_basic_map
*bmap
;
4025 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4026 bmap
= isl_basic_map_set_to_empty(bmap
);
4030 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4032 struct isl_basic_set
*bset
;
4033 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4034 bset
= isl_basic_set_set_to_empty(bset
);
4038 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4040 struct isl_basic_map
*bmap
;
4043 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4044 bmap
= isl_basic_map_set_to_empty(bmap
);
4048 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4050 struct isl_basic_map
*bmap
;
4053 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4054 bmap
= isl_basic_map_set_to_empty(bmap
);
4058 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4060 struct isl_basic_set
*bset
;
4063 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4064 bset
= isl_basic_set_set_to_empty(bset
);
4068 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4070 struct isl_basic_map
*bmap
;
4071 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4072 bmap
= isl_basic_map_finalize(bmap
);
4076 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4078 struct isl_basic_set
*bset
;
4079 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4080 bset
= isl_basic_set_finalize(bset
);
4084 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_dim
*dim
)
4087 unsigned total
= isl_dim_total(dim
);
4088 isl_basic_map
*bmap
;
4090 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, total
);
4091 for (i
= 0; i
< total
; ++i
) {
4092 int k
= isl_basic_map_alloc_inequality(bmap
);
4095 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4096 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4100 isl_basic_map_free(bmap
);
4104 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_dim
*dim
)
4106 return isl_basic_map_nat_universe(dim
);
4109 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_dim
*dim
)
4111 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4114 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_dim
*dim
)
4116 return isl_map_nat_universe(dim
);
4119 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4120 __isl_keep isl_basic_map
*model
)
4124 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4127 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4131 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4134 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4135 __isl_keep isl_set
*model
)
4139 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4142 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4144 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4147 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4151 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4154 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4158 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4161 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4163 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4166 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4170 return isl_set_empty(isl_dim_copy(model
->dim
));
4173 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4175 struct isl_map
*map
;
4178 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4179 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4183 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4185 struct isl_set
*set
;
4188 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4189 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4193 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4197 return isl_set_universe(isl_dim_copy(model
->dim
));
4200 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4203 struct isl_map
*dup
;
4207 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4208 for (i
= 0; i
< map
->n
; ++i
)
4209 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4213 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4214 __isl_take isl_basic_map
*bmap
)
4218 if (isl_basic_map_plain_is_empty(bmap
)) {
4219 isl_basic_map_free(bmap
);
4222 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4223 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4224 map
->p
[map
->n
] = bmap
;
4226 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4232 isl_basic_map_free(bmap
);
4236 void isl_map_free(struct isl_map
*map
)
4246 isl_ctx_deref(map
->ctx
);
4247 for (i
= 0; i
< map
->n
; ++i
)
4248 isl_basic_map_free(map
->p
[i
]);
4249 isl_dim_free(map
->dim
);
4253 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4254 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4258 base
= isl_map_cow(base
);
4262 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4265 for (i
= 0; i
< base
->n
; ++i
) {
4266 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4267 isl_dim_copy(base
->dim
), 0, 0, 0);
4277 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4278 unsigned nparam
, unsigned dim
)
4280 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4284 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4285 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4289 bmap
= isl_basic_map_cow(bmap
);
4290 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4291 j
= isl_basic_map_alloc_equality(bmap
);
4294 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4295 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4296 isl_int_set_si(bmap
->eq
[j
][0], value
);
4297 bmap
= isl_basic_map_simplify(bmap
);
4298 return isl_basic_map_finalize(bmap
);
4300 isl_basic_map_free(bmap
);
4304 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4305 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4309 bmap
= isl_basic_map_cow(bmap
);
4310 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4311 j
= isl_basic_map_alloc_equality(bmap
);
4314 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4315 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4316 isl_int_set(bmap
->eq
[j
][0], value
);
4317 bmap
= isl_basic_map_simplify(bmap
);
4318 return isl_basic_map_finalize(bmap
);
4320 isl_basic_map_free(bmap
);
4324 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4325 enum isl_dim_type type
, unsigned pos
, int value
)
4329 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4330 return isl_basic_map_fix_pos_si(bmap
,
4331 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4333 isl_basic_map_free(bmap
);
4337 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4338 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4342 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4343 return isl_basic_map_fix_pos(bmap
,
4344 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4346 isl_basic_map_free(bmap
);
4350 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4351 enum isl_dim_type type
, unsigned pos
, int value
)
4353 return (struct isl_basic_set
*)
4354 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4358 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4359 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4361 return (struct isl_basic_set
*)
4362 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4366 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4367 unsigned input
, int value
)
4369 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4372 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4373 unsigned dim
, int value
)
4375 return (struct isl_basic_set
*)
4376 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4377 isl_dim_set
, dim
, value
);
4380 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4381 enum isl_dim_type type
, unsigned pos
, int value
)
4385 map
= isl_map_cow(map
);
4389 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4390 for (i
= 0; i
< map
->n
; ++i
) {
4391 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4395 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4402 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4403 enum isl_dim_type type
, unsigned pos
, int value
)
4405 return (struct isl_set
*)
4406 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4409 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4410 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4414 map
= isl_map_cow(map
);
4418 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4419 for (i
= 0; i
< map
->n
; ++i
) {
4420 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4424 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4431 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4432 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4434 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4437 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4438 unsigned input
, int value
)
4440 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4443 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4445 return (struct isl_set
*)
4446 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4449 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4450 __isl_take isl_basic_map
*bmap
,
4451 enum isl_dim_type type
, unsigned pos
, int value
)
4457 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4458 pos
+= isl_basic_map_offset(bmap
, type
);
4459 bmap
= isl_basic_map_cow(bmap
);
4460 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4461 j
= isl_basic_map_alloc_inequality(bmap
);
4464 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4465 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4466 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4467 bmap
= isl_basic_map_simplify(bmap
);
4468 return isl_basic_map_finalize(bmap
);
4470 isl_basic_map_free(bmap
);
4474 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4475 unsigned dim
, isl_int value
)
4479 bset
= isl_basic_set_cow(bset
);
4480 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4481 j
= isl_basic_set_alloc_inequality(bset
);
4484 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4485 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4486 isl_int_neg(bset
->ineq
[j
][0], value
);
4487 bset
= isl_basic_set_simplify(bset
);
4488 return isl_basic_set_finalize(bset
);
4490 isl_basic_set_free(bset
);
4494 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4495 enum isl_dim_type type
, unsigned pos
, int value
)
4499 map
= isl_map_cow(map
);
4503 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4504 for (i
= 0; i
< map
->n
; ++i
) {
4505 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4510 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4517 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4518 enum isl_dim_type type
, unsigned pos
, int value
)
4520 return (struct isl_set
*)
4521 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4524 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4529 set
= isl_set_cow(set
);
4533 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4534 for (i
= 0; i
< set
->n
; ++i
) {
4535 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4545 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4549 map
= isl_map_cow(map
);
4553 map
->dim
= isl_dim_reverse(map
->dim
);
4556 for (i
= 0; i
< map
->n
; ++i
) {
4557 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4561 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4568 static struct isl_map
*isl_basic_map_partial_lexopt(
4569 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4570 struct isl_set
**empty
, int max
)
4574 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4575 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4577 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4579 isl_basic_map_free(bmap
);
4580 isl_basic_set_free(dom
);
4586 struct isl_map
*isl_basic_map_partial_lexmax(
4587 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4588 struct isl_set
**empty
)
4590 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4593 struct isl_map
*isl_basic_map_partial_lexmin(
4594 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4595 struct isl_set
**empty
)
4597 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4600 struct isl_set
*isl_basic_set_partial_lexmin(
4601 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4602 struct isl_set
**empty
)
4604 return (struct isl_set
*)
4605 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4609 struct isl_set
*isl_basic_set_partial_lexmax(
4610 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4611 struct isl_set
**empty
)
4613 return (struct isl_set
*)
4614 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4618 /* Given a basic map "bmap", compute the lexicographically minimal
4619 * (or maximal) image element for each domain element in dom.
4620 * Set *empty to those elements in dom that do not have an image element.
4622 * We first make sure the basic sets in dom are disjoint and then
4623 * simply collect the results over each of the basic sets separately.
4624 * We could probably improve the efficiency a bit by moving the union
4625 * domain down into the parametric integer programming.
4627 static __isl_give isl_map
*basic_map_partial_lexopt(
4628 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4629 __isl_give isl_set
**empty
, int max
)
4632 struct isl_map
*res
;
4634 dom
= isl_set_make_disjoint(dom
);
4638 if (isl_set_plain_is_empty(dom
)) {
4639 res
= isl_map_empty_like_basic_map(bmap
);
4640 *empty
= isl_set_empty_like(dom
);
4642 isl_basic_map_free(bmap
);
4646 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4647 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4649 for (i
= 1; i
< dom
->n
; ++i
) {
4650 struct isl_map
*res_i
;
4651 struct isl_set
*empty_i
;
4653 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4654 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4656 res
= isl_map_union_disjoint(res
, res_i
);
4657 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4661 isl_basic_map_free(bmap
);
4666 isl_basic_map_free(bmap
);
4670 /* Given a map "map", compute the lexicographically minimal
4671 * (or maximal) image element for each domain element in dom.
4672 * Set *empty to those elements in dom that do not have an image element.
4674 * We first compute the lexicographically minimal or maximal element
4675 * in the first basic map. This results in a partial solution "res"
4676 * and a subset "todo" of dom that still need to be handled.
4677 * We then consider each of the remaining maps in "map" and successively
4678 * improve both "res" and "todo".
4680 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4681 * Assume we are computing the lexicographical maximum.
4682 * We first compute the lexicographically maximal element in basic map i.
4683 * This results in a partial solution res_i and a subset todo_i.
4684 * Then we combine these results with those obtain for the first k basic maps
4685 * to obtain a result that is valid for the first k+1 basic maps.
4686 * In particular, the set where there is no solution is the set where
4687 * there is no solution for the first k basic maps and also no solution
4688 * for the ith basic map, i.e.,
4690 * todo^i = todo^k * todo_i
4692 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4693 * solutions, arbitrarily breaking ties in favor of res^k.
4694 * That is, when res^k(a) >= res_i(a), we pick res^k and
4695 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4696 * the lexicographic order.)
4697 * In practice, we compute
4699 * res^k * (res_i . "<=")
4703 * res_i * (res^k . "<")
4705 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4706 * where only one of res^k and res_i provides a solution and we simply pick
4713 * Note that we only compute these intersections when dom(res^k) intersects
4714 * dom(res_i). Otherwise, the only effect of these intersections is to
4715 * potentially break up res^k and res_i into smaller pieces.
4716 * We want to avoid such splintering as much as possible.
4717 * In fact, an earlier implementation of this function would look for
4718 * better results in the domain of res^k and for extra results in todo^k,
4719 * but this would always result in a splintering according to todo^k,
4720 * even when the domain of basic map i is disjoint from the domains of
4721 * the previous basic maps.
4723 static __isl_give isl_map
*isl_map_partial_lexopt(
4724 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4725 __isl_give isl_set
**empty
, int max
)
4728 struct isl_map
*res
;
4729 struct isl_set
*todo
;
4734 if (isl_map_plain_is_empty(map
)) {
4742 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4743 isl_set_copy(dom
), &todo
, max
);
4745 for (i
= 1; i
< map
->n
; ++i
) {
4749 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
4751 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4752 isl_set_copy(dom
), &todo_i
, max
);
4755 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
4756 le
= isl_map_lex_le(dim
);
4758 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
4759 le
= isl_map_lex_ge(dim
);
4761 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4762 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
4763 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
4764 le
= isl_map_intersect(le
, isl_map_copy(res
));
4766 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
4767 res
= isl_map_intersect_domain(res
,
4768 isl_set_copy(todo_i
));
4769 res_i
= isl_map_intersect_domain(res_i
,
4770 isl_set_copy(todo
));
4773 res
= isl_map_union_disjoint(res
, res_i
);
4774 res
= isl_map_union_disjoint(res
, lt
);
4775 res
= isl_map_union_disjoint(res
, le
);
4777 todo
= isl_set_intersect(todo
, todo_i
);
4797 __isl_give isl_map
*isl_map_partial_lexmax(
4798 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4799 __isl_give isl_set
**empty
)
4801 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4804 __isl_give isl_map
*isl_map_partial_lexmin(
4805 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4806 __isl_give isl_set
**empty
)
4808 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4811 __isl_give isl_set
*isl_set_partial_lexmin(
4812 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4813 __isl_give isl_set
**empty
)
4815 return (struct isl_set
*)
4816 isl_map_partial_lexmin((struct isl_map
*)set
,
4820 __isl_give isl_set
*isl_set_partial_lexmax(
4821 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4822 __isl_give isl_set
**empty
)
4824 return (struct isl_set
*)
4825 isl_map_partial_lexmax((struct isl_map
*)set
,
4829 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4831 struct isl_basic_set
*dom
= NULL
;
4832 struct isl_dim
*dom_dim
;
4836 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4837 dom
= isl_basic_set_universe(dom_dim
);
4838 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4840 isl_basic_map_free(bmap
);
4844 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4846 return isl_basic_map_lexopt(bmap
, 0);
4849 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4851 return isl_basic_map_lexopt(bmap
, 1);
4854 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4856 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4859 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4861 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4864 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4866 struct isl_set
*dom
= NULL
;
4867 struct isl_dim
*dom_dim
;
4871 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4872 dom
= isl_set_universe(dom_dim
);
4873 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4879 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4881 return isl_map_lexopt(map
, 0);
4884 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4886 return isl_map_lexopt(map
, 1);
4889 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4891 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4894 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4896 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4899 /* Apply a preimage specified by "mat" on the parameters of "bset".
4900 * bset is assumed to have only parameters and divs.
4902 static struct isl_basic_set
*basic_set_parameter_preimage(
4903 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4910 bset
->dim
= isl_dim_cow(bset
->dim
);
4914 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4916 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4918 bset
->dim
->nparam
= 0;
4919 bset
->dim
->n_out
= nparam
;
4920 bset
= isl_basic_set_preimage(bset
, mat
);
4922 bset
->dim
->nparam
= bset
->dim
->n_out
;
4923 bset
->dim
->n_out
= 0;
4928 isl_basic_set_free(bset
);
4932 /* Apply a preimage specified by "mat" on the parameters of "set".
4933 * set is assumed to have only parameters and divs.
4935 static struct isl_set
*set_parameter_preimage(
4936 struct isl_set
*set
, struct isl_mat
*mat
)
4938 struct isl_dim
*dim
= NULL
;
4944 dim
= isl_dim_copy(set
->dim
);
4945 dim
= isl_dim_cow(dim
);
4949 nparam
= isl_set_dim(set
, isl_dim_param
);
4951 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4954 dim
->n_out
= nparam
;
4955 isl_set_reset_dim(set
, dim
);
4956 set
= isl_set_preimage(set
, mat
);
4959 dim
= isl_dim_copy(set
->dim
);
4960 dim
= isl_dim_cow(dim
);
4963 dim
->nparam
= dim
->n_out
;
4965 isl_set_reset_dim(set
, dim
);
4975 /* Intersect the basic set "bset" with the affine space specified by the
4976 * equalities in "eq".
4978 static struct isl_basic_set
*basic_set_append_equalities(
4979 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4987 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4992 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4993 for (i
= 0; i
< eq
->n_row
; ++i
) {
4994 k
= isl_basic_set_alloc_equality(bset
);
4997 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4998 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5002 bset
= isl_basic_set_gauss(bset
, NULL
);
5003 bset
= isl_basic_set_finalize(bset
);
5008 isl_basic_set_free(bset
);
5012 /* Intersect the set "set" with the affine space specified by the
5013 * equalities in "eq".
5015 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5023 for (i
= 0; i
< set
->n
; ++i
) {
5024 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5037 /* Project the given basic set onto its parameter domain, possibly introducing
5038 * new, explicit, existential variables in the constraints.
5039 * The input has parameters and (possibly implicit) existential variables.
5040 * The output has the same parameters, but only
5041 * explicit existentially quantified variables.
5043 * The actual projection is performed by pip, but pip doesn't seem
5044 * to like equalities very much, so we first remove the equalities
5045 * among the parameters by performing a variable compression on
5046 * the parameters. Afterward, an inverse transformation is performed
5047 * and the equalities among the parameters are inserted back in.
5049 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5053 struct isl_mat
*T
, *T2
;
5054 struct isl_set
*set
;
5055 unsigned nparam
, n_div
;
5057 bset
= isl_basic_set_cow(bset
);
5061 if (bset
->n_eq
== 0)
5062 return isl_basic_set_lexmin(bset
);
5064 isl_basic_set_gauss(bset
, NULL
);
5066 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5067 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5069 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5070 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5073 if (i
== bset
->n_eq
)
5074 return isl_basic_set_lexmin(bset
);
5076 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5078 eq
= isl_mat_cow(eq
);
5079 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5080 if (T
&& T
->n_col
== 0) {
5084 bset
= isl_basic_set_set_to_empty(bset
);
5085 return isl_set_from_basic_set(bset
);
5087 bset
= basic_set_parameter_preimage(bset
, T
);
5089 set
= isl_basic_set_lexmin(bset
);
5090 set
= set_parameter_preimage(set
, T2
);
5091 set
= set_append_equalities(set
, eq
);
5095 /* Compute an explicit representation for all the existentially
5096 * quantified variables.
5097 * The input and output dimensions are first turned into parameters.
5098 * compute_divs then returns a map with the same parameters and
5099 * no input or output dimensions and the dimension specification
5100 * is reset to that of the input.
5102 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5104 struct isl_basic_set
*bset
;
5105 struct isl_set
*set
;
5106 struct isl_map
*map
;
5107 struct isl_dim
*dim
, *orig_dim
= NULL
;
5112 bmap
= isl_basic_map_cow(bmap
);
5116 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5117 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5118 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5119 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5123 orig_dim
= bmap
->dim
;
5125 bset
= (struct isl_basic_set
*)bmap
;
5127 set
= parameter_compute_divs(bset
);
5128 map
= (struct isl_map
*)set
;
5129 map
= isl_map_reset_dim(map
, orig_dim
);
5133 isl_basic_map_free(bmap
);
5137 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5145 off
= isl_dim_total(bmap
->dim
);
5146 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5147 if (isl_int_is_zero(bmap
->div
[i
][0]))
5149 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5155 static int map_divs_known(__isl_keep isl_map
*map
)
5162 for (i
= 0; i
< map
->n
; ++i
) {
5163 int known
= basic_map_divs_known(map
->p
[i
]);
5171 /* If bmap contains any unknown divs, then compute explicit
5172 * expressions for them. However, this computation may be
5173 * quite expensive, so first try to remove divs that aren't
5176 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5180 struct isl_map
*map
;
5182 known
= basic_map_divs_known(bmap
);
5186 return isl_map_from_basic_map(bmap
);
5188 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5190 known
= basic_map_divs_known(bmap
);
5194 return isl_map_from_basic_map(bmap
);
5196 map
= compute_divs(bmap
);
5199 isl_basic_map_free(bmap
);
5203 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5207 struct isl_map
*res
;
5214 known
= map_divs_known(map
);
5222 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5223 for (i
= 1 ; i
< map
->n
; ++i
) {
5225 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5226 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5227 res
= isl_map_union_disjoint(res
, r2
);
5229 res
= isl_map_union(res
, r2
);
5236 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5238 return (struct isl_set
*)
5239 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5242 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5244 return (struct isl_set
*)
5245 isl_map_compute_divs((struct isl_map
*)set
);
5248 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5251 struct isl_set
*set
;
5256 map
= isl_map_cow(map
);
5260 set
= (struct isl_set
*)map
;
5261 set
->dim
= isl_dim_domain(set
->dim
);
5264 for (i
= 0; i
< map
->n
; ++i
) {
5265 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5269 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5270 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5277 struct isl_map
*isl_map_union_disjoint(
5278 struct isl_map
*map1
, struct isl_map
*map2
)
5282 struct isl_map
*map
= NULL
;
5296 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5298 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5299 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5300 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5302 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5303 map1
->n
+ map2
->n
, flags
);
5306 for (i
= 0; i
< map1
->n
; ++i
) {
5307 map
= isl_map_add_basic_map(map
,
5308 isl_basic_map_copy(map1
->p
[i
]));
5312 for (i
= 0; i
< map2
->n
; ++i
) {
5313 map
= isl_map_add_basic_map(map
,
5314 isl_basic_map_copy(map2
->p
[i
]));
5328 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5330 map1
= isl_map_union_disjoint(map1
, map2
);
5334 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5338 struct isl_set
*isl_set_union_disjoint(
5339 struct isl_set
*set1
, struct isl_set
*set2
)
5341 return (struct isl_set
*)
5342 isl_map_union_disjoint(
5343 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5346 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5348 return (struct isl_set
*)
5349 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5352 struct isl_map
*isl_map_intersect_range(
5353 struct isl_map
*map
, struct isl_set
*set
)
5356 struct isl_map
*result
;
5362 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5363 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5364 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5366 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5367 map
->n
* set
->n
, flags
);
5370 for (i
= 0; i
< map
->n
; ++i
)
5371 for (j
= 0; j
< set
->n
; ++j
) {
5372 result
= isl_map_add_basic_map(result
,
5373 isl_basic_map_intersect_range(
5374 isl_basic_map_copy(map
->p
[i
]),
5375 isl_basic_set_copy(set
->p
[j
])));
5388 struct isl_map
*isl_map_intersect_domain(
5389 struct isl_map
*map
, struct isl_set
*set
)
5391 return isl_map_reverse(
5392 isl_map_intersect_range(isl_map_reverse(map
), set
));
5395 struct isl_map
*isl_map_apply_domain(
5396 struct isl_map
*map1
, struct isl_map
*map2
)
5400 map1
= isl_map_reverse(map1
);
5401 map1
= isl_map_apply_range(map1
, map2
);
5402 return isl_map_reverse(map1
);
5409 struct isl_map
*isl_map_apply_range(
5410 struct isl_map
*map1
, struct isl_map
*map2
)
5412 struct isl_dim
*dim_result
;
5413 struct isl_map
*result
;
5419 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5420 isl_dim_copy(map2
->dim
));
5422 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5425 for (i
= 0; i
< map1
->n
; ++i
)
5426 for (j
= 0; j
< map2
->n
; ++j
) {
5427 result
= isl_map_add_basic_map(result
,
5428 isl_basic_map_apply_range(
5429 isl_basic_map_copy(map1
->p
[i
]),
5430 isl_basic_map_copy(map2
->p
[j
])));
5436 if (result
&& result
->n
<= 1)
5437 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5446 * returns range - domain
5448 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5450 isl_dim
*dims
, *target_dim
;
5451 struct isl_basic_set
*bset
;
5458 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5459 bmap
->dim
, isl_dim_out
),
5461 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5462 dim
= isl_basic_map_n_in(bmap
);
5463 nparam
= isl_basic_map_n_param(bmap
);
5464 bset
= isl_basic_set_from_basic_map(bmap
);
5465 bset
= isl_basic_set_cow(bset
);
5466 dims
= isl_basic_set_get_dim(bset
);
5467 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5468 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5469 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5470 for (i
= 0; i
< dim
; ++i
) {
5471 int j
= isl_basic_map_alloc_equality(
5472 (struct isl_basic_map
*)bset
);
5475 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5476 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5477 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5478 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5480 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5481 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5484 isl_basic_map_free(bmap
);
5489 * returns range - domain
5491 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5495 struct isl_set
*result
;
5500 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5501 map
->dim
, isl_dim_out
),
5503 dim
= isl_map_get_dim(map
);
5504 dim
= isl_dim_domain(dim
);
5505 result
= isl_set_alloc_dim(dim
, map
->n
, 0);
5508 for (i
= 0; i
< map
->n
; ++i
)
5509 result
= isl_set_add_basic_set(result
,
5510 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5519 * returns [domain -> range] -> range - domain
5521 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
5522 __isl_take isl_basic_map
*bmap
)
5526 isl_basic_map
*domain
;
5527 isl_basic_set
*bset
;
5531 if (!isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
5532 isl_die(bmap
->ctx
, isl_error_invalid
,
5533 "domain and range don't match", goto error
);
5535 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5536 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
5538 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
5539 domain
= isl_basic_map_universe(dim
);
5541 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5542 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5543 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
5545 total
= isl_basic_map_total_dim(bmap
);
5547 for (i
= 0; i
< n
; ++i
) {
5548 k
= isl_basic_map_alloc_equality(bmap
);
5551 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5552 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
5553 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
5554 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
5557 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5558 return isl_basic_map_finalize(bmap
);
5560 isl_basic_map_free(bmap
);
5565 * returns [domain -> range] -> range - domain
5567 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
5570 isl_dim
*domain_dim
;
5575 if (!isl_dim_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
5576 isl_die(map
->ctx
, isl_error_invalid
,
5577 "domain and range don't match", goto error
);
5579 map
= isl_map_cow(map
);
5583 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
5584 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
5585 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
5588 for (i
= 0; i
< map
->n
; ++i
) {
5589 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
5593 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5600 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5602 struct isl_basic_map
*bmap
;
5610 nparam
= dims
->nparam
;
5612 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5616 for (i
= 0; i
< dim
; ++i
) {
5617 int j
= isl_basic_map_alloc_equality(bmap
);
5620 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5621 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5622 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5624 return isl_basic_map_finalize(bmap
);
5626 isl_basic_map_free(bmap
);
5630 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_dim
*dim
)
5634 if (dim
->n_in
!= dim
->n_out
)
5635 isl_die(dim
->ctx
, isl_error_invalid
,
5636 "number of input and output dimensions needs to be "
5637 "the same", goto error
);
5638 return basic_map_identity(dim
);
5644 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5646 if (!model
|| !model
->dim
)
5648 return isl_basic_map_identity(isl_dim_copy(model
->dim
));
5651 __isl_give isl_map
*isl_map_identity(__isl_take isl_dim
*dim
)
5653 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
5656 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5658 if (!model
|| !model
->dim
)
5660 return isl_map_identity(isl_dim_copy(model
->dim
));
5663 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5665 if (!model
|| !model
->dim
)
5667 return isl_map_identity(isl_dim_copy(model
->dim
));
5670 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5672 isl_dim
*dim
= isl_set_get_dim(set
);
5674 id
= isl_map_identity(isl_dim_map_from_set(dim
));
5675 return isl_map_intersect_range(id
, set
);
5678 /* Construct a basic set with all set dimensions having only non-negative
5681 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5686 struct isl_basic_set
*bset
;
5690 nparam
= dims
->nparam
;
5692 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5695 for (i
= 0; i
< dim
; ++i
) {
5696 int k
= isl_basic_set_alloc_inequality(bset
);
5699 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5700 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5704 isl_basic_set_free(bset
);
5708 /* Construct the half-space x_pos >= 0.
5710 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
5714 isl_basic_set
*nonneg
;
5716 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5717 k
= isl_basic_set_alloc_inequality(nonneg
);
5720 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5721 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
5723 return isl_basic_set_finalize(nonneg
);
5725 isl_basic_set_free(nonneg
);
5729 /* Construct the half-space x_pos <= -1.
5731 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
5736 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5737 k
= isl_basic_set_alloc_inequality(neg
);
5740 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5741 isl_int_set_si(neg
->ineq
[k
][0], -1);
5742 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
5744 return isl_basic_set_finalize(neg
);
5746 isl_basic_set_free(neg
);
5750 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5751 enum isl_dim_type type
, unsigned first
, unsigned n
)
5754 isl_basic_set
*nonneg
;
5762 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5764 for (i
= 0; i
< n
; ++i
) {
5765 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
5766 pos(set
->dim
, type
) + first
+ i
);
5767 neg
= neg_halfspace(isl_set_get_dim(set
),
5768 pos(set
->dim
, type
) + first
+ i
);
5770 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5779 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
5780 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5787 if (isl_set_plain_is_empty(set
)) {
5792 return fn(set
, signs
, user
);
5795 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
5797 half
= isl_set_intersect(half
, isl_set_copy(set
));
5798 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
5802 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
5804 half
= isl_set_intersect(half
, set
);
5805 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
5811 /* Call "fn" on the intersections of "set" with each of the orthants
5812 * (except for obviously empty intersections). The orthant is identified
5813 * by the signs array, with each entry having value 1 or -1 according
5814 * to the sign of the corresponding variable.
5816 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
5817 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5827 if (isl_set_plain_is_empty(set
))
5830 nparam
= isl_set_dim(set
, isl_dim_param
);
5831 nvar
= isl_set_dim(set
, isl_dim_set
);
5833 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
5835 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
5843 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5845 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5848 int isl_basic_map_is_subset(
5849 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5852 struct isl_map
*map1
;
5853 struct isl_map
*map2
;
5855 if (!bmap1
|| !bmap2
)
5858 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5859 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5861 is_subset
= isl_map_is_subset(map1
, map2
);
5869 int isl_basic_map_is_equal(
5870 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5874 if (!bmap1
|| !bmap2
)
5876 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5879 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5883 int isl_basic_set_is_equal(
5884 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5886 return isl_basic_map_is_equal(
5887 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5890 int isl_map_is_empty(struct isl_map
*map
)
5897 for (i
= 0; i
< map
->n
; ++i
) {
5898 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5907 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
5909 return map
? map
->n
== 0 : -1;
5912 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
5914 return isl_map_plain_is_empty(map
);
5917 int isl_set_plain_is_empty(struct isl_set
*set
)
5919 return set
? set
->n
== 0 : -1;
5922 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
5924 return isl_set_plain_is_empty(set
);
5927 int isl_set_is_empty(struct isl_set
*set
)
5929 return isl_map_is_empty((struct isl_map
*)set
);
5932 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5937 return isl_dim_equal(map1
->dim
, map2
->dim
);
5940 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5945 return isl_dim_equal(set1
->dim
, set2
->dim
);
5948 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5954 is_subset
= isl_map_is_subset(map1
, map2
);
5957 is_subset
= isl_map_is_subset(map2
, map1
);
5961 int isl_basic_map_is_strict_subset(
5962 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5966 if (!bmap1
|| !bmap2
)
5968 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5971 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5972 if (is_subset
== -1)
5977 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5983 is_subset
= isl_map_is_subset(map1
, map2
);
5986 is_subset
= isl_map_is_subset(map2
, map1
);
5987 if (is_subset
== -1)
5992 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5994 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5997 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6001 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6004 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6008 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6011 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
6018 for (i
= 0; i
< map
->n
; ++i
) {
6019 int r
= isl_basic_map_is_universe(map
->p
[i
]);
6027 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
6029 return isl_map_plain_is_universe((isl_map
*) set
);
6032 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6034 return isl_set_plain_is_universe(set
);
6037 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6039 struct isl_basic_set
*bset
= NULL
;
6040 struct isl_vec
*sample
= NULL
;
6047 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6050 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6051 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6052 copy
= isl_basic_map_remove_redundancies(copy
);
6053 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6054 isl_basic_map_free(copy
);
6058 total
= 1 + isl_basic_map_total_dim(bmap
);
6059 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6060 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6066 isl_vec_free(bmap
->sample
);
6067 bmap
->sample
= NULL
;
6068 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6071 sample
= isl_basic_set_sample_vec(bset
);
6074 empty
= sample
->size
== 0;
6075 isl_vec_free(bmap
->sample
);
6076 bmap
->sample
= sample
;
6078 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6083 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
6087 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6090 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
6092 return isl_basic_map_plain_is_empty(bmap
);
6095 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
6099 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6102 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
6104 return isl_basic_set_plain_is_empty(bset
);
6107 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6109 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6112 struct isl_map
*isl_basic_map_union(
6113 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6115 struct isl_map
*map
;
6116 if (!bmap1
|| !bmap2
)
6119 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6121 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6124 map
= isl_map_add_basic_map(map
, bmap1
);
6125 map
= isl_map_add_basic_map(map
, bmap2
);
6128 isl_basic_map_free(bmap1
);
6129 isl_basic_map_free(bmap2
);
6133 struct isl_set
*isl_basic_set_union(
6134 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6136 return (struct isl_set
*)isl_basic_map_union(
6137 (struct isl_basic_map
*)bset1
,
6138 (struct isl_basic_map
*)bset2
);
6141 /* Order divs such that any div only depends on previous divs */
6142 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6150 off
= isl_dim_total(bmap
->dim
);
6152 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6154 if (isl_int_is_zero(bmap
->div
[i
][0]))
6156 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6160 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6166 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6168 return (struct isl_basic_set
*)
6169 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6172 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6179 for (i
= 0; i
< map
->n
; ++i
) {
6180 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6191 /* Look for a div in dst that corresponds to the div "div" in src.
6192 * The divs before "div" in src and dst are assumed to be the same.
6194 * Returns -1 if no corresponding div was found and the position
6195 * of the corresponding div in dst otherwise.
6197 static int find_div(struct isl_basic_map
*dst
,
6198 struct isl_basic_map
*src
, unsigned div
)
6202 unsigned total
= isl_dim_total(src
->dim
);
6204 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6205 for (i
= div
; i
< dst
->n_div
; ++i
)
6206 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6207 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6208 dst
->n_div
- div
) == -1)
6213 struct isl_basic_map
*isl_basic_map_align_divs(
6214 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6217 unsigned total
= isl_dim_total(src
->dim
);
6222 if (src
->n_div
== 0)
6225 for (i
= 0; i
< src
->n_div
; ++i
)
6226 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6228 src
= isl_basic_map_order_divs(src
);
6229 dst
= isl_basic_map_cow(dst
);
6230 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6231 src
->n_div
, 0, 2 * src
->n_div
);
6234 for (i
= 0; i
< src
->n_div
; ++i
) {
6235 int j
= find_div(dst
, src
, i
);
6237 j
= isl_basic_map_alloc_div(dst
);
6240 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6241 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6242 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6246 isl_basic_map_swap_div(dst
, i
, j
);
6250 isl_basic_map_free(dst
);
6254 struct isl_basic_set
*isl_basic_set_align_divs(
6255 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6257 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6258 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6261 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6269 map
= isl_map_compute_divs(map
);
6270 map
= isl_map_cow(map
);
6274 for (i
= 1; i
< map
->n
; ++i
)
6275 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6276 for (i
= 1; i
< map
->n
; ++i
)
6277 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6279 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6283 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6285 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6288 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6292 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6293 map
= isl_map_intersect_domain(map
, set
);
6294 set
= isl_map_range(map
);
6302 /* There is no need to cow as removing empty parts doesn't change
6303 * the meaning of the set.
6305 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6312 for (i
= map
->n
-1; i
>= 0; --i
) {
6313 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6315 isl_basic_map_free(map
->p
[i
]);
6316 if (i
!= map
->n
-1) {
6317 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6318 map
->p
[i
] = map
->p
[map
->n
-1];
6326 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6328 return (struct isl_set
*)
6329 isl_map_remove_empty_parts((struct isl_map
*)set
);
6332 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6334 struct isl_basic_map
*bmap
;
6335 if (!map
|| map
->n
== 0)
6337 bmap
= map
->p
[map
->n
-1];
6338 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6339 return isl_basic_map_copy(bmap
);
6342 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6344 return (struct isl_basic_set
*)
6345 isl_map_copy_basic_map((struct isl_map
*)set
);
6348 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6349 __isl_keep isl_basic_map
*bmap
)
6355 for (i
= map
->n
-1; i
>= 0; --i
) {
6356 if (map
->p
[i
] != bmap
)
6358 map
= isl_map_cow(map
);
6361 isl_basic_map_free(map
->p
[i
]);
6362 if (i
!= map
->n
-1) {
6363 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6364 map
->p
[i
] = map
->p
[map
->n
-1];
6375 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6376 struct isl_basic_set
*bset
)
6378 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6379 (struct isl_basic_map
*)bset
);
6382 /* Given two basic sets bset1 and bset2, compute the maximal difference
6383 * between the values of dimension pos in bset1 and those in bset2
6384 * for any common value of the parameters and dimensions preceding pos.
6386 static enum isl_lp_result
basic_set_maximal_difference_at(
6387 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6388 int pos
, isl_int
*opt
)
6390 struct isl_dim
*dims
;
6391 struct isl_basic_map
*bmap1
= NULL
;
6392 struct isl_basic_map
*bmap2
= NULL
;
6393 struct isl_ctx
*ctx
;
6394 struct isl_vec
*obj
;
6397 unsigned dim1
, dim2
;
6398 enum isl_lp_result res
;
6400 if (!bset1
|| !bset2
)
6401 return isl_lp_error
;
6403 nparam
= isl_basic_set_n_param(bset1
);
6404 dim1
= isl_basic_set_n_dim(bset1
);
6405 dim2
= isl_basic_set_n_dim(bset2
);
6406 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6407 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6408 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6409 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6410 if (!bmap1
|| !bmap2
)
6412 bmap1
= isl_basic_map_cow(bmap1
);
6413 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6414 pos
, (dim1
- pos
) + (dim2
- pos
),
6415 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6416 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6419 total
= isl_basic_map_total_dim(bmap1
);
6421 obj
= isl_vec_alloc(ctx
, 1 + total
);
6422 isl_seq_clr(obj
->block
.data
, 1 + total
);
6423 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6424 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6427 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6429 isl_basic_map_free(bmap1
);
6433 isl_basic_map_free(bmap1
);
6434 isl_basic_map_free(bmap2
);
6435 return isl_lp_error
;
6438 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6439 * for any common value of the parameters and dimensions preceding pos
6440 * in both basic sets, the values of dimension pos in bset1 are
6441 * smaller or larger than those in bset2.
6444 * 1 if bset1 follows bset2
6445 * -1 if bset1 precedes bset2
6446 * 0 if bset1 and bset2 are incomparable
6447 * -2 if some error occurred.
6449 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6450 struct isl_basic_set
*bset2
, int pos
)
6453 enum isl_lp_result res
;
6458 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6460 if (res
== isl_lp_empty
)
6462 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6463 res
== isl_lp_unbounded
)
6465 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6474 /* Given two basic sets bset1 and bset2, check whether
6475 * for any common value of the parameters and dimensions preceding pos
6476 * there is a value of dimension pos in bset1 that is larger
6477 * than a value of the same dimension in bset2.
6480 * 1 if there exists such a pair
6481 * 0 if there is no such pair, but there is a pair of equal values
6483 * -2 if some error occurred.
6485 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6486 __isl_keep isl_basic_set
*bset2
, int pos
)
6489 enum isl_lp_result res
;
6494 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6496 if (res
== isl_lp_empty
)
6498 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6499 res
== isl_lp_unbounded
)
6501 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6503 else if (res
== isl_lp_ok
)
6512 /* Given two sets set1 and set2, check whether
6513 * for any common value of the parameters and dimensions preceding pos
6514 * there is a value of dimension pos in set1 that is larger
6515 * than a value of the same dimension in set2.
6518 * 1 if there exists such a pair
6519 * 0 if there is no such pair, but there is a pair of equal values
6521 * -2 if some error occurred.
6523 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6524 __isl_keep isl_set
*set2
, int pos
)
6532 for (i
= 0; i
< set1
->n
; ++i
)
6533 for (j
= 0; j
< set2
->n
; ++j
) {
6535 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6536 if (f
== 1 || f
== -2)
6545 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
6546 unsigned pos
, isl_int
*val
)
6554 total
= isl_basic_map_total_dim(bmap
);
6555 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6556 for (; d
+1 > pos
; --d
)
6557 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6561 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6563 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6565 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6568 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6574 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
6575 unsigned pos
, isl_int
*val
)
6587 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
6590 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
6591 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6592 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6593 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6597 isl_int_set(*val
, v
);
6603 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
6604 unsigned pos
, isl_int
*val
)
6606 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
6610 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
6613 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6616 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
6617 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6619 if (pos
>= isl_basic_map_dim(bmap
, type
))
6621 return isl_basic_map_plain_has_fixed_var(bmap
,
6622 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6625 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
6626 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6628 if (pos
>= isl_map_dim(map
, type
))
6630 return isl_map_plain_has_fixed_var(map
,
6631 map_offset(map
, type
) - 1 + pos
, val
);
6634 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
6635 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6637 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
6640 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6641 * then return this fixed value in *val.
6643 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
6644 unsigned dim
, isl_int
*val
)
6646 return isl_basic_set_plain_has_fixed_var(bset
,
6647 isl_basic_set_n_param(bset
) + dim
, val
);
6650 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6651 * then return this fixed value in *val.
6653 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
6654 unsigned dim
, isl_int
*val
)
6656 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6659 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
6660 unsigned dim
, isl_int
*val
)
6662 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
6665 /* Check if input variable in has fixed value and if so and if val is not NULL,
6666 * then return this fixed value in *val.
6668 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
6669 unsigned in
, isl_int
*val
)
6671 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6674 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6675 * and if val is not NULL, then return this lower bound in *val.
6677 int isl_basic_set_plain_dim_has_fixed_lower_bound(
6678 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
6680 int i
, i_eq
= -1, i_ineq
= -1;
6687 total
= isl_basic_set_total_dim(bset
);
6688 nparam
= isl_basic_set_n_param(bset
);
6689 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6690 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6696 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6697 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6699 if (i_eq
!= -1 || i_ineq
!= -1)
6703 if (i_eq
== -1 && i_ineq
== -1)
6705 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6706 /* The coefficient should always be one due to normalization. */
6707 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6709 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6711 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6712 total
- nparam
- dim
- 1) != -1)
6715 isl_int_neg(*val
, c
[0]);
6719 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
6720 unsigned dim
, isl_int
*val
)
6732 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
6736 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
6738 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6739 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
6741 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6745 isl_int_set(*val
, v
);
6756 /* uset_gist depends on constraints without existentially quantified
6757 * variables sorting first.
6759 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6761 const struct constraint
*c1
= (const struct constraint
*)p1
;
6762 const struct constraint
*c2
= (const struct constraint
*)p2
;
6764 unsigned size
= isl_min(c1
->size
, c2
->size
);
6766 l1
= isl_seq_last_non_zero(c1
->c
, size
);
6767 l2
= isl_seq_last_non_zero(c2
->c
, size
);
6772 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6775 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6776 struct isl_basic_map
*bmap
)
6779 struct constraint
*c
;
6784 total
= isl_basic_map_total_dim(bmap
);
6785 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6788 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6790 c
[i
].c
= bmap
->ineq
[i
];
6792 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6793 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6794 bmap
->ineq
[i
] = c
[i
].c
;
6798 isl_basic_map_free(bmap
);
6802 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6803 __isl_take isl_basic_set
*bset
)
6805 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6806 (struct isl_basic_map
*)bset
);
6809 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6813 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6815 bmap
= isl_basic_map_remove_redundancies(bmap
);
6816 bmap
= isl_basic_map_sort_constraints(bmap
);
6817 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6821 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6823 return (struct isl_basic_set
*)isl_basic_map_normalize(
6824 (struct isl_basic_map
*)bset
);
6827 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
6828 const __isl_keep isl_basic_map
*bmap2
)
6835 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
6836 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
6837 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
6838 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6839 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6840 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6841 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6842 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6843 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6844 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6845 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6847 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6849 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6851 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6852 return bmap1
->n_eq
- bmap2
->n_eq
;
6853 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6854 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6855 if (bmap1
->n_div
!= bmap2
->n_div
)
6856 return bmap1
->n_div
- bmap2
->n_div
;
6857 total
= isl_basic_map_total_dim(bmap1
);
6858 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6859 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6863 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6864 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6868 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6869 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6876 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
6877 __isl_keep isl_basic_map
*bmap2
)
6879 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
6882 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
6883 __isl_keep isl_basic_set
*bset2
)
6885 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
6886 (isl_basic_map
*)bset2
);
6889 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6891 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6892 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6894 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
6897 /* We normalize in place, but if anything goes wrong we need
6898 * to return NULL, so we need to make sure we don't change the
6899 * meaning of any possible other copies of map.
6901 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6904 struct isl_basic_map
*bmap
;
6908 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6910 for (i
= 0; i
< map
->n
; ++i
) {
6911 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6914 isl_basic_map_free(map
->p
[i
]);
6917 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6918 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6919 map
= isl_map_remove_empty_parts(map
);
6922 for (i
= map
->n
- 1; i
>= 1; --i
) {
6923 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
6925 isl_basic_map_free(map
->p
[i
-1]);
6926 for (j
= i
; j
< map
->n
; ++j
)
6927 map
->p
[j
-1] = map
->p
[j
];
6937 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6939 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6942 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6952 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6955 map1
= isl_map_copy(map1
);
6956 map2
= isl_map_copy(map2
);
6957 map1
= isl_map_normalize(map1
);
6958 map2
= isl_map_normalize(map2
);
6961 equal
= map1
->n
== map2
->n
;
6962 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6963 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
6976 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6978 return isl_map_plain_is_equal(map1
, map2
);
6981 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6983 return isl_map_plain_is_equal((struct isl_map
*)set1
,
6984 (struct isl_map
*)set2
);
6987 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6989 return isl_set_plain_is_equal(set1
, set2
);
6992 /* Return an interval that ranges from min to max (inclusive)
6994 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6995 isl_int min
, isl_int max
)
6998 struct isl_basic_set
*bset
= NULL
;
7000 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
7004 k
= isl_basic_set_alloc_inequality(bset
);
7007 isl_int_set_si(bset
->ineq
[k
][1], 1);
7008 isl_int_neg(bset
->ineq
[k
][0], min
);
7010 k
= isl_basic_set_alloc_inequality(bset
);
7013 isl_int_set_si(bset
->ineq
[k
][1], -1);
7014 isl_int_set(bset
->ineq
[k
][0], max
);
7018 isl_basic_set_free(bset
);
7022 /* Return the Cartesian product of the basic sets in list (in the given order).
7024 __isl_give isl_basic_set
*isl_basic_set_list_product(
7025 __isl_take
struct isl_basic_set_list
*list
)
7033 struct isl_basic_set
*product
= NULL
;
7037 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
7038 isl_assert(list
->ctx
, list
->p
[0], goto error
);
7039 nparam
= isl_basic_set_n_param(list
->p
[0]);
7040 dim
= isl_basic_set_n_dim(list
->p
[0]);
7041 extra
= list
->p
[0]->n_div
;
7042 n_eq
= list
->p
[0]->n_eq
;
7043 n_ineq
= list
->p
[0]->n_ineq
;
7044 for (i
= 1; i
< list
->n
; ++i
) {
7045 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
7046 isl_assert(list
->ctx
,
7047 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
7048 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7049 extra
+= list
->p
[i
]->n_div
;
7050 n_eq
+= list
->p
[i
]->n_eq
;
7051 n_ineq
+= list
->p
[i
]->n_ineq
;
7053 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
7058 for (i
= 0; i
< list
->n
; ++i
) {
7059 isl_basic_set_add_constraints(product
,
7060 isl_basic_set_copy(list
->p
[i
]), dim
);
7061 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7063 isl_basic_set_list_free(list
);
7066 isl_basic_set_free(product
);
7067 isl_basic_set_list_free(list
);
7071 struct isl_basic_map
*isl_basic_map_product(
7072 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7074 struct isl_dim
*dim_result
= NULL
;
7075 struct isl_basic_map
*bmap
;
7076 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
7077 struct isl_dim_map
*dim_map1
, *dim_map2
;
7079 if (!bmap1
|| !bmap2
)
7082 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
7083 bmap2
->dim
, isl_dim_param
), goto error
);
7084 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
7085 isl_dim_copy(bmap2
->dim
));
7087 in1
= isl_basic_map_n_in(bmap1
);
7088 in2
= isl_basic_map_n_in(bmap2
);
7089 out1
= isl_basic_map_n_out(bmap1
);
7090 out2
= isl_basic_map_n_out(bmap2
);
7091 nparam
= isl_basic_map_n_param(bmap1
);
7093 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7094 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7095 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7096 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7097 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7098 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7099 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7100 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7101 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7102 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7103 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7105 bmap
= isl_basic_map_alloc_dim(dim_result
,
7106 bmap1
->n_div
+ bmap2
->n_div
,
7107 bmap1
->n_eq
+ bmap2
->n_eq
,
7108 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7109 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7110 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7111 bmap
= isl_basic_map_simplify(bmap
);
7112 return isl_basic_map_finalize(bmap
);
7114 isl_basic_map_free(bmap1
);
7115 isl_basic_map_free(bmap2
);
7119 __isl_give isl_basic_map
*isl_basic_map_flat_product(
7120 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7122 isl_basic_map
*prod
;
7124 prod
= isl_basic_map_product(bmap1
, bmap2
);
7125 prod
= isl_basic_map_flatten(prod
);
7129 __isl_give isl_basic_set
*isl_basic_set_flat_product(
7130 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
7132 return isl_basic_map_flat_product(bset1
, bset2
);
7135 __isl_give isl_basic_map
*isl_basic_map_range_product(
7136 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7138 isl_dim
*dim_result
= NULL
;
7139 isl_basic_map
*bmap
;
7140 unsigned in
, out1
, out2
, nparam
, total
, pos
;
7141 struct isl_dim_map
*dim_map1
, *dim_map2
;
7143 if (!bmap1
|| !bmap2
)
7146 dim_result
= isl_dim_range_product(isl_dim_copy(bmap1
->dim
),
7147 isl_dim_copy(bmap2
->dim
));
7149 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7150 out1
= isl_basic_map_n_out(bmap1
);
7151 out2
= isl_basic_map_n_out(bmap2
);
7152 nparam
= isl_basic_map_n_param(bmap1
);
7154 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7155 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7156 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7157 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7158 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7159 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7160 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
7161 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
7162 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7163 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7164 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7166 bmap
= isl_basic_map_alloc_dim(dim_result
,
7167 bmap1
->n_div
+ bmap2
->n_div
,
7168 bmap1
->n_eq
+ bmap2
->n_eq
,
7169 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7170 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7171 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7172 bmap
= isl_basic_map_simplify(bmap
);
7173 return isl_basic_map_finalize(bmap
);
7175 isl_basic_map_free(bmap1
);
7176 isl_basic_map_free(bmap2
);
7180 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
7181 __isl_take isl_map
*map2
,
7182 __isl_give isl_dim
*(*dim_product
)(__isl_take isl_dim
*left
,
7183 __isl_take isl_dim
*right
),
7184 __isl_give isl_basic_map
*(*basic_map_product
)(
7185 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
7188 struct isl_map
*result
;
7194 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7195 map2
->dim
, isl_dim_param
), goto error
);
7197 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7198 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7199 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7201 result
= isl_map_alloc_dim(dim_product(isl_dim_copy(map1
->dim
),
7202 isl_dim_copy(map2
->dim
)),
7203 map1
->n
* map2
->n
, flags
);
7206 for (i
= 0; i
< map1
->n
; ++i
)
7207 for (j
= 0; j
< map2
->n
; ++j
) {
7208 struct isl_basic_map
*part
;
7209 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
7210 isl_basic_map_copy(map2
->p
[j
]));
7211 if (isl_basic_map_is_empty(part
))
7212 isl_basic_map_free(part
);
7214 result
= isl_map_add_basic_map(result
, part
);
7227 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7229 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
7231 return map_product(map1
, map2
, &isl_dim_product
, &isl_basic_map_product
);
7234 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7236 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7237 __isl_take isl_map
*map2
)
7241 prod
= isl_map_product(map1
, map2
);
7242 prod
= isl_map_flatten(prod
);
7246 /* Given two set A and B, construct its Cartesian product A x B.
7248 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7250 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
7251 (struct isl_map
*)set2
);
7254 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7255 __isl_take isl_set
*set2
)
7257 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
7260 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7262 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
7263 __isl_take isl_map
*map2
)
7265 return map_product(map1
, map2
, &isl_dim_range_product
,
7266 &isl_basic_map_range_product
);
7269 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7272 uint32_t hash
= isl_hash_init();
7277 bmap
= isl_basic_map_copy(bmap
);
7278 bmap
= isl_basic_map_normalize(bmap
);
7281 total
= isl_basic_map_total_dim(bmap
);
7282 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7283 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7285 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7286 isl_hash_hash(hash
, c_hash
);
7288 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7289 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7291 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7292 isl_hash_hash(hash
, c_hash
);
7294 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7295 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7297 if (isl_int_is_zero(bmap
->div
[i
][0]))
7299 isl_hash_byte(hash
, i
& 0xFF);
7300 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7301 isl_hash_hash(hash
, c_hash
);
7303 isl_basic_map_free(bmap
);
7307 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7309 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7312 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7319 map
= isl_map_copy(map
);
7320 map
= isl_map_normalize(map
);
7324 hash
= isl_hash_init();
7325 for (i
= 0; i
< map
->n
; ++i
) {
7327 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7328 isl_hash_hash(hash
, bmap_hash
);
7336 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7338 return isl_map_get_hash((isl_map
*)set
);
7341 /* Check if the value for dimension dim is completely determined
7342 * by the values of the other parameters and variables.
7343 * That is, check if dimension dim is involved in an equality.
7345 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7352 nparam
= isl_basic_set_n_param(bset
);
7353 for (i
= 0; i
< bset
->n_eq
; ++i
)
7354 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7359 /* Check if the value for dimension dim is completely determined
7360 * by the values of the other parameters and variables.
7361 * That is, check if dimension dim is involved in an equality
7362 * for each of the subsets.
7364 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7370 for (i
= 0; i
< set
->n
; ++i
) {
7372 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7379 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7381 return set
? set
->n
: 0;
7384 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7385 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7392 for (i
= 0; i
< map
->n
; ++i
)
7393 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7399 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7400 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7407 for (i
= 0; i
< set
->n
; ++i
)
7408 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7414 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7416 struct isl_dim
*dim
;
7421 bset
= isl_basic_set_cow(bset
);
7425 dim
= isl_basic_set_get_dim(bset
);
7426 dim
= isl_dim_lift(dim
, bset
->n_div
);
7429 isl_dim_free(bset
->dim
);
7431 bset
->extra
-= bset
->n_div
;
7434 bset
= isl_basic_set_finalize(bset
);
7438 isl_basic_set_free(bset
);
7442 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7445 struct isl_dim
*dim
;
7448 set
= isl_set_align_divs(set
);
7453 set
= isl_set_cow(set
);
7457 n_div
= set
->p
[0]->n_div
;
7458 dim
= isl_set_get_dim(set
);
7459 dim
= isl_dim_lift(dim
, n_div
);
7462 isl_dim_free(set
->dim
);
7465 for (i
= 0; i
< set
->n
; ++i
) {
7466 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7477 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7479 struct isl_dim
*dim
;
7480 struct isl_basic_map
*bmap
;
7487 set
= isl_set_align_divs(set
);
7492 dim
= isl_set_get_dim(set
);
7493 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7495 return isl_map_identity(isl_dim_map_from_set(dim
));
7498 n_div
= set
->p
[0]->n_div
;
7499 dim
= isl_dim_map_from_set(dim
);
7500 n_param
= isl_dim_size(dim
, isl_dim_param
);
7501 n_set
= isl_dim_size(dim
, isl_dim_in
);
7502 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7503 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7504 for (i
= 0; i
< n_set
; ++i
)
7505 bmap
= var_equal(bmap
, i
);
7507 total
= n_param
+ n_set
+ n_set
+ n_div
;
7508 for (i
= 0; i
< n_div
; ++i
) {
7509 k
= isl_basic_map_alloc_inequality(bmap
);
7512 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7513 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7514 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7515 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7516 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7517 set
->p
[0]->div
[i
][0]);
7519 l
= isl_basic_map_alloc_inequality(bmap
);
7522 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7523 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7524 set
->p
[0]->div
[i
][0]);
7525 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7529 bmap
= isl_basic_map_simplify(bmap
);
7530 bmap
= isl_basic_map_finalize(bmap
);
7531 return isl_map_from_basic_map(bmap
);
7534 isl_basic_map_free(bmap
);
7538 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7546 dim
= isl_basic_set_total_dim(bset
);
7547 size
+= bset
->n_eq
* (1 + dim
);
7548 size
+= bset
->n_ineq
* (1 + dim
);
7549 size
+= bset
->n_div
* (2 + dim
);
7554 int isl_set_size(__isl_keep isl_set
*set
)
7562 for (i
= 0; i
< set
->n
; ++i
)
7563 size
+= isl_basic_set_size(set
->p
[i
]);
7568 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7569 enum isl_dim_type type
, unsigned pos
)
7577 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7579 pos
+= isl_basic_map_offset(bmap
, type
);
7581 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7582 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7586 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7587 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7594 return lower
&& upper
;
7597 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7598 enum isl_dim_type type
, unsigned pos
)
7605 for (i
= 0; i
< map
->n
; ++i
) {
7607 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7608 if (bounded
< 0 || !bounded
)
7615 /* Return 1 if the specified dim is involved in both an upper bound
7616 * and a lower bound.
7618 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7619 enum isl_dim_type type
, unsigned pos
)
7621 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7624 /* For each of the "n" variables starting at "first", determine
7625 * the sign of the variable and put the results in the first "n"
7626 * elements of the array "signs".
7628 * 1 means that the variable is non-negative
7629 * -1 means that the variable is non-positive
7630 * 0 means the variable attains both positive and negative values.
7632 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7633 unsigned first
, unsigned n
, int *signs
)
7635 isl_vec
*bound
= NULL
;
7636 struct isl_tab
*tab
= NULL
;
7637 struct isl_tab_undo
*snap
;
7640 if (!bset
|| !signs
)
7643 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7644 tab
= isl_tab_from_basic_set(bset
);
7648 isl_seq_clr(bound
->el
, bound
->size
);
7649 isl_int_set_si(bound
->el
[0], -1);
7651 snap
= isl_tab_snap(tab
);
7652 for (i
= 0; i
< n
; ++i
) {
7655 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7656 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7659 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7660 if (isl_tab_rollback(tab
, snap
) < 0)
7668 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7669 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7672 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7673 if (isl_tab_rollback(tab
, snap
) < 0)
7676 signs
[i
] = empty
? -1 : 0;
7680 isl_vec_free(bound
);
7684 isl_vec_free(bound
);
7688 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7689 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7691 if (!bset
|| !signs
)
7693 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7696 first
+= pos(bset
->dim
, type
) - 1;
7697 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7700 /* Check if the given basic map is obviously single-valued.
7701 * In particular, for each output dimension, check that there is
7702 * an equality that defines the output dimension in terms of
7703 * earlier dimensions.
7705 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
7715 total
= 1 + isl_basic_map_total_dim(bmap
);
7716 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7717 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
7719 for (i
= 0; i
< n_out
; ++i
) {
7720 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
7721 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
7723 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
7724 total
- (o_out
+ i
+ 1)) == -1)
7727 if (j
>= bmap
->n_eq
)
7734 /* Check if the given map is obviously single-valued.
7736 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
7747 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
7750 /* Check if the given map is single-valued.
7755 * and check if the result is a subset of the identity mapping.
7757 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7764 sv
= isl_map_plain_is_single_valued(map
);
7768 test
= isl_map_reverse(isl_map_copy(map
));
7769 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7771 dim
= isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map
)));
7772 id
= isl_map_identity(dim
);
7774 sv
= isl_map_is_subset(test
, id
);
7782 int isl_map_is_injective(__isl_keep isl_map
*map
)
7786 map
= isl_map_copy(map
);
7787 map
= isl_map_reverse(map
);
7788 in
= isl_map_is_single_valued(map
);
7794 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7798 sv
= isl_map_is_single_valued(map
);
7802 return isl_map_is_injective(map
);
7805 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7807 return isl_map_is_single_valued((isl_map
*)set
);
7810 int isl_map_is_translation(__isl_keep isl_map
*map
)
7815 delta
= isl_map_deltas(isl_map_copy(map
));
7816 ok
= isl_set_is_singleton(delta
);
7817 isl_set_free(delta
);
7822 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7824 if (isl_seq_first_non_zero(p
, pos
) != -1)
7826 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7831 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7840 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7843 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7844 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7845 for (j
= 0; j
< nvar
; ++j
) {
7846 int lower
= 0, upper
= 0;
7847 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7848 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7850 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7856 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7857 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7859 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7861 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7866 if (!lower
|| !upper
)
7873 int isl_set_is_box(__isl_keep isl_set
*set
)
7880 return isl_basic_set_is_box(set
->p
[0]);
7883 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7888 return isl_dim_is_wrapping(bset
->dim
);
7891 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7896 return isl_dim_is_wrapping(set
->dim
);
7899 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7901 bmap
= isl_basic_map_cow(bmap
);
7905 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7909 bmap
= isl_basic_map_finalize(bmap
);
7911 return (isl_basic_set
*)bmap
;
7913 isl_basic_map_free(bmap
);
7917 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7921 map
= isl_map_cow(map
);
7925 for (i
= 0; i
< map
->n
; ++i
) {
7926 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7930 map
->dim
= isl_dim_wrap(map
->dim
);
7934 return (isl_set
*)map
;
7940 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7942 bset
= isl_basic_set_cow(bset
);
7946 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7950 bset
= isl_basic_set_finalize(bset
);
7952 return (isl_basic_map
*)bset
;
7954 isl_basic_set_free(bset
);
7958 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7965 if (!isl_set_is_wrapping(set
))
7966 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7969 set
= isl_set_cow(set
);
7973 for (i
= 0; i
< set
->n
; ++i
) {
7974 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7979 set
->dim
= isl_dim_unwrap(set
->dim
);
7983 return (isl_map
*)set
;
7989 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7990 enum isl_dim_type type
)
7995 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7998 bmap
= isl_basic_map_cow(bmap
);
8002 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
8006 bmap
= isl_basic_map_finalize(bmap
);
8010 isl_basic_map_free(bmap
);
8014 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
8015 enum isl_dim_type type
)
8022 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
8025 map
= isl_map_cow(map
);
8029 for (i
= 0; i
< map
->n
; ++i
) {
8030 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
8034 map
->dim
= isl_dim_reset(map
->dim
, type
);
8044 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
8049 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
8052 bmap
= isl_basic_map_cow(bmap
);
8056 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
8060 bmap
= isl_basic_map_finalize(bmap
);
8064 isl_basic_map_free(bmap
);
8068 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
8070 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
8073 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
8080 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
8083 map
= isl_map_cow(map
);
8087 for (i
= 0; i
< map
->n
; ++i
) {
8088 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
8092 map
->dim
= isl_dim_flatten(map
->dim
);
8102 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
8104 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
8107 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
8109 isl_dim
*dim
, *flat_dim
;
8112 dim
= isl_set_get_dim(set
);
8113 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
8114 map
= isl_map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
8115 map
= isl_map_intersect_domain(map
, set
);
8120 /* Reorder the dimensions of "bmap" according to the given dim_map
8121 * and set the dimension specification to "dim".
8123 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
8124 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
8128 bmap
= isl_basic_map_cow(bmap
);
8129 if (!bmap
|| !dim
|| !dim_map
)
8132 res
= isl_basic_map_alloc_dim(dim
,
8133 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8134 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
8135 res
= isl_basic_map_finalize(res
);
8139 isl_basic_map_free(bmap
);
8144 /* Reorder the dimensions of "map" according to given reordering.
8146 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8147 __isl_take isl_reordering
*r
)
8150 struct isl_dim_map
*dim_map
;
8152 map
= isl_map_cow(map
);
8153 dim_map
= isl_dim_map_from_reordering(r
);
8154 if (!map
|| !r
|| !dim_map
)
8157 for (i
= 0; i
< map
->n
; ++i
) {
8158 struct isl_dim_map
*dim_map_i
;
8160 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
8162 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8163 isl_dim_copy(r
->dim
), dim_map_i
);
8169 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8171 isl_reordering_free(r
);
8177 isl_reordering_free(r
);
8181 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8182 __isl_take isl_reordering
*r
)
8184 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8187 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8188 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8189 enum isl_dim_type c2
, enum isl_dim_type c3
,
8190 enum isl_dim_type c4
, enum isl_dim_type c5
)
8192 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8193 struct isl_mat
*mat
;
8199 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8200 isl_basic_map_total_dim(bmap
) + 1);
8203 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8204 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8205 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8206 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8207 isl_int_set(mat
->row
[i
][pos
],
8208 bmap
->eq
[i
][off
+ k
]);
8216 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8217 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8218 enum isl_dim_type c2
, enum isl_dim_type c3
,
8219 enum isl_dim_type c4
, enum isl_dim_type c5
)
8221 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8222 struct isl_mat
*mat
;
8228 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8229 isl_basic_map_total_dim(bmap
) + 1);
8232 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8233 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8234 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8235 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8236 isl_int_set(mat
->row
[i
][pos
],
8237 bmap
->ineq
[i
][off
+ k
]);
8245 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8246 __isl_take isl_dim
*dim
,
8247 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8248 enum isl_dim_type c2
, enum isl_dim_type c3
,
8249 enum isl_dim_type c4
, enum isl_dim_type c5
)
8251 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8252 isl_basic_map
*bmap
;
8258 if (!dim
|| !eq
|| !ineq
)
8261 if (eq
->n_col
!= ineq
->n_col
)
8262 isl_die(dim
->ctx
, isl_error_invalid
,
8263 "equalities and inequalities matrices should have "
8264 "same number of columns", goto error
);
8266 total
= 1 + isl_dim_total(dim
);
8268 if (eq
->n_col
< total
)
8269 isl_die(dim
->ctx
, isl_error_invalid
,
8270 "number of columns too small", goto error
);
8272 extra
= eq
->n_col
- total
;
8274 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
8275 eq
->n_row
, ineq
->n_row
);
8278 for (i
= 0; i
< extra
; ++i
) {
8279 k
= isl_basic_map_alloc_div(bmap
);
8282 isl_int_set_si(bmap
->div
[k
][0], 0);
8284 for (i
= 0; i
< eq
->n_row
; ++i
) {
8285 l
= isl_basic_map_alloc_equality(bmap
);
8288 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8289 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8290 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8291 isl_int_set(bmap
->eq
[l
][off
+ k
],
8297 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8298 l
= isl_basic_map_alloc_inequality(bmap
);
8301 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8302 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8303 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8304 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8323 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8324 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8325 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8327 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8328 c1
, c2
, c3
, c4
, isl_dim_in
);
8331 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8332 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8333 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8335 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8336 c1
, c2
, c3
, c4
, isl_dim_in
);
8339 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8340 __isl_take isl_dim
*dim
,
8341 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8342 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8344 return (isl_basic_set
*)
8345 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8346 c1
, c2
, c3
, c4
, isl_dim_in
);
8349 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
8354 return isl_dim_can_zip(bmap
->dim
);
8357 int isl_map_can_zip(__isl_keep isl_map
*map
)
8362 return isl_dim_can_zip(map
->dim
);
8365 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8366 * (A -> C) -> (B -> D).
8368 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
8377 if (!isl_basic_map_can_zip(bmap
))
8378 isl_die(bmap
->ctx
, isl_error_invalid
,
8379 "basic map cannot be zipped", goto error
);
8380 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
8381 isl_dim_size(bmap
->dim
->nested
[0], isl_dim_in
);
8382 n1
= isl_dim_size(bmap
->dim
->nested
[0], isl_dim_out
);
8383 n2
= isl_dim_size(bmap
->dim
->nested
[1], isl_dim_in
);
8384 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
8387 bmap
->dim
= isl_dim_zip(bmap
->dim
);
8392 isl_basic_map_free(bmap
);
8396 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8397 * (A -> C) -> (B -> D).
8399 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
8406 if (!isl_map_can_zip(map
))
8407 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
8410 map
= isl_map_cow(map
);
8414 for (i
= 0; i
< map
->n
; ++i
) {
8415 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
8420 map
->dim
= isl_dim_zip(map
->dim
);