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_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
378 return bset
? isl_dim_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
381 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
383 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
386 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
387 enum isl_dim_type type
, unsigned pos
)
389 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
392 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
393 enum isl_dim_type type
, unsigned pos
)
395 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
398 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
399 enum isl_dim_type type
, unsigned pos
)
401 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
404 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
405 __isl_take isl_basic_map
*bmap
,
406 enum isl_dim_type type
, unsigned pos
, const char *s
)
410 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
415 isl_basic_map_free(bmap
);
419 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
420 enum isl_dim_type type
, unsigned pos
, const char *s
)
427 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
431 for (i
= 0; i
< map
->n
; ++i
) {
432 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
443 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
444 __isl_take isl_basic_set
*bset
,
445 enum isl_dim_type type
, unsigned pos
, const char *s
)
447 return (isl_basic_set
*)isl_basic_map_set_dim_name(
448 (isl_basic_map
*)bset
, type
, pos
, s
);
451 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
452 enum isl_dim_type type
, unsigned pos
, const char *s
)
454 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
457 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
461 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
464 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
465 struct isl_basic_map
*bmap
, unsigned extra
,
466 unsigned n_eq
, unsigned n_ineq
)
469 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
474 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
475 if (isl_blk_is_error(bmap
->block
))
478 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
483 bmap
->block2
= isl_blk_empty();
486 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
487 if (isl_blk_is_error(bmap
->block2
))
490 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
495 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
496 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
498 for (i
= 0; i
< extra
; ++i
)
499 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
503 bmap
->c_size
= n_eq
+ n_ineq
;
504 bmap
->eq
= bmap
->ineq
+ n_ineq
;
513 isl_basic_map_free(bmap
);
517 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
518 unsigned nparam
, unsigned dim
, unsigned extra
,
519 unsigned n_eq
, unsigned n_ineq
)
521 struct isl_basic_map
*bmap
;
522 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
523 return (struct isl_basic_set
*)bmap
;
526 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
527 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
529 struct isl_basic_map
*bmap
;
532 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
533 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
534 return (struct isl_basic_set
*)bmap
;
540 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
541 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
543 struct isl_basic_map
*bmap
;
547 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
552 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
558 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
559 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
560 unsigned n_eq
, unsigned n_ineq
)
562 struct isl_basic_map
*bmap
;
565 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
569 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
573 static void dup_constraints(
574 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
577 unsigned total
= isl_basic_map_total_dim(src
);
579 for (i
= 0; i
< src
->n_eq
; ++i
) {
580 int j
= isl_basic_map_alloc_equality(dst
);
581 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
584 for (i
= 0; i
< src
->n_ineq
; ++i
) {
585 int j
= isl_basic_map_alloc_inequality(dst
);
586 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
589 for (i
= 0; i
< src
->n_div
; ++i
) {
590 int j
= isl_basic_map_alloc_div(dst
);
591 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
593 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
596 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
598 struct isl_basic_map
*dup
;
602 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
603 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
606 dup_constraints(dup
, bmap
);
607 dup
->flags
= bmap
->flags
;
608 dup
->sample
= isl_vec_copy(bmap
->sample
);
612 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
614 struct isl_basic_map
*dup
;
616 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
617 return (struct isl_basic_set
*)dup
;
620 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
625 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
629 return isl_basic_set_dup(bset
);
632 struct isl_set
*isl_set_copy(struct isl_set
*set
)
641 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
646 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
650 bmap
= isl_basic_map_dup(bmap
);
652 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
656 struct isl_map
*isl_map_copy(struct isl_map
*map
)
665 void isl_basic_map_free(struct isl_basic_map
*bmap
)
673 isl_ctx_deref(bmap
->ctx
);
675 isl_blk_free(bmap
->ctx
, bmap
->block2
);
677 isl_blk_free(bmap
->ctx
, bmap
->block
);
678 isl_vec_free(bmap
->sample
);
679 isl_dim_free(bmap
->dim
);
683 void isl_basic_set_free(struct isl_basic_set
*bset
)
685 isl_basic_map_free((struct isl_basic_map
*)bset
);
688 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
690 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
693 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
699 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
700 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
702 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
703 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
704 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
705 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
706 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
707 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
709 int j
= isl_basic_map_alloc_inequality(bmap
);
713 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
714 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
721 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
722 bmap
->extra
- bmap
->n_div
);
726 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
728 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
731 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
735 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
740 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
742 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
745 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
750 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
752 if (pos
!= bmap
->n_eq
- 1) {
754 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
755 bmap
->eq
[bmap
->n_eq
- 1] = t
;
761 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
763 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
766 void isl_basic_map_inequality_to_equality(
767 struct isl_basic_map
*bmap
, unsigned pos
)
772 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
773 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
778 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
779 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
780 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
781 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
784 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
786 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
789 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
795 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
796 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
797 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
798 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
799 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
800 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
801 1 + isl_basic_map_total_dim(bmap
),
802 bmap
->extra
- bmap
->n_div
);
803 return bmap
->n_ineq
++;
806 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
808 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
811 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
815 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
820 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
822 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
825 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
830 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
832 if (pos
!= bmap
->n_ineq
- 1) {
834 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
835 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
836 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
842 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
844 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
847 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
852 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
855 k
= isl_basic_map_alloc_equality(bmap
);
858 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
861 isl_basic_map_free(bmap
);
865 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
868 return (isl_basic_set
*)
869 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
872 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
877 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
880 k
= isl_basic_map_alloc_inequality(bmap
);
883 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
886 isl_basic_map_free(bmap
);
890 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
893 return (isl_basic_set
*)
894 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
897 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
901 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
902 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
903 1 + 1 + isl_basic_map_total_dim(bmap
),
904 bmap
->extra
- bmap
->n_div
);
905 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
906 return bmap
->n_div
++;
909 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
911 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
914 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
918 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
923 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
925 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
928 /* Copy constraint from src to dst, putting the vars of src at offset
929 * dim_off in dst and the divs of src at offset div_off in dst.
930 * If both sets are actually map, then dim_off applies to the input
933 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
934 struct isl_basic_map
*src_map
, isl_int
*src
,
935 unsigned in_off
, unsigned out_off
, unsigned div_off
)
937 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
938 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
939 unsigned src_in
= isl_basic_map_n_in(src_map
);
940 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
941 unsigned src_out
= isl_basic_map_n_out(src_map
);
942 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
943 isl_int_set(dst
[0], src
[0]);
944 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
945 if (dst_nparam
> src_nparam
)
946 isl_seq_clr(dst
+1+src_nparam
,
947 dst_nparam
- src_nparam
);
948 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
949 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
951 isl_min(dst_in
-in_off
, src_in
));
952 if (dst_in
-in_off
> src_in
)
953 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
954 dst_in
- in_off
- src_in
);
955 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
956 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
957 src
+1+src_nparam
+src_in
,
958 isl_min(dst_out
-out_off
, src_out
));
959 if (dst_out
-out_off
> src_out
)
960 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
961 dst_out
- out_off
- src_out
);
962 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
963 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
964 src
+1+src_nparam
+src_in
+src_out
,
965 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
966 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
967 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
968 div_off
+src_map
->n_div
,
969 dst_map
->n_div
- div_off
- src_map
->n_div
);
972 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
973 struct isl_basic_map
*src_map
, isl_int
*src
,
974 unsigned in_off
, unsigned out_off
, unsigned div_off
)
976 isl_int_set(dst
[0], src
[0]);
977 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
980 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
981 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
986 if (!bmap1
|| !bmap2
)
989 div_off
= bmap1
->n_div
;
991 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
992 int i1
= isl_basic_map_alloc_equality(bmap1
);
995 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
996 i_pos
, o_pos
, div_off
);
999 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1000 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1003 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1004 i_pos
, o_pos
, div_off
);
1007 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1008 int i1
= isl_basic_map_alloc_div(bmap1
);
1011 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1012 i_pos
, o_pos
, div_off
);
1015 isl_basic_map_free(bmap2
);
1020 isl_basic_map_free(bmap1
);
1021 isl_basic_map_free(bmap2
);
1025 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
1026 struct isl_dim_map
*dim_map
)
1030 for (i
= 0; i
< dim_map
->len
; ++i
) {
1031 if (dim_map
->pos
[i
] < 0)
1032 isl_int_set_si(dst
[i
], 0);
1034 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
1038 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
1039 struct isl_dim_map
*dim_map
)
1041 isl_int_set(dst
[0], src
[0]);
1042 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
1045 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
1046 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
1050 if (!src
|| !dst
|| !dim_map
)
1053 for (i
= 0; i
< src
->n_eq
; ++i
) {
1054 int i1
= isl_basic_map_alloc_equality(dst
);
1057 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1060 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1061 int i1
= isl_basic_map_alloc_inequality(dst
);
1064 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1067 for (i
= 0; i
< src
->n_div
; ++i
) {
1068 int i1
= isl_basic_map_alloc_div(dst
);
1071 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1075 isl_basic_map_free(src
);
1080 isl_basic_map_free(src
);
1081 isl_basic_map_free(dst
);
1085 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1086 struct isl_basic_set
*bset2
, unsigned pos
)
1088 return (struct isl_basic_set
*)
1089 add_constraints((struct isl_basic_map
*)bset1
,
1090 (struct isl_basic_map
*)bset2
, 0, pos
);
1093 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1094 struct isl_dim
*dim
, unsigned extra
,
1095 unsigned n_eq
, unsigned n_ineq
)
1097 struct isl_basic_map
*ext
;
1107 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1108 base
->extra
>= base
->n_div
+ extra
;
1110 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1111 room_for_ineq(base
, n_ineq
)) {
1116 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1117 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1118 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1119 extra
+= base
->extra
;
1121 n_ineq
+= base
->n_ineq
;
1123 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1129 ext
->sample
= isl_vec_copy(base
->sample
);
1130 flags
= base
->flags
;
1131 ext
= add_constraints(ext
, base
, 0, 0);
1134 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1141 isl_basic_map_free(base
);
1145 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1146 struct isl_dim
*dim
, unsigned extra
,
1147 unsigned n_eq
, unsigned n_ineq
)
1149 return (struct isl_basic_set
*)
1150 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1151 extra
, n_eq
, n_ineq
);
1154 struct isl_basic_map
*isl_basic_map_extend_constraints(
1155 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1159 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1163 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1164 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1165 unsigned n_eq
, unsigned n_ineq
)
1167 struct isl_basic_map
*bmap
;
1168 struct isl_dim
*dim
;
1172 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1176 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1179 isl_basic_map_free(base
);
1183 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1184 unsigned nparam
, unsigned dim
, unsigned extra
,
1185 unsigned n_eq
, unsigned n_ineq
)
1187 return (struct isl_basic_set
*)
1188 isl_basic_map_extend((struct isl_basic_map
*)base
,
1189 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1192 struct isl_basic_set
*isl_basic_set_extend_constraints(
1193 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1195 return (struct isl_basic_set
*)
1196 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1200 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1202 return (struct isl_basic_set
*)
1203 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1206 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1211 if (bmap
->ref
> 1) {
1213 bmap
= isl_basic_map_dup(bmap
);
1216 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1220 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1228 return isl_set_dup(set
);
1231 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1239 return isl_map_dup(map
);
1242 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1243 unsigned a_len
, unsigned b_len
)
1245 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1246 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1247 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1250 struct isl_basic_set
*isl_basic_set_swap_vars(
1251 struct isl_basic_set
*bset
, unsigned n
)
1261 nparam
= isl_basic_set_n_param(bset
);
1262 dim
= isl_basic_set_n_dim(bset
);
1263 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1268 bset
= isl_basic_set_cow(bset
);
1272 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1273 if (isl_blk_is_error(blk
))
1276 for (i
= 0; i
< bset
->n_eq
; ++i
)
1278 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1280 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1282 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1284 for (i
= 0; i
< bset
->n_div
; ++i
)
1286 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1288 isl_blk_free(bset
->ctx
, blk
);
1290 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1291 bset
= isl_basic_set_gauss(bset
, NULL
);
1292 return isl_basic_set_finalize(bset
);
1294 isl_basic_set_free(bset
);
1298 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1301 set
= isl_set_cow(set
);
1305 for (i
= 0; i
< set
->n
; ++i
) {
1306 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1312 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1316 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1322 total
= isl_basic_map_total_dim(bmap
);
1323 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1324 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1326 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1328 i
= isl_basic_map_alloc_equality(bmap
);
1332 isl_int_set_si(bmap
->eq
[i
][0], 1);
1333 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1334 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1335 isl_vec_free(bmap
->sample
);
1336 bmap
->sample
= NULL
;
1337 return isl_basic_map_finalize(bmap
);
1339 isl_basic_map_free(bmap
);
1343 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1345 return (struct isl_basic_set
*)
1346 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1349 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1352 unsigned off
= isl_dim_total(bmap
->dim
);
1353 isl_int
*t
= bmap
->div
[a
];
1354 bmap
->div
[a
] = bmap
->div
[b
];
1357 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1358 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1360 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1361 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1363 for (i
= 0; i
< bmap
->n_div
; ++i
)
1364 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1365 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1368 /* Eliminate the specified n dimensions starting at first from the
1369 * constraints using Fourier-Motzkin. The dimensions themselves
1372 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1373 enum isl_dim_type type
, unsigned first
, unsigned n
)
1382 map
= isl_map_cow(map
);
1385 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1386 first
+= pos(map
->dim
, type
) - 1;
1388 for (i
= 0; i
< map
->n
; ++i
) {
1389 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1399 /* Eliminate the specified n dimensions starting at first from the
1400 * constraints using Fourier-Motzkin. The dimensions themselves
1403 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1404 enum isl_dim_type type
, unsigned first
, unsigned n
)
1406 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1409 /* Eliminate the specified n dimensions starting at first from the
1410 * constraints using Fourier-Motzkin. The dimensions themselves
1413 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1414 unsigned first
, unsigned n
)
1416 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1419 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1420 __isl_take isl_basic_map
*bmap
)
1422 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1430 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1431 __isl_take isl_basic_set
*bset
)
1433 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1434 (struct isl_basic_map
*)bset
);
1437 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1446 set
= isl_set_cow(set
);
1450 for (i
= 0; i
< set
->n
; ++i
) {
1451 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1461 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1462 enum isl_dim_type type
, unsigned first
, unsigned n
)
1466 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1470 bmap
= isl_basic_map_eliminate_vars(bmap
,
1471 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1474 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1476 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1479 isl_basic_map_free(bmap
);
1483 /* Return true if the definition of the given div (recursively) involves
1484 * any of the given variables.
1486 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1487 unsigned first
, unsigned n
)
1490 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1492 if (isl_int_is_zero(bmap
->div
[div
][0]))
1494 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1497 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1498 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1500 if (div_involves_vars(bmap
, i
, first
, n
))
1507 /* Remove all divs (recursively) involving any of the given dimensions
1508 * in their definitions.
1510 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1511 __isl_take isl_basic_map
*bmap
,
1512 enum isl_dim_type type
, unsigned first
, unsigned n
)
1518 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1520 first
+= isl_basic_map_offset(bmap
, type
);
1522 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1523 if (!div_involves_vars(bmap
, i
, first
, n
))
1525 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1530 isl_basic_map_free(bmap
);
1534 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1535 enum isl_dim_type type
, unsigned first
, unsigned n
)
1544 map
= isl_map_cow(map
);
1548 for (i
= 0; i
< map
->n
; ++i
) {
1549 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1560 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1561 enum isl_dim_type type
, unsigned first
, unsigned n
)
1563 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1567 /* Return true if the definition of the given div is unknown or depends
1570 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1573 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1575 if (isl_int_is_zero(bmap
->div
[div
][0]))
1578 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1579 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1581 if (div_is_unknown(bmap
, i
))
1588 /* Remove all divs that are unknown or defined in terms of unknown divs.
1590 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1591 __isl_take isl_basic_map
*bmap
)
1598 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1599 if (!div_is_unknown(bmap
, i
))
1601 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1606 isl_basic_map_free(bmap
);
1610 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1619 map
= isl_map_cow(map
);
1623 for (i
= 0; i
< map
->n
; ++i
) {
1624 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1634 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1636 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1639 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1640 __isl_take isl_basic_set
*bset
,
1641 enum isl_dim_type type
, unsigned first
, unsigned n
)
1643 return (isl_basic_set
*)
1644 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1647 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1648 enum isl_dim_type type
, unsigned first
, unsigned n
)
1655 map
= isl_map_cow(map
);
1658 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1660 for (i
= 0; i
< map
->n
; ++i
) {
1661 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1662 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1666 map
= isl_map_drop(map
, type
, first
, n
);
1673 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1674 enum isl_dim_type type
, unsigned first
, unsigned n
)
1676 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1679 /* Project out n inputs starting at first using Fourier-Motzkin */
1680 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1681 unsigned first
, unsigned n
)
1683 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1686 static void dump_term(struct isl_basic_map
*bmap
,
1687 isl_int c
, int pos
, FILE *out
)
1690 unsigned in
= isl_basic_map_n_in(bmap
);
1691 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1692 unsigned nparam
= isl_basic_map_n_param(bmap
);
1694 isl_int_print(out
, c
, 0);
1696 if (!isl_int_is_one(c
))
1697 isl_int_print(out
, c
, 0);
1698 if (pos
< 1 + nparam
) {
1699 name
= isl_dim_get_name(bmap
->dim
,
1700 isl_dim_param
, pos
- 1);
1702 fprintf(out
, "%s", name
);
1704 fprintf(out
, "p%d", pos
- 1);
1705 } else if (pos
< 1 + nparam
+ in
)
1706 fprintf(out
, "i%d", pos
- 1 - nparam
);
1707 else if (pos
< 1 + nparam
+ dim
)
1708 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1710 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1714 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1715 int sign
, FILE *out
)
1719 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1723 for (i
= 0, first
= 1; i
< len
; ++i
) {
1724 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1727 fprintf(out
, " + ");
1729 isl_int_abs(v
, c
[i
]);
1730 dump_term(bmap
, v
, i
, out
);
1737 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1738 const char *op
, FILE *out
, int indent
)
1742 fprintf(out
, "%*s", indent
, "");
1744 dump_constraint_sign(bmap
, c
, 1, out
);
1745 fprintf(out
, " %s ", op
);
1746 dump_constraint_sign(bmap
, c
, -1, out
);
1750 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1751 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1753 fprintf(out
, "%*s", indent
, "");
1754 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1759 static void dump_constraints(struct isl_basic_map
*bmap
,
1760 isl_int
**c
, unsigned n
,
1761 const char *op
, FILE *out
, int indent
)
1765 for (i
= 0; i
< n
; ++i
)
1766 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1769 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1773 unsigned total
= isl_basic_map_total_dim(bmap
);
1775 for (j
= 0; j
< 1 + total
; ++j
) {
1776 if (isl_int_is_zero(exp
[j
]))
1778 if (!first
&& isl_int_is_pos(exp
[j
]))
1780 dump_term(bmap
, exp
[j
], j
, out
);
1785 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1789 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1790 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1792 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1793 fprintf(out
, "%*s", indent
, "");
1794 fprintf(out
, "e%d = [(", i
);
1795 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1797 isl_int_print(out
, bmap
->div
[i
][0], 0);
1798 fprintf(out
, "]\n");
1802 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
1803 FILE *out
, int indent
)
1806 fprintf(out
, "null basic set\n");
1810 fprintf(out
, "%*s", indent
, "");
1811 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1812 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1813 bset
->extra
, bset
->flags
);
1814 dump((struct isl_basic_map
*)bset
, out
, indent
);
1817 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
1818 FILE *out
, int indent
)
1821 fprintf(out
, "null basic map\n");
1825 fprintf(out
, "%*s", indent
, "");
1826 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1827 "flags: %x, n_name: %d\n",
1829 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1830 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1831 dump(bmap
, out
, indent
);
1834 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1839 total
= isl_basic_map_total_dim(bmap
);
1840 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1841 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1842 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1843 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1847 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1849 struct isl_set
*set
;
1853 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1854 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1855 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1856 sizeof(struct isl_set
) +
1857 (n
- 1) * sizeof(struct isl_basic_set
*));
1861 set
->ctx
= dim
->ctx
;
1862 isl_ctx_ref(set
->ctx
);
1874 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1875 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1877 struct isl_set
*set
;
1878 struct isl_dim
*dims
;
1880 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1884 set
= isl_set_alloc_dim(dims
, n
, flags
);
1888 /* Make sure "map" has room for at least "n" more basic maps.
1890 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1893 struct isl_map
*grown
= NULL
;
1897 isl_assert(map
->ctx
, n
>= 0, goto error
);
1898 if (map
->n
+ n
<= map
->size
)
1900 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1903 for (i
= 0; i
< map
->n
; ++i
) {
1904 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1912 isl_map_free(grown
);
1917 /* Make sure "set" has room for at least "n" more basic sets.
1919 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1921 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1924 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1927 struct isl_set
*dup
;
1932 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1935 for (i
= 0; i
< set
->n
; ++i
)
1936 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1940 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1942 struct isl_set
*set
;
1947 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1949 isl_basic_set_free(bset
);
1952 return isl_set_add_basic_set(set
, bset
);
1955 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1957 struct isl_map
*map
;
1962 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1964 isl_basic_map_free(bmap
);
1967 return isl_map_add_basic_map(map
, bmap
);
1970 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1971 __isl_take isl_basic_set
*bset
)
1973 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1974 (struct isl_basic_map
*)bset
);
1977 void isl_set_free(struct isl_set
*set
)
1987 isl_ctx_deref(set
->ctx
);
1988 for (i
= 0; i
< set
->n
; ++i
)
1989 isl_basic_set_free(set
->p
[i
]);
1990 isl_dim_free(set
->dim
);
1994 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
1999 fprintf(out
, "null set\n");
2003 fprintf(out
, "%*s", indent
, "");
2004 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2005 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2007 for (i
= 0; i
< set
->n
; ++i
) {
2008 fprintf(out
, "%*s", indent
, "");
2009 fprintf(out
, "basic set %d:\n", i
);
2010 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2014 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2019 fprintf(out
, "null map\n");
2023 fprintf(out
, "%*s", indent
, "");
2024 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2025 "flags: %x, n_name: %d\n",
2026 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2027 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
2028 for (i
= 0; i
< map
->n
; ++i
) {
2029 fprintf(out
, "%*s", indent
, "");
2030 fprintf(out
, "basic map %d:\n", i
);
2031 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2035 struct isl_basic_map
*isl_basic_map_intersect_domain(
2036 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2038 struct isl_basic_map
*bmap_domain
;
2043 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2044 bset
->dim
, isl_dim_param
), goto error
);
2046 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2047 isl_assert(bset
->ctx
,
2048 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2050 bmap
= isl_basic_map_cow(bmap
);
2053 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2054 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2055 bmap_domain
= isl_basic_map_from_domain(bset
);
2056 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2058 bmap
= isl_basic_map_simplify(bmap
);
2059 return isl_basic_map_finalize(bmap
);
2061 isl_basic_map_free(bmap
);
2062 isl_basic_set_free(bset
);
2066 struct isl_basic_map
*isl_basic_map_intersect_range(
2067 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2069 struct isl_basic_map
*bmap_range
;
2074 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2075 bset
->dim
, isl_dim_param
), goto error
);
2077 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2078 isl_assert(bset
->ctx
,
2079 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2081 bmap
= isl_basic_map_cow(bmap
);
2084 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2085 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2086 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2087 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2089 bmap
= isl_basic_map_simplify(bmap
);
2090 return isl_basic_map_finalize(bmap
);
2092 isl_basic_map_free(bmap
);
2093 isl_basic_set_free(bset
);
2097 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2103 total
= 1 + isl_basic_map_total_dim(bmap
);
2104 if (total
!= vec
->size
)
2109 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2110 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2111 if (!isl_int_is_zero(s
)) {
2117 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2118 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2119 if (isl_int_is_neg(s
)) {
2130 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2132 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2135 struct isl_basic_map
*isl_basic_map_intersect(
2136 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2138 struct isl_vec
*sample
= NULL
;
2140 if (!bmap1
|| !bmap2
)
2143 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2144 bmap2
->dim
, isl_dim_param
), goto error
);
2145 if (isl_dim_total(bmap1
->dim
) ==
2146 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2147 isl_dim_total(bmap2
->dim
) !=
2148 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2149 return isl_basic_map_intersect(bmap2
, bmap1
);
2151 if (isl_dim_total(bmap2
->dim
) !=
2152 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2153 isl_assert(bmap1
->ctx
,
2154 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2156 if (bmap1
->sample
&&
2157 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2158 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2159 sample
= isl_vec_copy(bmap1
->sample
);
2160 else if (bmap2
->sample
&&
2161 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2162 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2163 sample
= isl_vec_copy(bmap2
->sample
);
2165 bmap1
= isl_basic_map_cow(bmap1
);
2168 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2169 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2170 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2173 isl_vec_free(sample
);
2175 isl_vec_free(bmap1
->sample
);
2176 bmap1
->sample
= sample
;
2179 bmap1
= isl_basic_map_simplify(bmap1
);
2180 return isl_basic_map_finalize(bmap1
);
2183 isl_vec_free(sample
);
2184 isl_basic_map_free(bmap1
);
2185 isl_basic_map_free(bmap2
);
2189 struct isl_basic_set
*isl_basic_set_intersect(
2190 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2192 return (struct isl_basic_set
*)
2193 isl_basic_map_intersect(
2194 (struct isl_basic_map
*)bset1
,
2195 (struct isl_basic_map
*)bset2
);
2198 /* Special case of isl_map_intersect, where both map1 and map2
2199 * are convex, without any divs and such that either map1 or map2
2200 * contains a single constraint. This constraint is then simply
2201 * added to the other map.
2203 static __isl_give isl_map
*map_intersect_add_constraint(
2204 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2206 struct isl_basic_map
*bmap1
;
2207 struct isl_basic_map
*bmap2
;
2209 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2210 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2211 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2212 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2214 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2215 return isl_map_intersect(map2
, map1
);
2217 isl_assert(map2
->ctx
,
2218 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2220 map1
= isl_map_cow(map1
);
2223 if (isl_map_fast_is_empty(map1
)) {
2227 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2228 if (map2
->p
[0]->n_eq
== 1)
2229 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2231 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2232 map2
->p
[0]->ineq
[0]);
2234 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2235 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2239 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2240 isl_basic_map_free(map1
->p
[0]);
2253 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2256 struct isl_map
*result
;
2262 if (isl_map_fast_is_empty(map1
)) {
2266 if (isl_map_fast_is_empty(map2
)) {
2271 if (map1
->n
== 1 && map2
->n
== 1 &&
2272 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2273 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2274 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2275 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2276 return map_intersect_add_constraint(map1
, map2
);
2277 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2278 map2
->dim
, isl_dim_param
), goto error
);
2279 if (isl_dim_total(map1
->dim
) ==
2280 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2281 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2282 return isl_map_intersect(map2
, map1
);
2284 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2285 isl_assert(map1
->ctx
,
2286 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2288 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2289 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2290 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2292 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2293 map1
->n
* map2
->n
, flags
);
2296 for (i
= 0; i
< map1
->n
; ++i
)
2297 for (j
= 0; j
< map2
->n
; ++j
) {
2298 struct isl_basic_map
*part
;
2299 part
= isl_basic_map_intersect(
2300 isl_basic_map_copy(map1
->p
[i
]),
2301 isl_basic_map_copy(map2
->p
[j
]));
2302 if (isl_basic_map_is_empty(part
))
2303 isl_basic_map_free(part
);
2305 result
= isl_map_add_basic_map(result
, part
);
2318 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2320 return (struct isl_set
*)
2321 isl_map_intersect((struct isl_map
*)set1
,
2322 (struct isl_map
*)set2
);
2325 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2327 struct isl_dim
*dim
;
2328 struct isl_basic_set
*bset
;
2333 bmap
= isl_basic_map_cow(bmap
);
2336 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2337 in
= isl_basic_map_n_in(bmap
);
2338 bset
= isl_basic_set_from_basic_map(bmap
);
2339 bset
= isl_basic_set_swap_vars(bset
, in
);
2340 return isl_basic_map_from_basic_set(bset
, dim
);
2343 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2344 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2346 struct isl_dim
*res_dim
;
2347 struct isl_basic_map
*res
;
2348 struct isl_dim_map
*dim_map
;
2349 unsigned total
, off
;
2350 enum isl_dim_type t
;
2358 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2360 total
= isl_basic_map_total_dim(bmap
) + n
;
2361 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2363 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2365 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2367 unsigned size
= isl_basic_map_dim(bmap
, t
);
2368 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2370 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2371 pos
, size
- pos
, off
+ pos
+ n
);
2373 off
+= isl_dim_size(res_dim
, t
);
2375 isl_dim_map_div(dim_map
, bmap
, off
);
2377 res
= isl_basic_map_alloc_dim(res_dim
,
2378 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2379 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2380 return isl_basic_map_finalize(res
);
2383 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2384 enum isl_dim_type type
, unsigned n
)
2388 return isl_basic_map_insert(bmap
, type
,
2389 isl_basic_map_dim(bmap
, type
), n
);
2392 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2393 enum isl_dim_type type
, unsigned n
)
2397 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2398 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2400 isl_basic_set_free(bset
);
2404 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2405 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2412 map
= isl_map_cow(map
);
2416 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2420 for (i
= 0; i
< map
->n
; ++i
) {
2421 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2432 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2433 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2435 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2438 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2439 enum isl_dim_type type
, unsigned n
)
2443 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2446 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2447 enum isl_dim_type type
, unsigned n
)
2451 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2452 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2458 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2459 __isl_take isl_basic_map
*bmap
,
2460 enum isl_dim_type dst_type
, unsigned dst_pos
,
2461 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2464 struct isl_dim_map
*dim_map
;
2465 struct isl_basic_map
*res
;
2466 enum isl_dim_type t
;
2467 unsigned total
, off
;
2474 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2477 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2480 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2482 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2483 pos(bmap
->dim
, src_type
) + src_pos
+
2484 ((src_type
< dst_type
) ? n
: 0)) {
2485 bmap
= isl_basic_map_cow(bmap
);
2489 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2490 src_type
, src_pos
, n
);
2494 bmap
= isl_basic_map_finalize(bmap
);
2499 total
= isl_basic_map_total_dim(bmap
);
2500 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2503 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2504 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2505 if (t
== dst_type
) {
2506 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2509 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2512 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2513 dst_pos
, size
- dst_pos
, off
);
2514 off
+= size
- dst_pos
;
2515 } else if (t
== src_type
) {
2516 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2519 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2520 src_pos
+ n
, size
- src_pos
- n
, off
);
2521 off
+= size
- src_pos
- n
;
2523 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2527 isl_dim_map_div(dim_map
, bmap
, off
);
2529 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2530 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2531 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2533 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2534 src_type
, src_pos
, n
);
2538 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2539 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2540 bmap
= isl_basic_map_finalize(bmap
);
2544 isl_basic_map_free(bmap
);
2548 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2549 enum isl_dim_type dst_type
, unsigned dst_pos
,
2550 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2552 return (isl_basic_set
*)isl_basic_map_move_dims(
2553 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2556 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2557 enum isl_dim_type dst_type
, unsigned dst_pos
,
2558 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2562 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2563 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2564 src_type
, src_pos
, n
);
2570 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2571 enum isl_dim_type dst_type
, unsigned dst_pos
,
2572 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2581 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2584 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2587 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2589 map
= isl_map_cow(map
);
2593 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2597 for (i
= 0; i
< map
->n
; ++i
) {
2598 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2600 src_type
, src_pos
, n
);
2611 /* Move the specified dimensions to the last columns right before
2612 * the divs. Don't change the dimension specification of bmap.
2613 * That's the responsibility of the caller.
2615 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2616 enum isl_dim_type type
, unsigned first
, unsigned n
)
2618 struct isl_dim_map
*dim_map
;
2619 struct isl_basic_map
*res
;
2620 enum isl_dim_type t
;
2621 unsigned total
, off
;
2625 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2628 total
= isl_basic_map_total_dim(bmap
);
2629 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2632 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2633 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2635 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2638 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2639 first
, n
, total
- bmap
->n_div
- n
);
2640 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2641 first
+ n
, size
- (first
+ n
), off
);
2642 off
+= size
- (first
+ n
);
2644 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2648 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2650 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2651 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2652 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2656 /* Turn the n dimensions of type type, starting at first
2657 * into existentially quantified variables.
2659 __isl_give isl_basic_map
*isl_basic_map_project_out(
2660 __isl_take isl_basic_map
*bmap
,
2661 enum isl_dim_type type
, unsigned first
, unsigned n
)
2674 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2675 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2677 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2680 bmap
= move_last(bmap
, type
, first
, n
);
2681 bmap
= isl_basic_map_cow(bmap
);
2685 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2686 old
= bmap
->block2
.data
;
2687 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2688 (bmap
->extra
+ n
) * (1 + row_size
));
2689 if (!bmap
->block2
.data
)
2691 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2694 for (i
= 0; i
< n
; ++i
) {
2695 new_div
[i
] = bmap
->block2
.data
+
2696 (bmap
->extra
+ i
) * (1 + row_size
);
2697 isl_seq_clr(new_div
[i
], 1 + row_size
);
2699 for (i
= 0; i
< bmap
->extra
; ++i
)
2700 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2702 bmap
->div
= new_div
;
2706 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2709 bmap
= isl_basic_map_simplify(bmap
);
2710 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2711 return isl_basic_map_finalize(bmap
);
2713 isl_basic_map_free(bmap
);
2717 /* Turn the n dimensions of type type, starting at first
2718 * into existentially quantified variables.
2720 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2721 enum isl_dim_type type
, unsigned first
, unsigned n
)
2723 return (isl_basic_set
*)isl_basic_map_project_out(
2724 (isl_basic_map
*)bset
, type
, first
, n
);
2727 /* Turn the n dimensions of type type, starting at first
2728 * into existentially quantified variables.
2730 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2731 enum isl_dim_type type
, unsigned first
, unsigned n
)
2741 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2743 map
= isl_map_cow(map
);
2747 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2751 for (i
= 0; i
< map
->n
; ++i
) {
2752 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2763 /* Turn the n dimensions of type type, starting at first
2764 * into existentially quantified variables.
2766 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2767 enum isl_dim_type type
, unsigned first
, unsigned n
)
2769 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2772 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2776 for (i
= 0; i
< n
; ++i
) {
2777 j
= isl_basic_map_alloc_div(bmap
);
2780 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2784 isl_basic_map_free(bmap
);
2788 struct isl_basic_map
*isl_basic_map_apply_range(
2789 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2791 struct isl_dim
*dim_result
= NULL
;
2792 struct isl_basic_map
*bmap
;
2793 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2794 struct isl_dim_map
*dim_map1
, *dim_map2
;
2796 if (!bmap1
|| !bmap2
)
2799 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2800 isl_dim_copy(bmap2
->dim
));
2802 n_in
= isl_basic_map_n_in(bmap1
);
2803 n_out
= isl_basic_map_n_out(bmap2
);
2804 n
= isl_basic_map_n_out(bmap1
);
2805 nparam
= isl_basic_map_n_param(bmap1
);
2807 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2808 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2809 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2810 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2811 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2812 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2813 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2814 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2815 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2816 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2817 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2819 bmap
= isl_basic_map_alloc_dim(dim_result
,
2820 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2821 bmap1
->n_eq
+ bmap2
->n_eq
,
2822 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2823 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2824 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2825 bmap
= add_divs(bmap
, n
);
2826 bmap
= isl_basic_map_simplify(bmap
);
2827 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2828 return isl_basic_map_finalize(bmap
);
2830 isl_basic_map_free(bmap1
);
2831 isl_basic_map_free(bmap2
);
2835 struct isl_basic_set
*isl_basic_set_apply(
2836 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2841 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2844 return (struct isl_basic_set
*)
2845 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2847 isl_basic_set_free(bset
);
2848 isl_basic_map_free(bmap
);
2852 struct isl_basic_map
*isl_basic_map_apply_domain(
2853 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2855 if (!bmap1
|| !bmap2
)
2858 isl_assert(bmap1
->ctx
,
2859 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2860 isl_assert(bmap1
->ctx
,
2861 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2864 bmap1
= isl_basic_map_reverse(bmap1
);
2865 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2866 return isl_basic_map_reverse(bmap1
);
2868 isl_basic_map_free(bmap1
);
2869 isl_basic_map_free(bmap2
);
2873 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2874 * A \cap B -> f(A) + f(B)
2876 struct isl_basic_map
*isl_basic_map_sum(
2877 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2879 unsigned n_in
, n_out
, nparam
, total
, pos
;
2880 struct isl_basic_map
*bmap
= NULL
;
2881 struct isl_dim_map
*dim_map1
, *dim_map2
;
2884 if (!bmap1
|| !bmap2
)
2887 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2890 nparam
= isl_basic_map_n_param(bmap1
);
2891 n_in
= isl_basic_map_n_in(bmap1
);
2892 n_out
= isl_basic_map_n_out(bmap1
);
2894 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2895 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2896 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2897 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2898 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2899 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2900 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2901 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2902 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2903 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2904 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2906 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2907 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2908 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2909 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2910 for (i
= 0; i
< n_out
; ++i
) {
2911 int j
= isl_basic_map_alloc_equality(bmap
);
2914 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2915 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2916 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2917 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2919 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2920 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2921 bmap
= add_divs(bmap
, 2 * n_out
);
2923 bmap
= isl_basic_map_simplify(bmap
);
2924 return isl_basic_map_finalize(bmap
);
2926 isl_basic_map_free(bmap
);
2927 isl_basic_map_free(bmap1
);
2928 isl_basic_map_free(bmap2
);
2932 /* Given two maps A -> f(A) and B -> g(B), construct a map
2933 * A \cap B -> f(A) + f(B)
2935 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2937 struct isl_map
*result
;
2943 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2945 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2946 map1
->n
* map2
->n
, 0);
2949 for (i
= 0; i
< map1
->n
; ++i
)
2950 for (j
= 0; j
< map2
->n
; ++j
) {
2951 struct isl_basic_map
*part
;
2952 part
= isl_basic_map_sum(
2953 isl_basic_map_copy(map1
->p
[i
]),
2954 isl_basic_map_copy(map2
->p
[j
]));
2955 if (isl_basic_map_is_empty(part
))
2956 isl_basic_map_free(part
);
2958 result
= isl_map_add_basic_map(result
, part
);
2971 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2972 __isl_take isl_set
*set2
)
2974 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2977 /* Given a basic map A -> f(A), construct A -> -f(A).
2979 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2984 bmap
= isl_basic_map_cow(bmap
);
2988 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2989 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2990 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2991 for (j
= 0; j
< n
; ++j
)
2992 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2993 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2994 for (j
= 0; j
< n
; ++j
)
2995 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2996 for (i
= 0; i
< bmap
->n_div
; ++i
)
2997 for (j
= 0; j
< n
; ++j
)
2998 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2999 return isl_basic_map_finalize(bmap
);
3002 /* Given a map A -> f(A), construct A -> -f(A).
3004 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3008 map
= isl_map_cow(map
);
3012 for (i
= 0; i
< map
->n
; ++i
) {
3013 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3024 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3026 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3029 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3030 * A -> floor(f(A)/d).
3032 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3035 unsigned n_in
, n_out
, nparam
, total
, pos
;
3036 struct isl_basic_map
*result
= NULL
;
3037 struct isl_dim_map
*dim_map
;
3043 nparam
= isl_basic_map_n_param(bmap
);
3044 n_in
= isl_basic_map_n_in(bmap
);
3045 n_out
= isl_basic_map_n_out(bmap
);
3047 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3048 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3049 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3050 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3051 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3052 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3054 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
3055 bmap
->n_div
+ n_out
,
3056 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3057 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
3058 result
= add_divs(result
, n_out
);
3059 for (i
= 0; i
< n_out
; ++i
) {
3061 j
= isl_basic_map_alloc_inequality(result
);
3064 isl_seq_clr(result
->ineq
[j
], 1+total
);
3065 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3066 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3067 j
= isl_basic_map_alloc_inequality(result
);
3070 isl_seq_clr(result
->ineq
[j
], 1+total
);
3071 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3072 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3073 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3076 result
= isl_basic_map_simplify(result
);
3077 return isl_basic_map_finalize(result
);
3079 isl_basic_map_free(result
);
3083 /* Given a map A -> f(A) and an integer d, construct a map
3084 * A -> floor(f(A)/d).
3086 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3090 map
= isl_map_cow(map
);
3094 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3095 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3096 for (i
= 0; i
< map
->n
; ++i
) {
3097 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3108 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3114 i
= isl_basic_map_alloc_equality(bmap
);
3117 nparam
= isl_basic_map_n_param(bmap
);
3118 n_in
= isl_basic_map_n_in(bmap
);
3119 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3120 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3121 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3122 return isl_basic_map_finalize(bmap
);
3124 isl_basic_map_free(bmap
);
3128 /* Add a constraints to "bmap" expressing i_pos < o_pos
3130 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3136 i
= isl_basic_map_alloc_inequality(bmap
);
3139 nparam
= isl_basic_map_n_param(bmap
);
3140 n_in
= isl_basic_map_n_in(bmap
);
3141 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3142 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3143 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3144 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3145 return isl_basic_map_finalize(bmap
);
3147 isl_basic_map_free(bmap
);
3151 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3153 static __isl_give isl_basic_map
*var_less_or_equal(
3154 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3160 i
= isl_basic_map_alloc_inequality(bmap
);
3163 nparam
= isl_basic_map_n_param(bmap
);
3164 n_in
= isl_basic_map_n_in(bmap
);
3165 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3166 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3167 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3168 return isl_basic_map_finalize(bmap
);
3170 isl_basic_map_free(bmap
);
3174 /* Add a constraints to "bmap" expressing i_pos > o_pos
3176 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3182 i
= isl_basic_map_alloc_inequality(bmap
);
3185 nparam
= isl_basic_map_n_param(bmap
);
3186 n_in
= isl_basic_map_n_in(bmap
);
3187 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3188 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3189 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3190 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3191 return isl_basic_map_finalize(bmap
);
3193 isl_basic_map_free(bmap
);
3197 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3199 static __isl_give isl_basic_map
*var_more_or_equal(
3200 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3206 i
= isl_basic_map_alloc_inequality(bmap
);
3209 nparam
= isl_basic_map_n_param(bmap
);
3210 n_in
= isl_basic_map_n_in(bmap
);
3211 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3212 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3213 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3214 return isl_basic_map_finalize(bmap
);
3216 isl_basic_map_free(bmap
);
3220 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3223 struct isl_basic_map
*bmap
;
3224 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3227 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3228 bmap
= var_equal(bmap
, i
);
3229 return isl_basic_map_finalize(bmap
);
3232 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3234 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3237 struct isl_basic_map
*bmap
;
3238 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3241 for (i
= 0; i
< pos
&& bmap
; ++i
)
3242 bmap
= var_equal(bmap
, i
);
3244 bmap
= var_less(bmap
, pos
);
3245 return isl_basic_map_finalize(bmap
);
3248 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3250 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3251 __isl_take isl_dim
*dim
, unsigned pos
)
3254 isl_basic_map
*bmap
;
3256 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3257 for (i
= 0; i
< pos
; ++i
)
3258 bmap
= var_equal(bmap
, i
);
3259 bmap
= var_less_or_equal(bmap
, pos
);
3260 return isl_basic_map_finalize(bmap
);
3263 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3265 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3268 struct isl_basic_map
*bmap
;
3269 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3272 for (i
= 0; i
< pos
&& bmap
; ++i
)
3273 bmap
= var_equal(bmap
, i
);
3275 bmap
= var_more(bmap
, pos
);
3276 return isl_basic_map_finalize(bmap
);
3279 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3281 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3282 __isl_take isl_dim
*dim
, unsigned pos
)
3285 isl_basic_map
*bmap
;
3287 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3288 for (i
= 0; i
< pos
; ++i
)
3289 bmap
= var_equal(bmap
, i
);
3290 bmap
= var_more_or_equal(bmap
, pos
);
3291 return isl_basic_map_finalize(bmap
);
3294 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3295 unsigned n
, int equal
)
3297 struct isl_map
*map
;
3300 if (n
== 0 && equal
)
3301 return isl_map_universe(dims
);
3303 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3305 for (i
= 0; i
+ 1 < n
; ++i
)
3306 map
= isl_map_add_basic_map(map
,
3307 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3310 map
= isl_map_add_basic_map(map
,
3311 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3313 map
= isl_map_add_basic_map(map
,
3314 isl_basic_map_less_at(dims
, n
- 1));
3321 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3325 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3328 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3330 return map_lex_lte_first(dim
, n
, 0);
3333 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3335 return map_lex_lte_first(dim
, n
, 1);
3338 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3340 return map_lex_lte(isl_dim_map(set_dim
), 0);
3343 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3345 return map_lex_lte(isl_dim_map(set_dim
), 1);
3348 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3349 unsigned n
, int equal
)
3351 struct isl_map
*map
;
3354 if (n
== 0 && equal
)
3355 return isl_map_universe(dims
);
3357 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3359 for (i
= 0; i
+ 1 < n
; ++i
)
3360 map
= isl_map_add_basic_map(map
,
3361 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3364 map
= isl_map_add_basic_map(map
,
3365 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3367 map
= isl_map_add_basic_map(map
,
3368 isl_basic_map_more_at(dims
, n
- 1));
3375 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3379 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3382 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3384 return map_lex_gte_first(dim
, n
, 0);
3387 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3389 return map_lex_gte_first(dim
, n
, 1);
3392 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3394 return map_lex_gte(isl_dim_map(set_dim
), 0);
3397 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3399 return map_lex_gte(isl_dim_map(set_dim
), 1);
3402 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3403 __isl_take isl_set
*set2
)
3406 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3407 map
= isl_map_intersect_domain(map
, set1
);
3408 map
= isl_map_intersect_range(map
, set2
);
3412 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3413 __isl_take isl_set
*set2
)
3416 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3417 map
= isl_map_intersect_domain(map
, set1
);
3418 map
= isl_map_intersect_range(map
, set2
);
3422 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3423 __isl_take isl_set
*set2
)
3426 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3427 map
= isl_map_intersect_domain(map
, set1
);
3428 map
= isl_map_intersect_range(map
, set2
);
3432 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3433 __isl_take isl_set
*set2
)
3436 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3437 map
= isl_map_intersect_domain(map
, set1
);
3438 map
= isl_map_intersect_range(map
, set2
);
3442 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3443 __isl_take isl_map
*map2
)
3446 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3447 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3448 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3452 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3453 __isl_take isl_map
*map2
)
3456 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3457 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3458 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3462 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3463 __isl_take isl_map
*map2
)
3466 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3467 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3468 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3472 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3473 __isl_take isl_map
*map2
)
3476 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3477 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3478 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3482 struct isl_basic_map
*isl_basic_map_from_basic_set(
3483 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3485 struct isl_basic_map
*bmap
;
3487 bset
= isl_basic_set_cow(bset
);
3491 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3492 isl_dim_free(bset
->dim
);
3493 bmap
= (struct isl_basic_map
*) bset
;
3495 return isl_basic_map_finalize(bmap
);
3497 isl_basic_set_free(bset
);
3502 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3506 if (bmap
->dim
->n_in
== 0)
3507 return (struct isl_basic_set
*)bmap
;
3508 bmap
= isl_basic_map_cow(bmap
);
3511 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3514 bmap
= isl_basic_map_finalize(bmap
);
3515 return (struct isl_basic_set
*)bmap
;
3517 isl_basic_map_free(bmap
);
3521 /* For a div d = floor(f/m), add the constraints
3524 * -(f-(n-1)) + m d >= 0
3526 * Note that the second constraint is the negation of
3530 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3531 unsigned pos
, isl_int
*div
)
3534 unsigned total
= isl_basic_map_total_dim(bmap
);
3536 i
= isl_basic_map_alloc_inequality(bmap
);
3539 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3540 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3542 j
= isl_basic_map_alloc_inequality(bmap
);
3545 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3546 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3547 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3551 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3552 unsigned pos
, isl_int
*div
)
3554 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3558 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3560 unsigned total
= isl_basic_map_total_dim(bmap
);
3561 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3563 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3567 struct isl_basic_set
*isl_basic_map_underlying_set(
3568 struct isl_basic_map
*bmap
)
3572 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3574 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3575 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3576 return (struct isl_basic_set
*)bmap
;
3577 bmap
= isl_basic_map_cow(bmap
);
3580 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3583 bmap
->extra
-= bmap
->n_div
;
3585 bmap
= isl_basic_map_finalize(bmap
);
3586 return (struct isl_basic_set
*)bmap
;
3591 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3592 __isl_take isl_basic_set
*bset
)
3594 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3597 struct isl_basic_map
*isl_basic_map_overlying_set(
3598 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3600 struct isl_basic_map
*bmap
;
3601 struct isl_ctx
*ctx
;
3608 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3609 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3610 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3612 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3613 isl_basic_map_free(like
);
3614 return (struct isl_basic_map
*)bset
;
3616 bset
= isl_basic_set_cow(bset
);
3619 total
= bset
->dim
->n_out
+ bset
->extra
;
3620 bmap
= (struct isl_basic_map
*)bset
;
3621 isl_dim_free(bmap
->dim
);
3622 bmap
->dim
= isl_dim_copy(like
->dim
);
3625 bmap
->n_div
= like
->n_div
;
3626 bmap
->extra
+= like
->n_div
;
3629 ltotal
= total
- bmap
->extra
+ like
->extra
;
3632 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3633 bmap
->extra
* (1 + 1 + total
));
3634 if (isl_blk_is_error(bmap
->block2
))
3636 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3640 for (i
= 0; i
< bmap
->extra
; ++i
)
3641 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3642 for (i
= 0; i
< like
->n_div
; ++i
) {
3643 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3644 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3646 bmap
= isl_basic_map_extend_constraints(bmap
,
3647 0, 2 * like
->n_div
);
3648 for (i
= 0; i
< like
->n_div
; ++i
) {
3649 if (isl_int_is_zero(bmap
->div
[i
][0]))
3651 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3655 isl_basic_map_free(like
);
3656 bmap
= isl_basic_map_simplify(bmap
);
3657 bmap
= isl_basic_map_finalize(bmap
);
3660 isl_basic_map_free(like
);
3661 isl_basic_set_free(bset
);
3665 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3666 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3668 return (struct isl_basic_set
*)
3669 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3672 struct isl_set
*isl_set_from_underlying_set(
3673 struct isl_set
*set
, struct isl_basic_set
*like
)
3679 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3681 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3682 isl_basic_set_free(like
);
3685 set
= isl_set_cow(set
);
3688 for (i
= 0; i
< set
->n
; ++i
) {
3689 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3690 isl_basic_set_copy(like
));
3694 isl_dim_free(set
->dim
);
3695 set
->dim
= isl_dim_copy(like
->dim
);
3698 isl_basic_set_free(like
);
3701 isl_basic_set_free(like
);
3706 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3710 map
= isl_map_cow(map
);
3713 map
->dim
= isl_dim_cow(map
->dim
);
3717 for (i
= 1; i
< map
->n
; ++i
)
3718 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3720 for (i
= 0; i
< map
->n
; ++i
) {
3721 map
->p
[i
] = (struct isl_basic_map
*)
3722 isl_basic_map_underlying_set(map
->p
[i
]);
3727 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3729 isl_dim_free(map
->dim
);
3730 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3734 return (struct isl_set
*)map
;
3740 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3742 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3745 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3746 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3748 bmap
= isl_basic_map_cow(bmap
);
3752 isl_dim_free(bmap
->dim
);
3755 bmap
= isl_basic_map_finalize(bmap
);
3759 isl_basic_map_free(bmap
);
3764 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3765 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3767 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3771 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3772 __isl_take isl_dim
*dim
)
3776 map
= isl_map_cow(map
);
3780 for (i
= 0; i
< map
->n
; ++i
) {
3781 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3786 isl_dim_free(map
->dim
);
3796 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3797 __isl_take isl_dim
*dim
)
3799 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3802 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3805 struct isl_basic_set
*domain
;
3811 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3813 n_in
= isl_basic_map_n_in(bmap
);
3814 n_out
= isl_basic_map_n_out(bmap
);
3815 domain
= isl_basic_set_from_basic_map(bmap
);
3816 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3818 domain
= isl_basic_set_reset_dim(domain
, dim
);
3823 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3825 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3828 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3829 __isl_take isl_basic_map
*bmap
)
3833 isl_basic_map
*domain
;
3834 isl_basic_set
*bset
;
3835 int nparam
, n_in
, n_out
;
3838 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3839 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3840 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3842 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3843 domain
= isl_basic_map_universe(dim
);
3845 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3846 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3847 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3849 total
= isl_basic_map_total_dim(bmap
);
3851 for (i
= 0; i
< n_in
; ++i
) {
3852 k
= isl_basic_map_alloc_equality(bmap
);
3855 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3856 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3857 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3860 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3861 return isl_basic_map_finalize(bmap
);
3863 isl_basic_map_free(bmap
);
3867 __isl_give isl_basic_map
*isl_basic_map_range_map(
3868 __isl_take isl_basic_map
*bmap
)
3872 isl_basic_map
*range
;
3873 isl_basic_set
*bset
;
3874 int nparam
, n_in
, n_out
;
3877 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3878 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3879 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3881 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3882 range
= isl_basic_map_universe(dim
);
3884 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3885 bmap
= isl_basic_map_apply_range(bmap
, range
);
3886 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3888 total
= isl_basic_map_total_dim(bmap
);
3890 for (i
= 0; i
< n_out
; ++i
) {
3891 k
= isl_basic_map_alloc_equality(bmap
);
3894 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3895 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3896 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3899 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3900 return isl_basic_map_finalize(bmap
);
3902 isl_basic_map_free(bmap
);
3906 struct isl_set
*isl_map_range(struct isl_map
*map
)
3909 struct isl_set
*set
;
3913 if (isl_map_dim(map
, isl_dim_in
) == 0)
3914 return (isl_set
*)map
;
3916 map
= isl_map_cow(map
);
3920 set
= (struct isl_set
*) map
;
3921 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3924 for (i
= 0; i
< map
->n
; ++i
) {
3925 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3929 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3930 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3937 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3940 isl_dim
*domain_dim
;
3942 map
= isl_map_cow(map
);
3946 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3947 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3948 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3951 for (i
= 0; i
< map
->n
; ++i
) {
3952 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3956 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3957 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3964 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3969 map
= isl_map_cow(map
);
3973 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3974 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3975 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3978 for (i
= 0; i
< map
->n
; ++i
) {
3979 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3983 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3984 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3991 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3994 struct isl_map
*map
= NULL
;
3996 set
= isl_set_cow(set
);
3999 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
4000 map
= (struct isl_map
*)set
;
4001 for (i
= 0; i
< set
->n
; ++i
) {
4002 map
->p
[i
] = isl_basic_map_from_basic_set(
4003 set
->p
[i
], isl_dim_copy(dim
));
4007 isl_dim_free(map
->dim
);
4016 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4017 __isl_take isl_basic_set
*bset
)
4019 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4022 __isl_give isl_basic_map
*isl_basic_map_from_range(
4023 __isl_take isl_basic_set
*bset
)
4025 return (isl_basic_map
*)bset
;
4028 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4030 return (struct isl_map
*)set
;
4033 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4035 return isl_map_reverse(isl_map_from_range(set
));
4038 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4039 __isl_take isl_set
*range
)
4041 return isl_map_apply_range(isl_map_from_domain(domain
),
4042 isl_map_from_range(range
));
4045 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4048 struct isl_set
*set
= NULL
;
4052 map
= isl_map_cow(map
);
4055 map
->dim
= isl_dim_as_set_dim(map
->dim
);
4058 set
= (struct isl_set
*)map
;
4059 for (i
= 0; i
< map
->n
; ++i
) {
4060 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4070 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
4072 struct isl_map
*map
;
4076 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4077 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4078 sizeof(struct isl_map
) +
4079 (n
- 1) * sizeof(struct isl_basic_map
*));
4083 map
->ctx
= dim
->ctx
;
4084 isl_ctx_ref(map
->ctx
);
4096 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4097 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4100 struct isl_map
*map
;
4101 struct isl_dim
*dims
;
4103 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4107 map
= isl_map_alloc_dim(dims
, n
, flags
);
4111 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4113 struct isl_basic_map
*bmap
;
4114 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4115 bmap
= isl_basic_map_set_to_empty(bmap
);
4119 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4121 struct isl_basic_set
*bset
;
4122 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4123 bset
= isl_basic_set_set_to_empty(bset
);
4127 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4129 struct isl_basic_map
*bmap
;
4132 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4133 bmap
= isl_basic_map_set_to_empty(bmap
);
4137 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4139 struct isl_basic_map
*bmap
;
4142 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4143 bmap
= isl_basic_map_set_to_empty(bmap
);
4147 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4149 struct isl_basic_set
*bset
;
4152 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4153 bset
= isl_basic_set_set_to_empty(bset
);
4157 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4159 struct isl_basic_map
*bmap
;
4160 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4161 bmap
= isl_basic_map_finalize(bmap
);
4165 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4167 struct isl_basic_set
*bset
;
4168 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4169 bset
= isl_basic_set_finalize(bset
);
4173 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4174 __isl_keep isl_basic_map
*model
)
4178 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4181 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4185 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4188 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4189 __isl_keep isl_set
*model
)
4193 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4196 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4198 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4201 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4205 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4208 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4212 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4215 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4217 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4220 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4224 return isl_set_empty(isl_dim_copy(model
->dim
));
4227 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4229 struct isl_map
*map
;
4232 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4233 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4237 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4239 struct isl_set
*set
;
4242 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4243 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4247 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4251 return isl_set_universe(isl_dim_copy(model
->dim
));
4254 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4257 struct isl_map
*dup
;
4261 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4262 for (i
= 0; i
< map
->n
; ++i
)
4263 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4267 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4268 __isl_take isl_basic_map
*bmap
)
4272 if (isl_basic_map_fast_is_empty(bmap
)) {
4273 isl_basic_map_free(bmap
);
4276 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4277 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4278 map
->p
[map
->n
] = bmap
;
4280 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4286 isl_basic_map_free(bmap
);
4290 void isl_map_free(struct isl_map
*map
)
4300 isl_ctx_deref(map
->ctx
);
4301 for (i
= 0; i
< map
->n
; ++i
)
4302 isl_basic_map_free(map
->p
[i
]);
4303 isl_dim_free(map
->dim
);
4307 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4308 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4312 base
= isl_map_cow(base
);
4316 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4319 for (i
= 0; i
< base
->n
; ++i
) {
4320 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4321 isl_dim_copy(base
->dim
), 0, 0, 0);
4331 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4332 unsigned nparam
, unsigned dim
)
4334 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4338 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4339 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4343 bmap
= isl_basic_map_cow(bmap
);
4344 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4345 j
= isl_basic_map_alloc_equality(bmap
);
4348 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4349 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4350 isl_int_set_si(bmap
->eq
[j
][0], value
);
4351 bmap
= isl_basic_map_simplify(bmap
);
4352 return isl_basic_map_finalize(bmap
);
4354 isl_basic_map_free(bmap
);
4358 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4359 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4363 bmap
= isl_basic_map_cow(bmap
);
4364 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4365 j
= isl_basic_map_alloc_equality(bmap
);
4368 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4369 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4370 isl_int_set(bmap
->eq
[j
][0], value
);
4371 bmap
= isl_basic_map_simplify(bmap
);
4372 return isl_basic_map_finalize(bmap
);
4374 isl_basic_map_free(bmap
);
4378 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4379 enum isl_dim_type type
, unsigned pos
, int value
)
4383 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4384 return isl_basic_map_fix_pos_si(bmap
,
4385 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4387 isl_basic_map_free(bmap
);
4391 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4392 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4396 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4397 return isl_basic_map_fix_pos(bmap
,
4398 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4400 isl_basic_map_free(bmap
);
4404 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4405 enum isl_dim_type type
, unsigned pos
, int value
)
4407 return (struct isl_basic_set
*)
4408 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4412 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4413 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4415 return (struct isl_basic_set
*)
4416 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4420 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4421 unsigned input
, int value
)
4423 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4426 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4427 unsigned dim
, int value
)
4429 return (struct isl_basic_set
*)
4430 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4431 isl_dim_set
, dim
, value
);
4434 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4435 enum isl_dim_type type
, unsigned pos
, int value
)
4439 map
= isl_map_cow(map
);
4443 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4444 for (i
= 0; i
< map
->n
; ++i
) {
4445 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4449 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4456 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4457 enum isl_dim_type type
, unsigned pos
, int value
)
4459 return (struct isl_set
*)
4460 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4463 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4464 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4468 map
= isl_map_cow(map
);
4472 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4473 for (i
= 0; i
< map
->n
; ++i
) {
4474 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4478 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4485 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4486 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4488 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4491 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4492 unsigned input
, int value
)
4494 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4497 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4499 return (struct isl_set
*)
4500 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4503 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4504 __isl_take isl_basic_map
*bmap
,
4505 enum isl_dim_type type
, unsigned pos
, int value
)
4511 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4512 pos
+= isl_basic_map_offset(bmap
, type
);
4513 bmap
= isl_basic_map_cow(bmap
);
4514 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4515 j
= isl_basic_map_alloc_inequality(bmap
);
4518 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4519 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4520 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4521 bmap
= isl_basic_map_simplify(bmap
);
4522 return isl_basic_map_finalize(bmap
);
4524 isl_basic_map_free(bmap
);
4528 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4529 unsigned dim
, isl_int value
)
4533 bset
= isl_basic_set_cow(bset
);
4534 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4535 j
= isl_basic_set_alloc_inequality(bset
);
4538 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4539 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4540 isl_int_neg(bset
->ineq
[j
][0], value
);
4541 bset
= isl_basic_set_simplify(bset
);
4542 return isl_basic_set_finalize(bset
);
4544 isl_basic_set_free(bset
);
4548 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4549 enum isl_dim_type type
, unsigned pos
, int value
)
4553 map
= isl_map_cow(map
);
4557 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4558 for (i
= 0; i
< map
->n
; ++i
) {
4559 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4564 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4571 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4572 enum isl_dim_type type
, unsigned pos
, int value
)
4574 return (struct isl_set
*)
4575 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4578 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4583 set
= isl_set_cow(set
);
4587 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4588 for (i
= 0; i
< set
->n
; ++i
) {
4589 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4599 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4603 map
= isl_map_cow(map
);
4607 map
->dim
= isl_dim_reverse(map
->dim
);
4610 for (i
= 0; i
< map
->n
; ++i
) {
4611 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4615 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4622 static struct isl_map
*isl_basic_map_partial_lexopt(
4623 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4624 struct isl_set
**empty
, int max
)
4628 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4629 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4631 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4633 isl_basic_map_free(bmap
);
4634 isl_basic_set_free(dom
);
4640 struct isl_map
*isl_basic_map_partial_lexmax(
4641 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4642 struct isl_set
**empty
)
4644 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4647 struct isl_map
*isl_basic_map_partial_lexmin(
4648 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4649 struct isl_set
**empty
)
4651 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4654 struct isl_set
*isl_basic_set_partial_lexmin(
4655 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4656 struct isl_set
**empty
)
4658 return (struct isl_set
*)
4659 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4663 struct isl_set
*isl_basic_set_partial_lexmax(
4664 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4665 struct isl_set
**empty
)
4667 return (struct isl_set
*)
4668 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4672 /* Given a basic map "bmap", compute the lexicographically minimal
4673 * (or maximal) image element for each domain element in dom.
4674 * Set *empty to those elements in dom that do not have an image element.
4676 * We first make sure the basic sets in dom are disjoint and then
4677 * simply collect the results over each of the basic sets separately.
4678 * We could probably improve the efficiency a bit by moving the union
4679 * domain down into the parametric integer programming.
4681 static __isl_give isl_map
*basic_map_partial_lexopt(
4682 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4683 __isl_give isl_set
**empty
, int max
)
4686 struct isl_map
*res
;
4688 dom
= isl_set_make_disjoint(dom
);
4692 if (isl_set_fast_is_empty(dom
)) {
4693 res
= isl_map_empty_like_basic_map(bmap
);
4694 *empty
= isl_set_empty_like(dom
);
4696 isl_basic_map_free(bmap
);
4700 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4701 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4703 for (i
= 1; i
< dom
->n
; ++i
) {
4704 struct isl_map
*res_i
;
4705 struct isl_set
*empty_i
;
4707 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4708 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4710 res
= isl_map_union_disjoint(res
, res_i
);
4711 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4715 isl_basic_map_free(bmap
);
4720 isl_basic_map_free(bmap
);
4724 /* Given a map "map", compute the lexicographically minimal
4725 * (or maximal) image element for each domain element in dom.
4726 * Set *empty to those elements in dom that do not have an image element.
4728 * We first compute the lexicographically minimal or maximal element
4729 * in the first basic map. This results in a partial solution "res"
4730 * and a subset "todo" of dom that still need to be handled.
4731 * We then consider each of the remaining maps in "map" and successively
4732 * improve both "res" and "todo".
4734 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4735 * Assume we are computing the lexicographical maximum.
4736 * We first compute the lexicographically maximal element in basic map i.
4737 * This results in a partial solution res_i and a subset todo_i.
4738 * Then we combine these results with those obtain for the first k basic maps
4739 * to obtain a result that is valid for the first k+1 basic maps.
4740 * In particular, the set where there is no solution is the set where
4741 * there is no solution for the first k basic maps and also no solution
4742 * for the ith basic map, i.e.,
4744 * todo^i = todo^k * todo_i
4746 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4747 * solutions, arbitrarily breaking ties in favor of res^k.
4748 * That is, when res^k(a) >= res_i(a), we pick res^k and
4749 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4750 * the lexicographic order.)
4751 * In practice, we compute
4753 * res^k * (res_i . "<=")
4757 * res_i * (res^k . "<")
4759 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4760 * where only one of res^k and res_i provides a solution and we simply pick
4767 * Note that we only compute these intersections when dom(res^k) intersects
4768 * dom(res_i). Otherwise, the only effect of these intersections is to
4769 * potentially break up res^k and res_i into smaller pieces.
4770 * We want to avoid such splintering as much as possible.
4771 * In fact, an earlier implementation of this function would look for
4772 * better results in the domain of res^k and for extra results in todo^k,
4773 * but this would always result in a splintering according to todo^k,
4774 * even when the domain of basic map i is disjoint from the domains of
4775 * the previous basic maps.
4777 static __isl_give isl_map
*isl_map_partial_lexopt(
4778 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4779 __isl_give isl_set
**empty
, int max
)
4782 struct isl_map
*res
;
4783 struct isl_set
*todo
;
4788 if (isl_map_fast_is_empty(map
)) {
4796 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4797 isl_set_copy(dom
), &todo
, max
);
4799 for (i
= 1; i
< map
->n
; ++i
) {
4803 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
4805 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4806 isl_set_copy(dom
), &todo_i
, max
);
4809 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
4810 le
= isl_map_lex_le(dim
);
4812 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
4813 le
= isl_map_lex_ge(dim
);
4815 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4816 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
4817 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
4818 le
= isl_map_intersect(le
, isl_map_copy(res
));
4820 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
4821 res
= isl_map_intersect_domain(res
,
4822 isl_set_copy(todo_i
));
4823 res_i
= isl_map_intersect_domain(res_i
,
4824 isl_set_copy(todo
));
4827 res
= isl_map_union_disjoint(res
, res_i
);
4828 res
= isl_map_union_disjoint(res
, lt
);
4829 res
= isl_map_union_disjoint(res
, le
);
4831 todo
= isl_set_intersect(todo
, todo_i
);
4851 __isl_give isl_map
*isl_map_partial_lexmax(
4852 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4853 __isl_give isl_set
**empty
)
4855 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4858 __isl_give isl_map
*isl_map_partial_lexmin(
4859 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4860 __isl_give isl_set
**empty
)
4862 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4865 __isl_give isl_set
*isl_set_partial_lexmin(
4866 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4867 __isl_give isl_set
**empty
)
4869 return (struct isl_set
*)
4870 isl_map_partial_lexmin((struct isl_map
*)set
,
4874 __isl_give isl_set
*isl_set_partial_lexmax(
4875 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4876 __isl_give isl_set
**empty
)
4878 return (struct isl_set
*)
4879 isl_map_partial_lexmax((struct isl_map
*)set
,
4883 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4885 struct isl_basic_set
*dom
= NULL
;
4886 struct isl_dim
*dom_dim
;
4890 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4891 dom
= isl_basic_set_universe(dom_dim
);
4892 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4894 isl_basic_map_free(bmap
);
4898 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4900 return isl_basic_map_lexopt(bmap
, 0);
4903 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4905 return isl_basic_map_lexopt(bmap
, 1);
4908 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4910 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4913 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4915 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4918 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4920 struct isl_set
*dom
= NULL
;
4921 struct isl_dim
*dom_dim
;
4925 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4926 dom
= isl_set_universe(dom_dim
);
4927 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4933 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4935 return isl_map_lexopt(map
, 0);
4938 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4940 return isl_map_lexopt(map
, 1);
4943 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4945 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4948 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4950 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4953 /* Apply a preimage specified by "mat" on the parameters of "bset".
4954 * bset is assumed to have only parameters and divs.
4956 static struct isl_basic_set
*basic_set_parameter_preimage(
4957 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4964 bset
->dim
= isl_dim_cow(bset
->dim
);
4968 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4970 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4972 bset
->dim
->nparam
= 0;
4973 bset
->dim
->n_out
= nparam
;
4974 bset
= isl_basic_set_preimage(bset
, mat
);
4976 bset
->dim
->nparam
= bset
->dim
->n_out
;
4977 bset
->dim
->n_out
= 0;
4982 isl_basic_set_free(bset
);
4986 /* Apply a preimage specified by "mat" on the parameters of "set".
4987 * set is assumed to have only parameters and divs.
4989 static struct isl_set
*set_parameter_preimage(
4990 struct isl_set
*set
, struct isl_mat
*mat
)
4992 struct isl_dim
*dim
= NULL
;
4998 dim
= isl_dim_copy(set
->dim
);
4999 dim
= isl_dim_cow(dim
);
5003 nparam
= isl_set_dim(set
, isl_dim_param
);
5005 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5008 dim
->n_out
= nparam
;
5009 isl_set_reset_dim(set
, dim
);
5010 set
= isl_set_preimage(set
, mat
);
5013 dim
= isl_dim_copy(set
->dim
);
5014 dim
= isl_dim_cow(dim
);
5017 dim
->nparam
= dim
->n_out
;
5019 isl_set_reset_dim(set
, dim
);
5029 /* Intersect the basic set "bset" with the affine space specified by the
5030 * equalities in "eq".
5032 static struct isl_basic_set
*basic_set_append_equalities(
5033 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5041 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
5046 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
5047 for (i
= 0; i
< eq
->n_row
; ++i
) {
5048 k
= isl_basic_set_alloc_equality(bset
);
5051 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5052 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5056 bset
= isl_basic_set_gauss(bset
, NULL
);
5057 bset
= isl_basic_set_finalize(bset
);
5062 isl_basic_set_free(bset
);
5066 /* Intersect the set "set" with the affine space specified by the
5067 * equalities in "eq".
5069 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5077 for (i
= 0; i
< set
->n
; ++i
) {
5078 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5091 /* Project the given basic set onto its parameter domain, possibly introducing
5092 * new, explicit, existential variables in the constraints.
5093 * The input has parameters and (possibly implicit) existential variables.
5094 * The output has the same parameters, but only
5095 * explicit existentially quantified variables.
5097 * The actual projection is performed by pip, but pip doesn't seem
5098 * to like equalities very much, so we first remove the equalities
5099 * among the parameters by performing a variable compression on
5100 * the parameters. Afterward, an inverse transformation is performed
5101 * and the equalities among the parameters are inserted back in.
5103 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5107 struct isl_mat
*T
, *T2
;
5108 struct isl_set
*set
;
5109 unsigned nparam
, n_div
;
5111 bset
= isl_basic_set_cow(bset
);
5115 if (bset
->n_eq
== 0)
5116 return isl_basic_set_lexmin(bset
);
5118 isl_basic_set_gauss(bset
, NULL
);
5120 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5121 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5123 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5124 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5127 if (i
== bset
->n_eq
)
5128 return isl_basic_set_lexmin(bset
);
5130 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5132 eq
= isl_mat_cow(eq
);
5133 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5134 if (T
&& T
->n_col
== 0) {
5138 bset
= isl_basic_set_set_to_empty(bset
);
5139 return isl_set_from_basic_set(bset
);
5141 bset
= basic_set_parameter_preimage(bset
, T
);
5143 set
= isl_basic_set_lexmin(bset
);
5144 set
= set_parameter_preimage(set
, T2
);
5145 set
= set_append_equalities(set
, eq
);
5149 /* Compute an explicit representation for all the existentially
5150 * quantified variables.
5151 * The input and output dimensions are first turned into parameters.
5152 * compute_divs then returns a map with the same parameters and
5153 * no input or output dimensions and the dimension specification
5154 * is reset to that of the input.
5156 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5158 struct isl_basic_set
*bset
;
5159 struct isl_set
*set
;
5160 struct isl_map
*map
;
5161 struct isl_dim
*dim
, *orig_dim
= NULL
;
5166 bmap
= isl_basic_map_cow(bmap
);
5170 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5171 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5172 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5173 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5177 orig_dim
= bmap
->dim
;
5179 bset
= (struct isl_basic_set
*)bmap
;
5181 set
= parameter_compute_divs(bset
);
5182 map
= (struct isl_map
*)set
;
5183 map
= isl_map_reset_dim(map
, orig_dim
);
5187 isl_basic_map_free(bmap
);
5191 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5199 off
= isl_dim_total(bmap
->dim
);
5200 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5201 if (isl_int_is_zero(bmap
->div
[i
][0]))
5203 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5209 static int map_divs_known(__isl_keep isl_map
*map
)
5216 for (i
= 0; i
< map
->n
; ++i
) {
5217 int known
= basic_map_divs_known(map
->p
[i
]);
5225 /* If bmap contains any unknown divs, then compute explicit
5226 * expressions for them. However, this computation may be
5227 * quite expensive, so first try to remove divs that aren't
5230 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5234 struct isl_map
*map
;
5236 known
= basic_map_divs_known(bmap
);
5240 return isl_map_from_basic_map(bmap
);
5242 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5244 known
= basic_map_divs_known(bmap
);
5248 return isl_map_from_basic_map(bmap
);
5250 map
= compute_divs(bmap
);
5253 isl_basic_map_free(bmap
);
5257 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5261 struct isl_map
*res
;
5268 known
= map_divs_known(map
);
5276 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5277 for (i
= 1 ; i
< map
->n
; ++i
) {
5279 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5280 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5281 res
= isl_map_union_disjoint(res
, r2
);
5283 res
= isl_map_union(res
, r2
);
5290 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5292 return (struct isl_set
*)
5293 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5296 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5298 return (struct isl_set
*)
5299 isl_map_compute_divs((struct isl_map
*)set
);
5302 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5305 struct isl_set
*set
;
5310 map
= isl_map_cow(map
);
5314 set
= (struct isl_set
*)map
;
5315 set
->dim
= isl_dim_domain(set
->dim
);
5318 for (i
= 0; i
< map
->n
; ++i
) {
5319 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5323 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5324 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5331 struct isl_map
*isl_map_union_disjoint(
5332 struct isl_map
*map1
, struct isl_map
*map2
)
5336 struct isl_map
*map
= NULL
;
5350 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5352 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5353 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5354 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5356 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5357 map1
->n
+ map2
->n
, flags
);
5360 for (i
= 0; i
< map1
->n
; ++i
) {
5361 map
= isl_map_add_basic_map(map
,
5362 isl_basic_map_copy(map1
->p
[i
]));
5366 for (i
= 0; i
< map2
->n
; ++i
) {
5367 map
= isl_map_add_basic_map(map
,
5368 isl_basic_map_copy(map2
->p
[i
]));
5382 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5384 map1
= isl_map_union_disjoint(map1
, map2
);
5388 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5392 struct isl_set
*isl_set_union_disjoint(
5393 struct isl_set
*set1
, struct isl_set
*set2
)
5395 return (struct isl_set
*)
5396 isl_map_union_disjoint(
5397 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5400 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5402 return (struct isl_set
*)
5403 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5406 struct isl_map
*isl_map_intersect_range(
5407 struct isl_map
*map
, struct isl_set
*set
)
5410 struct isl_map
*result
;
5416 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5417 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5418 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5420 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5421 map
->n
* set
->n
, flags
);
5424 for (i
= 0; i
< map
->n
; ++i
)
5425 for (j
= 0; j
< set
->n
; ++j
) {
5426 result
= isl_map_add_basic_map(result
,
5427 isl_basic_map_intersect_range(
5428 isl_basic_map_copy(map
->p
[i
]),
5429 isl_basic_set_copy(set
->p
[j
])));
5442 struct isl_map
*isl_map_intersect_domain(
5443 struct isl_map
*map
, struct isl_set
*set
)
5445 return isl_map_reverse(
5446 isl_map_intersect_range(isl_map_reverse(map
), set
));
5449 struct isl_map
*isl_map_apply_domain(
5450 struct isl_map
*map1
, struct isl_map
*map2
)
5454 map1
= isl_map_reverse(map1
);
5455 map1
= isl_map_apply_range(map1
, map2
);
5456 return isl_map_reverse(map1
);
5463 struct isl_map
*isl_map_apply_range(
5464 struct isl_map
*map1
, struct isl_map
*map2
)
5466 struct isl_dim
*dim_result
;
5467 struct isl_map
*result
;
5473 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5474 isl_dim_copy(map2
->dim
));
5476 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5479 for (i
= 0; i
< map1
->n
; ++i
)
5480 for (j
= 0; j
< map2
->n
; ++j
) {
5481 result
= isl_map_add_basic_map(result
,
5482 isl_basic_map_apply_range(
5483 isl_basic_map_copy(map1
->p
[i
]),
5484 isl_basic_map_copy(map2
->p
[j
])));
5490 if (result
&& result
->n
<= 1)
5491 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5500 * returns range - domain
5502 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5504 isl_dim
*dims
, *target_dim
;
5505 struct isl_basic_set
*bset
;
5512 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5513 bmap
->dim
, isl_dim_out
),
5515 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5516 dim
= isl_basic_map_n_in(bmap
);
5517 nparam
= isl_basic_map_n_param(bmap
);
5518 bset
= isl_basic_set_from_basic_map(bmap
);
5519 bset
= isl_basic_set_cow(bset
);
5520 dims
= isl_basic_set_get_dim(bset
);
5521 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5522 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5523 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5524 for (i
= 0; i
< dim
; ++i
) {
5525 int j
= isl_basic_map_alloc_equality(
5526 (struct isl_basic_map
*)bset
);
5529 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5530 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5531 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5532 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5534 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5535 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5538 isl_basic_map_free(bmap
);
5543 * returns range - domain
5545 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5549 struct isl_set
*result
;
5554 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5555 map
->dim
, isl_dim_out
),
5557 dim
= isl_map_get_dim(map
);
5558 dim
= isl_dim_domain(dim
);
5559 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5562 for (i
= 0; i
< map
->n
; ++i
)
5563 result
= isl_set_add_basic_set(result
,
5564 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5572 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5574 struct isl_basic_map
*bmap
;
5582 nparam
= dims
->nparam
;
5584 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5588 for (i
= 0; i
< dim
; ++i
) {
5589 int j
= isl_basic_map_alloc_equality(bmap
);
5592 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5593 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5594 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5596 return isl_basic_map_finalize(bmap
);
5598 isl_basic_map_free(bmap
);
5602 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5604 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5607 return basic_map_identity(dim
);
5610 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5612 if (!model
|| !model
->dim
)
5614 isl_assert(model
->ctx
,
5615 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5616 return basic_map_identity(isl_dim_copy(model
->dim
));
5619 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5621 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5622 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5625 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5627 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5630 return map_identity(dim
);
5633 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5635 if (!model
|| !model
->dim
)
5637 isl_assert(model
->ctx
,
5638 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5639 return map_identity(isl_dim_copy(model
->dim
));
5642 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5644 if (!model
|| !model
->dim
)
5646 isl_assert(model
->ctx
,
5647 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5648 return map_identity(isl_dim_copy(model
->dim
));
5651 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5653 isl_dim
*dim
= isl_set_get_dim(set
);
5655 id
= isl_map_identity(dim
);
5656 return isl_map_intersect_range(id
, set
);
5659 /* Construct a basic set with all set dimensions having only non-negative
5662 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5667 struct isl_basic_set
*bset
;
5671 nparam
= dims
->nparam
;
5673 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5676 for (i
= 0; i
< dim
; ++i
) {
5677 int k
= isl_basic_set_alloc_inequality(bset
);
5680 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5681 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5685 isl_basic_set_free(bset
);
5689 /* Construct the half-space x_pos >= 0.
5691 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
5695 isl_basic_set
*nonneg
;
5697 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5698 k
= isl_basic_set_alloc_inequality(nonneg
);
5701 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5702 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
5704 return isl_basic_set_finalize(nonneg
);
5706 isl_basic_set_free(nonneg
);
5710 /* Construct the half-space x_pos <= -1.
5712 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
5717 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5718 k
= isl_basic_set_alloc_inequality(neg
);
5721 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5722 isl_int_set_si(neg
->ineq
[k
][0], -1);
5723 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
5725 return isl_basic_set_finalize(neg
);
5727 isl_basic_set_free(neg
);
5731 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5732 enum isl_dim_type type
, unsigned first
, unsigned n
)
5735 isl_basic_set
*nonneg
;
5743 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5745 for (i
= 0; i
< n
; ++i
) {
5746 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
5747 pos(set
->dim
, type
) + first
+ i
);
5748 neg
= neg_halfspace(isl_set_get_dim(set
),
5749 pos(set
->dim
, type
) + first
+ i
);
5751 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5760 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
5761 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5768 if (isl_set_fast_is_empty(set
)) {
5773 return fn(set
, signs
, user
);
5776 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
5778 half
= isl_set_intersect(half
, isl_set_copy(set
));
5779 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
5783 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
5785 half
= isl_set_intersect(half
, set
);
5786 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
5792 /* Call "fn" on the intersections of "set" with each of the orthants
5793 * (except for obviously empty intersections). The orthant is identified
5794 * by the signs array, with each entry having value 1 or -1 according
5795 * to the sign of the corresponding variable.
5797 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
5798 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5808 if (isl_set_fast_is_empty(set
))
5811 nparam
= isl_set_dim(set
, isl_dim_param
);
5812 nvar
= isl_set_dim(set
, isl_dim_set
);
5814 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
5816 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
5824 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5826 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5829 int isl_basic_map_is_subset(
5830 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5833 struct isl_map
*map1
;
5834 struct isl_map
*map2
;
5836 if (!bmap1
|| !bmap2
)
5839 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5840 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5842 is_subset
= isl_map_is_subset(map1
, map2
);
5850 int isl_basic_map_is_equal(
5851 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5855 if (!bmap1
|| !bmap2
)
5857 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5860 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5864 int isl_basic_set_is_equal(
5865 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5867 return isl_basic_map_is_equal(
5868 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5871 int isl_map_is_empty(struct isl_map
*map
)
5878 for (i
= 0; i
< map
->n
; ++i
) {
5879 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5888 int isl_map_fast_is_empty(struct isl_map
*map
)
5890 return map
? map
->n
== 0 : -1;
5893 int isl_set_fast_is_empty(struct isl_set
*set
)
5895 return set
? set
->n
== 0 : -1;
5898 int isl_set_is_empty(struct isl_set
*set
)
5900 return isl_map_is_empty((struct isl_map
*)set
);
5903 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5908 return isl_dim_equal(map1
->dim
, map2
->dim
);
5911 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5916 return isl_dim_equal(set1
->dim
, set2
->dim
);
5919 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5925 is_subset
= isl_map_is_subset(map1
, map2
);
5928 is_subset
= isl_map_is_subset(map2
, map1
);
5932 int isl_basic_map_is_strict_subset(
5933 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5937 if (!bmap1
|| !bmap2
)
5939 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5942 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5943 if (is_subset
== -1)
5948 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5954 is_subset
= isl_map_is_subset(map1
, map2
);
5957 is_subset
= isl_map_is_subset(map2
, map1
);
5958 if (is_subset
== -1)
5963 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5965 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5968 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5972 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5975 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5979 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5982 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5989 for (i
= 0; i
< map
->n
; ++i
) {
5990 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5998 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6000 return isl_map_fast_is_universe((isl_map
*) set
);
6003 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6005 struct isl_basic_set
*bset
= NULL
;
6006 struct isl_vec
*sample
= NULL
;
6013 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6016 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6017 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6018 copy
= isl_basic_map_remove_redundancies(copy
);
6019 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6020 isl_basic_map_free(copy
);
6024 total
= 1 + isl_basic_map_total_dim(bmap
);
6025 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6026 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6032 isl_vec_free(bmap
->sample
);
6033 bmap
->sample
= NULL
;
6034 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6037 sample
= isl_basic_set_sample_vec(bset
);
6040 empty
= sample
->size
== 0;
6041 isl_vec_free(bmap
->sample
);
6042 bmap
->sample
= sample
;
6044 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6049 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
6053 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6056 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
6060 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6063 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6065 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6068 struct isl_map
*isl_basic_map_union(
6069 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6071 struct isl_map
*map
;
6072 if (!bmap1
|| !bmap2
)
6075 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6077 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6080 map
= isl_map_add_basic_map(map
, bmap1
);
6081 map
= isl_map_add_basic_map(map
, bmap2
);
6084 isl_basic_map_free(bmap1
);
6085 isl_basic_map_free(bmap2
);
6089 struct isl_set
*isl_basic_set_union(
6090 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6092 return (struct isl_set
*)isl_basic_map_union(
6093 (struct isl_basic_map
*)bset1
,
6094 (struct isl_basic_map
*)bset2
);
6097 /* Order divs such that any div only depends on previous divs */
6098 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6106 off
= isl_dim_total(bmap
->dim
);
6108 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6110 if (isl_int_is_zero(bmap
->div
[i
][0]))
6112 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6116 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6122 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6124 return (struct isl_basic_set
*)
6125 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6128 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6135 for (i
= 0; i
< map
->n
; ++i
) {
6136 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6147 /* Look for a div in dst that corresponds to the div "div" in src.
6148 * The divs before "div" in src and dst are assumed to be the same.
6150 * Returns -1 if no corresponding div was found and the position
6151 * of the corresponding div in dst otherwise.
6153 static int find_div(struct isl_basic_map
*dst
,
6154 struct isl_basic_map
*src
, unsigned div
)
6158 unsigned total
= isl_dim_total(src
->dim
);
6160 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6161 for (i
= div
; i
< dst
->n_div
; ++i
)
6162 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6163 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6164 dst
->n_div
- div
) == -1)
6169 struct isl_basic_map
*isl_basic_map_align_divs(
6170 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6173 unsigned total
= isl_dim_total(src
->dim
);
6178 if (src
->n_div
== 0)
6181 for (i
= 0; i
< src
->n_div
; ++i
)
6182 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6184 src
= isl_basic_map_order_divs(src
);
6185 dst
= isl_basic_map_cow(dst
);
6186 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6187 src
->n_div
, 0, 2 * src
->n_div
);
6190 for (i
= 0; i
< src
->n_div
; ++i
) {
6191 int j
= find_div(dst
, src
, i
);
6193 j
= isl_basic_map_alloc_div(dst
);
6196 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6197 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6198 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6202 isl_basic_map_swap_div(dst
, i
, j
);
6206 isl_basic_map_free(dst
);
6210 struct isl_basic_set
*isl_basic_set_align_divs(
6211 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6213 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6214 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6217 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6225 map
= isl_map_compute_divs(map
);
6226 map
= isl_map_cow(map
);
6230 for (i
= 1; i
< map
->n
; ++i
)
6231 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6232 for (i
= 1; i
< map
->n
; ++i
)
6233 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6235 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6239 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6241 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6244 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6248 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6249 map
= isl_map_intersect_domain(map
, set
);
6250 set
= isl_map_range(map
);
6258 /* There is no need to cow as removing empty parts doesn't change
6259 * the meaning of the set.
6261 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6268 for (i
= map
->n
-1; i
>= 0; --i
) {
6269 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6271 isl_basic_map_free(map
->p
[i
]);
6272 if (i
!= map
->n
-1) {
6273 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6274 map
->p
[i
] = map
->p
[map
->n
-1];
6282 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6284 return (struct isl_set
*)
6285 isl_map_remove_empty_parts((struct isl_map
*)set
);
6288 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6290 struct isl_basic_map
*bmap
;
6291 if (!map
|| map
->n
== 0)
6293 bmap
= map
->p
[map
->n
-1];
6294 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6295 return isl_basic_map_copy(bmap
);
6298 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6300 return (struct isl_basic_set
*)
6301 isl_map_copy_basic_map((struct isl_map
*)set
);
6304 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6305 __isl_keep isl_basic_map
*bmap
)
6311 for (i
= map
->n
-1; i
>= 0; --i
) {
6312 if (map
->p
[i
] != bmap
)
6314 map
= isl_map_cow(map
);
6317 isl_basic_map_free(map
->p
[i
]);
6318 if (i
!= map
->n
-1) {
6319 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6320 map
->p
[i
] = map
->p
[map
->n
-1];
6331 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6332 struct isl_basic_set
*bset
)
6334 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6335 (struct isl_basic_map
*)bset
);
6338 /* Given two basic sets bset1 and bset2, compute the maximal difference
6339 * between the values of dimension pos in bset1 and those in bset2
6340 * for any common value of the parameters and dimensions preceding pos.
6342 static enum isl_lp_result
basic_set_maximal_difference_at(
6343 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6344 int pos
, isl_int
*opt
)
6346 struct isl_dim
*dims
;
6347 struct isl_basic_map
*bmap1
= NULL
;
6348 struct isl_basic_map
*bmap2
= NULL
;
6349 struct isl_ctx
*ctx
;
6350 struct isl_vec
*obj
;
6353 unsigned dim1
, dim2
;
6354 enum isl_lp_result res
;
6356 if (!bset1
|| !bset2
)
6357 return isl_lp_error
;
6359 nparam
= isl_basic_set_n_param(bset1
);
6360 dim1
= isl_basic_set_n_dim(bset1
);
6361 dim2
= isl_basic_set_n_dim(bset2
);
6362 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6363 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6364 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6365 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6366 if (!bmap1
|| !bmap2
)
6368 bmap1
= isl_basic_map_cow(bmap1
);
6369 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6370 pos
, (dim1
- pos
) + (dim2
- pos
),
6371 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6372 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6375 total
= isl_basic_map_total_dim(bmap1
);
6377 obj
= isl_vec_alloc(ctx
, 1 + total
);
6378 isl_seq_clr(obj
->block
.data
, 1 + total
);
6379 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6380 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6383 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6385 isl_basic_map_free(bmap1
);
6389 isl_basic_map_free(bmap1
);
6390 isl_basic_map_free(bmap2
);
6391 return isl_lp_error
;
6394 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6395 * for any common value of the parameters and dimensions preceding pos
6396 * in both basic sets, the values of dimension pos in bset1 are
6397 * smaller or larger than those in bset2.
6400 * 1 if bset1 follows bset2
6401 * -1 if bset1 precedes bset2
6402 * 0 if bset1 and bset2 are incomparable
6403 * -2 if some error occurred.
6405 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6406 struct isl_basic_set
*bset2
, int pos
)
6409 enum isl_lp_result res
;
6414 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6416 if (res
== isl_lp_empty
)
6418 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6419 res
== isl_lp_unbounded
)
6421 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6430 /* Given two basic sets bset1 and bset2, check whether
6431 * for any common value of the parameters and dimensions preceding pos
6432 * there is a value of dimension pos in bset1 that is larger
6433 * than a value of the same dimension in bset2.
6436 * 1 if there exists such a pair
6437 * 0 if there is no such pair, but there is a pair of equal values
6439 * -2 if some error occurred.
6441 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6442 __isl_keep isl_basic_set
*bset2
, int pos
)
6445 enum isl_lp_result res
;
6450 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6452 if (res
== isl_lp_empty
)
6454 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6455 res
== isl_lp_unbounded
)
6457 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6459 else if (res
== isl_lp_ok
)
6468 /* Given two sets set1 and set2, check whether
6469 * for any common value of the parameters and dimensions preceding pos
6470 * there is a value of dimension pos in set1 that is larger
6471 * than a value of the same dimension in set2.
6474 * 1 if there exists such a pair
6475 * 0 if there is no such pair, but there is a pair of equal values
6477 * -2 if some error occurred.
6479 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6480 __isl_keep isl_set
*set2
, int pos
)
6488 for (i
= 0; i
< set1
->n
; ++i
)
6489 for (j
= 0; j
< set2
->n
; ++j
) {
6491 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6492 if (f
== 1 || f
== -2)
6501 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6502 unsigned pos
, isl_int
*val
)
6510 total
= isl_basic_map_total_dim(bmap
);
6511 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6512 for (; d
+1 > pos
; --d
)
6513 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6517 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6519 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6521 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6524 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6530 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6531 unsigned pos
, isl_int
*val
)
6543 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6546 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6547 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6548 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6549 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6553 isl_int_set(*val
, v
);
6559 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6560 unsigned pos
, isl_int
*val
)
6562 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6566 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6569 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6572 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6573 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6575 if (pos
>= isl_basic_map_dim(bmap
, type
))
6577 return isl_basic_map_fast_has_fixed_var(bmap
,
6578 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6581 int isl_map_fast_is_fixed(struct isl_map
*map
,
6582 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6584 if (pos
>= isl_map_dim(map
, type
))
6586 return isl_map_fast_has_fixed_var(map
,
6587 map_offset(map
, type
) - 1 + pos
, val
);
6590 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6591 * then return this fixed value in *val.
6593 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6596 return isl_basic_set_fast_has_fixed_var(bset
,
6597 isl_basic_set_n_param(bset
) + dim
, val
);
6600 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6601 * then return this fixed value in *val.
6603 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6605 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6608 /* Check if input variable in has fixed value and if so and if val is not NULL,
6609 * then return this fixed value in *val.
6611 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6613 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6616 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6617 * and if val is not NULL, then return this lower bound in *val.
6619 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6620 unsigned dim
, isl_int
*val
)
6622 int i
, i_eq
= -1, i_ineq
= -1;
6629 total
= isl_basic_set_total_dim(bset
);
6630 nparam
= isl_basic_set_n_param(bset
);
6631 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6632 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6638 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6639 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6641 if (i_eq
!= -1 || i_ineq
!= -1)
6645 if (i_eq
== -1 && i_ineq
== -1)
6647 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6648 /* The coefficient should always be one due to normalization. */
6649 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6651 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6653 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6654 total
- nparam
- dim
- 1) != -1)
6657 isl_int_neg(*val
, c
[0]);
6661 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6662 unsigned dim
, isl_int
*val
)
6674 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6678 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6680 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6681 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6683 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6687 isl_int_set(*val
, v
);
6698 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6700 const struct constraint
*c1
= (const struct constraint
*)p1
;
6701 const struct constraint
*c2
= (const struct constraint
*)p2
;
6702 unsigned size
= isl_min(c1
->size
, c2
->size
);
6703 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6706 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6707 struct isl_basic_map
*bmap
)
6710 struct constraint
*c
;
6715 total
= isl_basic_map_total_dim(bmap
);
6716 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6719 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6721 c
[i
].c
= bmap
->ineq
[i
];
6723 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6724 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6725 bmap
->ineq
[i
] = c
[i
].c
;
6729 isl_basic_map_free(bmap
);
6733 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6734 __isl_take isl_basic_set
*bset
)
6736 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6737 (struct isl_basic_map
*)bset
);
6740 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6744 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6746 bmap
= isl_basic_map_remove_redundancies(bmap
);
6747 bmap
= isl_basic_map_sort_constraints(bmap
);
6748 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6752 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6754 return (struct isl_basic_set
*)isl_basic_map_normalize(
6755 (struct isl_basic_map
*)bset
);
6758 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6759 const __isl_keep isl_basic_map
*bmap2
)
6766 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6767 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6768 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6769 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6770 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6771 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6772 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6773 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6775 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6777 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6779 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6780 return bmap1
->n_eq
- bmap2
->n_eq
;
6781 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6782 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6783 if (bmap1
->n_div
!= bmap2
->n_div
)
6784 return bmap1
->n_div
- bmap2
->n_div
;
6785 total
= isl_basic_map_total_dim(bmap1
);
6786 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6787 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6791 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6792 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6796 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6797 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6804 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6805 __isl_keep isl_basic_map
*bmap2
)
6807 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6810 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6811 __isl_keep isl_basic_set
*bset2
)
6813 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6814 (isl_basic_map
*)bset2
);
6817 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6819 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6820 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6822 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6825 /* We normalize in place, but if anything goes wrong we need
6826 * to return NULL, so we need to make sure we don't change the
6827 * meaning of any possible other copies of map.
6829 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6832 struct isl_basic_map
*bmap
;
6836 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6838 for (i
= 0; i
< map
->n
; ++i
) {
6839 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6842 isl_basic_map_free(map
->p
[i
]);
6845 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6846 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6847 map
= isl_map_remove_empty_parts(map
);
6850 for (i
= map
->n
- 1; i
>= 1; --i
) {
6851 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6853 isl_basic_map_free(map
->p
[i
-1]);
6854 for (j
= i
; j
< map
->n
; ++j
)
6855 map
->p
[j
-1] = map
->p
[j
];
6865 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6867 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6870 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6880 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6883 map1
= isl_map_copy(map1
);
6884 map2
= isl_map_copy(map2
);
6885 map1
= isl_map_normalize(map1
);
6886 map2
= isl_map_normalize(map2
);
6889 equal
= map1
->n
== map2
->n
;
6890 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6891 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6904 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6906 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6907 (struct isl_map
*)set2
);
6910 /* Return an interval that ranges from min to max (inclusive)
6912 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6913 isl_int min
, isl_int max
)
6916 struct isl_basic_set
*bset
= NULL
;
6918 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6922 k
= isl_basic_set_alloc_inequality(bset
);
6925 isl_int_set_si(bset
->ineq
[k
][1], 1);
6926 isl_int_neg(bset
->ineq
[k
][0], min
);
6928 k
= isl_basic_set_alloc_inequality(bset
);
6931 isl_int_set_si(bset
->ineq
[k
][1], -1);
6932 isl_int_set(bset
->ineq
[k
][0], max
);
6936 isl_basic_set_free(bset
);
6940 /* Return the Cartesian product of the basic sets in list (in the given order).
6942 __isl_give isl_basic_set
*isl_basic_set_list_product(
6943 __isl_take
struct isl_basic_set_list
*list
)
6951 struct isl_basic_set
*product
= NULL
;
6955 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6956 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6957 nparam
= isl_basic_set_n_param(list
->p
[0]);
6958 dim
= isl_basic_set_n_dim(list
->p
[0]);
6959 extra
= list
->p
[0]->n_div
;
6960 n_eq
= list
->p
[0]->n_eq
;
6961 n_ineq
= list
->p
[0]->n_ineq
;
6962 for (i
= 1; i
< list
->n
; ++i
) {
6963 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6964 isl_assert(list
->ctx
,
6965 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6966 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6967 extra
+= list
->p
[i
]->n_div
;
6968 n_eq
+= list
->p
[i
]->n_eq
;
6969 n_ineq
+= list
->p
[i
]->n_ineq
;
6971 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6976 for (i
= 0; i
< list
->n
; ++i
) {
6977 isl_basic_set_add_constraints(product
,
6978 isl_basic_set_copy(list
->p
[i
]), dim
);
6979 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6981 isl_basic_set_list_free(list
);
6984 isl_basic_set_free(product
);
6985 isl_basic_set_list_free(list
);
6989 struct isl_basic_map
*isl_basic_map_product(
6990 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6992 struct isl_dim
*dim_result
= NULL
;
6993 struct isl_basic_map
*bmap
;
6994 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6995 struct isl_dim_map
*dim_map1
, *dim_map2
;
6997 if (!bmap1
|| !bmap2
)
7000 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
7001 bmap2
->dim
, isl_dim_param
), goto error
);
7002 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
7003 isl_dim_copy(bmap2
->dim
));
7005 in1
= isl_basic_map_n_in(bmap1
);
7006 in2
= isl_basic_map_n_in(bmap2
);
7007 out1
= isl_basic_map_n_out(bmap1
);
7008 out2
= isl_basic_map_n_out(bmap2
);
7009 nparam
= isl_basic_map_n_param(bmap1
);
7011 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7012 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7013 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7014 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7015 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7016 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7017 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7018 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7019 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7020 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7021 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7023 bmap
= isl_basic_map_alloc_dim(dim_result
,
7024 bmap1
->n_div
+ bmap2
->n_div
,
7025 bmap1
->n_eq
+ bmap2
->n_eq
,
7026 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7027 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7028 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7029 bmap
= isl_basic_map_simplify(bmap
);
7030 return isl_basic_map_finalize(bmap
);
7032 isl_basic_map_free(bmap1
);
7033 isl_basic_map_free(bmap2
);
7037 __isl_give isl_basic_map
*isl_basic_map_range_product(
7038 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7040 isl_dim
*dim_result
= NULL
;
7041 isl_basic_map
*bmap
;
7042 unsigned in
, out1
, out2
, nparam
, total
, pos
;
7043 struct isl_dim_map
*dim_map1
, *dim_map2
;
7045 if (!bmap1
|| !bmap2
)
7048 dim_result
= isl_dim_range_product(isl_dim_copy(bmap1
->dim
),
7049 isl_dim_copy(bmap2
->dim
));
7051 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7052 out1
= isl_basic_map_n_out(bmap1
);
7053 out2
= isl_basic_map_n_out(bmap2
);
7054 nparam
= isl_basic_map_n_param(bmap1
);
7056 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7057 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7058 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7059 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7060 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7061 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7062 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
7063 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
7064 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7065 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7066 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7068 bmap
= isl_basic_map_alloc_dim(dim_result
,
7069 bmap1
->n_div
+ bmap2
->n_div
,
7070 bmap1
->n_eq
+ bmap2
->n_eq
,
7071 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7072 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7073 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7074 bmap
= isl_basic_map_simplify(bmap
);
7075 return isl_basic_map_finalize(bmap
);
7077 isl_basic_map_free(bmap1
);
7078 isl_basic_map_free(bmap2
);
7082 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
7083 __isl_take isl_map
*map2
,
7084 __isl_give isl_dim
*(*dim_product
)(__isl_take isl_dim
*left
,
7085 __isl_take isl_dim
*right
),
7086 __isl_give isl_basic_map
*(*basic_map_product
)(
7087 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
7090 struct isl_map
*result
;
7096 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7097 map2
->dim
, isl_dim_param
), goto error
);
7099 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7100 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7101 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7103 result
= isl_map_alloc_dim(dim_product(isl_dim_copy(map1
->dim
),
7104 isl_dim_copy(map2
->dim
)),
7105 map1
->n
* map2
->n
, flags
);
7108 for (i
= 0; i
< map1
->n
; ++i
)
7109 for (j
= 0; j
< map2
->n
; ++j
) {
7110 struct isl_basic_map
*part
;
7111 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
7112 isl_basic_map_copy(map2
->p
[j
]));
7113 if (isl_basic_map_is_empty(part
))
7114 isl_basic_map_free(part
);
7116 result
= isl_map_add_basic_map(result
, part
);
7129 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7131 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
7133 return map_product(map1
, map2
, &isl_dim_product
, &isl_basic_map_product
);
7136 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7138 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7139 __isl_take isl_map
*map2
)
7143 prod
= isl_map_product(map1
, map2
);
7144 prod
= isl_map_flatten(prod
);
7148 /* Given two set A and B, construct its Cartesian product A x B.
7150 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7152 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
7153 (struct isl_map
*)set2
);
7156 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7157 __isl_take isl_set
*set2
)
7159 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
7162 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7164 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
7165 __isl_take isl_map
*map2
)
7167 return map_product(map1
, map2
, &isl_dim_range_product
,
7168 &isl_basic_map_range_product
);
7171 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7174 uint32_t hash
= isl_hash_init();
7179 bmap
= isl_basic_map_copy(bmap
);
7180 bmap
= isl_basic_map_normalize(bmap
);
7183 total
= isl_basic_map_total_dim(bmap
);
7184 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7185 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7187 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7188 isl_hash_hash(hash
, c_hash
);
7190 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7191 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7193 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7194 isl_hash_hash(hash
, c_hash
);
7196 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7197 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7199 if (isl_int_is_zero(bmap
->div
[i
][0]))
7201 isl_hash_byte(hash
, i
& 0xFF);
7202 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7203 isl_hash_hash(hash
, c_hash
);
7205 isl_basic_map_free(bmap
);
7209 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7211 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7214 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7221 map
= isl_map_copy(map
);
7222 map
= isl_map_normalize(map
);
7226 hash
= isl_hash_init();
7227 for (i
= 0; i
< map
->n
; ++i
) {
7229 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7230 isl_hash_hash(hash
, bmap_hash
);
7238 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7240 return isl_map_get_hash((isl_map
*)set
);
7243 /* Check if the value for dimension dim is completely determined
7244 * by the values of the other parameters and variables.
7245 * That is, check if dimension dim is involved in an equality.
7247 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7254 nparam
= isl_basic_set_n_param(bset
);
7255 for (i
= 0; i
< bset
->n_eq
; ++i
)
7256 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7261 /* Check if the value for dimension dim is completely determined
7262 * by the values of the other parameters and variables.
7263 * That is, check if dimension dim is involved in an equality
7264 * for each of the subsets.
7266 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7272 for (i
= 0; i
< set
->n
; ++i
) {
7274 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7281 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7283 return set
? set
->n
: 0;
7286 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7287 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7294 for (i
= 0; i
< map
->n
; ++i
)
7295 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7301 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7302 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7309 for (i
= 0; i
< set
->n
; ++i
)
7310 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7316 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7318 struct isl_dim
*dim
;
7323 if (bset
->n_div
== 0)
7326 bset
= isl_basic_set_cow(bset
);
7330 dim
= isl_basic_set_get_dim(bset
);
7331 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
7334 isl_dim_free(bset
->dim
);
7336 bset
->extra
-= bset
->n_div
;
7339 bset
= isl_basic_set_finalize(bset
);
7343 isl_basic_set_free(bset
);
7347 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7350 struct isl_dim
*dim
;
7353 set
= isl_set_align_divs(set
);
7357 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
7360 set
= isl_set_cow(set
);
7364 n_div
= set
->p
[0]->n_div
;
7365 dim
= isl_set_get_dim(set
);
7366 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
7369 isl_dim_free(set
->dim
);
7372 for (i
= 0; i
< set
->n
; ++i
) {
7373 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7384 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7386 struct isl_dim
*dim
;
7387 struct isl_basic_map
*bmap
;
7394 set
= isl_set_align_divs(set
);
7399 dim
= isl_set_get_dim(set
);
7400 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7402 return isl_map_identity(dim
);
7405 n_div
= set
->p
[0]->n_div
;
7406 dim
= isl_dim_map(dim
);
7407 n_param
= isl_dim_size(dim
, isl_dim_param
);
7408 n_set
= isl_dim_size(dim
, isl_dim_in
);
7409 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7410 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7411 for (i
= 0; i
< n_set
; ++i
)
7412 bmap
= var_equal(bmap
, i
);
7414 total
= n_param
+ n_set
+ n_set
+ n_div
;
7415 for (i
= 0; i
< n_div
; ++i
) {
7416 k
= isl_basic_map_alloc_inequality(bmap
);
7419 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7420 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7421 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7422 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7423 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7424 set
->p
[0]->div
[i
][0]);
7426 l
= isl_basic_map_alloc_inequality(bmap
);
7429 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7430 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7431 set
->p
[0]->div
[i
][0]);
7432 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7436 return isl_map_from_basic_map(bmap
);
7439 isl_basic_map_free(bmap
);
7443 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7451 dim
= isl_basic_set_total_dim(bset
);
7452 size
+= bset
->n_eq
* (1 + dim
);
7453 size
+= bset
->n_ineq
* (1 + dim
);
7454 size
+= bset
->n_div
* (2 + dim
);
7459 int isl_set_size(__isl_keep isl_set
*set
)
7467 for (i
= 0; i
< set
->n
; ++i
)
7468 size
+= isl_basic_set_size(set
->p
[i
]);
7473 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7474 enum isl_dim_type type
, unsigned pos
)
7482 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7484 pos
+= isl_basic_map_offset(bmap
, type
);
7486 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7487 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7491 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7492 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7499 return lower
&& upper
;
7502 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7503 enum isl_dim_type type
, unsigned pos
)
7510 for (i
= 0; i
< map
->n
; ++i
) {
7512 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7513 if (bounded
< 0 || !bounded
)
7520 /* Return 1 if the specified dim is involved in both an upper bound
7521 * and a lower bound.
7523 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7524 enum isl_dim_type type
, unsigned pos
)
7526 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7529 /* For each of the "n" variables starting at "first", determine
7530 * the sign of the variable and put the results in the first "n"
7531 * elements of the array "signs".
7533 * 1 means that the variable is non-negative
7534 * -1 means that the variable is non-positive
7535 * 0 means the variable attains both positive and negative values.
7537 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7538 unsigned first
, unsigned n
, int *signs
)
7540 isl_vec
*bound
= NULL
;
7541 struct isl_tab
*tab
= NULL
;
7542 struct isl_tab_undo
*snap
;
7545 if (!bset
|| !signs
)
7548 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7549 tab
= isl_tab_from_basic_set(bset
);
7553 isl_seq_clr(bound
->el
, bound
->size
);
7554 isl_int_set_si(bound
->el
[0], -1);
7556 snap
= isl_tab_snap(tab
);
7557 for (i
= 0; i
< n
; ++i
) {
7560 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7561 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7564 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7565 if (isl_tab_rollback(tab
, snap
) < 0)
7573 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7574 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7577 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7578 if (isl_tab_rollback(tab
, snap
) < 0)
7581 signs
[i
] = empty
? -1 : 0;
7585 isl_vec_free(bound
);
7589 isl_vec_free(bound
);
7593 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7594 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7596 if (!bset
|| !signs
)
7598 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7601 first
+= pos(bset
->dim
, type
) - 1;
7602 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7605 /* Check if the given basic map is obviously single-valued.
7606 * In particular, for each output dimension, check that there is
7607 * an equality that defines the output dimension in terms of
7608 * earlier dimensions.
7610 int isl_basic_map_fast_is_single_valued(__isl_keep isl_basic_map
*bmap
)
7620 total
= 1 + isl_basic_map_total_dim(bmap
);
7621 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7622 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
7624 for (i
= 0; i
< n_out
; ++i
) {
7625 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
7626 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
7628 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
7629 total
- (o_out
+ i
+ 1)) == -1)
7632 if (j
>= bmap
->n_eq
)
7639 /* Check if the given map is obviously single-valued.
7641 int isl_map_fast_is_single_valued(__isl_keep isl_map
*map
)
7652 return isl_basic_map_fast_is_single_valued(map
->p
[0]);
7655 /* Check if the given map is single-valued.
7660 * and check if the result is a subset of the identity mapping.
7662 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7668 sv
= isl_map_fast_is_single_valued(map
);
7672 test
= isl_map_reverse(isl_map_copy(map
));
7673 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7675 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7677 sv
= isl_map_is_subset(test
, id
);
7685 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7689 sv
= isl_map_is_single_valued(map
);
7693 map
= isl_map_copy(map
);
7694 map
= isl_map_reverse(map
);
7695 sv
= isl_map_is_single_valued(map
);
7701 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7703 return isl_map_is_single_valued((isl_map
*)set
);
7706 int isl_map_is_translation(__isl_keep isl_map
*map
)
7711 delta
= isl_map_deltas(isl_map_copy(map
));
7712 ok
= isl_set_is_singleton(delta
);
7713 isl_set_free(delta
);
7718 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7720 if (isl_seq_first_non_zero(p
, pos
) != -1)
7722 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7727 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7736 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7739 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7740 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7741 for (j
= 0; j
< nvar
; ++j
) {
7742 int lower
= 0, upper
= 0;
7743 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7744 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7746 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7752 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7753 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7755 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7757 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7762 if (!lower
|| !upper
)
7769 int isl_set_is_box(__isl_keep isl_set
*set
)
7776 return isl_basic_set_is_box(set
->p
[0]);
7779 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7784 return isl_dim_is_wrapping(bset
->dim
);
7787 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7792 return isl_dim_is_wrapping(set
->dim
);
7795 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7797 bmap
= isl_basic_map_cow(bmap
);
7801 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7805 bmap
= isl_basic_map_finalize(bmap
);
7807 return (isl_basic_set
*)bmap
;
7809 isl_basic_map_free(bmap
);
7813 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7817 map
= isl_map_cow(map
);
7821 for (i
= 0; i
< map
->n
; ++i
) {
7822 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7826 map
->dim
= isl_dim_wrap(map
->dim
);
7830 return (isl_set
*)map
;
7836 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7838 bset
= isl_basic_set_cow(bset
);
7842 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7846 bset
= isl_basic_set_finalize(bset
);
7848 return (isl_basic_map
*)bset
;
7850 isl_basic_set_free(bset
);
7854 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7861 if (!isl_set_is_wrapping(set
))
7862 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7865 set
= isl_set_cow(set
);
7869 for (i
= 0; i
< set
->n
; ++i
) {
7870 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7875 set
->dim
= isl_dim_unwrap(set
->dim
);
7879 return (isl_map
*)set
;
7885 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7886 enum isl_dim_type type
)
7891 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7894 bmap
= isl_basic_map_cow(bmap
);
7898 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7902 bmap
= isl_basic_map_finalize(bmap
);
7906 isl_basic_map_free(bmap
);
7910 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7911 enum isl_dim_type type
)
7918 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7921 map
= isl_map_cow(map
);
7925 for (i
= 0; i
< map
->n
; ++i
) {
7926 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7930 map
->dim
= isl_dim_reset(map
->dim
, type
);
7940 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7945 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7948 bmap
= isl_basic_map_cow(bmap
);
7952 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7956 bmap
= isl_basic_map_finalize(bmap
);
7960 isl_basic_map_free(bmap
);
7964 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
7966 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
7969 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7976 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7979 map
= isl_map_cow(map
);
7983 for (i
= 0; i
< map
->n
; ++i
) {
7984 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7988 map
->dim
= isl_dim_flatten(map
->dim
);
7998 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
8000 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
8003 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
8005 isl_dim
*dim
, *flat_dim
;
8008 dim
= isl_set_get_dim(set
);
8009 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
8010 map
= map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
8011 map
= isl_map_intersect_domain(map
, set
);
8016 /* Extend the given dim_map with mappings for the divs in bmap.
8018 static __isl_give
struct isl_dim_map
*extend_dim_map(
8019 __isl_keep
struct isl_dim_map
*dim_map
,
8020 __isl_keep isl_basic_map
*bmap
)
8023 struct isl_dim_map
*res
;
8026 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
8028 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
8032 for (i
= 0; i
< dim_map
->len
; ++i
)
8033 res
->pos
[i
] = dim_map
->pos
[i
];
8034 for (i
= 0; i
< bmap
->n_div
; ++i
)
8035 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
8040 /* Extract a dim_map from a reordering.
8041 * We essentially need to reverse the mapping, and add an offset
8042 * of 1 for the constant term.
8044 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
8045 __isl_keep isl_reordering
*exp
)
8048 struct isl_dim_map
*dim_map
;
8053 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
8057 for (i
= 0; i
< exp
->len
; ++i
)
8058 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
8063 /* Reorder the dimensions of "bmap" according to the given dim_map
8064 * and set the dimension specification to "dim".
8066 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
8067 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
8071 bmap
= isl_basic_map_cow(bmap
);
8072 if (!bmap
|| !dim
|| !dim_map
)
8075 res
= isl_basic_map_alloc_dim(dim
,
8076 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8077 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
8078 res
= isl_basic_map_finalize(res
);
8082 isl_basic_map_free(bmap
);
8087 /* Reorder the dimensions of "map" according to given reordering.
8089 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8090 __isl_take isl_reordering
*r
)
8093 struct isl_dim_map
*dim_map
;
8095 map
= isl_map_cow(map
);
8096 dim_map
= isl_dim_map_from_reordering(r
);
8097 if (!map
|| !r
|| !dim_map
)
8100 for (i
= 0; i
< map
->n
; ++i
) {
8101 struct isl_dim_map
*dim_map_i
;
8103 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
8105 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8106 isl_dim_copy(r
->dim
), dim_map_i
);
8112 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8114 isl_reordering_free(r
);
8120 isl_reordering_free(r
);
8124 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8125 __isl_take isl_reordering
*r
)
8127 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8130 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8131 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8132 enum isl_dim_type c2
, enum isl_dim_type c3
,
8133 enum isl_dim_type c4
, enum isl_dim_type c5
)
8135 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8136 struct isl_mat
*mat
;
8142 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8143 isl_basic_map_total_dim(bmap
) + 1);
8146 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8147 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8148 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8149 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8150 isl_int_set(mat
->row
[i
][pos
],
8151 bmap
->eq
[i
][off
+ k
]);
8159 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8160 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8161 enum isl_dim_type c2
, enum isl_dim_type c3
,
8162 enum isl_dim_type c4
, enum isl_dim_type c5
)
8164 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8165 struct isl_mat
*mat
;
8171 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8172 isl_basic_map_total_dim(bmap
) + 1);
8175 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8176 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8177 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8178 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8179 isl_int_set(mat
->row
[i
][pos
],
8180 bmap
->ineq
[i
][off
+ k
]);
8188 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8189 __isl_take isl_dim
*dim
,
8190 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8191 enum isl_dim_type c2
, enum isl_dim_type c3
,
8192 enum isl_dim_type c4
, enum isl_dim_type c5
)
8194 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8195 isl_basic_map
*bmap
;
8201 if (!dim
|| !eq
|| !ineq
)
8204 if (eq
->n_col
!= ineq
->n_col
)
8205 isl_die(dim
->ctx
, isl_error_invalid
,
8206 "equalities and inequalities matrices should have "
8207 "same number of columns", goto error
);
8209 total
= 1 + isl_dim_total(dim
);
8211 if (eq
->n_col
< total
)
8212 isl_die(dim
->ctx
, isl_error_invalid
,
8213 "number of columns too small", goto error
);
8215 extra
= eq
->n_col
- total
;
8217 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
8218 eq
->n_row
, ineq
->n_row
);
8221 for (i
= 0; i
< extra
; ++i
) {
8222 k
= isl_basic_map_alloc_div(bmap
);
8225 isl_int_set_si(bmap
->div
[k
][0], 0);
8227 for (i
= 0; i
< eq
->n_row
; ++i
) {
8228 l
= isl_basic_map_alloc_equality(bmap
);
8231 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8232 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8233 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8234 isl_int_set(bmap
->eq
[l
][off
+ k
],
8240 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8241 l
= isl_basic_map_alloc_inequality(bmap
);
8244 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8245 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8246 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8247 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8266 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8267 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8268 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8270 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8271 c1
, c2
, c3
, c4
, isl_dim_in
);
8274 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8275 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8276 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8278 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8279 c1
, c2
, c3
, c4
, isl_dim_in
);
8282 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8283 __isl_take isl_dim
*dim
,
8284 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8285 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8287 return (isl_basic_set
*)
8288 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8289 c1
, c2
, c3
, c4
, isl_dim_in
);