2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
41 struct isl_dim_map
*dim_map
;
42 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
43 sizeof(struct isl_dim_map
) + len
* sizeof(int));
46 dim_map
->len
= 1 + len
;
48 for (i
= 0; i
< len
; ++i
)
49 dim_map
->pos
[1 + i
] = -1;
53 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 static void isl_dim_map_dim_range(struct isl_dim_map
*dim_map
,
75 struct isl_dim
*dim
, enum isl_dim_type type
,
76 unsigned first
, unsigned n
, unsigned dst_pos
)
84 src_pos
= pos(dim
, type
);
85 for (i
= 0; i
< n
; ++i
)
86 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ first
+ i
;
89 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
90 enum isl_dim_type type
, unsigned dst_pos
)
92 isl_dim_map_dim_range(dim_map
, dim
, type
, 0, n(dim
, type
), dst_pos
);
95 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
96 struct isl_basic_map
*bmap
, unsigned dst_pos
)
101 if (!dim_map
|| !bmap
)
104 src_pos
= 1 + isl_dim_total(bmap
->dim
);
105 for (i
= 0; i
< bmap
->n_div
; ++i
)
106 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
109 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
113 for (i
= 0; i
< dim_map
->len
; ++i
)
114 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
115 fprintf(stderr
, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
119 enum isl_dim_type type
)
124 case isl_dim_cst
: return 1;
127 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
128 case isl_dim_div
: return bmap
->n_div
;
129 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
134 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
136 return map
? n(map
->dim
, type
) : 0;
139 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
141 return set
? n(set
->dim
, type
) : 0;
144 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
145 enum isl_dim_type type
)
147 struct isl_dim
*dim
= bmap
->dim
;
149 case isl_dim_cst
: return 0;
150 case isl_dim_param
: return 1;
151 case isl_dim_in
: return 1 + dim
->nparam
;
152 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
153 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
158 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
160 return pos(map
->dim
, type
);
163 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
164 enum isl_dim_type type
)
166 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
169 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
171 return isl_basic_set_dim(bset
, isl_dim_set
);
174 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
176 return isl_basic_set_dim(bset
, isl_dim_param
);
179 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
181 return isl_dim_total(bset
->dim
) + bset
->n_div
;
184 unsigned isl_set_n_dim(const struct isl_set
*set
)
186 return isl_set_dim(set
, isl_dim_set
);
189 unsigned isl_set_n_param(const struct isl_set
*set
)
191 return isl_set_dim(set
, isl_dim_param
);
194 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
196 return bmap
? bmap
->dim
->n_in
: 0;
199 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
201 return bmap
? bmap
->dim
->n_out
: 0;
204 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
206 return bmap
? bmap
->dim
->nparam
: 0;
209 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
211 return bmap
? bmap
->n_div
: 0;
214 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
216 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
219 unsigned isl_map_n_in(const struct isl_map
*map
)
221 return map
->dim
->n_in
;
224 unsigned isl_map_n_out(const struct isl_map
*map
)
226 return map
->dim
->n_out
;
229 unsigned isl_map_n_param(const struct isl_map
*map
)
231 return map
->dim
->nparam
;
234 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
239 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
242 return isl_dim_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
245 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
246 struct isl_basic_set
*bset
)
251 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
254 return isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
257 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
258 struct isl_basic_set
*bset
)
263 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
266 return isl_dim_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
269 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
271 return bmap
? bmap
->ctx
: NULL
;
274 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
276 return bset
? bset
->ctx
: NULL
;
279 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
281 return map
? map
->ctx
: NULL
;
284 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
286 return set
? set
->ctx
: NULL
;
289 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
293 return isl_dim_copy(bmap
->dim
);
296 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
300 return isl_dim_copy(bset
->dim
);
303 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
307 return isl_dim_copy(map
->dim
);
310 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
314 return isl_dim_copy(set
->dim
);
317 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
318 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
320 bmap
= isl_basic_map_cow(bmap
);
323 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
328 isl_basic_map_free(bmap
);
332 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
333 enum isl_dim_type type
)
335 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
338 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
339 enum isl_dim_type type
, const char *s
)
343 map
= isl_map_cow(map
);
347 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
351 for (i
= 0; i
< map
->n
; ++i
) {
352 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
363 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
364 enum isl_dim_type type
)
366 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
369 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
372 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
375 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
377 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
380 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
381 enum isl_dim_type type
, unsigned pos
)
383 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
386 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
387 enum isl_dim_type type
, unsigned pos
)
389 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
392 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
393 enum isl_dim_type type
, unsigned pos
)
395 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
398 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
399 __isl_take isl_basic_map
*bmap
,
400 enum isl_dim_type type
, unsigned pos
, const char *s
)
404 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
409 isl_basic_map_free(bmap
);
413 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
414 enum isl_dim_type type
, unsigned pos
, const char *s
)
421 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
425 for (i
= 0; i
< map
->n
; ++i
) {
426 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
437 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
438 __isl_take isl_basic_set
*bset
,
439 enum isl_dim_type type
, unsigned pos
, const char *s
)
441 return (isl_basic_set
*)isl_basic_map_set_dim_name(
442 (isl_basic_map
*)bset
, type
, pos
, s
);
445 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
446 enum isl_dim_type type
, unsigned pos
, const char *s
)
448 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
451 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
455 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
458 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
459 struct isl_basic_map
*bmap
, unsigned extra
,
460 unsigned n_eq
, unsigned n_ineq
)
463 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
468 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
469 if (isl_blk_is_error(bmap
->block
))
472 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
477 bmap
->block2
= isl_blk_empty();
480 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
481 if (isl_blk_is_error(bmap
->block2
))
484 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
489 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
490 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
492 for (i
= 0; i
< extra
; ++i
)
493 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
497 bmap
->c_size
= n_eq
+ n_ineq
;
498 bmap
->eq
= bmap
->ineq
+ n_ineq
;
507 isl_basic_map_free(bmap
);
511 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
512 unsigned nparam
, unsigned dim
, unsigned extra
,
513 unsigned n_eq
, unsigned n_ineq
)
515 struct isl_basic_map
*bmap
;
516 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
517 return (struct isl_basic_set
*)bmap
;
520 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
521 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
523 struct isl_basic_map
*bmap
;
526 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
527 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
528 return (struct isl_basic_set
*)bmap
;
534 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
535 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
537 struct isl_basic_map
*bmap
;
541 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
546 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
552 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
553 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
554 unsigned n_eq
, unsigned n_ineq
)
556 struct isl_basic_map
*bmap
;
559 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
563 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
567 static void dup_constraints(
568 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
571 unsigned total
= isl_basic_map_total_dim(src
);
573 for (i
= 0; i
< src
->n_eq
; ++i
) {
574 int j
= isl_basic_map_alloc_equality(dst
);
575 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
578 for (i
= 0; i
< src
->n_ineq
; ++i
) {
579 int j
= isl_basic_map_alloc_inequality(dst
);
580 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
583 for (i
= 0; i
< src
->n_div
; ++i
) {
584 int j
= isl_basic_map_alloc_div(dst
);
585 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
587 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
590 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
592 struct isl_basic_map
*dup
;
596 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
597 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
600 dup_constraints(dup
, bmap
);
601 dup
->flags
= bmap
->flags
;
602 dup
->sample
= isl_vec_copy(bmap
->sample
);
606 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
608 struct isl_basic_map
*dup
;
610 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
611 return (struct isl_basic_set
*)dup
;
614 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
619 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
623 return isl_basic_set_dup(bset
);
626 struct isl_set
*isl_set_copy(struct isl_set
*set
)
635 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
640 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
644 bmap
= isl_basic_map_dup(bmap
);
646 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
650 struct isl_map
*isl_map_copy(struct isl_map
*map
)
659 void isl_basic_map_free(struct isl_basic_map
*bmap
)
667 isl_ctx_deref(bmap
->ctx
);
669 isl_blk_free(bmap
->ctx
, bmap
->block2
);
671 isl_blk_free(bmap
->ctx
, bmap
->block
);
672 isl_vec_free(bmap
->sample
);
673 isl_dim_free(bmap
->dim
);
677 void isl_basic_set_free(struct isl_basic_set
*bset
)
679 isl_basic_map_free((struct isl_basic_map
*)bset
);
682 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
684 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
687 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
693 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
694 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
696 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
697 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
698 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
699 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
700 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
701 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
703 int j
= isl_basic_map_alloc_inequality(bmap
);
707 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
708 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
715 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
716 bmap
->extra
- bmap
->n_div
);
720 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
722 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
725 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
729 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
734 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
736 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
739 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
744 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
746 if (pos
!= bmap
->n_eq
- 1) {
748 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
749 bmap
->eq
[bmap
->n_eq
- 1] = t
;
755 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
757 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
760 void isl_basic_map_inequality_to_equality(
761 struct isl_basic_map
*bmap
, unsigned pos
)
766 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
767 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
772 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
773 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
774 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
775 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
778 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
780 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
783 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
789 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
790 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
791 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
792 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
793 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
794 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
795 1 + isl_basic_map_total_dim(bmap
),
796 bmap
->extra
- bmap
->n_div
);
797 return bmap
->n_ineq
++;
800 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
802 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
805 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
809 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
814 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
816 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
819 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
824 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
826 if (pos
!= bmap
->n_ineq
- 1) {
828 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
829 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
830 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
836 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
838 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
841 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
846 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
849 k
= isl_basic_map_alloc_equality(bmap
);
852 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
855 isl_basic_map_free(bmap
);
859 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
862 return (isl_basic_set
*)
863 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
866 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
871 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
874 k
= isl_basic_map_alloc_inequality(bmap
);
877 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
880 isl_basic_map_free(bmap
);
884 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
887 return (isl_basic_set
*)
888 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
891 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
895 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
896 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
897 1 + 1 + isl_basic_map_total_dim(bmap
),
898 bmap
->extra
- bmap
->n_div
);
899 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
900 return bmap
->n_div
++;
903 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
905 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
908 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
912 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
917 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
919 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
922 /* Copy constraint from src to dst, putting the vars of src at offset
923 * dim_off in dst and the divs of src at offset div_off in dst.
924 * If both sets are actually map, then dim_off applies to the input
927 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
928 struct isl_basic_map
*src_map
, isl_int
*src
,
929 unsigned in_off
, unsigned out_off
, unsigned div_off
)
931 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
932 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
933 unsigned src_in
= isl_basic_map_n_in(src_map
);
934 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
935 unsigned src_out
= isl_basic_map_n_out(src_map
);
936 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
937 isl_int_set(dst
[0], src
[0]);
938 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
939 if (dst_nparam
> src_nparam
)
940 isl_seq_clr(dst
+1+src_nparam
,
941 dst_nparam
- src_nparam
);
942 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
943 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
945 isl_min(dst_in
-in_off
, src_in
));
946 if (dst_in
-in_off
> src_in
)
947 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
948 dst_in
- in_off
- src_in
);
949 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
950 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
951 src
+1+src_nparam
+src_in
,
952 isl_min(dst_out
-out_off
, src_out
));
953 if (dst_out
-out_off
> src_out
)
954 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
955 dst_out
- out_off
- src_out
);
956 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
957 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
958 src
+1+src_nparam
+src_in
+src_out
,
959 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
960 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
961 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
962 div_off
+src_map
->n_div
,
963 dst_map
->n_div
- div_off
- src_map
->n_div
);
966 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
967 struct isl_basic_map
*src_map
, isl_int
*src
,
968 unsigned in_off
, unsigned out_off
, unsigned div_off
)
970 isl_int_set(dst
[0], src
[0]);
971 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
974 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
975 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
980 if (!bmap1
|| !bmap2
)
983 div_off
= bmap1
->n_div
;
985 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
986 int i1
= isl_basic_map_alloc_equality(bmap1
);
989 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
990 i_pos
, o_pos
, div_off
);
993 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
994 int i1
= isl_basic_map_alloc_inequality(bmap1
);
997 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
998 i_pos
, o_pos
, div_off
);
1001 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1002 int i1
= isl_basic_map_alloc_div(bmap1
);
1005 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1006 i_pos
, o_pos
, div_off
);
1009 isl_basic_map_free(bmap2
);
1014 isl_basic_map_free(bmap1
);
1015 isl_basic_map_free(bmap2
);
1019 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
1020 struct isl_dim_map
*dim_map
)
1024 for (i
= 0; i
< dim_map
->len
; ++i
) {
1025 if (dim_map
->pos
[i
] < 0)
1026 isl_int_set_si(dst
[i
], 0);
1028 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
1032 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
1033 struct isl_dim_map
*dim_map
)
1035 isl_int_set(dst
[0], src
[0]);
1036 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
1039 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
1040 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
1044 if (!src
|| !dst
|| !dim_map
)
1047 for (i
= 0; i
< src
->n_eq
; ++i
) {
1048 int i1
= isl_basic_map_alloc_equality(dst
);
1051 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1054 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1055 int i1
= isl_basic_map_alloc_inequality(dst
);
1058 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1061 for (i
= 0; i
< src
->n_div
; ++i
) {
1062 int i1
= isl_basic_map_alloc_div(dst
);
1065 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1069 isl_basic_map_free(src
);
1074 isl_basic_map_free(src
);
1075 isl_basic_map_free(dst
);
1079 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1080 struct isl_basic_set
*bset2
, unsigned pos
)
1082 return (struct isl_basic_set
*)
1083 add_constraints((struct isl_basic_map
*)bset1
,
1084 (struct isl_basic_map
*)bset2
, 0, pos
);
1087 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1088 struct isl_dim
*dim
, unsigned extra
,
1089 unsigned n_eq
, unsigned n_ineq
)
1091 struct isl_basic_map
*ext
;
1101 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1102 base
->extra
>= base
->n_div
+ extra
;
1104 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1105 room_for_ineq(base
, n_ineq
)) {
1110 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1111 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1112 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1113 extra
+= base
->extra
;
1115 n_ineq
+= base
->n_ineq
;
1117 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1123 ext
->sample
= isl_vec_copy(base
->sample
);
1124 flags
= base
->flags
;
1125 ext
= add_constraints(ext
, base
, 0, 0);
1128 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1135 isl_basic_map_free(base
);
1139 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1140 struct isl_dim
*dim
, unsigned extra
,
1141 unsigned n_eq
, unsigned n_ineq
)
1143 return (struct isl_basic_set
*)
1144 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1145 extra
, n_eq
, n_ineq
);
1148 struct isl_basic_map
*isl_basic_map_extend_constraints(
1149 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1153 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1157 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1158 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1159 unsigned n_eq
, unsigned n_ineq
)
1161 struct isl_basic_map
*bmap
;
1162 struct isl_dim
*dim
;
1166 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1170 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1173 isl_basic_map_free(base
);
1177 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1178 unsigned nparam
, unsigned dim
, unsigned extra
,
1179 unsigned n_eq
, unsigned n_ineq
)
1181 return (struct isl_basic_set
*)
1182 isl_basic_map_extend((struct isl_basic_map
*)base
,
1183 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1186 struct isl_basic_set
*isl_basic_set_extend_constraints(
1187 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1189 return (struct isl_basic_set
*)
1190 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1194 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1196 return (struct isl_basic_set
*)
1197 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1200 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1205 if (bmap
->ref
> 1) {
1207 bmap
= isl_basic_map_dup(bmap
);
1210 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1214 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1222 return isl_set_dup(set
);
1225 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1233 return isl_map_dup(map
);
1236 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1237 unsigned a_len
, unsigned b_len
)
1239 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1240 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1241 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1244 struct isl_basic_set
*isl_basic_set_swap_vars(
1245 struct isl_basic_set
*bset
, unsigned n
)
1255 nparam
= isl_basic_set_n_param(bset
);
1256 dim
= isl_basic_set_n_dim(bset
);
1257 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1262 bset
= isl_basic_set_cow(bset
);
1266 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1267 if (isl_blk_is_error(blk
))
1270 for (i
= 0; i
< bset
->n_eq
; ++i
)
1272 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1274 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1276 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1278 for (i
= 0; i
< bset
->n_div
; ++i
)
1280 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1282 isl_blk_free(bset
->ctx
, blk
);
1284 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1285 bset
= isl_basic_set_gauss(bset
, NULL
);
1286 return isl_basic_set_finalize(bset
);
1288 isl_basic_set_free(bset
);
1292 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1295 set
= isl_set_cow(set
);
1299 for (i
= 0; i
< set
->n
; ++i
) {
1300 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1306 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1310 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1316 total
= isl_basic_map_total_dim(bmap
);
1317 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1318 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1320 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1322 i
= isl_basic_map_alloc_equality(bmap
);
1326 isl_int_set_si(bmap
->eq
[i
][0], 1);
1327 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1328 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1329 isl_vec_free(bmap
->sample
);
1330 bmap
->sample
= NULL
;
1331 return isl_basic_map_finalize(bmap
);
1333 isl_basic_map_free(bmap
);
1337 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1339 return (struct isl_basic_set
*)
1340 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1343 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1346 unsigned off
= isl_dim_total(bmap
->dim
);
1347 isl_int
*t
= bmap
->div
[a
];
1348 bmap
->div
[a
] = bmap
->div
[b
];
1351 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1352 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1354 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1355 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1357 for (i
= 0; i
< bmap
->n_div
; ++i
)
1358 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1359 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1362 /* Eliminate the specified n dimensions starting at first from the
1363 * constraints using Fourier-Motzkin. The dimensions themselves
1366 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1367 enum isl_dim_type type
, unsigned first
, unsigned n
)
1376 map
= isl_map_cow(map
);
1379 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1380 first
+= pos(map
->dim
, type
) - 1;
1382 for (i
= 0; i
< map
->n
; ++i
) {
1383 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1393 /* Eliminate the specified n dimensions starting at first from the
1394 * constraints using Fourier-Motzkin. The dimensions themselves
1397 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1398 enum isl_dim_type type
, unsigned first
, unsigned n
)
1400 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1403 /* Eliminate the specified n dimensions starting at first from the
1404 * constraints using Fourier-Motzkin. The dimensions themselves
1407 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1408 unsigned first
, unsigned n
)
1410 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1413 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1414 __isl_take isl_basic_map
*bmap
)
1416 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1424 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1425 __isl_take isl_basic_set
*bset
)
1427 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1428 (struct isl_basic_map
*)bset
);
1431 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1440 set
= isl_set_cow(set
);
1444 for (i
= 0; i
< set
->n
; ++i
) {
1445 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1455 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1456 enum isl_dim_type type
, unsigned first
, unsigned n
)
1460 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1464 bmap
= isl_basic_map_eliminate_vars(bmap
,
1465 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1468 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1470 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1473 isl_basic_map_free(bmap
);
1477 /* Return true if the definition of the given div (recursively) involves
1478 * any of the given variables.
1480 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1481 unsigned first
, unsigned n
)
1484 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1486 if (isl_int_is_zero(bmap
->div
[div
][0]))
1488 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1491 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1492 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1494 if (div_involves_vars(bmap
, i
, first
, n
))
1501 /* Remove all divs (recursively) involving any of the given dimensions
1502 * in their definitions.
1504 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1505 __isl_take isl_basic_map
*bmap
,
1506 enum isl_dim_type type
, unsigned first
, unsigned n
)
1512 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1514 first
+= isl_basic_map_offset(bmap
, type
);
1516 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1517 if (!div_involves_vars(bmap
, i
, first
, n
))
1519 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1524 isl_basic_map_free(bmap
);
1528 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1529 enum isl_dim_type type
, unsigned first
, unsigned n
)
1538 map
= isl_map_cow(map
);
1542 for (i
= 0; i
< map
->n
; ++i
) {
1543 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1554 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1555 enum isl_dim_type type
, unsigned first
, unsigned n
)
1557 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1561 /* Return true if the definition of the given div is unknown or depends
1564 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1567 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1569 if (isl_int_is_zero(bmap
->div
[div
][0]))
1572 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1573 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1575 if (div_is_unknown(bmap
, i
))
1582 /* Remove all divs that are unknown or defined in terms of unknown divs.
1584 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1585 __isl_take isl_basic_map
*bmap
)
1592 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1593 if (!div_is_unknown(bmap
, i
))
1595 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1600 isl_basic_map_free(bmap
);
1604 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1613 map
= isl_map_cow(map
);
1617 for (i
= 0; i
< map
->n
; ++i
) {
1618 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1628 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1630 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1633 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1634 __isl_take isl_basic_set
*bset
,
1635 enum isl_dim_type type
, unsigned first
, unsigned n
)
1637 return (isl_basic_set
*)
1638 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1641 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1642 enum isl_dim_type type
, unsigned first
, unsigned n
)
1649 map
= isl_map_cow(map
);
1652 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1654 for (i
= 0; i
< map
->n
; ++i
) {
1655 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1656 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1660 map
= isl_map_drop(map
, type
, first
, n
);
1667 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1668 enum isl_dim_type type
, unsigned first
, unsigned n
)
1670 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1673 /* Project out n inputs starting at first using Fourier-Motzkin */
1674 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1675 unsigned first
, unsigned n
)
1677 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1680 static void dump_term(struct isl_basic_map
*bmap
,
1681 isl_int c
, int pos
, FILE *out
)
1684 unsigned in
= isl_basic_map_n_in(bmap
);
1685 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1686 unsigned nparam
= isl_basic_map_n_param(bmap
);
1688 isl_int_print(out
, c
, 0);
1690 if (!isl_int_is_one(c
))
1691 isl_int_print(out
, c
, 0);
1692 if (pos
< 1 + nparam
) {
1693 name
= isl_dim_get_name(bmap
->dim
,
1694 isl_dim_param
, pos
- 1);
1696 fprintf(out
, "%s", name
);
1698 fprintf(out
, "p%d", pos
- 1);
1699 } else if (pos
< 1 + nparam
+ in
)
1700 fprintf(out
, "i%d", pos
- 1 - nparam
);
1701 else if (pos
< 1 + nparam
+ dim
)
1702 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1704 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1708 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1709 int sign
, FILE *out
)
1713 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1717 for (i
= 0, first
= 1; i
< len
; ++i
) {
1718 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1721 fprintf(out
, " + ");
1723 isl_int_abs(v
, c
[i
]);
1724 dump_term(bmap
, v
, i
, out
);
1731 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1732 const char *op
, FILE *out
, int indent
)
1736 fprintf(out
, "%*s", indent
, "");
1738 dump_constraint_sign(bmap
, c
, 1, out
);
1739 fprintf(out
, " %s ", op
);
1740 dump_constraint_sign(bmap
, c
, -1, out
);
1744 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1745 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1747 fprintf(out
, "%*s", indent
, "");
1748 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1753 static void dump_constraints(struct isl_basic_map
*bmap
,
1754 isl_int
**c
, unsigned n
,
1755 const char *op
, FILE *out
, int indent
)
1759 for (i
= 0; i
< n
; ++i
)
1760 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1763 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1767 unsigned total
= isl_basic_map_total_dim(bmap
);
1769 for (j
= 0; j
< 1 + total
; ++j
) {
1770 if (isl_int_is_zero(exp
[j
]))
1772 if (!first
&& isl_int_is_pos(exp
[j
]))
1774 dump_term(bmap
, exp
[j
], j
, out
);
1779 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1783 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1784 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1786 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1787 fprintf(out
, "%*s", indent
, "");
1788 fprintf(out
, "e%d = [(", i
);
1789 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1791 isl_int_print(out
, bmap
->div
[i
][0], 0);
1792 fprintf(out
, "]\n");
1796 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
1797 FILE *out
, int indent
)
1800 fprintf(out
, "null basic set\n");
1804 fprintf(out
, "%*s", indent
, "");
1805 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1806 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1807 bset
->extra
, bset
->flags
);
1808 dump((struct isl_basic_map
*)bset
, out
, indent
);
1811 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
1812 FILE *out
, int indent
)
1815 fprintf(out
, "null basic map\n");
1819 fprintf(out
, "%*s", indent
, "");
1820 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1821 "flags: %x, n_name: %d\n",
1823 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1824 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1825 dump(bmap
, out
, indent
);
1828 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1833 total
= isl_basic_map_total_dim(bmap
);
1834 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1835 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1836 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1837 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1841 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1843 struct isl_set
*set
;
1847 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1848 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1849 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1850 sizeof(struct isl_set
) +
1851 (n
- 1) * sizeof(struct isl_basic_set
*));
1855 set
->ctx
= dim
->ctx
;
1856 isl_ctx_ref(set
->ctx
);
1868 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1869 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1871 struct isl_set
*set
;
1872 struct isl_dim
*dims
;
1874 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1878 set
= isl_set_alloc_dim(dims
, n
, flags
);
1882 /* Make sure "map" has room for at least "n" more basic maps.
1884 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1887 struct isl_map
*grown
= NULL
;
1891 isl_assert(map
->ctx
, n
>= 0, goto error
);
1892 if (map
->n
+ n
<= map
->size
)
1894 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1897 for (i
= 0; i
< map
->n
; ++i
) {
1898 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1906 isl_map_free(grown
);
1911 /* Make sure "set" has room for at least "n" more basic sets.
1913 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1915 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1918 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1921 struct isl_set
*dup
;
1926 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1929 for (i
= 0; i
< set
->n
; ++i
)
1930 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1934 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1936 struct isl_set
*set
;
1941 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1943 isl_basic_set_free(bset
);
1946 return isl_set_add_basic_set(set
, bset
);
1949 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1951 struct isl_map
*map
;
1956 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1958 isl_basic_map_free(bmap
);
1961 return isl_map_add_basic_map(map
, bmap
);
1964 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1965 __isl_take isl_basic_set
*bset
)
1967 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1968 (struct isl_basic_map
*)bset
);
1971 void isl_set_free(struct isl_set
*set
)
1981 isl_ctx_deref(set
->ctx
);
1982 for (i
= 0; i
< set
->n
; ++i
)
1983 isl_basic_set_free(set
->p
[i
]);
1984 isl_dim_free(set
->dim
);
1988 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
1993 fprintf(out
, "null set\n");
1997 fprintf(out
, "%*s", indent
, "");
1998 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1999 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2001 for (i
= 0; i
< set
->n
; ++i
) {
2002 fprintf(out
, "%*s", indent
, "");
2003 fprintf(out
, "basic set %d:\n", i
);
2004 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2008 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2013 fprintf(out
, "null map\n");
2017 fprintf(out
, "%*s", indent
, "");
2018 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2019 "flags: %x, n_name: %d\n",
2020 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2021 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
2022 for (i
= 0; i
< map
->n
; ++i
) {
2023 fprintf(out
, "%*s", indent
, "");
2024 fprintf(out
, "basic map %d:\n", i
);
2025 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2029 struct isl_basic_map
*isl_basic_map_intersect_domain(
2030 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2032 struct isl_basic_map
*bmap_domain
;
2033 struct isl_dim
*dim
;
2038 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2039 bset
->dim
, isl_dim_param
), goto error
);
2041 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2042 isl_assert(bset
->ctx
,
2043 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2045 bmap
= isl_basic_map_cow(bmap
);
2048 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2049 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2050 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
2051 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
2052 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2054 bmap
= isl_basic_map_simplify(bmap
);
2055 return isl_basic_map_finalize(bmap
);
2057 isl_basic_map_free(bmap
);
2058 isl_basic_set_free(bset
);
2062 struct isl_basic_map
*isl_basic_map_intersect_range(
2063 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2065 struct isl_basic_map
*bmap_range
;
2070 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2071 bset
->dim
, isl_dim_param
), goto error
);
2073 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2074 isl_assert(bset
->ctx
,
2075 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2077 bmap
= isl_basic_map_cow(bmap
);
2080 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2081 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2082 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2083 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2085 bmap
= isl_basic_map_simplify(bmap
);
2086 return isl_basic_map_finalize(bmap
);
2088 isl_basic_map_free(bmap
);
2089 isl_basic_set_free(bset
);
2093 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2099 total
= 1 + isl_basic_map_total_dim(bmap
);
2100 if (total
!= vec
->size
)
2105 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2106 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2107 if (!isl_int_is_zero(s
)) {
2113 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2114 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2115 if (isl_int_is_neg(s
)) {
2126 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2128 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2131 struct isl_basic_map
*isl_basic_map_intersect(
2132 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2134 struct isl_vec
*sample
= NULL
;
2136 if (!bmap1
|| !bmap2
)
2139 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2140 bmap2
->dim
, isl_dim_param
), goto error
);
2141 if (isl_dim_total(bmap1
->dim
) ==
2142 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2143 isl_dim_total(bmap2
->dim
) !=
2144 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2145 return isl_basic_map_intersect(bmap2
, bmap1
);
2147 if (isl_dim_total(bmap2
->dim
) !=
2148 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2149 isl_assert(bmap1
->ctx
,
2150 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2152 if (bmap1
->sample
&&
2153 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2154 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2155 sample
= isl_vec_copy(bmap1
->sample
);
2156 else if (bmap2
->sample
&&
2157 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2158 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2159 sample
= isl_vec_copy(bmap2
->sample
);
2161 bmap1
= isl_basic_map_cow(bmap1
);
2164 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2165 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2166 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2169 isl_vec_free(sample
);
2171 isl_vec_free(bmap1
->sample
);
2172 bmap1
->sample
= sample
;
2175 bmap1
= isl_basic_map_simplify(bmap1
);
2176 return isl_basic_map_finalize(bmap1
);
2179 isl_vec_free(sample
);
2180 isl_basic_map_free(bmap1
);
2181 isl_basic_map_free(bmap2
);
2185 struct isl_basic_set
*isl_basic_set_intersect(
2186 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2188 return (struct isl_basic_set
*)
2189 isl_basic_map_intersect(
2190 (struct isl_basic_map
*)bset1
,
2191 (struct isl_basic_map
*)bset2
);
2194 /* Special case of isl_map_intersect, where both map1 and map2
2195 * are convex, without any divs and such that either map1 or map2
2196 * contains a single constraint. This constraint is then simply
2197 * added to the other map.
2199 static __isl_give isl_map
*map_intersect_add_constraint(
2200 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2202 struct isl_basic_map
*bmap1
;
2203 struct isl_basic_map
*bmap2
;
2205 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2206 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2207 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2208 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2210 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2211 return isl_map_intersect(map2
, map1
);
2213 isl_assert(map2
->ctx
,
2214 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2216 map1
= isl_map_cow(map1
);
2219 if (isl_map_fast_is_empty(map1
)) {
2223 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2224 if (map2
->p
[0]->n_eq
== 1)
2225 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2227 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2228 map2
->p
[0]->ineq
[0]);
2230 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2231 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2235 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2236 isl_basic_map_free(map1
->p
[0]);
2249 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2252 struct isl_map
*result
;
2258 if (isl_map_fast_is_empty(map1
)) {
2262 if (isl_map_fast_is_empty(map2
)) {
2267 if (map1
->n
== 1 && map2
->n
== 1 &&
2268 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2269 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2270 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2271 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2272 return map_intersect_add_constraint(map1
, map2
);
2273 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2274 map2
->dim
, isl_dim_param
), goto error
);
2275 if (isl_dim_total(map1
->dim
) ==
2276 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2277 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2278 return isl_map_intersect(map2
, map1
);
2280 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2281 isl_assert(map1
->ctx
,
2282 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2284 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2285 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2286 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2288 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2289 map1
->n
* map2
->n
, flags
);
2292 for (i
= 0; i
< map1
->n
; ++i
)
2293 for (j
= 0; j
< map2
->n
; ++j
) {
2294 struct isl_basic_map
*part
;
2295 part
= isl_basic_map_intersect(
2296 isl_basic_map_copy(map1
->p
[i
]),
2297 isl_basic_map_copy(map2
->p
[j
]));
2298 if (isl_basic_map_is_empty(part
))
2299 isl_basic_map_free(part
);
2301 result
= isl_map_add_basic_map(result
, part
);
2314 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2316 return (struct isl_set
*)
2317 isl_map_intersect((struct isl_map
*)set1
,
2318 (struct isl_map
*)set2
);
2321 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2323 struct isl_dim
*dim
;
2324 struct isl_basic_set
*bset
;
2329 bmap
= isl_basic_map_cow(bmap
);
2332 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2333 in
= isl_basic_map_n_in(bmap
);
2334 bset
= isl_basic_set_from_basic_map(bmap
);
2335 bset
= isl_basic_set_swap_vars(bset
, in
);
2336 return isl_basic_map_from_basic_set(bset
, dim
);
2339 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2340 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2342 struct isl_dim
*res_dim
;
2343 struct isl_basic_map
*res
;
2344 struct isl_dim_map
*dim_map
;
2345 unsigned total
, off
;
2346 enum isl_dim_type t
;
2354 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2356 total
= isl_basic_map_total_dim(bmap
) + n
;
2357 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2359 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2361 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2363 unsigned size
= isl_basic_map_dim(bmap
, t
);
2364 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2366 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2367 pos
, size
- pos
, off
+ pos
+ n
);
2369 off
+= isl_dim_size(res_dim
, t
);
2371 isl_dim_map_div(dim_map
, bmap
, off
);
2373 res
= isl_basic_map_alloc_dim(res_dim
,
2374 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2375 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2376 res
= isl_basic_map_simplify(res
);
2377 return isl_basic_map_finalize(res
);
2380 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2381 enum isl_dim_type type
, unsigned n
)
2385 return isl_basic_map_insert(bmap
, type
,
2386 isl_basic_map_dim(bmap
, type
), n
);
2389 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2390 enum isl_dim_type type
, unsigned n
)
2394 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2395 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2397 isl_basic_set_free(bset
);
2401 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2402 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2409 map
= isl_map_cow(map
);
2413 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2417 for (i
= 0; i
< map
->n
; ++i
) {
2418 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2429 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2430 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2432 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2435 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2436 enum isl_dim_type type
, unsigned n
)
2440 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2443 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2444 enum isl_dim_type type
, unsigned n
)
2448 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2449 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2455 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2456 __isl_take isl_basic_map
*bmap
,
2457 enum isl_dim_type dst_type
, unsigned dst_pos
,
2458 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2461 struct isl_dim_map
*dim_map
;
2462 struct isl_basic_map
*res
;
2463 enum isl_dim_type t
;
2464 unsigned total
, off
;
2471 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2474 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2477 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2479 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2480 pos(bmap
->dim
, src_type
) + src_pos
+
2481 ((src_type
< dst_type
) ? n
: 0)) {
2482 bmap
= isl_basic_map_cow(bmap
);
2486 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2487 src_type
, src_pos
, n
);
2491 bmap
= isl_basic_map_finalize(bmap
);
2496 total
= isl_basic_map_total_dim(bmap
);
2497 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2500 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2501 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2502 if (t
== dst_type
) {
2503 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2506 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2509 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2510 dst_pos
, size
- dst_pos
, off
);
2511 off
+= size
- dst_pos
;
2512 } else if (t
== src_type
) {
2513 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2516 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2517 src_pos
+ n
, size
- src_pos
- n
, off
);
2518 off
+= size
- src_pos
- n
;
2520 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2524 isl_dim_map_div(dim_map
, bmap
, off
);
2526 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2527 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2528 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2530 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2531 src_type
, src_pos
, n
);
2535 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2536 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2537 bmap
= isl_basic_map_finalize(bmap
);
2541 isl_basic_map_free(bmap
);
2545 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2546 enum isl_dim_type dst_type
, unsigned dst_pos
,
2547 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2549 return (isl_basic_set
*)isl_basic_map_move_dims(
2550 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2553 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2554 enum isl_dim_type dst_type
, unsigned dst_pos
,
2555 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2559 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2560 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2561 src_type
, src_pos
, n
);
2567 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2568 enum isl_dim_type dst_type
, unsigned dst_pos
,
2569 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2578 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2581 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2584 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2586 map
= isl_map_cow(map
);
2590 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2594 for (i
= 0; i
< map
->n
; ++i
) {
2595 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2597 src_type
, src_pos
, n
);
2608 /* Move the specified dimensions to the last columns right before
2609 * the divs. Don't change the dimension specification of bmap.
2610 * That's the responsibility of the caller.
2612 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2613 enum isl_dim_type type
, unsigned first
, unsigned n
)
2615 struct isl_dim_map
*dim_map
;
2616 struct isl_basic_map
*res
;
2617 enum isl_dim_type t
;
2618 unsigned total
, off
;
2622 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2625 total
= isl_basic_map_total_dim(bmap
);
2626 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2629 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2630 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2632 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2635 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2636 first
, n
, total
- bmap
->n_div
- n
);
2637 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2638 first
+ n
, size
- (first
+ n
), off
);
2639 off
+= size
- (first
+ n
);
2641 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2645 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2647 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2648 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2649 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2653 /* Turn the n dimensions of type type, starting at first
2654 * into existentially quantified variables.
2656 __isl_give isl_basic_map
*isl_basic_map_project_out(
2657 __isl_take isl_basic_map
*bmap
,
2658 enum isl_dim_type type
, unsigned first
, unsigned n
)
2671 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2672 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2674 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2677 bmap
= move_last(bmap
, type
, first
, n
);
2678 bmap
= isl_basic_map_cow(bmap
);
2682 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2683 old
= bmap
->block2
.data
;
2684 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2685 (bmap
->extra
+ n
) * (1 + row_size
));
2686 if (!bmap
->block2
.data
)
2688 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2691 for (i
= 0; i
< n
; ++i
) {
2692 new_div
[i
] = bmap
->block2
.data
+
2693 (bmap
->extra
+ i
) * (1 + row_size
);
2694 isl_seq_clr(new_div
[i
], 1 + row_size
);
2696 for (i
= 0; i
< bmap
->extra
; ++i
)
2697 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2699 bmap
->div
= new_div
;
2703 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2706 bmap
= isl_basic_map_simplify(bmap
);
2707 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2708 return isl_basic_map_finalize(bmap
);
2710 isl_basic_map_free(bmap
);
2714 /* Turn the n dimensions of type type, starting at first
2715 * into existentially quantified variables.
2717 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2718 enum isl_dim_type type
, unsigned first
, unsigned n
)
2720 return (isl_basic_set
*)isl_basic_map_project_out(
2721 (isl_basic_map
*)bset
, type
, first
, n
);
2724 /* Turn the n dimensions of type type, starting at first
2725 * into existentially quantified variables.
2727 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2728 enum isl_dim_type type
, unsigned first
, unsigned n
)
2738 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2740 map
= isl_map_cow(map
);
2744 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2748 for (i
= 0; i
< map
->n
; ++i
) {
2749 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2760 /* Turn the n dimensions of type type, starting at first
2761 * into existentially quantified variables.
2763 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2764 enum isl_dim_type type
, unsigned first
, unsigned n
)
2766 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2769 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2773 for (i
= 0; i
< n
; ++i
) {
2774 j
= isl_basic_map_alloc_div(bmap
);
2777 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2781 isl_basic_map_free(bmap
);
2785 struct isl_basic_map
*isl_basic_map_apply_range(
2786 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2788 struct isl_dim
*dim_result
= NULL
;
2789 struct isl_basic_map
*bmap
;
2790 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2791 struct isl_dim_map
*dim_map1
, *dim_map2
;
2793 if (!bmap1
|| !bmap2
)
2796 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2797 isl_dim_copy(bmap2
->dim
));
2799 n_in
= isl_basic_map_n_in(bmap1
);
2800 n_out
= isl_basic_map_n_out(bmap2
);
2801 n
= isl_basic_map_n_out(bmap1
);
2802 nparam
= isl_basic_map_n_param(bmap1
);
2804 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2805 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2806 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2807 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2808 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2809 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2810 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2811 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2812 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2813 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2814 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2816 bmap
= isl_basic_map_alloc_dim(dim_result
,
2817 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2818 bmap1
->n_eq
+ bmap2
->n_eq
,
2819 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2820 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2821 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2822 bmap
= add_divs(bmap
, n
);
2823 bmap
= isl_basic_map_simplify(bmap
);
2824 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2825 return isl_basic_map_finalize(bmap
);
2827 isl_basic_map_free(bmap1
);
2828 isl_basic_map_free(bmap2
);
2832 struct isl_basic_set
*isl_basic_set_apply(
2833 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2838 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2841 return (struct isl_basic_set
*)
2842 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2844 isl_basic_set_free(bset
);
2845 isl_basic_map_free(bmap
);
2849 struct isl_basic_map
*isl_basic_map_apply_domain(
2850 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2852 if (!bmap1
|| !bmap2
)
2855 isl_assert(bmap1
->ctx
,
2856 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2857 isl_assert(bmap1
->ctx
,
2858 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2861 bmap1
= isl_basic_map_reverse(bmap1
);
2862 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2863 return isl_basic_map_reverse(bmap1
);
2865 isl_basic_map_free(bmap1
);
2866 isl_basic_map_free(bmap2
);
2870 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2871 * A \cap B -> f(A) + f(B)
2873 struct isl_basic_map
*isl_basic_map_sum(
2874 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2876 unsigned n_in
, n_out
, nparam
, total
, pos
;
2877 struct isl_basic_map
*bmap
= NULL
;
2878 struct isl_dim_map
*dim_map1
, *dim_map2
;
2881 if (!bmap1
|| !bmap2
)
2884 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2887 nparam
= isl_basic_map_n_param(bmap1
);
2888 n_in
= isl_basic_map_n_in(bmap1
);
2889 n_out
= isl_basic_map_n_out(bmap1
);
2891 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2892 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2893 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2894 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2895 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2896 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2897 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2898 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2899 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2900 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2901 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2903 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2904 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2905 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2906 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2907 for (i
= 0; i
< n_out
; ++i
) {
2908 int j
= isl_basic_map_alloc_equality(bmap
);
2911 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2912 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2913 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2914 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2916 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2917 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2918 bmap
= add_divs(bmap
, 2 * n_out
);
2920 bmap
= isl_basic_map_simplify(bmap
);
2921 return isl_basic_map_finalize(bmap
);
2923 isl_basic_map_free(bmap
);
2924 isl_basic_map_free(bmap1
);
2925 isl_basic_map_free(bmap2
);
2929 /* Given two maps A -> f(A) and B -> g(B), construct a map
2930 * A \cap B -> f(A) + f(B)
2932 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2934 struct isl_map
*result
;
2940 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2942 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2943 map1
->n
* map2
->n
, 0);
2946 for (i
= 0; i
< map1
->n
; ++i
)
2947 for (j
= 0; j
< map2
->n
; ++j
) {
2948 struct isl_basic_map
*part
;
2949 part
= isl_basic_map_sum(
2950 isl_basic_map_copy(map1
->p
[i
]),
2951 isl_basic_map_copy(map2
->p
[j
]));
2952 if (isl_basic_map_is_empty(part
))
2953 isl_basic_map_free(part
);
2955 result
= isl_map_add_basic_map(result
, part
);
2968 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2969 __isl_take isl_set
*set2
)
2971 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2974 /* Given a basic map A -> f(A), construct A -> -f(A).
2976 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2981 bmap
= isl_basic_map_cow(bmap
);
2985 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2986 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2987 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2988 for (j
= 0; j
< n
; ++j
)
2989 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2990 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2991 for (j
= 0; j
< n
; ++j
)
2992 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2993 for (i
= 0; i
< bmap
->n_div
; ++i
)
2994 for (j
= 0; j
< n
; ++j
)
2995 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2996 return isl_basic_map_finalize(bmap
);
2999 /* Given a map A -> f(A), construct A -> -f(A).
3001 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3005 map
= isl_map_cow(map
);
3009 for (i
= 0; i
< map
->n
; ++i
) {
3010 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3021 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3023 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3026 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3027 * A -> floor(f(A)/d).
3029 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3032 unsigned n_in
, n_out
, nparam
, total
, pos
;
3033 struct isl_basic_map
*result
= NULL
;
3034 struct isl_dim_map
*dim_map
;
3040 nparam
= isl_basic_map_n_param(bmap
);
3041 n_in
= isl_basic_map_n_in(bmap
);
3042 n_out
= isl_basic_map_n_out(bmap
);
3044 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3045 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3046 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3047 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3048 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3049 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3051 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
3052 bmap
->n_div
+ n_out
,
3053 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3054 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
3055 result
= add_divs(result
, n_out
);
3056 for (i
= 0; i
< n_out
; ++i
) {
3058 j
= isl_basic_map_alloc_inequality(result
);
3061 isl_seq_clr(result
->ineq
[j
], 1+total
);
3062 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3063 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3064 j
= isl_basic_map_alloc_inequality(result
);
3067 isl_seq_clr(result
->ineq
[j
], 1+total
);
3068 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3069 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3070 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3073 result
= isl_basic_map_simplify(result
);
3074 return isl_basic_map_finalize(result
);
3076 isl_basic_map_free(result
);
3080 /* Given a map A -> f(A) and an integer d, construct a map
3081 * A -> floor(f(A)/d).
3083 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3087 map
= isl_map_cow(map
);
3091 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3092 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3093 for (i
= 0; i
< map
->n
; ++i
) {
3094 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3105 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3111 i
= isl_basic_map_alloc_equality(bmap
);
3114 nparam
= isl_basic_map_n_param(bmap
);
3115 n_in
= isl_basic_map_n_in(bmap
);
3116 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3117 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3118 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3119 return isl_basic_map_finalize(bmap
);
3121 isl_basic_map_free(bmap
);
3125 /* Add a constraints to "bmap" expressing i_pos < o_pos
3127 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3133 i
= isl_basic_map_alloc_inequality(bmap
);
3136 nparam
= isl_basic_map_n_param(bmap
);
3137 n_in
= isl_basic_map_n_in(bmap
);
3138 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3139 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3140 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3141 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3142 return isl_basic_map_finalize(bmap
);
3144 isl_basic_map_free(bmap
);
3148 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3150 static __isl_give isl_basic_map
*var_less_or_equal(
3151 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3157 i
= isl_basic_map_alloc_inequality(bmap
);
3160 nparam
= isl_basic_map_n_param(bmap
);
3161 n_in
= isl_basic_map_n_in(bmap
);
3162 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3163 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3164 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3165 return isl_basic_map_finalize(bmap
);
3167 isl_basic_map_free(bmap
);
3171 /* Add a constraints to "bmap" expressing i_pos > o_pos
3173 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3179 i
= isl_basic_map_alloc_inequality(bmap
);
3182 nparam
= isl_basic_map_n_param(bmap
);
3183 n_in
= isl_basic_map_n_in(bmap
);
3184 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3185 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3186 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3187 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3188 return isl_basic_map_finalize(bmap
);
3190 isl_basic_map_free(bmap
);
3194 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3196 static __isl_give isl_basic_map
*var_more_or_equal(
3197 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3203 i
= isl_basic_map_alloc_inequality(bmap
);
3206 nparam
= isl_basic_map_n_param(bmap
);
3207 n_in
= isl_basic_map_n_in(bmap
);
3208 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3209 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3210 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3211 return isl_basic_map_finalize(bmap
);
3213 isl_basic_map_free(bmap
);
3217 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3220 struct isl_basic_map
*bmap
;
3221 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3224 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3225 bmap
= var_equal(bmap
, i
);
3226 return isl_basic_map_finalize(bmap
);
3229 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3231 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3234 struct isl_basic_map
*bmap
;
3235 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3238 for (i
= 0; i
< pos
&& bmap
; ++i
)
3239 bmap
= var_equal(bmap
, i
);
3241 bmap
= var_less(bmap
, pos
);
3242 return isl_basic_map_finalize(bmap
);
3245 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3247 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3248 __isl_take isl_dim
*dim
, unsigned pos
)
3251 isl_basic_map
*bmap
;
3253 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3254 for (i
= 0; i
< pos
; ++i
)
3255 bmap
= var_equal(bmap
, i
);
3256 bmap
= var_less_or_equal(bmap
, pos
);
3257 return isl_basic_map_finalize(bmap
);
3260 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3262 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3265 struct isl_basic_map
*bmap
;
3266 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3269 for (i
= 0; i
< pos
&& bmap
; ++i
)
3270 bmap
= var_equal(bmap
, i
);
3272 bmap
= var_more(bmap
, pos
);
3273 return isl_basic_map_finalize(bmap
);
3276 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3278 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3279 __isl_take isl_dim
*dim
, unsigned pos
)
3282 isl_basic_map
*bmap
;
3284 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3285 for (i
= 0; i
< pos
; ++i
)
3286 bmap
= var_equal(bmap
, i
);
3287 bmap
= var_more_or_equal(bmap
, pos
);
3288 return isl_basic_map_finalize(bmap
);
3291 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3292 unsigned n
, int equal
)
3294 struct isl_map
*map
;
3297 if (n
== 0 && equal
)
3298 return isl_map_universe(dims
);
3300 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3302 for (i
= 0; i
+ 1 < n
; ++i
)
3303 map
= isl_map_add_basic_map(map
,
3304 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3307 map
= isl_map_add_basic_map(map
,
3308 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3310 map
= isl_map_add_basic_map(map
,
3311 isl_basic_map_less_at(dims
, n
- 1));
3318 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3322 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3325 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3327 return map_lex_lte_first(dim
, n
, 0);
3330 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3332 return map_lex_lte_first(dim
, n
, 1);
3335 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3337 return map_lex_lte(isl_dim_map(set_dim
), 0);
3340 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3342 return map_lex_lte(isl_dim_map(set_dim
), 1);
3345 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3346 unsigned n
, int equal
)
3348 struct isl_map
*map
;
3351 if (n
== 0 && equal
)
3352 return isl_map_universe(dims
);
3354 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3356 for (i
= 0; i
+ 1 < n
; ++i
)
3357 map
= isl_map_add_basic_map(map
,
3358 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3361 map
= isl_map_add_basic_map(map
,
3362 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3364 map
= isl_map_add_basic_map(map
,
3365 isl_basic_map_more_at(dims
, n
- 1));
3372 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3376 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3379 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3381 return map_lex_gte_first(dim
, n
, 0);
3384 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3386 return map_lex_gte_first(dim
, n
, 1);
3389 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3391 return map_lex_gte(isl_dim_map(set_dim
), 0);
3394 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3396 return map_lex_gte(isl_dim_map(set_dim
), 1);
3399 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3400 __isl_take isl_set
*set2
)
3403 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3404 map
= isl_map_intersect_domain(map
, set1
);
3405 map
= isl_map_intersect_range(map
, set2
);
3409 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3410 __isl_take isl_set
*set2
)
3413 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3414 map
= isl_map_intersect_domain(map
, set1
);
3415 map
= isl_map_intersect_range(map
, set2
);
3419 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3420 __isl_take isl_set
*set2
)
3423 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3424 map
= isl_map_intersect_domain(map
, set1
);
3425 map
= isl_map_intersect_range(map
, set2
);
3429 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3430 __isl_take isl_set
*set2
)
3433 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3434 map
= isl_map_intersect_domain(map
, set1
);
3435 map
= isl_map_intersect_range(map
, set2
);
3439 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3440 __isl_take isl_map
*map2
)
3443 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3444 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3445 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3449 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3450 __isl_take isl_map
*map2
)
3453 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3454 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3455 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3459 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3460 __isl_take isl_map
*map2
)
3463 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3464 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3465 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3469 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3470 __isl_take isl_map
*map2
)
3473 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3474 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3475 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3479 struct isl_basic_map
*isl_basic_map_from_basic_set(
3480 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3482 struct isl_basic_map
*bmap
;
3484 bset
= isl_basic_set_cow(bset
);
3488 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3489 isl_dim_free(bset
->dim
);
3490 bmap
= (struct isl_basic_map
*) bset
;
3492 return isl_basic_map_finalize(bmap
);
3494 isl_basic_set_free(bset
);
3499 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3503 if (bmap
->dim
->n_in
== 0)
3504 return (struct isl_basic_set
*)bmap
;
3505 bmap
= isl_basic_map_cow(bmap
);
3508 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3511 bmap
= isl_basic_map_finalize(bmap
);
3512 return (struct isl_basic_set
*)bmap
;
3514 isl_basic_map_free(bmap
);
3518 /* For a div d = floor(f/m), add the constraints
3521 * -(f-(n-1)) + m d >= 0
3523 * Note that the second constraint is the negation of
3527 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3528 unsigned pos
, isl_int
*div
)
3531 unsigned total
= isl_basic_map_total_dim(bmap
);
3533 i
= isl_basic_map_alloc_inequality(bmap
);
3536 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3537 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3539 j
= isl_basic_map_alloc_inequality(bmap
);
3542 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3543 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3544 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3548 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3549 unsigned pos
, isl_int
*div
)
3551 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3555 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3557 unsigned total
= isl_basic_map_total_dim(bmap
);
3558 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3560 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3564 struct isl_basic_set
*isl_basic_map_underlying_set(
3565 struct isl_basic_map
*bmap
)
3569 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3571 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3572 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3573 return (struct isl_basic_set
*)bmap
;
3574 bmap
= isl_basic_map_cow(bmap
);
3577 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3580 bmap
->extra
-= bmap
->n_div
;
3582 bmap
= isl_basic_map_finalize(bmap
);
3583 return (struct isl_basic_set
*)bmap
;
3588 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3589 __isl_take isl_basic_set
*bset
)
3591 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3594 struct isl_basic_map
*isl_basic_map_overlying_set(
3595 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3597 struct isl_basic_map
*bmap
;
3598 struct isl_ctx
*ctx
;
3605 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3606 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3607 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3609 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3610 isl_basic_map_free(like
);
3611 return (struct isl_basic_map
*)bset
;
3613 bset
= isl_basic_set_cow(bset
);
3616 total
= bset
->dim
->n_out
+ bset
->extra
;
3617 bmap
= (struct isl_basic_map
*)bset
;
3618 isl_dim_free(bmap
->dim
);
3619 bmap
->dim
= isl_dim_copy(like
->dim
);
3622 bmap
->n_div
= like
->n_div
;
3623 bmap
->extra
+= like
->n_div
;
3626 ltotal
= total
- bmap
->extra
+ like
->extra
;
3629 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3630 bmap
->extra
* (1 + 1 + total
));
3631 if (isl_blk_is_error(bmap
->block2
))
3633 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3637 for (i
= 0; i
< bmap
->extra
; ++i
)
3638 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3639 for (i
= 0; i
< like
->n_div
; ++i
) {
3640 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3641 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3643 bmap
= isl_basic_map_extend_constraints(bmap
,
3644 0, 2 * like
->n_div
);
3645 for (i
= 0; i
< like
->n_div
; ++i
) {
3646 if (isl_int_is_zero(bmap
->div
[i
][0]))
3648 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3652 isl_basic_map_free(like
);
3653 bmap
= isl_basic_map_simplify(bmap
);
3654 bmap
= isl_basic_map_finalize(bmap
);
3657 isl_basic_map_free(like
);
3658 isl_basic_set_free(bset
);
3662 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3663 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3665 return (struct isl_basic_set
*)
3666 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3669 struct isl_set
*isl_set_from_underlying_set(
3670 struct isl_set
*set
, struct isl_basic_set
*like
)
3676 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3678 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3679 isl_basic_set_free(like
);
3682 set
= isl_set_cow(set
);
3685 for (i
= 0; i
< set
->n
; ++i
) {
3686 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3687 isl_basic_set_copy(like
));
3691 isl_dim_free(set
->dim
);
3692 set
->dim
= isl_dim_copy(like
->dim
);
3695 isl_basic_set_free(like
);
3698 isl_basic_set_free(like
);
3703 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3707 map
= isl_map_cow(map
);
3710 map
->dim
= isl_dim_cow(map
->dim
);
3714 for (i
= 1; i
< map
->n
; ++i
)
3715 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3717 for (i
= 0; i
< map
->n
; ++i
) {
3718 map
->p
[i
] = (struct isl_basic_map
*)
3719 isl_basic_map_underlying_set(map
->p
[i
]);
3724 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3726 isl_dim_free(map
->dim
);
3727 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3731 return (struct isl_set
*)map
;
3737 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3739 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3742 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3743 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3745 bmap
= isl_basic_map_cow(bmap
);
3749 isl_dim_free(bmap
->dim
);
3752 bmap
= isl_basic_map_finalize(bmap
);
3756 isl_basic_map_free(bmap
);
3761 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3762 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3764 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3768 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3769 __isl_take isl_dim
*dim
)
3773 map
= isl_map_cow(map
);
3777 for (i
= 0; i
< map
->n
; ++i
) {
3778 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3783 isl_dim_free(map
->dim
);
3793 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3794 __isl_take isl_dim
*dim
)
3796 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3799 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3802 struct isl_basic_set
*domain
;
3808 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3810 n_in
= isl_basic_map_n_in(bmap
);
3811 n_out
= isl_basic_map_n_out(bmap
);
3812 domain
= isl_basic_set_from_basic_map(bmap
);
3813 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3815 domain
= isl_basic_set_reset_dim(domain
, dim
);
3820 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3822 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3825 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3826 __isl_take isl_basic_map
*bmap
)
3830 isl_basic_map
*domain
;
3831 isl_basic_set
*bset
;
3832 int nparam
, n_in
, n_out
;
3835 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3836 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3837 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3839 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3840 domain
= isl_basic_map_universe(dim
);
3842 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3843 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3844 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3846 total
= isl_basic_map_total_dim(bmap
);
3848 for (i
= 0; i
< n_in
; ++i
) {
3849 k
= isl_basic_map_alloc_equality(bmap
);
3852 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3853 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3854 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3857 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3858 return isl_basic_map_finalize(bmap
);
3860 isl_basic_map_free(bmap
);
3864 __isl_give isl_basic_map
*isl_basic_map_range_map(
3865 __isl_take isl_basic_map
*bmap
)
3869 isl_basic_map
*range
;
3870 isl_basic_set
*bset
;
3871 int nparam
, n_in
, n_out
;
3874 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3875 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3876 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3878 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3879 range
= isl_basic_map_universe(dim
);
3881 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3882 bmap
= isl_basic_map_apply_range(bmap
, range
);
3883 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3885 total
= isl_basic_map_total_dim(bmap
);
3887 for (i
= 0; i
< n_out
; ++i
) {
3888 k
= isl_basic_map_alloc_equality(bmap
);
3891 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3892 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3893 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3896 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3897 return isl_basic_map_finalize(bmap
);
3899 isl_basic_map_free(bmap
);
3903 struct isl_set
*isl_map_range(struct isl_map
*map
)
3906 struct isl_set
*set
;
3910 if (isl_map_dim(map
, isl_dim_in
) == 0)
3911 return (isl_set
*)map
;
3913 map
= isl_map_cow(map
);
3917 set
= (struct isl_set
*) map
;
3918 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3921 for (i
= 0; i
< map
->n
; ++i
) {
3922 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3926 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3927 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3934 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3937 isl_dim
*domain_dim
;
3939 map
= isl_map_cow(map
);
3943 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3944 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3945 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3948 for (i
= 0; i
< map
->n
; ++i
) {
3949 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3953 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3954 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3961 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3966 map
= isl_map_cow(map
);
3970 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3971 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3972 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3975 for (i
= 0; i
< map
->n
; ++i
) {
3976 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3980 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3981 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3988 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3991 struct isl_map
*map
= NULL
;
3993 set
= isl_set_cow(set
);
3996 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3997 map
= (struct isl_map
*)set
;
3998 for (i
= 0; i
< set
->n
; ++i
) {
3999 map
->p
[i
] = isl_basic_map_from_basic_set(
4000 set
->p
[i
], isl_dim_copy(dim
));
4004 isl_dim_free(map
->dim
);
4013 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4014 __isl_take isl_basic_set
*bset
)
4016 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4019 __isl_give isl_basic_map
*isl_basic_map_from_range(
4020 __isl_take isl_basic_set
*bset
)
4022 return (isl_basic_map
*)bset
;
4025 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4027 return (struct isl_map
*)set
;
4030 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4032 return isl_map_reverse(isl_map_from_range(set
));
4035 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4036 __isl_take isl_set
*range
)
4038 return isl_map_apply_range(isl_map_from_domain(domain
),
4039 isl_map_from_range(range
));
4042 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4045 struct isl_set
*set
= NULL
;
4049 map
= isl_map_cow(map
);
4052 map
->dim
= isl_dim_as_set_dim(map
->dim
);
4055 set
= (struct isl_set
*)map
;
4056 for (i
= 0; i
< map
->n
; ++i
) {
4057 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4067 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
4069 struct isl_map
*map
;
4073 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4074 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4075 sizeof(struct isl_map
) +
4076 (n
- 1) * sizeof(struct isl_basic_map
*));
4080 map
->ctx
= dim
->ctx
;
4081 isl_ctx_ref(map
->ctx
);
4093 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4094 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4097 struct isl_map
*map
;
4098 struct isl_dim
*dims
;
4100 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4104 map
= isl_map_alloc_dim(dims
, n
, flags
);
4108 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4110 struct isl_basic_map
*bmap
;
4111 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4112 bmap
= isl_basic_map_set_to_empty(bmap
);
4116 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4118 struct isl_basic_set
*bset
;
4119 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4120 bset
= isl_basic_set_set_to_empty(bset
);
4124 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4126 struct isl_basic_map
*bmap
;
4129 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4130 bmap
= isl_basic_map_set_to_empty(bmap
);
4134 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4136 struct isl_basic_map
*bmap
;
4139 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4140 bmap
= isl_basic_map_set_to_empty(bmap
);
4144 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4146 struct isl_basic_set
*bset
;
4149 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4150 bset
= isl_basic_set_set_to_empty(bset
);
4154 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4156 struct isl_basic_map
*bmap
;
4157 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4158 bmap
= isl_basic_map_finalize(bmap
);
4162 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4164 struct isl_basic_set
*bset
;
4165 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4166 bset
= isl_basic_set_finalize(bset
);
4170 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4171 __isl_keep isl_basic_map
*model
)
4175 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4178 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4182 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4185 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4186 __isl_keep isl_set
*model
)
4190 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4193 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4195 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4198 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4202 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4205 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4209 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4212 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4214 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4217 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4221 return isl_set_empty(isl_dim_copy(model
->dim
));
4224 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4226 struct isl_map
*map
;
4229 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4230 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4234 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4236 struct isl_set
*set
;
4239 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4240 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4244 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4248 return isl_set_universe(isl_dim_copy(model
->dim
));
4251 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4254 struct isl_map
*dup
;
4258 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4259 for (i
= 0; i
< map
->n
; ++i
)
4260 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4264 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4265 __isl_take isl_basic_map
*bmap
)
4269 if (isl_basic_map_fast_is_empty(bmap
)) {
4270 isl_basic_map_free(bmap
);
4273 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4274 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4275 map
->p
[map
->n
] = bmap
;
4277 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4283 isl_basic_map_free(bmap
);
4287 void isl_map_free(struct isl_map
*map
)
4297 isl_ctx_deref(map
->ctx
);
4298 for (i
= 0; i
< map
->n
; ++i
)
4299 isl_basic_map_free(map
->p
[i
]);
4300 isl_dim_free(map
->dim
);
4304 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4305 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4309 base
= isl_map_cow(base
);
4313 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4316 for (i
= 0; i
< base
->n
; ++i
) {
4317 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4318 isl_dim_copy(base
->dim
), 0, 0, 0);
4328 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4329 unsigned nparam
, unsigned dim
)
4331 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4335 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4336 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4340 bmap
= isl_basic_map_cow(bmap
);
4341 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4342 j
= isl_basic_map_alloc_equality(bmap
);
4345 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4346 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4347 isl_int_set_si(bmap
->eq
[j
][0], value
);
4348 bmap
= isl_basic_map_simplify(bmap
);
4349 return isl_basic_map_finalize(bmap
);
4351 isl_basic_map_free(bmap
);
4355 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4356 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4360 bmap
= isl_basic_map_cow(bmap
);
4361 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4362 j
= isl_basic_map_alloc_equality(bmap
);
4365 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4366 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4367 isl_int_set(bmap
->eq
[j
][0], value
);
4368 bmap
= isl_basic_map_simplify(bmap
);
4369 return isl_basic_map_finalize(bmap
);
4371 isl_basic_map_free(bmap
);
4375 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4376 enum isl_dim_type type
, unsigned pos
, int value
)
4380 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4381 return isl_basic_map_fix_pos_si(bmap
,
4382 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4384 isl_basic_map_free(bmap
);
4388 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4389 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4393 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4394 return isl_basic_map_fix_pos(bmap
,
4395 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4397 isl_basic_map_free(bmap
);
4401 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4402 enum isl_dim_type type
, unsigned pos
, int value
)
4404 return (struct isl_basic_set
*)
4405 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4409 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4410 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4412 return (struct isl_basic_set
*)
4413 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4417 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4418 unsigned input
, int value
)
4420 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4423 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4424 unsigned dim
, int value
)
4426 return (struct isl_basic_set
*)
4427 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4428 isl_dim_set
, dim
, value
);
4431 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4432 enum isl_dim_type type
, unsigned pos
, int value
)
4436 map
= isl_map_cow(map
);
4440 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4441 for (i
= 0; i
< map
->n
; ++i
) {
4442 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4446 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4453 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4454 enum isl_dim_type type
, unsigned pos
, int value
)
4456 return (struct isl_set
*)
4457 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4460 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4461 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4465 map
= isl_map_cow(map
);
4469 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4470 for (i
= 0; i
< map
->n
; ++i
) {
4471 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4475 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4482 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4483 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4485 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4488 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4489 unsigned input
, int value
)
4491 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4494 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4496 return (struct isl_set
*)
4497 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4500 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4501 __isl_take isl_basic_map
*bmap
,
4502 enum isl_dim_type type
, unsigned pos
, int value
)
4508 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4509 pos
+= isl_basic_map_offset(bmap
, type
);
4510 bmap
= isl_basic_map_cow(bmap
);
4511 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4512 j
= isl_basic_map_alloc_inequality(bmap
);
4515 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4516 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4517 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4518 bmap
= isl_basic_map_simplify(bmap
);
4519 return isl_basic_map_finalize(bmap
);
4521 isl_basic_map_free(bmap
);
4525 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4526 unsigned dim
, isl_int value
)
4530 bset
= isl_basic_set_cow(bset
);
4531 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4532 j
= isl_basic_set_alloc_inequality(bset
);
4535 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4536 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4537 isl_int_neg(bset
->ineq
[j
][0], value
);
4538 bset
= isl_basic_set_simplify(bset
);
4539 return isl_basic_set_finalize(bset
);
4541 isl_basic_set_free(bset
);
4545 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4546 enum isl_dim_type type
, unsigned pos
, int value
)
4550 map
= isl_map_cow(map
);
4554 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4555 for (i
= 0; i
< map
->n
; ++i
) {
4556 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4561 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4568 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4569 enum isl_dim_type type
, unsigned pos
, int value
)
4571 return (struct isl_set
*)
4572 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4575 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4580 set
= isl_set_cow(set
);
4584 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4585 for (i
= 0; i
< set
->n
; ++i
) {
4586 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4596 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4600 map
= isl_map_cow(map
);
4604 map
->dim
= isl_dim_reverse(map
->dim
);
4607 for (i
= 0; i
< map
->n
; ++i
) {
4608 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4612 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4619 static struct isl_map
*isl_basic_map_partial_lexopt(
4620 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4621 struct isl_set
**empty
, int max
)
4625 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4626 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4628 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4630 isl_basic_map_free(bmap
);
4631 isl_basic_set_free(dom
);
4637 struct isl_map
*isl_basic_map_partial_lexmax(
4638 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4639 struct isl_set
**empty
)
4641 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4644 struct isl_map
*isl_basic_map_partial_lexmin(
4645 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4646 struct isl_set
**empty
)
4648 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4651 struct isl_set
*isl_basic_set_partial_lexmin(
4652 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4653 struct isl_set
**empty
)
4655 return (struct isl_set
*)
4656 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4660 struct isl_set
*isl_basic_set_partial_lexmax(
4661 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4662 struct isl_set
**empty
)
4664 return (struct isl_set
*)
4665 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4669 /* Given a basic map "bmap", compute the lexicographically minimal
4670 * (or maximal) image element for each domain element in dom.
4671 * Set *empty to those elements in dom that do not have an image element.
4673 * We first make sure the basic sets in dom are disjoint and then
4674 * simply collect the results over each of the basic sets separately.
4675 * We could probably improve the efficiency a bit by moving the union
4676 * domain down into the parametric integer programming.
4678 static __isl_give isl_map
*basic_map_partial_lexopt(
4679 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4680 __isl_give isl_set
**empty
, int max
)
4683 struct isl_map
*res
;
4685 dom
= isl_set_make_disjoint(dom
);
4689 if (isl_set_fast_is_empty(dom
)) {
4690 res
= isl_map_empty_like_basic_map(bmap
);
4691 *empty
= isl_set_empty_like(dom
);
4693 isl_basic_map_free(bmap
);
4697 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4698 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4700 for (i
= 1; i
< dom
->n
; ++i
) {
4701 struct isl_map
*res_i
;
4702 struct isl_set
*empty_i
;
4704 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4705 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4707 res
= isl_map_union_disjoint(res
, res_i
);
4708 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4712 isl_basic_map_free(bmap
);
4717 isl_basic_map_free(bmap
);
4721 /* Given a map "map", compute the lexicographically minimal
4722 * (or maximal) image element for each domain element in dom.
4723 * Set *empty to those elements in dom that do not have an image element.
4725 * We first compute the lexicographically minimal or maximal element
4726 * in the first basic map. This results in a partial solution "res"
4727 * and a subset "todo" of dom that still need to be handled.
4728 * We then consider each of the remaining maps in "map" and successively
4729 * improve both "res" and "todo".
4731 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4732 * Assume we are computing the lexicographical maximum.
4733 * We first compute the lexicographically maximal element in basic map i.
4734 * This results in a partial solution res_i and a subset todo_i.
4735 * Then we combine these results with those obtain for the first k basic maps
4736 * to obtain a result that is valid for the first k+1 basic maps.
4737 * In particular, the set where there is no solution is the set where
4738 * there is no solution for the first k basic maps and also no solution
4739 * for the ith basic map, i.e.,
4741 * todo^i = todo^k * todo_i
4743 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4744 * solutions, arbitrarily breaking ties in favor of res^k.
4745 * That is, when res^k(a) >= res_i(a), we pick res^k and
4746 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4747 * the lexicographic order.)
4748 * In practice, we compute
4750 * res^k * (res_i . "<=")
4754 * res_i * (res^k . "<")
4756 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4757 * where only one of res^k and res_i provides a solution and we simply pick
4764 * Note that we only compute these intersections when dom(res^k) intersects
4765 * dom(res_i). Otherwise, the only effect of these intersections is to
4766 * potentially break up res^k and res_i into smaller pieces.
4767 * We want to avoid such splintering as much as possible.
4768 * In fact, an earlier implementation of this function would look for
4769 * better results in the domain of res^k and for extra results in todo^k,
4770 * but this would always result in a splintering according to todo^k,
4771 * even when the domain of basic map i is disjoint from the domains of
4772 * the previous basic maps.
4774 static __isl_give isl_map
*isl_map_partial_lexopt(
4775 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4776 __isl_give isl_set
**empty
, int max
)
4779 struct isl_map
*res
;
4780 struct isl_set
*todo
;
4785 if (isl_map_fast_is_empty(map
)) {
4793 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4794 isl_set_copy(dom
), &todo
, max
);
4796 for (i
= 1; i
< map
->n
; ++i
) {
4800 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
4802 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4803 isl_set_copy(dom
), &todo_i
, max
);
4806 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
4807 le
= isl_map_lex_le(dim
);
4809 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
4810 le
= isl_map_lex_ge(dim
);
4812 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4813 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
4814 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
4815 le
= isl_map_intersect(le
, isl_map_copy(res
));
4817 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
4818 res
= isl_map_intersect_domain(res
,
4819 isl_set_copy(todo_i
));
4820 res_i
= isl_map_intersect_domain(res_i
,
4821 isl_set_copy(todo
));
4824 res
= isl_map_union_disjoint(res
, res_i
);
4825 res
= isl_map_union_disjoint(res
, lt
);
4826 res
= isl_map_union_disjoint(res
, le
);
4828 todo
= isl_set_intersect(todo
, todo_i
);
4848 __isl_give isl_map
*isl_map_partial_lexmax(
4849 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4850 __isl_give isl_set
**empty
)
4852 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4855 __isl_give isl_map
*isl_map_partial_lexmin(
4856 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4857 __isl_give isl_set
**empty
)
4859 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4862 __isl_give isl_set
*isl_set_partial_lexmin(
4863 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4864 __isl_give isl_set
**empty
)
4866 return (struct isl_set
*)
4867 isl_map_partial_lexmin((struct isl_map
*)set
,
4871 __isl_give isl_set
*isl_set_partial_lexmax(
4872 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4873 __isl_give isl_set
**empty
)
4875 return (struct isl_set
*)
4876 isl_map_partial_lexmax((struct isl_map
*)set
,
4880 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4882 struct isl_basic_set
*dom
= NULL
;
4883 struct isl_dim
*dom_dim
;
4887 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4888 dom
= isl_basic_set_universe(dom_dim
);
4889 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4891 isl_basic_map_free(bmap
);
4895 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4897 return isl_basic_map_lexopt(bmap
, 0);
4900 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4902 return isl_basic_map_lexopt(bmap
, 1);
4905 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4907 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4910 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4912 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4915 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4917 struct isl_set
*dom
= NULL
;
4918 struct isl_dim
*dom_dim
;
4922 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4923 dom
= isl_set_universe(dom_dim
);
4924 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4930 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4932 return isl_map_lexopt(map
, 0);
4935 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4937 return isl_map_lexopt(map
, 1);
4940 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4942 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4945 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4947 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4950 /* Apply a preimage specified by "mat" on the parameters of "bset".
4951 * bset is assumed to have only parameters and divs.
4953 static struct isl_basic_set
*basic_set_parameter_preimage(
4954 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4961 bset
->dim
= isl_dim_cow(bset
->dim
);
4965 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4967 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4969 bset
->dim
->nparam
= 0;
4970 bset
->dim
->n_out
= nparam
;
4971 bset
= isl_basic_set_preimage(bset
, mat
);
4973 bset
->dim
->nparam
= bset
->dim
->n_out
;
4974 bset
->dim
->n_out
= 0;
4979 isl_basic_set_free(bset
);
4983 /* Apply a preimage specified by "mat" on the parameters of "set".
4984 * set is assumed to have only parameters and divs.
4986 static struct isl_set
*set_parameter_preimage(
4987 struct isl_set
*set
, struct isl_mat
*mat
)
4989 struct isl_dim
*dim
= NULL
;
4995 dim
= isl_dim_copy(set
->dim
);
4996 dim
= isl_dim_cow(dim
);
5000 nparam
= isl_set_dim(set
, isl_dim_param
);
5002 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5005 dim
->n_out
= nparam
;
5006 isl_set_reset_dim(set
, dim
);
5007 set
= isl_set_preimage(set
, mat
);
5010 dim
= isl_dim_copy(set
->dim
);
5011 dim
= isl_dim_cow(dim
);
5014 dim
->nparam
= dim
->n_out
;
5016 isl_set_reset_dim(set
, dim
);
5026 /* Intersect the basic set "bset" with the affine space specified by the
5027 * equalities in "eq".
5029 static struct isl_basic_set
*basic_set_append_equalities(
5030 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5038 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
5043 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
5044 for (i
= 0; i
< eq
->n_row
; ++i
) {
5045 k
= isl_basic_set_alloc_equality(bset
);
5048 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5049 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5053 bset
= isl_basic_set_gauss(bset
, NULL
);
5054 bset
= isl_basic_set_finalize(bset
);
5059 isl_basic_set_free(bset
);
5063 /* Intersect the set "set" with the affine space specified by the
5064 * equalities in "eq".
5066 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5074 for (i
= 0; i
< set
->n
; ++i
) {
5075 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5088 /* Project the given basic set onto its parameter domain, possibly introducing
5089 * new, explicit, existential variables in the constraints.
5090 * The input has parameters and (possibly implicit) existential variables.
5091 * The output has the same parameters, but only
5092 * explicit existentially quantified variables.
5094 * The actual projection is performed by pip, but pip doesn't seem
5095 * to like equalities very much, so we first remove the equalities
5096 * among the parameters by performing a variable compression on
5097 * the parameters. Afterward, an inverse transformation is performed
5098 * and the equalities among the parameters are inserted back in.
5100 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5104 struct isl_mat
*T
, *T2
;
5105 struct isl_set
*set
;
5106 unsigned nparam
, n_div
;
5108 bset
= isl_basic_set_cow(bset
);
5112 if (bset
->n_eq
== 0)
5113 return isl_basic_set_lexmin(bset
);
5115 isl_basic_set_gauss(bset
, NULL
);
5117 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5118 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5120 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5121 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5124 if (i
== bset
->n_eq
)
5125 return isl_basic_set_lexmin(bset
);
5127 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5129 eq
= isl_mat_cow(eq
);
5130 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5131 if (T
&& T
->n_col
== 0) {
5135 bset
= isl_basic_set_set_to_empty(bset
);
5136 return isl_set_from_basic_set(bset
);
5138 bset
= basic_set_parameter_preimage(bset
, T
);
5140 set
= isl_basic_set_lexmin(bset
);
5141 set
= set_parameter_preimage(set
, T2
);
5142 set
= set_append_equalities(set
, eq
);
5146 /* Compute an explicit representation for all the existentially
5147 * quantified variables.
5148 * The input and output dimensions are first turned into parameters.
5149 * compute_divs then returns a map with the same parameters and
5150 * no input or output dimensions and the dimension specification
5151 * is reset to that of the input.
5153 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5155 struct isl_basic_set
*bset
;
5156 struct isl_set
*set
;
5157 struct isl_map
*map
;
5158 struct isl_dim
*dim
, *orig_dim
= NULL
;
5163 bmap
= isl_basic_map_cow(bmap
);
5167 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5168 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5169 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5170 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5174 orig_dim
= bmap
->dim
;
5176 bset
= (struct isl_basic_set
*)bmap
;
5178 set
= parameter_compute_divs(bset
);
5179 map
= (struct isl_map
*)set
;
5180 map
= isl_map_reset_dim(map
, orig_dim
);
5184 isl_basic_map_free(bmap
);
5188 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5196 off
= isl_dim_total(bmap
->dim
);
5197 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5198 if (isl_int_is_zero(bmap
->div
[i
][0]))
5200 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5206 static int map_divs_known(__isl_keep isl_map
*map
)
5213 for (i
= 0; i
< map
->n
; ++i
) {
5214 int known
= basic_map_divs_known(map
->p
[i
]);
5222 /* If bmap contains any unknown divs, then compute explicit
5223 * expressions for them. However, this computation may be
5224 * quite expensive, so first try to remove divs that aren't
5227 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5231 struct isl_map
*map
;
5233 known
= basic_map_divs_known(bmap
);
5237 return isl_map_from_basic_map(bmap
);
5239 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5241 known
= basic_map_divs_known(bmap
);
5245 return isl_map_from_basic_map(bmap
);
5247 map
= compute_divs(bmap
);
5250 isl_basic_map_free(bmap
);
5254 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5258 struct isl_map
*res
;
5265 known
= map_divs_known(map
);
5273 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5274 for (i
= 1 ; i
< map
->n
; ++i
) {
5276 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5277 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5278 res
= isl_map_union_disjoint(res
, r2
);
5280 res
= isl_map_union(res
, r2
);
5287 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5289 return (struct isl_set
*)
5290 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5293 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5295 return (struct isl_set
*)
5296 isl_map_compute_divs((struct isl_map
*)set
);
5299 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5302 struct isl_set
*set
;
5307 map
= isl_map_cow(map
);
5311 set
= (struct isl_set
*)map
;
5312 set
->dim
= isl_dim_domain(set
->dim
);
5315 for (i
= 0; i
< map
->n
; ++i
) {
5316 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5320 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5321 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5328 struct isl_map
*isl_map_union_disjoint(
5329 struct isl_map
*map1
, struct isl_map
*map2
)
5333 struct isl_map
*map
= NULL
;
5347 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5349 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5350 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5351 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5353 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5354 map1
->n
+ map2
->n
, flags
);
5357 for (i
= 0; i
< map1
->n
; ++i
) {
5358 map
= isl_map_add_basic_map(map
,
5359 isl_basic_map_copy(map1
->p
[i
]));
5363 for (i
= 0; i
< map2
->n
; ++i
) {
5364 map
= isl_map_add_basic_map(map
,
5365 isl_basic_map_copy(map2
->p
[i
]));
5379 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5381 map1
= isl_map_union_disjoint(map1
, map2
);
5385 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5389 struct isl_set
*isl_set_union_disjoint(
5390 struct isl_set
*set1
, struct isl_set
*set2
)
5392 return (struct isl_set
*)
5393 isl_map_union_disjoint(
5394 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5397 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5399 return (struct isl_set
*)
5400 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5403 struct isl_map
*isl_map_intersect_range(
5404 struct isl_map
*map
, struct isl_set
*set
)
5407 struct isl_map
*result
;
5413 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5414 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5415 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5417 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5418 map
->n
* set
->n
, flags
);
5421 for (i
= 0; i
< map
->n
; ++i
)
5422 for (j
= 0; j
< set
->n
; ++j
) {
5423 result
= isl_map_add_basic_map(result
,
5424 isl_basic_map_intersect_range(
5425 isl_basic_map_copy(map
->p
[i
]),
5426 isl_basic_set_copy(set
->p
[j
])));
5439 struct isl_map
*isl_map_intersect_domain(
5440 struct isl_map
*map
, struct isl_set
*set
)
5442 return isl_map_reverse(
5443 isl_map_intersect_range(isl_map_reverse(map
), set
));
5446 struct isl_map
*isl_map_apply_domain(
5447 struct isl_map
*map1
, struct isl_map
*map2
)
5451 map1
= isl_map_reverse(map1
);
5452 map1
= isl_map_apply_range(map1
, map2
);
5453 return isl_map_reverse(map1
);
5460 struct isl_map
*isl_map_apply_range(
5461 struct isl_map
*map1
, struct isl_map
*map2
)
5463 struct isl_dim
*dim_result
;
5464 struct isl_map
*result
;
5470 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5471 isl_dim_copy(map2
->dim
));
5473 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5476 for (i
= 0; i
< map1
->n
; ++i
)
5477 for (j
= 0; j
< map2
->n
; ++j
) {
5478 result
= isl_map_add_basic_map(result
,
5479 isl_basic_map_apply_range(
5480 isl_basic_map_copy(map1
->p
[i
]),
5481 isl_basic_map_copy(map2
->p
[j
])));
5487 if (result
&& result
->n
<= 1)
5488 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5497 * returns range - domain
5499 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5501 isl_dim
*dims
, *target_dim
;
5502 struct isl_basic_set
*bset
;
5509 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5510 bmap
->dim
, isl_dim_out
),
5512 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5513 dim
= isl_basic_map_n_in(bmap
);
5514 nparam
= isl_basic_map_n_param(bmap
);
5515 bset
= isl_basic_set_from_basic_map(bmap
);
5516 bset
= isl_basic_set_cow(bset
);
5517 dims
= isl_basic_set_get_dim(bset
);
5518 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5519 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5520 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5521 for (i
= 0; i
< dim
; ++i
) {
5522 int j
= isl_basic_map_alloc_equality(
5523 (struct isl_basic_map
*)bset
);
5526 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5527 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5528 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5529 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5531 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5532 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5535 isl_basic_map_free(bmap
);
5540 * returns range - domain
5542 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5546 struct isl_set
*result
;
5551 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5552 map
->dim
, isl_dim_out
),
5554 dim
= isl_map_get_dim(map
);
5555 dim
= isl_dim_domain(dim
);
5556 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5559 for (i
= 0; i
< map
->n
; ++i
)
5560 result
= isl_set_add_basic_set(result
,
5561 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5569 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5571 struct isl_basic_map
*bmap
;
5579 nparam
= dims
->nparam
;
5581 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5585 for (i
= 0; i
< dim
; ++i
) {
5586 int j
= isl_basic_map_alloc_equality(bmap
);
5589 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5590 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5591 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5593 return isl_basic_map_finalize(bmap
);
5595 isl_basic_map_free(bmap
);
5599 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5601 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5604 return basic_map_identity(dim
);
5607 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5609 if (!model
|| !model
->dim
)
5611 isl_assert(model
->ctx
,
5612 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5613 return basic_map_identity(isl_dim_copy(model
->dim
));
5616 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5618 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5619 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5622 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5624 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5627 return map_identity(dim
);
5630 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5632 if (!model
|| !model
->dim
)
5634 isl_assert(model
->ctx
,
5635 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5636 return map_identity(isl_dim_copy(model
->dim
));
5639 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5641 if (!model
|| !model
->dim
)
5643 isl_assert(model
->ctx
,
5644 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5645 return map_identity(isl_dim_copy(model
->dim
));
5648 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5650 isl_dim
*dim
= isl_set_get_dim(set
);
5652 id
= isl_map_identity(dim
);
5653 return isl_map_intersect_range(id
, set
);
5656 /* Construct a basic set with all set dimensions having only non-negative
5659 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5664 struct isl_basic_set
*bset
;
5668 nparam
= dims
->nparam
;
5670 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5673 for (i
= 0; i
< dim
; ++i
) {
5674 int k
= isl_basic_set_alloc_inequality(bset
);
5677 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5678 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5682 isl_basic_set_free(bset
);
5686 /* Construct the half-space x_pos >= 0.
5688 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
5692 isl_basic_set
*nonneg
;
5694 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5695 k
= isl_basic_set_alloc_inequality(nonneg
);
5698 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5699 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
5701 return isl_basic_set_finalize(nonneg
);
5703 isl_basic_set_free(nonneg
);
5707 /* Construct the half-space x_pos <= -1.
5709 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
5714 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5715 k
= isl_basic_set_alloc_inequality(neg
);
5718 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5719 isl_int_set_si(neg
->ineq
[k
][0], -1);
5720 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
5722 return isl_basic_set_finalize(neg
);
5724 isl_basic_set_free(neg
);
5728 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5729 enum isl_dim_type type
, unsigned first
, unsigned n
)
5732 isl_basic_set
*nonneg
;
5740 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5742 for (i
= 0; i
< n
; ++i
) {
5743 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
5744 pos(set
->dim
, type
) + first
+ i
);
5745 neg
= neg_halfspace(isl_set_get_dim(set
),
5746 pos(set
->dim
, type
) + first
+ i
);
5748 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5757 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
5758 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5765 if (isl_set_fast_is_empty(set
)) {
5770 return fn(set
, signs
, user
);
5773 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
5775 half
= isl_set_intersect(half
, isl_set_copy(set
));
5776 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
5780 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
5782 half
= isl_set_intersect(half
, set
);
5783 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
5789 /* Call "fn" on the intersections of "set" with each of the orthants
5790 * (except for obviously empty intersections). The orthant is identified
5791 * by the signs array, with each entry having value 1 or -1 according
5792 * to the sign of the corresponding variable.
5794 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
5795 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5805 if (isl_set_fast_is_empty(set
))
5808 nparam
= isl_set_dim(set
, isl_dim_param
);
5809 nvar
= isl_set_dim(set
, isl_dim_set
);
5811 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
5813 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
5821 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5823 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5826 int isl_basic_map_is_subset(
5827 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5830 struct isl_map
*map1
;
5831 struct isl_map
*map2
;
5833 if (!bmap1
|| !bmap2
)
5836 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5837 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5839 is_subset
= isl_map_is_subset(map1
, map2
);
5847 int isl_basic_map_is_equal(
5848 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5852 if (!bmap1
|| !bmap2
)
5854 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5857 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5861 int isl_basic_set_is_equal(
5862 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5864 return isl_basic_map_is_equal(
5865 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5868 int isl_map_is_empty(struct isl_map
*map
)
5875 for (i
= 0; i
< map
->n
; ++i
) {
5876 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5885 int isl_map_fast_is_empty(struct isl_map
*map
)
5887 return map
? map
->n
== 0 : -1;
5890 int isl_set_fast_is_empty(struct isl_set
*set
)
5892 return set
? set
->n
== 0 : -1;
5895 int isl_set_is_empty(struct isl_set
*set
)
5897 return isl_map_is_empty((struct isl_map
*)set
);
5900 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5905 return isl_dim_equal(map1
->dim
, map2
->dim
);
5908 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5913 return isl_dim_equal(set1
->dim
, set2
->dim
);
5916 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5922 is_subset
= isl_map_is_subset(map1
, map2
);
5925 is_subset
= isl_map_is_subset(map2
, map1
);
5929 int isl_basic_map_is_strict_subset(
5930 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5934 if (!bmap1
|| !bmap2
)
5936 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5939 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5940 if (is_subset
== -1)
5945 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5951 is_subset
= isl_map_is_subset(map1
, map2
);
5954 is_subset
= isl_map_is_subset(map2
, map1
);
5955 if (is_subset
== -1)
5960 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5962 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5965 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5969 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5972 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5976 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5979 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5986 for (i
= 0; i
< map
->n
; ++i
) {
5987 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5995 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5997 return isl_map_fast_is_universe((isl_map
*) set
);
6000 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6002 struct isl_basic_set
*bset
= NULL
;
6003 struct isl_vec
*sample
= NULL
;
6010 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6013 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6014 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6015 copy
= isl_basic_map_remove_redundancies(copy
);
6016 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6017 isl_basic_map_free(copy
);
6021 total
= 1 + isl_basic_map_total_dim(bmap
);
6022 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6023 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6029 isl_vec_free(bmap
->sample
);
6030 bmap
->sample
= NULL
;
6031 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6034 sample
= isl_basic_set_sample_vec(bset
);
6037 empty
= sample
->size
== 0;
6038 isl_vec_free(bmap
->sample
);
6039 bmap
->sample
= sample
;
6041 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6046 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
6050 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6053 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
6057 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6060 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6062 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6065 struct isl_map
*isl_basic_map_union(
6066 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6068 struct isl_map
*map
;
6069 if (!bmap1
|| !bmap2
)
6072 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6074 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6077 map
= isl_map_add_basic_map(map
, bmap1
);
6078 map
= isl_map_add_basic_map(map
, bmap2
);
6081 isl_basic_map_free(bmap1
);
6082 isl_basic_map_free(bmap2
);
6086 struct isl_set
*isl_basic_set_union(
6087 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6089 return (struct isl_set
*)isl_basic_map_union(
6090 (struct isl_basic_map
*)bset1
,
6091 (struct isl_basic_map
*)bset2
);
6094 /* Order divs such that any div only depends on previous divs */
6095 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6103 off
= isl_dim_total(bmap
->dim
);
6105 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6107 if (isl_int_is_zero(bmap
->div
[i
][0]))
6109 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6113 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6119 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6121 return (struct isl_basic_set
*)
6122 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6125 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6132 for (i
= 0; i
< map
->n
; ++i
) {
6133 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6144 /* Look for a div in dst that corresponds to the div "div" in src.
6145 * The divs before "div" in src and dst are assumed to be the same.
6147 * Returns -1 if no corresponding div was found and the position
6148 * of the corresponding div in dst otherwise.
6150 static int find_div(struct isl_basic_map
*dst
,
6151 struct isl_basic_map
*src
, unsigned div
)
6155 unsigned total
= isl_dim_total(src
->dim
);
6157 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6158 for (i
= div
; i
< dst
->n_div
; ++i
)
6159 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6160 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6161 dst
->n_div
- div
) == -1)
6166 struct isl_basic_map
*isl_basic_map_align_divs(
6167 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6170 unsigned total
= isl_dim_total(src
->dim
);
6175 if (src
->n_div
== 0)
6178 for (i
= 0; i
< src
->n_div
; ++i
)
6179 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6181 src
= isl_basic_map_order_divs(src
);
6182 dst
= isl_basic_map_cow(dst
);
6183 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6184 src
->n_div
, 0, 2 * src
->n_div
);
6187 for (i
= 0; i
< src
->n_div
; ++i
) {
6188 int j
= find_div(dst
, src
, i
);
6190 j
= isl_basic_map_alloc_div(dst
);
6193 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6194 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6195 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6199 isl_basic_map_swap_div(dst
, i
, j
);
6203 isl_basic_map_free(dst
);
6207 struct isl_basic_set
*isl_basic_set_align_divs(
6208 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6210 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6211 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6214 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6222 map
= isl_map_compute_divs(map
);
6223 map
= isl_map_cow(map
);
6227 for (i
= 1; i
< map
->n
; ++i
)
6228 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6229 for (i
= 1; i
< map
->n
; ++i
)
6230 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6232 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6236 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6238 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6241 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6245 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6246 map
= isl_map_intersect_domain(map
, set
);
6247 set
= isl_map_range(map
);
6255 /* There is no need to cow as removing empty parts doesn't change
6256 * the meaning of the set.
6258 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6265 for (i
= map
->n
-1; i
>= 0; --i
) {
6266 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6268 isl_basic_map_free(map
->p
[i
]);
6269 if (i
!= map
->n
-1) {
6270 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6271 map
->p
[i
] = map
->p
[map
->n
-1];
6279 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6281 return (struct isl_set
*)
6282 isl_map_remove_empty_parts((struct isl_map
*)set
);
6285 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6287 struct isl_basic_map
*bmap
;
6288 if (!map
|| map
->n
== 0)
6290 bmap
= map
->p
[map
->n
-1];
6291 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6292 return isl_basic_map_copy(bmap
);
6295 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6297 return (struct isl_basic_set
*)
6298 isl_map_copy_basic_map((struct isl_map
*)set
);
6301 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6302 __isl_keep isl_basic_map
*bmap
)
6308 for (i
= map
->n
-1; i
>= 0; --i
) {
6309 if (map
->p
[i
] != bmap
)
6311 map
= isl_map_cow(map
);
6314 isl_basic_map_free(map
->p
[i
]);
6315 if (i
!= map
->n
-1) {
6316 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6317 map
->p
[i
] = map
->p
[map
->n
-1];
6328 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6329 struct isl_basic_set
*bset
)
6331 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6332 (struct isl_basic_map
*)bset
);
6335 /* Given two basic sets bset1 and bset2, compute the maximal difference
6336 * between the values of dimension pos in bset1 and those in bset2
6337 * for any common value of the parameters and dimensions preceding pos.
6339 static enum isl_lp_result
basic_set_maximal_difference_at(
6340 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6341 int pos
, isl_int
*opt
)
6343 struct isl_dim
*dims
;
6344 struct isl_basic_map
*bmap1
= NULL
;
6345 struct isl_basic_map
*bmap2
= NULL
;
6346 struct isl_ctx
*ctx
;
6347 struct isl_vec
*obj
;
6350 unsigned dim1
, dim2
;
6351 enum isl_lp_result res
;
6353 if (!bset1
|| !bset2
)
6354 return isl_lp_error
;
6356 nparam
= isl_basic_set_n_param(bset1
);
6357 dim1
= isl_basic_set_n_dim(bset1
);
6358 dim2
= isl_basic_set_n_dim(bset2
);
6359 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6360 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6361 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6362 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6363 if (!bmap1
|| !bmap2
)
6365 bmap1
= isl_basic_map_cow(bmap1
);
6366 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6367 pos
, (dim1
- pos
) + (dim2
- pos
),
6368 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6369 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6372 total
= isl_basic_map_total_dim(bmap1
);
6374 obj
= isl_vec_alloc(ctx
, 1 + total
);
6375 isl_seq_clr(obj
->block
.data
, 1 + total
);
6376 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6377 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6380 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6382 isl_basic_map_free(bmap1
);
6386 isl_basic_map_free(bmap1
);
6387 isl_basic_map_free(bmap2
);
6388 return isl_lp_error
;
6391 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6392 * for any common value of the parameters and dimensions preceding pos
6393 * in both basic sets, the values of dimension pos in bset1 are
6394 * smaller or larger than those in bset2.
6397 * 1 if bset1 follows bset2
6398 * -1 if bset1 precedes bset2
6399 * 0 if bset1 and bset2 are incomparable
6400 * -2 if some error occurred.
6402 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6403 struct isl_basic_set
*bset2
, int pos
)
6406 enum isl_lp_result res
;
6411 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6413 if (res
== isl_lp_empty
)
6415 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6416 res
== isl_lp_unbounded
)
6418 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6427 /* Given two basic sets bset1 and bset2, check whether
6428 * for any common value of the parameters and dimensions preceding pos
6429 * there is a value of dimension pos in bset1 that is larger
6430 * than a value of the same dimension in bset2.
6433 * 1 if there exists such a pair
6434 * 0 if there is no such pair, but there is a pair of equal values
6436 * -2 if some error occurred.
6438 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6439 __isl_keep isl_basic_set
*bset2
, int pos
)
6442 enum isl_lp_result res
;
6447 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6449 if (res
== isl_lp_empty
)
6451 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6452 res
== isl_lp_unbounded
)
6454 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6456 else if (res
== isl_lp_ok
)
6465 /* Given two sets set1 and set2, check whether
6466 * for any common value of the parameters and dimensions preceding pos
6467 * there is a value of dimension pos in set1 that is larger
6468 * than a value of the same dimension in set2.
6471 * 1 if there exists such a pair
6472 * 0 if there is no such pair, but there is a pair of equal values
6474 * -2 if some error occurred.
6476 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6477 __isl_keep isl_set
*set2
, int pos
)
6485 for (i
= 0; i
< set1
->n
; ++i
)
6486 for (j
= 0; j
< set2
->n
; ++j
) {
6488 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6489 if (f
== 1 || f
== -2)
6498 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6499 unsigned pos
, isl_int
*val
)
6507 total
= isl_basic_map_total_dim(bmap
);
6508 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6509 for (; d
+1 > pos
; --d
)
6510 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6514 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6516 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6518 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6521 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6527 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6528 unsigned pos
, isl_int
*val
)
6540 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6543 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6544 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6545 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6546 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6550 isl_int_set(*val
, v
);
6556 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6557 unsigned pos
, isl_int
*val
)
6559 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6563 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6566 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6569 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6570 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6572 if (pos
>= isl_basic_map_dim(bmap
, type
))
6574 return isl_basic_map_fast_has_fixed_var(bmap
,
6575 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6578 int isl_map_fast_is_fixed(struct isl_map
*map
,
6579 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6581 if (pos
>= isl_map_dim(map
, type
))
6583 return isl_map_fast_has_fixed_var(map
,
6584 map_offset(map
, type
) - 1 + pos
, val
);
6587 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6588 * then return this fixed value in *val.
6590 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6593 return isl_basic_set_fast_has_fixed_var(bset
,
6594 isl_basic_set_n_param(bset
) + dim
, val
);
6597 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6598 * then return this fixed value in *val.
6600 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6602 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6605 /* Check if input variable in has fixed value and if so and if val is not NULL,
6606 * then return this fixed value in *val.
6608 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6610 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6613 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6614 * and if val is not NULL, then return this lower bound in *val.
6616 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6617 unsigned dim
, isl_int
*val
)
6619 int i
, i_eq
= -1, i_ineq
= -1;
6626 total
= isl_basic_set_total_dim(bset
);
6627 nparam
= isl_basic_set_n_param(bset
);
6628 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6629 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6635 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6636 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6638 if (i_eq
!= -1 || i_ineq
!= -1)
6642 if (i_eq
== -1 && i_ineq
== -1)
6644 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6645 /* The coefficient should always be one due to normalization. */
6646 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6648 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6650 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6651 total
- nparam
- dim
- 1) != -1)
6654 isl_int_neg(*val
, c
[0]);
6658 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6659 unsigned dim
, isl_int
*val
)
6671 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6675 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6677 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6678 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6680 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6684 isl_int_set(*val
, v
);
6695 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6697 const struct constraint
*c1
= (const struct constraint
*)p1
;
6698 const struct constraint
*c2
= (const struct constraint
*)p2
;
6699 unsigned size
= isl_min(c1
->size
, c2
->size
);
6700 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6703 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6704 struct isl_basic_map
*bmap
)
6707 struct constraint
*c
;
6712 total
= isl_basic_map_total_dim(bmap
);
6713 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6716 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6718 c
[i
].c
= bmap
->ineq
[i
];
6720 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6721 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6722 bmap
->ineq
[i
] = c
[i
].c
;
6726 isl_basic_map_free(bmap
);
6730 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6731 __isl_take isl_basic_set
*bset
)
6733 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6734 (struct isl_basic_map
*)bset
);
6737 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6741 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6743 bmap
= isl_basic_map_remove_redundancies(bmap
);
6744 bmap
= isl_basic_map_sort_constraints(bmap
);
6745 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6749 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6751 return (struct isl_basic_set
*)isl_basic_map_normalize(
6752 (struct isl_basic_map
*)bset
);
6755 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6756 const __isl_keep isl_basic_map
*bmap2
)
6763 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6764 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6765 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6766 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6767 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6768 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6769 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6770 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6772 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6774 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6776 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6777 return bmap1
->n_eq
- bmap2
->n_eq
;
6778 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6779 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6780 if (bmap1
->n_div
!= bmap2
->n_div
)
6781 return bmap1
->n_div
- bmap2
->n_div
;
6782 total
= isl_basic_map_total_dim(bmap1
);
6783 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6784 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6788 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6789 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6793 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6794 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6801 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6802 __isl_keep isl_basic_map
*bmap2
)
6804 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6807 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6808 __isl_keep isl_basic_set
*bset2
)
6810 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6811 (isl_basic_map
*)bset2
);
6814 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6816 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6817 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6819 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6822 /* We normalize in place, but if anything goes wrong we need
6823 * to return NULL, so we need to make sure we don't change the
6824 * meaning of any possible other copies of map.
6826 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6829 struct isl_basic_map
*bmap
;
6833 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6835 for (i
= 0; i
< map
->n
; ++i
) {
6836 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6839 isl_basic_map_free(map
->p
[i
]);
6842 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6843 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6844 map
= isl_map_remove_empty_parts(map
);
6847 for (i
= map
->n
- 1; i
>= 1; --i
) {
6848 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6850 isl_basic_map_free(map
->p
[i
-1]);
6851 for (j
= i
; j
< map
->n
; ++j
)
6852 map
->p
[j
-1] = map
->p
[j
];
6862 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6864 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6867 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6877 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6880 map1
= isl_map_copy(map1
);
6881 map2
= isl_map_copy(map2
);
6882 map1
= isl_map_normalize(map1
);
6883 map2
= isl_map_normalize(map2
);
6886 equal
= map1
->n
== map2
->n
;
6887 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6888 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6901 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6903 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6904 (struct isl_map
*)set2
);
6907 /* Return an interval that ranges from min to max (inclusive)
6909 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6910 isl_int min
, isl_int max
)
6913 struct isl_basic_set
*bset
= NULL
;
6915 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6919 k
= isl_basic_set_alloc_inequality(bset
);
6922 isl_int_set_si(bset
->ineq
[k
][1], 1);
6923 isl_int_neg(bset
->ineq
[k
][0], min
);
6925 k
= isl_basic_set_alloc_inequality(bset
);
6928 isl_int_set_si(bset
->ineq
[k
][1], -1);
6929 isl_int_set(bset
->ineq
[k
][0], max
);
6933 isl_basic_set_free(bset
);
6937 /* Return the Cartesian product of the basic sets in list (in the given order).
6939 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6947 struct isl_basic_set
*product
= NULL
;
6951 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6952 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6953 nparam
= isl_basic_set_n_param(list
->p
[0]);
6954 dim
= isl_basic_set_n_dim(list
->p
[0]);
6955 extra
= list
->p
[0]->n_div
;
6956 n_eq
= list
->p
[0]->n_eq
;
6957 n_ineq
= list
->p
[0]->n_ineq
;
6958 for (i
= 1; i
< list
->n
; ++i
) {
6959 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6960 isl_assert(list
->ctx
,
6961 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6962 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6963 extra
+= list
->p
[i
]->n_div
;
6964 n_eq
+= list
->p
[i
]->n_eq
;
6965 n_ineq
+= list
->p
[i
]->n_ineq
;
6967 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6972 for (i
= 0; i
< list
->n
; ++i
) {
6973 isl_basic_set_add_constraints(product
,
6974 isl_basic_set_copy(list
->p
[i
]), dim
);
6975 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6977 isl_basic_set_list_free(list
);
6980 isl_basic_set_free(product
);
6981 isl_basic_set_list_free(list
);
6985 struct isl_basic_map
*isl_basic_map_product(
6986 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6988 struct isl_dim
*dim_result
= NULL
;
6989 struct isl_basic_map
*bmap
;
6990 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6991 struct isl_dim_map
*dim_map1
, *dim_map2
;
6993 if (!bmap1
|| !bmap2
)
6996 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6997 bmap2
->dim
, isl_dim_param
), goto error
);
6998 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6999 isl_dim_copy(bmap2
->dim
));
7001 in1
= isl_basic_map_n_in(bmap1
);
7002 in2
= isl_basic_map_n_in(bmap2
);
7003 out1
= isl_basic_map_n_out(bmap1
);
7004 out2
= isl_basic_map_n_out(bmap2
);
7005 nparam
= isl_basic_map_n_param(bmap1
);
7007 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7008 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7009 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7010 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7011 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7012 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7013 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7014 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7015 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7016 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7017 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7019 bmap
= isl_basic_map_alloc_dim(dim_result
,
7020 bmap1
->n_div
+ bmap2
->n_div
,
7021 bmap1
->n_eq
+ bmap2
->n_eq
,
7022 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7023 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7024 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7025 bmap
= isl_basic_map_simplify(bmap
);
7026 return isl_basic_map_finalize(bmap
);
7028 isl_basic_map_free(bmap1
);
7029 isl_basic_map_free(bmap2
);
7033 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7035 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
7038 struct isl_map
*result
;
7044 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7045 map2
->dim
, isl_dim_param
), goto error
);
7047 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7048 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7049 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7051 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
7052 isl_dim_copy(map2
->dim
)),
7053 map1
->n
* map2
->n
, flags
);
7056 for (i
= 0; i
< map1
->n
; ++i
)
7057 for (j
= 0; j
< map2
->n
; ++j
) {
7058 struct isl_basic_map
*part
;
7059 part
= isl_basic_map_product(
7060 isl_basic_map_copy(map1
->p
[i
]),
7061 isl_basic_map_copy(map2
->p
[j
]));
7062 if (isl_basic_map_is_empty(part
))
7063 isl_basic_map_free(part
);
7065 result
= isl_map_add_basic_map(result
, part
);
7078 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7080 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7081 __isl_take isl_map
*map2
)
7085 prod
= isl_map_product(map1
, map2
);
7086 prod
= isl_map_flatten(prod
);
7090 /* Given two set A and B, construct its Cartesian product A x B.
7092 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7094 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
7095 (struct isl_map
*)set2
);
7098 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7099 __isl_take isl_set
*set2
)
7101 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
7104 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7107 uint32_t hash
= isl_hash_init();
7112 bmap
= isl_basic_map_copy(bmap
);
7113 bmap
= isl_basic_map_normalize(bmap
);
7116 total
= isl_basic_map_total_dim(bmap
);
7117 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7118 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7120 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7121 isl_hash_hash(hash
, c_hash
);
7123 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7124 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7126 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7127 isl_hash_hash(hash
, c_hash
);
7129 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7130 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7132 if (isl_int_is_zero(bmap
->div
[i
][0]))
7134 isl_hash_byte(hash
, i
& 0xFF);
7135 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7136 isl_hash_hash(hash
, c_hash
);
7138 isl_basic_map_free(bmap
);
7142 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7144 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7147 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7154 map
= isl_map_copy(map
);
7155 map
= isl_map_normalize(map
);
7159 hash
= isl_hash_init();
7160 for (i
= 0; i
< map
->n
; ++i
) {
7162 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7163 isl_hash_hash(hash
, bmap_hash
);
7171 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7173 return isl_map_get_hash((isl_map
*)set
);
7176 /* Check if the value for dimension dim is completely determined
7177 * by the values of the other parameters and variables.
7178 * That is, check if dimension dim is involved in an equality.
7180 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7187 nparam
= isl_basic_set_n_param(bset
);
7188 for (i
= 0; i
< bset
->n_eq
; ++i
)
7189 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7194 /* Check if the value for dimension dim is completely determined
7195 * by the values of the other parameters and variables.
7196 * That is, check if dimension dim is involved in an equality
7197 * for each of the subsets.
7199 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7205 for (i
= 0; i
< set
->n
; ++i
) {
7207 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7214 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7216 return set
? set
->n
: 0;
7219 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7220 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7227 for (i
= 0; i
< map
->n
; ++i
)
7228 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7234 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7235 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7242 for (i
= 0; i
< set
->n
; ++i
)
7243 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7249 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7251 struct isl_dim
*dim
;
7256 if (bset
->n_div
== 0)
7259 bset
= isl_basic_set_cow(bset
);
7263 dim
= isl_basic_set_get_dim(bset
);
7264 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
7267 isl_dim_free(bset
->dim
);
7269 bset
->extra
-= bset
->n_div
;
7272 bset
= isl_basic_set_finalize(bset
);
7276 isl_basic_set_free(bset
);
7280 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7283 struct isl_dim
*dim
;
7286 set
= isl_set_align_divs(set
);
7290 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
7293 set
= isl_set_cow(set
);
7297 n_div
= set
->p
[0]->n_div
;
7298 dim
= isl_set_get_dim(set
);
7299 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
7302 isl_dim_free(set
->dim
);
7305 for (i
= 0; i
< set
->n
; ++i
) {
7306 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7317 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7319 struct isl_dim
*dim
;
7320 struct isl_basic_map
*bmap
;
7327 set
= isl_set_align_divs(set
);
7332 dim
= isl_set_get_dim(set
);
7333 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7335 return isl_map_identity(dim
);
7338 n_div
= set
->p
[0]->n_div
;
7339 dim
= isl_dim_map(dim
);
7340 n_param
= isl_dim_size(dim
, isl_dim_param
);
7341 n_set
= isl_dim_size(dim
, isl_dim_in
);
7342 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7343 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7344 for (i
= 0; i
< n_set
; ++i
)
7345 bmap
= var_equal(bmap
, i
);
7347 total
= n_param
+ n_set
+ n_set
+ n_div
;
7348 for (i
= 0; i
< n_div
; ++i
) {
7349 k
= isl_basic_map_alloc_inequality(bmap
);
7352 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7353 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7354 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7355 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7356 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7357 set
->p
[0]->div
[i
][0]);
7359 l
= isl_basic_map_alloc_inequality(bmap
);
7362 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7363 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7364 set
->p
[0]->div
[i
][0]);
7365 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7369 return isl_map_from_basic_map(bmap
);
7372 isl_basic_map_free(bmap
);
7376 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7384 dim
= isl_basic_set_total_dim(bset
);
7385 size
+= bset
->n_eq
* (1 + dim
);
7386 size
+= bset
->n_ineq
* (1 + dim
);
7387 size
+= bset
->n_div
* (2 + dim
);
7392 int isl_set_size(__isl_keep isl_set
*set
)
7400 for (i
= 0; i
< set
->n
; ++i
)
7401 size
+= isl_basic_set_size(set
->p
[i
]);
7406 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7407 enum isl_dim_type type
, unsigned pos
)
7415 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7417 pos
+= isl_basic_map_offset(bmap
, type
);
7419 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7420 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7424 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7425 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7432 return lower
&& upper
;
7435 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7436 enum isl_dim_type type
, unsigned pos
)
7443 for (i
= 0; i
< map
->n
; ++i
) {
7445 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7446 if (bounded
< 0 || !bounded
)
7453 /* Return 1 if the specified dim is involved in both an upper bound
7454 * and a lower bound.
7456 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7457 enum isl_dim_type type
, unsigned pos
)
7459 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7462 /* For each of the "n" variables starting at "first", determine
7463 * the sign of the variable and put the results in the first "n"
7464 * elements of the array "signs".
7466 * 1 means that the variable is non-negative
7467 * -1 means that the variable is non-positive
7468 * 0 means the variable attains both positive and negative values.
7470 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7471 unsigned first
, unsigned n
, int *signs
)
7473 isl_vec
*bound
= NULL
;
7474 struct isl_tab
*tab
= NULL
;
7475 struct isl_tab_undo
*snap
;
7478 if (!bset
|| !signs
)
7481 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7482 tab
= isl_tab_from_basic_set(bset
);
7486 isl_seq_clr(bound
->el
, bound
->size
);
7487 isl_int_set_si(bound
->el
[0], -1);
7489 snap
= isl_tab_snap(tab
);
7490 for (i
= 0; i
< n
; ++i
) {
7493 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7494 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7497 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7498 if (isl_tab_rollback(tab
, snap
) < 0)
7506 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7507 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7510 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7511 if (isl_tab_rollback(tab
, snap
) < 0)
7514 signs
[i
] = empty
? -1 : 0;
7518 isl_vec_free(bound
);
7522 isl_vec_free(bound
);
7526 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7527 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7529 if (!bset
|| !signs
)
7531 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7534 first
+= pos(bset
->dim
, type
) - 1;
7535 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7538 /* Check if the given basic map is obviously single-valued.
7539 * In particular, for each output dimension, check that there is
7540 * an equality that defines the output dimension in terms of
7541 * earlier dimensions.
7543 int isl_basic_map_fast_is_single_valued(__isl_keep isl_basic_map
*bmap
)
7553 total
= 1 + isl_basic_map_total_dim(bmap
);
7554 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7555 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
7557 for (i
= 0; i
< n_out
; ++i
) {
7558 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
7559 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
7561 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
7562 total
- (o_out
+ i
+ 1)) == -1)
7565 if (j
>= bmap
->n_eq
)
7572 /* Check if the given map is obviously single-valued.
7574 int isl_map_fast_is_single_valued(__isl_keep isl_map
*map
)
7585 return isl_basic_map_fast_is_single_valued(map
->p
[0]);
7588 /* Check if the given map is single-valued.
7593 * and check if the result is a subset of the identity mapping.
7595 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7601 sv
= isl_map_fast_is_single_valued(map
);
7605 test
= isl_map_reverse(isl_map_copy(map
));
7606 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7608 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7610 sv
= isl_map_is_subset(test
, id
);
7618 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7622 sv
= isl_map_is_single_valued(map
);
7626 map
= isl_map_copy(map
);
7627 map
= isl_map_reverse(map
);
7628 sv
= isl_map_is_single_valued(map
);
7634 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7636 return isl_map_is_single_valued((isl_map
*)set
);
7639 int isl_map_is_translation(__isl_keep isl_map
*map
)
7644 delta
= isl_map_deltas(isl_map_copy(map
));
7645 ok
= isl_set_is_singleton(delta
);
7646 isl_set_free(delta
);
7651 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7653 if (isl_seq_first_non_zero(p
, pos
) != -1)
7655 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7660 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7669 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7672 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7673 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7674 for (j
= 0; j
< nvar
; ++j
) {
7675 int lower
= 0, upper
= 0;
7676 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7677 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7679 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7685 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7686 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7688 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7690 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7695 if (!lower
|| !upper
)
7702 int isl_set_is_box(__isl_keep isl_set
*set
)
7709 return isl_basic_set_is_box(set
->p
[0]);
7712 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7717 return isl_dim_is_wrapping(bset
->dim
);
7720 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7725 return isl_dim_is_wrapping(set
->dim
);
7728 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7730 bmap
= isl_basic_map_cow(bmap
);
7734 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7738 bmap
= isl_basic_map_finalize(bmap
);
7740 return (isl_basic_set
*)bmap
;
7742 isl_basic_map_free(bmap
);
7746 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7750 map
= isl_map_cow(map
);
7754 for (i
= 0; i
< map
->n
; ++i
) {
7755 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7759 map
->dim
= isl_dim_wrap(map
->dim
);
7763 return (isl_set
*)map
;
7769 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7771 bset
= isl_basic_set_cow(bset
);
7775 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7779 bset
= isl_basic_set_finalize(bset
);
7781 return (isl_basic_map
*)bset
;
7783 isl_basic_set_free(bset
);
7787 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7794 if (!isl_set_is_wrapping(set
))
7795 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7798 set
= isl_set_cow(set
);
7802 for (i
= 0; i
< set
->n
; ++i
) {
7803 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7808 set
->dim
= isl_dim_unwrap(set
->dim
);
7812 return (isl_map
*)set
;
7818 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7819 enum isl_dim_type type
)
7824 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7827 bmap
= isl_basic_map_cow(bmap
);
7831 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7835 bmap
= isl_basic_map_finalize(bmap
);
7839 isl_basic_map_free(bmap
);
7843 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7844 enum isl_dim_type type
)
7851 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7854 map
= isl_map_cow(map
);
7858 for (i
= 0; i
< map
->n
; ++i
) {
7859 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7863 map
->dim
= isl_dim_reset(map
->dim
, type
);
7873 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7878 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7881 bmap
= isl_basic_map_cow(bmap
);
7885 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7889 bmap
= isl_basic_map_finalize(bmap
);
7893 isl_basic_map_free(bmap
);
7897 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7904 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7907 map
= isl_map_cow(map
);
7911 for (i
= 0; i
< map
->n
; ++i
) {
7912 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7916 map
->dim
= isl_dim_flatten(map
->dim
);
7926 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
7928 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
7931 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
7933 isl_dim
*dim
, *flat_dim
;
7936 dim
= isl_set_get_dim(set
);
7937 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
7938 map
= map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
7939 map
= isl_map_intersect_domain(map
, set
);
7944 /* Extend the given dim_map with mappings for the divs in bmap.
7946 static __isl_give
struct isl_dim_map
*extend_dim_map(
7947 __isl_keep
struct isl_dim_map
*dim_map
,
7948 __isl_keep isl_basic_map
*bmap
)
7951 struct isl_dim_map
*res
;
7954 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7956 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7960 for (i
= 0; i
< dim_map
->len
; ++i
)
7961 res
->pos
[i
] = dim_map
->pos
[i
];
7962 for (i
= 0; i
< bmap
->n_div
; ++i
)
7963 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7968 /* Extract a dim_map from a reordering.
7969 * We essentially need to reverse the mapping, and add an offset
7970 * of 1 for the constant term.
7972 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7973 __isl_keep isl_reordering
*exp
)
7976 struct isl_dim_map
*dim_map
;
7981 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7985 for (i
= 0; i
< exp
->len
; ++i
)
7986 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7991 /* Reorder the dimensions of "bmap" according to the given dim_map
7992 * and set the dimension specification to "dim".
7994 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7995 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
7999 bmap
= isl_basic_map_cow(bmap
);
8000 if (!bmap
|| !dim
|| !dim_map
)
8003 res
= isl_basic_map_alloc_dim(dim
,
8004 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8005 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
8006 res
= isl_basic_map_finalize(res
);
8010 isl_basic_map_free(bmap
);
8015 /* Reorder the dimensions of "map" according to given reordering.
8017 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8018 __isl_take isl_reordering
*r
)
8021 struct isl_dim_map
*dim_map
;
8023 map
= isl_map_cow(map
);
8024 dim_map
= isl_dim_map_from_reordering(r
);
8025 if (!map
|| !r
|| !dim_map
)
8028 for (i
= 0; i
< map
->n
; ++i
) {
8029 struct isl_dim_map
*dim_map_i
;
8031 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
8033 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8034 isl_dim_copy(r
->dim
), dim_map_i
);
8040 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8042 isl_reordering_free(r
);
8048 isl_reordering_free(r
);
8052 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8053 __isl_take isl_reordering
*r
)
8055 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8058 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8059 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8060 enum isl_dim_type c2
, enum isl_dim_type c3
,
8061 enum isl_dim_type c4
, enum isl_dim_type c5
)
8063 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8064 struct isl_mat
*mat
;
8070 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8071 isl_basic_map_total_dim(bmap
) + 1);
8074 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8075 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8076 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8077 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8078 isl_int_set(mat
->row
[i
][pos
],
8079 bmap
->eq
[i
][off
+ k
]);
8087 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8088 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8089 enum isl_dim_type c2
, enum isl_dim_type c3
,
8090 enum isl_dim_type c4
, enum isl_dim_type c5
)
8092 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8093 struct isl_mat
*mat
;
8099 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8100 isl_basic_map_total_dim(bmap
) + 1);
8103 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8104 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8105 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8106 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8107 isl_int_set(mat
->row
[i
][pos
],
8108 bmap
->ineq
[i
][off
+ k
]);
8116 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8117 __isl_take isl_dim
*dim
,
8118 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8119 enum isl_dim_type c2
, enum isl_dim_type c3
,
8120 enum isl_dim_type c4
, enum isl_dim_type c5
)
8122 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8123 isl_basic_map
*bmap
;
8129 if (!dim
|| !eq
|| !ineq
)
8132 if (eq
->n_col
!= ineq
->n_col
)
8133 isl_die(dim
->ctx
, isl_error_invalid
,
8134 "equalities and inequalities matrices should have "
8135 "same number of columns", goto error
);
8137 total
= 1 + isl_dim_total(dim
);
8139 if (eq
->n_col
< total
)
8140 isl_die(dim
->ctx
, isl_error_invalid
,
8141 "number of columns too small", goto error
);
8143 extra
= eq
->n_col
- total
;
8145 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
8146 eq
->n_row
, ineq
->n_row
);
8149 for (i
= 0; i
< extra
; ++i
)
8150 if (isl_basic_map_alloc_div(bmap
) < 0)
8152 for (i
= 0; i
< eq
->n_row
; ++i
) {
8153 l
= isl_basic_map_alloc_equality(bmap
);
8156 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8157 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8158 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8159 isl_int_set(bmap
->eq
[l
][off
+ k
],
8165 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8166 l
= isl_basic_map_alloc_inequality(bmap
);
8169 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8170 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8171 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8172 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8191 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8192 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8193 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8195 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8196 c1
, c2
, c3
, c4
, isl_dim_in
);
8199 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8200 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8201 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8203 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8204 c1
, c2
, c3
, c4
, isl_dim_in
);
8207 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8208 __isl_take isl_dim
*dim
,
8209 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8210 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8212 return (isl_basic_set
*)
8213 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8214 c1
, c2
, c3
, c4
, isl_dim_in
);