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, return NULL
);
527 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
528 return (struct isl_basic_set
*)bmap
;
531 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
532 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
534 struct isl_basic_map
*bmap
;
538 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
543 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
549 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
550 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
551 unsigned n_eq
, unsigned n_ineq
)
553 struct isl_basic_map
*bmap
;
556 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
560 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
564 static void dup_constraints(
565 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
568 unsigned total
= isl_basic_map_total_dim(src
);
570 for (i
= 0; i
< src
->n_eq
; ++i
) {
571 int j
= isl_basic_map_alloc_equality(dst
);
572 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
575 for (i
= 0; i
< src
->n_ineq
; ++i
) {
576 int j
= isl_basic_map_alloc_inequality(dst
);
577 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
580 for (i
= 0; i
< src
->n_div
; ++i
) {
581 int j
= isl_basic_map_alloc_div(dst
);
582 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
584 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
587 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
589 struct isl_basic_map
*dup
;
593 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
594 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
597 dup_constraints(dup
, bmap
);
598 dup
->flags
= bmap
->flags
;
599 dup
->sample
= isl_vec_copy(bmap
->sample
);
603 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
605 struct isl_basic_map
*dup
;
607 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
608 return (struct isl_basic_set
*)dup
;
611 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
616 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
620 return isl_basic_set_dup(bset
);
623 struct isl_set
*isl_set_copy(struct isl_set
*set
)
632 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
637 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
641 bmap
= isl_basic_map_dup(bmap
);
643 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
647 struct isl_map
*isl_map_copy(struct isl_map
*map
)
656 void isl_basic_map_free(struct isl_basic_map
*bmap
)
664 isl_ctx_deref(bmap
->ctx
);
666 isl_blk_free(bmap
->ctx
, bmap
->block2
);
668 isl_blk_free(bmap
->ctx
, bmap
->block
);
669 isl_vec_free(bmap
->sample
);
670 isl_dim_free(bmap
->dim
);
674 void isl_basic_set_free(struct isl_basic_set
*bset
)
676 isl_basic_map_free((struct isl_basic_map
*)bset
);
679 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
681 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
684 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
690 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
691 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
693 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
694 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
695 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
696 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
697 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
698 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
700 int j
= isl_basic_map_alloc_inequality(bmap
);
704 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
705 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
712 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
713 bmap
->extra
- bmap
->n_div
);
717 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
719 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
722 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
726 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
731 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
733 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
736 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
741 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
743 if (pos
!= bmap
->n_eq
- 1) {
745 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
746 bmap
->eq
[bmap
->n_eq
- 1] = t
;
752 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
754 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
757 void isl_basic_map_inequality_to_equality(
758 struct isl_basic_map
*bmap
, unsigned pos
)
763 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
764 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
769 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
770 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
771 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
772 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
775 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
777 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
780 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
786 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
787 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
788 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
789 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
790 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
791 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
792 1 + isl_basic_map_total_dim(bmap
),
793 bmap
->extra
- bmap
->n_div
);
794 return bmap
->n_ineq
++;
797 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
799 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
802 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
806 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
811 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
813 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
816 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
821 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
823 if (pos
!= bmap
->n_ineq
- 1) {
825 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
826 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
827 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
833 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
835 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
838 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
843 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
846 k
= isl_basic_map_alloc_equality(bmap
);
849 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
852 isl_basic_map_free(bmap
);
856 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
859 return (isl_basic_set
*)
860 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
863 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
868 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
871 k
= isl_basic_map_alloc_inequality(bmap
);
874 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
877 isl_basic_map_free(bmap
);
881 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
884 return (isl_basic_set
*)
885 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
888 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
892 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
893 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
894 1 + 1 + isl_basic_map_total_dim(bmap
),
895 bmap
->extra
- bmap
->n_div
);
896 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
897 return bmap
->n_div
++;
900 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
902 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
905 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
909 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
914 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
916 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
919 /* Copy constraint from src to dst, putting the vars of src at offset
920 * dim_off in dst and the divs of src at offset div_off in dst.
921 * If both sets are actually map, then dim_off applies to the input
924 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
925 struct isl_basic_map
*src_map
, isl_int
*src
,
926 unsigned in_off
, unsigned out_off
, unsigned div_off
)
928 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
929 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
930 unsigned src_in
= isl_basic_map_n_in(src_map
);
931 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
932 unsigned src_out
= isl_basic_map_n_out(src_map
);
933 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
934 isl_int_set(dst
[0], src
[0]);
935 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
936 if (dst_nparam
> src_nparam
)
937 isl_seq_clr(dst
+1+src_nparam
,
938 dst_nparam
- src_nparam
);
939 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
940 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
942 isl_min(dst_in
-in_off
, src_in
));
943 if (dst_in
-in_off
> src_in
)
944 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
945 dst_in
- in_off
- src_in
);
946 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
947 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
948 src
+1+src_nparam
+src_in
,
949 isl_min(dst_out
-out_off
, src_out
));
950 if (dst_out
-out_off
> src_out
)
951 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
952 dst_out
- out_off
- src_out
);
953 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
954 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
955 src
+1+src_nparam
+src_in
+src_out
,
956 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
957 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
958 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
959 div_off
+src_map
->n_div
,
960 dst_map
->n_div
- div_off
- src_map
->n_div
);
963 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
964 struct isl_basic_map
*src_map
, isl_int
*src
,
965 unsigned in_off
, unsigned out_off
, unsigned div_off
)
967 isl_int_set(dst
[0], src
[0]);
968 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
971 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
972 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
977 if (!bmap1
|| !bmap2
)
980 div_off
= bmap1
->n_div
;
982 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
983 int i1
= isl_basic_map_alloc_equality(bmap1
);
986 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
987 i_pos
, o_pos
, div_off
);
990 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
991 int i1
= isl_basic_map_alloc_inequality(bmap1
);
994 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
995 i_pos
, o_pos
, div_off
);
998 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
999 int i1
= isl_basic_map_alloc_div(bmap1
);
1002 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1003 i_pos
, o_pos
, div_off
);
1006 isl_basic_map_free(bmap2
);
1011 isl_basic_map_free(bmap1
);
1012 isl_basic_map_free(bmap2
);
1016 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
1017 struct isl_dim_map
*dim_map
)
1021 for (i
= 0; i
< dim_map
->len
; ++i
) {
1022 if (dim_map
->pos
[i
] < 0)
1023 isl_int_set_si(dst
[i
], 0);
1025 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
1029 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
1030 struct isl_dim_map
*dim_map
)
1032 isl_int_set(dst
[0], src
[0]);
1033 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
1036 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
1037 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
1041 if (!src
|| !dst
|| !dim_map
)
1044 for (i
= 0; i
< src
->n_eq
; ++i
) {
1045 int i1
= isl_basic_map_alloc_equality(dst
);
1048 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1051 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1052 int i1
= isl_basic_map_alloc_inequality(dst
);
1055 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1058 for (i
= 0; i
< src
->n_div
; ++i
) {
1059 int i1
= isl_basic_map_alloc_div(dst
);
1062 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1066 isl_basic_map_free(src
);
1071 isl_basic_map_free(src
);
1072 isl_basic_map_free(dst
);
1076 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1077 struct isl_basic_set
*bset2
, unsigned pos
)
1079 return (struct isl_basic_set
*)
1080 add_constraints((struct isl_basic_map
*)bset1
,
1081 (struct isl_basic_map
*)bset2
, 0, pos
);
1084 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1085 struct isl_dim
*dim
, unsigned extra
,
1086 unsigned n_eq
, unsigned n_ineq
)
1088 struct isl_basic_map
*ext
;
1098 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1099 base
->extra
>= base
->n_div
+ extra
;
1101 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1102 room_for_ineq(base
, n_ineq
)) {
1107 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1108 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1109 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1110 extra
+= base
->extra
;
1112 n_ineq
+= base
->n_ineq
;
1114 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1120 ext
->sample
= isl_vec_copy(base
->sample
);
1121 flags
= base
->flags
;
1122 ext
= add_constraints(ext
, base
, 0, 0);
1125 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1132 isl_basic_map_free(base
);
1136 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1137 struct isl_dim
*dim
, unsigned extra
,
1138 unsigned n_eq
, unsigned n_ineq
)
1140 return (struct isl_basic_set
*)
1141 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1142 extra
, n_eq
, n_ineq
);
1145 struct isl_basic_map
*isl_basic_map_extend_constraints(
1146 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1150 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1154 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1155 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1156 unsigned n_eq
, unsigned n_ineq
)
1158 struct isl_basic_map
*bmap
;
1159 struct isl_dim
*dim
;
1163 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1167 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1170 isl_basic_map_free(base
);
1174 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1175 unsigned nparam
, unsigned dim
, unsigned extra
,
1176 unsigned n_eq
, unsigned n_ineq
)
1178 return (struct isl_basic_set
*)
1179 isl_basic_map_extend((struct isl_basic_map
*)base
,
1180 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1183 struct isl_basic_set
*isl_basic_set_extend_constraints(
1184 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1186 return (struct isl_basic_set
*)
1187 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1191 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1193 return (struct isl_basic_set
*)
1194 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1197 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1202 if (bmap
->ref
> 1) {
1204 bmap
= isl_basic_map_dup(bmap
);
1207 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1211 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1219 return isl_set_dup(set
);
1222 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1230 return isl_map_dup(map
);
1233 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1234 unsigned a_len
, unsigned b_len
)
1236 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1237 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1238 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1241 struct isl_basic_set
*isl_basic_set_swap_vars(
1242 struct isl_basic_set
*bset
, unsigned n
)
1252 nparam
= isl_basic_set_n_param(bset
);
1253 dim
= isl_basic_set_n_dim(bset
);
1254 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1259 bset
= isl_basic_set_cow(bset
);
1263 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1264 if (isl_blk_is_error(blk
))
1267 for (i
= 0; i
< bset
->n_eq
; ++i
)
1269 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1271 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1273 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1275 for (i
= 0; i
< bset
->n_div
; ++i
)
1277 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1279 isl_blk_free(bset
->ctx
, blk
);
1281 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1282 bset
= isl_basic_set_gauss(bset
, NULL
);
1283 return isl_basic_set_finalize(bset
);
1285 isl_basic_set_free(bset
);
1289 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1292 set
= isl_set_cow(set
);
1296 for (i
= 0; i
< set
->n
; ++i
) {
1297 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1303 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1307 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1313 total
= isl_basic_map_total_dim(bmap
);
1314 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1315 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1317 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1319 i
= isl_basic_map_alloc_equality(bmap
);
1323 isl_int_set_si(bmap
->eq
[i
][0], 1);
1324 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1325 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1326 isl_vec_free(bmap
->sample
);
1327 bmap
->sample
= NULL
;
1328 return isl_basic_map_finalize(bmap
);
1330 isl_basic_map_free(bmap
);
1334 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1336 return (struct isl_basic_set
*)
1337 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1340 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1343 unsigned off
= isl_dim_total(bmap
->dim
);
1344 isl_int
*t
= bmap
->div
[a
];
1345 bmap
->div
[a
] = bmap
->div
[b
];
1348 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1349 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1351 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1352 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1354 for (i
= 0; i
< bmap
->n_div
; ++i
)
1355 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1356 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1359 /* Eliminate the specified n dimensions starting at first from the
1360 * constraints using Fourier-Motzkin. The dimensions themselves
1363 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1364 enum isl_dim_type type
, unsigned first
, unsigned n
)
1373 map
= isl_map_cow(map
);
1376 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1377 first
+= pos(map
->dim
, type
) - 1;
1379 for (i
= 0; i
< map
->n
; ++i
) {
1380 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1390 /* Eliminate the specified n dimensions starting at first from the
1391 * constraints using Fourier-Motzkin. The dimensions themselves
1394 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1395 enum isl_dim_type type
, unsigned first
, unsigned n
)
1397 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1400 /* Eliminate the specified n dimensions starting at first from the
1401 * constraints using Fourier-Motzkin. The dimensions themselves
1404 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1405 unsigned first
, unsigned n
)
1407 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1410 /* Project out n dimensions starting at first using Fourier-Motzkin */
1411 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1412 unsigned first
, unsigned n
)
1414 set
= isl_set_eliminate_dims(set
, first
, n
);
1415 set
= isl_set_drop_dims(set
, first
, n
);
1419 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1420 __isl_take isl_basic_map
*bmap
)
1422 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1430 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1431 __isl_take isl_basic_set
*bset
)
1433 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1434 (struct isl_basic_map
*)bset
);
1437 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1446 set
= isl_set_cow(set
);
1450 for (i
= 0; i
< set
->n
; ++i
) {
1451 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1461 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1462 enum isl_dim_type type
, unsigned first
, unsigned n
)
1466 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1470 bmap
= isl_basic_map_eliminate_vars(bmap
,
1471 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1474 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1476 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1479 isl_basic_map_free(bmap
);
1483 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1484 enum isl_dim_type type
, unsigned first
, unsigned n
)
1486 return (isl_basic_set
*)
1487 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1490 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1491 enum isl_dim_type type
, unsigned first
, unsigned n
)
1498 map
= isl_map_cow(map
);
1501 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1503 for (i
= 0; i
< map
->n
; ++i
) {
1504 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1505 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1509 map
= isl_map_drop(map
, type
, first
, n
);
1516 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1517 enum isl_dim_type type
, unsigned first
, unsigned n
)
1519 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1522 /* Project out n inputs starting at first using Fourier-Motzkin */
1523 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1524 unsigned first
, unsigned n
)
1526 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1529 /* Project out n dimensions starting at first using Fourier-Motzkin */
1530 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1531 unsigned first
, unsigned n
)
1533 unsigned nparam
= isl_basic_set_n_param(bset
);
1534 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1535 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1539 static void dump_term(struct isl_basic_map
*bmap
,
1540 isl_int c
, int pos
, FILE *out
)
1543 unsigned in
= isl_basic_map_n_in(bmap
);
1544 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1545 unsigned nparam
= isl_basic_map_n_param(bmap
);
1547 isl_int_print(out
, c
, 0);
1549 if (!isl_int_is_one(c
))
1550 isl_int_print(out
, c
, 0);
1551 if (pos
< 1 + nparam
) {
1552 name
= isl_dim_get_name(bmap
->dim
,
1553 isl_dim_param
, pos
- 1);
1555 fprintf(out
, "%s", name
);
1557 fprintf(out
, "p%d", pos
- 1);
1558 } else if (pos
< 1 + nparam
+ in
)
1559 fprintf(out
, "i%d", pos
- 1 - nparam
);
1560 else if (pos
< 1 + nparam
+ dim
)
1561 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1563 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1567 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1568 int sign
, FILE *out
)
1572 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1576 for (i
= 0, first
= 1; i
< len
; ++i
) {
1577 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1580 fprintf(out
, " + ");
1582 isl_int_abs(v
, c
[i
]);
1583 dump_term(bmap
, v
, i
, out
);
1590 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1591 const char *op
, FILE *out
, int indent
)
1595 fprintf(out
, "%*s", indent
, "");
1597 dump_constraint_sign(bmap
, c
, 1, out
);
1598 fprintf(out
, " %s ", op
);
1599 dump_constraint_sign(bmap
, c
, -1, out
);
1603 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1604 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1606 fprintf(out
, "%*s", indent
, "");
1607 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1612 static void dump_constraints(struct isl_basic_map
*bmap
,
1613 isl_int
**c
, unsigned n
,
1614 const char *op
, FILE *out
, int indent
)
1618 for (i
= 0; i
< n
; ++i
)
1619 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1622 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1626 unsigned total
= isl_basic_map_total_dim(bmap
);
1628 for (j
= 0; j
< 1 + total
; ++j
) {
1629 if (isl_int_is_zero(exp
[j
]))
1631 if (!first
&& isl_int_is_pos(exp
[j
]))
1633 dump_term(bmap
, exp
[j
], j
, out
);
1638 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1642 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1643 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1645 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1646 fprintf(out
, "%*s", indent
, "");
1647 fprintf(out
, "e%d = [(", i
);
1648 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1650 isl_int_print(out
, bmap
->div
[i
][0], 0);
1651 fprintf(out
, "]\n");
1655 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1658 fprintf(out
, "null basic set\n");
1662 fprintf(out
, "%*s", indent
, "");
1663 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1664 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1665 bset
->extra
, bset
->flags
);
1666 dump((struct isl_basic_map
*)bset
, out
, indent
);
1669 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1672 fprintf(out
, "null basic map\n");
1676 fprintf(out
, "%*s", indent
, "");
1677 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1678 "flags: %x, n_name: %d\n",
1680 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1681 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1682 dump(bmap
, out
, indent
);
1685 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1690 total
= isl_basic_map_total_dim(bmap
);
1691 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1692 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1693 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1694 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1698 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1700 struct isl_set
*set
;
1704 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1705 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1706 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1707 sizeof(struct isl_set
) +
1708 (n
- 1) * sizeof(struct isl_basic_set
*));
1712 set
->ctx
= dim
->ctx
;
1713 isl_ctx_ref(set
->ctx
);
1725 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1726 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1728 struct isl_set
*set
;
1729 struct isl_dim
*dims
;
1731 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1735 set
= isl_set_alloc_dim(dims
, n
, flags
);
1739 /* Make sure "map" has room for at least "n" more basic maps.
1741 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1744 struct isl_map
*grown
= NULL
;
1748 isl_assert(map
->ctx
, n
>= 0, goto error
);
1749 if (map
->n
+ n
<= map
->size
)
1751 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1754 for (i
= 0; i
< map
->n
; ++i
) {
1755 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1763 isl_map_free(grown
);
1768 /* Make sure "set" has room for at least "n" more basic sets.
1770 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1772 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1775 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1778 struct isl_set
*dup
;
1783 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1786 for (i
= 0; i
< set
->n
; ++i
)
1787 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1791 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1793 struct isl_set
*set
;
1798 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1800 isl_basic_set_free(bset
);
1803 return isl_set_add_basic_set(set
, bset
);
1806 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1808 struct isl_map
*map
;
1813 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1815 isl_basic_map_free(bmap
);
1818 return isl_map_add_basic_map(map
, bmap
);
1821 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1822 __isl_take isl_basic_set
*bset
)
1824 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1825 (struct isl_basic_map
*)bset
);
1828 void isl_set_free(struct isl_set
*set
)
1838 isl_ctx_deref(set
->ctx
);
1839 for (i
= 0; i
< set
->n
; ++i
)
1840 isl_basic_set_free(set
->p
[i
]);
1841 isl_dim_free(set
->dim
);
1845 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1850 fprintf(out
, "null set\n");
1854 fprintf(out
, "%*s", indent
, "");
1855 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1856 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1858 for (i
= 0; i
< set
->n
; ++i
) {
1859 fprintf(out
, "%*s", indent
, "");
1860 fprintf(out
, "basic set %d:\n", i
);
1861 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1865 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1870 fprintf(out
, "null map\n");
1874 fprintf(out
, "%*s", indent
, "");
1875 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1876 "flags: %x, n_name: %d\n",
1877 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1878 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1879 for (i
= 0; i
< map
->n
; ++i
) {
1880 fprintf(out
, "%*s", indent
, "");
1881 fprintf(out
, "basic map %d:\n", i
);
1882 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1886 struct isl_basic_map
*isl_basic_map_intersect_domain(
1887 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1889 struct isl_basic_map
*bmap_domain
;
1890 struct isl_dim
*dim
;
1895 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1896 bset
->dim
, isl_dim_param
), goto error
);
1898 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1899 isl_assert(bset
->ctx
,
1900 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1902 bmap
= isl_basic_map_cow(bmap
);
1905 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1906 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1907 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1908 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1909 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1911 bmap
= isl_basic_map_simplify(bmap
);
1912 return isl_basic_map_finalize(bmap
);
1914 isl_basic_map_free(bmap
);
1915 isl_basic_set_free(bset
);
1919 struct isl_basic_map
*isl_basic_map_intersect_range(
1920 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1922 struct isl_basic_map
*bmap_range
;
1927 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1928 bset
->dim
, isl_dim_param
), goto error
);
1930 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1931 isl_assert(bset
->ctx
,
1932 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1934 bmap
= isl_basic_map_cow(bmap
);
1937 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1938 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1939 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1940 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1942 bmap
= isl_basic_map_simplify(bmap
);
1943 return isl_basic_map_finalize(bmap
);
1945 isl_basic_map_free(bmap
);
1946 isl_basic_set_free(bset
);
1950 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1956 total
= 1 + isl_basic_map_total_dim(bmap
);
1957 if (total
!= vec
->size
)
1962 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1963 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1964 if (!isl_int_is_zero(s
)) {
1970 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1971 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1972 if (isl_int_is_neg(s
)) {
1983 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1985 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1988 struct isl_basic_map
*isl_basic_map_intersect(
1989 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1991 struct isl_vec
*sample
= NULL
;
1993 if (!bmap1
|| !bmap2
)
1996 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1997 bmap2
->dim
, isl_dim_param
), goto error
);
1998 if (isl_dim_total(bmap1
->dim
) ==
1999 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2000 isl_dim_total(bmap2
->dim
) !=
2001 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2002 return isl_basic_map_intersect(bmap2
, bmap1
);
2004 if (isl_dim_total(bmap2
->dim
) !=
2005 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2006 isl_assert(bmap1
->ctx
,
2007 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2009 if (bmap1
->sample
&&
2010 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2011 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2012 sample
= isl_vec_copy(bmap1
->sample
);
2013 else if (bmap2
->sample
&&
2014 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2015 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2016 sample
= isl_vec_copy(bmap2
->sample
);
2018 bmap1
= isl_basic_map_cow(bmap1
);
2021 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2022 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2023 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2026 isl_vec_free(sample
);
2028 isl_vec_free(bmap1
->sample
);
2029 bmap1
->sample
= sample
;
2032 bmap1
= isl_basic_map_simplify(bmap1
);
2033 return isl_basic_map_finalize(bmap1
);
2036 isl_vec_free(sample
);
2037 isl_basic_map_free(bmap1
);
2038 isl_basic_map_free(bmap2
);
2042 struct isl_basic_set
*isl_basic_set_intersect(
2043 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2045 return (struct isl_basic_set
*)
2046 isl_basic_map_intersect(
2047 (struct isl_basic_map
*)bset1
,
2048 (struct isl_basic_map
*)bset2
);
2051 /* Special case of isl_map_intersect, where both map1 and map2
2052 * are convex, without any divs and such that either map1 or map2
2053 * contains a single constraint. This constraint is then simply
2054 * added to the other map.
2056 static __isl_give isl_map
*map_intersect_add_constraint(
2057 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2059 struct isl_basic_map
*bmap1
;
2060 struct isl_basic_map
*bmap2
;
2062 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2063 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2064 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2065 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2067 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2068 return isl_map_intersect(map2
, map1
);
2070 isl_assert(map2
->ctx
,
2071 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2073 map1
= isl_map_cow(map1
);
2076 if (isl_map_fast_is_empty(map1
)) {
2080 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2081 if (map2
->p
[0]->n_eq
== 1)
2082 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2084 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2085 map2
->p
[0]->ineq
[0]);
2087 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2088 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2092 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2093 isl_basic_map_free(map1
->p
[0]);
2106 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2109 struct isl_map
*result
;
2115 if (isl_map_fast_is_empty(map1
)) {
2119 if (isl_map_fast_is_empty(map2
)) {
2124 if (map1
->n
== 1 && map2
->n
== 1 &&
2125 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2126 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2127 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2128 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2129 return map_intersect_add_constraint(map1
, map2
);
2130 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2131 map2
->dim
, isl_dim_param
), goto error
);
2132 if (isl_dim_total(map1
->dim
) ==
2133 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2134 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2135 return isl_map_intersect(map2
, map1
);
2137 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2138 isl_assert(map1
->ctx
,
2139 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2141 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2142 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2143 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2145 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2146 map1
->n
* map2
->n
, flags
);
2149 for (i
= 0; i
< map1
->n
; ++i
)
2150 for (j
= 0; j
< map2
->n
; ++j
) {
2151 struct isl_basic_map
*part
;
2152 part
= isl_basic_map_intersect(
2153 isl_basic_map_copy(map1
->p
[i
]),
2154 isl_basic_map_copy(map2
->p
[j
]));
2155 if (isl_basic_map_is_empty(part
))
2156 isl_basic_map_free(part
);
2158 result
= isl_map_add_basic_map(result
, part
);
2171 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2173 return (struct isl_set
*)
2174 isl_map_intersect((struct isl_map
*)set1
,
2175 (struct isl_map
*)set2
);
2178 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2180 struct isl_dim
*dim
;
2181 struct isl_basic_set
*bset
;
2186 bmap
= isl_basic_map_cow(bmap
);
2189 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2190 in
= isl_basic_map_n_in(bmap
);
2191 bset
= isl_basic_set_from_basic_map(bmap
);
2192 bset
= isl_basic_set_swap_vars(bset
, in
);
2193 return isl_basic_map_from_basic_set(bset
, dim
);
2196 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2197 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2199 struct isl_dim
*res_dim
;
2200 struct isl_basic_map
*res
;
2201 struct isl_dim_map
*dim_map
;
2202 unsigned total
, off
;
2203 enum isl_dim_type t
;
2211 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2213 total
= isl_basic_map_total_dim(bmap
) + n
;
2214 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2216 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2218 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2220 unsigned size
= isl_basic_map_dim(bmap
, t
);
2221 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2223 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2224 pos
, size
- pos
, off
+ pos
+ n
);
2226 off
+= isl_dim_size(res_dim
, t
);
2228 isl_dim_map_div(dim_map
, bmap
, off
);
2230 res
= isl_basic_map_alloc_dim(res_dim
,
2231 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2232 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2233 res
= isl_basic_map_simplify(res
);
2234 return isl_basic_map_finalize(res
);
2237 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2238 enum isl_dim_type type
, unsigned n
)
2242 return isl_basic_map_insert(bmap
, type
,
2243 isl_basic_map_dim(bmap
, type
), n
);
2246 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2247 enum isl_dim_type type
, unsigned n
)
2251 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2252 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2254 isl_basic_set_free(bset
);
2258 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2259 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2266 map
= isl_map_cow(map
);
2270 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2274 for (i
= 0; i
< map
->n
; ++i
) {
2275 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2286 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2287 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2289 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2292 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2293 enum isl_dim_type type
, unsigned n
)
2297 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2300 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2301 enum isl_dim_type type
, unsigned n
)
2305 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2306 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2312 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2313 __isl_take isl_basic_map
*bmap
,
2314 enum isl_dim_type dst_type
, unsigned dst_pos
,
2315 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2318 struct isl_dim_map
*dim_map
;
2319 struct isl_basic_map
*res
;
2320 enum isl_dim_type t
;
2321 unsigned total
, off
;
2328 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2331 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2334 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2336 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2337 pos(bmap
->dim
, src_type
) + src_pos
+
2338 ((src_type
< dst_type
) ? n
: 0)) {
2339 bmap
= isl_basic_map_cow(bmap
);
2343 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2344 src_type
, src_pos
, n
);
2348 bmap
= isl_basic_map_finalize(bmap
);
2353 total
= isl_basic_map_total_dim(bmap
);
2354 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2357 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2358 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2359 if (t
== dst_type
) {
2360 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2363 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2366 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2367 dst_pos
, size
- dst_pos
, off
);
2368 off
+= size
- dst_pos
;
2369 } else if (t
== src_type
) {
2370 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2373 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2374 src_pos
+ n
, size
- src_pos
- n
, off
);
2375 off
+= size
- src_pos
- n
;
2377 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2381 isl_dim_map_div(dim_map
, bmap
, off
);
2383 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2384 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2385 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2387 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2388 src_type
, src_pos
, n
);
2392 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2393 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2394 bmap
= isl_basic_map_finalize(bmap
);
2398 isl_basic_map_free(bmap
);
2402 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2403 enum isl_dim_type dst_type
, unsigned dst_pos
,
2404 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2406 return (isl_basic_set
*)isl_basic_map_move_dims(
2407 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2410 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2411 enum isl_dim_type dst_type
, unsigned dst_pos
,
2412 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2416 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2417 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2418 src_type
, src_pos
, n
);
2424 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2425 enum isl_dim_type dst_type
, unsigned dst_pos
,
2426 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2435 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2438 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2441 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2443 map
= isl_map_cow(map
);
2447 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2451 for (i
= 0; i
< map
->n
; ++i
) {
2452 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2454 src_type
, src_pos
, n
);
2465 /* Move the specified dimensions to the last columns right before
2466 * the divs. Don't change the dimension specification of bmap.
2467 * That's the responsibility of the caller.
2469 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2470 enum isl_dim_type type
, unsigned first
, unsigned n
)
2472 struct isl_dim_map
*dim_map
;
2473 struct isl_basic_map
*res
;
2474 enum isl_dim_type t
;
2475 unsigned total
, off
;
2479 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2482 total
= isl_basic_map_total_dim(bmap
);
2483 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2486 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2487 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2489 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2492 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2493 first
, n
, total
- bmap
->n_div
- n
);
2494 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2495 first
+ n
, size
- (first
+ n
), off
);
2496 off
+= size
- (first
+ n
);
2498 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2502 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2504 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2505 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2506 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2510 /* Turn the n dimensions of type type, starting at first
2511 * into existentially quantified variables.
2513 __isl_give isl_basic_map
*isl_basic_map_project_out(
2514 __isl_take isl_basic_map
*bmap
,
2515 enum isl_dim_type type
, unsigned first
, unsigned n
)
2528 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2529 return isl_basic_map_remove(bmap
, type
, first
, n
);
2531 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2534 bmap
= move_last(bmap
, type
, first
, n
);
2535 bmap
= isl_basic_map_cow(bmap
);
2539 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2540 old
= bmap
->block2
.data
;
2541 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2542 (bmap
->extra
+ n
) * (1 + row_size
));
2543 if (!bmap
->block2
.data
)
2545 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2548 for (i
= 0; i
< n
; ++i
) {
2549 new_div
[i
] = bmap
->block2
.data
+
2550 (bmap
->extra
+ i
) * (1 + row_size
);
2551 isl_seq_clr(new_div
[i
], 1 + row_size
);
2553 for (i
= 0; i
< bmap
->extra
; ++i
)
2554 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2556 bmap
->div
= new_div
;
2560 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2563 bmap
= isl_basic_map_simplify(bmap
);
2564 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2565 return isl_basic_map_finalize(bmap
);
2567 isl_basic_map_free(bmap
);
2571 /* Turn the n dimensions of type type, starting at first
2572 * into existentially quantified variables.
2574 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2575 enum isl_dim_type type
, unsigned first
, unsigned n
)
2577 return (isl_basic_set
*)isl_basic_map_project_out(
2578 (isl_basic_map
*)bset
, type
, first
, n
);
2581 /* Turn the n dimensions of type type, starting at first
2582 * into existentially quantified variables.
2584 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2585 enum isl_dim_type type
, unsigned first
, unsigned n
)
2595 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2597 map
= isl_map_cow(map
);
2601 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2605 for (i
= 0; i
< map
->n
; ++i
) {
2606 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2617 /* Turn the n dimensions of type type, starting at first
2618 * into existentially quantified variables.
2620 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2621 enum isl_dim_type type
, unsigned first
, unsigned n
)
2623 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2626 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2630 for (i
= 0; i
< n
; ++i
) {
2631 j
= isl_basic_map_alloc_div(bmap
);
2634 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2638 isl_basic_map_free(bmap
);
2642 struct isl_basic_map
*isl_basic_map_apply_range(
2643 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2645 struct isl_dim
*dim_result
= NULL
;
2646 struct isl_basic_map
*bmap
;
2647 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2648 struct isl_dim_map
*dim_map1
, *dim_map2
;
2650 if (!bmap1
|| !bmap2
)
2653 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2654 isl_dim_copy(bmap2
->dim
));
2656 n_in
= isl_basic_map_n_in(bmap1
);
2657 n_out
= isl_basic_map_n_out(bmap2
);
2658 n
= isl_basic_map_n_out(bmap1
);
2659 nparam
= isl_basic_map_n_param(bmap1
);
2661 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2662 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2663 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2664 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2665 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2666 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2667 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2668 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2669 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2670 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2671 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2673 bmap
= isl_basic_map_alloc_dim(dim_result
,
2674 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2675 bmap1
->n_eq
+ bmap2
->n_eq
,
2676 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2677 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2678 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2679 bmap
= add_divs(bmap
, n
);
2680 bmap
= isl_basic_map_simplify(bmap
);
2681 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2682 return isl_basic_map_finalize(bmap
);
2684 isl_basic_map_free(bmap1
);
2685 isl_basic_map_free(bmap2
);
2689 struct isl_basic_set
*isl_basic_set_apply(
2690 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2695 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2698 return (struct isl_basic_set
*)
2699 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2701 isl_basic_set_free(bset
);
2702 isl_basic_map_free(bmap
);
2706 struct isl_basic_map
*isl_basic_map_apply_domain(
2707 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2709 if (!bmap1
|| !bmap2
)
2712 isl_assert(bmap1
->ctx
,
2713 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2714 isl_assert(bmap1
->ctx
,
2715 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2718 bmap1
= isl_basic_map_reverse(bmap1
);
2719 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2720 return isl_basic_map_reverse(bmap1
);
2722 isl_basic_map_free(bmap1
);
2723 isl_basic_map_free(bmap2
);
2727 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2728 * A \cap B -> f(A) + f(B)
2730 struct isl_basic_map
*isl_basic_map_sum(
2731 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2733 unsigned n_in
, n_out
, nparam
, total
, pos
;
2734 struct isl_basic_map
*bmap
= NULL
;
2735 struct isl_dim_map
*dim_map1
, *dim_map2
;
2738 if (!bmap1
|| !bmap2
)
2741 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2744 nparam
= isl_basic_map_n_param(bmap1
);
2745 n_in
= isl_basic_map_n_in(bmap1
);
2746 n_out
= isl_basic_map_n_out(bmap1
);
2748 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2749 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2750 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2751 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2752 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2753 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2754 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2755 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2756 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2757 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2758 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2760 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2761 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2762 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2763 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2764 for (i
= 0; i
< n_out
; ++i
) {
2765 int j
= isl_basic_map_alloc_equality(bmap
);
2768 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2769 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2770 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2771 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2773 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2774 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2775 bmap
= add_divs(bmap
, 2 * n_out
);
2777 bmap
= isl_basic_map_simplify(bmap
);
2778 return isl_basic_map_finalize(bmap
);
2780 isl_basic_map_free(bmap
);
2781 isl_basic_map_free(bmap1
);
2782 isl_basic_map_free(bmap2
);
2786 /* Given two maps A -> f(A) and B -> g(B), construct a map
2787 * A \cap B -> f(A) + f(B)
2789 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2791 struct isl_map
*result
;
2797 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2799 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2800 map1
->n
* map2
->n
, 0);
2803 for (i
= 0; i
< map1
->n
; ++i
)
2804 for (j
= 0; j
< map2
->n
; ++j
) {
2805 struct isl_basic_map
*part
;
2806 part
= isl_basic_map_sum(
2807 isl_basic_map_copy(map1
->p
[i
]),
2808 isl_basic_map_copy(map2
->p
[j
]));
2809 if (isl_basic_map_is_empty(part
))
2810 isl_basic_map_free(part
);
2812 result
= isl_map_add_basic_map(result
, part
);
2825 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2826 __isl_take isl_set
*set2
)
2828 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2831 /* Given a basic map A -> f(A), construct A -> -f(A).
2833 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2838 bmap
= isl_basic_map_cow(bmap
);
2842 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2843 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2844 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2845 for (j
= 0; j
< n
; ++j
)
2846 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2847 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2848 for (j
= 0; j
< n
; ++j
)
2849 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2850 for (i
= 0; i
< bmap
->n_div
; ++i
)
2851 for (j
= 0; j
< n
; ++j
)
2852 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2853 return isl_basic_map_finalize(bmap
);
2856 /* Given a map A -> f(A), construct A -> -f(A).
2858 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2862 map
= isl_map_cow(map
);
2866 for (i
= 0; i
< map
->n
; ++i
) {
2867 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2878 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2880 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2883 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2884 * A -> floor(f(A)/d).
2886 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2889 unsigned n_in
, n_out
, nparam
, total
, pos
;
2890 struct isl_basic_map
*result
= NULL
;
2891 struct isl_dim_map
*dim_map
;
2897 nparam
= isl_basic_map_n_param(bmap
);
2898 n_in
= isl_basic_map_n_in(bmap
);
2899 n_out
= isl_basic_map_n_out(bmap
);
2901 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2902 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2903 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2904 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2905 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2906 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2908 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2909 bmap
->n_div
+ n_out
,
2910 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2911 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2912 result
= add_divs(result
, n_out
);
2913 for (i
= 0; i
< n_out
; ++i
) {
2915 j
= isl_basic_map_alloc_inequality(result
);
2918 isl_seq_clr(result
->ineq
[j
], 1+total
);
2919 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2920 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2921 j
= isl_basic_map_alloc_inequality(result
);
2924 isl_seq_clr(result
->ineq
[j
], 1+total
);
2925 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2926 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2927 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2930 result
= isl_basic_map_simplify(result
);
2931 return isl_basic_map_finalize(result
);
2933 isl_basic_map_free(result
);
2937 /* Given a map A -> f(A) and an integer d, construct a map
2938 * A -> floor(f(A)/d).
2940 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2944 map
= isl_map_cow(map
);
2948 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2949 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2950 for (i
= 0; i
< map
->n
; ++i
) {
2951 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2962 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2968 i
= isl_basic_map_alloc_equality(bmap
);
2971 nparam
= isl_basic_map_n_param(bmap
);
2972 n_in
= isl_basic_map_n_in(bmap
);
2973 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2974 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2975 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2976 return isl_basic_map_finalize(bmap
);
2978 isl_basic_map_free(bmap
);
2982 /* Add a constraints to "bmap" expressing i_pos < o_pos
2984 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2990 i
= isl_basic_map_alloc_inequality(bmap
);
2993 nparam
= isl_basic_map_n_param(bmap
);
2994 n_in
= isl_basic_map_n_in(bmap
);
2995 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2996 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2997 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2998 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2999 return isl_basic_map_finalize(bmap
);
3001 isl_basic_map_free(bmap
);
3005 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3007 static __isl_give isl_basic_map
*var_less_or_equal(
3008 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3014 i
= isl_basic_map_alloc_inequality(bmap
);
3017 nparam
= isl_basic_map_n_param(bmap
);
3018 n_in
= isl_basic_map_n_in(bmap
);
3019 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3020 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3021 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3022 return isl_basic_map_finalize(bmap
);
3024 isl_basic_map_free(bmap
);
3028 /* Add a constraints to "bmap" expressing i_pos > o_pos
3030 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3036 i
= isl_basic_map_alloc_inequality(bmap
);
3039 nparam
= isl_basic_map_n_param(bmap
);
3040 n_in
= isl_basic_map_n_in(bmap
);
3041 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3042 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3043 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3044 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3045 return isl_basic_map_finalize(bmap
);
3047 isl_basic_map_free(bmap
);
3051 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3053 static __isl_give isl_basic_map
*var_more_or_equal(
3054 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3060 i
= isl_basic_map_alloc_inequality(bmap
);
3063 nparam
= isl_basic_map_n_param(bmap
);
3064 n_in
= isl_basic_map_n_in(bmap
);
3065 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
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 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3077 struct isl_basic_map
*bmap
;
3078 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3081 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3082 bmap
= var_equal(bmap
, i
);
3083 return isl_basic_map_finalize(bmap
);
3086 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3088 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3091 struct isl_basic_map
*bmap
;
3092 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3095 for (i
= 0; i
< pos
&& bmap
; ++i
)
3096 bmap
= var_equal(bmap
, i
);
3098 bmap
= var_less(bmap
, pos
);
3099 return isl_basic_map_finalize(bmap
);
3102 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3104 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3105 __isl_take isl_dim
*dim
, unsigned pos
)
3108 isl_basic_map
*bmap
;
3110 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3111 for (i
= 0; i
< pos
; ++i
)
3112 bmap
= var_equal(bmap
, i
);
3113 bmap
= var_less_or_equal(bmap
, pos
);
3114 return isl_basic_map_finalize(bmap
);
3117 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3119 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3122 struct isl_basic_map
*bmap
;
3123 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3126 for (i
= 0; i
< pos
&& bmap
; ++i
)
3127 bmap
= var_equal(bmap
, i
);
3129 bmap
= var_more(bmap
, pos
);
3130 return isl_basic_map_finalize(bmap
);
3133 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3135 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3136 __isl_take isl_dim
*dim
, unsigned pos
)
3139 isl_basic_map
*bmap
;
3141 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3142 for (i
= 0; i
< pos
; ++i
)
3143 bmap
= var_equal(bmap
, i
);
3144 bmap
= var_more_or_equal(bmap
, pos
);
3145 return isl_basic_map_finalize(bmap
);
3148 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3149 unsigned n
, int equal
)
3151 struct isl_map
*map
;
3154 if (n
== 0 && equal
)
3155 return isl_map_universe(dims
);
3157 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3159 for (i
= 0; i
+ 1 < n
; ++i
)
3160 map
= isl_map_add_basic_map(map
,
3161 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3164 map
= isl_map_add_basic_map(map
,
3165 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3167 map
= isl_map_add_basic_map(map
,
3168 isl_basic_map_less_at(dims
, n
- 1));
3175 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3179 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3182 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3184 return map_lex_lte_first(dim
, n
, 0);
3187 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3189 return map_lex_lte_first(dim
, n
, 1);
3192 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3194 return map_lex_lte(isl_dim_map(set_dim
), 0);
3197 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3199 return map_lex_lte(isl_dim_map(set_dim
), 1);
3202 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3203 unsigned n
, int equal
)
3205 struct isl_map
*map
;
3208 if (n
== 0 && equal
)
3209 return isl_map_universe(dims
);
3211 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3213 for (i
= 0; i
+ 1 < n
; ++i
)
3214 map
= isl_map_add_basic_map(map
,
3215 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3218 map
= isl_map_add_basic_map(map
,
3219 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3221 map
= isl_map_add_basic_map(map
,
3222 isl_basic_map_more_at(dims
, n
- 1));
3229 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3233 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3236 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3238 return map_lex_gte_first(dim
, n
, 0);
3241 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3243 return map_lex_gte_first(dim
, n
, 1);
3246 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3248 return map_lex_gte(isl_dim_map(set_dim
), 0);
3251 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3253 return map_lex_gte(isl_dim_map(set_dim
), 1);
3256 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3257 __isl_take isl_set
*set2
)
3260 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3261 map
= isl_map_intersect_domain(map
, set1
);
3262 map
= isl_map_intersect_range(map
, set2
);
3266 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3267 __isl_take isl_set
*set2
)
3270 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3271 map
= isl_map_intersect_domain(map
, set1
);
3272 map
= isl_map_intersect_range(map
, set2
);
3276 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3277 __isl_take isl_set
*set2
)
3280 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3281 map
= isl_map_intersect_domain(map
, set1
);
3282 map
= isl_map_intersect_range(map
, set2
);
3286 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3287 __isl_take isl_set
*set2
)
3290 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3291 map
= isl_map_intersect_domain(map
, set1
);
3292 map
= isl_map_intersect_range(map
, set2
);
3296 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3297 __isl_take isl_map
*map2
)
3300 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3301 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3302 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3306 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3307 __isl_take isl_map
*map2
)
3310 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3311 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3312 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3316 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3317 __isl_take isl_map
*map2
)
3320 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3321 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3322 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3326 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3327 __isl_take isl_map
*map2
)
3330 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3331 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3332 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3336 struct isl_basic_map
*isl_basic_map_from_basic_set(
3337 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3339 struct isl_basic_map
*bmap
;
3341 bset
= isl_basic_set_cow(bset
);
3345 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3346 isl_dim_free(bset
->dim
);
3347 bmap
= (struct isl_basic_map
*) bset
;
3349 return isl_basic_map_finalize(bmap
);
3351 isl_basic_set_free(bset
);
3356 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3360 if (bmap
->dim
->n_in
== 0)
3361 return (struct isl_basic_set
*)bmap
;
3362 bmap
= isl_basic_map_cow(bmap
);
3365 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3368 bmap
= isl_basic_map_finalize(bmap
);
3369 return (struct isl_basic_set
*)bmap
;
3371 isl_basic_map_free(bmap
);
3375 /* For a div d = floor(f/m), add the constraints
3378 * -(f-(n-1)) + m d >= 0
3380 * Note that the second constraint is the negation of
3384 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3385 unsigned pos
, isl_int
*div
)
3388 unsigned total
= isl_basic_map_total_dim(bmap
);
3390 i
= isl_basic_map_alloc_inequality(bmap
);
3393 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3394 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3396 j
= isl_basic_map_alloc_inequality(bmap
);
3399 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3400 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3401 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3405 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3406 unsigned pos
, isl_int
*div
)
3408 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3412 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3414 unsigned total
= isl_basic_map_total_dim(bmap
);
3415 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3417 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3421 struct isl_basic_set
*isl_basic_map_underlying_set(
3422 struct isl_basic_map
*bmap
)
3426 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3427 bmap
->n_div
== 0 && !isl_dim_get_tuple_name(bmap
->dim
, isl_dim_out
))
3428 return (struct isl_basic_set
*)bmap
;
3429 bmap
= isl_basic_map_cow(bmap
);
3432 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3435 bmap
->extra
-= bmap
->n_div
;
3437 bmap
= isl_basic_map_finalize(bmap
);
3438 return (struct isl_basic_set
*)bmap
;
3443 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3444 __isl_take isl_basic_set
*bset
)
3446 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3449 struct isl_basic_map
*isl_basic_map_overlying_set(
3450 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3452 struct isl_basic_map
*bmap
;
3453 struct isl_ctx
*ctx
;
3460 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3461 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3462 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3464 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3465 isl_basic_map_free(like
);
3466 return (struct isl_basic_map
*)bset
;
3468 bset
= isl_basic_set_cow(bset
);
3471 total
= bset
->dim
->n_out
+ bset
->extra
;
3472 bmap
= (struct isl_basic_map
*)bset
;
3473 isl_dim_free(bmap
->dim
);
3474 bmap
->dim
= isl_dim_copy(like
->dim
);
3477 bmap
->n_div
= like
->n_div
;
3478 bmap
->extra
+= like
->n_div
;
3481 ltotal
= total
- bmap
->extra
+ like
->extra
;
3484 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3485 bmap
->extra
* (1 + 1 + total
));
3486 if (isl_blk_is_error(bmap
->block2
))
3488 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3492 for (i
= 0; i
< bmap
->extra
; ++i
)
3493 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3494 for (i
= 0; i
< like
->n_div
; ++i
) {
3495 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3496 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3498 bmap
= isl_basic_map_extend_constraints(bmap
,
3499 0, 2 * like
->n_div
);
3500 for (i
= 0; i
< like
->n_div
; ++i
) {
3501 if (isl_int_is_zero(bmap
->div
[i
][0]))
3503 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3507 isl_basic_map_free(like
);
3508 bmap
= isl_basic_map_simplify(bmap
);
3509 bmap
= isl_basic_map_finalize(bmap
);
3512 isl_basic_map_free(like
);
3513 isl_basic_set_free(bset
);
3517 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3518 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3520 return (struct isl_basic_set
*)
3521 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3524 struct isl_set
*isl_set_from_underlying_set(
3525 struct isl_set
*set
, struct isl_basic_set
*like
)
3531 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3533 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3534 isl_basic_set_free(like
);
3537 set
= isl_set_cow(set
);
3540 for (i
= 0; i
< set
->n
; ++i
) {
3541 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3542 isl_basic_set_copy(like
));
3546 isl_dim_free(set
->dim
);
3547 set
->dim
= isl_dim_copy(like
->dim
);
3550 isl_basic_set_free(like
);
3553 isl_basic_set_free(like
);
3558 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3562 map
= isl_map_cow(map
);
3565 map
->dim
= isl_dim_cow(map
->dim
);
3569 for (i
= 1; i
< map
->n
; ++i
)
3570 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3572 for (i
= 0; i
< map
->n
; ++i
) {
3573 map
->p
[i
] = (struct isl_basic_map
*)
3574 isl_basic_map_underlying_set(map
->p
[i
]);
3579 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3581 isl_dim_free(map
->dim
);
3582 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3586 return (struct isl_set
*)map
;
3592 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3594 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3597 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3598 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3600 bmap
= isl_basic_map_cow(bmap
);
3604 isl_dim_free(bmap
->dim
);
3607 bmap
= isl_basic_map_finalize(bmap
);
3611 isl_basic_map_free(bmap
);
3616 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3617 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3619 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3623 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3624 __isl_take isl_dim
*dim
)
3628 map
= isl_map_cow(map
);
3632 for (i
= 0; i
< map
->n
; ++i
) {
3633 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3638 isl_dim_free(map
->dim
);
3648 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3649 __isl_take isl_dim
*dim
)
3651 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3654 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3657 struct isl_basic_set
*domain
;
3663 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3665 n_in
= isl_basic_map_n_in(bmap
);
3666 n_out
= isl_basic_map_n_out(bmap
);
3667 domain
= isl_basic_set_from_basic_map(bmap
);
3668 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3670 domain
= isl_basic_set_reset_dim(domain
, dim
);
3675 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3677 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3680 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3681 __isl_take isl_basic_map
*bmap
)
3685 isl_basic_map
*domain
;
3686 isl_basic_set
*bset
;
3687 int nparam
, n_in
, n_out
;
3690 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3691 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3692 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3694 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3695 domain
= isl_basic_map_universe(dim
);
3697 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3698 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3699 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3701 total
= isl_basic_map_total_dim(bmap
);
3703 for (i
= 0; i
< n_in
; ++i
) {
3704 k
= isl_basic_map_alloc_equality(bmap
);
3707 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3708 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3709 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3712 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3713 return isl_basic_map_finalize(bmap
);
3715 isl_basic_map_free(bmap
);
3719 __isl_give isl_basic_map
*isl_basic_map_range_map(
3720 __isl_take isl_basic_map
*bmap
)
3724 isl_basic_map
*range
;
3725 isl_basic_set
*bset
;
3726 int nparam
, n_in
, n_out
;
3729 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3730 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3731 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3733 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3734 range
= isl_basic_map_universe(dim
);
3736 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3737 bmap
= isl_basic_map_apply_range(bmap
, range
);
3738 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3740 total
= isl_basic_map_total_dim(bmap
);
3742 for (i
= 0; i
< n_out
; ++i
) {
3743 k
= isl_basic_map_alloc_equality(bmap
);
3746 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3747 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3748 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3751 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3752 return isl_basic_map_finalize(bmap
);
3754 isl_basic_map_free(bmap
);
3758 struct isl_set
*isl_map_range(struct isl_map
*map
)
3761 struct isl_set
*set
;
3765 if (isl_map_dim(map
, isl_dim_in
) == 0)
3766 return (isl_set
*)map
;
3768 map
= isl_map_cow(map
);
3772 set
= (struct isl_set
*) map
;
3773 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3776 for (i
= 0; i
< map
->n
; ++i
) {
3777 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3781 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3782 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3789 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3792 isl_dim
*domain_dim
;
3794 map
= isl_map_cow(map
);
3798 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3799 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3800 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3803 for (i
= 0; i
< map
->n
; ++i
) {
3804 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3808 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3809 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3816 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3821 map
= isl_map_cow(map
);
3825 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3826 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3827 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3830 for (i
= 0; i
< map
->n
; ++i
) {
3831 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3835 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3836 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3843 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3846 struct isl_map
*map
= NULL
;
3848 set
= isl_set_cow(set
);
3851 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3852 map
= (struct isl_map
*)set
;
3853 for (i
= 0; i
< set
->n
; ++i
) {
3854 map
->p
[i
] = isl_basic_map_from_basic_set(
3855 set
->p
[i
], isl_dim_copy(dim
));
3859 isl_dim_free(map
->dim
);
3868 __isl_give isl_basic_map
*isl_basic_map_from_domain(
3869 __isl_take isl_basic_set
*bset
)
3871 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
3874 __isl_give isl_basic_map
*isl_basic_map_from_range(
3875 __isl_take isl_basic_set
*bset
)
3877 return (isl_basic_map
*)bset
;
3880 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3882 return (struct isl_map
*)set
;
3885 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3887 return isl_map_reverse(isl_map_from_range(set
));
3890 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3891 __isl_take isl_set
*range
)
3893 return isl_map_apply_range(isl_map_from_domain(domain
),
3894 isl_map_from_range(range
));
3897 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3900 struct isl_set
*set
= NULL
;
3904 map
= isl_map_cow(map
);
3907 map
->dim
= isl_dim_as_set_dim(map
->dim
);
3910 set
= (struct isl_set
*)map
;
3911 for (i
= 0; i
< map
->n
; ++i
) {
3912 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3922 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3924 struct isl_map
*map
;
3928 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3929 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3930 sizeof(struct isl_map
) +
3931 (n
- 1) * sizeof(struct isl_basic_map
*));
3935 map
->ctx
= dim
->ctx
;
3936 isl_ctx_ref(map
->ctx
);
3948 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
3949 unsigned nparam
, unsigned in
, unsigned out
, int n
,
3952 struct isl_map
*map
;
3953 struct isl_dim
*dims
;
3955 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
3959 map
= isl_map_alloc_dim(dims
, n
, flags
);
3963 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
3965 struct isl_basic_map
*bmap
;
3966 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
3967 bmap
= isl_basic_map_set_to_empty(bmap
);
3971 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
3973 struct isl_basic_set
*bset
;
3974 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
3975 bset
= isl_basic_set_set_to_empty(bset
);
3979 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
3981 struct isl_basic_map
*bmap
;
3984 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3985 bmap
= isl_basic_map_set_to_empty(bmap
);
3989 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
3991 struct isl_basic_map
*bmap
;
3994 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3995 bmap
= isl_basic_map_set_to_empty(bmap
);
3999 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4001 struct isl_basic_set
*bset
;
4004 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4005 bset
= isl_basic_set_set_to_empty(bset
);
4009 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4011 struct isl_basic_map
*bmap
;
4012 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4016 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4018 struct isl_basic_set
*bset
;
4019 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4023 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4024 __isl_keep isl_basic_map
*model
)
4028 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4031 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4035 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4038 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4039 __isl_keep isl_set
*model
)
4043 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4046 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4048 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4051 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4055 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4058 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4062 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4065 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4067 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4070 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4074 return isl_set_empty(isl_dim_copy(model
->dim
));
4077 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4079 struct isl_map
*map
;
4082 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4083 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4087 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4089 struct isl_set
*set
;
4092 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4093 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4097 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4101 return isl_set_universe(isl_dim_copy(model
->dim
));
4104 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4107 struct isl_map
*dup
;
4111 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4112 for (i
= 0; i
< map
->n
; ++i
)
4113 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4117 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4118 __isl_take isl_basic_map
*bmap
)
4122 if (isl_basic_map_fast_is_empty(bmap
)) {
4123 isl_basic_map_free(bmap
);
4126 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4127 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4128 map
->p
[map
->n
] = bmap
;
4130 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4136 isl_basic_map_free(bmap
);
4140 void isl_map_free(struct isl_map
*map
)
4150 isl_ctx_deref(map
->ctx
);
4151 for (i
= 0; i
< map
->n
; ++i
)
4152 isl_basic_map_free(map
->p
[i
]);
4153 isl_dim_free(map
->dim
);
4157 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4158 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4162 base
= isl_map_cow(base
);
4166 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4169 for (i
= 0; i
< base
->n
; ++i
) {
4170 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4171 isl_dim_copy(base
->dim
), 0, 0, 0);
4181 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4182 unsigned nparam
, unsigned dim
)
4184 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4188 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4189 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4193 bmap
= isl_basic_map_cow(bmap
);
4194 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4195 j
= isl_basic_map_alloc_equality(bmap
);
4198 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4199 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4200 isl_int_set_si(bmap
->eq
[j
][0], value
);
4201 bmap
= isl_basic_map_simplify(bmap
);
4202 return isl_basic_map_finalize(bmap
);
4204 isl_basic_map_free(bmap
);
4208 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4209 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4213 bmap
= isl_basic_map_cow(bmap
);
4214 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4215 j
= isl_basic_map_alloc_equality(bmap
);
4218 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4219 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4220 isl_int_set(bmap
->eq
[j
][0], value
);
4221 bmap
= isl_basic_map_simplify(bmap
);
4222 return isl_basic_map_finalize(bmap
);
4224 isl_basic_map_free(bmap
);
4228 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4229 enum isl_dim_type type
, unsigned pos
, int value
)
4233 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4234 return isl_basic_map_fix_pos_si(bmap
,
4235 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4237 isl_basic_map_free(bmap
);
4241 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4242 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4246 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4247 return isl_basic_map_fix_pos(bmap
,
4248 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4250 isl_basic_map_free(bmap
);
4254 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4255 enum isl_dim_type type
, unsigned pos
, int value
)
4257 return (struct isl_basic_set
*)
4258 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4262 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4263 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4265 return (struct isl_basic_set
*)
4266 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4270 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4271 unsigned input
, int value
)
4273 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4276 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4277 unsigned dim
, int value
)
4279 return (struct isl_basic_set
*)
4280 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4281 isl_dim_set
, dim
, value
);
4284 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4285 enum isl_dim_type type
, unsigned pos
, int value
)
4289 map
= isl_map_cow(map
);
4293 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4294 for (i
= 0; i
< map
->n
; ++i
) {
4295 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4299 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4306 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4307 enum isl_dim_type type
, unsigned pos
, int value
)
4309 return (struct isl_set
*)
4310 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4313 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4314 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4318 map
= isl_map_cow(map
);
4322 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4323 for (i
= 0; i
< map
->n
; ++i
) {
4324 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4328 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4335 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4336 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4338 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4341 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4342 unsigned input
, int value
)
4344 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4347 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4349 return (struct isl_set
*)
4350 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4353 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4354 __isl_take isl_basic_map
*bmap
,
4355 enum isl_dim_type type
, unsigned pos
, int value
)
4361 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4362 pos
+= isl_basic_map_offset(bmap
, type
);
4363 bmap
= isl_basic_map_cow(bmap
);
4364 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4365 j
= isl_basic_map_alloc_inequality(bmap
);
4368 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4369 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4370 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4371 bmap
= isl_basic_map_simplify(bmap
);
4372 return isl_basic_map_finalize(bmap
);
4374 isl_basic_map_free(bmap
);
4378 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4379 unsigned dim
, isl_int value
)
4383 bset
= isl_basic_set_cow(bset
);
4384 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4385 j
= isl_basic_set_alloc_inequality(bset
);
4388 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4389 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4390 isl_int_neg(bset
->ineq
[j
][0], value
);
4391 bset
= isl_basic_set_simplify(bset
);
4392 return isl_basic_set_finalize(bset
);
4394 isl_basic_set_free(bset
);
4398 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4399 enum isl_dim_type type
, unsigned pos
, int value
)
4403 map
= isl_map_cow(map
);
4407 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4408 for (i
= 0; i
< map
->n
; ++i
) {
4409 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4414 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4421 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4422 enum isl_dim_type type
, unsigned pos
, int value
)
4424 return (struct isl_set
*)
4425 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4428 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4433 set
= isl_set_cow(set
);
4437 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4438 for (i
= 0; i
< set
->n
; ++i
) {
4439 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4449 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4453 map
= isl_map_cow(map
);
4457 map
->dim
= isl_dim_reverse(map
->dim
);
4460 for (i
= 0; i
< map
->n
; ++i
) {
4461 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4465 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4472 static struct isl_map
*isl_basic_map_partial_lexopt(
4473 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4474 struct isl_set
**empty
, int max
)
4478 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4479 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4481 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4483 isl_basic_map_free(bmap
);
4484 isl_basic_set_free(dom
);
4490 struct isl_map
*isl_basic_map_partial_lexmax(
4491 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4492 struct isl_set
**empty
)
4494 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4497 struct isl_map
*isl_basic_map_partial_lexmin(
4498 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4499 struct isl_set
**empty
)
4501 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4504 struct isl_set
*isl_basic_set_partial_lexmin(
4505 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4506 struct isl_set
**empty
)
4508 return (struct isl_set
*)
4509 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4513 struct isl_set
*isl_basic_set_partial_lexmax(
4514 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4515 struct isl_set
**empty
)
4517 return (struct isl_set
*)
4518 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4522 /* Given a basic map "bmap", compute the lexicograhically minimal
4523 * (or maximal) image element for each domain element in dom.
4524 * Set *empty to those elements in dom that do not have an image element.
4526 * We first make sure the basic sets in dom are disjoint and then
4527 * simply collect the results over each of the basic sets separately.
4528 * We could probably improve the efficiency a bit by moving the union
4529 * domain down into the parametric integer programming.
4531 static __isl_give isl_map
*basic_map_partial_lexopt(
4532 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4533 __isl_give isl_set
**empty
, int max
)
4536 struct isl_map
*res
;
4538 dom
= isl_set_make_disjoint(dom
);
4542 if (isl_set_fast_is_empty(dom
)) {
4543 res
= isl_map_empty_like_basic_map(bmap
);
4544 *empty
= isl_set_empty_like(dom
);
4546 isl_basic_map_free(bmap
);
4550 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4551 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4553 for (i
= 1; i
< dom
->n
; ++i
) {
4554 struct isl_map
*res_i
;
4555 struct isl_set
*empty_i
;
4557 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4558 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4560 res
= isl_map_union_disjoint(res
, res_i
);
4561 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4565 isl_basic_map_free(bmap
);
4570 isl_basic_map_free(bmap
);
4574 /* Given a map "map", compute the lexicograhically minimal
4575 * (or maximal) image element for each domain element in dom.
4576 * Set *empty to those elements in dom that do not have an image element.
4578 * We first compute the lexicographically minimal or maximal element
4579 * in the first basic map. This results in a partial solution "res"
4580 * and a subset "todo" of dom that still need to be handled.
4581 * We then consider each of the remaining maps in "map" and successively
4582 * improve both "res" and "todo".
4584 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4585 * Assume we are computing the lexicographical maximum.
4586 * We first intersect basic map i with a relation that maps elements
4587 * to elements that are lexicographically larger than the image elements
4588 * in res^k and the compute the maximum image element of this intersection.
4589 * The result ("better") corresponds to those image elements in basic map i
4590 * that are better than what we had before. The remainder ("keep") are the
4591 * domain elements for which the image element in res_k was better.
4592 * We also compute the lexicographical maximum of basic map i in todo^k.
4593 * res^i is the result of the operation + better + those elements in
4594 * res^k that we should keep
4595 * todo^i is the remainder of the maximum operation on todo^k.
4597 static __isl_give isl_map
*isl_map_partial_lexopt(
4598 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4599 __isl_give isl_set
**empty
, int max
)
4602 struct isl_map
*res
;
4603 struct isl_set
*todo
;
4608 if (isl_map_fast_is_empty(map
)) {
4616 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4617 isl_set_copy(dom
), &todo
, max
);
4619 for (i
= 1; i
< map
->n
; ++i
) {
4621 struct isl_map
*better
;
4622 struct isl_set
*keep
;
4623 struct isl_map
*res_i
;
4624 struct isl_set
*todo_i
;
4625 struct isl_dim
*dim
= isl_map_get_dim(res
);
4627 dim
= isl_dim_range(dim
);
4629 lt
= isl_map_lex_lt(dim
);
4631 lt
= isl_map_lex_gt(dim
);
4632 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4633 lt
= isl_map_intersect(lt
,
4634 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4635 better
= isl_map_partial_lexopt(lt
,
4636 isl_map_domain(isl_map_copy(res
)),
4639 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4640 todo
, &todo_i
, max
);
4642 res
= isl_map_intersect_domain(res
, keep
);
4643 res
= isl_map_union_disjoint(res
, res_i
);
4644 res
= isl_map_union_disjoint(res
, better
);
4665 __isl_give isl_map
*isl_map_partial_lexmax(
4666 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4667 __isl_give isl_set
**empty
)
4669 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4672 __isl_give isl_map
*isl_map_partial_lexmin(
4673 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4674 __isl_give isl_set
**empty
)
4676 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4679 __isl_give isl_set
*isl_set_partial_lexmin(
4680 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4681 __isl_give isl_set
**empty
)
4683 return (struct isl_set
*)
4684 isl_map_partial_lexmin((struct isl_map
*)set
,
4688 __isl_give isl_set
*isl_set_partial_lexmax(
4689 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4690 __isl_give isl_set
**empty
)
4692 return (struct isl_set
*)
4693 isl_map_partial_lexmax((struct isl_map
*)set
,
4697 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4699 struct isl_basic_set
*dom
= NULL
;
4700 struct isl_dim
*dom_dim
;
4704 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4705 dom
= isl_basic_set_universe(dom_dim
);
4706 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4708 isl_basic_map_free(bmap
);
4712 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4714 return isl_basic_map_lexopt(bmap
, 0);
4717 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4719 return isl_basic_map_lexopt(bmap
, 1);
4722 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4724 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4727 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4729 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4732 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4734 struct isl_set
*dom
= NULL
;
4735 struct isl_dim
*dom_dim
;
4739 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4740 dom
= isl_set_universe(dom_dim
);
4741 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4747 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4749 return isl_map_lexopt(map
, 0);
4752 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4754 return isl_map_lexopt(map
, 1);
4757 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4759 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4762 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4764 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4767 /* Apply a preimage specified by "mat" on the parameters of "bset".
4768 * bset is assumed to have only parameters and divs.
4770 static struct isl_basic_set
*basic_set_parameter_preimage(
4771 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4778 bset
->dim
= isl_dim_cow(bset
->dim
);
4782 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4784 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4786 bset
->dim
->nparam
= 0;
4787 bset
->dim
->n_out
= nparam
;
4788 bset
= isl_basic_set_preimage(bset
, mat
);
4790 bset
->dim
->nparam
= bset
->dim
->n_out
;
4791 bset
->dim
->n_out
= 0;
4796 isl_basic_set_free(bset
);
4800 /* Apply a preimage specified by "mat" on the parameters of "set".
4801 * set is assumed to have only parameters and divs.
4803 static struct isl_set
*set_parameter_preimage(
4804 struct isl_set
*set
, struct isl_mat
*mat
)
4806 struct isl_dim
*dim
= NULL
;
4812 dim
= isl_dim_copy(set
->dim
);
4813 dim
= isl_dim_cow(dim
);
4817 nparam
= isl_set_dim(set
, isl_dim_param
);
4819 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4822 dim
->n_out
= nparam
;
4823 isl_set_reset_dim(set
, dim
);
4824 set
= isl_set_preimage(set
, mat
);
4827 dim
= isl_dim_copy(set
->dim
);
4828 dim
= isl_dim_cow(dim
);
4831 dim
->nparam
= dim
->n_out
;
4833 isl_set_reset_dim(set
, dim
);
4843 /* Intersect the basic set "bset" with the affine space specified by the
4844 * equalities in "eq".
4846 static struct isl_basic_set
*basic_set_append_equalities(
4847 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4855 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4860 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4861 for (i
= 0; i
< eq
->n_row
; ++i
) {
4862 k
= isl_basic_set_alloc_equality(bset
);
4865 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4866 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4870 bset
= isl_basic_set_gauss(bset
, NULL
);
4871 bset
= isl_basic_set_finalize(bset
);
4876 isl_basic_set_free(bset
);
4880 /* Intersect the set "set" with the affine space specified by the
4881 * equalities in "eq".
4883 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4891 for (i
= 0; i
< set
->n
; ++i
) {
4892 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4905 /* Project the given basic set onto its parameter domain, possibly introducing
4906 * new, explicit, existential variables in the constraints.
4907 * The input has parameters and (possibly implicit) existential variables.
4908 * The output has the same parameters, but only
4909 * explicit existentially quantified variables.
4911 * The actual projection is performed by pip, but pip doesn't seem
4912 * to like equalities very much, so we first remove the equalities
4913 * among the parameters by performing a variable compression on
4914 * the parameters. Afterward, an inverse transformation is performed
4915 * and the equalities among the parameters are inserted back in.
4917 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4921 struct isl_mat
*T
, *T2
;
4922 struct isl_set
*set
;
4923 unsigned nparam
, n_div
;
4925 bset
= isl_basic_set_cow(bset
);
4929 if (bset
->n_eq
== 0)
4930 return isl_basic_set_lexmin(bset
);
4932 isl_basic_set_gauss(bset
, NULL
);
4934 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4935 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
4937 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
4938 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
4941 if (i
== bset
->n_eq
)
4942 return isl_basic_set_lexmin(bset
);
4944 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
4946 eq
= isl_mat_cow(eq
);
4947 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
4948 if (T
&& T
->n_col
== 0) {
4952 bset
= isl_basic_set_set_to_empty(bset
);
4953 return isl_set_from_basic_set(bset
);
4955 bset
= basic_set_parameter_preimage(bset
, T
);
4957 set
= isl_basic_set_lexmin(bset
);
4958 set
= set_parameter_preimage(set
, T2
);
4959 set
= set_append_equalities(set
, eq
);
4963 /* Compute an explicit representation for all the existentially
4964 * quantified variables.
4965 * The input and output dimensions are first turned into parameters.
4966 * compute_divs then returns a map with the same parameters and
4967 * no input or output dimensions and the dimension specification
4968 * is reset to that of the input.
4970 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
4972 struct isl_basic_set
*bset
;
4973 struct isl_set
*set
;
4974 struct isl_map
*map
;
4975 struct isl_dim
*dim
, *orig_dim
= NULL
;
4980 bmap
= isl_basic_map_cow(bmap
);
4984 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4985 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4986 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4987 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
4991 orig_dim
= bmap
->dim
;
4993 bset
= (struct isl_basic_set
*)bmap
;
4995 set
= parameter_compute_divs(bset
);
4996 map
= (struct isl_map
*)set
;
4997 map
= isl_map_reset_dim(map
, orig_dim
);
5001 isl_basic_map_free(bmap
);
5005 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5013 off
= isl_dim_total(bmap
->dim
);
5014 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5015 if (isl_int_is_zero(bmap
->div
[i
][0]))
5017 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5023 static int map_divs_known(__isl_keep isl_map
*map
)
5030 for (i
= 0; i
< map
->n
; ++i
) {
5031 int known
= basic_map_divs_known(map
->p
[i
]);
5039 /* If bmap contains any unknown divs, then compute explicit
5040 * expressions for them. However, this computation may be
5041 * quite expensive, so first try to remove divs that aren't
5044 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5048 struct isl_map
*map
;
5050 known
= basic_map_divs_known(bmap
);
5054 return isl_map_from_basic_map(bmap
);
5056 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5058 known
= basic_map_divs_known(bmap
);
5062 return isl_map_from_basic_map(bmap
);
5064 map
= compute_divs(bmap
);
5067 isl_basic_map_free(bmap
);
5071 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5075 struct isl_map
*res
;
5082 known
= map_divs_known(map
);
5090 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5091 for (i
= 1 ; i
< map
->n
; ++i
) {
5093 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5094 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5095 res
= isl_map_union_disjoint(res
, r2
);
5097 res
= isl_map_union(res
, r2
);
5104 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5106 return (struct isl_set
*)
5107 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5110 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5112 return (struct isl_set
*)
5113 isl_map_compute_divs((struct isl_map
*)set
);
5116 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5119 struct isl_set
*set
;
5124 map
= isl_map_cow(map
);
5128 set
= (struct isl_set
*)map
;
5129 set
->dim
= isl_dim_domain(set
->dim
);
5132 for (i
= 0; i
< map
->n
; ++i
) {
5133 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5137 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5138 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5145 struct isl_map
*isl_map_union_disjoint(
5146 struct isl_map
*map1
, struct isl_map
*map2
)
5150 struct isl_map
*map
= NULL
;
5164 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5166 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5167 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5168 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5170 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5171 map1
->n
+ map2
->n
, flags
);
5174 for (i
= 0; i
< map1
->n
; ++i
) {
5175 map
= isl_map_add_basic_map(map
,
5176 isl_basic_map_copy(map1
->p
[i
]));
5180 for (i
= 0; i
< map2
->n
; ++i
) {
5181 map
= isl_map_add_basic_map(map
,
5182 isl_basic_map_copy(map2
->p
[i
]));
5196 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5198 map1
= isl_map_union_disjoint(map1
, map2
);
5202 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5206 struct isl_set
*isl_set_union_disjoint(
5207 struct isl_set
*set1
, struct isl_set
*set2
)
5209 return (struct isl_set
*)
5210 isl_map_union_disjoint(
5211 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5214 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5216 return (struct isl_set
*)
5217 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5220 struct isl_map
*isl_map_intersect_range(
5221 struct isl_map
*map
, struct isl_set
*set
)
5224 struct isl_map
*result
;
5230 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5231 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5232 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5234 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5235 map
->n
* set
->n
, flags
);
5238 for (i
= 0; i
< map
->n
; ++i
)
5239 for (j
= 0; j
< set
->n
; ++j
) {
5240 result
= isl_map_add_basic_map(result
,
5241 isl_basic_map_intersect_range(
5242 isl_basic_map_copy(map
->p
[i
]),
5243 isl_basic_set_copy(set
->p
[j
])));
5256 struct isl_map
*isl_map_intersect_domain(
5257 struct isl_map
*map
, struct isl_set
*set
)
5259 return isl_map_reverse(
5260 isl_map_intersect_range(isl_map_reverse(map
), set
));
5263 struct isl_map
*isl_map_apply_domain(
5264 struct isl_map
*map1
, struct isl_map
*map2
)
5268 map1
= isl_map_reverse(map1
);
5269 map1
= isl_map_apply_range(map1
, map2
);
5270 return isl_map_reverse(map1
);
5277 struct isl_map
*isl_map_apply_range(
5278 struct isl_map
*map1
, struct isl_map
*map2
)
5280 struct isl_dim
*dim_result
;
5281 struct isl_map
*result
;
5287 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5288 isl_dim_copy(map2
->dim
));
5290 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5293 for (i
= 0; i
< map1
->n
; ++i
)
5294 for (j
= 0; j
< map2
->n
; ++j
) {
5295 result
= isl_map_add_basic_map(result
,
5296 isl_basic_map_apply_range(
5297 isl_basic_map_copy(map1
->p
[i
]),
5298 isl_basic_map_copy(map2
->p
[j
])));
5304 if (result
&& result
->n
<= 1)
5305 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5314 * returns range - domain
5316 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5318 isl_dim
*dims
, *target_dim
;
5319 struct isl_basic_set
*bset
;
5326 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5327 bmap
->dim
, isl_dim_out
),
5329 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5330 dim
= isl_basic_map_n_in(bmap
);
5331 nparam
= isl_basic_map_n_param(bmap
);
5332 bset
= isl_basic_set_from_basic_map(bmap
);
5333 bset
= isl_basic_set_cow(bset
);
5334 dims
= isl_basic_set_get_dim(bset
);
5335 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5336 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5337 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5338 for (i
= 0; i
< dim
; ++i
) {
5339 int j
= isl_basic_map_alloc_equality(
5340 (struct isl_basic_map
*)bset
);
5343 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5344 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5345 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5346 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5348 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5349 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5352 isl_basic_map_free(bmap
);
5357 * returns range - domain
5359 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5363 struct isl_set
*result
;
5368 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5369 map
->dim
, isl_dim_out
),
5371 dim
= isl_map_get_dim(map
);
5372 dim
= isl_dim_domain(dim
);
5373 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5376 for (i
= 0; i
< map
->n
; ++i
)
5377 result
= isl_set_add_basic_set(result
,
5378 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5386 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5388 struct isl_basic_map
*bmap
;
5396 nparam
= dims
->nparam
;
5398 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5402 for (i
= 0; i
< dim
; ++i
) {
5403 int j
= isl_basic_map_alloc_equality(bmap
);
5406 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5407 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5408 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5410 return isl_basic_map_finalize(bmap
);
5412 isl_basic_map_free(bmap
);
5416 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5418 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5421 return basic_map_identity(dim
);
5424 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5426 if (!model
|| !model
->dim
)
5428 isl_assert(model
->ctx
,
5429 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5430 return basic_map_identity(isl_dim_copy(model
->dim
));
5433 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5435 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5436 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5439 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5441 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5444 return map_identity(dim
);
5447 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5449 if (!model
|| !model
->dim
)
5451 isl_assert(model
->ctx
,
5452 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5453 return map_identity(isl_dim_copy(model
->dim
));
5456 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5458 if (!model
|| !model
->dim
)
5460 isl_assert(model
->ctx
,
5461 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5462 return map_identity(isl_dim_copy(model
->dim
));
5465 /* Construct a basic set with all set dimensions having only non-negative
5468 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5473 struct isl_basic_set
*bset
;
5477 nparam
= dims
->nparam
;
5479 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5482 for (i
= 0; i
< dim
; ++i
) {
5483 int k
= isl_basic_set_alloc_inequality(bset
);
5486 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5487 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5491 isl_basic_set_free(bset
);
5495 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5496 enum isl_dim_type type
, unsigned first
, unsigned n
)
5499 isl_basic_set
*nonneg
= NULL
;
5500 isl_basic_set
*neg
= NULL
;
5507 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5509 for (i
= 0; i
< n
; ++i
) {
5513 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5514 k
= isl_basic_set_alloc_inequality(nonneg
);
5517 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5518 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5520 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5521 k
= isl_basic_set_alloc_inequality(neg
);
5524 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5525 isl_int_set_si(neg
->ineq
[k
][0], -1);
5526 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5528 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5533 isl_basic_set_free(nonneg
);
5534 isl_basic_set_free(neg
);
5539 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5541 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5544 int isl_basic_map_is_subset(
5545 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5548 struct isl_map
*map1
;
5549 struct isl_map
*map2
;
5551 if (!bmap1
|| !bmap2
)
5554 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5555 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5557 is_subset
= isl_map_is_subset(map1
, map2
);
5565 int isl_basic_map_is_equal(
5566 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5570 if (!bmap1
|| !bmap2
)
5572 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5575 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5579 int isl_basic_set_is_equal(
5580 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5582 return isl_basic_map_is_equal(
5583 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5586 int isl_map_is_empty(struct isl_map
*map
)
5593 for (i
= 0; i
< map
->n
; ++i
) {
5594 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5603 int isl_map_fast_is_empty(struct isl_map
*map
)
5605 return map
? map
->n
== 0 : -1;
5608 int isl_set_fast_is_empty(struct isl_set
*set
)
5610 return set
? set
->n
== 0 : -1;
5613 int isl_set_is_empty(struct isl_set
*set
)
5615 return isl_map_is_empty((struct isl_map
*)set
);
5618 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5623 return isl_dim_equal(map1
->dim
, map2
->dim
);
5626 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5631 return isl_dim_equal(set1
->dim
, set2
->dim
);
5634 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5640 is_subset
= isl_map_is_subset(map1
, map2
);
5643 is_subset
= isl_map_is_subset(map2
, map1
);
5647 int isl_basic_map_is_strict_subset(
5648 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5652 if (!bmap1
|| !bmap2
)
5654 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5657 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5658 if (is_subset
== -1)
5663 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5669 is_subset
= isl_map_is_subset(map1
, map2
);
5672 is_subset
= isl_map_is_subset(map2
, map1
);
5673 if (is_subset
== -1)
5678 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5680 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5683 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5687 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5690 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5694 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5697 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5704 for (i
= 0; i
< map
->n
; ++i
) {
5705 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5713 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5715 return isl_map_fast_is_universe((isl_map
*) set
);
5718 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5720 struct isl_basic_set
*bset
= NULL
;
5721 struct isl_vec
*sample
= NULL
;
5728 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5731 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5732 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5733 copy
= isl_basic_map_remove_redundancies(copy
);
5734 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5735 isl_basic_map_free(copy
);
5739 total
= 1 + isl_basic_map_total_dim(bmap
);
5740 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5741 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5747 isl_vec_free(bmap
->sample
);
5748 bmap
->sample
= NULL
;
5749 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5752 sample
= isl_basic_set_sample_vec(bset
);
5755 empty
= sample
->size
== 0;
5756 isl_vec_free(bmap
->sample
);
5757 bmap
->sample
= sample
;
5759 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5764 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5768 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5771 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5775 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5778 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5780 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5783 struct isl_map
*isl_basic_map_union(
5784 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5786 struct isl_map
*map
;
5787 if (!bmap1
|| !bmap2
)
5790 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5792 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5795 map
= isl_map_add_basic_map(map
, bmap1
);
5796 map
= isl_map_add_basic_map(map
, bmap2
);
5799 isl_basic_map_free(bmap1
);
5800 isl_basic_map_free(bmap2
);
5804 struct isl_set
*isl_basic_set_union(
5805 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5807 return (struct isl_set
*)isl_basic_map_union(
5808 (struct isl_basic_map
*)bset1
,
5809 (struct isl_basic_map
*)bset2
);
5812 /* Order divs such that any div only depends on previous divs */
5813 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5821 off
= isl_dim_total(bmap
->dim
);
5823 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5825 if (isl_int_is_zero(bmap
->div
[i
][0]))
5827 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5831 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5837 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5839 return (struct isl_basic_set
*)
5840 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5843 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5850 for (i
= 0; i
< map
->n
; ++i
) {
5851 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5862 /* Look for a div in dst that corresponds to the div "div" in src.
5863 * The divs before "div" in src and dst are assumed to be the same.
5865 * Returns -1 if no corresponding div was found and the position
5866 * of the corresponding div in dst otherwise.
5868 static int find_div(struct isl_basic_map
*dst
,
5869 struct isl_basic_map
*src
, unsigned div
)
5873 unsigned total
= isl_dim_total(src
->dim
);
5875 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5876 for (i
= div
; i
< dst
->n_div
; ++i
)
5877 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5878 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5879 dst
->n_div
- div
) == -1)
5884 struct isl_basic_map
*isl_basic_map_align_divs(
5885 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5888 unsigned total
= isl_dim_total(src
->dim
);
5893 if (src
->n_div
== 0)
5896 for (i
= 0; i
< src
->n_div
; ++i
)
5897 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5899 src
= isl_basic_map_order_divs(src
);
5900 dst
= isl_basic_map_cow(dst
);
5901 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5902 src
->n_div
, 0, 2 * src
->n_div
);
5905 for (i
= 0; i
< src
->n_div
; ++i
) {
5906 int j
= find_div(dst
, src
, i
);
5908 j
= isl_basic_map_alloc_div(dst
);
5911 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5912 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5913 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5917 isl_basic_map_swap_div(dst
, i
, j
);
5921 isl_basic_map_free(dst
);
5925 struct isl_basic_set
*isl_basic_set_align_divs(
5926 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
5928 return (struct isl_basic_set
*)isl_basic_map_align_divs(
5929 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
5932 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
5940 map
= isl_map_compute_divs(map
);
5941 map
= isl_map_cow(map
);
5945 for (i
= 1; i
< map
->n
; ++i
)
5946 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
5947 for (i
= 1; i
< map
->n
; ++i
)
5948 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
5950 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5954 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
5956 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
5959 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
5963 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
5964 map
= isl_map_intersect_domain(map
, set
);
5965 set
= isl_map_range(map
);
5973 /* There is no need to cow as removing empty parts doesn't change
5974 * the meaning of the set.
5976 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
5983 for (i
= map
->n
-1; i
>= 0; --i
) {
5984 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
5986 isl_basic_map_free(map
->p
[i
]);
5987 if (i
!= map
->n
-1) {
5988 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5989 map
->p
[i
] = map
->p
[map
->n
-1];
5997 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
5999 return (struct isl_set
*)
6000 isl_map_remove_empty_parts((struct isl_map
*)set
);
6003 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6005 struct isl_basic_map
*bmap
;
6006 if (!map
|| map
->n
== 0)
6008 bmap
= map
->p
[map
->n
-1];
6009 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6010 return isl_basic_map_copy(bmap
);
6013 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6015 return (struct isl_basic_set
*)
6016 isl_map_copy_basic_map((struct isl_map
*)set
);
6019 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6020 __isl_keep isl_basic_map
*bmap
)
6026 for (i
= map
->n
-1; i
>= 0; --i
) {
6027 if (map
->p
[i
] != bmap
)
6029 map
= isl_map_cow(map
);
6032 isl_basic_map_free(map
->p
[i
]);
6033 if (i
!= map
->n
-1) {
6034 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6035 map
->p
[i
] = map
->p
[map
->n
-1];
6046 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6047 struct isl_basic_set
*bset
)
6049 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6050 (struct isl_basic_map
*)bset
);
6053 /* Given two basic sets bset1 and bset2, compute the maximal difference
6054 * between the values of dimension pos in bset1 and those in bset2
6055 * for any common value of the parameters and dimensions preceding pos.
6057 static enum isl_lp_result
basic_set_maximal_difference_at(
6058 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6059 int pos
, isl_int
*opt
)
6061 struct isl_dim
*dims
;
6062 struct isl_basic_map
*bmap1
= NULL
;
6063 struct isl_basic_map
*bmap2
= NULL
;
6064 struct isl_ctx
*ctx
;
6065 struct isl_vec
*obj
;
6068 unsigned dim1
, dim2
;
6069 enum isl_lp_result res
;
6071 if (!bset1
|| !bset2
)
6072 return isl_lp_error
;
6074 nparam
= isl_basic_set_n_param(bset1
);
6075 dim1
= isl_basic_set_n_dim(bset1
);
6076 dim2
= isl_basic_set_n_dim(bset2
);
6077 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6078 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6079 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6080 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6081 if (!bmap1
|| !bmap2
)
6083 bmap1
= isl_basic_map_cow(bmap1
);
6084 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6085 pos
, (dim1
- pos
) + (dim2
- pos
),
6086 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6087 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6090 total
= isl_basic_map_total_dim(bmap1
);
6092 obj
= isl_vec_alloc(ctx
, 1 + total
);
6093 isl_seq_clr(obj
->block
.data
, 1 + total
);
6094 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6095 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6098 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6100 isl_basic_map_free(bmap1
);
6104 isl_basic_map_free(bmap1
);
6105 isl_basic_map_free(bmap2
);
6106 return isl_lp_error
;
6109 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6110 * for any common value of the parameters and dimensions preceding pos
6111 * in both basic sets, the values of dimension pos in bset1 are
6112 * smaller or larger than those in bset2.
6115 * 1 if bset1 follows bset2
6116 * -1 if bset1 precedes bset2
6117 * 0 if bset1 and bset2 are incomparable
6118 * -2 if some error occurred.
6120 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6121 struct isl_basic_set
*bset2
, int pos
)
6124 enum isl_lp_result res
;
6129 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6131 if (res
== isl_lp_empty
)
6133 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6134 res
== isl_lp_unbounded
)
6136 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6145 /* Given two basic sets bset1 and bset2, check whether
6146 * for any common value of the parameters and dimensions preceding pos
6147 * there is a value of dimension pos in bset1 that is larger
6148 * than a value of the same dimension in bset2.
6151 * 1 if there exists such a pair
6152 * 0 if there is no such pair, but there is a pair of equal values
6154 * -2 if some error occurred.
6156 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6157 __isl_keep isl_basic_set
*bset2
, int pos
)
6160 enum isl_lp_result res
;
6165 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6167 if (res
== isl_lp_empty
)
6169 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6170 res
== isl_lp_unbounded
)
6172 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6174 else if (res
== isl_lp_ok
)
6183 /* Given two sets set1 and set2, check whether
6184 * for any common value of the parameters and dimensions preceding pos
6185 * there is a value of dimension pos in set1 that is larger
6186 * than a value of the same dimension in set2.
6189 * 1 if there exists such a pair
6190 * 0 if there is no such pair, but there is a pair of equal values
6192 * -2 if some error occurred.
6194 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6195 __isl_keep isl_set
*set2
, int pos
)
6203 for (i
= 0; i
< set1
->n
; ++i
)
6204 for (j
= 0; j
< set2
->n
; ++j
) {
6206 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6207 if (f
== 1 || f
== -2)
6216 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6217 unsigned pos
, isl_int
*val
)
6225 total
= isl_basic_map_total_dim(bmap
);
6226 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6227 for (; d
+1 > pos
; --d
)
6228 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6232 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6234 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6236 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6239 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6245 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6246 unsigned pos
, isl_int
*val
)
6258 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6261 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6262 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6263 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6264 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6268 isl_int_set(*val
, v
);
6274 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6275 unsigned pos
, isl_int
*val
)
6277 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6281 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6284 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6287 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6288 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6290 if (pos
>= isl_basic_map_dim(bmap
, type
))
6292 return isl_basic_map_fast_has_fixed_var(bmap
,
6293 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6296 int isl_map_fast_is_fixed(struct isl_map
*map
,
6297 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6299 if (pos
>= isl_map_dim(map
, type
))
6301 return isl_map_fast_has_fixed_var(map
,
6302 map_offset(map
, type
) - 1 + pos
, val
);
6305 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6306 * then return this fixed value in *val.
6308 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6311 return isl_basic_set_fast_has_fixed_var(bset
,
6312 isl_basic_set_n_param(bset
) + dim
, val
);
6315 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6316 * then return this fixed value in *val.
6318 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6320 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6323 /* Check if input variable in has fixed value and if so and if val is not NULL,
6324 * then return this fixed value in *val.
6326 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6328 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6331 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6332 * and if val is not NULL, then return this lower bound in *val.
6334 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6335 unsigned dim
, isl_int
*val
)
6337 int i
, i_eq
= -1, i_ineq
= -1;
6344 total
= isl_basic_set_total_dim(bset
);
6345 nparam
= isl_basic_set_n_param(bset
);
6346 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6347 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6353 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6354 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6356 if (i_eq
!= -1 || i_ineq
!= -1)
6360 if (i_eq
== -1 && i_ineq
== -1)
6362 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6363 /* The coefficient should always be one due to normalization. */
6364 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6366 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6368 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6369 total
- nparam
- dim
- 1) != -1)
6372 isl_int_neg(*val
, c
[0]);
6376 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6377 unsigned dim
, isl_int
*val
)
6389 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6393 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6395 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6396 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6398 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6402 isl_int_set(*val
, v
);
6413 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6415 const struct constraint
*c1
= (const struct constraint
*)p1
;
6416 const struct constraint
*c2
= (const struct constraint
*)p2
;
6417 unsigned size
= isl_min(c1
->size
, c2
->size
);
6418 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6421 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6422 struct isl_basic_map
*bmap
)
6425 struct constraint
*c
;
6430 total
= isl_basic_map_total_dim(bmap
);
6431 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6434 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6436 c
[i
].c
= bmap
->ineq
[i
];
6438 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6439 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6440 bmap
->ineq
[i
] = c
[i
].c
;
6444 isl_basic_map_free(bmap
);
6448 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6449 __isl_take isl_basic_set
*bset
)
6451 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6452 (struct isl_basic_map
*)bset
);
6455 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6459 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6461 bmap
= isl_basic_map_remove_redundancies(bmap
);
6462 bmap
= isl_basic_map_sort_constraints(bmap
);
6463 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6467 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6469 return (struct isl_basic_set
*)isl_basic_map_normalize(
6470 (struct isl_basic_map
*)bset
);
6473 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6474 const __isl_keep isl_basic_map
*bmap2
)
6481 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6482 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6483 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6484 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6485 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6486 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6487 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6488 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6490 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6492 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6494 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6495 return bmap1
->n_eq
- bmap2
->n_eq
;
6496 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6497 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6498 if (bmap1
->n_div
!= bmap2
->n_div
)
6499 return bmap1
->n_div
- bmap2
->n_div
;
6500 total
= isl_basic_map_total_dim(bmap1
);
6501 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6502 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6506 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6507 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6511 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6512 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6519 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6520 __isl_keep isl_basic_map
*bmap2
)
6522 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6525 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6526 __isl_keep isl_basic_set
*bset2
)
6528 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6529 (isl_basic_map
*)bset2
);
6532 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6534 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6535 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6537 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6540 /* We normalize in place, but if anything goes wrong we need
6541 * to return NULL, so we need to make sure we don't change the
6542 * meaning of any possible other copies of map.
6544 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6547 struct isl_basic_map
*bmap
;
6551 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6553 for (i
= 0; i
< map
->n
; ++i
) {
6554 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6557 isl_basic_map_free(map
->p
[i
]);
6560 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6561 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6562 map
= isl_map_remove_empty_parts(map
);
6565 for (i
= map
->n
- 1; i
>= 1; --i
) {
6566 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6568 isl_basic_map_free(map
->p
[i
-1]);
6569 for (j
= i
; j
< map
->n
; ++j
)
6570 map
->p
[j
-1] = map
->p
[j
];
6580 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6582 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6585 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6595 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6598 map1
= isl_map_copy(map1
);
6599 map2
= isl_map_copy(map2
);
6600 map1
= isl_map_normalize(map1
);
6601 map2
= isl_map_normalize(map2
);
6604 equal
= map1
->n
== map2
->n
;
6605 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6606 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6619 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6621 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6622 (struct isl_map
*)set2
);
6625 /* Return an interval that ranges from min to max (inclusive)
6627 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6628 isl_int min
, isl_int max
)
6631 struct isl_basic_set
*bset
= NULL
;
6633 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6637 k
= isl_basic_set_alloc_inequality(bset
);
6640 isl_int_set_si(bset
->ineq
[k
][1], 1);
6641 isl_int_neg(bset
->ineq
[k
][0], min
);
6643 k
= isl_basic_set_alloc_inequality(bset
);
6646 isl_int_set_si(bset
->ineq
[k
][1], -1);
6647 isl_int_set(bset
->ineq
[k
][0], max
);
6651 isl_basic_set_free(bset
);
6655 /* Return the Cartesian product of the basic sets in list (in the given order).
6657 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6665 struct isl_basic_set
*product
= NULL
;
6669 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6670 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6671 nparam
= isl_basic_set_n_param(list
->p
[0]);
6672 dim
= isl_basic_set_n_dim(list
->p
[0]);
6673 extra
= list
->p
[0]->n_div
;
6674 n_eq
= list
->p
[0]->n_eq
;
6675 n_ineq
= list
->p
[0]->n_ineq
;
6676 for (i
= 1; i
< list
->n
; ++i
) {
6677 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6678 isl_assert(list
->ctx
,
6679 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6680 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6681 extra
+= list
->p
[i
]->n_div
;
6682 n_eq
+= list
->p
[i
]->n_eq
;
6683 n_ineq
+= list
->p
[i
]->n_ineq
;
6685 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6690 for (i
= 0; i
< list
->n
; ++i
) {
6691 isl_basic_set_add_constraints(product
,
6692 isl_basic_set_copy(list
->p
[i
]), dim
);
6693 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6695 isl_basic_set_list_free(list
);
6698 isl_basic_set_free(product
);
6699 isl_basic_set_list_free(list
);
6703 struct isl_basic_map
*isl_basic_map_product(
6704 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6706 struct isl_dim
*dim_result
= NULL
;
6707 struct isl_basic_map
*bmap
;
6708 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6709 struct isl_dim_map
*dim_map1
, *dim_map2
;
6711 if (!bmap1
|| !bmap2
)
6714 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6715 bmap2
->dim
, isl_dim_param
), goto error
);
6716 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6717 isl_dim_copy(bmap2
->dim
));
6719 in1
= isl_basic_map_n_in(bmap1
);
6720 in2
= isl_basic_map_n_in(bmap2
);
6721 out1
= isl_basic_map_n_out(bmap1
);
6722 out2
= isl_basic_map_n_out(bmap2
);
6723 nparam
= isl_basic_map_n_param(bmap1
);
6725 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6726 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6727 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6728 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6729 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6730 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6731 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6732 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6733 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6734 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6735 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6737 bmap
= isl_basic_map_alloc_dim(dim_result
,
6738 bmap1
->n_div
+ bmap2
->n_div
,
6739 bmap1
->n_eq
+ bmap2
->n_eq
,
6740 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6741 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6742 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6743 bmap
= isl_basic_map_simplify(bmap
);
6744 return isl_basic_map_finalize(bmap
);
6746 isl_basic_map_free(bmap1
);
6747 isl_basic_map_free(bmap2
);
6751 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6753 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6756 struct isl_map
*result
;
6762 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6763 map2
->dim
, isl_dim_param
), goto error
);
6765 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6766 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6767 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6769 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6770 isl_dim_copy(map2
->dim
)),
6771 map1
->n
* map2
->n
, flags
);
6774 for (i
= 0; i
< map1
->n
; ++i
)
6775 for (j
= 0; j
< map2
->n
; ++j
) {
6776 struct isl_basic_map
*part
;
6777 part
= isl_basic_map_product(
6778 isl_basic_map_copy(map1
->p
[i
]),
6779 isl_basic_map_copy(map2
->p
[j
]));
6780 if (isl_basic_map_is_empty(part
))
6781 isl_basic_map_free(part
);
6783 result
= isl_map_add_basic_map(result
, part
);
6796 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6798 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
6799 __isl_take isl_map
*map2
)
6803 prod
= isl_map_product(map1
, map2
);
6804 prod
= isl_map_flatten(prod
);
6808 /* Given two set A and B, construct its Cartesian product A x B.
6810 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6812 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6813 (struct isl_map
*)set2
);
6816 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
6817 __isl_take isl_set
*set2
)
6819 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
6822 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6825 uint32_t hash
= isl_hash_init();
6830 bset
= isl_basic_set_copy(bset
);
6831 bset
= isl_basic_set_normalize(bset
);
6834 total
= isl_basic_set_total_dim(bset
);
6835 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6836 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6838 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6839 isl_hash_hash(hash
, c_hash
);
6841 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6842 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6844 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6845 isl_hash_hash(hash
, c_hash
);
6847 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6848 for (i
= 0; i
< bset
->n_div
; ++i
) {
6850 if (isl_int_is_zero(bset
->div
[i
][0]))
6852 isl_hash_byte(hash
, i
& 0xFF);
6853 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6854 isl_hash_hash(hash
, c_hash
);
6856 isl_basic_set_free(bset
);
6860 uint32_t isl_set_get_hash(struct isl_set
*set
)
6867 set
= isl_set_copy(set
);
6868 set
= isl_set_normalize(set
);
6872 hash
= isl_hash_init();
6873 for (i
= 0; i
< set
->n
; ++i
) {
6875 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6876 isl_hash_hash(hash
, bset_hash
);
6884 /* Check if the value for dimension dim is completely determined
6885 * by the values of the other parameters and variables.
6886 * That is, check if dimension dim is involved in an equality.
6888 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6895 nparam
= isl_basic_set_n_param(bset
);
6896 for (i
= 0; i
< bset
->n_eq
; ++i
)
6897 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6902 /* Check if the value for dimension dim is completely determined
6903 * by the values of the other parameters and variables.
6904 * That is, check if dimension dim is involved in an equality
6905 * for each of the subsets.
6907 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6913 for (i
= 0; i
< set
->n
; ++i
) {
6915 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6922 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
6924 return set
? set
->n
: 0;
6927 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
6928 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
6935 for (i
= 0; i
< map
->n
; ++i
)
6936 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
6942 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
6943 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
6950 for (i
= 0; i
< set
->n
; ++i
)
6951 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
6957 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
6959 struct isl_dim
*dim
;
6964 if (bset
->n_div
== 0)
6967 bset
= isl_basic_set_cow(bset
);
6971 dim
= isl_basic_set_get_dim(bset
);
6972 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
6975 isl_dim_free(bset
->dim
);
6979 bset
= isl_basic_set_finalize(bset
);
6983 isl_basic_set_free(bset
);
6987 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
6990 struct isl_dim
*dim
;
6993 set
= isl_set_align_divs(set
);
6997 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
7000 set
= isl_set_cow(set
);
7004 n_div
= set
->p
[0]->n_div
;
7005 dim
= isl_set_get_dim(set
);
7006 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
7009 isl_dim_free(set
->dim
);
7012 for (i
= 0; i
< set
->n
; ++i
) {
7013 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7024 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7026 struct isl_dim
*dim
;
7027 struct isl_basic_map
*bmap
;
7034 set
= isl_set_align_divs(set
);
7039 dim
= isl_set_get_dim(set
);
7040 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7042 return isl_map_identity(dim
);
7045 n_div
= set
->p
[0]->n_div
;
7046 dim
= isl_dim_map(dim
);
7047 n_param
= isl_dim_size(dim
, isl_dim_param
);
7048 n_set
= isl_dim_size(dim
, isl_dim_in
);
7049 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7050 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7051 for (i
= 0; i
< n_set
; ++i
)
7052 bmap
= var_equal(bmap
, i
);
7054 total
= n_param
+ n_set
+ n_set
+ n_div
;
7055 for (i
= 0; i
< n_div
; ++i
) {
7056 k
= isl_basic_map_alloc_inequality(bmap
);
7059 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7060 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7061 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7062 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7063 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7064 set
->p
[0]->div
[i
][0]);
7066 l
= isl_basic_map_alloc_inequality(bmap
);
7069 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7070 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7071 set
->p
[0]->div
[i
][0]);
7072 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7076 return isl_map_from_basic_map(bmap
);
7079 isl_basic_map_free(bmap
);
7083 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7091 dim
= isl_basic_set_total_dim(bset
);
7092 size
+= bset
->n_eq
* (1 + dim
);
7093 size
+= bset
->n_ineq
* (1 + dim
);
7094 size
+= bset
->n_div
* (2 + dim
);
7099 int isl_set_size(__isl_keep isl_set
*set
)
7107 for (i
= 0; i
< set
->n
; ++i
)
7108 size
+= isl_basic_set_size(set
->p
[i
]);
7113 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7114 enum isl_dim_type type
, unsigned pos
)
7122 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7124 pos
+= isl_basic_map_offset(bmap
, type
);
7126 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7127 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7131 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7132 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7139 return lower
&& upper
;
7142 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7143 enum isl_dim_type type
, unsigned pos
)
7150 for (i
= 0; i
< map
->n
; ++i
) {
7152 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7153 if (bounded
< 0 || !bounded
)
7160 /* Return 1 if the specified dim is involved in both an upper bound
7161 * and a lower bound.
7163 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7164 enum isl_dim_type type
, unsigned pos
)
7166 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7169 /* For each of the "n" variables starting at "first", determine
7170 * the sign of the variable and put the results in the first "n"
7171 * elements of the array "signs".
7173 * 1 means that the variable is non-negative
7174 * -1 means that the variable is non-positive
7175 * 0 means the variable attains both positive and negative values.
7177 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7178 unsigned first
, unsigned n
, int *signs
)
7180 isl_vec
*bound
= NULL
;
7181 struct isl_tab
*tab
= NULL
;
7182 struct isl_tab_undo
*snap
;
7185 if (!bset
|| !signs
)
7188 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7189 tab
= isl_tab_from_basic_set(bset
);
7193 isl_seq_clr(bound
->el
, bound
->size
);
7194 isl_int_set_si(bound
->el
[0], -1);
7196 snap
= isl_tab_snap(tab
);
7197 for (i
= 0; i
< n
; ++i
) {
7200 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7201 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7204 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7205 if (isl_tab_rollback(tab
, snap
) < 0)
7213 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7214 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7217 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7218 if (isl_tab_rollback(tab
, snap
) < 0)
7221 signs
[i
] = empty
? -1 : 0;
7225 isl_vec_free(bound
);
7229 isl_vec_free(bound
);
7233 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7234 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7236 if (!bset
|| !signs
)
7238 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7241 first
+= pos(bset
->dim
, type
) - 1;
7242 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7245 /* Check if the given map is single-valued.
7250 * and check if the result is a subset of the identity mapping.
7252 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7258 test
= isl_map_reverse(isl_map_copy(map
));
7259 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7261 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7263 sv
= isl_map_is_subset(test
, id
);
7271 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7275 sv
= isl_map_is_single_valued(map
);
7279 map
= isl_map_copy(map
);
7280 map
= isl_map_reverse(map
);
7281 sv
= isl_map_is_single_valued(map
);
7287 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7289 return isl_map_is_single_valued((isl_map
*)set
);
7292 int isl_map_is_translation(__isl_keep isl_map
*map
)
7297 delta
= isl_map_deltas(isl_map_copy(map
));
7298 ok
= isl_set_is_singleton(delta
);
7299 isl_set_free(delta
);
7304 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7306 if (isl_seq_first_non_zero(p
, pos
) != -1)
7308 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7313 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7322 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7325 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7326 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7327 for (j
= 0; j
< nvar
; ++j
) {
7328 int lower
= 0, upper
= 0;
7329 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7330 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7332 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7338 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7339 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7341 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7343 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7348 if (!lower
|| !upper
)
7355 int isl_set_is_box(__isl_keep isl_set
*set
)
7362 return isl_basic_set_is_box(set
->p
[0]);
7365 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7370 return isl_dim_is_wrapping(bset
->dim
);
7373 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7378 return isl_dim_is_wrapping(set
->dim
);
7381 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7383 bmap
= isl_basic_map_cow(bmap
);
7387 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7391 bmap
= isl_basic_map_finalize(bmap
);
7393 return (isl_basic_set
*)bmap
;
7395 isl_basic_map_free(bmap
);
7399 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7403 map
= isl_map_cow(map
);
7407 for (i
= 0; i
< map
->n
; ++i
) {
7408 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7412 map
->dim
= isl_dim_wrap(map
->dim
);
7416 return (isl_set
*)map
;
7422 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7424 bset
= isl_basic_set_cow(bset
);
7428 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7432 bset
= isl_basic_set_finalize(bset
);
7434 return (isl_basic_map
*)bset
;
7436 isl_basic_set_free(bset
);
7440 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7447 if (!isl_set_is_wrapping(set
))
7448 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7451 set
= isl_set_cow(set
);
7455 for (i
= 0; i
< set
->n
; ++i
) {
7456 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7461 set
->dim
= isl_dim_unwrap(set
->dim
);
7465 return (isl_map
*)set
;
7471 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7472 enum isl_dim_type type
)
7477 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7480 bmap
= isl_basic_map_cow(bmap
);
7484 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7488 bmap
= isl_basic_map_finalize(bmap
);
7492 isl_basic_map_free(bmap
);
7496 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7497 enum isl_dim_type type
)
7504 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7507 map
= isl_map_cow(map
);
7511 for (i
= 0; i
< map
->n
; ++i
) {
7512 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7516 map
->dim
= isl_dim_reset(map
->dim
, type
);
7526 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7531 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7534 bmap
= isl_basic_map_cow(bmap
);
7538 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7542 bmap
= isl_basic_map_finalize(bmap
);
7546 isl_basic_map_free(bmap
);
7550 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7557 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7560 map
= isl_map_cow(map
);
7564 for (i
= 0; i
< map
->n
; ++i
) {
7565 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7569 map
->dim
= isl_dim_flatten(map
->dim
);
7579 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
7581 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
7584 /* Extend the given dim_map with mappings for the divs in bmap.
7586 static __isl_give
struct isl_dim_map
*extend_dim_map(
7587 __isl_keep
struct isl_dim_map
*dim_map
,
7588 __isl_keep isl_basic_map
*bmap
)
7591 struct isl_dim_map
*res
;
7594 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7596 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7600 for (i
= 0; i
< dim_map
->len
; ++i
)
7601 res
->pos
[i
] = dim_map
->pos
[i
];
7602 for (i
= 0; i
< bmap
->n_div
; ++i
)
7603 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7608 /* Extract a dim_map from a reordering.
7609 * We essentially need to reverse the mapping, and add an offset
7610 * of 1 for the constant term.
7612 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7613 __isl_keep isl_reordering
*exp
)
7616 struct isl_dim_map
*dim_map
;
7621 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7625 for (i
= 0; i
< exp
->len
; ++i
)
7626 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7631 /* Reorder the dimensions of "bmap" according to the given dim_map
7632 * and set the dimension specification to "dim".
7634 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7635 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
7639 bmap
= isl_basic_map_cow(bmap
);
7640 if (!bmap
|| !dim
|| !dim_map
)
7643 res
= isl_basic_map_alloc_dim(dim
,
7644 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
7645 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
7646 res
= isl_basic_map_finalize(res
);
7650 isl_basic_map_free(bmap
);
7655 /* Reorder the dimensions of "map" according to given reordering.
7657 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
7658 __isl_take isl_reordering
*r
)
7661 struct isl_dim_map
*dim_map
;
7663 map
= isl_map_cow(map
);
7664 dim_map
= isl_dim_map_from_reordering(r
);
7665 if (!map
|| !r
|| !dim_map
)
7668 for (i
= 0; i
< map
->n
; ++i
) {
7669 struct isl_dim_map
*dim_map_i
;
7671 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
7673 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
7674 isl_dim_copy(r
->dim
), dim_map_i
);
7680 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
7682 isl_reordering_free(r
);
7688 isl_reordering_free(r
);
7692 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
7693 __isl_take isl_reordering
*r
)
7695 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
7698 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
7699 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7700 enum isl_dim_type c2
, enum isl_dim_type c3
,
7701 enum isl_dim_type c4
, enum isl_dim_type c5
)
7703 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7704 struct isl_mat
*mat
;
7710 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
7711 isl_basic_map_total_dim(bmap
) + 1);
7714 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7715 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7716 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7717 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7718 isl_int_set(mat
->row
[i
][pos
],
7719 bmap
->eq
[i
][off
+ k
]);
7727 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
7728 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7729 enum isl_dim_type c2
, enum isl_dim_type c3
,
7730 enum isl_dim_type c4
, enum isl_dim_type c5
)
7732 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7733 struct isl_mat
*mat
;
7739 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
7740 isl_basic_map_total_dim(bmap
) + 1);
7743 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7744 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7745 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7746 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7747 isl_int_set(mat
->row
[i
][pos
],
7748 bmap
->ineq
[i
][off
+ k
]);
7756 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
7757 __isl_take isl_dim
*dim
,
7758 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
7759 enum isl_dim_type c2
, enum isl_dim_type c3
,
7760 enum isl_dim_type c4
, enum isl_dim_type c5
)
7762 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7763 isl_basic_map
*bmap
;
7769 if (!dim
|| !eq
|| !ineq
)
7772 if (eq
->n_col
!= ineq
->n_col
)
7773 isl_die(dim
->ctx
, isl_error_invalid
,
7774 "equalities and inequalities matrices should have "
7775 "same number of columns", goto error
);
7777 total
= 1 + isl_dim_total(dim
);
7779 if (eq
->n_col
< total
)
7780 isl_die(dim
->ctx
, isl_error_invalid
,
7781 "number of columns too small", goto error
);
7783 extra
= eq
->n_col
- total
;
7785 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
7786 eq
->n_row
, ineq
->n_row
);
7789 for (i
= 0; i
< extra
; ++i
)
7790 if (isl_basic_map_alloc_div(bmap
) < 0)
7792 for (i
= 0; i
< eq
->n_row
; ++i
) {
7793 l
= isl_basic_map_alloc_equality(bmap
);
7796 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7797 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7798 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7799 isl_int_set(bmap
->eq
[l
][off
+ k
],
7805 for (i
= 0; i
< ineq
->n_row
; ++i
) {
7806 l
= isl_basic_map_alloc_inequality(bmap
);
7809 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7810 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7811 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7812 isl_int_set(bmap
->ineq
[l
][off
+ k
],
7831 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
7832 __isl_take isl_dim
*dim
,
7833 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
7834 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
7836 return (isl_basic_set
*)
7837 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
7838 c1
, c2
, c3
, c4
, isl_dim_in
);