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
;
2037 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2038 bset
->dim
, isl_dim_param
), goto error
);
2040 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2041 isl_assert(bset
->ctx
,
2042 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2044 bmap
= isl_basic_map_cow(bmap
);
2047 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2048 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2049 bmap_domain
= isl_basic_map_from_domain(bset
);
2050 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2052 bmap
= isl_basic_map_simplify(bmap
);
2053 return isl_basic_map_finalize(bmap
);
2055 isl_basic_map_free(bmap
);
2056 isl_basic_set_free(bset
);
2060 struct isl_basic_map
*isl_basic_map_intersect_range(
2061 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2063 struct isl_basic_map
*bmap_range
;
2068 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2069 bset
->dim
, isl_dim_param
), goto error
);
2071 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2072 isl_assert(bset
->ctx
,
2073 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2075 bmap
= isl_basic_map_cow(bmap
);
2078 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2079 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2080 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2081 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2083 bmap
= isl_basic_map_simplify(bmap
);
2084 return isl_basic_map_finalize(bmap
);
2086 isl_basic_map_free(bmap
);
2087 isl_basic_set_free(bset
);
2091 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2097 total
= 1 + isl_basic_map_total_dim(bmap
);
2098 if (total
!= vec
->size
)
2103 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2104 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2105 if (!isl_int_is_zero(s
)) {
2111 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2112 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2113 if (isl_int_is_neg(s
)) {
2124 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2126 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2129 struct isl_basic_map
*isl_basic_map_intersect(
2130 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2132 struct isl_vec
*sample
= NULL
;
2134 if (!bmap1
|| !bmap2
)
2137 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2138 bmap2
->dim
, isl_dim_param
), goto error
);
2139 if (isl_dim_total(bmap1
->dim
) ==
2140 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2141 isl_dim_total(bmap2
->dim
) !=
2142 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2143 return isl_basic_map_intersect(bmap2
, bmap1
);
2145 if (isl_dim_total(bmap2
->dim
) !=
2146 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2147 isl_assert(bmap1
->ctx
,
2148 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2150 if (bmap1
->sample
&&
2151 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2152 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2153 sample
= isl_vec_copy(bmap1
->sample
);
2154 else if (bmap2
->sample
&&
2155 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2156 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2157 sample
= isl_vec_copy(bmap2
->sample
);
2159 bmap1
= isl_basic_map_cow(bmap1
);
2162 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2163 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2164 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2167 isl_vec_free(sample
);
2169 isl_vec_free(bmap1
->sample
);
2170 bmap1
->sample
= sample
;
2173 bmap1
= isl_basic_map_simplify(bmap1
);
2174 return isl_basic_map_finalize(bmap1
);
2177 isl_vec_free(sample
);
2178 isl_basic_map_free(bmap1
);
2179 isl_basic_map_free(bmap2
);
2183 struct isl_basic_set
*isl_basic_set_intersect(
2184 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2186 return (struct isl_basic_set
*)
2187 isl_basic_map_intersect(
2188 (struct isl_basic_map
*)bset1
,
2189 (struct isl_basic_map
*)bset2
);
2192 /* Special case of isl_map_intersect, where both map1 and map2
2193 * are convex, without any divs and such that either map1 or map2
2194 * contains a single constraint. This constraint is then simply
2195 * added to the other map.
2197 static __isl_give isl_map
*map_intersect_add_constraint(
2198 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2200 struct isl_basic_map
*bmap1
;
2201 struct isl_basic_map
*bmap2
;
2203 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2204 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2205 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2206 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2208 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2209 return isl_map_intersect(map2
, map1
);
2211 isl_assert(map2
->ctx
,
2212 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2214 map1
= isl_map_cow(map1
);
2217 if (isl_map_fast_is_empty(map1
)) {
2221 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2222 if (map2
->p
[0]->n_eq
== 1)
2223 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2225 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2226 map2
->p
[0]->ineq
[0]);
2228 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2229 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2233 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2234 isl_basic_map_free(map1
->p
[0]);
2247 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2250 struct isl_map
*result
;
2256 if (isl_map_fast_is_empty(map1
)) {
2260 if (isl_map_fast_is_empty(map2
)) {
2265 if (map1
->n
== 1 && map2
->n
== 1 &&
2266 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2267 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2268 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2269 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2270 return map_intersect_add_constraint(map1
, map2
);
2271 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2272 map2
->dim
, isl_dim_param
), goto error
);
2273 if (isl_dim_total(map1
->dim
) ==
2274 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2275 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2276 return isl_map_intersect(map2
, map1
);
2278 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2279 isl_assert(map1
->ctx
,
2280 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2282 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2283 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2284 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2286 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2287 map1
->n
* map2
->n
, flags
);
2290 for (i
= 0; i
< map1
->n
; ++i
)
2291 for (j
= 0; j
< map2
->n
; ++j
) {
2292 struct isl_basic_map
*part
;
2293 part
= isl_basic_map_intersect(
2294 isl_basic_map_copy(map1
->p
[i
]),
2295 isl_basic_map_copy(map2
->p
[j
]));
2296 if (isl_basic_map_is_empty(part
))
2297 isl_basic_map_free(part
);
2299 result
= isl_map_add_basic_map(result
, part
);
2312 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2314 return (struct isl_set
*)
2315 isl_map_intersect((struct isl_map
*)set1
,
2316 (struct isl_map
*)set2
);
2319 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2321 struct isl_dim
*dim
;
2322 struct isl_basic_set
*bset
;
2327 bmap
= isl_basic_map_cow(bmap
);
2330 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2331 in
= isl_basic_map_n_in(bmap
);
2332 bset
= isl_basic_set_from_basic_map(bmap
);
2333 bset
= isl_basic_set_swap_vars(bset
, in
);
2334 return isl_basic_map_from_basic_set(bset
, dim
);
2337 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2338 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2340 struct isl_dim
*res_dim
;
2341 struct isl_basic_map
*res
;
2342 struct isl_dim_map
*dim_map
;
2343 unsigned total
, off
;
2344 enum isl_dim_type t
;
2352 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2354 total
= isl_basic_map_total_dim(bmap
) + n
;
2355 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2357 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2359 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2361 unsigned size
= isl_basic_map_dim(bmap
, t
);
2362 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2364 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2365 pos
, size
- pos
, off
+ pos
+ n
);
2367 off
+= isl_dim_size(res_dim
, t
);
2369 isl_dim_map_div(dim_map
, bmap
, off
);
2371 res
= isl_basic_map_alloc_dim(res_dim
,
2372 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2373 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2374 return isl_basic_map_finalize(res
);
2377 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2378 enum isl_dim_type type
, unsigned n
)
2382 return isl_basic_map_insert(bmap
, type
,
2383 isl_basic_map_dim(bmap
, type
), n
);
2386 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2387 enum isl_dim_type type
, unsigned n
)
2391 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2392 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2394 isl_basic_set_free(bset
);
2398 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2399 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2406 map
= isl_map_cow(map
);
2410 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2414 for (i
= 0; i
< map
->n
; ++i
) {
2415 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2426 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2427 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2429 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2432 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2433 enum isl_dim_type type
, unsigned n
)
2437 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2440 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2441 enum isl_dim_type type
, unsigned n
)
2445 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2446 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2452 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2453 __isl_take isl_basic_map
*bmap
,
2454 enum isl_dim_type dst_type
, unsigned dst_pos
,
2455 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2458 struct isl_dim_map
*dim_map
;
2459 struct isl_basic_map
*res
;
2460 enum isl_dim_type t
;
2461 unsigned total
, off
;
2468 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2471 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2474 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2476 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2477 pos(bmap
->dim
, src_type
) + src_pos
+
2478 ((src_type
< dst_type
) ? n
: 0)) {
2479 bmap
= isl_basic_map_cow(bmap
);
2483 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2484 src_type
, src_pos
, n
);
2488 bmap
= isl_basic_map_finalize(bmap
);
2493 total
= isl_basic_map_total_dim(bmap
);
2494 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2497 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2498 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2499 if (t
== dst_type
) {
2500 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2503 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2506 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2507 dst_pos
, size
- dst_pos
, off
);
2508 off
+= size
- dst_pos
;
2509 } else if (t
== src_type
) {
2510 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2513 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2514 src_pos
+ n
, size
- src_pos
- n
, off
);
2515 off
+= size
- src_pos
- n
;
2517 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2521 isl_dim_map_div(dim_map
, bmap
, off
);
2523 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2524 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2525 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2527 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2528 src_type
, src_pos
, n
);
2532 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2533 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2534 bmap
= isl_basic_map_finalize(bmap
);
2538 isl_basic_map_free(bmap
);
2542 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2543 enum isl_dim_type dst_type
, unsigned dst_pos
,
2544 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2546 return (isl_basic_set
*)isl_basic_map_move_dims(
2547 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2550 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2551 enum isl_dim_type dst_type
, unsigned dst_pos
,
2552 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2556 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2557 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2558 src_type
, src_pos
, n
);
2564 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2565 enum isl_dim_type dst_type
, unsigned dst_pos
,
2566 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2575 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2578 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2581 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2583 map
= isl_map_cow(map
);
2587 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2591 for (i
= 0; i
< map
->n
; ++i
) {
2592 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2594 src_type
, src_pos
, n
);
2605 /* Move the specified dimensions to the last columns right before
2606 * the divs. Don't change the dimension specification of bmap.
2607 * That's the responsibility of the caller.
2609 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2610 enum isl_dim_type type
, unsigned first
, unsigned n
)
2612 struct isl_dim_map
*dim_map
;
2613 struct isl_basic_map
*res
;
2614 enum isl_dim_type t
;
2615 unsigned total
, off
;
2619 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2622 total
= isl_basic_map_total_dim(bmap
);
2623 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2626 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2627 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2629 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2632 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2633 first
, n
, total
- bmap
->n_div
- n
);
2634 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2635 first
+ n
, size
- (first
+ n
), off
);
2636 off
+= size
- (first
+ n
);
2638 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2642 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2644 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2645 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2646 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2650 /* Turn the n dimensions of type type, starting at first
2651 * into existentially quantified variables.
2653 __isl_give isl_basic_map
*isl_basic_map_project_out(
2654 __isl_take isl_basic_map
*bmap
,
2655 enum isl_dim_type type
, unsigned first
, unsigned n
)
2668 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2669 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2671 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2674 bmap
= move_last(bmap
, type
, first
, n
);
2675 bmap
= isl_basic_map_cow(bmap
);
2679 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2680 old
= bmap
->block2
.data
;
2681 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2682 (bmap
->extra
+ n
) * (1 + row_size
));
2683 if (!bmap
->block2
.data
)
2685 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2688 for (i
= 0; i
< n
; ++i
) {
2689 new_div
[i
] = bmap
->block2
.data
+
2690 (bmap
->extra
+ i
) * (1 + row_size
);
2691 isl_seq_clr(new_div
[i
], 1 + row_size
);
2693 for (i
= 0; i
< bmap
->extra
; ++i
)
2694 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2696 bmap
->div
= new_div
;
2700 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2703 bmap
= isl_basic_map_simplify(bmap
);
2704 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2705 return isl_basic_map_finalize(bmap
);
2707 isl_basic_map_free(bmap
);
2711 /* Turn the n dimensions of type type, starting at first
2712 * into existentially quantified variables.
2714 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2715 enum isl_dim_type type
, unsigned first
, unsigned n
)
2717 return (isl_basic_set
*)isl_basic_map_project_out(
2718 (isl_basic_map
*)bset
, type
, first
, n
);
2721 /* Turn the n dimensions of type type, starting at first
2722 * into existentially quantified variables.
2724 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2725 enum isl_dim_type type
, unsigned first
, unsigned n
)
2735 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2737 map
= isl_map_cow(map
);
2741 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2745 for (i
= 0; i
< map
->n
; ++i
) {
2746 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2757 /* Turn the n dimensions of type type, starting at first
2758 * into existentially quantified variables.
2760 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2761 enum isl_dim_type type
, unsigned first
, unsigned n
)
2763 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2766 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2770 for (i
= 0; i
< n
; ++i
) {
2771 j
= isl_basic_map_alloc_div(bmap
);
2774 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2778 isl_basic_map_free(bmap
);
2782 struct isl_basic_map
*isl_basic_map_apply_range(
2783 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2785 struct isl_dim
*dim_result
= NULL
;
2786 struct isl_basic_map
*bmap
;
2787 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2788 struct isl_dim_map
*dim_map1
, *dim_map2
;
2790 if (!bmap1
|| !bmap2
)
2793 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2794 isl_dim_copy(bmap2
->dim
));
2796 n_in
= isl_basic_map_n_in(bmap1
);
2797 n_out
= isl_basic_map_n_out(bmap2
);
2798 n
= isl_basic_map_n_out(bmap1
);
2799 nparam
= isl_basic_map_n_param(bmap1
);
2801 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2802 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2803 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2804 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2805 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2806 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2807 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2808 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2809 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2810 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2811 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2813 bmap
= isl_basic_map_alloc_dim(dim_result
,
2814 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2815 bmap1
->n_eq
+ bmap2
->n_eq
,
2816 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2817 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2818 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2819 bmap
= add_divs(bmap
, n
);
2820 bmap
= isl_basic_map_simplify(bmap
);
2821 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2822 return isl_basic_map_finalize(bmap
);
2824 isl_basic_map_free(bmap1
);
2825 isl_basic_map_free(bmap2
);
2829 struct isl_basic_set
*isl_basic_set_apply(
2830 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2835 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2838 return (struct isl_basic_set
*)
2839 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2841 isl_basic_set_free(bset
);
2842 isl_basic_map_free(bmap
);
2846 struct isl_basic_map
*isl_basic_map_apply_domain(
2847 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2849 if (!bmap1
|| !bmap2
)
2852 isl_assert(bmap1
->ctx
,
2853 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2854 isl_assert(bmap1
->ctx
,
2855 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2858 bmap1
= isl_basic_map_reverse(bmap1
);
2859 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2860 return isl_basic_map_reverse(bmap1
);
2862 isl_basic_map_free(bmap1
);
2863 isl_basic_map_free(bmap2
);
2867 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2868 * A \cap B -> f(A) + f(B)
2870 struct isl_basic_map
*isl_basic_map_sum(
2871 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2873 unsigned n_in
, n_out
, nparam
, total
, pos
;
2874 struct isl_basic_map
*bmap
= NULL
;
2875 struct isl_dim_map
*dim_map1
, *dim_map2
;
2878 if (!bmap1
|| !bmap2
)
2881 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2884 nparam
= isl_basic_map_n_param(bmap1
);
2885 n_in
= isl_basic_map_n_in(bmap1
);
2886 n_out
= isl_basic_map_n_out(bmap1
);
2888 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2889 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2890 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2891 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2892 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2893 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2894 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2895 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2896 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2897 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2898 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2900 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2901 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2902 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2903 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2904 for (i
= 0; i
< n_out
; ++i
) {
2905 int j
= isl_basic_map_alloc_equality(bmap
);
2908 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2909 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2910 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2911 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2913 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2914 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2915 bmap
= add_divs(bmap
, 2 * n_out
);
2917 bmap
= isl_basic_map_simplify(bmap
);
2918 return isl_basic_map_finalize(bmap
);
2920 isl_basic_map_free(bmap
);
2921 isl_basic_map_free(bmap1
);
2922 isl_basic_map_free(bmap2
);
2926 /* Given two maps A -> f(A) and B -> g(B), construct a map
2927 * A \cap B -> f(A) + f(B)
2929 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2931 struct isl_map
*result
;
2937 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2939 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2940 map1
->n
* map2
->n
, 0);
2943 for (i
= 0; i
< map1
->n
; ++i
)
2944 for (j
= 0; j
< map2
->n
; ++j
) {
2945 struct isl_basic_map
*part
;
2946 part
= isl_basic_map_sum(
2947 isl_basic_map_copy(map1
->p
[i
]),
2948 isl_basic_map_copy(map2
->p
[j
]));
2949 if (isl_basic_map_is_empty(part
))
2950 isl_basic_map_free(part
);
2952 result
= isl_map_add_basic_map(result
, part
);
2965 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2966 __isl_take isl_set
*set2
)
2968 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2971 /* Given a basic map A -> f(A), construct A -> -f(A).
2973 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2978 bmap
= isl_basic_map_cow(bmap
);
2982 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2983 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2984 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2985 for (j
= 0; j
< n
; ++j
)
2986 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2987 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2988 for (j
= 0; j
< n
; ++j
)
2989 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2990 for (i
= 0; i
< bmap
->n_div
; ++i
)
2991 for (j
= 0; j
< n
; ++j
)
2992 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2993 return isl_basic_map_finalize(bmap
);
2996 /* Given a map A -> f(A), construct A -> -f(A).
2998 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3002 map
= isl_map_cow(map
);
3006 for (i
= 0; i
< map
->n
; ++i
) {
3007 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3018 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3020 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3023 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3024 * A -> floor(f(A)/d).
3026 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3029 unsigned n_in
, n_out
, nparam
, total
, pos
;
3030 struct isl_basic_map
*result
= NULL
;
3031 struct isl_dim_map
*dim_map
;
3037 nparam
= isl_basic_map_n_param(bmap
);
3038 n_in
= isl_basic_map_n_in(bmap
);
3039 n_out
= isl_basic_map_n_out(bmap
);
3041 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3042 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3043 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3044 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3045 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3046 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3048 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
3049 bmap
->n_div
+ n_out
,
3050 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3051 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
3052 result
= add_divs(result
, n_out
);
3053 for (i
= 0; i
< n_out
; ++i
) {
3055 j
= isl_basic_map_alloc_inequality(result
);
3058 isl_seq_clr(result
->ineq
[j
], 1+total
);
3059 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3060 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3061 j
= isl_basic_map_alloc_inequality(result
);
3064 isl_seq_clr(result
->ineq
[j
], 1+total
);
3065 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3066 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3067 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3070 result
= isl_basic_map_simplify(result
);
3071 return isl_basic_map_finalize(result
);
3073 isl_basic_map_free(result
);
3077 /* Given a map A -> f(A) and an integer d, construct a map
3078 * A -> floor(f(A)/d).
3080 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3084 map
= isl_map_cow(map
);
3088 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3089 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3090 for (i
= 0; i
< map
->n
; ++i
) {
3091 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3102 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3108 i
= isl_basic_map_alloc_equality(bmap
);
3111 nparam
= isl_basic_map_n_param(bmap
);
3112 n_in
= isl_basic_map_n_in(bmap
);
3113 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3114 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3115 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3116 return isl_basic_map_finalize(bmap
);
3118 isl_basic_map_free(bmap
);
3122 /* Add a constraints to "bmap" expressing i_pos < o_pos
3124 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3130 i
= isl_basic_map_alloc_inequality(bmap
);
3133 nparam
= isl_basic_map_n_param(bmap
);
3134 n_in
= isl_basic_map_n_in(bmap
);
3135 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3136 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3137 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3138 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3139 return isl_basic_map_finalize(bmap
);
3141 isl_basic_map_free(bmap
);
3145 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3147 static __isl_give isl_basic_map
*var_less_or_equal(
3148 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3154 i
= isl_basic_map_alloc_inequality(bmap
);
3157 nparam
= isl_basic_map_n_param(bmap
);
3158 n_in
= isl_basic_map_n_in(bmap
);
3159 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3160 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3161 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3162 return isl_basic_map_finalize(bmap
);
3164 isl_basic_map_free(bmap
);
3168 /* Add a constraints to "bmap" expressing i_pos > o_pos
3170 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3176 i
= isl_basic_map_alloc_inequality(bmap
);
3179 nparam
= isl_basic_map_n_param(bmap
);
3180 n_in
= isl_basic_map_n_in(bmap
);
3181 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3182 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3183 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3184 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3185 return isl_basic_map_finalize(bmap
);
3187 isl_basic_map_free(bmap
);
3191 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3193 static __isl_give isl_basic_map
*var_more_or_equal(
3194 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3200 i
= isl_basic_map_alloc_inequality(bmap
);
3203 nparam
= isl_basic_map_n_param(bmap
);
3204 n_in
= isl_basic_map_n_in(bmap
);
3205 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3206 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3207 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3208 return isl_basic_map_finalize(bmap
);
3210 isl_basic_map_free(bmap
);
3214 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3217 struct isl_basic_map
*bmap
;
3218 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3221 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3222 bmap
= var_equal(bmap
, i
);
3223 return isl_basic_map_finalize(bmap
);
3226 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3228 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3231 struct isl_basic_map
*bmap
;
3232 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3235 for (i
= 0; i
< pos
&& bmap
; ++i
)
3236 bmap
= var_equal(bmap
, i
);
3238 bmap
= var_less(bmap
, pos
);
3239 return isl_basic_map_finalize(bmap
);
3242 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3244 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3245 __isl_take isl_dim
*dim
, unsigned pos
)
3248 isl_basic_map
*bmap
;
3250 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3251 for (i
= 0; i
< pos
; ++i
)
3252 bmap
= var_equal(bmap
, i
);
3253 bmap
= var_less_or_equal(bmap
, pos
);
3254 return isl_basic_map_finalize(bmap
);
3257 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3259 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3262 struct isl_basic_map
*bmap
;
3263 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3266 for (i
= 0; i
< pos
&& bmap
; ++i
)
3267 bmap
= var_equal(bmap
, i
);
3269 bmap
= var_more(bmap
, pos
);
3270 return isl_basic_map_finalize(bmap
);
3273 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3275 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3276 __isl_take isl_dim
*dim
, unsigned pos
)
3279 isl_basic_map
*bmap
;
3281 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3282 for (i
= 0; i
< pos
; ++i
)
3283 bmap
= var_equal(bmap
, i
);
3284 bmap
= var_more_or_equal(bmap
, pos
);
3285 return isl_basic_map_finalize(bmap
);
3288 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3289 unsigned n
, int equal
)
3291 struct isl_map
*map
;
3294 if (n
== 0 && equal
)
3295 return isl_map_universe(dims
);
3297 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3299 for (i
= 0; i
+ 1 < n
; ++i
)
3300 map
= isl_map_add_basic_map(map
,
3301 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3304 map
= isl_map_add_basic_map(map
,
3305 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3307 map
= isl_map_add_basic_map(map
,
3308 isl_basic_map_less_at(dims
, n
- 1));
3315 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3319 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3322 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3324 return map_lex_lte_first(dim
, n
, 0);
3327 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3329 return map_lex_lte_first(dim
, n
, 1);
3332 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3334 return map_lex_lte(isl_dim_map(set_dim
), 0);
3337 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3339 return map_lex_lte(isl_dim_map(set_dim
), 1);
3342 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3343 unsigned n
, int equal
)
3345 struct isl_map
*map
;
3348 if (n
== 0 && equal
)
3349 return isl_map_universe(dims
);
3351 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3353 for (i
= 0; i
+ 1 < n
; ++i
)
3354 map
= isl_map_add_basic_map(map
,
3355 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3358 map
= isl_map_add_basic_map(map
,
3359 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3361 map
= isl_map_add_basic_map(map
,
3362 isl_basic_map_more_at(dims
, n
- 1));
3369 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3373 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3376 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3378 return map_lex_gte_first(dim
, n
, 0);
3381 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3383 return map_lex_gte_first(dim
, n
, 1);
3386 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3388 return map_lex_gte(isl_dim_map(set_dim
), 0);
3391 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3393 return map_lex_gte(isl_dim_map(set_dim
), 1);
3396 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3397 __isl_take isl_set
*set2
)
3400 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3401 map
= isl_map_intersect_domain(map
, set1
);
3402 map
= isl_map_intersect_range(map
, set2
);
3406 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3407 __isl_take isl_set
*set2
)
3410 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3411 map
= isl_map_intersect_domain(map
, set1
);
3412 map
= isl_map_intersect_range(map
, set2
);
3416 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3417 __isl_take isl_set
*set2
)
3420 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3421 map
= isl_map_intersect_domain(map
, set1
);
3422 map
= isl_map_intersect_range(map
, set2
);
3426 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3427 __isl_take isl_set
*set2
)
3430 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3431 map
= isl_map_intersect_domain(map
, set1
);
3432 map
= isl_map_intersect_range(map
, set2
);
3436 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3437 __isl_take isl_map
*map2
)
3440 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3441 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3442 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3446 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3447 __isl_take isl_map
*map2
)
3450 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3451 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3452 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3456 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3457 __isl_take isl_map
*map2
)
3460 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3461 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3462 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3466 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3467 __isl_take isl_map
*map2
)
3470 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3471 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3472 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3476 struct isl_basic_map
*isl_basic_map_from_basic_set(
3477 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3479 struct isl_basic_map
*bmap
;
3481 bset
= isl_basic_set_cow(bset
);
3485 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3486 isl_dim_free(bset
->dim
);
3487 bmap
= (struct isl_basic_map
*) bset
;
3489 return isl_basic_map_finalize(bmap
);
3491 isl_basic_set_free(bset
);
3496 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3500 if (bmap
->dim
->n_in
== 0)
3501 return (struct isl_basic_set
*)bmap
;
3502 bmap
= isl_basic_map_cow(bmap
);
3505 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3508 bmap
= isl_basic_map_finalize(bmap
);
3509 return (struct isl_basic_set
*)bmap
;
3511 isl_basic_map_free(bmap
);
3515 /* For a div d = floor(f/m), add the constraints
3518 * -(f-(n-1)) + m d >= 0
3520 * Note that the second constraint is the negation of
3524 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3525 unsigned pos
, isl_int
*div
)
3528 unsigned total
= isl_basic_map_total_dim(bmap
);
3530 i
= isl_basic_map_alloc_inequality(bmap
);
3533 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3534 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3536 j
= isl_basic_map_alloc_inequality(bmap
);
3539 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3540 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3541 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3545 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3546 unsigned pos
, isl_int
*div
)
3548 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3552 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3554 unsigned total
= isl_basic_map_total_dim(bmap
);
3555 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3557 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3561 struct isl_basic_set
*isl_basic_map_underlying_set(
3562 struct isl_basic_map
*bmap
)
3566 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3568 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3569 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3570 return (struct isl_basic_set
*)bmap
;
3571 bmap
= isl_basic_map_cow(bmap
);
3574 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3577 bmap
->extra
-= bmap
->n_div
;
3579 bmap
= isl_basic_map_finalize(bmap
);
3580 return (struct isl_basic_set
*)bmap
;
3585 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3586 __isl_take isl_basic_set
*bset
)
3588 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3591 struct isl_basic_map
*isl_basic_map_overlying_set(
3592 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3594 struct isl_basic_map
*bmap
;
3595 struct isl_ctx
*ctx
;
3602 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3603 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3604 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3606 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3607 isl_basic_map_free(like
);
3608 return (struct isl_basic_map
*)bset
;
3610 bset
= isl_basic_set_cow(bset
);
3613 total
= bset
->dim
->n_out
+ bset
->extra
;
3614 bmap
= (struct isl_basic_map
*)bset
;
3615 isl_dim_free(bmap
->dim
);
3616 bmap
->dim
= isl_dim_copy(like
->dim
);
3619 bmap
->n_div
= like
->n_div
;
3620 bmap
->extra
+= like
->n_div
;
3623 ltotal
= total
- bmap
->extra
+ like
->extra
;
3626 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3627 bmap
->extra
* (1 + 1 + total
));
3628 if (isl_blk_is_error(bmap
->block2
))
3630 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3634 for (i
= 0; i
< bmap
->extra
; ++i
)
3635 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3636 for (i
= 0; i
< like
->n_div
; ++i
) {
3637 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3638 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3640 bmap
= isl_basic_map_extend_constraints(bmap
,
3641 0, 2 * like
->n_div
);
3642 for (i
= 0; i
< like
->n_div
; ++i
) {
3643 if (isl_int_is_zero(bmap
->div
[i
][0]))
3645 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3649 isl_basic_map_free(like
);
3650 bmap
= isl_basic_map_simplify(bmap
);
3651 bmap
= isl_basic_map_finalize(bmap
);
3654 isl_basic_map_free(like
);
3655 isl_basic_set_free(bset
);
3659 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3660 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3662 return (struct isl_basic_set
*)
3663 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3666 struct isl_set
*isl_set_from_underlying_set(
3667 struct isl_set
*set
, struct isl_basic_set
*like
)
3673 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3675 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3676 isl_basic_set_free(like
);
3679 set
= isl_set_cow(set
);
3682 for (i
= 0; i
< set
->n
; ++i
) {
3683 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3684 isl_basic_set_copy(like
));
3688 isl_dim_free(set
->dim
);
3689 set
->dim
= isl_dim_copy(like
->dim
);
3692 isl_basic_set_free(like
);
3695 isl_basic_set_free(like
);
3700 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3704 map
= isl_map_cow(map
);
3707 map
->dim
= isl_dim_cow(map
->dim
);
3711 for (i
= 1; i
< map
->n
; ++i
)
3712 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3714 for (i
= 0; i
< map
->n
; ++i
) {
3715 map
->p
[i
] = (struct isl_basic_map
*)
3716 isl_basic_map_underlying_set(map
->p
[i
]);
3721 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3723 isl_dim_free(map
->dim
);
3724 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3728 return (struct isl_set
*)map
;
3734 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3736 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3739 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3740 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3742 bmap
= isl_basic_map_cow(bmap
);
3746 isl_dim_free(bmap
->dim
);
3749 bmap
= isl_basic_map_finalize(bmap
);
3753 isl_basic_map_free(bmap
);
3758 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3759 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3761 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3765 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3766 __isl_take isl_dim
*dim
)
3770 map
= isl_map_cow(map
);
3774 for (i
= 0; i
< map
->n
; ++i
) {
3775 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3780 isl_dim_free(map
->dim
);
3790 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3791 __isl_take isl_dim
*dim
)
3793 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3796 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3799 struct isl_basic_set
*domain
;
3805 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3807 n_in
= isl_basic_map_n_in(bmap
);
3808 n_out
= isl_basic_map_n_out(bmap
);
3809 domain
= isl_basic_set_from_basic_map(bmap
);
3810 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3812 domain
= isl_basic_set_reset_dim(domain
, dim
);
3817 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3819 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3822 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3823 __isl_take isl_basic_map
*bmap
)
3827 isl_basic_map
*domain
;
3828 isl_basic_set
*bset
;
3829 int nparam
, n_in
, n_out
;
3832 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3833 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3834 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3836 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3837 domain
= isl_basic_map_universe(dim
);
3839 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3840 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3841 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3843 total
= isl_basic_map_total_dim(bmap
);
3845 for (i
= 0; i
< n_in
; ++i
) {
3846 k
= isl_basic_map_alloc_equality(bmap
);
3849 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3850 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3851 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3854 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3855 return isl_basic_map_finalize(bmap
);
3857 isl_basic_map_free(bmap
);
3861 __isl_give isl_basic_map
*isl_basic_map_range_map(
3862 __isl_take isl_basic_map
*bmap
)
3866 isl_basic_map
*range
;
3867 isl_basic_set
*bset
;
3868 int nparam
, n_in
, n_out
;
3871 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3872 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3873 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3875 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3876 range
= isl_basic_map_universe(dim
);
3878 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3879 bmap
= isl_basic_map_apply_range(bmap
, range
);
3880 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3882 total
= isl_basic_map_total_dim(bmap
);
3884 for (i
= 0; i
< n_out
; ++i
) {
3885 k
= isl_basic_map_alloc_equality(bmap
);
3888 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3889 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3890 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3893 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3894 return isl_basic_map_finalize(bmap
);
3896 isl_basic_map_free(bmap
);
3900 struct isl_set
*isl_map_range(struct isl_map
*map
)
3903 struct isl_set
*set
;
3907 if (isl_map_dim(map
, isl_dim_in
) == 0)
3908 return (isl_set
*)map
;
3910 map
= isl_map_cow(map
);
3914 set
= (struct isl_set
*) map
;
3915 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3918 for (i
= 0; i
< map
->n
; ++i
) {
3919 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3923 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3924 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3931 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3934 isl_dim
*domain_dim
;
3936 map
= isl_map_cow(map
);
3940 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3941 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3942 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3945 for (i
= 0; i
< map
->n
; ++i
) {
3946 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3950 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3951 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3958 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3963 map
= isl_map_cow(map
);
3967 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3968 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3969 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3972 for (i
= 0; i
< map
->n
; ++i
) {
3973 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3977 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3978 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3985 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3988 struct isl_map
*map
= NULL
;
3990 set
= isl_set_cow(set
);
3993 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3994 map
= (struct isl_map
*)set
;
3995 for (i
= 0; i
< set
->n
; ++i
) {
3996 map
->p
[i
] = isl_basic_map_from_basic_set(
3997 set
->p
[i
], isl_dim_copy(dim
));
4001 isl_dim_free(map
->dim
);
4010 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4011 __isl_take isl_basic_set
*bset
)
4013 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4016 __isl_give isl_basic_map
*isl_basic_map_from_range(
4017 __isl_take isl_basic_set
*bset
)
4019 return (isl_basic_map
*)bset
;
4022 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4024 return (struct isl_map
*)set
;
4027 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4029 return isl_map_reverse(isl_map_from_range(set
));
4032 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4033 __isl_take isl_set
*range
)
4035 return isl_map_apply_range(isl_map_from_domain(domain
),
4036 isl_map_from_range(range
));
4039 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4042 struct isl_set
*set
= NULL
;
4046 map
= isl_map_cow(map
);
4049 map
->dim
= isl_dim_as_set_dim(map
->dim
);
4052 set
= (struct isl_set
*)map
;
4053 for (i
= 0; i
< map
->n
; ++i
) {
4054 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4064 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
4066 struct isl_map
*map
;
4070 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4071 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4072 sizeof(struct isl_map
) +
4073 (n
- 1) * sizeof(struct isl_basic_map
*));
4077 map
->ctx
= dim
->ctx
;
4078 isl_ctx_ref(map
->ctx
);
4090 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4091 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4094 struct isl_map
*map
;
4095 struct isl_dim
*dims
;
4097 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4101 map
= isl_map_alloc_dim(dims
, n
, flags
);
4105 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4107 struct isl_basic_map
*bmap
;
4108 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4109 bmap
= isl_basic_map_set_to_empty(bmap
);
4113 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4115 struct isl_basic_set
*bset
;
4116 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4117 bset
= isl_basic_set_set_to_empty(bset
);
4121 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4123 struct isl_basic_map
*bmap
;
4126 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4127 bmap
= isl_basic_map_set_to_empty(bmap
);
4131 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4133 struct isl_basic_map
*bmap
;
4136 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4137 bmap
= isl_basic_map_set_to_empty(bmap
);
4141 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4143 struct isl_basic_set
*bset
;
4146 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4147 bset
= isl_basic_set_set_to_empty(bset
);
4151 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4153 struct isl_basic_map
*bmap
;
4154 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4155 bmap
= isl_basic_map_finalize(bmap
);
4159 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4161 struct isl_basic_set
*bset
;
4162 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4163 bset
= isl_basic_set_finalize(bset
);
4167 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4168 __isl_keep isl_basic_map
*model
)
4172 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4175 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4179 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4182 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4183 __isl_keep isl_set
*model
)
4187 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4190 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4192 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4195 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4199 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4202 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4206 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4209 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4211 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4214 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4218 return isl_set_empty(isl_dim_copy(model
->dim
));
4221 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4223 struct isl_map
*map
;
4226 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4227 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4231 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4233 struct isl_set
*set
;
4236 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4237 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4241 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4245 return isl_set_universe(isl_dim_copy(model
->dim
));
4248 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4251 struct isl_map
*dup
;
4255 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4256 for (i
= 0; i
< map
->n
; ++i
)
4257 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4261 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4262 __isl_take isl_basic_map
*bmap
)
4266 if (isl_basic_map_fast_is_empty(bmap
)) {
4267 isl_basic_map_free(bmap
);
4270 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4271 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4272 map
->p
[map
->n
] = bmap
;
4274 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4280 isl_basic_map_free(bmap
);
4284 void isl_map_free(struct isl_map
*map
)
4294 isl_ctx_deref(map
->ctx
);
4295 for (i
= 0; i
< map
->n
; ++i
)
4296 isl_basic_map_free(map
->p
[i
]);
4297 isl_dim_free(map
->dim
);
4301 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4302 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4306 base
= isl_map_cow(base
);
4310 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4313 for (i
= 0; i
< base
->n
; ++i
) {
4314 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4315 isl_dim_copy(base
->dim
), 0, 0, 0);
4325 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4326 unsigned nparam
, unsigned dim
)
4328 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4332 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4333 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4337 bmap
= isl_basic_map_cow(bmap
);
4338 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4339 j
= isl_basic_map_alloc_equality(bmap
);
4342 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4343 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4344 isl_int_set_si(bmap
->eq
[j
][0], value
);
4345 bmap
= isl_basic_map_simplify(bmap
);
4346 return isl_basic_map_finalize(bmap
);
4348 isl_basic_map_free(bmap
);
4352 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4353 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4357 bmap
= isl_basic_map_cow(bmap
);
4358 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4359 j
= isl_basic_map_alloc_equality(bmap
);
4362 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4363 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4364 isl_int_set(bmap
->eq
[j
][0], value
);
4365 bmap
= isl_basic_map_simplify(bmap
);
4366 return isl_basic_map_finalize(bmap
);
4368 isl_basic_map_free(bmap
);
4372 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4373 enum isl_dim_type type
, unsigned pos
, int value
)
4377 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4378 return isl_basic_map_fix_pos_si(bmap
,
4379 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4381 isl_basic_map_free(bmap
);
4385 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4386 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4390 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4391 return isl_basic_map_fix_pos(bmap
,
4392 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4394 isl_basic_map_free(bmap
);
4398 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4399 enum isl_dim_type type
, unsigned pos
, int value
)
4401 return (struct isl_basic_set
*)
4402 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4406 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4407 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4409 return (struct isl_basic_set
*)
4410 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4414 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4415 unsigned input
, int value
)
4417 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4420 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4421 unsigned dim
, int value
)
4423 return (struct isl_basic_set
*)
4424 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4425 isl_dim_set
, dim
, value
);
4428 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4429 enum isl_dim_type type
, unsigned pos
, int value
)
4433 map
= isl_map_cow(map
);
4437 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4438 for (i
= 0; i
< map
->n
; ++i
) {
4439 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4443 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4450 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4451 enum isl_dim_type type
, unsigned pos
, int value
)
4453 return (struct isl_set
*)
4454 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4457 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4458 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4462 map
= isl_map_cow(map
);
4466 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4467 for (i
= 0; i
< map
->n
; ++i
) {
4468 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4472 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4479 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4480 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4482 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4485 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4486 unsigned input
, int value
)
4488 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4491 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4493 return (struct isl_set
*)
4494 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4497 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4498 __isl_take isl_basic_map
*bmap
,
4499 enum isl_dim_type type
, unsigned pos
, int value
)
4505 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4506 pos
+= isl_basic_map_offset(bmap
, type
);
4507 bmap
= isl_basic_map_cow(bmap
);
4508 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4509 j
= isl_basic_map_alloc_inequality(bmap
);
4512 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4513 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4514 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4515 bmap
= isl_basic_map_simplify(bmap
);
4516 return isl_basic_map_finalize(bmap
);
4518 isl_basic_map_free(bmap
);
4522 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4523 unsigned dim
, isl_int value
)
4527 bset
= isl_basic_set_cow(bset
);
4528 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4529 j
= isl_basic_set_alloc_inequality(bset
);
4532 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4533 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4534 isl_int_neg(bset
->ineq
[j
][0], value
);
4535 bset
= isl_basic_set_simplify(bset
);
4536 return isl_basic_set_finalize(bset
);
4538 isl_basic_set_free(bset
);
4542 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4543 enum isl_dim_type type
, unsigned pos
, int value
)
4547 map
= isl_map_cow(map
);
4551 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4552 for (i
= 0; i
< map
->n
; ++i
) {
4553 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4558 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4565 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4566 enum isl_dim_type type
, unsigned pos
, int value
)
4568 return (struct isl_set
*)
4569 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4572 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4577 set
= isl_set_cow(set
);
4581 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4582 for (i
= 0; i
< set
->n
; ++i
) {
4583 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4593 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4597 map
= isl_map_cow(map
);
4601 map
->dim
= isl_dim_reverse(map
->dim
);
4604 for (i
= 0; i
< map
->n
; ++i
) {
4605 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4609 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4616 static struct isl_map
*isl_basic_map_partial_lexopt(
4617 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4618 struct isl_set
**empty
, int max
)
4622 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4623 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4625 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4627 isl_basic_map_free(bmap
);
4628 isl_basic_set_free(dom
);
4634 struct isl_map
*isl_basic_map_partial_lexmax(
4635 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4636 struct isl_set
**empty
)
4638 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4641 struct isl_map
*isl_basic_map_partial_lexmin(
4642 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4643 struct isl_set
**empty
)
4645 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4648 struct isl_set
*isl_basic_set_partial_lexmin(
4649 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4650 struct isl_set
**empty
)
4652 return (struct isl_set
*)
4653 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4657 struct isl_set
*isl_basic_set_partial_lexmax(
4658 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4659 struct isl_set
**empty
)
4661 return (struct isl_set
*)
4662 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4666 /* Given a basic map "bmap", compute the lexicographically minimal
4667 * (or maximal) image element for each domain element in dom.
4668 * Set *empty to those elements in dom that do not have an image element.
4670 * We first make sure the basic sets in dom are disjoint and then
4671 * simply collect the results over each of the basic sets separately.
4672 * We could probably improve the efficiency a bit by moving the union
4673 * domain down into the parametric integer programming.
4675 static __isl_give isl_map
*basic_map_partial_lexopt(
4676 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4677 __isl_give isl_set
**empty
, int max
)
4680 struct isl_map
*res
;
4682 dom
= isl_set_make_disjoint(dom
);
4686 if (isl_set_fast_is_empty(dom
)) {
4687 res
= isl_map_empty_like_basic_map(bmap
);
4688 *empty
= isl_set_empty_like(dom
);
4690 isl_basic_map_free(bmap
);
4694 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4695 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4697 for (i
= 1; i
< dom
->n
; ++i
) {
4698 struct isl_map
*res_i
;
4699 struct isl_set
*empty_i
;
4701 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4702 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4704 res
= isl_map_union_disjoint(res
, res_i
);
4705 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4709 isl_basic_map_free(bmap
);
4714 isl_basic_map_free(bmap
);
4718 /* Given a map "map", compute the lexicographically minimal
4719 * (or maximal) image element for each domain element in dom.
4720 * Set *empty to those elements in dom that do not have an image element.
4722 * We first compute the lexicographically minimal or maximal element
4723 * in the first basic map. This results in a partial solution "res"
4724 * and a subset "todo" of dom that still need to be handled.
4725 * We then consider each of the remaining maps in "map" and successively
4726 * improve both "res" and "todo".
4728 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4729 * Assume we are computing the lexicographical maximum.
4730 * We first compute the lexicographically maximal element in basic map i.
4731 * This results in a partial solution res_i and a subset todo_i.
4732 * Then we combine these results with those obtain for the first k basic maps
4733 * to obtain a result that is valid for the first k+1 basic maps.
4734 * In particular, the set where there is no solution is the set where
4735 * there is no solution for the first k basic maps and also no solution
4736 * for the ith basic map, i.e.,
4738 * todo^i = todo^k * todo_i
4740 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4741 * solutions, arbitrarily breaking ties in favor of res^k.
4742 * That is, when res^k(a) >= res_i(a), we pick res^k and
4743 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4744 * the lexicographic order.)
4745 * In practice, we compute
4747 * res^k * (res_i . "<=")
4751 * res_i * (res^k . "<")
4753 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4754 * where only one of res^k and res_i provides a solution and we simply pick
4761 * Note that we only compute these intersections when dom(res^k) intersects
4762 * dom(res_i). Otherwise, the only effect of these intersections is to
4763 * potentially break up res^k and res_i into smaller pieces.
4764 * We want to avoid such splintering as much as possible.
4765 * In fact, an earlier implementation of this function would look for
4766 * better results in the domain of res^k and for extra results in todo^k,
4767 * but this would always result in a splintering according to todo^k,
4768 * even when the domain of basic map i is disjoint from the domains of
4769 * the previous basic maps.
4771 static __isl_give isl_map
*isl_map_partial_lexopt(
4772 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4773 __isl_give isl_set
**empty
, int max
)
4776 struct isl_map
*res
;
4777 struct isl_set
*todo
;
4782 if (isl_map_fast_is_empty(map
)) {
4790 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4791 isl_set_copy(dom
), &todo
, max
);
4793 for (i
= 1; i
< map
->n
; ++i
) {
4797 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
4799 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4800 isl_set_copy(dom
), &todo_i
, max
);
4803 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
4804 le
= isl_map_lex_le(dim
);
4806 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
4807 le
= isl_map_lex_ge(dim
);
4809 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4810 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
4811 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
4812 le
= isl_map_intersect(le
, isl_map_copy(res
));
4814 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
4815 res
= isl_map_intersect_domain(res
,
4816 isl_set_copy(todo_i
));
4817 res_i
= isl_map_intersect_domain(res_i
,
4818 isl_set_copy(todo
));
4821 res
= isl_map_union_disjoint(res
, res_i
);
4822 res
= isl_map_union_disjoint(res
, lt
);
4823 res
= isl_map_union_disjoint(res
, le
);
4825 todo
= isl_set_intersect(todo
, todo_i
);
4845 __isl_give isl_map
*isl_map_partial_lexmax(
4846 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4847 __isl_give isl_set
**empty
)
4849 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4852 __isl_give isl_map
*isl_map_partial_lexmin(
4853 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4854 __isl_give isl_set
**empty
)
4856 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4859 __isl_give isl_set
*isl_set_partial_lexmin(
4860 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4861 __isl_give isl_set
**empty
)
4863 return (struct isl_set
*)
4864 isl_map_partial_lexmin((struct isl_map
*)set
,
4868 __isl_give isl_set
*isl_set_partial_lexmax(
4869 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4870 __isl_give isl_set
**empty
)
4872 return (struct isl_set
*)
4873 isl_map_partial_lexmax((struct isl_map
*)set
,
4877 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4879 struct isl_basic_set
*dom
= NULL
;
4880 struct isl_dim
*dom_dim
;
4884 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4885 dom
= isl_basic_set_universe(dom_dim
);
4886 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4888 isl_basic_map_free(bmap
);
4892 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4894 return isl_basic_map_lexopt(bmap
, 0);
4897 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4899 return isl_basic_map_lexopt(bmap
, 1);
4902 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4904 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4907 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4909 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4912 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4914 struct isl_set
*dom
= NULL
;
4915 struct isl_dim
*dom_dim
;
4919 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4920 dom
= isl_set_universe(dom_dim
);
4921 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4927 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4929 return isl_map_lexopt(map
, 0);
4932 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4934 return isl_map_lexopt(map
, 1);
4937 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4939 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4942 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4944 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4947 /* Apply a preimage specified by "mat" on the parameters of "bset".
4948 * bset is assumed to have only parameters and divs.
4950 static struct isl_basic_set
*basic_set_parameter_preimage(
4951 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4958 bset
->dim
= isl_dim_cow(bset
->dim
);
4962 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4964 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4966 bset
->dim
->nparam
= 0;
4967 bset
->dim
->n_out
= nparam
;
4968 bset
= isl_basic_set_preimage(bset
, mat
);
4970 bset
->dim
->nparam
= bset
->dim
->n_out
;
4971 bset
->dim
->n_out
= 0;
4976 isl_basic_set_free(bset
);
4980 /* Apply a preimage specified by "mat" on the parameters of "set".
4981 * set is assumed to have only parameters and divs.
4983 static struct isl_set
*set_parameter_preimage(
4984 struct isl_set
*set
, struct isl_mat
*mat
)
4986 struct isl_dim
*dim
= NULL
;
4992 dim
= isl_dim_copy(set
->dim
);
4993 dim
= isl_dim_cow(dim
);
4997 nparam
= isl_set_dim(set
, isl_dim_param
);
4999 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5002 dim
->n_out
= nparam
;
5003 isl_set_reset_dim(set
, dim
);
5004 set
= isl_set_preimage(set
, mat
);
5007 dim
= isl_dim_copy(set
->dim
);
5008 dim
= isl_dim_cow(dim
);
5011 dim
->nparam
= dim
->n_out
;
5013 isl_set_reset_dim(set
, dim
);
5023 /* Intersect the basic set "bset" with the affine space specified by the
5024 * equalities in "eq".
5026 static struct isl_basic_set
*basic_set_append_equalities(
5027 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5035 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
5040 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
5041 for (i
= 0; i
< eq
->n_row
; ++i
) {
5042 k
= isl_basic_set_alloc_equality(bset
);
5045 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5046 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5050 bset
= isl_basic_set_gauss(bset
, NULL
);
5051 bset
= isl_basic_set_finalize(bset
);
5056 isl_basic_set_free(bset
);
5060 /* Intersect the set "set" with the affine space specified by the
5061 * equalities in "eq".
5063 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5071 for (i
= 0; i
< set
->n
; ++i
) {
5072 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5085 /* Project the given basic set onto its parameter domain, possibly introducing
5086 * new, explicit, existential variables in the constraints.
5087 * The input has parameters and (possibly implicit) existential variables.
5088 * The output has the same parameters, but only
5089 * explicit existentially quantified variables.
5091 * The actual projection is performed by pip, but pip doesn't seem
5092 * to like equalities very much, so we first remove the equalities
5093 * among the parameters by performing a variable compression on
5094 * the parameters. Afterward, an inverse transformation is performed
5095 * and the equalities among the parameters are inserted back in.
5097 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5101 struct isl_mat
*T
, *T2
;
5102 struct isl_set
*set
;
5103 unsigned nparam
, n_div
;
5105 bset
= isl_basic_set_cow(bset
);
5109 if (bset
->n_eq
== 0)
5110 return isl_basic_set_lexmin(bset
);
5112 isl_basic_set_gauss(bset
, NULL
);
5114 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5115 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5117 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5118 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5121 if (i
== bset
->n_eq
)
5122 return isl_basic_set_lexmin(bset
);
5124 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5126 eq
= isl_mat_cow(eq
);
5127 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5128 if (T
&& T
->n_col
== 0) {
5132 bset
= isl_basic_set_set_to_empty(bset
);
5133 return isl_set_from_basic_set(bset
);
5135 bset
= basic_set_parameter_preimage(bset
, T
);
5137 set
= isl_basic_set_lexmin(bset
);
5138 set
= set_parameter_preimage(set
, T2
);
5139 set
= set_append_equalities(set
, eq
);
5143 /* Compute an explicit representation for all the existentially
5144 * quantified variables.
5145 * The input and output dimensions are first turned into parameters.
5146 * compute_divs then returns a map with the same parameters and
5147 * no input or output dimensions and the dimension specification
5148 * is reset to that of the input.
5150 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5152 struct isl_basic_set
*bset
;
5153 struct isl_set
*set
;
5154 struct isl_map
*map
;
5155 struct isl_dim
*dim
, *orig_dim
= NULL
;
5160 bmap
= isl_basic_map_cow(bmap
);
5164 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5165 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5166 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5167 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5171 orig_dim
= bmap
->dim
;
5173 bset
= (struct isl_basic_set
*)bmap
;
5175 set
= parameter_compute_divs(bset
);
5176 map
= (struct isl_map
*)set
;
5177 map
= isl_map_reset_dim(map
, orig_dim
);
5181 isl_basic_map_free(bmap
);
5185 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5193 off
= isl_dim_total(bmap
->dim
);
5194 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5195 if (isl_int_is_zero(bmap
->div
[i
][0]))
5197 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5203 static int map_divs_known(__isl_keep isl_map
*map
)
5210 for (i
= 0; i
< map
->n
; ++i
) {
5211 int known
= basic_map_divs_known(map
->p
[i
]);
5219 /* If bmap contains any unknown divs, then compute explicit
5220 * expressions for them. However, this computation may be
5221 * quite expensive, so first try to remove divs that aren't
5224 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5228 struct isl_map
*map
;
5230 known
= basic_map_divs_known(bmap
);
5234 return isl_map_from_basic_map(bmap
);
5236 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5238 known
= basic_map_divs_known(bmap
);
5242 return isl_map_from_basic_map(bmap
);
5244 map
= compute_divs(bmap
);
5247 isl_basic_map_free(bmap
);
5251 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5255 struct isl_map
*res
;
5262 known
= map_divs_known(map
);
5270 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5271 for (i
= 1 ; i
< map
->n
; ++i
) {
5273 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5274 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5275 res
= isl_map_union_disjoint(res
, r2
);
5277 res
= isl_map_union(res
, r2
);
5284 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5286 return (struct isl_set
*)
5287 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5290 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5292 return (struct isl_set
*)
5293 isl_map_compute_divs((struct isl_map
*)set
);
5296 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5299 struct isl_set
*set
;
5304 map
= isl_map_cow(map
);
5308 set
= (struct isl_set
*)map
;
5309 set
->dim
= isl_dim_domain(set
->dim
);
5312 for (i
= 0; i
< map
->n
; ++i
) {
5313 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5317 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5318 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5325 struct isl_map
*isl_map_union_disjoint(
5326 struct isl_map
*map1
, struct isl_map
*map2
)
5330 struct isl_map
*map
= NULL
;
5344 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5346 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5347 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5348 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5350 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5351 map1
->n
+ map2
->n
, flags
);
5354 for (i
= 0; i
< map1
->n
; ++i
) {
5355 map
= isl_map_add_basic_map(map
,
5356 isl_basic_map_copy(map1
->p
[i
]));
5360 for (i
= 0; i
< map2
->n
; ++i
) {
5361 map
= isl_map_add_basic_map(map
,
5362 isl_basic_map_copy(map2
->p
[i
]));
5376 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5378 map1
= isl_map_union_disjoint(map1
, map2
);
5382 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5386 struct isl_set
*isl_set_union_disjoint(
5387 struct isl_set
*set1
, struct isl_set
*set2
)
5389 return (struct isl_set
*)
5390 isl_map_union_disjoint(
5391 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5394 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5396 return (struct isl_set
*)
5397 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5400 struct isl_map
*isl_map_intersect_range(
5401 struct isl_map
*map
, struct isl_set
*set
)
5404 struct isl_map
*result
;
5410 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5411 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5412 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5414 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5415 map
->n
* set
->n
, flags
);
5418 for (i
= 0; i
< map
->n
; ++i
)
5419 for (j
= 0; j
< set
->n
; ++j
) {
5420 result
= isl_map_add_basic_map(result
,
5421 isl_basic_map_intersect_range(
5422 isl_basic_map_copy(map
->p
[i
]),
5423 isl_basic_set_copy(set
->p
[j
])));
5436 struct isl_map
*isl_map_intersect_domain(
5437 struct isl_map
*map
, struct isl_set
*set
)
5439 return isl_map_reverse(
5440 isl_map_intersect_range(isl_map_reverse(map
), set
));
5443 struct isl_map
*isl_map_apply_domain(
5444 struct isl_map
*map1
, struct isl_map
*map2
)
5448 map1
= isl_map_reverse(map1
);
5449 map1
= isl_map_apply_range(map1
, map2
);
5450 return isl_map_reverse(map1
);
5457 struct isl_map
*isl_map_apply_range(
5458 struct isl_map
*map1
, struct isl_map
*map2
)
5460 struct isl_dim
*dim_result
;
5461 struct isl_map
*result
;
5467 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5468 isl_dim_copy(map2
->dim
));
5470 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5473 for (i
= 0; i
< map1
->n
; ++i
)
5474 for (j
= 0; j
< map2
->n
; ++j
) {
5475 result
= isl_map_add_basic_map(result
,
5476 isl_basic_map_apply_range(
5477 isl_basic_map_copy(map1
->p
[i
]),
5478 isl_basic_map_copy(map2
->p
[j
])));
5484 if (result
&& result
->n
<= 1)
5485 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5494 * returns range - domain
5496 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5498 isl_dim
*dims
, *target_dim
;
5499 struct isl_basic_set
*bset
;
5506 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5507 bmap
->dim
, isl_dim_out
),
5509 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5510 dim
= isl_basic_map_n_in(bmap
);
5511 nparam
= isl_basic_map_n_param(bmap
);
5512 bset
= isl_basic_set_from_basic_map(bmap
);
5513 bset
= isl_basic_set_cow(bset
);
5514 dims
= isl_basic_set_get_dim(bset
);
5515 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5516 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5517 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5518 for (i
= 0; i
< dim
; ++i
) {
5519 int j
= isl_basic_map_alloc_equality(
5520 (struct isl_basic_map
*)bset
);
5523 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5524 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5525 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5526 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5528 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5529 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5532 isl_basic_map_free(bmap
);
5537 * returns range - domain
5539 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5543 struct isl_set
*result
;
5548 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5549 map
->dim
, isl_dim_out
),
5551 dim
= isl_map_get_dim(map
);
5552 dim
= isl_dim_domain(dim
);
5553 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5556 for (i
= 0; i
< map
->n
; ++i
)
5557 result
= isl_set_add_basic_set(result
,
5558 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5566 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5568 struct isl_basic_map
*bmap
;
5576 nparam
= dims
->nparam
;
5578 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5582 for (i
= 0; i
< dim
; ++i
) {
5583 int j
= isl_basic_map_alloc_equality(bmap
);
5586 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5587 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5588 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5590 return isl_basic_map_finalize(bmap
);
5592 isl_basic_map_free(bmap
);
5596 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5598 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5601 return basic_map_identity(dim
);
5604 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5606 if (!model
|| !model
->dim
)
5608 isl_assert(model
->ctx
,
5609 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5610 return basic_map_identity(isl_dim_copy(model
->dim
));
5613 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5615 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5616 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5619 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5621 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5624 return map_identity(dim
);
5627 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5629 if (!model
|| !model
->dim
)
5631 isl_assert(model
->ctx
,
5632 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5633 return map_identity(isl_dim_copy(model
->dim
));
5636 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5638 if (!model
|| !model
->dim
)
5640 isl_assert(model
->ctx
,
5641 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5642 return map_identity(isl_dim_copy(model
->dim
));
5645 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5647 isl_dim
*dim
= isl_set_get_dim(set
);
5649 id
= isl_map_identity(dim
);
5650 return isl_map_intersect_range(id
, set
);
5653 /* Construct a basic set with all set dimensions having only non-negative
5656 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5661 struct isl_basic_set
*bset
;
5665 nparam
= dims
->nparam
;
5667 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5670 for (i
= 0; i
< dim
; ++i
) {
5671 int k
= isl_basic_set_alloc_inequality(bset
);
5674 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5675 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5679 isl_basic_set_free(bset
);
5683 /* Construct the half-space x_pos >= 0.
5685 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
5689 isl_basic_set
*nonneg
;
5691 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5692 k
= isl_basic_set_alloc_inequality(nonneg
);
5695 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5696 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
5698 return isl_basic_set_finalize(nonneg
);
5700 isl_basic_set_free(nonneg
);
5704 /* Construct the half-space x_pos <= -1.
5706 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
5711 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5712 k
= isl_basic_set_alloc_inequality(neg
);
5715 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5716 isl_int_set_si(neg
->ineq
[k
][0], -1);
5717 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
5719 return isl_basic_set_finalize(neg
);
5721 isl_basic_set_free(neg
);
5725 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5726 enum isl_dim_type type
, unsigned first
, unsigned n
)
5729 isl_basic_set
*nonneg
;
5737 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5739 for (i
= 0; i
< n
; ++i
) {
5740 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
5741 pos(set
->dim
, type
) + first
+ i
);
5742 neg
= neg_halfspace(isl_set_get_dim(set
),
5743 pos(set
->dim
, type
) + first
+ i
);
5745 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5754 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
5755 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5762 if (isl_set_fast_is_empty(set
)) {
5767 return fn(set
, signs
, user
);
5770 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
5772 half
= isl_set_intersect(half
, isl_set_copy(set
));
5773 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
5777 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
5779 half
= isl_set_intersect(half
, set
);
5780 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
5786 /* Call "fn" on the intersections of "set" with each of the orthants
5787 * (except for obviously empty intersections). The orthant is identified
5788 * by the signs array, with each entry having value 1 or -1 according
5789 * to the sign of the corresponding variable.
5791 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
5792 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5802 if (isl_set_fast_is_empty(set
))
5805 nparam
= isl_set_dim(set
, isl_dim_param
);
5806 nvar
= isl_set_dim(set
, isl_dim_set
);
5808 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
5810 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
5818 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5820 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5823 int isl_basic_map_is_subset(
5824 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5827 struct isl_map
*map1
;
5828 struct isl_map
*map2
;
5830 if (!bmap1
|| !bmap2
)
5833 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5834 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5836 is_subset
= isl_map_is_subset(map1
, map2
);
5844 int isl_basic_map_is_equal(
5845 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5849 if (!bmap1
|| !bmap2
)
5851 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5854 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5858 int isl_basic_set_is_equal(
5859 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5861 return isl_basic_map_is_equal(
5862 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5865 int isl_map_is_empty(struct isl_map
*map
)
5872 for (i
= 0; i
< map
->n
; ++i
) {
5873 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5882 int isl_map_fast_is_empty(struct isl_map
*map
)
5884 return map
? map
->n
== 0 : -1;
5887 int isl_set_fast_is_empty(struct isl_set
*set
)
5889 return set
? set
->n
== 0 : -1;
5892 int isl_set_is_empty(struct isl_set
*set
)
5894 return isl_map_is_empty((struct isl_map
*)set
);
5897 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5902 return isl_dim_equal(map1
->dim
, map2
->dim
);
5905 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5910 return isl_dim_equal(set1
->dim
, set2
->dim
);
5913 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5919 is_subset
= isl_map_is_subset(map1
, map2
);
5922 is_subset
= isl_map_is_subset(map2
, map1
);
5926 int isl_basic_map_is_strict_subset(
5927 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5931 if (!bmap1
|| !bmap2
)
5933 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5936 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5937 if (is_subset
== -1)
5942 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5948 is_subset
= isl_map_is_subset(map1
, map2
);
5951 is_subset
= isl_map_is_subset(map2
, map1
);
5952 if (is_subset
== -1)
5957 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5959 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5962 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5966 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5969 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5973 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5976 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5983 for (i
= 0; i
< map
->n
; ++i
) {
5984 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5992 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5994 return isl_map_fast_is_universe((isl_map
*) set
);
5997 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5999 struct isl_basic_set
*bset
= NULL
;
6000 struct isl_vec
*sample
= NULL
;
6007 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6010 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6011 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6012 copy
= isl_basic_map_remove_redundancies(copy
);
6013 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6014 isl_basic_map_free(copy
);
6018 total
= 1 + isl_basic_map_total_dim(bmap
);
6019 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6020 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6026 isl_vec_free(bmap
->sample
);
6027 bmap
->sample
= NULL
;
6028 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6031 sample
= isl_basic_set_sample_vec(bset
);
6034 empty
= sample
->size
== 0;
6035 isl_vec_free(bmap
->sample
);
6036 bmap
->sample
= sample
;
6038 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6043 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
6047 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6050 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
6054 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6057 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6059 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6062 struct isl_map
*isl_basic_map_union(
6063 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6065 struct isl_map
*map
;
6066 if (!bmap1
|| !bmap2
)
6069 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6071 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6074 map
= isl_map_add_basic_map(map
, bmap1
);
6075 map
= isl_map_add_basic_map(map
, bmap2
);
6078 isl_basic_map_free(bmap1
);
6079 isl_basic_map_free(bmap2
);
6083 struct isl_set
*isl_basic_set_union(
6084 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6086 return (struct isl_set
*)isl_basic_map_union(
6087 (struct isl_basic_map
*)bset1
,
6088 (struct isl_basic_map
*)bset2
);
6091 /* Order divs such that any div only depends on previous divs */
6092 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6100 off
= isl_dim_total(bmap
->dim
);
6102 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6104 if (isl_int_is_zero(bmap
->div
[i
][0]))
6106 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6110 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6116 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6118 return (struct isl_basic_set
*)
6119 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6122 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6129 for (i
= 0; i
< map
->n
; ++i
) {
6130 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6141 /* Look for a div in dst that corresponds to the div "div" in src.
6142 * The divs before "div" in src and dst are assumed to be the same.
6144 * Returns -1 if no corresponding div was found and the position
6145 * of the corresponding div in dst otherwise.
6147 static int find_div(struct isl_basic_map
*dst
,
6148 struct isl_basic_map
*src
, unsigned div
)
6152 unsigned total
= isl_dim_total(src
->dim
);
6154 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6155 for (i
= div
; i
< dst
->n_div
; ++i
)
6156 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6157 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6158 dst
->n_div
- div
) == -1)
6163 struct isl_basic_map
*isl_basic_map_align_divs(
6164 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6167 unsigned total
= isl_dim_total(src
->dim
);
6172 if (src
->n_div
== 0)
6175 for (i
= 0; i
< src
->n_div
; ++i
)
6176 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6178 src
= isl_basic_map_order_divs(src
);
6179 dst
= isl_basic_map_cow(dst
);
6180 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6181 src
->n_div
, 0, 2 * src
->n_div
);
6184 for (i
= 0; i
< src
->n_div
; ++i
) {
6185 int j
= find_div(dst
, src
, i
);
6187 j
= isl_basic_map_alloc_div(dst
);
6190 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6191 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6192 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6196 isl_basic_map_swap_div(dst
, i
, j
);
6200 isl_basic_map_free(dst
);
6204 struct isl_basic_set
*isl_basic_set_align_divs(
6205 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6207 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6208 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6211 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6219 map
= isl_map_compute_divs(map
);
6220 map
= isl_map_cow(map
);
6224 for (i
= 1; i
< map
->n
; ++i
)
6225 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6226 for (i
= 1; i
< map
->n
; ++i
)
6227 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6229 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6233 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6235 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6238 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6242 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6243 map
= isl_map_intersect_domain(map
, set
);
6244 set
= isl_map_range(map
);
6252 /* There is no need to cow as removing empty parts doesn't change
6253 * the meaning of the set.
6255 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6262 for (i
= map
->n
-1; i
>= 0; --i
) {
6263 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6265 isl_basic_map_free(map
->p
[i
]);
6266 if (i
!= map
->n
-1) {
6267 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6268 map
->p
[i
] = map
->p
[map
->n
-1];
6276 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6278 return (struct isl_set
*)
6279 isl_map_remove_empty_parts((struct isl_map
*)set
);
6282 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6284 struct isl_basic_map
*bmap
;
6285 if (!map
|| map
->n
== 0)
6287 bmap
= map
->p
[map
->n
-1];
6288 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6289 return isl_basic_map_copy(bmap
);
6292 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6294 return (struct isl_basic_set
*)
6295 isl_map_copy_basic_map((struct isl_map
*)set
);
6298 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6299 __isl_keep isl_basic_map
*bmap
)
6305 for (i
= map
->n
-1; i
>= 0; --i
) {
6306 if (map
->p
[i
] != bmap
)
6308 map
= isl_map_cow(map
);
6311 isl_basic_map_free(map
->p
[i
]);
6312 if (i
!= map
->n
-1) {
6313 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6314 map
->p
[i
] = map
->p
[map
->n
-1];
6325 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6326 struct isl_basic_set
*bset
)
6328 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6329 (struct isl_basic_map
*)bset
);
6332 /* Given two basic sets bset1 and bset2, compute the maximal difference
6333 * between the values of dimension pos in bset1 and those in bset2
6334 * for any common value of the parameters and dimensions preceding pos.
6336 static enum isl_lp_result
basic_set_maximal_difference_at(
6337 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6338 int pos
, isl_int
*opt
)
6340 struct isl_dim
*dims
;
6341 struct isl_basic_map
*bmap1
= NULL
;
6342 struct isl_basic_map
*bmap2
= NULL
;
6343 struct isl_ctx
*ctx
;
6344 struct isl_vec
*obj
;
6347 unsigned dim1
, dim2
;
6348 enum isl_lp_result res
;
6350 if (!bset1
|| !bset2
)
6351 return isl_lp_error
;
6353 nparam
= isl_basic_set_n_param(bset1
);
6354 dim1
= isl_basic_set_n_dim(bset1
);
6355 dim2
= isl_basic_set_n_dim(bset2
);
6356 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6357 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6358 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6359 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6360 if (!bmap1
|| !bmap2
)
6362 bmap1
= isl_basic_map_cow(bmap1
);
6363 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6364 pos
, (dim1
- pos
) + (dim2
- pos
),
6365 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6366 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6369 total
= isl_basic_map_total_dim(bmap1
);
6371 obj
= isl_vec_alloc(ctx
, 1 + total
);
6372 isl_seq_clr(obj
->block
.data
, 1 + total
);
6373 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6374 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6377 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6379 isl_basic_map_free(bmap1
);
6383 isl_basic_map_free(bmap1
);
6384 isl_basic_map_free(bmap2
);
6385 return isl_lp_error
;
6388 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6389 * for any common value of the parameters and dimensions preceding pos
6390 * in both basic sets, the values of dimension pos in bset1 are
6391 * smaller or larger than those in bset2.
6394 * 1 if bset1 follows bset2
6395 * -1 if bset1 precedes bset2
6396 * 0 if bset1 and bset2 are incomparable
6397 * -2 if some error occurred.
6399 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6400 struct isl_basic_set
*bset2
, int pos
)
6403 enum isl_lp_result res
;
6408 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6410 if (res
== isl_lp_empty
)
6412 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6413 res
== isl_lp_unbounded
)
6415 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6424 /* Given two basic sets bset1 and bset2, check whether
6425 * for any common value of the parameters and dimensions preceding pos
6426 * there is a value of dimension pos in bset1 that is larger
6427 * than a value of the same dimension in bset2.
6430 * 1 if there exists such a pair
6431 * 0 if there is no such pair, but there is a pair of equal values
6433 * -2 if some error occurred.
6435 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6436 __isl_keep isl_basic_set
*bset2
, int pos
)
6439 enum isl_lp_result res
;
6444 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6446 if (res
== isl_lp_empty
)
6448 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6449 res
== isl_lp_unbounded
)
6451 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6453 else if (res
== isl_lp_ok
)
6462 /* Given two sets set1 and set2, check whether
6463 * for any common value of the parameters and dimensions preceding pos
6464 * there is a value of dimension pos in set1 that is larger
6465 * than a value of the same dimension in set2.
6468 * 1 if there exists such a pair
6469 * 0 if there is no such pair, but there is a pair of equal values
6471 * -2 if some error occurred.
6473 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6474 __isl_keep isl_set
*set2
, int pos
)
6482 for (i
= 0; i
< set1
->n
; ++i
)
6483 for (j
= 0; j
< set2
->n
; ++j
) {
6485 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6486 if (f
== 1 || f
== -2)
6495 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6496 unsigned pos
, isl_int
*val
)
6504 total
= isl_basic_map_total_dim(bmap
);
6505 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6506 for (; d
+1 > pos
; --d
)
6507 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6511 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6513 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6515 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6518 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6524 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6525 unsigned pos
, isl_int
*val
)
6537 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6540 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6541 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6542 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6543 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6547 isl_int_set(*val
, v
);
6553 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6554 unsigned pos
, isl_int
*val
)
6556 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6560 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6563 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6566 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6567 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6569 if (pos
>= isl_basic_map_dim(bmap
, type
))
6571 return isl_basic_map_fast_has_fixed_var(bmap
,
6572 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6575 int isl_map_fast_is_fixed(struct isl_map
*map
,
6576 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6578 if (pos
>= isl_map_dim(map
, type
))
6580 return isl_map_fast_has_fixed_var(map
,
6581 map_offset(map
, type
) - 1 + pos
, val
);
6584 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6585 * then return this fixed value in *val.
6587 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6590 return isl_basic_set_fast_has_fixed_var(bset
,
6591 isl_basic_set_n_param(bset
) + dim
, val
);
6594 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6595 * then return this fixed value in *val.
6597 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6599 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6602 /* Check if input variable in has fixed value and if so and if val is not NULL,
6603 * then return this fixed value in *val.
6605 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6607 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6610 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6611 * and if val is not NULL, then return this lower bound in *val.
6613 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6614 unsigned dim
, isl_int
*val
)
6616 int i
, i_eq
= -1, i_ineq
= -1;
6623 total
= isl_basic_set_total_dim(bset
);
6624 nparam
= isl_basic_set_n_param(bset
);
6625 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6626 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6632 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6633 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6635 if (i_eq
!= -1 || i_ineq
!= -1)
6639 if (i_eq
== -1 && i_ineq
== -1)
6641 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6642 /* The coefficient should always be one due to normalization. */
6643 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6645 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6647 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6648 total
- nparam
- dim
- 1) != -1)
6651 isl_int_neg(*val
, c
[0]);
6655 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6656 unsigned dim
, isl_int
*val
)
6668 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6672 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6674 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6675 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6677 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6681 isl_int_set(*val
, v
);
6692 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6694 const struct constraint
*c1
= (const struct constraint
*)p1
;
6695 const struct constraint
*c2
= (const struct constraint
*)p2
;
6696 unsigned size
= isl_min(c1
->size
, c2
->size
);
6697 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6700 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6701 struct isl_basic_map
*bmap
)
6704 struct constraint
*c
;
6709 total
= isl_basic_map_total_dim(bmap
);
6710 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6713 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6715 c
[i
].c
= bmap
->ineq
[i
];
6717 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6718 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6719 bmap
->ineq
[i
] = c
[i
].c
;
6723 isl_basic_map_free(bmap
);
6727 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6728 __isl_take isl_basic_set
*bset
)
6730 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6731 (struct isl_basic_map
*)bset
);
6734 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6738 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6740 bmap
= isl_basic_map_remove_redundancies(bmap
);
6741 bmap
= isl_basic_map_sort_constraints(bmap
);
6742 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6746 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6748 return (struct isl_basic_set
*)isl_basic_map_normalize(
6749 (struct isl_basic_map
*)bset
);
6752 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6753 const __isl_keep isl_basic_map
*bmap2
)
6760 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6761 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6762 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6763 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6764 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6765 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6766 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6767 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6769 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6771 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6773 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6774 return bmap1
->n_eq
- bmap2
->n_eq
;
6775 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6776 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6777 if (bmap1
->n_div
!= bmap2
->n_div
)
6778 return bmap1
->n_div
- bmap2
->n_div
;
6779 total
= isl_basic_map_total_dim(bmap1
);
6780 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6781 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6785 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6786 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6790 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6791 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6798 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6799 __isl_keep isl_basic_map
*bmap2
)
6801 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6804 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6805 __isl_keep isl_basic_set
*bset2
)
6807 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6808 (isl_basic_map
*)bset2
);
6811 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6813 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6814 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6816 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6819 /* We normalize in place, but if anything goes wrong we need
6820 * to return NULL, so we need to make sure we don't change the
6821 * meaning of any possible other copies of map.
6823 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6826 struct isl_basic_map
*bmap
;
6830 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6832 for (i
= 0; i
< map
->n
; ++i
) {
6833 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6836 isl_basic_map_free(map
->p
[i
]);
6839 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6840 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6841 map
= isl_map_remove_empty_parts(map
);
6844 for (i
= map
->n
- 1; i
>= 1; --i
) {
6845 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6847 isl_basic_map_free(map
->p
[i
-1]);
6848 for (j
= i
; j
< map
->n
; ++j
)
6849 map
->p
[j
-1] = map
->p
[j
];
6859 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6861 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6864 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6874 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6877 map1
= isl_map_copy(map1
);
6878 map2
= isl_map_copy(map2
);
6879 map1
= isl_map_normalize(map1
);
6880 map2
= isl_map_normalize(map2
);
6883 equal
= map1
->n
== map2
->n
;
6884 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6885 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6898 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6900 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6901 (struct isl_map
*)set2
);
6904 /* Return an interval that ranges from min to max (inclusive)
6906 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6907 isl_int min
, isl_int max
)
6910 struct isl_basic_set
*bset
= NULL
;
6912 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6916 k
= isl_basic_set_alloc_inequality(bset
);
6919 isl_int_set_si(bset
->ineq
[k
][1], 1);
6920 isl_int_neg(bset
->ineq
[k
][0], min
);
6922 k
= isl_basic_set_alloc_inequality(bset
);
6925 isl_int_set_si(bset
->ineq
[k
][1], -1);
6926 isl_int_set(bset
->ineq
[k
][0], max
);
6930 isl_basic_set_free(bset
);
6934 /* Return the Cartesian product of the basic sets in list (in the given order).
6936 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6944 struct isl_basic_set
*product
= NULL
;
6948 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6949 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6950 nparam
= isl_basic_set_n_param(list
->p
[0]);
6951 dim
= isl_basic_set_n_dim(list
->p
[0]);
6952 extra
= list
->p
[0]->n_div
;
6953 n_eq
= list
->p
[0]->n_eq
;
6954 n_ineq
= list
->p
[0]->n_ineq
;
6955 for (i
= 1; i
< list
->n
; ++i
) {
6956 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6957 isl_assert(list
->ctx
,
6958 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6959 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6960 extra
+= list
->p
[i
]->n_div
;
6961 n_eq
+= list
->p
[i
]->n_eq
;
6962 n_ineq
+= list
->p
[i
]->n_ineq
;
6964 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6969 for (i
= 0; i
< list
->n
; ++i
) {
6970 isl_basic_set_add_constraints(product
,
6971 isl_basic_set_copy(list
->p
[i
]), dim
);
6972 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6974 isl_basic_set_list_free(list
);
6977 isl_basic_set_free(product
);
6978 isl_basic_set_list_free(list
);
6982 struct isl_basic_map
*isl_basic_map_product(
6983 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6985 struct isl_dim
*dim_result
= NULL
;
6986 struct isl_basic_map
*bmap
;
6987 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6988 struct isl_dim_map
*dim_map1
, *dim_map2
;
6990 if (!bmap1
|| !bmap2
)
6993 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6994 bmap2
->dim
, isl_dim_param
), goto error
);
6995 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6996 isl_dim_copy(bmap2
->dim
));
6998 in1
= isl_basic_map_n_in(bmap1
);
6999 in2
= isl_basic_map_n_in(bmap2
);
7000 out1
= isl_basic_map_n_out(bmap1
);
7001 out2
= isl_basic_map_n_out(bmap2
);
7002 nparam
= isl_basic_map_n_param(bmap1
);
7004 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7005 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7006 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7007 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7008 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7009 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7010 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7011 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7012 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7013 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7014 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7016 bmap
= isl_basic_map_alloc_dim(dim_result
,
7017 bmap1
->n_div
+ bmap2
->n_div
,
7018 bmap1
->n_eq
+ bmap2
->n_eq
,
7019 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7020 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7021 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7022 bmap
= isl_basic_map_simplify(bmap
);
7023 return isl_basic_map_finalize(bmap
);
7025 isl_basic_map_free(bmap1
);
7026 isl_basic_map_free(bmap2
);
7030 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7032 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
7035 struct isl_map
*result
;
7041 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7042 map2
->dim
, isl_dim_param
), goto error
);
7044 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7045 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7046 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7048 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
7049 isl_dim_copy(map2
->dim
)),
7050 map1
->n
* map2
->n
, flags
);
7053 for (i
= 0; i
< map1
->n
; ++i
)
7054 for (j
= 0; j
< map2
->n
; ++j
) {
7055 struct isl_basic_map
*part
;
7056 part
= isl_basic_map_product(
7057 isl_basic_map_copy(map1
->p
[i
]),
7058 isl_basic_map_copy(map2
->p
[j
]));
7059 if (isl_basic_map_is_empty(part
))
7060 isl_basic_map_free(part
);
7062 result
= isl_map_add_basic_map(result
, part
);
7075 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7077 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7078 __isl_take isl_map
*map2
)
7082 prod
= isl_map_product(map1
, map2
);
7083 prod
= isl_map_flatten(prod
);
7087 /* Given two set A and B, construct its Cartesian product A x B.
7089 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7091 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
7092 (struct isl_map
*)set2
);
7095 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7096 __isl_take isl_set
*set2
)
7098 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
7101 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7104 uint32_t hash
= isl_hash_init();
7109 bmap
= isl_basic_map_copy(bmap
);
7110 bmap
= isl_basic_map_normalize(bmap
);
7113 total
= isl_basic_map_total_dim(bmap
);
7114 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7115 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7117 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7118 isl_hash_hash(hash
, c_hash
);
7120 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7121 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7123 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7124 isl_hash_hash(hash
, c_hash
);
7126 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7127 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7129 if (isl_int_is_zero(bmap
->div
[i
][0]))
7131 isl_hash_byte(hash
, i
& 0xFF);
7132 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7133 isl_hash_hash(hash
, c_hash
);
7135 isl_basic_map_free(bmap
);
7139 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7141 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7144 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7151 map
= isl_map_copy(map
);
7152 map
= isl_map_normalize(map
);
7156 hash
= isl_hash_init();
7157 for (i
= 0; i
< map
->n
; ++i
) {
7159 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7160 isl_hash_hash(hash
, bmap_hash
);
7168 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7170 return isl_map_get_hash((isl_map
*)set
);
7173 /* Check if the value for dimension dim is completely determined
7174 * by the values of the other parameters and variables.
7175 * That is, check if dimension dim is involved in an equality.
7177 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7184 nparam
= isl_basic_set_n_param(bset
);
7185 for (i
= 0; i
< bset
->n_eq
; ++i
)
7186 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7191 /* Check if the value for dimension dim is completely determined
7192 * by the values of the other parameters and variables.
7193 * That is, check if dimension dim is involved in an equality
7194 * for each of the subsets.
7196 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7202 for (i
= 0; i
< set
->n
; ++i
) {
7204 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7211 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7213 return set
? set
->n
: 0;
7216 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7217 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7224 for (i
= 0; i
< map
->n
; ++i
)
7225 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7231 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7232 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7239 for (i
= 0; i
< set
->n
; ++i
)
7240 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7246 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7248 struct isl_dim
*dim
;
7253 if (bset
->n_div
== 0)
7256 bset
= isl_basic_set_cow(bset
);
7260 dim
= isl_basic_set_get_dim(bset
);
7261 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
7264 isl_dim_free(bset
->dim
);
7266 bset
->extra
-= bset
->n_div
;
7269 bset
= isl_basic_set_finalize(bset
);
7273 isl_basic_set_free(bset
);
7277 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7280 struct isl_dim
*dim
;
7283 set
= isl_set_align_divs(set
);
7287 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
7290 set
= isl_set_cow(set
);
7294 n_div
= set
->p
[0]->n_div
;
7295 dim
= isl_set_get_dim(set
);
7296 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
7299 isl_dim_free(set
->dim
);
7302 for (i
= 0; i
< set
->n
; ++i
) {
7303 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7314 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7316 struct isl_dim
*dim
;
7317 struct isl_basic_map
*bmap
;
7324 set
= isl_set_align_divs(set
);
7329 dim
= isl_set_get_dim(set
);
7330 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7332 return isl_map_identity(dim
);
7335 n_div
= set
->p
[0]->n_div
;
7336 dim
= isl_dim_map(dim
);
7337 n_param
= isl_dim_size(dim
, isl_dim_param
);
7338 n_set
= isl_dim_size(dim
, isl_dim_in
);
7339 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7340 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7341 for (i
= 0; i
< n_set
; ++i
)
7342 bmap
= var_equal(bmap
, i
);
7344 total
= n_param
+ n_set
+ n_set
+ n_div
;
7345 for (i
= 0; i
< n_div
; ++i
) {
7346 k
= isl_basic_map_alloc_inequality(bmap
);
7349 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7350 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7351 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7352 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7353 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7354 set
->p
[0]->div
[i
][0]);
7356 l
= isl_basic_map_alloc_inequality(bmap
);
7359 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7360 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7361 set
->p
[0]->div
[i
][0]);
7362 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7366 return isl_map_from_basic_map(bmap
);
7369 isl_basic_map_free(bmap
);
7373 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7381 dim
= isl_basic_set_total_dim(bset
);
7382 size
+= bset
->n_eq
* (1 + dim
);
7383 size
+= bset
->n_ineq
* (1 + dim
);
7384 size
+= bset
->n_div
* (2 + dim
);
7389 int isl_set_size(__isl_keep isl_set
*set
)
7397 for (i
= 0; i
< set
->n
; ++i
)
7398 size
+= isl_basic_set_size(set
->p
[i
]);
7403 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7404 enum isl_dim_type type
, unsigned pos
)
7412 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7414 pos
+= isl_basic_map_offset(bmap
, type
);
7416 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7417 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7421 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7422 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7429 return lower
&& upper
;
7432 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7433 enum isl_dim_type type
, unsigned pos
)
7440 for (i
= 0; i
< map
->n
; ++i
) {
7442 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7443 if (bounded
< 0 || !bounded
)
7450 /* Return 1 if the specified dim is involved in both an upper bound
7451 * and a lower bound.
7453 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7454 enum isl_dim_type type
, unsigned pos
)
7456 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7459 /* For each of the "n" variables starting at "first", determine
7460 * the sign of the variable and put the results in the first "n"
7461 * elements of the array "signs".
7463 * 1 means that the variable is non-negative
7464 * -1 means that the variable is non-positive
7465 * 0 means the variable attains both positive and negative values.
7467 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7468 unsigned first
, unsigned n
, int *signs
)
7470 isl_vec
*bound
= NULL
;
7471 struct isl_tab
*tab
= NULL
;
7472 struct isl_tab_undo
*snap
;
7475 if (!bset
|| !signs
)
7478 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7479 tab
= isl_tab_from_basic_set(bset
);
7483 isl_seq_clr(bound
->el
, bound
->size
);
7484 isl_int_set_si(bound
->el
[0], -1);
7486 snap
= isl_tab_snap(tab
);
7487 for (i
= 0; i
< n
; ++i
) {
7490 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7491 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7494 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7495 if (isl_tab_rollback(tab
, snap
) < 0)
7503 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7504 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7507 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7508 if (isl_tab_rollback(tab
, snap
) < 0)
7511 signs
[i
] = empty
? -1 : 0;
7515 isl_vec_free(bound
);
7519 isl_vec_free(bound
);
7523 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7524 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7526 if (!bset
|| !signs
)
7528 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7531 first
+= pos(bset
->dim
, type
) - 1;
7532 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7535 /* Check if the given basic map is obviously single-valued.
7536 * In particular, for each output dimension, check that there is
7537 * an equality that defines the output dimension in terms of
7538 * earlier dimensions.
7540 int isl_basic_map_fast_is_single_valued(__isl_keep isl_basic_map
*bmap
)
7550 total
= 1 + isl_basic_map_total_dim(bmap
);
7551 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7552 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
7554 for (i
= 0; i
< n_out
; ++i
) {
7555 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
7556 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
7558 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
7559 total
- (o_out
+ i
+ 1)) == -1)
7562 if (j
>= bmap
->n_eq
)
7569 /* Check if the given map is obviously single-valued.
7571 int isl_map_fast_is_single_valued(__isl_keep isl_map
*map
)
7582 return isl_basic_map_fast_is_single_valued(map
->p
[0]);
7585 /* Check if the given map is single-valued.
7590 * and check if the result is a subset of the identity mapping.
7592 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7598 sv
= isl_map_fast_is_single_valued(map
);
7602 test
= isl_map_reverse(isl_map_copy(map
));
7603 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7605 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7607 sv
= isl_map_is_subset(test
, id
);
7615 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7619 sv
= isl_map_is_single_valued(map
);
7623 map
= isl_map_copy(map
);
7624 map
= isl_map_reverse(map
);
7625 sv
= isl_map_is_single_valued(map
);
7631 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7633 return isl_map_is_single_valued((isl_map
*)set
);
7636 int isl_map_is_translation(__isl_keep isl_map
*map
)
7641 delta
= isl_map_deltas(isl_map_copy(map
));
7642 ok
= isl_set_is_singleton(delta
);
7643 isl_set_free(delta
);
7648 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7650 if (isl_seq_first_non_zero(p
, pos
) != -1)
7652 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7657 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7666 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7669 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7670 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7671 for (j
= 0; j
< nvar
; ++j
) {
7672 int lower
= 0, upper
= 0;
7673 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7674 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7676 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7682 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7683 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7685 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7687 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7692 if (!lower
|| !upper
)
7699 int isl_set_is_box(__isl_keep isl_set
*set
)
7706 return isl_basic_set_is_box(set
->p
[0]);
7709 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7714 return isl_dim_is_wrapping(bset
->dim
);
7717 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7722 return isl_dim_is_wrapping(set
->dim
);
7725 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7727 bmap
= isl_basic_map_cow(bmap
);
7731 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7735 bmap
= isl_basic_map_finalize(bmap
);
7737 return (isl_basic_set
*)bmap
;
7739 isl_basic_map_free(bmap
);
7743 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7747 map
= isl_map_cow(map
);
7751 for (i
= 0; i
< map
->n
; ++i
) {
7752 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7756 map
->dim
= isl_dim_wrap(map
->dim
);
7760 return (isl_set
*)map
;
7766 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7768 bset
= isl_basic_set_cow(bset
);
7772 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7776 bset
= isl_basic_set_finalize(bset
);
7778 return (isl_basic_map
*)bset
;
7780 isl_basic_set_free(bset
);
7784 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7791 if (!isl_set_is_wrapping(set
))
7792 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7795 set
= isl_set_cow(set
);
7799 for (i
= 0; i
< set
->n
; ++i
) {
7800 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7805 set
->dim
= isl_dim_unwrap(set
->dim
);
7809 return (isl_map
*)set
;
7815 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7816 enum isl_dim_type type
)
7821 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7824 bmap
= isl_basic_map_cow(bmap
);
7828 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7832 bmap
= isl_basic_map_finalize(bmap
);
7836 isl_basic_map_free(bmap
);
7840 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7841 enum isl_dim_type type
)
7848 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7851 map
= isl_map_cow(map
);
7855 for (i
= 0; i
< map
->n
; ++i
) {
7856 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7860 map
->dim
= isl_dim_reset(map
->dim
, type
);
7870 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7875 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7878 bmap
= isl_basic_map_cow(bmap
);
7882 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7886 bmap
= isl_basic_map_finalize(bmap
);
7890 isl_basic_map_free(bmap
);
7894 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
7896 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
7899 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7906 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7909 map
= isl_map_cow(map
);
7913 for (i
= 0; i
< map
->n
; ++i
) {
7914 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7918 map
->dim
= isl_dim_flatten(map
->dim
);
7928 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
7930 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
7933 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
7935 isl_dim
*dim
, *flat_dim
;
7938 dim
= isl_set_get_dim(set
);
7939 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
7940 map
= map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
7941 map
= isl_map_intersect_domain(map
, set
);
7946 /* Extend the given dim_map with mappings for the divs in bmap.
7948 static __isl_give
struct isl_dim_map
*extend_dim_map(
7949 __isl_keep
struct isl_dim_map
*dim_map
,
7950 __isl_keep isl_basic_map
*bmap
)
7953 struct isl_dim_map
*res
;
7956 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7958 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7962 for (i
= 0; i
< dim_map
->len
; ++i
)
7963 res
->pos
[i
] = dim_map
->pos
[i
];
7964 for (i
= 0; i
< bmap
->n_div
; ++i
)
7965 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7970 /* Extract a dim_map from a reordering.
7971 * We essentially need to reverse the mapping, and add an offset
7972 * of 1 for the constant term.
7974 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7975 __isl_keep isl_reordering
*exp
)
7978 struct isl_dim_map
*dim_map
;
7983 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7987 for (i
= 0; i
< exp
->len
; ++i
)
7988 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7993 /* Reorder the dimensions of "bmap" according to the given dim_map
7994 * and set the dimension specification to "dim".
7996 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7997 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
8001 bmap
= isl_basic_map_cow(bmap
);
8002 if (!bmap
|| !dim
|| !dim_map
)
8005 res
= isl_basic_map_alloc_dim(dim
,
8006 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8007 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
8008 res
= isl_basic_map_finalize(res
);
8012 isl_basic_map_free(bmap
);
8017 /* Reorder the dimensions of "map" according to given reordering.
8019 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8020 __isl_take isl_reordering
*r
)
8023 struct isl_dim_map
*dim_map
;
8025 map
= isl_map_cow(map
);
8026 dim_map
= isl_dim_map_from_reordering(r
);
8027 if (!map
|| !r
|| !dim_map
)
8030 for (i
= 0; i
< map
->n
; ++i
) {
8031 struct isl_dim_map
*dim_map_i
;
8033 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
8035 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8036 isl_dim_copy(r
->dim
), dim_map_i
);
8042 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8044 isl_reordering_free(r
);
8050 isl_reordering_free(r
);
8054 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8055 __isl_take isl_reordering
*r
)
8057 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8060 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8061 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8062 enum isl_dim_type c2
, enum isl_dim_type c3
,
8063 enum isl_dim_type c4
, enum isl_dim_type c5
)
8065 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8066 struct isl_mat
*mat
;
8072 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8073 isl_basic_map_total_dim(bmap
) + 1);
8076 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8077 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8078 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8079 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8080 isl_int_set(mat
->row
[i
][pos
],
8081 bmap
->eq
[i
][off
+ k
]);
8089 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8090 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8091 enum isl_dim_type c2
, enum isl_dim_type c3
,
8092 enum isl_dim_type c4
, enum isl_dim_type c5
)
8094 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8095 struct isl_mat
*mat
;
8101 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8102 isl_basic_map_total_dim(bmap
) + 1);
8105 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8106 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8107 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8108 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8109 isl_int_set(mat
->row
[i
][pos
],
8110 bmap
->ineq
[i
][off
+ k
]);
8118 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8119 __isl_take isl_dim
*dim
,
8120 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8121 enum isl_dim_type c2
, enum isl_dim_type c3
,
8122 enum isl_dim_type c4
, enum isl_dim_type c5
)
8124 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8125 isl_basic_map
*bmap
;
8131 if (!dim
|| !eq
|| !ineq
)
8134 if (eq
->n_col
!= ineq
->n_col
)
8135 isl_die(dim
->ctx
, isl_error_invalid
,
8136 "equalities and inequalities matrices should have "
8137 "same number of columns", goto error
);
8139 total
= 1 + isl_dim_total(dim
);
8141 if (eq
->n_col
< total
)
8142 isl_die(dim
->ctx
, isl_error_invalid
,
8143 "number of columns too small", goto error
);
8145 extra
= eq
->n_col
- total
;
8147 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
8148 eq
->n_row
, ineq
->n_row
);
8151 for (i
= 0; i
< extra
; ++i
) {
8152 k
= isl_basic_map_alloc_div(bmap
);
8155 isl_int_set_si(bmap
->div
[k
][0], 0);
8157 for (i
= 0; i
< eq
->n_row
; ++i
) {
8158 l
= isl_basic_map_alloc_equality(bmap
);
8161 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8162 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8163 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8164 isl_int_set(bmap
->eq
[l
][off
+ k
],
8170 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8171 l
= isl_basic_map_alloc_inequality(bmap
);
8174 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8175 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8176 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8177 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8196 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8197 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8198 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8200 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8201 c1
, c2
, c3
, c4
, isl_dim_in
);
8204 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8205 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8206 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8208 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8209 c1
, c2
, c3
, c4
, isl_dim_in
);
8212 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8213 __isl_take isl_dim
*dim
,
8214 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8215 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8217 return (isl_basic_set
*)
8218 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8219 c1
, c2
, c3
, c4
, isl_dim_in
);