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
);
326 bmap
= isl_basic_map_finalize(bmap
);
329 isl_basic_map_free(bmap
);
333 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
334 enum isl_dim_type type
)
336 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
339 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
340 enum isl_dim_type type
, const char *s
)
344 map
= isl_map_cow(map
);
348 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
352 for (i
= 0; i
< map
->n
; ++i
) {
353 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
364 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
365 enum isl_dim_type type
)
367 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
370 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
373 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
376 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
378 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
381 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
382 enum isl_dim_type type
, unsigned pos
)
384 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
387 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
388 enum isl_dim_type type
, unsigned pos
)
390 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
393 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
394 enum isl_dim_type type
, unsigned pos
)
396 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
399 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
400 __isl_take isl_basic_map
*bmap
,
401 enum isl_dim_type type
, unsigned pos
, const char *s
)
405 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
410 isl_basic_map_free(bmap
);
414 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
415 enum isl_dim_type type
, unsigned pos
, const char *s
)
422 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
426 for (i
= 0; i
< map
->n
; ++i
) {
427 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
438 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
439 __isl_take isl_basic_set
*bset
,
440 enum isl_dim_type type
, unsigned pos
, const char *s
)
442 return (isl_basic_set
*)isl_basic_map_set_dim_name(
443 (isl_basic_map
*)bset
, type
, pos
, s
);
446 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
447 enum isl_dim_type type
, unsigned pos
, const char *s
)
449 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
452 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
456 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
459 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
460 struct isl_basic_map
*bmap
, unsigned extra
,
461 unsigned n_eq
, unsigned n_ineq
)
464 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
469 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
470 if (isl_blk_is_error(bmap
->block
))
473 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
478 bmap
->block2
= isl_blk_empty();
481 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
482 if (isl_blk_is_error(bmap
->block2
))
485 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
490 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
491 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
493 for (i
= 0; i
< extra
; ++i
)
494 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
498 bmap
->c_size
= n_eq
+ n_ineq
;
499 bmap
->eq
= bmap
->ineq
+ n_ineq
;
508 isl_basic_map_free(bmap
);
512 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
513 unsigned nparam
, unsigned dim
, unsigned extra
,
514 unsigned n_eq
, unsigned n_ineq
)
516 struct isl_basic_map
*bmap
;
517 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
518 return (struct isl_basic_set
*)bmap
;
521 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
522 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
524 struct isl_basic_map
*bmap
;
527 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
528 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
529 return (struct isl_basic_set
*)bmap
;
535 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
536 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
538 struct isl_basic_map
*bmap
;
542 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
547 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
553 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
554 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
555 unsigned n_eq
, unsigned n_ineq
)
557 struct isl_basic_map
*bmap
;
560 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
564 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
568 static void dup_constraints(
569 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
572 unsigned total
= isl_basic_map_total_dim(src
);
574 for (i
= 0; i
< src
->n_eq
; ++i
) {
575 int j
= isl_basic_map_alloc_equality(dst
);
576 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
579 for (i
= 0; i
< src
->n_ineq
; ++i
) {
580 int j
= isl_basic_map_alloc_inequality(dst
);
581 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
584 for (i
= 0; i
< src
->n_div
; ++i
) {
585 int j
= isl_basic_map_alloc_div(dst
);
586 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
588 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
591 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
593 struct isl_basic_map
*dup
;
597 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
598 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
601 dup_constraints(dup
, bmap
);
602 dup
->flags
= bmap
->flags
;
603 dup
->sample
= isl_vec_copy(bmap
->sample
);
607 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
609 struct isl_basic_map
*dup
;
611 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
612 return (struct isl_basic_set
*)dup
;
615 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
620 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
624 return isl_basic_set_dup(bset
);
627 struct isl_set
*isl_set_copy(struct isl_set
*set
)
636 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
641 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
645 bmap
= isl_basic_map_dup(bmap
);
647 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
651 struct isl_map
*isl_map_copy(struct isl_map
*map
)
660 void isl_basic_map_free(struct isl_basic_map
*bmap
)
668 isl_ctx_deref(bmap
->ctx
);
670 isl_blk_free(bmap
->ctx
, bmap
->block2
);
672 isl_blk_free(bmap
->ctx
, bmap
->block
);
673 isl_vec_free(bmap
->sample
);
674 isl_dim_free(bmap
->dim
);
678 void isl_basic_set_free(struct isl_basic_set
*bset
)
680 isl_basic_map_free((struct isl_basic_map
*)bset
);
683 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
685 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
688 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
694 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
695 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
697 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
698 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
699 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
700 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
701 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
702 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
704 int j
= isl_basic_map_alloc_inequality(bmap
);
708 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
709 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
716 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
717 bmap
->extra
- bmap
->n_div
);
721 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
723 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
726 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
730 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
735 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
737 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
740 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
745 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
747 if (pos
!= bmap
->n_eq
- 1) {
749 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
750 bmap
->eq
[bmap
->n_eq
- 1] = t
;
756 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
758 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
761 void isl_basic_map_inequality_to_equality(
762 struct isl_basic_map
*bmap
, unsigned pos
)
767 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
768 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
773 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
774 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
775 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
776 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
779 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
781 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
784 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
790 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
791 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
792 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
793 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
794 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
795 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
796 1 + isl_basic_map_total_dim(bmap
),
797 bmap
->extra
- bmap
->n_div
);
798 return bmap
->n_ineq
++;
801 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
803 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
806 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
810 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
815 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
817 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
820 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
825 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
827 if (pos
!= bmap
->n_ineq
- 1) {
829 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
830 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
831 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
837 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
839 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
842 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
847 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
850 k
= isl_basic_map_alloc_equality(bmap
);
853 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
856 isl_basic_map_free(bmap
);
860 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
863 return (isl_basic_set
*)
864 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
867 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
872 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
875 k
= isl_basic_map_alloc_inequality(bmap
);
878 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
881 isl_basic_map_free(bmap
);
885 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
888 return (isl_basic_set
*)
889 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
892 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
896 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
897 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
898 1 + 1 + isl_basic_map_total_dim(bmap
),
899 bmap
->extra
- bmap
->n_div
);
900 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
901 return bmap
->n_div
++;
904 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
906 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
909 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
913 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
918 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
920 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
923 /* Copy constraint from src to dst, putting the vars of src at offset
924 * dim_off in dst and the divs of src at offset div_off in dst.
925 * If both sets are actually map, then dim_off applies to the input
928 static void copy_constraint(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 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
933 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
934 unsigned src_in
= isl_basic_map_n_in(src_map
);
935 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
936 unsigned src_out
= isl_basic_map_n_out(src_map
);
937 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
938 isl_int_set(dst
[0], src
[0]);
939 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
940 if (dst_nparam
> src_nparam
)
941 isl_seq_clr(dst
+1+src_nparam
,
942 dst_nparam
- src_nparam
);
943 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
944 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
946 isl_min(dst_in
-in_off
, src_in
));
947 if (dst_in
-in_off
> src_in
)
948 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
949 dst_in
- in_off
- src_in
);
950 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
951 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
952 src
+1+src_nparam
+src_in
,
953 isl_min(dst_out
-out_off
, src_out
));
954 if (dst_out
-out_off
> src_out
)
955 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
956 dst_out
- out_off
- src_out
);
957 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
958 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
959 src
+1+src_nparam
+src_in
+src_out
,
960 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
961 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
962 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
963 div_off
+src_map
->n_div
,
964 dst_map
->n_div
- div_off
- src_map
->n_div
);
967 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
968 struct isl_basic_map
*src_map
, isl_int
*src
,
969 unsigned in_off
, unsigned out_off
, unsigned div_off
)
971 isl_int_set(dst
[0], src
[0]);
972 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
975 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
976 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
981 if (!bmap1
|| !bmap2
)
984 div_off
= bmap1
->n_div
;
986 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
987 int i1
= isl_basic_map_alloc_equality(bmap1
);
990 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
991 i_pos
, o_pos
, div_off
);
994 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
995 int i1
= isl_basic_map_alloc_inequality(bmap1
);
998 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
999 i_pos
, o_pos
, div_off
);
1002 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1003 int i1
= isl_basic_map_alloc_div(bmap1
);
1006 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1007 i_pos
, o_pos
, div_off
);
1010 isl_basic_map_free(bmap2
);
1015 isl_basic_map_free(bmap1
);
1016 isl_basic_map_free(bmap2
);
1020 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
1021 struct isl_dim_map
*dim_map
)
1025 for (i
= 0; i
< dim_map
->len
; ++i
) {
1026 if (dim_map
->pos
[i
] < 0)
1027 isl_int_set_si(dst
[i
], 0);
1029 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
1033 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
1034 struct isl_dim_map
*dim_map
)
1036 isl_int_set(dst
[0], src
[0]);
1037 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
1040 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
1041 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
1045 if (!src
|| !dst
|| !dim_map
)
1048 for (i
= 0; i
< src
->n_eq
; ++i
) {
1049 int i1
= isl_basic_map_alloc_equality(dst
);
1052 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1055 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1056 int i1
= isl_basic_map_alloc_inequality(dst
);
1059 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1062 for (i
= 0; i
< src
->n_div
; ++i
) {
1063 int i1
= isl_basic_map_alloc_div(dst
);
1066 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1070 isl_basic_map_free(src
);
1075 isl_basic_map_free(src
);
1076 isl_basic_map_free(dst
);
1080 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1081 struct isl_basic_set
*bset2
, unsigned pos
)
1083 return (struct isl_basic_set
*)
1084 add_constraints((struct isl_basic_map
*)bset1
,
1085 (struct isl_basic_map
*)bset2
, 0, pos
);
1088 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1089 struct isl_dim
*dim
, unsigned extra
,
1090 unsigned n_eq
, unsigned n_ineq
)
1092 struct isl_basic_map
*ext
;
1102 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1103 base
->extra
>= base
->n_div
+ extra
;
1105 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1106 room_for_ineq(base
, n_ineq
)) {
1111 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1112 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1113 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1114 extra
+= base
->extra
;
1116 n_ineq
+= base
->n_ineq
;
1118 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1124 ext
->sample
= isl_vec_copy(base
->sample
);
1125 flags
= base
->flags
;
1126 ext
= add_constraints(ext
, base
, 0, 0);
1129 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1136 isl_basic_map_free(base
);
1140 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1141 struct isl_dim
*dim
, unsigned extra
,
1142 unsigned n_eq
, unsigned n_ineq
)
1144 return (struct isl_basic_set
*)
1145 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1146 extra
, n_eq
, n_ineq
);
1149 struct isl_basic_map
*isl_basic_map_extend_constraints(
1150 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1154 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1158 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1159 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1160 unsigned n_eq
, unsigned n_ineq
)
1162 struct isl_basic_map
*bmap
;
1163 struct isl_dim
*dim
;
1167 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1171 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1174 isl_basic_map_free(base
);
1178 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1179 unsigned nparam
, unsigned dim
, unsigned extra
,
1180 unsigned n_eq
, unsigned n_ineq
)
1182 return (struct isl_basic_set
*)
1183 isl_basic_map_extend((struct isl_basic_map
*)base
,
1184 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1187 struct isl_basic_set
*isl_basic_set_extend_constraints(
1188 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1190 return (struct isl_basic_set
*)
1191 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1195 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1197 return (struct isl_basic_set
*)
1198 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1201 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1206 if (bmap
->ref
> 1) {
1208 bmap
= isl_basic_map_dup(bmap
);
1211 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1215 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1223 return isl_set_dup(set
);
1226 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1234 return isl_map_dup(map
);
1237 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1238 unsigned a_len
, unsigned b_len
)
1240 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1241 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1242 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1245 struct isl_basic_set
*isl_basic_set_swap_vars(
1246 struct isl_basic_set
*bset
, unsigned n
)
1256 nparam
= isl_basic_set_n_param(bset
);
1257 dim
= isl_basic_set_n_dim(bset
);
1258 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1263 bset
= isl_basic_set_cow(bset
);
1267 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1268 if (isl_blk_is_error(blk
))
1271 for (i
= 0; i
< bset
->n_eq
; ++i
)
1273 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1275 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1277 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1279 for (i
= 0; i
< bset
->n_div
; ++i
)
1281 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1283 isl_blk_free(bset
->ctx
, blk
);
1285 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1286 bset
= isl_basic_set_gauss(bset
, NULL
);
1287 return isl_basic_set_finalize(bset
);
1289 isl_basic_set_free(bset
);
1293 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1296 set
= isl_set_cow(set
);
1300 for (i
= 0; i
< set
->n
; ++i
) {
1301 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1307 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1311 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1317 total
= isl_basic_map_total_dim(bmap
);
1318 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1319 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1321 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1323 i
= isl_basic_map_alloc_equality(bmap
);
1327 isl_int_set_si(bmap
->eq
[i
][0], 1);
1328 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1329 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1330 isl_vec_free(bmap
->sample
);
1331 bmap
->sample
= NULL
;
1332 return isl_basic_map_finalize(bmap
);
1334 isl_basic_map_free(bmap
);
1338 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1340 return (struct isl_basic_set
*)
1341 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1344 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1347 unsigned off
= isl_dim_total(bmap
->dim
);
1348 isl_int
*t
= bmap
->div
[a
];
1349 bmap
->div
[a
] = bmap
->div
[b
];
1352 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1353 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1355 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1356 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1358 for (i
= 0; i
< bmap
->n_div
; ++i
)
1359 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1360 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1363 /* Eliminate the specified n dimensions starting at first from the
1364 * constraints using Fourier-Motzkin. The dimensions themselves
1367 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1368 enum isl_dim_type type
, unsigned first
, unsigned n
)
1377 map
= isl_map_cow(map
);
1380 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1381 first
+= pos(map
->dim
, type
) - 1;
1383 for (i
= 0; i
< map
->n
; ++i
) {
1384 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1394 /* Eliminate the specified n dimensions starting at first from the
1395 * constraints using Fourier-Motzkin. The dimensions themselves
1398 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1399 enum isl_dim_type type
, unsigned first
, unsigned n
)
1401 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1404 /* Eliminate the specified n dimensions starting at first from the
1405 * constraints using Fourier-Motzkin. The dimensions themselves
1408 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1409 unsigned first
, unsigned n
)
1411 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1414 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1415 __isl_take isl_basic_map
*bmap
)
1417 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1425 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1426 __isl_take isl_basic_set
*bset
)
1428 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1429 (struct isl_basic_map
*)bset
);
1432 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1441 set
= isl_set_cow(set
);
1445 for (i
= 0; i
< set
->n
; ++i
) {
1446 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1456 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1457 enum isl_dim_type type
, unsigned first
, unsigned n
)
1461 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1465 bmap
= isl_basic_map_eliminate_vars(bmap
,
1466 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1469 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1471 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1474 isl_basic_map_free(bmap
);
1478 /* Return true if the definition of the given div (recursively) involves
1479 * any of the given variables.
1481 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1482 unsigned first
, unsigned n
)
1485 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1487 if (isl_int_is_zero(bmap
->div
[div
][0]))
1489 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1492 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1493 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1495 if (div_involves_vars(bmap
, i
, first
, n
))
1502 /* Remove all divs (recursively) involving any of the given dimensions
1503 * in their definitions.
1505 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1506 __isl_take isl_basic_map
*bmap
,
1507 enum isl_dim_type type
, unsigned first
, unsigned n
)
1513 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1515 first
+= isl_basic_map_offset(bmap
, type
);
1517 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1518 if (!div_involves_vars(bmap
, i
, first
, n
))
1520 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1525 isl_basic_map_free(bmap
);
1529 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1530 enum isl_dim_type type
, unsigned first
, unsigned n
)
1539 map
= isl_map_cow(map
);
1543 for (i
= 0; i
< map
->n
; ++i
) {
1544 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1555 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1556 enum isl_dim_type type
, unsigned first
, unsigned n
)
1558 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1562 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1563 __isl_take isl_basic_set
*bset
,
1564 enum isl_dim_type type
, unsigned first
, unsigned n
)
1566 return (isl_basic_set
*)
1567 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1570 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1571 enum isl_dim_type type
, unsigned first
, unsigned n
)
1578 map
= isl_map_cow(map
);
1581 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1583 for (i
= 0; i
< map
->n
; ++i
) {
1584 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1585 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1589 map
= isl_map_drop(map
, type
, first
, n
);
1596 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1597 enum isl_dim_type type
, unsigned first
, unsigned n
)
1599 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1602 /* Project out n inputs starting at first using Fourier-Motzkin */
1603 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1604 unsigned first
, unsigned n
)
1606 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1609 static void dump_term(struct isl_basic_map
*bmap
,
1610 isl_int c
, int pos
, FILE *out
)
1613 unsigned in
= isl_basic_map_n_in(bmap
);
1614 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1615 unsigned nparam
= isl_basic_map_n_param(bmap
);
1617 isl_int_print(out
, c
, 0);
1619 if (!isl_int_is_one(c
))
1620 isl_int_print(out
, c
, 0);
1621 if (pos
< 1 + nparam
) {
1622 name
= isl_dim_get_name(bmap
->dim
,
1623 isl_dim_param
, pos
- 1);
1625 fprintf(out
, "%s", name
);
1627 fprintf(out
, "p%d", pos
- 1);
1628 } else if (pos
< 1 + nparam
+ in
)
1629 fprintf(out
, "i%d", pos
- 1 - nparam
);
1630 else if (pos
< 1 + nparam
+ dim
)
1631 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1633 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1637 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1638 int sign
, FILE *out
)
1642 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1646 for (i
= 0, first
= 1; i
< len
; ++i
) {
1647 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1650 fprintf(out
, " + ");
1652 isl_int_abs(v
, c
[i
]);
1653 dump_term(bmap
, v
, i
, out
);
1660 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1661 const char *op
, FILE *out
, int indent
)
1665 fprintf(out
, "%*s", indent
, "");
1667 dump_constraint_sign(bmap
, c
, 1, out
);
1668 fprintf(out
, " %s ", op
);
1669 dump_constraint_sign(bmap
, c
, -1, out
);
1673 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1674 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1676 fprintf(out
, "%*s", indent
, "");
1677 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1682 static void dump_constraints(struct isl_basic_map
*bmap
,
1683 isl_int
**c
, unsigned n
,
1684 const char *op
, FILE *out
, int indent
)
1688 for (i
= 0; i
< n
; ++i
)
1689 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1692 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1696 unsigned total
= isl_basic_map_total_dim(bmap
);
1698 for (j
= 0; j
< 1 + total
; ++j
) {
1699 if (isl_int_is_zero(exp
[j
]))
1701 if (!first
&& isl_int_is_pos(exp
[j
]))
1703 dump_term(bmap
, exp
[j
], j
, out
);
1708 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1712 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1713 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1715 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1716 fprintf(out
, "%*s", indent
, "");
1717 fprintf(out
, "e%d = [(", i
);
1718 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1720 isl_int_print(out
, bmap
->div
[i
][0], 0);
1721 fprintf(out
, "]\n");
1725 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1728 fprintf(out
, "null basic set\n");
1732 fprintf(out
, "%*s", indent
, "");
1733 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1734 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1735 bset
->extra
, bset
->flags
);
1736 dump((struct isl_basic_map
*)bset
, out
, indent
);
1739 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1742 fprintf(out
, "null basic map\n");
1746 fprintf(out
, "%*s", indent
, "");
1747 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1748 "flags: %x, n_name: %d\n",
1750 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1751 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1752 dump(bmap
, out
, indent
);
1755 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1760 total
= isl_basic_map_total_dim(bmap
);
1761 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1762 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1763 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1764 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1768 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1770 struct isl_set
*set
;
1774 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1775 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1776 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1777 sizeof(struct isl_set
) +
1778 (n
- 1) * sizeof(struct isl_basic_set
*));
1782 set
->ctx
= dim
->ctx
;
1783 isl_ctx_ref(set
->ctx
);
1795 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1796 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1798 struct isl_set
*set
;
1799 struct isl_dim
*dims
;
1801 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1805 set
= isl_set_alloc_dim(dims
, n
, flags
);
1809 /* Make sure "map" has room for at least "n" more basic maps.
1811 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1814 struct isl_map
*grown
= NULL
;
1818 isl_assert(map
->ctx
, n
>= 0, goto error
);
1819 if (map
->n
+ n
<= map
->size
)
1821 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1824 for (i
= 0; i
< map
->n
; ++i
) {
1825 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1833 isl_map_free(grown
);
1838 /* Make sure "set" has room for at least "n" more basic sets.
1840 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1842 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1845 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1848 struct isl_set
*dup
;
1853 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1856 for (i
= 0; i
< set
->n
; ++i
)
1857 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1861 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1863 struct isl_set
*set
;
1868 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1870 isl_basic_set_free(bset
);
1873 return isl_set_add_basic_set(set
, bset
);
1876 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1878 struct isl_map
*map
;
1883 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1885 isl_basic_map_free(bmap
);
1888 return isl_map_add_basic_map(map
, bmap
);
1891 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1892 __isl_take isl_basic_set
*bset
)
1894 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1895 (struct isl_basic_map
*)bset
);
1898 void isl_set_free(struct isl_set
*set
)
1908 isl_ctx_deref(set
->ctx
);
1909 for (i
= 0; i
< set
->n
; ++i
)
1910 isl_basic_set_free(set
->p
[i
]);
1911 isl_dim_free(set
->dim
);
1915 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1920 fprintf(out
, "null set\n");
1924 fprintf(out
, "%*s", indent
, "");
1925 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1926 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1928 for (i
= 0; i
< set
->n
; ++i
) {
1929 fprintf(out
, "%*s", indent
, "");
1930 fprintf(out
, "basic set %d:\n", i
);
1931 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1935 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1940 fprintf(out
, "null map\n");
1944 fprintf(out
, "%*s", indent
, "");
1945 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1946 "flags: %x, n_name: %d\n",
1947 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1948 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1949 for (i
= 0; i
< map
->n
; ++i
) {
1950 fprintf(out
, "%*s", indent
, "");
1951 fprintf(out
, "basic map %d:\n", i
);
1952 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1956 struct isl_basic_map
*isl_basic_map_intersect_domain(
1957 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1959 struct isl_basic_map
*bmap_domain
;
1960 struct isl_dim
*dim
;
1965 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1966 bset
->dim
, isl_dim_param
), goto error
);
1968 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1969 isl_assert(bset
->ctx
,
1970 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1972 bmap
= isl_basic_map_cow(bmap
);
1975 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1976 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1977 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1978 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1979 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1981 bmap
= isl_basic_map_simplify(bmap
);
1982 return isl_basic_map_finalize(bmap
);
1984 isl_basic_map_free(bmap
);
1985 isl_basic_set_free(bset
);
1989 struct isl_basic_map
*isl_basic_map_intersect_range(
1990 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1992 struct isl_basic_map
*bmap_range
;
1997 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1998 bset
->dim
, isl_dim_param
), goto error
);
2000 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2001 isl_assert(bset
->ctx
,
2002 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2004 bmap
= isl_basic_map_cow(bmap
);
2007 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2008 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2009 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2010 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2012 bmap
= isl_basic_map_simplify(bmap
);
2013 return isl_basic_map_finalize(bmap
);
2015 isl_basic_map_free(bmap
);
2016 isl_basic_set_free(bset
);
2020 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2026 total
= 1 + isl_basic_map_total_dim(bmap
);
2027 if (total
!= vec
->size
)
2032 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2033 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2034 if (!isl_int_is_zero(s
)) {
2040 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2041 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2042 if (isl_int_is_neg(s
)) {
2053 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2055 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2058 struct isl_basic_map
*isl_basic_map_intersect(
2059 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2061 struct isl_vec
*sample
= NULL
;
2063 if (!bmap1
|| !bmap2
)
2066 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2067 bmap2
->dim
, isl_dim_param
), goto error
);
2068 if (isl_dim_total(bmap1
->dim
) ==
2069 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2070 isl_dim_total(bmap2
->dim
) !=
2071 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2072 return isl_basic_map_intersect(bmap2
, bmap1
);
2074 if (isl_dim_total(bmap2
->dim
) !=
2075 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2076 isl_assert(bmap1
->ctx
,
2077 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2079 if (bmap1
->sample
&&
2080 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2081 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2082 sample
= isl_vec_copy(bmap1
->sample
);
2083 else if (bmap2
->sample
&&
2084 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2085 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2086 sample
= isl_vec_copy(bmap2
->sample
);
2088 bmap1
= isl_basic_map_cow(bmap1
);
2091 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2092 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2093 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2096 isl_vec_free(sample
);
2098 isl_vec_free(bmap1
->sample
);
2099 bmap1
->sample
= sample
;
2102 bmap1
= isl_basic_map_simplify(bmap1
);
2103 return isl_basic_map_finalize(bmap1
);
2106 isl_vec_free(sample
);
2107 isl_basic_map_free(bmap1
);
2108 isl_basic_map_free(bmap2
);
2112 struct isl_basic_set
*isl_basic_set_intersect(
2113 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2115 return (struct isl_basic_set
*)
2116 isl_basic_map_intersect(
2117 (struct isl_basic_map
*)bset1
,
2118 (struct isl_basic_map
*)bset2
);
2121 /* Special case of isl_map_intersect, where both map1 and map2
2122 * are convex, without any divs and such that either map1 or map2
2123 * contains a single constraint. This constraint is then simply
2124 * added to the other map.
2126 static __isl_give isl_map
*map_intersect_add_constraint(
2127 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2129 struct isl_basic_map
*bmap1
;
2130 struct isl_basic_map
*bmap2
;
2132 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2133 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2134 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2135 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2137 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2138 return isl_map_intersect(map2
, map1
);
2140 isl_assert(map2
->ctx
,
2141 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2143 map1
= isl_map_cow(map1
);
2146 if (isl_map_fast_is_empty(map1
)) {
2150 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2151 if (map2
->p
[0]->n_eq
== 1)
2152 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2154 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2155 map2
->p
[0]->ineq
[0]);
2157 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2158 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2162 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2163 isl_basic_map_free(map1
->p
[0]);
2176 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2179 struct isl_map
*result
;
2185 if (isl_map_fast_is_empty(map1
)) {
2189 if (isl_map_fast_is_empty(map2
)) {
2194 if (map1
->n
== 1 && map2
->n
== 1 &&
2195 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2196 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2197 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2198 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2199 return map_intersect_add_constraint(map1
, map2
);
2200 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2201 map2
->dim
, isl_dim_param
), goto error
);
2202 if (isl_dim_total(map1
->dim
) ==
2203 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2204 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2205 return isl_map_intersect(map2
, map1
);
2207 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2208 isl_assert(map1
->ctx
,
2209 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2211 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2212 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2213 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2215 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2216 map1
->n
* map2
->n
, flags
);
2219 for (i
= 0; i
< map1
->n
; ++i
)
2220 for (j
= 0; j
< map2
->n
; ++j
) {
2221 struct isl_basic_map
*part
;
2222 part
= isl_basic_map_intersect(
2223 isl_basic_map_copy(map1
->p
[i
]),
2224 isl_basic_map_copy(map2
->p
[j
]));
2225 if (isl_basic_map_is_empty(part
))
2226 isl_basic_map_free(part
);
2228 result
= isl_map_add_basic_map(result
, part
);
2241 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2243 return (struct isl_set
*)
2244 isl_map_intersect((struct isl_map
*)set1
,
2245 (struct isl_map
*)set2
);
2248 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2250 struct isl_dim
*dim
;
2251 struct isl_basic_set
*bset
;
2256 bmap
= isl_basic_map_cow(bmap
);
2259 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2260 in
= isl_basic_map_n_in(bmap
);
2261 bset
= isl_basic_set_from_basic_map(bmap
);
2262 bset
= isl_basic_set_swap_vars(bset
, in
);
2263 return isl_basic_map_from_basic_set(bset
, dim
);
2266 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2267 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2269 struct isl_dim
*res_dim
;
2270 struct isl_basic_map
*res
;
2271 struct isl_dim_map
*dim_map
;
2272 unsigned total
, off
;
2273 enum isl_dim_type t
;
2281 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2283 total
= isl_basic_map_total_dim(bmap
) + n
;
2284 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2286 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2288 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2290 unsigned size
= isl_basic_map_dim(bmap
, t
);
2291 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2293 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2294 pos
, size
- pos
, off
+ pos
+ n
);
2296 off
+= isl_dim_size(res_dim
, t
);
2298 isl_dim_map_div(dim_map
, bmap
, off
);
2300 res
= isl_basic_map_alloc_dim(res_dim
,
2301 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2302 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2303 res
= isl_basic_map_simplify(res
);
2304 return isl_basic_map_finalize(res
);
2307 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2308 enum isl_dim_type type
, unsigned n
)
2312 return isl_basic_map_insert(bmap
, type
,
2313 isl_basic_map_dim(bmap
, type
), n
);
2316 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2317 enum isl_dim_type type
, unsigned n
)
2321 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2322 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2324 isl_basic_set_free(bset
);
2328 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2329 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2336 map
= isl_map_cow(map
);
2340 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2344 for (i
= 0; i
< map
->n
; ++i
) {
2345 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2356 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2357 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2359 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2362 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2363 enum isl_dim_type type
, unsigned n
)
2367 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2370 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2371 enum isl_dim_type type
, unsigned n
)
2375 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2376 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2382 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2383 __isl_take isl_basic_map
*bmap
,
2384 enum isl_dim_type dst_type
, unsigned dst_pos
,
2385 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2388 struct isl_dim_map
*dim_map
;
2389 struct isl_basic_map
*res
;
2390 enum isl_dim_type t
;
2391 unsigned total
, off
;
2398 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2401 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2404 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2406 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2407 pos(bmap
->dim
, src_type
) + src_pos
+
2408 ((src_type
< dst_type
) ? n
: 0)) {
2409 bmap
= isl_basic_map_cow(bmap
);
2413 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2414 src_type
, src_pos
, n
);
2418 bmap
= isl_basic_map_finalize(bmap
);
2423 total
= isl_basic_map_total_dim(bmap
);
2424 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2427 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2428 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2429 if (t
== dst_type
) {
2430 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2433 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2436 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2437 dst_pos
, size
- dst_pos
, off
);
2438 off
+= size
- dst_pos
;
2439 } else if (t
== src_type
) {
2440 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2443 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2444 src_pos
+ n
, size
- src_pos
- n
, off
);
2445 off
+= size
- src_pos
- n
;
2447 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2451 isl_dim_map_div(dim_map
, bmap
, off
);
2453 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2454 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2455 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2457 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2458 src_type
, src_pos
, n
);
2462 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2463 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2464 bmap
= isl_basic_map_finalize(bmap
);
2468 isl_basic_map_free(bmap
);
2472 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2473 enum isl_dim_type dst_type
, unsigned dst_pos
,
2474 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2476 return (isl_basic_set
*)isl_basic_map_move_dims(
2477 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2480 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2481 enum isl_dim_type dst_type
, unsigned dst_pos
,
2482 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2486 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2487 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2488 src_type
, src_pos
, n
);
2494 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2495 enum isl_dim_type dst_type
, unsigned dst_pos
,
2496 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2505 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2508 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2511 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2513 map
= isl_map_cow(map
);
2517 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2521 for (i
= 0; i
< map
->n
; ++i
) {
2522 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2524 src_type
, src_pos
, n
);
2535 /* Move the specified dimensions to the last columns right before
2536 * the divs. Don't change the dimension specification of bmap.
2537 * That's the responsibility of the caller.
2539 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2540 enum isl_dim_type type
, unsigned first
, unsigned n
)
2542 struct isl_dim_map
*dim_map
;
2543 struct isl_basic_map
*res
;
2544 enum isl_dim_type t
;
2545 unsigned total
, off
;
2549 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2552 total
= isl_basic_map_total_dim(bmap
);
2553 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2556 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2557 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2559 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2562 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2563 first
, n
, total
- bmap
->n_div
- n
);
2564 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2565 first
+ n
, size
- (first
+ n
), off
);
2566 off
+= size
- (first
+ n
);
2568 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2572 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2574 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2575 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2576 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2580 /* Turn the n dimensions of type type, starting at first
2581 * into existentially quantified variables.
2583 __isl_give isl_basic_map
*isl_basic_map_project_out(
2584 __isl_take isl_basic_map
*bmap
,
2585 enum isl_dim_type type
, unsigned first
, unsigned n
)
2598 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2599 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2601 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2604 bmap
= move_last(bmap
, type
, first
, n
);
2605 bmap
= isl_basic_map_cow(bmap
);
2609 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2610 old
= bmap
->block2
.data
;
2611 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2612 (bmap
->extra
+ n
) * (1 + row_size
));
2613 if (!bmap
->block2
.data
)
2615 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2618 for (i
= 0; i
< n
; ++i
) {
2619 new_div
[i
] = bmap
->block2
.data
+
2620 (bmap
->extra
+ i
) * (1 + row_size
);
2621 isl_seq_clr(new_div
[i
], 1 + row_size
);
2623 for (i
= 0; i
< bmap
->extra
; ++i
)
2624 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2626 bmap
->div
= new_div
;
2630 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2633 bmap
= isl_basic_map_simplify(bmap
);
2634 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2635 return isl_basic_map_finalize(bmap
);
2637 isl_basic_map_free(bmap
);
2641 /* Turn the n dimensions of type type, starting at first
2642 * into existentially quantified variables.
2644 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2645 enum isl_dim_type type
, unsigned first
, unsigned n
)
2647 return (isl_basic_set
*)isl_basic_map_project_out(
2648 (isl_basic_map
*)bset
, type
, first
, n
);
2651 /* Turn the n dimensions of type type, starting at first
2652 * into existentially quantified variables.
2654 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2655 enum isl_dim_type type
, unsigned first
, unsigned n
)
2665 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2667 map
= isl_map_cow(map
);
2671 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2675 for (i
= 0; i
< map
->n
; ++i
) {
2676 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2687 /* Turn the n dimensions of type type, starting at first
2688 * into existentially quantified variables.
2690 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2691 enum isl_dim_type type
, unsigned first
, unsigned n
)
2693 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2696 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2700 for (i
= 0; i
< n
; ++i
) {
2701 j
= isl_basic_map_alloc_div(bmap
);
2704 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2708 isl_basic_map_free(bmap
);
2712 struct isl_basic_map
*isl_basic_map_apply_range(
2713 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2715 struct isl_dim
*dim_result
= NULL
;
2716 struct isl_basic_map
*bmap
;
2717 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2718 struct isl_dim_map
*dim_map1
, *dim_map2
;
2720 if (!bmap1
|| !bmap2
)
2723 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2724 isl_dim_copy(bmap2
->dim
));
2726 n_in
= isl_basic_map_n_in(bmap1
);
2727 n_out
= isl_basic_map_n_out(bmap2
);
2728 n
= isl_basic_map_n_out(bmap1
);
2729 nparam
= isl_basic_map_n_param(bmap1
);
2731 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2732 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2733 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2734 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2735 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2736 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2737 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2738 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2739 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2740 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2741 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2743 bmap
= isl_basic_map_alloc_dim(dim_result
,
2744 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2745 bmap1
->n_eq
+ bmap2
->n_eq
,
2746 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2747 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2748 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2749 bmap
= add_divs(bmap
, n
);
2750 bmap
= isl_basic_map_simplify(bmap
);
2751 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2752 return isl_basic_map_finalize(bmap
);
2754 isl_basic_map_free(bmap1
);
2755 isl_basic_map_free(bmap2
);
2759 struct isl_basic_set
*isl_basic_set_apply(
2760 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2765 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2768 return (struct isl_basic_set
*)
2769 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2771 isl_basic_set_free(bset
);
2772 isl_basic_map_free(bmap
);
2776 struct isl_basic_map
*isl_basic_map_apply_domain(
2777 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2779 if (!bmap1
|| !bmap2
)
2782 isl_assert(bmap1
->ctx
,
2783 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2784 isl_assert(bmap1
->ctx
,
2785 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2788 bmap1
= isl_basic_map_reverse(bmap1
);
2789 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2790 return isl_basic_map_reverse(bmap1
);
2792 isl_basic_map_free(bmap1
);
2793 isl_basic_map_free(bmap2
);
2797 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2798 * A \cap B -> f(A) + f(B)
2800 struct isl_basic_map
*isl_basic_map_sum(
2801 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2803 unsigned n_in
, n_out
, nparam
, total
, pos
;
2804 struct isl_basic_map
*bmap
= NULL
;
2805 struct isl_dim_map
*dim_map1
, *dim_map2
;
2808 if (!bmap1
|| !bmap2
)
2811 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2814 nparam
= isl_basic_map_n_param(bmap1
);
2815 n_in
= isl_basic_map_n_in(bmap1
);
2816 n_out
= isl_basic_map_n_out(bmap1
);
2818 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2819 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2820 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2821 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2822 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2823 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2824 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2825 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2826 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2827 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2828 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2830 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2831 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2832 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2833 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2834 for (i
= 0; i
< n_out
; ++i
) {
2835 int j
= isl_basic_map_alloc_equality(bmap
);
2838 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2839 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2840 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2841 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2843 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2844 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2845 bmap
= add_divs(bmap
, 2 * n_out
);
2847 bmap
= isl_basic_map_simplify(bmap
);
2848 return isl_basic_map_finalize(bmap
);
2850 isl_basic_map_free(bmap
);
2851 isl_basic_map_free(bmap1
);
2852 isl_basic_map_free(bmap2
);
2856 /* Given two maps A -> f(A) and B -> g(B), construct a map
2857 * A \cap B -> f(A) + f(B)
2859 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2861 struct isl_map
*result
;
2867 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2869 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2870 map1
->n
* map2
->n
, 0);
2873 for (i
= 0; i
< map1
->n
; ++i
)
2874 for (j
= 0; j
< map2
->n
; ++j
) {
2875 struct isl_basic_map
*part
;
2876 part
= isl_basic_map_sum(
2877 isl_basic_map_copy(map1
->p
[i
]),
2878 isl_basic_map_copy(map2
->p
[j
]));
2879 if (isl_basic_map_is_empty(part
))
2880 isl_basic_map_free(part
);
2882 result
= isl_map_add_basic_map(result
, part
);
2895 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2896 __isl_take isl_set
*set2
)
2898 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2901 /* Given a basic map A -> f(A), construct A -> -f(A).
2903 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2908 bmap
= isl_basic_map_cow(bmap
);
2912 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2913 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2914 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2915 for (j
= 0; j
< n
; ++j
)
2916 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2917 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2918 for (j
= 0; j
< n
; ++j
)
2919 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2920 for (i
= 0; i
< bmap
->n_div
; ++i
)
2921 for (j
= 0; j
< n
; ++j
)
2922 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2923 return isl_basic_map_finalize(bmap
);
2926 /* Given a map A -> f(A), construct A -> -f(A).
2928 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2932 map
= isl_map_cow(map
);
2936 for (i
= 0; i
< map
->n
; ++i
) {
2937 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2948 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2950 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2953 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2954 * A -> floor(f(A)/d).
2956 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2959 unsigned n_in
, n_out
, nparam
, total
, pos
;
2960 struct isl_basic_map
*result
= NULL
;
2961 struct isl_dim_map
*dim_map
;
2967 nparam
= isl_basic_map_n_param(bmap
);
2968 n_in
= isl_basic_map_n_in(bmap
);
2969 n_out
= isl_basic_map_n_out(bmap
);
2971 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2972 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2973 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2974 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2975 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2976 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2978 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2979 bmap
->n_div
+ n_out
,
2980 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2981 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2982 result
= add_divs(result
, n_out
);
2983 for (i
= 0; i
< n_out
; ++i
) {
2985 j
= isl_basic_map_alloc_inequality(result
);
2988 isl_seq_clr(result
->ineq
[j
], 1+total
);
2989 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2990 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2991 j
= isl_basic_map_alloc_inequality(result
);
2994 isl_seq_clr(result
->ineq
[j
], 1+total
);
2995 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2996 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2997 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3000 result
= isl_basic_map_simplify(result
);
3001 return isl_basic_map_finalize(result
);
3003 isl_basic_map_free(result
);
3007 /* Given a map A -> f(A) and an integer d, construct a map
3008 * A -> floor(f(A)/d).
3010 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3014 map
= isl_map_cow(map
);
3018 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3019 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3020 for (i
= 0; i
< map
->n
; ++i
) {
3021 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3032 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3038 i
= isl_basic_map_alloc_equality(bmap
);
3041 nparam
= isl_basic_map_n_param(bmap
);
3042 n_in
= isl_basic_map_n_in(bmap
);
3043 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3044 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3045 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3046 return isl_basic_map_finalize(bmap
);
3048 isl_basic_map_free(bmap
);
3052 /* Add a constraints to "bmap" expressing i_pos < o_pos
3054 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3060 i
= isl_basic_map_alloc_inequality(bmap
);
3063 nparam
= isl_basic_map_n_param(bmap
);
3064 n_in
= isl_basic_map_n_in(bmap
);
3065 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3066 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3067 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3068 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3069 return isl_basic_map_finalize(bmap
);
3071 isl_basic_map_free(bmap
);
3075 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3077 static __isl_give isl_basic_map
*var_less_or_equal(
3078 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3084 i
= isl_basic_map_alloc_inequality(bmap
);
3087 nparam
= isl_basic_map_n_param(bmap
);
3088 n_in
= isl_basic_map_n_in(bmap
);
3089 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3090 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3091 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3092 return isl_basic_map_finalize(bmap
);
3094 isl_basic_map_free(bmap
);
3098 /* Add a constraints to "bmap" expressing i_pos > o_pos
3100 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3106 i
= isl_basic_map_alloc_inequality(bmap
);
3109 nparam
= isl_basic_map_n_param(bmap
);
3110 n_in
= isl_basic_map_n_in(bmap
);
3111 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3112 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3113 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3114 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3115 return isl_basic_map_finalize(bmap
);
3117 isl_basic_map_free(bmap
);
3121 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3123 static __isl_give isl_basic_map
*var_more_or_equal(
3124 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3130 i
= isl_basic_map_alloc_inequality(bmap
);
3133 nparam
= isl_basic_map_n_param(bmap
);
3134 n_in
= isl_basic_map_n_in(bmap
);
3135 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3136 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3137 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3138 return isl_basic_map_finalize(bmap
);
3140 isl_basic_map_free(bmap
);
3144 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3147 struct isl_basic_map
*bmap
;
3148 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3151 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3152 bmap
= var_equal(bmap
, i
);
3153 return isl_basic_map_finalize(bmap
);
3156 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3158 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3161 struct isl_basic_map
*bmap
;
3162 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3165 for (i
= 0; i
< pos
&& bmap
; ++i
)
3166 bmap
= var_equal(bmap
, i
);
3168 bmap
= var_less(bmap
, pos
);
3169 return isl_basic_map_finalize(bmap
);
3172 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3174 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3175 __isl_take isl_dim
*dim
, unsigned pos
)
3178 isl_basic_map
*bmap
;
3180 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3181 for (i
= 0; i
< pos
; ++i
)
3182 bmap
= var_equal(bmap
, i
);
3183 bmap
= var_less_or_equal(bmap
, pos
);
3184 return isl_basic_map_finalize(bmap
);
3187 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3189 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3192 struct isl_basic_map
*bmap
;
3193 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3196 for (i
= 0; i
< pos
&& bmap
; ++i
)
3197 bmap
= var_equal(bmap
, i
);
3199 bmap
= var_more(bmap
, pos
);
3200 return isl_basic_map_finalize(bmap
);
3203 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3205 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3206 __isl_take isl_dim
*dim
, unsigned pos
)
3209 isl_basic_map
*bmap
;
3211 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3212 for (i
= 0; i
< pos
; ++i
)
3213 bmap
= var_equal(bmap
, i
);
3214 bmap
= var_more_or_equal(bmap
, pos
);
3215 return isl_basic_map_finalize(bmap
);
3218 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3219 unsigned n
, int equal
)
3221 struct isl_map
*map
;
3224 if (n
== 0 && equal
)
3225 return isl_map_universe(dims
);
3227 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3229 for (i
= 0; i
+ 1 < n
; ++i
)
3230 map
= isl_map_add_basic_map(map
,
3231 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3234 map
= isl_map_add_basic_map(map
,
3235 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3237 map
= isl_map_add_basic_map(map
,
3238 isl_basic_map_less_at(dims
, n
- 1));
3245 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3249 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3252 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3254 return map_lex_lte_first(dim
, n
, 0);
3257 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3259 return map_lex_lte_first(dim
, n
, 1);
3262 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3264 return map_lex_lte(isl_dim_map(set_dim
), 0);
3267 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3269 return map_lex_lte(isl_dim_map(set_dim
), 1);
3272 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3273 unsigned n
, int equal
)
3275 struct isl_map
*map
;
3278 if (n
== 0 && equal
)
3279 return isl_map_universe(dims
);
3281 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3283 for (i
= 0; i
+ 1 < n
; ++i
)
3284 map
= isl_map_add_basic_map(map
,
3285 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3288 map
= isl_map_add_basic_map(map
,
3289 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3291 map
= isl_map_add_basic_map(map
,
3292 isl_basic_map_more_at(dims
, n
- 1));
3299 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3303 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3306 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3308 return map_lex_gte_first(dim
, n
, 0);
3311 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3313 return map_lex_gte_first(dim
, n
, 1);
3316 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3318 return map_lex_gte(isl_dim_map(set_dim
), 0);
3321 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3323 return map_lex_gte(isl_dim_map(set_dim
), 1);
3326 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3327 __isl_take isl_set
*set2
)
3330 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3331 map
= isl_map_intersect_domain(map
, set1
);
3332 map
= isl_map_intersect_range(map
, set2
);
3336 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3337 __isl_take isl_set
*set2
)
3340 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3341 map
= isl_map_intersect_domain(map
, set1
);
3342 map
= isl_map_intersect_range(map
, set2
);
3346 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3347 __isl_take isl_set
*set2
)
3350 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3351 map
= isl_map_intersect_domain(map
, set1
);
3352 map
= isl_map_intersect_range(map
, set2
);
3356 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3357 __isl_take isl_set
*set2
)
3360 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3361 map
= isl_map_intersect_domain(map
, set1
);
3362 map
= isl_map_intersect_range(map
, set2
);
3366 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3367 __isl_take isl_map
*map2
)
3370 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3371 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3372 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3376 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3377 __isl_take isl_map
*map2
)
3380 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3381 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3382 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3386 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3387 __isl_take isl_map
*map2
)
3390 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3391 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3392 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3396 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3397 __isl_take isl_map
*map2
)
3400 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3401 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3402 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3406 struct isl_basic_map
*isl_basic_map_from_basic_set(
3407 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3409 struct isl_basic_map
*bmap
;
3411 bset
= isl_basic_set_cow(bset
);
3415 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3416 isl_dim_free(bset
->dim
);
3417 bmap
= (struct isl_basic_map
*) bset
;
3419 return isl_basic_map_finalize(bmap
);
3421 isl_basic_set_free(bset
);
3426 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3430 if (bmap
->dim
->n_in
== 0)
3431 return (struct isl_basic_set
*)bmap
;
3432 bmap
= isl_basic_map_cow(bmap
);
3435 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3438 bmap
= isl_basic_map_finalize(bmap
);
3439 return (struct isl_basic_set
*)bmap
;
3441 isl_basic_map_free(bmap
);
3445 /* For a div d = floor(f/m), add the constraints
3448 * -(f-(n-1)) + m d >= 0
3450 * Note that the second constraint is the negation of
3454 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3455 unsigned pos
, isl_int
*div
)
3458 unsigned total
= isl_basic_map_total_dim(bmap
);
3460 i
= isl_basic_map_alloc_inequality(bmap
);
3463 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3464 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3466 j
= isl_basic_map_alloc_inequality(bmap
);
3469 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3470 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3471 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3475 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3476 unsigned pos
, isl_int
*div
)
3478 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3482 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3484 unsigned total
= isl_basic_map_total_dim(bmap
);
3485 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3487 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3491 struct isl_basic_set
*isl_basic_map_underlying_set(
3492 struct isl_basic_map
*bmap
)
3496 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3498 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3499 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3500 return (struct isl_basic_set
*)bmap
;
3501 bmap
= isl_basic_map_cow(bmap
);
3504 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3507 bmap
->extra
-= bmap
->n_div
;
3509 bmap
= isl_basic_map_finalize(bmap
);
3510 return (struct isl_basic_set
*)bmap
;
3515 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3516 __isl_take isl_basic_set
*bset
)
3518 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3521 struct isl_basic_map
*isl_basic_map_overlying_set(
3522 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3524 struct isl_basic_map
*bmap
;
3525 struct isl_ctx
*ctx
;
3532 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3533 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3534 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3536 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3537 isl_basic_map_free(like
);
3538 return (struct isl_basic_map
*)bset
;
3540 bset
= isl_basic_set_cow(bset
);
3543 total
= bset
->dim
->n_out
+ bset
->extra
;
3544 bmap
= (struct isl_basic_map
*)bset
;
3545 isl_dim_free(bmap
->dim
);
3546 bmap
->dim
= isl_dim_copy(like
->dim
);
3549 bmap
->n_div
= like
->n_div
;
3550 bmap
->extra
+= like
->n_div
;
3553 ltotal
= total
- bmap
->extra
+ like
->extra
;
3556 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3557 bmap
->extra
* (1 + 1 + total
));
3558 if (isl_blk_is_error(bmap
->block2
))
3560 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3564 for (i
= 0; i
< bmap
->extra
; ++i
)
3565 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3566 for (i
= 0; i
< like
->n_div
; ++i
) {
3567 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3568 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3570 bmap
= isl_basic_map_extend_constraints(bmap
,
3571 0, 2 * like
->n_div
);
3572 for (i
= 0; i
< like
->n_div
; ++i
) {
3573 if (isl_int_is_zero(bmap
->div
[i
][0]))
3575 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3579 isl_basic_map_free(like
);
3580 bmap
= isl_basic_map_simplify(bmap
);
3581 bmap
= isl_basic_map_finalize(bmap
);
3584 isl_basic_map_free(like
);
3585 isl_basic_set_free(bset
);
3589 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3590 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3592 return (struct isl_basic_set
*)
3593 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3596 struct isl_set
*isl_set_from_underlying_set(
3597 struct isl_set
*set
, struct isl_basic_set
*like
)
3603 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3605 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3606 isl_basic_set_free(like
);
3609 set
= isl_set_cow(set
);
3612 for (i
= 0; i
< set
->n
; ++i
) {
3613 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3614 isl_basic_set_copy(like
));
3618 isl_dim_free(set
->dim
);
3619 set
->dim
= isl_dim_copy(like
->dim
);
3622 isl_basic_set_free(like
);
3625 isl_basic_set_free(like
);
3630 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3634 map
= isl_map_cow(map
);
3637 map
->dim
= isl_dim_cow(map
->dim
);
3641 for (i
= 1; i
< map
->n
; ++i
)
3642 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3644 for (i
= 0; i
< map
->n
; ++i
) {
3645 map
->p
[i
] = (struct isl_basic_map
*)
3646 isl_basic_map_underlying_set(map
->p
[i
]);
3651 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3653 isl_dim_free(map
->dim
);
3654 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3658 return (struct isl_set
*)map
;
3664 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3666 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3669 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3670 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3672 bmap
= isl_basic_map_cow(bmap
);
3676 isl_dim_free(bmap
->dim
);
3679 bmap
= isl_basic_map_finalize(bmap
);
3683 isl_basic_map_free(bmap
);
3688 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3689 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3691 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3695 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3696 __isl_take isl_dim
*dim
)
3700 map
= isl_map_cow(map
);
3704 for (i
= 0; i
< map
->n
; ++i
) {
3705 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3710 isl_dim_free(map
->dim
);
3720 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3721 __isl_take isl_dim
*dim
)
3723 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3726 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3729 struct isl_basic_set
*domain
;
3735 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3737 n_in
= isl_basic_map_n_in(bmap
);
3738 n_out
= isl_basic_map_n_out(bmap
);
3739 domain
= isl_basic_set_from_basic_map(bmap
);
3740 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3742 domain
= isl_basic_set_reset_dim(domain
, dim
);
3747 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3749 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3752 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3753 __isl_take isl_basic_map
*bmap
)
3757 isl_basic_map
*domain
;
3758 isl_basic_set
*bset
;
3759 int nparam
, n_in
, n_out
;
3762 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3763 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3764 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3766 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3767 domain
= isl_basic_map_universe(dim
);
3769 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3770 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3771 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3773 total
= isl_basic_map_total_dim(bmap
);
3775 for (i
= 0; i
< n_in
; ++i
) {
3776 k
= isl_basic_map_alloc_equality(bmap
);
3779 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3780 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3781 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3784 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3785 return isl_basic_map_finalize(bmap
);
3787 isl_basic_map_free(bmap
);
3791 __isl_give isl_basic_map
*isl_basic_map_range_map(
3792 __isl_take isl_basic_map
*bmap
)
3796 isl_basic_map
*range
;
3797 isl_basic_set
*bset
;
3798 int nparam
, n_in
, n_out
;
3801 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3802 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3803 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3805 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3806 range
= isl_basic_map_universe(dim
);
3808 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3809 bmap
= isl_basic_map_apply_range(bmap
, range
);
3810 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3812 total
= isl_basic_map_total_dim(bmap
);
3814 for (i
= 0; i
< n_out
; ++i
) {
3815 k
= isl_basic_map_alloc_equality(bmap
);
3818 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3819 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3820 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3823 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3824 return isl_basic_map_finalize(bmap
);
3826 isl_basic_map_free(bmap
);
3830 struct isl_set
*isl_map_range(struct isl_map
*map
)
3833 struct isl_set
*set
;
3837 if (isl_map_dim(map
, isl_dim_in
) == 0)
3838 return (isl_set
*)map
;
3840 map
= isl_map_cow(map
);
3844 set
= (struct isl_set
*) map
;
3845 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3848 for (i
= 0; i
< map
->n
; ++i
) {
3849 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3853 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3854 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3861 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3864 isl_dim
*domain_dim
;
3866 map
= isl_map_cow(map
);
3870 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3871 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3872 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3875 for (i
= 0; i
< map
->n
; ++i
) {
3876 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3880 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3881 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3888 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3893 map
= isl_map_cow(map
);
3897 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3898 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3899 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3902 for (i
= 0; i
< map
->n
; ++i
) {
3903 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3907 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3908 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3915 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3918 struct isl_map
*map
= NULL
;
3920 set
= isl_set_cow(set
);
3923 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3924 map
= (struct isl_map
*)set
;
3925 for (i
= 0; i
< set
->n
; ++i
) {
3926 map
->p
[i
] = isl_basic_map_from_basic_set(
3927 set
->p
[i
], isl_dim_copy(dim
));
3931 isl_dim_free(map
->dim
);
3940 __isl_give isl_basic_map
*isl_basic_map_from_domain(
3941 __isl_take isl_basic_set
*bset
)
3943 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
3946 __isl_give isl_basic_map
*isl_basic_map_from_range(
3947 __isl_take isl_basic_set
*bset
)
3949 return (isl_basic_map
*)bset
;
3952 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3954 return (struct isl_map
*)set
;
3957 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3959 return isl_map_reverse(isl_map_from_range(set
));
3962 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3963 __isl_take isl_set
*range
)
3965 return isl_map_apply_range(isl_map_from_domain(domain
),
3966 isl_map_from_range(range
));
3969 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3972 struct isl_set
*set
= NULL
;
3976 map
= isl_map_cow(map
);
3979 map
->dim
= isl_dim_as_set_dim(map
->dim
);
3982 set
= (struct isl_set
*)map
;
3983 for (i
= 0; i
< map
->n
; ++i
) {
3984 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3994 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3996 struct isl_map
*map
;
4000 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4001 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4002 sizeof(struct isl_map
) +
4003 (n
- 1) * sizeof(struct isl_basic_map
*));
4007 map
->ctx
= dim
->ctx
;
4008 isl_ctx_ref(map
->ctx
);
4020 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4021 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4024 struct isl_map
*map
;
4025 struct isl_dim
*dims
;
4027 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4031 map
= isl_map_alloc_dim(dims
, n
, flags
);
4035 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4037 struct isl_basic_map
*bmap
;
4038 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4039 bmap
= isl_basic_map_set_to_empty(bmap
);
4043 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4045 struct isl_basic_set
*bset
;
4046 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4047 bset
= isl_basic_set_set_to_empty(bset
);
4051 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4053 struct isl_basic_map
*bmap
;
4056 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4057 bmap
= isl_basic_map_set_to_empty(bmap
);
4061 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4063 struct isl_basic_map
*bmap
;
4066 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4067 bmap
= isl_basic_map_set_to_empty(bmap
);
4071 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4073 struct isl_basic_set
*bset
;
4076 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4077 bset
= isl_basic_set_set_to_empty(bset
);
4081 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4083 struct isl_basic_map
*bmap
;
4084 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4085 bmap
= isl_basic_map_finalize(bmap
);
4089 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4091 struct isl_basic_set
*bset
;
4092 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4093 bset
= isl_basic_set_finalize(bset
);
4097 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4098 __isl_keep isl_basic_map
*model
)
4102 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4105 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4109 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4112 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4113 __isl_keep isl_set
*model
)
4117 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4120 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4122 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4125 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4129 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4132 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4136 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4139 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4141 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4144 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4148 return isl_set_empty(isl_dim_copy(model
->dim
));
4151 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4153 struct isl_map
*map
;
4156 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4157 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4161 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4163 struct isl_set
*set
;
4166 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4167 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4171 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4175 return isl_set_universe(isl_dim_copy(model
->dim
));
4178 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4181 struct isl_map
*dup
;
4185 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4186 for (i
= 0; i
< map
->n
; ++i
)
4187 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4191 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4192 __isl_take isl_basic_map
*bmap
)
4196 if (isl_basic_map_fast_is_empty(bmap
)) {
4197 isl_basic_map_free(bmap
);
4200 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4201 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4202 map
->p
[map
->n
] = bmap
;
4204 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4210 isl_basic_map_free(bmap
);
4214 void isl_map_free(struct isl_map
*map
)
4224 isl_ctx_deref(map
->ctx
);
4225 for (i
= 0; i
< map
->n
; ++i
)
4226 isl_basic_map_free(map
->p
[i
]);
4227 isl_dim_free(map
->dim
);
4231 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4232 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4236 base
= isl_map_cow(base
);
4240 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4243 for (i
= 0; i
< base
->n
; ++i
) {
4244 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4245 isl_dim_copy(base
->dim
), 0, 0, 0);
4255 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4256 unsigned nparam
, unsigned dim
)
4258 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4262 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4263 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4267 bmap
= isl_basic_map_cow(bmap
);
4268 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4269 j
= isl_basic_map_alloc_equality(bmap
);
4272 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4273 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4274 isl_int_set_si(bmap
->eq
[j
][0], value
);
4275 bmap
= isl_basic_map_simplify(bmap
);
4276 return isl_basic_map_finalize(bmap
);
4278 isl_basic_map_free(bmap
);
4282 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4283 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4287 bmap
= isl_basic_map_cow(bmap
);
4288 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4289 j
= isl_basic_map_alloc_equality(bmap
);
4292 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4293 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4294 isl_int_set(bmap
->eq
[j
][0], value
);
4295 bmap
= isl_basic_map_simplify(bmap
);
4296 return isl_basic_map_finalize(bmap
);
4298 isl_basic_map_free(bmap
);
4302 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4303 enum isl_dim_type type
, unsigned pos
, int value
)
4307 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4308 return isl_basic_map_fix_pos_si(bmap
,
4309 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4311 isl_basic_map_free(bmap
);
4315 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4316 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4320 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4321 return isl_basic_map_fix_pos(bmap
,
4322 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4324 isl_basic_map_free(bmap
);
4328 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4329 enum isl_dim_type type
, unsigned pos
, int value
)
4331 return (struct isl_basic_set
*)
4332 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4336 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4337 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4339 return (struct isl_basic_set
*)
4340 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4344 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4345 unsigned input
, int value
)
4347 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4350 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4351 unsigned dim
, int value
)
4353 return (struct isl_basic_set
*)
4354 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4355 isl_dim_set
, dim
, value
);
4358 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4359 enum isl_dim_type type
, unsigned pos
, int value
)
4363 map
= isl_map_cow(map
);
4367 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4368 for (i
= 0; i
< map
->n
; ++i
) {
4369 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4373 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4380 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4381 enum isl_dim_type type
, unsigned pos
, int value
)
4383 return (struct isl_set
*)
4384 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4387 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4388 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4392 map
= isl_map_cow(map
);
4396 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4397 for (i
= 0; i
< map
->n
; ++i
) {
4398 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4402 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4409 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4410 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4412 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4415 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4416 unsigned input
, int value
)
4418 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4421 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4423 return (struct isl_set
*)
4424 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4427 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4428 __isl_take isl_basic_map
*bmap
,
4429 enum isl_dim_type type
, unsigned pos
, int value
)
4435 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4436 pos
+= isl_basic_map_offset(bmap
, type
);
4437 bmap
= isl_basic_map_cow(bmap
);
4438 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4439 j
= isl_basic_map_alloc_inequality(bmap
);
4442 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4443 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4444 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4445 bmap
= isl_basic_map_simplify(bmap
);
4446 return isl_basic_map_finalize(bmap
);
4448 isl_basic_map_free(bmap
);
4452 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4453 unsigned dim
, isl_int value
)
4457 bset
= isl_basic_set_cow(bset
);
4458 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4459 j
= isl_basic_set_alloc_inequality(bset
);
4462 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4463 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4464 isl_int_neg(bset
->ineq
[j
][0], value
);
4465 bset
= isl_basic_set_simplify(bset
);
4466 return isl_basic_set_finalize(bset
);
4468 isl_basic_set_free(bset
);
4472 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4473 enum isl_dim_type type
, unsigned pos
, int value
)
4477 map
= isl_map_cow(map
);
4481 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4482 for (i
= 0; i
< map
->n
; ++i
) {
4483 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4488 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4495 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4496 enum isl_dim_type type
, unsigned pos
, int value
)
4498 return (struct isl_set
*)
4499 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4502 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4507 set
= isl_set_cow(set
);
4511 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4512 for (i
= 0; i
< set
->n
; ++i
) {
4513 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4523 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4527 map
= isl_map_cow(map
);
4531 map
->dim
= isl_dim_reverse(map
->dim
);
4534 for (i
= 0; i
< map
->n
; ++i
) {
4535 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4539 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4546 static struct isl_map
*isl_basic_map_partial_lexopt(
4547 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4548 struct isl_set
**empty
, int max
)
4552 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4553 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4555 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4557 isl_basic_map_free(bmap
);
4558 isl_basic_set_free(dom
);
4564 struct isl_map
*isl_basic_map_partial_lexmax(
4565 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4566 struct isl_set
**empty
)
4568 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4571 struct isl_map
*isl_basic_map_partial_lexmin(
4572 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4573 struct isl_set
**empty
)
4575 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4578 struct isl_set
*isl_basic_set_partial_lexmin(
4579 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4580 struct isl_set
**empty
)
4582 return (struct isl_set
*)
4583 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4587 struct isl_set
*isl_basic_set_partial_lexmax(
4588 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4589 struct isl_set
**empty
)
4591 return (struct isl_set
*)
4592 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4596 /* Given a basic map "bmap", compute the lexicograhically minimal
4597 * (or maximal) image element for each domain element in dom.
4598 * Set *empty to those elements in dom that do not have an image element.
4600 * We first make sure the basic sets in dom are disjoint and then
4601 * simply collect the results over each of the basic sets separately.
4602 * We could probably improve the efficiency a bit by moving the union
4603 * domain down into the parametric integer programming.
4605 static __isl_give isl_map
*basic_map_partial_lexopt(
4606 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4607 __isl_give isl_set
**empty
, int max
)
4610 struct isl_map
*res
;
4612 dom
= isl_set_make_disjoint(dom
);
4616 if (isl_set_fast_is_empty(dom
)) {
4617 res
= isl_map_empty_like_basic_map(bmap
);
4618 *empty
= isl_set_empty_like(dom
);
4620 isl_basic_map_free(bmap
);
4624 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4625 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4627 for (i
= 1; i
< dom
->n
; ++i
) {
4628 struct isl_map
*res_i
;
4629 struct isl_set
*empty_i
;
4631 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4632 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4634 res
= isl_map_union_disjoint(res
, res_i
);
4635 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4639 isl_basic_map_free(bmap
);
4644 isl_basic_map_free(bmap
);
4648 /* Given a map "map", compute the lexicograhically minimal
4649 * (or maximal) image element for each domain element in dom.
4650 * Set *empty to those elements in dom that do not have an image element.
4652 * We first compute the lexicographically minimal or maximal element
4653 * in the first basic map. This results in a partial solution "res"
4654 * and a subset "todo" of dom that still need to be handled.
4655 * We then consider each of the remaining maps in "map" and successively
4656 * improve both "res" and "todo".
4658 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4659 * Assume we are computing the lexicographical maximum.
4660 * We first intersect basic map i with a relation that maps elements
4661 * to elements that are lexicographically larger than the image elements
4662 * in res^k and the compute the maximum image element of this intersection.
4663 * The result ("better") corresponds to those image elements in basic map i
4664 * that are better than what we had before. The remainder ("keep") are the
4665 * domain elements for which the image element in res_k was better.
4666 * We also compute the lexicographical maximum of basic map i in todo^k.
4667 * res^i is the result of the operation + better + those elements in
4668 * res^k that we should keep
4669 * todo^i is the remainder of the maximum operation on todo^k.
4671 static __isl_give isl_map
*isl_map_partial_lexopt(
4672 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4673 __isl_give isl_set
**empty
, int max
)
4676 struct isl_map
*res
;
4677 struct isl_set
*todo
;
4682 if (isl_map_fast_is_empty(map
)) {
4690 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4691 isl_set_copy(dom
), &todo
, max
);
4693 for (i
= 1; i
< map
->n
; ++i
) {
4695 struct isl_map
*better
;
4696 struct isl_set
*keep
;
4697 struct isl_map
*res_i
;
4698 struct isl_set
*todo_i
;
4699 struct isl_dim
*dim
= isl_map_get_dim(res
);
4701 dim
= isl_dim_range(dim
);
4703 lt
= isl_map_lex_lt(dim
);
4705 lt
= isl_map_lex_gt(dim
);
4706 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4707 lt
= isl_map_intersect(lt
,
4708 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4709 better
= isl_map_partial_lexopt(lt
,
4710 isl_map_domain(isl_map_copy(res
)),
4713 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4714 todo
, &todo_i
, max
);
4716 res
= isl_map_intersect_domain(res
, keep
);
4717 res
= isl_map_union_disjoint(res
, res_i
);
4718 res
= isl_map_union_disjoint(res
, better
);
4739 __isl_give isl_map
*isl_map_partial_lexmax(
4740 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4741 __isl_give isl_set
**empty
)
4743 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4746 __isl_give isl_map
*isl_map_partial_lexmin(
4747 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4748 __isl_give isl_set
**empty
)
4750 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4753 __isl_give isl_set
*isl_set_partial_lexmin(
4754 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4755 __isl_give isl_set
**empty
)
4757 return (struct isl_set
*)
4758 isl_map_partial_lexmin((struct isl_map
*)set
,
4762 __isl_give isl_set
*isl_set_partial_lexmax(
4763 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4764 __isl_give isl_set
**empty
)
4766 return (struct isl_set
*)
4767 isl_map_partial_lexmax((struct isl_map
*)set
,
4771 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4773 struct isl_basic_set
*dom
= NULL
;
4774 struct isl_dim
*dom_dim
;
4778 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4779 dom
= isl_basic_set_universe(dom_dim
);
4780 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4782 isl_basic_map_free(bmap
);
4786 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4788 return isl_basic_map_lexopt(bmap
, 0);
4791 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4793 return isl_basic_map_lexopt(bmap
, 1);
4796 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4798 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4801 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4803 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4806 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4808 struct isl_set
*dom
= NULL
;
4809 struct isl_dim
*dom_dim
;
4813 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4814 dom
= isl_set_universe(dom_dim
);
4815 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4821 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4823 return isl_map_lexopt(map
, 0);
4826 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4828 return isl_map_lexopt(map
, 1);
4831 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4833 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4836 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4838 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4841 /* Apply a preimage specified by "mat" on the parameters of "bset".
4842 * bset is assumed to have only parameters and divs.
4844 static struct isl_basic_set
*basic_set_parameter_preimage(
4845 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4852 bset
->dim
= isl_dim_cow(bset
->dim
);
4856 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4858 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4860 bset
->dim
->nparam
= 0;
4861 bset
->dim
->n_out
= nparam
;
4862 bset
= isl_basic_set_preimage(bset
, mat
);
4864 bset
->dim
->nparam
= bset
->dim
->n_out
;
4865 bset
->dim
->n_out
= 0;
4870 isl_basic_set_free(bset
);
4874 /* Apply a preimage specified by "mat" on the parameters of "set".
4875 * set is assumed to have only parameters and divs.
4877 static struct isl_set
*set_parameter_preimage(
4878 struct isl_set
*set
, struct isl_mat
*mat
)
4880 struct isl_dim
*dim
= NULL
;
4886 dim
= isl_dim_copy(set
->dim
);
4887 dim
= isl_dim_cow(dim
);
4891 nparam
= isl_set_dim(set
, isl_dim_param
);
4893 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4896 dim
->n_out
= nparam
;
4897 isl_set_reset_dim(set
, dim
);
4898 set
= isl_set_preimage(set
, mat
);
4901 dim
= isl_dim_copy(set
->dim
);
4902 dim
= isl_dim_cow(dim
);
4905 dim
->nparam
= dim
->n_out
;
4907 isl_set_reset_dim(set
, dim
);
4917 /* Intersect the basic set "bset" with the affine space specified by the
4918 * equalities in "eq".
4920 static struct isl_basic_set
*basic_set_append_equalities(
4921 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4929 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4934 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4935 for (i
= 0; i
< eq
->n_row
; ++i
) {
4936 k
= isl_basic_set_alloc_equality(bset
);
4939 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4940 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4944 bset
= isl_basic_set_gauss(bset
, NULL
);
4945 bset
= isl_basic_set_finalize(bset
);
4950 isl_basic_set_free(bset
);
4954 /* Intersect the set "set" with the affine space specified by the
4955 * equalities in "eq".
4957 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4965 for (i
= 0; i
< set
->n
; ++i
) {
4966 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4979 /* Project the given basic set onto its parameter domain, possibly introducing
4980 * new, explicit, existential variables in the constraints.
4981 * The input has parameters and (possibly implicit) existential variables.
4982 * The output has the same parameters, but only
4983 * explicit existentially quantified variables.
4985 * The actual projection is performed by pip, but pip doesn't seem
4986 * to like equalities very much, so we first remove the equalities
4987 * among the parameters by performing a variable compression on
4988 * the parameters. Afterward, an inverse transformation is performed
4989 * and the equalities among the parameters are inserted back in.
4991 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4995 struct isl_mat
*T
, *T2
;
4996 struct isl_set
*set
;
4997 unsigned nparam
, n_div
;
4999 bset
= isl_basic_set_cow(bset
);
5003 if (bset
->n_eq
== 0)
5004 return isl_basic_set_lexmin(bset
);
5006 isl_basic_set_gauss(bset
, NULL
);
5008 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5009 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5011 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5012 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5015 if (i
== bset
->n_eq
)
5016 return isl_basic_set_lexmin(bset
);
5018 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5020 eq
= isl_mat_cow(eq
);
5021 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5022 if (T
&& T
->n_col
== 0) {
5026 bset
= isl_basic_set_set_to_empty(bset
);
5027 return isl_set_from_basic_set(bset
);
5029 bset
= basic_set_parameter_preimage(bset
, T
);
5031 set
= isl_basic_set_lexmin(bset
);
5032 set
= set_parameter_preimage(set
, T2
);
5033 set
= set_append_equalities(set
, eq
);
5037 /* Compute an explicit representation for all the existentially
5038 * quantified variables.
5039 * The input and output dimensions are first turned into parameters.
5040 * compute_divs then returns a map with the same parameters and
5041 * no input or output dimensions and the dimension specification
5042 * is reset to that of the input.
5044 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5046 struct isl_basic_set
*bset
;
5047 struct isl_set
*set
;
5048 struct isl_map
*map
;
5049 struct isl_dim
*dim
, *orig_dim
= NULL
;
5054 bmap
= isl_basic_map_cow(bmap
);
5058 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5059 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5060 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5061 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5065 orig_dim
= bmap
->dim
;
5067 bset
= (struct isl_basic_set
*)bmap
;
5069 set
= parameter_compute_divs(bset
);
5070 map
= (struct isl_map
*)set
;
5071 map
= isl_map_reset_dim(map
, orig_dim
);
5075 isl_basic_map_free(bmap
);
5079 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5087 off
= isl_dim_total(bmap
->dim
);
5088 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5089 if (isl_int_is_zero(bmap
->div
[i
][0]))
5091 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5097 static int map_divs_known(__isl_keep isl_map
*map
)
5104 for (i
= 0; i
< map
->n
; ++i
) {
5105 int known
= basic_map_divs_known(map
->p
[i
]);
5113 /* If bmap contains any unknown divs, then compute explicit
5114 * expressions for them. However, this computation may be
5115 * quite expensive, so first try to remove divs that aren't
5118 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5122 struct isl_map
*map
;
5124 known
= basic_map_divs_known(bmap
);
5128 return isl_map_from_basic_map(bmap
);
5130 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5132 known
= basic_map_divs_known(bmap
);
5136 return isl_map_from_basic_map(bmap
);
5138 map
= compute_divs(bmap
);
5141 isl_basic_map_free(bmap
);
5145 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5149 struct isl_map
*res
;
5156 known
= map_divs_known(map
);
5164 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5165 for (i
= 1 ; i
< map
->n
; ++i
) {
5167 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5168 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5169 res
= isl_map_union_disjoint(res
, r2
);
5171 res
= isl_map_union(res
, r2
);
5178 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5180 return (struct isl_set
*)
5181 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5184 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5186 return (struct isl_set
*)
5187 isl_map_compute_divs((struct isl_map
*)set
);
5190 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5193 struct isl_set
*set
;
5198 map
= isl_map_cow(map
);
5202 set
= (struct isl_set
*)map
;
5203 set
->dim
= isl_dim_domain(set
->dim
);
5206 for (i
= 0; i
< map
->n
; ++i
) {
5207 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5211 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5212 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5219 struct isl_map
*isl_map_union_disjoint(
5220 struct isl_map
*map1
, struct isl_map
*map2
)
5224 struct isl_map
*map
= NULL
;
5238 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5240 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5241 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5242 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5244 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5245 map1
->n
+ map2
->n
, flags
);
5248 for (i
= 0; i
< map1
->n
; ++i
) {
5249 map
= isl_map_add_basic_map(map
,
5250 isl_basic_map_copy(map1
->p
[i
]));
5254 for (i
= 0; i
< map2
->n
; ++i
) {
5255 map
= isl_map_add_basic_map(map
,
5256 isl_basic_map_copy(map2
->p
[i
]));
5270 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5272 map1
= isl_map_union_disjoint(map1
, map2
);
5276 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5280 struct isl_set
*isl_set_union_disjoint(
5281 struct isl_set
*set1
, struct isl_set
*set2
)
5283 return (struct isl_set
*)
5284 isl_map_union_disjoint(
5285 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5288 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5290 return (struct isl_set
*)
5291 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5294 struct isl_map
*isl_map_intersect_range(
5295 struct isl_map
*map
, struct isl_set
*set
)
5298 struct isl_map
*result
;
5304 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5305 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5306 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5308 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5309 map
->n
* set
->n
, flags
);
5312 for (i
= 0; i
< map
->n
; ++i
)
5313 for (j
= 0; j
< set
->n
; ++j
) {
5314 result
= isl_map_add_basic_map(result
,
5315 isl_basic_map_intersect_range(
5316 isl_basic_map_copy(map
->p
[i
]),
5317 isl_basic_set_copy(set
->p
[j
])));
5330 struct isl_map
*isl_map_intersect_domain(
5331 struct isl_map
*map
, struct isl_set
*set
)
5333 return isl_map_reverse(
5334 isl_map_intersect_range(isl_map_reverse(map
), set
));
5337 struct isl_map
*isl_map_apply_domain(
5338 struct isl_map
*map1
, struct isl_map
*map2
)
5342 map1
= isl_map_reverse(map1
);
5343 map1
= isl_map_apply_range(map1
, map2
);
5344 return isl_map_reverse(map1
);
5351 struct isl_map
*isl_map_apply_range(
5352 struct isl_map
*map1
, struct isl_map
*map2
)
5354 struct isl_dim
*dim_result
;
5355 struct isl_map
*result
;
5361 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5362 isl_dim_copy(map2
->dim
));
5364 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5367 for (i
= 0; i
< map1
->n
; ++i
)
5368 for (j
= 0; j
< map2
->n
; ++j
) {
5369 result
= isl_map_add_basic_map(result
,
5370 isl_basic_map_apply_range(
5371 isl_basic_map_copy(map1
->p
[i
]),
5372 isl_basic_map_copy(map2
->p
[j
])));
5378 if (result
&& result
->n
<= 1)
5379 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5388 * returns range - domain
5390 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5392 isl_dim
*dims
, *target_dim
;
5393 struct isl_basic_set
*bset
;
5400 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5401 bmap
->dim
, isl_dim_out
),
5403 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5404 dim
= isl_basic_map_n_in(bmap
);
5405 nparam
= isl_basic_map_n_param(bmap
);
5406 bset
= isl_basic_set_from_basic_map(bmap
);
5407 bset
= isl_basic_set_cow(bset
);
5408 dims
= isl_basic_set_get_dim(bset
);
5409 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5410 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5411 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5412 for (i
= 0; i
< dim
; ++i
) {
5413 int j
= isl_basic_map_alloc_equality(
5414 (struct isl_basic_map
*)bset
);
5417 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5418 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5419 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5420 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5422 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5423 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5426 isl_basic_map_free(bmap
);
5431 * returns range - domain
5433 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5437 struct isl_set
*result
;
5442 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5443 map
->dim
, isl_dim_out
),
5445 dim
= isl_map_get_dim(map
);
5446 dim
= isl_dim_domain(dim
);
5447 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5450 for (i
= 0; i
< map
->n
; ++i
)
5451 result
= isl_set_add_basic_set(result
,
5452 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5460 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5462 struct isl_basic_map
*bmap
;
5470 nparam
= dims
->nparam
;
5472 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5476 for (i
= 0; i
< dim
; ++i
) {
5477 int j
= isl_basic_map_alloc_equality(bmap
);
5480 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5481 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5482 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5484 return isl_basic_map_finalize(bmap
);
5486 isl_basic_map_free(bmap
);
5490 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5492 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5495 return basic_map_identity(dim
);
5498 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5500 if (!model
|| !model
->dim
)
5502 isl_assert(model
->ctx
,
5503 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5504 return basic_map_identity(isl_dim_copy(model
->dim
));
5507 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5509 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5510 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5513 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5515 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5518 return map_identity(dim
);
5521 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5523 if (!model
|| !model
->dim
)
5525 isl_assert(model
->ctx
,
5526 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5527 return map_identity(isl_dim_copy(model
->dim
));
5530 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5532 if (!model
|| !model
->dim
)
5534 isl_assert(model
->ctx
,
5535 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5536 return map_identity(isl_dim_copy(model
->dim
));
5539 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5541 isl_dim
*dim
= isl_set_get_dim(set
);
5543 id
= isl_map_identity(dim
);
5544 return isl_map_intersect_range(id
, set
);
5547 /* Construct a basic set with all set dimensions having only non-negative
5550 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5555 struct isl_basic_set
*bset
;
5559 nparam
= dims
->nparam
;
5561 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5564 for (i
= 0; i
< dim
; ++i
) {
5565 int k
= isl_basic_set_alloc_inequality(bset
);
5568 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5569 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5573 isl_basic_set_free(bset
);
5577 /* Construct the half-space x_pos >= 0.
5579 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
5583 isl_basic_set
*nonneg
;
5585 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5586 k
= isl_basic_set_alloc_inequality(nonneg
);
5589 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5590 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
5592 return isl_basic_set_finalize(nonneg
);
5594 isl_basic_set_free(nonneg
);
5598 /* Construct the half-space x_pos <= -1.
5600 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
5605 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5606 k
= isl_basic_set_alloc_inequality(neg
);
5609 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5610 isl_int_set_si(neg
->ineq
[k
][0], -1);
5611 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
5613 return isl_basic_set_finalize(neg
);
5615 isl_basic_set_free(neg
);
5619 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5620 enum isl_dim_type type
, unsigned first
, unsigned n
)
5623 isl_basic_set
*nonneg
;
5631 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5633 for (i
= 0; i
< n
; ++i
) {
5634 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
5635 pos(set
->dim
, type
) + first
+ i
);
5636 neg
= neg_halfspace(isl_set_get_dim(set
),
5637 pos(set
->dim
, type
) + first
+ i
);
5639 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5648 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
5649 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5656 if (isl_set_fast_is_empty(set
)) {
5661 return fn(set
, signs
, user
);
5664 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
5666 half
= isl_set_intersect(half
, isl_set_copy(set
));
5667 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
5671 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
5673 half
= isl_set_intersect(half
, set
);
5674 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
5680 /* Call "fn" on the intersections of "set" with each of the orthants
5681 * (except for obviously empty intersections). The orthant is identified
5682 * by the signs array, with each entry having value 1 or -1 according
5683 * to the sign of the corresponding variable.
5685 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
5686 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5696 if (isl_set_fast_is_empty(set
))
5699 nparam
= isl_set_dim(set
, isl_dim_param
);
5700 nvar
= isl_set_dim(set
, isl_dim_set
);
5702 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
5704 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
5712 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5714 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5717 int isl_basic_map_is_subset(
5718 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5721 struct isl_map
*map1
;
5722 struct isl_map
*map2
;
5724 if (!bmap1
|| !bmap2
)
5727 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5728 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5730 is_subset
= isl_map_is_subset(map1
, map2
);
5738 int isl_basic_map_is_equal(
5739 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5743 if (!bmap1
|| !bmap2
)
5745 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5748 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5752 int isl_basic_set_is_equal(
5753 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5755 return isl_basic_map_is_equal(
5756 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5759 int isl_map_is_empty(struct isl_map
*map
)
5766 for (i
= 0; i
< map
->n
; ++i
) {
5767 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5776 int isl_map_fast_is_empty(struct isl_map
*map
)
5778 return map
? map
->n
== 0 : -1;
5781 int isl_set_fast_is_empty(struct isl_set
*set
)
5783 return set
? set
->n
== 0 : -1;
5786 int isl_set_is_empty(struct isl_set
*set
)
5788 return isl_map_is_empty((struct isl_map
*)set
);
5791 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5796 return isl_dim_equal(map1
->dim
, map2
->dim
);
5799 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5804 return isl_dim_equal(set1
->dim
, set2
->dim
);
5807 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5813 is_subset
= isl_map_is_subset(map1
, map2
);
5816 is_subset
= isl_map_is_subset(map2
, map1
);
5820 int isl_basic_map_is_strict_subset(
5821 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5825 if (!bmap1
|| !bmap2
)
5827 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5830 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5831 if (is_subset
== -1)
5836 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5842 is_subset
= isl_map_is_subset(map1
, map2
);
5845 is_subset
= isl_map_is_subset(map2
, map1
);
5846 if (is_subset
== -1)
5851 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5853 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5856 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5860 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5863 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5867 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5870 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5877 for (i
= 0; i
< map
->n
; ++i
) {
5878 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5886 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5888 return isl_map_fast_is_universe((isl_map
*) set
);
5891 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5893 struct isl_basic_set
*bset
= NULL
;
5894 struct isl_vec
*sample
= NULL
;
5901 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5904 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5905 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5906 copy
= isl_basic_map_remove_redundancies(copy
);
5907 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5908 isl_basic_map_free(copy
);
5912 total
= 1 + isl_basic_map_total_dim(bmap
);
5913 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5914 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5920 isl_vec_free(bmap
->sample
);
5921 bmap
->sample
= NULL
;
5922 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5925 sample
= isl_basic_set_sample_vec(bset
);
5928 empty
= sample
->size
== 0;
5929 isl_vec_free(bmap
->sample
);
5930 bmap
->sample
= sample
;
5932 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5937 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5941 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5944 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5948 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5951 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5953 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5956 struct isl_map
*isl_basic_map_union(
5957 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5959 struct isl_map
*map
;
5960 if (!bmap1
|| !bmap2
)
5963 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5965 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5968 map
= isl_map_add_basic_map(map
, bmap1
);
5969 map
= isl_map_add_basic_map(map
, bmap2
);
5972 isl_basic_map_free(bmap1
);
5973 isl_basic_map_free(bmap2
);
5977 struct isl_set
*isl_basic_set_union(
5978 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5980 return (struct isl_set
*)isl_basic_map_union(
5981 (struct isl_basic_map
*)bset1
,
5982 (struct isl_basic_map
*)bset2
);
5985 /* Order divs such that any div only depends on previous divs */
5986 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5994 off
= isl_dim_total(bmap
->dim
);
5996 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5998 if (isl_int_is_zero(bmap
->div
[i
][0]))
6000 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6004 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6010 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6012 return (struct isl_basic_set
*)
6013 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6016 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6023 for (i
= 0; i
< map
->n
; ++i
) {
6024 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6035 /* Look for a div in dst that corresponds to the div "div" in src.
6036 * The divs before "div" in src and dst are assumed to be the same.
6038 * Returns -1 if no corresponding div was found and the position
6039 * of the corresponding div in dst otherwise.
6041 static int find_div(struct isl_basic_map
*dst
,
6042 struct isl_basic_map
*src
, unsigned div
)
6046 unsigned total
= isl_dim_total(src
->dim
);
6048 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6049 for (i
= div
; i
< dst
->n_div
; ++i
)
6050 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6051 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6052 dst
->n_div
- div
) == -1)
6057 struct isl_basic_map
*isl_basic_map_align_divs(
6058 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6061 unsigned total
= isl_dim_total(src
->dim
);
6066 if (src
->n_div
== 0)
6069 for (i
= 0; i
< src
->n_div
; ++i
)
6070 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6072 src
= isl_basic_map_order_divs(src
);
6073 dst
= isl_basic_map_cow(dst
);
6074 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6075 src
->n_div
, 0, 2 * src
->n_div
);
6078 for (i
= 0; i
< src
->n_div
; ++i
) {
6079 int j
= find_div(dst
, src
, i
);
6081 j
= isl_basic_map_alloc_div(dst
);
6084 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6085 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6086 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6090 isl_basic_map_swap_div(dst
, i
, j
);
6094 isl_basic_map_free(dst
);
6098 struct isl_basic_set
*isl_basic_set_align_divs(
6099 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6101 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6102 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6105 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6113 map
= isl_map_compute_divs(map
);
6114 map
= isl_map_cow(map
);
6118 for (i
= 1; i
< map
->n
; ++i
)
6119 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6120 for (i
= 1; i
< map
->n
; ++i
)
6121 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6123 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6127 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6129 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6132 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6136 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6137 map
= isl_map_intersect_domain(map
, set
);
6138 set
= isl_map_range(map
);
6146 /* There is no need to cow as removing empty parts doesn't change
6147 * the meaning of the set.
6149 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6156 for (i
= map
->n
-1; i
>= 0; --i
) {
6157 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6159 isl_basic_map_free(map
->p
[i
]);
6160 if (i
!= map
->n
-1) {
6161 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6162 map
->p
[i
] = map
->p
[map
->n
-1];
6170 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6172 return (struct isl_set
*)
6173 isl_map_remove_empty_parts((struct isl_map
*)set
);
6176 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6178 struct isl_basic_map
*bmap
;
6179 if (!map
|| map
->n
== 0)
6181 bmap
= map
->p
[map
->n
-1];
6182 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6183 return isl_basic_map_copy(bmap
);
6186 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6188 return (struct isl_basic_set
*)
6189 isl_map_copy_basic_map((struct isl_map
*)set
);
6192 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6193 __isl_keep isl_basic_map
*bmap
)
6199 for (i
= map
->n
-1; i
>= 0; --i
) {
6200 if (map
->p
[i
] != bmap
)
6202 map
= isl_map_cow(map
);
6205 isl_basic_map_free(map
->p
[i
]);
6206 if (i
!= map
->n
-1) {
6207 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6208 map
->p
[i
] = map
->p
[map
->n
-1];
6219 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6220 struct isl_basic_set
*bset
)
6222 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6223 (struct isl_basic_map
*)bset
);
6226 /* Given two basic sets bset1 and bset2, compute the maximal difference
6227 * between the values of dimension pos in bset1 and those in bset2
6228 * for any common value of the parameters and dimensions preceding pos.
6230 static enum isl_lp_result
basic_set_maximal_difference_at(
6231 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6232 int pos
, isl_int
*opt
)
6234 struct isl_dim
*dims
;
6235 struct isl_basic_map
*bmap1
= NULL
;
6236 struct isl_basic_map
*bmap2
= NULL
;
6237 struct isl_ctx
*ctx
;
6238 struct isl_vec
*obj
;
6241 unsigned dim1
, dim2
;
6242 enum isl_lp_result res
;
6244 if (!bset1
|| !bset2
)
6245 return isl_lp_error
;
6247 nparam
= isl_basic_set_n_param(bset1
);
6248 dim1
= isl_basic_set_n_dim(bset1
);
6249 dim2
= isl_basic_set_n_dim(bset2
);
6250 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6251 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6252 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6253 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6254 if (!bmap1
|| !bmap2
)
6256 bmap1
= isl_basic_map_cow(bmap1
);
6257 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6258 pos
, (dim1
- pos
) + (dim2
- pos
),
6259 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6260 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6263 total
= isl_basic_map_total_dim(bmap1
);
6265 obj
= isl_vec_alloc(ctx
, 1 + total
);
6266 isl_seq_clr(obj
->block
.data
, 1 + total
);
6267 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6268 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6271 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6273 isl_basic_map_free(bmap1
);
6277 isl_basic_map_free(bmap1
);
6278 isl_basic_map_free(bmap2
);
6279 return isl_lp_error
;
6282 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6283 * for any common value of the parameters and dimensions preceding pos
6284 * in both basic sets, the values of dimension pos in bset1 are
6285 * smaller or larger than those in bset2.
6288 * 1 if bset1 follows bset2
6289 * -1 if bset1 precedes bset2
6290 * 0 if bset1 and bset2 are incomparable
6291 * -2 if some error occurred.
6293 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6294 struct isl_basic_set
*bset2
, int pos
)
6297 enum isl_lp_result res
;
6302 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6304 if (res
== isl_lp_empty
)
6306 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6307 res
== isl_lp_unbounded
)
6309 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6318 /* Given two basic sets bset1 and bset2, check whether
6319 * for any common value of the parameters and dimensions preceding pos
6320 * there is a value of dimension pos in bset1 that is larger
6321 * than a value of the same dimension in bset2.
6324 * 1 if there exists such a pair
6325 * 0 if there is no such pair, but there is a pair of equal values
6327 * -2 if some error occurred.
6329 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6330 __isl_keep isl_basic_set
*bset2
, int pos
)
6333 enum isl_lp_result res
;
6338 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6340 if (res
== isl_lp_empty
)
6342 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6343 res
== isl_lp_unbounded
)
6345 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6347 else if (res
== isl_lp_ok
)
6356 /* Given two sets set1 and set2, check whether
6357 * for any common value of the parameters and dimensions preceding pos
6358 * there is a value of dimension pos in set1 that is larger
6359 * than a value of the same dimension in set2.
6362 * 1 if there exists such a pair
6363 * 0 if there is no such pair, but there is a pair of equal values
6365 * -2 if some error occurred.
6367 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6368 __isl_keep isl_set
*set2
, int pos
)
6376 for (i
= 0; i
< set1
->n
; ++i
)
6377 for (j
= 0; j
< set2
->n
; ++j
) {
6379 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6380 if (f
== 1 || f
== -2)
6389 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6390 unsigned pos
, isl_int
*val
)
6398 total
= isl_basic_map_total_dim(bmap
);
6399 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6400 for (; d
+1 > pos
; --d
)
6401 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6405 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6407 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6409 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6412 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6418 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6419 unsigned pos
, isl_int
*val
)
6431 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6434 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6435 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6436 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6437 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6441 isl_int_set(*val
, v
);
6447 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6448 unsigned pos
, isl_int
*val
)
6450 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6454 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6457 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6460 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6461 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6463 if (pos
>= isl_basic_map_dim(bmap
, type
))
6465 return isl_basic_map_fast_has_fixed_var(bmap
,
6466 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6469 int isl_map_fast_is_fixed(struct isl_map
*map
,
6470 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6472 if (pos
>= isl_map_dim(map
, type
))
6474 return isl_map_fast_has_fixed_var(map
,
6475 map_offset(map
, type
) - 1 + pos
, val
);
6478 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6479 * then return this fixed value in *val.
6481 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6484 return isl_basic_set_fast_has_fixed_var(bset
,
6485 isl_basic_set_n_param(bset
) + dim
, val
);
6488 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6489 * then return this fixed value in *val.
6491 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6493 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6496 /* Check if input variable in has fixed value and if so and if val is not NULL,
6497 * then return this fixed value in *val.
6499 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6501 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6504 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6505 * and if val is not NULL, then return this lower bound in *val.
6507 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6508 unsigned dim
, isl_int
*val
)
6510 int i
, i_eq
= -1, i_ineq
= -1;
6517 total
= isl_basic_set_total_dim(bset
);
6518 nparam
= isl_basic_set_n_param(bset
);
6519 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6520 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6526 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6527 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6529 if (i_eq
!= -1 || i_ineq
!= -1)
6533 if (i_eq
== -1 && i_ineq
== -1)
6535 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6536 /* The coefficient should always be one due to normalization. */
6537 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6539 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6541 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6542 total
- nparam
- dim
- 1) != -1)
6545 isl_int_neg(*val
, c
[0]);
6549 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6550 unsigned dim
, isl_int
*val
)
6562 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6566 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6568 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6569 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6571 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6575 isl_int_set(*val
, v
);
6586 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6588 const struct constraint
*c1
= (const struct constraint
*)p1
;
6589 const struct constraint
*c2
= (const struct constraint
*)p2
;
6590 unsigned size
= isl_min(c1
->size
, c2
->size
);
6591 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6594 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6595 struct isl_basic_map
*bmap
)
6598 struct constraint
*c
;
6603 total
= isl_basic_map_total_dim(bmap
);
6604 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6607 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6609 c
[i
].c
= bmap
->ineq
[i
];
6611 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6612 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6613 bmap
->ineq
[i
] = c
[i
].c
;
6617 isl_basic_map_free(bmap
);
6621 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6622 __isl_take isl_basic_set
*bset
)
6624 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6625 (struct isl_basic_map
*)bset
);
6628 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6632 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6634 bmap
= isl_basic_map_remove_redundancies(bmap
);
6635 bmap
= isl_basic_map_sort_constraints(bmap
);
6636 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6640 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6642 return (struct isl_basic_set
*)isl_basic_map_normalize(
6643 (struct isl_basic_map
*)bset
);
6646 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6647 const __isl_keep isl_basic_map
*bmap2
)
6654 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6655 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6656 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6657 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6658 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6659 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6660 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6661 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6663 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6665 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6667 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6668 return bmap1
->n_eq
- bmap2
->n_eq
;
6669 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6670 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6671 if (bmap1
->n_div
!= bmap2
->n_div
)
6672 return bmap1
->n_div
- bmap2
->n_div
;
6673 total
= isl_basic_map_total_dim(bmap1
);
6674 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6675 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6679 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6680 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6684 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6685 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6692 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6693 __isl_keep isl_basic_map
*bmap2
)
6695 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6698 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6699 __isl_keep isl_basic_set
*bset2
)
6701 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6702 (isl_basic_map
*)bset2
);
6705 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6707 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6708 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6710 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6713 /* We normalize in place, but if anything goes wrong we need
6714 * to return NULL, so we need to make sure we don't change the
6715 * meaning of any possible other copies of map.
6717 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6720 struct isl_basic_map
*bmap
;
6724 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6726 for (i
= 0; i
< map
->n
; ++i
) {
6727 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6730 isl_basic_map_free(map
->p
[i
]);
6733 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6734 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6735 map
= isl_map_remove_empty_parts(map
);
6738 for (i
= map
->n
- 1; i
>= 1; --i
) {
6739 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6741 isl_basic_map_free(map
->p
[i
-1]);
6742 for (j
= i
; j
< map
->n
; ++j
)
6743 map
->p
[j
-1] = map
->p
[j
];
6753 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6755 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6758 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6768 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6771 map1
= isl_map_copy(map1
);
6772 map2
= isl_map_copy(map2
);
6773 map1
= isl_map_normalize(map1
);
6774 map2
= isl_map_normalize(map2
);
6777 equal
= map1
->n
== map2
->n
;
6778 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6779 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6792 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6794 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6795 (struct isl_map
*)set2
);
6798 /* Return an interval that ranges from min to max (inclusive)
6800 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6801 isl_int min
, isl_int max
)
6804 struct isl_basic_set
*bset
= NULL
;
6806 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6810 k
= isl_basic_set_alloc_inequality(bset
);
6813 isl_int_set_si(bset
->ineq
[k
][1], 1);
6814 isl_int_neg(bset
->ineq
[k
][0], min
);
6816 k
= isl_basic_set_alloc_inequality(bset
);
6819 isl_int_set_si(bset
->ineq
[k
][1], -1);
6820 isl_int_set(bset
->ineq
[k
][0], max
);
6824 isl_basic_set_free(bset
);
6828 /* Return the Cartesian product of the basic sets in list (in the given order).
6830 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6838 struct isl_basic_set
*product
= NULL
;
6842 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6843 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6844 nparam
= isl_basic_set_n_param(list
->p
[0]);
6845 dim
= isl_basic_set_n_dim(list
->p
[0]);
6846 extra
= list
->p
[0]->n_div
;
6847 n_eq
= list
->p
[0]->n_eq
;
6848 n_ineq
= list
->p
[0]->n_ineq
;
6849 for (i
= 1; i
< list
->n
; ++i
) {
6850 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6851 isl_assert(list
->ctx
,
6852 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6853 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6854 extra
+= list
->p
[i
]->n_div
;
6855 n_eq
+= list
->p
[i
]->n_eq
;
6856 n_ineq
+= list
->p
[i
]->n_ineq
;
6858 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6863 for (i
= 0; i
< list
->n
; ++i
) {
6864 isl_basic_set_add_constraints(product
,
6865 isl_basic_set_copy(list
->p
[i
]), dim
);
6866 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6868 isl_basic_set_list_free(list
);
6871 isl_basic_set_free(product
);
6872 isl_basic_set_list_free(list
);
6876 struct isl_basic_map
*isl_basic_map_product(
6877 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6879 struct isl_dim
*dim_result
= NULL
;
6880 struct isl_basic_map
*bmap
;
6881 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6882 struct isl_dim_map
*dim_map1
, *dim_map2
;
6884 if (!bmap1
|| !bmap2
)
6887 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6888 bmap2
->dim
, isl_dim_param
), goto error
);
6889 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6890 isl_dim_copy(bmap2
->dim
));
6892 in1
= isl_basic_map_n_in(bmap1
);
6893 in2
= isl_basic_map_n_in(bmap2
);
6894 out1
= isl_basic_map_n_out(bmap1
);
6895 out2
= isl_basic_map_n_out(bmap2
);
6896 nparam
= isl_basic_map_n_param(bmap1
);
6898 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6899 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6900 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6901 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6902 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6903 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6904 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6905 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6906 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6907 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6908 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6910 bmap
= isl_basic_map_alloc_dim(dim_result
,
6911 bmap1
->n_div
+ bmap2
->n_div
,
6912 bmap1
->n_eq
+ bmap2
->n_eq
,
6913 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6914 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6915 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6916 bmap
= isl_basic_map_simplify(bmap
);
6917 return isl_basic_map_finalize(bmap
);
6919 isl_basic_map_free(bmap1
);
6920 isl_basic_map_free(bmap2
);
6924 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6926 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6929 struct isl_map
*result
;
6935 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6936 map2
->dim
, isl_dim_param
), goto error
);
6938 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6939 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6940 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6942 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6943 isl_dim_copy(map2
->dim
)),
6944 map1
->n
* map2
->n
, flags
);
6947 for (i
= 0; i
< map1
->n
; ++i
)
6948 for (j
= 0; j
< map2
->n
; ++j
) {
6949 struct isl_basic_map
*part
;
6950 part
= isl_basic_map_product(
6951 isl_basic_map_copy(map1
->p
[i
]),
6952 isl_basic_map_copy(map2
->p
[j
]));
6953 if (isl_basic_map_is_empty(part
))
6954 isl_basic_map_free(part
);
6956 result
= isl_map_add_basic_map(result
, part
);
6969 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6971 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
6972 __isl_take isl_map
*map2
)
6976 prod
= isl_map_product(map1
, map2
);
6977 prod
= isl_map_flatten(prod
);
6981 /* Given two set A and B, construct its Cartesian product A x B.
6983 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6985 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6986 (struct isl_map
*)set2
);
6989 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
6990 __isl_take isl_set
*set2
)
6992 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
6995 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
6998 uint32_t hash
= isl_hash_init();
7003 bmap
= isl_basic_map_copy(bmap
);
7004 bmap
= isl_basic_map_normalize(bmap
);
7007 total
= isl_basic_map_total_dim(bmap
);
7008 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7009 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7011 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7012 isl_hash_hash(hash
, c_hash
);
7014 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7015 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7017 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7018 isl_hash_hash(hash
, c_hash
);
7020 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7021 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7023 if (isl_int_is_zero(bmap
->div
[i
][0]))
7025 isl_hash_byte(hash
, i
& 0xFF);
7026 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7027 isl_hash_hash(hash
, c_hash
);
7029 isl_basic_map_free(bmap
);
7033 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7035 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7038 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7045 map
= isl_map_copy(map
);
7046 map
= isl_map_normalize(map
);
7050 hash
= isl_hash_init();
7051 for (i
= 0; i
< map
->n
; ++i
) {
7053 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7054 isl_hash_hash(hash
, bmap_hash
);
7062 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7064 return isl_map_get_hash((isl_map
*)set
);
7067 /* Check if the value for dimension dim is completely determined
7068 * by the values of the other parameters and variables.
7069 * That is, check if dimension dim is involved in an equality.
7071 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7078 nparam
= isl_basic_set_n_param(bset
);
7079 for (i
= 0; i
< bset
->n_eq
; ++i
)
7080 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7085 /* Check if the value for dimension dim is completely determined
7086 * by the values of the other parameters and variables.
7087 * That is, check if dimension dim is involved in an equality
7088 * for each of the subsets.
7090 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7096 for (i
= 0; i
< set
->n
; ++i
) {
7098 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7105 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7107 return set
? set
->n
: 0;
7110 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7111 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7118 for (i
= 0; i
< map
->n
; ++i
)
7119 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7125 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7126 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7133 for (i
= 0; i
< set
->n
; ++i
)
7134 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7140 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7142 struct isl_dim
*dim
;
7147 if (bset
->n_div
== 0)
7150 bset
= isl_basic_set_cow(bset
);
7154 dim
= isl_basic_set_get_dim(bset
);
7155 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
7158 isl_dim_free(bset
->dim
);
7160 bset
->extra
-= bset
->n_div
;
7163 bset
= isl_basic_set_finalize(bset
);
7167 isl_basic_set_free(bset
);
7171 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7174 struct isl_dim
*dim
;
7177 set
= isl_set_align_divs(set
);
7181 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
7184 set
= isl_set_cow(set
);
7188 n_div
= set
->p
[0]->n_div
;
7189 dim
= isl_set_get_dim(set
);
7190 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
7193 isl_dim_free(set
->dim
);
7196 for (i
= 0; i
< set
->n
; ++i
) {
7197 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7208 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7210 struct isl_dim
*dim
;
7211 struct isl_basic_map
*bmap
;
7218 set
= isl_set_align_divs(set
);
7223 dim
= isl_set_get_dim(set
);
7224 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7226 return isl_map_identity(dim
);
7229 n_div
= set
->p
[0]->n_div
;
7230 dim
= isl_dim_map(dim
);
7231 n_param
= isl_dim_size(dim
, isl_dim_param
);
7232 n_set
= isl_dim_size(dim
, isl_dim_in
);
7233 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7234 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7235 for (i
= 0; i
< n_set
; ++i
)
7236 bmap
= var_equal(bmap
, i
);
7238 total
= n_param
+ n_set
+ n_set
+ n_div
;
7239 for (i
= 0; i
< n_div
; ++i
) {
7240 k
= isl_basic_map_alloc_inequality(bmap
);
7243 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7244 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7245 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7246 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7247 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7248 set
->p
[0]->div
[i
][0]);
7250 l
= isl_basic_map_alloc_inequality(bmap
);
7253 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7254 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7255 set
->p
[0]->div
[i
][0]);
7256 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7260 return isl_map_from_basic_map(bmap
);
7263 isl_basic_map_free(bmap
);
7267 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7275 dim
= isl_basic_set_total_dim(bset
);
7276 size
+= bset
->n_eq
* (1 + dim
);
7277 size
+= bset
->n_ineq
* (1 + dim
);
7278 size
+= bset
->n_div
* (2 + dim
);
7283 int isl_set_size(__isl_keep isl_set
*set
)
7291 for (i
= 0; i
< set
->n
; ++i
)
7292 size
+= isl_basic_set_size(set
->p
[i
]);
7297 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7298 enum isl_dim_type type
, unsigned pos
)
7306 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7308 pos
+= isl_basic_map_offset(bmap
, type
);
7310 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7311 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7315 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7316 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7323 return lower
&& upper
;
7326 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7327 enum isl_dim_type type
, unsigned pos
)
7334 for (i
= 0; i
< map
->n
; ++i
) {
7336 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7337 if (bounded
< 0 || !bounded
)
7344 /* Return 1 if the specified dim is involved in both an upper bound
7345 * and a lower bound.
7347 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7348 enum isl_dim_type type
, unsigned pos
)
7350 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7353 /* For each of the "n" variables starting at "first", determine
7354 * the sign of the variable and put the results in the first "n"
7355 * elements of the array "signs".
7357 * 1 means that the variable is non-negative
7358 * -1 means that the variable is non-positive
7359 * 0 means the variable attains both positive and negative values.
7361 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7362 unsigned first
, unsigned n
, int *signs
)
7364 isl_vec
*bound
= NULL
;
7365 struct isl_tab
*tab
= NULL
;
7366 struct isl_tab_undo
*snap
;
7369 if (!bset
|| !signs
)
7372 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7373 tab
= isl_tab_from_basic_set(bset
);
7377 isl_seq_clr(bound
->el
, bound
->size
);
7378 isl_int_set_si(bound
->el
[0], -1);
7380 snap
= isl_tab_snap(tab
);
7381 for (i
= 0; i
< n
; ++i
) {
7384 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7385 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7388 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7389 if (isl_tab_rollback(tab
, snap
) < 0)
7397 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7398 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7401 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7402 if (isl_tab_rollback(tab
, snap
) < 0)
7405 signs
[i
] = empty
? -1 : 0;
7409 isl_vec_free(bound
);
7413 isl_vec_free(bound
);
7417 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7418 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7420 if (!bset
|| !signs
)
7422 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7425 first
+= pos(bset
->dim
, type
) - 1;
7426 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7429 /* Check if the given map is single-valued.
7434 * and check if the result is a subset of the identity mapping.
7436 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7442 test
= isl_map_reverse(isl_map_copy(map
));
7443 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7445 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7447 sv
= isl_map_is_subset(test
, id
);
7455 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7459 sv
= isl_map_is_single_valued(map
);
7463 map
= isl_map_copy(map
);
7464 map
= isl_map_reverse(map
);
7465 sv
= isl_map_is_single_valued(map
);
7471 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7473 return isl_map_is_single_valued((isl_map
*)set
);
7476 int isl_map_is_translation(__isl_keep isl_map
*map
)
7481 delta
= isl_map_deltas(isl_map_copy(map
));
7482 ok
= isl_set_is_singleton(delta
);
7483 isl_set_free(delta
);
7488 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7490 if (isl_seq_first_non_zero(p
, pos
) != -1)
7492 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7497 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7506 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7509 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7510 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7511 for (j
= 0; j
< nvar
; ++j
) {
7512 int lower
= 0, upper
= 0;
7513 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7514 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7516 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7522 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7523 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7525 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7527 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7532 if (!lower
|| !upper
)
7539 int isl_set_is_box(__isl_keep isl_set
*set
)
7546 return isl_basic_set_is_box(set
->p
[0]);
7549 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7554 return isl_dim_is_wrapping(bset
->dim
);
7557 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7562 return isl_dim_is_wrapping(set
->dim
);
7565 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7567 bmap
= isl_basic_map_cow(bmap
);
7571 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7575 bmap
= isl_basic_map_finalize(bmap
);
7577 return (isl_basic_set
*)bmap
;
7579 isl_basic_map_free(bmap
);
7583 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7587 map
= isl_map_cow(map
);
7591 for (i
= 0; i
< map
->n
; ++i
) {
7592 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7596 map
->dim
= isl_dim_wrap(map
->dim
);
7600 return (isl_set
*)map
;
7606 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7608 bset
= isl_basic_set_cow(bset
);
7612 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7616 bset
= isl_basic_set_finalize(bset
);
7618 return (isl_basic_map
*)bset
;
7620 isl_basic_set_free(bset
);
7624 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7631 if (!isl_set_is_wrapping(set
))
7632 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7635 set
= isl_set_cow(set
);
7639 for (i
= 0; i
< set
->n
; ++i
) {
7640 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7645 set
->dim
= isl_dim_unwrap(set
->dim
);
7649 return (isl_map
*)set
;
7655 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7656 enum isl_dim_type type
)
7661 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7664 bmap
= isl_basic_map_cow(bmap
);
7668 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7672 bmap
= isl_basic_map_finalize(bmap
);
7676 isl_basic_map_free(bmap
);
7680 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7681 enum isl_dim_type type
)
7688 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7691 map
= isl_map_cow(map
);
7695 for (i
= 0; i
< map
->n
; ++i
) {
7696 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7700 map
->dim
= isl_dim_reset(map
->dim
, type
);
7710 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7715 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7718 bmap
= isl_basic_map_cow(bmap
);
7722 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7726 bmap
= isl_basic_map_finalize(bmap
);
7730 isl_basic_map_free(bmap
);
7734 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7741 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7744 map
= isl_map_cow(map
);
7748 for (i
= 0; i
< map
->n
; ++i
) {
7749 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7753 map
->dim
= isl_dim_flatten(map
->dim
);
7763 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
7765 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
7768 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
7770 isl_dim
*dim
, *flat_dim
;
7773 dim
= isl_set_get_dim(set
);
7774 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
7775 map
= map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
7776 map
= isl_map_intersect_domain(map
, set
);
7781 /* Extend the given dim_map with mappings for the divs in bmap.
7783 static __isl_give
struct isl_dim_map
*extend_dim_map(
7784 __isl_keep
struct isl_dim_map
*dim_map
,
7785 __isl_keep isl_basic_map
*bmap
)
7788 struct isl_dim_map
*res
;
7791 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7793 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7797 for (i
= 0; i
< dim_map
->len
; ++i
)
7798 res
->pos
[i
] = dim_map
->pos
[i
];
7799 for (i
= 0; i
< bmap
->n_div
; ++i
)
7800 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7805 /* Extract a dim_map from a reordering.
7806 * We essentially need to reverse the mapping, and add an offset
7807 * of 1 for the constant term.
7809 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7810 __isl_keep isl_reordering
*exp
)
7813 struct isl_dim_map
*dim_map
;
7818 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7822 for (i
= 0; i
< exp
->len
; ++i
)
7823 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7828 /* Reorder the dimensions of "bmap" according to the given dim_map
7829 * and set the dimension specification to "dim".
7831 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7832 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
7836 bmap
= isl_basic_map_cow(bmap
);
7837 if (!bmap
|| !dim
|| !dim_map
)
7840 res
= isl_basic_map_alloc_dim(dim
,
7841 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
7842 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
7843 res
= isl_basic_map_finalize(res
);
7847 isl_basic_map_free(bmap
);
7852 /* Reorder the dimensions of "map" according to given reordering.
7854 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
7855 __isl_take isl_reordering
*r
)
7858 struct isl_dim_map
*dim_map
;
7860 map
= isl_map_cow(map
);
7861 dim_map
= isl_dim_map_from_reordering(r
);
7862 if (!map
|| !r
|| !dim_map
)
7865 for (i
= 0; i
< map
->n
; ++i
) {
7866 struct isl_dim_map
*dim_map_i
;
7868 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
7870 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
7871 isl_dim_copy(r
->dim
), dim_map_i
);
7877 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
7879 isl_reordering_free(r
);
7885 isl_reordering_free(r
);
7889 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
7890 __isl_take isl_reordering
*r
)
7892 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
7895 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
7896 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7897 enum isl_dim_type c2
, enum isl_dim_type c3
,
7898 enum isl_dim_type c4
, enum isl_dim_type c5
)
7900 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7901 struct isl_mat
*mat
;
7907 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
7908 isl_basic_map_total_dim(bmap
) + 1);
7911 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7912 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7913 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7914 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7915 isl_int_set(mat
->row
[i
][pos
],
7916 bmap
->eq
[i
][off
+ k
]);
7924 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
7925 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
7926 enum isl_dim_type c2
, enum isl_dim_type c3
,
7927 enum isl_dim_type c4
, enum isl_dim_type c5
)
7929 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7930 struct isl_mat
*mat
;
7936 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
7937 isl_basic_map_total_dim(bmap
) + 1);
7940 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7941 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7942 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7943 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7944 isl_int_set(mat
->row
[i
][pos
],
7945 bmap
->ineq
[i
][off
+ k
]);
7953 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
7954 __isl_take isl_dim
*dim
,
7955 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
7956 enum isl_dim_type c2
, enum isl_dim_type c3
,
7957 enum isl_dim_type c4
, enum isl_dim_type c5
)
7959 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
7960 isl_basic_map
*bmap
;
7966 if (!dim
|| !eq
|| !ineq
)
7969 if (eq
->n_col
!= ineq
->n_col
)
7970 isl_die(dim
->ctx
, isl_error_invalid
,
7971 "equalities and inequalities matrices should have "
7972 "same number of columns", goto error
);
7974 total
= 1 + isl_dim_total(dim
);
7976 if (eq
->n_col
< total
)
7977 isl_die(dim
->ctx
, isl_error_invalid
,
7978 "number of columns too small", goto error
);
7980 extra
= eq
->n_col
- total
;
7982 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
7983 eq
->n_row
, ineq
->n_row
);
7986 for (i
= 0; i
< extra
; ++i
) {
7987 k
= isl_basic_map_alloc_div(bmap
);
7990 isl_int_set_si(bmap
->div
[k
][0], 0);
7992 for (i
= 0; i
< eq
->n_row
; ++i
) {
7993 l
= isl_basic_map_alloc_equality(bmap
);
7996 for (j
= 0, pos
= 0; j
< 5; ++j
) {
7997 int off
= isl_basic_map_offset(bmap
, c
[j
]);
7998 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
7999 isl_int_set(bmap
->eq
[l
][off
+ k
],
8005 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8006 l
= isl_basic_map_alloc_inequality(bmap
);
8009 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8010 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8011 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8012 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8031 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8032 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8033 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8035 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8036 c1
, c2
, c3
, c4
, isl_dim_in
);
8039 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8040 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8041 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8043 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8044 c1
, c2
, c3
, c4
, isl_dim_in
);
8047 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8048 __isl_take isl_dim
*dim
,
8049 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8050 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8052 return (isl_basic_set
*)
8053 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8054 c1
, c2
, c3
, c4
, isl_dim_in
);