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
14 #include <isl_ctx_private.h>
15 #include <isl_map_private.h>
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
19 #include <isl_list_private.h>
24 #include "isl_map_piplib.h"
25 #include <isl_reordering.h>
26 #include "isl_sample.h"
29 #include <isl_mat_private.h>
30 #include <isl_dim_map.h>
31 #include <isl_local_space_private.h>
32 #include <isl_aff_private.h>
34 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
37 case isl_dim_param
: return dim
->nparam
;
38 case isl_dim_in
: return dim
->n_in
;
39 case isl_dim_out
: return dim
->n_out
;
40 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
45 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
48 case isl_dim_param
: return 1;
49 case isl_dim_in
: return 1 + dim
->nparam
;
50 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
55 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
56 enum isl_dim_type type
)
61 case isl_dim_cst
: return 1;
64 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
65 case isl_dim_div
: return bmap
->n_div
;
66 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
71 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
73 return map
? n(map
->dim
, type
) : 0;
76 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
78 return set
? n(set
->dim
, type
) : 0;
81 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
82 enum isl_dim_type type
)
84 struct isl_dim
*dim
= bmap
->dim
;
86 case isl_dim_cst
: return 0;
87 case isl_dim_param
: return 1;
88 case isl_dim_in
: return 1 + dim
->nparam
;
89 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
90 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
95 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
96 enum isl_dim_type type
)
98 return isl_basic_map_offset(bset
, type
);
101 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
103 return pos(map
->dim
, type
);
106 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
107 enum isl_dim_type type
)
109 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
112 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
114 return isl_basic_set_dim(bset
, isl_dim_set
);
117 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
119 return isl_basic_set_dim(bset
, isl_dim_param
);
122 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
124 return isl_dim_total(bset
->dim
) + bset
->n_div
;
127 unsigned isl_set_n_dim(const struct isl_set
*set
)
129 return isl_set_dim(set
, isl_dim_set
);
132 unsigned isl_set_n_param(const struct isl_set
*set
)
134 return isl_set_dim(set
, isl_dim_param
);
137 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
139 return bmap
? bmap
->dim
->n_in
: 0;
142 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
144 return bmap
? bmap
->dim
->n_out
: 0;
147 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
149 return bmap
? bmap
->dim
->nparam
: 0;
152 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
154 return bmap
? bmap
->n_div
: 0;
157 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
159 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
162 unsigned isl_map_n_in(const struct isl_map
*map
)
164 return map
? map
->dim
->n_in
: 0;
167 unsigned isl_map_n_out(const struct isl_map
*map
)
169 return map
? map
->dim
->n_out
: 0;
172 unsigned isl_map_n_param(const struct isl_map
*map
)
174 return map
? map
->dim
->nparam
: 0;
177 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
182 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
185 return isl_dim_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
188 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
189 struct isl_basic_set
*bset
)
194 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
197 return isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
200 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
205 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
208 return isl_dim_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
211 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
212 struct isl_basic_set
*bset
)
217 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
220 return isl_dim_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
223 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
225 return bmap
? bmap
->ctx
: NULL
;
228 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
230 return bset
? bset
->ctx
: NULL
;
233 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
235 return map
? map
->ctx
: NULL
;
238 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
240 return set
? set
->ctx
: NULL
;
243 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
247 return isl_dim_copy(bmap
->dim
);
250 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
254 return isl_dim_copy(bset
->dim
);
257 __isl_give isl_local_space
*isl_basic_map_get_local_space(
258 __isl_keep isl_basic_map
*bmap
)
267 total
= isl_basic_map_total_dim(bmap
);
268 ls
= isl_local_space_alloc(isl_dim_copy(bmap
->dim
), bmap
->n_div
);
272 for (i
= 0; i
< bmap
->n_div
; ++i
)
273 isl_seq_cpy(ls
->div
->row
[i
], bmap
->div
[i
], 2 + total
);
278 __isl_give isl_local_space
*isl_basic_set_get_local_space(
279 __isl_keep isl_basic_set
*bset
)
281 return isl_basic_map_get_local_space(bset
);
284 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
285 __isl_take isl_local_space
*ls
)
294 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
295 bmap
= isl_basic_map_alloc_dim(isl_local_space_get_dim(ls
),
296 n_div
, 0, 2 * n_div
);
298 for (i
= 0; i
< n_div
; ++i
)
299 if (isl_basic_map_alloc_div(bmap
) < 0)
302 for (i
= 0; i
< n_div
; ++i
) {
303 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
304 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
308 isl_local_space_free(ls
);
311 isl_local_space_free(ls
);
312 isl_basic_map_free(bmap
);
316 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
317 __isl_take isl_local_space
*ls
)
319 return isl_basic_map_from_local_space(ls
);
322 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
326 return isl_dim_copy(map
->dim
);
329 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
333 return isl_dim_copy(set
->dim
);
336 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
337 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
339 bmap
= isl_basic_map_cow(bmap
);
342 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
345 bmap
= isl_basic_map_finalize(bmap
);
348 isl_basic_map_free(bmap
);
352 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
353 __isl_take isl_basic_set
*bset
, const char *s
)
355 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
358 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
359 enum isl_dim_type type
)
361 return bmap
? isl_dim_get_tuple_name(bmap
->dim
, type
) : NULL
;
364 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
365 enum isl_dim_type type
, const char *s
)
369 map
= isl_map_cow(map
);
373 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
377 for (i
= 0; i
< map
->n
; ++i
) {
378 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
389 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
390 enum isl_dim_type type
)
392 return map
? isl_dim_get_tuple_name(map
->dim
, type
) : NULL
;
395 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
398 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
401 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
402 enum isl_dim_type type
, __isl_take isl_id
*id
)
404 map
= isl_map_cow(map
);
406 return isl_id_free(id
);
408 map
->dim
= isl_dim_set_tuple_id(map
->dim
, type
, id
);
410 return isl_map_reset_dim(map
, isl_dim_copy(map
->dim
));
413 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
414 __isl_take isl_id
*id
)
416 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
419 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
420 enum isl_dim_type type
)
422 map
= isl_map_cow(map
);
426 map
->dim
= isl_dim_reset_tuple_id(map
->dim
, type
);
428 return isl_map_reset_dim(map
, isl_dim_copy(map
->dim
));
431 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
433 return isl_map_reset_tuple_id(set
, isl_dim_set
);
436 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
437 enum isl_dim_type type
)
439 return map
? isl_dim_get_tuple_id(map
->dim
, type
) : NULL
;
442 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
444 return isl_map_get_tuple_id(set
, isl_dim_set
);
447 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
449 return bset
? isl_dim_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
452 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
454 return set
? isl_dim_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
457 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
458 enum isl_dim_type type
, unsigned pos
)
460 return bmap
? isl_dim_get_name(bmap
->dim
, type
, pos
) : NULL
;
463 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
464 enum isl_dim_type type
, unsigned pos
)
466 return bset
? isl_dim_get_name(bset
->dim
, type
, pos
) : NULL
;
469 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
470 enum isl_dim_type type
, unsigned pos
)
472 return map
? isl_dim_get_name(map
->dim
, type
, pos
) : NULL
;
475 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
476 enum isl_dim_type type
, unsigned pos
)
478 return set
? isl_dim_get_name(set
->dim
, type
, pos
) : NULL
;
481 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
482 __isl_take isl_basic_map
*bmap
,
483 enum isl_dim_type type
, unsigned pos
, const char *s
)
487 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
492 isl_basic_map_free(bmap
);
496 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
497 enum isl_dim_type type
, unsigned pos
, const char *s
)
504 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
508 for (i
= 0; i
< map
->n
; ++i
) {
509 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
520 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
521 __isl_take isl_basic_set
*bset
,
522 enum isl_dim_type type
, unsigned pos
, const char *s
)
524 return (isl_basic_set
*)isl_basic_map_set_dim_name(
525 (isl_basic_map
*)bset
, type
, pos
, s
);
528 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
529 enum isl_dim_type type
, unsigned pos
, const char *s
)
531 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
534 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
535 enum isl_dim_type type
, unsigned pos
)
537 return map
? isl_dim_get_dim_id(map
->dim
, type
, pos
) : NULL
;
540 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
541 enum isl_dim_type type
, unsigned pos
)
543 return isl_map_get_dim_id(set
, type
, pos
);
546 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
547 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
549 map
= isl_map_cow(map
);
551 return isl_id_free(id
);
553 map
->dim
= isl_dim_set_dim_id(map
->dim
, type
, pos
, id
);
555 return isl_map_reset_dim(map
, isl_dim_copy(map
->dim
));
558 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
559 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
561 return isl_map_set_dim_id(set
, type
, pos
, id
);
564 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
565 __isl_keep isl_id
*id
)
569 return isl_dim_find_dim_by_id(map
->dim
, type
, id
);
572 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
573 __isl_keep isl_id
*id
)
575 return isl_map_find_dim_by_id(set
, type
, id
);
578 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
582 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
585 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
587 return isl_basic_map_is_rational(bset
);
590 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
591 struct isl_basic_map
*bmap
, unsigned extra
,
592 unsigned n_eq
, unsigned n_ineq
)
595 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
600 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
601 if (isl_blk_is_error(bmap
->block
))
604 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
609 bmap
->block2
= isl_blk_empty();
612 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
613 if (isl_blk_is_error(bmap
->block2
))
616 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
621 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
622 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
624 for (i
= 0; i
< extra
; ++i
)
625 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
629 bmap
->c_size
= n_eq
+ n_ineq
;
630 bmap
->eq
= bmap
->ineq
+ n_ineq
;
639 isl_basic_map_free(bmap
);
643 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
644 unsigned nparam
, unsigned dim
, unsigned extra
,
645 unsigned n_eq
, unsigned n_ineq
)
647 struct isl_basic_map
*bmap
;
648 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
649 return (struct isl_basic_set
*)bmap
;
652 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
653 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
655 struct isl_basic_map
*bmap
;
658 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
659 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
660 return (struct isl_basic_set
*)bmap
;
666 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
667 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
669 struct isl_basic_map
*bmap
;
673 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
678 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
684 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
685 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
686 unsigned n_eq
, unsigned n_ineq
)
688 struct isl_basic_map
*bmap
;
691 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
695 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
699 static void dup_constraints(
700 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
703 unsigned total
= isl_basic_map_total_dim(src
);
705 for (i
= 0; i
< src
->n_eq
; ++i
) {
706 int j
= isl_basic_map_alloc_equality(dst
);
707 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
710 for (i
= 0; i
< src
->n_ineq
; ++i
) {
711 int j
= isl_basic_map_alloc_inequality(dst
);
712 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
715 for (i
= 0; i
< src
->n_div
; ++i
) {
716 int j
= isl_basic_map_alloc_div(dst
);
717 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
719 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
722 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
724 struct isl_basic_map
*dup
;
728 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
729 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
732 dup_constraints(dup
, bmap
);
733 dup
->flags
= bmap
->flags
;
734 dup
->sample
= isl_vec_copy(bmap
->sample
);
738 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
740 struct isl_basic_map
*dup
;
742 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
743 return (struct isl_basic_set
*)dup
;
746 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
751 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
755 return isl_basic_set_dup(bset
);
758 struct isl_set
*isl_set_copy(struct isl_set
*set
)
767 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
772 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
776 bmap
= isl_basic_map_dup(bmap
);
778 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
782 struct isl_map
*isl_map_copy(struct isl_map
*map
)
791 void isl_basic_map_free(struct isl_basic_map
*bmap
)
799 isl_ctx_deref(bmap
->ctx
);
801 isl_blk_free(bmap
->ctx
, bmap
->block2
);
803 isl_blk_free(bmap
->ctx
, bmap
->block
);
804 isl_vec_free(bmap
->sample
);
805 isl_dim_free(bmap
->dim
);
809 void isl_basic_set_free(struct isl_basic_set
*bset
)
811 isl_basic_map_free((struct isl_basic_map
*)bset
);
814 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
816 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
819 __isl_give isl_map
*isl_map_align_params_map_map_and(
820 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
821 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
822 __isl_take isl_map
*map2
))
826 if (isl_dim_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
827 return fn(map1
, map2
);
828 if (!isl_dim_has_named_params(map1
->dim
) ||
829 !isl_dim_has_named_params(map2
->dim
))
830 isl_die(map1
->ctx
, isl_error_invalid
,
831 "unaligned unnamed parameters", goto error
);
832 map1
= isl_map_align_params(map1
, isl_map_get_dim(map2
));
833 map2
= isl_map_align_params(map2
, isl_map_get_dim(map1
));
834 return fn(map1
, map2
);
841 static int align_params_map_map_and_test(__isl_keep isl_map
*map1
,
842 __isl_keep isl_map
*map2
,
843 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
849 if (isl_dim_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
850 return fn(map1
, map2
);
851 if (!isl_dim_has_named_params(map1
->dim
) ||
852 !isl_dim_has_named_params(map2
->dim
))
853 isl_die(map1
->ctx
, isl_error_invalid
,
854 "unaligned unnamed parameters", return -1);
855 map1
= isl_map_copy(map1
);
856 map2
= isl_map_copy(map2
);
857 map1
= isl_map_align_params(map1
, isl_map_get_dim(map2
));
858 map2
= isl_map_align_params(map2
, isl_map_get_dim(map1
));
865 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
871 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
872 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
874 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
875 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
876 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
877 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
878 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
879 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
881 int j
= isl_basic_map_alloc_inequality(bmap
);
885 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
886 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
893 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
894 bmap
->extra
- bmap
->n_div
);
898 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
900 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
903 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
907 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
912 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
914 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
917 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
922 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
924 if (pos
!= bmap
->n_eq
- 1) {
926 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
927 bmap
->eq
[bmap
->n_eq
- 1] = t
;
933 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
935 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
938 void isl_basic_map_inequality_to_equality(
939 struct isl_basic_map
*bmap
, unsigned pos
)
944 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
945 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
950 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
951 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
952 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
953 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
956 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
958 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
961 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
967 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
968 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
969 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
970 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
971 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
972 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
973 1 + isl_basic_map_total_dim(bmap
),
974 bmap
->extra
- bmap
->n_div
);
975 return bmap
->n_ineq
++;
978 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
980 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
983 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
987 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
992 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
994 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
997 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1002 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1004 if (pos
!= bmap
->n_ineq
- 1) {
1005 t
= bmap
->ineq
[pos
];
1006 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1007 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1008 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1014 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1016 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1019 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1024 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1027 k
= isl_basic_map_alloc_equality(bmap
);
1030 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1033 isl_basic_map_free(bmap
);
1037 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1040 return (isl_basic_set
*)
1041 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1044 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1049 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1052 k
= isl_basic_map_alloc_inequality(bmap
);
1055 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1058 isl_basic_map_free(bmap
);
1062 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1065 return (isl_basic_set
*)
1066 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1069 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1073 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1074 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1075 1 + 1 + isl_basic_map_total_dim(bmap
),
1076 bmap
->extra
- bmap
->n_div
);
1077 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1078 return bmap
->n_div
++;
1081 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1083 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1086 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1090 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1095 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1097 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1100 /* Copy constraint from src to dst, putting the vars of src at offset
1101 * dim_off in dst and the divs of src at offset div_off in dst.
1102 * If both sets are actually map, then dim_off applies to the input
1105 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1106 struct isl_basic_map
*src_map
, isl_int
*src
,
1107 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1109 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1110 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1111 unsigned src_in
= isl_basic_map_n_in(src_map
);
1112 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1113 unsigned src_out
= isl_basic_map_n_out(src_map
);
1114 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1115 isl_int_set(dst
[0], src
[0]);
1116 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1117 if (dst_nparam
> src_nparam
)
1118 isl_seq_clr(dst
+1+src_nparam
,
1119 dst_nparam
- src_nparam
);
1120 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1121 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1123 isl_min(dst_in
-in_off
, src_in
));
1124 if (dst_in
-in_off
> src_in
)
1125 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1126 dst_in
- in_off
- src_in
);
1127 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1128 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1129 src
+1+src_nparam
+src_in
,
1130 isl_min(dst_out
-out_off
, src_out
));
1131 if (dst_out
-out_off
> src_out
)
1132 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1133 dst_out
- out_off
- src_out
);
1134 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1135 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1136 src
+1+src_nparam
+src_in
+src_out
,
1137 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1138 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1139 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1140 div_off
+src_map
->n_div
,
1141 dst_map
->n_div
- div_off
- src_map
->n_div
);
1144 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1145 struct isl_basic_map
*src_map
, isl_int
*src
,
1146 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1148 isl_int_set(dst
[0], src
[0]);
1149 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1152 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1153 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1158 if (!bmap1
|| !bmap2
)
1161 div_off
= bmap1
->n_div
;
1163 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1164 int i1
= isl_basic_map_alloc_equality(bmap1
);
1167 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1168 i_pos
, o_pos
, div_off
);
1171 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1172 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1175 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1176 i_pos
, o_pos
, div_off
);
1179 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1180 int i1
= isl_basic_map_alloc_div(bmap1
);
1183 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1184 i_pos
, o_pos
, div_off
);
1187 isl_basic_map_free(bmap2
);
1192 isl_basic_map_free(bmap1
);
1193 isl_basic_map_free(bmap2
);
1197 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1198 struct isl_basic_set
*bset2
, unsigned pos
)
1200 return (struct isl_basic_set
*)
1201 add_constraints((struct isl_basic_map
*)bset1
,
1202 (struct isl_basic_map
*)bset2
, 0, pos
);
1205 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1206 struct isl_dim
*dim
, unsigned extra
,
1207 unsigned n_eq
, unsigned n_ineq
)
1209 struct isl_basic_map
*ext
;
1219 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1220 base
->extra
>= base
->n_div
+ extra
;
1222 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1223 room_for_ineq(base
, n_ineq
)) {
1228 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1229 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1230 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1231 extra
+= base
->extra
;
1233 n_ineq
+= base
->n_ineq
;
1235 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1241 ext
->sample
= isl_vec_copy(base
->sample
);
1242 flags
= base
->flags
;
1243 ext
= add_constraints(ext
, base
, 0, 0);
1246 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1253 isl_basic_map_free(base
);
1257 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1258 struct isl_dim
*dim
, unsigned extra
,
1259 unsigned n_eq
, unsigned n_ineq
)
1261 return (struct isl_basic_set
*)
1262 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1263 extra
, n_eq
, n_ineq
);
1266 struct isl_basic_map
*isl_basic_map_extend_constraints(
1267 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1271 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1275 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1276 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1277 unsigned n_eq
, unsigned n_ineq
)
1279 struct isl_basic_map
*bmap
;
1280 struct isl_dim
*dim
;
1284 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1288 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1291 isl_basic_map_free(base
);
1295 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1296 unsigned nparam
, unsigned dim
, unsigned extra
,
1297 unsigned n_eq
, unsigned n_ineq
)
1299 return (struct isl_basic_set
*)
1300 isl_basic_map_extend((struct isl_basic_map
*)base
,
1301 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1304 struct isl_basic_set
*isl_basic_set_extend_constraints(
1305 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1307 return (struct isl_basic_set
*)
1308 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1312 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1314 return (struct isl_basic_set
*)
1315 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1318 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1323 if (bmap
->ref
> 1) {
1325 bmap
= isl_basic_map_dup(bmap
);
1328 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1332 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1340 return isl_set_dup(set
);
1343 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1351 return isl_map_dup(map
);
1354 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1355 unsigned a_len
, unsigned b_len
)
1357 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1358 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1359 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1362 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1363 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1371 isl_assert(bmap
->ctx
,
1372 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1374 if (n1
== 0 || n2
== 0)
1377 bmap
= isl_basic_map_cow(bmap
);
1381 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1382 if (isl_blk_is_error(blk
))
1385 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1387 bmap
->eq
[i
] + pos
, n1
, n2
);
1389 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1391 bmap
->ineq
[i
] + pos
, n1
, n2
);
1393 for (i
= 0; i
< bmap
->n_div
; ++i
)
1395 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1397 isl_blk_free(bmap
->ctx
, blk
);
1399 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1400 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1401 return isl_basic_map_finalize(bmap
);
1403 isl_basic_map_free(bmap
);
1407 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1408 __isl_take isl_basic_set
*bset
, unsigned n
)
1413 nparam
= isl_basic_set_n_param(bset
);
1414 dim
= isl_basic_set_n_dim(bset
);
1415 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1417 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1419 isl_basic_set_free(bset
);
1423 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1429 total
= isl_basic_map_total_dim(bmap
);
1430 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1431 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1433 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1435 i
= isl_basic_map_alloc_equality(bmap
);
1439 isl_int_set_si(bmap
->eq
[i
][0], 1);
1440 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1441 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1442 isl_vec_free(bmap
->sample
);
1443 bmap
->sample
= NULL
;
1444 return isl_basic_map_finalize(bmap
);
1446 isl_basic_map_free(bmap
);
1450 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1452 return (struct isl_basic_set
*)
1453 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1456 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1459 unsigned off
= isl_dim_total(bmap
->dim
);
1460 isl_int
*t
= bmap
->div
[a
];
1461 bmap
->div
[a
] = bmap
->div
[b
];
1464 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1465 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1467 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1468 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1470 for (i
= 0; i
< bmap
->n_div
; ++i
)
1471 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1472 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1475 /* Eliminate the specified n dimensions starting at first from the
1476 * constraints using Fourier-Motzkin. The dimensions themselves
1479 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1480 enum isl_dim_type type
, unsigned first
, unsigned n
)
1489 map
= isl_map_cow(map
);
1492 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1493 first
+= pos(map
->dim
, type
) - 1;
1495 for (i
= 0; i
< map
->n
; ++i
) {
1496 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1506 /* Eliminate the specified n dimensions starting at first from the
1507 * constraints using Fourier-Motzkin. The dimensions themselves
1510 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1511 enum isl_dim_type type
, unsigned first
, unsigned n
)
1513 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1516 /* Eliminate the specified n dimensions starting at first from the
1517 * constraints using Fourier-Motzkin. The dimensions themselves
1520 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1521 unsigned first
, unsigned n
)
1523 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1526 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1527 __isl_take isl_basic_map
*bmap
)
1529 bmap
= isl_basic_map_eliminate_vars(bmap
, isl_dim_total(bmap
->dim
),
1534 return isl_basic_map_finalize(bmap
);
1537 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1538 __isl_take isl_basic_set
*bset
)
1540 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1541 (struct isl_basic_map
*)bset
);
1544 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1553 map
= isl_map_cow(map
);
1557 for (i
= 0; i
< map
->n
; ++i
) {
1558 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1568 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1570 return isl_map_remove_divs(set
);
1573 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1574 enum isl_dim_type type
, unsigned first
, unsigned n
)
1578 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1582 bmap
= isl_basic_map_eliminate_vars(bmap
,
1583 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1586 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1588 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1591 isl_basic_map_free(bmap
);
1595 /* Return true if the definition of the given div (recursively) involves
1596 * any of the given variables.
1598 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1599 unsigned first
, unsigned n
)
1602 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1604 if (isl_int_is_zero(bmap
->div
[div
][0]))
1606 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1609 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1610 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1612 if (div_involves_vars(bmap
, i
, first
, n
))
1619 /* Remove all divs (recursively) involving any of the given dimensions
1620 * in their definitions.
1622 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1623 __isl_take isl_basic_map
*bmap
,
1624 enum isl_dim_type type
, unsigned first
, unsigned n
)
1630 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1632 first
+= isl_basic_map_offset(bmap
, type
);
1634 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1635 if (!div_involves_vars(bmap
, i
, first
, n
))
1637 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1645 isl_basic_map_free(bmap
);
1649 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1650 enum isl_dim_type type
, unsigned first
, unsigned n
)
1659 map
= isl_map_cow(map
);
1663 for (i
= 0; i
< map
->n
; ++i
) {
1664 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1675 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1676 enum isl_dim_type type
, unsigned first
, unsigned n
)
1678 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1682 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
1683 enum isl_dim_type type
, unsigned first
, unsigned n
)
1690 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
1691 isl_die(bmap
->ctx
, isl_error_invalid
,
1692 "index out of bounds", return -1);
1694 first
+= isl_basic_map_offset(bmap
, type
);
1695 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1696 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
1698 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1699 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
1705 int isl_map_involves_dims(__isl_keep isl_map
*map
,
1706 enum isl_dim_type type
, unsigned first
, unsigned n
)
1713 if (first
+ n
> isl_map_dim(map
, type
))
1714 isl_die(map
->ctx
, isl_error_invalid
,
1715 "index out of bounds", return -1);
1717 for (i
= 0; i
< map
->n
; ++i
) {
1718 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
1720 if (involves
< 0 || !involves
)
1727 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
1728 enum isl_dim_type type
, unsigned first
, unsigned n
)
1730 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
1733 int isl_set_involves_dims(__isl_keep isl_set
*set
,
1734 enum isl_dim_type type
, unsigned first
, unsigned n
)
1736 return isl_map_involves_dims(set
, type
, first
, n
);
1739 /* Return true if the definition of the given div is unknown or depends
1742 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1745 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1747 if (isl_int_is_zero(bmap
->div
[div
][0]))
1750 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1751 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1753 if (div_is_unknown(bmap
, i
))
1760 /* Remove all divs that are unknown or defined in terms of unknown divs.
1762 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1763 __isl_take isl_basic_map
*bmap
)
1770 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1771 if (!div_is_unknown(bmap
, i
))
1773 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1779 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1788 map
= isl_map_cow(map
);
1792 for (i
= 0; i
< map
->n
; ++i
) {
1793 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1803 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1805 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1808 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1809 __isl_take isl_basic_set
*bset
,
1810 enum isl_dim_type type
, unsigned first
, unsigned n
)
1812 return (isl_basic_set
*)
1813 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1816 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1817 enum isl_dim_type type
, unsigned first
, unsigned n
)
1824 map
= isl_map_cow(map
);
1827 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1829 for (i
= 0; i
< map
->n
; ++i
) {
1830 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1831 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1835 map
= isl_map_drop(map
, type
, first
, n
);
1842 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1843 enum isl_dim_type type
, unsigned first
, unsigned n
)
1845 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1848 /* Project out n inputs starting at first using Fourier-Motzkin */
1849 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1850 unsigned first
, unsigned n
)
1852 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1855 static void dump_term(struct isl_basic_map
*bmap
,
1856 isl_int c
, int pos
, FILE *out
)
1859 unsigned in
= isl_basic_map_n_in(bmap
);
1860 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1861 unsigned nparam
= isl_basic_map_n_param(bmap
);
1863 isl_int_print(out
, c
, 0);
1865 if (!isl_int_is_one(c
))
1866 isl_int_print(out
, c
, 0);
1867 if (pos
< 1 + nparam
) {
1868 name
= isl_dim_get_name(bmap
->dim
,
1869 isl_dim_param
, pos
- 1);
1871 fprintf(out
, "%s", name
);
1873 fprintf(out
, "p%d", pos
- 1);
1874 } else if (pos
< 1 + nparam
+ in
)
1875 fprintf(out
, "i%d", pos
- 1 - nparam
);
1876 else if (pos
< 1 + nparam
+ dim
)
1877 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1879 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1883 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1884 int sign
, FILE *out
)
1888 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1892 for (i
= 0, first
= 1; i
< len
; ++i
) {
1893 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1896 fprintf(out
, " + ");
1898 isl_int_abs(v
, c
[i
]);
1899 dump_term(bmap
, v
, i
, out
);
1906 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1907 const char *op
, FILE *out
, int indent
)
1911 fprintf(out
, "%*s", indent
, "");
1913 dump_constraint_sign(bmap
, c
, 1, out
);
1914 fprintf(out
, " %s ", op
);
1915 dump_constraint_sign(bmap
, c
, -1, out
);
1919 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1920 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1922 fprintf(out
, "%*s", indent
, "");
1923 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1928 static void dump_constraints(struct isl_basic_map
*bmap
,
1929 isl_int
**c
, unsigned n
,
1930 const char *op
, FILE *out
, int indent
)
1934 for (i
= 0; i
< n
; ++i
)
1935 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1938 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1942 unsigned total
= isl_basic_map_total_dim(bmap
);
1944 for (j
= 0; j
< 1 + total
; ++j
) {
1945 if (isl_int_is_zero(exp
[j
]))
1947 if (!first
&& isl_int_is_pos(exp
[j
]))
1949 dump_term(bmap
, exp
[j
], j
, out
);
1954 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1958 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1959 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1961 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1962 fprintf(out
, "%*s", indent
, "");
1963 fprintf(out
, "e%d = [(", i
);
1964 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1966 isl_int_print(out
, bmap
->div
[i
][0], 0);
1967 fprintf(out
, "]\n");
1971 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
1972 FILE *out
, int indent
)
1975 fprintf(out
, "null basic set\n");
1979 fprintf(out
, "%*s", indent
, "");
1980 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1981 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1982 bset
->extra
, bset
->flags
);
1983 dump((struct isl_basic_map
*)bset
, out
, indent
);
1986 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
1987 FILE *out
, int indent
)
1990 fprintf(out
, "null basic map\n");
1994 fprintf(out
, "%*s", indent
, "");
1995 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1996 "flags: %x, n_name: %d\n",
1998 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1999 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2000 dump(bmap
, out
, indent
);
2003 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2008 total
= isl_basic_map_total_dim(bmap
);
2009 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2010 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2011 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2012 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2016 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2018 struct isl_set
*set
;
2022 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2023 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2024 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2025 sizeof(struct isl_set
) +
2026 (n
- 1) * sizeof(struct isl_basic_set
*));
2030 set
->ctx
= dim
->ctx
;
2031 isl_ctx_ref(set
->ctx
);
2043 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2044 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2046 struct isl_set
*set
;
2047 struct isl_dim
*dims
;
2049 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
2053 set
= isl_set_alloc_dim(dims
, n
, flags
);
2057 /* Make sure "map" has room for at least "n" more basic maps.
2059 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2062 struct isl_map
*grown
= NULL
;
2066 isl_assert(map
->ctx
, n
>= 0, goto error
);
2067 if (map
->n
+ n
<= map
->size
)
2069 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
2072 for (i
= 0; i
< map
->n
; ++i
) {
2073 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2081 isl_map_free(grown
);
2086 /* Make sure "set" has room for at least "n" more basic sets.
2088 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2090 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2093 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2096 struct isl_set
*dup
;
2101 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
2104 for (i
= 0; i
< set
->n
; ++i
)
2105 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2109 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2111 return isl_map_from_basic_map(bset
);
2114 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2116 struct isl_map
*map
;
2121 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2122 return isl_map_add_basic_map(map
, bmap
);
2125 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2126 __isl_take isl_basic_set
*bset
)
2128 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2129 (struct isl_basic_map
*)bset
);
2132 void isl_set_free(struct isl_set
*set
)
2142 isl_ctx_deref(set
->ctx
);
2143 for (i
= 0; i
< set
->n
; ++i
)
2144 isl_basic_set_free(set
->p
[i
]);
2145 isl_dim_free(set
->dim
);
2149 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2154 fprintf(out
, "null set\n");
2158 fprintf(out
, "%*s", indent
, "");
2159 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2160 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2162 for (i
= 0; i
< set
->n
; ++i
) {
2163 fprintf(out
, "%*s", indent
, "");
2164 fprintf(out
, "basic set %d:\n", i
);
2165 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2169 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2174 fprintf(out
, "null map\n");
2178 fprintf(out
, "%*s", indent
, "");
2179 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2180 "flags: %x, n_name: %d\n",
2181 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2182 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2183 for (i
= 0; i
< map
->n
; ++i
) {
2184 fprintf(out
, "%*s", indent
, "");
2185 fprintf(out
, "basic map %d:\n", i
);
2186 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2190 struct isl_basic_map
*isl_basic_map_intersect_domain(
2191 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2193 struct isl_basic_map
*bmap_domain
;
2198 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2199 bset
->dim
, isl_dim_param
), goto error
);
2201 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2202 isl_assert(bset
->ctx
,
2203 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2205 bmap
= isl_basic_map_cow(bmap
);
2208 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2209 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2210 bmap_domain
= isl_basic_map_from_domain(bset
);
2211 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2213 bmap
= isl_basic_map_simplify(bmap
);
2214 return isl_basic_map_finalize(bmap
);
2216 isl_basic_map_free(bmap
);
2217 isl_basic_set_free(bset
);
2221 struct isl_basic_map
*isl_basic_map_intersect_range(
2222 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2224 struct isl_basic_map
*bmap_range
;
2229 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
2230 bset
->dim
, isl_dim_param
), goto error
);
2232 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
2233 isl_assert(bset
->ctx
,
2234 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2236 if (isl_basic_set_is_universe(bset
)) {
2237 isl_basic_set_free(bset
);
2241 bmap
= isl_basic_map_cow(bmap
);
2244 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
2245 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2246 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2247 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2249 bmap
= isl_basic_map_simplify(bmap
);
2250 return isl_basic_map_finalize(bmap
);
2252 isl_basic_map_free(bmap
);
2253 isl_basic_set_free(bset
);
2257 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2263 total
= 1 + isl_basic_map_total_dim(bmap
);
2264 if (total
!= vec
->size
)
2269 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2270 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2271 if (!isl_int_is_zero(s
)) {
2277 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2278 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2279 if (isl_int_is_neg(s
)) {
2290 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2292 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2295 struct isl_basic_map
*isl_basic_map_intersect(
2296 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2298 struct isl_vec
*sample
= NULL
;
2300 if (!bmap1
|| !bmap2
)
2303 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
2304 bmap2
->dim
, isl_dim_param
), goto error
);
2305 if (isl_dim_total(bmap1
->dim
) ==
2306 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
2307 isl_dim_total(bmap2
->dim
) !=
2308 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2309 return isl_basic_map_intersect(bmap2
, bmap1
);
2311 if (isl_dim_total(bmap2
->dim
) !=
2312 isl_dim_size(bmap2
->dim
, isl_dim_param
))
2313 isl_assert(bmap1
->ctx
,
2314 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2316 if (bmap1
->sample
&&
2317 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2318 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2319 sample
= isl_vec_copy(bmap1
->sample
);
2320 else if (bmap2
->sample
&&
2321 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2322 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2323 sample
= isl_vec_copy(bmap2
->sample
);
2325 bmap1
= isl_basic_map_cow(bmap1
);
2328 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
2329 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2330 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2333 isl_vec_free(sample
);
2335 isl_vec_free(bmap1
->sample
);
2336 bmap1
->sample
= sample
;
2339 bmap1
= isl_basic_map_simplify(bmap1
);
2340 return isl_basic_map_finalize(bmap1
);
2343 isl_vec_free(sample
);
2344 isl_basic_map_free(bmap1
);
2345 isl_basic_map_free(bmap2
);
2349 struct isl_basic_set
*isl_basic_set_intersect(
2350 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2352 return (struct isl_basic_set
*)
2353 isl_basic_map_intersect(
2354 (struct isl_basic_map
*)bset1
,
2355 (struct isl_basic_map
*)bset2
);
2358 /* Special case of isl_map_intersect, where both map1 and map2
2359 * are convex, without any divs and such that either map1 or map2
2360 * contains a single constraint. This constraint is then simply
2361 * added to the other map.
2363 static __isl_give isl_map
*map_intersect_add_constraint(
2364 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2366 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2367 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2368 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2369 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2371 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2372 return isl_map_intersect(map2
, map1
);
2374 isl_assert(map2
->ctx
,
2375 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2377 map1
= isl_map_cow(map1
);
2380 if (isl_map_plain_is_empty(map1
)) {
2384 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2385 if (map2
->p
[0]->n_eq
== 1)
2386 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2388 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2389 map2
->p
[0]->ineq
[0]);
2391 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2392 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2396 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2397 isl_basic_map_free(map1
->p
[0]);
2410 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2411 __isl_take isl_map
*map2
)
2414 struct isl_map
*result
;
2420 if (isl_map_plain_is_empty(map1
) &&
2421 isl_dim_equal(map1
->dim
, map2
->dim
)) {
2425 if (isl_map_plain_is_empty(map2
) &&
2426 isl_dim_equal(map1
->dim
, map2
->dim
)) {
2431 if (map1
->n
== 1 && map2
->n
== 1 &&
2432 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2433 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2434 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2435 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2436 return map_intersect_add_constraint(map1
, map2
);
2437 if (isl_dim_total(map1
->dim
) ==
2438 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2439 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2440 return isl_map_intersect(map2
, map1
);
2442 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2443 isl_assert(map1
->ctx
,
2444 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2446 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2447 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2448 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2450 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2451 map1
->n
* map2
->n
, flags
);
2454 for (i
= 0; i
< map1
->n
; ++i
)
2455 for (j
= 0; j
< map2
->n
; ++j
) {
2456 struct isl_basic_map
*part
;
2457 part
= isl_basic_map_intersect(
2458 isl_basic_map_copy(map1
->p
[i
]),
2459 isl_basic_map_copy(map2
->p
[j
]));
2460 if (isl_basic_map_is_empty(part
))
2461 isl_basic_map_free(part
);
2463 result
= isl_map_add_basic_map(result
, part
);
2476 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2477 __isl_take isl_map
*map2
)
2479 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2482 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2484 return (struct isl_set
*)
2485 isl_map_intersect((struct isl_map
*)set1
,
2486 (struct isl_map
*)set2
);
2489 /* The current implementation of isl_map_intersect accepts intersections
2490 * with parameter domains, so we can just call that for now.
2492 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2493 __isl_take isl_set
*params
)
2495 return isl_map_intersect(map
, params
);
2498 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2499 __isl_take isl_map
*map2
)
2501 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2504 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2505 __isl_take isl_set
*params
)
2507 return isl_map_intersect_params(set
, params
);
2510 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2512 struct isl_dim
*dim
;
2513 struct isl_basic_set
*bset
;
2518 bmap
= isl_basic_map_cow(bmap
);
2521 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2522 in
= isl_basic_map_n_in(bmap
);
2523 bset
= isl_basic_set_from_basic_map(bmap
);
2524 bset
= isl_basic_set_swap_vars(bset
, in
);
2525 return isl_basic_map_from_basic_set(bset
, dim
);
2528 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2529 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2531 struct isl_dim
*res_dim
;
2532 struct isl_basic_map
*res
;
2533 struct isl_dim_map
*dim_map
;
2534 unsigned total
, off
;
2535 enum isl_dim_type t
;
2543 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2545 total
= isl_basic_map_total_dim(bmap
) + n
;
2546 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2548 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2550 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2552 unsigned size
= isl_basic_map_dim(bmap
, t
);
2553 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2555 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2556 pos
, size
- pos
, off
+ pos
+ n
);
2558 off
+= isl_dim_size(res_dim
, t
);
2560 isl_dim_map_div(dim_map
, bmap
, off
);
2562 res
= isl_basic_map_alloc_dim(res_dim
,
2563 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2564 if (isl_basic_map_is_rational(bmap
))
2565 res
= isl_basic_map_set_rational(res
);
2566 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2567 return isl_basic_map_finalize(res
);
2570 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2571 enum isl_dim_type type
, unsigned n
)
2575 return isl_basic_map_insert(bmap
, type
,
2576 isl_basic_map_dim(bmap
, type
), n
);
2579 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2580 enum isl_dim_type type
, unsigned n
)
2584 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2585 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2587 isl_basic_set_free(bset
);
2591 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2592 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2599 map
= isl_map_cow(map
);
2603 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2607 for (i
= 0; i
< map
->n
; ++i
) {
2608 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2619 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2620 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2622 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2625 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2626 enum isl_dim_type type
, unsigned n
)
2630 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2633 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2634 enum isl_dim_type type
, unsigned n
)
2638 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2639 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2645 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2646 __isl_take isl_basic_map
*bmap
,
2647 enum isl_dim_type dst_type
, unsigned dst_pos
,
2648 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2650 struct isl_dim_map
*dim_map
;
2651 struct isl_basic_map
*res
;
2652 enum isl_dim_type t
;
2653 unsigned total
, off
;
2660 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2663 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2666 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2668 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2669 pos(bmap
->dim
, src_type
) + src_pos
+
2670 ((src_type
< dst_type
) ? n
: 0)) {
2671 bmap
= isl_basic_map_cow(bmap
);
2675 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2676 src_type
, src_pos
, n
);
2680 bmap
= isl_basic_map_finalize(bmap
);
2685 total
= isl_basic_map_total_dim(bmap
);
2686 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2689 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2690 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2691 if (t
== dst_type
) {
2692 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2695 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2698 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2699 dst_pos
, size
- dst_pos
, off
);
2700 off
+= size
- dst_pos
;
2701 } else if (t
== src_type
) {
2702 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2705 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2706 src_pos
+ n
, size
- src_pos
- n
, off
);
2707 off
+= size
- src_pos
- n
;
2709 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2713 isl_dim_map_div(dim_map
, bmap
, off
);
2715 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2716 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2717 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2719 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2720 src_type
, src_pos
, n
);
2724 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2725 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2726 bmap
= isl_basic_map_finalize(bmap
);
2730 isl_basic_map_free(bmap
);
2734 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2735 enum isl_dim_type dst_type
, unsigned dst_pos
,
2736 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2738 return (isl_basic_set
*)isl_basic_map_move_dims(
2739 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2742 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2743 enum isl_dim_type dst_type
, unsigned dst_pos
,
2744 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2748 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2749 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2750 src_type
, src_pos
, n
);
2756 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2757 enum isl_dim_type dst_type
, unsigned dst_pos
,
2758 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2767 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2770 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2773 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2775 map
= isl_map_cow(map
);
2779 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2783 for (i
= 0; i
< map
->n
; ++i
) {
2784 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2786 src_type
, src_pos
, n
);
2797 /* Move the specified dimensions to the last columns right before
2798 * the divs. Don't change the dimension specification of bmap.
2799 * That's the responsibility of the caller.
2801 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2802 enum isl_dim_type type
, unsigned first
, unsigned n
)
2804 struct isl_dim_map
*dim_map
;
2805 struct isl_basic_map
*res
;
2806 enum isl_dim_type t
;
2807 unsigned total
, off
;
2811 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2814 total
= isl_basic_map_total_dim(bmap
);
2815 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2818 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2819 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2821 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2824 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2825 first
, n
, total
- bmap
->n_div
- n
);
2826 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2827 first
+ n
, size
- (first
+ n
), off
);
2828 off
+= size
- (first
+ n
);
2830 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2834 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2836 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2837 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2838 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2842 /* Turn the n dimensions of type type, starting at first
2843 * into existentially quantified variables.
2845 __isl_give isl_basic_map
*isl_basic_map_project_out(
2846 __isl_take isl_basic_map
*bmap
,
2847 enum isl_dim_type type
, unsigned first
, unsigned n
)
2860 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2861 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2863 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2866 bmap
= move_last(bmap
, type
, first
, n
);
2867 bmap
= isl_basic_map_cow(bmap
);
2871 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2872 old
= bmap
->block2
.data
;
2873 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2874 (bmap
->extra
+ n
) * (1 + row_size
));
2875 if (!bmap
->block2
.data
)
2877 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2880 for (i
= 0; i
< n
; ++i
) {
2881 new_div
[i
] = bmap
->block2
.data
+
2882 (bmap
->extra
+ i
) * (1 + row_size
);
2883 isl_seq_clr(new_div
[i
], 1 + row_size
);
2885 for (i
= 0; i
< bmap
->extra
; ++i
)
2886 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2888 bmap
->div
= new_div
;
2892 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2895 bmap
= isl_basic_map_simplify(bmap
);
2896 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2897 return isl_basic_map_finalize(bmap
);
2899 isl_basic_map_free(bmap
);
2903 /* Turn the n dimensions of type type, starting at first
2904 * into existentially quantified variables.
2906 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2907 enum isl_dim_type type
, unsigned first
, unsigned n
)
2909 return (isl_basic_set
*)isl_basic_map_project_out(
2910 (isl_basic_map
*)bset
, type
, first
, n
);
2913 /* Turn the n dimensions of type type, starting at first
2914 * into existentially quantified variables.
2916 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2917 enum isl_dim_type type
, unsigned first
, unsigned n
)
2927 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2929 map
= isl_map_cow(map
);
2933 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2937 for (i
= 0; i
< map
->n
; ++i
) {
2938 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2949 /* Turn the n dimensions of type type, starting at first
2950 * into existentially quantified variables.
2952 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2953 enum isl_dim_type type
, unsigned first
, unsigned n
)
2955 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2958 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2962 for (i
= 0; i
< n
; ++i
) {
2963 j
= isl_basic_map_alloc_div(bmap
);
2966 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2970 isl_basic_map_free(bmap
);
2974 struct isl_basic_map
*isl_basic_map_apply_range(
2975 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2977 struct isl_dim
*dim_result
= NULL
;
2978 struct isl_basic_map
*bmap
;
2979 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2980 struct isl_dim_map
*dim_map1
, *dim_map2
;
2982 if (!bmap1
|| !bmap2
)
2985 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2986 isl_dim_copy(bmap2
->dim
));
2988 n_in
= isl_basic_map_n_in(bmap1
);
2989 n_out
= isl_basic_map_n_out(bmap2
);
2990 n
= isl_basic_map_n_out(bmap1
);
2991 nparam
= isl_basic_map_n_param(bmap1
);
2993 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2994 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2995 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2996 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2997 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2998 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2999 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3000 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3001 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3002 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3003 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3005 bmap
= isl_basic_map_alloc_dim(dim_result
,
3006 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3007 bmap1
->n_eq
+ bmap2
->n_eq
,
3008 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3009 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3010 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3011 bmap
= add_divs(bmap
, n
);
3012 bmap
= isl_basic_map_simplify(bmap
);
3013 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3014 return isl_basic_map_finalize(bmap
);
3016 isl_basic_map_free(bmap1
);
3017 isl_basic_map_free(bmap2
);
3021 struct isl_basic_set
*isl_basic_set_apply(
3022 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3027 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3030 return (struct isl_basic_set
*)
3031 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3033 isl_basic_set_free(bset
);
3034 isl_basic_map_free(bmap
);
3038 struct isl_basic_map
*isl_basic_map_apply_domain(
3039 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3041 if (!bmap1
|| !bmap2
)
3044 isl_assert(bmap1
->ctx
,
3045 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3046 isl_assert(bmap1
->ctx
,
3047 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3050 bmap1
= isl_basic_map_reverse(bmap1
);
3051 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3052 return isl_basic_map_reverse(bmap1
);
3054 isl_basic_map_free(bmap1
);
3055 isl_basic_map_free(bmap2
);
3059 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3060 * A \cap B -> f(A) + f(B)
3062 struct isl_basic_map
*isl_basic_map_sum(
3063 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3065 unsigned n_in
, n_out
, nparam
, total
, pos
;
3066 struct isl_basic_map
*bmap
= NULL
;
3067 struct isl_dim_map
*dim_map1
, *dim_map2
;
3070 if (!bmap1
|| !bmap2
)
3073 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
3076 nparam
= isl_basic_map_n_param(bmap1
);
3077 n_in
= isl_basic_map_n_in(bmap1
);
3078 n_out
= isl_basic_map_n_out(bmap1
);
3080 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3081 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3082 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3083 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3084 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3085 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3086 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3087 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3088 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3089 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3090 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3092 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
3093 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3094 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3095 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3096 for (i
= 0; i
< n_out
; ++i
) {
3097 int j
= isl_basic_map_alloc_equality(bmap
);
3100 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3101 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3102 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3103 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3105 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3106 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3107 bmap
= add_divs(bmap
, 2 * n_out
);
3109 bmap
= isl_basic_map_simplify(bmap
);
3110 return isl_basic_map_finalize(bmap
);
3112 isl_basic_map_free(bmap
);
3113 isl_basic_map_free(bmap1
);
3114 isl_basic_map_free(bmap2
);
3118 /* Given two maps A -> f(A) and B -> g(B), construct a map
3119 * A \cap B -> f(A) + f(B)
3121 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3123 struct isl_map
*result
;
3129 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3131 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3132 map1
->n
* map2
->n
, 0);
3135 for (i
= 0; i
< map1
->n
; ++i
)
3136 for (j
= 0; j
< map2
->n
; ++j
) {
3137 struct isl_basic_map
*part
;
3138 part
= isl_basic_map_sum(
3139 isl_basic_map_copy(map1
->p
[i
]),
3140 isl_basic_map_copy(map2
->p
[j
]));
3141 if (isl_basic_map_is_empty(part
))
3142 isl_basic_map_free(part
);
3144 result
= isl_map_add_basic_map(result
, part
);
3157 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3158 __isl_take isl_set
*set2
)
3160 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3163 /* Given a basic map A -> f(A), construct A -> -f(A).
3165 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3170 bmap
= isl_basic_map_cow(bmap
);
3174 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3175 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3176 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3177 for (j
= 0; j
< n
; ++j
)
3178 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3179 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3180 for (j
= 0; j
< n
; ++j
)
3181 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3182 for (i
= 0; i
< bmap
->n_div
; ++i
)
3183 for (j
= 0; j
< n
; ++j
)
3184 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3185 return isl_basic_map_finalize(bmap
);
3188 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3190 return isl_basic_map_neg(bset
);
3193 /* Given a map A -> f(A), construct A -> -f(A).
3195 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3199 map
= isl_map_cow(map
);
3203 for (i
= 0; i
< map
->n
; ++i
) {
3204 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3215 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3217 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3220 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3221 * A -> floor(f(A)/d).
3223 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3226 unsigned n_in
, n_out
, nparam
, total
, pos
;
3227 struct isl_basic_map
*result
= NULL
;
3228 struct isl_dim_map
*dim_map
;
3234 nparam
= isl_basic_map_n_param(bmap
);
3235 n_in
= isl_basic_map_n_in(bmap
);
3236 n_out
= isl_basic_map_n_out(bmap
);
3238 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3239 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3240 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3241 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3242 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3243 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3245 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
3246 bmap
->n_div
+ n_out
,
3247 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3248 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3249 result
= add_divs(result
, n_out
);
3250 for (i
= 0; i
< n_out
; ++i
) {
3252 j
= isl_basic_map_alloc_inequality(result
);
3255 isl_seq_clr(result
->ineq
[j
], 1+total
);
3256 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3257 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3258 j
= isl_basic_map_alloc_inequality(result
);
3261 isl_seq_clr(result
->ineq
[j
], 1+total
);
3262 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3263 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3264 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3267 result
= isl_basic_map_simplify(result
);
3268 return isl_basic_map_finalize(result
);
3270 isl_basic_map_free(result
);
3274 /* Given a map A -> f(A) and an integer d, construct a map
3275 * A -> floor(f(A)/d).
3277 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3281 map
= isl_map_cow(map
);
3285 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3286 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3287 for (i
= 0; i
< map
->n
; ++i
) {
3288 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3299 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3305 i
= isl_basic_map_alloc_equality(bmap
);
3308 nparam
= isl_basic_map_n_param(bmap
);
3309 n_in
= isl_basic_map_n_in(bmap
);
3310 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3311 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3312 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3313 return isl_basic_map_finalize(bmap
);
3315 isl_basic_map_free(bmap
);
3319 /* Add a constraints to "bmap" expressing i_pos < o_pos
3321 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3327 i
= isl_basic_map_alloc_inequality(bmap
);
3330 nparam
= isl_basic_map_n_param(bmap
);
3331 n_in
= isl_basic_map_n_in(bmap
);
3332 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3333 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3334 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3335 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3336 return isl_basic_map_finalize(bmap
);
3338 isl_basic_map_free(bmap
);
3342 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3344 static __isl_give isl_basic_map
*var_less_or_equal(
3345 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3351 i
= isl_basic_map_alloc_inequality(bmap
);
3354 nparam
= isl_basic_map_n_param(bmap
);
3355 n_in
= isl_basic_map_n_in(bmap
);
3356 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3357 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3358 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3359 return isl_basic_map_finalize(bmap
);
3361 isl_basic_map_free(bmap
);
3365 /* Add a constraints to "bmap" expressing i_pos > o_pos
3367 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3373 i
= isl_basic_map_alloc_inequality(bmap
);
3376 nparam
= isl_basic_map_n_param(bmap
);
3377 n_in
= isl_basic_map_n_in(bmap
);
3378 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3379 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3380 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3381 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3382 return isl_basic_map_finalize(bmap
);
3384 isl_basic_map_free(bmap
);
3388 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3390 static __isl_give isl_basic_map
*var_more_or_equal(
3391 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3397 i
= isl_basic_map_alloc_inequality(bmap
);
3400 nparam
= isl_basic_map_n_param(bmap
);
3401 n_in
= isl_basic_map_n_in(bmap
);
3402 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3403 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3404 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3405 return isl_basic_map_finalize(bmap
);
3407 isl_basic_map_free(bmap
);
3411 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3414 struct isl_basic_map
*bmap
;
3415 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3418 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3419 bmap
= var_equal(bmap
, i
);
3420 return isl_basic_map_finalize(bmap
);
3423 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3425 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3428 struct isl_basic_map
*bmap
;
3429 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3432 for (i
= 0; i
< pos
&& bmap
; ++i
)
3433 bmap
= var_equal(bmap
, i
);
3435 bmap
= var_less(bmap
, pos
);
3436 return isl_basic_map_finalize(bmap
);
3439 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3441 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3442 __isl_take isl_dim
*dim
, unsigned pos
)
3445 isl_basic_map
*bmap
;
3447 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3448 for (i
= 0; i
< pos
; ++i
)
3449 bmap
= var_equal(bmap
, i
);
3450 bmap
= var_less_or_equal(bmap
, pos
);
3451 return isl_basic_map_finalize(bmap
);
3454 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3456 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3459 struct isl_basic_map
*bmap
;
3460 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3463 for (i
= 0; i
< pos
&& bmap
; ++i
)
3464 bmap
= var_equal(bmap
, i
);
3466 bmap
= var_more(bmap
, pos
);
3467 return isl_basic_map_finalize(bmap
);
3470 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3472 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3473 __isl_take isl_dim
*dim
, unsigned pos
)
3476 isl_basic_map
*bmap
;
3478 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3479 for (i
= 0; i
< pos
; ++i
)
3480 bmap
= var_equal(bmap
, i
);
3481 bmap
= var_more_or_equal(bmap
, pos
);
3482 return isl_basic_map_finalize(bmap
);
3485 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3486 unsigned n
, int equal
)
3488 struct isl_map
*map
;
3491 if (n
== 0 && equal
)
3492 return isl_map_universe(dims
);
3494 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3496 for (i
= 0; i
+ 1 < n
; ++i
)
3497 map
= isl_map_add_basic_map(map
,
3498 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3501 map
= isl_map_add_basic_map(map
,
3502 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3504 map
= isl_map_add_basic_map(map
,
3505 isl_basic_map_less_at(dims
, n
- 1));
3512 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3516 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3519 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3521 return map_lex_lte_first(dim
, n
, 0);
3524 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3526 return map_lex_lte_first(dim
, n
, 1);
3529 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3531 return map_lex_lte(isl_dim_map_from_set(set_dim
), 0);
3534 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3536 return map_lex_lte(isl_dim_map_from_set(set_dim
), 1);
3539 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3540 unsigned n
, int equal
)
3542 struct isl_map
*map
;
3545 if (n
== 0 && equal
)
3546 return isl_map_universe(dims
);
3548 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3550 for (i
= 0; i
+ 1 < n
; ++i
)
3551 map
= isl_map_add_basic_map(map
,
3552 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3555 map
= isl_map_add_basic_map(map
,
3556 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3558 map
= isl_map_add_basic_map(map
,
3559 isl_basic_map_more_at(dims
, n
- 1));
3566 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3570 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3573 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3575 return map_lex_gte_first(dim
, n
, 0);
3578 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3580 return map_lex_gte_first(dim
, n
, 1);
3583 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3585 return map_lex_gte(isl_dim_map_from_set(set_dim
), 0);
3588 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3590 return map_lex_gte(isl_dim_map_from_set(set_dim
), 1);
3593 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3594 __isl_take isl_set
*set2
)
3597 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3598 map
= isl_map_intersect_domain(map
, set1
);
3599 map
= isl_map_intersect_range(map
, set2
);
3603 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3604 __isl_take isl_set
*set2
)
3607 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3608 map
= isl_map_intersect_domain(map
, set1
);
3609 map
= isl_map_intersect_range(map
, set2
);
3613 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3614 __isl_take isl_set
*set2
)
3617 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3618 map
= isl_map_intersect_domain(map
, set1
);
3619 map
= isl_map_intersect_range(map
, set2
);
3623 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3624 __isl_take isl_set
*set2
)
3627 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3628 map
= isl_map_intersect_domain(map
, set1
);
3629 map
= isl_map_intersect_range(map
, set2
);
3633 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3634 __isl_take isl_map
*map2
)
3637 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3638 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3639 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3643 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3644 __isl_take isl_map
*map2
)
3647 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3648 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3649 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3653 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3654 __isl_take isl_map
*map2
)
3657 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3658 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3659 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3663 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3664 __isl_take isl_map
*map2
)
3667 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3668 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3669 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3673 struct isl_basic_map
*isl_basic_map_from_basic_set(
3674 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3676 struct isl_basic_map
*bmap
;
3678 bset
= isl_basic_set_cow(bset
);
3682 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3683 isl_dim_free(bset
->dim
);
3684 bmap
= (struct isl_basic_map
*) bset
;
3686 return isl_basic_map_finalize(bmap
);
3688 isl_basic_set_free(bset
);
3693 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3697 if (bmap
->dim
->n_in
== 0)
3698 return (struct isl_basic_set
*)bmap
;
3699 bmap
= isl_basic_map_cow(bmap
);
3702 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3705 bmap
= isl_basic_map_finalize(bmap
);
3706 return (struct isl_basic_set
*)bmap
;
3708 isl_basic_map_free(bmap
);
3712 /* For a div d = floor(f/m), add the constraints
3715 * -(f-(n-1)) + m d >= 0
3717 * Note that the second constraint is the negation of
3721 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3722 unsigned pos
, isl_int
*div
)
3725 unsigned total
= isl_basic_map_total_dim(bmap
);
3727 i
= isl_basic_map_alloc_inequality(bmap
);
3730 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3731 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3733 j
= isl_basic_map_alloc_inequality(bmap
);
3736 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3737 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3738 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3742 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3743 unsigned pos
, isl_int
*div
)
3745 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3749 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3751 unsigned total
= isl_basic_map_total_dim(bmap
);
3752 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3754 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3758 struct isl_basic_set
*isl_basic_map_underlying_set(
3759 struct isl_basic_map
*bmap
)
3763 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3765 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3766 !isl_dim_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3767 return (struct isl_basic_set
*)bmap
;
3768 bmap
= isl_basic_map_cow(bmap
);
3771 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3774 bmap
->extra
-= bmap
->n_div
;
3776 bmap
= isl_basic_map_finalize(bmap
);
3777 return (struct isl_basic_set
*)bmap
;
3782 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3783 __isl_take isl_basic_set
*bset
)
3785 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3788 struct isl_basic_map
*isl_basic_map_overlying_set(
3789 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3791 struct isl_basic_map
*bmap
;
3792 struct isl_ctx
*ctx
;
3799 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3800 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3801 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3803 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3804 isl_basic_map_free(like
);
3805 return (struct isl_basic_map
*)bset
;
3807 bset
= isl_basic_set_cow(bset
);
3810 total
= bset
->dim
->n_out
+ bset
->extra
;
3811 bmap
= (struct isl_basic_map
*)bset
;
3812 isl_dim_free(bmap
->dim
);
3813 bmap
->dim
= isl_dim_copy(like
->dim
);
3816 bmap
->n_div
= like
->n_div
;
3817 bmap
->extra
+= like
->n_div
;
3821 ltotal
= total
- bmap
->extra
+ like
->extra
;
3824 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3825 bmap
->extra
* (1 + 1 + total
));
3826 if (isl_blk_is_error(bmap
->block2
))
3828 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
3832 for (i
= 0; i
< bmap
->extra
; ++i
)
3833 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3834 for (i
= 0; i
< like
->n_div
; ++i
) {
3835 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3836 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3838 bmap
= isl_basic_map_extend_constraints(bmap
,
3839 0, 2 * like
->n_div
);
3840 for (i
= 0; i
< like
->n_div
; ++i
) {
3841 if (isl_int_is_zero(bmap
->div
[i
][0]))
3843 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3847 isl_basic_map_free(like
);
3848 bmap
= isl_basic_map_simplify(bmap
);
3849 bmap
= isl_basic_map_finalize(bmap
);
3852 isl_basic_map_free(like
);
3853 isl_basic_set_free(bset
);
3857 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3858 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3860 return (struct isl_basic_set
*)
3861 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3864 struct isl_set
*isl_set_from_underlying_set(
3865 struct isl_set
*set
, struct isl_basic_set
*like
)
3871 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3873 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3874 isl_basic_set_free(like
);
3877 set
= isl_set_cow(set
);
3880 for (i
= 0; i
< set
->n
; ++i
) {
3881 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3882 isl_basic_set_copy(like
));
3886 isl_dim_free(set
->dim
);
3887 set
->dim
= isl_dim_copy(like
->dim
);
3890 isl_basic_set_free(like
);
3893 isl_basic_set_free(like
);
3898 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3902 map
= isl_map_cow(map
);
3905 map
->dim
= isl_dim_cow(map
->dim
);
3909 for (i
= 1; i
< map
->n
; ++i
)
3910 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3912 for (i
= 0; i
< map
->n
; ++i
) {
3913 map
->p
[i
] = (struct isl_basic_map
*)
3914 isl_basic_map_underlying_set(map
->p
[i
]);
3919 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3921 isl_dim_free(map
->dim
);
3922 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3926 return (struct isl_set
*)map
;
3932 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3934 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3937 __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3938 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3940 bmap
= isl_basic_map_cow(bmap
);
3944 isl_dim_free(bmap
->dim
);
3947 bmap
= isl_basic_map_finalize(bmap
);
3951 isl_basic_map_free(bmap
);
3956 __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3957 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3959 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3963 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3964 __isl_take isl_dim
*dim
)
3968 map
= isl_map_cow(map
);
3972 for (i
= 0; i
< map
->n
; ++i
) {
3973 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3978 isl_dim_free(map
->dim
);
3988 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3989 __isl_take isl_dim
*dim
)
3991 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3994 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3997 struct isl_basic_set
*domain
;
4003 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
4005 n_in
= isl_basic_map_n_in(bmap
);
4006 n_out
= isl_basic_map_n_out(bmap
);
4007 domain
= isl_basic_set_from_basic_map(bmap
);
4008 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4010 domain
= isl_basic_set_reset_dim(domain
, dim
);
4015 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4019 return isl_dim_may_be_set(bmap
->dim
);
4022 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4026 if (isl_basic_map_may_be_set(bmap
))
4028 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4031 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4032 __isl_take isl_basic_map
*bmap
)
4036 isl_basic_map
*domain
;
4037 int nparam
, n_in
, n_out
;
4040 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4041 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4042 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4044 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
4045 domain
= isl_basic_map_universe(dim
);
4047 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4048 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4049 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4051 total
= isl_basic_map_total_dim(bmap
);
4053 for (i
= 0; i
< n_in
; ++i
) {
4054 k
= isl_basic_map_alloc_equality(bmap
);
4057 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4058 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4059 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4062 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4063 return isl_basic_map_finalize(bmap
);
4065 isl_basic_map_free(bmap
);
4069 __isl_give isl_basic_map
*isl_basic_map_range_map(
4070 __isl_take isl_basic_map
*bmap
)
4074 isl_basic_map
*range
;
4075 int nparam
, n_in
, n_out
;
4078 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4079 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4080 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4082 dim
= isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap
)));
4083 range
= isl_basic_map_universe(dim
);
4085 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4086 bmap
= isl_basic_map_apply_range(bmap
, range
);
4087 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4089 total
= isl_basic_map_total_dim(bmap
);
4091 for (i
= 0; i
< n_out
; ++i
) {
4092 k
= isl_basic_map_alloc_equality(bmap
);
4095 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4096 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4097 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4100 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4101 return isl_basic_map_finalize(bmap
);
4103 isl_basic_map_free(bmap
);
4107 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4111 return isl_dim_may_be_set(map
->dim
);
4114 struct isl_set
*isl_map_range(struct isl_map
*map
)
4117 struct isl_set
*set
;
4121 if (isl_map_may_be_set(map
))
4122 return (isl_set
*)map
;
4124 map
= isl_map_cow(map
);
4128 set
= (struct isl_set
*) map
;
4129 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
4132 for (i
= 0; i
< map
->n
; ++i
) {
4133 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4137 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4138 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4145 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4148 isl_dim
*domain_dim
;
4150 map
= isl_map_cow(map
);
4154 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
4155 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
4156 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
4159 for (i
= 0; i
< map
->n
; ++i
) {
4160 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4164 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4165 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4172 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4177 map
= isl_map_cow(map
);
4181 range_dim
= isl_dim_range(isl_map_get_dim(map
));
4182 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
4183 map
->dim
= isl_dim_join(map
->dim
, range_dim
);
4186 for (i
= 0; i
< map
->n
; ++i
) {
4187 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4191 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4192 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4199 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
4202 struct isl_map
*map
= NULL
;
4204 set
= isl_set_cow(set
);
4207 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
4208 map
= (struct isl_map
*)set
;
4209 for (i
= 0; i
< set
->n
; ++i
) {
4210 map
->p
[i
] = isl_basic_map_from_basic_set(
4211 set
->p
[i
], isl_dim_copy(dim
));
4215 isl_dim_free(map
->dim
);
4224 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4225 __isl_take isl_basic_set
*bset
)
4227 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4230 __isl_give isl_basic_map
*isl_basic_map_from_range(
4231 __isl_take isl_basic_set
*bset
)
4233 return (isl_basic_map
*)bset
;
4236 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4238 return (struct isl_map
*)set
;
4241 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4243 return isl_map_reverse(isl_map_from_range(set
));
4246 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4247 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4249 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain
),
4250 isl_basic_map_from_range(range
));
4253 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4254 __isl_take isl_set
*range
)
4256 return isl_map_apply_range(isl_map_from_domain(domain
),
4257 isl_map_from_range(range
));
4260 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4263 struct isl_set
*set
= NULL
;
4267 map
= isl_map_cow(map
);
4270 map
->dim
= isl_dim_as_set_dim(map
->dim
);
4273 set
= (struct isl_set
*)map
;
4274 for (i
= 0; i
< map
->n
; ++i
) {
4275 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4285 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
4287 struct isl_map
*map
;
4291 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4292 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4293 sizeof(struct isl_map
) +
4294 (n
- 1) * sizeof(struct isl_basic_map
*));
4298 map
->ctx
= dim
->ctx
;
4299 isl_ctx_ref(map
->ctx
);
4311 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4312 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4315 struct isl_map
*map
;
4316 struct isl_dim
*dims
;
4318 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
4322 map
= isl_map_alloc_dim(dims
, n
, flags
);
4326 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
4328 struct isl_basic_map
*bmap
;
4329 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
4330 bmap
= isl_basic_map_set_to_empty(bmap
);
4334 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
4336 struct isl_basic_set
*bset
;
4337 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
4338 bset
= isl_basic_set_set_to_empty(bset
);
4342 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4344 struct isl_basic_map
*bmap
;
4347 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4348 bmap
= isl_basic_map_set_to_empty(bmap
);
4352 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4354 struct isl_basic_map
*bmap
;
4357 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4358 bmap
= isl_basic_map_set_to_empty(bmap
);
4362 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4364 struct isl_basic_set
*bset
;
4367 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
4368 bset
= isl_basic_set_set_to_empty(bset
);
4372 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
4374 struct isl_basic_map
*bmap
;
4375 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
4376 bmap
= isl_basic_map_finalize(bmap
);
4380 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
4382 struct isl_basic_set
*bset
;
4383 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
4384 bset
= isl_basic_set_finalize(bset
);
4388 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_dim
*dim
)
4391 unsigned total
= isl_dim_total(dim
);
4392 isl_basic_map
*bmap
;
4394 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, total
);
4395 for (i
= 0; i
< total
; ++i
) {
4396 int k
= isl_basic_map_alloc_inequality(bmap
);
4399 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4400 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4404 isl_basic_map_free(bmap
);
4408 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_dim
*dim
)
4410 return isl_basic_map_nat_universe(dim
);
4413 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_dim
*dim
)
4415 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4418 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_dim
*dim
)
4420 return isl_map_nat_universe(dim
);
4423 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4424 __isl_keep isl_basic_map
*model
)
4428 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4431 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4435 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4438 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4439 __isl_keep isl_set
*model
)
4443 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
4446 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
4448 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4451 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4455 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4458 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4462 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4465 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
4467 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
4470 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4474 return isl_set_empty(isl_dim_copy(model
->dim
));
4477 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
4479 struct isl_map
*map
;
4482 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4483 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4487 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
4489 struct isl_set
*set
;
4492 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
4493 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4497 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4501 return isl_set_universe(isl_dim_copy(model
->dim
));
4504 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4507 struct isl_map
*dup
;
4511 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
4512 for (i
= 0; i
< map
->n
; ++i
)
4513 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4517 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4518 __isl_take isl_basic_map
*bmap
)
4522 if (isl_basic_map_plain_is_empty(bmap
)) {
4523 isl_basic_map_free(bmap
);
4526 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
4527 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4528 map
->p
[map
->n
] = bmap
;
4530 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4536 isl_basic_map_free(bmap
);
4540 void isl_map_free(struct isl_map
*map
)
4550 isl_ctx_deref(map
->ctx
);
4551 for (i
= 0; i
< map
->n
; ++i
)
4552 isl_basic_map_free(map
->p
[i
]);
4553 isl_dim_free(map
->dim
);
4557 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4558 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4562 base
= isl_map_cow(base
);
4566 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
4569 for (i
= 0; i
< base
->n
; ++i
) {
4570 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
4571 isl_dim_copy(base
->dim
), 0, 0, 0);
4581 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4582 unsigned nparam
, unsigned dim
)
4584 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4588 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4589 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4593 bmap
= isl_basic_map_cow(bmap
);
4594 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4595 j
= isl_basic_map_alloc_equality(bmap
);
4598 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4599 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4600 isl_int_set_si(bmap
->eq
[j
][0], value
);
4601 bmap
= isl_basic_map_simplify(bmap
);
4602 return isl_basic_map_finalize(bmap
);
4604 isl_basic_map_free(bmap
);
4608 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4609 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4613 bmap
= isl_basic_map_cow(bmap
);
4614 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4615 j
= isl_basic_map_alloc_equality(bmap
);
4618 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4619 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4620 isl_int_set(bmap
->eq
[j
][0], value
);
4621 bmap
= isl_basic_map_simplify(bmap
);
4622 return isl_basic_map_finalize(bmap
);
4624 isl_basic_map_free(bmap
);
4628 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4629 enum isl_dim_type type
, unsigned pos
, int value
)
4633 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4634 return isl_basic_map_fix_pos_si(bmap
,
4635 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4637 isl_basic_map_free(bmap
);
4641 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4642 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4646 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4647 return isl_basic_map_fix_pos(bmap
,
4648 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4650 isl_basic_map_free(bmap
);
4654 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4655 enum isl_dim_type type
, unsigned pos
, int value
)
4657 return (struct isl_basic_set
*)
4658 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4662 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4663 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4665 return (struct isl_basic_set
*)
4666 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4670 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4671 unsigned input
, int value
)
4673 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4676 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4677 unsigned dim
, int value
)
4679 return (struct isl_basic_set
*)
4680 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4681 isl_dim_set
, dim
, value
);
4684 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4685 enum isl_dim_type type
, unsigned pos
, int value
)
4689 map
= isl_map_cow(map
);
4693 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4694 for (i
= 0; i
< map
->n
; ++i
) {
4695 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4699 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4706 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4707 enum isl_dim_type type
, unsigned pos
, int value
)
4709 return (struct isl_set
*)
4710 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4713 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4714 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4718 map
= isl_map_cow(map
);
4722 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4723 for (i
= 0; i
< map
->n
; ++i
) {
4724 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4728 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4735 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4736 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4738 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4741 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4742 unsigned input
, int value
)
4744 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4747 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4749 return (struct isl_set
*)
4750 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4753 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4754 __isl_take isl_basic_map
*bmap
,
4755 enum isl_dim_type type
, unsigned pos
, int value
)
4761 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4762 pos
+= isl_basic_map_offset(bmap
, type
);
4763 bmap
= isl_basic_map_cow(bmap
);
4764 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4765 j
= isl_basic_map_alloc_inequality(bmap
);
4768 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4769 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4770 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4771 bmap
= isl_basic_map_simplify(bmap
);
4772 return isl_basic_map_finalize(bmap
);
4774 isl_basic_map_free(bmap
);
4778 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4779 unsigned dim
, isl_int value
)
4783 bset
= isl_basic_set_cow(bset
);
4784 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4785 j
= isl_basic_set_alloc_inequality(bset
);
4788 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4789 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4790 isl_int_neg(bset
->ineq
[j
][0], value
);
4791 bset
= isl_basic_set_simplify(bset
);
4792 return isl_basic_set_finalize(bset
);
4794 isl_basic_set_free(bset
);
4798 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4799 enum isl_dim_type type
, unsigned pos
, int value
)
4803 map
= isl_map_cow(map
);
4807 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4808 for (i
= 0; i
< map
->n
; ++i
) {
4809 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4814 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4821 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4822 enum isl_dim_type type
, unsigned pos
, int value
)
4824 return (struct isl_set
*)
4825 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4828 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4833 set
= isl_set_cow(set
);
4837 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4838 for (i
= 0; i
< set
->n
; ++i
) {
4839 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4849 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4853 map
= isl_map_cow(map
);
4857 map
->dim
= isl_dim_reverse(map
->dim
);
4860 for (i
= 0; i
< map
->n
; ++i
) {
4861 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4865 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4872 static struct isl_map
*isl_basic_map_partial_lexopt(
4873 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4874 struct isl_set
**empty
, int max
)
4878 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4879 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4881 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4883 isl_basic_map_free(bmap
);
4884 isl_basic_set_free(dom
);
4890 struct isl_map
*isl_basic_map_partial_lexmax(
4891 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4892 struct isl_set
**empty
)
4894 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4897 struct isl_map
*isl_basic_map_partial_lexmin(
4898 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4899 struct isl_set
**empty
)
4901 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4904 struct isl_set
*isl_basic_set_partial_lexmin(
4905 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4906 struct isl_set
**empty
)
4908 return (struct isl_set
*)
4909 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4913 struct isl_set
*isl_basic_set_partial_lexmax(
4914 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4915 struct isl_set
**empty
)
4917 return (struct isl_set
*)
4918 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4922 /* Given a basic map "bmap", compute the lexicographically minimal
4923 * (or maximal) image element for each domain element in dom.
4924 * Set *empty to those elements in dom that do not have an image element.
4926 * We first make sure the basic sets in dom are disjoint and then
4927 * simply collect the results over each of the basic sets separately.
4928 * We could probably improve the efficiency a bit by moving the union
4929 * domain down into the parametric integer programming.
4931 static __isl_give isl_map
*basic_map_partial_lexopt(
4932 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4933 __isl_give isl_set
**empty
, int max
)
4936 struct isl_map
*res
;
4938 dom
= isl_set_make_disjoint(dom
);
4942 if (isl_set_plain_is_empty(dom
)) {
4943 res
= isl_map_empty_like_basic_map(bmap
);
4944 *empty
= isl_set_empty_like(dom
);
4946 isl_basic_map_free(bmap
);
4950 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4951 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4953 for (i
= 1; i
< dom
->n
; ++i
) {
4954 struct isl_map
*res_i
;
4955 struct isl_set
*empty_i
;
4957 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4958 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4960 res
= isl_map_union_disjoint(res
, res_i
);
4961 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4965 isl_basic_map_free(bmap
);
4970 isl_basic_map_free(bmap
);
4974 /* Given a map "map", compute the lexicographically minimal
4975 * (or maximal) image element for each domain element in dom.
4976 * Set *empty to those elements in dom that do not have an image element.
4978 * We first compute the lexicographically minimal or maximal element
4979 * in the first basic map. This results in a partial solution "res"
4980 * and a subset "todo" of dom that still need to be handled.
4981 * We then consider each of the remaining maps in "map" and successively
4982 * improve both "res" and "todo".
4984 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4985 * Assume we are computing the lexicographical maximum.
4986 * We first compute the lexicographically maximal element in basic map i.
4987 * This results in a partial solution res_i and a subset todo_i.
4988 * Then we combine these results with those obtain for the first k basic maps
4989 * to obtain a result that is valid for the first k+1 basic maps.
4990 * In particular, the set where there is no solution is the set where
4991 * there is no solution for the first k basic maps and also no solution
4992 * for the ith basic map, i.e.,
4994 * todo^i = todo^k * todo_i
4996 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4997 * solutions, arbitrarily breaking ties in favor of res^k.
4998 * That is, when res^k(a) >= res_i(a), we pick res^k and
4999 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5000 * the lexicographic order.)
5001 * In practice, we compute
5003 * res^k * (res_i . "<=")
5007 * res_i * (res^k . "<")
5009 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5010 * where only one of res^k and res_i provides a solution and we simply pick
5017 * Note that we only compute these intersections when dom(res^k) intersects
5018 * dom(res_i). Otherwise, the only effect of these intersections is to
5019 * potentially break up res^k and res_i into smaller pieces.
5020 * We want to avoid such splintering as much as possible.
5021 * In fact, an earlier implementation of this function would look for
5022 * better results in the domain of res^k and for extra results in todo^k,
5023 * but this would always result in a splintering according to todo^k,
5024 * even when the domain of basic map i is disjoint from the domains of
5025 * the previous basic maps.
5027 static __isl_give isl_map
*isl_map_partial_lexopt(
5028 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5029 __isl_give isl_set
**empty
, int max
)
5032 struct isl_map
*res
;
5033 struct isl_set
*todo
;
5038 if (isl_map_plain_is_empty(map
)) {
5046 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5047 isl_set_copy(dom
), &todo
, max
);
5049 for (i
= 1; i
< map
->n
; ++i
) {
5053 isl_dim
*dim
= isl_dim_range(isl_map_get_dim(res
));
5055 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5056 isl_set_copy(dom
), &todo_i
, max
);
5059 lt
= isl_map_lex_lt(isl_dim_copy(dim
));
5060 le
= isl_map_lex_le(dim
);
5062 lt
= isl_map_lex_gt(isl_dim_copy(dim
));
5063 le
= isl_map_lex_ge(dim
);
5065 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5066 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5067 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5068 le
= isl_map_intersect(le
, isl_map_copy(res
));
5070 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5071 res
= isl_map_intersect_domain(res
,
5072 isl_set_copy(todo_i
));
5073 res_i
= isl_map_intersect_domain(res_i
,
5074 isl_set_copy(todo
));
5077 res
= isl_map_union_disjoint(res
, res_i
);
5078 res
= isl_map_union_disjoint(res
, lt
);
5079 res
= isl_map_union_disjoint(res
, le
);
5081 todo
= isl_set_intersect(todo
, todo_i
);
5101 __isl_give isl_map
*isl_map_partial_lexmax(
5102 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5103 __isl_give isl_set
**empty
)
5105 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5108 __isl_give isl_map
*isl_map_partial_lexmin(
5109 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5110 __isl_give isl_set
**empty
)
5112 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5115 __isl_give isl_set
*isl_set_partial_lexmin(
5116 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5117 __isl_give isl_set
**empty
)
5119 return (struct isl_set
*)
5120 isl_map_partial_lexmin((struct isl_map
*)set
,
5124 __isl_give isl_set
*isl_set_partial_lexmax(
5125 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5126 __isl_give isl_set
**empty
)
5128 return (struct isl_set
*)
5129 isl_map_partial_lexmax((struct isl_map
*)set
,
5133 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5135 struct isl_basic_set
*dom
= NULL
;
5136 struct isl_dim
*dom_dim
;
5140 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
5141 dom
= isl_basic_set_universe(dom_dim
);
5142 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5144 isl_basic_map_free(bmap
);
5148 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5150 return isl_basic_map_lexopt(bmap
, 0);
5153 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5155 return isl_basic_map_lexopt(bmap
, 1);
5158 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5160 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
5163 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
5165 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
5168 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
5170 struct isl_set
*dom
= NULL
;
5171 struct isl_dim
*dom_dim
;
5175 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
5176 dom
= isl_set_universe(dom_dim
);
5177 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
5183 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
5185 return isl_map_lexopt(map
, 0);
5188 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
5190 return isl_map_lexopt(map
, 1);
5193 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5195 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5198 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5200 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5203 /* Construct a map that equates the two given dimensions in the given space.
5205 static __isl_give isl_map
*equate(__isl_take isl_dim
*dim
,
5206 enum isl_dim_type src_type
, int src_pos
,
5207 enum isl_dim_type dst_type
, int dst_pos
)
5209 isl_basic_map
*bmap
;
5212 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
5213 k
= isl_basic_map_alloc_equality(bmap
);
5216 isl_seq_clr(bmap
->eq
[k
], 1 + isl_basic_map_total_dim(bmap
));
5217 src_pos
+= isl_basic_map_offset(bmap
, src_type
);
5218 dst_pos
+= isl_basic_map_offset(bmap
, dst_type
);
5219 isl_int_set_si(bmap
->eq
[k
][src_pos
], 1);
5220 isl_int_set_si(bmap
->eq
[k
][dst_pos
], -1);
5222 return isl_map_from_basic_map(bmap
);
5224 isl_basic_map_free(bmap
);
5228 /* Extract the first and only affine expression from list
5229 * and then add it to *pwaff with the given dom.
5230 * This domain is known to be disjoint from other domains
5231 * because of the way isl_basic_set_foreach_lexmax works.
5233 static int update_dim_max(__isl_take isl_basic_set
*dom
,
5234 __isl_take isl_aff_list
*list
, void *user
)
5236 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
5238 isl_pw_aff
**pwaff
= user
;
5239 isl_pw_aff
*pwaff_i
;
5241 if (isl_aff_list_n_aff(list
) != 1)
5242 isl_die(ctx
, isl_error_internal
,
5243 "expecting single element list", goto error
);
5245 aff
= isl_aff_list_get_aff(list
, 0);
5246 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
5248 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
5250 isl_aff_list_free(list
);
5254 isl_basic_set_free(dom
);
5255 isl_aff_list_free(list
);
5259 /* Given a one-dimensional basic set, compute the maximum of that
5260 * dimension as an isl_pw_aff.
5262 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5263 * call update_dim_max on each leaf of the result.
5265 static __isl_give isl_pw_aff
*basic_set_dim_max(__isl_keep isl_basic_set
*bset
)
5267 isl_dim
*dim
= isl_basic_set_get_dim(bset
);
5271 dim
= isl_dim_domain(isl_dim_from_range(dim
));
5272 pwaff
= isl_pw_aff_empty(dim
);
5274 r
= isl_basic_set_foreach_lexmax(bset
, &update_dim_max
, &pwaff
);
5276 return isl_pw_aff_free(pwaff
);
5281 /* Compute the maximum of the given set dimension as a function of the
5282 * parameters, but independently of the other set dimensions.
5284 * We first project the set onto the given dimension and then compute
5285 * the "lexicographic" maximum in each basic set, combining the results
5286 * using isl_pw_aff_union_max.
5288 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
5294 map
= isl_map_from_domain(set
);
5295 map
= isl_map_add_dims(map
, isl_dim_out
, 1);
5296 map
= isl_map_intersect(map
,
5297 equate(isl_map_get_dim(map
), isl_dim_in
, pos
,
5299 set
= isl_map_range(map
);
5304 isl_dim
*dim
= isl_set_get_dim(set
);
5305 dim
= isl_dim_domain(isl_dim_from_range(dim
));
5307 return isl_pw_aff_empty(dim
);
5310 pwaff
= basic_set_dim_max(set
->p
[0]);
5311 for (i
= 1; i
< set
->n
; ++i
) {
5312 isl_pw_aff
*pwaff_i
;
5314 pwaff_i
= basic_set_dim_max(set
->p
[i
]);
5315 pwaff
= isl_pw_aff_union_max(pwaff
, pwaff_i
);
5323 /* Apply a preimage specified by "mat" on the parameters of "bset".
5324 * bset is assumed to have only parameters and divs.
5326 static struct isl_basic_set
*basic_set_parameter_preimage(
5327 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
5334 bset
->dim
= isl_dim_cow(bset
->dim
);
5338 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5340 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5342 bset
->dim
->nparam
= 0;
5343 bset
->dim
->n_out
= nparam
;
5344 bset
= isl_basic_set_preimage(bset
, mat
);
5346 bset
->dim
->nparam
= bset
->dim
->n_out
;
5347 bset
->dim
->n_out
= 0;
5352 isl_basic_set_free(bset
);
5356 /* Apply a preimage specified by "mat" on the parameters of "set".
5357 * set is assumed to have only parameters and divs.
5359 static struct isl_set
*set_parameter_preimage(
5360 struct isl_set
*set
, struct isl_mat
*mat
)
5362 struct isl_dim
*dim
= NULL
;
5368 dim
= isl_dim_copy(set
->dim
);
5369 dim
= isl_dim_cow(dim
);
5373 nparam
= isl_set_dim(set
, isl_dim_param
);
5375 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5378 dim
->n_out
= nparam
;
5379 isl_set_reset_dim(set
, dim
);
5380 set
= isl_set_preimage(set
, mat
);
5383 dim
= isl_dim_copy(set
->dim
);
5384 dim
= isl_dim_cow(dim
);
5387 dim
->nparam
= dim
->n_out
;
5389 isl_set_reset_dim(set
, dim
);
5399 /* Intersect the basic set "bset" with the affine space specified by the
5400 * equalities in "eq".
5402 static struct isl_basic_set
*basic_set_append_equalities(
5403 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5411 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
5416 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
5417 for (i
= 0; i
< eq
->n_row
; ++i
) {
5418 k
= isl_basic_set_alloc_equality(bset
);
5421 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5422 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5426 bset
= isl_basic_set_gauss(bset
, NULL
);
5427 bset
= isl_basic_set_finalize(bset
);
5432 isl_basic_set_free(bset
);
5436 /* Intersect the set "set" with the affine space specified by the
5437 * equalities in "eq".
5439 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5447 for (i
= 0; i
< set
->n
; ++i
) {
5448 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5461 /* Project the given basic set onto its parameter domain, possibly introducing
5462 * new, explicit, existential variables in the constraints.
5463 * The input has parameters and (possibly implicit) existential variables.
5464 * The output has the same parameters, but only
5465 * explicit existentially quantified variables.
5467 * The actual projection is performed by pip, but pip doesn't seem
5468 * to like equalities very much, so we first remove the equalities
5469 * among the parameters by performing a variable compression on
5470 * the parameters. Afterward, an inverse transformation is performed
5471 * and the equalities among the parameters are inserted back in.
5473 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5477 struct isl_mat
*T
, *T2
;
5478 struct isl_set
*set
;
5479 unsigned nparam
, n_div
;
5481 bset
= isl_basic_set_cow(bset
);
5485 if (bset
->n_eq
== 0)
5486 return isl_basic_set_lexmin(bset
);
5488 isl_basic_set_gauss(bset
, NULL
);
5490 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5491 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5493 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5494 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5497 if (i
== bset
->n_eq
)
5498 return isl_basic_set_lexmin(bset
);
5500 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5502 eq
= isl_mat_cow(eq
);
5503 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5504 if (T
&& T
->n_col
== 0) {
5508 bset
= isl_basic_set_set_to_empty(bset
);
5509 return isl_set_from_basic_set(bset
);
5511 bset
= basic_set_parameter_preimage(bset
, T
);
5513 set
= isl_basic_set_lexmin(bset
);
5514 set
= set_parameter_preimage(set
, T2
);
5515 set
= set_append_equalities(set
, eq
);
5519 /* Compute an explicit representation for all the existentially
5520 * quantified variables.
5521 * The input and output dimensions are first turned into parameters.
5522 * compute_divs then returns a map with the same parameters and
5523 * no input or output dimensions and the dimension specification
5524 * is reset to that of the input.
5526 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5528 struct isl_basic_set
*bset
;
5529 struct isl_set
*set
;
5530 struct isl_map
*map
;
5531 struct isl_dim
*dim
, *orig_dim
= NULL
;
5536 bmap
= isl_basic_map_cow(bmap
);
5540 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5541 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5542 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5543 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5547 orig_dim
= bmap
->dim
;
5549 bset
= (struct isl_basic_set
*)bmap
;
5551 set
= parameter_compute_divs(bset
);
5552 map
= (struct isl_map
*)set
;
5553 map
= isl_map_reset_dim(map
, orig_dim
);
5557 isl_basic_map_free(bmap
);
5561 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5569 off
= isl_dim_total(bmap
->dim
);
5570 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5571 if (isl_int_is_zero(bmap
->div
[i
][0]))
5573 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5579 static int map_divs_known(__isl_keep isl_map
*map
)
5586 for (i
= 0; i
< map
->n
; ++i
) {
5587 int known
= isl_basic_map_divs_known(map
->p
[i
]);
5595 /* If bmap contains any unknown divs, then compute explicit
5596 * expressions for them. However, this computation may be
5597 * quite expensive, so first try to remove divs that aren't
5600 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5603 struct isl_map
*map
;
5605 known
= isl_basic_map_divs_known(bmap
);
5609 return isl_map_from_basic_map(bmap
);
5611 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5613 known
= isl_basic_map_divs_known(bmap
);
5617 return isl_map_from_basic_map(bmap
);
5619 map
= compute_divs(bmap
);
5622 isl_basic_map_free(bmap
);
5626 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5630 struct isl_map
*res
;
5637 known
= map_divs_known(map
);
5645 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5646 for (i
= 1 ; i
< map
->n
; ++i
) {
5648 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5649 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5650 res
= isl_map_union_disjoint(res
, r2
);
5652 res
= isl_map_union(res
, r2
);
5659 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5661 return (struct isl_set
*)
5662 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5665 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5667 return (struct isl_set
*)
5668 isl_map_compute_divs((struct isl_map
*)set
);
5671 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5674 struct isl_set
*set
;
5679 map
= isl_map_cow(map
);
5683 set
= (struct isl_set
*)map
;
5684 set
->dim
= isl_dim_domain(set
->dim
);
5687 for (i
= 0; i
< map
->n
; ++i
) {
5688 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5692 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5693 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5700 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
5701 __isl_take isl_map
*map2
)
5705 struct isl_map
*map
= NULL
;
5719 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
5721 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5722 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5723 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5725 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
5726 map1
->n
+ map2
->n
, flags
);
5729 for (i
= 0; i
< map1
->n
; ++i
) {
5730 map
= isl_map_add_basic_map(map
,
5731 isl_basic_map_copy(map1
->p
[i
]));
5735 for (i
= 0; i
< map2
->n
; ++i
) {
5736 map
= isl_map_add_basic_map(map
,
5737 isl_basic_map_copy(map2
->p
[i
]));
5751 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
5752 __isl_take isl_map
*map2
)
5754 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
5757 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5759 map1
= isl_map_union_disjoint(map1
, map2
);
5763 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5767 struct isl_set
*isl_set_union_disjoint(
5768 struct isl_set
*set1
, struct isl_set
*set2
)
5770 return (struct isl_set
*)
5771 isl_map_union_disjoint(
5772 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5775 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5777 return (struct isl_set
*)
5778 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5781 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
5782 __isl_take isl_set
*set
)
5785 struct isl_map
*result
;
5791 if (!isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
5792 isl_die(set
->ctx
, isl_error_invalid
,
5793 "parameters don't match", goto error
);
5795 if (isl_dim_size(set
->dim
, isl_dim_set
) != 0 &&
5796 !isl_map_compatible_range(map
, set
))
5797 isl_die(set
->ctx
, isl_error_invalid
,
5798 "incompatible spaces", goto error
);
5800 if (isl_set_plain_is_universe(set
)) {
5805 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5806 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5807 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5809 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5810 map
->n
* set
->n
, flags
);
5813 for (i
= 0; i
< map
->n
; ++i
)
5814 for (j
= 0; j
< set
->n
; ++j
) {
5815 result
= isl_map_add_basic_map(result
,
5816 isl_basic_map_intersect_range(
5817 isl_basic_map_copy(map
->p
[i
]),
5818 isl_basic_set_copy(set
->p
[j
])));
5831 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
5832 __isl_take isl_set
*set
)
5834 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
5837 struct isl_map
*isl_map_intersect_domain(
5838 struct isl_map
*map
, struct isl_set
*set
)
5840 return isl_map_reverse(
5841 isl_map_intersect_range(isl_map_reverse(map
), set
));
5844 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
5845 __isl_take isl_map
*map2
)
5849 map1
= isl_map_reverse(map1
);
5850 map1
= isl_map_apply_range(map1
, map2
);
5851 return isl_map_reverse(map1
);
5858 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
5859 __isl_take isl_map
*map2
)
5861 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
5864 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
5865 __isl_take isl_map
*map2
)
5867 struct isl_dim
*dim_result
;
5868 struct isl_map
*result
;
5874 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5875 isl_dim_copy(map2
->dim
));
5877 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5880 for (i
= 0; i
< map1
->n
; ++i
)
5881 for (j
= 0; j
< map2
->n
; ++j
) {
5882 result
= isl_map_add_basic_map(result
,
5883 isl_basic_map_apply_range(
5884 isl_basic_map_copy(map1
->p
[i
]),
5885 isl_basic_map_copy(map2
->p
[j
])));
5891 if (result
&& result
->n
<= 1)
5892 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5900 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
5901 __isl_take isl_map
*map2
)
5903 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
5907 * returns range - domain
5909 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5911 isl_dim
*dims
, *target_dim
;
5912 struct isl_basic_set
*bset
;
5919 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5920 bmap
->dim
, isl_dim_out
),
5922 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5923 dim
= isl_basic_map_n_in(bmap
);
5924 nparam
= isl_basic_map_n_param(bmap
);
5925 bset
= isl_basic_set_from_basic_map(bmap
);
5926 bset
= isl_basic_set_cow(bset
);
5927 dims
= isl_basic_set_get_dim(bset
);
5928 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5929 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5930 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5931 for (i
= 0; i
< dim
; ++i
) {
5932 int j
= isl_basic_map_alloc_equality(
5933 (struct isl_basic_map
*)bset
);
5936 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5937 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5938 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5939 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5941 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5942 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5945 isl_basic_map_free(bmap
);
5950 * returns range - domain
5952 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5956 struct isl_set
*result
;
5961 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5962 map
->dim
, isl_dim_out
),
5964 dim
= isl_map_get_dim(map
);
5965 dim
= isl_dim_domain(dim
);
5966 result
= isl_set_alloc_dim(dim
, map
->n
, 0);
5969 for (i
= 0; i
< map
->n
; ++i
)
5970 result
= isl_set_add_basic_set(result
,
5971 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5980 * returns [domain -> range] -> range - domain
5982 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
5983 __isl_take isl_basic_map
*bmap
)
5987 isl_basic_map
*domain
;
5991 if (!isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
5992 isl_die(bmap
->ctx
, isl_error_invalid
,
5993 "domain and range don't match", goto error
);
5995 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5996 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
5998 dim
= isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap
)));
5999 domain
= isl_basic_map_universe(dim
);
6001 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6002 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6003 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6005 total
= isl_basic_map_total_dim(bmap
);
6007 for (i
= 0; i
< n
; ++i
) {
6008 k
= isl_basic_map_alloc_equality(bmap
);
6011 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6012 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6013 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6014 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6017 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6018 return isl_basic_map_finalize(bmap
);
6020 isl_basic_map_free(bmap
);
6025 * returns [domain -> range] -> range - domain
6027 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6030 isl_dim
*domain_dim
;
6035 if (!isl_dim_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6036 isl_die(map
->ctx
, isl_error_invalid
,
6037 "domain and range don't match", goto error
);
6039 map
= isl_map_cow(map
);
6043 domain_dim
= isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map
)));
6044 map
->dim
= isl_dim_from_domain(isl_dim_wrap(map
->dim
));
6045 map
->dim
= isl_dim_join(map
->dim
, domain_dim
);
6048 for (i
= 0; i
< map
->n
; ++i
) {
6049 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6053 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6060 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
6062 struct isl_basic_map
*bmap
;
6070 nparam
= dims
->nparam
;
6072 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
6076 for (i
= 0; i
< dim
; ++i
) {
6077 int j
= isl_basic_map_alloc_equality(bmap
);
6080 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6081 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6082 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6084 return isl_basic_map_finalize(bmap
);
6086 isl_basic_map_free(bmap
);
6090 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_dim
*dim
)
6094 if (dim
->n_in
!= dim
->n_out
)
6095 isl_die(dim
->ctx
, isl_error_invalid
,
6096 "number of input and output dimensions needs to be "
6097 "the same", goto error
);
6098 return basic_map_identity(dim
);
6104 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6106 if (!model
|| !model
->dim
)
6108 return isl_basic_map_identity(isl_dim_copy(model
->dim
));
6111 __isl_give isl_map
*isl_map_identity(__isl_take isl_dim
*dim
)
6113 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
6116 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
6118 if (!model
|| !model
->dim
)
6120 return isl_map_identity(isl_dim_copy(model
->dim
));
6123 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
6125 if (!model
|| !model
->dim
)
6127 return isl_map_identity(isl_dim_copy(model
->dim
));
6130 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
6132 isl_dim
*dim
= isl_set_get_dim(set
);
6134 id
= isl_map_identity(isl_dim_map_from_set(dim
));
6135 return isl_map_intersect_range(id
, set
);
6138 /* Construct a basic set with all set dimensions having only non-negative
6141 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
6146 struct isl_basic_set
*bset
;
6150 nparam
= dims
->nparam
;
6152 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
6155 for (i
= 0; i
< dim
; ++i
) {
6156 int k
= isl_basic_set_alloc_inequality(bset
);
6159 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
6160 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
6164 isl_basic_set_free(bset
);
6168 /* Construct the half-space x_pos >= 0.
6170 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_dim
*dim
,
6174 isl_basic_set
*nonneg
;
6176 nonneg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
6177 k
= isl_basic_set_alloc_inequality(nonneg
);
6180 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
6181 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
6183 return isl_basic_set_finalize(nonneg
);
6185 isl_basic_set_free(nonneg
);
6189 /* Construct the half-space x_pos <= -1.
6191 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_dim
*dim
, int pos
)
6196 neg
= isl_basic_set_alloc_dim(dim
, 0, 0, 1);
6197 k
= isl_basic_set_alloc_inequality(neg
);
6200 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
6201 isl_int_set_si(neg
->ineq
[k
][0], -1);
6202 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
6204 return isl_basic_set_finalize(neg
);
6206 isl_basic_set_free(neg
);
6210 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
6211 enum isl_dim_type type
, unsigned first
, unsigned n
)
6214 isl_basic_set
*nonneg
;
6222 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
6224 for (i
= 0; i
< n
; ++i
) {
6225 nonneg
= nonneg_halfspace(isl_set_get_dim(set
),
6226 pos(set
->dim
, type
) + first
+ i
);
6227 neg
= neg_halfspace(isl_set_get_dim(set
),
6228 pos(set
->dim
, type
) + first
+ i
);
6230 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
6239 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
6240 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6247 if (isl_set_plain_is_empty(set
)) {
6252 return fn(set
, signs
, user
);
6255 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set
),
6257 half
= isl_set_intersect(half
, isl_set_copy(set
));
6258 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
6262 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set
),
6264 half
= isl_set_intersect(half
, set
);
6265 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
6271 /* Call "fn" on the intersections of "set" with each of the orthants
6272 * (except for obviously empty intersections). The orthant is identified
6273 * by the signs array, with each entry having value 1 or -1 according
6274 * to the sign of the corresponding variable.
6276 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
6277 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6287 if (isl_set_plain_is_empty(set
))
6290 nparam
= isl_set_dim(set
, isl_dim_param
);
6291 nvar
= isl_set_dim(set
, isl_dim_set
);
6293 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
6295 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
6303 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6305 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6308 int isl_basic_map_is_subset(
6309 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6312 struct isl_map
*map1
;
6313 struct isl_map
*map2
;
6315 if (!bmap1
|| !bmap2
)
6318 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
6319 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
6321 is_subset
= isl_map_is_subset(map1
, map2
);
6329 int isl_basic_map_is_equal(
6330 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6334 if (!bmap1
|| !bmap2
)
6336 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6339 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6343 int isl_basic_set_is_equal(
6344 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6346 return isl_basic_map_is_equal(
6347 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
6350 int isl_map_is_empty(struct isl_map
*map
)
6357 for (i
= 0; i
< map
->n
; ++i
) {
6358 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
6367 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
6369 return map
? map
->n
== 0 : -1;
6372 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
6374 return isl_map_plain_is_empty(map
);
6377 int isl_set_plain_is_empty(struct isl_set
*set
)
6379 return set
? set
->n
== 0 : -1;
6382 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
6384 return isl_set_plain_is_empty(set
);
6387 int isl_set_is_empty(struct isl_set
*set
)
6389 return isl_map_is_empty((struct isl_map
*)set
);
6392 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6397 return isl_dim_equal(map1
->dim
, map2
->dim
);
6400 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6405 return isl_dim_equal(set1
->dim
, set2
->dim
);
6408 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6414 is_subset
= isl_map_is_subset(map1
, map2
);
6417 is_subset
= isl_map_is_subset(map2
, map1
);
6421 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6423 return align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
6426 int isl_basic_map_is_strict_subset(
6427 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6431 if (!bmap1
|| !bmap2
)
6433 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6436 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6437 if (is_subset
== -1)
6442 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
6448 is_subset
= isl_map_is_subset(map1
, map2
);
6451 is_subset
= isl_map_is_subset(map2
, map1
);
6452 if (is_subset
== -1)
6457 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6459 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
6462 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6466 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6469 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6473 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6476 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
6483 for (i
= 0; i
< map
->n
; ++i
) {
6484 int r
= isl_basic_map_is_universe(map
->p
[i
]);
6492 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
6494 return isl_map_plain_is_universe((isl_map
*) set
);
6497 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6499 return isl_set_plain_is_universe(set
);
6502 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6504 struct isl_basic_set
*bset
= NULL
;
6505 struct isl_vec
*sample
= NULL
;
6512 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6515 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6516 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6517 copy
= isl_basic_map_remove_redundancies(copy
);
6518 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6519 isl_basic_map_free(copy
);
6523 total
= 1 + isl_basic_map_total_dim(bmap
);
6524 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6525 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6531 isl_vec_free(bmap
->sample
);
6532 bmap
->sample
= NULL
;
6533 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6536 sample
= isl_basic_set_sample_vec(bset
);
6539 empty
= sample
->size
== 0;
6540 isl_vec_free(bmap
->sample
);
6541 bmap
->sample
= sample
;
6543 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6548 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
6552 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6555 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
6557 return isl_basic_map_plain_is_empty(bmap
);
6560 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
6564 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6567 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
6569 return isl_basic_set_plain_is_empty(bset
);
6572 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6574 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6577 struct isl_map
*isl_basic_map_union(
6578 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6580 struct isl_map
*map
;
6581 if (!bmap1
|| !bmap2
)
6584 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6586 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
6589 map
= isl_map_add_basic_map(map
, bmap1
);
6590 map
= isl_map_add_basic_map(map
, bmap2
);
6593 isl_basic_map_free(bmap1
);
6594 isl_basic_map_free(bmap2
);
6598 struct isl_set
*isl_basic_set_union(
6599 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6601 return (struct isl_set
*)isl_basic_map_union(
6602 (struct isl_basic_map
*)bset1
,
6603 (struct isl_basic_map
*)bset2
);
6606 /* Order divs such that any div only depends on previous divs */
6607 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6615 off
= isl_dim_total(bmap
->dim
);
6617 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6619 if (isl_int_is_zero(bmap
->div
[i
][0]))
6621 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6625 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6631 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6633 return (struct isl_basic_set
*)
6634 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6637 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6644 for (i
= 0; i
< map
->n
; ++i
) {
6645 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6656 /* Apply the expansion computed by isl_merge_divs.
6657 * The expansion itself is given by "exp" while the resulting
6658 * list of divs is given by "div".
6660 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
6661 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
6666 bset
= isl_basic_set_cow(bset
);
6670 if (div
->n_row
< bset
->n_div
)
6671 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
6672 "not an expansion", goto error
);
6674 bset
= isl_basic_map_extend_dim(bset
, isl_dim_copy(bset
->dim
),
6675 div
->n_row
- bset
->n_div
, 0,
6676 2 * (div
->n_row
- bset
->n_div
));
6678 n_div
= bset
->n_div
;
6679 for (i
= n_div
; i
< div
->n_row
; ++i
)
6680 if (isl_basic_set_alloc_div(bset
) < 0)
6684 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
6685 if (j
>= 0 && exp
[j
] == i
) {
6687 isl_basic_map_swap_div(bset
, i
, j
);
6690 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
6691 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
6699 isl_basic_set_free(bset
);
6704 /* Look for a div in dst that corresponds to the div "div" in src.
6705 * The divs before "div" in src and dst are assumed to be the same.
6707 * Returns -1 if no corresponding div was found and the position
6708 * of the corresponding div in dst otherwise.
6710 static int find_div(struct isl_basic_map
*dst
,
6711 struct isl_basic_map
*src
, unsigned div
)
6715 unsigned total
= isl_dim_total(src
->dim
);
6717 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6718 for (i
= div
; i
< dst
->n_div
; ++i
)
6719 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6720 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6721 dst
->n_div
- div
) == -1)
6726 struct isl_basic_map
*isl_basic_map_align_divs(
6727 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6730 unsigned total
= isl_dim_total(src
->dim
);
6735 if (src
->n_div
== 0)
6738 for (i
= 0; i
< src
->n_div
; ++i
)
6739 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6741 src
= isl_basic_map_order_divs(src
);
6742 dst
= isl_basic_map_cow(dst
);
6743 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
6744 src
->n_div
, 0, 2 * src
->n_div
);
6747 for (i
= 0; i
< src
->n_div
; ++i
) {
6748 int j
= find_div(dst
, src
, i
);
6750 j
= isl_basic_map_alloc_div(dst
);
6753 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6754 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6755 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6759 isl_basic_map_swap_div(dst
, i
, j
);
6763 isl_basic_map_free(dst
);
6767 struct isl_basic_set
*isl_basic_set_align_divs(
6768 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6770 return (struct isl_basic_set
*)isl_basic_map_align_divs(
6771 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
6774 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
6782 map
= isl_map_compute_divs(map
);
6783 map
= isl_map_cow(map
);
6787 for (i
= 1; i
< map
->n
; ++i
)
6788 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
6789 for (i
= 1; i
< map
->n
; ++i
)
6790 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
6792 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6796 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
6798 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
6801 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
6802 __isl_take isl_map
*map
)
6806 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
6807 map
= isl_map_intersect_domain(map
, set
);
6808 set
= isl_map_range(map
);
6816 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
6817 __isl_take isl_map
*map
)
6819 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
6822 /* There is no need to cow as removing empty parts doesn't change
6823 * the meaning of the set.
6825 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
6832 for (i
= map
->n
-1; i
>= 0; --i
) {
6833 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
6835 isl_basic_map_free(map
->p
[i
]);
6836 if (i
!= map
->n
-1) {
6837 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6838 map
->p
[i
] = map
->p
[map
->n
-1];
6846 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
6848 return (struct isl_set
*)
6849 isl_map_remove_empty_parts((struct isl_map
*)set
);
6852 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
6854 struct isl_basic_map
*bmap
;
6855 if (!map
|| map
->n
== 0)
6857 bmap
= map
->p
[map
->n
-1];
6858 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
6859 return isl_basic_map_copy(bmap
);
6862 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
6864 return (struct isl_basic_set
*)
6865 isl_map_copy_basic_map((struct isl_map
*)set
);
6868 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
6869 __isl_keep isl_basic_map
*bmap
)
6875 for (i
= map
->n
-1; i
>= 0; --i
) {
6876 if (map
->p
[i
] != bmap
)
6878 map
= isl_map_cow(map
);
6881 isl_basic_map_free(map
->p
[i
]);
6882 if (i
!= map
->n
-1) {
6883 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
6884 map
->p
[i
] = map
->p
[map
->n
-1];
6895 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
6896 struct isl_basic_set
*bset
)
6898 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
6899 (struct isl_basic_map
*)bset
);
6902 /* Given two basic sets bset1 and bset2, compute the maximal difference
6903 * between the values of dimension pos in bset1 and those in bset2
6904 * for any common value of the parameters and dimensions preceding pos.
6906 static enum isl_lp_result
basic_set_maximal_difference_at(
6907 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
6908 int pos
, isl_int
*opt
)
6910 struct isl_dim
*dims
;
6911 struct isl_basic_map
*bmap1
= NULL
;
6912 struct isl_basic_map
*bmap2
= NULL
;
6913 struct isl_ctx
*ctx
;
6914 struct isl_vec
*obj
;
6917 unsigned dim1
, dim2
;
6918 enum isl_lp_result res
;
6920 if (!bset1
|| !bset2
)
6921 return isl_lp_error
;
6923 nparam
= isl_basic_set_n_param(bset1
);
6924 dim1
= isl_basic_set_n_dim(bset1
);
6925 dim2
= isl_basic_set_n_dim(bset2
);
6926 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
6927 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
6928 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
6929 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
6930 if (!bmap1
|| !bmap2
)
6932 bmap1
= isl_basic_map_cow(bmap1
);
6933 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
6934 pos
, (dim1
- pos
) + (dim2
- pos
),
6935 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
6936 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
6939 total
= isl_basic_map_total_dim(bmap1
);
6941 obj
= isl_vec_alloc(ctx
, 1 + total
);
6942 isl_seq_clr(obj
->block
.data
, 1 + total
);
6943 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
6944 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
6947 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
6949 isl_basic_map_free(bmap1
);
6953 isl_basic_map_free(bmap1
);
6954 isl_basic_map_free(bmap2
);
6955 return isl_lp_error
;
6958 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6959 * for any common value of the parameters and dimensions preceding pos
6960 * in both basic sets, the values of dimension pos in bset1 are
6961 * smaller or larger than those in bset2.
6964 * 1 if bset1 follows bset2
6965 * -1 if bset1 precedes bset2
6966 * 0 if bset1 and bset2 are incomparable
6967 * -2 if some error occurred.
6969 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
6970 struct isl_basic_set
*bset2
, int pos
)
6973 enum isl_lp_result res
;
6978 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
6980 if (res
== isl_lp_empty
)
6982 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
6983 res
== isl_lp_unbounded
)
6985 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
6994 /* Given two basic sets bset1 and bset2, check whether
6995 * for any common value of the parameters and dimensions preceding pos
6996 * there is a value of dimension pos in bset1 that is larger
6997 * than a value of the same dimension in bset2.
7000 * 1 if there exists such a pair
7001 * 0 if there is no such pair, but there is a pair of equal values
7003 * -2 if some error occurred.
7005 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7006 __isl_keep isl_basic_set
*bset2
, int pos
)
7009 enum isl_lp_result res
;
7014 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7016 if (res
== isl_lp_empty
)
7018 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7019 res
== isl_lp_unbounded
)
7021 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7023 else if (res
== isl_lp_ok
)
7032 /* Given two sets set1 and set2, check whether
7033 * for any common value of the parameters and dimensions preceding pos
7034 * there is a value of dimension pos in set1 that is larger
7035 * than a value of the same dimension in set2.
7038 * 1 if there exists such a pair
7039 * 0 if there is no such pair, but there is a pair of equal values
7041 * -2 if some error occurred.
7043 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7044 __isl_keep isl_set
*set2
, int pos
)
7052 for (i
= 0; i
< set1
->n
; ++i
)
7053 for (j
= 0; j
< set2
->n
; ++j
) {
7055 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7056 if (f
== 1 || f
== -2)
7065 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7066 unsigned pos
, isl_int
*val
)
7074 total
= isl_basic_map_total_dim(bmap
);
7075 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7076 for (; d
+1 > pos
; --d
)
7077 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7081 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7083 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7085 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7088 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7094 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7095 unsigned pos
, isl_int
*val
)
7107 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
7110 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
7111 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
7112 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
7113 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7117 isl_int_set(*val
, v
);
7123 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
7124 unsigned pos
, isl_int
*val
)
7126 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
7130 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
7133 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
7136 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
7137 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7139 if (pos
>= isl_basic_map_dim(bmap
, type
))
7141 return isl_basic_map_plain_has_fixed_var(bmap
,
7142 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
7145 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
7146 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7148 if (pos
>= isl_map_dim(map
, type
))
7150 return isl_map_plain_has_fixed_var(map
,
7151 map_offset(map
, type
) - 1 + pos
, val
);
7154 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
7155 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7157 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
7160 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7161 * then return this fixed value in *val.
7163 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
7164 unsigned dim
, isl_int
*val
)
7166 return isl_basic_set_plain_has_fixed_var(bset
,
7167 isl_basic_set_n_param(bset
) + dim
, val
);
7170 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7171 * then return this fixed value in *val.
7173 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
7174 unsigned dim
, isl_int
*val
)
7176 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
7179 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
7180 unsigned dim
, isl_int
*val
)
7182 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
7185 /* Check if input variable in has fixed value and if so and if val is not NULL,
7186 * then return this fixed value in *val.
7188 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
7189 unsigned in
, isl_int
*val
)
7191 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
7194 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7195 * and if val is not NULL, then return this lower bound in *val.
7197 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7198 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
7200 int i
, i_eq
= -1, i_ineq
= -1;
7207 total
= isl_basic_set_total_dim(bset
);
7208 nparam
= isl_basic_set_n_param(bset
);
7209 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7210 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
7216 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7217 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
7219 if (i_eq
!= -1 || i_ineq
!= -1)
7223 if (i_eq
== -1 && i_ineq
== -1)
7225 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
7226 /* The coefficient should always be one due to normalization. */
7227 if (!isl_int_is_one(c
[1+nparam
+dim
]))
7229 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
7231 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
7232 total
- nparam
- dim
- 1) != -1)
7235 isl_int_neg(*val
, c
[0]);
7239 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
7240 unsigned dim
, isl_int
*val
)
7252 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7256 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7258 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
7259 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
7261 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7265 isl_int_set(*val
, v
);
7276 /* uset_gist depends on constraints without existentially quantified
7277 * variables sorting first.
7279 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
7281 const struct constraint
*c1
= (const struct constraint
*)p1
;
7282 const struct constraint
*c2
= (const struct constraint
*)p2
;
7284 unsigned size
= isl_min(c1
->size
, c2
->size
);
7286 l1
= isl_seq_last_non_zero(c1
->c
, size
);
7287 l2
= isl_seq_last_non_zero(c2
->c
, size
);
7292 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
7295 static struct isl_basic_map
*isl_basic_map_sort_constraints(
7296 struct isl_basic_map
*bmap
)
7299 struct constraint
*c
;
7304 total
= isl_basic_map_total_dim(bmap
);
7305 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
7308 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7310 c
[i
].c
= bmap
->ineq
[i
];
7312 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
7313 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7314 bmap
->ineq
[i
] = c
[i
].c
;
7318 isl_basic_map_free(bmap
);
7322 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
7323 __isl_take isl_basic_set
*bset
)
7325 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
7326 (struct isl_basic_map
*)bset
);
7329 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
7333 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
7335 bmap
= isl_basic_map_remove_redundancies(bmap
);
7336 bmap
= isl_basic_map_sort_constraints(bmap
);
7337 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
7341 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
7343 return (struct isl_basic_set
*)isl_basic_map_normalize(
7344 (struct isl_basic_map
*)bset
);
7347 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
7348 const __isl_keep isl_basic_map
*bmap2
)
7355 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
7356 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
7357 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
7358 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
7359 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
7360 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
7361 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7362 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
7363 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7364 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
7365 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7367 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
7369 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7371 if (bmap1
->n_eq
!= bmap2
->n_eq
)
7372 return bmap1
->n_eq
- bmap2
->n_eq
;
7373 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
7374 return bmap1
->n_ineq
- bmap2
->n_ineq
;
7375 if (bmap1
->n_div
!= bmap2
->n_div
)
7376 return bmap1
->n_div
- bmap2
->n_div
;
7377 total
= isl_basic_map_total_dim(bmap1
);
7378 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
7379 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
7383 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
7384 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
7388 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
7389 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
7396 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
7397 __isl_keep isl_basic_map
*bmap2
)
7399 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
7402 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
7403 __isl_keep isl_basic_set
*bset2
)
7405 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
7406 (isl_basic_map
*)bset2
);
7409 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
7411 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
7412 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
7414 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
7417 /* We normalize in place, but if anything goes wrong we need
7418 * to return NULL, so we need to make sure we don't change the
7419 * meaning of any possible other copies of map.
7421 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
7424 struct isl_basic_map
*bmap
;
7428 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
7430 for (i
= 0; i
< map
->n
; ++i
) {
7431 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
7434 isl_basic_map_free(map
->p
[i
]);
7437 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
7438 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
7439 map
= isl_map_remove_empty_parts(map
);
7442 for (i
= map
->n
- 1; i
>= 1; --i
) {
7443 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
7445 isl_basic_map_free(map
->p
[i
-1]);
7446 for (j
= i
; j
< map
->n
; ++j
)
7447 map
->p
[j
-1] = map
->p
[j
];
7457 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
7459 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
7462 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7472 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
7475 map1
= isl_map_copy(map1
);
7476 map2
= isl_map_copy(map2
);
7477 map1
= isl_map_normalize(map1
);
7478 map2
= isl_map_normalize(map2
);
7481 equal
= map1
->n
== map2
->n
;
7482 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
7483 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
7496 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7498 return isl_map_plain_is_equal(map1
, map2
);
7501 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7503 return isl_map_plain_is_equal((struct isl_map
*)set1
,
7504 (struct isl_map
*)set2
);
7507 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7509 return isl_set_plain_is_equal(set1
, set2
);
7512 /* Return an interval that ranges from min to max (inclusive)
7514 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
7515 isl_int min
, isl_int max
)
7518 struct isl_basic_set
*bset
= NULL
;
7520 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
7524 k
= isl_basic_set_alloc_inequality(bset
);
7527 isl_int_set_si(bset
->ineq
[k
][1], 1);
7528 isl_int_neg(bset
->ineq
[k
][0], min
);
7530 k
= isl_basic_set_alloc_inequality(bset
);
7533 isl_int_set_si(bset
->ineq
[k
][1], -1);
7534 isl_int_set(bset
->ineq
[k
][0], max
);
7538 isl_basic_set_free(bset
);
7542 /* Return the Cartesian product of the basic sets in list (in the given order).
7544 __isl_give isl_basic_set
*isl_basic_set_list_product(
7545 __isl_take
struct isl_basic_set_list
*list
)
7553 struct isl_basic_set
*product
= NULL
;
7557 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
7558 isl_assert(list
->ctx
, list
->p
[0], goto error
);
7559 nparam
= isl_basic_set_n_param(list
->p
[0]);
7560 dim
= isl_basic_set_n_dim(list
->p
[0]);
7561 extra
= list
->p
[0]->n_div
;
7562 n_eq
= list
->p
[0]->n_eq
;
7563 n_ineq
= list
->p
[0]->n_ineq
;
7564 for (i
= 1; i
< list
->n
; ++i
) {
7565 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
7566 isl_assert(list
->ctx
,
7567 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
7568 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7569 extra
+= list
->p
[i
]->n_div
;
7570 n_eq
+= list
->p
[i
]->n_eq
;
7571 n_ineq
+= list
->p
[i
]->n_ineq
;
7573 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
7578 for (i
= 0; i
< list
->n
; ++i
) {
7579 isl_basic_set_add_constraints(product
,
7580 isl_basic_set_copy(list
->p
[i
]), dim
);
7581 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7583 isl_basic_set_list_free(list
);
7586 isl_basic_set_free(product
);
7587 isl_basic_set_list_free(list
);
7591 struct isl_basic_map
*isl_basic_map_product(
7592 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7594 struct isl_dim
*dim_result
= NULL
;
7595 struct isl_basic_map
*bmap
;
7596 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
7597 struct isl_dim_map
*dim_map1
, *dim_map2
;
7599 if (!bmap1
|| !bmap2
)
7602 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
7603 bmap2
->dim
, isl_dim_param
), goto error
);
7604 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
7605 isl_dim_copy(bmap2
->dim
));
7607 in1
= isl_basic_map_n_in(bmap1
);
7608 in2
= isl_basic_map_n_in(bmap2
);
7609 out1
= isl_basic_map_n_out(bmap1
);
7610 out2
= isl_basic_map_n_out(bmap2
);
7611 nparam
= isl_basic_map_n_param(bmap1
);
7613 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7614 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7615 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7616 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7617 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7618 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7619 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7620 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7621 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7622 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7623 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7625 bmap
= isl_basic_map_alloc_dim(dim_result
,
7626 bmap1
->n_div
+ bmap2
->n_div
,
7627 bmap1
->n_eq
+ bmap2
->n_eq
,
7628 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7629 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7630 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7631 bmap
= isl_basic_map_simplify(bmap
);
7632 return isl_basic_map_finalize(bmap
);
7634 isl_basic_map_free(bmap1
);
7635 isl_basic_map_free(bmap2
);
7639 __isl_give isl_basic_map
*isl_basic_map_flat_product(
7640 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7642 isl_basic_map
*prod
;
7644 prod
= isl_basic_map_product(bmap1
, bmap2
);
7645 prod
= isl_basic_map_flatten(prod
);
7649 __isl_give isl_basic_set
*isl_basic_set_flat_product(
7650 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
7652 return isl_basic_map_flat_product(bset1
, bset2
);
7655 __isl_give isl_basic_map
*isl_basic_map_range_product(
7656 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7658 isl_dim
*dim_result
= NULL
;
7659 isl_basic_map
*bmap
;
7660 unsigned in
, out1
, out2
, nparam
, total
, pos
;
7661 struct isl_dim_map
*dim_map1
, *dim_map2
;
7663 if (!bmap1
|| !bmap2
)
7666 dim_result
= isl_dim_range_product(isl_dim_copy(bmap1
->dim
),
7667 isl_dim_copy(bmap2
->dim
));
7669 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7670 out1
= isl_basic_map_n_out(bmap1
);
7671 out2
= isl_basic_map_n_out(bmap2
);
7672 nparam
= isl_basic_map_n_param(bmap1
);
7674 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7675 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7676 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7677 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7678 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7679 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7680 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
7681 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
7682 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7683 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7684 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7686 bmap
= isl_basic_map_alloc_dim(dim_result
,
7687 bmap1
->n_div
+ bmap2
->n_div
,
7688 bmap1
->n_eq
+ bmap2
->n_eq
,
7689 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7690 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7691 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7692 bmap
= isl_basic_map_simplify(bmap
);
7693 return isl_basic_map_finalize(bmap
);
7695 isl_basic_map_free(bmap1
);
7696 isl_basic_map_free(bmap2
);
7700 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
7701 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7703 isl_basic_map
*prod
;
7705 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
7706 prod
= isl_basic_map_flatten_range(prod
);
7710 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
7711 __isl_take isl_map
*map2
,
7712 __isl_give isl_dim
*(*dim_product
)(__isl_take isl_dim
*left
,
7713 __isl_take isl_dim
*right
),
7714 __isl_give isl_basic_map
*(*basic_map_product
)(
7715 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
7718 struct isl_map
*result
;
7724 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
7725 map2
->dim
, isl_dim_param
), goto error
);
7727 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7728 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7729 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7731 result
= isl_map_alloc_dim(dim_product(isl_dim_copy(map1
->dim
),
7732 isl_dim_copy(map2
->dim
)),
7733 map1
->n
* map2
->n
, flags
);
7736 for (i
= 0; i
< map1
->n
; ++i
)
7737 for (j
= 0; j
< map2
->n
; ++j
) {
7738 struct isl_basic_map
*part
;
7739 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
7740 isl_basic_map_copy(map2
->p
[j
]));
7741 if (isl_basic_map_is_empty(part
))
7742 isl_basic_map_free(part
);
7744 result
= isl_map_add_basic_map(result
, part
);
7757 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7759 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
7760 __isl_take isl_map
*map2
)
7762 return map_product(map1
, map2
, &isl_dim_product
, &isl_basic_map_product
);
7765 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
7766 __isl_take isl_map
*map2
)
7768 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
7771 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7773 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
7774 __isl_take isl_map
*map2
)
7778 prod
= isl_map_product(map1
, map2
);
7779 prod
= isl_map_flatten(prod
);
7783 /* Given two set A and B, construct its Cartesian product A x B.
7785 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
7787 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
7788 (struct isl_map
*)set2
);
7791 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
7792 __isl_take isl_set
*set2
)
7794 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
7797 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7799 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
7800 __isl_take isl_map
*map2
)
7802 return map_product(map1
, map2
, &isl_dim_range_product
,
7803 &isl_basic_map_range_product
);
7806 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
7807 __isl_take isl_map
*map2
)
7809 return isl_map_align_params_map_map_and(map1
, map2
,
7810 &map_range_product_aligned
);
7813 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7815 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
7816 __isl_take isl_map
*map2
)
7820 prod
= isl_map_range_product(map1
, map2
);
7821 prod
= isl_map_flatten_range(prod
);
7825 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
7828 uint32_t hash
= isl_hash_init();
7833 bmap
= isl_basic_map_copy(bmap
);
7834 bmap
= isl_basic_map_normalize(bmap
);
7837 total
= isl_basic_map_total_dim(bmap
);
7838 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
7839 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
7841 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
7842 isl_hash_hash(hash
, c_hash
);
7844 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
7845 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7847 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
7848 isl_hash_hash(hash
, c_hash
);
7850 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
7851 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7853 if (isl_int_is_zero(bmap
->div
[i
][0]))
7855 isl_hash_byte(hash
, i
& 0xFF);
7856 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
7857 isl_hash_hash(hash
, c_hash
);
7859 isl_basic_map_free(bmap
);
7863 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
7865 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
7868 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
7875 map
= isl_map_copy(map
);
7876 map
= isl_map_normalize(map
);
7880 hash
= isl_hash_init();
7881 for (i
= 0; i
< map
->n
; ++i
) {
7883 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
7884 isl_hash_hash(hash
, bmap_hash
);
7892 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
7894 return isl_map_get_hash((isl_map
*)set
);
7897 /* Check if the value for dimension dim is completely determined
7898 * by the values of the other parameters and variables.
7899 * That is, check if dimension dim is involved in an equality.
7901 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
7908 nparam
= isl_basic_set_n_param(bset
);
7909 for (i
= 0; i
< bset
->n_eq
; ++i
)
7910 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
7915 /* Check if the value for dimension dim is completely determined
7916 * by the values of the other parameters and variables.
7917 * That is, check if dimension dim is involved in an equality
7918 * for each of the subsets.
7920 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
7926 for (i
= 0; i
< set
->n
; ++i
) {
7928 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
7935 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
7937 return set
? set
->n
: 0;
7940 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
7941 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
7948 for (i
= 0; i
< map
->n
; ++i
)
7949 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
7955 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
7956 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
7963 for (i
= 0; i
< set
->n
; ++i
)
7964 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
7970 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
7972 struct isl_dim
*dim
;
7977 bset
= isl_basic_set_cow(bset
);
7981 dim
= isl_basic_set_get_dim(bset
);
7982 dim
= isl_dim_lift(dim
, bset
->n_div
);
7985 isl_dim_free(bset
->dim
);
7987 bset
->extra
-= bset
->n_div
;
7990 bset
= isl_basic_set_finalize(bset
);
7994 isl_basic_set_free(bset
);
7998 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
8001 struct isl_dim
*dim
;
8004 set
= isl_set_align_divs(set
);
8009 set
= isl_set_cow(set
);
8013 n_div
= set
->p
[0]->n_div
;
8014 dim
= isl_set_get_dim(set
);
8015 dim
= isl_dim_lift(dim
, n_div
);
8018 isl_dim_free(set
->dim
);
8021 for (i
= 0; i
< set
->n
; ++i
) {
8022 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
8033 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
8035 struct isl_dim
*dim
;
8036 struct isl_basic_map
*bmap
;
8043 set
= isl_set_align_divs(set
);
8048 dim
= isl_set_get_dim(set
);
8049 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
8051 return isl_map_identity(isl_dim_map_from_set(dim
));
8054 n_div
= set
->p
[0]->n_div
;
8055 dim
= isl_dim_map_from_set(dim
);
8056 n_param
= isl_dim_size(dim
, isl_dim_param
);
8057 n_set
= isl_dim_size(dim
, isl_dim_in
);
8058 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
8059 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
8060 for (i
= 0; i
< n_set
; ++i
)
8061 bmap
= var_equal(bmap
, i
);
8063 total
= n_param
+ n_set
+ n_set
+ n_div
;
8064 for (i
= 0; i
< n_div
; ++i
) {
8065 k
= isl_basic_map_alloc_inequality(bmap
);
8068 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
8069 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
8070 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
8071 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
8072 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
8073 set
->p
[0]->div
[i
][0]);
8075 l
= isl_basic_map_alloc_inequality(bmap
);
8078 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
8079 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
8080 set
->p
[0]->div
[i
][0]);
8081 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
8085 bmap
= isl_basic_map_simplify(bmap
);
8086 bmap
= isl_basic_map_finalize(bmap
);
8087 return isl_map_from_basic_map(bmap
);
8090 isl_basic_map_free(bmap
);
8094 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
8102 dim
= isl_basic_set_total_dim(bset
);
8103 size
+= bset
->n_eq
* (1 + dim
);
8104 size
+= bset
->n_ineq
* (1 + dim
);
8105 size
+= bset
->n_div
* (2 + dim
);
8110 int isl_set_size(__isl_keep isl_set
*set
)
8118 for (i
= 0; i
< set
->n
; ++i
)
8119 size
+= isl_basic_set_size(set
->p
[i
]);
8124 /* Check if there is any lower bound (if lower == 0) and/or upper
8125 * bound (if upper == 0) on the specified dim.
8127 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8128 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
8135 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
8137 pos
+= isl_basic_map_offset(bmap
, type
);
8139 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8140 if (isl_int_is_zero(bmap
->div
[i
][0]))
8142 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
8146 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8147 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
8150 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8151 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
8158 return lower
&& upper
;
8161 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8162 enum isl_dim_type type
, unsigned pos
)
8164 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
8167 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
8168 enum isl_dim_type type
, unsigned pos
)
8170 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
8173 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
8174 enum isl_dim_type type
, unsigned pos
)
8176 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
8179 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
8180 enum isl_dim_type type
, unsigned pos
)
8187 for (i
= 0; i
< map
->n
; ++i
) {
8189 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
8190 if (bounded
< 0 || !bounded
)
8197 /* Return 1 if the specified dim is involved in both an upper bound
8198 * and a lower bound.
8200 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
8201 enum isl_dim_type type
, unsigned pos
)
8203 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
8206 static int has_bound(__isl_keep isl_map
*map
,
8207 enum isl_dim_type type
, unsigned pos
,
8208 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
8209 enum isl_dim_type type
, unsigned pos
))
8216 for (i
= 0; i
< map
->n
; ++i
) {
8218 bounded
= fn(map
->p
[i
], type
, pos
);
8219 if (bounded
< 0 || bounded
)
8226 /* Return 1 if the specified dim is involved in any lower bound.
8228 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
8229 enum isl_dim_type type
, unsigned pos
)
8231 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
8234 /* Return 1 if the specified dim is involved in any upper bound.
8236 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
8237 enum isl_dim_type type
, unsigned pos
)
8239 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
8242 /* For each of the "n" variables starting at "first", determine
8243 * the sign of the variable and put the results in the first "n"
8244 * elements of the array "signs".
8246 * 1 means that the variable is non-negative
8247 * -1 means that the variable is non-positive
8248 * 0 means the variable attains both positive and negative values.
8250 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
8251 unsigned first
, unsigned n
, int *signs
)
8253 isl_vec
*bound
= NULL
;
8254 struct isl_tab
*tab
= NULL
;
8255 struct isl_tab_undo
*snap
;
8258 if (!bset
|| !signs
)
8261 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
8262 tab
= isl_tab_from_basic_set(bset
);
8266 isl_seq_clr(bound
->el
, bound
->size
);
8267 isl_int_set_si(bound
->el
[0], -1);
8269 snap
= isl_tab_snap(tab
);
8270 for (i
= 0; i
< n
; ++i
) {
8273 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
8274 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8277 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8278 if (isl_tab_rollback(tab
, snap
) < 0)
8286 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
8287 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8290 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8291 if (isl_tab_rollback(tab
, snap
) < 0)
8294 signs
[i
] = empty
? -1 : 0;
8298 isl_vec_free(bound
);
8302 isl_vec_free(bound
);
8306 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
8307 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
8309 if (!bset
|| !signs
)
8311 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
8314 first
+= pos(bset
->dim
, type
) - 1;
8315 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
8318 /* Check if the given basic map is obviously single-valued.
8319 * In particular, for each output dimension, check that there is
8320 * an equality that defines the output dimension in terms of
8321 * earlier dimensions.
8323 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
8333 total
= 1 + isl_basic_map_total_dim(bmap
);
8334 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
8335 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
8337 for (i
= 0; i
< n_out
; ++i
) {
8338 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
8339 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
8341 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
8342 total
- (o_out
+ i
+ 1)) == -1)
8345 if (j
>= bmap
->n_eq
)
8352 /* Check if the given map is obviously single-valued.
8354 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
8363 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
8366 /* Check if the given map is single-valued.
8371 * and check if the result is a subset of the identity mapping.
8373 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
8380 sv
= isl_map_plain_is_single_valued(map
);
8384 test
= isl_map_reverse(isl_map_copy(map
));
8385 test
= isl_map_apply_range(test
, isl_map_copy(map
));
8387 dim
= isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map
)));
8388 id
= isl_map_identity(dim
);
8390 sv
= isl_map_is_subset(test
, id
);
8398 int isl_map_is_injective(__isl_keep isl_map
*map
)
8402 map
= isl_map_copy(map
);
8403 map
= isl_map_reverse(map
);
8404 in
= isl_map_is_single_valued(map
);
8410 /* Check if the given map is obviously injective.
8412 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
8416 map
= isl_map_copy(map
);
8417 map
= isl_map_reverse(map
);
8418 in
= isl_map_plain_is_single_valued(map
);
8424 int isl_map_is_bijective(__isl_keep isl_map
*map
)
8428 sv
= isl_map_is_single_valued(map
);
8432 return isl_map_is_injective(map
);
8435 int isl_set_is_singleton(__isl_keep isl_set
*set
)
8437 return isl_map_is_single_valued((isl_map
*)set
);
8440 int isl_map_is_translation(__isl_keep isl_map
*map
)
8445 delta
= isl_map_deltas(isl_map_copy(map
));
8446 ok
= isl_set_is_singleton(delta
);
8447 isl_set_free(delta
);
8452 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
8454 if (isl_seq_first_non_zero(p
, pos
) != -1)
8456 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
8461 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
8470 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
8473 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
8474 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
8475 for (j
= 0; j
< nvar
; ++j
) {
8476 int lower
= 0, upper
= 0;
8477 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8478 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
8480 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
8486 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8487 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
8489 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
8491 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
8496 if (!lower
|| !upper
)
8503 int isl_set_is_box(__isl_keep isl_set
*set
)
8510 return isl_basic_set_is_box(set
->p
[0]);
8513 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
8518 return isl_dim_is_wrapping(bset
->dim
);
8521 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
8526 return isl_dim_is_wrapping(set
->dim
);
8529 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
8531 bmap
= isl_basic_map_cow(bmap
);
8535 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
8539 bmap
= isl_basic_map_finalize(bmap
);
8541 return (isl_basic_set
*)bmap
;
8543 isl_basic_map_free(bmap
);
8547 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
8551 map
= isl_map_cow(map
);
8555 for (i
= 0; i
< map
->n
; ++i
) {
8556 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
8560 map
->dim
= isl_dim_wrap(map
->dim
);
8564 return (isl_set
*)map
;
8570 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
8572 bset
= isl_basic_set_cow(bset
);
8576 bset
->dim
= isl_dim_unwrap(bset
->dim
);
8580 bset
= isl_basic_set_finalize(bset
);
8582 return (isl_basic_map
*)bset
;
8584 isl_basic_set_free(bset
);
8588 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
8595 if (!isl_set_is_wrapping(set
))
8596 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
8599 set
= isl_set_cow(set
);
8603 for (i
= 0; i
< set
->n
; ++i
) {
8604 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
8609 set
->dim
= isl_dim_unwrap(set
->dim
);
8613 return (isl_map
*)set
;
8619 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
8620 enum isl_dim_type type
)
8625 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
8628 bmap
= isl_basic_map_cow(bmap
);
8632 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
8636 bmap
= isl_basic_map_finalize(bmap
);
8640 isl_basic_map_free(bmap
);
8644 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
8645 enum isl_dim_type type
)
8652 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
8655 map
= isl_map_cow(map
);
8659 for (i
= 0; i
< map
->n
; ++i
) {
8660 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
8664 map
->dim
= isl_dim_reset(map
->dim
, type
);
8674 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
8679 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
8682 bmap
= isl_basic_map_cow(bmap
);
8686 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
8690 bmap
= isl_basic_map_finalize(bmap
);
8694 isl_basic_map_free(bmap
);
8698 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
8700 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
8703 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
8704 __isl_take isl_basic_map
*bmap
)
8709 if (!bmap
->dim
->nested
[1])
8712 bmap
= isl_basic_map_cow(bmap
);
8716 bmap
->dim
= isl_dim_flatten_range(bmap
->dim
);
8720 bmap
= isl_basic_map_finalize(bmap
);
8724 isl_basic_map_free(bmap
);
8728 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
8735 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
8738 map
= isl_map_cow(map
);
8742 for (i
= 0; i
< map
->n
; ++i
) {
8743 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
8747 map
->dim
= isl_dim_flatten(map
->dim
);
8757 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
8759 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
8762 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
8764 isl_dim
*dim
, *flat_dim
;
8767 dim
= isl_set_get_dim(set
);
8768 flat_dim
= isl_dim_flatten(isl_dim_copy(dim
));
8769 map
= isl_map_identity(isl_dim_join(isl_dim_reverse(dim
), flat_dim
));
8770 map
= isl_map_intersect_domain(map
, set
);
8775 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
8782 if (!map
->dim
->nested
[1])
8785 map
= isl_map_cow(map
);
8789 for (i
= 0; i
< map
->n
; ++i
) {
8790 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
8794 map
->dim
= isl_dim_flatten_range(map
->dim
);
8804 /* Reorder the dimensions of "bmap" according to the given dim_map
8805 * and set the dimension specification to "dim".
8807 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
8808 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
8812 bmap
= isl_basic_map_cow(bmap
);
8813 if (!bmap
|| !dim
|| !dim_map
)
8816 res
= isl_basic_map_alloc_dim(dim
,
8817 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
8818 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
8819 res
= isl_basic_map_finalize(res
);
8823 isl_basic_map_free(bmap
);
8828 /* Reorder the dimensions of "map" according to given reordering.
8830 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
8831 __isl_take isl_reordering
*r
)
8834 struct isl_dim_map
*dim_map
;
8836 map
= isl_map_cow(map
);
8837 dim_map
= isl_dim_map_from_reordering(r
);
8838 if (!map
|| !r
|| !dim_map
)
8841 for (i
= 0; i
< map
->n
; ++i
) {
8842 struct isl_dim_map
*dim_map_i
;
8844 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
8846 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
8847 isl_dim_copy(r
->dim
), dim_map_i
);
8853 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
8855 isl_reordering_free(r
);
8861 isl_reordering_free(r
);
8865 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
8866 __isl_take isl_reordering
*r
)
8868 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
8871 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
8872 __isl_take isl_dim
*model
)
8879 ctx
= isl_dim_get_ctx(model
);
8880 if (!isl_dim_has_named_params(model
))
8881 isl_die(ctx
, isl_error_invalid
,
8882 "model has unnamed parameters", goto error
);
8883 if (!isl_dim_has_named_params(map
->dim
))
8884 isl_die(ctx
, isl_error_invalid
,
8885 "relation has unnamed parameters", goto error
);
8886 if (!isl_dim_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
8887 isl_reordering
*exp
;
8889 model
= isl_dim_drop(model
, isl_dim_in
,
8890 0, isl_dim_size(model
, isl_dim_in
));
8891 model
= isl_dim_drop(model
, isl_dim_out
,
8892 0, isl_dim_size(model
, isl_dim_out
));
8893 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
8894 exp
= isl_reordering_extend_dim(exp
, isl_map_get_dim(map
));
8895 map
= isl_map_realign(map
, exp
);
8898 isl_dim_free(model
);
8901 isl_dim_free(model
);
8906 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
8907 __isl_take isl_dim
*model
)
8909 return isl_map_align_params(set
, model
);
8912 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
8913 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8914 enum isl_dim_type c2
, enum isl_dim_type c3
,
8915 enum isl_dim_type c4
, enum isl_dim_type c5
)
8917 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8918 struct isl_mat
*mat
;
8924 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
8925 isl_basic_map_total_dim(bmap
) + 1);
8928 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8929 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8930 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8931 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8932 isl_int_set(mat
->row
[i
][pos
],
8933 bmap
->eq
[i
][off
+ k
]);
8941 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
8942 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
8943 enum isl_dim_type c2
, enum isl_dim_type c3
,
8944 enum isl_dim_type c4
, enum isl_dim_type c5
)
8946 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8947 struct isl_mat
*mat
;
8953 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
8954 isl_basic_map_total_dim(bmap
) + 1);
8957 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8958 for (j
= 0, pos
= 0; j
< 5; ++j
) {
8959 int off
= isl_basic_map_offset(bmap
, c
[j
]);
8960 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
8961 isl_int_set(mat
->row
[i
][pos
],
8962 bmap
->ineq
[i
][off
+ k
]);
8970 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
8971 __isl_take isl_dim
*dim
,
8972 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
8973 enum isl_dim_type c2
, enum isl_dim_type c3
,
8974 enum isl_dim_type c4
, enum isl_dim_type c5
)
8976 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
8977 isl_basic_map
*bmap
;
8983 if (!dim
|| !eq
|| !ineq
)
8986 if (eq
->n_col
!= ineq
->n_col
)
8987 isl_die(dim
->ctx
, isl_error_invalid
,
8988 "equalities and inequalities matrices should have "
8989 "same number of columns", goto error
);
8991 total
= 1 + isl_dim_total(dim
);
8993 if (eq
->n_col
< total
)
8994 isl_die(dim
->ctx
, isl_error_invalid
,
8995 "number of columns too small", goto error
);
8997 extra
= eq
->n_col
- total
;
8999 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(dim
), extra
,
9000 eq
->n_row
, ineq
->n_row
);
9003 for (i
= 0; i
< extra
; ++i
) {
9004 k
= isl_basic_map_alloc_div(bmap
);
9007 isl_int_set_si(bmap
->div
[k
][0], 0);
9009 for (i
= 0; i
< eq
->n_row
; ++i
) {
9010 l
= isl_basic_map_alloc_equality(bmap
);
9013 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9014 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9015 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9016 isl_int_set(bmap
->eq
[l
][off
+ k
],
9022 for (i
= 0; i
< ineq
->n_row
; ++i
) {
9023 l
= isl_basic_map_alloc_inequality(bmap
);
9026 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9027 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9028 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9029 isl_int_set(bmap
->ineq
[l
][off
+ k
],
9048 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
9049 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9050 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9052 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
9053 c1
, c2
, c3
, c4
, isl_dim_in
);
9056 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
9057 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9058 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9060 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
9061 c1
, c2
, c3
, c4
, isl_dim_in
);
9064 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
9065 __isl_take isl_dim
*dim
,
9066 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9067 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9069 return (isl_basic_set
*)
9070 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
9071 c1
, c2
, c3
, c4
, isl_dim_in
);
9074 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
9079 return isl_dim_can_zip(bmap
->dim
);
9082 int isl_map_can_zip(__isl_keep isl_map
*map
)
9087 return isl_dim_can_zip(map
->dim
);
9090 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9091 * (A -> C) -> (B -> D).
9093 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
9102 if (!isl_basic_map_can_zip(bmap
))
9103 isl_die(bmap
->ctx
, isl_error_invalid
,
9104 "basic map cannot be zipped", goto error
);
9105 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
9106 isl_dim_size(bmap
->dim
->nested
[0], isl_dim_in
);
9107 n1
= isl_dim_size(bmap
->dim
->nested
[0], isl_dim_out
);
9108 n2
= isl_dim_size(bmap
->dim
->nested
[1], isl_dim_in
);
9109 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
9112 bmap
->dim
= isl_dim_zip(bmap
->dim
);
9117 isl_basic_map_free(bmap
);
9121 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9122 * (A -> C) -> (B -> D).
9124 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
9131 if (!isl_map_can_zip(map
))
9132 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
9135 map
= isl_map_cow(map
);
9139 for (i
= 0; i
< map
->n
; ++i
) {
9140 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
9145 map
->dim
= isl_dim_zip(map
->dim
);
9155 /* Construct a basic map mapping the domain of the affine expression
9156 * to a one-dimensional range prescribed by the affine expression.
9158 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
9162 isl_local_space
*ls
;
9163 isl_basic_map
*bmap
;
9168 ls
= isl_aff_get_local_space(aff
);
9169 ls
= isl_local_space_from_domain(ls
);
9170 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
9171 bmap
= isl_basic_map_from_local_space(ls
);
9172 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
9173 k
= isl_basic_map_alloc_equality(bmap
);
9177 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
9178 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
9179 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
9180 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
9181 aff
->v
->size
- (pos
+ 1));
9184 bmap
= isl_basic_map_finalize(bmap
);
9188 isl_basic_map_free(bmap
);
9192 /* Construct a basic map mapping a domain in the given space to
9193 * to an n-dimensional range, with n the number of elements in the list,
9194 * where each coordinate in the range is prescribed by the
9195 * corresponding affine expression.
9196 * The domains of all affine expressions in the list are assumed to match
9199 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
9200 __isl_take isl_dim
*domain_dim
, __isl_take isl_aff_list
*list
)
9204 isl_basic_map
*bmap
;
9209 dim
= isl_dim_from_domain(domain_dim
);
9210 bmap
= isl_basic_map_universe(dim
);
9212 for (i
= 0; i
< list
->n
; ++i
) {
9214 isl_basic_map
*bmap_i
;
9216 aff
= isl_aff_copy(list
->p
[i
]);
9217 bmap_i
= isl_basic_map_from_aff(aff
);
9219 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
9222 isl_aff_list_free(list
);
9226 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
9227 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9229 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
9232 /* Add a constraint imposing that the given two dimensions are equal.
9234 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
9235 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9237 isl_basic_map
*bmap
= NULL
;
9243 if (pos1
>= isl_map_dim(map
, type1
))
9244 isl_die(map
->ctx
, isl_error_invalid
,
9245 "index out of bounds", goto error
);
9246 if (pos2
>= isl_map_dim(map
, type2
))
9247 isl_die(map
->ctx
, isl_error_invalid
,
9248 "index out of bounds", goto error
);
9250 bmap
= isl_basic_map_alloc_dim(isl_map_get_dim(map
), 0, 1, 0);
9251 i
= isl_basic_map_alloc_equality(bmap
);
9254 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
9255 pos1
+= isl_basic_map_offset(bmap
, type1
);
9256 pos2
+= isl_basic_map_offset(bmap
, type2
);
9257 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
9258 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
9259 bmap
= isl_basic_map_finalize(bmap
);
9261 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
9265 isl_basic_map_free(bmap
);
9270 /* Add a constraint imposing that the given two dimensions have opposite values.
9272 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
9273 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9275 isl_basic_map
*bmap
= NULL
;
9281 if (pos1
>= isl_map_dim(map
, type1
))
9282 isl_die(map
->ctx
, isl_error_invalid
,
9283 "index out of bounds", goto error
);
9284 if (pos2
>= isl_map_dim(map
, type2
))
9285 isl_die(map
->ctx
, isl_error_invalid
,
9286 "index out of bounds", goto error
);
9288 bmap
= isl_basic_map_alloc_dim(isl_map_get_dim(map
), 0, 1, 0);
9289 i
= isl_basic_map_alloc_equality(bmap
);
9292 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
9293 pos1
+= isl_basic_map_offset(bmap
, type1
);
9294 pos2
+= isl_basic_map_offset(bmap
, type2
);
9295 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
9296 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
9297 bmap
= isl_basic_map_finalize(bmap
);
9299 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
9303 isl_basic_map_free(bmap
);