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
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
41 struct isl_dim_map
*dim_map
;
42 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
43 sizeof(struct isl_dim_map
) + len
* sizeof(int));
46 dim_map
->len
= 1 + len
;
48 for (i
= 0; i
< len
; ++i
)
49 dim_map
->pos
[1 + i
] = -1;
53 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 static void isl_dim_map_dim_range(struct isl_dim_map
*dim_map
,
75 struct isl_dim
*dim
, enum isl_dim_type type
,
76 unsigned first
, unsigned n
, unsigned dst_pos
)
84 src_pos
= pos(dim
, type
);
85 for (i
= 0; i
< n
; ++i
)
86 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ first
+ i
;
89 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
90 enum isl_dim_type type
, unsigned dst_pos
)
92 isl_dim_map_dim_range(dim_map
, dim
, type
, 0, n(dim
, type
), dst_pos
);
95 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
96 struct isl_basic_map
*bmap
, unsigned dst_pos
)
101 if (!dim_map
|| !bmap
)
104 src_pos
= 1 + isl_dim_total(bmap
->dim
);
105 for (i
= 0; i
< bmap
->n_div
; ++i
)
106 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
109 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
113 for (i
= 0; i
< dim_map
->len
; ++i
)
114 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
115 fprintf(stderr
, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
119 enum isl_dim_type type
)
124 case isl_dim_cst
: return 1;
127 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
128 case isl_dim_div
: return bmap
->n_div
;
129 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
134 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
136 return map
? n(map
->dim
, type
) : 0;
139 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
141 return set
? n(set
->dim
, type
) : 0;
144 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
145 enum isl_dim_type type
)
147 struct isl_dim
*dim
= bmap
->dim
;
149 case isl_dim_cst
: return 0;
150 case isl_dim_param
: return 1;
151 case isl_dim_in
: return 1 + dim
->nparam
;
152 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
153 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
158 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
160 return pos(map
->dim
, type
);
163 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
164 enum isl_dim_type type
)
166 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
169 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
171 return isl_basic_set_dim(bset
, isl_dim_set
);
174 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
176 return isl_basic_set_dim(bset
, isl_dim_param
);
179 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
181 return isl_dim_total(bset
->dim
) + bset
->n_div
;
184 unsigned isl_set_n_dim(const struct isl_set
*set
)
186 return isl_set_dim(set
, isl_dim_set
);
189 unsigned isl_set_n_param(const struct isl_set
*set
)
191 return isl_set_dim(set
, isl_dim_param
);
194 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
196 return bmap
? bmap
->dim
->n_in
: 0;
199 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
201 return bmap
? bmap
->dim
->n_out
: 0;
204 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
206 return bmap
? bmap
->dim
->nparam
: 0;
209 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
211 return bmap
? bmap
->n_div
: 0;
214 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
216 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
219 unsigned isl_map_n_in(const struct isl_map
*map
)
221 return map
->dim
->n_in
;
224 unsigned isl_map_n_out(const struct isl_map
*map
)
226 return map
->dim
->n_out
;
229 unsigned isl_map_n_param(const struct isl_map
*map
)
231 return map
->dim
->nparam
;
234 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
239 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
242 return isl_dim_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
245 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
246 struct isl_basic_set
*bset
)
251 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
254 return isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
257 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
258 struct isl_basic_set
*bset
)
263 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
266 return isl_dim_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
269 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
271 return bmap
? bmap
->ctx
: NULL
;
274 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
276 return bset
? bset
->ctx
: NULL
;
279 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
281 return map
? map
->ctx
: NULL
;
284 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
286 return set
? set
->ctx
: NULL
;
289 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
293 return isl_dim_copy(bmap
->dim
);
296 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
300 return isl_dim_copy(bset
->dim
);
303 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
307 return isl_dim_copy(map
->dim
);
310 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
314 return isl_dim_copy(set
->dim
);
317 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
318 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
320 bmap
= isl_basic_map_cow(bmap
);
323 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
328 isl_basic_map_free(bmap
);
332 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
333 enum isl_dim_type type
)
335 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
338 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
339 enum isl_dim_type type
, const char *s
)
343 map
= isl_map_cow(map
);
347 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
351 for (i
= 0; i
< map
->n
; ++i
) {
352 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
363 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
364 enum isl_dim_type type
)
366 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
369 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
372 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
375 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
377 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
380 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
381 enum isl_dim_type type
, unsigned pos
)
383 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
386 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
387 enum isl_dim_type type
, unsigned pos
)
389 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
392 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
393 enum isl_dim_type type
, unsigned pos
)
395 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
398 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
399 __isl_take isl_basic_map
*bmap
,
400 enum isl_dim_type type
, unsigned pos
, const char *s
)
404 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
409 isl_basic_map_free(bmap
);
413 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
414 enum isl_dim_type type
, unsigned pos
, const char *s
)
421 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
425 for (i
= 0; i
< map
->n
; ++i
) {
426 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
437 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
438 __isl_take isl_basic_set
*bset
,
439 enum isl_dim_type type
, unsigned pos
, const char *s
)
441 return (isl_basic_set
*)isl_basic_map_set_dim_name(
442 (isl_basic_map
*)bset
, type
, pos
, s
);
445 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
446 enum isl_dim_type type
, unsigned pos
, const char *s
)
448 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
451 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
455 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
458 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
459 struct isl_basic_map
*bmap
, unsigned extra
,
460 unsigned n_eq
, unsigned n_ineq
)
463 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
468 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
469 if (isl_blk_is_error(bmap
->block
))
472 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
477 bmap
->block2
= isl_blk_empty();
480 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
481 if (isl_blk_is_error(bmap
->block2
))
484 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
489 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
490 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
492 for (i
= 0; i
< extra
; ++i
)
493 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
497 bmap
->c_size
= n_eq
+ n_ineq
;
498 bmap
->eq
= bmap
->ineq
+ n_ineq
;
507 isl_basic_map_free(bmap
);
511 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
512 unsigned nparam
, unsigned dim
, unsigned extra
,
513 unsigned n_eq
, unsigned n_ineq
)
515 struct isl_basic_map
*bmap
;
516 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
517 return (struct isl_basic_set
*)bmap
;
520 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
521 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
523 struct isl_basic_map
*bmap
;
526 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
527 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
528 return (struct isl_basic_set
*)bmap
;
534 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
535 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
537 struct isl_basic_map
*bmap
;
541 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
546 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
552 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
553 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
554 unsigned n_eq
, unsigned n_ineq
)
556 struct isl_basic_map
*bmap
;
559 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
563 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
567 static void dup_constraints(
568 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
571 unsigned total
= isl_basic_map_total_dim(src
);
573 for (i
= 0; i
< src
->n_eq
; ++i
) {
574 int j
= isl_basic_map_alloc_equality(dst
);
575 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
578 for (i
= 0; i
< src
->n_ineq
; ++i
) {
579 int j
= isl_basic_map_alloc_inequality(dst
);
580 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
583 for (i
= 0; i
< src
->n_div
; ++i
) {
584 int j
= isl_basic_map_alloc_div(dst
);
585 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
587 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
590 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
592 struct isl_basic_map
*dup
;
596 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
597 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
600 dup_constraints(dup
, bmap
);
601 dup
->flags
= bmap
->flags
;
602 dup
->sample
= isl_vec_copy(bmap
->sample
);
606 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
608 struct isl_basic_map
*dup
;
610 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
611 return (struct isl_basic_set
*)dup
;
614 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
619 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
623 return isl_basic_set_dup(bset
);
626 struct isl_set
*isl_set_copy(struct isl_set
*set
)
635 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
640 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
644 bmap
= isl_basic_map_dup(bmap
);
646 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
650 struct isl_map
*isl_map_copy(struct isl_map
*map
)
659 void isl_basic_map_free(struct isl_basic_map
*bmap
)
667 isl_ctx_deref(bmap
->ctx
);
669 isl_blk_free(bmap
->ctx
, bmap
->block2
);
671 isl_blk_free(bmap
->ctx
, bmap
->block
);
672 isl_vec_free(bmap
->sample
);
673 isl_dim_free(bmap
->dim
);
677 void isl_basic_set_free(struct isl_basic_set
*bset
)
679 isl_basic_map_free((struct isl_basic_map
*)bset
);
682 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
684 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
687 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
693 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
694 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
696 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
697 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
698 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
699 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
700 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
701 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
703 int j
= isl_basic_map_alloc_inequality(bmap
);
707 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
708 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
715 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
716 bmap
->extra
- bmap
->n_div
);
720 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
722 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
725 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
729 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
734 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
736 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
739 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
744 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
746 if (pos
!= bmap
->n_eq
- 1) {
748 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
749 bmap
->eq
[bmap
->n_eq
- 1] = t
;
755 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
757 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
760 void isl_basic_map_inequality_to_equality(
761 struct isl_basic_map
*bmap
, unsigned pos
)
766 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
767 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
772 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
773 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
774 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
775 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
778 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
780 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
783 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
789 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
790 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
791 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
792 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
793 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
794 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
795 1 + isl_basic_map_total_dim(bmap
),
796 bmap
->extra
- bmap
->n_div
);
797 return bmap
->n_ineq
++;
800 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
802 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
805 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
809 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
814 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
816 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
819 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
824 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
826 if (pos
!= bmap
->n_ineq
- 1) {
828 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
829 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
830 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
836 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
838 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
841 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
846 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
849 k
= isl_basic_map_alloc_equality(bmap
);
852 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
855 isl_basic_map_free(bmap
);
859 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
862 return (isl_basic_set
*)
863 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
866 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
871 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
874 k
= isl_basic_map_alloc_inequality(bmap
);
877 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
880 isl_basic_map_free(bmap
);
884 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
887 return (isl_basic_set
*)
888 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
891 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
895 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
896 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
897 1 + 1 + isl_basic_map_total_dim(bmap
),
898 bmap
->extra
- bmap
->n_div
);
899 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
900 return bmap
->n_div
++;
903 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
905 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
908 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
912 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
917 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
919 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
922 /* Copy constraint from src to dst, putting the vars of src at offset
923 * dim_off in dst and the divs of src at offset div_off in dst.
924 * If both sets are actually map, then dim_off applies to the input
927 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
928 struct isl_basic_map
*src_map
, isl_int
*src
,
929 unsigned in_off
, unsigned out_off
, unsigned div_off
)
931 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
932 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
933 unsigned src_in
= isl_basic_map_n_in(src_map
);
934 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
935 unsigned src_out
= isl_basic_map_n_out(src_map
);
936 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
937 isl_int_set(dst
[0], src
[0]);
938 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
939 if (dst_nparam
> src_nparam
)
940 isl_seq_clr(dst
+1+src_nparam
,
941 dst_nparam
- src_nparam
);
942 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
943 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
945 isl_min(dst_in
-in_off
, src_in
));
946 if (dst_in
-in_off
> src_in
)
947 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
948 dst_in
- in_off
- src_in
);
949 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
950 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
951 src
+1+src_nparam
+src_in
,
952 isl_min(dst_out
-out_off
, src_out
));
953 if (dst_out
-out_off
> src_out
)
954 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
955 dst_out
- out_off
- src_out
);
956 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
957 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
958 src
+1+src_nparam
+src_in
+src_out
,
959 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
960 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
961 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
962 div_off
+src_map
->n_div
,
963 dst_map
->n_div
- div_off
- src_map
->n_div
);
966 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
967 struct isl_basic_map
*src_map
, isl_int
*src
,
968 unsigned in_off
, unsigned out_off
, unsigned div_off
)
970 isl_int_set(dst
[0], src
[0]);
971 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
974 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
975 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
980 if (!bmap1
|| !bmap2
)
983 div_off
= bmap1
->n_div
;
985 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
986 int i1
= isl_basic_map_alloc_equality(bmap1
);
989 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
990 i_pos
, o_pos
, div_off
);
993 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
994 int i1
= isl_basic_map_alloc_inequality(bmap1
);
997 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
998 i_pos
, o_pos
, div_off
);
1001 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1002 int i1
= isl_basic_map_alloc_div(bmap1
);
1005 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1006 i_pos
, o_pos
, div_off
);
1009 isl_basic_map_free(bmap2
);
1014 isl_basic_map_free(bmap1
);
1015 isl_basic_map_free(bmap2
);
1019 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
1020 struct isl_dim_map
*dim_map
)
1024 for (i
= 0; i
< dim_map
->len
; ++i
) {
1025 if (dim_map
->pos
[i
] < 0)
1026 isl_int_set_si(dst
[i
], 0);
1028 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
1032 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
1033 struct isl_dim_map
*dim_map
)
1035 isl_int_set(dst
[0], src
[0]);
1036 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
1039 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
1040 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
1044 if (!src
|| !dst
|| !dim_map
)
1047 for (i
= 0; i
< src
->n_eq
; ++i
) {
1048 int i1
= isl_basic_map_alloc_equality(dst
);
1051 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1054 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1055 int i1
= isl_basic_map_alloc_inequality(dst
);
1058 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1061 for (i
= 0; i
< src
->n_div
; ++i
) {
1062 int i1
= isl_basic_map_alloc_div(dst
);
1065 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1069 isl_basic_map_free(src
);
1074 isl_basic_map_free(src
);
1075 isl_basic_map_free(dst
);
1079 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1080 struct isl_basic_set
*bset2
, unsigned pos
)
1082 return (struct isl_basic_set
*)
1083 add_constraints((struct isl_basic_map
*)bset1
,
1084 (struct isl_basic_map
*)bset2
, 0, pos
);
1087 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1088 struct isl_dim
*dim
, unsigned extra
,
1089 unsigned n_eq
, unsigned n_ineq
)
1091 struct isl_basic_map
*ext
;
1101 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1102 base
->extra
>= base
->n_div
+ extra
;
1104 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1105 room_for_ineq(base
, n_ineq
)) {
1110 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1111 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1112 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1113 extra
+= base
->extra
;
1115 n_ineq
+= base
->n_ineq
;
1117 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1123 ext
->sample
= isl_vec_copy(base
->sample
);
1124 flags
= base
->flags
;
1125 ext
= add_constraints(ext
, base
, 0, 0);
1128 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1135 isl_basic_map_free(base
);
1139 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1140 struct isl_dim
*dim
, unsigned extra
,
1141 unsigned n_eq
, unsigned n_ineq
)
1143 return (struct isl_basic_set
*)
1144 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1145 extra
, n_eq
, n_ineq
);
1148 struct isl_basic_map
*isl_basic_map_extend_constraints(
1149 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1153 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1157 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1158 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1159 unsigned n_eq
, unsigned n_ineq
)
1161 struct isl_basic_map
*bmap
;
1162 struct isl_dim
*dim
;
1166 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1170 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1173 isl_basic_map_free(base
);
1177 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1178 unsigned nparam
, unsigned dim
, unsigned extra
,
1179 unsigned n_eq
, unsigned n_ineq
)
1181 return (struct isl_basic_set
*)
1182 isl_basic_map_extend((struct isl_basic_map
*)base
,
1183 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1186 struct isl_basic_set
*isl_basic_set_extend_constraints(
1187 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1189 return (struct isl_basic_set
*)
1190 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1194 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1196 return (struct isl_basic_set
*)
1197 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1200 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1205 if (bmap
->ref
> 1) {
1207 bmap
= isl_basic_map_dup(bmap
);
1210 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1214 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1222 return isl_set_dup(set
);
1225 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1233 return isl_map_dup(map
);
1236 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1237 unsigned a_len
, unsigned b_len
)
1239 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1240 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1241 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1244 struct isl_basic_set
*isl_basic_set_swap_vars(
1245 struct isl_basic_set
*bset
, unsigned n
)
1255 nparam
= isl_basic_set_n_param(bset
);
1256 dim
= isl_basic_set_n_dim(bset
);
1257 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1262 bset
= isl_basic_set_cow(bset
);
1266 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1267 if (isl_blk_is_error(blk
))
1270 for (i
= 0; i
< bset
->n_eq
; ++i
)
1272 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1274 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1276 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1278 for (i
= 0; i
< bset
->n_div
; ++i
)
1280 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1282 isl_blk_free(bset
->ctx
, blk
);
1284 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1285 bset
= isl_basic_set_gauss(bset
, NULL
);
1286 return isl_basic_set_finalize(bset
);
1288 isl_basic_set_free(bset
);
1292 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1295 set
= isl_set_cow(set
);
1299 for (i
= 0; i
< set
->n
; ++i
) {
1300 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1306 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1310 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1316 total
= isl_basic_map_total_dim(bmap
);
1317 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1318 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1320 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1322 i
= isl_basic_map_alloc_equality(bmap
);
1326 isl_int_set_si(bmap
->eq
[i
][0], 1);
1327 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1328 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1329 isl_vec_free(bmap
->sample
);
1330 bmap
->sample
= NULL
;
1331 return isl_basic_map_finalize(bmap
);
1333 isl_basic_map_free(bmap
);
1337 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1339 return (struct isl_basic_set
*)
1340 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1343 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1346 unsigned off
= isl_dim_total(bmap
->dim
);
1347 isl_int
*t
= bmap
->div
[a
];
1348 bmap
->div
[a
] = bmap
->div
[b
];
1351 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1352 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1354 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1355 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1357 for (i
= 0; i
< bmap
->n_div
; ++i
)
1358 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1359 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1362 /* Eliminate the specified n dimensions starting at first from the
1363 * constraints using Fourier-Motzkin. The dimensions themselves
1366 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1367 enum isl_dim_type type
, unsigned first
, unsigned n
)
1376 map
= isl_map_cow(map
);
1379 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1380 first
+= pos(map
->dim
, type
) - 1;
1382 for (i
= 0; i
< map
->n
; ++i
) {
1383 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1393 /* Eliminate the specified n dimensions starting at first from the
1394 * constraints using Fourier-Motzkin. The dimensions themselves
1397 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1398 enum isl_dim_type type
, unsigned first
, unsigned n
)
1400 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1403 /* Eliminate the specified n dimensions starting at first from the
1404 * constraints using Fourier-Motzkin. The dimensions themselves
1407 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1408 unsigned first
, unsigned n
)
1410 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1413 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1414 __isl_take isl_basic_map
*bmap
)
1416 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1424 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1425 __isl_take isl_basic_set
*bset
)
1427 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1428 (struct isl_basic_map
*)bset
);
1431 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1440 set
= isl_set_cow(set
);
1444 for (i
= 0; i
< set
->n
; ++i
) {
1445 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1455 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1456 enum isl_dim_type type
, unsigned first
, unsigned n
)
1460 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1464 bmap
= isl_basic_map_eliminate_vars(bmap
,
1465 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1468 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1470 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1473 isl_basic_map_free(bmap
);
1477 /* Return true if the definition of the given div (recursively) involves
1478 * any of the given variables.
1480 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1481 unsigned first
, unsigned n
)
1484 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1486 if (isl_int_is_zero(bmap
->div
[div
][0]))
1488 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1491 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1492 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1494 if (div_involves_vars(bmap
, i
, first
, n
))
1501 /* Remove all divs (recursively) involving any of the given dimensions
1502 * in their definitions.
1504 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1505 __isl_take isl_basic_map
*bmap
,
1506 enum isl_dim_type type
, unsigned first
, unsigned n
)
1512 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1514 first
+= isl_basic_map_offset(bmap
, type
);
1516 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1517 if (!div_involves_vars(bmap
, i
, first
, n
))
1519 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1524 isl_basic_map_free(bmap
);
1528 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1529 enum isl_dim_type type
, unsigned first
, unsigned n
)
1538 map
= isl_map_cow(map
);
1542 for (i
= 0; i
< map
->n
; ++i
) {
1543 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1554 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1555 enum isl_dim_type type
, unsigned first
, unsigned n
)
1557 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1561 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1562 __isl_take isl_basic_set
*bset
,
1563 enum isl_dim_type type
, unsigned first
, unsigned n
)
1565 return (isl_basic_set
*)
1566 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1569 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1570 enum isl_dim_type type
, unsigned first
, unsigned n
)
1577 map
= isl_map_cow(map
);
1580 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1582 for (i
= 0; i
< map
->n
; ++i
) {
1583 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1584 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1588 map
= isl_map_drop(map
, type
, first
, n
);
1595 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1596 enum isl_dim_type type
, unsigned first
, unsigned n
)
1598 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1601 /* Project out n inputs starting at first using Fourier-Motzkin */
1602 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1603 unsigned first
, unsigned n
)
1605 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1608 static void dump_term(struct isl_basic_map
*bmap
,
1609 isl_int c
, int pos
, FILE *out
)
1612 unsigned in
= isl_basic_map_n_in(bmap
);
1613 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1614 unsigned nparam
= isl_basic_map_n_param(bmap
);
1616 isl_int_print(out
, c
, 0);
1618 if (!isl_int_is_one(c
))
1619 isl_int_print(out
, c
, 0);
1620 if (pos
< 1 + nparam
) {
1621 name
= isl_dim_get_name(bmap
->dim
,
1622 isl_dim_param
, pos
- 1);
1624 fprintf(out
, "%s", name
);
1626 fprintf(out
, "p%d", pos
- 1);
1627 } else if (pos
< 1 + nparam
+ in
)
1628 fprintf(out
, "i%d", pos
- 1 - nparam
);
1629 else if (pos
< 1 + nparam
+ dim
)
1630 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1632 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1636 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1637 int sign
, FILE *out
)
1641 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1645 for (i
= 0, first
= 1; i
< len
; ++i
) {
1646 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1649 fprintf(out
, " + ");
1651 isl_int_abs(v
, c
[i
]);
1652 dump_term(bmap
, v
, i
, out
);
1659 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1660 const char *op
, FILE *out
, int indent
)
1664 fprintf(out
, "%*s", indent
, "");
1666 dump_constraint_sign(bmap
, c
, 1, out
);
1667 fprintf(out
, " %s ", op
);
1668 dump_constraint_sign(bmap
, c
, -1, out
);
1672 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1673 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1675 fprintf(out
, "%*s", indent
, "");
1676 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1681 static void dump_constraints(struct isl_basic_map
*bmap
,
1682 isl_int
**c
, unsigned n
,
1683 const char *op
, FILE *out
, int indent
)
1687 for (i
= 0; i
< n
; ++i
)
1688 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1691 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1695 unsigned total
= isl_basic_map_total_dim(bmap
);
1697 for (j
= 0; j
< 1 + total
; ++j
) {
1698 if (isl_int_is_zero(exp
[j
]))
1700 if (!first
&& isl_int_is_pos(exp
[j
]))
1702 dump_term(bmap
, exp
[j
], j
, out
);
1707 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1711 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1712 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1714 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1715 fprintf(out
, "%*s", indent
, "");
1716 fprintf(out
, "e%d = [(", i
);
1717 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1719 isl_int_print(out
, bmap
->div
[i
][0], 0);
1720 fprintf(out
, "]\n");
1724 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1727 fprintf(out
, "null basic set\n");
1731 fprintf(out
, "%*s", indent
, "");
1732 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1733 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1734 bset
->extra
, bset
->flags
);
1735 dump((struct isl_basic_map
*)bset
, out
, indent
);
1738 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1741 fprintf(out
, "null basic map\n");
1745 fprintf(out
, "%*s", indent
, "");
1746 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1747 "flags: %x, n_name: %d\n",
1749 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1750 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1751 dump(bmap
, out
, indent
);
1754 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1759 total
= isl_basic_map_total_dim(bmap
);
1760 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1761 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1762 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1763 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1767 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1769 struct isl_set
*set
;
1773 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1774 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1775 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1776 sizeof(struct isl_set
) +
1777 (n
- 1) * sizeof(struct isl_basic_set
*));
1781 set
->ctx
= dim
->ctx
;
1782 isl_ctx_ref(set
->ctx
);
1794 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1795 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1797 struct isl_set
*set
;
1798 struct isl_dim
*dims
;
1800 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1804 set
= isl_set_alloc_dim(dims
, n
, flags
);
1808 /* Make sure "map" has room for at least "n" more basic maps.
1810 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1813 struct isl_map
*grown
= NULL
;
1817 isl_assert(map
->ctx
, n
>= 0, goto error
);
1818 if (map
->n
+ n
<= map
->size
)
1820 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1823 for (i
= 0; i
< map
->n
; ++i
) {
1824 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1832 isl_map_free(grown
);
1837 /* Make sure "set" has room for at least "n" more basic sets.
1839 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1841 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1844 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1847 struct isl_set
*dup
;
1852 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1855 for (i
= 0; i
< set
->n
; ++i
)
1856 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1860 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1862 struct isl_set
*set
;
1867 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1869 isl_basic_set_free(bset
);
1872 return isl_set_add_basic_set(set
, bset
);
1875 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1877 struct isl_map
*map
;
1882 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1884 isl_basic_map_free(bmap
);
1887 return isl_map_add_basic_map(map
, bmap
);
1890 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1891 __isl_take isl_basic_set
*bset
)
1893 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1894 (struct isl_basic_map
*)bset
);
1897 void isl_set_free(struct isl_set
*set
)
1907 isl_ctx_deref(set
->ctx
);
1908 for (i
= 0; i
< set
->n
; ++i
)
1909 isl_basic_set_free(set
->p
[i
]);
1910 isl_dim_free(set
->dim
);
1914 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1919 fprintf(out
, "null set\n");
1923 fprintf(out
, "%*s", indent
, "");
1924 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1925 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1927 for (i
= 0; i
< set
->n
; ++i
) {
1928 fprintf(out
, "%*s", indent
, "");
1929 fprintf(out
, "basic set %d:\n", i
);
1930 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1934 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1939 fprintf(out
, "null map\n");
1943 fprintf(out
, "%*s", indent
, "");
1944 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1945 "flags: %x, n_name: %d\n",
1946 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1947 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1948 for (i
= 0; i
< map
->n
; ++i
) {
1949 fprintf(out
, "%*s", indent
, "");
1950 fprintf(out
, "basic map %d:\n", i
);
1951 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1955 struct isl_basic_map
*isl_basic_map_intersect_domain(
1956 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1958 struct isl_basic_map
*bmap_domain
;
1959 struct isl_dim
*dim
;
1964 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1965 bset
->dim
, isl_dim_param
), goto error
);
1967 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1968 isl_assert(bset
->ctx
,
1969 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1971 bmap
= isl_basic_map_cow(bmap
);
1974 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1975 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1976 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1977 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1978 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1980 bmap
= isl_basic_map_simplify(bmap
);
1981 return isl_basic_map_finalize(bmap
);
1983 isl_basic_map_free(bmap
);
1984 isl_basic_set_free(bset
);
1988 struct isl_basic_map
*isl_basic_map_intersect_range(
1989 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1991 struct isl_basic_map
*bmap_range
;
1996 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1997 bset
->dim
, isl_dim_param
), goto error
);
1999 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2000 isl_assert(bset
->ctx
,
2001 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2003 bmap
= isl_basic_map_cow(bmap
);
2006 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2007 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2008 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2009 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2011 bmap
= isl_basic_map_simplify(bmap
);
2012 return isl_basic_map_finalize(bmap
);
2014 isl_basic_map_free(bmap
);
2015 isl_basic_set_free(bset
);
2019 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2025 total
= 1 + isl_basic_map_total_dim(bmap
);
2026 if (total
!= vec
->size
)
2031 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2032 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2033 if (!isl_int_is_zero(s
)) {
2039 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2040 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2041 if (isl_int_is_neg(s
)) {
2052 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2054 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2057 struct isl_basic_map
*isl_basic_map_intersect(
2058 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2060 struct isl_vec
*sample
= NULL
;
2062 if (!bmap1
|| !bmap2
)
2065 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2066 bmap2
->dim
, isl_dim_param
), goto error
);
2067 if (isl_dim_total(bmap1
->dim
) ==
2068 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2069 isl_dim_total(bmap2
->dim
) !=
2070 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2071 return isl_basic_map_intersect(bmap2
, bmap1
);
2073 if (isl_dim_total(bmap2
->dim
) !=
2074 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2075 isl_assert(bmap1
->ctx
,
2076 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2078 if (bmap1
->sample
&&
2079 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2080 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2081 sample
= isl_vec_copy(bmap1
->sample
);
2082 else if (bmap2
->sample
&&
2083 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2084 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2085 sample
= isl_vec_copy(bmap2
->sample
);
2087 bmap1
= isl_basic_map_cow(bmap1
);
2090 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2091 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2092 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2095 isl_vec_free(sample
);
2097 isl_vec_free(bmap1
->sample
);
2098 bmap1
->sample
= sample
;
2101 bmap1
= isl_basic_map_simplify(bmap1
);
2102 return isl_basic_map_finalize(bmap1
);
2105 isl_vec_free(sample
);
2106 isl_basic_map_free(bmap1
);
2107 isl_basic_map_free(bmap2
);
2111 struct isl_basic_set
*isl_basic_set_intersect(
2112 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2114 return (struct isl_basic_set
*)
2115 isl_basic_map_intersect(
2116 (struct isl_basic_map
*)bset1
,
2117 (struct isl_basic_map
*)bset2
);
2120 /* Special case of isl_map_intersect, where both map1 and map2
2121 * are convex, without any divs and such that either map1 or map2
2122 * contains a single constraint. This constraint is then simply
2123 * added to the other map.
2125 static __isl_give isl_map
*map_intersect_add_constraint(
2126 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2128 struct isl_basic_map
*bmap1
;
2129 struct isl_basic_map
*bmap2
;
2131 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2132 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2133 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2134 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2136 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2137 return isl_map_intersect(map2
, map1
);
2139 isl_assert(map2
->ctx
,
2140 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2142 map1
= isl_map_cow(map1
);
2145 if (isl_map_fast_is_empty(map1
)) {
2149 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2150 if (map2
->p
[0]->n_eq
== 1)
2151 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2153 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2154 map2
->p
[0]->ineq
[0]);
2156 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2157 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2161 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2162 isl_basic_map_free(map1
->p
[0]);
2175 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2178 struct isl_map
*result
;
2184 if (isl_map_fast_is_empty(map1
)) {
2188 if (isl_map_fast_is_empty(map2
)) {
2193 if (map1
->n
== 1 && map2
->n
== 1 &&
2194 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2195 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2196 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2197 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2198 return map_intersect_add_constraint(map1
, map2
);
2199 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2200 map2
->dim
, isl_dim_param
), goto error
);
2201 if (isl_dim_total(map1
->dim
) ==
2202 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2203 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2204 return isl_map_intersect(map2
, map1
);
2206 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2207 isl_assert(map1
->ctx
,
2208 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2210 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2211 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2212 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2214 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2215 map1
->n
* map2
->n
, flags
);
2218 for (i
= 0; i
< map1
->n
; ++i
)
2219 for (j
= 0; j
< map2
->n
; ++j
) {
2220 struct isl_basic_map
*part
;
2221 part
= isl_basic_map_intersect(
2222 isl_basic_map_copy(map1
->p
[i
]),
2223 isl_basic_map_copy(map2
->p
[j
]));
2224 if (isl_basic_map_is_empty(part
))
2225 isl_basic_map_free(part
);
2227 result
= isl_map_add_basic_map(result
, part
);
2240 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2242 return (struct isl_set
*)
2243 isl_map_intersect((struct isl_map
*)set1
,
2244 (struct isl_map
*)set2
);
2247 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2249 struct isl_dim
*dim
;
2250 struct isl_basic_set
*bset
;
2255 bmap
= isl_basic_map_cow(bmap
);
2258 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2259 in
= isl_basic_map_n_in(bmap
);
2260 bset
= isl_basic_set_from_basic_map(bmap
);
2261 bset
= isl_basic_set_swap_vars(bset
, in
);
2262 return isl_basic_map_from_basic_set(bset
, dim
);
2265 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2266 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2268 struct isl_dim
*res_dim
;
2269 struct isl_basic_map
*res
;
2270 struct isl_dim_map
*dim_map
;
2271 unsigned total
, off
;
2272 enum isl_dim_type t
;
2280 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2282 total
= isl_basic_map_total_dim(bmap
) + n
;
2283 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2285 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2287 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2289 unsigned size
= isl_basic_map_dim(bmap
, t
);
2290 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2292 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2293 pos
, size
- pos
, off
+ pos
+ n
);
2295 off
+= isl_dim_size(res_dim
, t
);
2297 isl_dim_map_div(dim_map
, bmap
, off
);
2299 res
= isl_basic_map_alloc_dim(res_dim
,
2300 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2301 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2302 res
= isl_basic_map_simplify(res
);
2303 return isl_basic_map_finalize(res
);
2306 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2307 enum isl_dim_type type
, unsigned n
)
2311 return isl_basic_map_insert(bmap
, type
,
2312 isl_basic_map_dim(bmap
, type
), n
);
2315 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2316 enum isl_dim_type type
, unsigned n
)
2320 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2321 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2323 isl_basic_set_free(bset
);
2327 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2328 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2335 map
= isl_map_cow(map
);
2339 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2343 for (i
= 0; i
< map
->n
; ++i
) {
2344 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2355 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2356 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2358 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2361 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2362 enum isl_dim_type type
, unsigned n
)
2366 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2369 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2370 enum isl_dim_type type
, unsigned n
)
2374 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2375 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2381 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2382 __isl_take isl_basic_map
*bmap
,
2383 enum isl_dim_type dst_type
, unsigned dst_pos
,
2384 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2387 struct isl_dim_map
*dim_map
;
2388 struct isl_basic_map
*res
;
2389 enum isl_dim_type t
;
2390 unsigned total
, off
;
2397 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2400 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2403 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2405 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2406 pos(bmap
->dim
, src_type
) + src_pos
+
2407 ((src_type
< dst_type
) ? n
: 0)) {
2408 bmap
= isl_basic_map_cow(bmap
);
2412 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2413 src_type
, src_pos
, n
);
2417 bmap
= isl_basic_map_finalize(bmap
);
2422 total
= isl_basic_map_total_dim(bmap
);
2423 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2426 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2427 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2428 if (t
== dst_type
) {
2429 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2432 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2435 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2436 dst_pos
, size
- dst_pos
, off
);
2437 off
+= size
- dst_pos
;
2438 } else if (t
== src_type
) {
2439 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2442 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2443 src_pos
+ n
, size
- src_pos
- n
, off
);
2444 off
+= size
- src_pos
- n
;
2446 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2450 isl_dim_map_div(dim_map
, bmap
, off
);
2452 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2453 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2454 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2456 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2457 src_type
, src_pos
, n
);
2461 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2462 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2463 bmap
= isl_basic_map_finalize(bmap
);
2467 isl_basic_map_free(bmap
);
2471 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2472 enum isl_dim_type dst_type
, unsigned dst_pos
,
2473 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2475 return (isl_basic_set
*)isl_basic_map_move_dims(
2476 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2479 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2480 enum isl_dim_type dst_type
, unsigned dst_pos
,
2481 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2485 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2486 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2487 src_type
, src_pos
, n
);
2493 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2494 enum isl_dim_type dst_type
, unsigned dst_pos
,
2495 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2504 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2507 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2510 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2512 map
= isl_map_cow(map
);
2516 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2520 for (i
= 0; i
< map
->n
; ++i
) {
2521 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2523 src_type
, src_pos
, n
);
2534 /* Move the specified dimensions to the last columns right before
2535 * the divs. Don't change the dimension specification of bmap.
2536 * That's the responsibility of the caller.
2538 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2539 enum isl_dim_type type
, unsigned first
, unsigned n
)
2541 struct isl_dim_map
*dim_map
;
2542 struct isl_basic_map
*res
;
2543 enum isl_dim_type t
;
2544 unsigned total
, off
;
2548 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2551 total
= isl_basic_map_total_dim(bmap
);
2552 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2555 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2556 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2558 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2561 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2562 first
, n
, total
- bmap
->n_div
- n
);
2563 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2564 first
+ n
, size
- (first
+ n
), off
);
2565 off
+= size
- (first
+ n
);
2567 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2571 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2573 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2574 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2575 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2579 /* Turn the n dimensions of type type, starting at first
2580 * into existentially quantified variables.
2582 __isl_give isl_basic_map
*isl_basic_map_project_out(
2583 __isl_take isl_basic_map
*bmap
,
2584 enum isl_dim_type type
, unsigned first
, unsigned n
)
2597 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2598 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2600 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2603 bmap
= move_last(bmap
, type
, first
, n
);
2604 bmap
= isl_basic_map_cow(bmap
);
2608 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2609 old
= bmap
->block2
.data
;
2610 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2611 (bmap
->extra
+ n
) * (1 + row_size
));
2612 if (!bmap
->block2
.data
)
2614 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2617 for (i
= 0; i
< n
; ++i
) {
2618 new_div
[i
] = bmap
->block2
.data
+
2619 (bmap
->extra
+ i
) * (1 + row_size
);
2620 isl_seq_clr(new_div
[i
], 1 + row_size
);
2622 for (i
= 0; i
< bmap
->extra
; ++i
)
2623 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2625 bmap
->div
= new_div
;
2629 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2632 bmap
= isl_basic_map_simplify(bmap
);
2633 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2634 return isl_basic_map_finalize(bmap
);
2636 isl_basic_map_free(bmap
);
2640 /* Turn the n dimensions of type type, starting at first
2641 * into existentially quantified variables.
2643 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2644 enum isl_dim_type type
, unsigned first
, unsigned n
)
2646 return (isl_basic_set
*)isl_basic_map_project_out(
2647 (isl_basic_map
*)bset
, type
, first
, n
);
2650 /* Turn the n dimensions of type type, starting at first
2651 * into existentially quantified variables.
2653 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2654 enum isl_dim_type type
, unsigned first
, unsigned n
)
2664 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2666 map
= isl_map_cow(map
);
2670 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2674 for (i
= 0; i
< map
->n
; ++i
) {
2675 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2686 /* Turn the n dimensions of type type, starting at first
2687 * into existentially quantified variables.
2689 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2690 enum isl_dim_type type
, unsigned first
, unsigned n
)
2692 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2695 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2699 for (i
= 0; i
< n
; ++i
) {
2700 j
= isl_basic_map_alloc_div(bmap
);
2703 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2707 isl_basic_map_free(bmap
);
2711 struct isl_basic_map
*isl_basic_map_apply_range(
2712 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2714 struct isl_dim
*dim_result
= NULL
;
2715 struct isl_basic_map
*bmap
;
2716 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2717 struct isl_dim_map
*dim_map1
, *dim_map2
;
2719 if (!bmap1
|| !bmap2
)
2722 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2723 isl_dim_copy(bmap2
->dim
));
2725 n_in
= isl_basic_map_n_in(bmap1
);
2726 n_out
= isl_basic_map_n_out(bmap2
);
2727 n
= isl_basic_map_n_out(bmap1
);
2728 nparam
= isl_basic_map_n_param(bmap1
);
2730 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2731 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2732 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2733 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2734 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2735 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2736 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2737 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2738 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2739 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2740 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2742 bmap
= isl_basic_map_alloc_dim(dim_result
,
2743 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2744 bmap1
->n_eq
+ bmap2
->n_eq
,
2745 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2746 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2747 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2748 bmap
= add_divs(bmap
, n
);
2749 bmap
= isl_basic_map_simplify(bmap
);
2750 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2751 return isl_basic_map_finalize(bmap
);
2753 isl_basic_map_free(bmap1
);
2754 isl_basic_map_free(bmap2
);
2758 struct isl_basic_set
*isl_basic_set_apply(
2759 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2764 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2767 return (struct isl_basic_set
*)
2768 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2770 isl_basic_set_free(bset
);
2771 isl_basic_map_free(bmap
);
2775 struct isl_basic_map
*isl_basic_map_apply_domain(
2776 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2778 if (!bmap1
|| !bmap2
)
2781 isl_assert(bmap1
->ctx
,
2782 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2783 isl_assert(bmap1
->ctx
,
2784 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2787 bmap1
= isl_basic_map_reverse(bmap1
);
2788 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2789 return isl_basic_map_reverse(bmap1
);
2791 isl_basic_map_free(bmap1
);
2792 isl_basic_map_free(bmap2
);
2796 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2797 * A \cap B -> f(A) + f(B)
2799 struct isl_basic_map
*isl_basic_map_sum(
2800 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2802 unsigned n_in
, n_out
, nparam
, total
, pos
;
2803 struct isl_basic_map
*bmap
= NULL
;
2804 struct isl_dim_map
*dim_map1
, *dim_map2
;
2807 if (!bmap1
|| !bmap2
)
2810 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2813 nparam
= isl_basic_map_n_param(bmap1
);
2814 n_in
= isl_basic_map_n_in(bmap1
);
2815 n_out
= isl_basic_map_n_out(bmap1
);
2817 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2818 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2819 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2820 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2821 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2822 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2823 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2824 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2825 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2826 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2827 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2829 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2830 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2831 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2832 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2833 for (i
= 0; i
< n_out
; ++i
) {
2834 int j
= isl_basic_map_alloc_equality(bmap
);
2837 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2838 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2839 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2840 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2842 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2843 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2844 bmap
= add_divs(bmap
, 2 * n_out
);
2846 bmap
= isl_basic_map_simplify(bmap
);
2847 return isl_basic_map_finalize(bmap
);
2849 isl_basic_map_free(bmap
);
2850 isl_basic_map_free(bmap1
);
2851 isl_basic_map_free(bmap2
);
2855 /* Given two maps A -> f(A) and B -> g(B), construct a map
2856 * A \cap B -> f(A) + f(B)
2858 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2860 struct isl_map
*result
;
2866 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2868 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2869 map1
->n
* map2
->n
, 0);
2872 for (i
= 0; i
< map1
->n
; ++i
)
2873 for (j
= 0; j
< map2
->n
; ++j
) {
2874 struct isl_basic_map
*part
;
2875 part
= isl_basic_map_sum(
2876 isl_basic_map_copy(map1
->p
[i
]),
2877 isl_basic_map_copy(map2
->p
[j
]));
2878 if (isl_basic_map_is_empty(part
))
2879 isl_basic_map_free(part
);
2881 result
= isl_map_add_basic_map(result
, part
);
2894 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2895 __isl_take isl_set
*set2
)
2897 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2900 /* Given a basic map A -> f(A), construct A -> -f(A).
2902 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2907 bmap
= isl_basic_map_cow(bmap
);
2911 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2912 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2913 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2914 for (j
= 0; j
< n
; ++j
)
2915 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2916 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2917 for (j
= 0; j
< n
; ++j
)
2918 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2919 for (i
= 0; i
< bmap
->n_div
; ++i
)
2920 for (j
= 0; j
< n
; ++j
)
2921 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2922 return isl_basic_map_finalize(bmap
);
2925 /* Given a map A -> f(A), construct A -> -f(A).
2927 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2931 map
= isl_map_cow(map
);
2935 for (i
= 0; i
< map
->n
; ++i
) {
2936 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2947 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2949 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2952 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2953 * A -> floor(f(A)/d).
2955 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2958 unsigned n_in
, n_out
, nparam
, total
, pos
;
2959 struct isl_basic_map
*result
= NULL
;
2960 struct isl_dim_map
*dim_map
;
2966 nparam
= isl_basic_map_n_param(bmap
);
2967 n_in
= isl_basic_map_n_in(bmap
);
2968 n_out
= isl_basic_map_n_out(bmap
);
2970 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2971 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2972 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2973 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2974 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2975 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2977 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2978 bmap
->n_div
+ n_out
,
2979 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2980 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2981 result
= add_divs(result
, n_out
);
2982 for (i
= 0; i
< n_out
; ++i
) {
2984 j
= isl_basic_map_alloc_inequality(result
);
2987 isl_seq_clr(result
->ineq
[j
], 1+total
);
2988 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2989 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2990 j
= isl_basic_map_alloc_inequality(result
);
2993 isl_seq_clr(result
->ineq
[j
], 1+total
);
2994 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2995 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2996 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2999 result
= isl_basic_map_simplify(result
);
3000 return isl_basic_map_finalize(result
);
3002 isl_basic_map_free(result
);
3006 /* Given a map A -> f(A) and an integer d, construct a map
3007 * A -> floor(f(A)/d).
3009 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3013 map
= isl_map_cow(map
);
3017 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3018 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3019 for (i
= 0; i
< map
->n
; ++i
) {
3020 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3031 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3037 i
= isl_basic_map_alloc_equality(bmap
);
3040 nparam
= isl_basic_map_n_param(bmap
);
3041 n_in
= isl_basic_map_n_in(bmap
);
3042 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3043 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3044 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3045 return isl_basic_map_finalize(bmap
);
3047 isl_basic_map_free(bmap
);
3051 /* Add a constraints to "bmap" expressing i_pos < o_pos
3053 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3059 i
= isl_basic_map_alloc_inequality(bmap
);
3062 nparam
= isl_basic_map_n_param(bmap
);
3063 n_in
= isl_basic_map_n_in(bmap
);
3064 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3065 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3066 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3067 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3068 return isl_basic_map_finalize(bmap
);
3070 isl_basic_map_free(bmap
);
3074 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3076 static __isl_give isl_basic_map
*var_less_or_equal(
3077 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3083 i
= isl_basic_map_alloc_inequality(bmap
);
3086 nparam
= isl_basic_map_n_param(bmap
);
3087 n_in
= isl_basic_map_n_in(bmap
);
3088 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3089 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3090 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3091 return isl_basic_map_finalize(bmap
);
3093 isl_basic_map_free(bmap
);
3097 /* Add a constraints to "bmap" expressing i_pos > o_pos
3099 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3105 i
= isl_basic_map_alloc_inequality(bmap
);
3108 nparam
= isl_basic_map_n_param(bmap
);
3109 n_in
= isl_basic_map_n_in(bmap
);
3110 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3111 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3112 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3113 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3114 return isl_basic_map_finalize(bmap
);
3116 isl_basic_map_free(bmap
);
3120 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3122 static __isl_give isl_basic_map
*var_more_or_equal(
3123 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3129 i
= isl_basic_map_alloc_inequality(bmap
);
3132 nparam
= isl_basic_map_n_param(bmap
);
3133 n_in
= isl_basic_map_n_in(bmap
);
3134 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3135 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3136 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3137 return isl_basic_map_finalize(bmap
);
3139 isl_basic_map_free(bmap
);
3143 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3146 struct isl_basic_map
*bmap
;
3147 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3150 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3151 bmap
= var_equal(bmap
, i
);
3152 return isl_basic_map_finalize(bmap
);
3155 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3157 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3160 struct isl_basic_map
*bmap
;
3161 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3164 for (i
= 0; i
< pos
&& bmap
; ++i
)
3165 bmap
= var_equal(bmap
, i
);
3167 bmap
= var_less(bmap
, pos
);
3168 return isl_basic_map_finalize(bmap
);
3171 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3173 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3174 __isl_take isl_dim
*dim
, unsigned pos
)
3177 isl_basic_map
*bmap
;
3179 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3180 for (i
= 0; i
< pos
; ++i
)
3181 bmap
= var_equal(bmap
, i
);
3182 bmap
= var_less_or_equal(bmap
, pos
);
3183 return isl_basic_map_finalize(bmap
);
3186 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3188 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3191 struct isl_basic_map
*bmap
;
3192 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3195 for (i
= 0; i
< pos
&& bmap
; ++i
)
3196 bmap
= var_equal(bmap
, i
);
3198 bmap
= var_more(bmap
, pos
);
3199 return isl_basic_map_finalize(bmap
);
3202 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3204 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3205 __isl_take isl_dim
*dim
, unsigned pos
)
3208 isl_basic_map
*bmap
;
3210 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3211 for (i
= 0; i
< pos
; ++i
)
3212 bmap
= var_equal(bmap
, i
);
3213 bmap
= var_more_or_equal(bmap
, pos
);
3214 return isl_basic_map_finalize(bmap
);
3217 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3218 unsigned n
, int equal
)
3220 struct isl_map
*map
;
3223 if (n
== 0 && equal
)
3224 return isl_map_universe(dims
);
3226 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3228 for (i
= 0; i
+ 1 < n
; ++i
)
3229 map
= isl_map_add_basic_map(map
,
3230 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3233 map
= isl_map_add_basic_map(map
,
3234 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3236 map
= isl_map_add_basic_map(map
,
3237 isl_basic_map_less_at(dims
, n
- 1));
3244 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3248 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3251 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3253 return map_lex_lte_first(dim
, n
, 0);
3256 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3258 return map_lex_lte_first(dim
, n
, 1);
3261 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3263 return map_lex_lte(isl_dim_map(set_dim
), 0);
3266 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3268 return map_lex_lte(isl_dim_map(set_dim
), 1);
3271 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3272 unsigned n
, int equal
)
3274 struct isl_map
*map
;
3277 if (n
== 0 && equal
)
3278 return isl_map_universe(dims
);
3280 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3282 for (i
= 0; i
+ 1 < n
; ++i
)
3283 map
= isl_map_add_basic_map(map
,
3284 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3287 map
= isl_map_add_basic_map(map
,
3288 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3290 map
= isl_map_add_basic_map(map
,
3291 isl_basic_map_more_at(dims
, n
- 1));
3298 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3302 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3305 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3307 return map_lex_gte_first(dim
, n
, 0);
3310 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3312 return map_lex_gte_first(dim
, n
, 1);
3315 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3317 return map_lex_gte(isl_dim_map(set_dim
), 0);
3320 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3322 return map_lex_gte(isl_dim_map(set_dim
), 1);
3325 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3326 __isl_take isl_set
*set2
)
3329 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3330 map
= isl_map_intersect_domain(map
, set1
);
3331 map
= isl_map_intersect_range(map
, set2
);
3335 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3336 __isl_take isl_set
*set2
)
3339 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3340 map
= isl_map_intersect_domain(map
, set1
);
3341 map
= isl_map_intersect_range(map
, set2
);
3345 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3346 __isl_take isl_set
*set2
)
3349 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3350 map
= isl_map_intersect_domain(map
, set1
);
3351 map
= isl_map_intersect_range(map
, set2
);
3355 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3356 __isl_take isl_set
*set2
)
3359 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3360 map
= isl_map_intersect_domain(map
, set1
);
3361 map
= isl_map_intersect_range(map
, set2
);
3365 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3366 __isl_take isl_map
*map2
)
3369 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3370 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3371 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3375 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3376 __isl_take isl_map
*map2
)
3379 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3380 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3381 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3385 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3386 __isl_take isl_map
*map2
)
3389 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3390 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3391 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3395 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3396 __isl_take isl_map
*map2
)
3399 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3400 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3401 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3405 struct isl_basic_map
*isl_basic_map_from_basic_set(
3406 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3408 struct isl_basic_map
*bmap
;
3410 bset
= isl_basic_set_cow(bset
);
3414 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3415 isl_dim_free(bset
->dim
);
3416 bmap
= (struct isl_basic_map
*) bset
;
3418 return isl_basic_map_finalize(bmap
);
3420 isl_basic_set_free(bset
);
3425 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3429 if (bmap
->dim
->n_in
== 0)
3430 return (struct isl_basic_set
*)bmap
;
3431 bmap
= isl_basic_map_cow(bmap
);
3434 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3437 bmap
= isl_basic_map_finalize(bmap
);
3438 return (struct isl_basic_set
*)bmap
;
3440 isl_basic_map_free(bmap
);
3444 /* For a div d = floor(f/m), add the constraints
3447 * -(f-(n-1)) + m d >= 0
3449 * Note that the second constraint is the negation of
3453 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3454 unsigned pos
, isl_int
*div
)
3457 unsigned total
= isl_basic_map_total_dim(bmap
);
3459 i
= isl_basic_map_alloc_inequality(bmap
);
3462 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3463 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3465 j
= isl_basic_map_alloc_inequality(bmap
);
3468 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3469 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3470 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3474 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3475 unsigned pos
, isl_int
*div
)
3477 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3481 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3483 unsigned total
= isl_basic_map_total_dim(bmap
);
3484 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3486 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3490 struct isl_basic_set
*isl_basic_map_underlying_set(
3491 struct isl_basic_map
*bmap
)
3495 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3496 bmap
->n_div
== 0 && !isl_dim_get_tuple_name(bmap
->dim
, isl_dim_out
))
3497 return (struct isl_basic_set
*)bmap
;
3498 bmap
= isl_basic_map_cow(bmap
);
3501 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3504 bmap
->extra
-= bmap
->n_div
;
3506 bmap
= isl_basic_map_finalize(bmap
);
3507 return (struct isl_basic_set
*)bmap
;
3512 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3513 __isl_take isl_basic_set
*bset
)
3515 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3518 struct isl_basic_map
*isl_basic_map_overlying_set(
3519 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3521 struct isl_basic_map
*bmap
;
3522 struct isl_ctx
*ctx
;
3529 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3530 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3531 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3533 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3534 isl_basic_map_free(like
);
3535 return (struct isl_basic_map
*)bset
;
3537 bset
= isl_basic_set_cow(bset
);
3540 total
= bset
->dim
->n_out
+ bset
->extra
;
3541 bmap
= (struct isl_basic_map
*)bset
;
3542 isl_dim_free(bmap
->dim
);
3543 bmap
->dim
= isl_dim_copy(like
->dim
);
3546 bmap
->n_div
= like
->n_div
;
3547 bmap
->extra
+= like
->n_div
;
3550 ltotal
= total
- bmap
->extra
+ like
->extra
;
3553 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3554 bmap
->extra
* (1 + 1 + total
));
3555 if (isl_blk_is_error(bmap
->block2
))
3557 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3561 for (i
= 0; i
< bmap
->extra
; ++i
)
3562 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3563 for (i
= 0; i
< like
->n_div
; ++i
) {
3564 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3565 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3567 bmap
= isl_basic_map_extend_constraints(bmap
,
3568 0, 2 * like
->n_div
);
3569 for (i
= 0; i
< like
->n_div
; ++i
) {
3570 if (isl_int_is_zero(bmap
->div
[i
][0]))
3572 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3576 isl_basic_map_free(like
);
3577 bmap
= isl_basic_map_simplify(bmap
);
3578 bmap
= isl_basic_map_finalize(bmap
);
3581 isl_basic_map_free(like
);
3582 isl_basic_set_free(bset
);
3586 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3587 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3589 return (struct isl_basic_set
*)
3590 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3593 struct isl_set
*isl_set_from_underlying_set(
3594 struct isl_set
*set
, struct isl_basic_set
*like
)
3600 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3602 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3603 isl_basic_set_free(like
);
3606 set
= isl_set_cow(set
);
3609 for (i
= 0; i
< set
->n
; ++i
) {
3610 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3611 isl_basic_set_copy(like
));
3615 isl_dim_free(set
->dim
);
3616 set
->dim
= isl_dim_copy(like
->dim
);
3619 isl_basic_set_free(like
);
3622 isl_basic_set_free(like
);
3627 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3631 map
= isl_map_cow(map
);
3634 map
->dim
= isl_dim_cow(map
->dim
);
3638 for (i
= 1; i
< map
->n
; ++i
)
3639 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3641 for (i
= 0; i
< map
->n
; ++i
) {
3642 map
->p
[i
] = (struct isl_basic_map
*)
3643 isl_basic_map_underlying_set(map
->p
[i
]);
3648 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3650 isl_dim_free(map
->dim
);
3651 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3655 return (struct isl_set
*)map
;
3661 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3663 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3666 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3667 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3669 bmap
= isl_basic_map_cow(bmap
);
3673 isl_dim_free(bmap
->dim
);
3676 bmap
= isl_basic_map_finalize(bmap
);
3680 isl_basic_map_free(bmap
);
3685 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3686 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3688 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3692 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3693 __isl_take isl_dim
*dim
)
3697 map
= isl_map_cow(map
);
3701 for (i
= 0; i
< map
->n
; ++i
) {
3702 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3707 isl_dim_free(map
->dim
);
3717 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3718 __isl_take isl_dim
*dim
)
3720 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3723 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3726 struct isl_basic_set
*domain
;
3732 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3734 n_in
= isl_basic_map_n_in(bmap
);
3735 n_out
= isl_basic_map_n_out(bmap
);
3736 domain
= isl_basic_set_from_basic_map(bmap
);
3737 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3739 domain
= isl_basic_set_reset_dim(domain
, dim
);
3744 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3746 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3749 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3750 __isl_take isl_basic_map
*bmap
)
3754 isl_basic_map
*domain
;
3755 isl_basic_set
*bset
;
3756 int nparam
, n_in
, n_out
;
3759 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3760 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3761 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3763 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3764 domain
= isl_basic_map_universe(dim
);
3766 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3767 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3768 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3770 total
= isl_basic_map_total_dim(bmap
);
3772 for (i
= 0; i
< n_in
; ++i
) {
3773 k
= isl_basic_map_alloc_equality(bmap
);
3776 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3777 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3778 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3781 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3782 return isl_basic_map_finalize(bmap
);
3784 isl_basic_map_free(bmap
);
3788 __isl_give isl_basic_map
*isl_basic_map_range_map(
3789 __isl_take isl_basic_map
*bmap
)
3793 isl_basic_map
*range
;
3794 isl_basic_set
*bset
;
3795 int nparam
, n_in
, n_out
;
3798 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3799 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3800 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3802 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3803 range
= isl_basic_map_universe(dim
);
3805 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3806 bmap
= isl_basic_map_apply_range(bmap
, range
);
3807 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3809 total
= isl_basic_map_total_dim(bmap
);
3811 for (i
= 0; i
< n_out
; ++i
) {
3812 k
= isl_basic_map_alloc_equality(bmap
);
3815 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3816 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3817 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3820 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3821 return isl_basic_map_finalize(bmap
);
3823 isl_basic_map_free(bmap
);
3827 struct isl_set
*isl_map_range(struct isl_map
*map
)
3830 struct isl_set
*set
;
3834 if (isl_map_dim(map
, isl_dim_in
) == 0)
3835 return (isl_set
*)map
;
3837 map
= isl_map_cow(map
);
3841 set
= (struct isl_set
*) map
;
3842 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3845 for (i
= 0; i
< map
->n
; ++i
) {
3846 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3850 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3851 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3858 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3861 isl_dim
*domain_dim
;
3863 map
= isl_map_cow(map
);
3867 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3868 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3869 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3872 for (i
= 0; i
< map
->n
; ++i
) {
3873 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3877 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3878 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3885 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3890 map
= isl_map_cow(map
);
3894 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3895 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3896 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3899 for (i
= 0; i
< map
->n
; ++i
) {
3900 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3904 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3905 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3912 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3915 struct isl_map
*map
= NULL
;
3917 set
= isl_set_cow(set
);
3920 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3921 map
= (struct isl_map
*)set
;
3922 for (i
= 0; i
< set
->n
; ++i
) {
3923 map
->p
[i
] = isl_basic_map_from_basic_set(
3924 set
->p
[i
], isl_dim_copy(dim
));
3928 isl_dim_free(map
->dim
);
3937 __isl_give isl_basic_map
*isl_basic_map_from_domain(
3938 __isl_take isl_basic_set
*bset
)
3940 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
3943 __isl_give isl_basic_map
*isl_basic_map_from_range(
3944 __isl_take isl_basic_set
*bset
)
3946 return (isl_basic_map
*)bset
;
3949 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3951 return (struct isl_map
*)set
;
3954 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3956 return isl_map_reverse(isl_map_from_range(set
));
3959 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3960 __isl_take isl_set
*range
)
3962 return isl_map_apply_range(isl_map_from_domain(domain
),
3963 isl_map_from_range(range
));
3966 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3969 struct isl_set
*set
= NULL
;
3973 map
= isl_map_cow(map
);
3976 map
->dim
= isl_dim_as_set_dim(map
->dim
);
3979 set
= (struct isl_set
*)map
;
3980 for (i
= 0; i
< map
->n
; ++i
) {
3981 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3991 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3993 struct isl_map
*map
;
3997 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3998 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3999 sizeof(struct isl_map
) +
4000 (n
- 1) * sizeof(struct isl_basic_map
*));
4004 map
->ctx
= dim
->ctx
;
4005 isl_ctx_ref(map
->ctx
);
4017 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4018 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4021 struct isl_map
*map
;
4022 struct isl_dim
*dims
;
4024 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4028 map
= isl_map_alloc_dim(dims
, n
, flags
);
4032 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4034 struct isl_basic_map
*bmap
;
4035 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4036 bmap
= isl_basic_map_set_to_empty(bmap
);
4040 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4042 struct isl_basic_set
*bset
;
4043 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4044 bset
= isl_basic_set_set_to_empty(bset
);
4048 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_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_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4060 struct isl_basic_map
*bmap
;
4063 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4064 bmap
= isl_basic_map_set_to_empty(bmap
);
4068 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4070 struct isl_basic_set
*bset
;
4073 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4074 bset
= isl_basic_set_set_to_empty(bset
);
4078 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4080 struct isl_basic_map
*bmap
;
4081 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4085 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4087 struct isl_basic_set
*bset
;
4088 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4092 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4093 __isl_keep isl_basic_map
*model
)
4097 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4100 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4104 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4107 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4108 __isl_keep isl_set
*model
)
4112 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4115 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4117 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4120 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4124 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4127 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4131 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4134 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4136 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4139 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4143 return isl_set_empty(isl_dim_copy(model
->dim
));
4146 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4148 struct isl_map
*map
;
4151 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4152 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4156 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4158 struct isl_set
*set
;
4161 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4162 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4166 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4170 return isl_set_universe(isl_dim_copy(model
->dim
));
4173 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4176 struct isl_map
*dup
;
4180 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4181 for (i
= 0; i
< map
->n
; ++i
)
4182 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4186 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4187 __isl_take isl_basic_map
*bmap
)
4191 if (isl_basic_map_fast_is_empty(bmap
)) {
4192 isl_basic_map_free(bmap
);
4195 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4196 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4197 map
->p
[map
->n
] = bmap
;
4199 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4205 isl_basic_map_free(bmap
);
4209 void isl_map_free(struct isl_map
*map
)
4219 isl_ctx_deref(map
->ctx
);
4220 for (i
= 0; i
< map
->n
; ++i
)
4221 isl_basic_map_free(map
->p
[i
]);
4222 isl_dim_free(map
->dim
);
4226 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4227 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4231 base
= isl_map_cow(base
);
4235 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4238 for (i
= 0; i
< base
->n
; ++i
) {
4239 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4240 isl_dim_copy(base
->dim
), 0, 0, 0);
4250 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4251 unsigned nparam
, unsigned dim
)
4253 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4257 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4258 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4262 bmap
= isl_basic_map_cow(bmap
);
4263 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4264 j
= isl_basic_map_alloc_equality(bmap
);
4267 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4268 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4269 isl_int_set_si(bmap
->eq
[j
][0], value
);
4270 bmap
= isl_basic_map_simplify(bmap
);
4271 return isl_basic_map_finalize(bmap
);
4273 isl_basic_map_free(bmap
);
4277 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4278 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4282 bmap
= isl_basic_map_cow(bmap
);
4283 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4284 j
= isl_basic_map_alloc_equality(bmap
);
4287 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4288 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4289 isl_int_set(bmap
->eq
[j
][0], value
);
4290 bmap
= isl_basic_map_simplify(bmap
);
4291 return isl_basic_map_finalize(bmap
);
4293 isl_basic_map_free(bmap
);
4297 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4298 enum isl_dim_type type
, unsigned pos
, int value
)
4302 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4303 return isl_basic_map_fix_pos_si(bmap
,
4304 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4306 isl_basic_map_free(bmap
);
4310 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4311 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4315 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4316 return isl_basic_map_fix_pos(bmap
,
4317 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4319 isl_basic_map_free(bmap
);
4323 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4324 enum isl_dim_type type
, unsigned pos
, int value
)
4326 return (struct isl_basic_set
*)
4327 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4331 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4332 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4334 return (struct isl_basic_set
*)
4335 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4339 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4340 unsigned input
, int value
)
4342 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4345 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4346 unsigned dim
, int value
)
4348 return (struct isl_basic_set
*)
4349 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4350 isl_dim_set
, dim
, value
);
4353 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4354 enum isl_dim_type type
, unsigned pos
, int value
)
4358 map
= isl_map_cow(map
);
4362 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4363 for (i
= 0; i
< map
->n
; ++i
) {
4364 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4368 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4375 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4376 enum isl_dim_type type
, unsigned pos
, int value
)
4378 return (struct isl_set
*)
4379 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4382 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4383 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4387 map
= isl_map_cow(map
);
4391 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4392 for (i
= 0; i
< map
->n
; ++i
) {
4393 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4397 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4404 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4405 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4407 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4410 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4411 unsigned input
, int value
)
4413 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4416 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4418 return (struct isl_set
*)
4419 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4422 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4423 __isl_take isl_basic_map
*bmap
,
4424 enum isl_dim_type type
, unsigned pos
, int value
)
4430 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4431 pos
+= isl_basic_map_offset(bmap
, type
);
4432 bmap
= isl_basic_map_cow(bmap
);
4433 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4434 j
= isl_basic_map_alloc_inequality(bmap
);
4437 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4438 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4439 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4440 bmap
= isl_basic_map_simplify(bmap
);
4441 return isl_basic_map_finalize(bmap
);
4443 isl_basic_map_free(bmap
);
4447 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4448 unsigned dim
, isl_int value
)
4452 bset
= isl_basic_set_cow(bset
);
4453 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4454 j
= isl_basic_set_alloc_inequality(bset
);
4457 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4458 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4459 isl_int_neg(bset
->ineq
[j
][0], value
);
4460 bset
= isl_basic_set_simplify(bset
);
4461 return isl_basic_set_finalize(bset
);
4463 isl_basic_set_free(bset
);
4467 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4468 enum isl_dim_type type
, unsigned pos
, int value
)
4472 map
= isl_map_cow(map
);
4476 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4477 for (i
= 0; i
< map
->n
; ++i
) {
4478 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4483 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4490 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4491 enum isl_dim_type type
, unsigned pos
, int value
)
4493 return (struct isl_set
*)
4494 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4497 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4502 set
= isl_set_cow(set
);
4506 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4507 for (i
= 0; i
< set
->n
; ++i
) {
4508 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4518 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4522 map
= isl_map_cow(map
);
4526 map
->dim
= isl_dim_reverse(map
->dim
);
4529 for (i
= 0; i
< map
->n
; ++i
) {
4530 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4534 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4541 static struct isl_map
*isl_basic_map_partial_lexopt(
4542 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4543 struct isl_set
**empty
, int max
)
4547 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4548 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4550 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4552 isl_basic_map_free(bmap
);
4553 isl_basic_set_free(dom
);
4559 struct isl_map
*isl_basic_map_partial_lexmax(
4560 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4561 struct isl_set
**empty
)
4563 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4566 struct isl_map
*isl_basic_map_partial_lexmin(
4567 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4568 struct isl_set
**empty
)
4570 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4573 struct isl_set
*isl_basic_set_partial_lexmin(
4574 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4575 struct isl_set
**empty
)
4577 return (struct isl_set
*)
4578 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4582 struct isl_set
*isl_basic_set_partial_lexmax(
4583 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4584 struct isl_set
**empty
)
4586 return (struct isl_set
*)
4587 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4591 /* Given a basic map "bmap", compute the lexicograhically minimal
4592 * (or maximal) image element for each domain element in dom.
4593 * Set *empty to those elements in dom that do not have an image element.
4595 * We first make sure the basic sets in dom are disjoint and then
4596 * simply collect the results over each of the basic sets separately.
4597 * We could probably improve the efficiency a bit by moving the union
4598 * domain down into the parametric integer programming.
4600 static __isl_give isl_map
*basic_map_partial_lexopt(
4601 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4602 __isl_give isl_set
**empty
, int max
)
4605 struct isl_map
*res
;
4607 dom
= isl_set_make_disjoint(dom
);
4611 if (isl_set_fast_is_empty(dom
)) {
4612 res
= isl_map_empty_like_basic_map(bmap
);
4613 *empty
= isl_set_empty_like(dom
);
4615 isl_basic_map_free(bmap
);
4619 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4620 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4622 for (i
= 1; i
< dom
->n
; ++i
) {
4623 struct isl_map
*res_i
;
4624 struct isl_set
*empty_i
;
4626 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4627 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4629 res
= isl_map_union_disjoint(res
, res_i
);
4630 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4634 isl_basic_map_free(bmap
);
4639 isl_basic_map_free(bmap
);
4643 /* Given a map "map", compute the lexicograhically minimal
4644 * (or maximal) image element for each domain element in dom.
4645 * Set *empty to those elements in dom that do not have an image element.
4647 * We first compute the lexicographically minimal or maximal element
4648 * in the first basic map. This results in a partial solution "res"
4649 * and a subset "todo" of dom that still need to be handled.
4650 * We then consider each of the remaining maps in "map" and successively
4651 * improve both "res" and "todo".
4653 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4654 * Assume we are computing the lexicographical maximum.
4655 * We first intersect basic map i with a relation that maps elements
4656 * to elements that are lexicographically larger than the image elements
4657 * in res^k and the compute the maximum image element of this intersection.
4658 * The result ("better") corresponds to those image elements in basic map i
4659 * that are better than what we had before. The remainder ("keep") are the
4660 * domain elements for which the image element in res_k was better.
4661 * We also compute the lexicographical maximum of basic map i in todo^k.
4662 * res^i is the result of the operation + better + those elements in
4663 * res^k that we should keep
4664 * todo^i is the remainder of the maximum operation on todo^k.
4666 static __isl_give isl_map
*isl_map_partial_lexopt(
4667 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4668 __isl_give isl_set
**empty
, int max
)
4671 struct isl_map
*res
;
4672 struct isl_set
*todo
;
4677 if (isl_map_fast_is_empty(map
)) {
4685 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4686 isl_set_copy(dom
), &todo
, max
);
4688 for (i
= 1; i
< map
->n
; ++i
) {
4690 struct isl_map
*better
;
4691 struct isl_set
*keep
;
4692 struct isl_map
*res_i
;
4693 struct isl_set
*todo_i
;
4694 struct isl_dim
*dim
= isl_map_get_dim(res
);
4696 dim
= isl_dim_range(dim
);
4698 lt
= isl_map_lex_lt(dim
);
4700 lt
= isl_map_lex_gt(dim
);
4701 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4702 lt
= isl_map_intersect(lt
,
4703 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4704 better
= isl_map_partial_lexopt(lt
,
4705 isl_map_domain(isl_map_copy(res
)),
4708 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4709 todo
, &todo_i
, max
);
4711 res
= isl_map_intersect_domain(res
, keep
);
4712 res
= isl_map_union_disjoint(res
, res_i
);
4713 res
= isl_map_union_disjoint(res
, better
);
4734 __isl_give isl_map
*isl_map_partial_lexmax(
4735 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4736 __isl_give isl_set
**empty
)
4738 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4741 __isl_give isl_map
*isl_map_partial_lexmin(
4742 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4743 __isl_give isl_set
**empty
)
4745 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4748 __isl_give isl_set
*isl_set_partial_lexmin(
4749 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4750 __isl_give isl_set
**empty
)
4752 return (struct isl_set
*)
4753 isl_map_partial_lexmin((struct isl_map
*)set
,
4757 __isl_give isl_set
*isl_set_partial_lexmax(
4758 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4759 __isl_give isl_set
**empty
)
4761 return (struct isl_set
*)
4762 isl_map_partial_lexmax((struct isl_map
*)set
,
4766 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4768 struct isl_basic_set
*dom
= NULL
;
4769 struct isl_dim
*dom_dim
;
4773 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4774 dom
= isl_basic_set_universe(dom_dim
);
4775 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4777 isl_basic_map_free(bmap
);
4781 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4783 return isl_basic_map_lexopt(bmap
, 0);
4786 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4788 return isl_basic_map_lexopt(bmap
, 1);
4791 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4793 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4796 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4798 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4801 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4803 struct isl_set
*dom
= NULL
;
4804 struct isl_dim
*dom_dim
;
4808 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4809 dom
= isl_set_universe(dom_dim
);
4810 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4816 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4818 return isl_map_lexopt(map
, 0);
4821 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4823 return isl_map_lexopt(map
, 1);
4826 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4828 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4831 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4833 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4836 /* Apply a preimage specified by "mat" on the parameters of "bset".
4837 * bset is assumed to have only parameters and divs.
4839 static struct isl_basic_set
*basic_set_parameter_preimage(
4840 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4847 bset
->dim
= isl_dim_cow(bset
->dim
);
4851 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4853 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4855 bset
->dim
->nparam
= 0;
4856 bset
->dim
->n_out
= nparam
;
4857 bset
= isl_basic_set_preimage(bset
, mat
);
4859 bset
->dim
->nparam
= bset
->dim
->n_out
;
4860 bset
->dim
->n_out
= 0;
4865 isl_basic_set_free(bset
);
4869 /* Apply a preimage specified by "mat" on the parameters of "set".
4870 * set is assumed to have only parameters and divs.
4872 static struct isl_set
*set_parameter_preimage(
4873 struct isl_set
*set
, struct isl_mat
*mat
)
4875 struct isl_dim
*dim
= NULL
;
4881 dim
= isl_dim_copy(set
->dim
);
4882 dim
= isl_dim_cow(dim
);
4886 nparam
= isl_set_dim(set
, isl_dim_param
);
4888 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4891 dim
->n_out
= nparam
;
4892 isl_set_reset_dim(set
, dim
);
4893 set
= isl_set_preimage(set
, mat
);
4896 dim
= isl_dim_copy(set
->dim
);
4897 dim
= isl_dim_cow(dim
);
4900 dim
->nparam
= dim
->n_out
;
4902 isl_set_reset_dim(set
, dim
);
4912 /* Intersect the basic set "bset" with the affine space specified by the
4913 * equalities in "eq".
4915 static struct isl_basic_set
*basic_set_append_equalities(
4916 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4924 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4929 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4930 for (i
= 0; i
< eq
->n_row
; ++i
) {
4931 k
= isl_basic_set_alloc_equality(bset
);
4934 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4935 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4939 bset
= isl_basic_set_gauss(bset
, NULL
);
4940 bset
= isl_basic_set_finalize(bset
);
4945 isl_basic_set_free(bset
);
4949 /* Intersect the set "set" with the affine space specified by the
4950 * equalities in "eq".
4952 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4960 for (i
= 0; i
< set
->n
; ++i
) {
4961 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4974 /* Project the given basic set onto its parameter domain, possibly introducing
4975 * new, explicit, existential variables in the constraints.
4976 * The input has parameters and (possibly implicit) existential variables.
4977 * The output has the same parameters, but only
4978 * explicit existentially quantified variables.
4980 * The actual projection is performed by pip, but pip doesn't seem
4981 * to like equalities very much, so we first remove the equalities
4982 * among the parameters by performing a variable compression on
4983 * the parameters. Afterward, an inverse transformation is performed
4984 * and the equalities among the parameters are inserted back in.
4986 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4990 struct isl_mat
*T
, *T2
;
4991 struct isl_set
*set
;
4992 unsigned nparam
, n_div
;
4994 bset
= isl_basic_set_cow(bset
);
4998 if (bset
->n_eq
== 0)
4999 return isl_basic_set_lexmin(bset
);
5001 isl_basic_set_gauss(bset
, NULL
);
5003 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5004 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5006 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5007 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5010 if (i
== bset
->n_eq
)
5011 return isl_basic_set_lexmin(bset
);
5013 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5015 eq
= isl_mat_cow(eq
);
5016 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5017 if (T
&& T
->n_col
== 0) {
5021 bset
= isl_basic_set_set_to_empty(bset
);
5022 return isl_set_from_basic_set(bset
);
5024 bset
= basic_set_parameter_preimage(bset
, T
);
5026 set
= isl_basic_set_lexmin(bset
);
5027 set
= set_parameter_preimage(set
, T2
);
5028 set
= set_append_equalities(set
, eq
);
5032 /* Compute an explicit representation for all the existentially
5033 * quantified variables.
5034 * The input and output dimensions are first turned into parameters.
5035 * compute_divs then returns a map with the same parameters and
5036 * no input or output dimensions and the dimension specification
5037 * is reset to that of the input.
5039 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5041 struct isl_basic_set
*bset
;
5042 struct isl_set
*set
;
5043 struct isl_map
*map
;
5044 struct isl_dim
*dim
, *orig_dim
= NULL
;
5049 bmap
= isl_basic_map_cow(bmap
);
5053 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5054 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5055 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5056 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5060 orig_dim
= bmap
->dim
;
5062 bset
= (struct isl_basic_set
*)bmap
;
5064 set
= parameter_compute_divs(bset
);
5065 map
= (struct isl_map
*)set
;
5066 map
= isl_map_reset_dim(map
, orig_dim
);
5070 isl_basic_map_free(bmap
);
5074 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5082 off
= isl_dim_total(bmap
->dim
);
5083 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5084 if (isl_int_is_zero(bmap
->div
[i
][0]))
5086 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5092 static int map_divs_known(__isl_keep isl_map
*map
)
5099 for (i
= 0; i
< map
->n
; ++i
) {
5100 int known
= basic_map_divs_known(map
->p
[i
]);
5108 /* If bmap contains any unknown divs, then compute explicit
5109 * expressions for them. However, this computation may be
5110 * quite expensive, so first try to remove divs that aren't
5113 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5117 struct isl_map
*map
;
5119 known
= basic_map_divs_known(bmap
);
5123 return isl_map_from_basic_map(bmap
);
5125 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5127 known
= basic_map_divs_known(bmap
);
5131 return isl_map_from_basic_map(bmap
);
5133 map
= compute_divs(bmap
);
5136 isl_basic_map_free(bmap
);
5140 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5144 struct isl_map
*res
;
5151 known
= map_divs_known(map
);
5159 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5160 for (i
= 1 ; i
< map
->n
; ++i
) {
5162 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5163 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5164 res
= isl_map_union_disjoint(res
, r2
);
5166 res
= isl_map_union(res
, r2
);
5173 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5175 return (struct isl_set
*)
5176 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5179 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5181 return (struct isl_set
*)
5182 isl_map_compute_divs((struct isl_map
*)set
);
5185 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5188 struct isl_set
*set
;
5193 map
= isl_map_cow(map
);
5197 set
= (struct isl_set
*)map
;
5198 set
->dim
= isl_dim_domain(set
->dim
);
5201 for (i
= 0; i
< map
->n
; ++i
) {
5202 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5206 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5207 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5214 struct isl_map
*isl_map_union_disjoint(
5215 struct isl_map
*map1
, struct isl_map
*map2
)
5219 struct isl_map
*map
= NULL
;
5233 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5235 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5236 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5237 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5239 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5240 map1
->n
+ map2
->n
, flags
);
5243 for (i
= 0; i
< map1
->n
; ++i
) {
5244 map
= isl_map_add_basic_map(map
,
5245 isl_basic_map_copy(map1
->p
[i
]));
5249 for (i
= 0; i
< map2
->n
; ++i
) {
5250 map
= isl_map_add_basic_map(map
,
5251 isl_basic_map_copy(map2
->p
[i
]));
5265 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5267 map1
= isl_map_union_disjoint(map1
, map2
);
5271 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5275 struct isl_set
*isl_set_union_disjoint(
5276 struct isl_set
*set1
, struct isl_set
*set2
)
5278 return (struct isl_set
*)
5279 isl_map_union_disjoint(
5280 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5283 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5285 return (struct isl_set
*)
5286 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5289 struct isl_map
*isl_map_intersect_range(
5290 struct isl_map
*map
, struct isl_set
*set
)
5293 struct isl_map
*result
;
5299 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5300 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5301 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5303 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5304 map
->n
* set
->n
, flags
);
5307 for (i
= 0; i
< map
->n
; ++i
)
5308 for (j
= 0; j
< set
->n
; ++j
) {
5309 result
= isl_map_add_basic_map(result
,
5310 isl_basic_map_intersect_range(
5311 isl_basic_map_copy(map
->p
[i
]),
5312 isl_basic_set_copy(set
->p
[j
])));
5325 struct isl_map
*isl_map_intersect_domain(
5326 struct isl_map
*map
, struct isl_set
*set
)
5328 return isl_map_reverse(
5329 isl_map_intersect_range(isl_map_reverse(map
), set
));
5332 struct isl_map
*isl_map_apply_domain(
5333 struct isl_map
*map1
, struct isl_map
*map2
)
5337 map1
= isl_map_reverse(map1
);
5338 map1
= isl_map_apply_range(map1
, map2
);
5339 return isl_map_reverse(map1
);
5346 struct isl_map
*isl_map_apply_range(
5347 struct isl_map
*map1
, struct isl_map
*map2
)
5349 struct isl_dim
*dim_result
;
5350 struct isl_map
*result
;
5356 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5357 isl_dim_copy(map2
->dim
));
5359 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5362 for (i
= 0; i
< map1
->n
; ++i
)
5363 for (j
= 0; j
< map2
->n
; ++j
) {
5364 result
= isl_map_add_basic_map(result
,
5365 isl_basic_map_apply_range(
5366 isl_basic_map_copy(map1
->p
[i
]),
5367 isl_basic_map_copy(map2
->p
[j
])));
5373 if (result
&& result
->n
<= 1)
5374 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5383 * returns range - domain
5385 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5387 isl_dim
*dims
, *target_dim
;
5388 struct isl_basic_set
*bset
;
5395 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5396 bmap
->dim
, isl_dim_out
),
5398 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5399 dim
= isl_basic_map_n_in(bmap
);
5400 nparam
= isl_basic_map_n_param(bmap
);
5401 bset
= isl_basic_set_from_basic_map(bmap
);
5402 bset
= isl_basic_set_cow(bset
);
5403 dims
= isl_basic_set_get_dim(bset
);
5404 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5405 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5406 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5407 for (i
= 0; i
< dim
; ++i
) {
5408 int j
= isl_basic_map_alloc_equality(
5409 (struct isl_basic_map
*)bset
);
5412 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5413 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5414 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5415 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5417 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5418 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5421 isl_basic_map_free(bmap
);
5426 * returns range - domain
5428 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5432 struct isl_set
*result
;
5437 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5438 map
->dim
, isl_dim_out
),
5440 dim
= isl_map_get_dim(map
);
5441 dim
= isl_dim_domain(dim
);
5442 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5445 for (i
= 0; i
< map
->n
; ++i
)
5446 result
= isl_set_add_basic_set(result
,
5447 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5455 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5457 struct isl_basic_map
*bmap
;
5465 nparam
= dims
->nparam
;
5467 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5471 for (i
= 0; i
< dim
; ++i
) {
5472 int j
= isl_basic_map_alloc_equality(bmap
);
5475 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5476 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5477 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5479 return isl_basic_map_finalize(bmap
);
5481 isl_basic_map_free(bmap
);
5485 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5487 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5490 return basic_map_identity(dim
);
5493 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5495 if (!model
|| !model
->dim
)
5497 isl_assert(model
->ctx
,
5498 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5499 return basic_map_identity(isl_dim_copy(model
->dim
));
5502 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5504 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5505 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5508 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5510 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5513 return map_identity(dim
);
5516 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5518 if (!model
|| !model
->dim
)
5520 isl_assert(model
->ctx
,
5521 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5522 return map_identity(isl_dim_copy(model
->dim
));
5525 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5527 if (!model
|| !model
->dim
)
5529 isl_assert(model
->ctx
,
5530 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5531 return map_identity(isl_dim_copy(model
->dim
));
5534 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5536 isl_dim
*dim
= isl_set_get_dim(set
);
5538 id
= isl_map_identity(dim
);
5539 return isl_map_intersect_range(id
, set
);
5542 /* Construct a basic set with all set dimensions having only non-negative
5545 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5550 struct isl_basic_set
*bset
;
5554 nparam
= dims
->nparam
;
5556 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5559 for (i
= 0; i
< dim
; ++i
) {
5560 int k
= isl_basic_set_alloc_inequality(bset
);
5563 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5564 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5568 isl_basic_set_free(bset
);
5572 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5573 enum isl_dim_type type
, unsigned first
, unsigned n
)
5576 isl_basic_set
*nonneg
= NULL
;
5577 isl_basic_set
*neg
= NULL
;
5584 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5586 for (i
= 0; i
< n
; ++i
) {
5590 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5591 k
= isl_basic_set_alloc_inequality(nonneg
);
5594 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5595 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5597 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5598 k
= isl_basic_set_alloc_inequality(neg
);
5601 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5602 isl_int_set_si(neg
->ineq
[k
][0], -1);
5603 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5605 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5610 isl_basic_set_free(nonneg
);
5611 isl_basic_set_free(neg
);
5616 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5618 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5621 int isl_basic_map_is_subset(
5622 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5625 struct isl_map
*map1
;
5626 struct isl_map
*map2
;
5628 if (!bmap1
|| !bmap2
)
5631 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5632 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5634 is_subset
= isl_map_is_subset(map1
, map2
);
5642 int isl_basic_map_is_equal(
5643 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5647 if (!bmap1
|| !bmap2
)
5649 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5652 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5656 int isl_basic_set_is_equal(
5657 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5659 return isl_basic_map_is_equal(
5660 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5663 int isl_map_is_empty(struct isl_map
*map
)
5670 for (i
= 0; i
< map
->n
; ++i
) {
5671 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5680 int isl_map_fast_is_empty(struct isl_map
*map
)
5682 return map
? map
->n
== 0 : -1;
5685 int isl_set_fast_is_empty(struct isl_set
*set
)
5687 return set
? set
->n
== 0 : -1;
5690 int isl_set_is_empty(struct isl_set
*set
)
5692 return isl_map_is_empty((struct isl_map
*)set
);
5695 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5700 return isl_dim_equal(map1
->dim
, map2
->dim
);
5703 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5708 return isl_dim_equal(set1
->dim
, set2
->dim
);
5711 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5717 is_subset
= isl_map_is_subset(map1
, map2
);
5720 is_subset
= isl_map_is_subset(map2
, map1
);
5724 int isl_basic_map_is_strict_subset(
5725 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5729 if (!bmap1
|| !bmap2
)
5731 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5734 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5735 if (is_subset
== -1)
5740 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5746 is_subset
= isl_map_is_subset(map1
, map2
);
5749 is_subset
= isl_map_is_subset(map2
, map1
);
5750 if (is_subset
== -1)
5755 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5757 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5760 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5764 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5767 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5771 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5774 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5781 for (i
= 0; i
< map
->n
; ++i
) {
5782 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5790 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5792 return isl_map_fast_is_universe((isl_map
*) set
);
5795 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5797 struct isl_basic_set
*bset
= NULL
;
5798 struct isl_vec
*sample
= NULL
;
5805 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5808 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5809 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5810 copy
= isl_basic_map_remove_redundancies(copy
);
5811 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5812 isl_basic_map_free(copy
);
5816 total
= 1 + isl_basic_map_total_dim(bmap
);
5817 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5818 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5824 isl_vec_free(bmap
->sample
);
5825 bmap
->sample
= NULL
;
5826 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5829 sample
= isl_basic_set_sample_vec(bset
);
5832 empty
= sample
->size
== 0;
5833 isl_vec_free(bmap
->sample
);
5834 bmap
->sample
= sample
;
5836 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5841 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5845 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5848 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5852 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5855 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5857 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5860 struct isl_map
*isl_basic_map_union(
5861 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5863 struct isl_map
*map
;
5864 if (!bmap1
|| !bmap2
)
5867 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5869 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5872 map
= isl_map_add_basic_map(map
, bmap1
);
5873 map
= isl_map_add_basic_map(map
, bmap2
);
5876 isl_basic_map_free(bmap1
);
5877 isl_basic_map_free(bmap2
);
5881 struct isl_set
*isl_basic_set_union(
5882 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5884 return (struct isl_set
*)isl_basic_map_union(
5885 (struct isl_basic_map
*)bset1
,
5886 (struct isl_basic_map
*)bset2
);
5889 /* Order divs such that any div only depends on previous divs */
5890 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5898 off
= isl_dim_total(bmap
->dim
);
5900 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5902 if (isl_int_is_zero(bmap
->div
[i
][0]))
5904 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5908 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5914 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5916 return (struct isl_basic_set
*)
5917 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5920 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5927 for (i
= 0; i
< map
->n
; ++i
) {
5928 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5939 /* Look for a div in dst that corresponds to the div "div" in src.
5940 * The divs before "div" in src and dst are assumed to be the same.
5942 * Returns -1 if no corresponding div was found and the position
5943 * of the corresponding div in dst otherwise.
5945 static int find_div(struct isl_basic_map
*dst
,
5946 struct isl_basic_map
*src
, unsigned div
)
5950 unsigned total
= isl_dim_total(src
->dim
);
5952 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5953 for (i
= div
; i
< dst
->n_div
; ++i
)
5954 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5955 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5956 dst
->n_div
- div
) == -1)
5961 struct isl_basic_map
*isl_basic_map_align_divs(
5962 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5965 unsigned total
= isl_dim_total(src
->dim
);
5970 if (src
->n_div
== 0)
5973 for (i
= 0; i
< src
->n_div
; ++i
)
5974 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5976 src
= isl_basic_map_order_divs(src
);
5977 dst
= isl_basic_map_cow(dst
);
5978 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5979 src
->n_div
, 0, 2 * src
->n_div
);
5982 for (i
= 0; i
< src
->n_div
; ++i
) {
5983 int j
= find_div(dst
, src
, i
);
5985 j
= isl_basic_map_alloc_div(dst
);
5988 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5989 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5990 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5994 isl_basic_map_swap_div(dst
, i
, j
);
5998 isl_basic_map_free(dst
);
6002 struct isl_basic_set
*isl_basic_set_align_divs(
6003 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6005 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6006 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6009 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6017 map
= isl_map_compute_divs(map
);
6018 map
= isl_map_cow(map
);
6022 for (i
= 1; i
< map
->n
; ++i
)
6023 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6024 for (i
= 1; i
< map
->n
; ++i
)
6025 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6027 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6031 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6033 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6036 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6040 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6041 map
= isl_map_intersect_domain(map
, set
);
6042 set
= isl_map_range(map
);
6050 /* There is no need to cow as removing empty parts doesn't change
6051 * the meaning of the set.
6053 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6060 for (i
= map
->n
-1; i
>= 0; --i
) {
6061 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6063 isl_basic_map_free(map
->p
[i
]);
6064 if (i
!= map
->n
-1) {
6065 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6066 map
->p
[i
] = map
->p
[map
->n
-1];
6074 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6076 return (struct isl_set
*)
6077 isl_map_remove_empty_parts((struct isl_map
*)set
);
6080 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6082 struct isl_basic_map
*bmap
;
6083 if (!map
|| map
->n
== 0)
6085 bmap
= map
->p
[map
->n
-1];
6086 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6087 return isl_basic_map_copy(bmap
);
6090 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6092 return (struct isl_basic_set
*)
6093 isl_map_copy_basic_map((struct isl_map
*)set
);
6096 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6097 __isl_keep isl_basic_map
*bmap
)
6103 for (i
= map
->n
-1; i
>= 0; --i
) {
6104 if (map
->p
[i
] != bmap
)
6106 map
= isl_map_cow(map
);
6109 isl_basic_map_free(map
->p
[i
]);
6110 if (i
!= map
->n
-1) {
6111 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6112 map
->p
[i
] = map
->p
[map
->n
-1];
6123 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6124 struct isl_basic_set
*bset
)
6126 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6127 (struct isl_basic_map
*)bset
);
6130 /* Given two basic sets bset1 and bset2, compute the maximal difference
6131 * between the values of dimension pos in bset1 and those in bset2
6132 * for any common value of the parameters and dimensions preceding pos.
6134 static enum isl_lp_result
basic_set_maximal_difference_at(
6135 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6136 int pos
, isl_int
*opt
)
6138 struct isl_dim
*dims
;
6139 struct isl_basic_map
*bmap1
= NULL
;
6140 struct isl_basic_map
*bmap2
= NULL
;
6141 struct isl_ctx
*ctx
;
6142 struct isl_vec
*obj
;
6145 unsigned dim1
, dim2
;
6146 enum isl_lp_result res
;
6148 if (!bset1
|| !bset2
)
6149 return isl_lp_error
;
6151 nparam
= isl_basic_set_n_param(bset1
);
6152 dim1
= isl_basic_set_n_dim(bset1
);
6153 dim2
= isl_basic_set_n_dim(bset2
);
6154 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6155 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6156 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6157 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6158 if (!bmap1
|| !bmap2
)
6160 bmap1
= isl_basic_map_cow(bmap1
);
6161 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6162 pos
, (dim1
- pos
) + (dim2
- pos
),
6163 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6164 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6167 total
= isl_basic_map_total_dim(bmap1
);
6169 obj
= isl_vec_alloc(ctx
, 1 + total
);
6170 isl_seq_clr(obj
->block
.data
, 1 + total
);
6171 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6172 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6175 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6177 isl_basic_map_free(bmap1
);
6181 isl_basic_map_free(bmap1
);
6182 isl_basic_map_free(bmap2
);
6183 return isl_lp_error
;
6186 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6187 * for any common value of the parameters and dimensions preceding pos
6188 * in both basic sets, the values of dimension pos in bset1 are
6189 * smaller or larger than those in bset2.
6192 * 1 if bset1 follows bset2
6193 * -1 if bset1 precedes bset2
6194 * 0 if bset1 and bset2 are incomparable
6195 * -2 if some error occurred.
6197 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6198 struct isl_basic_set
*bset2
, int pos
)
6201 enum isl_lp_result res
;
6206 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6208 if (res
== isl_lp_empty
)
6210 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6211 res
== isl_lp_unbounded
)
6213 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6222 /* Given two basic sets bset1 and bset2, check whether
6223 * for any common value of the parameters and dimensions preceding pos
6224 * there is a value of dimension pos in bset1 that is larger
6225 * than a value of the same dimension in bset2.
6228 * 1 if there exists such a pair
6229 * 0 if there is no such pair, but there is a pair of equal values
6231 * -2 if some error occurred.
6233 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6234 __isl_keep isl_basic_set
*bset2
, int pos
)
6237 enum isl_lp_result res
;
6242 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6244 if (res
== isl_lp_empty
)
6246 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6247 res
== isl_lp_unbounded
)
6249 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6251 else if (res
== isl_lp_ok
)
6260 /* Given two sets set1 and set2, check whether
6261 * for any common value of the parameters and dimensions preceding pos
6262 * there is a value of dimension pos in set1 that is larger
6263 * than a value of the same dimension in set2.
6266 * 1 if there exists such a pair
6267 * 0 if there is no such pair, but there is a pair of equal values
6269 * -2 if some error occurred.
6271 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6272 __isl_keep isl_set
*set2
, int pos
)
6280 for (i
= 0; i
< set1
->n
; ++i
)
6281 for (j
= 0; j
< set2
->n
; ++j
) {
6283 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6284 if (f
== 1 || f
== -2)
6293 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6294 unsigned pos
, isl_int
*val
)
6302 total
= isl_basic_map_total_dim(bmap
);
6303 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6304 for (; d
+1 > pos
; --d
)
6305 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6309 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6311 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6313 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6316 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6322 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6323 unsigned pos
, isl_int
*val
)
6335 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6338 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6339 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6340 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6341 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6345 isl_int_set(*val
, v
);
6351 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6352 unsigned pos
, isl_int
*val
)
6354 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6358 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6361 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6364 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6365 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6367 if (pos
>= isl_basic_map_dim(bmap
, type
))
6369 return isl_basic_map_fast_has_fixed_var(bmap
,
6370 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6373 int isl_map_fast_is_fixed(struct isl_map
*map
,
6374 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6376 if (pos
>= isl_map_dim(map
, type
))
6378 return isl_map_fast_has_fixed_var(map
,
6379 map_offset(map
, type
) - 1 + pos
, val
);
6382 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6383 * then return this fixed value in *val.
6385 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6388 return isl_basic_set_fast_has_fixed_var(bset
,
6389 isl_basic_set_n_param(bset
) + dim
, val
);
6392 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6393 * then return this fixed value in *val.
6395 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6397 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6400 /* Check if input variable in has fixed value and if so and if val is not NULL,
6401 * then return this fixed value in *val.
6403 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6405 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6408 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6409 * and if val is not NULL, then return this lower bound in *val.
6411 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6412 unsigned dim
, isl_int
*val
)
6414 int i
, i_eq
= -1, i_ineq
= -1;
6421 total
= isl_basic_set_total_dim(bset
);
6422 nparam
= isl_basic_set_n_param(bset
);
6423 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6424 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6430 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6431 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6433 if (i_eq
!= -1 || i_ineq
!= -1)
6437 if (i_eq
== -1 && i_ineq
== -1)
6439 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6440 /* The coefficient should always be one due to normalization. */
6441 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6443 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6445 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6446 total
- nparam
- dim
- 1) != -1)
6449 isl_int_neg(*val
, c
[0]);
6453 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6454 unsigned dim
, isl_int
*val
)
6466 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6470 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6472 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6473 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6475 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6479 isl_int_set(*val
, v
);
6490 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6492 const struct constraint
*c1
= (const struct constraint
*)p1
;
6493 const struct constraint
*c2
= (const struct constraint
*)p2
;
6494 unsigned size
= isl_min(c1
->size
, c2
->size
);
6495 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6498 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6499 struct isl_basic_map
*bmap
)
6502 struct constraint
*c
;
6507 total
= isl_basic_map_total_dim(bmap
);
6508 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6511 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6513 c
[i
].c
= bmap
->ineq
[i
];
6515 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6516 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6517 bmap
->ineq
[i
] = c
[i
].c
;
6521 isl_basic_map_free(bmap
);
6525 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6526 __isl_take isl_basic_set
*bset
)
6528 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6529 (struct isl_basic_map
*)bset
);
6532 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6536 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6538 bmap
= isl_basic_map_remove_redundancies(bmap
);
6539 bmap
= isl_basic_map_sort_constraints(bmap
);
6540 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6544 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6546 return (struct isl_basic_set
*)isl_basic_map_normalize(
6547 (struct isl_basic_map
*)bset
);
6550 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6551 const __isl_keep isl_basic_map
*bmap2
)
6558 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6559 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6560 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6561 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6562 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6563 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6564 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6565 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6567 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6569 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6571 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6572 return bmap1
->n_eq
- bmap2
->n_eq
;
6573 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6574 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6575 if (bmap1
->n_div
!= bmap2
->n_div
)
6576 return bmap1
->n_div
- bmap2
->n_div
;
6577 total
= isl_basic_map_total_dim(bmap1
);
6578 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6579 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6583 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6584 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6588 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6589 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6596 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6597 __isl_keep isl_basic_map
*bmap2
)
6599 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6602 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6603 __isl_keep isl_basic_set
*bset2
)
6605 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6606 (isl_basic_map
*)bset2
);
6609 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6611 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6612 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6614 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6617 /* We normalize in place, but if anything goes wrong we need
6618 * to return NULL, so we need to make sure we don't change the
6619 * meaning of any possible other copies of map.
6621 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6624 struct isl_basic_map
*bmap
;
6628 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6630 for (i
= 0; i
< map
->n
; ++i
) {
6631 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6634 isl_basic_map_free(map
->p
[i
]);
6637 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6638 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6639 map
= isl_map_remove_empty_parts(map
);
6642 for (i
= map
->n
- 1; i
>= 1; --i
) {
6643 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6645 isl_basic_map_free(map
->p
[i
-1]);
6646 for (j
= i
; j
< map
->n
; ++j
)
6647 map
->p
[j
-1] = map
->p
[j
];
6657 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6659 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6662 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6672 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6675 map1
= isl_map_copy(map1
);
6676 map2
= isl_map_copy(map2
);
6677 map1
= isl_map_normalize(map1
);
6678 map2
= isl_map_normalize(map2
);
6681 equal
= map1
->n
== map2
->n
;
6682 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6683 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6696 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6698 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6699 (struct isl_map
*)set2
);
6702 /* Return an interval that ranges from min to max (inclusive)
6704 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6705 isl_int min
, isl_int max
)
6708 struct isl_basic_set
*bset
= NULL
;
6710 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6714 k
= isl_basic_set_alloc_inequality(bset
);
6717 isl_int_set_si(bset
->ineq
[k
][1], 1);
6718 isl_int_neg(bset
->ineq
[k
][0], min
);
6720 k
= isl_basic_set_alloc_inequality(bset
);
6723 isl_int_set_si(bset
->ineq
[k
][1], -1);
6724 isl_int_set(bset
->ineq
[k
][0], max
);
6728 isl_basic_set_free(bset
);
6732 /* Return the Cartesian product of the basic sets in list (in the given order).
6734 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6742 struct isl_basic_set
*product
= NULL
;
6746 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6747 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6748 nparam
= isl_basic_set_n_param(list
->p
[0]);
6749 dim
= isl_basic_set_n_dim(list
->p
[0]);
6750 extra
= list
->p
[0]->n_div
;
6751 n_eq
= list
->p
[0]->n_eq
;
6752 n_ineq
= list
->p
[0]->n_ineq
;
6753 for (i
= 1; i
< list
->n
; ++i
) {
6754 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6755 isl_assert(list
->ctx
,
6756 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6757 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6758 extra
+= list
->p
[i
]->n_div
;
6759 n_eq
+= list
->p
[i
]->n_eq
;
6760 n_ineq
+= list
->p
[i
]->n_ineq
;
6762 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6767 for (i
= 0; i
< list
->n
; ++i
) {
6768 isl_basic_set_add_constraints(product
,
6769 isl_basic_set_copy(list
->p
[i
]), dim
);
6770 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6772 isl_basic_set_list_free(list
);
6775 isl_basic_set_free(product
);
6776 isl_basic_set_list_free(list
);
6780 struct isl_basic_map
*isl_basic_map_product(
6781 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6783 struct isl_dim
*dim_result
= NULL
;
6784 struct isl_basic_map
*bmap
;
6785 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6786 struct isl_dim_map
*dim_map1
, *dim_map2
;
6788 if (!bmap1
|| !bmap2
)
6791 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6792 bmap2
->dim
, isl_dim_param
), goto error
);
6793 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6794 isl_dim_copy(bmap2
->dim
));
6796 in1
= isl_basic_map_n_in(bmap1
);
6797 in2
= isl_basic_map_n_in(bmap2
);
6798 out1
= isl_basic_map_n_out(bmap1
);
6799 out2
= isl_basic_map_n_out(bmap2
);
6800 nparam
= isl_basic_map_n_param(bmap1
);
6802 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6803 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6804 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6805 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6806 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6807 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6808 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6809 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6810 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6811 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6812 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6814 bmap
= isl_basic_map_alloc_dim(dim_result
,
6815 bmap1
->n_div
+ bmap2
->n_div
,
6816 bmap1
->n_eq
+ bmap2
->n_eq
,
6817 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6818 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6819 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6820 bmap
= isl_basic_map_simplify(bmap
);
6821 return isl_basic_map_finalize(bmap
);
6823 isl_basic_map_free(bmap1
);
6824 isl_basic_map_free(bmap2
);
6828 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6830 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6833 struct isl_map
*result
;
6839 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6840 map2
->dim
, isl_dim_param
), goto error
);
6842 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6843 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6844 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6846 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6847 isl_dim_copy(map2
->dim
)),
6848 map1
->n
* map2
->n
, flags
);
6851 for (i
= 0; i
< map1
->n
; ++i
)
6852 for (j
= 0; j
< map2
->n
; ++j
) {
6853 struct isl_basic_map
*part
;
6854 part
= isl_basic_map_product(
6855 isl_basic_map_copy(map1
->p
[i
]),
6856 isl_basic_map_copy(map2
->p
[j
]));
6857 if (isl_basic_map_is_empty(part
))
6858 isl_basic_map_free(part
);
6860 result
= isl_map_add_basic_map(result
, part
);
6873 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6875 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
6876 __isl_take isl_map
*map2
)
6880 prod
= isl_map_product(map1
, map2
);
6881 prod
= isl_map_flatten(prod
);
6885 /* Given two set A and B, construct its Cartesian product A x B.
6887 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6889 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6890 (struct isl_map
*)set2
);
6893 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
6894 __isl_take isl_set
*set2
)
6896 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
6899 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6902 uint32_t hash
= isl_hash_init();
6907 bset
= isl_basic_set_copy(bset
);
6908 bset
= isl_basic_set_normalize(bset
);
6911 total
= isl_basic_set_total_dim(bset
);
6912 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6913 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6915 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6916 isl_hash_hash(hash
, c_hash
);
6918 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6919 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6921 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6922 isl_hash_hash(hash
, c_hash
);
6924 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6925 for (i
= 0; i
< bset
->n_div
; ++i
) {
6927 if (isl_int_is_zero(bset
->div
[i
][0]))
6929 isl_hash_byte(hash
, i
& 0xFF);
6930 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6931 isl_hash_hash(hash
, c_hash
);
6933 isl_basic_set_free(bset
);
6937 uint32_t isl_set_get_hash(struct isl_set
*set
)
6944 set
= isl_set_copy(set
);
6945 set
= isl_set_normalize(set
);
6949 hash
= isl_hash_init();
6950 for (i
= 0; i
< set
->n
; ++i
) {
6952 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6953 isl_hash_hash(hash
, bset_hash
);
6961 /* Check if the value for dimension dim is completely determined
6962 * by the values of the other parameters and variables.
6963 * That is, check if dimension dim is involved in an equality.
6965 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6972 nparam
= isl_basic_set_n_param(bset
);
6973 for (i
= 0; i
< bset
->n_eq
; ++i
)
6974 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6979 /* Check if the value for dimension dim is completely determined
6980 * by the values of the other parameters and variables.
6981 * That is, check if dimension dim is involved in an equality
6982 * for each of the subsets.
6984 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6990 for (i
= 0; i
< set
->n
; ++i
) {
6992 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6999 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7001 return set
? set
->n
: 0;
7004 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7005 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7012 for (i
= 0; i
< map
->n
; ++i
)
7013 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7019 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7020 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7027 for (i
= 0; i
< set
->n
; ++i
)
7028 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7034 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7036 struct isl_dim
*dim
;
7041 if (bset
->n_div
== 0)
7044 bset
= isl_basic_set_cow(bset
);
7048 dim
= isl_basic_set_get_dim(bset
);
7049 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
7052 isl_dim_free(bset
->dim
);
7056 bset
= isl_basic_set_finalize(bset
);
7060 isl_basic_set_free(bset
);
7064 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7067 struct isl_dim
*dim
;
7070 set
= isl_set_align_divs(set
);
7074 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
7077 set
= isl_set_cow(set
);
7081 n_div
= set
->p
[0]->n_div
;
7082 dim
= isl_set_get_dim(set
);
7083 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
7086 isl_dim_free(set
->dim
);
7089 for (i
= 0; i
< set
->n
; ++i
) {
7090 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7101 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7103 struct isl_dim
*dim
;
7104 struct isl_basic_map
*bmap
;
7111 set
= isl_set_align_divs(set
);
7116 dim
= isl_set_get_dim(set
);
7117 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7119 return isl_map_identity(dim
);
7122 n_div
= set
->p
[0]->n_div
;
7123 dim
= isl_dim_map(dim
);
7124 n_param
= isl_dim_size(dim
, isl_dim_param
);
7125 n_set
= isl_dim_size(dim
, isl_dim_in
);
7126 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7127 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7128 for (i
= 0; i
< n_set
; ++i
)
7129 bmap
= var_equal(bmap
, i
);
7131 total
= n_param
+ n_set
+ n_set
+ n_div
;
7132 for (i
= 0; i
< n_div
; ++i
) {
7133 k
= isl_basic_map_alloc_inequality(bmap
);
7136 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7137 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7138 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7139 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7140 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7141 set
->p
[0]->div
[i
][0]);
7143 l
= isl_basic_map_alloc_inequality(bmap
);
7146 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7147 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7148 set
->p
[0]->div
[i
][0]);
7149 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7153 return isl_map_from_basic_map(bmap
);
7156 isl_basic_map_free(bmap
);
7160 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7168 dim
= isl_basic_set_total_dim(bset
);
7169 size
+= bset
->n_eq
* (1 + dim
);
7170 size
+= bset
->n_ineq
* (1 + dim
);
7171 size
+= bset
->n_div
* (2 + dim
);
7176 int isl_set_size(__isl_keep isl_set
*set
)
7184 for (i
= 0; i
< set
->n
; ++i
)
7185 size
+= isl_basic_set_size(set
->p
[i
]);
7190 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7191 enum isl_dim_type type
, unsigned pos
)
7199 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7201 pos
+= isl_basic_map_offset(bmap
, type
);
7203 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7204 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7208 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7209 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7216 return lower
&& upper
;
7219 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7220 enum isl_dim_type type
, unsigned pos
)
7227 for (i
= 0; i
< map
->n
; ++i
) {
7229 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7230 if (bounded
< 0 || !bounded
)
7237 /* Return 1 if the specified dim is involved in both an upper bound
7238 * and a lower bound.
7240 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7241 enum isl_dim_type type
, unsigned pos
)
7243 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7246 /* For each of the "n" variables starting at "first", determine
7247 * the sign of the variable and put the results in the first "n"
7248 * elements of the array "signs".
7250 * 1 means that the variable is non-negative
7251 * -1 means that the variable is non-positive
7252 * 0 means the variable attains both positive and negative values.
7254 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7255 unsigned first
, unsigned n
, int *signs
)
7257 isl_vec
*bound
= NULL
;
7258 struct isl_tab
*tab
= NULL
;
7259 struct isl_tab_undo
*snap
;
7262 if (!bset
|| !signs
)
7265 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7266 tab
= isl_tab_from_basic_set(bset
);
7270 isl_seq_clr(bound
->el
, bound
->size
);
7271 isl_int_set_si(bound
->el
[0], -1);
7273 snap
= isl_tab_snap(tab
);
7274 for (i
= 0; i
< n
; ++i
) {
7277 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7278 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7281 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7282 if (isl_tab_rollback(tab
, snap
) < 0)
7290 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7291 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7294 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7295 if (isl_tab_rollback(tab
, snap
) < 0)
7298 signs
[i
] = empty
? -1 : 0;
7302 isl_vec_free(bound
);
7306 isl_vec_free(bound
);
7310 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7311 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7313 if (!bset
|| !signs
)
7315 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7318 first
+= pos(bset
->dim
, type
) - 1;
7319 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7322 /* Check if the given map is single-valued.
7327 * and check if the result is a subset of the identity mapping.
7329 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7335 test
= isl_map_reverse(isl_map_copy(map
));
7336 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7338 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7340 sv
= isl_map_is_subset(test
, id
);
7348 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7352 sv
= isl_map_is_single_valued(map
);
7356 map
= isl_map_copy(map
);
7357 map
= isl_map_reverse(map
);
7358 sv
= isl_map_is_single_valued(map
);
7364 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7366 return isl_map_is_single_valued((isl_map
*)set
);
7369 int isl_map_is_translation(__isl_keep isl_map
*map
)
7374 delta
= isl_map_deltas(isl_map_copy(map
));
7375 ok
= isl_set_is_singleton(delta
);
7376 isl_set_free(delta
);
7381 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7383 if (isl_seq_first_non_zero(p
, pos
) != -1)
7385 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7390 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7399 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7402 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7403 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7404 for (j
= 0; j
< nvar
; ++j
) {
7405 int lower
= 0, upper
= 0;
7406 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7407 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7409 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7415 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7416 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7418 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7420 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7425 if (!lower
|| !upper
)
7432 int isl_set_is_box(__isl_keep isl_set
*set
)
7439 return isl_basic_set_is_box(set
->p
[0]);
7442 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7447 return isl_dim_is_wrapping(bset
->dim
);
7450 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7455 return isl_dim_is_wrapping(set
->dim
);
7458 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7460 bmap
= isl_basic_map_cow(bmap
);
7464 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7468 bmap
= isl_basic_map_finalize(bmap
);
7470 return (isl_basic_set
*)bmap
;
7472 isl_basic_map_free(bmap
);
7476 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7480 map
= isl_map_cow(map
);
7484 for (i
= 0; i
< map
->n
; ++i
) {
7485 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7489 map
->dim
= isl_dim_wrap(map
->dim
);
7493 return (isl_set
*)map
;
7499 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7501 bset
= isl_basic_set_cow(bset
);
7505 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7509 bset
= isl_basic_set_finalize(bset
);
7511 return (isl_basic_map
*)bset
;
7513 isl_basic_set_free(bset
);
7517 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7524 if (!isl_set_is_wrapping(set
))
7525 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7528 set
= isl_set_cow(set
);
7532 for (i
= 0; i
< set
->n
; ++i
) {
7533 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7538 set
->dim
= isl_dim_unwrap(set
->dim
);
7542 return (isl_map
*)set
;
7548 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7549 enum isl_dim_type type
)
7554 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7557 bmap
= isl_basic_map_cow(bmap
);
7561 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7565 bmap
= isl_basic_map_finalize(bmap
);
7569 isl_basic_map_free(bmap
);
7573 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7574 enum isl_dim_type type
)
7581 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7584 map
= isl_map_cow(map
);
7588 for (i
= 0; i
< map
->n
; ++i
) {
7589 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7593 map
->dim
= isl_dim_reset(map
->dim
, type
);
7603 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7608 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7611 bmap
= isl_basic_map_cow(bmap
);
7615 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7619 bmap
= isl_basic_map_finalize(bmap
);
7623 isl_basic_map_free(bmap
);
7627 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7634 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7637 map
= isl_map_cow(map
);
7641 for (i
= 0; i
< map
->n
; ++i
) {
7642 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7646 map
->dim
= isl_dim_flatten(map
->dim
);
7656 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
7658 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
7661 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
7663 isl_dim
*dim
, *flat_dim
;
7666 dim
= isl_set_get_dim(set
);
7667 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
7668 map
= map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
7669 map
= isl_map_intersect_domain(map
, set
);
7674 /* Extend the given dim_map with mappings for the divs in bmap.
7676 static __isl_give
struct isl_dim_map
*extend_dim_map(
7677 __isl_keep
struct isl_dim_map
*dim_map
,
7678 __isl_keep isl_basic_map
*bmap
)
7681 struct isl_dim_map
*res
;
7684 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7686 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7690 for (i
= 0; i
< dim_map
->len
; ++i
)
7691 res
->pos
[i
] = dim_map
->pos
[i
];
7692 for (i
= 0; i
< bmap
->n_div
; ++i
)
7693 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7698 /* Extract a dim_map from a reordering.
7699 * We essentially need to reverse the mapping, and add an offset
7700 * of 1 for the constant term.
7702 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7703 __isl_keep isl_reordering
*exp
)
7706 struct isl_dim_map
*dim_map
;
7711 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7715 for (i
= 0; i
< exp
->len
; ++i
)
7716 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7721 /* Reorder the dimensions of "bmap" according to the given dim_map
7722 * and set the dimension specification to "dim".
7724 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7725 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
7729 bmap
= isl_basic_map_cow(bmap
);
7730 if (!bmap
|| !dim
|| !dim_map
)
7733 res
= isl_basic_map_alloc_dim(dim
,
7734 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
7735 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
7736 res
= isl_basic_map_finalize(res
);
7740 isl_basic_map_free(bmap
);
7745 /* Reorder the dimensions of "map" according to given reordering.
7747 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
7748 __isl_take isl_reordering
*r
)
7751 struct isl_dim_map
*dim_map
;
7753 map
= isl_map_cow(map
);
7754 dim_map
= isl_dim_map_from_reordering(r
);
7755 if (!map
|| !r
|| !dim_map
)
7758 for (i
= 0; i
< map
->n
; ++i
) {
7759 struct isl_dim_map
*dim_map_i
;
7761 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
7763 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
7764 isl_dim_copy(r
->dim
), dim_map_i
);
7770 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
7772 isl_reordering_free(r
);
7778 isl_reordering_free(r
);
7782 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
7783 __isl_take isl_reordering
*r
)
7785 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
7788 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
7789 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7790 enum isl_dim_type c2
, enum isl_dim_type c3
,
7791 enum isl_dim_type c4
, enum isl_dim_type c5
)
7793 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7794 struct isl_mat
*mat
;
7800 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
7801 isl_basic_map_total_dim(bmap
) + 1);
7804 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7805 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7806 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7807 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7808 isl_int_set(mat
->row
[i
][pos
],
7809 bmap
->eq
[i
][off
+ k
]);
7817 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
7818 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7819 enum isl_dim_type c2
, enum isl_dim_type c3
,
7820 enum isl_dim_type c4
, enum isl_dim_type c5
)
7822 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7823 struct isl_mat
*mat
;
7829 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
7830 isl_basic_map_total_dim(bmap
) + 1);
7833 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7834 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7835 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7836 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7837 isl_int_set(mat
->row
[i
][pos
],
7838 bmap
->ineq
[i
][off
+ k
]);
7846 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
7847 __isl_take isl_dim
*dim
,
7848 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
7849 enum isl_dim_type c2
, enum isl_dim_type c3
,
7850 enum isl_dim_type c4
, enum isl_dim_type c5
)
7852 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7853 isl_basic_map
*bmap
;
7859 if (!dim
|| !eq
|| !ineq
)
7862 if (eq
->n_col
!= ineq
->n_col
)
7863 isl_die(dim
->ctx
, isl_error_invalid
,
7864 "equalities and inequalities matrices should have "
7865 "same number of columns", goto error
);
7867 total
= 1 + isl_dim_total(dim
);
7869 if (eq
->n_col
< total
)
7870 isl_die(dim
->ctx
, isl_error_invalid
,
7871 "number of columns too small", goto error
);
7873 extra
= eq
->n_col
- total
;
7875 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
7876 eq
->n_row
, ineq
->n_row
);
7879 for (i
= 0; i
< extra
; ++i
)
7880 if (isl_basic_map_alloc_div(bmap
) < 0)
7882 for (i
= 0; i
< eq
->n_row
; ++i
) {
7883 l
= isl_basic_map_alloc_equality(bmap
);
7886 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7887 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7888 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7889 isl_int_set(bmap
->eq
[l
][off
+ k
],
7895 for (i
= 0; i
< ineq
->n_row
; ++i
) {
7896 l
= isl_basic_map_alloc_inequality(bmap
);
7899 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7900 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7901 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7902 isl_int_set(bmap
->ineq
[l
][off
+ k
],
7921 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
7922 __isl_take isl_dim
*dim
,
7923 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
7924 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
7926 return (isl_basic_set
*)
7927 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
7928 c1
, c2
, c3
, c4
, isl_dim_in
);