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 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
333 enum isl_dim_type type
, const char *s
)
337 map
= isl_map_cow(map
);
341 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
345 for (i
= 0; i
< map
->n
; ++i
) {
346 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
357 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
360 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
363 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
364 __isl_take isl_basic_map
*bmap
,
365 enum isl_dim_type type
, unsigned pos
, const char *s
)
369 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
374 isl_basic_map_free(bmap
);
378 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
379 enum isl_dim_type type
, unsigned pos
, const char *s
)
386 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
390 for (i
= 0; i
< map
->n
; ++i
) {
391 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
402 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
403 __isl_take isl_basic_set
*bset
,
404 enum isl_dim_type type
, unsigned pos
, const char *s
)
406 return (isl_basic_set
*)isl_basic_map_set_dim_name(
407 (isl_basic_map
*)bset
, type
, pos
, s
);
410 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
411 enum isl_dim_type type
, unsigned pos
, const char *s
)
413 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
416 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
420 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
423 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
424 struct isl_basic_map
*bmap
, unsigned extra
,
425 unsigned n_eq
, unsigned n_ineq
)
428 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
433 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
434 if (isl_blk_is_error(bmap
->block
))
437 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
442 bmap
->block2
= isl_blk_empty();
445 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
446 if (isl_blk_is_error(bmap
->block2
))
449 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
454 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
455 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
457 for (i
= 0; i
< extra
; ++i
)
458 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
462 bmap
->c_size
= n_eq
+ n_ineq
;
463 bmap
->eq
= bmap
->ineq
+ n_ineq
;
472 isl_basic_map_free(bmap
);
476 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
477 unsigned nparam
, unsigned dim
, unsigned extra
,
478 unsigned n_eq
, unsigned n_ineq
)
480 struct isl_basic_map
*bmap
;
481 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
482 return (struct isl_basic_set
*)bmap
;
485 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
486 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
488 struct isl_basic_map
*bmap
;
491 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
492 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
493 return (struct isl_basic_set
*)bmap
;
496 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
497 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
499 struct isl_basic_map
*bmap
;
503 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
508 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
514 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
515 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
516 unsigned n_eq
, unsigned n_ineq
)
518 struct isl_basic_map
*bmap
;
521 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
525 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
529 static void dup_constraints(
530 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
533 unsigned total
= isl_basic_map_total_dim(src
);
535 for (i
= 0; i
< src
->n_eq
; ++i
) {
536 int j
= isl_basic_map_alloc_equality(dst
);
537 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
540 for (i
= 0; i
< src
->n_ineq
; ++i
) {
541 int j
= isl_basic_map_alloc_inequality(dst
);
542 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
545 for (i
= 0; i
< src
->n_div
; ++i
) {
546 int j
= isl_basic_map_alloc_div(dst
);
547 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
549 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
552 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
554 struct isl_basic_map
*dup
;
558 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
559 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
562 dup_constraints(dup
, bmap
);
563 dup
->flags
= bmap
->flags
;
564 dup
->sample
= isl_vec_copy(bmap
->sample
);
568 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
570 struct isl_basic_map
*dup
;
572 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
573 return (struct isl_basic_set
*)dup
;
576 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
581 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
585 return isl_basic_set_dup(bset
);
588 struct isl_set
*isl_set_copy(struct isl_set
*set
)
597 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
602 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
606 bmap
= isl_basic_map_dup(bmap
);
608 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
612 struct isl_map
*isl_map_copy(struct isl_map
*map
)
621 void isl_basic_map_free(struct isl_basic_map
*bmap
)
629 isl_ctx_deref(bmap
->ctx
);
631 isl_blk_free(bmap
->ctx
, bmap
->block2
);
633 isl_blk_free(bmap
->ctx
, bmap
->block
);
634 isl_vec_free(bmap
->sample
);
635 isl_dim_free(bmap
->dim
);
639 void isl_basic_set_free(struct isl_basic_set
*bset
)
641 isl_basic_map_free((struct isl_basic_map
*)bset
);
644 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
646 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
649 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
655 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
656 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
658 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
659 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
660 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
661 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
662 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
663 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
665 int j
= isl_basic_map_alloc_inequality(bmap
);
669 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
670 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
677 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
678 bmap
->extra
- bmap
->n_div
);
682 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
684 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
687 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
691 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
696 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
698 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
701 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
706 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
708 if (pos
!= bmap
->n_eq
- 1) {
710 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
711 bmap
->eq
[bmap
->n_eq
- 1] = t
;
717 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
719 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
722 void isl_basic_map_inequality_to_equality(
723 struct isl_basic_map
*bmap
, unsigned pos
)
728 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
729 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
734 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
735 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
736 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
737 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
740 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
742 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
745 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
751 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
752 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
753 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
754 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
755 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
756 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
757 1 + isl_basic_map_total_dim(bmap
),
758 bmap
->extra
- bmap
->n_div
);
759 return bmap
->n_ineq
++;
762 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
764 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
767 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
771 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
776 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
778 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
781 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
786 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
788 if (pos
!= bmap
->n_ineq
- 1) {
790 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
791 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
792 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
798 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
800 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
803 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
808 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
811 k
= isl_basic_map_alloc_equality(bmap
);
814 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
817 isl_basic_map_free(bmap
);
821 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
824 return (isl_basic_set
*)
825 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
828 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
833 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
836 k
= isl_basic_map_alloc_inequality(bmap
);
839 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
842 isl_basic_map_free(bmap
);
846 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
849 return (isl_basic_set
*)
850 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
853 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
857 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
858 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
859 1 + 1 + isl_basic_map_total_dim(bmap
),
860 bmap
->extra
- bmap
->n_div
);
861 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
862 return bmap
->n_div
++;
865 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
867 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
870 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
874 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
879 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
881 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
884 /* Copy constraint from src to dst, putting the vars of src at offset
885 * dim_off in dst and the divs of src at offset div_off in dst.
886 * If both sets are actually map, then dim_off applies to the input
889 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
890 struct isl_basic_map
*src_map
, isl_int
*src
,
891 unsigned in_off
, unsigned out_off
, unsigned div_off
)
893 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
894 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
895 unsigned src_in
= isl_basic_map_n_in(src_map
);
896 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
897 unsigned src_out
= isl_basic_map_n_out(src_map
);
898 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
899 isl_int_set(dst
[0], src
[0]);
900 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
901 if (dst_nparam
> src_nparam
)
902 isl_seq_clr(dst
+1+src_nparam
,
903 dst_nparam
- src_nparam
);
904 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
905 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
907 isl_min(dst_in
-in_off
, src_in
));
908 if (dst_in
-in_off
> src_in
)
909 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
910 dst_in
- in_off
- src_in
);
911 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
912 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
913 src
+1+src_nparam
+src_in
,
914 isl_min(dst_out
-out_off
, src_out
));
915 if (dst_out
-out_off
> src_out
)
916 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
917 dst_out
- out_off
- src_out
);
918 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
919 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
920 src
+1+src_nparam
+src_in
+src_out
,
921 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
922 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
923 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
924 div_off
+src_map
->n_div
,
925 dst_map
->n_div
- div_off
- src_map
->n_div
);
928 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
929 struct isl_basic_map
*src_map
, isl_int
*src
,
930 unsigned in_off
, unsigned out_off
, unsigned div_off
)
932 isl_int_set(dst
[0], src
[0]);
933 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
936 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
937 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
942 if (!bmap1
|| !bmap2
)
945 div_off
= bmap1
->n_div
;
947 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
948 int i1
= isl_basic_map_alloc_equality(bmap1
);
951 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
952 i_pos
, o_pos
, div_off
);
955 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
956 int i1
= isl_basic_map_alloc_inequality(bmap1
);
959 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
960 i_pos
, o_pos
, div_off
);
963 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
964 int i1
= isl_basic_map_alloc_div(bmap1
);
967 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
968 i_pos
, o_pos
, div_off
);
971 isl_basic_map_free(bmap2
);
976 isl_basic_map_free(bmap1
);
977 isl_basic_map_free(bmap2
);
981 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
982 struct isl_dim_map
*dim_map
)
986 for (i
= 0; i
< dim_map
->len
; ++i
) {
987 if (dim_map
->pos
[i
] < 0)
988 isl_int_set_si(dst
[i
], 0);
990 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
994 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
995 struct isl_dim_map
*dim_map
)
997 isl_int_set(dst
[0], src
[0]);
998 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
1001 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
1002 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
1006 if (!src
|| !dst
|| !dim_map
)
1009 for (i
= 0; i
< src
->n_eq
; ++i
) {
1010 int i1
= isl_basic_map_alloc_equality(dst
);
1013 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1016 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1017 int i1
= isl_basic_map_alloc_inequality(dst
);
1020 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1023 for (i
= 0; i
< src
->n_div
; ++i
) {
1024 int i1
= isl_basic_map_alloc_div(dst
);
1027 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1031 isl_basic_map_free(src
);
1036 isl_basic_map_free(src
);
1037 isl_basic_map_free(dst
);
1041 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1042 struct isl_basic_set
*bset2
, unsigned pos
)
1044 return (struct isl_basic_set
*)
1045 add_constraints((struct isl_basic_map
*)bset1
,
1046 (struct isl_basic_map
*)bset2
, 0, pos
);
1049 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1050 struct isl_dim
*dim
, unsigned extra
,
1051 unsigned n_eq
, unsigned n_ineq
)
1053 struct isl_basic_map
*ext
;
1063 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1064 base
->extra
>= base
->n_div
+ extra
;
1066 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1067 room_for_ineq(base
, n_ineq
)) {
1072 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1073 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1074 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1075 extra
+= base
->extra
;
1077 n_ineq
+= base
->n_ineq
;
1079 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1085 ext
->sample
= isl_vec_copy(base
->sample
);
1086 flags
= base
->flags
;
1087 ext
= add_constraints(ext
, base
, 0, 0);
1090 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1097 isl_basic_map_free(base
);
1101 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1102 struct isl_dim
*dim
, unsigned extra
,
1103 unsigned n_eq
, unsigned n_ineq
)
1105 return (struct isl_basic_set
*)
1106 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1107 extra
, n_eq
, n_ineq
);
1110 struct isl_basic_map
*isl_basic_map_extend_constraints(
1111 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1115 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1119 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1120 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1121 unsigned n_eq
, unsigned n_ineq
)
1123 struct isl_basic_map
*bmap
;
1124 struct isl_dim
*dim
;
1128 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1132 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1135 isl_basic_map_free(base
);
1139 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1140 unsigned nparam
, unsigned dim
, unsigned extra
,
1141 unsigned n_eq
, unsigned n_ineq
)
1143 return (struct isl_basic_set
*)
1144 isl_basic_map_extend((struct isl_basic_map
*)base
,
1145 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1148 struct isl_basic_set
*isl_basic_set_extend_constraints(
1149 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1151 return (struct isl_basic_set
*)
1152 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1156 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1158 return (struct isl_basic_set
*)
1159 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1162 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1167 if (bmap
->ref
> 1) {
1169 bmap
= isl_basic_map_dup(bmap
);
1172 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1176 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1184 return isl_set_dup(set
);
1187 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1195 return isl_map_dup(map
);
1198 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1199 unsigned a_len
, unsigned b_len
)
1201 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1202 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1203 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1206 struct isl_basic_set
*isl_basic_set_swap_vars(
1207 struct isl_basic_set
*bset
, unsigned n
)
1217 nparam
= isl_basic_set_n_param(bset
);
1218 dim
= isl_basic_set_n_dim(bset
);
1219 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1224 bset
= isl_basic_set_cow(bset
);
1228 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1229 if (isl_blk_is_error(blk
))
1232 for (i
= 0; i
< bset
->n_eq
; ++i
)
1234 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1236 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1238 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1240 for (i
= 0; i
< bset
->n_div
; ++i
)
1242 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1244 isl_blk_free(bset
->ctx
, blk
);
1246 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1247 bset
= isl_basic_set_gauss(bset
, NULL
);
1248 return isl_basic_set_finalize(bset
);
1250 isl_basic_set_free(bset
);
1254 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1257 set
= isl_set_cow(set
);
1261 for (i
= 0; i
< set
->n
; ++i
) {
1262 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1268 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1272 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1278 total
= isl_basic_map_total_dim(bmap
);
1279 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1280 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1282 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1284 i
= isl_basic_map_alloc_equality(bmap
);
1288 isl_int_set_si(bmap
->eq
[i
][0], 1);
1289 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1290 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1291 isl_vec_free(bmap
->sample
);
1292 bmap
->sample
= NULL
;
1293 return isl_basic_map_finalize(bmap
);
1295 isl_basic_map_free(bmap
);
1299 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1301 return (struct isl_basic_set
*)
1302 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1305 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1308 unsigned off
= isl_dim_total(bmap
->dim
);
1309 isl_int
*t
= bmap
->div
[a
];
1310 bmap
->div
[a
] = bmap
->div
[b
];
1313 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1314 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1316 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1317 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1319 for (i
= 0; i
< bmap
->n_div
; ++i
)
1320 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1321 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1324 /* Eliminate the specified n dimensions starting at first from the
1325 * constraints using Fourier-Motzkin. The dimensions themselves
1328 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1329 enum isl_dim_type type
, unsigned first
, unsigned n
)
1338 map
= isl_map_cow(map
);
1341 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1342 first
+= pos(map
->dim
, type
) - 1;
1344 for (i
= 0; i
< map
->n
; ++i
) {
1345 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1355 /* Eliminate the specified n dimensions starting at first from the
1356 * constraints using Fourier-Motzkin. The dimensions themselves
1359 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1360 enum isl_dim_type type
, unsigned first
, unsigned n
)
1362 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1365 /* Eliminate the specified n dimensions starting at first from the
1366 * constraints using Fourier-Motzkin. The dimensions themselves
1369 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1370 unsigned first
, unsigned n
)
1372 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1375 /* Project out n dimensions starting at first using Fourier-Motzkin */
1376 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1377 unsigned first
, unsigned n
)
1379 set
= isl_set_eliminate_dims(set
, first
, n
);
1380 set
= isl_set_drop_dims(set
, first
, n
);
1384 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1385 __isl_take isl_basic_map
*bmap
)
1387 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1395 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1396 __isl_take isl_basic_set
*bset
)
1398 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1399 (struct isl_basic_map
*)bset
);
1402 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1411 set
= isl_set_cow(set
);
1415 for (i
= 0; i
< set
->n
; ++i
) {
1416 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1426 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1427 enum isl_dim_type type
, unsigned first
, unsigned n
)
1431 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1435 bmap
= isl_basic_map_eliminate_vars(bmap
,
1436 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1439 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1441 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1444 isl_basic_map_free(bmap
);
1448 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1449 enum isl_dim_type type
, unsigned first
, unsigned n
)
1451 return (isl_basic_set
*)
1452 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1455 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1456 enum isl_dim_type type
, unsigned first
, unsigned n
)
1463 map
= isl_map_cow(map
);
1466 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1468 for (i
= 0; i
< map
->n
; ++i
) {
1469 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1470 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1474 map
= isl_map_drop(map
, type
, first
, n
);
1481 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1482 enum isl_dim_type type
, unsigned first
, unsigned n
)
1484 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1487 /* Project out n inputs starting at first using Fourier-Motzkin */
1488 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1489 unsigned first
, unsigned n
)
1491 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1494 /* Project out n dimensions starting at first using Fourier-Motzkin */
1495 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1496 unsigned first
, unsigned n
)
1498 unsigned nparam
= isl_basic_set_n_param(bset
);
1499 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1500 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1504 static void dump_term(struct isl_basic_map
*bmap
,
1505 isl_int c
, int pos
, FILE *out
)
1508 unsigned in
= isl_basic_map_n_in(bmap
);
1509 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1510 unsigned nparam
= isl_basic_map_n_param(bmap
);
1512 isl_int_print(out
, c
, 0);
1514 if (!isl_int_is_one(c
))
1515 isl_int_print(out
, c
, 0);
1516 if (pos
< 1 + nparam
) {
1517 name
= isl_dim_get_name(bmap
->dim
,
1518 isl_dim_param
, pos
- 1);
1520 fprintf(out
, "%s", name
);
1522 fprintf(out
, "p%d", pos
- 1);
1523 } else if (pos
< 1 + nparam
+ in
)
1524 fprintf(out
, "i%d", pos
- 1 - nparam
);
1525 else if (pos
< 1 + nparam
+ dim
)
1526 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1528 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1532 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1533 int sign
, FILE *out
)
1537 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1541 for (i
= 0, first
= 1; i
< len
; ++i
) {
1542 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1545 fprintf(out
, " + ");
1547 isl_int_abs(v
, c
[i
]);
1548 dump_term(bmap
, v
, i
, out
);
1555 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1556 const char *op
, FILE *out
, int indent
)
1560 fprintf(out
, "%*s", indent
, "");
1562 dump_constraint_sign(bmap
, c
, 1, out
);
1563 fprintf(out
, " %s ", op
);
1564 dump_constraint_sign(bmap
, c
, -1, out
);
1568 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1569 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1571 fprintf(out
, "%*s", indent
, "");
1572 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1577 static void dump_constraints(struct isl_basic_map
*bmap
,
1578 isl_int
**c
, unsigned n
,
1579 const char *op
, FILE *out
, int indent
)
1583 for (i
= 0; i
< n
; ++i
)
1584 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1587 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1591 unsigned total
= isl_basic_map_total_dim(bmap
);
1593 for (j
= 0; j
< 1 + total
; ++j
) {
1594 if (isl_int_is_zero(exp
[j
]))
1596 if (!first
&& isl_int_is_pos(exp
[j
]))
1598 dump_term(bmap
, exp
[j
], j
, out
);
1603 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1607 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1608 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1610 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1611 fprintf(out
, "%*s", indent
, "");
1612 fprintf(out
, "e%d = [(", i
);
1613 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1615 isl_int_print(out
, bmap
->div
[i
][0], 0);
1616 fprintf(out
, "]\n");
1620 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1623 fprintf(out
, "null basic set\n");
1627 fprintf(out
, "%*s", indent
, "");
1628 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1629 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1630 bset
->extra
, bset
->flags
);
1631 dump((struct isl_basic_map
*)bset
, out
, indent
);
1634 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1637 fprintf(out
, "null basic map\n");
1641 fprintf(out
, "%*s", indent
, "");
1642 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1643 "flags: %x, n_name: %d\n",
1645 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1646 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1647 dump(bmap
, out
, indent
);
1650 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1655 total
= isl_basic_map_total_dim(bmap
);
1656 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1657 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1658 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1659 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1663 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1665 struct isl_set
*set
;
1669 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1670 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1671 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1672 sizeof(struct isl_set
) +
1673 (n
- 1) * sizeof(struct isl_basic_set
*));
1677 set
->ctx
= dim
->ctx
;
1678 isl_ctx_ref(set
->ctx
);
1690 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1691 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1693 struct isl_set
*set
;
1694 struct isl_dim
*dims
;
1696 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1700 set
= isl_set_alloc_dim(dims
, n
, flags
);
1704 /* Make sure "map" has room for at least "n" more basic maps.
1706 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1709 struct isl_map
*grown
= NULL
;
1713 isl_assert(map
->ctx
, n
>= 0, goto error
);
1714 if (map
->n
+ n
<= map
->size
)
1716 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1719 for (i
= 0; i
< map
->n
; ++i
) {
1720 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1728 isl_map_free(grown
);
1733 /* Make sure "set" has room for at least "n" more basic sets.
1735 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1737 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1740 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1743 struct isl_set
*dup
;
1748 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1751 for (i
= 0; i
< set
->n
; ++i
)
1752 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1756 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1758 struct isl_set
*set
;
1763 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1765 isl_basic_set_free(bset
);
1768 return isl_set_add_basic_set(set
, bset
);
1771 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1773 struct isl_map
*map
;
1778 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1780 isl_basic_map_free(bmap
);
1783 return isl_map_add_basic_map(map
, bmap
);
1786 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1787 __isl_take isl_basic_set
*bset
)
1789 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1790 (struct isl_basic_map
*)bset
);
1793 void isl_set_free(struct isl_set
*set
)
1803 isl_ctx_deref(set
->ctx
);
1804 for (i
= 0; i
< set
->n
; ++i
)
1805 isl_basic_set_free(set
->p
[i
]);
1806 isl_dim_free(set
->dim
);
1810 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1815 fprintf(out
, "null set\n");
1819 fprintf(out
, "%*s", indent
, "");
1820 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1821 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1823 for (i
= 0; i
< set
->n
; ++i
) {
1824 fprintf(out
, "%*s", indent
, "");
1825 fprintf(out
, "basic set %d:\n", i
);
1826 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1830 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1835 fprintf(out
, "null map\n");
1839 fprintf(out
, "%*s", indent
, "");
1840 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1841 "flags: %x, n_name: %d\n",
1842 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1843 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1844 for (i
= 0; i
< map
->n
; ++i
) {
1845 fprintf(out
, "%*s", indent
, "");
1846 fprintf(out
, "basic map %d:\n", i
);
1847 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1851 struct isl_basic_map
*isl_basic_map_intersect_domain(
1852 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1854 struct isl_basic_map
*bmap_domain
;
1855 struct isl_dim
*dim
;
1860 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1861 bset
->dim
, isl_dim_param
), goto error
);
1863 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1864 isl_assert(bset
->ctx
,
1865 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1867 bmap
= isl_basic_map_cow(bmap
);
1870 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1871 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1872 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1873 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1874 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1876 bmap
= isl_basic_map_simplify(bmap
);
1877 return isl_basic_map_finalize(bmap
);
1879 isl_basic_map_free(bmap
);
1880 isl_basic_set_free(bset
);
1884 struct isl_basic_map
*isl_basic_map_intersect_range(
1885 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1887 struct isl_basic_map
*bmap_range
;
1892 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1893 bset
->dim
, isl_dim_param
), goto error
);
1895 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1896 isl_assert(bset
->ctx
,
1897 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1899 bmap
= isl_basic_map_cow(bmap
);
1902 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1903 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1904 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1905 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1907 bmap
= isl_basic_map_simplify(bmap
);
1908 return isl_basic_map_finalize(bmap
);
1910 isl_basic_map_free(bmap
);
1911 isl_basic_set_free(bset
);
1915 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1921 total
= 1 + isl_basic_map_total_dim(bmap
);
1922 if (total
!= vec
->size
)
1927 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1928 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1929 if (!isl_int_is_zero(s
)) {
1935 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1936 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1937 if (isl_int_is_neg(s
)) {
1948 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1950 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1953 struct isl_basic_map
*isl_basic_map_intersect(
1954 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1956 struct isl_vec
*sample
= NULL
;
1958 if (!bmap1
|| !bmap2
)
1961 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1962 bmap2
->dim
, isl_dim_param
), goto error
);
1963 if (isl_dim_total(bmap1
->dim
) ==
1964 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1965 isl_dim_total(bmap2
->dim
) !=
1966 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1967 return isl_basic_map_intersect(bmap2
, bmap1
);
1969 if (isl_dim_total(bmap2
->dim
) !=
1970 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1971 isl_assert(bmap1
->ctx
,
1972 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1974 if (bmap1
->sample
&&
1975 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1976 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1977 sample
= isl_vec_copy(bmap1
->sample
);
1978 else if (bmap2
->sample
&&
1979 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1980 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1981 sample
= isl_vec_copy(bmap2
->sample
);
1983 bmap1
= isl_basic_map_cow(bmap1
);
1986 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1987 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1988 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1991 isl_vec_free(sample
);
1993 isl_vec_free(bmap1
->sample
);
1994 bmap1
->sample
= sample
;
1997 bmap1
= isl_basic_map_simplify(bmap1
);
1998 return isl_basic_map_finalize(bmap1
);
2001 isl_vec_free(sample
);
2002 isl_basic_map_free(bmap1
);
2003 isl_basic_map_free(bmap2
);
2007 struct isl_basic_set
*isl_basic_set_intersect(
2008 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2010 return (struct isl_basic_set
*)
2011 isl_basic_map_intersect(
2012 (struct isl_basic_map
*)bset1
,
2013 (struct isl_basic_map
*)bset2
);
2016 /* Special case of isl_map_intersect, where both map1 and map2
2017 * are convex, without any divs and such that either map1 or map2
2018 * contains a single constraint. This constraint is then simply
2019 * added to the other map.
2021 static __isl_give isl_map
*map_intersect_add_constraint(
2022 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2024 struct isl_basic_map
*bmap1
;
2025 struct isl_basic_map
*bmap2
;
2027 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2028 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2029 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2030 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2032 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2033 return isl_map_intersect(map2
, map1
);
2035 isl_assert(map2
->ctx
,
2036 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2038 map1
= isl_map_cow(map1
);
2041 if (isl_map_fast_is_empty(map1
)) {
2045 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2046 if (map2
->p
[0]->n_eq
== 1)
2047 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2049 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2050 map2
->p
[0]->ineq
[0]);
2052 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2053 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2057 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2058 isl_basic_map_free(map1
->p
[0]);
2071 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2074 struct isl_map
*result
;
2080 if (isl_map_fast_is_empty(map1
)) {
2084 if (isl_map_fast_is_empty(map2
)) {
2089 if (map1
->n
== 1 && map2
->n
== 1 &&
2090 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2091 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2092 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2093 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2094 return map_intersect_add_constraint(map1
, map2
);
2095 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2096 map2
->dim
, isl_dim_param
), goto error
);
2097 if (isl_dim_total(map1
->dim
) ==
2098 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2099 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2100 return isl_map_intersect(map2
, map1
);
2102 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2103 isl_assert(map1
->ctx
,
2104 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2106 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2107 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2108 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2110 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2111 map1
->n
* map2
->n
, flags
);
2114 for (i
= 0; i
< map1
->n
; ++i
)
2115 for (j
= 0; j
< map2
->n
; ++j
) {
2116 struct isl_basic_map
*part
;
2117 part
= isl_basic_map_intersect(
2118 isl_basic_map_copy(map1
->p
[i
]),
2119 isl_basic_map_copy(map2
->p
[j
]));
2120 if (isl_basic_map_is_empty(part
))
2121 isl_basic_map_free(part
);
2123 result
= isl_map_add_basic_map(result
, part
);
2136 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2138 return (struct isl_set
*)
2139 isl_map_intersect((struct isl_map
*)set1
,
2140 (struct isl_map
*)set2
);
2143 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2145 struct isl_dim
*dim
;
2146 struct isl_basic_set
*bset
;
2151 bmap
= isl_basic_map_cow(bmap
);
2154 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2155 in
= isl_basic_map_n_in(bmap
);
2156 bset
= isl_basic_set_from_basic_map(bmap
);
2157 bset
= isl_basic_set_swap_vars(bset
, in
);
2158 return isl_basic_map_from_basic_set(bset
, dim
);
2161 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2162 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2164 struct isl_dim
*res_dim
;
2165 struct isl_basic_map
*res
;
2166 struct isl_dim_map
*dim_map
;
2167 unsigned total
, off
;
2168 enum isl_dim_type t
;
2176 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2178 total
= isl_basic_map_total_dim(bmap
) + n
;
2179 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2181 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2183 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2185 unsigned size
= isl_basic_map_dim(bmap
, t
);
2186 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2188 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2189 pos
, size
- pos
, off
+ pos
+ n
);
2191 off
+= isl_dim_size(res_dim
, t
);
2193 isl_dim_map_div(dim_map
, bmap
, off
);
2195 res
= isl_basic_map_alloc_dim(res_dim
,
2196 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2197 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2198 res
= isl_basic_map_simplify(res
);
2199 return isl_basic_map_finalize(res
);
2202 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2203 enum isl_dim_type type
, unsigned n
)
2207 return isl_basic_map_insert(bmap
, type
,
2208 isl_basic_map_dim(bmap
, type
), n
);
2211 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2212 enum isl_dim_type type
, unsigned n
)
2216 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2217 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2219 isl_basic_set_free(bset
);
2223 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2224 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2231 map
= isl_map_cow(map
);
2235 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2239 for (i
= 0; i
< map
->n
; ++i
) {
2240 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2251 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2252 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2254 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2257 __isl_give isl_map
*isl_map_add(__isl_take isl_map
*map
,
2258 enum isl_dim_type type
, unsigned n
)
2262 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2265 __isl_give isl_set
*isl_set_add(__isl_take isl_set
*set
,
2266 enum isl_dim_type type
, unsigned n
)
2270 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2271 return (isl_set
*)isl_map_add((isl_map
*)set
, type
, n
);
2277 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2278 __isl_take isl_basic_map
*bmap
,
2279 enum isl_dim_type dst_type
, unsigned dst_pos
,
2280 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2283 struct isl_dim_map
*dim_map
;
2284 struct isl_basic_map
*res
;
2285 enum isl_dim_type t
;
2286 unsigned total
, off
;
2293 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2296 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2299 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2301 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2302 pos(bmap
->dim
, src_type
) + src_pos
+
2303 ((src_type
< dst_type
) ? n
: 0)) {
2304 bmap
= isl_basic_map_cow(bmap
);
2308 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2309 src_type
, src_pos
, n
);
2313 bmap
= isl_basic_map_finalize(bmap
);
2318 total
= isl_basic_map_total_dim(bmap
);
2319 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2322 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2323 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2324 if (t
== dst_type
) {
2325 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2328 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2331 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2332 dst_pos
, size
- dst_pos
, off
);
2333 off
+= size
- dst_pos
;
2334 } else if (t
== src_type
) {
2335 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2338 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2339 src_pos
+ n
, size
- src_pos
- n
, off
);
2340 off
+= size
- src_pos
- n
;
2342 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2346 isl_dim_map_div(dim_map
, bmap
, off
);
2348 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2349 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2350 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2352 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2353 src_type
, src_pos
, n
);
2357 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2358 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2359 bmap
= isl_basic_map_finalize(bmap
);
2363 isl_basic_map_free(bmap
);
2367 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2368 enum isl_dim_type dst_type
, unsigned dst_pos
,
2369 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2371 return (isl_basic_set
*)isl_basic_map_move_dims(
2372 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2375 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2376 enum isl_dim_type dst_type
, unsigned dst_pos
,
2377 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2381 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2382 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2383 src_type
, src_pos
, n
);
2389 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2390 enum isl_dim_type dst_type
, unsigned dst_pos
,
2391 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2400 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2403 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2406 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2408 map
= isl_map_cow(map
);
2412 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2416 for (i
= 0; i
< map
->n
; ++i
) {
2417 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2419 src_type
, src_pos
, n
);
2430 /* Move the specified dimensions to the last columns right before
2431 * the divs. Don't change the dimension specification of bmap.
2432 * That's the responsibility of the caller.
2434 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2435 enum isl_dim_type type
, unsigned first
, unsigned n
)
2437 struct isl_dim_map
*dim_map
;
2438 struct isl_basic_map
*res
;
2439 enum isl_dim_type t
;
2440 unsigned total
, off
;
2444 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2447 total
= isl_basic_map_total_dim(bmap
);
2448 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2451 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2452 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2454 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2457 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2458 first
, n
, total
- bmap
->n_div
- n
);
2459 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2460 first
+ n
, size
- (first
+ n
), off
);
2461 off
+= size
- (first
+ n
);
2463 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2467 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2469 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2470 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2471 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2475 /* Turn the n dimensions of type type, starting at first
2476 * into existentially quantified variables.
2478 __isl_give isl_basic_map
*isl_basic_map_project_out(
2479 __isl_take isl_basic_map
*bmap
,
2480 enum isl_dim_type type
, unsigned first
, unsigned n
)
2493 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2494 return isl_basic_map_remove(bmap
, type
, first
, n
);
2496 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2499 bmap
= move_last(bmap
, type
, first
, n
);
2500 bmap
= isl_basic_map_cow(bmap
);
2504 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2505 old
= bmap
->block2
.data
;
2506 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2507 (bmap
->extra
+ n
) * (1 + row_size
));
2508 if (!bmap
->block2
.data
)
2510 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2513 for (i
= 0; i
< n
; ++i
) {
2514 new_div
[i
] = bmap
->block2
.data
+
2515 (bmap
->extra
+ i
) * (1 + row_size
);
2516 isl_seq_clr(new_div
[i
], 1 + row_size
);
2518 for (i
= 0; i
< bmap
->extra
; ++i
)
2519 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2521 bmap
->div
= new_div
;
2525 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2528 bmap
= isl_basic_map_simplify(bmap
);
2529 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2530 return isl_basic_map_finalize(bmap
);
2532 isl_basic_map_free(bmap
);
2536 /* Turn the n dimensions of type type, starting at first
2537 * into existentially quantified variables.
2539 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2540 enum isl_dim_type type
, unsigned first
, unsigned n
)
2542 return (isl_basic_set
*)isl_basic_map_project_out(
2543 (isl_basic_map
*)bset
, type
, first
, n
);
2546 /* Turn the n dimensions of type type, starting at first
2547 * into existentially quantified variables.
2549 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2550 enum isl_dim_type type
, unsigned first
, unsigned n
)
2560 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2562 map
= isl_map_cow(map
);
2566 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2570 for (i
= 0; i
< map
->n
; ++i
) {
2571 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2582 /* Turn the n dimensions of type type, starting at first
2583 * into existentially quantified variables.
2585 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2586 enum isl_dim_type type
, unsigned first
, unsigned n
)
2588 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2591 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2595 for (i
= 0; i
< n
; ++i
) {
2596 j
= isl_basic_map_alloc_div(bmap
);
2599 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2603 isl_basic_map_free(bmap
);
2607 struct isl_basic_map
*isl_basic_map_apply_range(
2608 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2610 struct isl_dim
*dim_result
= NULL
;
2611 struct isl_basic_map
*bmap
;
2612 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2613 struct isl_dim_map
*dim_map1
, *dim_map2
;
2615 if (!bmap1
|| !bmap2
)
2618 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2619 isl_dim_copy(bmap2
->dim
));
2621 n_in
= isl_basic_map_n_in(bmap1
);
2622 n_out
= isl_basic_map_n_out(bmap2
);
2623 n
= isl_basic_map_n_out(bmap1
);
2624 nparam
= isl_basic_map_n_param(bmap1
);
2626 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2627 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2628 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2629 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2630 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2631 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2632 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2633 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2634 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2635 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2636 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2638 bmap
= isl_basic_map_alloc_dim(dim_result
,
2639 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2640 bmap1
->n_eq
+ bmap2
->n_eq
,
2641 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2642 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2643 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2644 bmap
= add_divs(bmap
, n
);
2645 bmap
= isl_basic_map_simplify(bmap
);
2646 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2647 return isl_basic_map_finalize(bmap
);
2649 isl_basic_map_free(bmap1
);
2650 isl_basic_map_free(bmap2
);
2654 struct isl_basic_set
*isl_basic_set_apply(
2655 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2660 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2663 return (struct isl_basic_set
*)
2664 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2666 isl_basic_set_free(bset
);
2667 isl_basic_map_free(bmap
);
2671 struct isl_basic_map
*isl_basic_map_apply_domain(
2672 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2674 if (!bmap1
|| !bmap2
)
2677 isl_assert(bmap1
->ctx
,
2678 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2679 isl_assert(bmap1
->ctx
,
2680 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2683 bmap1
= isl_basic_map_reverse(bmap1
);
2684 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2685 return isl_basic_map_reverse(bmap1
);
2687 isl_basic_map_free(bmap1
);
2688 isl_basic_map_free(bmap2
);
2692 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2693 * A \cap B -> f(A) + f(B)
2695 struct isl_basic_map
*isl_basic_map_sum(
2696 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2698 unsigned n_in
, n_out
, nparam
, total
, pos
;
2699 struct isl_basic_map
*bmap
= NULL
;
2700 struct isl_dim_map
*dim_map1
, *dim_map2
;
2703 if (!bmap1
|| !bmap2
)
2706 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2709 nparam
= isl_basic_map_n_param(bmap1
);
2710 n_in
= isl_basic_map_n_in(bmap1
);
2711 n_out
= isl_basic_map_n_out(bmap1
);
2713 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2714 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2715 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2716 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2717 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2718 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2719 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2720 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2721 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2722 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2723 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2725 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2726 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2727 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2728 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2729 for (i
= 0; i
< n_out
; ++i
) {
2730 int j
= isl_basic_map_alloc_equality(bmap
);
2733 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2734 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2735 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2736 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2738 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2739 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2740 bmap
= add_divs(bmap
, 2 * n_out
);
2742 bmap
= isl_basic_map_simplify(bmap
);
2743 return isl_basic_map_finalize(bmap
);
2745 isl_basic_map_free(bmap
);
2746 isl_basic_map_free(bmap1
);
2747 isl_basic_map_free(bmap2
);
2751 /* Given two maps A -> f(A) and B -> g(B), construct a map
2752 * A \cap B -> f(A) + f(B)
2754 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2756 struct isl_map
*result
;
2762 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2764 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2765 map1
->n
* map2
->n
, 0);
2768 for (i
= 0; i
< map1
->n
; ++i
)
2769 for (j
= 0; j
< map2
->n
; ++j
) {
2770 struct isl_basic_map
*part
;
2771 part
= isl_basic_map_sum(
2772 isl_basic_map_copy(map1
->p
[i
]),
2773 isl_basic_map_copy(map2
->p
[j
]));
2774 if (isl_basic_map_is_empty(part
))
2775 isl_basic_map_free(part
);
2777 result
= isl_map_add_basic_map(result
, part
);
2790 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2791 __isl_take isl_set
*set2
)
2793 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2796 /* Given a basic map A -> f(A), construct A -> -f(A).
2798 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2803 bmap
= isl_basic_map_cow(bmap
);
2807 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2808 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2809 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2810 for (j
= 0; j
< n
; ++j
)
2811 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2812 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2813 for (j
= 0; j
< n
; ++j
)
2814 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2815 for (i
= 0; i
< bmap
->n_div
; ++i
)
2816 for (j
= 0; j
< n
; ++j
)
2817 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2818 return isl_basic_map_finalize(bmap
);
2821 /* Given a map A -> f(A), construct A -> -f(A).
2823 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2827 map
= isl_map_cow(map
);
2831 for (i
= 0; i
< map
->n
; ++i
) {
2832 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2843 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2845 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2848 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2849 * A -> floor(f(A)/d).
2851 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2854 unsigned n_in
, n_out
, nparam
, total
, pos
;
2855 struct isl_basic_map
*result
= NULL
;
2856 struct isl_dim_map
*dim_map
;
2862 nparam
= isl_basic_map_n_param(bmap
);
2863 n_in
= isl_basic_map_n_in(bmap
);
2864 n_out
= isl_basic_map_n_out(bmap
);
2866 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2867 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2868 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2869 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2870 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2871 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2873 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2874 bmap
->n_div
+ n_out
,
2875 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2876 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2877 result
= add_divs(result
, n_out
);
2878 for (i
= 0; i
< n_out
; ++i
) {
2880 j
= isl_basic_map_alloc_inequality(result
);
2883 isl_seq_clr(result
->ineq
[j
], 1+total
);
2884 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2885 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2886 j
= isl_basic_map_alloc_inequality(result
);
2889 isl_seq_clr(result
->ineq
[j
], 1+total
);
2890 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2891 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2892 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2895 result
= isl_basic_map_simplify(result
);
2896 return isl_basic_map_finalize(result
);
2898 isl_basic_map_free(result
);
2902 /* Given a map A -> f(A) and an integer d, construct a map
2903 * A -> floor(f(A)/d).
2905 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2909 map
= isl_map_cow(map
);
2913 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2914 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2915 for (i
= 0; i
< map
->n
; ++i
) {
2916 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2927 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2933 i
= isl_basic_map_alloc_equality(bmap
);
2936 nparam
= isl_basic_map_n_param(bmap
);
2937 n_in
= isl_basic_map_n_in(bmap
);
2938 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2939 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2940 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2941 return isl_basic_map_finalize(bmap
);
2943 isl_basic_map_free(bmap
);
2947 /* Add a constraints to "bmap" expressing i_pos < o_pos
2949 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2955 i
= isl_basic_map_alloc_inequality(bmap
);
2958 nparam
= isl_basic_map_n_param(bmap
);
2959 n_in
= isl_basic_map_n_in(bmap
);
2960 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2961 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2962 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2963 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2964 return isl_basic_map_finalize(bmap
);
2966 isl_basic_map_free(bmap
);
2970 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2972 static __isl_give isl_basic_map
*var_less_or_equal(
2973 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2979 i
= isl_basic_map_alloc_inequality(bmap
);
2982 nparam
= isl_basic_map_n_param(bmap
);
2983 n_in
= isl_basic_map_n_in(bmap
);
2984 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2985 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2986 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2987 return isl_basic_map_finalize(bmap
);
2989 isl_basic_map_free(bmap
);
2993 /* Add a constraints to "bmap" expressing i_pos > o_pos
2995 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3001 i
= isl_basic_map_alloc_inequality(bmap
);
3004 nparam
= isl_basic_map_n_param(bmap
);
3005 n_in
= isl_basic_map_n_in(bmap
);
3006 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3007 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3008 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3009 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3010 return isl_basic_map_finalize(bmap
);
3012 isl_basic_map_free(bmap
);
3016 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3018 static __isl_give isl_basic_map
*var_more_or_equal(
3019 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3025 i
= isl_basic_map_alloc_inequality(bmap
);
3028 nparam
= isl_basic_map_n_param(bmap
);
3029 n_in
= isl_basic_map_n_in(bmap
);
3030 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3031 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3032 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3033 return isl_basic_map_finalize(bmap
);
3035 isl_basic_map_free(bmap
);
3039 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3042 struct isl_basic_map
*bmap
;
3043 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3046 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3047 bmap
= var_equal(bmap
, i
);
3048 return isl_basic_map_finalize(bmap
);
3051 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3053 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3056 struct isl_basic_map
*bmap
;
3057 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3060 for (i
= 0; i
< pos
&& bmap
; ++i
)
3061 bmap
= var_equal(bmap
, i
);
3063 bmap
= var_less(bmap
, pos
);
3064 return isl_basic_map_finalize(bmap
);
3067 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3069 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3070 __isl_take isl_dim
*dim
, unsigned pos
)
3073 isl_basic_map
*bmap
;
3075 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3076 for (i
= 0; i
< pos
; ++i
)
3077 bmap
= var_equal(bmap
, i
);
3078 bmap
= var_less_or_equal(bmap
, pos
);
3079 return isl_basic_map_finalize(bmap
);
3082 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3084 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3087 struct isl_basic_map
*bmap
;
3088 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3091 for (i
= 0; i
< pos
&& bmap
; ++i
)
3092 bmap
= var_equal(bmap
, i
);
3094 bmap
= var_more(bmap
, pos
);
3095 return isl_basic_map_finalize(bmap
);
3098 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3100 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3101 __isl_take isl_dim
*dim
, unsigned pos
)
3104 isl_basic_map
*bmap
;
3106 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3107 for (i
= 0; i
< pos
; ++i
)
3108 bmap
= var_equal(bmap
, i
);
3109 bmap
= var_more_or_equal(bmap
, pos
);
3110 return isl_basic_map_finalize(bmap
);
3113 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3114 unsigned n
, int equal
)
3116 struct isl_map
*map
;
3119 if (n
== 0 && equal
)
3120 return isl_map_universe(dims
);
3122 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3124 for (i
= 0; i
+ 1 < n
; ++i
)
3125 map
= isl_map_add_basic_map(map
,
3126 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3129 map
= isl_map_add_basic_map(map
,
3130 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3132 map
= isl_map_add_basic_map(map
,
3133 isl_basic_map_less_at(dims
, n
- 1));
3140 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3144 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3147 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3149 return map_lex_lte_first(dim
, n
, 0);
3152 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3154 return map_lex_lte_first(dim
, n
, 1);
3157 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3159 return map_lex_lte(isl_dim_map(set_dim
), 0);
3162 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3164 return map_lex_lte(isl_dim_map(set_dim
), 1);
3167 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3168 unsigned n
, int equal
)
3170 struct isl_map
*map
;
3173 if (n
== 0 && equal
)
3174 return isl_map_universe(dims
);
3176 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3178 for (i
= 0; i
+ 1 < n
; ++i
)
3179 map
= isl_map_add_basic_map(map
,
3180 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3183 map
= isl_map_add_basic_map(map
,
3184 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3186 map
= isl_map_add_basic_map(map
,
3187 isl_basic_map_more_at(dims
, n
- 1));
3194 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3198 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3201 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3203 return map_lex_gte_first(dim
, n
, 0);
3206 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3208 return map_lex_gte_first(dim
, n
, 1);
3211 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3213 return map_lex_gte(isl_dim_map(set_dim
), 0);
3216 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3218 return map_lex_gte(isl_dim_map(set_dim
), 1);
3221 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3222 __isl_take isl_set
*set2
)
3225 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3226 map
= isl_map_intersect_domain(map
, set1
);
3227 map
= isl_map_intersect_range(map
, set2
);
3231 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3232 __isl_take isl_set
*set2
)
3235 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3236 map
= isl_map_intersect_domain(map
, set1
);
3237 map
= isl_map_intersect_range(map
, set2
);
3241 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3242 __isl_take isl_set
*set2
)
3245 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3246 map
= isl_map_intersect_domain(map
, set1
);
3247 map
= isl_map_intersect_range(map
, set2
);
3251 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3252 __isl_take isl_set
*set2
)
3255 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3256 map
= isl_map_intersect_domain(map
, set1
);
3257 map
= isl_map_intersect_range(map
, set2
);
3261 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3262 __isl_take isl_map
*map2
)
3265 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3266 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3267 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3271 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3272 __isl_take isl_map
*map2
)
3275 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3276 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3277 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3281 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3282 __isl_take isl_map
*map2
)
3285 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3286 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3287 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3291 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3292 __isl_take isl_map
*map2
)
3295 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3296 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3297 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3301 struct isl_basic_map
*isl_basic_map_from_basic_set(
3302 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3304 struct isl_basic_map
*bmap
;
3306 bset
= isl_basic_set_cow(bset
);
3310 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3311 isl_dim_free(bset
->dim
);
3312 bmap
= (struct isl_basic_map
*) bset
;
3314 return isl_basic_map_finalize(bmap
);
3316 isl_basic_set_free(bset
);
3321 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3325 if (bmap
->dim
->n_in
== 0)
3326 return (struct isl_basic_set
*)bmap
;
3327 bmap
= isl_basic_map_cow(bmap
);
3330 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3333 bmap
= isl_basic_map_finalize(bmap
);
3334 return (struct isl_basic_set
*)bmap
;
3336 isl_basic_map_free(bmap
);
3340 /* For a div d = floor(f/m), add the constraints
3343 * -(f-(n-1)) + m d >= 0
3345 * Note that the second constraint is the negation of
3349 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3350 unsigned pos
, isl_int
*div
)
3353 unsigned total
= isl_basic_map_total_dim(bmap
);
3355 i
= isl_basic_map_alloc_inequality(bmap
);
3358 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3359 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3361 j
= isl_basic_map_alloc_inequality(bmap
);
3364 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3365 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3366 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3370 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3371 unsigned pos
, isl_int
*div
)
3373 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3377 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3379 unsigned total
= isl_basic_map_total_dim(bmap
);
3380 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3382 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3386 struct isl_basic_set
*isl_basic_map_underlying_set(
3387 struct isl_basic_map
*bmap
)
3391 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3392 bmap
->n_div
== 0 && !isl_dim_get_tuple_name(bmap
->dim
, isl_dim_out
))
3393 return (struct isl_basic_set
*)bmap
;
3394 bmap
= isl_basic_map_cow(bmap
);
3397 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3400 bmap
->extra
-= bmap
->n_div
;
3402 bmap
= isl_basic_map_finalize(bmap
);
3403 return (struct isl_basic_set
*)bmap
;
3408 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3409 __isl_take isl_basic_set
*bset
)
3411 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3414 struct isl_basic_map
*isl_basic_map_overlying_set(
3415 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3417 struct isl_basic_map
*bmap
;
3418 struct isl_ctx
*ctx
;
3425 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3426 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3427 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3429 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3430 isl_basic_map_free(like
);
3431 return (struct isl_basic_map
*)bset
;
3433 bset
= isl_basic_set_cow(bset
);
3436 total
= bset
->dim
->n_out
+ bset
->extra
;
3437 bmap
= (struct isl_basic_map
*)bset
;
3438 isl_dim_free(bmap
->dim
);
3439 bmap
->dim
= isl_dim_copy(like
->dim
);
3442 bmap
->n_div
= like
->n_div
;
3443 bmap
->extra
+= like
->n_div
;
3446 ltotal
= total
- bmap
->extra
+ like
->extra
;
3449 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3450 bmap
->extra
* (1 + 1 + total
));
3451 if (isl_blk_is_error(bmap
->block2
))
3453 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3457 for (i
= 0; i
< bmap
->extra
; ++i
)
3458 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3459 for (i
= 0; i
< like
->n_div
; ++i
) {
3460 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3461 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3463 bmap
= isl_basic_map_extend_constraints(bmap
,
3464 0, 2 * like
->n_div
);
3465 for (i
= 0; i
< like
->n_div
; ++i
) {
3466 if (isl_int_is_zero(bmap
->div
[i
][0]))
3468 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3472 isl_basic_map_free(like
);
3473 bmap
= isl_basic_map_simplify(bmap
);
3474 bmap
= isl_basic_map_finalize(bmap
);
3477 isl_basic_map_free(like
);
3478 isl_basic_set_free(bset
);
3482 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3483 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3485 return (struct isl_basic_set
*)
3486 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3489 struct isl_set
*isl_set_from_underlying_set(
3490 struct isl_set
*set
, struct isl_basic_set
*like
)
3496 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3498 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3499 isl_basic_set_free(like
);
3502 set
= isl_set_cow(set
);
3505 for (i
= 0; i
< set
->n
; ++i
) {
3506 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3507 isl_basic_set_copy(like
));
3511 isl_dim_free(set
->dim
);
3512 set
->dim
= isl_dim_copy(like
->dim
);
3515 isl_basic_set_free(like
);
3518 isl_basic_set_free(like
);
3523 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3527 map
= isl_map_cow(map
);
3530 map
->dim
= isl_dim_cow(map
->dim
);
3534 for (i
= 1; i
< map
->n
; ++i
)
3535 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3537 for (i
= 0; i
< map
->n
; ++i
) {
3538 map
->p
[i
] = (struct isl_basic_map
*)
3539 isl_basic_map_underlying_set(map
->p
[i
]);
3544 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3546 isl_dim_free(map
->dim
);
3547 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3551 return (struct isl_set
*)map
;
3557 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3559 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3562 static __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3563 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3565 bmap
= isl_basic_map_cow(bmap
);
3569 isl_dim_free(bmap
->dim
);
3572 bmap
= isl_basic_map_finalize(bmap
);
3576 isl_basic_map_free(bmap
);
3581 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3582 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3584 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3588 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3589 __isl_take isl_dim
*dim
)
3593 map
= isl_map_cow(map
);
3597 for (i
= 0; i
< map
->n
; ++i
) {
3598 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3603 isl_dim_free(map
->dim
);
3613 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3614 __isl_take isl_dim
*dim
)
3616 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3619 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3622 struct isl_basic_set
*domain
;
3628 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3630 n_in
= isl_basic_map_n_in(bmap
);
3631 n_out
= isl_basic_map_n_out(bmap
);
3632 domain
= isl_basic_set_from_basic_map(bmap
);
3633 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3635 domain
= isl_basic_set_reset_dim(domain
, dim
);
3640 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3642 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3645 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3646 __isl_take isl_basic_map
*bmap
)
3650 isl_basic_map
*domain
;
3651 isl_basic_set
*bset
;
3652 int nparam
, n_in
, n_out
;
3655 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3656 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3657 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3659 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3660 domain
= isl_basic_map_universe(dim
);
3662 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3663 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3664 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3666 total
= isl_basic_map_total_dim(bmap
);
3668 for (i
= 0; i
< n_in
; ++i
) {
3669 k
= isl_basic_map_alloc_equality(bmap
);
3672 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3673 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3674 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3677 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3678 return isl_basic_map_finalize(bmap
);
3680 isl_basic_map_free(bmap
);
3684 __isl_give isl_basic_map
*isl_basic_map_range_map(
3685 __isl_take isl_basic_map
*bmap
)
3689 isl_basic_map
*range
;
3690 isl_basic_set
*bset
;
3691 int nparam
, n_in
, n_out
;
3694 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3695 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3696 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3698 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3699 range
= isl_basic_map_universe(dim
);
3701 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3702 bmap
= isl_basic_map_apply_range(bmap
, range
);
3703 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3705 total
= isl_basic_map_total_dim(bmap
);
3707 for (i
= 0; i
< n_out
; ++i
) {
3708 k
= isl_basic_map_alloc_equality(bmap
);
3711 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3712 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3713 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3716 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3717 return isl_basic_map_finalize(bmap
);
3719 isl_basic_map_free(bmap
);
3723 struct isl_set
*isl_map_range(struct isl_map
*map
)
3726 struct isl_set
*set
;
3730 if (isl_map_dim(map
, isl_dim_in
) == 0)
3731 return (isl_set
*)map
;
3733 map
= isl_map_cow(map
);
3737 set
= (struct isl_set
*) map
;
3738 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3741 for (i
= 0; i
< map
->n
; ++i
) {
3742 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3746 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3747 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3754 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3757 isl_dim
*domain_dim
;
3759 map
= isl_map_cow(map
);
3763 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3764 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3765 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3768 for (i
= 0; i
< map
->n
; ++i
) {
3769 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3773 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3774 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3781 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3786 map
= isl_map_cow(map
);
3790 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3791 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3792 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3795 for (i
= 0; i
< map
->n
; ++i
) {
3796 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3800 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3801 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3808 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3811 struct isl_map
*map
= NULL
;
3813 set
= isl_set_cow(set
);
3816 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3817 map
= (struct isl_map
*)set
;
3818 for (i
= 0; i
< set
->n
; ++i
) {
3819 map
->p
[i
] = isl_basic_map_from_basic_set(
3820 set
->p
[i
], isl_dim_copy(dim
));
3824 isl_dim_free(map
->dim
);
3833 __isl_give isl_basic_map
*isl_basic_map_from_domain(
3834 __isl_take isl_basic_set
*bset
)
3836 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
3839 __isl_give isl_basic_map
*isl_basic_map_from_range(
3840 __isl_take isl_basic_set
*bset
)
3842 return (isl_basic_map
*)bset
;
3845 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3847 return (struct isl_map
*)set
;
3850 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3852 return isl_map_reverse(isl_map_from_range(set
));
3855 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3856 __isl_take isl_set
*range
)
3858 return isl_map_apply_range(isl_map_from_domain(domain
),
3859 isl_map_from_range(range
));
3862 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3865 struct isl_set
*set
= NULL
;
3869 map
= isl_map_cow(map
);
3872 map
->dim
= isl_dim_as_set_dim(map
->dim
);
3875 set
= (struct isl_set
*)map
;
3876 for (i
= 0; i
< map
->n
; ++i
) {
3877 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3887 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3889 struct isl_map
*map
;
3893 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3894 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3895 sizeof(struct isl_map
) +
3896 (n
- 1) * sizeof(struct isl_basic_map
*));
3900 map
->ctx
= dim
->ctx
;
3901 isl_ctx_ref(map
->ctx
);
3913 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
3914 unsigned nparam
, unsigned in
, unsigned out
, int n
,
3917 struct isl_map
*map
;
3918 struct isl_dim
*dims
;
3920 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
3924 map
= isl_map_alloc_dim(dims
, n
, flags
);
3928 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
3930 struct isl_basic_map
*bmap
;
3931 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
3932 bmap
= isl_basic_map_set_to_empty(bmap
);
3936 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
3938 struct isl_basic_set
*bset
;
3939 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
3940 bset
= isl_basic_set_set_to_empty(bset
);
3944 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
3946 struct isl_basic_map
*bmap
;
3949 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3950 bmap
= isl_basic_map_set_to_empty(bmap
);
3954 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
3956 struct isl_basic_map
*bmap
;
3959 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3960 bmap
= isl_basic_map_set_to_empty(bmap
);
3964 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
3966 struct isl_basic_set
*bset
;
3969 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3970 bset
= isl_basic_set_set_to_empty(bset
);
3974 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
3976 struct isl_basic_map
*bmap
;
3977 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
3981 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
3983 struct isl_basic_set
*bset
;
3984 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
3988 __isl_give isl_basic_map
*isl_basic_map_universe_like(
3989 __isl_keep isl_basic_map
*model
)
3993 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3996 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4000 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4003 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4004 __isl_keep isl_set
*model
)
4008 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4011 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4013 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4016 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4020 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4023 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4027 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4030 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4032 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4035 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4039 return isl_set_empty(isl_dim_copy(model
->dim
));
4042 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4044 struct isl_map
*map
;
4047 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4048 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4052 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4054 struct isl_set
*set
;
4057 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4058 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4062 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4066 return isl_set_universe(isl_dim_copy(model
->dim
));
4069 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4072 struct isl_map
*dup
;
4076 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4077 for (i
= 0; i
< map
->n
; ++i
)
4078 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4082 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4083 __isl_take isl_basic_map
*bmap
)
4087 if (isl_basic_map_fast_is_empty(bmap
)) {
4088 isl_basic_map_free(bmap
);
4091 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4092 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4093 map
->p
[map
->n
] = bmap
;
4095 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4101 isl_basic_map_free(bmap
);
4105 void isl_map_free(struct isl_map
*map
)
4115 isl_ctx_deref(map
->ctx
);
4116 for (i
= 0; i
< map
->n
; ++i
)
4117 isl_basic_map_free(map
->p
[i
]);
4118 isl_dim_free(map
->dim
);
4122 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4123 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4127 base
= isl_map_cow(base
);
4131 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4134 for (i
= 0; i
< base
->n
; ++i
) {
4135 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4136 isl_dim_copy(base
->dim
), 0, 0, 0);
4146 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4147 unsigned nparam
, unsigned dim
)
4149 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4153 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4154 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4158 bmap
= isl_basic_map_cow(bmap
);
4159 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4160 j
= isl_basic_map_alloc_equality(bmap
);
4163 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4164 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4165 isl_int_set_si(bmap
->eq
[j
][0], value
);
4166 bmap
= isl_basic_map_simplify(bmap
);
4167 return isl_basic_map_finalize(bmap
);
4169 isl_basic_map_free(bmap
);
4173 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4174 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4178 bmap
= isl_basic_map_cow(bmap
);
4179 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4180 j
= isl_basic_map_alloc_equality(bmap
);
4183 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4184 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4185 isl_int_set(bmap
->eq
[j
][0], value
);
4186 bmap
= isl_basic_map_simplify(bmap
);
4187 return isl_basic_map_finalize(bmap
);
4189 isl_basic_map_free(bmap
);
4193 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4194 enum isl_dim_type type
, unsigned pos
, int value
)
4198 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4199 return isl_basic_map_fix_pos_si(bmap
,
4200 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4202 isl_basic_map_free(bmap
);
4206 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4207 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4211 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4212 return isl_basic_map_fix_pos(bmap
,
4213 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4215 isl_basic_map_free(bmap
);
4219 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4220 enum isl_dim_type type
, unsigned pos
, int value
)
4222 return (struct isl_basic_set
*)
4223 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4227 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4228 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4230 return (struct isl_basic_set
*)
4231 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4235 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4236 unsigned input
, int value
)
4238 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4241 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4242 unsigned dim
, int value
)
4244 return (struct isl_basic_set
*)
4245 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4246 isl_dim_set
, dim
, value
);
4249 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4250 enum isl_dim_type type
, unsigned pos
, int value
)
4254 map
= isl_map_cow(map
);
4258 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4259 for (i
= 0; i
< map
->n
; ++i
) {
4260 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4264 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4271 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4272 enum isl_dim_type type
, unsigned pos
, int value
)
4274 return (struct isl_set
*)
4275 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4278 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4279 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4283 map
= isl_map_cow(map
);
4287 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4288 for (i
= 0; i
< map
->n
; ++i
) {
4289 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4293 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4300 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4301 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4303 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4306 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4307 unsigned input
, int value
)
4309 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4312 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4314 return (struct isl_set
*)
4315 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4318 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4319 __isl_take isl_basic_map
*bmap
,
4320 enum isl_dim_type type
, unsigned pos
, int value
)
4326 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4327 pos
+= isl_basic_map_offset(bmap
, type
);
4328 bmap
= isl_basic_map_cow(bmap
);
4329 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4330 j
= isl_basic_map_alloc_inequality(bmap
);
4333 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4334 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4335 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4336 bmap
= isl_basic_map_simplify(bmap
);
4337 return isl_basic_map_finalize(bmap
);
4339 isl_basic_map_free(bmap
);
4343 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4344 unsigned dim
, isl_int value
)
4348 bset
= isl_basic_set_cow(bset
);
4349 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4350 j
= isl_basic_set_alloc_inequality(bset
);
4353 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4354 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4355 isl_int_neg(bset
->ineq
[j
][0], value
);
4356 bset
= isl_basic_set_simplify(bset
);
4357 return isl_basic_set_finalize(bset
);
4359 isl_basic_set_free(bset
);
4363 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4364 enum isl_dim_type type
, unsigned pos
, int value
)
4368 map
= isl_map_cow(map
);
4372 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4373 for (i
= 0; i
< map
->n
; ++i
) {
4374 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4379 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4386 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4387 enum isl_dim_type type
, unsigned pos
, int value
)
4389 return (struct isl_set
*)
4390 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4393 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4398 set
= isl_set_cow(set
);
4402 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4403 for (i
= 0; i
< set
->n
; ++i
) {
4404 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4414 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4418 map
= isl_map_cow(map
);
4422 map
->dim
= isl_dim_reverse(map
->dim
);
4425 for (i
= 0; i
< map
->n
; ++i
) {
4426 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4430 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4437 static struct isl_map
*isl_basic_map_partial_lexopt(
4438 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4439 struct isl_set
**empty
, int max
)
4443 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4444 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4446 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4448 isl_basic_map_free(bmap
);
4449 isl_basic_set_free(dom
);
4455 struct isl_map
*isl_basic_map_partial_lexmax(
4456 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4457 struct isl_set
**empty
)
4459 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4462 struct isl_map
*isl_basic_map_partial_lexmin(
4463 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4464 struct isl_set
**empty
)
4466 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4469 struct isl_set
*isl_basic_set_partial_lexmin(
4470 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4471 struct isl_set
**empty
)
4473 return (struct isl_set
*)
4474 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4478 struct isl_set
*isl_basic_set_partial_lexmax(
4479 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4480 struct isl_set
**empty
)
4482 return (struct isl_set
*)
4483 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4487 /* Given a basic map "bmap", compute the lexicograhically minimal
4488 * (or maximal) image element for each domain element in dom.
4489 * Set *empty to those elements in dom that do not have an image element.
4491 * We first make sure the basic sets in dom are disjoint and then
4492 * simply collect the results over each of the basic sets separately.
4493 * We could probably improve the efficiency a bit by moving the union
4494 * domain down into the parametric integer programming.
4496 static __isl_give isl_map
*basic_map_partial_lexopt(
4497 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4498 __isl_give isl_set
**empty
, int max
)
4501 struct isl_map
*res
;
4503 dom
= isl_set_make_disjoint(dom
);
4507 if (isl_set_fast_is_empty(dom
)) {
4508 res
= isl_map_empty_like_basic_map(bmap
);
4509 *empty
= isl_set_empty_like(dom
);
4511 isl_basic_map_free(bmap
);
4515 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4516 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4518 for (i
= 1; i
< dom
->n
; ++i
) {
4519 struct isl_map
*res_i
;
4520 struct isl_set
*empty_i
;
4522 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4523 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4525 res
= isl_map_union_disjoint(res
, res_i
);
4526 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4530 isl_basic_map_free(bmap
);
4535 isl_basic_map_free(bmap
);
4539 /* Given a map "map", compute the lexicograhically minimal
4540 * (or maximal) image element for each domain element in dom.
4541 * Set *empty to those elements in dom that do not have an image element.
4543 * We first compute the lexicographically minimal or maximal element
4544 * in the first basic map. This results in a partial solution "res"
4545 * and a subset "todo" of dom that still need to be handled.
4546 * We then consider each of the remaining maps in "map" and successively
4547 * improve both "res" and "todo".
4549 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4550 * Assume we are computing the lexicographical maximum.
4551 * We first intersect basic map i with a relation that maps elements
4552 * to elements that are lexicographically larger than the image elements
4553 * in res^k and the compute the maximum image element of this intersection.
4554 * The result ("better") corresponds to those image elements in basic map i
4555 * that are better than what we had before. The remainder ("keep") are the
4556 * domain elements for which the image element in res_k was better.
4557 * We also compute the lexicographical maximum of basic map i in todo^k.
4558 * res^i is the result of the operation + better + those elements in
4559 * res^k that we should keep
4560 * todo^i is the remainder of the maximum operation on todo^k.
4562 static __isl_give isl_map
*isl_map_partial_lexopt(
4563 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4564 __isl_give isl_set
**empty
, int max
)
4567 struct isl_map
*res
;
4568 struct isl_set
*todo
;
4573 if (isl_map_fast_is_empty(map
)) {
4581 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4582 isl_set_copy(dom
), &todo
, max
);
4584 for (i
= 1; i
< map
->n
; ++i
) {
4586 struct isl_map
*better
;
4587 struct isl_set
*keep
;
4588 struct isl_map
*res_i
;
4589 struct isl_set
*todo_i
;
4590 struct isl_dim
*dim
= isl_map_get_dim(res
);
4592 dim
= isl_dim_range(dim
);
4594 lt
= isl_map_lex_lt(dim
);
4596 lt
= isl_map_lex_gt(dim
);
4597 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4598 lt
= isl_map_intersect(lt
,
4599 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4600 better
= isl_map_partial_lexopt(lt
,
4601 isl_map_domain(isl_map_copy(res
)),
4604 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4605 todo
, &todo_i
, max
);
4607 res
= isl_map_intersect_domain(res
, keep
);
4608 res
= isl_map_union_disjoint(res
, res_i
);
4609 res
= isl_map_union_disjoint(res
, better
);
4630 __isl_give isl_map
*isl_map_partial_lexmax(
4631 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4632 __isl_give isl_set
**empty
)
4634 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4637 __isl_give isl_map
*isl_map_partial_lexmin(
4638 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4639 __isl_give isl_set
**empty
)
4641 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4644 __isl_give isl_set
*isl_set_partial_lexmin(
4645 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4646 __isl_give isl_set
**empty
)
4648 return (struct isl_set
*)
4649 isl_map_partial_lexmin((struct isl_map
*)set
,
4653 __isl_give isl_set
*isl_set_partial_lexmax(
4654 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4655 __isl_give isl_set
**empty
)
4657 return (struct isl_set
*)
4658 isl_map_partial_lexmax((struct isl_map
*)set
,
4662 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4664 struct isl_basic_set
*dom
= NULL
;
4665 struct isl_dim
*dom_dim
;
4669 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4670 dom
= isl_basic_set_universe(dom_dim
);
4671 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4673 isl_basic_map_free(bmap
);
4677 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4679 return isl_basic_map_lexopt(bmap
, 0);
4682 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4684 return isl_basic_map_lexopt(bmap
, 1);
4687 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4689 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4692 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4694 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4697 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4699 struct isl_set
*dom
= NULL
;
4700 struct isl_dim
*dom_dim
;
4704 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4705 dom
= isl_set_universe(dom_dim
);
4706 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4712 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4714 return isl_map_lexopt(map
, 0);
4717 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4719 return isl_map_lexopt(map
, 1);
4722 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4724 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4727 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4729 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4732 /* Apply a preimage specified by "mat" on the parameters of "bset".
4733 * bset is assumed to have only parameters and divs.
4735 static struct isl_basic_set
*basic_set_parameter_preimage(
4736 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4743 bset
->dim
= isl_dim_cow(bset
->dim
);
4747 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4749 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4751 bset
->dim
->nparam
= 0;
4752 bset
->dim
->n_out
= nparam
;
4753 bset
= isl_basic_set_preimage(bset
, mat
);
4755 bset
->dim
->nparam
= bset
->dim
->n_out
;
4756 bset
->dim
->n_out
= 0;
4761 isl_basic_set_free(bset
);
4765 /* Apply a preimage specified by "mat" on the parameters of "set".
4766 * set is assumed to have only parameters and divs.
4768 static struct isl_set
*set_parameter_preimage(
4769 struct isl_set
*set
, struct isl_mat
*mat
)
4771 struct isl_dim
*dim
= NULL
;
4777 dim
= isl_dim_copy(set
->dim
);
4778 dim
= isl_dim_cow(dim
);
4782 nparam
= isl_set_dim(set
, isl_dim_param
);
4784 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4787 dim
->n_out
= nparam
;
4788 isl_set_reset_dim(set
, dim
);
4789 set
= isl_set_preimage(set
, mat
);
4792 dim
= isl_dim_copy(set
->dim
);
4793 dim
= isl_dim_cow(dim
);
4796 dim
->nparam
= dim
->n_out
;
4798 isl_set_reset_dim(set
, dim
);
4808 /* Intersect the basic set "bset" with the affine space specified by the
4809 * equalities in "eq".
4811 static struct isl_basic_set
*basic_set_append_equalities(
4812 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4820 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4825 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4826 for (i
= 0; i
< eq
->n_row
; ++i
) {
4827 k
= isl_basic_set_alloc_equality(bset
);
4830 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4831 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4835 bset
= isl_basic_set_gauss(bset
, NULL
);
4836 bset
= isl_basic_set_finalize(bset
);
4841 isl_basic_set_free(bset
);
4845 /* Intersect the set "set" with the affine space specified by the
4846 * equalities in "eq".
4848 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4856 for (i
= 0; i
< set
->n
; ++i
) {
4857 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4870 /* Project the given basic set onto its parameter domain, possibly introducing
4871 * new, explicit, existential variables in the constraints.
4872 * The input has parameters and (possibly implicit) existential variables.
4873 * The output has the same parameters, but only
4874 * explicit existentially quantified variables.
4876 * The actual projection is performed by pip, but pip doesn't seem
4877 * to like equalities very much, so we first remove the equalities
4878 * among the parameters by performing a variable compression on
4879 * the parameters. Afterward, an inverse transformation is performed
4880 * and the equalities among the parameters are inserted back in.
4882 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4886 struct isl_mat
*T
, *T2
;
4887 struct isl_set
*set
;
4888 unsigned nparam
, n_div
;
4890 bset
= isl_basic_set_cow(bset
);
4894 if (bset
->n_eq
== 0)
4895 return isl_basic_set_lexmin(bset
);
4897 isl_basic_set_gauss(bset
, NULL
);
4899 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4900 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
4902 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
4903 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
4906 if (i
== bset
->n_eq
)
4907 return isl_basic_set_lexmin(bset
);
4909 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
4911 eq
= isl_mat_cow(eq
);
4912 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
4913 if (T
&& T
->n_col
== 0) {
4917 bset
= isl_basic_set_set_to_empty(bset
);
4918 return isl_set_from_basic_set(bset
);
4920 bset
= basic_set_parameter_preimage(bset
, T
);
4922 set
= isl_basic_set_lexmin(bset
);
4923 set
= set_parameter_preimage(set
, T2
);
4924 set
= set_append_equalities(set
, eq
);
4928 /* Compute an explicit representation for all the existentially
4929 * quantified variables.
4930 * The input and output dimensions are first turned into parameters.
4931 * compute_divs then returns a map with the same parameters and
4932 * no input or output dimensions and the dimension specification
4933 * is reset to that of the input.
4935 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
4937 struct isl_basic_set
*bset
;
4938 struct isl_set
*set
;
4939 struct isl_map
*map
;
4940 struct isl_dim
*dim
, *orig_dim
= NULL
;
4945 bmap
= isl_basic_map_cow(bmap
);
4949 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4950 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4951 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4952 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
4956 orig_dim
= bmap
->dim
;
4958 bset
= (struct isl_basic_set
*)bmap
;
4960 set
= parameter_compute_divs(bset
);
4961 map
= (struct isl_map
*)set
;
4962 map
= isl_map_reset_dim(map
, orig_dim
);
4966 isl_basic_map_free(bmap
);
4970 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
4978 off
= isl_dim_total(bmap
->dim
);
4979 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4980 if (isl_int_is_zero(bmap
->div
[i
][0]))
4982 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
4988 static int map_divs_known(__isl_keep isl_map
*map
)
4995 for (i
= 0; i
< map
->n
; ++i
) {
4996 int known
= basic_map_divs_known(map
->p
[i
]);
5004 /* If bmap contains any unknown divs, then compute explicit
5005 * expressions for them. However, this computation may be
5006 * quite expensive, so first try to remove divs that aren't
5009 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5013 struct isl_map
*map
;
5015 known
= basic_map_divs_known(bmap
);
5019 return isl_map_from_basic_map(bmap
);
5021 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5023 known
= basic_map_divs_known(bmap
);
5027 return isl_map_from_basic_map(bmap
);
5029 map
= compute_divs(bmap
);
5032 isl_basic_map_free(bmap
);
5036 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5040 struct isl_map
*res
;
5047 known
= map_divs_known(map
);
5055 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5056 for (i
= 1 ; i
< map
->n
; ++i
) {
5058 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5059 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5060 res
= isl_map_union_disjoint(res
, r2
);
5062 res
= isl_map_union(res
, r2
);
5069 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5071 return (struct isl_set
*)
5072 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5075 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5077 return (struct isl_set
*)
5078 isl_map_compute_divs((struct isl_map
*)set
);
5081 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5084 struct isl_set
*set
;
5089 map
= isl_map_cow(map
);
5093 set
= (struct isl_set
*)map
;
5094 set
->dim
= isl_dim_domain(set
->dim
);
5097 for (i
= 0; i
< map
->n
; ++i
) {
5098 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5102 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5103 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5110 struct isl_map
*isl_map_union_disjoint(
5111 struct isl_map
*map1
, struct isl_map
*map2
)
5115 struct isl_map
*map
= NULL
;
5129 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5131 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5132 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5133 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5135 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5136 map1
->n
+ map2
->n
, flags
);
5139 for (i
= 0; i
< map1
->n
; ++i
) {
5140 map
= isl_map_add_basic_map(map
,
5141 isl_basic_map_copy(map1
->p
[i
]));
5145 for (i
= 0; i
< map2
->n
; ++i
) {
5146 map
= isl_map_add_basic_map(map
,
5147 isl_basic_map_copy(map2
->p
[i
]));
5161 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5163 map1
= isl_map_union_disjoint(map1
, map2
);
5167 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5171 struct isl_set
*isl_set_union_disjoint(
5172 struct isl_set
*set1
, struct isl_set
*set2
)
5174 return (struct isl_set
*)
5175 isl_map_union_disjoint(
5176 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5179 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5181 return (struct isl_set
*)
5182 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5185 struct isl_map
*isl_map_intersect_range(
5186 struct isl_map
*map
, struct isl_set
*set
)
5189 struct isl_map
*result
;
5195 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5196 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5197 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5199 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5200 map
->n
* set
->n
, flags
);
5203 for (i
= 0; i
< map
->n
; ++i
)
5204 for (j
= 0; j
< set
->n
; ++j
) {
5205 result
= isl_map_add_basic_map(result
,
5206 isl_basic_map_intersect_range(
5207 isl_basic_map_copy(map
->p
[i
]),
5208 isl_basic_set_copy(set
->p
[j
])));
5221 struct isl_map
*isl_map_intersect_domain(
5222 struct isl_map
*map
, struct isl_set
*set
)
5224 return isl_map_reverse(
5225 isl_map_intersect_range(isl_map_reverse(map
), set
));
5228 struct isl_map
*isl_map_apply_domain(
5229 struct isl_map
*map1
, struct isl_map
*map2
)
5233 map1
= isl_map_reverse(map1
);
5234 map1
= isl_map_apply_range(map1
, map2
);
5235 return isl_map_reverse(map1
);
5242 struct isl_map
*isl_map_apply_range(
5243 struct isl_map
*map1
, struct isl_map
*map2
)
5245 struct isl_dim
*dim_result
;
5246 struct isl_map
*result
;
5252 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5253 isl_dim_copy(map2
->dim
));
5255 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5258 for (i
= 0; i
< map1
->n
; ++i
)
5259 for (j
= 0; j
< map2
->n
; ++j
) {
5260 result
= isl_map_add_basic_map(result
,
5261 isl_basic_map_apply_range(
5262 isl_basic_map_copy(map1
->p
[i
]),
5263 isl_basic_map_copy(map2
->p
[j
])));
5269 if (result
&& result
->n
<= 1)
5270 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5279 * returns range - domain
5281 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5283 isl_dim
*dims
, *target_dim
;
5284 struct isl_basic_set
*bset
;
5291 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5292 bmap
->dim
, isl_dim_out
),
5294 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5295 dim
= isl_basic_map_n_in(bmap
);
5296 nparam
= isl_basic_map_n_param(bmap
);
5297 bset
= isl_basic_set_from_basic_map(bmap
);
5298 bset
= isl_basic_set_cow(bset
);
5299 dims
= isl_basic_set_get_dim(bset
);
5300 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5301 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5302 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5303 for (i
= 0; i
< dim
; ++i
) {
5304 int j
= isl_basic_map_alloc_equality(
5305 (struct isl_basic_map
*)bset
);
5308 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5309 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5310 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5311 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5313 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5314 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5317 isl_basic_map_free(bmap
);
5322 * returns range - domain
5324 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5328 struct isl_set
*result
;
5333 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5334 map
->dim
, isl_dim_out
),
5336 dim
= isl_map_get_dim(map
);
5337 dim
= isl_dim_domain(dim
);
5338 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5341 for (i
= 0; i
< map
->n
; ++i
)
5342 result
= isl_set_add_basic_set(result
,
5343 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5351 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5353 struct isl_basic_map
*bmap
;
5361 nparam
= dims
->nparam
;
5363 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5367 for (i
= 0; i
< dim
; ++i
) {
5368 int j
= isl_basic_map_alloc_equality(bmap
);
5371 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5372 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5373 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5375 return isl_basic_map_finalize(bmap
);
5377 isl_basic_map_free(bmap
);
5381 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5383 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5386 return basic_map_identity(dim
);
5389 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5391 if (!model
|| !model
->dim
)
5393 isl_assert(model
->ctx
,
5394 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5395 return basic_map_identity(isl_dim_copy(model
->dim
));
5398 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5400 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5401 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5404 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5406 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5409 return map_identity(dim
);
5412 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5414 if (!model
|| !model
->dim
)
5416 isl_assert(model
->ctx
,
5417 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5418 return map_identity(isl_dim_copy(model
->dim
));
5421 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5423 if (!model
|| !model
->dim
)
5425 isl_assert(model
->ctx
,
5426 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5427 return map_identity(isl_dim_copy(model
->dim
));
5430 /* Construct a basic set with all set dimensions having only non-negative
5433 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5438 struct isl_basic_set
*bset
;
5442 nparam
= dims
->nparam
;
5444 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5447 for (i
= 0; i
< dim
; ++i
) {
5448 int k
= isl_basic_set_alloc_inequality(bset
);
5451 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5452 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5456 isl_basic_set_free(bset
);
5460 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5461 enum isl_dim_type type
, unsigned first
, unsigned n
)
5464 isl_basic_set
*nonneg
= NULL
;
5465 isl_basic_set
*neg
= NULL
;
5472 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5474 for (i
= 0; i
< n
; ++i
) {
5478 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5479 k
= isl_basic_set_alloc_inequality(nonneg
);
5482 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5483 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5485 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5486 k
= isl_basic_set_alloc_inequality(neg
);
5489 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5490 isl_int_set_si(neg
->ineq
[k
][0], -1);
5491 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5493 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5498 isl_basic_set_free(nonneg
);
5499 isl_basic_set_free(neg
);
5504 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5506 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5509 int isl_basic_map_is_subset(
5510 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5513 struct isl_map
*map1
;
5514 struct isl_map
*map2
;
5516 if (!bmap1
|| !bmap2
)
5519 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5520 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5522 is_subset
= isl_map_is_subset(map1
, map2
);
5530 int isl_basic_map_is_equal(
5531 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5535 if (!bmap1
|| !bmap2
)
5537 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5540 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5544 int isl_basic_set_is_equal(
5545 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5547 return isl_basic_map_is_equal(
5548 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5551 int isl_map_is_empty(struct isl_map
*map
)
5558 for (i
= 0; i
< map
->n
; ++i
) {
5559 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5568 int isl_map_fast_is_empty(struct isl_map
*map
)
5570 return map
? map
->n
== 0 : -1;
5573 int isl_set_fast_is_empty(struct isl_set
*set
)
5575 return set
? set
->n
== 0 : -1;
5578 int isl_set_is_empty(struct isl_set
*set
)
5580 return isl_map_is_empty((struct isl_map
*)set
);
5583 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5588 return isl_dim_equal(map1
->dim
, map2
->dim
);
5591 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5596 return isl_dim_equal(set1
->dim
, set2
->dim
);
5599 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5605 is_subset
= isl_map_is_subset(map1
, map2
);
5608 is_subset
= isl_map_is_subset(map2
, map1
);
5612 int isl_basic_map_is_strict_subset(
5613 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5617 if (!bmap1
|| !bmap2
)
5619 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5622 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5623 if (is_subset
== -1)
5628 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5634 is_subset
= isl_map_is_subset(map1
, map2
);
5637 is_subset
= isl_map_is_subset(map2
, map1
);
5638 if (is_subset
== -1)
5643 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5645 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5648 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5652 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5655 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5659 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5662 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5669 for (i
= 0; i
< map
->n
; ++i
) {
5670 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5678 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5680 return isl_map_fast_is_universe((isl_map
*) set
);
5683 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5685 struct isl_basic_set
*bset
= NULL
;
5686 struct isl_vec
*sample
= NULL
;
5693 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5696 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5697 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5698 copy
= isl_basic_map_remove_redundancies(copy
);
5699 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5700 isl_basic_map_free(copy
);
5704 total
= 1 + isl_basic_map_total_dim(bmap
);
5705 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5706 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5712 isl_vec_free(bmap
->sample
);
5713 bmap
->sample
= NULL
;
5714 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5717 sample
= isl_basic_set_sample_vec(bset
);
5720 empty
= sample
->size
== 0;
5721 isl_vec_free(bmap
->sample
);
5722 bmap
->sample
= sample
;
5724 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5729 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5733 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5736 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5740 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5743 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5745 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5748 struct isl_map
*isl_basic_map_union(
5749 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5751 struct isl_map
*map
;
5752 if (!bmap1
|| !bmap2
)
5755 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5757 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5760 map
= isl_map_add_basic_map(map
, bmap1
);
5761 map
= isl_map_add_basic_map(map
, bmap2
);
5764 isl_basic_map_free(bmap1
);
5765 isl_basic_map_free(bmap2
);
5769 struct isl_set
*isl_basic_set_union(
5770 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5772 return (struct isl_set
*)isl_basic_map_union(
5773 (struct isl_basic_map
*)bset1
,
5774 (struct isl_basic_map
*)bset2
);
5777 /* Order divs such that any div only depends on previous divs */
5778 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5786 off
= isl_dim_total(bmap
->dim
);
5788 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5790 if (isl_int_is_zero(bmap
->div
[i
][0]))
5792 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5796 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5802 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5804 return (struct isl_basic_set
*)
5805 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5808 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5815 for (i
= 0; i
< map
->n
; ++i
) {
5816 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5827 /* Look for a div in dst that corresponds to the div "div" in src.
5828 * The divs before "div" in src and dst are assumed to be the same.
5830 * Returns -1 if no corresponding div was found and the position
5831 * of the corresponding div in dst otherwise.
5833 static int find_div(struct isl_basic_map
*dst
,
5834 struct isl_basic_map
*src
, unsigned div
)
5838 unsigned total
= isl_dim_total(src
->dim
);
5840 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5841 for (i
= div
; i
< dst
->n_div
; ++i
)
5842 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5843 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5844 dst
->n_div
- div
) == -1)
5849 struct isl_basic_map
*isl_basic_map_align_divs(
5850 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5853 unsigned total
= isl_dim_total(src
->dim
);
5858 if (src
->n_div
== 0)
5861 for (i
= 0; i
< src
->n_div
; ++i
)
5862 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5864 src
= isl_basic_map_order_divs(src
);
5865 dst
= isl_basic_map_cow(dst
);
5866 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5867 src
->n_div
, 0, 2 * src
->n_div
);
5870 for (i
= 0; i
< src
->n_div
; ++i
) {
5871 int j
= find_div(dst
, src
, i
);
5873 j
= isl_basic_map_alloc_div(dst
);
5876 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5877 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5878 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5882 isl_basic_map_swap_div(dst
, i
, j
);
5886 isl_basic_map_free(dst
);
5890 struct isl_basic_set
*isl_basic_set_align_divs(
5891 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
5893 return (struct isl_basic_set
*)isl_basic_map_align_divs(
5894 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
5897 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
5905 map
= isl_map_compute_divs(map
);
5906 map
= isl_map_cow(map
);
5910 for (i
= 1; i
< map
->n
; ++i
)
5911 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
5912 for (i
= 1; i
< map
->n
; ++i
)
5913 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
5915 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5919 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
5921 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
5924 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
5928 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
5929 map
= isl_map_intersect_domain(map
, set
);
5930 set
= isl_map_range(map
);
5938 /* There is no need to cow as removing empty parts doesn't change
5939 * the meaning of the set.
5941 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
5948 for (i
= map
->n
-1; i
>= 0; --i
) {
5949 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
5951 isl_basic_map_free(map
->p
[i
]);
5952 if (i
!= map
->n
-1) {
5953 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5954 map
->p
[i
] = map
->p
[map
->n
-1];
5962 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
5964 return (struct isl_set
*)
5965 isl_map_remove_empty_parts((struct isl_map
*)set
);
5968 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
5970 struct isl_basic_map
*bmap
;
5971 if (!map
|| map
->n
== 0)
5973 bmap
= map
->p
[map
->n
-1];
5974 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
5975 return isl_basic_map_copy(bmap
);
5978 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
5980 return (struct isl_basic_set
*)
5981 isl_map_copy_basic_map((struct isl_map
*)set
);
5984 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
5985 __isl_keep isl_basic_map
*bmap
)
5991 for (i
= map
->n
-1; i
>= 0; --i
) {
5992 if (map
->p
[i
] != bmap
)
5994 map
= isl_map_cow(map
);
5997 isl_basic_map_free(map
->p
[i
]);
5998 if (i
!= map
->n
-1) {
5999 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6000 map
->p
[i
] = map
->p
[map
->n
-1];
6011 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6012 struct isl_basic_set
*bset
)
6014 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6015 (struct isl_basic_map
*)bset
);
6018 /* Given two basic sets bset1 and bset2, compute the maximal difference
6019 * between the values of dimension pos in bset1 and those in bset2
6020 * for any common value of the parameters and dimensions preceding pos.
6022 static enum isl_lp_result
basic_set_maximal_difference_at(
6023 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6024 int pos
, isl_int
*opt
)
6026 struct isl_dim
*dims
;
6027 struct isl_basic_map
*bmap1
= NULL
;
6028 struct isl_basic_map
*bmap2
= NULL
;
6029 struct isl_ctx
*ctx
;
6030 struct isl_vec
*obj
;
6033 unsigned dim1
, dim2
;
6034 enum isl_lp_result res
;
6036 if (!bset1
|| !bset2
)
6037 return isl_lp_error
;
6039 nparam
= isl_basic_set_n_param(bset1
);
6040 dim1
= isl_basic_set_n_dim(bset1
);
6041 dim2
= isl_basic_set_n_dim(bset2
);
6042 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6043 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6044 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6045 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6046 if (!bmap1
|| !bmap2
)
6048 bmap1
= isl_basic_map_cow(bmap1
);
6049 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6050 pos
, (dim1
- pos
) + (dim2
- pos
),
6051 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6052 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6055 total
= isl_basic_map_total_dim(bmap1
);
6057 obj
= isl_vec_alloc(ctx
, 1 + total
);
6058 isl_seq_clr(obj
->block
.data
, 1 + total
);
6059 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6060 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6063 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6065 isl_basic_map_free(bmap1
);
6069 isl_basic_map_free(bmap1
);
6070 isl_basic_map_free(bmap2
);
6071 return isl_lp_error
;
6074 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6075 * for any common value of the parameters and dimensions preceding pos
6076 * in both basic sets, the values of dimension pos in bset1 are
6077 * smaller or larger than those in bset2.
6080 * 1 if bset1 follows bset2
6081 * -1 if bset1 precedes bset2
6082 * 0 if bset1 and bset2 are incomparable
6083 * -2 if some error occurred.
6085 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6086 struct isl_basic_set
*bset2
, int pos
)
6089 enum isl_lp_result res
;
6094 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6096 if (res
== isl_lp_empty
)
6098 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6099 res
== isl_lp_unbounded
)
6101 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6110 /* Given two basic sets bset1 and bset2, check whether
6111 * for any common value of the parameters and dimensions preceding pos
6112 * there is a value of dimension pos in bset1 that is larger
6113 * than a value of the same dimension in bset2.
6116 * 1 if there exists such a pair
6117 * 0 if there is no such pair, but there is a pair of equal values
6119 * -2 if some error occurred.
6121 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6122 __isl_keep isl_basic_set
*bset2
, int pos
)
6125 enum isl_lp_result res
;
6130 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6132 if (res
== isl_lp_empty
)
6134 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6135 res
== isl_lp_unbounded
)
6137 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6139 else if (res
== isl_lp_ok
)
6148 /* Given two sets set1 and set2, check whether
6149 * for any common value of the parameters and dimensions preceding pos
6150 * there is a value of dimension pos in set1 that is larger
6151 * than a value of the same dimension in set2.
6154 * 1 if there exists such a pair
6155 * 0 if there is no such pair, but there is a pair of equal values
6157 * -2 if some error occurred.
6159 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6160 __isl_keep isl_set
*set2
, int pos
)
6168 for (i
= 0; i
< set1
->n
; ++i
)
6169 for (j
= 0; j
< set2
->n
; ++j
) {
6171 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6172 if (f
== 1 || f
== -2)
6181 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6182 unsigned pos
, isl_int
*val
)
6190 total
= isl_basic_map_total_dim(bmap
);
6191 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6192 for (; d
+1 > pos
; --d
)
6193 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6197 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6199 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6201 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6204 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6210 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6211 unsigned pos
, isl_int
*val
)
6223 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6226 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6227 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6228 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6229 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6233 isl_int_set(*val
, v
);
6239 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6240 unsigned pos
, isl_int
*val
)
6242 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6246 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6249 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6252 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6253 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6255 if (pos
>= isl_basic_map_dim(bmap
, type
))
6257 return isl_basic_map_fast_has_fixed_var(bmap
,
6258 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6261 int isl_map_fast_is_fixed(struct isl_map
*map
,
6262 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6264 if (pos
>= isl_map_dim(map
, type
))
6266 return isl_map_fast_has_fixed_var(map
,
6267 map_offset(map
, type
) - 1 + pos
, val
);
6270 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6271 * then return this fixed value in *val.
6273 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6276 return isl_basic_set_fast_has_fixed_var(bset
,
6277 isl_basic_set_n_param(bset
) + dim
, val
);
6280 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6281 * then return this fixed value in *val.
6283 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6285 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6288 /* Check if input variable in has fixed value and if so and if val is not NULL,
6289 * then return this fixed value in *val.
6291 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6293 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6296 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6297 * and if val is not NULL, then return this lower bound in *val.
6299 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6300 unsigned dim
, isl_int
*val
)
6302 int i
, i_eq
= -1, i_ineq
= -1;
6309 total
= isl_basic_set_total_dim(bset
);
6310 nparam
= isl_basic_set_n_param(bset
);
6311 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6312 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6318 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6319 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6321 if (i_eq
!= -1 || i_ineq
!= -1)
6325 if (i_eq
== -1 && i_ineq
== -1)
6327 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6328 /* The coefficient should always be one due to normalization. */
6329 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6331 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6333 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6334 total
- nparam
- dim
- 1) != -1)
6337 isl_int_neg(*val
, c
[0]);
6341 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6342 unsigned dim
, isl_int
*val
)
6354 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6358 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6360 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6361 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6363 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6367 isl_int_set(*val
, v
);
6378 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6380 const struct constraint
*c1
= (const struct constraint
*)p1
;
6381 const struct constraint
*c2
= (const struct constraint
*)p2
;
6382 unsigned size
= isl_min(c1
->size
, c2
->size
);
6383 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6386 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6387 struct isl_basic_map
*bmap
)
6390 struct constraint
*c
;
6395 total
= isl_basic_map_total_dim(bmap
);
6396 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6399 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6401 c
[i
].c
= bmap
->ineq
[i
];
6403 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6404 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6405 bmap
->ineq
[i
] = c
[i
].c
;
6409 isl_basic_map_free(bmap
);
6413 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6414 __isl_take isl_basic_set
*bset
)
6416 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6417 (struct isl_basic_map
*)bset
);
6420 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6424 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6426 bmap
= isl_basic_map_remove_redundancies(bmap
);
6427 bmap
= isl_basic_map_sort_constraints(bmap
);
6428 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6432 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6434 return (struct isl_basic_set
*)isl_basic_map_normalize(
6435 (struct isl_basic_map
*)bset
);
6438 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6439 const __isl_keep isl_basic_map
*bmap2
)
6446 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6447 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6448 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6449 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6450 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6451 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6452 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6453 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6455 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6457 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6459 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6460 return bmap1
->n_eq
- bmap2
->n_eq
;
6461 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6462 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6463 if (bmap1
->n_div
!= bmap2
->n_div
)
6464 return bmap1
->n_div
- bmap2
->n_div
;
6465 total
= isl_basic_map_total_dim(bmap1
);
6466 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6467 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6471 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6472 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6476 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6477 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6484 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6485 __isl_keep isl_basic_map
*bmap2
)
6487 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6490 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6491 __isl_keep isl_basic_set
*bset2
)
6493 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6494 (isl_basic_map
*)bset2
);
6497 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6499 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6500 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6502 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6505 /* We normalize in place, but if anything goes wrong we need
6506 * to return NULL, so we need to make sure we don't change the
6507 * meaning of any possible other copies of map.
6509 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6512 struct isl_basic_map
*bmap
;
6516 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6518 for (i
= 0; i
< map
->n
; ++i
) {
6519 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6522 isl_basic_map_free(map
->p
[i
]);
6525 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6526 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6527 map
= isl_map_remove_empty_parts(map
);
6530 for (i
= map
->n
- 1; i
>= 1; --i
) {
6531 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6533 isl_basic_map_free(map
->p
[i
-1]);
6534 for (j
= i
; j
< map
->n
; ++j
)
6535 map
->p
[j
-1] = map
->p
[j
];
6545 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6547 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6550 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6560 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6563 map1
= isl_map_copy(map1
);
6564 map2
= isl_map_copy(map2
);
6565 map1
= isl_map_normalize(map1
);
6566 map2
= isl_map_normalize(map2
);
6569 equal
= map1
->n
== map2
->n
;
6570 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6571 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6584 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6586 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6587 (struct isl_map
*)set2
);
6590 /* Return an interval that ranges from min to max (inclusive)
6592 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6593 isl_int min
, isl_int max
)
6596 struct isl_basic_set
*bset
= NULL
;
6598 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6602 k
= isl_basic_set_alloc_inequality(bset
);
6605 isl_int_set_si(bset
->ineq
[k
][1], 1);
6606 isl_int_neg(bset
->ineq
[k
][0], min
);
6608 k
= isl_basic_set_alloc_inequality(bset
);
6611 isl_int_set_si(bset
->ineq
[k
][1], -1);
6612 isl_int_set(bset
->ineq
[k
][0], max
);
6616 isl_basic_set_free(bset
);
6620 /* Return the Cartesian product of the basic sets in list (in the given order).
6622 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6630 struct isl_basic_set
*product
= NULL
;
6634 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6635 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6636 nparam
= isl_basic_set_n_param(list
->p
[0]);
6637 dim
= isl_basic_set_n_dim(list
->p
[0]);
6638 extra
= list
->p
[0]->n_div
;
6639 n_eq
= list
->p
[0]->n_eq
;
6640 n_ineq
= list
->p
[0]->n_ineq
;
6641 for (i
= 1; i
< list
->n
; ++i
) {
6642 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6643 isl_assert(list
->ctx
,
6644 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6645 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6646 extra
+= list
->p
[i
]->n_div
;
6647 n_eq
+= list
->p
[i
]->n_eq
;
6648 n_ineq
+= list
->p
[i
]->n_ineq
;
6650 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6655 for (i
= 0; i
< list
->n
; ++i
) {
6656 isl_basic_set_add_constraints(product
,
6657 isl_basic_set_copy(list
->p
[i
]), dim
);
6658 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6660 isl_basic_set_list_free(list
);
6663 isl_basic_set_free(product
);
6664 isl_basic_set_list_free(list
);
6668 struct isl_basic_map
*isl_basic_map_product(
6669 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6671 struct isl_dim
*dim_result
= NULL
;
6672 struct isl_basic_map
*bmap
;
6673 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6674 struct isl_dim_map
*dim_map1
, *dim_map2
;
6676 if (!bmap1
|| !bmap2
)
6679 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6680 bmap2
->dim
, isl_dim_param
), goto error
);
6681 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6682 isl_dim_copy(bmap2
->dim
));
6684 in1
= isl_basic_map_n_in(bmap1
);
6685 in2
= isl_basic_map_n_in(bmap2
);
6686 out1
= isl_basic_map_n_out(bmap1
);
6687 out2
= isl_basic_map_n_out(bmap2
);
6688 nparam
= isl_basic_map_n_param(bmap1
);
6690 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6691 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6692 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6693 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6694 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6695 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6696 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6697 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6698 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6699 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6700 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6702 bmap
= isl_basic_map_alloc_dim(dim_result
,
6703 bmap1
->n_div
+ bmap2
->n_div
,
6704 bmap1
->n_eq
+ bmap2
->n_eq
,
6705 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6706 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6707 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6708 bmap
= isl_basic_map_simplify(bmap
);
6709 return isl_basic_map_finalize(bmap
);
6711 isl_basic_map_free(bmap1
);
6712 isl_basic_map_free(bmap2
);
6716 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6718 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6721 struct isl_map
*result
;
6727 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6728 map2
->dim
, isl_dim_param
), goto error
);
6730 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6731 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6732 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6734 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6735 isl_dim_copy(map2
->dim
)),
6736 map1
->n
* map2
->n
, flags
);
6739 for (i
= 0; i
< map1
->n
; ++i
)
6740 for (j
= 0; j
< map2
->n
; ++j
) {
6741 struct isl_basic_map
*part
;
6742 part
= isl_basic_map_product(
6743 isl_basic_map_copy(map1
->p
[i
]),
6744 isl_basic_map_copy(map2
->p
[j
]));
6745 if (isl_basic_map_is_empty(part
))
6746 isl_basic_map_free(part
);
6748 result
= isl_map_add_basic_map(result
, part
);
6761 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6763 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
6764 __isl_take isl_map
*map2
)
6768 prod
= isl_map_product(map1
, map2
);
6769 prod
= isl_map_flatten(prod
);
6773 /* Given two set A and B, construct its Cartesian product A x B.
6775 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6777 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6778 (struct isl_map
*)set2
);
6781 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
6782 __isl_take isl_set
*set2
)
6784 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
6787 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6790 uint32_t hash
= isl_hash_init();
6795 bset
= isl_basic_set_copy(bset
);
6796 bset
= isl_basic_set_normalize(bset
);
6799 total
= isl_basic_set_total_dim(bset
);
6800 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6801 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6803 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6804 isl_hash_hash(hash
, c_hash
);
6806 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6807 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6809 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6810 isl_hash_hash(hash
, c_hash
);
6812 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6813 for (i
= 0; i
< bset
->n_div
; ++i
) {
6815 if (isl_int_is_zero(bset
->div
[i
][0]))
6817 isl_hash_byte(hash
, i
& 0xFF);
6818 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6819 isl_hash_hash(hash
, c_hash
);
6821 isl_basic_set_free(bset
);
6825 uint32_t isl_set_get_hash(struct isl_set
*set
)
6832 set
= isl_set_copy(set
);
6833 set
= isl_set_normalize(set
);
6837 hash
= isl_hash_init();
6838 for (i
= 0; i
< set
->n
; ++i
) {
6840 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6841 isl_hash_hash(hash
, bset_hash
);
6849 /* Check if the value for dimension dim is completely determined
6850 * by the values of the other parameters and variables.
6851 * That is, check if dimension dim is involved in an equality.
6853 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6860 nparam
= isl_basic_set_n_param(bset
);
6861 for (i
= 0; i
< bset
->n_eq
; ++i
)
6862 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6867 /* Check if the value for dimension dim is completely determined
6868 * by the values of the other parameters and variables.
6869 * That is, check if dimension dim is involved in an equality
6870 * for each of the subsets.
6872 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6878 for (i
= 0; i
< set
->n
; ++i
) {
6880 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6887 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
6888 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
6895 for (i
= 0; i
< map
->n
; ++i
)
6896 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
6902 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
6903 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
6910 for (i
= 0; i
< set
->n
; ++i
)
6911 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
6917 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
6919 struct isl_dim
*dim
;
6924 if (bset
->n_div
== 0)
6927 bset
= isl_basic_set_cow(bset
);
6931 dim
= isl_basic_set_get_dim(bset
);
6932 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
6935 isl_dim_free(bset
->dim
);
6939 bset
= isl_basic_set_finalize(bset
);
6943 isl_basic_set_free(bset
);
6947 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
6950 struct isl_dim
*dim
;
6953 set
= isl_set_align_divs(set
);
6957 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
6960 set
= isl_set_cow(set
);
6964 n_div
= set
->p
[0]->n_div
;
6965 dim
= isl_set_get_dim(set
);
6966 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
6969 isl_dim_free(set
->dim
);
6972 for (i
= 0; i
< set
->n
; ++i
) {
6973 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
6984 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
6986 struct isl_dim
*dim
;
6987 struct isl_basic_map
*bmap
;
6994 set
= isl_set_align_divs(set
);
6999 dim
= isl_set_get_dim(set
);
7000 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7002 return isl_map_identity(dim
);
7005 n_div
= set
->p
[0]->n_div
;
7006 dim
= isl_dim_map(dim
);
7007 n_param
= isl_dim_size(dim
, isl_dim_param
);
7008 n_set
= isl_dim_size(dim
, isl_dim_in
);
7009 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7010 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7011 for (i
= 0; i
< n_set
; ++i
)
7012 bmap
= var_equal(bmap
, i
);
7014 total
= n_param
+ n_set
+ n_set
+ n_div
;
7015 for (i
= 0; i
< n_div
; ++i
) {
7016 k
= isl_basic_map_alloc_inequality(bmap
);
7019 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7020 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7021 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7022 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7023 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7024 set
->p
[0]->div
[i
][0]);
7026 l
= isl_basic_map_alloc_inequality(bmap
);
7029 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7030 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7031 set
->p
[0]->div
[i
][0]);
7032 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7036 return isl_map_from_basic_map(bmap
);
7039 isl_basic_map_free(bmap
);
7043 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7051 dim
= isl_basic_set_total_dim(bset
);
7052 size
+= bset
->n_eq
* (1 + dim
);
7053 size
+= bset
->n_ineq
* (1 + dim
);
7054 size
+= bset
->n_div
* (2 + dim
);
7059 int isl_set_size(__isl_keep isl_set
*set
)
7067 for (i
= 0; i
< set
->n
; ++i
)
7068 size
+= isl_basic_set_size(set
->p
[i
]);
7073 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7074 enum isl_dim_type type
, unsigned pos
)
7082 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7084 pos
+= isl_basic_map_offset(bmap
, type
);
7086 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7087 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7091 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7092 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7099 return lower
&& upper
;
7102 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7103 enum isl_dim_type type
, unsigned pos
)
7110 for (i
= 0; i
< map
->n
; ++i
) {
7112 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7113 if (bounded
< 0 || !bounded
)
7120 /* Return 1 if the specified dim is involved in both an upper bound
7121 * and a lower bound.
7123 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7124 enum isl_dim_type type
, unsigned pos
)
7126 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7129 /* For each of the "n" variables starting at "first", determine
7130 * the sign of the variable and put the results in the first "n"
7131 * elements of the array "signs".
7133 * 1 means that the variable is non-negative
7134 * -1 means that the variable is non-positive
7135 * 0 means the variable attains both positive and negative values.
7137 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7138 unsigned first
, unsigned n
, int *signs
)
7140 isl_vec
*bound
= NULL
;
7141 struct isl_tab
*tab
= NULL
;
7142 struct isl_tab_undo
*snap
;
7145 if (!bset
|| !signs
)
7148 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7149 tab
= isl_tab_from_basic_set(bset
);
7153 isl_seq_clr(bound
->el
, bound
->size
);
7154 isl_int_set_si(bound
->el
[0], -1);
7156 snap
= isl_tab_snap(tab
);
7157 for (i
= 0; i
< n
; ++i
) {
7160 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7161 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7164 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7165 if (isl_tab_rollback(tab
, snap
) < 0)
7173 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7174 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7177 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7178 if (isl_tab_rollback(tab
, snap
) < 0)
7181 signs
[i
] = empty
? -1 : 0;
7185 isl_vec_free(bound
);
7189 isl_vec_free(bound
);
7193 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7194 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7196 if (!bset
|| !signs
)
7198 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7201 first
+= pos(bset
->dim
, type
) - 1;
7202 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7205 /* Check if the given map is single-valued.
7210 * and check if the result is a subset of the identity mapping.
7212 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7218 test
= isl_map_reverse(isl_map_copy(map
));
7219 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7221 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7223 sv
= isl_map_is_subset(test
, id
);
7231 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7235 sv
= isl_map_is_single_valued(map
);
7239 map
= isl_map_copy(map
);
7240 map
= isl_map_reverse(map
);
7241 sv
= isl_map_is_single_valued(map
);
7247 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7249 return isl_map_is_single_valued((isl_map
*)set
);
7252 int isl_map_is_translation(__isl_keep isl_map
*map
)
7257 delta
= isl_map_deltas(isl_map_copy(map
));
7258 ok
= isl_set_is_singleton(delta
);
7259 isl_set_free(delta
);
7264 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7266 if (isl_seq_first_non_zero(p
, pos
) != -1)
7268 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7273 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7282 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7285 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7286 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7287 for (j
= 0; j
< nvar
; ++j
) {
7288 int lower
= 0, upper
= 0;
7289 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7290 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7292 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7298 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7299 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7301 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7303 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7308 if (!lower
|| !upper
)
7315 int isl_set_is_box(__isl_keep isl_set
*set
)
7322 return isl_basic_set_is_box(set
->p
[0]);
7325 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7330 return isl_dim_is_wrapping(bset
->dim
);
7333 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7338 return isl_dim_is_wrapping(set
->dim
);
7341 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7343 bmap
= isl_basic_map_cow(bmap
);
7347 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7351 bmap
= isl_basic_map_finalize(bmap
);
7353 return (isl_basic_set
*)bmap
;
7355 isl_basic_map_free(bmap
);
7359 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7363 map
= isl_map_cow(map
);
7367 for (i
= 0; i
< map
->n
; ++i
) {
7368 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7372 map
->dim
= isl_dim_wrap(map
->dim
);
7376 return (isl_set
*)map
;
7382 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7384 bset
= isl_basic_set_cow(bset
);
7388 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7392 bset
= isl_basic_set_finalize(bset
);
7394 return (isl_basic_map
*)bset
;
7396 isl_basic_set_free(bset
);
7400 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7407 if (!isl_set_is_wrapping(set
))
7408 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7411 set
= isl_set_cow(set
);
7415 for (i
= 0; i
< set
->n
; ++i
) {
7416 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7421 set
->dim
= isl_dim_unwrap(set
->dim
);
7425 return (isl_map
*)set
;
7431 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7432 enum isl_dim_type type
)
7437 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7440 bmap
= isl_basic_map_cow(bmap
);
7444 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7448 bmap
= isl_basic_map_finalize(bmap
);
7452 isl_basic_map_free(bmap
);
7456 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7457 enum isl_dim_type type
)
7464 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7467 map
= isl_map_cow(map
);
7471 for (i
= 0; i
< map
->n
; ++i
) {
7472 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7476 map
->dim
= isl_dim_reset(map
->dim
, type
);
7486 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7491 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7494 bmap
= isl_basic_map_cow(bmap
);
7498 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7502 bmap
= isl_basic_map_finalize(bmap
);
7506 isl_basic_map_free(bmap
);
7510 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7517 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7520 map
= isl_map_cow(map
);
7524 for (i
= 0; i
< map
->n
; ++i
) {
7525 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7529 map
->dim
= isl_dim_flatten(map
->dim
);
7539 /* Extend the given dim_map with mappings for the divs in bmap.
7541 static __isl_give
struct isl_dim_map
*extend_dim_map(
7542 __isl_keep
struct isl_dim_map
*dim_map
,
7543 __isl_keep isl_basic_map
*bmap
)
7546 struct isl_dim_map
*res
;
7549 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7551 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7555 for (i
= 0; i
< dim_map
->len
; ++i
)
7556 res
->pos
[i
] = dim_map
->pos
[i
];
7557 for (i
= 0; i
< bmap
->n_div
; ++i
)
7558 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7563 /* Extract a dim_map from a reordering.
7564 * We essentially need to reverse the mapping, and add an offset
7565 * of 1 for the constant term.
7567 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7568 __isl_keep isl_reordering
*exp
)
7571 struct isl_dim_map
*dim_map
;
7576 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7580 for (i
= 0; i
< exp
->len
; ++i
)
7581 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7586 /* Reorder the dimensions of "bmap" according to the given dim_map
7587 * and set the dimension specification to "dim".
7589 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7590 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
7594 bmap
= isl_basic_map_cow(bmap
);
7595 if (!bmap
|| !dim
|| !dim_map
)
7598 res
= isl_basic_map_alloc_dim(dim
,
7599 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
7600 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
7601 res
= isl_basic_map_finalize(res
);
7605 isl_basic_map_free(bmap
);
7610 /* Reorder the dimensions of "map" according to given reordering.
7612 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
7613 __isl_take isl_reordering
*r
)
7616 struct isl_dim_map
*dim_map
;
7618 map
= isl_map_cow(map
);
7619 dim_map
= isl_dim_map_from_reordering(r
);
7620 if (!map
|| !r
|| !dim_map
)
7623 for (i
= 0; i
< map
->n
; ++i
) {
7624 struct isl_dim_map
*dim_map_i
;
7626 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
7628 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
7629 isl_dim_copy(r
->dim
), dim_map_i
);
7635 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
7637 isl_reordering_free(r
);
7643 isl_reordering_free(r
);
7647 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
7648 __isl_take isl_reordering
*r
)
7650 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
7653 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
7654 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7655 enum isl_dim_type c2
, enum isl_dim_type c3
,
7656 enum isl_dim_type c4
, enum isl_dim_type c5
)
7658 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7659 struct isl_mat
*mat
;
7665 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
7666 isl_basic_map_total_dim(bmap
) + 1);
7669 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7670 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7671 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7672 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7673 isl_int_set(mat
->row
[i
][pos
],
7674 bmap
->eq
[i
][off
+ k
]);
7682 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
7683 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7684 enum isl_dim_type c2
, enum isl_dim_type c3
,
7685 enum isl_dim_type c4
, enum isl_dim_type c5
)
7687 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7688 struct isl_mat
*mat
;
7694 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
7695 isl_basic_map_total_dim(bmap
) + 1);
7698 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7699 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7700 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7701 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7702 isl_int_set(mat
->row
[i
][pos
],
7703 bmap
->ineq
[i
][off
+ k
]);
7711 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
7712 __isl_take isl_dim
*dim
,
7713 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
7714 enum isl_dim_type c2
, enum isl_dim_type c3
,
7715 enum isl_dim_type c4
, enum isl_dim_type c5
)
7717 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7718 isl_basic_map
*bmap
;
7724 if (!dim
|| !eq
|| !ineq
)
7727 if (eq
->n_col
!= ineq
->n_col
)
7728 isl_die(dim
->ctx
, isl_error_invalid
,
7729 "equalities and inequalities matrices should have "
7730 "same number of columns", goto error
);
7732 total
= 1 + isl_dim_total(dim
);
7734 if (eq
->n_col
< total
)
7735 isl_die(dim
->ctx
, isl_error_invalid
,
7736 "number of columns too small", goto error
);
7738 extra
= eq
->n_col
- total
;
7740 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
7741 eq
->n_row
, ineq
->n_row
);
7744 for (i
= 0; i
< extra
; ++i
)
7745 if (isl_basic_map_alloc_div(bmap
) < 0)
7747 for (i
= 0; i
< eq
->n_row
; ++i
) {
7748 l
= isl_basic_map_alloc_equality(bmap
);
7751 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7752 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7753 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7754 isl_int_set(bmap
->eq
[l
][off
+ k
],
7760 for (i
= 0; i
< ineq
->n_row
; ++i
) {
7761 l
= isl_basic_map_alloc_inequality(bmap
);
7764 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7765 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7766 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7767 isl_int_set(bmap
->ineq
[l
][off
+ k
],
7786 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
7787 __isl_take isl_dim
*dim
,
7788 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
7789 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
7791 return (isl_basic_set
*)
7792 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
7793 c1
, c2
, c3
, c4
, isl_dim_in
);