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_space_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(__isl_keep isl_space
*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(__isl_keep isl_space
*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(__isl_keep isl_basic_map
*bmap
,
56 enum isl_dim_type type
)
61 case isl_dim_cst
: return 1;
64 case isl_dim_out
: return isl_space_dim(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(__isl_keep isl_map
*map
, enum isl_dim_type type
)
73 return map
? n(map
->dim
, type
) : 0;
76 unsigned isl_set_dim(__isl_keep 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 isl_space
*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(__isl_keep isl_basic_set
*bset
,
107 enum isl_dim_type type
)
109 return isl_basic_map_dim(bset
, type
);
112 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
114 return isl_basic_set_dim(bset
, isl_dim_set
);
117 unsigned isl_basic_set_n_param(__isl_keep 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_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
127 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
129 return isl_set_dim(set
, isl_dim_set
);
132 unsigned isl_set_n_param(__isl_keep 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_space_dim(bmap
->dim
, isl_dim_all
) + 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_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
185 return isl_space_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_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
197 return isl_space_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_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
208 return isl_space_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_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
220 return isl_space_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 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
247 return isl_space_copy(bmap
->dim
);
250 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
254 return isl_space_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_space_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_space(isl_local_space_get_space(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 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
326 return isl_space_copy(map
->dim
);
329 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
333 return isl_space_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_space_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_space_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_space_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_space_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_space_set_tuple_id(map
->dim
, type
, id
);
410 return isl_map_reset_space(map
, isl_space_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_space_reset_tuple_id(map
->dim
, type
);
428 return isl_map_reset_space(map
, isl_space_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 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
438 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
441 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
442 enum isl_dim_type type
)
444 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
447 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
449 return isl_map_has_tuple_id(set
, isl_dim_set
);
452 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
454 return isl_map_get_tuple_id(set
, isl_dim_set
);
457 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
459 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
462 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
464 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
467 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
468 enum isl_dim_type type
, unsigned pos
)
470 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
473 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
474 enum isl_dim_type type
, unsigned pos
)
476 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
479 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
480 enum isl_dim_type type
, unsigned pos
)
482 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
485 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
486 enum isl_dim_type type
, unsigned pos
)
488 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
491 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
492 __isl_take isl_basic_map
*bmap
,
493 enum isl_dim_type type
, unsigned pos
, const char *s
)
497 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
502 isl_basic_map_free(bmap
);
506 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
507 enum isl_dim_type type
, unsigned pos
, const char *s
)
514 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
518 for (i
= 0; i
< map
->n
; ++i
) {
519 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
530 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
531 __isl_take isl_basic_set
*bset
,
532 enum isl_dim_type type
, unsigned pos
, const char *s
)
534 return (isl_basic_set
*)isl_basic_map_set_dim_name(
535 (isl_basic_map
*)bset
, type
, pos
, s
);
538 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
539 enum isl_dim_type type
, unsigned pos
, const char *s
)
541 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
544 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
545 enum isl_dim_type type
, unsigned pos
)
547 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
550 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
551 enum isl_dim_type type
, unsigned pos
)
553 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
556 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
557 enum isl_dim_type type
, unsigned pos
)
559 return isl_map_has_dim_id(set
, type
, pos
);
562 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
563 enum isl_dim_type type
, unsigned pos
)
565 return isl_map_get_dim_id(set
, type
, pos
);
568 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
569 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
571 map
= isl_map_cow(map
);
573 return isl_id_free(id
);
575 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
577 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
580 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
581 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
583 return isl_map_set_dim_id(set
, type
, pos
, id
);
586 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
587 __isl_keep isl_id
*id
)
591 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
594 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
595 __isl_keep isl_id
*id
)
597 return isl_map_find_dim_by_id(set
, type
, id
);
600 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
604 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
607 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
609 return isl_basic_map_is_rational(bset
);
612 /* Is this basic set a parameter domain?
614 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
618 return isl_space_is_params(bset
->dim
);
621 /* Is this set a parameter domain?
623 int isl_set_is_params(__isl_keep isl_set
*set
)
627 return isl_space_is_params(set
->dim
);
630 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
631 struct isl_basic_map
*bmap
, unsigned extra
,
632 unsigned n_eq
, unsigned n_ineq
)
635 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
640 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
641 if (isl_blk_is_error(bmap
->block
))
644 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
649 bmap
->block2
= isl_blk_empty();
652 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
653 if (isl_blk_is_error(bmap
->block2
))
656 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
661 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
662 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
664 for (i
= 0; i
< extra
; ++i
)
665 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
669 bmap
->c_size
= n_eq
+ n_ineq
;
670 bmap
->eq
= bmap
->ineq
+ n_ineq
;
679 isl_basic_map_free(bmap
);
683 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
684 unsigned nparam
, unsigned dim
, unsigned extra
,
685 unsigned n_eq
, unsigned n_ineq
)
687 struct isl_basic_map
*bmap
;
690 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
694 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
695 return (struct isl_basic_set
*)bmap
;
698 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
699 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
701 struct isl_basic_map
*bmap
;
704 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
705 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
706 return (struct isl_basic_set
*)bmap
;
712 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
713 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
715 struct isl_basic_map
*bmap
;
719 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
724 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
730 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
731 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
732 unsigned n_eq
, unsigned n_ineq
)
734 struct isl_basic_map
*bmap
;
737 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
741 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
745 static void dup_constraints(
746 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
749 unsigned total
= isl_basic_map_total_dim(src
);
751 for (i
= 0; i
< src
->n_eq
; ++i
) {
752 int j
= isl_basic_map_alloc_equality(dst
);
753 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
756 for (i
= 0; i
< src
->n_ineq
; ++i
) {
757 int j
= isl_basic_map_alloc_inequality(dst
);
758 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
761 for (i
= 0; i
< src
->n_div
; ++i
) {
762 int j
= isl_basic_map_alloc_div(dst
);
763 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
765 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
768 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
770 struct isl_basic_map
*dup
;
774 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
775 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
778 dup_constraints(dup
, bmap
);
779 dup
->flags
= bmap
->flags
;
780 dup
->sample
= isl_vec_copy(bmap
->sample
);
784 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
786 struct isl_basic_map
*dup
;
788 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
789 return (struct isl_basic_set
*)dup
;
792 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
797 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
801 return isl_basic_set_dup(bset
);
804 struct isl_set
*isl_set_copy(struct isl_set
*set
)
813 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
818 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
822 bmap
= isl_basic_map_dup(bmap
);
824 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
828 struct isl_map
*isl_map_copy(struct isl_map
*map
)
837 void isl_basic_map_free(struct isl_basic_map
*bmap
)
845 isl_ctx_deref(bmap
->ctx
);
847 isl_blk_free(bmap
->ctx
, bmap
->block2
);
849 isl_blk_free(bmap
->ctx
, bmap
->block
);
850 isl_vec_free(bmap
->sample
);
851 isl_space_free(bmap
->dim
);
855 void isl_basic_set_free(struct isl_basic_set
*bset
)
857 isl_basic_map_free((struct isl_basic_map
*)bset
);
860 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
862 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
865 __isl_give isl_map
*isl_map_align_params_map_map_and(
866 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
867 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
868 __isl_take isl_map
*map2
))
872 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
873 return fn(map1
, map2
);
874 if (!isl_space_has_named_params(map1
->dim
) ||
875 !isl_space_has_named_params(map2
->dim
))
876 isl_die(map1
->ctx
, isl_error_invalid
,
877 "unaligned unnamed parameters", goto error
);
878 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
879 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
880 return fn(map1
, map2
);
887 static int align_params_map_map_and_test(__isl_keep isl_map
*map1
,
888 __isl_keep isl_map
*map2
,
889 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
895 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
896 return fn(map1
, map2
);
897 if (!isl_space_has_named_params(map1
->dim
) ||
898 !isl_space_has_named_params(map2
->dim
))
899 isl_die(map1
->ctx
, isl_error_invalid
,
900 "unaligned unnamed parameters", return -1);
901 map1
= isl_map_copy(map1
);
902 map2
= isl_map_copy(map2
);
903 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
904 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
911 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
917 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
918 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
920 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
921 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
922 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
923 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
924 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
925 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
927 int j
= isl_basic_map_alloc_inequality(bmap
);
931 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
932 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
939 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
940 bmap
->extra
- bmap
->n_div
);
944 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
946 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
949 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
953 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
958 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
960 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
963 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
968 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
970 if (pos
!= bmap
->n_eq
- 1) {
972 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
973 bmap
->eq
[bmap
->n_eq
- 1] = t
;
979 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
981 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
984 void isl_basic_map_inequality_to_equality(
985 struct isl_basic_map
*bmap
, unsigned pos
)
990 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
991 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
996 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
997 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
998 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
999 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1002 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1004 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1007 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1009 struct isl_ctx
*ctx
;
1013 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1014 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1015 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1016 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1017 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1018 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1019 1 + isl_basic_map_total_dim(bmap
),
1020 bmap
->extra
- bmap
->n_div
);
1021 return bmap
->n_ineq
++;
1024 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1026 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1029 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1033 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1038 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1040 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1043 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1048 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1050 if (pos
!= bmap
->n_ineq
- 1) {
1051 t
= bmap
->ineq
[pos
];
1052 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1053 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1054 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1060 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1062 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1065 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1070 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1073 k
= isl_basic_map_alloc_equality(bmap
);
1076 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1079 isl_basic_map_free(bmap
);
1083 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1086 return (isl_basic_set
*)
1087 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1090 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1095 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1098 k
= isl_basic_map_alloc_inequality(bmap
);
1101 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1104 isl_basic_map_free(bmap
);
1108 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1111 return (isl_basic_set
*)
1112 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1115 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1119 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1120 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1121 1 + 1 + isl_basic_map_total_dim(bmap
),
1122 bmap
->extra
- bmap
->n_div
);
1123 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1124 return bmap
->n_div
++;
1127 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1129 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1132 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1136 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1141 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1143 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1146 /* Copy constraint from src to dst, putting the vars of src at offset
1147 * dim_off in dst and the divs of src at offset div_off in dst.
1148 * If both sets are actually map, then dim_off applies to the input
1151 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1152 struct isl_basic_map
*src_map
, isl_int
*src
,
1153 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1155 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1156 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1157 unsigned src_in
= isl_basic_map_n_in(src_map
);
1158 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1159 unsigned src_out
= isl_basic_map_n_out(src_map
);
1160 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1161 isl_int_set(dst
[0], src
[0]);
1162 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1163 if (dst_nparam
> src_nparam
)
1164 isl_seq_clr(dst
+1+src_nparam
,
1165 dst_nparam
- src_nparam
);
1166 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1167 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1169 isl_min(dst_in
-in_off
, src_in
));
1170 if (dst_in
-in_off
> src_in
)
1171 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1172 dst_in
- in_off
- src_in
);
1173 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1174 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1175 src
+1+src_nparam
+src_in
,
1176 isl_min(dst_out
-out_off
, src_out
));
1177 if (dst_out
-out_off
> src_out
)
1178 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1179 dst_out
- out_off
- src_out
);
1180 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1181 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1182 src
+1+src_nparam
+src_in
+src_out
,
1183 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1184 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1185 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1186 div_off
+src_map
->n_div
,
1187 dst_map
->n_div
- div_off
- src_map
->n_div
);
1190 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1191 struct isl_basic_map
*src_map
, isl_int
*src
,
1192 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1194 isl_int_set(dst
[0], src
[0]);
1195 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1198 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1199 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1204 if (!bmap1
|| !bmap2
)
1207 div_off
= bmap1
->n_div
;
1209 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1210 int i1
= isl_basic_map_alloc_equality(bmap1
);
1213 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1214 i_pos
, o_pos
, div_off
);
1217 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1218 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1221 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1222 i_pos
, o_pos
, div_off
);
1225 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1226 int i1
= isl_basic_map_alloc_div(bmap1
);
1229 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1230 i_pos
, o_pos
, div_off
);
1233 isl_basic_map_free(bmap2
);
1238 isl_basic_map_free(bmap1
);
1239 isl_basic_map_free(bmap2
);
1243 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1244 struct isl_basic_set
*bset2
, unsigned pos
)
1246 return (struct isl_basic_set
*)
1247 add_constraints((struct isl_basic_map
*)bset1
,
1248 (struct isl_basic_map
*)bset2
, 0, pos
);
1251 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1252 __isl_take isl_space
*dim
, unsigned extra
,
1253 unsigned n_eq
, unsigned n_ineq
)
1255 struct isl_basic_map
*ext
;
1265 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1266 base
->extra
>= base
->n_div
+ extra
;
1268 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1269 room_for_ineq(base
, n_ineq
)) {
1270 isl_space_free(dim
);
1274 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1275 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1276 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1277 extra
+= base
->extra
;
1279 n_ineq
+= base
->n_ineq
;
1281 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1287 ext
->sample
= isl_vec_copy(base
->sample
);
1288 flags
= base
->flags
;
1289 ext
= add_constraints(ext
, base
, 0, 0);
1292 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1298 isl_space_free(dim
);
1299 isl_basic_map_free(base
);
1303 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1304 __isl_take isl_space
*dim
, unsigned extra
,
1305 unsigned n_eq
, unsigned n_ineq
)
1307 return (struct isl_basic_set
*)
1308 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1309 extra
, n_eq
, n_ineq
);
1312 struct isl_basic_map
*isl_basic_map_extend_constraints(
1313 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1317 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1321 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1322 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1323 unsigned n_eq
, unsigned n_ineq
)
1325 struct isl_basic_map
*bmap
;
1330 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1334 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1337 isl_basic_map_free(base
);
1341 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1342 unsigned nparam
, unsigned dim
, unsigned extra
,
1343 unsigned n_eq
, unsigned n_ineq
)
1345 return (struct isl_basic_set
*)
1346 isl_basic_map_extend((struct isl_basic_map
*)base
,
1347 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1350 struct isl_basic_set
*isl_basic_set_extend_constraints(
1351 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1353 return (struct isl_basic_set
*)
1354 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1358 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1360 return (struct isl_basic_set
*)
1361 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1364 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1369 if (bmap
->ref
> 1) {
1371 bmap
= isl_basic_map_dup(bmap
);
1374 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1378 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1386 return isl_set_dup(set
);
1389 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1397 return isl_map_dup(map
);
1400 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1401 unsigned a_len
, unsigned b_len
)
1403 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1404 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1405 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1408 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1409 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1417 isl_assert(bmap
->ctx
,
1418 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1420 if (n1
== 0 || n2
== 0)
1423 bmap
= isl_basic_map_cow(bmap
);
1427 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1428 if (isl_blk_is_error(blk
))
1431 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1433 bmap
->eq
[i
] + pos
, n1
, n2
);
1435 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1437 bmap
->ineq
[i
] + pos
, n1
, n2
);
1439 for (i
= 0; i
< bmap
->n_div
; ++i
)
1441 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1443 isl_blk_free(bmap
->ctx
, blk
);
1445 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1446 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1447 return isl_basic_map_finalize(bmap
);
1449 isl_basic_map_free(bmap
);
1453 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1454 __isl_take isl_basic_set
*bset
, unsigned n
)
1459 nparam
= isl_basic_set_n_param(bset
);
1460 dim
= isl_basic_set_n_dim(bset
);
1461 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1463 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1465 isl_basic_set_free(bset
);
1469 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1475 total
= isl_basic_map_total_dim(bmap
);
1476 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1477 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1479 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1481 i
= isl_basic_map_alloc_equality(bmap
);
1485 isl_int_set_si(bmap
->eq
[i
][0], 1);
1486 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1487 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1488 isl_vec_free(bmap
->sample
);
1489 bmap
->sample
= NULL
;
1490 return isl_basic_map_finalize(bmap
);
1492 isl_basic_map_free(bmap
);
1496 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1498 return (struct isl_basic_set
*)
1499 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1502 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1505 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1506 isl_int
*t
= bmap
->div
[a
];
1507 bmap
->div
[a
] = bmap
->div
[b
];
1510 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1511 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1513 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1514 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1516 for (i
= 0; i
< bmap
->n_div
; ++i
)
1517 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1518 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1521 /* Eliminate the specified n dimensions starting at first from the
1522 * constraints using Fourier-Motzkin. The dimensions themselves
1525 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1526 enum isl_dim_type type
, unsigned first
, unsigned n
)
1535 map
= isl_map_cow(map
);
1538 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1539 first
+= pos(map
->dim
, type
) - 1;
1541 for (i
= 0; i
< map
->n
; ++i
) {
1542 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1552 /* Eliminate the specified n dimensions starting at first from the
1553 * constraints using Fourier-Motzkin. The dimensions themselves
1556 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1557 enum isl_dim_type type
, unsigned first
, unsigned n
)
1559 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1562 /* Eliminate the specified n dimensions starting at first from the
1563 * constraints using Fourier-Motzkin. The dimensions themselves
1566 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1567 unsigned first
, unsigned n
)
1569 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1572 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1573 __isl_take isl_basic_map
*bmap
)
1577 bmap
= isl_basic_map_eliminate_vars(bmap
,
1578 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1582 return isl_basic_map_finalize(bmap
);
1585 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1586 __isl_take isl_basic_set
*bset
)
1588 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1589 (struct isl_basic_map
*)bset
);
1592 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1601 map
= isl_map_cow(map
);
1605 for (i
= 0; i
< map
->n
; ++i
) {
1606 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1616 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1618 return isl_map_remove_divs(set
);
1621 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1622 enum isl_dim_type type
, unsigned first
, unsigned n
)
1626 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1628 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1630 bmap
= isl_basic_map_eliminate_vars(bmap
,
1631 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1634 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1636 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1639 isl_basic_map_free(bmap
);
1643 /* Return true if the definition of the given div (recursively) involves
1644 * any of the given variables.
1646 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1647 unsigned first
, unsigned n
)
1650 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1652 if (isl_int_is_zero(bmap
->div
[div
][0]))
1654 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1657 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1658 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1660 if (div_involves_vars(bmap
, i
, first
, n
))
1667 /* Remove all divs (recursively) involving any of the given dimensions
1668 * in their definitions.
1670 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1671 __isl_take isl_basic_map
*bmap
,
1672 enum isl_dim_type type
, unsigned first
, unsigned n
)
1678 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1680 first
+= isl_basic_map_offset(bmap
, type
);
1682 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1683 if (!div_involves_vars(bmap
, i
, first
, n
))
1685 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1693 isl_basic_map_free(bmap
);
1697 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1698 enum isl_dim_type type
, unsigned first
, unsigned n
)
1707 map
= isl_map_cow(map
);
1711 for (i
= 0; i
< map
->n
; ++i
) {
1712 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1723 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1724 enum isl_dim_type type
, unsigned first
, unsigned n
)
1726 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1730 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
1731 enum isl_dim_type type
, unsigned first
, unsigned n
)
1738 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
1739 isl_die(bmap
->ctx
, isl_error_invalid
,
1740 "index out of bounds", return -1);
1742 first
+= isl_basic_map_offset(bmap
, type
);
1743 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1744 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
1746 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1747 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
1753 int isl_map_involves_dims(__isl_keep isl_map
*map
,
1754 enum isl_dim_type type
, unsigned first
, unsigned n
)
1761 if (first
+ n
> isl_map_dim(map
, type
))
1762 isl_die(map
->ctx
, isl_error_invalid
,
1763 "index out of bounds", return -1);
1765 for (i
= 0; i
< map
->n
; ++i
) {
1766 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
1768 if (involves
< 0 || involves
)
1775 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
1776 enum isl_dim_type type
, unsigned first
, unsigned n
)
1778 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
1781 int isl_set_involves_dims(__isl_keep isl_set
*set
,
1782 enum isl_dim_type type
, unsigned first
, unsigned n
)
1784 return isl_map_involves_dims(set
, type
, first
, n
);
1787 /* Return true if the definition of the given div is unknown or depends
1790 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1793 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1795 if (isl_int_is_zero(bmap
->div
[div
][0]))
1798 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1799 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1801 if (div_is_unknown(bmap
, i
))
1808 /* Remove all divs that are unknown or defined in terms of unknown divs.
1810 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1811 __isl_take isl_basic_map
*bmap
)
1818 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1819 if (!div_is_unknown(bmap
, i
))
1821 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1827 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1836 map
= isl_map_cow(map
);
1840 for (i
= 0; i
< map
->n
; ++i
) {
1841 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1851 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1853 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1856 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1857 __isl_take isl_basic_set
*bset
,
1858 enum isl_dim_type type
, unsigned first
, unsigned n
)
1860 return (isl_basic_set
*)
1861 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1864 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1865 enum isl_dim_type type
, unsigned first
, unsigned n
)
1872 map
= isl_map_cow(map
);
1875 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1877 for (i
= 0; i
< map
->n
; ++i
) {
1878 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1879 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1883 map
= isl_map_drop(map
, type
, first
, n
);
1890 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1891 enum isl_dim_type type
, unsigned first
, unsigned n
)
1893 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1896 /* Project out n inputs starting at first using Fourier-Motzkin */
1897 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1898 unsigned first
, unsigned n
)
1900 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1903 static void dump_term(struct isl_basic_map
*bmap
,
1904 isl_int c
, int pos
, FILE *out
)
1907 unsigned in
= isl_basic_map_n_in(bmap
);
1908 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1909 unsigned nparam
= isl_basic_map_n_param(bmap
);
1911 isl_int_print(out
, c
, 0);
1913 if (!isl_int_is_one(c
))
1914 isl_int_print(out
, c
, 0);
1915 if (pos
< 1 + nparam
) {
1916 name
= isl_space_get_dim_name(bmap
->dim
,
1917 isl_dim_param
, pos
- 1);
1919 fprintf(out
, "%s", name
);
1921 fprintf(out
, "p%d", pos
- 1);
1922 } else if (pos
< 1 + nparam
+ in
)
1923 fprintf(out
, "i%d", pos
- 1 - nparam
);
1924 else if (pos
< 1 + nparam
+ dim
)
1925 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1927 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1931 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1932 int sign
, FILE *out
)
1936 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1940 for (i
= 0, first
= 1; i
< len
; ++i
) {
1941 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1944 fprintf(out
, " + ");
1946 isl_int_abs(v
, c
[i
]);
1947 dump_term(bmap
, v
, i
, out
);
1954 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1955 const char *op
, FILE *out
, int indent
)
1959 fprintf(out
, "%*s", indent
, "");
1961 dump_constraint_sign(bmap
, c
, 1, out
);
1962 fprintf(out
, " %s ", op
);
1963 dump_constraint_sign(bmap
, c
, -1, out
);
1967 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1968 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
1970 fprintf(out
, "%*s", indent
, "");
1971 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1976 static void dump_constraints(struct isl_basic_map
*bmap
,
1977 isl_int
**c
, unsigned n
,
1978 const char *op
, FILE *out
, int indent
)
1982 for (i
= 0; i
< n
; ++i
)
1983 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1986 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1990 unsigned total
= isl_basic_map_total_dim(bmap
);
1992 for (j
= 0; j
< 1 + total
; ++j
) {
1993 if (isl_int_is_zero(exp
[j
]))
1995 if (!first
&& isl_int_is_pos(exp
[j
]))
1997 dump_term(bmap
, exp
[j
], j
, out
);
2002 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2006 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2007 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2009 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2010 fprintf(out
, "%*s", indent
, "");
2011 fprintf(out
, "e%d = [(", i
);
2012 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2014 isl_int_print(out
, bmap
->div
[i
][0], 0);
2015 fprintf(out
, "]\n");
2019 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2020 FILE *out
, int indent
)
2023 fprintf(out
, "null basic set\n");
2027 fprintf(out
, "%*s", indent
, "");
2028 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2029 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2030 bset
->extra
, bset
->flags
);
2031 dump((struct isl_basic_map
*)bset
, out
, indent
);
2034 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2035 FILE *out
, int indent
)
2038 fprintf(out
, "null basic map\n");
2042 fprintf(out
, "%*s", indent
, "");
2043 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2044 "flags: %x, n_name: %d\n",
2046 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2047 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2048 dump(bmap
, out
, indent
);
2051 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2056 total
= isl_basic_map_total_dim(bmap
);
2057 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2058 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2059 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2060 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2064 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2067 struct isl_set
*set
;
2071 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2072 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2073 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2074 sizeof(struct isl_set
) +
2075 (n
- 1) * sizeof(struct isl_basic_set
*));
2079 set
->ctx
= dim
->ctx
;
2080 isl_ctx_ref(set
->ctx
);
2088 isl_space_free(dim
);
2092 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2093 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2095 struct isl_set
*set
;
2098 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2102 set
= isl_set_alloc_space(dims
, n
, flags
);
2106 /* Make sure "map" has room for at least "n" more basic maps.
2108 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2111 struct isl_map
*grown
= NULL
;
2115 isl_assert(map
->ctx
, n
>= 0, goto error
);
2116 if (map
->n
+ n
<= map
->size
)
2118 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2121 for (i
= 0; i
< map
->n
; ++i
) {
2122 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2130 isl_map_free(grown
);
2135 /* Make sure "set" has room for at least "n" more basic sets.
2137 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2139 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2142 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2145 struct isl_set
*dup
;
2150 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2153 for (i
= 0; i
< set
->n
; ++i
)
2154 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2158 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2160 return isl_map_from_basic_map(bset
);
2163 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2165 struct isl_map
*map
;
2170 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2171 return isl_map_add_basic_map(map
, bmap
);
2174 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2175 __isl_take isl_basic_set
*bset
)
2177 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2178 (struct isl_basic_map
*)bset
);
2181 void isl_set_free(struct isl_set
*set
)
2191 isl_ctx_deref(set
->ctx
);
2192 for (i
= 0; i
< set
->n
; ++i
)
2193 isl_basic_set_free(set
->p
[i
]);
2194 isl_space_free(set
->dim
);
2198 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2203 fprintf(out
, "null set\n");
2207 fprintf(out
, "%*s", indent
, "");
2208 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2209 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2211 for (i
= 0; i
< set
->n
; ++i
) {
2212 fprintf(out
, "%*s", indent
, "");
2213 fprintf(out
, "basic set %d:\n", i
);
2214 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2218 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2223 fprintf(out
, "null map\n");
2227 fprintf(out
, "%*s", indent
, "");
2228 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2229 "flags: %x, n_name: %d\n",
2230 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2231 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2232 for (i
= 0; i
< map
->n
; ++i
) {
2233 fprintf(out
, "%*s", indent
, "");
2234 fprintf(out
, "basic map %d:\n", i
);
2235 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2239 struct isl_basic_map
*isl_basic_map_intersect_domain(
2240 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2242 struct isl_basic_map
*bmap_domain
;
2247 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2248 bset
->dim
, isl_dim_param
), goto error
);
2250 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2251 isl_assert(bset
->ctx
,
2252 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2254 bmap
= isl_basic_map_cow(bmap
);
2257 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2258 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2259 bmap_domain
= isl_basic_map_from_domain(bset
);
2260 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2262 bmap
= isl_basic_map_simplify(bmap
);
2263 return isl_basic_map_finalize(bmap
);
2265 isl_basic_map_free(bmap
);
2266 isl_basic_set_free(bset
);
2270 struct isl_basic_map
*isl_basic_map_intersect_range(
2271 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2273 struct isl_basic_map
*bmap_range
;
2278 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2279 bset
->dim
, isl_dim_param
), goto error
);
2281 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2282 isl_assert(bset
->ctx
,
2283 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2285 if (isl_basic_set_is_universe(bset
)) {
2286 isl_basic_set_free(bset
);
2290 bmap
= isl_basic_map_cow(bmap
);
2293 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2294 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2295 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2296 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2298 bmap
= isl_basic_map_simplify(bmap
);
2299 return isl_basic_map_finalize(bmap
);
2301 isl_basic_map_free(bmap
);
2302 isl_basic_set_free(bset
);
2306 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2312 total
= 1 + isl_basic_map_total_dim(bmap
);
2313 if (total
!= vec
->size
)
2318 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2319 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2320 if (!isl_int_is_zero(s
)) {
2326 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2327 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2328 if (isl_int_is_neg(s
)) {
2339 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2341 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2344 struct isl_basic_map
*isl_basic_map_intersect(
2345 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2347 struct isl_vec
*sample
= NULL
;
2349 if (!bmap1
|| !bmap2
)
2352 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2353 bmap2
->dim
, isl_dim_param
), goto error
);
2354 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2355 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2356 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2357 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2358 return isl_basic_map_intersect(bmap2
, bmap1
);
2360 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2361 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2362 isl_assert(bmap1
->ctx
,
2363 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2365 if (bmap1
->sample
&&
2366 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2367 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2368 sample
= isl_vec_copy(bmap1
->sample
);
2369 else if (bmap2
->sample
&&
2370 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2371 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2372 sample
= isl_vec_copy(bmap2
->sample
);
2374 bmap1
= isl_basic_map_cow(bmap1
);
2377 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2378 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2379 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2382 isl_vec_free(sample
);
2384 isl_vec_free(bmap1
->sample
);
2385 bmap1
->sample
= sample
;
2388 bmap1
= isl_basic_map_simplify(bmap1
);
2389 return isl_basic_map_finalize(bmap1
);
2392 isl_vec_free(sample
);
2393 isl_basic_map_free(bmap1
);
2394 isl_basic_map_free(bmap2
);
2398 struct isl_basic_set
*isl_basic_set_intersect(
2399 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2401 return (struct isl_basic_set
*)
2402 isl_basic_map_intersect(
2403 (struct isl_basic_map
*)bset1
,
2404 (struct isl_basic_map
*)bset2
);
2407 /* Special case of isl_map_intersect, where both map1 and map2
2408 * are convex, without any divs and such that either map1 or map2
2409 * contains a single constraint. This constraint is then simply
2410 * added to the other map.
2412 static __isl_give isl_map
*map_intersect_add_constraint(
2413 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2415 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2416 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2417 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2418 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2420 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2421 return isl_map_intersect(map2
, map1
);
2423 isl_assert(map2
->ctx
,
2424 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2426 map1
= isl_map_cow(map1
);
2429 if (isl_map_plain_is_empty(map1
)) {
2433 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2434 if (map2
->p
[0]->n_eq
== 1)
2435 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2437 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2438 map2
->p
[0]->ineq
[0]);
2440 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2441 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2445 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2446 isl_basic_map_free(map1
->p
[0]);
2459 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2460 __isl_take isl_map
*map2
)
2463 struct isl_map
*result
;
2469 if (isl_map_plain_is_empty(map1
) &&
2470 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2474 if (isl_map_plain_is_empty(map2
) &&
2475 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2480 if (map1
->n
== 1 && map2
->n
== 1 &&
2481 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2482 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2483 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2484 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2485 return map_intersect_add_constraint(map1
, map2
);
2486 if (isl_space_dim(map1
->dim
, isl_dim_all
) ==
2487 isl_space_dim(map1
->dim
, isl_dim_param
) &&
2488 isl_space_dim(map2
->dim
, isl_dim_all
) !=
2489 isl_space_dim(map2
->dim
, isl_dim_param
))
2490 return isl_map_intersect(map2
, map1
);
2492 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2493 isl_space_dim(map2
->dim
, isl_dim_param
))
2494 isl_assert(map1
->ctx
,
2495 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2497 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2498 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2499 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2501 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2502 map1
->n
* map2
->n
, flags
);
2505 for (i
= 0; i
< map1
->n
; ++i
)
2506 for (j
= 0; j
< map2
->n
; ++j
) {
2507 struct isl_basic_map
*part
;
2508 part
= isl_basic_map_intersect(
2509 isl_basic_map_copy(map1
->p
[i
]),
2510 isl_basic_map_copy(map2
->p
[j
]));
2511 if (isl_basic_map_is_empty(part
))
2512 isl_basic_map_free(part
);
2514 result
= isl_map_add_basic_map(result
, part
);
2527 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2528 __isl_take isl_map
*map2
)
2530 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2533 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2535 return (struct isl_set
*)
2536 isl_map_intersect((struct isl_map
*)set1
,
2537 (struct isl_map
*)set2
);
2540 /* The current implementation of isl_map_intersect accepts intersections
2541 * with parameter domains, so we can just call that for now.
2543 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2544 __isl_take isl_set
*params
)
2546 return isl_map_intersect(map
, params
);
2549 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2550 __isl_take isl_map
*map2
)
2552 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2555 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2556 __isl_take isl_set
*params
)
2558 return isl_map_intersect_params(set
, params
);
2561 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2564 struct isl_basic_set
*bset
;
2569 bmap
= isl_basic_map_cow(bmap
);
2572 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2573 in
= isl_basic_map_n_in(bmap
);
2574 bset
= isl_basic_set_from_basic_map(bmap
);
2575 bset
= isl_basic_set_swap_vars(bset
, in
);
2576 return isl_basic_map_from_basic_set(bset
, dim
);
2579 static __isl_give isl_basic_map
*basic_map_space_reset(
2580 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2584 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2587 space
= isl_basic_map_get_space(bmap
);
2588 space
= isl_space_reset(space
, type
);
2589 bmap
= isl_basic_map_reset_space(bmap
, space
);
2593 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2594 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2597 struct isl_basic_map
*res
;
2598 struct isl_dim_map
*dim_map
;
2599 unsigned total
, off
;
2600 enum isl_dim_type t
;
2603 return basic_map_space_reset(bmap
, type
);
2608 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
2610 total
= isl_basic_map_total_dim(bmap
) + n
;
2611 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2613 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2615 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2617 unsigned size
= isl_basic_map_dim(bmap
, t
);
2618 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2620 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2621 pos
, size
- pos
, off
+ pos
+ n
);
2623 off
+= isl_space_dim(res_dim
, t
);
2625 isl_dim_map_div(dim_map
, bmap
, off
);
2627 res
= isl_basic_map_alloc_space(res_dim
,
2628 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2629 if (isl_basic_map_is_rational(bmap
))
2630 res
= isl_basic_map_set_rational(res
);
2631 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2632 return isl_basic_map_finalize(res
);
2635 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2636 enum isl_dim_type type
, unsigned n
)
2640 return isl_basic_map_insert(bmap
, type
,
2641 isl_basic_map_dim(bmap
, type
), n
);
2644 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2645 enum isl_dim_type type
, unsigned n
)
2649 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2650 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2652 isl_basic_set_free(bset
);
2656 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
2657 enum isl_dim_type type
)
2661 if (!isl_space_is_named_or_nested(map
->dim
, type
))
2664 space
= isl_map_get_space(map
);
2665 space
= isl_space_reset(space
, type
);
2666 map
= isl_map_reset_space(map
, space
);
2670 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
2671 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2676 return map_space_reset(map
, type
);
2678 map
= isl_map_cow(map
);
2682 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
2686 for (i
= 0; i
< map
->n
; ++i
) {
2687 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2698 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
2699 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2701 return isl_map_insert_dims(set
, type
, pos
, n
);
2704 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2705 enum isl_dim_type type
, unsigned n
)
2709 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
2712 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2713 enum isl_dim_type type
, unsigned n
)
2717 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2718 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2724 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2725 __isl_take isl_basic_map
*bmap
,
2726 enum isl_dim_type dst_type
, unsigned dst_pos
,
2727 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2729 struct isl_dim_map
*dim_map
;
2730 struct isl_basic_map
*res
;
2731 enum isl_dim_type t
;
2732 unsigned total
, off
;
2739 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2742 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2745 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2747 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2748 pos(bmap
->dim
, src_type
) + src_pos
+
2749 ((src_type
< dst_type
) ? n
: 0)) {
2750 bmap
= isl_basic_map_cow(bmap
);
2754 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
2755 src_type
, src_pos
, n
);
2759 bmap
= isl_basic_map_finalize(bmap
);
2764 total
= isl_basic_map_total_dim(bmap
);
2765 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2768 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2769 unsigned size
= isl_space_dim(bmap
->dim
, t
);
2770 if (t
== dst_type
) {
2771 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2774 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2777 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2778 dst_pos
, size
- dst_pos
, off
);
2779 off
+= size
- dst_pos
;
2780 } else if (t
== src_type
) {
2781 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2784 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2785 src_pos
+ n
, size
- src_pos
- n
, off
);
2786 off
+= size
- src_pos
- n
;
2788 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2792 isl_dim_map_div(dim_map
, bmap
, off
);
2794 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
2795 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2796 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2798 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
2799 src_type
, src_pos
, n
);
2803 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2804 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2805 bmap
= isl_basic_map_finalize(bmap
);
2809 isl_basic_map_free(bmap
);
2813 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2814 enum isl_dim_type dst_type
, unsigned dst_pos
,
2815 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2817 return (isl_basic_set
*)isl_basic_map_move_dims(
2818 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2821 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2822 enum isl_dim_type dst_type
, unsigned dst_pos
,
2823 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2827 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2828 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2829 src_type
, src_pos
, n
);
2835 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2836 enum isl_dim_type dst_type
, unsigned dst_pos
,
2837 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2846 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2849 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2852 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2854 map
= isl_map_cow(map
);
2858 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2862 for (i
= 0; i
< map
->n
; ++i
) {
2863 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2865 src_type
, src_pos
, n
);
2876 /* Move the specified dimensions to the last columns right before
2877 * the divs. Don't change the dimension specification of bmap.
2878 * That's the responsibility of the caller.
2880 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2881 enum isl_dim_type type
, unsigned first
, unsigned n
)
2883 struct isl_dim_map
*dim_map
;
2884 struct isl_basic_map
*res
;
2885 enum isl_dim_type t
;
2886 unsigned total
, off
;
2890 if (pos(bmap
->dim
, type
) + first
+ n
==
2891 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
2894 total
= isl_basic_map_total_dim(bmap
);
2895 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2898 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2899 unsigned size
= isl_space_dim(bmap
->dim
, t
);
2901 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2904 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2905 first
, n
, total
- bmap
->n_div
- n
);
2906 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2907 first
+ n
, size
- (first
+ n
), off
);
2908 off
+= size
- (first
+ n
);
2910 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2914 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2916 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
2917 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2918 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2922 /* Turn the n dimensions of type type, starting at first
2923 * into existentially quantified variables.
2925 __isl_give isl_basic_map
*isl_basic_map_project_out(
2926 __isl_take isl_basic_map
*bmap
,
2927 enum isl_dim_type type
, unsigned first
, unsigned n
)
2940 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2941 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2943 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2946 bmap
= move_last(bmap
, type
, first
, n
);
2947 bmap
= isl_basic_map_cow(bmap
);
2951 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
2952 old
= bmap
->block2
.data
;
2953 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2954 (bmap
->extra
+ n
) * (1 + row_size
));
2955 if (!bmap
->block2
.data
)
2957 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2960 for (i
= 0; i
< n
; ++i
) {
2961 new_div
[i
] = bmap
->block2
.data
+
2962 (bmap
->extra
+ i
) * (1 + row_size
);
2963 isl_seq_clr(new_div
[i
], 1 + row_size
);
2965 for (i
= 0; i
< bmap
->extra
; ++i
)
2966 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2968 bmap
->div
= new_div
;
2972 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2975 bmap
= isl_basic_map_simplify(bmap
);
2976 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2977 return isl_basic_map_finalize(bmap
);
2979 isl_basic_map_free(bmap
);
2983 /* Turn the n dimensions of type type, starting at first
2984 * into existentially quantified variables.
2986 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2987 enum isl_dim_type type
, unsigned first
, unsigned n
)
2989 return (isl_basic_set
*)isl_basic_map_project_out(
2990 (isl_basic_map
*)bset
, type
, first
, n
);
2993 /* Turn the n dimensions of type type, starting at first
2994 * into existentially quantified variables.
2996 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2997 enum isl_dim_type type
, unsigned first
, unsigned n
)
3007 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3009 map
= isl_map_cow(map
);
3013 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3017 for (i
= 0; i
< map
->n
; ++i
) {
3018 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3029 /* Turn the n dimensions of type type, starting at first
3030 * into existentially quantified variables.
3032 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3033 enum isl_dim_type type
, unsigned first
, unsigned n
)
3035 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3038 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3042 for (i
= 0; i
< n
; ++i
) {
3043 j
= isl_basic_map_alloc_div(bmap
);
3046 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3050 isl_basic_map_free(bmap
);
3054 struct isl_basic_map
*isl_basic_map_apply_range(
3055 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3057 isl_space
*dim_result
= NULL
;
3058 struct isl_basic_map
*bmap
;
3059 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3060 struct isl_dim_map
*dim_map1
, *dim_map2
;
3062 if (!bmap1
|| !bmap2
)
3065 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3066 isl_space_copy(bmap2
->dim
));
3068 n_in
= isl_basic_map_n_in(bmap1
);
3069 n_out
= isl_basic_map_n_out(bmap2
);
3070 n
= isl_basic_map_n_out(bmap1
);
3071 nparam
= isl_basic_map_n_param(bmap1
);
3073 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3074 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3075 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3076 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3077 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3078 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3079 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3080 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3081 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3082 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3083 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3085 bmap
= isl_basic_map_alloc_space(dim_result
,
3086 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3087 bmap1
->n_eq
+ bmap2
->n_eq
,
3088 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3089 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3090 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3091 bmap
= add_divs(bmap
, n
);
3092 bmap
= isl_basic_map_simplify(bmap
);
3093 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3094 return isl_basic_map_finalize(bmap
);
3096 isl_basic_map_free(bmap1
);
3097 isl_basic_map_free(bmap2
);
3101 struct isl_basic_set
*isl_basic_set_apply(
3102 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3107 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3110 return (struct isl_basic_set
*)
3111 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3113 isl_basic_set_free(bset
);
3114 isl_basic_map_free(bmap
);
3118 struct isl_basic_map
*isl_basic_map_apply_domain(
3119 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3121 if (!bmap1
|| !bmap2
)
3124 isl_assert(bmap1
->ctx
,
3125 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3126 isl_assert(bmap1
->ctx
,
3127 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3130 bmap1
= isl_basic_map_reverse(bmap1
);
3131 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3132 return isl_basic_map_reverse(bmap1
);
3134 isl_basic_map_free(bmap1
);
3135 isl_basic_map_free(bmap2
);
3139 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3140 * A \cap B -> f(A) + f(B)
3142 struct isl_basic_map
*isl_basic_map_sum(
3143 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3145 unsigned n_in
, n_out
, nparam
, total
, pos
;
3146 struct isl_basic_map
*bmap
= NULL
;
3147 struct isl_dim_map
*dim_map1
, *dim_map2
;
3150 if (!bmap1
|| !bmap2
)
3153 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3156 nparam
= isl_basic_map_n_param(bmap1
);
3157 n_in
= isl_basic_map_n_in(bmap1
);
3158 n_out
= isl_basic_map_n_out(bmap1
);
3160 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3161 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3162 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3163 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3164 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3165 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3166 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3167 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3168 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3169 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3170 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3172 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3173 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3174 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3175 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3176 for (i
= 0; i
< n_out
; ++i
) {
3177 int j
= isl_basic_map_alloc_equality(bmap
);
3180 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3181 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3182 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3183 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3185 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3186 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3187 bmap
= add_divs(bmap
, 2 * n_out
);
3189 bmap
= isl_basic_map_simplify(bmap
);
3190 return isl_basic_map_finalize(bmap
);
3192 isl_basic_map_free(bmap
);
3193 isl_basic_map_free(bmap1
);
3194 isl_basic_map_free(bmap2
);
3198 /* Given two maps A -> f(A) and B -> g(B), construct a map
3199 * A \cap B -> f(A) + f(B)
3201 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3203 struct isl_map
*result
;
3209 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3211 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3212 map1
->n
* map2
->n
, 0);
3215 for (i
= 0; i
< map1
->n
; ++i
)
3216 for (j
= 0; j
< map2
->n
; ++j
) {
3217 struct isl_basic_map
*part
;
3218 part
= isl_basic_map_sum(
3219 isl_basic_map_copy(map1
->p
[i
]),
3220 isl_basic_map_copy(map2
->p
[j
]));
3221 if (isl_basic_map_is_empty(part
))
3222 isl_basic_map_free(part
);
3224 result
= isl_map_add_basic_map(result
, part
);
3237 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3238 __isl_take isl_set
*set2
)
3240 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3243 /* Given a basic map A -> f(A), construct A -> -f(A).
3245 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3250 bmap
= isl_basic_map_cow(bmap
);
3254 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3255 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3256 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3257 for (j
= 0; j
< n
; ++j
)
3258 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3259 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3260 for (j
= 0; j
< n
; ++j
)
3261 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3262 for (i
= 0; i
< bmap
->n_div
; ++i
)
3263 for (j
= 0; j
< n
; ++j
)
3264 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3265 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3266 return isl_basic_map_finalize(bmap
);
3269 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3271 return isl_basic_map_neg(bset
);
3274 /* Given a map A -> f(A), construct A -> -f(A).
3276 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3280 map
= isl_map_cow(map
);
3284 for (i
= 0; i
< map
->n
; ++i
) {
3285 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3296 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3298 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3301 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3302 * A -> floor(f(A)/d).
3304 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3307 unsigned n_in
, n_out
, nparam
, total
, pos
;
3308 struct isl_basic_map
*result
= NULL
;
3309 struct isl_dim_map
*dim_map
;
3315 nparam
= isl_basic_map_n_param(bmap
);
3316 n_in
= isl_basic_map_n_in(bmap
);
3317 n_out
= isl_basic_map_n_out(bmap
);
3319 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3320 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3321 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3322 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3323 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3324 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3326 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3327 bmap
->n_div
+ n_out
,
3328 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3329 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3330 result
= add_divs(result
, n_out
);
3331 for (i
= 0; i
< n_out
; ++i
) {
3333 j
= isl_basic_map_alloc_inequality(result
);
3336 isl_seq_clr(result
->ineq
[j
], 1+total
);
3337 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3338 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3339 j
= isl_basic_map_alloc_inequality(result
);
3342 isl_seq_clr(result
->ineq
[j
], 1+total
);
3343 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3344 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3345 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3348 result
= isl_basic_map_simplify(result
);
3349 return isl_basic_map_finalize(result
);
3351 isl_basic_map_free(result
);
3355 /* Given a map A -> f(A) and an integer d, construct a map
3356 * A -> floor(f(A)/d).
3358 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3362 map
= isl_map_cow(map
);
3366 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3367 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3368 for (i
= 0; i
< map
->n
; ++i
) {
3369 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3380 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3386 i
= isl_basic_map_alloc_equality(bmap
);
3389 nparam
= isl_basic_map_n_param(bmap
);
3390 n_in
= isl_basic_map_n_in(bmap
);
3391 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3392 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3393 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3394 return isl_basic_map_finalize(bmap
);
3396 isl_basic_map_free(bmap
);
3400 /* Add a constraints to "bmap" expressing i_pos < o_pos
3402 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3408 i
= isl_basic_map_alloc_inequality(bmap
);
3411 nparam
= isl_basic_map_n_param(bmap
);
3412 n_in
= isl_basic_map_n_in(bmap
);
3413 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3414 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3415 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3416 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3417 return isl_basic_map_finalize(bmap
);
3419 isl_basic_map_free(bmap
);
3423 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3425 static __isl_give isl_basic_map
*var_less_or_equal(
3426 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3432 i
= isl_basic_map_alloc_inequality(bmap
);
3435 nparam
= isl_basic_map_n_param(bmap
);
3436 n_in
= isl_basic_map_n_in(bmap
);
3437 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3438 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3439 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3440 return isl_basic_map_finalize(bmap
);
3442 isl_basic_map_free(bmap
);
3446 /* Add a constraints to "bmap" expressing i_pos > o_pos
3448 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3454 i
= isl_basic_map_alloc_inequality(bmap
);
3457 nparam
= isl_basic_map_n_param(bmap
);
3458 n_in
= isl_basic_map_n_in(bmap
);
3459 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3460 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3461 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3462 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3463 return isl_basic_map_finalize(bmap
);
3465 isl_basic_map_free(bmap
);
3469 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3471 static __isl_give isl_basic_map
*var_more_or_equal(
3472 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3478 i
= isl_basic_map_alloc_inequality(bmap
);
3481 nparam
= isl_basic_map_n_param(bmap
);
3482 n_in
= isl_basic_map_n_in(bmap
);
3483 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3484 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3485 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3486 return isl_basic_map_finalize(bmap
);
3488 isl_basic_map_free(bmap
);
3492 __isl_give isl_basic_map
*isl_basic_map_equal(
3493 __isl_take isl_space
*dim
, unsigned n_equal
)
3496 struct isl_basic_map
*bmap
;
3497 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3500 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3501 bmap
= var_equal(bmap
, i
);
3502 return isl_basic_map_finalize(bmap
);
3505 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3507 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3511 struct isl_basic_map
*bmap
;
3512 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3515 for (i
= 0; i
< pos
&& bmap
; ++i
)
3516 bmap
= var_equal(bmap
, i
);
3518 bmap
= var_less(bmap
, pos
);
3519 return isl_basic_map_finalize(bmap
);
3522 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3524 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3525 __isl_take isl_space
*dim
, unsigned pos
)
3528 isl_basic_map
*bmap
;
3530 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3531 for (i
= 0; i
< pos
; ++i
)
3532 bmap
= var_equal(bmap
, i
);
3533 bmap
= var_less_or_equal(bmap
, pos
);
3534 return isl_basic_map_finalize(bmap
);
3537 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3539 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3543 struct isl_basic_map
*bmap
;
3544 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3547 for (i
= 0; i
< pos
&& bmap
; ++i
)
3548 bmap
= var_equal(bmap
, i
);
3550 bmap
= var_more(bmap
, pos
);
3551 return isl_basic_map_finalize(bmap
);
3554 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3556 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3557 __isl_take isl_space
*dim
, unsigned pos
)
3560 isl_basic_map
*bmap
;
3562 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3563 for (i
= 0; i
< pos
; ++i
)
3564 bmap
= var_equal(bmap
, i
);
3565 bmap
= var_more_or_equal(bmap
, pos
);
3566 return isl_basic_map_finalize(bmap
);
3569 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3570 unsigned n
, int equal
)
3572 struct isl_map
*map
;
3575 if (n
== 0 && equal
)
3576 return isl_map_universe(dims
);
3578 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3580 for (i
= 0; i
+ 1 < n
; ++i
)
3581 map
= isl_map_add_basic_map(map
,
3582 isl_basic_map_less_at(isl_space_copy(dims
), i
));
3585 map
= isl_map_add_basic_map(map
,
3586 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3588 map
= isl_map_add_basic_map(map
,
3589 isl_basic_map_less_at(dims
, n
- 1));
3591 isl_space_free(dims
);
3596 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
3600 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3603 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
3605 return map_lex_lte_first(dim
, n
, 0);
3608 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
3610 return map_lex_lte_first(dim
, n
, 1);
3613 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
3615 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
3618 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
3620 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
3623 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
3624 unsigned n
, int equal
)
3626 struct isl_map
*map
;
3629 if (n
== 0 && equal
)
3630 return isl_map_universe(dims
);
3632 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3634 for (i
= 0; i
+ 1 < n
; ++i
)
3635 map
= isl_map_add_basic_map(map
,
3636 isl_basic_map_more_at(isl_space_copy(dims
), i
));
3639 map
= isl_map_add_basic_map(map
,
3640 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3642 map
= isl_map_add_basic_map(map
,
3643 isl_basic_map_more_at(dims
, n
- 1));
3645 isl_space_free(dims
);
3650 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
3654 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3657 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
3659 return map_lex_gte_first(dim
, n
, 0);
3662 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
3664 return map_lex_gte_first(dim
, n
, 1);
3667 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
3669 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
3672 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
3674 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
3677 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3678 __isl_take isl_set
*set2
)
3681 map
= isl_map_lex_le(isl_set_get_space(set1
));
3682 map
= isl_map_intersect_domain(map
, set1
);
3683 map
= isl_map_intersect_range(map
, set2
);
3687 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3688 __isl_take isl_set
*set2
)
3691 map
= isl_map_lex_lt(isl_set_get_space(set1
));
3692 map
= isl_map_intersect_domain(map
, set1
);
3693 map
= isl_map_intersect_range(map
, set2
);
3697 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3698 __isl_take isl_set
*set2
)
3701 map
= isl_map_lex_ge(isl_set_get_space(set1
));
3702 map
= isl_map_intersect_domain(map
, set1
);
3703 map
= isl_map_intersect_range(map
, set2
);
3707 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3708 __isl_take isl_set
*set2
)
3711 map
= isl_map_lex_gt(isl_set_get_space(set1
));
3712 map
= isl_map_intersect_domain(map
, set1
);
3713 map
= isl_map_intersect_range(map
, set2
);
3717 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3718 __isl_take isl_map
*map2
)
3721 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
3722 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3723 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3727 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3728 __isl_take isl_map
*map2
)
3731 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
3732 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3733 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3737 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3738 __isl_take isl_map
*map2
)
3741 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
3742 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3743 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3747 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3748 __isl_take isl_map
*map2
)
3751 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
3752 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3753 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3757 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
3758 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
3760 struct isl_basic_map
*bmap
;
3762 bset
= isl_basic_set_cow(bset
);
3766 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
3767 isl_space_free(bset
->dim
);
3768 bmap
= (struct isl_basic_map
*) bset
;
3770 return isl_basic_map_finalize(bmap
);
3772 isl_basic_set_free(bset
);
3773 isl_space_free(dim
);
3777 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3781 if (bmap
->dim
->n_in
== 0)
3782 return (struct isl_basic_set
*)bmap
;
3783 bmap
= isl_basic_map_cow(bmap
);
3786 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
3789 bmap
= isl_basic_map_finalize(bmap
);
3790 return (struct isl_basic_set
*)bmap
;
3792 isl_basic_map_free(bmap
);
3796 /* For a div d = floor(f/m), add the constraints
3799 * -(f-(n-1)) + m d >= 0
3801 * Note that the second constraint is the negation of
3805 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3806 unsigned pos
, isl_int
*div
)
3809 unsigned total
= isl_basic_map_total_dim(bmap
);
3811 i
= isl_basic_map_alloc_inequality(bmap
);
3814 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3815 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3817 j
= isl_basic_map_alloc_inequality(bmap
);
3820 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3821 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3822 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3826 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3827 unsigned pos
, isl_int
*div
)
3829 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3833 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3835 unsigned total
= isl_basic_map_total_dim(bmap
);
3836 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3838 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3842 struct isl_basic_set
*isl_basic_map_underlying_set(
3843 struct isl_basic_map
*bmap
)
3847 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3849 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3850 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3851 return (struct isl_basic_set
*)bmap
;
3852 bmap
= isl_basic_map_cow(bmap
);
3855 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
3858 bmap
->extra
-= bmap
->n_div
;
3860 bmap
= isl_basic_map_finalize(bmap
);
3861 return (struct isl_basic_set
*)bmap
;
3866 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3867 __isl_take isl_basic_set
*bset
)
3869 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3872 struct isl_basic_map
*isl_basic_map_overlying_set(
3873 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3875 struct isl_basic_map
*bmap
;
3876 struct isl_ctx
*ctx
;
3883 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3884 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3885 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3887 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3888 isl_basic_map_free(like
);
3889 return (struct isl_basic_map
*)bset
;
3891 bset
= isl_basic_set_cow(bset
);
3894 total
= bset
->dim
->n_out
+ bset
->extra
;
3895 bmap
= (struct isl_basic_map
*)bset
;
3896 isl_space_free(bmap
->dim
);
3897 bmap
->dim
= isl_space_copy(like
->dim
);
3900 bmap
->n_div
= like
->n_div
;
3901 bmap
->extra
+= like
->n_div
;
3905 ltotal
= total
- bmap
->extra
+ like
->extra
;
3908 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3909 bmap
->extra
* (1 + 1 + total
));
3910 if (isl_blk_is_error(bmap
->block2
))
3912 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
3916 for (i
= 0; i
< bmap
->extra
; ++i
)
3917 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3918 for (i
= 0; i
< like
->n_div
; ++i
) {
3919 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3920 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3922 bmap
= isl_basic_map_extend_constraints(bmap
,
3923 0, 2 * like
->n_div
);
3924 for (i
= 0; i
< like
->n_div
; ++i
) {
3925 if (isl_int_is_zero(bmap
->div
[i
][0]))
3927 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3931 isl_basic_map_free(like
);
3932 bmap
= isl_basic_map_simplify(bmap
);
3933 bmap
= isl_basic_map_finalize(bmap
);
3936 isl_basic_map_free(like
);
3937 isl_basic_set_free(bset
);
3941 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3942 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3944 return (struct isl_basic_set
*)
3945 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3948 struct isl_set
*isl_set_from_underlying_set(
3949 struct isl_set
*set
, struct isl_basic_set
*like
)
3955 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3957 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3958 isl_basic_set_free(like
);
3961 set
= isl_set_cow(set
);
3964 for (i
= 0; i
< set
->n
; ++i
) {
3965 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3966 isl_basic_set_copy(like
));
3970 isl_space_free(set
->dim
);
3971 set
->dim
= isl_space_copy(like
->dim
);
3974 isl_basic_set_free(like
);
3977 isl_basic_set_free(like
);
3982 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3986 map
= isl_map_cow(map
);
3989 map
->dim
= isl_space_cow(map
->dim
);
3993 for (i
= 1; i
< map
->n
; ++i
)
3994 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3996 for (i
= 0; i
< map
->n
; ++i
) {
3997 map
->p
[i
] = (struct isl_basic_map
*)
3998 isl_basic_map_underlying_set(map
->p
[i
]);
4003 map
->dim
= isl_space_underlying(map
->dim
, 0);
4005 isl_space_free(map
->dim
);
4006 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4010 return (struct isl_set
*)map
;
4016 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4018 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4021 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4022 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4024 bmap
= isl_basic_map_cow(bmap
);
4028 isl_space_free(bmap
->dim
);
4031 bmap
= isl_basic_map_finalize(bmap
);
4035 isl_basic_map_free(bmap
);
4036 isl_space_free(dim
);
4040 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4041 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4043 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4047 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4048 __isl_take isl_space
*dim
)
4052 map
= isl_map_cow(map
);
4056 for (i
= 0; i
< map
->n
; ++i
) {
4057 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4058 isl_space_copy(dim
));
4062 isl_space_free(map
->dim
);
4068 isl_space_free(dim
);
4072 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4073 __isl_take isl_space
*dim
)
4075 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4078 /* Compute the parameter domain of the given basic set.
4080 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4085 if (isl_basic_set_is_params(bset
))
4088 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4089 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4090 space
= isl_basic_set_get_space(bset
);
4091 space
= isl_space_params(space
);
4092 bset
= isl_basic_set_reset_space(bset
, space
);
4096 /* Compute the parameter domain of the given set.
4098 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4103 if (isl_set_is_params(set
))
4106 n
= isl_set_dim(set
, isl_dim_set
);
4107 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4108 space
= isl_set_get_space(set
);
4109 space
= isl_space_params(space
);
4110 set
= isl_set_reset_space(set
, space
);
4114 /* Construct a zero-dimensional set with the given parameter domain.
4116 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4119 space
= isl_set_get_space(set
);
4120 space
= isl_space_set_from_params(space
);
4121 set
= isl_set_reset_space(set
, space
);
4125 /* Compute the parameter domain of the given map.
4127 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4132 n
= isl_map_dim(map
, isl_dim_in
);
4133 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4134 n
= isl_map_dim(map
, isl_dim_out
);
4135 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4136 space
= isl_map_get_space(map
);
4137 space
= isl_space_params(space
);
4138 map
= isl_map_reset_space(map
, space
);
4142 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4145 struct isl_basic_set
*domain
;
4151 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4153 n_in
= isl_basic_map_n_in(bmap
);
4154 n_out
= isl_basic_map_n_out(bmap
);
4155 domain
= isl_basic_set_from_basic_map(bmap
);
4156 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4158 domain
= isl_basic_set_reset_space(domain
, dim
);
4163 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4167 return isl_space_may_be_set(bmap
->dim
);
4170 /* Is this basic map actually a set?
4171 * Users should never call this function. Outside of isl,
4172 * the type should indicate whether something is a set or a map.
4174 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4178 return isl_space_is_set(bmap
->dim
);
4181 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4185 if (isl_basic_map_is_set(bmap
))
4187 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4190 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4191 __isl_take isl_basic_map
*bmap
)
4195 isl_basic_map
*domain
;
4196 int nparam
, n_in
, n_out
;
4199 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4200 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4201 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4203 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4204 domain
= isl_basic_map_universe(dim
);
4206 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4207 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4208 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4210 total
= isl_basic_map_total_dim(bmap
);
4212 for (i
= 0; i
< n_in
; ++i
) {
4213 k
= isl_basic_map_alloc_equality(bmap
);
4216 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4217 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4218 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4221 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4222 return isl_basic_map_finalize(bmap
);
4224 isl_basic_map_free(bmap
);
4228 __isl_give isl_basic_map
*isl_basic_map_range_map(
4229 __isl_take isl_basic_map
*bmap
)
4233 isl_basic_map
*range
;
4234 int nparam
, n_in
, n_out
;
4237 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4238 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4239 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4241 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4242 range
= isl_basic_map_universe(dim
);
4244 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4245 bmap
= isl_basic_map_apply_range(bmap
, range
);
4246 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4248 total
= isl_basic_map_total_dim(bmap
);
4250 for (i
= 0; i
< n_out
; ++i
) {
4251 k
= isl_basic_map_alloc_equality(bmap
);
4254 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4255 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4256 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4259 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4260 return isl_basic_map_finalize(bmap
);
4262 isl_basic_map_free(bmap
);
4266 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4270 return isl_space_may_be_set(map
->dim
);
4273 /* Is this map actually a set?
4274 * Users should never call this function. Outside of isl,
4275 * the type should indicate whether something is a set or a map.
4277 int isl_map_is_set(__isl_keep isl_map
*map
)
4281 return isl_space_is_set(map
->dim
);
4284 struct isl_set
*isl_map_range(struct isl_map
*map
)
4287 struct isl_set
*set
;
4291 if (isl_map_is_set(map
))
4292 return (isl_set
*)map
;
4294 map
= isl_map_cow(map
);
4298 set
= (struct isl_set
*) map
;
4299 set
->dim
= isl_space_range(set
->dim
);
4302 for (i
= 0; i
< map
->n
; ++i
) {
4303 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4307 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4308 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4315 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4318 isl_space
*domain_dim
;
4320 map
= isl_map_cow(map
);
4324 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4325 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4326 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4329 for (i
= 0; i
< map
->n
; ++i
) {
4330 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4334 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4335 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4342 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4345 isl_space
*range_dim
;
4347 map
= isl_map_cow(map
);
4351 range_dim
= isl_space_range(isl_map_get_space(map
));
4352 range_dim
= isl_space_from_range(range_dim
);
4353 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4354 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4357 for (i
= 0; i
< map
->n
; ++i
) {
4358 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4362 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4363 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4370 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4371 __isl_take isl_space
*dim
)
4374 struct isl_map
*map
= NULL
;
4376 set
= isl_set_cow(set
);
4379 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4380 map
= (struct isl_map
*)set
;
4381 for (i
= 0; i
< set
->n
; ++i
) {
4382 map
->p
[i
] = isl_basic_map_from_basic_set(
4383 set
->p
[i
], isl_space_copy(dim
));
4387 isl_space_free(map
->dim
);
4391 isl_space_free(dim
);
4396 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4397 __isl_take isl_basic_set
*bset
)
4399 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4402 __isl_give isl_basic_map
*isl_basic_map_from_range(
4403 __isl_take isl_basic_set
*bset
)
4406 space
= isl_basic_set_get_space(bset
);
4407 space
= isl_space_from_range(space
);
4408 bset
= isl_basic_set_reset_space(bset
, space
);
4409 return (isl_basic_map
*)bset
;
4412 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4415 space
= isl_set_get_space(set
);
4416 space
= isl_space_from_range(space
);
4417 set
= isl_set_reset_space(set
, space
);
4418 return (struct isl_map
*)set
;
4421 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4423 return isl_map_reverse(isl_map_from_range(set
));
4426 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4427 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4429 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4432 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4433 __isl_take isl_set
*range
)
4435 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4438 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4441 struct isl_set
*set
= NULL
;
4445 map
= isl_map_cow(map
);
4448 map
->dim
= isl_space_as_set_space(map
->dim
);
4451 set
= (struct isl_set
*)map
;
4452 for (i
= 0; i
< map
->n
; ++i
) {
4453 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4463 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4466 struct isl_map
*map
;
4470 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
4471 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4472 sizeof(struct isl_map
) +
4473 (n
- 1) * sizeof(struct isl_basic_map
*));
4477 map
->ctx
= dim
->ctx
;
4478 isl_ctx_ref(map
->ctx
);
4486 isl_space_free(dim
);
4490 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4491 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4494 struct isl_map
*map
;
4497 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4501 map
= isl_map_alloc_space(dims
, n
, flags
);
4505 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4507 struct isl_basic_map
*bmap
;
4508 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4509 bmap
= isl_basic_map_set_to_empty(bmap
);
4513 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4515 struct isl_basic_set
*bset
;
4516 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4517 bset
= isl_basic_set_set_to_empty(bset
);
4521 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4523 struct isl_basic_map
*bmap
;
4526 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4527 bmap
= isl_basic_map_set_to_empty(bmap
);
4531 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4533 struct isl_basic_map
*bmap
;
4536 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4537 bmap
= isl_basic_map_set_to_empty(bmap
);
4541 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4543 struct isl_basic_set
*bset
;
4546 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4547 bset
= isl_basic_set_set_to_empty(bset
);
4551 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4553 struct isl_basic_map
*bmap
;
4554 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4555 bmap
= isl_basic_map_finalize(bmap
);
4559 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
4561 struct isl_basic_set
*bset
;
4562 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
4563 bset
= isl_basic_set_finalize(bset
);
4567 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
4570 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
4571 isl_basic_map
*bmap
;
4573 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
4574 for (i
= 0; i
< total
; ++i
) {
4575 int k
= isl_basic_map_alloc_inequality(bmap
);
4578 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4579 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4583 isl_basic_map_free(bmap
);
4587 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
4589 return isl_basic_map_nat_universe(dim
);
4592 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
4594 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4597 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
4599 return isl_map_nat_universe(dim
);
4602 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4603 __isl_keep isl_basic_map
*model
)
4607 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4610 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4614 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4617 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4618 __isl_keep isl_set
*model
)
4622 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4625 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
4627 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4630 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4634 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4637 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4641 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4644 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
4646 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4649 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4653 return isl_set_empty(isl_space_copy(model
->dim
));
4656 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
4658 struct isl_map
*map
;
4661 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
4662 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4666 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
4668 struct isl_set
*set
;
4671 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
4672 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4676 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4680 return isl_set_universe(isl_space_copy(model
->dim
));
4683 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4686 struct isl_map
*dup
;
4690 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
4691 for (i
= 0; i
< map
->n
; ++i
)
4692 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4696 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4697 __isl_take isl_basic_map
*bmap
)
4701 if (isl_basic_map_plain_is_empty(bmap
)) {
4702 isl_basic_map_free(bmap
);
4705 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
4706 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4707 map
->p
[map
->n
] = bmap
;
4709 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4715 isl_basic_map_free(bmap
);
4719 void isl_map_free(struct isl_map
*map
)
4729 isl_ctx_deref(map
->ctx
);
4730 for (i
= 0; i
< map
->n
; ++i
)
4731 isl_basic_map_free(map
->p
[i
]);
4732 isl_space_free(map
->dim
);
4736 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4737 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4741 base
= isl_map_cow(base
);
4745 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
4748 for (i
= 0; i
< base
->n
; ++i
) {
4749 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
4750 isl_space_copy(base
->dim
), 0, 0, 0);
4760 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4761 unsigned nparam
, unsigned dim
)
4763 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4767 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4768 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4772 bmap
= isl_basic_map_cow(bmap
);
4773 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4774 j
= isl_basic_map_alloc_equality(bmap
);
4777 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4778 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4779 isl_int_set_si(bmap
->eq
[j
][0], value
);
4780 bmap
= isl_basic_map_simplify(bmap
);
4781 return isl_basic_map_finalize(bmap
);
4783 isl_basic_map_free(bmap
);
4787 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4788 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4792 bmap
= isl_basic_map_cow(bmap
);
4793 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4794 j
= isl_basic_map_alloc_equality(bmap
);
4797 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4798 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4799 isl_int_set(bmap
->eq
[j
][0], value
);
4800 bmap
= isl_basic_map_simplify(bmap
);
4801 return isl_basic_map_finalize(bmap
);
4803 isl_basic_map_free(bmap
);
4807 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4808 enum isl_dim_type type
, unsigned pos
, int value
)
4812 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4813 return isl_basic_map_fix_pos_si(bmap
,
4814 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4816 isl_basic_map_free(bmap
);
4820 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4821 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4825 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4826 return isl_basic_map_fix_pos(bmap
,
4827 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4829 isl_basic_map_free(bmap
);
4833 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4834 enum isl_dim_type type
, unsigned pos
, int value
)
4836 return (struct isl_basic_set
*)
4837 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4841 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4842 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4844 return (struct isl_basic_set
*)
4845 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4849 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4850 unsigned input
, int value
)
4852 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4855 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4856 unsigned dim
, int value
)
4858 return (struct isl_basic_set
*)
4859 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4860 isl_dim_set
, dim
, value
);
4863 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4864 enum isl_dim_type type
, unsigned pos
, int value
)
4868 map
= isl_map_cow(map
);
4872 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4873 for (i
= 0; i
< map
->n
; ++i
) {
4874 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4878 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4885 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4886 enum isl_dim_type type
, unsigned pos
, int value
)
4888 return (struct isl_set
*)
4889 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4892 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4893 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4897 map
= isl_map_cow(map
);
4901 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4902 for (i
= 0; i
< map
->n
; ++i
) {
4903 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4907 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4914 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4915 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4917 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4920 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4921 unsigned input
, int value
)
4923 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4926 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4928 return (struct isl_set
*)
4929 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4932 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4933 __isl_take isl_basic_map
*bmap
,
4934 enum isl_dim_type type
, unsigned pos
, int value
)
4940 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4941 pos
+= isl_basic_map_offset(bmap
, type
);
4942 bmap
= isl_basic_map_cow(bmap
);
4943 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4944 j
= isl_basic_map_alloc_inequality(bmap
);
4947 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4948 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4949 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4950 bmap
= isl_basic_map_simplify(bmap
);
4951 return isl_basic_map_finalize(bmap
);
4953 isl_basic_map_free(bmap
);
4957 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4958 unsigned dim
, isl_int value
)
4962 bset
= isl_basic_set_cow(bset
);
4963 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4964 j
= isl_basic_set_alloc_inequality(bset
);
4967 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4968 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4969 isl_int_neg(bset
->ineq
[j
][0], value
);
4970 bset
= isl_basic_set_simplify(bset
);
4971 return isl_basic_set_finalize(bset
);
4973 isl_basic_set_free(bset
);
4977 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4978 enum isl_dim_type type
, unsigned pos
, int value
)
4982 map
= isl_map_cow(map
);
4986 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4987 for (i
= 0; i
< map
->n
; ++i
) {
4988 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4993 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5000 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5001 enum isl_dim_type type
, unsigned pos
, int value
)
5003 return (struct isl_set
*)
5004 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5007 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5012 set
= isl_set_cow(set
);
5016 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5017 for (i
= 0; i
< set
->n
; ++i
) {
5018 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5028 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5032 map
= isl_map_cow(map
);
5036 map
->dim
= isl_space_reverse(map
->dim
);
5039 for (i
= 0; i
< map
->n
; ++i
) {
5040 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5044 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5051 static struct isl_map
*isl_basic_map_partial_lexopt(
5052 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5053 struct isl_set
**empty
, int max
)
5057 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5058 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5060 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5062 isl_basic_map_free(bmap
);
5063 isl_basic_set_free(dom
);
5069 struct isl_map
*isl_basic_map_partial_lexmax(
5070 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5071 struct isl_set
**empty
)
5073 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5076 struct isl_map
*isl_basic_map_partial_lexmin(
5077 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5078 struct isl_set
**empty
)
5080 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5083 struct isl_set
*isl_basic_set_partial_lexmin(
5084 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5085 struct isl_set
**empty
)
5087 return (struct isl_set
*)
5088 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5092 struct isl_set
*isl_basic_set_partial_lexmax(
5093 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5094 struct isl_set
**empty
)
5096 return (struct isl_set
*)
5097 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5101 /* Given a basic map "bmap", compute the lexicographically minimal
5102 * (or maximal) image element for each domain element in dom.
5103 * Set *empty to those elements in dom that do not have an image element.
5105 * We first make sure the basic sets in dom are disjoint and then
5106 * simply collect the results over each of the basic sets separately.
5107 * We could probably improve the efficiency a bit by moving the union
5108 * domain down into the parametric integer programming.
5110 static __isl_give isl_map
*basic_map_partial_lexopt(
5111 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
5112 __isl_give isl_set
**empty
, int max
)
5115 struct isl_map
*res
;
5117 dom
= isl_set_make_disjoint(dom
);
5121 if (isl_set_plain_is_empty(dom
)) {
5122 res
= isl_map_empty_like_basic_map(bmap
);
5123 *empty
= isl_set_empty_like(dom
);
5125 isl_basic_map_free(bmap
);
5129 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
5130 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
5132 for (i
= 1; i
< dom
->n
; ++i
) {
5133 struct isl_map
*res_i
;
5134 struct isl_set
*empty_i
;
5136 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
5137 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
5139 res
= isl_map_union_disjoint(res
, res_i
);
5140 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
5144 isl_basic_map_free(bmap
);
5149 isl_basic_map_free(bmap
);
5153 /* Given a map "map", compute the lexicographically minimal
5154 * (or maximal) image element for each domain element in dom.
5155 * Set *empty to those elements in dom that do not have an image element.
5157 * We first compute the lexicographically minimal or maximal element
5158 * in the first basic map. This results in a partial solution "res"
5159 * and a subset "todo" of dom that still need to be handled.
5160 * We then consider each of the remaining maps in "map" and successively
5161 * improve both "res" and "todo".
5163 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5164 * Assume we are computing the lexicographical maximum.
5165 * We first compute the lexicographically maximal element in basic map i.
5166 * This results in a partial solution res_i and a subset todo_i.
5167 * Then we combine these results with those obtain for the first k basic maps
5168 * to obtain a result that is valid for the first k+1 basic maps.
5169 * In particular, the set where there is no solution is the set where
5170 * there is no solution for the first k basic maps and also no solution
5171 * for the ith basic map, i.e.,
5173 * todo^i = todo^k * todo_i
5175 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5176 * solutions, arbitrarily breaking ties in favor of res^k.
5177 * That is, when res^k(a) >= res_i(a), we pick res^k and
5178 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5179 * the lexicographic order.)
5180 * In practice, we compute
5182 * res^k * (res_i . "<=")
5186 * res_i * (res^k . "<")
5188 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5189 * where only one of res^k and res_i provides a solution and we simply pick
5196 * Note that we only compute these intersections when dom(res^k) intersects
5197 * dom(res_i). Otherwise, the only effect of these intersections is to
5198 * potentially break up res^k and res_i into smaller pieces.
5199 * We want to avoid such splintering as much as possible.
5200 * In fact, an earlier implementation of this function would look for
5201 * better results in the domain of res^k and for extra results in todo^k,
5202 * but this would always result in a splintering according to todo^k,
5203 * even when the domain of basic map i is disjoint from the domains of
5204 * the previous basic maps.
5206 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5207 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5208 __isl_give isl_set
**empty
, int max
)
5211 struct isl_map
*res
;
5212 struct isl_set
*todo
;
5217 if (isl_map_plain_is_empty(map
)) {
5225 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5226 isl_set_copy(dom
), &todo
, max
);
5228 for (i
= 1; i
< map
->n
; ++i
) {
5232 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5234 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5235 isl_set_copy(dom
), &todo_i
, max
);
5238 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5239 le
= isl_map_lex_le(dim
);
5241 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5242 le
= isl_map_lex_ge(dim
);
5244 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5245 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5246 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5247 le
= isl_map_intersect(le
, isl_map_copy(res
));
5249 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5250 res
= isl_map_intersect_domain(res
,
5251 isl_set_copy(todo_i
));
5252 res_i
= isl_map_intersect_domain(res_i
,
5253 isl_set_copy(todo
));
5256 res
= isl_map_union_disjoint(res
, res_i
);
5257 res
= isl_map_union_disjoint(res
, lt
);
5258 res
= isl_map_union_disjoint(res
, le
);
5260 todo
= isl_set_intersect(todo
, todo_i
);
5280 /* Given a map "map", compute the lexicographically minimal
5281 * (or maximal) image element for each domain element in dom.
5282 * Set *empty to those elements in dom that do not have an image element.
5284 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5286 static __isl_give isl_map
*isl_map_partial_lexopt(
5287 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5288 __isl_give isl_set
**empty
, int max
)
5292 if (isl_space_match(map
->dim
, isl_dim_param
, dom
->dim
, isl_dim_param
))
5293 return isl_map_partial_lexopt_aligned(map
, dom
, empty
, max
);
5294 if (!isl_space_has_named_params(map
->dim
) ||
5295 !isl_space_has_named_params(dom
->dim
))
5296 isl_die(map
->ctx
, isl_error_invalid
,
5297 "unaligned unnamed parameters", goto error
);
5298 map
= isl_map_align_params(map
, isl_map_get_space(dom
));
5299 dom
= isl_map_align_params(dom
, isl_map_get_space(map
));
5300 return isl_map_partial_lexopt_aligned(map
, dom
, empty
, max
);
5309 __isl_give isl_map
*isl_map_partial_lexmax(
5310 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5311 __isl_give isl_set
**empty
)
5313 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5316 __isl_give isl_map
*isl_map_partial_lexmin(
5317 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5318 __isl_give isl_set
**empty
)
5320 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5323 __isl_give isl_set
*isl_set_partial_lexmin(
5324 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5325 __isl_give isl_set
**empty
)
5327 return (struct isl_set
*)
5328 isl_map_partial_lexmin((struct isl_map
*)set
,
5332 __isl_give isl_set
*isl_set_partial_lexmax(
5333 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5334 __isl_give isl_set
**empty
)
5336 return (struct isl_set
*)
5337 isl_map_partial_lexmax((struct isl_map
*)set
,
5341 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5343 struct isl_basic_set
*dom
= NULL
;
5348 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5349 dom
= isl_basic_set_universe(dom_dim
);
5350 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5352 isl_basic_map_free(bmap
);
5356 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5358 return isl_basic_map_lexopt(bmap
, 0);
5361 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5363 return isl_basic_map_lexopt(bmap
, 1);
5366 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5368 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
5371 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
5373 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
5376 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
5378 struct isl_set
*dom
= NULL
;
5383 dom_dim
= isl_space_domain(isl_space_copy(map
->dim
));
5384 dom
= isl_set_universe(dom_dim
);
5385 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
5391 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
5393 return isl_map_lexopt(map
, 0);
5396 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
5398 return isl_map_lexopt(map
, 1);
5401 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5403 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5406 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5408 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5411 /* Construct a map that equates the two given dimensions in the given space.
5413 static __isl_give isl_map
*equate(__isl_take isl_space
*dim
,
5414 enum isl_dim_type src_type
, int src_pos
,
5415 enum isl_dim_type dst_type
, int dst_pos
)
5417 isl_basic_map
*bmap
;
5420 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5421 k
= isl_basic_map_alloc_equality(bmap
);
5424 isl_seq_clr(bmap
->eq
[k
], 1 + isl_basic_map_total_dim(bmap
));
5425 src_pos
+= isl_basic_map_offset(bmap
, src_type
);
5426 dst_pos
+= isl_basic_map_offset(bmap
, dst_type
);
5427 isl_int_set_si(bmap
->eq
[k
][src_pos
], 1);
5428 isl_int_set_si(bmap
->eq
[k
][dst_pos
], -1);
5430 return isl_map_from_basic_map(bmap
);
5432 isl_basic_map_free(bmap
);
5436 /* Extract the first and only affine expression from list
5437 * and then add it to *pwaff with the given dom.
5438 * This domain is known to be disjoint from other domains
5439 * because of the way isl_basic_set_foreach_lexmax works.
5441 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
5442 __isl_take isl_aff_list
*list
, void *user
)
5444 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
5446 isl_pw_aff
**pwaff
= user
;
5447 isl_pw_aff
*pwaff_i
;
5449 if (isl_aff_list_n_aff(list
) != 1)
5450 isl_die(ctx
, isl_error_internal
,
5451 "expecting single element list", goto error
);
5453 aff
= isl_aff_list_get_aff(list
, 0);
5454 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
5456 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
5458 isl_aff_list_free(list
);
5462 isl_basic_set_free(dom
);
5463 isl_aff_list_free(list
);
5467 /* Given a one-dimensional basic set, compute the minimum or maximum of that
5468 * dimension as an isl_pw_aff.
5470 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexopt
5471 * call update_dim_opt on each leaf of the result.
5473 static __isl_give isl_pw_aff
*basic_set_dim_opt(__isl_keep isl_basic_set
*bset
,
5476 isl_space
*dim
= isl_basic_set_get_space(bset
);
5480 dim
= isl_space_params(dim
);
5481 dim
= isl_space_add_dims(dim
, isl_dim_set
, 1);
5482 pwaff
= isl_pw_aff_empty(dim
);
5484 r
= isl_basic_set_foreach_lexopt(bset
, max
, &update_dim_opt
, &pwaff
);
5486 return isl_pw_aff_free(pwaff
);
5491 /* Compute the minimum or maximum of the given set dimension
5492 * as a function of the parameters, but independently of
5493 * the other set dimensions.
5495 * We first project the set onto the given dimension and then compute
5496 * the "lexicographic" maximum in each basic set, combining the results
5497 * using isl_pw_aff_union_max.
5499 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
5506 map
= isl_map_from_domain(set
);
5507 map
= isl_map_add_dims(map
, isl_dim_out
, 1);
5508 map
= isl_map_intersect(map
,
5509 equate(isl_map_get_space(map
), isl_dim_in
, pos
,
5511 set
= isl_map_range(map
);
5516 isl_space
*dim
= isl_set_get_space(set
);
5517 dim
= isl_space_domain(isl_space_from_range(dim
));
5519 return isl_pw_aff_empty(dim
);
5522 pwaff
= basic_set_dim_opt(set
->p
[0], max
);
5523 for (i
= 1; i
< set
->n
; ++i
) {
5524 isl_pw_aff
*pwaff_i
;
5526 pwaff_i
= basic_set_dim_opt(set
->p
[i
], max
);
5527 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
5535 /* Compute the maximum of the given set dimension as a function of the
5536 * parameters, but independently of the other set dimensions.
5538 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
5540 return set_dim_opt(set
, pos
, 1);
5543 /* Compute the minimum of the given set dimension as a function of the
5544 * parameters, but independently of the other set dimensions.
5546 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
5548 return set_dim_opt(set
, pos
, 0);
5551 /* Apply a preimage specified by "mat" on the parameters of "bset".
5552 * bset is assumed to have only parameters and divs.
5554 static struct isl_basic_set
*basic_set_parameter_preimage(
5555 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
5562 bset
->dim
= isl_space_cow(bset
->dim
);
5566 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5568 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5570 bset
->dim
->nparam
= 0;
5571 bset
->dim
->n_out
= nparam
;
5572 bset
= isl_basic_set_preimage(bset
, mat
);
5574 bset
->dim
->nparam
= bset
->dim
->n_out
;
5575 bset
->dim
->n_out
= 0;
5580 isl_basic_set_free(bset
);
5584 /* Apply a preimage specified by "mat" on the parameters of "set".
5585 * set is assumed to have only parameters and divs.
5587 static struct isl_set
*set_parameter_preimage(
5588 struct isl_set
*set
, struct isl_mat
*mat
)
5590 isl_space
*dim
= NULL
;
5596 dim
= isl_space_copy(set
->dim
);
5597 dim
= isl_space_cow(dim
);
5601 nparam
= isl_set_dim(set
, isl_dim_param
);
5603 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5606 dim
->n_out
= nparam
;
5607 isl_set_reset_space(set
, dim
);
5608 set
= isl_set_preimage(set
, mat
);
5611 dim
= isl_space_copy(set
->dim
);
5612 dim
= isl_space_cow(dim
);
5615 dim
->nparam
= dim
->n_out
;
5617 isl_set_reset_space(set
, dim
);
5620 isl_space_free(dim
);
5627 /* Intersect the basic set "bset" with the affine space specified by the
5628 * equalities in "eq".
5630 static struct isl_basic_set
*basic_set_append_equalities(
5631 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5639 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
5644 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
5645 for (i
= 0; i
< eq
->n_row
; ++i
) {
5646 k
= isl_basic_set_alloc_equality(bset
);
5649 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5650 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5654 bset
= isl_basic_set_gauss(bset
, NULL
);
5655 bset
= isl_basic_set_finalize(bset
);
5660 isl_basic_set_free(bset
);
5664 /* Intersect the set "set" with the affine space specified by the
5665 * equalities in "eq".
5667 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5675 for (i
= 0; i
< set
->n
; ++i
) {
5676 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5689 /* Project the given basic set onto its parameter domain, possibly introducing
5690 * new, explicit, existential variables in the constraints.
5691 * The input has parameters and (possibly implicit) existential variables.
5692 * The output has the same parameters, but only
5693 * explicit existentially quantified variables.
5695 * The actual projection is performed by pip, but pip doesn't seem
5696 * to like equalities very much, so we first remove the equalities
5697 * among the parameters by performing a variable compression on
5698 * the parameters. Afterward, an inverse transformation is performed
5699 * and the equalities among the parameters are inserted back in.
5701 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5705 struct isl_mat
*T
, *T2
;
5706 struct isl_set
*set
;
5707 unsigned nparam
, n_div
;
5709 bset
= isl_basic_set_cow(bset
);
5713 if (bset
->n_eq
== 0)
5714 return isl_basic_set_lexmin(bset
);
5716 isl_basic_set_gauss(bset
, NULL
);
5718 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5719 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5721 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5722 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5725 if (i
== bset
->n_eq
)
5726 return isl_basic_set_lexmin(bset
);
5728 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5730 eq
= isl_mat_cow(eq
);
5731 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5732 if (T
&& T
->n_col
== 0) {
5736 bset
= isl_basic_set_set_to_empty(bset
);
5737 return isl_set_from_basic_set(bset
);
5739 bset
= basic_set_parameter_preimage(bset
, T
);
5741 set
= isl_basic_set_lexmin(bset
);
5742 set
= set_parameter_preimage(set
, T2
);
5743 set
= set_append_equalities(set
, eq
);
5747 /* Compute an explicit representation for all the existentially
5748 * quantified variables.
5749 * The input and output dimensions are first turned into parameters.
5750 * compute_divs then returns a map with the same parameters and
5751 * no input or output dimensions and the dimension specification
5752 * is reset to that of the input.
5754 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5756 struct isl_basic_set
*bset
;
5757 struct isl_set
*set
;
5758 struct isl_map
*map
;
5759 isl_space
*dim
, *orig_dim
= NULL
;
5764 bmap
= isl_basic_map_cow(bmap
);
5768 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5769 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5770 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5771 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5775 orig_dim
= bmap
->dim
;
5777 bset
= (struct isl_basic_set
*)bmap
;
5779 set
= parameter_compute_divs(bset
);
5780 map
= (struct isl_map
*)set
;
5781 map
= isl_map_reset_space(map
, orig_dim
);
5785 isl_basic_map_free(bmap
);
5789 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5797 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
5798 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5799 if (isl_int_is_zero(bmap
->div
[i
][0]))
5801 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5807 static int map_divs_known(__isl_keep isl_map
*map
)
5814 for (i
= 0; i
< map
->n
; ++i
) {
5815 int known
= isl_basic_map_divs_known(map
->p
[i
]);
5823 /* If bmap contains any unknown divs, then compute explicit
5824 * expressions for them. However, this computation may be
5825 * quite expensive, so first try to remove divs that aren't
5828 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5831 struct isl_map
*map
;
5833 known
= isl_basic_map_divs_known(bmap
);
5837 return isl_map_from_basic_map(bmap
);
5839 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5841 known
= isl_basic_map_divs_known(bmap
);
5845 return isl_map_from_basic_map(bmap
);
5847 map
= compute_divs(bmap
);
5850 isl_basic_map_free(bmap
);
5854 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5858 struct isl_map
*res
;
5865 known
= map_divs_known(map
);
5873 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5874 for (i
= 1 ; i
< map
->n
; ++i
) {
5876 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5877 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5878 res
= isl_map_union_disjoint(res
, r2
);
5880 res
= isl_map_union(res
, r2
);
5887 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
5889 return (struct isl_set
*)
5890 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
5893 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
5895 return (struct isl_set
*)
5896 isl_map_compute_divs((struct isl_map
*)set
);
5899 struct isl_set
*isl_map_domain(struct isl_map
*map
)
5902 struct isl_set
*set
;
5907 map
= isl_map_cow(map
);
5911 set
= (struct isl_set
*)map
;
5912 set
->dim
= isl_space_domain(set
->dim
);
5915 for (i
= 0; i
< map
->n
; ++i
) {
5916 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
5920 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5921 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5928 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
5929 __isl_take isl_map
*map2
)
5933 struct isl_map
*map
= NULL
;
5947 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
5949 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5950 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5951 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5953 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
5954 map1
->n
+ map2
->n
, flags
);
5957 for (i
= 0; i
< map1
->n
; ++i
) {
5958 map
= isl_map_add_basic_map(map
,
5959 isl_basic_map_copy(map1
->p
[i
]));
5963 for (i
= 0; i
< map2
->n
; ++i
) {
5964 map
= isl_map_add_basic_map(map
,
5965 isl_basic_map_copy(map2
->p
[i
]));
5979 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
5980 __isl_take isl_map
*map2
)
5982 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
5985 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5987 map1
= isl_map_union_disjoint(map1
, map2
);
5991 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5995 struct isl_set
*isl_set_union_disjoint(
5996 struct isl_set
*set1
, struct isl_set
*set2
)
5998 return (struct isl_set
*)
5999 isl_map_union_disjoint(
6000 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6003 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6005 return (struct isl_set
*)
6006 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6009 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6010 __isl_take isl_set
*set
)
6013 struct isl_map
*result
;
6019 if (!isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
6020 isl_die(set
->ctx
, isl_error_invalid
,
6021 "parameters don't match", goto error
);
6023 if (isl_space_dim(set
->dim
, isl_dim_set
) != 0 &&
6024 !isl_map_compatible_range(map
, set
))
6025 isl_die(set
->ctx
, isl_error_invalid
,
6026 "incompatible spaces", goto error
);
6028 if (isl_set_plain_is_universe(set
)) {
6033 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6034 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6035 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6037 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6038 map
->n
* set
->n
, flags
);
6041 for (i
= 0; i
< map
->n
; ++i
)
6042 for (j
= 0; j
< set
->n
; ++j
) {
6043 result
= isl_map_add_basic_map(result
,
6044 isl_basic_map_intersect_range(
6045 isl_basic_map_copy(map
->p
[i
]),
6046 isl_basic_set_copy(set
->p
[j
])));
6059 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6060 __isl_take isl_set
*set
)
6062 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6065 struct isl_map
*isl_map_intersect_domain(
6066 struct isl_map
*map
, struct isl_set
*set
)
6068 return isl_map_reverse(
6069 isl_map_intersect_range(isl_map_reverse(map
), set
));
6072 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6073 __isl_take isl_map
*map2
)
6077 map1
= isl_map_reverse(map1
);
6078 map1
= isl_map_apply_range(map1
, map2
);
6079 return isl_map_reverse(map1
);
6086 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6087 __isl_take isl_map
*map2
)
6089 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6092 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6093 __isl_take isl_map
*map2
)
6095 isl_space
*dim_result
;
6096 struct isl_map
*result
;
6102 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6103 isl_space_copy(map2
->dim
));
6105 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6108 for (i
= 0; i
< map1
->n
; ++i
)
6109 for (j
= 0; j
< map2
->n
; ++j
) {
6110 result
= isl_map_add_basic_map(result
,
6111 isl_basic_map_apply_range(
6112 isl_basic_map_copy(map1
->p
[i
]),
6113 isl_basic_map_copy(map2
->p
[j
])));
6119 if (result
&& result
->n
<= 1)
6120 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6128 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6129 __isl_take isl_map
*map2
)
6131 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6135 * returns range - domain
6137 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6139 isl_space
*dims
, *target_dim
;
6140 struct isl_basic_set
*bset
;
6147 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6148 bmap
->dim
, isl_dim_out
),
6150 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6151 dim
= isl_basic_map_n_in(bmap
);
6152 nparam
= isl_basic_map_n_param(bmap
);
6153 bset
= isl_basic_set_from_basic_map(bmap
);
6154 bset
= isl_basic_set_cow(bset
);
6155 dims
= isl_basic_set_get_space(bset
);
6156 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6157 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6158 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6159 for (i
= 0; i
< dim
; ++i
) {
6160 int j
= isl_basic_map_alloc_equality(
6161 (struct isl_basic_map
*)bset
);
6164 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6165 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6166 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6167 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6169 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6170 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6173 isl_basic_map_free(bmap
);
6178 * returns range - domain
6180 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
6184 struct isl_set
*result
;
6189 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6190 map
->dim
, isl_dim_out
),
6192 dim
= isl_map_get_space(map
);
6193 dim
= isl_space_domain(dim
);
6194 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6197 for (i
= 0; i
< map
->n
; ++i
)
6198 result
= isl_set_add_basic_set(result
,
6199 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6208 * returns [domain -> range] -> range - domain
6210 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6211 __isl_take isl_basic_map
*bmap
)
6215 isl_basic_map
*domain
;
6219 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6220 isl_die(bmap
->ctx
, isl_error_invalid
,
6221 "domain and range don't match", goto error
);
6223 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6224 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6226 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6227 domain
= isl_basic_map_universe(dim
);
6229 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6230 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6231 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6233 total
= isl_basic_map_total_dim(bmap
);
6235 for (i
= 0; i
< n
; ++i
) {
6236 k
= isl_basic_map_alloc_equality(bmap
);
6239 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6240 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6241 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6242 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6245 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6246 return isl_basic_map_finalize(bmap
);
6248 isl_basic_map_free(bmap
);
6253 * returns [domain -> range] -> range - domain
6255 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6258 isl_space
*domain_dim
;
6263 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6264 isl_die(map
->ctx
, isl_error_invalid
,
6265 "domain and range don't match", goto error
);
6267 map
= isl_map_cow(map
);
6271 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6272 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6273 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6276 for (i
= 0; i
< map
->n
; ++i
) {
6277 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6281 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6288 __isl_give
struct isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6290 struct isl_basic_map
*bmap
;
6298 nparam
= dims
->nparam
;
6300 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6304 for (i
= 0; i
< dim
; ++i
) {
6305 int j
= isl_basic_map_alloc_equality(bmap
);
6308 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6309 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6310 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6312 return isl_basic_map_finalize(bmap
);
6314 isl_basic_map_free(bmap
);
6318 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6322 if (dim
->n_in
!= dim
->n_out
)
6323 isl_die(dim
->ctx
, isl_error_invalid
,
6324 "number of input and output dimensions needs to be "
6325 "the same", goto error
);
6326 return basic_map_identity(dim
);
6328 isl_space_free(dim
);
6332 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6334 if (!model
|| !model
->dim
)
6336 return isl_basic_map_identity(isl_space_copy(model
->dim
));
6339 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
6341 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
6344 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
6346 if (!model
|| !model
->dim
)
6348 return isl_map_identity(isl_space_copy(model
->dim
));
6351 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
6353 if (!model
|| !model
->dim
)
6355 return isl_map_identity(isl_space_copy(model
->dim
));
6358 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
6360 isl_space
*dim
= isl_set_get_space(set
);
6362 id
= isl_map_identity(isl_space_map_from_set(dim
));
6363 return isl_map_intersect_range(id
, set
);
6366 /* Construct a basic set with all set dimensions having only non-negative
6369 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
6370 __isl_take isl_space
*space
)
6375 struct isl_basic_set
*bset
;
6379 nparam
= space
->nparam
;
6381 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
6384 for (i
= 0; i
< dim
; ++i
) {
6385 int k
= isl_basic_set_alloc_inequality(bset
);
6388 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
6389 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
6393 isl_basic_set_free(bset
);
6397 /* Construct the half-space x_pos >= 0.
6399 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
6403 isl_basic_set
*nonneg
;
6405 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6406 k
= isl_basic_set_alloc_inequality(nonneg
);
6409 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
6410 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
6412 return isl_basic_set_finalize(nonneg
);
6414 isl_basic_set_free(nonneg
);
6418 /* Construct the half-space x_pos <= -1.
6420 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
6425 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6426 k
= isl_basic_set_alloc_inequality(neg
);
6429 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
6430 isl_int_set_si(neg
->ineq
[k
][0], -1);
6431 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
6433 return isl_basic_set_finalize(neg
);
6435 isl_basic_set_free(neg
);
6439 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
6440 enum isl_dim_type type
, unsigned first
, unsigned n
)
6443 isl_basic_set
*nonneg
;
6451 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
6453 for (i
= 0; i
< n
; ++i
) {
6454 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
6455 pos(set
->dim
, type
) + first
+ i
);
6456 neg
= neg_halfspace(isl_set_get_space(set
),
6457 pos(set
->dim
, type
) + first
+ i
);
6459 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
6468 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
6469 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6476 if (isl_set_plain_is_empty(set
)) {
6481 return fn(set
, signs
, user
);
6484 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
6486 half
= isl_set_intersect(half
, isl_set_copy(set
));
6487 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
6491 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
6493 half
= isl_set_intersect(half
, set
);
6494 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
6500 /* Call "fn" on the intersections of "set" with each of the orthants
6501 * (except for obviously empty intersections). The orthant is identified
6502 * by the signs array, with each entry having value 1 or -1 according
6503 * to the sign of the corresponding variable.
6505 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
6506 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6516 if (isl_set_plain_is_empty(set
))
6519 nparam
= isl_set_dim(set
, isl_dim_param
);
6520 nvar
= isl_set_dim(set
, isl_dim_set
);
6522 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
6524 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
6532 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6534 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6537 int isl_basic_map_is_subset(
6538 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6541 struct isl_map
*map1
;
6542 struct isl_map
*map2
;
6544 if (!bmap1
|| !bmap2
)
6547 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
6548 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
6550 is_subset
= isl_map_is_subset(map1
, map2
);
6558 int isl_basic_map_is_equal(
6559 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6563 if (!bmap1
|| !bmap2
)
6565 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6568 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6572 int isl_basic_set_is_equal(
6573 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6575 return isl_basic_map_is_equal(
6576 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
6579 int isl_map_is_empty(struct isl_map
*map
)
6586 for (i
= 0; i
< map
->n
; ++i
) {
6587 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
6596 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
6598 return map
? map
->n
== 0 : -1;
6601 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
6603 return isl_map_plain_is_empty(map
);
6606 int isl_set_plain_is_empty(struct isl_set
*set
)
6608 return set
? set
->n
== 0 : -1;
6611 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
6613 return isl_set_plain_is_empty(set
);
6616 int isl_set_is_empty(struct isl_set
*set
)
6618 return isl_map_is_empty((struct isl_map
*)set
);
6621 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6626 return isl_space_is_equal(map1
->dim
, map2
->dim
);
6629 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6634 return isl_space_is_equal(set1
->dim
, set2
->dim
);
6637 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6643 is_subset
= isl_map_is_subset(map1
, map2
);
6646 is_subset
= isl_map_is_subset(map2
, map1
);
6650 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6652 return align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
6655 int isl_basic_map_is_strict_subset(
6656 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6660 if (!bmap1
|| !bmap2
)
6662 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6665 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6666 if (is_subset
== -1)
6671 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
6677 is_subset
= isl_map_is_subset(map1
, map2
);
6680 is_subset
= isl_map_is_subset(map2
, map1
);
6681 if (is_subset
== -1)
6686 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6688 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
6691 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6695 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6698 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6702 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6705 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
6712 for (i
= 0; i
< map
->n
; ++i
) {
6713 int r
= isl_basic_map_is_universe(map
->p
[i
]);
6721 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
6723 return isl_map_plain_is_universe((isl_map
*) set
);
6726 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6728 return isl_set_plain_is_universe(set
);
6731 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6733 struct isl_basic_set
*bset
= NULL
;
6734 struct isl_vec
*sample
= NULL
;
6741 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6744 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6745 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6746 copy
= isl_basic_map_remove_redundancies(copy
);
6747 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6748 isl_basic_map_free(copy
);
6752 total
= 1 + isl_basic_map_total_dim(bmap
);
6753 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6754 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6760 isl_vec_free(bmap
->sample
);
6761 bmap
->sample
= NULL
;
6762 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6765 sample
= isl_basic_set_sample_vec(bset
);
6768 empty
= sample
->size
== 0;
6769 isl_vec_free(bmap
->sample
);
6770 bmap
->sample
= sample
;
6772 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6777 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
6781 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6784 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
6786 return isl_basic_map_plain_is_empty(bmap
);
6789 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
6793 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6796 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
6798 return isl_basic_set_plain_is_empty(bset
);
6801 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6803 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6806 struct isl_map
*isl_basic_map_union(
6807 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6809 struct isl_map
*map
;
6810 if (!bmap1
|| !bmap2
)
6813 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6815 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
6818 map
= isl_map_add_basic_map(map
, bmap1
);
6819 map
= isl_map_add_basic_map(map
, bmap2
);
6822 isl_basic_map_free(bmap1
);
6823 isl_basic_map_free(bmap2
);
6827 struct isl_set
*isl_basic_set_union(
6828 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6830 return (struct isl_set
*)isl_basic_map_union(
6831 (struct isl_basic_map
*)bset1
,
6832 (struct isl_basic_map
*)bset2
);
6835 /* Order divs such that any div only depends on previous divs */
6836 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6844 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6846 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6848 if (isl_int_is_zero(bmap
->div
[i
][0]))
6850 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6854 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6860 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6862 return (struct isl_basic_set
*)
6863 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6866 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6873 for (i
= 0; i
< map
->n
; ++i
) {
6874 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
6885 /* Apply the expansion computed by isl_merge_divs.
6886 * The expansion itself is given by "exp" while the resulting
6887 * list of divs is given by "div".
6889 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
6890 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
6895 bset
= isl_basic_set_cow(bset
);
6899 if (div
->n_row
< bset
->n_div
)
6900 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
6901 "not an expansion", goto error
);
6903 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
6904 div
->n_row
- bset
->n_div
, 0,
6905 2 * (div
->n_row
- bset
->n_div
));
6907 n_div
= bset
->n_div
;
6908 for (i
= n_div
; i
< div
->n_row
; ++i
)
6909 if (isl_basic_set_alloc_div(bset
) < 0)
6913 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
6914 if (j
>= 0 && exp
[j
] == i
) {
6916 isl_basic_map_swap_div(bset
, i
, j
);
6919 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
6920 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
6928 isl_basic_set_free(bset
);
6933 /* Look for a div in dst that corresponds to the div "div" in src.
6934 * The divs before "div" in src and dst are assumed to be the same.
6936 * Returns -1 if no corresponding div was found and the position
6937 * of the corresponding div in dst otherwise.
6939 static int find_div(struct isl_basic_map
*dst
,
6940 struct isl_basic_map
*src
, unsigned div
)
6944 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
6946 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
6947 for (i
= div
; i
< dst
->n_div
; ++i
)
6948 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
6949 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
6950 dst
->n_div
- div
) == -1)
6955 struct isl_basic_map
*isl_basic_map_align_divs(
6956 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
6959 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
6964 if (src
->n_div
== 0)
6967 for (i
= 0; i
< src
->n_div
; ++i
)
6968 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
6970 src
= isl_basic_map_order_divs(src
);
6971 dst
= isl_basic_map_cow(dst
);
6972 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
6973 src
->n_div
, 0, 2 * src
->n_div
);
6976 for (i
= 0; i
< src
->n_div
; ++i
) {
6977 int j
= find_div(dst
, src
, i
);
6979 j
= isl_basic_map_alloc_div(dst
);
6982 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
6983 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
6984 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
6988 isl_basic_map_swap_div(dst
, i
, j
);
6992 isl_basic_map_free(dst
);
6996 struct isl_basic_set
*isl_basic_set_align_divs(
6997 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
6999 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7000 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7003 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7011 map
= isl_map_compute_divs(map
);
7012 map
= isl_map_cow(map
);
7016 for (i
= 1; i
< map
->n
; ++i
)
7017 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7018 for (i
= 1; i
< map
->n
; ++i
)
7019 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7021 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7025 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7027 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7030 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7031 __isl_take isl_map
*map
)
7035 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7036 map
= isl_map_intersect_domain(map
, set
);
7037 set
= isl_map_range(map
);
7045 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7046 __isl_take isl_map
*map
)
7048 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7051 /* There is no need to cow as removing empty parts doesn't change
7052 * the meaning of the set.
7054 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7061 for (i
= map
->n
-1; i
>= 0; --i
) {
7062 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
7064 isl_basic_map_free(map
->p
[i
]);
7065 if (i
!= map
->n
-1) {
7066 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7067 map
->p
[i
] = map
->p
[map
->n
-1];
7075 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7077 return (struct isl_set
*)
7078 isl_map_remove_empty_parts((struct isl_map
*)set
);
7081 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7083 struct isl_basic_map
*bmap
;
7084 if (!map
|| map
->n
== 0)
7086 bmap
= map
->p
[map
->n
-1];
7087 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7088 return isl_basic_map_copy(bmap
);
7091 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7093 return (struct isl_basic_set
*)
7094 isl_map_copy_basic_map((struct isl_map
*)set
);
7097 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7098 __isl_keep isl_basic_map
*bmap
)
7104 for (i
= map
->n
-1; i
>= 0; --i
) {
7105 if (map
->p
[i
] != bmap
)
7107 map
= isl_map_cow(map
);
7110 isl_basic_map_free(map
->p
[i
]);
7111 if (i
!= map
->n
-1) {
7112 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7113 map
->p
[i
] = map
->p
[map
->n
-1];
7124 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7125 struct isl_basic_set
*bset
)
7127 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7128 (struct isl_basic_map
*)bset
);
7131 /* Given two basic sets bset1 and bset2, compute the maximal difference
7132 * between the values of dimension pos in bset1 and those in bset2
7133 * for any common value of the parameters and dimensions preceding pos.
7135 static enum isl_lp_result
basic_set_maximal_difference_at(
7136 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7137 int pos
, isl_int
*opt
)
7140 struct isl_basic_map
*bmap1
= NULL
;
7141 struct isl_basic_map
*bmap2
= NULL
;
7142 struct isl_ctx
*ctx
;
7143 struct isl_vec
*obj
;
7146 unsigned dim1
, dim2
;
7147 enum isl_lp_result res
;
7149 if (!bset1
|| !bset2
)
7150 return isl_lp_error
;
7152 nparam
= isl_basic_set_n_param(bset1
);
7153 dim1
= isl_basic_set_n_dim(bset1
);
7154 dim2
= isl_basic_set_n_dim(bset2
);
7155 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7156 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7157 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7158 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7159 if (!bmap1
|| !bmap2
)
7161 bmap1
= isl_basic_map_cow(bmap1
);
7162 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7163 pos
, (dim1
- pos
) + (dim2
- pos
),
7164 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7165 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7168 total
= isl_basic_map_total_dim(bmap1
);
7170 obj
= isl_vec_alloc(ctx
, 1 + total
);
7171 isl_seq_clr(obj
->block
.data
, 1 + total
);
7172 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7173 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7176 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7178 isl_basic_map_free(bmap1
);
7182 isl_basic_map_free(bmap1
);
7183 isl_basic_map_free(bmap2
);
7184 return isl_lp_error
;
7187 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7188 * for any common value of the parameters and dimensions preceding pos
7189 * in both basic sets, the values of dimension pos in bset1 are
7190 * smaller or larger than those in bset2.
7193 * 1 if bset1 follows bset2
7194 * -1 if bset1 precedes bset2
7195 * 0 if bset1 and bset2 are incomparable
7196 * -2 if some error occurred.
7198 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7199 struct isl_basic_set
*bset2
, int pos
)
7202 enum isl_lp_result res
;
7207 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7209 if (res
== isl_lp_empty
)
7211 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7212 res
== isl_lp_unbounded
)
7214 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7223 /* Given two basic sets bset1 and bset2, check whether
7224 * for any common value of the parameters and dimensions preceding pos
7225 * there is a value of dimension pos in bset1 that is larger
7226 * than a value of the same dimension in bset2.
7229 * 1 if there exists such a pair
7230 * 0 if there is no such pair, but there is a pair of equal values
7232 * -2 if some error occurred.
7234 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7235 __isl_keep isl_basic_set
*bset2
, int pos
)
7238 enum isl_lp_result res
;
7243 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7245 if (res
== isl_lp_empty
)
7247 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7248 res
== isl_lp_unbounded
)
7250 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7252 else if (res
== isl_lp_ok
)
7261 /* Given two sets set1 and set2, check whether
7262 * for any common value of the parameters and dimensions preceding pos
7263 * there is a value of dimension pos in set1 that is larger
7264 * than a value of the same dimension in set2.
7267 * 1 if there exists such a pair
7268 * 0 if there is no such pair, but there is a pair of equal values
7270 * -2 if some error occurred.
7272 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7273 __isl_keep isl_set
*set2
, int pos
)
7281 for (i
= 0; i
< set1
->n
; ++i
)
7282 for (j
= 0; j
< set2
->n
; ++j
) {
7284 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7285 if (f
== 1 || f
== -2)
7294 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7295 unsigned pos
, isl_int
*val
)
7303 total
= isl_basic_map_total_dim(bmap
);
7304 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7305 for (; d
+1 > pos
; --d
)
7306 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7310 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7312 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7314 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7317 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7323 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7324 unsigned pos
, isl_int
*val
)
7336 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
7339 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
7340 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
7341 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
7342 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7346 isl_int_set(*val
, v
);
7352 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
7353 unsigned pos
, isl_int
*val
)
7355 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
7359 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
7362 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
7365 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
7366 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7368 if (pos
>= isl_basic_map_dim(bmap
, type
))
7370 return isl_basic_map_plain_has_fixed_var(bmap
,
7371 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
7374 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
7375 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7377 if (pos
>= isl_map_dim(map
, type
))
7379 return isl_map_plain_has_fixed_var(map
,
7380 map_offset(map
, type
) - 1 + pos
, val
);
7383 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
7384 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7386 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
7389 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
7390 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7392 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
7395 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7396 * then return this fixed value in *val.
7398 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
7399 unsigned dim
, isl_int
*val
)
7401 return isl_basic_set_plain_has_fixed_var(bset
,
7402 isl_basic_set_n_param(bset
) + dim
, val
);
7405 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7406 * then return this fixed value in *val.
7408 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
7409 unsigned dim
, isl_int
*val
)
7411 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
7414 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
7415 unsigned dim
, isl_int
*val
)
7417 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
7420 /* Check if input variable in has fixed value and if so and if val is not NULL,
7421 * then return this fixed value in *val.
7423 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
7424 unsigned in
, isl_int
*val
)
7426 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
7429 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7430 * and if val is not NULL, then return this lower bound in *val.
7432 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7433 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
7435 int i
, i_eq
= -1, i_ineq
= -1;
7442 total
= isl_basic_set_total_dim(bset
);
7443 nparam
= isl_basic_set_n_param(bset
);
7444 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7445 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
7451 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7452 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
7454 if (i_eq
!= -1 || i_ineq
!= -1)
7458 if (i_eq
== -1 && i_ineq
== -1)
7460 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
7461 /* The coefficient should always be one due to normalization. */
7462 if (!isl_int_is_one(c
[1+nparam
+dim
]))
7464 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
7466 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
7467 total
- nparam
- dim
- 1) != -1)
7470 isl_int_neg(*val
, c
[0]);
7474 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
7475 unsigned dim
, isl_int
*val
)
7487 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7491 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7493 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
7494 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
7496 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7500 isl_int_set(*val
, v
);
7511 /* uset_gist depends on constraints without existentially quantified
7512 * variables sorting first.
7514 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
7516 const struct constraint
*c1
= (const struct constraint
*)p1
;
7517 const struct constraint
*c2
= (const struct constraint
*)p2
;
7519 unsigned size
= isl_min(c1
->size
, c2
->size
);
7521 l1
= isl_seq_last_non_zero(c1
->c
, size
);
7522 l2
= isl_seq_last_non_zero(c2
->c
, size
);
7527 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
7530 static struct isl_basic_map
*isl_basic_map_sort_constraints(
7531 struct isl_basic_map
*bmap
)
7534 struct constraint
*c
;
7539 total
= isl_basic_map_total_dim(bmap
);
7540 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
7543 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7545 c
[i
].c
= bmap
->ineq
[i
];
7547 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
7548 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7549 bmap
->ineq
[i
] = c
[i
].c
;
7553 isl_basic_map_free(bmap
);
7557 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
7558 __isl_take isl_basic_set
*bset
)
7560 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
7561 (struct isl_basic_map
*)bset
);
7564 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
7568 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
7570 bmap
= isl_basic_map_remove_redundancies(bmap
);
7571 bmap
= isl_basic_map_sort_constraints(bmap
);
7572 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
7576 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
7578 return (struct isl_basic_set
*)isl_basic_map_normalize(
7579 (struct isl_basic_map
*)bset
);
7582 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
7583 const __isl_keep isl_basic_map
*bmap2
)
7590 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
7591 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
7592 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
7593 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
7594 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
7595 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
7596 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7597 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
7598 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7599 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
7600 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7602 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
7604 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7606 if (bmap1
->n_eq
!= bmap2
->n_eq
)
7607 return bmap1
->n_eq
- bmap2
->n_eq
;
7608 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
7609 return bmap1
->n_ineq
- bmap2
->n_ineq
;
7610 if (bmap1
->n_div
!= bmap2
->n_div
)
7611 return bmap1
->n_div
- bmap2
->n_div
;
7612 total
= isl_basic_map_total_dim(bmap1
);
7613 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
7614 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
7618 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
7619 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
7623 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
7624 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
7631 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
7632 const __isl_keep isl_basic_set
*bset2
)
7634 return isl_basic_map_plain_cmp(bset1
, bset2
);
7637 int isl_set_plain_cmp(const __isl_keep isl_set
*set1
,
7638 const __isl_keep isl_set
*set2
)
7644 if (set1
->n
!= set2
->n
)
7645 return set1
->n
- set2
->n
;
7647 for (i
= 0; i
< set1
->n
; ++i
) {
7648 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
7656 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
7657 __isl_keep isl_basic_map
*bmap2
)
7659 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
7662 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
7663 __isl_keep isl_basic_set
*bset2
)
7665 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
7666 (isl_basic_map
*)bset2
);
7669 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
7671 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
7672 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
7674 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
7677 /* We normalize in place, but if anything goes wrong we need
7678 * to return NULL, so we need to make sure we don't change the
7679 * meaning of any possible other copies of map.
7681 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
7684 struct isl_basic_map
*bmap
;
7688 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
7690 for (i
= 0; i
< map
->n
; ++i
) {
7691 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
7694 isl_basic_map_free(map
->p
[i
]);
7697 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
7698 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
7699 map
= isl_map_remove_empty_parts(map
);
7702 for (i
= map
->n
- 1; i
>= 1; --i
) {
7703 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
7705 isl_basic_map_free(map
->p
[i
-1]);
7706 for (j
= i
; j
< map
->n
; ++j
)
7707 map
->p
[j
-1] = map
->p
[j
];
7717 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
7719 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
7722 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7732 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7735 map1
= isl_map_copy(map1
);
7736 map2
= isl_map_copy(map2
);
7737 map1
= isl_map_normalize(map1
);
7738 map2
= isl_map_normalize(map2
);
7741 equal
= map1
->n
== map2
->n
;
7742 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
7743 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
7756 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7758 return isl_map_plain_is_equal(map1
, map2
);
7761 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7763 return isl_map_plain_is_equal((struct isl_map
*)set1
,
7764 (struct isl_map
*)set2
);
7767 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7769 return isl_set_plain_is_equal(set1
, set2
);
7772 /* Return an interval that ranges from min to max (inclusive)
7774 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
7775 isl_int min
, isl_int max
)
7778 struct isl_basic_set
*bset
= NULL
;
7780 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
7784 k
= isl_basic_set_alloc_inequality(bset
);
7787 isl_int_set_si(bset
->ineq
[k
][1], 1);
7788 isl_int_neg(bset
->ineq
[k
][0], min
);
7790 k
= isl_basic_set_alloc_inequality(bset
);
7793 isl_int_set_si(bset
->ineq
[k
][1], -1);
7794 isl_int_set(bset
->ineq
[k
][0], max
);
7798 isl_basic_set_free(bset
);
7802 /* Return the Cartesian product of the basic sets in list (in the given order).
7804 __isl_give isl_basic_set
*isl_basic_set_list_product(
7805 __isl_take
struct isl_basic_set_list
*list
)
7813 struct isl_basic_set
*product
= NULL
;
7817 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
7818 isl_assert(list
->ctx
, list
->p
[0], goto error
);
7819 nparam
= isl_basic_set_n_param(list
->p
[0]);
7820 dim
= isl_basic_set_n_dim(list
->p
[0]);
7821 extra
= list
->p
[0]->n_div
;
7822 n_eq
= list
->p
[0]->n_eq
;
7823 n_ineq
= list
->p
[0]->n_ineq
;
7824 for (i
= 1; i
< list
->n
; ++i
) {
7825 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
7826 isl_assert(list
->ctx
,
7827 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
7828 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7829 extra
+= list
->p
[i
]->n_div
;
7830 n_eq
+= list
->p
[i
]->n_eq
;
7831 n_ineq
+= list
->p
[i
]->n_ineq
;
7833 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
7838 for (i
= 0; i
< list
->n
; ++i
) {
7839 isl_basic_set_add_constraints(product
,
7840 isl_basic_set_copy(list
->p
[i
]), dim
);
7841 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7843 isl_basic_set_list_free(list
);
7846 isl_basic_set_free(product
);
7847 isl_basic_set_list_free(list
);
7851 struct isl_basic_map
*isl_basic_map_product(
7852 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7854 isl_space
*dim_result
= NULL
;
7855 struct isl_basic_map
*bmap
;
7856 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
7857 struct isl_dim_map
*dim_map1
, *dim_map2
;
7859 if (!bmap1
|| !bmap2
)
7862 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
7863 bmap2
->dim
, isl_dim_param
), goto error
);
7864 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
7865 isl_space_copy(bmap2
->dim
));
7867 in1
= isl_basic_map_n_in(bmap1
);
7868 in2
= isl_basic_map_n_in(bmap2
);
7869 out1
= isl_basic_map_n_out(bmap1
);
7870 out2
= isl_basic_map_n_out(bmap2
);
7871 nparam
= isl_basic_map_n_param(bmap1
);
7873 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7874 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7875 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7876 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7877 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7878 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7879 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7880 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7881 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7882 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7883 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7885 bmap
= isl_basic_map_alloc_space(dim_result
,
7886 bmap1
->n_div
+ bmap2
->n_div
,
7887 bmap1
->n_eq
+ bmap2
->n_eq
,
7888 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7889 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7890 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7891 bmap
= isl_basic_map_simplify(bmap
);
7892 return isl_basic_map_finalize(bmap
);
7894 isl_basic_map_free(bmap1
);
7895 isl_basic_map_free(bmap2
);
7899 __isl_give isl_basic_map
*isl_basic_map_flat_product(
7900 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7902 isl_basic_map
*prod
;
7904 prod
= isl_basic_map_product(bmap1
, bmap2
);
7905 prod
= isl_basic_map_flatten(prod
);
7909 __isl_give isl_basic_set
*isl_basic_set_flat_product(
7910 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
7912 return isl_basic_map_flat_range_product(bset1
, bset2
);
7915 __isl_give isl_basic_map
*isl_basic_map_domain_product(
7916 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7918 isl_space
*space_result
= NULL
;
7919 isl_basic_map
*bmap
;
7920 unsigned in1
, in2
, out
, nparam
, total
, pos
;
7921 struct isl_dim_map
*dim_map1
, *dim_map2
;
7923 if (!bmap1
|| !bmap2
)
7926 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
7927 isl_space_copy(bmap2
->dim
));
7929 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7930 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
7931 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
7932 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
7934 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
7935 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7936 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7937 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7938 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7939 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7940 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7941 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7942 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
7943 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
7944 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7946 bmap
= isl_basic_map_alloc_space(space_result
,
7947 bmap1
->n_div
+ bmap2
->n_div
,
7948 bmap1
->n_eq
+ bmap2
->n_eq
,
7949 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7950 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7951 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7952 bmap
= isl_basic_map_simplify(bmap
);
7953 return isl_basic_map_finalize(bmap
);
7955 isl_basic_map_free(bmap1
);
7956 isl_basic_map_free(bmap2
);
7960 __isl_give isl_basic_map
*isl_basic_map_range_product(
7961 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
7963 isl_space
*dim_result
= NULL
;
7964 isl_basic_map
*bmap
;
7965 unsigned in
, out1
, out2
, nparam
, total
, pos
;
7966 struct isl_dim_map
*dim_map1
, *dim_map2
;
7968 if (!bmap1
|| !bmap2
)
7971 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
7972 isl_space_copy(bmap2
->dim
));
7974 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
7975 out1
= isl_basic_map_n_out(bmap1
);
7976 out2
= isl_basic_map_n_out(bmap2
);
7977 nparam
= isl_basic_map_n_param(bmap1
);
7979 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7980 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7981 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7982 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7983 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7984 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7985 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
7986 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
7987 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
7988 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
7989 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
7991 bmap
= isl_basic_map_alloc_space(dim_result
,
7992 bmap1
->n_div
+ bmap2
->n_div
,
7993 bmap1
->n_eq
+ bmap2
->n_eq
,
7994 bmap1
->n_ineq
+ bmap2
->n_ineq
);
7995 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
7996 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
7997 bmap
= isl_basic_map_simplify(bmap
);
7998 return isl_basic_map_finalize(bmap
);
8000 isl_basic_map_free(bmap1
);
8001 isl_basic_map_free(bmap2
);
8005 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8006 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8008 isl_basic_map
*prod
;
8010 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8011 prod
= isl_basic_map_flatten_range(prod
);
8015 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8016 __isl_take isl_map
*map2
,
8017 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8018 __isl_take isl_space
*right
),
8019 __isl_give isl_basic_map
*(*basic_map_product
)(
8020 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8023 struct isl_map
*result
;
8029 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8030 map2
->dim
, isl_dim_param
), goto error
);
8032 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8033 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8034 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8036 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8037 isl_space_copy(map2
->dim
)),
8038 map1
->n
* map2
->n
, flags
);
8041 for (i
= 0; i
< map1
->n
; ++i
)
8042 for (j
= 0; j
< map2
->n
; ++j
) {
8043 struct isl_basic_map
*part
;
8044 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8045 isl_basic_map_copy(map2
->p
[j
]));
8046 if (isl_basic_map_is_empty(part
))
8047 isl_basic_map_free(part
);
8049 result
= isl_map_add_basic_map(result
, part
);
8062 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8064 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8065 __isl_take isl_map
*map2
)
8067 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8070 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8071 __isl_take isl_map
*map2
)
8073 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8076 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8078 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8079 __isl_take isl_map
*map2
)
8083 prod
= isl_map_product(map1
, map2
);
8084 prod
= isl_map_flatten(prod
);
8088 /* Given two set A and B, construct its Cartesian product A x B.
8090 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8092 return isl_map_range_product(set1
, set2
);
8095 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8096 __isl_take isl_set
*set2
)
8098 return isl_map_flat_range_product(set1
, set2
);
8101 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8103 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8104 __isl_take isl_map
*map2
)
8106 return map_product(map1
, map2
, &isl_space_domain_product
,
8107 &isl_basic_map_domain_product
);
8110 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8112 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8113 __isl_take isl_map
*map2
)
8115 return map_product(map1
, map2
, &isl_space_range_product
,
8116 &isl_basic_map_range_product
);
8119 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8120 __isl_take isl_map
*map2
)
8122 return isl_map_align_params_map_map_and(map1
, map2
,
8123 &map_domain_product_aligned
);
8126 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8127 __isl_take isl_map
*map2
)
8129 return isl_map_align_params_map_map_and(map1
, map2
,
8130 &map_range_product_aligned
);
8133 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8135 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8136 __isl_take isl_map
*map2
)
8140 prod
= isl_map_domain_product(map1
, map2
);
8141 prod
= isl_map_flatten_domain(prod
);
8145 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8147 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8148 __isl_take isl_map
*map2
)
8152 prod
= isl_map_range_product(map1
, map2
);
8153 prod
= isl_map_flatten_range(prod
);
8157 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8160 uint32_t hash
= isl_hash_init();
8165 bmap
= isl_basic_map_copy(bmap
);
8166 bmap
= isl_basic_map_normalize(bmap
);
8169 total
= isl_basic_map_total_dim(bmap
);
8170 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8171 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8173 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8174 isl_hash_hash(hash
, c_hash
);
8176 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8177 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8179 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8180 isl_hash_hash(hash
, c_hash
);
8182 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8183 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8185 if (isl_int_is_zero(bmap
->div
[i
][0]))
8187 isl_hash_byte(hash
, i
& 0xFF);
8188 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8189 isl_hash_hash(hash
, c_hash
);
8191 isl_basic_map_free(bmap
);
8195 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8197 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8200 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8207 map
= isl_map_copy(map
);
8208 map
= isl_map_normalize(map
);
8212 hash
= isl_hash_init();
8213 for (i
= 0; i
< map
->n
; ++i
) {
8215 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8216 isl_hash_hash(hash
, bmap_hash
);
8224 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8226 return isl_map_get_hash((isl_map
*)set
);
8229 /* Check if the value for dimension dim is completely determined
8230 * by the values of the other parameters and variables.
8231 * That is, check if dimension dim is involved in an equality.
8233 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8240 nparam
= isl_basic_set_n_param(bset
);
8241 for (i
= 0; i
< bset
->n_eq
; ++i
)
8242 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8247 /* Check if the value for dimension dim is completely determined
8248 * by the values of the other parameters and variables.
8249 * That is, check if dimension dim is involved in an equality
8250 * for each of the subsets.
8252 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8258 for (i
= 0; i
< set
->n
; ++i
) {
8260 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8267 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8269 return set
? set
->n
: 0;
8272 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8273 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8280 for (i
= 0; i
< map
->n
; ++i
)
8281 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8287 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8288 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8295 for (i
= 0; i
< set
->n
; ++i
)
8296 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8302 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8309 bset
= isl_basic_set_cow(bset
);
8313 dim
= isl_basic_set_get_space(bset
);
8314 dim
= isl_space_lift(dim
, bset
->n_div
);
8317 isl_space_free(bset
->dim
);
8319 bset
->extra
-= bset
->n_div
;
8322 bset
= isl_basic_set_finalize(bset
);
8326 isl_basic_set_free(bset
);
8330 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
8336 set
= isl_set_align_divs(set
);
8341 set
= isl_set_cow(set
);
8345 n_div
= set
->p
[0]->n_div
;
8346 dim
= isl_set_get_space(set
);
8347 dim
= isl_space_lift(dim
, n_div
);
8350 isl_space_free(set
->dim
);
8353 for (i
= 0; i
< set
->n
; ++i
) {
8354 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
8365 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
8368 struct isl_basic_map
*bmap
;
8375 set
= isl_set_align_divs(set
);
8380 dim
= isl_set_get_space(set
);
8381 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
8383 return isl_map_identity(isl_space_map_from_set(dim
));
8386 n_div
= set
->p
[0]->n_div
;
8387 dim
= isl_space_map_from_set(dim
);
8388 n_param
= isl_space_dim(dim
, isl_dim_param
);
8389 n_set
= isl_space_dim(dim
, isl_dim_in
);
8390 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
8391 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
8392 for (i
= 0; i
< n_set
; ++i
)
8393 bmap
= var_equal(bmap
, i
);
8395 total
= n_param
+ n_set
+ n_set
+ n_div
;
8396 for (i
= 0; i
< n_div
; ++i
) {
8397 k
= isl_basic_map_alloc_inequality(bmap
);
8400 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
8401 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
8402 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
8403 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
8404 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
8405 set
->p
[0]->div
[i
][0]);
8407 l
= isl_basic_map_alloc_inequality(bmap
);
8410 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
8411 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
8412 set
->p
[0]->div
[i
][0]);
8413 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
8417 bmap
= isl_basic_map_simplify(bmap
);
8418 bmap
= isl_basic_map_finalize(bmap
);
8419 return isl_map_from_basic_map(bmap
);
8422 isl_basic_map_free(bmap
);
8426 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
8434 dim
= isl_basic_set_total_dim(bset
);
8435 size
+= bset
->n_eq
* (1 + dim
);
8436 size
+= bset
->n_ineq
* (1 + dim
);
8437 size
+= bset
->n_div
* (2 + dim
);
8442 int isl_set_size(__isl_keep isl_set
*set
)
8450 for (i
= 0; i
< set
->n
; ++i
)
8451 size
+= isl_basic_set_size(set
->p
[i
]);
8456 /* Check if there is any lower bound (if lower == 0) and/or upper
8457 * bound (if upper == 0) on the specified dim.
8459 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8460 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
8467 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
8469 pos
+= isl_basic_map_offset(bmap
, type
);
8471 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8472 if (isl_int_is_zero(bmap
->div
[i
][0]))
8474 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
8478 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8479 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
8482 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8483 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
8490 return lower
&& upper
;
8493 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8494 enum isl_dim_type type
, unsigned pos
)
8496 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
8499 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
8500 enum isl_dim_type type
, unsigned pos
)
8502 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
8505 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
8506 enum isl_dim_type type
, unsigned pos
)
8508 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
8511 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
8512 enum isl_dim_type type
, unsigned pos
)
8519 for (i
= 0; i
< map
->n
; ++i
) {
8521 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
8522 if (bounded
< 0 || !bounded
)
8529 /* Return 1 if the specified dim is involved in both an upper bound
8530 * and a lower bound.
8532 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
8533 enum isl_dim_type type
, unsigned pos
)
8535 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
8538 static int has_bound(__isl_keep isl_map
*map
,
8539 enum isl_dim_type type
, unsigned pos
,
8540 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
8541 enum isl_dim_type type
, unsigned pos
))
8548 for (i
= 0; i
< map
->n
; ++i
) {
8550 bounded
= fn(map
->p
[i
], type
, pos
);
8551 if (bounded
< 0 || bounded
)
8558 /* Return 1 if the specified dim is involved in any lower bound.
8560 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
8561 enum isl_dim_type type
, unsigned pos
)
8563 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
8566 /* Return 1 if the specified dim is involved in any upper bound.
8568 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
8569 enum isl_dim_type type
, unsigned pos
)
8571 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
8574 /* For each of the "n" variables starting at "first", determine
8575 * the sign of the variable and put the results in the first "n"
8576 * elements of the array "signs".
8578 * 1 means that the variable is non-negative
8579 * -1 means that the variable is non-positive
8580 * 0 means the variable attains both positive and negative values.
8582 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
8583 unsigned first
, unsigned n
, int *signs
)
8585 isl_vec
*bound
= NULL
;
8586 struct isl_tab
*tab
= NULL
;
8587 struct isl_tab_undo
*snap
;
8590 if (!bset
|| !signs
)
8593 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
8594 tab
= isl_tab_from_basic_set(bset
);
8598 isl_seq_clr(bound
->el
, bound
->size
);
8599 isl_int_set_si(bound
->el
[0], -1);
8601 snap
= isl_tab_snap(tab
);
8602 for (i
= 0; i
< n
; ++i
) {
8605 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
8606 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8609 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8610 if (isl_tab_rollback(tab
, snap
) < 0)
8618 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
8619 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8622 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8623 if (isl_tab_rollback(tab
, snap
) < 0)
8626 signs
[i
] = empty
? -1 : 0;
8630 isl_vec_free(bound
);
8634 isl_vec_free(bound
);
8638 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
8639 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
8641 if (!bset
|| !signs
)
8643 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
8646 first
+= pos(bset
->dim
, type
) - 1;
8647 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
8650 /* Check if the given basic map is obviously single-valued.
8651 * In particular, for each output dimension, check that there is
8652 * an equality that defines the output dimension in terms of
8653 * earlier dimensions.
8655 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
8665 total
= 1 + isl_basic_map_total_dim(bmap
);
8666 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
8667 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
8669 for (i
= 0; i
< n_out
; ++i
) {
8670 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
8671 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
8673 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
8674 total
- (o_out
+ i
+ 1)) == -1)
8677 if (j
>= bmap
->n_eq
)
8684 /* Check if the given map is obviously single-valued.
8686 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
8695 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
8698 /* Check if the given map is single-valued.
8703 * and check if the result is a subset of the identity mapping.
8705 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
8712 sv
= isl_map_plain_is_single_valued(map
);
8716 test
= isl_map_reverse(isl_map_copy(map
));
8717 test
= isl_map_apply_range(test
, isl_map_copy(map
));
8719 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
8720 id
= isl_map_identity(dim
);
8722 sv
= isl_map_is_subset(test
, id
);
8730 int isl_map_is_injective(__isl_keep isl_map
*map
)
8734 map
= isl_map_copy(map
);
8735 map
= isl_map_reverse(map
);
8736 in
= isl_map_is_single_valued(map
);
8742 /* Check if the given map is obviously injective.
8744 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
8748 map
= isl_map_copy(map
);
8749 map
= isl_map_reverse(map
);
8750 in
= isl_map_plain_is_single_valued(map
);
8756 int isl_map_is_bijective(__isl_keep isl_map
*map
)
8760 sv
= isl_map_is_single_valued(map
);
8764 return isl_map_is_injective(map
);
8767 int isl_set_is_singleton(__isl_keep isl_set
*set
)
8769 return isl_map_is_single_valued((isl_map
*)set
);
8772 int isl_map_is_translation(__isl_keep isl_map
*map
)
8777 delta
= isl_map_deltas(isl_map_copy(map
));
8778 ok
= isl_set_is_singleton(delta
);
8779 isl_set_free(delta
);
8784 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
8786 if (isl_seq_first_non_zero(p
, pos
) != -1)
8788 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
8793 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
8802 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
8805 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
8806 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
8807 for (j
= 0; j
< nvar
; ++j
) {
8808 int lower
= 0, upper
= 0;
8809 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8810 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
8812 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
8818 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8819 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
8821 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
8823 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
8828 if (!lower
|| !upper
)
8835 int isl_set_is_box(__isl_keep isl_set
*set
)
8842 return isl_basic_set_is_box(set
->p
[0]);
8845 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
8850 return isl_space_is_wrapping(bset
->dim
);
8853 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
8858 return isl_space_is_wrapping(set
->dim
);
8861 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
8863 bmap
= isl_basic_map_cow(bmap
);
8867 bmap
->dim
= isl_space_wrap(bmap
->dim
);
8871 bmap
= isl_basic_map_finalize(bmap
);
8873 return (isl_basic_set
*)bmap
;
8875 isl_basic_map_free(bmap
);
8879 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
8883 map
= isl_map_cow(map
);
8887 for (i
= 0; i
< map
->n
; ++i
) {
8888 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
8892 map
->dim
= isl_space_wrap(map
->dim
);
8896 return (isl_set
*)map
;
8902 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
8904 bset
= isl_basic_set_cow(bset
);
8908 bset
->dim
= isl_space_unwrap(bset
->dim
);
8912 bset
= isl_basic_set_finalize(bset
);
8914 return (isl_basic_map
*)bset
;
8916 isl_basic_set_free(bset
);
8920 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
8927 if (!isl_set_is_wrapping(set
))
8928 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
8931 set
= isl_set_cow(set
);
8935 for (i
= 0; i
< set
->n
; ++i
) {
8936 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
8941 set
->dim
= isl_space_unwrap(set
->dim
);
8945 return (isl_map
*)set
;
8951 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
8952 enum isl_dim_type type
)
8957 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
8960 bmap
= isl_basic_map_cow(bmap
);
8964 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
8968 bmap
= isl_basic_map_finalize(bmap
);
8972 isl_basic_map_free(bmap
);
8976 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
8977 enum isl_dim_type type
)
8984 if (!isl_space_is_named_or_nested(map
->dim
, type
))
8987 map
= isl_map_cow(map
);
8991 for (i
= 0; i
< map
->n
; ++i
) {
8992 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
8996 map
->dim
= isl_space_reset(map
->dim
, type
);
9006 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9011 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9014 bmap
= isl_basic_map_cow(bmap
);
9018 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9022 bmap
= isl_basic_map_finalize(bmap
);
9026 isl_basic_map_free(bmap
);
9030 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9032 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9035 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9036 __isl_take isl_basic_map
*bmap
)
9041 if (!bmap
->dim
->nested
[0])
9044 bmap
= isl_basic_map_cow(bmap
);
9048 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9052 bmap
= isl_basic_map_finalize(bmap
);
9056 isl_basic_map_free(bmap
);
9060 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9061 __isl_take isl_basic_map
*bmap
)
9066 if (!bmap
->dim
->nested
[1])
9069 bmap
= isl_basic_map_cow(bmap
);
9073 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9077 bmap
= isl_basic_map_finalize(bmap
);
9081 isl_basic_map_free(bmap
);
9085 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9092 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9095 map
= isl_map_cow(map
);
9099 for (i
= 0; i
< map
->n
; ++i
) {
9100 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9104 map
->dim
= isl_space_flatten(map
->dim
);
9114 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9116 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9119 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9121 isl_space
*dim
, *flat_dim
;
9124 dim
= isl_set_get_space(set
);
9125 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9126 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9127 map
= isl_map_intersect_domain(map
, set
);
9132 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9139 if (!map
->dim
->nested
[0])
9142 map
= isl_map_cow(map
);
9146 for (i
= 0; i
< map
->n
; ++i
) {
9147 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9151 map
->dim
= isl_space_flatten_domain(map
->dim
);
9161 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9168 if (!map
->dim
->nested
[1])
9171 map
= isl_map_cow(map
);
9175 for (i
= 0; i
< map
->n
; ++i
) {
9176 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9180 map
->dim
= isl_space_flatten_range(map
->dim
);
9190 /* Reorder the dimensions of "bmap" according to the given dim_map
9191 * and set the dimension specification to "dim".
9193 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9194 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9198 bmap
= isl_basic_map_cow(bmap
);
9199 if (!bmap
|| !dim
|| !dim_map
)
9202 res
= isl_basic_map_alloc_space(dim
,
9203 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9204 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9205 res
= isl_basic_map_finalize(res
);
9209 isl_basic_map_free(bmap
);
9210 isl_space_free(dim
);
9214 /* Reorder the dimensions of "map" according to given reordering.
9216 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9217 __isl_take isl_reordering
*r
)
9220 struct isl_dim_map
*dim_map
;
9222 map
= isl_map_cow(map
);
9223 dim_map
= isl_dim_map_from_reordering(r
);
9224 if (!map
|| !r
|| !dim_map
)
9227 for (i
= 0; i
< map
->n
; ++i
) {
9228 struct isl_dim_map
*dim_map_i
;
9230 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9232 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9233 isl_space_copy(r
->dim
), dim_map_i
);
9239 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9241 isl_reordering_free(r
);
9247 isl_reordering_free(r
);
9251 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
9252 __isl_take isl_reordering
*r
)
9254 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
9257 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
9258 __isl_take isl_space
*model
)
9265 ctx
= isl_space_get_ctx(model
);
9266 if (!isl_space_has_named_params(model
))
9267 isl_die(ctx
, isl_error_invalid
,
9268 "model has unnamed parameters", goto error
);
9269 if (!isl_space_has_named_params(map
->dim
))
9270 isl_die(ctx
, isl_error_invalid
,
9271 "relation has unnamed parameters", goto error
);
9272 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9273 isl_reordering
*exp
;
9275 model
= isl_space_drop_dims(model
, isl_dim_in
,
9276 0, isl_space_dim(model
, isl_dim_in
));
9277 model
= isl_space_drop_dims(model
, isl_dim_out
,
9278 0, isl_space_dim(model
, isl_dim_out
));
9279 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
9280 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
9281 map
= isl_map_realign(map
, exp
);
9284 isl_space_free(model
);
9287 isl_space_free(model
);
9292 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
9293 __isl_take isl_space
*model
)
9295 return isl_map_align_params(set
, model
);
9298 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
9299 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9300 enum isl_dim_type c2
, enum isl_dim_type c3
,
9301 enum isl_dim_type c4
, enum isl_dim_type c5
)
9303 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9304 struct isl_mat
*mat
;
9310 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
9311 isl_basic_map_total_dim(bmap
) + 1);
9314 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9315 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9316 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9317 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9318 isl_int_set(mat
->row
[i
][pos
],
9319 bmap
->eq
[i
][off
+ k
]);
9327 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
9328 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9329 enum isl_dim_type c2
, enum isl_dim_type c3
,
9330 enum isl_dim_type c4
, enum isl_dim_type c5
)
9332 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9333 struct isl_mat
*mat
;
9339 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
9340 isl_basic_map_total_dim(bmap
) + 1);
9343 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
9344 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9345 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9346 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9347 isl_int_set(mat
->row
[i
][pos
],
9348 bmap
->ineq
[i
][off
+ k
]);
9356 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
9357 __isl_take isl_space
*dim
,
9358 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9359 enum isl_dim_type c2
, enum isl_dim_type c3
,
9360 enum isl_dim_type c4
, enum isl_dim_type c5
)
9362 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9363 isl_basic_map
*bmap
;
9369 if (!dim
|| !eq
|| !ineq
)
9372 if (eq
->n_col
!= ineq
->n_col
)
9373 isl_die(dim
->ctx
, isl_error_invalid
,
9374 "equalities and inequalities matrices should have "
9375 "same number of columns", goto error
);
9377 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
9379 if (eq
->n_col
< total
)
9380 isl_die(dim
->ctx
, isl_error_invalid
,
9381 "number of columns too small", goto error
);
9383 extra
= eq
->n_col
- total
;
9385 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
9386 eq
->n_row
, ineq
->n_row
);
9389 for (i
= 0; i
< extra
; ++i
) {
9390 k
= isl_basic_map_alloc_div(bmap
);
9393 isl_int_set_si(bmap
->div
[k
][0], 0);
9395 for (i
= 0; i
< eq
->n_row
; ++i
) {
9396 l
= isl_basic_map_alloc_equality(bmap
);
9399 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9400 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9401 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9402 isl_int_set(bmap
->eq
[l
][off
+ k
],
9408 for (i
= 0; i
< ineq
->n_row
; ++i
) {
9409 l
= isl_basic_map_alloc_inequality(bmap
);
9412 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9413 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9414 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9415 isl_int_set(bmap
->ineq
[l
][off
+ k
],
9422 isl_space_free(dim
);
9428 isl_space_free(dim
);
9434 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
9435 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9436 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9438 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
9439 c1
, c2
, c3
, c4
, isl_dim_in
);
9442 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
9443 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9444 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9446 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
9447 c1
, c2
, c3
, c4
, isl_dim_in
);
9450 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
9451 __isl_take isl_space
*dim
,
9452 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9453 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9455 return (isl_basic_set
*)
9456 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
9457 c1
, c2
, c3
, c4
, isl_dim_in
);
9460 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
9465 return isl_space_can_zip(bmap
->dim
);
9468 int isl_map_can_zip(__isl_keep isl_map
*map
)
9473 return isl_space_can_zip(map
->dim
);
9476 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9477 * (A -> C) -> (B -> D).
9479 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
9488 if (!isl_basic_map_can_zip(bmap
))
9489 isl_die(bmap
->ctx
, isl_error_invalid
,
9490 "basic map cannot be zipped", goto error
);
9491 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
9492 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
9493 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
9494 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
9495 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
9498 bmap
->dim
= isl_space_zip(bmap
->dim
);
9503 isl_basic_map_free(bmap
);
9507 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9508 * (A -> C) -> (B -> D).
9510 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
9517 if (!isl_map_can_zip(map
))
9518 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
9521 map
= isl_map_cow(map
);
9525 for (i
= 0; i
< map
->n
; ++i
) {
9526 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
9531 map
->dim
= isl_space_zip(map
->dim
);
9541 /* Construct a basic map mapping the domain of the affine expression
9542 * to a one-dimensional range prescribed by the affine expression.
9544 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
9548 isl_local_space
*ls
;
9549 isl_basic_map
*bmap
;
9554 ls
= isl_aff_get_local_space(aff
);
9555 bmap
= isl_basic_map_from_local_space(ls
);
9556 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
9557 k
= isl_basic_map_alloc_equality(bmap
);
9561 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
9562 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
9563 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
9564 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
9565 aff
->v
->size
- (pos
+ 1));
9568 bmap
= isl_basic_map_finalize(bmap
);
9572 isl_basic_map_free(bmap
);
9576 /* Construct a basic map mapping a domain in the given space to
9577 * to an n-dimensional range, with n the number of elements in the list,
9578 * where each coordinate in the range is prescribed by the
9579 * corresponding affine expression.
9580 * The domains of all affine expressions in the list are assumed to match
9583 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
9584 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
9588 isl_basic_map
*bmap
;
9593 dim
= isl_space_from_domain(domain_dim
);
9594 bmap
= isl_basic_map_universe(dim
);
9596 for (i
= 0; i
< list
->n
; ++i
) {
9598 isl_basic_map
*bmap_i
;
9600 aff
= isl_aff_copy(list
->p
[i
]);
9601 bmap_i
= isl_basic_map_from_aff(aff
);
9603 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
9606 isl_aff_list_free(list
);
9610 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
9611 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9613 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
9616 /* Add a constraint imposing that the given two dimensions are equal.
9618 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
9619 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9621 isl_basic_map
*bmap
= NULL
;
9627 if (pos1
>= isl_map_dim(map
, type1
))
9628 isl_die(map
->ctx
, isl_error_invalid
,
9629 "index out of bounds", goto error
);
9630 if (pos2
>= isl_map_dim(map
, type2
))
9631 isl_die(map
->ctx
, isl_error_invalid
,
9632 "index out of bounds", goto error
);
9634 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
9635 i
= isl_basic_map_alloc_equality(bmap
);
9638 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
9639 pos1
+= isl_basic_map_offset(bmap
, type1
);
9640 pos2
+= isl_basic_map_offset(bmap
, type2
);
9641 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
9642 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
9643 bmap
= isl_basic_map_finalize(bmap
);
9645 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
9649 isl_basic_map_free(bmap
);
9654 /* Add a constraint imposing that the given two dimensions have opposite values.
9656 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
9657 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9659 isl_basic_map
*bmap
= NULL
;
9665 if (pos1
>= isl_map_dim(map
, type1
))
9666 isl_die(map
->ctx
, isl_error_invalid
,
9667 "index out of bounds", goto error
);
9668 if (pos2
>= isl_map_dim(map
, type2
))
9669 isl_die(map
->ctx
, isl_error_invalid
,
9670 "index out of bounds", goto error
);
9672 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
9673 i
= isl_basic_map_alloc_equality(bmap
);
9676 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
9677 pos1
+= isl_basic_map_offset(bmap
, type1
);
9678 pos2
+= isl_basic_map_offset(bmap
, type2
);
9679 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
9680 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
9681 bmap
= isl_basic_map_finalize(bmap
);
9683 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
9687 isl_basic_map_free(bmap
);
9692 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
9696 isl_local_space
*ls
;
9701 if (!isl_basic_map_divs_known(bmap
))
9702 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
9703 "some divs are unknown", return NULL
);
9705 ls
= isl_basic_map_get_local_space(bmap
);
9706 div
= isl_local_space_get_div(ls
, pos
);
9707 isl_local_space_free(ls
);
9712 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
9715 return isl_basic_map_get_div(bset
, pos
);