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
15 #include <isl_map_private.h>
18 #include "isl_dim_private.h"
19 #include "isl_equalities.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
41 struct isl_dim_map
*dim_map
;
42 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
43 sizeof(struct isl_dim_map
) + len
* sizeof(int));
46 dim_map
->len
= 1 + len
;
48 for (i
= 0; i
< len
; ++i
)
49 dim_map
->pos
[1 + i
] = -1;
53 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 static void isl_dim_map_dim_range(struct isl_dim_map
*dim_map
,
75 struct isl_dim
*dim
, enum isl_dim_type type
,
76 unsigned first
, unsigned n
, unsigned dst_pos
)
84 src_pos
= pos(dim
, type
);
85 for (i
= 0; i
< n
; ++i
)
86 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ first
+ i
;
89 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
90 enum isl_dim_type type
, unsigned dst_pos
)
92 isl_dim_map_dim_range(dim_map
, dim
, type
, 0, n(dim
, type
), dst_pos
);
95 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
96 struct isl_basic_map
*bmap
, unsigned dst_pos
)
101 if (!dim_map
|| !bmap
)
104 src_pos
= 1 + isl_dim_total(bmap
->dim
);
105 for (i
= 0; i
< bmap
->n_div
; ++i
)
106 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
109 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
113 for (i
= 0; i
< dim_map
->len
; ++i
)
114 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
115 fprintf(stderr
, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
119 enum isl_dim_type type
)
124 case isl_dim_cst
: return 1;
127 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
128 case isl_dim_div
: return bmap
->n_div
;
129 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
134 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
136 return map
? n(map
->dim
, type
) : 0;
139 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
141 return set
? n(set
->dim
, type
) : 0;
144 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
145 enum isl_dim_type type
)
147 struct isl_dim
*dim
= bmap
->dim
;
149 case isl_dim_cst
: return 0;
150 case isl_dim_param
: return 1;
151 case isl_dim_in
: return 1 + dim
->nparam
;
152 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
153 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
158 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
160 return pos(map
->dim
, type
);
163 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
164 enum isl_dim_type type
)
166 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
169 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
171 return isl_basic_set_dim(bset
, isl_dim_set
);
174 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
176 return isl_basic_set_dim(bset
, isl_dim_param
);
179 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
181 return isl_dim_total(bset
->dim
) + bset
->n_div
;
184 unsigned isl_set_n_dim(const struct isl_set
*set
)
186 return isl_set_dim(set
, isl_dim_set
);
189 unsigned isl_set_n_param(const struct isl_set
*set
)
191 return isl_set_dim(set
, isl_dim_param
);
194 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
196 return bmap
? bmap
->dim
->n_in
: 0;
199 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
201 return bmap
? bmap
->dim
->n_out
: 0;
204 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
206 return bmap
? bmap
->dim
->nparam
: 0;
209 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
211 return bmap
? bmap
->n_div
: 0;
214 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
216 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
219 unsigned isl_map_n_in(const struct isl_map
*map
)
221 return map
->dim
->n_in
;
224 unsigned isl_map_n_out(const struct isl_map
*map
)
226 return map
->dim
->n_out
;
229 unsigned isl_map_n_param(const struct isl_map
*map
)
231 return map
->dim
->nparam
;
234 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
239 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
242 return isl_dim_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
245 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
246 struct isl_basic_set
*bset
)
251 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
254 return isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
257 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
258 struct isl_basic_set
*bset
)
263 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
266 return isl_dim_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
269 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
271 return bmap
? bmap
->ctx
: NULL
;
274 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
276 return bset
? bset
->ctx
: NULL
;
279 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
281 return map
? map
->ctx
: NULL
;
284 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
286 return set
? set
->ctx
: NULL
;
289 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
293 return isl_dim_copy(bmap
->dim
);
296 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
300 return isl_dim_copy(bset
->dim
);
303 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
307 return isl_dim_copy(map
->dim
);
310 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
314 return isl_dim_copy(set
->dim
);
317 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
318 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
320 bmap
= isl_basic_map_cow(bmap
);
323 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
326 bmap
= isl_basic_map_finalize(bmap
);
329 isl_basic_map_free(bmap
);
333 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
334 enum isl_dim_type type
)
336 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
339 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
340 enum isl_dim_type type
, const char *s
)
344 map
= isl_map_cow(map
);
348 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
352 for (i
= 0; i
< map
->n
; ++i
) {
353 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
364 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
365 enum isl_dim_type type
)
367 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
370 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
373 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
376 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
378 return bset
? isl_dim_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
381 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
383 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
386 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
387 enum isl_dim_type type
, unsigned pos
)
389 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
392 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
393 enum isl_dim_type type
, unsigned pos
)
395 return bset
? isl_dim_get_name(bset
->dim
, type
, pos
) : NULL
;
398 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
399 enum isl_dim_type type
, unsigned pos
)
401 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
404 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
405 enum isl_dim_type type
, unsigned pos
)
407 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
410 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
411 __isl_take isl_basic_map
*bmap
,
412 enum isl_dim_type type
, unsigned pos
, const char *s
)
416 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
421 isl_basic_map_free(bmap
);
425 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
426 enum isl_dim_type type
, unsigned pos
, const char *s
)
433 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
437 for (i
= 0; i
< map
->n
; ++i
) {
438 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
449 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
450 __isl_take isl_basic_set
*bset
,
451 enum isl_dim_type type
, unsigned pos
, const char *s
)
453 return (isl_basic_set
*)isl_basic_map_set_dim_name(
454 (isl_basic_map
*)bset
, type
, pos
, s
);
457 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
458 enum isl_dim_type type
, unsigned pos
, const char *s
)
460 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
463 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
467 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
470 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
472 return isl_basic_map_is_rational(bset
);
475 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
476 struct isl_basic_map
*bmap
, unsigned extra
,
477 unsigned n_eq
, unsigned n_ineq
)
480 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
485 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
486 if (isl_blk_is_error(bmap
->block
))
489 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
494 bmap
->block2
= isl_blk_empty();
497 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
498 if (isl_blk_is_error(bmap
->block2
))
501 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
506 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
507 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
509 for (i
= 0; i
< extra
; ++i
)
510 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
514 bmap
->c_size
= n_eq
+ n_ineq
;
515 bmap
->eq
= bmap
->ineq
+ n_ineq
;
524 isl_basic_map_free(bmap
);
528 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
529 unsigned nparam
, unsigned dim
, unsigned extra
,
530 unsigned n_eq
, unsigned n_ineq
)
532 struct isl_basic_map
*bmap
;
533 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
534 return (struct isl_basic_set
*)bmap
;
537 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
538 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
540 struct isl_basic_map
*bmap
;
543 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
544 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
545 return (struct isl_basic_set
*)bmap
;
551 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
552 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
554 struct isl_basic_map
*bmap
;
558 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
563 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
569 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
570 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
571 unsigned n_eq
, unsigned n_ineq
)
573 struct isl_basic_map
*bmap
;
576 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
580 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
584 static void dup_constraints(
585 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
588 unsigned total
= isl_basic_map_total_dim(src
);
590 for (i
= 0; i
< src
->n_eq
; ++i
) {
591 int j
= isl_basic_map_alloc_equality(dst
);
592 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
595 for (i
= 0; i
< src
->n_ineq
; ++i
) {
596 int j
= isl_basic_map_alloc_inequality(dst
);
597 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
600 for (i
= 0; i
< src
->n_div
; ++i
) {
601 int j
= isl_basic_map_alloc_div(dst
);
602 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
604 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
607 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
609 struct isl_basic_map
*dup
;
613 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
614 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
617 dup_constraints(dup
, bmap
);
618 dup
->flags
= bmap
->flags
;
619 dup
->sample
= isl_vec_copy(bmap
->sample
);
623 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
625 struct isl_basic_map
*dup
;
627 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
628 return (struct isl_basic_set
*)dup
;
631 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
636 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
640 return isl_basic_set_dup(bset
);
643 struct isl_set
*isl_set_copy(struct isl_set
*set
)
652 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
657 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
661 bmap
= isl_basic_map_dup(bmap
);
663 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
667 struct isl_map
*isl_map_copy(struct isl_map
*map
)
676 void isl_basic_map_free(struct isl_basic_map
*bmap
)
684 isl_ctx_deref(bmap
->ctx
);
686 isl_blk_free(bmap
->ctx
, bmap
->block2
);
688 isl_blk_free(bmap
->ctx
, bmap
->block
);
689 isl_vec_free(bmap
->sample
);
690 isl_dim_free(bmap
->dim
);
694 void isl_basic_set_free(struct isl_basic_set
*bset
)
696 isl_basic_map_free((struct isl_basic_map
*)bset
);
699 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
701 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
704 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
710 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
711 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
713 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
714 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
715 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
716 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
717 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
718 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
720 int j
= isl_basic_map_alloc_inequality(bmap
);
724 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
725 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
732 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
733 bmap
->extra
- bmap
->n_div
);
737 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
739 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
742 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
746 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
751 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
753 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
756 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
761 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
763 if (pos
!= bmap
->n_eq
- 1) {
765 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
766 bmap
->eq
[bmap
->n_eq
- 1] = t
;
772 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
774 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
777 void isl_basic_map_inequality_to_equality(
778 struct isl_basic_map
*bmap
, unsigned pos
)
783 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
784 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
789 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
790 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
791 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
792 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
795 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
797 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
800 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
806 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
807 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
808 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
809 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
810 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
811 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
812 1 + isl_basic_map_total_dim(bmap
),
813 bmap
->extra
- bmap
->n_div
);
814 return bmap
->n_ineq
++;
817 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
819 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
822 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
826 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
831 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
833 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
836 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
841 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
843 if (pos
!= bmap
->n_ineq
- 1) {
845 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
846 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
847 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
853 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
855 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
858 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
863 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
866 k
= isl_basic_map_alloc_equality(bmap
);
869 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
872 isl_basic_map_free(bmap
);
876 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
879 return (isl_basic_set
*)
880 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
883 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
888 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
891 k
= isl_basic_map_alloc_inequality(bmap
);
894 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
897 isl_basic_map_free(bmap
);
901 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
904 return (isl_basic_set
*)
905 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
908 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
912 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
913 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
914 1 + 1 + isl_basic_map_total_dim(bmap
),
915 bmap
->extra
- bmap
->n_div
);
916 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
917 return bmap
->n_div
++;
920 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
922 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
925 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
929 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
934 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
936 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
939 /* Copy constraint from src to dst, putting the vars of src at offset
940 * dim_off in dst and the divs of src at offset div_off in dst.
941 * If both sets are actually map, then dim_off applies to the input
944 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
945 struct isl_basic_map
*src_map
, isl_int
*src
,
946 unsigned in_off
, unsigned out_off
, unsigned div_off
)
948 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
949 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
950 unsigned src_in
= isl_basic_map_n_in(src_map
);
951 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
952 unsigned src_out
= isl_basic_map_n_out(src_map
);
953 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
954 isl_int_set(dst
[0], src
[0]);
955 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
956 if (dst_nparam
> src_nparam
)
957 isl_seq_clr(dst
+1+src_nparam
,
958 dst_nparam
- src_nparam
);
959 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
960 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
962 isl_min(dst_in
-in_off
, src_in
));
963 if (dst_in
-in_off
> src_in
)
964 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
965 dst_in
- in_off
- src_in
);
966 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
967 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
968 src
+1+src_nparam
+src_in
,
969 isl_min(dst_out
-out_off
, src_out
));
970 if (dst_out
-out_off
> src_out
)
971 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
972 dst_out
- out_off
- src_out
);
973 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
974 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
975 src
+1+src_nparam
+src_in
+src_out
,
976 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
977 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
978 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
979 div_off
+src_map
->n_div
,
980 dst_map
->n_div
- div_off
- src_map
->n_div
);
983 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
984 struct isl_basic_map
*src_map
, isl_int
*src
,
985 unsigned in_off
, unsigned out_off
, unsigned div_off
)
987 isl_int_set(dst
[0], src
[0]);
988 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
991 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
992 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
997 if (!bmap1
|| !bmap2
)
1000 div_off
= bmap1
->n_div
;
1002 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1003 int i1
= isl_basic_map_alloc_equality(bmap1
);
1006 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1007 i_pos
, o_pos
, div_off
);
1010 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1011 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1014 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1015 i_pos
, o_pos
, div_off
);
1018 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1019 int i1
= isl_basic_map_alloc_div(bmap1
);
1022 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1023 i_pos
, o_pos
, div_off
);
1026 isl_basic_map_free(bmap2
);
1031 isl_basic_map_free(bmap1
);
1032 isl_basic_map_free(bmap2
);
1036 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
1037 struct isl_dim_map
*dim_map
)
1041 for (i
= 0; i
< dim_map
->len
; ++i
) {
1042 if (dim_map
->pos
[i
] < 0)
1043 isl_int_set_si(dst
[i
], 0);
1045 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
1049 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
1050 struct isl_dim_map
*dim_map
)
1052 isl_int_set(dst
[0], src
[0]);
1053 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
1056 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
1057 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
1061 if (!src
|| !dst
|| !dim_map
)
1064 for (i
= 0; i
< src
->n_eq
; ++i
) {
1065 int i1
= isl_basic_map_alloc_equality(dst
);
1068 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1071 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1072 int i1
= isl_basic_map_alloc_inequality(dst
);
1075 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1078 for (i
= 0; i
< src
->n_div
; ++i
) {
1079 int i1
= isl_basic_map_alloc_div(dst
);
1082 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1086 isl_basic_map_free(src
);
1091 isl_basic_map_free(src
);
1092 isl_basic_map_free(dst
);
1096 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1097 struct isl_basic_set
*bset2
, unsigned pos
)
1099 return (struct isl_basic_set
*)
1100 add_constraints((struct isl_basic_map
*)bset1
,
1101 (struct isl_basic_map
*)bset2
, 0, pos
);
1104 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1105 struct isl_dim
*dim
, unsigned extra
,
1106 unsigned n_eq
, unsigned n_ineq
)
1108 struct isl_basic_map
*ext
;
1118 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1119 base
->extra
>= base
->n_div
+ extra
;
1121 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1122 room_for_ineq(base
, n_ineq
)) {
1127 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1128 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1129 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1130 extra
+= base
->extra
;
1132 n_ineq
+= base
->n_ineq
;
1134 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1140 ext
->sample
= isl_vec_copy(base
->sample
);
1141 flags
= base
->flags
;
1142 ext
= add_constraints(ext
, base
, 0, 0);
1145 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1152 isl_basic_map_free(base
);
1156 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1157 struct isl_dim
*dim
, unsigned extra
,
1158 unsigned n_eq
, unsigned n_ineq
)
1160 return (struct isl_basic_set
*)
1161 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1162 extra
, n_eq
, n_ineq
);
1165 struct isl_basic_map
*isl_basic_map_extend_constraints(
1166 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1170 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1174 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1175 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1176 unsigned n_eq
, unsigned n_ineq
)
1178 struct isl_basic_map
*bmap
;
1179 struct isl_dim
*dim
;
1183 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1187 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1190 isl_basic_map_free(base
);
1194 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1195 unsigned nparam
, unsigned dim
, unsigned extra
,
1196 unsigned n_eq
, unsigned n_ineq
)
1198 return (struct isl_basic_set
*)
1199 isl_basic_map_extend((struct isl_basic_map
*)base
,
1200 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1203 struct isl_basic_set
*isl_basic_set_extend_constraints(
1204 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1206 return (struct isl_basic_set
*)
1207 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1211 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1213 return (struct isl_basic_set
*)
1214 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1217 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1222 if (bmap
->ref
> 1) {
1224 bmap
= isl_basic_map_dup(bmap
);
1227 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1231 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1239 return isl_set_dup(set
);
1242 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1250 return isl_map_dup(map
);
1253 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1254 unsigned a_len
, unsigned b_len
)
1256 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1257 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1258 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1261 struct isl_basic_set
*isl_basic_set_swap_vars(
1262 struct isl_basic_set
*bset
, unsigned n
)
1272 nparam
= isl_basic_set_n_param(bset
);
1273 dim
= isl_basic_set_n_dim(bset
);
1274 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1279 bset
= isl_basic_set_cow(bset
);
1283 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1284 if (isl_blk_is_error(blk
))
1287 for (i
= 0; i
< bset
->n_eq
; ++i
)
1289 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1291 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1293 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1295 for (i
= 0; i
< bset
->n_div
; ++i
)
1297 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1299 isl_blk_free(bset
->ctx
, blk
);
1301 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1302 bset
= isl_basic_set_gauss(bset
, NULL
);
1303 return isl_basic_set_finalize(bset
);
1305 isl_basic_set_free(bset
);
1309 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1312 set
= isl_set_cow(set
);
1316 for (i
= 0; i
< set
->n
; ++i
) {
1317 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1323 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1327 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1333 total
= isl_basic_map_total_dim(bmap
);
1334 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1335 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1337 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1339 i
= isl_basic_map_alloc_equality(bmap
);
1343 isl_int_set_si(bmap
->eq
[i
][0], 1);
1344 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1345 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1346 isl_vec_free(bmap
->sample
);
1347 bmap
->sample
= NULL
;
1348 return isl_basic_map_finalize(bmap
);
1350 isl_basic_map_free(bmap
);
1354 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1356 return (struct isl_basic_set
*)
1357 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1360 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1363 unsigned off
= isl_dim_total(bmap
->dim
);
1364 isl_int
*t
= bmap
->div
[a
];
1365 bmap
->div
[a
] = bmap
->div
[b
];
1368 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1369 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1371 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1372 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1374 for (i
= 0; i
< bmap
->n_div
; ++i
)
1375 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1376 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1379 /* Eliminate the specified n dimensions starting at first from the
1380 * constraints using Fourier-Motzkin. The dimensions themselves
1383 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1384 enum isl_dim_type type
, unsigned first
, unsigned n
)
1393 map
= isl_map_cow(map
);
1396 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1397 first
+= pos(map
->dim
, type
) - 1;
1399 for (i
= 0; i
< map
->n
; ++i
) {
1400 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1410 /* Eliminate the specified n dimensions starting at first from the
1411 * constraints using Fourier-Motzkin. The dimensions themselves
1414 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1415 enum isl_dim_type type
, unsigned first
, unsigned n
)
1417 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1420 /* Eliminate the specified n dimensions starting at first from the
1421 * constraints using Fourier-Motzkin. The dimensions themselves
1424 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1425 unsigned first
, unsigned n
)
1427 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1430 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1431 __isl_take isl_basic_map
*bmap
)
1433 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1438 return isl_basic_map_finalize(bmap
);
1441 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1442 __isl_take isl_basic_set
*bset
)
1444 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1445 (struct isl_basic_map
*)bset
);
1448 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1457 set
= isl_set_cow(set
);
1461 for (i
= 0; i
< set
->n
; ++i
) {
1462 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1472 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1473 enum isl_dim_type type
, unsigned first
, unsigned n
)
1477 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1481 bmap
= isl_basic_map_eliminate_vars(bmap
,
1482 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1485 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1487 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1490 isl_basic_map_free(bmap
);
1494 /* Return true if the definition of the given div (recursively) involves
1495 * any of the given variables.
1497 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1498 unsigned first
, unsigned n
)
1501 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1503 if (isl_int_is_zero(bmap
->div
[div
][0]))
1505 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1508 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1509 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1511 if (div_involves_vars(bmap
, i
, first
, n
))
1518 /* Remove all divs (recursively) involving any of the given dimensions
1519 * in their definitions.
1521 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1522 __isl_take isl_basic_map
*bmap
,
1523 enum isl_dim_type type
, unsigned first
, unsigned n
)
1529 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1531 first
+= isl_basic_map_offset(bmap
, type
);
1533 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1534 if (!div_involves_vars(bmap
, i
, first
, n
))
1536 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1541 isl_basic_map_free(bmap
);
1545 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1546 enum isl_dim_type type
, unsigned first
, unsigned n
)
1555 map
= isl_map_cow(map
);
1559 for (i
= 0; i
< map
->n
; ++i
) {
1560 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1571 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1572 enum isl_dim_type type
, unsigned first
, unsigned n
)
1574 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1578 /* Return true if the definition of the given div is unknown or depends
1581 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1584 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1586 if (isl_int_is_zero(bmap
->div
[div
][0]))
1589 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1590 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1592 if (div_is_unknown(bmap
, i
))
1599 /* Remove all divs that are unknown or defined in terms of unknown divs.
1601 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1602 __isl_take isl_basic_map
*bmap
)
1609 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1610 if (!div_is_unknown(bmap
, i
))
1612 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1617 isl_basic_map_free(bmap
);
1621 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1630 map
= isl_map_cow(map
);
1634 for (i
= 0; i
< map
->n
; ++i
) {
1635 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1645 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1647 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1650 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1651 __isl_take isl_basic_set
*bset
,
1652 enum isl_dim_type type
, unsigned first
, unsigned n
)
1654 return (isl_basic_set
*)
1655 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1658 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1659 enum isl_dim_type type
, unsigned first
, unsigned n
)
1666 map
= isl_map_cow(map
);
1669 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1671 for (i
= 0; i
< map
->n
; ++i
) {
1672 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1673 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1677 map
= isl_map_drop(map
, type
, first
, n
);
1684 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1685 enum isl_dim_type type
, unsigned first
, unsigned n
)
1687 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1690 /* Project out n inputs starting at first using Fourier-Motzkin */
1691 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1692 unsigned first
, unsigned n
)
1694 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1697 static void dump_term(struct isl_basic_map
*bmap
,
1698 isl_int c
, int pos
, FILE *out
)
1701 unsigned in
= isl_basic_map_n_in(bmap
);
1702 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1703 unsigned nparam
= isl_basic_map_n_param(bmap
);
1705 isl_int_print(out
, c
, 0);
1707 if (!isl_int_is_one(c
))
1708 isl_int_print(out
, c
, 0);
1709 if (pos
< 1 + nparam
) {
1710 name
= isl_dim_get_name(bmap
->dim
,
1711 isl_dim_param
, pos
- 1);
1713 fprintf(out
, "%s", name
);
1715 fprintf(out
, "p%d", pos
- 1);
1716 } else if (pos
< 1 + nparam
+ in
)
1717 fprintf(out
, "i%d", pos
- 1 - nparam
);
1718 else if (pos
< 1 + nparam
+ dim
)
1719 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1721 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1725 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1726 int sign
, FILE *out
)
1730 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1734 for (i
= 0, first
= 1; i
< len
; ++i
) {
1735 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1738 fprintf(out
, " + ");
1740 isl_int_abs(v
, c
[i
]);
1741 dump_term(bmap
, v
, i
, out
);
1748 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1749 const char *op
, FILE *out
, int indent
)
1753 fprintf(out
, "%*s", indent
, "");
1755 dump_constraint_sign(bmap
, c
, 1, out
);
1756 fprintf(out
, " %s ", op
);
1757 dump_constraint_sign(bmap
, c
, -1, out
);
1761 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1762 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1764 fprintf(out
, "%*s", indent
, "");
1765 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1770 static void dump_constraints(struct isl_basic_map
*bmap
,
1771 isl_int
**c
, unsigned n
,
1772 const char *op
, FILE *out
, int indent
)
1776 for (i
= 0; i
< n
; ++i
)
1777 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1780 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1784 unsigned total
= isl_basic_map_total_dim(bmap
);
1786 for (j
= 0; j
< 1 + total
; ++j
) {
1787 if (isl_int_is_zero(exp
[j
]))
1789 if (!first
&& isl_int_is_pos(exp
[j
]))
1791 dump_term(bmap
, exp
[j
], j
, out
);
1796 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1800 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1801 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1803 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1804 fprintf(out
, "%*s", indent
, "");
1805 fprintf(out
, "e%d = [(", i
);
1806 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1808 isl_int_print(out
, bmap
->div
[i
][0], 0);
1809 fprintf(out
, "]\n");
1813 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
1814 FILE *out
, int indent
)
1817 fprintf(out
, "null basic set\n");
1821 fprintf(out
, "%*s", indent
, "");
1822 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1823 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1824 bset
->extra
, bset
->flags
);
1825 dump((struct isl_basic_map
*)bset
, out
, indent
);
1828 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
1829 FILE *out
, int indent
)
1832 fprintf(out
, "null basic map\n");
1836 fprintf(out
, "%*s", indent
, "");
1837 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1838 "flags: %x, n_name: %d\n",
1840 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1841 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1842 dump(bmap
, out
, indent
);
1845 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1850 total
= isl_basic_map_total_dim(bmap
);
1851 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1852 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1853 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1854 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1858 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1860 struct isl_set
*set
;
1864 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1865 isl_assert(dim
->ctx
, n
>= 0, goto error
);
1866 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1867 sizeof(struct isl_set
) +
1868 (n
- 1) * sizeof(struct isl_basic_set
*));
1872 set
->ctx
= dim
->ctx
;
1873 isl_ctx_ref(set
->ctx
);
1885 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1886 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1888 struct isl_set
*set
;
1889 struct isl_dim
*dims
;
1891 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1895 set
= isl_set_alloc_dim(dims
, n
, flags
);
1899 /* Make sure "map" has room for at least "n" more basic maps.
1901 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1904 struct isl_map
*grown
= NULL
;
1908 isl_assert(map
->ctx
, n
>= 0, goto error
);
1909 if (map
->n
+ n
<= map
->size
)
1911 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1914 for (i
= 0; i
< map
->n
; ++i
) {
1915 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1923 isl_map_free(grown
);
1928 /* Make sure "set" has room for at least "n" more basic sets.
1930 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1932 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1935 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1938 struct isl_set
*dup
;
1943 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1946 for (i
= 0; i
< set
->n
; ++i
)
1947 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1951 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1953 return isl_map_from_basic_map(bset
);
1956 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1958 struct isl_map
*map
;
1963 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1964 return isl_map_add_basic_map(map
, bmap
);
1967 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1968 __isl_take isl_basic_set
*bset
)
1970 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1971 (struct isl_basic_map
*)bset
);
1974 void isl_set_free(struct isl_set
*set
)
1984 isl_ctx_deref(set
->ctx
);
1985 for (i
= 0; i
< set
->n
; ++i
)
1986 isl_basic_set_free(set
->p
[i
]);
1987 isl_dim_free(set
->dim
);
1991 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
1996 fprintf(out
, "null set\n");
2000 fprintf(out
, "%*s", indent
, "");
2001 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2002 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2004 for (i
= 0; i
< set
->n
; ++i
) {
2005 fprintf(out
, "%*s", indent
, "");
2006 fprintf(out
, "basic set %d:\n", i
);
2007 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2011 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2016 fprintf(out
, "null map\n");
2020 fprintf(out
, "%*s", indent
, "");
2021 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2022 "flags: %x, n_name: %d\n",
2023 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2024 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
2025 for (i
= 0; i
< map
->n
; ++i
) {
2026 fprintf(out
, "%*s", indent
, "");
2027 fprintf(out
, "basic map %d:\n", i
);
2028 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2032 struct isl_basic_map
*isl_basic_map_intersect_domain(
2033 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2035 struct isl_basic_map
*bmap_domain
;
2040 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2041 bset
->dim
, isl_dim_param
), goto error
);
2043 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2044 isl_assert(bset
->ctx
,
2045 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2047 bmap
= isl_basic_map_cow(bmap
);
2050 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2051 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2052 bmap_domain
= isl_basic_map_from_domain(bset
);
2053 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2055 bmap
= isl_basic_map_simplify(bmap
);
2056 return isl_basic_map_finalize(bmap
);
2058 isl_basic_map_free(bmap
);
2059 isl_basic_set_free(bset
);
2063 struct isl_basic_map
*isl_basic_map_intersect_range(
2064 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2066 struct isl_basic_map
*bmap_range
;
2071 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2072 bset
->dim
, isl_dim_param
), goto error
);
2074 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2075 isl_assert(bset
->ctx
,
2076 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2078 bmap
= isl_basic_map_cow(bmap
);
2081 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2082 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2083 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2084 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2086 bmap
= isl_basic_map_simplify(bmap
);
2087 return isl_basic_map_finalize(bmap
);
2089 isl_basic_map_free(bmap
);
2090 isl_basic_set_free(bset
);
2094 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2100 total
= 1 + isl_basic_map_total_dim(bmap
);
2101 if (total
!= vec
->size
)
2106 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2107 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2108 if (!isl_int_is_zero(s
)) {
2114 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2115 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2116 if (isl_int_is_neg(s
)) {
2127 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2129 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2132 struct isl_basic_map
*isl_basic_map_intersect(
2133 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2135 struct isl_vec
*sample
= NULL
;
2137 if (!bmap1
|| !bmap2
)
2140 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2141 bmap2
->dim
, isl_dim_param
), goto error
);
2142 if (isl_dim_total(bmap1
->dim
) ==
2143 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2144 isl_dim_total(bmap2
->dim
) !=
2145 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2146 return isl_basic_map_intersect(bmap2
, bmap1
);
2148 if (isl_dim_total(bmap2
->dim
) !=
2149 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2150 isl_assert(bmap1
->ctx
,
2151 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2153 if (bmap1
->sample
&&
2154 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2155 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2156 sample
= isl_vec_copy(bmap1
->sample
);
2157 else if (bmap2
->sample
&&
2158 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2159 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2160 sample
= isl_vec_copy(bmap2
->sample
);
2162 bmap1
= isl_basic_map_cow(bmap1
);
2165 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2166 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2167 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2170 isl_vec_free(sample
);
2172 isl_vec_free(bmap1
->sample
);
2173 bmap1
->sample
= sample
;
2176 bmap1
= isl_basic_map_simplify(bmap1
);
2177 return isl_basic_map_finalize(bmap1
);
2180 isl_vec_free(sample
);
2181 isl_basic_map_free(bmap1
);
2182 isl_basic_map_free(bmap2
);
2186 struct isl_basic_set
*isl_basic_set_intersect(
2187 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2189 return (struct isl_basic_set
*)
2190 isl_basic_map_intersect(
2191 (struct isl_basic_map
*)bset1
,
2192 (struct isl_basic_map
*)bset2
);
2195 /* Special case of isl_map_intersect, where both map1 and map2
2196 * are convex, without any divs and such that either map1 or map2
2197 * contains a single constraint. This constraint is then simply
2198 * added to the other map.
2200 static __isl_give isl_map
*map_intersect_add_constraint(
2201 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2203 struct isl_basic_map
*bmap1
;
2204 struct isl_basic_map
*bmap2
;
2206 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2207 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2208 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2209 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2211 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2212 return isl_map_intersect(map2
, map1
);
2214 isl_assert(map2
->ctx
,
2215 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2217 map1
= isl_map_cow(map1
);
2220 if (isl_map_fast_is_empty(map1
)) {
2224 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2225 if (map2
->p
[0]->n_eq
== 1)
2226 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2228 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2229 map2
->p
[0]->ineq
[0]);
2231 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2232 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2236 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2237 isl_basic_map_free(map1
->p
[0]);
2250 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2253 struct isl_map
*result
;
2259 if (isl_map_fast_is_empty(map1
)) {
2263 if (isl_map_fast_is_empty(map2
)) {
2268 if (map1
->n
== 1 && map2
->n
== 1 &&
2269 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2270 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2271 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2272 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2273 return map_intersect_add_constraint(map1
, map2
);
2274 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2275 map2
->dim
, isl_dim_param
), goto error
);
2276 if (isl_dim_total(map1
->dim
) ==
2277 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2278 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2279 return isl_map_intersect(map2
, map1
);
2281 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2282 isl_assert(map1
->ctx
,
2283 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2285 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2286 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2287 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2289 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2290 map1
->n
* map2
->n
, flags
);
2293 for (i
= 0; i
< map1
->n
; ++i
)
2294 for (j
= 0; j
< map2
->n
; ++j
) {
2295 struct isl_basic_map
*part
;
2296 part
= isl_basic_map_intersect(
2297 isl_basic_map_copy(map1
->p
[i
]),
2298 isl_basic_map_copy(map2
->p
[j
]));
2299 if (isl_basic_map_is_empty(part
))
2300 isl_basic_map_free(part
);
2302 result
= isl_map_add_basic_map(result
, part
);
2315 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2317 return (struct isl_set
*)
2318 isl_map_intersect((struct isl_map
*)set1
,
2319 (struct isl_map
*)set2
);
2322 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2324 struct isl_dim
*dim
;
2325 struct isl_basic_set
*bset
;
2330 bmap
= isl_basic_map_cow(bmap
);
2333 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2334 in
= isl_basic_map_n_in(bmap
);
2335 bset
= isl_basic_set_from_basic_map(bmap
);
2336 bset
= isl_basic_set_swap_vars(bset
, in
);
2337 return isl_basic_map_from_basic_set(bset
, dim
);
2340 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2341 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2343 struct isl_dim
*res_dim
;
2344 struct isl_basic_map
*res
;
2345 struct isl_dim_map
*dim_map
;
2346 unsigned total
, off
;
2347 enum isl_dim_type t
;
2355 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2357 total
= isl_basic_map_total_dim(bmap
) + n
;
2358 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2360 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2362 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2364 unsigned size
= isl_basic_map_dim(bmap
, t
);
2365 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2367 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2368 pos
, size
- pos
, off
+ pos
+ n
);
2370 off
+= isl_dim_size(res_dim
, t
);
2372 isl_dim_map_div(dim_map
, bmap
, off
);
2374 res
= isl_basic_map_alloc_dim(res_dim
,
2375 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2376 if (isl_basic_map_is_rational(bmap
))
2377 res
= isl_basic_map_set_rational(res
);
2378 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2379 return isl_basic_map_finalize(res
);
2382 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2383 enum isl_dim_type type
, unsigned n
)
2387 return isl_basic_map_insert(bmap
, type
,
2388 isl_basic_map_dim(bmap
, type
), n
);
2391 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2392 enum isl_dim_type type
, unsigned n
)
2396 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2397 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2399 isl_basic_set_free(bset
);
2403 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2404 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2411 map
= isl_map_cow(map
);
2415 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2419 for (i
= 0; i
< map
->n
; ++i
) {
2420 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2431 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2432 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2434 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2437 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2438 enum isl_dim_type type
, unsigned n
)
2442 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2445 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2446 enum isl_dim_type type
, unsigned n
)
2450 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2451 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2457 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2458 __isl_take isl_basic_map
*bmap
,
2459 enum isl_dim_type dst_type
, unsigned dst_pos
,
2460 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2463 struct isl_dim_map
*dim_map
;
2464 struct isl_basic_map
*res
;
2465 enum isl_dim_type t
;
2466 unsigned total
, off
;
2473 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2476 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2479 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2481 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2482 pos(bmap
->dim
, src_type
) + src_pos
+
2483 ((src_type
< dst_type
) ? n
: 0)) {
2484 bmap
= isl_basic_map_cow(bmap
);
2488 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2489 src_type
, src_pos
, n
);
2493 bmap
= isl_basic_map_finalize(bmap
);
2498 total
= isl_basic_map_total_dim(bmap
);
2499 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2502 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2503 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2504 if (t
== dst_type
) {
2505 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2508 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2511 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2512 dst_pos
, size
- dst_pos
, off
);
2513 off
+= size
- dst_pos
;
2514 } else if (t
== src_type
) {
2515 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2518 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2519 src_pos
+ n
, size
- src_pos
- n
, off
);
2520 off
+= size
- src_pos
- n
;
2522 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2526 isl_dim_map_div(dim_map
, bmap
, off
);
2528 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2529 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2530 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2532 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2533 src_type
, src_pos
, n
);
2537 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2538 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2539 bmap
= isl_basic_map_finalize(bmap
);
2543 isl_basic_map_free(bmap
);
2547 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2548 enum isl_dim_type dst_type
, unsigned dst_pos
,
2549 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2551 return (isl_basic_set
*)isl_basic_map_move_dims(
2552 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2555 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2556 enum isl_dim_type dst_type
, unsigned dst_pos
,
2557 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2561 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2562 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2563 src_type
, src_pos
, n
);
2569 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2570 enum isl_dim_type dst_type
, unsigned dst_pos
,
2571 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2580 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2583 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2586 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2588 map
= isl_map_cow(map
);
2592 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2596 for (i
= 0; i
< map
->n
; ++i
) {
2597 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2599 src_type
, src_pos
, n
);
2610 /* Move the specified dimensions to the last columns right before
2611 * the divs. Don't change the dimension specification of bmap.
2612 * That's the responsibility of the caller.
2614 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2615 enum isl_dim_type type
, unsigned first
, unsigned n
)
2617 struct isl_dim_map
*dim_map
;
2618 struct isl_basic_map
*res
;
2619 enum isl_dim_type t
;
2620 unsigned total
, off
;
2624 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2627 total
= isl_basic_map_total_dim(bmap
);
2628 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2631 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2632 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2634 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2637 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2638 first
, n
, total
- bmap
->n_div
- n
);
2639 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2640 first
+ n
, size
- (first
+ n
), off
);
2641 off
+= size
- (first
+ n
);
2643 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2647 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2649 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2650 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2651 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2655 /* Turn the n dimensions of type type, starting at first
2656 * into existentially quantified variables.
2658 __isl_give isl_basic_map
*isl_basic_map_project_out(
2659 __isl_take isl_basic_map
*bmap
,
2660 enum isl_dim_type type
, unsigned first
, unsigned n
)
2673 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2674 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2676 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2679 bmap
= move_last(bmap
, type
, first
, n
);
2680 bmap
= isl_basic_map_cow(bmap
);
2684 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2685 old
= bmap
->block2
.data
;
2686 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2687 (bmap
->extra
+ n
) * (1 + row_size
));
2688 if (!bmap
->block2
.data
)
2690 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2693 for (i
= 0; i
< n
; ++i
) {
2694 new_div
[i
] = bmap
->block2
.data
+
2695 (bmap
->extra
+ i
) * (1 + row_size
);
2696 isl_seq_clr(new_div
[i
], 1 + row_size
);
2698 for (i
= 0; i
< bmap
->extra
; ++i
)
2699 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2701 bmap
->div
= new_div
;
2705 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2708 bmap
= isl_basic_map_simplify(bmap
);
2709 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2710 return isl_basic_map_finalize(bmap
);
2712 isl_basic_map_free(bmap
);
2716 /* Turn the n dimensions of type type, starting at first
2717 * into existentially quantified variables.
2719 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2720 enum isl_dim_type type
, unsigned first
, unsigned n
)
2722 return (isl_basic_set
*)isl_basic_map_project_out(
2723 (isl_basic_map
*)bset
, type
, first
, n
);
2726 /* Turn the n dimensions of type type, starting at first
2727 * into existentially quantified variables.
2729 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2730 enum isl_dim_type type
, unsigned first
, unsigned n
)
2740 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2742 map
= isl_map_cow(map
);
2746 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2750 for (i
= 0; i
< map
->n
; ++i
) {
2751 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2762 /* Turn the n dimensions of type type, starting at first
2763 * into existentially quantified variables.
2765 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2766 enum isl_dim_type type
, unsigned first
, unsigned n
)
2768 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2771 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2775 for (i
= 0; i
< n
; ++i
) {
2776 j
= isl_basic_map_alloc_div(bmap
);
2779 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2783 isl_basic_map_free(bmap
);
2787 struct isl_basic_map
*isl_basic_map_apply_range(
2788 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2790 struct isl_dim
*dim_result
= NULL
;
2791 struct isl_basic_map
*bmap
;
2792 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2793 struct isl_dim_map
*dim_map1
, *dim_map2
;
2795 if (!bmap1
|| !bmap2
)
2798 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2799 isl_dim_copy(bmap2
->dim
));
2801 n_in
= isl_basic_map_n_in(bmap1
);
2802 n_out
= isl_basic_map_n_out(bmap2
);
2803 n
= isl_basic_map_n_out(bmap1
);
2804 nparam
= isl_basic_map_n_param(bmap1
);
2806 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2807 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2808 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2809 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2810 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2811 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2812 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2813 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2814 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2815 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2816 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2818 bmap
= isl_basic_map_alloc_dim(dim_result
,
2819 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2820 bmap1
->n_eq
+ bmap2
->n_eq
,
2821 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2822 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2823 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2824 bmap
= add_divs(bmap
, n
);
2825 bmap
= isl_basic_map_simplify(bmap
);
2826 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2827 return isl_basic_map_finalize(bmap
);
2829 isl_basic_map_free(bmap1
);
2830 isl_basic_map_free(bmap2
);
2834 struct isl_basic_set
*isl_basic_set_apply(
2835 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2840 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2843 return (struct isl_basic_set
*)
2844 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2846 isl_basic_set_free(bset
);
2847 isl_basic_map_free(bmap
);
2851 struct isl_basic_map
*isl_basic_map_apply_domain(
2852 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2854 if (!bmap1
|| !bmap2
)
2857 isl_assert(bmap1
->ctx
,
2858 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2859 isl_assert(bmap1
->ctx
,
2860 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2863 bmap1
= isl_basic_map_reverse(bmap1
);
2864 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2865 return isl_basic_map_reverse(bmap1
);
2867 isl_basic_map_free(bmap1
);
2868 isl_basic_map_free(bmap2
);
2872 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2873 * A \cap B -> f(A) + f(B)
2875 struct isl_basic_map
*isl_basic_map_sum(
2876 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2878 unsigned n_in
, n_out
, nparam
, total
, pos
;
2879 struct isl_basic_map
*bmap
= NULL
;
2880 struct isl_dim_map
*dim_map1
, *dim_map2
;
2883 if (!bmap1
|| !bmap2
)
2886 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2889 nparam
= isl_basic_map_n_param(bmap1
);
2890 n_in
= isl_basic_map_n_in(bmap1
);
2891 n_out
= isl_basic_map_n_out(bmap1
);
2893 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2894 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2895 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2896 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2897 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2898 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2899 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2900 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2901 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2902 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2903 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2905 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2906 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2907 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2908 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2909 for (i
= 0; i
< n_out
; ++i
) {
2910 int j
= isl_basic_map_alloc_equality(bmap
);
2913 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2914 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2915 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2916 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2918 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2919 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2920 bmap
= add_divs(bmap
, 2 * n_out
);
2922 bmap
= isl_basic_map_simplify(bmap
);
2923 return isl_basic_map_finalize(bmap
);
2925 isl_basic_map_free(bmap
);
2926 isl_basic_map_free(bmap1
);
2927 isl_basic_map_free(bmap2
);
2931 /* Given two maps A -> f(A) and B -> g(B), construct a map
2932 * A \cap B -> f(A) + f(B)
2934 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2936 struct isl_map
*result
;
2942 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2944 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2945 map1
->n
* map2
->n
, 0);
2948 for (i
= 0; i
< map1
->n
; ++i
)
2949 for (j
= 0; j
< map2
->n
; ++j
) {
2950 struct isl_basic_map
*part
;
2951 part
= isl_basic_map_sum(
2952 isl_basic_map_copy(map1
->p
[i
]),
2953 isl_basic_map_copy(map2
->p
[j
]));
2954 if (isl_basic_map_is_empty(part
))
2955 isl_basic_map_free(part
);
2957 result
= isl_map_add_basic_map(result
, part
);
2970 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2971 __isl_take isl_set
*set2
)
2973 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2976 /* Given a basic map A -> f(A), construct A -> -f(A).
2978 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2983 bmap
= isl_basic_map_cow(bmap
);
2987 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2988 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2989 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2990 for (j
= 0; j
< n
; ++j
)
2991 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2992 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2993 for (j
= 0; j
< n
; ++j
)
2994 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2995 for (i
= 0; i
< bmap
->n_div
; ++i
)
2996 for (j
= 0; j
< n
; ++j
)
2997 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2998 return isl_basic_map_finalize(bmap
);
3001 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3003 return isl_basic_map_neg(bset
);
3006 /* Given a map A -> f(A), construct A -> -f(A).
3008 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3012 map
= isl_map_cow(map
);
3016 for (i
= 0; i
< map
->n
; ++i
) {
3017 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3028 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3030 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3033 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3034 * A -> floor(f(A)/d).
3036 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3039 unsigned n_in
, n_out
, nparam
, total
, pos
;
3040 struct isl_basic_map
*result
= NULL
;
3041 struct isl_dim_map
*dim_map
;
3047 nparam
= isl_basic_map_n_param(bmap
);
3048 n_in
= isl_basic_map_n_in(bmap
);
3049 n_out
= isl_basic_map_n_out(bmap
);
3051 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3052 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3053 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3054 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3055 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3056 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3058 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
3059 bmap
->n_div
+ n_out
,
3060 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3061 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
3062 result
= add_divs(result
, n_out
);
3063 for (i
= 0; i
< n_out
; ++i
) {
3065 j
= isl_basic_map_alloc_inequality(result
);
3068 isl_seq_clr(result
->ineq
[j
], 1+total
);
3069 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3070 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3071 j
= isl_basic_map_alloc_inequality(result
);
3074 isl_seq_clr(result
->ineq
[j
], 1+total
);
3075 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3076 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3077 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3080 result
= isl_basic_map_simplify(result
);
3081 return isl_basic_map_finalize(result
);
3083 isl_basic_map_free(result
);
3087 /* Given a map A -> f(A) and an integer d, construct a map
3088 * A -> floor(f(A)/d).
3090 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3094 map
= isl_map_cow(map
);
3098 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3099 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3100 for (i
= 0; i
< map
->n
; ++i
) {
3101 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3112 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3118 i
= isl_basic_map_alloc_equality(bmap
);
3121 nparam
= isl_basic_map_n_param(bmap
);
3122 n_in
= isl_basic_map_n_in(bmap
);
3123 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3124 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3125 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3126 return isl_basic_map_finalize(bmap
);
3128 isl_basic_map_free(bmap
);
3132 /* Add a constraints to "bmap" expressing i_pos < o_pos
3134 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3140 i
= isl_basic_map_alloc_inequality(bmap
);
3143 nparam
= isl_basic_map_n_param(bmap
);
3144 n_in
= isl_basic_map_n_in(bmap
);
3145 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3146 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3147 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3148 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3149 return isl_basic_map_finalize(bmap
);
3151 isl_basic_map_free(bmap
);
3155 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3157 static __isl_give isl_basic_map
*var_less_or_equal(
3158 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3164 i
= isl_basic_map_alloc_inequality(bmap
);
3167 nparam
= isl_basic_map_n_param(bmap
);
3168 n_in
= isl_basic_map_n_in(bmap
);
3169 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3170 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3171 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3172 return isl_basic_map_finalize(bmap
);
3174 isl_basic_map_free(bmap
);
3178 /* Add a constraints to "bmap" expressing i_pos > o_pos
3180 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3186 i
= isl_basic_map_alloc_inequality(bmap
);
3189 nparam
= isl_basic_map_n_param(bmap
);
3190 n_in
= isl_basic_map_n_in(bmap
);
3191 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3192 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3193 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3194 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3195 return isl_basic_map_finalize(bmap
);
3197 isl_basic_map_free(bmap
);
3201 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3203 static __isl_give isl_basic_map
*var_more_or_equal(
3204 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3210 i
= isl_basic_map_alloc_inequality(bmap
);
3213 nparam
= isl_basic_map_n_param(bmap
);
3214 n_in
= isl_basic_map_n_in(bmap
);
3215 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3216 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3217 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3218 return isl_basic_map_finalize(bmap
);
3220 isl_basic_map_free(bmap
);
3224 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3227 struct isl_basic_map
*bmap
;
3228 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3231 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3232 bmap
= var_equal(bmap
, i
);
3233 return isl_basic_map_finalize(bmap
);
3236 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3238 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3241 struct isl_basic_map
*bmap
;
3242 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3245 for (i
= 0; i
< pos
&& bmap
; ++i
)
3246 bmap
= var_equal(bmap
, i
);
3248 bmap
= var_less(bmap
, pos
);
3249 return isl_basic_map_finalize(bmap
);
3252 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3254 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3255 __isl_take isl_dim
*dim
, unsigned pos
)
3258 isl_basic_map
*bmap
;
3260 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3261 for (i
= 0; i
< pos
; ++i
)
3262 bmap
= var_equal(bmap
, i
);
3263 bmap
= var_less_or_equal(bmap
, pos
);
3264 return isl_basic_map_finalize(bmap
);
3267 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3269 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3272 struct isl_basic_map
*bmap
;
3273 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3276 for (i
= 0; i
< pos
&& bmap
; ++i
)
3277 bmap
= var_equal(bmap
, i
);
3279 bmap
= var_more(bmap
, pos
);
3280 return isl_basic_map_finalize(bmap
);
3283 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3285 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3286 __isl_take isl_dim
*dim
, unsigned pos
)
3289 isl_basic_map
*bmap
;
3291 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3292 for (i
= 0; i
< pos
; ++i
)
3293 bmap
= var_equal(bmap
, i
);
3294 bmap
= var_more_or_equal(bmap
, pos
);
3295 return isl_basic_map_finalize(bmap
);
3298 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3299 unsigned n
, int equal
)
3301 struct isl_map
*map
;
3304 if (n
== 0 && equal
)
3305 return isl_map_universe(dims
);
3307 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3309 for (i
= 0; i
+ 1 < n
; ++i
)
3310 map
= isl_map_add_basic_map(map
,
3311 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3314 map
= isl_map_add_basic_map(map
,
3315 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3317 map
= isl_map_add_basic_map(map
,
3318 isl_basic_map_less_at(dims
, n
- 1));
3325 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3329 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3332 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3334 return map_lex_lte_first(dim
, n
, 0);
3337 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3339 return map_lex_lte_first(dim
, n
, 1);
3342 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3344 return map_lex_lte(isl_dim_map_from_set(set_dim
), 0);
3347 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3349 return map_lex_lte(isl_dim_map_from_set(set_dim
), 1);
3352 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3353 unsigned n
, int equal
)
3355 struct isl_map
*map
;
3358 if (n
== 0 && equal
)
3359 return isl_map_universe(dims
);
3361 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3363 for (i
= 0; i
+ 1 < n
; ++i
)
3364 map
= isl_map_add_basic_map(map
,
3365 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3368 map
= isl_map_add_basic_map(map
,
3369 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3371 map
= isl_map_add_basic_map(map
,
3372 isl_basic_map_more_at(dims
, n
- 1));
3379 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3383 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3386 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3388 return map_lex_gte_first(dim
, n
, 0);
3391 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3393 return map_lex_gte_first(dim
, n
, 1);
3396 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3398 return map_lex_gte(isl_dim_map_from_set(set_dim
), 0);
3401 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3403 return map_lex_gte(isl_dim_map_from_set(set_dim
), 1);
3406 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3407 __isl_take isl_set
*set2
)
3410 map
= isl_map_lex_le(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_lt_set(__isl_take isl_set
*set1
,
3417 __isl_take isl_set
*set2
)
3420 map
= isl_map_lex_lt(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_ge_set(__isl_take isl_set
*set1
,
3427 __isl_take isl_set
*set2
)
3430 map
= isl_map_lex_ge(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_set_lex_gt_set(__isl_take isl_set
*set1
,
3437 __isl_take isl_set
*set2
)
3440 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3441 map
= isl_map_intersect_domain(map
, set1
);
3442 map
= isl_map_intersect_range(map
, set2
);
3446 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3447 __isl_take isl_map
*map2
)
3450 map
= isl_map_lex_le(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_lt_map(__isl_take isl_map
*map1
,
3457 __isl_take isl_map
*map2
)
3460 map
= isl_map_lex_lt(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_ge_map(__isl_take isl_map
*map1
,
3467 __isl_take isl_map
*map2
)
3470 map
= isl_map_lex_ge(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 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3477 __isl_take isl_map
*map2
)
3480 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3481 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3482 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3486 struct isl_basic_map
*isl_basic_map_from_basic_set(
3487 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3489 struct isl_basic_map
*bmap
;
3491 bset
= isl_basic_set_cow(bset
);
3495 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3496 isl_dim_free(bset
->dim
);
3497 bmap
= (struct isl_basic_map
*) bset
;
3499 return isl_basic_map_finalize(bmap
);
3501 isl_basic_set_free(bset
);
3506 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3510 if (bmap
->dim
->n_in
== 0)
3511 return (struct isl_basic_set
*)bmap
;
3512 bmap
= isl_basic_map_cow(bmap
);
3515 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3518 bmap
= isl_basic_map_finalize(bmap
);
3519 return (struct isl_basic_set
*)bmap
;
3521 isl_basic_map_free(bmap
);
3525 /* For a div d = floor(f/m), add the constraints
3528 * -(f-(n-1)) + m d >= 0
3530 * Note that the second constraint is the negation of
3534 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3535 unsigned pos
, isl_int
*div
)
3538 unsigned total
= isl_basic_map_total_dim(bmap
);
3540 i
= isl_basic_map_alloc_inequality(bmap
);
3543 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3544 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3546 j
= isl_basic_map_alloc_inequality(bmap
);
3549 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3550 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3551 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3555 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3556 unsigned pos
, isl_int
*div
)
3558 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3562 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3564 unsigned total
= isl_basic_map_total_dim(bmap
);
3565 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3567 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3571 struct isl_basic_set
*isl_basic_map_underlying_set(
3572 struct isl_basic_map
*bmap
)
3576 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3578 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3579 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3580 return (struct isl_basic_set
*)bmap
;
3581 bmap
= isl_basic_map_cow(bmap
);
3584 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3587 bmap
->extra
-= bmap
->n_div
;
3589 bmap
= isl_basic_map_finalize(bmap
);
3590 return (struct isl_basic_set
*)bmap
;
3595 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3596 __isl_take isl_basic_set
*bset
)
3598 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3601 struct isl_basic_map
*isl_basic_map_overlying_set(
3602 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3604 struct isl_basic_map
*bmap
;
3605 struct isl_ctx
*ctx
;
3612 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3613 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3614 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3616 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3617 isl_basic_map_free(like
);
3618 return (struct isl_basic_map
*)bset
;
3620 bset
= isl_basic_set_cow(bset
);
3623 total
= bset
->dim
->n_out
+ bset
->extra
;
3624 bmap
= (struct isl_basic_map
*)bset
;
3625 isl_dim_free(bmap
->dim
);
3626 bmap
->dim
= isl_dim_copy(like
->dim
);
3629 bmap
->n_div
= like
->n_div
;
3630 bmap
->extra
+= like
->n_div
;
3633 ltotal
= total
- bmap
->extra
+ like
->extra
;
3636 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3637 bmap
->extra
* (1 + 1 + total
));
3638 if (isl_blk_is_error(bmap
->block2
))
3640 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3644 for (i
= 0; i
< bmap
->extra
; ++i
)
3645 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3646 for (i
= 0; i
< like
->n_div
; ++i
) {
3647 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3648 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3650 bmap
= isl_basic_map_extend_constraints(bmap
,
3651 0, 2 * like
->n_div
);
3652 for (i
= 0; i
< like
->n_div
; ++i
) {
3653 if (isl_int_is_zero(bmap
->div
[i
][0]))
3655 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3659 isl_basic_map_free(like
);
3660 bmap
= isl_basic_map_simplify(bmap
);
3661 bmap
= isl_basic_map_finalize(bmap
);
3664 isl_basic_map_free(like
);
3665 isl_basic_set_free(bset
);
3669 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3670 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3672 return (struct isl_basic_set
*)
3673 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3676 struct isl_set
*isl_set_from_underlying_set(
3677 struct isl_set
*set
, struct isl_basic_set
*like
)
3683 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3685 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3686 isl_basic_set_free(like
);
3689 set
= isl_set_cow(set
);
3692 for (i
= 0; i
< set
->n
; ++i
) {
3693 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3694 isl_basic_set_copy(like
));
3698 isl_dim_free(set
->dim
);
3699 set
->dim
= isl_dim_copy(like
->dim
);
3702 isl_basic_set_free(like
);
3705 isl_basic_set_free(like
);
3710 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3714 map
= isl_map_cow(map
);
3717 map
->dim
= isl_dim_cow(map
->dim
);
3721 for (i
= 1; i
< map
->n
; ++i
)
3722 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3724 for (i
= 0; i
< map
->n
; ++i
) {
3725 map
->p
[i
] = (struct isl_basic_map
*)
3726 isl_basic_map_underlying_set(map
->p
[i
]);
3731 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3733 isl_dim_free(map
->dim
);
3734 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3738 return (struct isl_set
*)map
;
3744 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3746 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3749 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3750 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3752 bmap
= isl_basic_map_cow(bmap
);
3756 isl_dim_free(bmap
->dim
);
3759 bmap
= isl_basic_map_finalize(bmap
);
3763 isl_basic_map_free(bmap
);
3768 __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3769 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3771 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3775 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3776 __isl_take isl_dim
*dim
)
3780 map
= isl_map_cow(map
);
3784 for (i
= 0; i
< map
->n
; ++i
) {
3785 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3790 isl_dim_free(map
->dim
);
3800 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3801 __isl_take isl_dim
*dim
)
3803 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3806 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3809 struct isl_basic_set
*domain
;
3815 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3817 n_in
= isl_basic_map_n_in(bmap
);
3818 n_out
= isl_basic_map_n_out(bmap
);
3819 domain
= isl_basic_set_from_basic_map(bmap
);
3820 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3822 domain
= isl_basic_set_reset_dim(domain
, dim
);
3827 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3829 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3832 __isl_give isl_basic_map
*isl_basic_map_domain_map(
3833 __isl_take isl_basic_map
*bmap
)
3837 isl_basic_map
*domain
;
3838 isl_basic_set
*bset
;
3839 int nparam
, n_in
, n_out
;
3842 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3843 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3844 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3846 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
3847 domain
= isl_basic_map_universe(dim
);
3849 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3850 bmap
= isl_basic_map_apply_range(bmap
, domain
);
3851 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
3853 total
= isl_basic_map_total_dim(bmap
);
3855 for (i
= 0; i
< n_in
; ++i
) {
3856 k
= isl_basic_map_alloc_equality(bmap
);
3859 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3860 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
3861 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3864 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3865 return isl_basic_map_finalize(bmap
);
3867 isl_basic_map_free(bmap
);
3871 __isl_give isl_basic_map
*isl_basic_map_range_map(
3872 __isl_take isl_basic_map
*bmap
)
3876 isl_basic_map
*range
;
3877 isl_basic_set
*bset
;
3878 int nparam
, n_in
, n_out
;
3881 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3882 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3883 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3885 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
3886 range
= isl_basic_map_universe(dim
);
3888 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
3889 bmap
= isl_basic_map_apply_range(bmap
, range
);
3890 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
3892 total
= isl_basic_map_total_dim(bmap
);
3894 for (i
= 0; i
< n_out
; ++i
) {
3895 k
= isl_basic_map_alloc_equality(bmap
);
3898 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
3899 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
3900 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
3903 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3904 return isl_basic_map_finalize(bmap
);
3906 isl_basic_map_free(bmap
);
3910 struct isl_set
*isl_map_range(struct isl_map
*map
)
3913 struct isl_set
*set
;
3917 if (isl_map_dim(map
, isl_dim_in
) == 0)
3918 return (isl_set
*)map
;
3920 map
= isl_map_cow(map
);
3924 set
= (struct isl_set
*) map
;
3925 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3928 for (i
= 0; i
< map
->n
; ++i
) {
3929 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3933 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3934 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3941 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
3944 isl_dim
*domain_dim
;
3946 map
= isl_map_cow(map
);
3950 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
3951 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3952 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
3955 for (i
= 0; i
< map
->n
; ++i
) {
3956 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
3960 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3961 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3968 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
3973 map
= isl_map_cow(map
);
3977 range_dim
= isl_dim_range(isl_map_get_dim(map
));
3978 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
3979 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
3982 for (i
= 0; i
< map
->n
; ++i
) {
3983 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
3987 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3988 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3995 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3998 struct isl_map
*map
= NULL
;
4000 set
= isl_set_cow(set
);
4003 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
4004 map
= (struct isl_map
*)set
;
4005 for (i
= 0; i
< set
->n
; ++i
) {
4006 map
->p
[i
] = isl_basic_map_from_basic_set(
4007 set
->p
[i
], isl_dim_copy(dim
));
4011 isl_dim_free(map
->dim
);
4020 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4021 __isl_take isl_basic_set
*bset
)
4023 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4026 __isl_give isl_basic_map
*isl_basic_map_from_range(
4027 __isl_take isl_basic_set
*bset
)
4029 return (isl_basic_map
*)bset
;
4032 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4034 return (struct isl_map
*)set
;
4037 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4039 return isl_map_reverse(isl_map_from_range(set
));
4042 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4043 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4045 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain
),
4046 isl_basic_map_from_range(range
));
4049 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4050 __isl_take isl_set
*range
)
4052 return isl_map_apply_range(isl_map_from_domain(domain
),
4053 isl_map_from_range(range
));
4056 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4059 struct isl_set
*set
= NULL
;
4063 map
= isl_map_cow(map
);
4066 map
->dim
= isl_dim_as_set_dim(map
->dim
);
4069 set
= (struct isl_set
*)map
;
4070 for (i
= 0; i
< map
->n
; ++i
) {
4071 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4081 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
4083 struct isl_map
*map
;
4087 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4088 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4089 sizeof(struct isl_map
) +
4090 (n
- 1) * sizeof(struct isl_basic_map
*));
4094 map
->ctx
= dim
->ctx
;
4095 isl_ctx_ref(map
->ctx
);
4107 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4108 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4111 struct isl_map
*map
;
4112 struct isl_dim
*dims
;
4114 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4118 map
= isl_map_alloc_dim(dims
, n
, flags
);
4122 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4124 struct isl_basic_map
*bmap
;
4125 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4126 bmap
= isl_basic_map_set_to_empty(bmap
);
4130 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4132 struct isl_basic_set
*bset
;
4133 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4134 bset
= isl_basic_set_set_to_empty(bset
);
4138 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4140 struct isl_basic_map
*bmap
;
4143 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4144 bmap
= isl_basic_map_set_to_empty(bmap
);
4148 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4150 struct isl_basic_map
*bmap
;
4153 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4154 bmap
= isl_basic_map_set_to_empty(bmap
);
4158 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4160 struct isl_basic_set
*bset
;
4163 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4164 bset
= isl_basic_set_set_to_empty(bset
);
4168 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4170 struct isl_basic_map
*bmap
;
4171 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4172 bmap
= isl_basic_map_finalize(bmap
);
4176 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4178 struct isl_basic_set
*bset
;
4179 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4180 bset
= isl_basic_set_finalize(bset
);
4184 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_dim
*dim
)
4187 unsigned total
= isl_dim_total(dim
);
4188 isl_basic_map
*bmap
;
4190 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, total
);
4191 for (i
= 0; i
< total
; ++i
) {
4192 int k
= isl_basic_map_alloc_inequality(bmap
);
4195 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4196 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4200 isl_basic_map_free(bmap
);
4204 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_dim
*dim
)
4206 return isl_basic_map_nat_universe(dim
);
4209 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_dim
*dim
)
4211 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4214 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_dim
*dim
)
4216 return isl_map_nat_universe(dim
);
4219 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4220 __isl_keep isl_basic_map
*model
)
4224 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4227 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4231 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4234 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4235 __isl_keep isl_set
*model
)
4239 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4242 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4244 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4247 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4251 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4254 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4258 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4261 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4263 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4266 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4270 return isl_set_empty(isl_dim_copy(model
->dim
));
4273 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4275 struct isl_map
*map
;
4278 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4279 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4283 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4285 struct isl_set
*set
;
4288 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4289 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4293 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4297 return isl_set_universe(isl_dim_copy(model
->dim
));
4300 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4303 struct isl_map
*dup
;
4307 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4308 for (i
= 0; i
< map
->n
; ++i
)
4309 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4313 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4314 __isl_take isl_basic_map
*bmap
)
4318 if (isl_basic_map_fast_is_empty(bmap
)) {
4319 isl_basic_map_free(bmap
);
4322 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4323 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4324 map
->p
[map
->n
] = bmap
;
4326 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4332 isl_basic_map_free(bmap
);
4336 void isl_map_free(struct isl_map
*map
)
4346 isl_ctx_deref(map
->ctx
);
4347 for (i
= 0; i
< map
->n
; ++i
)
4348 isl_basic_map_free(map
->p
[i
]);
4349 isl_dim_free(map
->dim
);
4353 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4354 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4358 base
= isl_map_cow(base
);
4362 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4365 for (i
= 0; i
< base
->n
; ++i
) {
4366 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4367 isl_dim_copy(base
->dim
), 0, 0, 0);
4377 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4378 unsigned nparam
, unsigned dim
)
4380 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4384 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4385 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4389 bmap
= isl_basic_map_cow(bmap
);
4390 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4391 j
= isl_basic_map_alloc_equality(bmap
);
4394 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4395 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4396 isl_int_set_si(bmap
->eq
[j
][0], value
);
4397 bmap
= isl_basic_map_simplify(bmap
);
4398 return isl_basic_map_finalize(bmap
);
4400 isl_basic_map_free(bmap
);
4404 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4405 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4409 bmap
= isl_basic_map_cow(bmap
);
4410 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4411 j
= isl_basic_map_alloc_equality(bmap
);
4414 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4415 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4416 isl_int_set(bmap
->eq
[j
][0], value
);
4417 bmap
= isl_basic_map_simplify(bmap
);
4418 return isl_basic_map_finalize(bmap
);
4420 isl_basic_map_free(bmap
);
4424 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4425 enum isl_dim_type type
, unsigned pos
, int value
)
4429 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4430 return isl_basic_map_fix_pos_si(bmap
,
4431 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4433 isl_basic_map_free(bmap
);
4437 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4438 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4442 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4443 return isl_basic_map_fix_pos(bmap
,
4444 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4446 isl_basic_map_free(bmap
);
4450 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4451 enum isl_dim_type type
, unsigned pos
, int value
)
4453 return (struct isl_basic_set
*)
4454 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4458 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4459 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4461 return (struct isl_basic_set
*)
4462 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4466 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4467 unsigned input
, int value
)
4469 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4472 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4473 unsigned dim
, int value
)
4475 return (struct isl_basic_set
*)
4476 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4477 isl_dim_set
, dim
, value
);
4480 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4481 enum isl_dim_type type
, unsigned pos
, int value
)
4485 map
= isl_map_cow(map
);
4489 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4490 for (i
= 0; i
< map
->n
; ++i
) {
4491 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4495 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4502 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4503 enum isl_dim_type type
, unsigned pos
, int value
)
4505 return (struct isl_set
*)
4506 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4509 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4510 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4514 map
= isl_map_cow(map
);
4518 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4519 for (i
= 0; i
< map
->n
; ++i
) {
4520 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4524 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4531 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4532 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4534 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4537 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4538 unsigned input
, int value
)
4540 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4543 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4545 return (struct isl_set
*)
4546 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4549 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4550 __isl_take isl_basic_map
*bmap
,
4551 enum isl_dim_type type
, unsigned pos
, int value
)
4557 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4558 pos
+= isl_basic_map_offset(bmap
, type
);
4559 bmap
= isl_basic_map_cow(bmap
);
4560 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4561 j
= isl_basic_map_alloc_inequality(bmap
);
4564 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4565 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4566 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4567 bmap
= isl_basic_map_simplify(bmap
);
4568 return isl_basic_map_finalize(bmap
);
4570 isl_basic_map_free(bmap
);
4574 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4575 unsigned dim
, isl_int value
)
4579 bset
= isl_basic_set_cow(bset
);
4580 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4581 j
= isl_basic_set_alloc_inequality(bset
);
4584 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4585 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4586 isl_int_neg(bset
->ineq
[j
][0], value
);
4587 bset
= isl_basic_set_simplify(bset
);
4588 return isl_basic_set_finalize(bset
);
4590 isl_basic_set_free(bset
);
4594 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4595 enum isl_dim_type type
, unsigned pos
, int value
)
4599 map
= isl_map_cow(map
);
4603 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4604 for (i
= 0; i
< map
->n
; ++i
) {
4605 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4610 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4617 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4618 enum isl_dim_type type
, unsigned pos
, int value
)
4620 return (struct isl_set
*)
4621 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4624 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4629 set
= isl_set_cow(set
);
4633 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4634 for (i
= 0; i
< set
->n
; ++i
) {
4635 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4645 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4649 map
= isl_map_cow(map
);
4653 map
->dim
= isl_dim_reverse(map
->dim
);
4656 for (i
= 0; i
< map
->n
; ++i
) {
4657 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4661 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4668 static struct isl_map
*isl_basic_map_partial_lexopt(
4669 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4670 struct isl_set
**empty
, int max
)
4674 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4675 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4677 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4679 isl_basic_map_free(bmap
);
4680 isl_basic_set_free(dom
);
4686 struct isl_map
*isl_basic_map_partial_lexmax(
4687 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4688 struct isl_set
**empty
)
4690 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4693 struct isl_map
*isl_basic_map_partial_lexmin(
4694 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4695 struct isl_set
**empty
)
4697 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4700 struct isl_set
*isl_basic_set_partial_lexmin(
4701 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4702 struct isl_set
**empty
)
4704 return (struct isl_set
*)
4705 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4709 struct isl_set
*isl_basic_set_partial_lexmax(
4710 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4711 struct isl_set
**empty
)
4713 return (struct isl_set
*)
4714 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4718 /* Given a basic map "bmap", 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 make sure the basic sets in dom are disjoint and then
4723 * simply collect the results over each of the basic sets separately.
4724 * We could probably improve the efficiency a bit by moving the union
4725 * domain down into the parametric integer programming.
4727 static __isl_give isl_map
*basic_map_partial_lexopt(
4728 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4729 __isl_give isl_set
**empty
, int max
)
4732 struct isl_map
*res
;
4734 dom
= isl_set_make_disjoint(dom
);
4738 if (isl_set_fast_is_empty(dom
)) {
4739 res
= isl_map_empty_like_basic_map(bmap
);
4740 *empty
= isl_set_empty_like(dom
);
4742 isl_basic_map_free(bmap
);
4746 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4747 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4749 for (i
= 1; i
< dom
->n
; ++i
) {
4750 struct isl_map
*res_i
;
4751 struct isl_set
*empty_i
;
4753 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4754 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4756 res
= isl_map_union_disjoint(res
, res_i
);
4757 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4761 isl_basic_map_free(bmap
);
4766 isl_basic_map_free(bmap
);
4770 /* Given a map "map", compute the lexicographically minimal
4771 * (or maximal) image element for each domain element in dom.
4772 * Set *empty to those elements in dom that do not have an image element.
4774 * We first compute the lexicographically minimal or maximal element
4775 * in the first basic map. This results in a partial solution "res"
4776 * and a subset "todo" of dom that still need to be handled.
4777 * We then consider each of the remaining maps in "map" and successively
4778 * improve both "res" and "todo".
4780 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4781 * Assume we are computing the lexicographical maximum.
4782 * We first compute the lexicographically maximal element in basic map i.
4783 * This results in a partial solution res_i and a subset todo_i.
4784 * Then we combine these results with those obtain for the first k basic maps
4785 * to obtain a result that is valid for the first k+1 basic maps.
4786 * In particular, the set where there is no solution is the set where
4787 * there is no solution for the first k basic maps and also no solution
4788 * for the ith basic map, i.e.,
4790 * todo^i = todo^k * todo_i
4792 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4793 * solutions, arbitrarily breaking ties in favor of res^k.
4794 * That is, when res^k(a) >= res_i(a), we pick res^k and
4795 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4796 * the lexicographic order.)
4797 * In practice, we compute
4799 * res^k * (res_i . "<=")
4803 * res_i * (res^k . "<")
4805 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4806 * where only one of res^k and res_i provides a solution and we simply pick
4813 * Note that we only compute these intersections when dom(res^k) intersects
4814 * dom(res_i). Otherwise, the only effect of these intersections is to
4815 * potentially break up res^k and res_i into smaller pieces.
4816 * We want to avoid such splintering as much as possible.
4817 * In fact, an earlier implementation of this function would look for
4818 * better results in the domain of res^k and for extra results in todo^k,
4819 * but this would always result in a splintering according to todo^k,
4820 * even when the domain of basic map i is disjoint from the domains of
4821 * the previous basic maps.
4823 static __isl_give isl_map
*isl_map_partial_lexopt(
4824 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4825 __isl_give isl_set
**empty
, int max
)
4828 struct isl_map
*res
;
4829 struct isl_set
*todo
;
4834 if (isl_map_fast_is_empty(map
)) {
4842 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4843 isl_set_copy(dom
), &todo
, max
);
4845 for (i
= 1; i
< map
->n
; ++i
) {
4849 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
4851 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4852 isl_set_copy(dom
), &todo_i
, max
);
4855 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
4856 le
= isl_map_lex_le(dim
);
4858 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
4859 le
= isl_map_lex_ge(dim
);
4861 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4862 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
4863 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
4864 le
= isl_map_intersect(le
, isl_map_copy(res
));
4866 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
4867 res
= isl_map_intersect_domain(res
,
4868 isl_set_copy(todo_i
));
4869 res_i
= isl_map_intersect_domain(res_i
,
4870 isl_set_copy(todo
));
4873 res
= isl_map_union_disjoint(res
, res_i
);
4874 res
= isl_map_union_disjoint(res
, lt
);
4875 res
= isl_map_union_disjoint(res
, le
);
4877 todo
= isl_set_intersect(todo
, todo_i
);
4897 __isl_give isl_map
*isl_map_partial_lexmax(
4898 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4899 __isl_give isl_set
**empty
)
4901 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4904 __isl_give isl_map
*isl_map_partial_lexmin(
4905 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4906 __isl_give isl_set
**empty
)
4908 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4911 __isl_give isl_set
*isl_set_partial_lexmin(
4912 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4913 __isl_give isl_set
**empty
)
4915 return (struct isl_set
*)
4916 isl_map_partial_lexmin((struct isl_map
*)set
,
4920 __isl_give isl_set
*isl_set_partial_lexmax(
4921 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4922 __isl_give isl_set
**empty
)
4924 return (struct isl_set
*)
4925 isl_map_partial_lexmax((struct isl_map
*)set
,
4929 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4931 struct isl_basic_set
*dom
= NULL
;
4932 struct isl_dim
*dom_dim
;
4936 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4937 dom
= isl_basic_set_universe(dom_dim
);
4938 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4940 isl_basic_map_free(bmap
);
4944 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4946 return isl_basic_map_lexopt(bmap
, 0);
4949 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4951 return isl_basic_map_lexopt(bmap
, 1);
4954 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4956 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4959 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4961 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4964 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4966 struct isl_set
*dom
= NULL
;
4967 struct isl_dim
*dom_dim
;
4971 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4972 dom
= isl_set_universe(dom_dim
);
4973 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4979 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4981 return isl_map_lexopt(map
, 0);
4984 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4986 return isl_map_lexopt(map
, 1);
4989 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4991 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4994 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4996 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4999 /* Apply a preimage specified by "mat" on the parameters of "bset".
5000 * bset is assumed to have only parameters and divs.
5002 static struct isl_basic_set
*basic_set_parameter_preimage(
5003 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
5010 bset
->dim
= isl_dim_cow(bset
->dim
);
5014 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5016 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5018 bset
->dim
->nparam
= 0;
5019 bset
->dim
->n_out
= nparam
;
5020 bset
= isl_basic_set_preimage(bset
, mat
);
5022 bset
->dim
->nparam
= bset
->dim
->n_out
;
5023 bset
->dim
->n_out
= 0;
5028 isl_basic_set_free(bset
);
5032 /* Apply a preimage specified by "mat" on the parameters of "set".
5033 * set is assumed to have only parameters and divs.
5035 static struct isl_set
*set_parameter_preimage(
5036 struct isl_set
*set
, struct isl_mat
*mat
)
5038 struct isl_dim
*dim
= NULL
;
5044 dim
= isl_dim_copy(set
->dim
);
5045 dim
= isl_dim_cow(dim
);
5049 nparam
= isl_set_dim(set
, isl_dim_param
);
5051 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5054 dim
->n_out
= nparam
;
5055 isl_set_reset_dim(set
, dim
);
5056 set
= isl_set_preimage(set
, mat
);
5059 dim
= isl_dim_copy(set
->dim
);
5060 dim
= isl_dim_cow(dim
);
5063 dim
->nparam
= dim
->n_out
;
5065 isl_set_reset_dim(set
, dim
);
5075 /* Intersect the basic set "bset" with the affine space specified by the
5076 * equalities in "eq".
5078 static struct isl_basic_set
*basic_set_append_equalities(
5079 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5087 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
5092 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
5093 for (i
= 0; i
< eq
->n_row
; ++i
) {
5094 k
= isl_basic_set_alloc_equality(bset
);
5097 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5098 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5102 bset
= isl_basic_set_gauss(bset
, NULL
);
5103 bset
= isl_basic_set_finalize(bset
);
5108 isl_basic_set_free(bset
);
5112 /* Intersect the set "set" with the affine space specified by the
5113 * equalities in "eq".
5115 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5123 for (i
= 0; i
< set
->n
; ++i
) {
5124 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5137 /* Project the given basic set onto its parameter domain, possibly introducing
5138 * new, explicit, existential variables in the constraints.
5139 * The input has parameters and (possibly implicit) existential variables.
5140 * The output has the same parameters, but only
5141 * explicit existentially quantified variables.
5143 * The actual projection is performed by pip, but pip doesn't seem
5144 * to like equalities very much, so we first remove the equalities
5145 * among the parameters by performing a variable compression on
5146 * the parameters. Afterward, an inverse transformation is performed
5147 * and the equalities among the parameters are inserted back in.
5149 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5153 struct isl_mat
*T
, *T2
;
5154 struct isl_set
*set
;
5155 unsigned nparam
, n_div
;
5157 bset
= isl_basic_set_cow(bset
);
5161 if (bset
->n_eq
== 0)
5162 return isl_basic_set_lexmin(bset
);
5164 isl_basic_set_gauss(bset
, NULL
);
5166 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5167 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5169 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5170 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5173 if (i
== bset
->n_eq
)
5174 return isl_basic_set_lexmin(bset
);
5176 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5178 eq
= isl_mat_cow(eq
);
5179 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5180 if (T
&& T
->n_col
== 0) {
5184 bset
= isl_basic_set_set_to_empty(bset
);
5185 return isl_set_from_basic_set(bset
);
5187 bset
= basic_set_parameter_preimage(bset
, T
);
5189 set
= isl_basic_set_lexmin(bset
);
5190 set
= set_parameter_preimage(set
, T2
);
5191 set
= set_append_equalities(set
, eq
);
5195 /* Compute an explicit representation for all the existentially
5196 * quantified variables.
5197 * The input and output dimensions are first turned into parameters.
5198 * compute_divs then returns a map with the same parameters and
5199 * no input or output dimensions and the dimension specification
5200 * is reset to that of the input.
5202 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5204 struct isl_basic_set
*bset
;
5205 struct isl_set
*set
;
5206 struct isl_map
*map
;
5207 struct isl_dim
*dim
, *orig_dim
= NULL
;
5212 bmap
= isl_basic_map_cow(bmap
);
5216 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5217 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5218 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5219 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5223 orig_dim
= bmap
->dim
;
5225 bset
= (struct isl_basic_set
*)bmap
;
5227 set
= parameter_compute_divs(bset
);
5228 map
= (struct isl_map
*)set
;
5229 map
= isl_map_reset_dim(map
, orig_dim
);
5233 isl_basic_map_free(bmap
);
5237 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5245 off
= isl_dim_total(bmap
->dim
);
5246 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5247 if (isl_int_is_zero(bmap
->div
[i
][0]))
5249 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5255 static int map_divs_known(__isl_keep isl_map
*map
)
5262 for (i
= 0; i
< map
->n
; ++i
) {
5263 int known
= basic_map_divs_known(map
->p
[i
]);
5271 /* If bmap contains any unknown divs, then compute explicit
5272 * expressions for them. However, this computation may be
5273 * quite expensive, so first try to remove divs that aren't
5276 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5280 struct isl_map
*map
;
5282 known
= basic_map_divs_known(bmap
);
5286 return isl_map_from_basic_map(bmap
);
5288 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5290 known
= basic_map_divs_known(bmap
);
5294 return isl_map_from_basic_map(bmap
);
5296 map
= compute_divs(bmap
);
5299 isl_basic_map_free(bmap
);
5303 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5307 struct isl_map
*res
;
5314 known
= map_divs_known(map
);
5322 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5323 for (i
= 1 ; i
< map
->n
; ++i
) {
5325 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5326 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5327 res
= isl_map_union_disjoint(res
, r2
);
5329 res
= isl_map_union(res
, r2
);
5336 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5338 return (struct isl_set
*)
5339 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5342 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5344 return (struct isl_set
*)
5345 isl_map_compute_divs((struct isl_map
*)set
);
5348 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5351 struct isl_set
*set
;
5356 map
= isl_map_cow(map
);
5360 set
= (struct isl_set
*)map
;
5361 set
->dim
= isl_dim_domain(set
->dim
);
5364 for (i
= 0; i
< map
->n
; ++i
) {
5365 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5369 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5370 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5377 struct isl_map
*isl_map_union_disjoint(
5378 struct isl_map
*map1
, struct isl_map
*map2
)
5382 struct isl_map
*map
= NULL
;
5396 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5398 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5399 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5400 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5402 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5403 map1
->n
+ map2
->n
, flags
);
5406 for (i
= 0; i
< map1
->n
; ++i
) {
5407 map
= isl_map_add_basic_map(map
,
5408 isl_basic_map_copy(map1
->p
[i
]));
5412 for (i
= 0; i
< map2
->n
; ++i
) {
5413 map
= isl_map_add_basic_map(map
,
5414 isl_basic_map_copy(map2
->p
[i
]));
5428 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5430 map1
= isl_map_union_disjoint(map1
, map2
);
5434 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5438 struct isl_set
*isl_set_union_disjoint(
5439 struct isl_set
*set1
, struct isl_set
*set2
)
5441 return (struct isl_set
*)
5442 isl_map_union_disjoint(
5443 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5446 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5448 return (struct isl_set
*)
5449 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5452 struct isl_map
*isl_map_intersect_range(
5453 struct isl_map
*map
, struct isl_set
*set
)
5456 struct isl_map
*result
;
5462 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5463 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5464 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5466 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5467 map
->n
* set
->n
, flags
);
5470 for (i
= 0; i
< map
->n
; ++i
)
5471 for (j
= 0; j
< set
->n
; ++j
) {
5472 result
= isl_map_add_basic_map(result
,
5473 isl_basic_map_intersect_range(
5474 isl_basic_map_copy(map
->p
[i
]),
5475 isl_basic_set_copy(set
->p
[j
])));
5488 struct isl_map
*isl_map_intersect_domain(
5489 struct isl_map
*map
, struct isl_set
*set
)
5491 return isl_map_reverse(
5492 isl_map_intersect_range(isl_map_reverse(map
), set
));
5495 struct isl_map
*isl_map_apply_domain(
5496 struct isl_map
*map1
, struct isl_map
*map2
)
5500 map1
= isl_map_reverse(map1
);
5501 map1
= isl_map_apply_range(map1
, map2
);
5502 return isl_map_reverse(map1
);
5509 struct isl_map
*isl_map_apply_range(
5510 struct isl_map
*map1
, struct isl_map
*map2
)
5512 struct isl_dim
*dim_result
;
5513 struct isl_map
*result
;
5519 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5520 isl_dim_copy(map2
->dim
));
5522 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5525 for (i
= 0; i
< map1
->n
; ++i
)
5526 for (j
= 0; j
< map2
->n
; ++j
) {
5527 result
= isl_map_add_basic_map(result
,
5528 isl_basic_map_apply_range(
5529 isl_basic_map_copy(map1
->p
[i
]),
5530 isl_basic_map_copy(map2
->p
[j
])));
5536 if (result
&& result
->n
<= 1)
5537 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5546 * returns range - domain
5548 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5550 isl_dim
*dims
, *target_dim
;
5551 struct isl_basic_set
*bset
;
5558 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5559 bmap
->dim
, isl_dim_out
),
5561 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5562 dim
= isl_basic_map_n_in(bmap
);
5563 nparam
= isl_basic_map_n_param(bmap
);
5564 bset
= isl_basic_set_from_basic_map(bmap
);
5565 bset
= isl_basic_set_cow(bset
);
5566 dims
= isl_basic_set_get_dim(bset
);
5567 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5568 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5569 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5570 for (i
= 0; i
< dim
; ++i
) {
5571 int j
= isl_basic_map_alloc_equality(
5572 (struct isl_basic_map
*)bset
);
5575 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5576 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5577 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5578 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5580 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5581 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5584 isl_basic_map_free(bmap
);
5589 * returns range - domain
5591 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5595 struct isl_set
*result
;
5600 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5601 map
->dim
, isl_dim_out
),
5603 dim
= isl_map_get_dim(map
);
5604 dim
= isl_dim_domain(dim
);
5605 result
= isl_set_alloc_dim(dim
, map
->n
, 0);
5608 for (i
= 0; i
< map
->n
; ++i
)
5609 result
= isl_set_add_basic_set(result
,
5610 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5618 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5620 struct isl_basic_map
*bmap
;
5628 nparam
= dims
->nparam
;
5630 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5634 for (i
= 0; i
< dim
; ++i
) {
5635 int j
= isl_basic_map_alloc_equality(bmap
);
5638 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5639 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5640 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5642 return isl_basic_map_finalize(bmap
);
5644 isl_basic_map_free(bmap
);
5648 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_dim
*dim
)
5652 if (dim
->n_in
!= dim
->n_out
)
5653 isl_die(dim
->ctx
, isl_error_invalid
,
5654 "number of input and output dimensions needs to be "
5655 "the same", goto error
);
5656 return basic_map_identity(dim
);
5662 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5664 if (!model
|| !model
->dim
)
5666 return isl_basic_map_identity(isl_dim_copy(model
->dim
));
5669 __isl_give isl_map
*isl_map_identity(__isl_take isl_dim
*dim
)
5671 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
5674 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5676 if (!model
|| !model
->dim
)
5678 return isl_map_identity(isl_dim_copy(model
->dim
));
5681 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5683 if (!model
|| !model
->dim
)
5685 return isl_map_identity(isl_dim_copy(model
->dim
));
5688 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
5690 isl_dim
*dim
= isl_set_get_dim(set
);
5692 id
= isl_map_identity(isl_dim_map_from_set(dim
));
5693 return isl_map_intersect_range(id
, set
);
5696 /* Construct a basic set with all set dimensions having only non-negative
5699 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5704 struct isl_basic_set
*bset
;
5708 nparam
= dims
->nparam
;
5710 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5713 for (i
= 0; i
< dim
; ++i
) {
5714 int k
= isl_basic_set_alloc_inequality(bset
);
5717 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5718 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5722 isl_basic_set_free(bset
);
5726 /* Construct the half-space x_pos >= 0.
5728 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
5732 isl_basic_set
*nonneg
;
5734 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5735 k
= isl_basic_set_alloc_inequality(nonneg
);
5738 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5739 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
5741 return isl_basic_set_finalize(nonneg
);
5743 isl_basic_set_free(nonneg
);
5747 /* Construct the half-space x_pos <= -1.
5749 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
5754 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
5755 k
= isl_basic_set_alloc_inequality(neg
);
5758 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5759 isl_int_set_si(neg
->ineq
[k
][0], -1);
5760 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
5762 return isl_basic_set_finalize(neg
);
5764 isl_basic_set_free(neg
);
5768 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5769 enum isl_dim_type type
, unsigned first
, unsigned n
)
5772 isl_basic_set
*nonneg
;
5780 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5782 for (i
= 0; i
< n
; ++i
) {
5783 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
5784 pos(set
->dim
, type
) + first
+ i
);
5785 neg
= neg_halfspace(isl_set_get_dim(set
),
5786 pos(set
->dim
, type
) + first
+ i
);
5788 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5797 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
5798 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5805 if (isl_set_fast_is_empty(set
)) {
5810 return fn(set
, signs
, user
);
5813 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
5815 half
= isl_set_intersect(half
, isl_set_copy(set
));
5816 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
5820 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
5822 half
= isl_set_intersect(half
, set
);
5823 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
5829 /* Call "fn" on the intersections of "set" with each of the orthants
5830 * (except for obviously empty intersections). The orthant is identified
5831 * by the signs array, with each entry having value 1 or -1 according
5832 * to the sign of the corresponding variable.
5834 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
5835 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
5845 if (isl_set_fast_is_empty(set
))
5848 nparam
= isl_set_dim(set
, isl_dim_param
);
5849 nvar
= isl_set_dim(set
, isl_dim_set
);
5851 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
5853 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
5861 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5863 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5866 int isl_basic_map_is_subset(
5867 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5870 struct isl_map
*map1
;
5871 struct isl_map
*map2
;
5873 if (!bmap1
|| !bmap2
)
5876 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5877 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5879 is_subset
= isl_map_is_subset(map1
, map2
);
5887 int isl_basic_map_is_equal(
5888 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5892 if (!bmap1
|| !bmap2
)
5894 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5897 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5901 int isl_basic_set_is_equal(
5902 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5904 return isl_basic_map_is_equal(
5905 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5908 int isl_map_is_empty(struct isl_map
*map
)
5915 for (i
= 0; i
< map
->n
; ++i
) {
5916 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5925 int isl_map_fast_is_empty(struct isl_map
*map
)
5927 return map
? map
->n
== 0 : -1;
5930 int isl_set_fast_is_empty(struct isl_set
*set
)
5932 return set
? set
->n
== 0 : -1;
5935 int isl_set_is_empty(struct isl_set
*set
)
5937 return isl_map_is_empty((struct isl_map
*)set
);
5940 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5945 return isl_dim_equal(map1
->dim
, map2
->dim
);
5948 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5953 return isl_dim_equal(set1
->dim
, set2
->dim
);
5956 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5962 is_subset
= isl_map_is_subset(map1
, map2
);
5965 is_subset
= isl_map_is_subset(map2
, map1
);
5969 int isl_basic_map_is_strict_subset(
5970 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5974 if (!bmap1
|| !bmap2
)
5976 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5979 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5980 if (is_subset
== -1)
5985 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5991 is_subset
= isl_map_is_subset(map1
, map2
);
5994 is_subset
= isl_map_is_subset(map2
, map1
);
5995 if (is_subset
== -1)
6000 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6002 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
6005 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6009 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6012 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6016 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6019 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
6026 for (i
= 0; i
< map
->n
; ++i
) {
6027 int r
= isl_basic_map_is_universe(map
->p
[i
]);
6035 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6037 return isl_map_fast_is_universe((isl_map
*) set
);
6040 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6042 struct isl_basic_set
*bset
= NULL
;
6043 struct isl_vec
*sample
= NULL
;
6050 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6053 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6054 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6055 copy
= isl_basic_map_remove_redundancies(copy
);
6056 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6057 isl_basic_map_free(copy
);
6061 total
= 1 + isl_basic_map_total_dim(bmap
);
6062 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6063 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6069 isl_vec_free(bmap
->sample
);
6070 bmap
->sample
= NULL
;
6071 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6074 sample
= isl_basic_set_sample_vec(bset
);
6077 empty
= sample
->size
== 0;
6078 isl_vec_free(bmap
->sample
);
6079 bmap
->sample
= sample
;
6081 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6086 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
6090 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6093 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
6097 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6100 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6102 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6105 struct isl_map
*isl_basic_map_union(
6106 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6108 struct isl_map
*map
;
6109 if (!bmap1
|| !bmap2
)
6112 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6114 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6117 map
= isl_map_add_basic_map(map
, bmap1
);
6118 map
= isl_map_add_basic_map(map
, bmap2
);
6121 isl_basic_map_free(bmap1
);
6122 isl_basic_map_free(bmap2
);
6126 struct isl_set
*isl_basic_set_union(
6127 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6129 return (struct isl_set
*)isl_basic_map_union(
6130 (struct isl_basic_map
*)bset1
,
6131 (struct isl_basic_map
*)bset2
);
6134 /* Order divs such that any div only depends on previous divs */
6135 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6143 off
= isl_dim_total(bmap
->dim
);
6145 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6147 if (isl_int_is_zero(bmap
->div
[i
][0]))
6149 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6153 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6159 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6161 return (struct isl_basic_set
*)
6162 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6165 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6172 for (i
= 0; i
< map
->n
; ++i
) {
6173 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6184 /* Look for a div in dst that corresponds to the div "div" in src.
6185 * The divs before "div" in src and dst are assumed to be the same.
6187 * Returns -1 if no corresponding div was found and the position
6188 * of the corresponding div in dst otherwise.
6190 static int find_div(struct isl_basic_map
*dst
,
6191 struct isl_basic_map
*src
, unsigned div
)
6195 unsigned total
= isl_dim_total(src
->dim
);
6197 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6198 for (i
= div
; i
< dst
->n_div
; ++i
)
6199 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6200 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6201 dst
->n_div
- div
) == -1)
6206 struct isl_basic_map
*isl_basic_map_align_divs(
6207 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6210 unsigned total
= isl_dim_total(src
->dim
);
6215 if (src
->n_div
== 0)
6218 for (i
= 0; i
< src
->n_div
; ++i
)
6219 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6221 src
= isl_basic_map_order_divs(src
);
6222 dst
= isl_basic_map_cow(dst
);
6223 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6224 src
->n_div
, 0, 2 * src
->n_div
);
6227 for (i
= 0; i
< src
->n_div
; ++i
) {
6228 int j
= find_div(dst
, src
, i
);
6230 j
= isl_basic_map_alloc_div(dst
);
6233 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6234 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6235 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6239 isl_basic_map_swap_div(dst
, i
, j
);
6243 isl_basic_map_free(dst
);
6247 struct isl_basic_set
*isl_basic_set_align_divs(
6248 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6250 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6251 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6254 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6262 map
= isl_map_compute_divs(map
);
6263 map
= isl_map_cow(map
);
6267 for (i
= 1; i
< map
->n
; ++i
)
6268 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6269 for (i
= 1; i
< map
->n
; ++i
)
6270 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6272 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6276 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6278 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6281 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
6285 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6286 map
= isl_map_intersect_domain(map
, set
);
6287 set
= isl_map_range(map
);
6295 /* There is no need to cow as removing empty parts doesn't change
6296 * the meaning of the set.
6298 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6305 for (i
= map
->n
-1; i
>= 0; --i
) {
6306 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6308 isl_basic_map_free(map
->p
[i
]);
6309 if (i
!= map
->n
-1) {
6310 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6311 map
->p
[i
] = map
->p
[map
->n
-1];
6319 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6321 return (struct isl_set
*)
6322 isl_map_remove_empty_parts((struct isl_map
*)set
);
6325 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6327 struct isl_basic_map
*bmap
;
6328 if (!map
|| map
->n
== 0)
6330 bmap
= map
->p
[map
->n
-1];
6331 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6332 return isl_basic_map_copy(bmap
);
6335 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6337 return (struct isl_basic_set
*)
6338 isl_map_copy_basic_map((struct isl_map
*)set
);
6341 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6342 __isl_keep isl_basic_map
*bmap
)
6348 for (i
= map
->n
-1; i
>= 0; --i
) {
6349 if (map
->p
[i
] != bmap
)
6351 map
= isl_map_cow(map
);
6354 isl_basic_map_free(map
->p
[i
]);
6355 if (i
!= map
->n
-1) {
6356 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6357 map
->p
[i
] = map
->p
[map
->n
-1];
6368 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6369 struct isl_basic_set
*bset
)
6371 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6372 (struct isl_basic_map
*)bset
);
6375 /* Given two basic sets bset1 and bset2, compute the maximal difference
6376 * between the values of dimension pos in bset1 and those in bset2
6377 * for any common value of the parameters and dimensions preceding pos.
6379 static enum isl_lp_result
basic_set_maximal_difference_at(
6380 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6381 int pos
, isl_int
*opt
)
6383 struct isl_dim
*dims
;
6384 struct isl_basic_map
*bmap1
= NULL
;
6385 struct isl_basic_map
*bmap2
= NULL
;
6386 struct isl_ctx
*ctx
;
6387 struct isl_vec
*obj
;
6390 unsigned dim1
, dim2
;
6391 enum isl_lp_result res
;
6393 if (!bset1
|| !bset2
)
6394 return isl_lp_error
;
6396 nparam
= isl_basic_set_n_param(bset1
);
6397 dim1
= isl_basic_set_n_dim(bset1
);
6398 dim2
= isl_basic_set_n_dim(bset2
);
6399 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6400 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6401 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6402 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6403 if (!bmap1
|| !bmap2
)
6405 bmap1
= isl_basic_map_cow(bmap1
);
6406 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6407 pos
, (dim1
- pos
) + (dim2
- pos
),
6408 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6409 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6412 total
= isl_basic_map_total_dim(bmap1
);
6414 obj
= isl_vec_alloc(ctx
, 1 + total
);
6415 isl_seq_clr(obj
->block
.data
, 1 + total
);
6416 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6417 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6420 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6422 isl_basic_map_free(bmap1
);
6426 isl_basic_map_free(bmap1
);
6427 isl_basic_map_free(bmap2
);
6428 return isl_lp_error
;
6431 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6432 * for any common value of the parameters and dimensions preceding pos
6433 * in both basic sets, the values of dimension pos in bset1 are
6434 * smaller or larger than those in bset2.
6437 * 1 if bset1 follows bset2
6438 * -1 if bset1 precedes bset2
6439 * 0 if bset1 and bset2 are incomparable
6440 * -2 if some error occurred.
6442 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6443 struct isl_basic_set
*bset2
, int pos
)
6446 enum isl_lp_result res
;
6451 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6453 if (res
== isl_lp_empty
)
6455 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6456 res
== isl_lp_unbounded
)
6458 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6467 /* Given two basic sets bset1 and bset2, check whether
6468 * for any common value of the parameters and dimensions preceding pos
6469 * there is a value of dimension pos in bset1 that is larger
6470 * than a value of the same dimension in bset2.
6473 * 1 if there exists such a pair
6474 * 0 if there is no such pair, but there is a pair of equal values
6476 * -2 if some error occurred.
6478 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
6479 __isl_keep isl_basic_set
*bset2
, int pos
)
6482 enum isl_lp_result res
;
6487 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6489 if (res
== isl_lp_empty
)
6491 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6492 res
== isl_lp_unbounded
)
6494 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6496 else if (res
== isl_lp_ok
)
6505 /* Given two sets set1 and set2, check whether
6506 * for any common value of the parameters and dimensions preceding pos
6507 * there is a value of dimension pos in set1 that is larger
6508 * than a value of the same dimension in set2.
6511 * 1 if there exists such a pair
6512 * 0 if there is no such pair, but there is a pair of equal values
6514 * -2 if some error occurred.
6516 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6517 __isl_keep isl_set
*set2
, int pos
)
6525 for (i
= 0; i
< set1
->n
; ++i
)
6526 for (j
= 0; j
< set2
->n
; ++j
) {
6528 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6529 if (f
== 1 || f
== -2)
6538 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6539 unsigned pos
, isl_int
*val
)
6547 total
= isl_basic_map_total_dim(bmap
);
6548 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6549 for (; d
+1 > pos
; --d
)
6550 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6554 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6556 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6558 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6561 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6567 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6568 unsigned pos
, isl_int
*val
)
6580 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6583 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6584 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6585 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6586 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6590 isl_int_set(*val
, v
);
6596 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6597 unsigned pos
, isl_int
*val
)
6599 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6603 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6606 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6609 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6610 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6612 if (pos
>= isl_basic_map_dim(bmap
, type
))
6614 return isl_basic_map_fast_has_fixed_var(bmap
,
6615 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6618 int isl_map_fast_is_fixed(struct isl_map
*map
,
6619 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6621 if (pos
>= isl_map_dim(map
, type
))
6623 return isl_map_fast_has_fixed_var(map
,
6624 map_offset(map
, type
) - 1 + pos
, val
);
6627 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6628 * then return this fixed value in *val.
6630 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6633 return isl_basic_set_fast_has_fixed_var(bset
,
6634 isl_basic_set_n_param(bset
) + dim
, val
);
6637 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6638 * then return this fixed value in *val.
6640 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6642 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6645 /* Check if input variable in has fixed value and if so and if val is not NULL,
6646 * then return this fixed value in *val.
6648 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6650 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6653 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6654 * and if val is not NULL, then return this lower bound in *val.
6656 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6657 unsigned dim
, isl_int
*val
)
6659 int i
, i_eq
= -1, i_ineq
= -1;
6666 total
= isl_basic_set_total_dim(bset
);
6667 nparam
= isl_basic_set_n_param(bset
);
6668 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6669 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6675 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6676 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6678 if (i_eq
!= -1 || i_ineq
!= -1)
6682 if (i_eq
== -1 && i_ineq
== -1)
6684 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6685 /* The coefficient should always be one due to normalization. */
6686 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6688 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6690 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6691 total
- nparam
- dim
- 1) != -1)
6694 isl_int_neg(*val
, c
[0]);
6698 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6699 unsigned dim
, isl_int
*val
)
6711 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6715 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6717 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6718 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6720 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6724 isl_int_set(*val
, v
);
6735 /* uset_gist depends on constraints without existentially quantified
6736 * variables sorting first.
6738 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6740 const struct constraint
*c1
= (const struct constraint
*)p1
;
6741 const struct constraint
*c2
= (const struct constraint
*)p2
;
6743 unsigned size
= isl_min(c1
->size
, c2
->size
);
6745 l1
= isl_seq_last_non_zero(c1
->c
, size
);
6746 l2
= isl_seq_last_non_zero(c2
->c
, size
);
6751 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6754 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6755 struct isl_basic_map
*bmap
)
6758 struct constraint
*c
;
6763 total
= isl_basic_map_total_dim(bmap
);
6764 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6767 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6769 c
[i
].c
= bmap
->ineq
[i
];
6771 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6772 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6773 bmap
->ineq
[i
] = c
[i
].c
;
6777 isl_basic_map_free(bmap
);
6781 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6782 __isl_take isl_basic_set
*bset
)
6784 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6785 (struct isl_basic_map
*)bset
);
6788 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6792 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6794 bmap
= isl_basic_map_remove_redundancies(bmap
);
6795 bmap
= isl_basic_map_sort_constraints(bmap
);
6796 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6800 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6802 return (struct isl_basic_set
*)isl_basic_map_normalize(
6803 (struct isl_basic_map
*)bset
);
6806 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6807 const __isl_keep isl_basic_map
*bmap2
)
6814 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
6815 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
6816 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
6817 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6818 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6819 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6820 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6821 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6822 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6823 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6824 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6826 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6828 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6830 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6831 return bmap1
->n_eq
- bmap2
->n_eq
;
6832 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6833 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6834 if (bmap1
->n_div
!= bmap2
->n_div
)
6835 return bmap1
->n_div
- bmap2
->n_div
;
6836 total
= isl_basic_map_total_dim(bmap1
);
6837 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6838 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6842 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6843 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6847 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6848 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6855 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6856 __isl_keep isl_basic_map
*bmap2
)
6858 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6861 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6862 __isl_keep isl_basic_set
*bset2
)
6864 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6865 (isl_basic_map
*)bset2
);
6868 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6870 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6871 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6873 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6876 /* We normalize in place, but if anything goes wrong we need
6877 * to return NULL, so we need to make sure we don't change the
6878 * meaning of any possible other copies of map.
6880 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6883 struct isl_basic_map
*bmap
;
6887 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6889 for (i
= 0; i
< map
->n
; ++i
) {
6890 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6893 isl_basic_map_free(map
->p
[i
]);
6896 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6897 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6898 map
= isl_map_remove_empty_parts(map
);
6901 for (i
= map
->n
- 1; i
>= 1; --i
) {
6902 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6904 isl_basic_map_free(map
->p
[i
-1]);
6905 for (j
= i
; j
< map
->n
; ++j
)
6906 map
->p
[j
-1] = map
->p
[j
];
6916 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6918 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6921 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6931 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6934 map1
= isl_map_copy(map1
);
6935 map2
= isl_map_copy(map2
);
6936 map1
= isl_map_normalize(map1
);
6937 map2
= isl_map_normalize(map2
);
6940 equal
= map1
->n
== map2
->n
;
6941 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6942 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6955 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6957 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6958 (struct isl_map
*)set2
);
6961 /* Return an interval that ranges from min to max (inclusive)
6963 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6964 isl_int min
, isl_int max
)
6967 struct isl_basic_set
*bset
= NULL
;
6969 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6973 k
= isl_basic_set_alloc_inequality(bset
);
6976 isl_int_set_si(bset
->ineq
[k
][1], 1);
6977 isl_int_neg(bset
->ineq
[k
][0], min
);
6979 k
= isl_basic_set_alloc_inequality(bset
);
6982 isl_int_set_si(bset
->ineq
[k
][1], -1);
6983 isl_int_set(bset
->ineq
[k
][0], max
);
6987 isl_basic_set_free(bset
);
6991 /* Return the Cartesian product of the basic sets in list (in the given order).
6993 __isl_give isl_basic_set
*isl_basic_set_list_product(
6994 __isl_take
struct isl_basic_set_list
*list
)
7002 struct isl_basic_set
*product
= NULL
;
7006 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
7007 isl_assert(list
->ctx
, list
->p
[0], goto error
);
7008 nparam
= isl_basic_set_n_param(list
->p
[0]);
7009 dim
= isl_basic_set_n_dim(list
->p
[0]);
7010 extra
= list
->p
[0]->n_div
;
7011 n_eq
= list
->p
[0]->n_eq
;
7012 n_ineq
= list
->p
[0]->n_ineq
;
7013 for (i
= 1; i
< list
->n
; ++i
) {
7014 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
7015 isl_assert(list
->ctx
,
7016 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
7017 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7018 extra
+= list
->p
[i
]->n_div
;
7019 n_eq
+= list
->p
[i
]->n_eq
;
7020 n_ineq
+= list
->p
[i
]->n_ineq
;
7022 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
7027 for (i
= 0; i
< list
->n
; ++i
) {
7028 isl_basic_set_add_constraints(product
,
7029 isl_basic_set_copy(list
->p
[i
]), dim
);
7030 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7032 isl_basic_set_list_free(list
);
7035 isl_basic_set_free(product
);
7036 isl_basic_set_list_free(list
);
7040 struct isl_basic_map
*isl_basic_map_product(
7041 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7043 struct isl_dim
*dim_result
= NULL
;
7044 struct isl_basic_map
*bmap
;
7045 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
7046 struct isl_dim_map
*dim_map1
, *dim_map2
;
7048 if (!bmap1
|| !bmap2
)
7051 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
7052 bmap2
->dim
, isl_dim_param
), goto error
);
7053 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
7054 isl_dim_copy(bmap2
->dim
));
7056 in1
= isl_basic_map_n_in(bmap1
);
7057 in2
= isl_basic_map_n_in(bmap2
);
7058 out1
= isl_basic_map_n_out(bmap1
);
7059 out2
= isl_basic_map_n_out(bmap2
);
7060 nparam
= isl_basic_map_n_param(bmap1
);
7062 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7063 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7064 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7065 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7066 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7067 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7068 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7069 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7070 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7071 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7072 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7074 bmap
= isl_basic_map_alloc_dim(dim_result
,
7075 bmap1
->n_div
+ bmap2
->n_div
,
7076 bmap1
->n_eq
+ bmap2
->n_eq
,
7077 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7078 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7079 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7080 bmap
= isl_basic_map_simplify(bmap
);
7081 return isl_basic_map_finalize(bmap
);
7083 isl_basic_map_free(bmap1
);
7084 isl_basic_map_free(bmap2
);
7088 __isl_give isl_basic_map
*isl_basic_map_flat_product(
7089 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7091 isl_basic_map
*prod
;
7093 prod
= isl_basic_map_product(bmap1
, bmap2
);
7094 prod
= isl_basic_map_flatten(prod
);
7098 __isl_give isl_basic_set
*isl_basic_set_flat_product(
7099 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
7101 return isl_basic_map_flat_product(bset1
, bset2
);
7104 __isl_give isl_basic_map
*isl_basic_map_range_product(
7105 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7107 isl_dim
*dim_result
= NULL
;
7108 isl_basic_map
*bmap
;
7109 unsigned in
, out1
, out2
, nparam
, total
, pos
;
7110 struct isl_dim_map
*dim_map1
, *dim_map2
;
7112 if (!bmap1
|| !bmap2
)
7115 dim_result
= isl_dim_range_product(isl_dim_copy(bmap1
->dim
),
7116 isl_dim_copy(bmap2
->dim
));
7118 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7119 out1
= isl_basic_map_n_out(bmap1
);
7120 out2
= isl_basic_map_n_out(bmap2
);
7121 nparam
= isl_basic_map_n_param(bmap1
);
7123 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7124 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7125 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7126 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7127 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7128 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7129 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
7130 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
7131 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7132 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7133 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7135 bmap
= isl_basic_map_alloc_dim(dim_result
,
7136 bmap1
->n_div
+ bmap2
->n_div
,
7137 bmap1
->n_eq
+ bmap2
->n_eq
,
7138 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7139 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7140 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7141 bmap
= isl_basic_map_simplify(bmap
);
7142 return isl_basic_map_finalize(bmap
);
7144 isl_basic_map_free(bmap1
);
7145 isl_basic_map_free(bmap2
);
7149 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
7150 __isl_take isl_map
*map2
,
7151 __isl_give isl_dim
*(*dim_product
)(__isl_take isl_dim
*left
,
7152 __isl_take isl_dim
*right
),
7153 __isl_give isl_basic_map
*(*basic_map_product
)(
7154 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
7157 struct isl_map
*result
;
7163 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7164 map2
->dim
, isl_dim_param
), goto error
);
7166 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7167 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7168 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7170 result
= isl_map_alloc_dim(dim_product(isl_dim_copy(map1
->dim
),
7171 isl_dim_copy(map2
->dim
)),
7172 map1
->n
* map2
->n
, flags
);
7175 for (i
= 0; i
< map1
->n
; ++i
)
7176 for (j
= 0; j
< map2
->n
; ++j
) {
7177 struct isl_basic_map
*part
;
7178 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
7179 isl_basic_map_copy(map2
->p
[j
]));
7180 if (isl_basic_map_is_empty(part
))
7181 isl_basic_map_free(part
);
7183 result
= isl_map_add_basic_map(result
, part
);
7196 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7198 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
7200 return map_product(map1
, map2
, &isl_dim_product
, &isl_basic_map_product
);
7203 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7205 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7206 __isl_take isl_map
*map2
)
7210 prod
= isl_map_product(map1
, map2
);
7211 prod
= isl_map_flatten(prod
);
7215 /* Given two set A and B, construct its Cartesian product A x B.
7217 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7219 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
7220 (struct isl_map
*)set2
);
7223 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7224 __isl_take isl_set
*set2
)
7226 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
7229 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7231 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
7232 __isl_take isl_map
*map2
)
7234 return map_product(map1
, map2
, &isl_dim_range_product
,
7235 &isl_basic_map_range_product
);
7238 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7241 uint32_t hash
= isl_hash_init();
7246 bmap
= isl_basic_map_copy(bmap
);
7247 bmap
= isl_basic_map_normalize(bmap
);
7250 total
= isl_basic_map_total_dim(bmap
);
7251 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7252 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7254 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7255 isl_hash_hash(hash
, c_hash
);
7257 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7258 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7260 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7261 isl_hash_hash(hash
, c_hash
);
7263 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7264 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7266 if (isl_int_is_zero(bmap
->div
[i
][0]))
7268 isl_hash_byte(hash
, i
& 0xFF);
7269 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7270 isl_hash_hash(hash
, c_hash
);
7272 isl_basic_map_free(bmap
);
7276 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7278 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7281 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7288 map
= isl_map_copy(map
);
7289 map
= isl_map_normalize(map
);
7293 hash
= isl_hash_init();
7294 for (i
= 0; i
< map
->n
; ++i
) {
7296 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7297 isl_hash_hash(hash
, bmap_hash
);
7305 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7307 return isl_map_get_hash((isl_map
*)set
);
7310 /* Check if the value for dimension dim is completely determined
7311 * by the values of the other parameters and variables.
7312 * That is, check if dimension dim is involved in an equality.
7314 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7321 nparam
= isl_basic_set_n_param(bset
);
7322 for (i
= 0; i
< bset
->n_eq
; ++i
)
7323 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7328 /* Check if the value for dimension dim is completely determined
7329 * by the values of the other parameters and variables.
7330 * That is, check if dimension dim is involved in an equality
7331 * for each of the subsets.
7333 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7339 for (i
= 0; i
< set
->n
; ++i
) {
7341 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7348 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7350 return set
? set
->n
: 0;
7353 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7354 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7361 for (i
= 0; i
< map
->n
; ++i
)
7362 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7368 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7369 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7376 for (i
= 0; i
< set
->n
; ++i
)
7377 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7383 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7385 struct isl_dim
*dim
;
7390 bset
= isl_basic_set_cow(bset
);
7394 dim
= isl_basic_set_get_dim(bset
);
7395 dim
= isl_dim_lift(dim
, bset
->n_div
);
7398 isl_dim_free(bset
->dim
);
7400 bset
->extra
-= bset
->n_div
;
7403 bset
= isl_basic_set_finalize(bset
);
7407 isl_basic_set_free(bset
);
7411 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
7414 struct isl_dim
*dim
;
7417 set
= isl_set_align_divs(set
);
7422 set
= isl_set_cow(set
);
7426 n_div
= set
->p
[0]->n_div
;
7427 dim
= isl_set_get_dim(set
);
7428 dim
= isl_dim_lift(dim
, n_div
);
7431 isl_dim_free(set
->dim
);
7434 for (i
= 0; i
< set
->n
; ++i
) {
7435 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
7446 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
7448 struct isl_dim
*dim
;
7449 struct isl_basic_map
*bmap
;
7456 set
= isl_set_align_divs(set
);
7461 dim
= isl_set_get_dim(set
);
7462 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
7464 return isl_map_identity(isl_dim_map_from_set(dim
));
7467 n_div
= set
->p
[0]->n_div
;
7468 dim
= isl_dim_map_from_set(dim
);
7469 n_param
= isl_dim_size(dim
, isl_dim_param
);
7470 n_set
= isl_dim_size(dim
, isl_dim_in
);
7471 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
7472 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
7473 for (i
= 0; i
< n_set
; ++i
)
7474 bmap
= var_equal(bmap
, i
);
7476 total
= n_param
+ n_set
+ n_set
+ n_div
;
7477 for (i
= 0; i
< n_div
; ++i
) {
7478 k
= isl_basic_map_alloc_inequality(bmap
);
7481 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
7482 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
7483 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
7484 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
7485 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
7486 set
->p
[0]->div
[i
][0]);
7488 l
= isl_basic_map_alloc_inequality(bmap
);
7491 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
7492 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
7493 set
->p
[0]->div
[i
][0]);
7494 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
7498 bmap
= isl_basic_map_simplify(bmap
);
7499 bmap
= isl_basic_map_finalize(bmap
);
7500 return isl_map_from_basic_map(bmap
);
7503 isl_basic_map_free(bmap
);
7507 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
7515 dim
= isl_basic_set_total_dim(bset
);
7516 size
+= bset
->n_eq
* (1 + dim
);
7517 size
+= bset
->n_ineq
* (1 + dim
);
7518 size
+= bset
->n_div
* (2 + dim
);
7523 int isl_set_size(__isl_keep isl_set
*set
)
7531 for (i
= 0; i
< set
->n
; ++i
)
7532 size
+= isl_basic_set_size(set
->p
[i
]);
7537 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
7538 enum isl_dim_type type
, unsigned pos
)
7546 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
7548 pos
+= isl_basic_map_offset(bmap
, type
);
7550 for (i
= 0; i
< bmap
->n_eq
; ++i
)
7551 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
7555 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7556 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
7563 return lower
&& upper
;
7566 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
7567 enum isl_dim_type type
, unsigned pos
)
7574 for (i
= 0; i
< map
->n
; ++i
) {
7576 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
7577 if (bounded
< 0 || !bounded
)
7584 /* Return 1 if the specified dim is involved in both an upper bound
7585 * and a lower bound.
7587 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
7588 enum isl_dim_type type
, unsigned pos
)
7590 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
7593 /* For each of the "n" variables starting at "first", determine
7594 * the sign of the variable and put the results in the first "n"
7595 * elements of the array "signs".
7597 * 1 means that the variable is non-negative
7598 * -1 means that the variable is non-positive
7599 * 0 means the variable attains both positive and negative values.
7601 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
7602 unsigned first
, unsigned n
, int *signs
)
7604 isl_vec
*bound
= NULL
;
7605 struct isl_tab
*tab
= NULL
;
7606 struct isl_tab_undo
*snap
;
7609 if (!bset
|| !signs
)
7612 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
7613 tab
= isl_tab_from_basic_set(bset
);
7617 isl_seq_clr(bound
->el
, bound
->size
);
7618 isl_int_set_si(bound
->el
[0], -1);
7620 snap
= isl_tab_snap(tab
);
7621 for (i
= 0; i
< n
; ++i
) {
7624 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7625 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7628 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7629 if (isl_tab_rollback(tab
, snap
) < 0)
7637 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7638 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7641 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7642 if (isl_tab_rollback(tab
, snap
) < 0)
7645 signs
[i
] = empty
? -1 : 0;
7649 isl_vec_free(bound
);
7653 isl_vec_free(bound
);
7657 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7658 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7660 if (!bset
|| !signs
)
7662 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7665 first
+= pos(bset
->dim
, type
) - 1;
7666 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7669 /* Check if the given basic map is obviously single-valued.
7670 * In particular, for each output dimension, check that there is
7671 * an equality that defines the output dimension in terms of
7672 * earlier dimensions.
7674 int isl_basic_map_fast_is_single_valued(__isl_keep isl_basic_map
*bmap
)
7684 total
= 1 + isl_basic_map_total_dim(bmap
);
7685 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7686 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
7688 for (i
= 0; i
< n_out
; ++i
) {
7689 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
7690 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
7692 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
7693 total
- (o_out
+ i
+ 1)) == -1)
7696 if (j
>= bmap
->n_eq
)
7703 /* Check if the given map is obviously single-valued.
7705 int isl_map_fast_is_single_valued(__isl_keep isl_map
*map
)
7716 return isl_basic_map_fast_is_single_valued(map
->p
[0]);
7719 /* Check if the given map is single-valued.
7724 * and check if the result is a subset of the identity mapping.
7726 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7733 sv
= isl_map_fast_is_single_valued(map
);
7737 test
= isl_map_reverse(isl_map_copy(map
));
7738 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7740 dim
= isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map
)));
7741 id
= isl_map_identity(dim
);
7743 sv
= isl_map_is_subset(test
, id
);
7751 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7755 sv
= isl_map_is_single_valued(map
);
7759 map
= isl_map_copy(map
);
7760 map
= isl_map_reverse(map
);
7761 sv
= isl_map_is_single_valued(map
);
7767 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7769 return isl_map_is_single_valued((isl_map
*)set
);
7772 int isl_map_is_translation(__isl_keep isl_map
*map
)
7777 delta
= isl_map_deltas(isl_map_copy(map
));
7778 ok
= isl_set_is_singleton(delta
);
7779 isl_set_free(delta
);
7784 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7786 if (isl_seq_first_non_zero(p
, pos
) != -1)
7788 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7793 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7802 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7805 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7806 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7807 for (j
= 0; j
< nvar
; ++j
) {
7808 int lower
= 0, upper
= 0;
7809 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7810 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7812 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7818 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7819 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7821 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7823 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7828 if (!lower
|| !upper
)
7835 int isl_set_is_box(__isl_keep isl_set
*set
)
7842 return isl_basic_set_is_box(set
->p
[0]);
7845 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7850 return isl_dim_is_wrapping(bset
->dim
);
7853 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7858 return isl_dim_is_wrapping(set
->dim
);
7861 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7863 bmap
= isl_basic_map_cow(bmap
);
7867 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7871 bmap
= isl_basic_map_finalize(bmap
);
7873 return (isl_basic_set
*)bmap
;
7875 isl_basic_map_free(bmap
);
7879 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7883 map
= isl_map_cow(map
);
7887 for (i
= 0; i
< map
->n
; ++i
) {
7888 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7892 map
->dim
= isl_dim_wrap(map
->dim
);
7896 return (isl_set
*)map
;
7902 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7904 bset
= isl_basic_set_cow(bset
);
7908 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7912 bset
= isl_basic_set_finalize(bset
);
7914 return (isl_basic_map
*)bset
;
7916 isl_basic_set_free(bset
);
7920 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7927 if (!isl_set_is_wrapping(set
))
7928 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7931 set
= isl_set_cow(set
);
7935 for (i
= 0; i
< set
->n
; ++i
) {
7936 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7941 set
->dim
= isl_dim_unwrap(set
->dim
);
7945 return (isl_map
*)set
;
7951 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7952 enum isl_dim_type type
)
7957 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7960 bmap
= isl_basic_map_cow(bmap
);
7964 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7968 bmap
= isl_basic_map_finalize(bmap
);
7972 isl_basic_map_free(bmap
);
7976 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7977 enum isl_dim_type type
)
7984 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7987 map
= isl_map_cow(map
);
7991 for (i
= 0; i
< map
->n
; ++i
) {
7992 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7996 map
->dim
= isl_dim_reset(map
->dim
, type
);
8006 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
8011 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
8014 bmap
= isl_basic_map_cow(bmap
);
8018 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
8022 bmap
= isl_basic_map_finalize(bmap
);
8026 isl_basic_map_free(bmap
);
8030 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
8032 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
8035 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
8042 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
8045 map
= isl_map_cow(map
);
8049 for (i
= 0; i
< map
->n
; ++i
) {
8050 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
8054 map
->dim
= isl_dim_flatten(map
->dim
);
8064 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
8066 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
8069 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
8071 isl_dim
*dim
, *flat_dim
;
8074 dim
= isl_set_get_dim(set
);
8075 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
8076 map
= isl_map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
8077 map
= isl_map_intersect_domain(map
, set
);
8082 /* Extend the given dim_map with mappings for the divs in bmap.
8084 static __isl_give
struct isl_dim_map
*extend_dim_map(
8085 __isl_keep
struct isl_dim_map
*dim_map
,
8086 __isl_keep isl_basic_map
*bmap
)
8089 struct isl_dim_map
*res
;
8092 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
8094 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
8098 for (i
= 0; i
< dim_map
->len
; ++i
)
8099 res
->pos
[i
] = dim_map
->pos
[i
];
8100 for (i
= 0; i
< bmap
->n_div
; ++i
)
8101 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
8106 /* Extract a dim_map from a reordering.
8107 * We essentially need to reverse the mapping, and add an offset
8108 * of 1 for the constant term.
8110 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
8111 __isl_keep isl_reordering
*exp
)
8114 struct isl_dim_map
*dim_map
;
8119 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
8123 for (i
= 0; i
< exp
->len
; ++i
)
8124 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
8129 /* Reorder the dimensions of "bmap" according to the given dim_map
8130 * and set the dimension specification to "dim".
8132 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
8133 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
8137 bmap
= isl_basic_map_cow(bmap
);
8138 if (!bmap
|| !dim
|| !dim_map
)
8141 res
= isl_basic_map_alloc_dim(dim
,
8142 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8143 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
8144 res
= isl_basic_map_finalize(res
);
8148 isl_basic_map_free(bmap
);
8153 /* Reorder the dimensions of "map" according to given reordering.
8155 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8156 __isl_take isl_reordering
*r
)
8159 struct isl_dim_map
*dim_map
;
8161 map
= isl_map_cow(map
);
8162 dim_map
= isl_dim_map_from_reordering(r
);
8163 if (!map
|| !r
|| !dim_map
)
8166 for (i
= 0; i
< map
->n
; ++i
) {
8167 struct isl_dim_map
*dim_map_i
;
8169 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
8171 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8172 isl_dim_copy(r
->dim
), dim_map_i
);
8178 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8180 isl_reordering_free(r
);
8186 isl_reordering_free(r
);
8190 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8191 __isl_take isl_reordering
*r
)
8193 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8196 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8197 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8198 enum isl_dim_type c2
, enum isl_dim_type c3
,
8199 enum isl_dim_type c4
, enum isl_dim_type c5
)
8201 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8202 struct isl_mat
*mat
;
8208 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8209 isl_basic_map_total_dim(bmap
) + 1);
8212 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8213 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8214 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8215 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8216 isl_int_set(mat
->row
[i
][pos
],
8217 bmap
->eq
[i
][off
+ k
]);
8225 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8226 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8227 enum isl_dim_type c2
, enum isl_dim_type c3
,
8228 enum isl_dim_type c4
, enum isl_dim_type c5
)
8230 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8231 struct isl_mat
*mat
;
8237 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8238 isl_basic_map_total_dim(bmap
) + 1);
8241 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8242 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8243 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8244 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8245 isl_int_set(mat
->row
[i
][pos
],
8246 bmap
->ineq
[i
][off
+ k
]);
8254 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8255 __isl_take isl_dim
*dim
,
8256 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8257 enum isl_dim_type c2
, enum isl_dim_type c3
,
8258 enum isl_dim_type c4
, enum isl_dim_type c5
)
8260 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8261 isl_basic_map
*bmap
;
8267 if (!dim
|| !eq
|| !ineq
)
8270 if (eq
->n_col
!= ineq
->n_col
)
8271 isl_die(dim
->ctx
, isl_error_invalid
,
8272 "equalities and inequalities matrices should have "
8273 "same number of columns", goto error
);
8275 total
= 1 + isl_dim_total(dim
);
8277 if (eq
->n_col
< total
)
8278 isl_die(dim
->ctx
, isl_error_invalid
,
8279 "number of columns too small", goto error
);
8281 extra
= eq
->n_col
- total
;
8283 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
8284 eq
->n_row
, ineq
->n_row
);
8287 for (i
= 0; i
< extra
; ++i
) {
8288 k
= isl_basic_map_alloc_div(bmap
);
8291 isl_int_set_si(bmap
->div
[k
][0], 0);
8293 for (i
= 0; i
< eq
->n_row
; ++i
) {
8294 l
= isl_basic_map_alloc_equality(bmap
);
8297 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8298 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8299 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8300 isl_int_set(bmap
->eq
[l
][off
+ k
],
8306 for (i
= 0; i
< ineq
->n_row
; ++i
) {
8307 l
= isl_basic_map_alloc_inequality(bmap
);
8310 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8311 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8312 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8313 isl_int_set(bmap
->ineq
[l
][off
+ k
],
8332 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
8333 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8334 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8336 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
8337 c1
, c2
, c3
, c4
, isl_dim_in
);
8340 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
8341 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
8342 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8344 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
8345 c1
, c2
, c3
, c4
, isl_dim_in
);
8348 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
8349 __isl_take isl_dim
*dim
,
8350 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8351 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
8353 return (isl_basic_set
*)
8354 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
8355 c1
, c2
, c3
, c4
, isl_dim_in
);