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>
33 #include <isl_options_private.h>
35 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
38 case isl_dim_param
: return dim
->nparam
;
39 case isl_dim_in
: return dim
->n_in
;
40 case isl_dim_out
: return dim
->n_out
;
41 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
46 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
49 case isl_dim_param
: return 1;
50 case isl_dim_in
: return 1 + dim
->nparam
;
51 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
56 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
57 enum isl_dim_type type
)
62 case isl_dim_cst
: return 1;
65 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
66 case isl_dim_div
: return bmap
->n_div
;
67 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
72 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
74 return map
? n(map
->dim
, type
) : 0;
77 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
79 return set
? n(set
->dim
, type
) : 0;
82 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
83 enum isl_dim_type type
)
85 isl_space
*dim
= bmap
->dim
;
87 case isl_dim_cst
: return 0;
88 case isl_dim_param
: return 1;
89 case isl_dim_in
: return 1 + dim
->nparam
;
90 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
91 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
96 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
97 enum isl_dim_type type
)
99 return isl_basic_map_offset(bset
, type
);
102 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
104 return pos(map
->dim
, type
);
107 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
108 enum isl_dim_type type
)
110 return isl_basic_map_dim(bset
, type
);
113 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
115 return isl_basic_set_dim(bset
, isl_dim_set
);
118 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
120 return isl_basic_set_dim(bset
, isl_dim_param
);
123 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
125 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
128 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
130 return isl_set_dim(set
, isl_dim_set
);
133 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
135 return isl_set_dim(set
, isl_dim_param
);
138 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
140 return bmap
? bmap
->dim
->n_in
: 0;
143 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
145 return bmap
? bmap
->dim
->n_out
: 0;
148 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
150 return bmap
? bmap
->dim
->nparam
: 0;
153 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
155 return bmap
? bmap
->n_div
: 0;
158 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
160 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
163 unsigned isl_map_n_in(const struct isl_map
*map
)
165 return map
? map
->dim
->n_in
: 0;
168 unsigned isl_map_n_out(const struct isl_map
*map
)
170 return map
? map
->dim
->n_out
: 0;
173 unsigned isl_map_n_param(const struct isl_map
*map
)
175 return map
? map
->dim
->nparam
: 0;
178 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
183 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
186 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
189 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
190 struct isl_basic_set
*bset
)
195 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
198 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
201 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
206 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
209 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
212 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
213 struct isl_basic_set
*bset
)
218 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
221 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
224 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
226 return bmap
? bmap
->ctx
: NULL
;
229 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
231 return bset
? bset
->ctx
: NULL
;
234 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
236 return map
? map
->ctx
: NULL
;
239 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
241 return set
? set
->ctx
: NULL
;
244 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
248 return isl_space_copy(bmap
->dim
);
251 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
255 return isl_space_copy(bset
->dim
);
258 __isl_give isl_local_space
*isl_basic_map_get_local_space(
259 __isl_keep isl_basic_map
*bmap
)
268 total
= isl_basic_map_total_dim(bmap
);
269 ls
= isl_local_space_alloc(isl_space_copy(bmap
->dim
), bmap
->n_div
);
273 for (i
= 0; i
< bmap
->n_div
; ++i
)
274 isl_seq_cpy(ls
->div
->row
[i
], bmap
->div
[i
], 2 + total
);
279 __isl_give isl_local_space
*isl_basic_set_get_local_space(
280 __isl_keep isl_basic_set
*bset
)
282 return isl_basic_map_get_local_space(bset
);
285 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
286 __isl_take isl_local_space
*ls
)
295 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
296 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
297 n_div
, 0, 2 * n_div
);
299 for (i
= 0; i
< n_div
; ++i
)
300 if (isl_basic_map_alloc_div(bmap
) < 0)
303 for (i
= 0; i
< n_div
; ++i
) {
304 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
305 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
309 isl_local_space_free(ls
);
312 isl_local_space_free(ls
);
313 isl_basic_map_free(bmap
);
317 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
318 __isl_take isl_local_space
*ls
)
320 return isl_basic_map_from_local_space(ls
);
323 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
327 return isl_space_copy(map
->dim
);
330 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
334 return isl_space_copy(set
->dim
);
337 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
338 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
340 bmap
= isl_basic_map_cow(bmap
);
343 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
346 bmap
= isl_basic_map_finalize(bmap
);
349 isl_basic_map_free(bmap
);
353 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
354 __isl_take isl_basic_set
*bset
, const char *s
)
356 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
359 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
360 enum isl_dim_type type
)
362 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
365 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
366 enum isl_dim_type type
, const char *s
)
370 map
= isl_map_cow(map
);
374 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
378 for (i
= 0; i
< map
->n
; ++i
) {
379 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
390 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
391 enum isl_dim_type type
)
393 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
396 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
399 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
402 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
403 enum isl_dim_type type
, __isl_take isl_id
*id
)
405 map
= isl_map_cow(map
);
407 return isl_id_free(id
);
409 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
411 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
414 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
415 __isl_take isl_id
*id
)
417 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
420 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
421 enum isl_dim_type type
)
423 map
= isl_map_cow(map
);
427 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
429 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
432 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
434 return isl_map_reset_tuple_id(set
, isl_dim_set
);
437 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
439 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
442 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
443 enum isl_dim_type type
)
445 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
448 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
450 return isl_map_has_tuple_id(set
, isl_dim_set
);
453 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
455 return isl_map_get_tuple_id(set
, isl_dim_set
);
458 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
460 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
463 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
465 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
468 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
469 enum isl_dim_type type
, unsigned pos
)
471 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
474 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
475 enum isl_dim_type type
, unsigned pos
)
477 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
480 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
481 enum isl_dim_type type
, unsigned pos
)
483 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
486 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
487 enum isl_dim_type type
, unsigned pos
)
489 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
492 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
493 __isl_take isl_basic_map
*bmap
,
494 enum isl_dim_type type
, unsigned pos
, const char *s
)
496 bmap
= isl_basic_map_cow(bmap
);
499 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
504 isl_basic_map_free(bmap
);
508 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
509 enum isl_dim_type type
, unsigned pos
, const char *s
)
513 map
= isl_map_cow(map
);
517 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
521 for (i
= 0; i
< map
->n
; ++i
) {
522 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
533 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
534 __isl_take isl_basic_set
*bset
,
535 enum isl_dim_type type
, unsigned pos
, const char *s
)
537 return (isl_basic_set
*)isl_basic_map_set_dim_name(
538 (isl_basic_map
*)bset
, type
, pos
, s
);
541 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
542 enum isl_dim_type type
, unsigned pos
, const char *s
)
544 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
547 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
548 enum isl_dim_type type
, unsigned pos
)
550 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
553 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
554 enum isl_dim_type type
, unsigned pos
)
556 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
559 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
560 enum isl_dim_type type
, unsigned pos
)
562 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
565 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
566 enum isl_dim_type type
, unsigned pos
)
568 return isl_map_has_dim_id(set
, type
, pos
);
571 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
572 enum isl_dim_type type
, unsigned pos
)
574 return isl_map_get_dim_id(set
, type
, pos
);
577 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
578 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
580 map
= isl_map_cow(map
);
582 return isl_id_free(id
);
584 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
586 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
589 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
590 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
592 return isl_map_set_dim_id(set
, type
, pos
, id
);
595 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
596 __isl_keep isl_id
*id
)
600 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
603 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
604 __isl_keep isl_id
*id
)
606 return isl_map_find_dim_by_id(set
, type
, id
);
609 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
614 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
617 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
621 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
624 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
626 return isl_basic_map_is_rational(bset
);
629 /* Is this basic set a parameter domain?
631 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
635 return isl_space_is_params(bset
->dim
);
638 /* Is this set a parameter domain?
640 int isl_set_is_params(__isl_keep isl_set
*set
)
644 return isl_space_is_params(set
->dim
);
647 /* Is this map actually a parameter domain?
648 * Users should never call this function. Outside of isl,
649 * a map can never be a parameter domain.
651 int isl_map_is_params(__isl_keep isl_map
*map
)
655 return isl_space_is_params(map
->dim
);
658 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
659 struct isl_basic_map
*bmap
, unsigned extra
,
660 unsigned n_eq
, unsigned n_ineq
)
663 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
668 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
669 if (isl_blk_is_error(bmap
->block
))
672 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
677 bmap
->block2
= isl_blk_empty();
680 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
681 if (isl_blk_is_error(bmap
->block2
))
684 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
689 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
690 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
692 for (i
= 0; i
< extra
; ++i
)
693 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
697 bmap
->c_size
= n_eq
+ n_ineq
;
698 bmap
->eq
= bmap
->ineq
+ n_ineq
;
707 isl_basic_map_free(bmap
);
711 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
712 unsigned nparam
, unsigned dim
, unsigned extra
,
713 unsigned n_eq
, unsigned n_ineq
)
715 struct isl_basic_map
*bmap
;
718 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
722 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
723 return (struct isl_basic_set
*)bmap
;
726 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
727 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
729 struct isl_basic_map
*bmap
;
732 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
733 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
734 return (struct isl_basic_set
*)bmap
;
740 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
741 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
743 struct isl_basic_map
*bmap
;
747 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
752 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
758 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
759 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
760 unsigned n_eq
, unsigned n_ineq
)
762 struct isl_basic_map
*bmap
;
765 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
769 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
773 static void dup_constraints(
774 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
777 unsigned total
= isl_basic_map_total_dim(src
);
779 for (i
= 0; i
< src
->n_eq
; ++i
) {
780 int j
= isl_basic_map_alloc_equality(dst
);
781 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
784 for (i
= 0; i
< src
->n_ineq
; ++i
) {
785 int j
= isl_basic_map_alloc_inequality(dst
);
786 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
789 for (i
= 0; i
< src
->n_div
; ++i
) {
790 int j
= isl_basic_map_alloc_div(dst
);
791 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
793 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
796 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
798 struct isl_basic_map
*dup
;
802 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
803 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
806 dup_constraints(dup
, bmap
);
807 dup
->flags
= bmap
->flags
;
808 dup
->sample
= isl_vec_copy(bmap
->sample
);
812 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
814 struct isl_basic_map
*dup
;
816 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
817 return (struct isl_basic_set
*)dup
;
820 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
825 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
829 return isl_basic_set_dup(bset
);
832 struct isl_set
*isl_set_copy(struct isl_set
*set
)
841 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
846 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
850 bmap
= isl_basic_map_dup(bmap
);
852 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
856 struct isl_map
*isl_map_copy(struct isl_map
*map
)
865 void isl_basic_map_free(struct isl_basic_map
*bmap
)
873 isl_ctx_deref(bmap
->ctx
);
875 isl_blk_free(bmap
->ctx
, bmap
->block2
);
877 isl_blk_free(bmap
->ctx
, bmap
->block
);
878 isl_vec_free(bmap
->sample
);
879 isl_space_free(bmap
->dim
);
883 void isl_basic_set_free(struct isl_basic_set
*bset
)
885 isl_basic_map_free((struct isl_basic_map
*)bset
);
888 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
890 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
893 __isl_give isl_map
*isl_map_align_params_map_map_and(
894 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
895 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
896 __isl_take isl_map
*map2
))
900 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
901 return fn(map1
, map2
);
902 if (!isl_space_has_named_params(map1
->dim
) ||
903 !isl_space_has_named_params(map2
->dim
))
904 isl_die(map1
->ctx
, isl_error_invalid
,
905 "unaligned unnamed parameters", goto error
);
906 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
907 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
908 return fn(map1
, map2
);
915 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
916 __isl_keep isl_map
*map2
,
917 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
923 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
924 return fn(map1
, map2
);
925 if (!isl_space_has_named_params(map1
->dim
) ||
926 !isl_space_has_named_params(map2
->dim
))
927 isl_die(map1
->ctx
, isl_error_invalid
,
928 "unaligned unnamed parameters", return -1);
929 map1
= isl_map_copy(map1
);
930 map2
= isl_map_copy(map2
);
931 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
932 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
939 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
945 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
946 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
948 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
949 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
950 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
951 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
952 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
953 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
955 int j
= isl_basic_map_alloc_inequality(bmap
);
959 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
960 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
967 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
968 bmap
->extra
- bmap
->n_div
);
972 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
974 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
977 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
981 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
986 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
988 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
991 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
996 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
998 if (pos
!= bmap
->n_eq
- 1) {
1000 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1001 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1007 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1009 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1012 void isl_basic_map_inequality_to_equality(
1013 struct isl_basic_map
*bmap
, unsigned pos
)
1017 t
= bmap
->ineq
[pos
];
1018 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1019 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1024 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1025 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1026 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1027 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1030 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1032 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1035 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1037 struct isl_ctx
*ctx
;
1041 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1042 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1043 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1044 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1045 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1046 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1047 1 + isl_basic_map_total_dim(bmap
),
1048 bmap
->extra
- bmap
->n_div
);
1049 return bmap
->n_ineq
++;
1052 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1054 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1057 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1061 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1066 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1068 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1071 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1076 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1078 if (pos
!= bmap
->n_ineq
- 1) {
1079 t
= bmap
->ineq
[pos
];
1080 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1081 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1082 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1088 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1090 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1093 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1098 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1101 k
= isl_basic_map_alloc_equality(bmap
);
1104 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1107 isl_basic_map_free(bmap
);
1111 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1114 return (isl_basic_set
*)
1115 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1118 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1123 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1126 k
= isl_basic_map_alloc_inequality(bmap
);
1129 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1132 isl_basic_map_free(bmap
);
1136 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1139 return (isl_basic_set
*)
1140 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1143 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1147 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1148 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1149 1 + 1 + isl_basic_map_total_dim(bmap
),
1150 bmap
->extra
- bmap
->n_div
);
1151 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1152 return bmap
->n_div
++;
1155 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1157 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1160 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1164 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1169 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1171 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1174 /* Copy constraint from src to dst, putting the vars of src at offset
1175 * dim_off in dst and the divs of src at offset div_off in dst.
1176 * If both sets are actually map, then dim_off applies to the input
1179 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1180 struct isl_basic_map
*src_map
, isl_int
*src
,
1181 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1183 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1184 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1185 unsigned src_in
= isl_basic_map_n_in(src_map
);
1186 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1187 unsigned src_out
= isl_basic_map_n_out(src_map
);
1188 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1189 isl_int_set(dst
[0], src
[0]);
1190 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1191 if (dst_nparam
> src_nparam
)
1192 isl_seq_clr(dst
+1+src_nparam
,
1193 dst_nparam
- src_nparam
);
1194 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1195 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1197 isl_min(dst_in
-in_off
, src_in
));
1198 if (dst_in
-in_off
> src_in
)
1199 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1200 dst_in
- in_off
- src_in
);
1201 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1202 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1203 src
+1+src_nparam
+src_in
,
1204 isl_min(dst_out
-out_off
, src_out
));
1205 if (dst_out
-out_off
> src_out
)
1206 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1207 dst_out
- out_off
- src_out
);
1208 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1209 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1210 src
+1+src_nparam
+src_in
+src_out
,
1211 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1212 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1213 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1214 div_off
+src_map
->n_div
,
1215 dst_map
->n_div
- div_off
- src_map
->n_div
);
1218 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1219 struct isl_basic_map
*src_map
, isl_int
*src
,
1220 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1222 isl_int_set(dst
[0], src
[0]);
1223 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1226 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1227 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1232 if (!bmap1
|| !bmap2
)
1235 div_off
= bmap1
->n_div
;
1237 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1238 int i1
= isl_basic_map_alloc_equality(bmap1
);
1241 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1242 i_pos
, o_pos
, div_off
);
1245 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1246 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1249 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1250 i_pos
, o_pos
, div_off
);
1253 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1254 int i1
= isl_basic_map_alloc_div(bmap1
);
1257 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1258 i_pos
, o_pos
, div_off
);
1261 isl_basic_map_free(bmap2
);
1266 isl_basic_map_free(bmap1
);
1267 isl_basic_map_free(bmap2
);
1271 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1272 struct isl_basic_set
*bset2
, unsigned pos
)
1274 return (struct isl_basic_set
*)
1275 add_constraints((struct isl_basic_map
*)bset1
,
1276 (struct isl_basic_map
*)bset2
, 0, pos
);
1279 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1280 __isl_take isl_space
*dim
, unsigned extra
,
1281 unsigned n_eq
, unsigned n_ineq
)
1283 struct isl_basic_map
*ext
;
1293 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1294 base
->extra
>= base
->n_div
+ extra
;
1296 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1297 room_for_ineq(base
, n_ineq
)) {
1298 isl_space_free(dim
);
1302 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1303 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1304 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1305 extra
+= base
->extra
;
1307 n_ineq
+= base
->n_ineq
;
1309 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1315 ext
->sample
= isl_vec_copy(base
->sample
);
1316 flags
= base
->flags
;
1317 ext
= add_constraints(ext
, base
, 0, 0);
1320 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1326 isl_space_free(dim
);
1327 isl_basic_map_free(base
);
1331 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1332 __isl_take isl_space
*dim
, unsigned extra
,
1333 unsigned n_eq
, unsigned n_ineq
)
1335 return (struct isl_basic_set
*)
1336 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1337 extra
, n_eq
, n_ineq
);
1340 struct isl_basic_map
*isl_basic_map_extend_constraints(
1341 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1345 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1349 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1350 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1351 unsigned n_eq
, unsigned n_ineq
)
1353 struct isl_basic_map
*bmap
;
1358 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1362 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1365 isl_basic_map_free(base
);
1369 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1370 unsigned nparam
, unsigned dim
, unsigned extra
,
1371 unsigned n_eq
, unsigned n_ineq
)
1373 return (struct isl_basic_set
*)
1374 isl_basic_map_extend((struct isl_basic_map
*)base
,
1375 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1378 struct isl_basic_set
*isl_basic_set_extend_constraints(
1379 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1381 return (struct isl_basic_set
*)
1382 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1386 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1388 return (struct isl_basic_set
*)
1389 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1392 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1397 if (bmap
->ref
> 1) {
1399 bmap
= isl_basic_map_dup(bmap
);
1402 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1406 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1414 return isl_set_dup(set
);
1417 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1425 return isl_map_dup(map
);
1428 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1429 unsigned a_len
, unsigned b_len
)
1431 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1432 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1433 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1436 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1437 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1445 isl_assert(bmap
->ctx
,
1446 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1448 if (n1
== 0 || n2
== 0)
1451 bmap
= isl_basic_map_cow(bmap
);
1455 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1456 if (isl_blk_is_error(blk
))
1459 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1461 bmap
->eq
[i
] + pos
, n1
, n2
);
1463 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1465 bmap
->ineq
[i
] + pos
, n1
, n2
);
1467 for (i
= 0; i
< bmap
->n_div
; ++i
)
1469 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1471 isl_blk_free(bmap
->ctx
, blk
);
1473 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1474 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1475 return isl_basic_map_finalize(bmap
);
1477 isl_basic_map_free(bmap
);
1481 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1482 __isl_take isl_basic_set
*bset
, unsigned n
)
1487 nparam
= isl_basic_set_n_param(bset
);
1488 dim
= isl_basic_set_n_dim(bset
);
1489 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1491 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1493 isl_basic_set_free(bset
);
1497 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1503 total
= isl_basic_map_total_dim(bmap
);
1504 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1505 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1507 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1509 i
= isl_basic_map_alloc_equality(bmap
);
1513 isl_int_set_si(bmap
->eq
[i
][0], 1);
1514 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1515 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1516 isl_vec_free(bmap
->sample
);
1517 bmap
->sample
= NULL
;
1518 return isl_basic_map_finalize(bmap
);
1520 isl_basic_map_free(bmap
);
1524 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1526 return (struct isl_basic_set
*)
1527 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1530 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1533 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1534 isl_int
*t
= bmap
->div
[a
];
1535 bmap
->div
[a
] = bmap
->div
[b
];
1538 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1539 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1541 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1542 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1544 for (i
= 0; i
< bmap
->n_div
; ++i
)
1545 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1546 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1549 /* Eliminate the specified n dimensions starting at first from the
1550 * constraints using Fourier-Motzkin. The dimensions themselves
1553 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1554 enum isl_dim_type type
, unsigned first
, unsigned n
)
1563 map
= isl_map_cow(map
);
1567 for (i
= 0; i
< map
->n
; ++i
) {
1568 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1578 /* Eliminate the specified n dimensions starting at first from the
1579 * constraints using Fourier-Motzkin. The dimensions themselves
1582 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1583 enum isl_dim_type type
, unsigned first
, unsigned n
)
1585 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1588 /* Eliminate the specified n dimensions starting at first from the
1589 * constraints using Fourier-Motzkin. The dimensions themselves
1592 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1593 unsigned first
, unsigned n
)
1595 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1598 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1599 __isl_take isl_basic_map
*bmap
)
1603 bmap
= isl_basic_map_eliminate_vars(bmap
,
1604 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1608 return isl_basic_map_finalize(bmap
);
1611 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1612 __isl_take isl_basic_set
*bset
)
1614 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1615 (struct isl_basic_map
*)bset
);
1618 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1627 map
= isl_map_cow(map
);
1631 for (i
= 0; i
< map
->n
; ++i
) {
1632 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1642 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1644 return isl_map_remove_divs(set
);
1647 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1648 enum isl_dim_type type
, unsigned first
, unsigned n
)
1652 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1654 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1656 bmap
= isl_basic_map_eliminate_vars(bmap
,
1657 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1660 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1662 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1665 isl_basic_map_free(bmap
);
1669 /* Return true if the definition of the given div (recursively) involves
1670 * any of the given variables.
1672 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1673 unsigned first
, unsigned n
)
1676 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1678 if (isl_int_is_zero(bmap
->div
[div
][0]))
1680 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1683 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1684 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1686 if (div_involves_vars(bmap
, i
, first
, n
))
1693 /* Remove all divs (recursively) involving any of the given dimensions
1694 * in their definitions.
1696 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1697 __isl_take isl_basic_map
*bmap
,
1698 enum isl_dim_type type
, unsigned first
, unsigned n
)
1704 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1706 first
+= isl_basic_map_offset(bmap
, type
);
1708 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1709 if (!div_involves_vars(bmap
, i
, first
, n
))
1711 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1719 isl_basic_map_free(bmap
);
1723 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1724 enum isl_dim_type type
, unsigned first
, unsigned n
)
1733 map
= isl_map_cow(map
);
1737 for (i
= 0; i
< map
->n
; ++i
) {
1738 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
1749 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
1750 enum isl_dim_type type
, unsigned first
, unsigned n
)
1752 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
1756 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
1757 enum isl_dim_type type
, unsigned first
, unsigned n
)
1764 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
1765 isl_die(bmap
->ctx
, isl_error_invalid
,
1766 "index out of bounds", return -1);
1768 first
+= isl_basic_map_offset(bmap
, type
);
1769 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1770 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
1772 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1773 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
1779 int isl_map_involves_dims(__isl_keep isl_map
*map
,
1780 enum isl_dim_type type
, unsigned first
, unsigned n
)
1787 if (first
+ n
> isl_map_dim(map
, type
))
1788 isl_die(map
->ctx
, isl_error_invalid
,
1789 "index out of bounds", return -1);
1791 for (i
= 0; i
< map
->n
; ++i
) {
1792 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
1794 if (involves
< 0 || involves
)
1801 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
1802 enum isl_dim_type type
, unsigned first
, unsigned n
)
1804 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
1807 int isl_set_involves_dims(__isl_keep isl_set
*set
,
1808 enum isl_dim_type type
, unsigned first
, unsigned n
)
1810 return isl_map_involves_dims(set
, type
, first
, n
);
1813 /* Return true if the definition of the given div is unknown or depends
1816 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
1819 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1821 if (isl_int_is_zero(bmap
->div
[div
][0]))
1824 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1825 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1827 if (div_is_unknown(bmap
, i
))
1834 /* Remove all divs that are unknown or defined in terms of unknown divs.
1836 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
1837 __isl_take isl_basic_map
*bmap
)
1844 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1845 if (!div_is_unknown(bmap
, i
))
1847 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1853 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
1862 map
= isl_map_cow(map
);
1866 for (i
= 0; i
< map
->n
; ++i
) {
1867 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
1877 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
1879 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
1882 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
1883 __isl_take isl_basic_set
*bset
,
1884 enum isl_dim_type type
, unsigned first
, unsigned n
)
1886 return (isl_basic_set
*)
1887 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
1890 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
1891 enum isl_dim_type type
, unsigned first
, unsigned n
)
1898 map
= isl_map_cow(map
);
1901 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1903 for (i
= 0; i
< map
->n
; ++i
) {
1904 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1905 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1909 map
= isl_map_drop(map
, type
, first
, n
);
1916 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
1917 enum isl_dim_type type
, unsigned first
, unsigned n
)
1919 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
1922 /* Project out n inputs starting at first using Fourier-Motzkin */
1923 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1924 unsigned first
, unsigned n
)
1926 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
1929 static void dump_term(struct isl_basic_map
*bmap
,
1930 isl_int c
, int pos
, FILE *out
)
1933 unsigned in
= isl_basic_map_n_in(bmap
);
1934 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1935 unsigned nparam
= isl_basic_map_n_param(bmap
);
1937 isl_int_print(out
, c
, 0);
1939 if (!isl_int_is_one(c
))
1940 isl_int_print(out
, c
, 0);
1941 if (pos
< 1 + nparam
) {
1942 name
= isl_space_get_dim_name(bmap
->dim
,
1943 isl_dim_param
, pos
- 1);
1945 fprintf(out
, "%s", name
);
1947 fprintf(out
, "p%d", pos
- 1);
1948 } else if (pos
< 1 + nparam
+ in
)
1949 fprintf(out
, "i%d", pos
- 1 - nparam
);
1950 else if (pos
< 1 + nparam
+ dim
)
1951 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1953 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1957 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1958 int sign
, FILE *out
)
1962 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1966 for (i
= 0, first
= 1; i
< len
; ++i
) {
1967 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1970 fprintf(out
, " + ");
1972 isl_int_abs(v
, c
[i
]);
1973 dump_term(bmap
, v
, i
, out
);
1980 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1981 const char *op
, FILE *out
, int indent
)
1985 fprintf(out
, "%*s", indent
, "");
1987 dump_constraint_sign(bmap
, c
, 1, out
);
1988 fprintf(out
, " %s ", op
);
1989 dump_constraint_sign(bmap
, c
, -1, out
);
1993 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1994 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
1996 fprintf(out
, "%*s", indent
, "");
1997 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2002 static void dump_constraints(struct isl_basic_map
*bmap
,
2003 isl_int
**c
, unsigned n
,
2004 const char *op
, FILE *out
, int indent
)
2008 for (i
= 0; i
< n
; ++i
)
2009 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2012 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2016 unsigned total
= isl_basic_map_total_dim(bmap
);
2018 for (j
= 0; j
< 1 + total
; ++j
) {
2019 if (isl_int_is_zero(exp
[j
]))
2021 if (!first
&& isl_int_is_pos(exp
[j
]))
2023 dump_term(bmap
, exp
[j
], j
, out
);
2028 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2032 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2033 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2035 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2036 fprintf(out
, "%*s", indent
, "");
2037 fprintf(out
, "e%d = [(", i
);
2038 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2040 isl_int_print(out
, bmap
->div
[i
][0], 0);
2041 fprintf(out
, "]\n");
2045 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2046 FILE *out
, int indent
)
2049 fprintf(out
, "null basic set\n");
2053 fprintf(out
, "%*s", indent
, "");
2054 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2055 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2056 bset
->extra
, bset
->flags
);
2057 dump((struct isl_basic_map
*)bset
, out
, indent
);
2060 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2061 FILE *out
, int indent
)
2064 fprintf(out
, "null basic map\n");
2068 fprintf(out
, "%*s", indent
, "");
2069 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2070 "flags: %x, n_name: %d\n",
2072 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2073 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2074 dump(bmap
, out
, indent
);
2077 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2082 total
= isl_basic_map_total_dim(bmap
);
2083 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2084 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2085 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2086 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2090 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2093 struct isl_set
*set
;
2097 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2098 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2099 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2100 sizeof(struct isl_set
) +
2101 (n
- 1) * sizeof(struct isl_basic_set
*));
2105 set
->ctx
= dim
->ctx
;
2106 isl_ctx_ref(set
->ctx
);
2114 isl_space_free(dim
);
2118 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2119 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2121 struct isl_set
*set
;
2124 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2128 set
= isl_set_alloc_space(dims
, n
, flags
);
2132 /* Make sure "map" has room for at least "n" more basic maps.
2134 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2137 struct isl_map
*grown
= NULL
;
2141 isl_assert(map
->ctx
, n
>= 0, goto error
);
2142 if (map
->n
+ n
<= map
->size
)
2144 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2147 for (i
= 0; i
< map
->n
; ++i
) {
2148 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2156 isl_map_free(grown
);
2161 /* Make sure "set" has room for at least "n" more basic sets.
2163 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2165 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2168 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2171 struct isl_set
*dup
;
2176 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2179 for (i
= 0; i
< set
->n
; ++i
)
2180 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2184 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2186 return isl_map_from_basic_map(bset
);
2189 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2191 struct isl_map
*map
;
2196 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2197 return isl_map_add_basic_map(map
, bmap
);
2200 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2201 __isl_take isl_basic_set
*bset
)
2203 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2204 (struct isl_basic_map
*)bset
);
2207 void isl_set_free(struct isl_set
*set
)
2217 isl_ctx_deref(set
->ctx
);
2218 for (i
= 0; i
< set
->n
; ++i
)
2219 isl_basic_set_free(set
->p
[i
]);
2220 isl_space_free(set
->dim
);
2224 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2229 fprintf(out
, "null set\n");
2233 fprintf(out
, "%*s", indent
, "");
2234 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2235 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2237 for (i
= 0; i
< set
->n
; ++i
) {
2238 fprintf(out
, "%*s", indent
, "");
2239 fprintf(out
, "basic set %d:\n", i
);
2240 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2244 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2249 fprintf(out
, "null map\n");
2253 fprintf(out
, "%*s", indent
, "");
2254 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2255 "flags: %x, n_name: %d\n",
2256 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2257 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2258 for (i
= 0; i
< map
->n
; ++i
) {
2259 fprintf(out
, "%*s", indent
, "");
2260 fprintf(out
, "basic map %d:\n", i
);
2261 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2265 struct isl_basic_map
*isl_basic_map_intersect_domain(
2266 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2268 struct isl_basic_map
*bmap_domain
;
2273 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2274 bset
->dim
, isl_dim_param
), goto error
);
2276 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2277 isl_assert(bset
->ctx
,
2278 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2280 bmap
= isl_basic_map_cow(bmap
);
2283 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2284 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2285 bmap_domain
= isl_basic_map_from_domain(bset
);
2286 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2288 bmap
= isl_basic_map_simplify(bmap
);
2289 return isl_basic_map_finalize(bmap
);
2291 isl_basic_map_free(bmap
);
2292 isl_basic_set_free(bset
);
2296 struct isl_basic_map
*isl_basic_map_intersect_range(
2297 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2299 struct isl_basic_map
*bmap_range
;
2304 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2305 bset
->dim
, isl_dim_param
), goto error
);
2307 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2308 isl_assert(bset
->ctx
,
2309 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2311 if (isl_basic_set_is_universe(bset
)) {
2312 isl_basic_set_free(bset
);
2316 bmap
= isl_basic_map_cow(bmap
);
2319 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2320 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2321 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2322 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2324 bmap
= isl_basic_map_simplify(bmap
);
2325 return isl_basic_map_finalize(bmap
);
2327 isl_basic_map_free(bmap
);
2328 isl_basic_set_free(bset
);
2332 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2338 total
= 1 + isl_basic_map_total_dim(bmap
);
2339 if (total
!= vec
->size
)
2344 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2345 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2346 if (!isl_int_is_zero(s
)) {
2352 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2353 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2354 if (isl_int_is_neg(s
)) {
2365 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2367 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2370 struct isl_basic_map
*isl_basic_map_intersect(
2371 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2373 struct isl_vec
*sample
= NULL
;
2375 if (!bmap1
|| !bmap2
)
2378 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2379 bmap2
->dim
, isl_dim_param
), goto error
);
2380 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2381 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2382 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2383 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2384 return isl_basic_map_intersect(bmap2
, bmap1
);
2386 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2387 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2388 isl_assert(bmap1
->ctx
,
2389 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2391 if (bmap1
->sample
&&
2392 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2393 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2394 sample
= isl_vec_copy(bmap1
->sample
);
2395 else if (bmap2
->sample
&&
2396 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2397 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2398 sample
= isl_vec_copy(bmap2
->sample
);
2400 bmap1
= isl_basic_map_cow(bmap1
);
2403 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2404 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2405 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2408 isl_vec_free(sample
);
2410 isl_vec_free(bmap1
->sample
);
2411 bmap1
->sample
= sample
;
2414 bmap1
= isl_basic_map_simplify(bmap1
);
2415 return isl_basic_map_finalize(bmap1
);
2418 isl_vec_free(sample
);
2419 isl_basic_map_free(bmap1
);
2420 isl_basic_map_free(bmap2
);
2424 struct isl_basic_set
*isl_basic_set_intersect(
2425 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2427 return (struct isl_basic_set
*)
2428 isl_basic_map_intersect(
2429 (struct isl_basic_map
*)bset1
,
2430 (struct isl_basic_map
*)bset2
);
2433 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2434 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2436 return isl_basic_set_intersect(bset1
, bset2
);
2439 /* Special case of isl_map_intersect, where both map1 and map2
2440 * are convex, without any divs and such that either map1 or map2
2441 * contains a single constraint. This constraint is then simply
2442 * added to the other map.
2444 static __isl_give isl_map
*map_intersect_add_constraint(
2445 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2447 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2448 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2449 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2450 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2452 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2453 return isl_map_intersect(map2
, map1
);
2455 isl_assert(map2
->ctx
,
2456 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2458 map1
= isl_map_cow(map1
);
2461 if (isl_map_plain_is_empty(map1
)) {
2465 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2466 if (map2
->p
[0]->n_eq
== 1)
2467 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2469 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2470 map2
->p
[0]->ineq
[0]);
2472 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2473 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2477 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2478 isl_basic_map_free(map1
->p
[0]);
2491 /* map2 may be either a parameter domain or a map living in the same
2494 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2495 __isl_take isl_map
*map2
)
2498 struct isl_map
*result
;
2504 if (isl_map_plain_is_empty(map1
) &&
2505 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2509 if (isl_map_plain_is_empty(map2
) &&
2510 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2515 if (map1
->n
== 1 && map2
->n
== 1 &&
2516 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2517 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2518 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2519 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2520 return map_intersect_add_constraint(map1
, map2
);
2522 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2523 isl_space_dim(map2
->dim
, isl_dim_param
))
2524 isl_assert(map1
->ctx
,
2525 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2527 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2528 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2529 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2531 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2532 map1
->n
* map2
->n
, flags
);
2535 for (i
= 0; i
< map1
->n
; ++i
)
2536 for (j
= 0; j
< map2
->n
; ++j
) {
2537 struct isl_basic_map
*part
;
2538 part
= isl_basic_map_intersect(
2539 isl_basic_map_copy(map1
->p
[i
]),
2540 isl_basic_map_copy(map2
->p
[j
]));
2541 if (isl_basic_map_is_empty(part
))
2542 isl_basic_map_free(part
);
2544 result
= isl_map_add_basic_map(result
, part
);
2557 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2558 __isl_take isl_map
*map2
)
2562 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2563 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2564 "spaces don't match", goto error
);
2565 return map_intersect_internal(map1
, map2
);
2572 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2573 __isl_take isl_map
*map2
)
2575 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2578 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2580 return (struct isl_set
*)
2581 isl_map_intersect((struct isl_map
*)set1
,
2582 (struct isl_map
*)set2
);
2585 /* map_intersect_internal accepts intersections
2586 * with parameter domains, so we can just call that function.
2588 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2589 __isl_take isl_set
*params
)
2591 return map_intersect_internal(map
, params
);
2594 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2595 __isl_take isl_map
*map2
)
2597 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2600 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2601 __isl_take isl_set
*params
)
2603 return isl_map_intersect_params(set
, params
);
2606 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2609 struct isl_basic_set
*bset
;
2614 bmap
= isl_basic_map_cow(bmap
);
2617 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2618 in
= isl_basic_map_n_in(bmap
);
2619 bset
= isl_basic_set_from_basic_map(bmap
);
2620 bset
= isl_basic_set_swap_vars(bset
, in
);
2621 return isl_basic_map_from_basic_set(bset
, dim
);
2624 static __isl_give isl_basic_map
*basic_map_space_reset(
2625 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2629 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2632 space
= isl_basic_map_get_space(bmap
);
2633 space
= isl_space_reset(space
, type
);
2634 bmap
= isl_basic_map_reset_space(bmap
, space
);
2638 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2639 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2642 struct isl_basic_map
*res
;
2643 struct isl_dim_map
*dim_map
;
2644 unsigned total
, off
;
2645 enum isl_dim_type t
;
2648 return basic_map_space_reset(bmap
, type
);
2653 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
2655 total
= isl_basic_map_total_dim(bmap
) + n
;
2656 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2658 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2660 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2662 unsigned size
= isl_basic_map_dim(bmap
, t
);
2663 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2665 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2666 pos
, size
- pos
, off
+ pos
+ n
);
2668 off
+= isl_space_dim(res_dim
, t
);
2670 isl_dim_map_div(dim_map
, bmap
, off
);
2672 res
= isl_basic_map_alloc_space(res_dim
,
2673 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2674 if (isl_basic_map_is_rational(bmap
))
2675 res
= isl_basic_map_set_rational(res
);
2676 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2677 return isl_basic_map_finalize(res
);
2680 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2681 enum isl_dim_type type
, unsigned n
)
2685 return isl_basic_map_insert(bmap
, type
,
2686 isl_basic_map_dim(bmap
, type
), n
);
2689 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2690 enum isl_dim_type type
, unsigned n
)
2694 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2695 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2697 isl_basic_set_free(bset
);
2701 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
2702 enum isl_dim_type type
)
2706 if (!isl_space_is_named_or_nested(map
->dim
, type
))
2709 space
= isl_map_get_space(map
);
2710 space
= isl_space_reset(space
, type
);
2711 map
= isl_map_reset_space(map
, space
);
2715 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
2716 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2721 return map_space_reset(map
, type
);
2723 map
= isl_map_cow(map
);
2727 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
2731 for (i
= 0; i
< map
->n
; ++i
) {
2732 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2743 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
2744 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2746 return isl_map_insert_dims(set
, type
, pos
, n
);
2749 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
2750 enum isl_dim_type type
, unsigned n
)
2754 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
2757 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
2758 enum isl_dim_type type
, unsigned n
)
2762 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2763 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
2769 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2770 __isl_take isl_basic_map
*bmap
,
2771 enum isl_dim_type dst_type
, unsigned dst_pos
,
2772 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2774 struct isl_dim_map
*dim_map
;
2775 struct isl_basic_map
*res
;
2776 enum isl_dim_type t
;
2777 unsigned total
, off
;
2784 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2787 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2790 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2792 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2793 pos(bmap
->dim
, src_type
) + src_pos
+
2794 ((src_type
< dst_type
) ? n
: 0)) {
2795 bmap
= isl_basic_map_cow(bmap
);
2799 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
2800 src_type
, src_pos
, n
);
2804 bmap
= isl_basic_map_finalize(bmap
);
2809 total
= isl_basic_map_total_dim(bmap
);
2810 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2813 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2814 unsigned size
= isl_space_dim(bmap
->dim
, t
);
2815 if (t
== dst_type
) {
2816 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2819 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2822 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2823 dst_pos
, size
- dst_pos
, off
);
2824 off
+= size
- dst_pos
;
2825 } else if (t
== src_type
) {
2826 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2829 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2830 src_pos
+ n
, size
- src_pos
- n
, off
);
2831 off
+= size
- src_pos
- n
;
2833 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2837 isl_dim_map_div(dim_map
, bmap
, off
);
2839 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
2840 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2841 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2843 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
2844 src_type
, src_pos
, n
);
2848 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2849 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2850 bmap
= isl_basic_map_finalize(bmap
);
2854 isl_basic_map_free(bmap
);
2858 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2859 enum isl_dim_type dst_type
, unsigned dst_pos
,
2860 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2862 return (isl_basic_set
*)isl_basic_map_move_dims(
2863 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2866 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2867 enum isl_dim_type dst_type
, unsigned dst_pos
,
2868 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2872 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2873 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2874 src_type
, src_pos
, n
);
2880 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2881 enum isl_dim_type dst_type
, unsigned dst_pos
,
2882 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2891 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2894 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2897 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2899 map
= isl_map_cow(map
);
2903 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2907 for (i
= 0; i
< map
->n
; ++i
) {
2908 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2910 src_type
, src_pos
, n
);
2921 /* Move the specified dimensions to the last columns right before
2922 * the divs. Don't change the dimension specification of bmap.
2923 * That's the responsibility of the caller.
2925 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2926 enum isl_dim_type type
, unsigned first
, unsigned n
)
2928 struct isl_dim_map
*dim_map
;
2929 struct isl_basic_map
*res
;
2930 enum isl_dim_type t
;
2931 unsigned total
, off
;
2935 if (pos(bmap
->dim
, type
) + first
+ n
==
2936 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
2939 total
= isl_basic_map_total_dim(bmap
);
2940 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2943 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2944 unsigned size
= isl_space_dim(bmap
->dim
, t
);
2946 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2949 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2950 first
, n
, total
- bmap
->n_div
- n
);
2951 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2952 first
+ n
, size
- (first
+ n
), off
);
2953 off
+= size
- (first
+ n
);
2955 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2959 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2961 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
2962 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2963 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2967 /* Turn the n dimensions of type type, starting at first
2968 * into existentially quantified variables.
2970 __isl_give isl_basic_map
*isl_basic_map_project_out(
2971 __isl_take isl_basic_map
*bmap
,
2972 enum isl_dim_type type
, unsigned first
, unsigned n
)
2985 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2986 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2988 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2991 bmap
= move_last(bmap
, type
, first
, n
);
2992 bmap
= isl_basic_map_cow(bmap
);
2996 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
2997 old
= bmap
->block2
.data
;
2998 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2999 (bmap
->extra
+ n
) * (1 + row_size
));
3000 if (!bmap
->block2
.data
)
3002 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3005 for (i
= 0; i
< n
; ++i
) {
3006 new_div
[i
] = bmap
->block2
.data
+
3007 (bmap
->extra
+ i
) * (1 + row_size
);
3008 isl_seq_clr(new_div
[i
], 1 + row_size
);
3010 for (i
= 0; i
< bmap
->extra
; ++i
)
3011 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3013 bmap
->div
= new_div
;
3017 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3020 bmap
= isl_basic_map_simplify(bmap
);
3021 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3022 return isl_basic_map_finalize(bmap
);
3024 isl_basic_map_free(bmap
);
3028 /* Turn the n dimensions of type type, starting at first
3029 * into existentially quantified variables.
3031 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3032 enum isl_dim_type type
, unsigned first
, unsigned n
)
3034 return (isl_basic_set
*)isl_basic_map_project_out(
3035 (isl_basic_map
*)bset
, type
, first
, n
);
3038 /* Turn the n dimensions of type type, starting at first
3039 * into existentially quantified variables.
3041 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3042 enum isl_dim_type type
, unsigned first
, unsigned n
)
3052 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3054 map
= isl_map_cow(map
);
3058 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3062 for (i
= 0; i
< map
->n
; ++i
) {
3063 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3074 /* Turn the n dimensions of type type, starting at first
3075 * into existentially quantified variables.
3077 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3078 enum isl_dim_type type
, unsigned first
, unsigned n
)
3080 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3083 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3087 for (i
= 0; i
< n
; ++i
) {
3088 j
= isl_basic_map_alloc_div(bmap
);
3091 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3095 isl_basic_map_free(bmap
);
3099 struct isl_basic_map
*isl_basic_map_apply_range(
3100 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3102 isl_space
*dim_result
= NULL
;
3103 struct isl_basic_map
*bmap
;
3104 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3105 struct isl_dim_map
*dim_map1
, *dim_map2
;
3107 if (!bmap1
|| !bmap2
)
3110 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3111 isl_space_copy(bmap2
->dim
));
3113 n_in
= isl_basic_map_n_in(bmap1
);
3114 n_out
= isl_basic_map_n_out(bmap2
);
3115 n
= isl_basic_map_n_out(bmap1
);
3116 nparam
= isl_basic_map_n_param(bmap1
);
3118 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3119 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3120 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3121 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3122 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3123 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3124 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3125 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3126 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3127 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3128 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3130 bmap
= isl_basic_map_alloc_space(dim_result
,
3131 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3132 bmap1
->n_eq
+ bmap2
->n_eq
,
3133 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3134 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3135 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3136 bmap
= add_divs(bmap
, n
);
3137 bmap
= isl_basic_map_simplify(bmap
);
3138 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3139 return isl_basic_map_finalize(bmap
);
3141 isl_basic_map_free(bmap1
);
3142 isl_basic_map_free(bmap2
);
3146 struct isl_basic_set
*isl_basic_set_apply(
3147 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3152 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3155 return (struct isl_basic_set
*)
3156 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3158 isl_basic_set_free(bset
);
3159 isl_basic_map_free(bmap
);
3163 struct isl_basic_map
*isl_basic_map_apply_domain(
3164 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3166 if (!bmap1
|| !bmap2
)
3169 isl_assert(bmap1
->ctx
,
3170 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3171 isl_assert(bmap1
->ctx
,
3172 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3175 bmap1
= isl_basic_map_reverse(bmap1
);
3176 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3177 return isl_basic_map_reverse(bmap1
);
3179 isl_basic_map_free(bmap1
);
3180 isl_basic_map_free(bmap2
);
3184 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3185 * A \cap B -> f(A) + f(B)
3187 struct isl_basic_map
*isl_basic_map_sum(
3188 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3190 unsigned n_in
, n_out
, nparam
, total
, pos
;
3191 struct isl_basic_map
*bmap
= NULL
;
3192 struct isl_dim_map
*dim_map1
, *dim_map2
;
3195 if (!bmap1
|| !bmap2
)
3198 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3201 nparam
= isl_basic_map_n_param(bmap1
);
3202 n_in
= isl_basic_map_n_in(bmap1
);
3203 n_out
= isl_basic_map_n_out(bmap1
);
3205 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3206 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3207 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3208 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3209 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3210 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3211 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3212 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3213 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3214 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3215 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3217 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3218 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3219 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3220 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3221 for (i
= 0; i
< n_out
; ++i
) {
3222 int j
= isl_basic_map_alloc_equality(bmap
);
3225 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3226 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3227 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3228 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3230 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3231 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3232 bmap
= add_divs(bmap
, 2 * n_out
);
3234 bmap
= isl_basic_map_simplify(bmap
);
3235 return isl_basic_map_finalize(bmap
);
3237 isl_basic_map_free(bmap
);
3238 isl_basic_map_free(bmap1
);
3239 isl_basic_map_free(bmap2
);
3243 /* Given two maps A -> f(A) and B -> g(B), construct a map
3244 * A \cap B -> f(A) + f(B)
3246 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3248 struct isl_map
*result
;
3254 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3256 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3257 map1
->n
* map2
->n
, 0);
3260 for (i
= 0; i
< map1
->n
; ++i
)
3261 for (j
= 0; j
< map2
->n
; ++j
) {
3262 struct isl_basic_map
*part
;
3263 part
= isl_basic_map_sum(
3264 isl_basic_map_copy(map1
->p
[i
]),
3265 isl_basic_map_copy(map2
->p
[j
]));
3266 if (isl_basic_map_is_empty(part
))
3267 isl_basic_map_free(part
);
3269 result
= isl_map_add_basic_map(result
, part
);
3282 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3283 __isl_take isl_set
*set2
)
3285 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3288 /* Given a basic map A -> f(A), construct A -> -f(A).
3290 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3295 bmap
= isl_basic_map_cow(bmap
);
3299 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3300 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3301 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3302 for (j
= 0; j
< n
; ++j
)
3303 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3304 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3305 for (j
= 0; j
< n
; ++j
)
3306 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3307 for (i
= 0; i
< bmap
->n_div
; ++i
)
3308 for (j
= 0; j
< n
; ++j
)
3309 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3310 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3311 return isl_basic_map_finalize(bmap
);
3314 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3316 return isl_basic_map_neg(bset
);
3319 /* Given a map A -> f(A), construct A -> -f(A).
3321 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3325 map
= isl_map_cow(map
);
3329 for (i
= 0; i
< map
->n
; ++i
) {
3330 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3341 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3343 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3346 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3347 * A -> floor(f(A)/d).
3349 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3352 unsigned n_in
, n_out
, nparam
, total
, pos
;
3353 struct isl_basic_map
*result
= NULL
;
3354 struct isl_dim_map
*dim_map
;
3360 nparam
= isl_basic_map_n_param(bmap
);
3361 n_in
= isl_basic_map_n_in(bmap
);
3362 n_out
= isl_basic_map_n_out(bmap
);
3364 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3365 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3366 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3367 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3368 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3369 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3371 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3372 bmap
->n_div
+ n_out
,
3373 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3374 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3375 result
= add_divs(result
, n_out
);
3376 for (i
= 0; i
< n_out
; ++i
) {
3378 j
= isl_basic_map_alloc_inequality(result
);
3381 isl_seq_clr(result
->ineq
[j
], 1+total
);
3382 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3383 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3384 j
= isl_basic_map_alloc_inequality(result
);
3387 isl_seq_clr(result
->ineq
[j
], 1+total
);
3388 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3389 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3390 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3393 result
= isl_basic_map_simplify(result
);
3394 return isl_basic_map_finalize(result
);
3396 isl_basic_map_free(result
);
3400 /* Given a map A -> f(A) and an integer d, construct a map
3401 * A -> floor(f(A)/d).
3403 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3407 map
= isl_map_cow(map
);
3411 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3412 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3413 for (i
= 0; i
< map
->n
; ++i
) {
3414 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3425 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3431 i
= isl_basic_map_alloc_equality(bmap
);
3434 nparam
= isl_basic_map_n_param(bmap
);
3435 n_in
= isl_basic_map_n_in(bmap
);
3436 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3437 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3438 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3439 return isl_basic_map_finalize(bmap
);
3441 isl_basic_map_free(bmap
);
3445 /* Add a constraints to "bmap" expressing i_pos < o_pos
3447 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3453 i
= isl_basic_map_alloc_inequality(bmap
);
3456 nparam
= isl_basic_map_n_param(bmap
);
3457 n_in
= isl_basic_map_n_in(bmap
);
3458 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3459 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3460 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3461 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3462 return isl_basic_map_finalize(bmap
);
3464 isl_basic_map_free(bmap
);
3468 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3470 static __isl_give isl_basic_map
*var_less_or_equal(
3471 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3477 i
= isl_basic_map_alloc_inequality(bmap
);
3480 nparam
= isl_basic_map_n_param(bmap
);
3481 n_in
= isl_basic_map_n_in(bmap
);
3482 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3483 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3484 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3485 return isl_basic_map_finalize(bmap
);
3487 isl_basic_map_free(bmap
);
3491 /* Add a constraints to "bmap" expressing i_pos > o_pos
3493 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3499 i
= isl_basic_map_alloc_inequality(bmap
);
3502 nparam
= isl_basic_map_n_param(bmap
);
3503 n_in
= isl_basic_map_n_in(bmap
);
3504 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3505 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3506 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3507 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3508 return isl_basic_map_finalize(bmap
);
3510 isl_basic_map_free(bmap
);
3514 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3516 static __isl_give isl_basic_map
*var_more_or_equal(
3517 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3523 i
= isl_basic_map_alloc_inequality(bmap
);
3526 nparam
= isl_basic_map_n_param(bmap
);
3527 n_in
= isl_basic_map_n_in(bmap
);
3528 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3529 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3530 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3531 return isl_basic_map_finalize(bmap
);
3533 isl_basic_map_free(bmap
);
3537 __isl_give isl_basic_map
*isl_basic_map_equal(
3538 __isl_take isl_space
*dim
, unsigned n_equal
)
3541 struct isl_basic_map
*bmap
;
3542 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3545 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3546 bmap
= var_equal(bmap
, i
);
3547 return isl_basic_map_finalize(bmap
);
3550 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3552 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3556 struct isl_basic_map
*bmap
;
3557 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3560 for (i
= 0; i
< pos
&& bmap
; ++i
)
3561 bmap
= var_equal(bmap
, i
);
3563 bmap
= var_less(bmap
, pos
);
3564 return isl_basic_map_finalize(bmap
);
3567 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3569 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3570 __isl_take isl_space
*dim
, unsigned pos
)
3573 isl_basic_map
*bmap
;
3575 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3576 for (i
= 0; i
< pos
; ++i
)
3577 bmap
= var_equal(bmap
, i
);
3578 bmap
= var_less_or_equal(bmap
, pos
);
3579 return isl_basic_map_finalize(bmap
);
3582 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3584 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3588 struct isl_basic_map
*bmap
;
3589 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3592 for (i
= 0; i
< pos
&& bmap
; ++i
)
3593 bmap
= var_equal(bmap
, i
);
3595 bmap
= var_more(bmap
, pos
);
3596 return isl_basic_map_finalize(bmap
);
3599 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3601 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3602 __isl_take isl_space
*dim
, unsigned pos
)
3605 isl_basic_map
*bmap
;
3607 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3608 for (i
= 0; i
< pos
; ++i
)
3609 bmap
= var_equal(bmap
, i
);
3610 bmap
= var_more_or_equal(bmap
, pos
);
3611 return isl_basic_map_finalize(bmap
);
3614 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3615 unsigned n
, int equal
)
3617 struct isl_map
*map
;
3620 if (n
== 0 && equal
)
3621 return isl_map_universe(dims
);
3623 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3625 for (i
= 0; i
+ 1 < n
; ++i
)
3626 map
= isl_map_add_basic_map(map
,
3627 isl_basic_map_less_at(isl_space_copy(dims
), i
));
3630 map
= isl_map_add_basic_map(map
,
3631 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3633 map
= isl_map_add_basic_map(map
,
3634 isl_basic_map_less_at(dims
, n
- 1));
3636 isl_space_free(dims
);
3641 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
3645 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3648 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
3650 return map_lex_lte_first(dim
, n
, 0);
3653 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
3655 return map_lex_lte_first(dim
, n
, 1);
3658 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
3660 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
3663 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
3665 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
3668 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
3669 unsigned n
, int equal
)
3671 struct isl_map
*map
;
3674 if (n
== 0 && equal
)
3675 return isl_map_universe(dims
);
3677 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3679 for (i
= 0; i
+ 1 < n
; ++i
)
3680 map
= isl_map_add_basic_map(map
,
3681 isl_basic_map_more_at(isl_space_copy(dims
), i
));
3684 map
= isl_map_add_basic_map(map
,
3685 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3687 map
= isl_map_add_basic_map(map
,
3688 isl_basic_map_more_at(dims
, n
- 1));
3690 isl_space_free(dims
);
3695 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
3699 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3702 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
3704 return map_lex_gte_first(dim
, n
, 0);
3707 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
3709 return map_lex_gte_first(dim
, n
, 1);
3712 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
3714 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
3717 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
3719 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
3722 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3723 __isl_take isl_set
*set2
)
3726 map
= isl_map_lex_le(isl_set_get_space(set1
));
3727 map
= isl_map_intersect_domain(map
, set1
);
3728 map
= isl_map_intersect_range(map
, set2
);
3732 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3733 __isl_take isl_set
*set2
)
3736 map
= isl_map_lex_lt(isl_set_get_space(set1
));
3737 map
= isl_map_intersect_domain(map
, set1
);
3738 map
= isl_map_intersect_range(map
, set2
);
3742 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3743 __isl_take isl_set
*set2
)
3746 map
= isl_map_lex_ge(isl_set_get_space(set1
));
3747 map
= isl_map_intersect_domain(map
, set1
);
3748 map
= isl_map_intersect_range(map
, set2
);
3752 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3753 __isl_take isl_set
*set2
)
3756 map
= isl_map_lex_gt(isl_set_get_space(set1
));
3757 map
= isl_map_intersect_domain(map
, set1
);
3758 map
= isl_map_intersect_range(map
, set2
);
3762 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3763 __isl_take isl_map
*map2
)
3766 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
3767 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3768 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3772 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3773 __isl_take isl_map
*map2
)
3776 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
3777 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3778 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3782 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3783 __isl_take isl_map
*map2
)
3786 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
3787 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3788 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3792 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3793 __isl_take isl_map
*map2
)
3796 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
3797 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3798 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3802 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
3803 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
3805 struct isl_basic_map
*bmap
;
3807 bset
= isl_basic_set_cow(bset
);
3811 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
3812 isl_space_free(bset
->dim
);
3813 bmap
= (struct isl_basic_map
*) bset
;
3815 return isl_basic_map_finalize(bmap
);
3817 isl_basic_set_free(bset
);
3818 isl_space_free(dim
);
3822 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3826 if (bmap
->dim
->n_in
== 0)
3827 return (struct isl_basic_set
*)bmap
;
3828 bmap
= isl_basic_map_cow(bmap
);
3831 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
3834 bmap
= isl_basic_map_finalize(bmap
);
3835 return (struct isl_basic_set
*)bmap
;
3837 isl_basic_map_free(bmap
);
3841 /* For a div d = floor(f/m), add the constraints
3844 * -(f-(n-1)) + m d >= 0
3846 * Note that the second constraint is the negation of
3850 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3851 unsigned pos
, isl_int
*div
)
3854 unsigned total
= isl_basic_map_total_dim(bmap
);
3856 i
= isl_basic_map_alloc_inequality(bmap
);
3859 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3860 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3862 j
= isl_basic_map_alloc_inequality(bmap
);
3865 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3866 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3867 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3871 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3872 unsigned pos
, isl_int
*div
)
3874 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3878 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3880 unsigned total
= isl_basic_map_total_dim(bmap
);
3881 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3883 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3887 struct isl_basic_set
*isl_basic_map_underlying_set(
3888 struct isl_basic_map
*bmap
)
3892 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3894 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
3895 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
3896 return (struct isl_basic_set
*)bmap
;
3897 bmap
= isl_basic_map_cow(bmap
);
3900 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
3903 bmap
->extra
-= bmap
->n_div
;
3905 bmap
= isl_basic_map_finalize(bmap
);
3906 return (struct isl_basic_set
*)bmap
;
3911 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3912 __isl_take isl_basic_set
*bset
)
3914 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3917 struct isl_basic_map
*isl_basic_map_overlying_set(
3918 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3920 struct isl_basic_map
*bmap
;
3921 struct isl_ctx
*ctx
;
3928 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3929 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3930 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3932 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3933 isl_basic_map_free(like
);
3934 return (struct isl_basic_map
*)bset
;
3936 bset
= isl_basic_set_cow(bset
);
3939 total
= bset
->dim
->n_out
+ bset
->extra
;
3940 bmap
= (struct isl_basic_map
*)bset
;
3941 isl_space_free(bmap
->dim
);
3942 bmap
->dim
= isl_space_copy(like
->dim
);
3945 bmap
->n_div
= like
->n_div
;
3946 bmap
->extra
+= like
->n_div
;
3950 ltotal
= total
- bmap
->extra
+ like
->extra
;
3953 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3954 bmap
->extra
* (1 + 1 + total
));
3955 if (isl_blk_is_error(bmap
->block2
))
3957 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
3961 for (i
= 0; i
< bmap
->extra
; ++i
)
3962 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3963 for (i
= 0; i
< like
->n_div
; ++i
) {
3964 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3965 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3967 bmap
= isl_basic_map_extend_constraints(bmap
,
3968 0, 2 * like
->n_div
);
3969 for (i
= 0; i
< like
->n_div
; ++i
) {
3970 if (isl_int_is_zero(bmap
->div
[i
][0]))
3972 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3976 isl_basic_map_free(like
);
3977 bmap
= isl_basic_map_simplify(bmap
);
3978 bmap
= isl_basic_map_finalize(bmap
);
3981 isl_basic_map_free(like
);
3982 isl_basic_set_free(bset
);
3986 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3987 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3989 return (struct isl_basic_set
*)
3990 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3993 struct isl_set
*isl_set_from_underlying_set(
3994 struct isl_set
*set
, struct isl_basic_set
*like
)
4000 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4002 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4003 isl_basic_set_free(like
);
4006 set
= isl_set_cow(set
);
4009 for (i
= 0; i
< set
->n
; ++i
) {
4010 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4011 isl_basic_set_copy(like
));
4015 isl_space_free(set
->dim
);
4016 set
->dim
= isl_space_copy(like
->dim
);
4019 isl_basic_set_free(like
);
4022 isl_basic_set_free(like
);
4027 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4031 map
= isl_map_cow(map
);
4034 map
->dim
= isl_space_cow(map
->dim
);
4038 for (i
= 1; i
< map
->n
; ++i
)
4039 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4041 for (i
= 0; i
< map
->n
; ++i
) {
4042 map
->p
[i
] = (struct isl_basic_map
*)
4043 isl_basic_map_underlying_set(map
->p
[i
]);
4048 map
->dim
= isl_space_underlying(map
->dim
, 0);
4050 isl_space_free(map
->dim
);
4051 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4055 return (struct isl_set
*)map
;
4061 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4063 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4066 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4067 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4069 bmap
= isl_basic_map_cow(bmap
);
4073 isl_space_free(bmap
->dim
);
4076 bmap
= isl_basic_map_finalize(bmap
);
4080 isl_basic_map_free(bmap
);
4081 isl_space_free(dim
);
4085 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4086 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4088 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4092 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4093 __isl_take isl_space
*dim
)
4097 map
= isl_map_cow(map
);
4101 for (i
= 0; i
< map
->n
; ++i
) {
4102 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4103 isl_space_copy(dim
));
4107 isl_space_free(map
->dim
);
4113 isl_space_free(dim
);
4117 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4118 __isl_take isl_space
*dim
)
4120 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4123 /* Compute the parameter domain of the given basic set.
4125 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4130 if (isl_basic_set_is_params(bset
))
4133 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4134 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4135 space
= isl_basic_set_get_space(bset
);
4136 space
= isl_space_params(space
);
4137 bset
= isl_basic_set_reset_space(bset
, space
);
4141 /* Compute the parameter domain of the given set.
4143 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4148 if (isl_set_is_params(set
))
4151 n
= isl_set_dim(set
, isl_dim_set
);
4152 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4153 space
= isl_set_get_space(set
);
4154 space
= isl_space_params(space
);
4155 set
= isl_set_reset_space(set
, space
);
4159 /* Construct a zero-dimensional set with the given parameter domain.
4161 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4164 space
= isl_set_get_space(set
);
4165 space
= isl_space_set_from_params(space
);
4166 set
= isl_set_reset_space(set
, space
);
4170 /* Compute the parameter domain of the given map.
4172 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4177 n
= isl_map_dim(map
, isl_dim_in
);
4178 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4179 n
= isl_map_dim(map
, isl_dim_out
);
4180 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4181 space
= isl_map_get_space(map
);
4182 space
= isl_space_params(space
);
4183 map
= isl_map_reset_space(map
, space
);
4187 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4190 struct isl_basic_set
*domain
;
4196 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4198 n_in
= isl_basic_map_n_in(bmap
);
4199 n_out
= isl_basic_map_n_out(bmap
);
4200 domain
= isl_basic_set_from_basic_map(bmap
);
4201 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4203 domain
= isl_basic_set_reset_space(domain
, dim
);
4208 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4212 return isl_space_may_be_set(bmap
->dim
);
4215 /* Is this basic map actually a set?
4216 * Users should never call this function. Outside of isl,
4217 * the type should indicate whether something is a set or a map.
4219 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4223 return isl_space_is_set(bmap
->dim
);
4226 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4230 if (isl_basic_map_is_set(bmap
))
4232 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4235 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4236 __isl_take isl_basic_map
*bmap
)
4240 isl_basic_map
*domain
;
4241 int nparam
, n_in
, n_out
;
4244 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4245 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4246 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4248 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4249 domain
= isl_basic_map_universe(dim
);
4251 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4252 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4253 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4255 total
= isl_basic_map_total_dim(bmap
);
4257 for (i
= 0; i
< n_in
; ++i
) {
4258 k
= isl_basic_map_alloc_equality(bmap
);
4261 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4262 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4263 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4266 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4267 return isl_basic_map_finalize(bmap
);
4269 isl_basic_map_free(bmap
);
4273 __isl_give isl_basic_map
*isl_basic_map_range_map(
4274 __isl_take isl_basic_map
*bmap
)
4278 isl_basic_map
*range
;
4279 int nparam
, n_in
, n_out
;
4282 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4283 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4284 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4286 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4287 range
= isl_basic_map_universe(dim
);
4289 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4290 bmap
= isl_basic_map_apply_range(bmap
, range
);
4291 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4293 total
= isl_basic_map_total_dim(bmap
);
4295 for (i
= 0; i
< n_out
; ++i
) {
4296 k
= isl_basic_map_alloc_equality(bmap
);
4299 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4300 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4301 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4304 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4305 return isl_basic_map_finalize(bmap
);
4307 isl_basic_map_free(bmap
);
4311 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4315 return isl_space_may_be_set(map
->dim
);
4318 /* Is this map actually a set?
4319 * Users should never call this function. Outside of isl,
4320 * the type should indicate whether something is a set or a map.
4322 int isl_map_is_set(__isl_keep isl_map
*map
)
4326 return isl_space_is_set(map
->dim
);
4329 struct isl_set
*isl_map_range(struct isl_map
*map
)
4332 struct isl_set
*set
;
4336 if (isl_map_is_set(map
))
4337 return (isl_set
*)map
;
4339 map
= isl_map_cow(map
);
4343 set
= (struct isl_set
*) map
;
4344 set
->dim
= isl_space_range(set
->dim
);
4347 for (i
= 0; i
< map
->n
; ++i
) {
4348 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4352 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4353 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4360 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4363 isl_space
*domain_dim
;
4365 map
= isl_map_cow(map
);
4369 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4370 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4371 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4374 for (i
= 0; i
< map
->n
; ++i
) {
4375 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4379 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4380 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4387 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4390 isl_space
*range_dim
;
4392 map
= isl_map_cow(map
);
4396 range_dim
= isl_space_range(isl_map_get_space(map
));
4397 range_dim
= isl_space_from_range(range_dim
);
4398 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4399 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4402 for (i
= 0; i
< map
->n
; ++i
) {
4403 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4407 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4408 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4415 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4416 __isl_take isl_space
*dim
)
4419 struct isl_map
*map
= NULL
;
4421 set
= isl_set_cow(set
);
4424 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4425 map
= (struct isl_map
*)set
;
4426 for (i
= 0; i
< set
->n
; ++i
) {
4427 map
->p
[i
] = isl_basic_map_from_basic_set(
4428 set
->p
[i
], isl_space_copy(dim
));
4432 isl_space_free(map
->dim
);
4436 isl_space_free(dim
);
4441 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4442 __isl_take isl_basic_set
*bset
)
4444 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4447 __isl_give isl_basic_map
*isl_basic_map_from_range(
4448 __isl_take isl_basic_set
*bset
)
4451 space
= isl_basic_set_get_space(bset
);
4452 space
= isl_space_from_range(space
);
4453 bset
= isl_basic_set_reset_space(bset
, space
);
4454 return (isl_basic_map
*)bset
;
4457 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4460 space
= isl_set_get_space(set
);
4461 space
= isl_space_from_range(space
);
4462 set
= isl_set_reset_space(set
, space
);
4463 return (struct isl_map
*)set
;
4466 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4468 return isl_map_reverse(isl_map_from_range(set
));
4471 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4472 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4474 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4477 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4478 __isl_take isl_set
*range
)
4480 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4483 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4486 struct isl_set
*set
= NULL
;
4490 map
= isl_map_cow(map
);
4493 map
->dim
= isl_space_as_set_space(map
->dim
);
4496 set
= (struct isl_set
*)map
;
4497 for (i
= 0; i
< map
->n
; ++i
) {
4498 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4508 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4511 struct isl_map
*map
;
4516 isl_die(dim
->ctx
, isl_error_internal
,
4517 "negative number of basic maps", goto error
);
4518 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4519 sizeof(struct isl_map
) +
4520 (n
- 1) * sizeof(struct isl_basic_map
*));
4524 map
->ctx
= dim
->ctx
;
4525 isl_ctx_ref(map
->ctx
);
4533 isl_space_free(dim
);
4537 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4538 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4541 struct isl_map
*map
;
4544 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4548 map
= isl_map_alloc_space(dims
, n
, flags
);
4552 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4554 struct isl_basic_map
*bmap
;
4555 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4556 bmap
= isl_basic_map_set_to_empty(bmap
);
4560 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4562 struct isl_basic_set
*bset
;
4563 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4564 bset
= isl_basic_set_set_to_empty(bset
);
4568 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4570 struct isl_basic_map
*bmap
;
4573 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4574 bmap
= isl_basic_map_set_to_empty(bmap
);
4578 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4580 struct isl_basic_map
*bmap
;
4583 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4584 bmap
= isl_basic_map_set_to_empty(bmap
);
4588 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4590 struct isl_basic_set
*bset
;
4593 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4594 bset
= isl_basic_set_set_to_empty(bset
);
4598 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4600 struct isl_basic_map
*bmap
;
4601 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4602 bmap
= isl_basic_map_finalize(bmap
);
4606 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
4608 struct isl_basic_set
*bset
;
4609 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
4610 bset
= isl_basic_set_finalize(bset
);
4614 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
4617 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
4618 isl_basic_map
*bmap
;
4620 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
4621 for (i
= 0; i
< total
; ++i
) {
4622 int k
= isl_basic_map_alloc_inequality(bmap
);
4625 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4626 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4630 isl_basic_map_free(bmap
);
4634 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
4636 return isl_basic_map_nat_universe(dim
);
4639 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
4641 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4644 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
4646 return isl_map_nat_universe(dim
);
4649 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4650 __isl_keep isl_basic_map
*model
)
4654 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4657 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4661 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4664 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4665 __isl_keep isl_set
*model
)
4669 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4672 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
4674 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4677 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4681 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4684 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4688 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4691 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
4693 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4696 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4700 return isl_set_empty(isl_space_copy(model
->dim
));
4703 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
4705 struct isl_map
*map
;
4708 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
4709 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
4713 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
4715 struct isl_set
*set
;
4718 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
4719 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
4723 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
4727 return isl_set_universe(isl_space_copy(model
->dim
));
4730 struct isl_map
*isl_map_dup(struct isl_map
*map
)
4733 struct isl_map
*dup
;
4737 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
4738 for (i
= 0; i
< map
->n
; ++i
)
4739 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
4743 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
4744 __isl_take isl_basic_map
*bmap
)
4748 if (isl_basic_map_plain_is_empty(bmap
)) {
4749 isl_basic_map_free(bmap
);
4752 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
4753 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
4754 map
->p
[map
->n
] = bmap
;
4756 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4762 isl_basic_map_free(bmap
);
4766 void isl_map_free(struct isl_map
*map
)
4776 isl_ctx_deref(map
->ctx
);
4777 for (i
= 0; i
< map
->n
; ++i
)
4778 isl_basic_map_free(map
->p
[i
]);
4779 isl_space_free(map
->dim
);
4783 struct isl_map
*isl_map_extend(struct isl_map
*base
,
4784 unsigned nparam
, unsigned n_in
, unsigned n_out
)
4788 base
= isl_map_cow(base
);
4792 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
4795 for (i
= 0; i
< base
->n
; ++i
) {
4796 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
4797 isl_space_copy(base
->dim
), 0, 0, 0);
4807 struct isl_set
*isl_set_extend(struct isl_set
*base
,
4808 unsigned nparam
, unsigned dim
)
4810 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
4814 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4815 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4819 bmap
= isl_basic_map_cow(bmap
);
4820 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4821 j
= isl_basic_map_alloc_equality(bmap
);
4824 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4825 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4826 isl_int_set_si(bmap
->eq
[j
][0], value
);
4827 bmap
= isl_basic_map_simplify(bmap
);
4828 return isl_basic_map_finalize(bmap
);
4830 isl_basic_map_free(bmap
);
4834 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4835 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4839 bmap
= isl_basic_map_cow(bmap
);
4840 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4841 j
= isl_basic_map_alloc_equality(bmap
);
4844 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4845 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4846 isl_int_set(bmap
->eq
[j
][0], value
);
4847 bmap
= isl_basic_map_simplify(bmap
);
4848 return isl_basic_map_finalize(bmap
);
4850 isl_basic_map_free(bmap
);
4854 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4855 enum isl_dim_type type
, unsigned pos
, int value
)
4859 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4860 return isl_basic_map_fix_pos_si(bmap
,
4861 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4863 isl_basic_map_free(bmap
);
4867 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4868 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4872 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4873 return isl_basic_map_fix_pos(bmap
,
4874 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4876 isl_basic_map_free(bmap
);
4880 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4881 enum isl_dim_type type
, unsigned pos
, int value
)
4883 return (struct isl_basic_set
*)
4884 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4888 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4889 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4891 return (struct isl_basic_set
*)
4892 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4896 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4897 unsigned input
, int value
)
4899 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4902 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4903 unsigned dim
, int value
)
4905 return (struct isl_basic_set
*)
4906 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4907 isl_dim_set
, dim
, value
);
4910 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4911 enum isl_dim_type type
, unsigned pos
, int value
)
4915 map
= isl_map_cow(map
);
4919 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4920 for (i
= 0; i
< map
->n
; ++i
) {
4921 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4925 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4932 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4933 enum isl_dim_type type
, unsigned pos
, int value
)
4935 return (struct isl_set
*)
4936 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4939 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4940 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4944 map
= isl_map_cow(map
);
4948 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4949 for (i
= 0; i
< map
->n
; ++i
) {
4950 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4954 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4961 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4962 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4964 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4967 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4968 unsigned input
, int value
)
4970 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4973 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4975 return (struct isl_set
*)
4976 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4979 static __isl_give isl_basic_map
*basic_map_bound_si(
4980 __isl_take isl_basic_map
*bmap
,
4981 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
4987 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4988 pos
+= isl_basic_map_offset(bmap
, type
);
4989 bmap
= isl_basic_map_cow(bmap
);
4990 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4991 j
= isl_basic_map_alloc_inequality(bmap
);
4994 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4996 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
4997 isl_int_set_si(bmap
->ineq
[j
][0], value
);
4999 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5000 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5002 bmap
= isl_basic_map_simplify(bmap
);
5003 return isl_basic_map_finalize(bmap
);
5005 isl_basic_map_free(bmap
);
5009 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5010 __isl_take isl_basic_map
*bmap
,
5011 enum isl_dim_type type
, unsigned pos
, int value
)
5013 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5016 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5017 unsigned dim
, isl_int value
)
5021 bset
= isl_basic_set_cow(bset
);
5022 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5023 j
= isl_basic_set_alloc_inequality(bset
);
5026 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5027 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5028 isl_int_neg(bset
->ineq
[j
][0], value
);
5029 bset
= isl_basic_set_simplify(bset
);
5030 return isl_basic_set_finalize(bset
);
5032 isl_basic_set_free(bset
);
5036 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5037 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5041 map
= isl_map_cow(map
);
5045 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5046 for (i
= 0; i
< map
->n
; ++i
) {
5047 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5048 type
, pos
, value
, upper
);
5052 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5059 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5060 enum isl_dim_type type
, unsigned pos
, int value
)
5062 return map_bound_si(map
, type
, pos
, value
, 0);
5065 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5066 enum isl_dim_type type
, unsigned pos
, int value
)
5068 return map_bound_si(map
, type
, pos
, value
, 1);
5071 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5072 enum isl_dim_type type
, unsigned pos
, int value
)
5074 return (struct isl_set
*)
5075 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5078 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5079 enum isl_dim_type type
, unsigned pos
, int value
)
5081 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5084 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5089 set
= isl_set_cow(set
);
5093 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5094 for (i
= 0; i
< set
->n
; ++i
) {
5095 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5105 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5109 map
= isl_map_cow(map
);
5113 map
->dim
= isl_space_reverse(map
->dim
);
5116 for (i
= 0; i
< map
->n
; ++i
) {
5117 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5121 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5128 static struct isl_map
*isl_basic_map_partial_lexopt(
5129 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5130 struct isl_set
**empty
, int max
)
5134 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5135 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5137 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5139 isl_basic_map_free(bmap
);
5140 isl_basic_set_free(dom
);
5146 struct isl_map
*isl_basic_map_partial_lexmax(
5147 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5148 struct isl_set
**empty
)
5150 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5153 struct isl_map
*isl_basic_map_partial_lexmin(
5154 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5155 struct isl_set
**empty
)
5157 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5160 struct isl_set
*isl_basic_set_partial_lexmin(
5161 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5162 struct isl_set
**empty
)
5164 return (struct isl_set
*)
5165 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5169 struct isl_set
*isl_basic_set_partial_lexmax(
5170 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5171 struct isl_set
**empty
)
5173 return (struct isl_set
*)
5174 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5178 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5179 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5180 __isl_give isl_set
**empty
)
5182 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5185 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5186 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5187 __isl_give isl_set
**empty
)
5189 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5192 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5193 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5194 __isl_give isl_set
**empty
)
5196 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5199 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5200 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5201 __isl_give isl_set
**empty
)
5203 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5206 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5207 __isl_take isl_basic_map
*bmap
, int max
)
5209 isl_basic_set
*dom
= NULL
;
5210 isl_space
*dom_space
;
5214 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5215 dom
= isl_basic_set_universe(dom_space
);
5216 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5218 isl_basic_map_free(bmap
);
5222 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5223 __isl_take isl_basic_map
*bmap
)
5225 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5228 /* Given a basic map "bmap", compute the lexicographically minimal
5229 * (or maximal) image element for each domain element in dom.
5230 * Set *empty to those elements in dom that do not have an image element.
5232 * We first make sure the basic sets in dom are disjoint and then
5233 * simply collect the results over each of the basic sets separately.
5234 * We could probably improve the efficiency a bit by moving the union
5235 * domain down into the parametric integer programming.
5237 static __isl_give isl_map
*basic_map_partial_lexopt(
5238 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
5239 __isl_give isl_set
**empty
, int max
)
5242 struct isl_map
*res
;
5244 dom
= isl_set_make_disjoint(dom
);
5248 if (isl_set_plain_is_empty(dom
)) {
5249 res
= isl_map_empty_like_basic_map(bmap
);
5250 *empty
= isl_set_empty_like(dom
);
5252 isl_basic_map_free(bmap
);
5256 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
5257 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
5259 for (i
= 1; i
< dom
->n
; ++i
) {
5260 struct isl_map
*res_i
;
5261 struct isl_set
*empty_i
;
5263 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
5264 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
5266 res
= isl_map_union_disjoint(res
, res_i
);
5267 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
5271 isl_basic_map_free(bmap
);
5276 isl_basic_map_free(bmap
);
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 * We first compute the lexicographically minimal or maximal element
5285 * in the first basic map. This results in a partial solution "res"
5286 * and a subset "todo" of dom that still need to be handled.
5287 * We then consider each of the remaining maps in "map" and successively
5288 * improve both "res" and "todo".
5290 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5291 * Assume we are computing the lexicographical maximum.
5292 * We first compute the lexicographically maximal element in basic map i.
5293 * This results in a partial solution res_i and a subset todo_i.
5294 * Then we combine these results with those obtain for the first k basic maps
5295 * to obtain a result that is valid for the first k+1 basic maps.
5296 * In particular, the set where there is no solution is the set where
5297 * there is no solution for the first k basic maps and also no solution
5298 * for the ith basic map, i.e.,
5300 * todo^i = todo^k * todo_i
5302 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5303 * solutions, arbitrarily breaking ties in favor of res^k.
5304 * That is, when res^k(a) >= res_i(a), we pick res^k and
5305 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5306 * the lexicographic order.)
5307 * In practice, we compute
5309 * res^k * (res_i . "<=")
5313 * res_i * (res^k . "<")
5315 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5316 * where only one of res^k and res_i provides a solution and we simply pick
5323 * Note that we only compute these intersections when dom(res^k) intersects
5324 * dom(res_i). Otherwise, the only effect of these intersections is to
5325 * potentially break up res^k and res_i into smaller pieces.
5326 * We want to avoid such splintering as much as possible.
5327 * In fact, an earlier implementation of this function would look for
5328 * better results in the domain of res^k and for extra results in todo^k,
5329 * but this would always result in a splintering according to todo^k,
5330 * even when the domain of basic map i is disjoint from the domains of
5331 * the previous basic maps.
5333 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5334 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5335 __isl_give isl_set
**empty
, int max
)
5338 struct isl_map
*res
;
5339 struct isl_set
*todo
;
5344 if (isl_map_plain_is_empty(map
)) {
5352 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5353 isl_set_copy(dom
), &todo
, max
);
5355 for (i
= 1; i
< map
->n
; ++i
) {
5359 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5361 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5362 isl_set_copy(dom
), &todo_i
, max
);
5365 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5366 le
= isl_map_lex_le(dim
);
5368 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5369 le
= isl_map_lex_ge(dim
);
5371 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5372 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5373 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5374 le
= isl_map_intersect(le
, isl_map_copy(res
));
5376 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5377 res
= isl_map_intersect_domain(res
,
5378 isl_set_copy(todo_i
));
5379 res_i
= isl_map_intersect_domain(res_i
,
5380 isl_set_copy(todo
));
5383 res
= isl_map_union_disjoint(res
, res_i
);
5384 res
= isl_map_union_disjoint(res
, lt
);
5385 res
= isl_map_union_disjoint(res
, le
);
5387 todo
= isl_set_intersect(todo
, todo_i
);
5407 /* Given a map "map", compute the lexicographically minimal
5408 * (or maximal) image element for each domain element in dom.
5409 * Set *empty to those elements in dom that do not have an image element.
5411 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5413 static __isl_give isl_map
*isl_map_partial_lexopt(
5414 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5415 __isl_give isl_set
**empty
, int max
)
5419 if (isl_space_match(map
->dim
, isl_dim_param
, dom
->dim
, isl_dim_param
))
5420 return isl_map_partial_lexopt_aligned(map
, dom
, empty
, max
);
5421 if (!isl_space_has_named_params(map
->dim
) ||
5422 !isl_space_has_named_params(dom
->dim
))
5423 isl_die(map
->ctx
, isl_error_invalid
,
5424 "unaligned unnamed parameters", goto error
);
5425 map
= isl_map_align_params(map
, isl_map_get_space(dom
));
5426 dom
= isl_map_align_params(dom
, isl_map_get_space(map
));
5427 return isl_map_partial_lexopt_aligned(map
, dom
, empty
, max
);
5436 __isl_give isl_map
*isl_map_partial_lexmax(
5437 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5438 __isl_give isl_set
**empty
)
5440 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5443 __isl_give isl_map
*isl_map_partial_lexmin(
5444 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5445 __isl_give isl_set
**empty
)
5447 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5450 __isl_give isl_set
*isl_set_partial_lexmin(
5451 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5452 __isl_give isl_set
**empty
)
5454 return (struct isl_set
*)
5455 isl_map_partial_lexmin((struct isl_map
*)set
,
5459 __isl_give isl_set
*isl_set_partial_lexmax(
5460 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5461 __isl_give isl_set
**empty
)
5463 return (struct isl_set
*)
5464 isl_map_partial_lexmax((struct isl_map
*)set
,
5468 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5470 struct isl_basic_set
*dom
= NULL
;
5475 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5476 dom
= isl_basic_set_universe(dom_dim
);
5477 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5479 isl_basic_map_free(bmap
);
5483 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5485 return isl_basic_map_lexopt(bmap
, 0);
5488 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5490 return isl_basic_map_lexopt(bmap
, 1);
5493 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5495 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
5498 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
5500 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
5503 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
5505 struct isl_set
*dom
= NULL
;
5510 dom_dim
= isl_space_domain(isl_space_copy(map
->dim
));
5511 dom
= isl_set_universe(dom_dim
);
5512 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
5518 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
5520 return isl_map_lexopt(map
, 0);
5523 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
5525 return isl_map_lexopt(map
, 1);
5528 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5530 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5533 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5535 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5538 /* Extract the first and only affine expression from list
5539 * and then add it to *pwaff with the given dom.
5540 * This domain is known to be disjoint from other domains
5541 * because of the way isl_basic_map_foreach_lexmax works.
5543 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
5544 __isl_take isl_aff_list
*list
, void *user
)
5546 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
5548 isl_pw_aff
**pwaff
= user
;
5549 isl_pw_aff
*pwaff_i
;
5551 if (isl_aff_list_n_aff(list
) != 1)
5552 isl_die(ctx
, isl_error_internal
,
5553 "expecting single element list", goto error
);
5555 aff
= isl_aff_list_get_aff(list
, 0);
5556 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
5558 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
5560 isl_aff_list_free(list
);
5564 isl_basic_set_free(dom
);
5565 isl_aff_list_free(list
);
5569 /* Given a basic map with one output dimension, compute the minimum or
5570 * maximum of that dimension as an isl_pw_aff.
5572 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5573 * call update_dim_opt on each leaf of the result.
5575 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
5578 isl_space
*dim
= isl_basic_map_get_space(bmap
);
5582 dim
= isl_space_from_domain(isl_space_domain(dim
));
5583 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
5584 pwaff
= isl_pw_aff_empty(dim
);
5586 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
5588 return isl_pw_aff_free(pwaff
);
5593 /* Compute the minimum or maximum of the given output dimension
5594 * as a function of the parameters and the input dimensions,
5595 * but independently of the other output dimensions.
5597 * We first project out the other output dimension and then compute
5598 * the "lexicographic" maximum in each basic map, combining the results
5599 * using isl_pw_aff_union_max.
5601 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
5608 n_out
= isl_map_dim(map
, isl_dim_out
);
5609 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
5610 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
5615 isl_space
*dim
= isl_map_get_space(map
);
5616 dim
= isl_space_domain(isl_space_from_range(dim
));
5618 return isl_pw_aff_empty(dim
);
5621 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
5622 for (i
= 1; i
< map
->n
; ++i
) {
5623 isl_pw_aff
*pwaff_i
;
5625 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
5626 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
5634 /* Compute the maximum of the given output dimension as a function of the
5635 * parameters and input dimensions, but independently of
5636 * the other output dimensions.
5638 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
5640 return map_dim_opt(map
, pos
, 1);
5643 /* Compute the minimum or maximum of the given set dimension
5644 * as a function of the parameters,
5645 * but independently of the other set dimensions.
5647 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
5650 return map_dim_opt(set
, pos
, max
);
5653 /* Compute the maximum of the given set dimension as a function of the
5654 * parameters, but independently of the other set dimensions.
5656 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
5658 return set_dim_opt(set
, pos
, 1);
5661 /* Compute the minimum of the given set dimension as a function of the
5662 * parameters, but independently of the other set dimensions.
5664 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
5666 return set_dim_opt(set
, pos
, 0);
5669 /* Apply a preimage specified by "mat" on the parameters of "bset".
5670 * bset is assumed to have only parameters and divs.
5672 static struct isl_basic_set
*basic_set_parameter_preimage(
5673 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
5680 bset
->dim
= isl_space_cow(bset
->dim
);
5684 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5686 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5688 bset
->dim
->nparam
= 0;
5689 bset
->dim
->n_out
= nparam
;
5690 bset
= isl_basic_set_preimage(bset
, mat
);
5692 bset
->dim
->nparam
= bset
->dim
->n_out
;
5693 bset
->dim
->n_out
= 0;
5698 isl_basic_set_free(bset
);
5702 /* Apply a preimage specified by "mat" on the parameters of "set".
5703 * set is assumed to have only parameters and divs.
5705 static struct isl_set
*set_parameter_preimage(
5706 struct isl_set
*set
, struct isl_mat
*mat
)
5708 isl_space
*dim
= NULL
;
5714 dim
= isl_space_copy(set
->dim
);
5715 dim
= isl_space_cow(dim
);
5719 nparam
= isl_set_dim(set
, isl_dim_param
);
5721 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
5724 dim
->n_out
= nparam
;
5725 isl_set_reset_space(set
, dim
);
5726 set
= isl_set_preimage(set
, mat
);
5729 dim
= isl_space_copy(set
->dim
);
5730 dim
= isl_space_cow(dim
);
5733 dim
->nparam
= dim
->n_out
;
5735 isl_set_reset_space(set
, dim
);
5738 isl_space_free(dim
);
5745 /* Intersect the basic set "bset" with the affine space specified by the
5746 * equalities in "eq".
5748 static struct isl_basic_set
*basic_set_append_equalities(
5749 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
5757 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
5762 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
5763 for (i
= 0; i
< eq
->n_row
; ++i
) {
5764 k
= isl_basic_set_alloc_equality(bset
);
5767 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
5768 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
5772 bset
= isl_basic_set_gauss(bset
, NULL
);
5773 bset
= isl_basic_set_finalize(bset
);
5778 isl_basic_set_free(bset
);
5782 /* Intersect the set "set" with the affine space specified by the
5783 * equalities in "eq".
5785 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
5793 for (i
= 0; i
< set
->n
; ++i
) {
5794 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
5807 /* Project the given basic set onto its parameter domain, possibly introducing
5808 * new, explicit, existential variables in the constraints.
5809 * The input has parameters and (possibly implicit) existential variables.
5810 * The output has the same parameters, but only
5811 * explicit existentially quantified variables.
5813 * The actual projection is performed by pip, but pip doesn't seem
5814 * to like equalities very much, so we first remove the equalities
5815 * among the parameters by performing a variable compression on
5816 * the parameters. Afterward, an inverse transformation is performed
5817 * and the equalities among the parameters are inserted back in.
5819 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
5823 struct isl_mat
*T
, *T2
;
5824 struct isl_set
*set
;
5825 unsigned nparam
, n_div
;
5827 bset
= isl_basic_set_cow(bset
);
5831 if (bset
->n_eq
== 0)
5832 return isl_basic_set_lexmin(bset
);
5834 isl_basic_set_gauss(bset
, NULL
);
5836 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
5837 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
5839 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
5840 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
5843 if (i
== bset
->n_eq
)
5844 return isl_basic_set_lexmin(bset
);
5846 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
5848 eq
= isl_mat_cow(eq
);
5849 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
5850 if (T
&& T
->n_col
== 0) {
5854 bset
= isl_basic_set_set_to_empty(bset
);
5855 return isl_set_from_basic_set(bset
);
5857 bset
= basic_set_parameter_preimage(bset
, T
);
5859 set
= isl_basic_set_lexmin(bset
);
5860 set
= set_parameter_preimage(set
, T2
);
5861 set
= set_append_equalities(set
, eq
);
5865 /* Compute an explicit representation for all the existentially
5866 * quantified variables.
5867 * The input and output dimensions are first turned into parameters.
5868 * compute_divs then returns a map with the same parameters and
5869 * no input or output dimensions and the dimension specification
5870 * is reset to that of the input.
5872 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
5874 struct isl_basic_set
*bset
;
5875 struct isl_set
*set
;
5876 struct isl_map
*map
;
5877 isl_space
*dim
, *orig_dim
= NULL
;
5882 bmap
= isl_basic_map_cow(bmap
);
5886 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5887 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5888 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5889 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
5893 orig_dim
= bmap
->dim
;
5895 bset
= (struct isl_basic_set
*)bmap
;
5897 set
= parameter_compute_divs(bset
);
5898 map
= (struct isl_map
*)set
;
5899 map
= isl_map_reset_space(map
, orig_dim
);
5903 isl_basic_map_free(bmap
);
5907 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
5915 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
5916 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5917 if (isl_int_is_zero(bmap
->div
[i
][0]))
5919 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
5925 static int map_divs_known(__isl_keep isl_map
*map
)
5932 for (i
= 0; i
< map
->n
; ++i
) {
5933 int known
= isl_basic_map_divs_known(map
->p
[i
]);
5941 /* If bmap contains any unknown divs, then compute explicit
5942 * expressions for them. However, this computation may be
5943 * quite expensive, so first try to remove divs that aren't
5946 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
5949 struct isl_map
*map
;
5951 known
= isl_basic_map_divs_known(bmap
);
5955 return isl_map_from_basic_map(bmap
);
5957 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
5959 known
= isl_basic_map_divs_known(bmap
);
5963 return isl_map_from_basic_map(bmap
);
5965 map
= compute_divs(bmap
);
5968 isl_basic_map_free(bmap
);
5972 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
5976 struct isl_map
*res
;
5983 known
= map_divs_known(map
);
5991 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
5992 for (i
= 1 ; i
< map
->n
; ++i
) {
5994 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
5995 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
5996 res
= isl_map_union_disjoint(res
, r2
);
5998 res
= isl_map_union(res
, r2
);
6005 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6007 return (struct isl_set
*)
6008 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6011 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6013 return (struct isl_set
*)
6014 isl_map_compute_divs((struct isl_map
*)set
);
6017 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6020 struct isl_set
*set
;
6025 map
= isl_map_cow(map
);
6029 set
= (struct isl_set
*)map
;
6030 set
->dim
= isl_space_domain(set
->dim
);
6033 for (i
= 0; i
< map
->n
; ++i
) {
6034 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6038 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6039 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6046 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6047 __isl_take isl_map
*map2
)
6051 struct isl_map
*map
= NULL
;
6065 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6067 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6068 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6069 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6071 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6072 map1
->n
+ map2
->n
, flags
);
6075 for (i
= 0; i
< map1
->n
; ++i
) {
6076 map
= isl_map_add_basic_map(map
,
6077 isl_basic_map_copy(map1
->p
[i
]));
6081 for (i
= 0; i
< map2
->n
; ++i
) {
6082 map
= isl_map_add_basic_map(map
,
6083 isl_basic_map_copy(map2
->p
[i
]));
6097 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6098 __isl_take isl_map
*map2
)
6100 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6103 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6105 map1
= isl_map_union_disjoint(map1
, map2
);
6109 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6113 struct isl_set
*isl_set_union_disjoint(
6114 struct isl_set
*set1
, struct isl_set
*set2
)
6116 return (struct isl_set
*)
6117 isl_map_union_disjoint(
6118 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6121 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6123 return (struct isl_set
*)
6124 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6127 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6128 __isl_take isl_set
*set
)
6131 struct isl_map
*result
;
6137 if (!isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
6138 isl_die(set
->ctx
, isl_error_invalid
,
6139 "parameters don't match", goto error
);
6141 if (isl_space_dim(set
->dim
, isl_dim_set
) != 0 &&
6142 !isl_map_compatible_range(map
, set
))
6143 isl_die(set
->ctx
, isl_error_invalid
,
6144 "incompatible spaces", goto error
);
6146 if (isl_set_plain_is_universe(set
)) {
6151 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6152 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6153 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6155 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6156 map
->n
* set
->n
, flags
);
6159 for (i
= 0; i
< map
->n
; ++i
)
6160 for (j
= 0; j
< set
->n
; ++j
) {
6161 result
= isl_map_add_basic_map(result
,
6162 isl_basic_map_intersect_range(
6163 isl_basic_map_copy(map
->p
[i
]),
6164 isl_basic_set_copy(set
->p
[j
])));
6177 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6178 __isl_take isl_set
*set
)
6180 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6183 struct isl_map
*isl_map_intersect_domain(
6184 struct isl_map
*map
, struct isl_set
*set
)
6186 return isl_map_reverse(
6187 isl_map_intersect_range(isl_map_reverse(map
), set
));
6190 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6191 __isl_take isl_map
*map2
)
6195 map1
= isl_map_reverse(map1
);
6196 map1
= isl_map_apply_range(map1
, map2
);
6197 return isl_map_reverse(map1
);
6204 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6205 __isl_take isl_map
*map2
)
6207 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6210 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6211 __isl_take isl_map
*map2
)
6213 isl_space
*dim_result
;
6214 struct isl_map
*result
;
6220 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6221 isl_space_copy(map2
->dim
));
6223 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6226 for (i
= 0; i
< map1
->n
; ++i
)
6227 for (j
= 0; j
< map2
->n
; ++j
) {
6228 result
= isl_map_add_basic_map(result
,
6229 isl_basic_map_apply_range(
6230 isl_basic_map_copy(map1
->p
[i
]),
6231 isl_basic_map_copy(map2
->p
[j
])));
6237 if (result
&& result
->n
<= 1)
6238 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6246 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6247 __isl_take isl_map
*map2
)
6249 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6253 * returns range - domain
6255 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6257 isl_space
*dims
, *target_dim
;
6258 struct isl_basic_set
*bset
;
6265 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6266 bmap
->dim
, isl_dim_out
),
6268 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6269 dim
= isl_basic_map_n_in(bmap
);
6270 nparam
= isl_basic_map_n_param(bmap
);
6271 bset
= isl_basic_set_from_basic_map(bmap
);
6272 bset
= isl_basic_set_cow(bset
);
6273 dims
= isl_basic_set_get_space(bset
);
6274 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6275 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6276 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6277 for (i
= 0; i
< dim
; ++i
) {
6278 int j
= isl_basic_map_alloc_equality(
6279 (struct isl_basic_map
*)bset
);
6282 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6283 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6284 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6285 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6287 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6288 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6291 isl_basic_map_free(bmap
);
6296 * returns range - domain
6298 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
6302 struct isl_set
*result
;
6307 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6308 map
->dim
, isl_dim_out
),
6310 dim
= isl_map_get_space(map
);
6311 dim
= isl_space_domain(dim
);
6312 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6315 for (i
= 0; i
< map
->n
; ++i
)
6316 result
= isl_set_add_basic_set(result
,
6317 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6326 * returns [domain -> range] -> range - domain
6328 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6329 __isl_take isl_basic_map
*bmap
)
6333 isl_basic_map
*domain
;
6337 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6338 isl_die(bmap
->ctx
, isl_error_invalid
,
6339 "domain and range don't match", goto error
);
6341 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6342 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6344 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6345 domain
= isl_basic_map_universe(dim
);
6347 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6348 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6349 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6351 total
= isl_basic_map_total_dim(bmap
);
6353 for (i
= 0; i
< n
; ++i
) {
6354 k
= isl_basic_map_alloc_equality(bmap
);
6357 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6358 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6359 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6360 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6363 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6364 return isl_basic_map_finalize(bmap
);
6366 isl_basic_map_free(bmap
);
6371 * returns [domain -> range] -> range - domain
6373 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6376 isl_space
*domain_dim
;
6381 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6382 isl_die(map
->ctx
, isl_error_invalid
,
6383 "domain and range don't match", goto error
);
6385 map
= isl_map_cow(map
);
6389 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6390 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6391 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6394 for (i
= 0; i
< map
->n
; ++i
) {
6395 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6399 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6406 __isl_give
struct isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6408 struct isl_basic_map
*bmap
;
6416 nparam
= dims
->nparam
;
6418 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6422 for (i
= 0; i
< dim
; ++i
) {
6423 int j
= isl_basic_map_alloc_equality(bmap
);
6426 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6427 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6428 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6430 return isl_basic_map_finalize(bmap
);
6432 isl_basic_map_free(bmap
);
6436 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6440 if (dim
->n_in
!= dim
->n_out
)
6441 isl_die(dim
->ctx
, isl_error_invalid
,
6442 "number of input and output dimensions needs to be "
6443 "the same", goto error
);
6444 return basic_map_identity(dim
);
6446 isl_space_free(dim
);
6450 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6452 if (!model
|| !model
->dim
)
6454 return isl_basic_map_identity(isl_space_copy(model
->dim
));
6457 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
6459 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
6462 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
6464 if (!model
|| !model
->dim
)
6466 return isl_map_identity(isl_space_copy(model
->dim
));
6469 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
6471 if (!model
|| !model
->dim
)
6473 return isl_map_identity(isl_space_copy(model
->dim
));
6476 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
6478 isl_space
*dim
= isl_set_get_space(set
);
6480 id
= isl_map_identity(isl_space_map_from_set(dim
));
6481 return isl_map_intersect_range(id
, set
);
6484 /* Construct a basic set with all set dimensions having only non-negative
6487 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
6488 __isl_take isl_space
*space
)
6493 struct isl_basic_set
*bset
;
6497 nparam
= space
->nparam
;
6499 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
6502 for (i
= 0; i
< dim
; ++i
) {
6503 int k
= isl_basic_set_alloc_inequality(bset
);
6506 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
6507 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
6511 isl_basic_set_free(bset
);
6515 /* Construct the half-space x_pos >= 0.
6517 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
6521 isl_basic_set
*nonneg
;
6523 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6524 k
= isl_basic_set_alloc_inequality(nonneg
);
6527 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
6528 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
6530 return isl_basic_set_finalize(nonneg
);
6532 isl_basic_set_free(nonneg
);
6536 /* Construct the half-space x_pos <= -1.
6538 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
6543 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6544 k
= isl_basic_set_alloc_inequality(neg
);
6547 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
6548 isl_int_set_si(neg
->ineq
[k
][0], -1);
6549 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
6551 return isl_basic_set_finalize(neg
);
6553 isl_basic_set_free(neg
);
6557 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
6558 enum isl_dim_type type
, unsigned first
, unsigned n
)
6561 isl_basic_set
*nonneg
;
6569 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
6571 for (i
= 0; i
< n
; ++i
) {
6572 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
6573 pos(set
->dim
, type
) + first
+ i
);
6574 neg
= neg_halfspace(isl_set_get_space(set
),
6575 pos(set
->dim
, type
) + first
+ i
);
6577 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
6586 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
6587 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6594 if (isl_set_plain_is_empty(set
)) {
6599 return fn(set
, signs
, user
);
6602 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
6604 half
= isl_set_intersect(half
, isl_set_copy(set
));
6605 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
6609 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
6611 half
= isl_set_intersect(half
, set
);
6612 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
6618 /* Call "fn" on the intersections of "set" with each of the orthants
6619 * (except for obviously empty intersections). The orthant is identified
6620 * by the signs array, with each entry having value 1 or -1 according
6621 * to the sign of the corresponding variable.
6623 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
6624 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6634 if (isl_set_plain_is_empty(set
))
6637 nparam
= isl_set_dim(set
, isl_dim_param
);
6638 nvar
= isl_set_dim(set
, isl_dim_set
);
6640 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
6642 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
6650 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6652 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6655 int isl_basic_map_is_subset(
6656 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6659 struct isl_map
*map1
;
6660 struct isl_map
*map2
;
6662 if (!bmap1
|| !bmap2
)
6665 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
6666 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
6668 is_subset
= isl_map_is_subset(map1
, map2
);
6676 int isl_basic_map_is_equal(
6677 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6681 if (!bmap1
|| !bmap2
)
6683 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6686 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6690 int isl_basic_set_is_equal(
6691 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6693 return isl_basic_map_is_equal(
6694 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
6697 int isl_map_is_empty(struct isl_map
*map
)
6704 for (i
= 0; i
< map
->n
; ++i
) {
6705 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
6714 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
6716 return map
? map
->n
== 0 : -1;
6719 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
6721 return isl_map_plain_is_empty(map
);
6724 int isl_set_plain_is_empty(struct isl_set
*set
)
6726 return set
? set
->n
== 0 : -1;
6729 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
6731 return isl_set_plain_is_empty(set
);
6734 int isl_set_is_empty(struct isl_set
*set
)
6736 return isl_map_is_empty((struct isl_map
*)set
);
6739 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6744 return isl_space_is_equal(map1
->dim
, map2
->dim
);
6747 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6752 return isl_space_is_equal(set1
->dim
, set2
->dim
);
6755 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6761 is_subset
= isl_map_is_subset(map1
, map2
);
6764 is_subset
= isl_map_is_subset(map2
, map1
);
6768 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
6770 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
6773 int isl_basic_map_is_strict_subset(
6774 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6778 if (!bmap1
|| !bmap2
)
6780 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
6783 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
6784 if (is_subset
== -1)
6789 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
6795 is_subset
= isl_map_is_subset(map1
, map2
);
6798 is_subset
= isl_map_is_subset(map2
, map1
);
6799 if (is_subset
== -1)
6804 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
6806 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
6809 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
6813 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
6816 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
6820 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
6823 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
6830 for (i
= 0; i
< map
->n
; ++i
) {
6831 int r
= isl_basic_map_is_universe(map
->p
[i
]);
6839 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
6841 return isl_map_plain_is_universe((isl_map
*) set
);
6844 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
6846 return isl_set_plain_is_universe(set
);
6849 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
6851 struct isl_basic_set
*bset
= NULL
;
6852 struct isl_vec
*sample
= NULL
;
6859 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
6862 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
6863 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
6864 copy
= isl_basic_map_remove_redundancies(copy
);
6865 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
6866 isl_basic_map_free(copy
);
6870 total
= 1 + isl_basic_map_total_dim(bmap
);
6871 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
6872 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
6878 isl_vec_free(bmap
->sample
);
6879 bmap
->sample
= NULL
;
6880 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
6883 sample
= isl_basic_set_sample_vec(bset
);
6886 empty
= sample
->size
== 0;
6887 isl_vec_free(bmap
->sample
);
6888 bmap
->sample
= sample
;
6890 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
6895 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
6899 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
6902 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
6904 return isl_basic_map_plain_is_empty(bmap
);
6907 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
6911 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
6914 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
6916 return isl_basic_set_plain_is_empty(bset
);
6919 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
6921 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
6924 struct isl_map
*isl_basic_map_union(
6925 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6927 struct isl_map
*map
;
6928 if (!bmap1
|| !bmap2
)
6931 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
6933 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
6936 map
= isl_map_add_basic_map(map
, bmap1
);
6937 map
= isl_map_add_basic_map(map
, bmap2
);
6940 isl_basic_map_free(bmap1
);
6941 isl_basic_map_free(bmap2
);
6945 struct isl_set
*isl_basic_set_union(
6946 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
6948 return (struct isl_set
*)isl_basic_map_union(
6949 (struct isl_basic_map
*)bset1
,
6950 (struct isl_basic_map
*)bset2
);
6953 /* Order divs such that any div only depends on previous divs */
6954 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
6962 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6964 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6966 if (isl_int_is_zero(bmap
->div
[i
][0]))
6968 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
6972 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
6978 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
6980 return (struct isl_basic_set
*)
6981 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
6984 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
6991 for (i
= 0; i
< map
->n
; ++i
) {
6992 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7003 /* Apply the expansion computed by isl_merge_divs.
7004 * The expansion itself is given by "exp" while the resulting
7005 * list of divs is given by "div".
7007 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7008 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7013 bset
= isl_basic_set_cow(bset
);
7017 if (div
->n_row
< bset
->n_div
)
7018 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7019 "not an expansion", goto error
);
7021 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7022 div
->n_row
- bset
->n_div
, 0,
7023 2 * (div
->n_row
- bset
->n_div
));
7025 n_div
= bset
->n_div
;
7026 for (i
= n_div
; i
< div
->n_row
; ++i
)
7027 if (isl_basic_set_alloc_div(bset
) < 0)
7031 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7032 if (j
>= 0 && exp
[j
] == i
) {
7034 isl_basic_map_swap_div(bset
, i
, j
);
7037 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7038 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7046 isl_basic_set_free(bset
);
7051 /* Look for a div in dst that corresponds to the div "div" in src.
7052 * The divs before "div" in src and dst are assumed to be the same.
7054 * Returns -1 if no corresponding div was found and the position
7055 * of the corresponding div in dst otherwise.
7057 static int find_div(struct isl_basic_map
*dst
,
7058 struct isl_basic_map
*src
, unsigned div
)
7062 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7064 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7065 for (i
= div
; i
< dst
->n_div
; ++i
)
7066 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7067 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7068 dst
->n_div
- div
) == -1)
7073 struct isl_basic_map
*isl_basic_map_align_divs(
7074 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7077 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7082 if (src
->n_div
== 0)
7085 for (i
= 0; i
< src
->n_div
; ++i
)
7086 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7088 src
= isl_basic_map_order_divs(src
);
7089 dst
= isl_basic_map_cow(dst
);
7090 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7091 src
->n_div
, 0, 2 * src
->n_div
);
7094 for (i
= 0; i
< src
->n_div
; ++i
) {
7095 int j
= find_div(dst
, src
, i
);
7097 j
= isl_basic_map_alloc_div(dst
);
7100 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7101 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7102 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7106 isl_basic_map_swap_div(dst
, i
, j
);
7110 isl_basic_map_free(dst
);
7114 struct isl_basic_set
*isl_basic_set_align_divs(
7115 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7117 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7118 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7121 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7129 map
= isl_map_compute_divs(map
);
7130 map
= isl_map_cow(map
);
7134 for (i
= 1; i
< map
->n
; ++i
)
7135 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7136 for (i
= 1; i
< map
->n
; ++i
)
7137 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7139 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7143 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7145 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7148 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7149 __isl_take isl_map
*map
)
7153 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7154 map
= isl_map_intersect_domain(map
, set
);
7155 set
= isl_map_range(map
);
7163 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7164 __isl_take isl_map
*map
)
7166 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7169 /* There is no need to cow as removing empty parts doesn't change
7170 * the meaning of the set.
7172 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7179 for (i
= map
->n
-1; i
>= 0; --i
) {
7180 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
7182 isl_basic_map_free(map
->p
[i
]);
7183 if (i
!= map
->n
-1) {
7184 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7185 map
->p
[i
] = map
->p
[map
->n
-1];
7193 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7195 return (struct isl_set
*)
7196 isl_map_remove_empty_parts((struct isl_map
*)set
);
7199 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7201 struct isl_basic_map
*bmap
;
7202 if (!map
|| map
->n
== 0)
7204 bmap
= map
->p
[map
->n
-1];
7205 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7206 return isl_basic_map_copy(bmap
);
7209 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7211 return (struct isl_basic_set
*)
7212 isl_map_copy_basic_map((struct isl_map
*)set
);
7215 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7216 __isl_keep isl_basic_map
*bmap
)
7222 for (i
= map
->n
-1; i
>= 0; --i
) {
7223 if (map
->p
[i
] != bmap
)
7225 map
= isl_map_cow(map
);
7228 isl_basic_map_free(map
->p
[i
]);
7229 if (i
!= map
->n
-1) {
7230 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7231 map
->p
[i
] = map
->p
[map
->n
-1];
7242 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7243 struct isl_basic_set
*bset
)
7245 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7246 (struct isl_basic_map
*)bset
);
7249 /* Given two basic sets bset1 and bset2, compute the maximal difference
7250 * between the values of dimension pos in bset1 and those in bset2
7251 * for any common value of the parameters and dimensions preceding pos.
7253 static enum isl_lp_result
basic_set_maximal_difference_at(
7254 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7255 int pos
, isl_int
*opt
)
7258 struct isl_basic_map
*bmap1
= NULL
;
7259 struct isl_basic_map
*bmap2
= NULL
;
7260 struct isl_ctx
*ctx
;
7261 struct isl_vec
*obj
;
7264 unsigned dim1
, dim2
;
7265 enum isl_lp_result res
;
7267 if (!bset1
|| !bset2
)
7268 return isl_lp_error
;
7270 nparam
= isl_basic_set_n_param(bset1
);
7271 dim1
= isl_basic_set_n_dim(bset1
);
7272 dim2
= isl_basic_set_n_dim(bset2
);
7273 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7274 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7275 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7276 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7277 if (!bmap1
|| !bmap2
)
7279 bmap1
= isl_basic_map_cow(bmap1
);
7280 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7281 pos
, (dim1
- pos
) + (dim2
- pos
),
7282 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7283 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7286 total
= isl_basic_map_total_dim(bmap1
);
7288 obj
= isl_vec_alloc(ctx
, 1 + total
);
7289 isl_seq_clr(obj
->block
.data
, 1 + total
);
7290 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7291 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7294 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7296 isl_basic_map_free(bmap1
);
7300 isl_basic_map_free(bmap1
);
7301 isl_basic_map_free(bmap2
);
7302 return isl_lp_error
;
7305 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7306 * for any common value of the parameters and dimensions preceding pos
7307 * in both basic sets, the values of dimension pos in bset1 are
7308 * smaller or larger than those in bset2.
7311 * 1 if bset1 follows bset2
7312 * -1 if bset1 precedes bset2
7313 * 0 if bset1 and bset2 are incomparable
7314 * -2 if some error occurred.
7316 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7317 struct isl_basic_set
*bset2
, int pos
)
7320 enum isl_lp_result res
;
7325 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7327 if (res
== isl_lp_empty
)
7329 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7330 res
== isl_lp_unbounded
)
7332 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7341 /* Given two basic sets bset1 and bset2, check whether
7342 * for any common value of the parameters and dimensions preceding pos
7343 * there is a value of dimension pos in bset1 that is larger
7344 * than a value of the same dimension in bset2.
7347 * 1 if there exists such a pair
7348 * 0 if there is no such pair, but there is a pair of equal values
7350 * -2 if some error occurred.
7352 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7353 __isl_keep isl_basic_set
*bset2
, int pos
)
7356 enum isl_lp_result res
;
7361 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7363 if (res
== isl_lp_empty
)
7365 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7366 res
== isl_lp_unbounded
)
7368 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7370 else if (res
== isl_lp_ok
)
7379 /* Given two sets set1 and set2, check whether
7380 * for any common value of the parameters and dimensions preceding pos
7381 * there is a value of dimension pos in set1 that is larger
7382 * than a value of the same dimension in set2.
7385 * 1 if there exists such a pair
7386 * 0 if there is no such pair, but there is a pair of equal values
7388 * -2 if some error occurred.
7390 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7391 __isl_keep isl_set
*set2
, int pos
)
7399 for (i
= 0; i
< set1
->n
; ++i
)
7400 for (j
= 0; j
< set2
->n
; ++j
) {
7402 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7403 if (f
== 1 || f
== -2)
7412 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7413 unsigned pos
, isl_int
*val
)
7421 total
= isl_basic_map_total_dim(bmap
);
7422 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7423 for (; d
+1 > pos
; --d
)
7424 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7428 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7430 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7432 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7435 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7441 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7442 unsigned pos
, isl_int
*val
)
7454 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
7457 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
7458 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
7459 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
7460 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7464 isl_int_set(*val
, v
);
7470 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
7471 unsigned pos
, isl_int
*val
)
7473 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
7477 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
7480 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
7483 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
7484 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7486 if (pos
>= isl_basic_map_dim(bmap
, type
))
7488 return isl_basic_map_plain_has_fixed_var(bmap
,
7489 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
7492 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
7493 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7495 if (pos
>= isl_map_dim(map
, type
))
7497 return isl_map_plain_has_fixed_var(map
,
7498 map_offset(map
, type
) - 1 + pos
, val
);
7501 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
7502 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7504 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
7507 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
7508 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7510 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
7513 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7514 * then return this fixed value in *val.
7516 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
7517 unsigned dim
, isl_int
*val
)
7519 return isl_basic_set_plain_has_fixed_var(bset
,
7520 isl_basic_set_n_param(bset
) + dim
, val
);
7523 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7524 * then return this fixed value in *val.
7526 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
7527 unsigned dim
, isl_int
*val
)
7529 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
7532 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
7533 unsigned dim
, isl_int
*val
)
7535 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
7538 /* Check if input variable in has fixed value and if so and if val is not NULL,
7539 * then return this fixed value in *val.
7541 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
7542 unsigned in
, isl_int
*val
)
7544 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
7547 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7548 * and if val is not NULL, then return this lower bound in *val.
7550 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7551 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
7553 int i
, i_eq
= -1, i_ineq
= -1;
7560 total
= isl_basic_set_total_dim(bset
);
7561 nparam
= isl_basic_set_n_param(bset
);
7562 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7563 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
7569 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7570 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
7572 if (i_eq
!= -1 || i_ineq
!= -1)
7576 if (i_eq
== -1 && i_ineq
== -1)
7578 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
7579 /* The coefficient should always be one due to normalization. */
7580 if (!isl_int_is_one(c
[1+nparam
+dim
]))
7582 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
7584 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
7585 total
- nparam
- dim
- 1) != -1)
7588 isl_int_neg(*val
, c
[0]);
7592 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
7593 unsigned dim
, isl_int
*val
)
7605 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7609 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
7611 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
7612 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
7614 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7618 isl_int_set(*val
, v
);
7629 /* uset_gist depends on constraints without existentially quantified
7630 * variables sorting first.
7632 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
7634 const struct constraint
*c1
= (const struct constraint
*)p1
;
7635 const struct constraint
*c2
= (const struct constraint
*)p2
;
7637 unsigned size
= isl_min(c1
->size
, c2
->size
);
7639 l1
= isl_seq_last_non_zero(c1
->c
, size
);
7640 l2
= isl_seq_last_non_zero(c2
->c
, size
);
7645 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
7648 static struct isl_basic_map
*isl_basic_map_sort_constraints(
7649 struct isl_basic_map
*bmap
)
7652 struct constraint
*c
;
7657 total
= isl_basic_map_total_dim(bmap
);
7658 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
7661 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
7663 c
[i
].c
= bmap
->ineq
[i
];
7665 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
7666 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
7667 bmap
->ineq
[i
] = c
[i
].c
;
7671 isl_basic_map_free(bmap
);
7675 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
7676 __isl_take isl_basic_set
*bset
)
7678 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
7679 (struct isl_basic_map
*)bset
);
7682 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
7686 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
7688 bmap
= isl_basic_map_remove_redundancies(bmap
);
7689 bmap
= isl_basic_map_sort_constraints(bmap
);
7690 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
7694 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
7696 return (struct isl_basic_set
*)isl_basic_map_normalize(
7697 (struct isl_basic_map
*)bset
);
7700 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
7701 const __isl_keep isl_basic_map
*bmap2
)
7708 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
7709 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
7710 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
7711 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
7712 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
7713 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
7714 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7715 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
7716 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
7717 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
7718 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7720 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
7722 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
7724 if (bmap1
->n_eq
!= bmap2
->n_eq
)
7725 return bmap1
->n_eq
- bmap2
->n_eq
;
7726 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
7727 return bmap1
->n_ineq
- bmap2
->n_ineq
;
7728 if (bmap1
->n_div
!= bmap2
->n_div
)
7729 return bmap1
->n_div
- bmap2
->n_div
;
7730 total
= isl_basic_map_total_dim(bmap1
);
7731 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
7732 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
7736 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
7737 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
7741 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
7742 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
7749 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
7750 const __isl_keep isl_basic_set
*bset2
)
7752 return isl_basic_map_plain_cmp(bset1
, bset2
);
7755 int isl_set_plain_cmp(const __isl_keep isl_set
*set1
,
7756 const __isl_keep isl_set
*set2
)
7762 if (set1
->n
!= set2
->n
)
7763 return set1
->n
- set2
->n
;
7765 for (i
= 0; i
< set1
->n
; ++i
) {
7766 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
7774 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
7775 __isl_keep isl_basic_map
*bmap2
)
7777 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
7780 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
7781 __isl_keep isl_basic_set
*bset2
)
7783 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
7784 (isl_basic_map
*)bset2
);
7787 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
7789 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
7790 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
7792 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
7795 /* We normalize in place, but if anything goes wrong we need
7796 * to return NULL, so we need to make sure we don't change the
7797 * meaning of any possible other copies of map.
7799 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
7802 struct isl_basic_map
*bmap
;
7806 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
7808 for (i
= 0; i
< map
->n
; ++i
) {
7809 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
7812 isl_basic_map_free(map
->p
[i
]);
7815 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
7816 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
7817 map
= isl_map_remove_empty_parts(map
);
7820 for (i
= map
->n
- 1; i
>= 1; --i
) {
7821 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
7823 isl_basic_map_free(map
->p
[i
-1]);
7824 for (j
= i
; j
< map
->n
; ++j
)
7825 map
->p
[j
-1] = map
->p
[j
];
7835 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
7837 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
7840 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7850 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7853 map1
= isl_map_copy(map1
);
7854 map2
= isl_map_copy(map2
);
7855 map1
= isl_map_normalize(map1
);
7856 map2
= isl_map_normalize(map2
);
7859 equal
= map1
->n
== map2
->n
;
7860 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
7861 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
7874 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7876 return isl_map_plain_is_equal(map1
, map2
);
7879 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7881 return isl_map_plain_is_equal((struct isl_map
*)set1
,
7882 (struct isl_map
*)set2
);
7885 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7887 return isl_set_plain_is_equal(set1
, set2
);
7890 /* Return an interval that ranges from min to max (inclusive)
7892 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
7893 isl_int min
, isl_int max
)
7896 struct isl_basic_set
*bset
= NULL
;
7898 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
7902 k
= isl_basic_set_alloc_inequality(bset
);
7905 isl_int_set_si(bset
->ineq
[k
][1], 1);
7906 isl_int_neg(bset
->ineq
[k
][0], min
);
7908 k
= isl_basic_set_alloc_inequality(bset
);
7911 isl_int_set_si(bset
->ineq
[k
][1], -1);
7912 isl_int_set(bset
->ineq
[k
][0], max
);
7916 isl_basic_set_free(bset
);
7920 /* Return the Cartesian product of the basic sets in list (in the given order).
7922 __isl_give isl_basic_set
*isl_basic_set_list_product(
7923 __isl_take
struct isl_basic_set_list
*list
)
7931 struct isl_basic_set
*product
= NULL
;
7935 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
7936 isl_assert(list
->ctx
, list
->p
[0], goto error
);
7937 nparam
= isl_basic_set_n_param(list
->p
[0]);
7938 dim
= isl_basic_set_n_dim(list
->p
[0]);
7939 extra
= list
->p
[0]->n_div
;
7940 n_eq
= list
->p
[0]->n_eq
;
7941 n_ineq
= list
->p
[0]->n_ineq
;
7942 for (i
= 1; i
< list
->n
; ++i
) {
7943 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
7944 isl_assert(list
->ctx
,
7945 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
7946 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7947 extra
+= list
->p
[i
]->n_div
;
7948 n_eq
+= list
->p
[i
]->n_eq
;
7949 n_ineq
+= list
->p
[i
]->n_ineq
;
7951 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
7956 for (i
= 0; i
< list
->n
; ++i
) {
7957 isl_basic_set_add_constraints(product
,
7958 isl_basic_set_copy(list
->p
[i
]), dim
);
7959 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
7961 isl_basic_set_list_free(list
);
7964 isl_basic_set_free(product
);
7965 isl_basic_set_list_free(list
);
7969 struct isl_basic_map
*isl_basic_map_product(
7970 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7972 isl_space
*dim_result
= NULL
;
7973 struct isl_basic_map
*bmap
;
7974 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
7975 struct isl_dim_map
*dim_map1
, *dim_map2
;
7977 if (!bmap1
|| !bmap2
)
7980 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
7981 bmap2
->dim
, isl_dim_param
), goto error
);
7982 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
7983 isl_space_copy(bmap2
->dim
));
7985 in1
= isl_basic_map_n_in(bmap1
);
7986 in2
= isl_basic_map_n_in(bmap2
);
7987 out1
= isl_basic_map_n_out(bmap1
);
7988 out2
= isl_basic_map_n_out(bmap2
);
7989 nparam
= isl_basic_map_n_param(bmap1
);
7991 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
7992 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7993 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
7994 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
7995 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
7996 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
7997 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
7998 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
7999 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8000 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8001 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8003 bmap
= isl_basic_map_alloc_space(dim_result
,
8004 bmap1
->n_div
+ bmap2
->n_div
,
8005 bmap1
->n_eq
+ bmap2
->n_eq
,
8006 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8007 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8008 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8009 bmap
= isl_basic_map_simplify(bmap
);
8010 return isl_basic_map_finalize(bmap
);
8012 isl_basic_map_free(bmap1
);
8013 isl_basic_map_free(bmap2
);
8017 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8018 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8020 isl_basic_map
*prod
;
8022 prod
= isl_basic_map_product(bmap1
, bmap2
);
8023 prod
= isl_basic_map_flatten(prod
);
8027 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8028 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8030 return isl_basic_map_flat_range_product(bset1
, bset2
);
8033 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8034 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8036 isl_space
*space_result
= NULL
;
8037 isl_basic_map
*bmap
;
8038 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8039 struct isl_dim_map
*dim_map1
, *dim_map2
;
8041 if (!bmap1
|| !bmap2
)
8044 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8045 isl_space_copy(bmap2
->dim
));
8047 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8048 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8049 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8050 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8052 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8053 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8054 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8055 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8056 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8057 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8058 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8059 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8060 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8061 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8062 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8064 bmap
= isl_basic_map_alloc_space(space_result
,
8065 bmap1
->n_div
+ bmap2
->n_div
,
8066 bmap1
->n_eq
+ bmap2
->n_eq
,
8067 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8068 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8069 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8070 bmap
= isl_basic_map_simplify(bmap
);
8071 return isl_basic_map_finalize(bmap
);
8073 isl_basic_map_free(bmap1
);
8074 isl_basic_map_free(bmap2
);
8078 __isl_give isl_basic_map
*isl_basic_map_range_product(
8079 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8081 isl_space
*dim_result
= NULL
;
8082 isl_basic_map
*bmap
;
8083 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8084 struct isl_dim_map
*dim_map1
, *dim_map2
;
8086 if (!bmap1
|| !bmap2
)
8089 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8090 isl_space_copy(bmap2
->dim
));
8092 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8093 out1
= isl_basic_map_n_out(bmap1
);
8094 out2
= isl_basic_map_n_out(bmap2
);
8095 nparam
= isl_basic_map_n_param(bmap1
);
8097 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8098 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8099 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8100 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8101 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8102 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8103 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8104 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8105 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8106 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8107 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8109 bmap
= isl_basic_map_alloc_space(dim_result
,
8110 bmap1
->n_div
+ bmap2
->n_div
,
8111 bmap1
->n_eq
+ bmap2
->n_eq
,
8112 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8113 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8114 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8115 bmap
= isl_basic_map_simplify(bmap
);
8116 return isl_basic_map_finalize(bmap
);
8118 isl_basic_map_free(bmap1
);
8119 isl_basic_map_free(bmap2
);
8123 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8124 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8126 isl_basic_map
*prod
;
8128 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8129 prod
= isl_basic_map_flatten_range(prod
);
8133 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8134 __isl_take isl_map
*map2
,
8135 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8136 __isl_take isl_space
*right
),
8137 __isl_give isl_basic_map
*(*basic_map_product
)(
8138 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8141 struct isl_map
*result
;
8147 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8148 map2
->dim
, isl_dim_param
), goto error
);
8150 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8151 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8152 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8154 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8155 isl_space_copy(map2
->dim
)),
8156 map1
->n
* map2
->n
, flags
);
8159 for (i
= 0; i
< map1
->n
; ++i
)
8160 for (j
= 0; j
< map2
->n
; ++j
) {
8161 struct isl_basic_map
*part
;
8162 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8163 isl_basic_map_copy(map2
->p
[j
]));
8164 if (isl_basic_map_is_empty(part
))
8165 isl_basic_map_free(part
);
8167 result
= isl_map_add_basic_map(result
, part
);
8180 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8182 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8183 __isl_take isl_map
*map2
)
8185 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8188 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8189 __isl_take isl_map
*map2
)
8191 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8194 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8196 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8197 __isl_take isl_map
*map2
)
8201 prod
= isl_map_product(map1
, map2
);
8202 prod
= isl_map_flatten(prod
);
8206 /* Given two set A and B, construct its Cartesian product A x B.
8208 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8210 return isl_map_range_product(set1
, set2
);
8213 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8214 __isl_take isl_set
*set2
)
8216 return isl_map_flat_range_product(set1
, set2
);
8219 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8221 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8222 __isl_take isl_map
*map2
)
8224 return map_product(map1
, map2
, &isl_space_domain_product
,
8225 &isl_basic_map_domain_product
);
8228 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8230 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8231 __isl_take isl_map
*map2
)
8233 return map_product(map1
, map2
, &isl_space_range_product
,
8234 &isl_basic_map_range_product
);
8237 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8238 __isl_take isl_map
*map2
)
8240 return isl_map_align_params_map_map_and(map1
, map2
,
8241 &map_domain_product_aligned
);
8244 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8245 __isl_take isl_map
*map2
)
8247 return isl_map_align_params_map_map_and(map1
, map2
,
8248 &map_range_product_aligned
);
8251 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8253 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8254 __isl_take isl_map
*map2
)
8258 prod
= isl_map_domain_product(map1
, map2
);
8259 prod
= isl_map_flatten_domain(prod
);
8263 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8265 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8266 __isl_take isl_map
*map2
)
8270 prod
= isl_map_range_product(map1
, map2
);
8271 prod
= isl_map_flatten_range(prod
);
8275 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8278 uint32_t hash
= isl_hash_init();
8283 bmap
= isl_basic_map_copy(bmap
);
8284 bmap
= isl_basic_map_normalize(bmap
);
8287 total
= isl_basic_map_total_dim(bmap
);
8288 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8289 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8291 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8292 isl_hash_hash(hash
, c_hash
);
8294 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8295 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8297 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8298 isl_hash_hash(hash
, c_hash
);
8300 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8301 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8303 if (isl_int_is_zero(bmap
->div
[i
][0]))
8305 isl_hash_byte(hash
, i
& 0xFF);
8306 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8307 isl_hash_hash(hash
, c_hash
);
8309 isl_basic_map_free(bmap
);
8313 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8315 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8318 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8325 map
= isl_map_copy(map
);
8326 map
= isl_map_normalize(map
);
8330 hash
= isl_hash_init();
8331 for (i
= 0; i
< map
->n
; ++i
) {
8333 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8334 isl_hash_hash(hash
, bmap_hash
);
8342 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8344 return isl_map_get_hash((isl_map
*)set
);
8347 /* Check if the value for dimension dim is completely determined
8348 * by the values of the other parameters and variables.
8349 * That is, check if dimension dim is involved in an equality.
8351 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8358 nparam
= isl_basic_set_n_param(bset
);
8359 for (i
= 0; i
< bset
->n_eq
; ++i
)
8360 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8365 /* Check if the value for dimension dim is completely determined
8366 * by the values of the other parameters and variables.
8367 * That is, check if dimension dim is involved in an equality
8368 * for each of the subsets.
8370 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8376 for (i
= 0; i
< set
->n
; ++i
) {
8378 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8385 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8387 return set
? set
->n
: 0;
8390 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8391 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8398 for (i
= 0; i
< map
->n
; ++i
)
8399 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8405 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8406 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8413 for (i
= 0; i
< set
->n
; ++i
)
8414 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8420 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8427 bset
= isl_basic_set_cow(bset
);
8431 dim
= isl_basic_set_get_space(bset
);
8432 dim
= isl_space_lift(dim
, bset
->n_div
);
8435 isl_space_free(bset
->dim
);
8437 bset
->extra
-= bset
->n_div
;
8440 bset
= isl_basic_set_finalize(bset
);
8444 isl_basic_set_free(bset
);
8448 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
8454 set
= isl_set_align_divs(set
);
8459 set
= isl_set_cow(set
);
8463 n_div
= set
->p
[0]->n_div
;
8464 dim
= isl_set_get_space(set
);
8465 dim
= isl_space_lift(dim
, n_div
);
8468 isl_space_free(set
->dim
);
8471 for (i
= 0; i
< set
->n
; ++i
) {
8472 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
8483 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
8486 struct isl_basic_map
*bmap
;
8493 set
= isl_set_align_divs(set
);
8498 dim
= isl_set_get_space(set
);
8499 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
8501 return isl_map_identity(isl_space_map_from_set(dim
));
8504 n_div
= set
->p
[0]->n_div
;
8505 dim
= isl_space_map_from_set(dim
);
8506 n_param
= isl_space_dim(dim
, isl_dim_param
);
8507 n_set
= isl_space_dim(dim
, isl_dim_in
);
8508 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
8509 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
8510 for (i
= 0; i
< n_set
; ++i
)
8511 bmap
= var_equal(bmap
, i
);
8513 total
= n_param
+ n_set
+ n_set
+ n_div
;
8514 for (i
= 0; i
< n_div
; ++i
) {
8515 k
= isl_basic_map_alloc_inequality(bmap
);
8518 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
8519 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
8520 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
8521 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
8522 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
8523 set
->p
[0]->div
[i
][0]);
8525 l
= isl_basic_map_alloc_inequality(bmap
);
8528 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
8529 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
8530 set
->p
[0]->div
[i
][0]);
8531 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
8535 bmap
= isl_basic_map_simplify(bmap
);
8536 bmap
= isl_basic_map_finalize(bmap
);
8537 return isl_map_from_basic_map(bmap
);
8540 isl_basic_map_free(bmap
);
8544 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
8552 dim
= isl_basic_set_total_dim(bset
);
8553 size
+= bset
->n_eq
* (1 + dim
);
8554 size
+= bset
->n_ineq
* (1 + dim
);
8555 size
+= bset
->n_div
* (2 + dim
);
8560 int isl_set_size(__isl_keep isl_set
*set
)
8568 for (i
= 0; i
< set
->n
; ++i
)
8569 size
+= isl_basic_set_size(set
->p
[i
]);
8574 /* Check if there is any lower bound (if lower == 0) and/or upper
8575 * bound (if upper == 0) on the specified dim.
8577 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8578 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
8585 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
8587 pos
+= isl_basic_map_offset(bmap
, type
);
8589 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8590 if (isl_int_is_zero(bmap
->div
[i
][0]))
8592 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
8596 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8597 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
8600 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8601 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
8608 return lower
&& upper
;
8611 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8612 enum isl_dim_type type
, unsigned pos
)
8614 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
8617 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
8618 enum isl_dim_type type
, unsigned pos
)
8620 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
8623 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
8624 enum isl_dim_type type
, unsigned pos
)
8626 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
8629 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
8630 enum isl_dim_type type
, unsigned pos
)
8637 for (i
= 0; i
< map
->n
; ++i
) {
8639 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
8640 if (bounded
< 0 || !bounded
)
8647 /* Return 1 if the specified dim is involved in both an upper bound
8648 * and a lower bound.
8650 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
8651 enum isl_dim_type type
, unsigned pos
)
8653 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
8656 static int has_bound(__isl_keep isl_map
*map
,
8657 enum isl_dim_type type
, unsigned pos
,
8658 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
8659 enum isl_dim_type type
, unsigned pos
))
8666 for (i
= 0; i
< map
->n
; ++i
) {
8668 bounded
= fn(map
->p
[i
], type
, pos
);
8669 if (bounded
< 0 || bounded
)
8676 /* Return 1 if the specified dim is involved in any lower bound.
8678 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
8679 enum isl_dim_type type
, unsigned pos
)
8681 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
8684 /* Return 1 if the specified dim is involved in any upper bound.
8686 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
8687 enum isl_dim_type type
, unsigned pos
)
8689 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
8692 /* For each of the "n" variables starting at "first", determine
8693 * the sign of the variable and put the results in the first "n"
8694 * elements of the array "signs".
8696 * 1 means that the variable is non-negative
8697 * -1 means that the variable is non-positive
8698 * 0 means the variable attains both positive and negative values.
8700 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
8701 unsigned first
, unsigned n
, int *signs
)
8703 isl_vec
*bound
= NULL
;
8704 struct isl_tab
*tab
= NULL
;
8705 struct isl_tab_undo
*snap
;
8708 if (!bset
|| !signs
)
8711 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
8712 tab
= isl_tab_from_basic_set(bset
);
8716 isl_seq_clr(bound
->el
, bound
->size
);
8717 isl_int_set_si(bound
->el
[0], -1);
8719 snap
= isl_tab_snap(tab
);
8720 for (i
= 0; i
< n
; ++i
) {
8723 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
8724 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8727 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8728 if (isl_tab_rollback(tab
, snap
) < 0)
8736 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
8737 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
8740 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
8741 if (isl_tab_rollback(tab
, snap
) < 0)
8744 signs
[i
] = empty
? -1 : 0;
8748 isl_vec_free(bound
);
8752 isl_vec_free(bound
);
8756 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
8757 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
8759 if (!bset
|| !signs
)
8761 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
8764 first
+= pos(bset
->dim
, type
) - 1;
8765 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
8768 /* Check if the given basic map is obviously single-valued.
8769 * In particular, for each output dimension, check that there is
8770 * an equality that defines the output dimension in terms of
8771 * earlier dimensions.
8773 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
8783 total
= 1 + isl_basic_map_total_dim(bmap
);
8784 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
8785 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
8787 for (i
= 0; i
< n_out
; ++i
) {
8788 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
8789 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
8791 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
8792 total
- (o_out
+ i
+ 1)) == -1)
8795 if (j
>= bmap
->n_eq
)
8802 /* Check if the given map is obviously single-valued.
8804 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
8813 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
8816 /* Check if the given map is single-valued.
8821 * and check if the result is a subset of the identity mapping.
8823 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
8830 sv
= isl_map_plain_is_single_valued(map
);
8834 test
= isl_map_reverse(isl_map_copy(map
));
8835 test
= isl_map_apply_range(test
, isl_map_copy(map
));
8837 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
8838 id
= isl_map_identity(dim
);
8840 sv
= isl_map_is_subset(test
, id
);
8848 int isl_map_is_injective(__isl_keep isl_map
*map
)
8852 map
= isl_map_copy(map
);
8853 map
= isl_map_reverse(map
);
8854 in
= isl_map_is_single_valued(map
);
8860 /* Check if the given map is obviously injective.
8862 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
8866 map
= isl_map_copy(map
);
8867 map
= isl_map_reverse(map
);
8868 in
= isl_map_plain_is_single_valued(map
);
8874 int isl_map_is_bijective(__isl_keep isl_map
*map
)
8878 sv
= isl_map_is_single_valued(map
);
8882 return isl_map_is_injective(map
);
8885 int isl_set_is_singleton(__isl_keep isl_set
*set
)
8887 return isl_map_is_single_valued((isl_map
*)set
);
8890 int isl_map_is_translation(__isl_keep isl_map
*map
)
8895 delta
= isl_map_deltas(isl_map_copy(map
));
8896 ok
= isl_set_is_singleton(delta
);
8897 isl_set_free(delta
);
8902 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
8904 if (isl_seq_first_non_zero(p
, pos
) != -1)
8906 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
8911 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
8920 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
8923 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
8924 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
8925 for (j
= 0; j
< nvar
; ++j
) {
8926 int lower
= 0, upper
= 0;
8927 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8928 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
8930 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
8936 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8937 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
8939 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
8941 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
8946 if (!lower
|| !upper
)
8953 int isl_set_is_box(__isl_keep isl_set
*set
)
8960 return isl_basic_set_is_box(set
->p
[0]);
8963 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
8968 return isl_space_is_wrapping(bset
->dim
);
8971 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
8976 return isl_space_is_wrapping(set
->dim
);
8979 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
8981 bmap
= isl_basic_map_cow(bmap
);
8985 bmap
->dim
= isl_space_wrap(bmap
->dim
);
8989 bmap
= isl_basic_map_finalize(bmap
);
8991 return (isl_basic_set
*)bmap
;
8993 isl_basic_map_free(bmap
);
8997 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9001 map
= isl_map_cow(map
);
9005 for (i
= 0; i
< map
->n
; ++i
) {
9006 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9010 map
->dim
= isl_space_wrap(map
->dim
);
9014 return (isl_set
*)map
;
9020 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9022 bset
= isl_basic_set_cow(bset
);
9026 bset
->dim
= isl_space_unwrap(bset
->dim
);
9030 bset
= isl_basic_set_finalize(bset
);
9032 return (isl_basic_map
*)bset
;
9034 isl_basic_set_free(bset
);
9038 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9045 if (!isl_set_is_wrapping(set
))
9046 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9049 set
= isl_set_cow(set
);
9053 for (i
= 0; i
< set
->n
; ++i
) {
9054 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9059 set
->dim
= isl_space_unwrap(set
->dim
);
9063 return (isl_map
*)set
;
9069 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9070 enum isl_dim_type type
)
9075 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9078 bmap
= isl_basic_map_cow(bmap
);
9082 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9086 bmap
= isl_basic_map_finalize(bmap
);
9090 isl_basic_map_free(bmap
);
9094 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9095 enum isl_dim_type type
)
9102 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9105 map
= isl_map_cow(map
);
9109 for (i
= 0; i
< map
->n
; ++i
) {
9110 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9114 map
->dim
= isl_space_reset(map
->dim
, type
);
9124 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9129 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9132 bmap
= isl_basic_map_cow(bmap
);
9136 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9140 bmap
= isl_basic_map_finalize(bmap
);
9144 isl_basic_map_free(bmap
);
9148 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9150 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9153 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9154 __isl_take isl_basic_map
*bmap
)
9159 if (!bmap
->dim
->nested
[0])
9162 bmap
= isl_basic_map_cow(bmap
);
9166 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9170 bmap
= isl_basic_map_finalize(bmap
);
9174 isl_basic_map_free(bmap
);
9178 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9179 __isl_take isl_basic_map
*bmap
)
9184 if (!bmap
->dim
->nested
[1])
9187 bmap
= isl_basic_map_cow(bmap
);
9191 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9195 bmap
= isl_basic_map_finalize(bmap
);
9199 isl_basic_map_free(bmap
);
9203 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9210 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9213 map
= isl_map_cow(map
);
9217 for (i
= 0; i
< map
->n
; ++i
) {
9218 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9222 map
->dim
= isl_space_flatten(map
->dim
);
9232 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9234 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9237 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9239 isl_space
*dim
, *flat_dim
;
9242 dim
= isl_set_get_space(set
);
9243 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9244 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9245 map
= isl_map_intersect_domain(map
, set
);
9250 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9257 if (!map
->dim
->nested
[0])
9260 map
= isl_map_cow(map
);
9264 for (i
= 0; i
< map
->n
; ++i
) {
9265 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9269 map
->dim
= isl_space_flatten_domain(map
->dim
);
9279 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9286 if (!map
->dim
->nested
[1])
9289 map
= isl_map_cow(map
);
9293 for (i
= 0; i
< map
->n
; ++i
) {
9294 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9298 map
->dim
= isl_space_flatten_range(map
->dim
);
9308 /* Reorder the dimensions of "bmap" according to the given dim_map
9309 * and set the dimension specification to "dim".
9311 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9312 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9316 bmap
= isl_basic_map_cow(bmap
);
9317 if (!bmap
|| !dim
|| !dim_map
)
9320 res
= isl_basic_map_alloc_space(dim
,
9321 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9322 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9323 res
= isl_basic_map_finalize(res
);
9327 isl_basic_map_free(bmap
);
9328 isl_space_free(dim
);
9332 /* Reorder the dimensions of "map" according to given reordering.
9334 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9335 __isl_take isl_reordering
*r
)
9338 struct isl_dim_map
*dim_map
;
9340 map
= isl_map_cow(map
);
9341 dim_map
= isl_dim_map_from_reordering(r
);
9342 if (!map
|| !r
|| !dim_map
)
9345 for (i
= 0; i
< map
->n
; ++i
) {
9346 struct isl_dim_map
*dim_map_i
;
9348 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9350 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9351 isl_space_copy(r
->dim
), dim_map_i
);
9357 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9359 isl_reordering_free(r
);
9365 isl_reordering_free(r
);
9369 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
9370 __isl_take isl_reordering
*r
)
9372 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
9375 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
9376 __isl_take isl_space
*model
)
9383 ctx
= isl_space_get_ctx(model
);
9384 if (!isl_space_has_named_params(model
))
9385 isl_die(ctx
, isl_error_invalid
,
9386 "model has unnamed parameters", goto error
);
9387 if (!isl_space_has_named_params(map
->dim
))
9388 isl_die(ctx
, isl_error_invalid
,
9389 "relation has unnamed parameters", goto error
);
9390 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9391 isl_reordering
*exp
;
9393 model
= isl_space_drop_dims(model
, isl_dim_in
,
9394 0, isl_space_dim(model
, isl_dim_in
));
9395 model
= isl_space_drop_dims(model
, isl_dim_out
,
9396 0, isl_space_dim(model
, isl_dim_out
));
9397 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
9398 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
9399 map
= isl_map_realign(map
, exp
);
9402 isl_space_free(model
);
9405 isl_space_free(model
);
9410 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
9411 __isl_take isl_space
*model
)
9413 return isl_map_align_params(set
, model
);
9416 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
9417 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9418 enum isl_dim_type c2
, enum isl_dim_type c3
,
9419 enum isl_dim_type c4
, enum isl_dim_type c5
)
9421 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9422 struct isl_mat
*mat
;
9428 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
9429 isl_basic_map_total_dim(bmap
) + 1);
9432 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9433 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9434 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9435 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9436 isl_int_set(mat
->row
[i
][pos
],
9437 bmap
->eq
[i
][off
+ k
]);
9445 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
9446 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9447 enum isl_dim_type c2
, enum isl_dim_type c3
,
9448 enum isl_dim_type c4
, enum isl_dim_type c5
)
9450 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9451 struct isl_mat
*mat
;
9457 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
9458 isl_basic_map_total_dim(bmap
) + 1);
9461 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
9462 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9463 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9464 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9465 isl_int_set(mat
->row
[i
][pos
],
9466 bmap
->ineq
[i
][off
+ k
]);
9474 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
9475 __isl_take isl_space
*dim
,
9476 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9477 enum isl_dim_type c2
, enum isl_dim_type c3
,
9478 enum isl_dim_type c4
, enum isl_dim_type c5
)
9480 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9481 isl_basic_map
*bmap
;
9487 if (!dim
|| !eq
|| !ineq
)
9490 if (eq
->n_col
!= ineq
->n_col
)
9491 isl_die(dim
->ctx
, isl_error_invalid
,
9492 "equalities and inequalities matrices should have "
9493 "same number of columns", goto error
);
9495 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
9497 if (eq
->n_col
< total
)
9498 isl_die(dim
->ctx
, isl_error_invalid
,
9499 "number of columns too small", goto error
);
9501 extra
= eq
->n_col
- total
;
9503 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
9504 eq
->n_row
, ineq
->n_row
);
9507 for (i
= 0; i
< extra
; ++i
) {
9508 k
= isl_basic_map_alloc_div(bmap
);
9511 isl_int_set_si(bmap
->div
[k
][0], 0);
9513 for (i
= 0; i
< eq
->n_row
; ++i
) {
9514 l
= isl_basic_map_alloc_equality(bmap
);
9517 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9518 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9519 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9520 isl_int_set(bmap
->eq
[l
][off
+ k
],
9526 for (i
= 0; i
< ineq
->n_row
; ++i
) {
9527 l
= isl_basic_map_alloc_inequality(bmap
);
9530 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9531 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9532 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9533 isl_int_set(bmap
->ineq
[l
][off
+ k
],
9540 isl_space_free(dim
);
9546 isl_space_free(dim
);
9552 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
9553 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9554 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9556 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
9557 c1
, c2
, c3
, c4
, isl_dim_in
);
9560 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
9561 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
9562 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9564 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
9565 c1
, c2
, c3
, c4
, isl_dim_in
);
9568 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
9569 __isl_take isl_space
*dim
,
9570 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9571 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
9573 return (isl_basic_set
*)
9574 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
9575 c1
, c2
, c3
, c4
, isl_dim_in
);
9578 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
9583 return isl_space_can_zip(bmap
->dim
);
9586 int isl_map_can_zip(__isl_keep isl_map
*map
)
9591 return isl_space_can_zip(map
->dim
);
9594 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9595 * (A -> C) -> (B -> D).
9597 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
9606 if (!isl_basic_map_can_zip(bmap
))
9607 isl_die(bmap
->ctx
, isl_error_invalid
,
9608 "basic map cannot be zipped", goto error
);
9609 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
9610 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
9611 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
9612 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
9613 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
9616 bmap
->dim
= isl_space_zip(bmap
->dim
);
9621 isl_basic_map_free(bmap
);
9625 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9626 * (A -> C) -> (B -> D).
9628 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
9635 if (!isl_map_can_zip(map
))
9636 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
9639 map
= isl_map_cow(map
);
9643 for (i
= 0; i
< map
->n
; ++i
) {
9644 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
9649 map
->dim
= isl_space_zip(map
->dim
);
9659 /* Construct a basic map mapping the domain of the affine expression
9660 * to a one-dimensional range prescribed by the affine expression.
9662 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
9666 isl_local_space
*ls
;
9667 isl_basic_map
*bmap
;
9672 ls
= isl_aff_get_local_space(aff
);
9673 bmap
= isl_basic_map_from_local_space(ls
);
9674 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
9675 k
= isl_basic_map_alloc_equality(bmap
);
9679 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
9680 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
9681 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
9682 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
9683 aff
->v
->size
- (pos
+ 1));
9686 bmap
= isl_basic_map_finalize(bmap
);
9690 isl_basic_map_free(bmap
);
9694 /* Construct a basic map mapping the domain the multi-affine expression
9695 * to its range, with each dimension in the range equated to the
9696 * corresponding affine expression.
9698 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
9699 __isl_take isl_multi_aff
*maff
)
9703 isl_basic_map
*bmap
;
9708 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
9709 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
9710 "invalid space", return isl_multi_aff_free(maff
));
9712 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
9713 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
9715 for (i
= 0; i
< maff
->n
; ++i
) {
9717 isl_basic_map
*bmap_i
;
9719 aff
= isl_aff_copy(maff
->p
[i
]);
9720 bmap_i
= isl_basic_map_from_aff(aff
);
9722 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
9725 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
9727 isl_multi_aff_free(maff
);
9731 /* Construct a basic map mapping a domain in the given space to
9732 * to an n-dimensional range, with n the number of elements in the list,
9733 * where each coordinate in the range is prescribed by the
9734 * corresponding affine expression.
9735 * The domains of all affine expressions in the list are assumed to match
9738 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
9739 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
9743 isl_basic_map
*bmap
;
9748 dim
= isl_space_from_domain(domain_dim
);
9749 bmap
= isl_basic_map_universe(dim
);
9751 for (i
= 0; i
< list
->n
; ++i
) {
9753 isl_basic_map
*bmap_i
;
9755 aff
= isl_aff_copy(list
->p
[i
]);
9756 bmap_i
= isl_basic_map_from_aff(aff
);
9758 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
9761 isl_aff_list_free(list
);
9765 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
9766 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9768 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
9771 /* Add a constraint imposing that the given two dimensions are equal.
9773 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
9774 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9776 isl_basic_map
*bmap
= NULL
;
9782 if (pos1
>= isl_map_dim(map
, type1
))
9783 isl_die(map
->ctx
, isl_error_invalid
,
9784 "index out of bounds", goto error
);
9785 if (pos2
>= isl_map_dim(map
, type2
))
9786 isl_die(map
->ctx
, isl_error_invalid
,
9787 "index out of bounds", goto error
);
9789 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
9790 i
= isl_basic_map_alloc_equality(bmap
);
9793 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
9794 pos1
+= isl_basic_map_offset(bmap
, type1
);
9795 pos2
+= isl_basic_map_offset(bmap
, type2
);
9796 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
9797 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
9798 bmap
= isl_basic_map_finalize(bmap
);
9800 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
9804 isl_basic_map_free(bmap
);
9809 /* Add a constraint imposing that the given two dimensions have opposite values.
9811 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
9812 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
9814 isl_basic_map
*bmap
= NULL
;
9820 if (pos1
>= isl_map_dim(map
, type1
))
9821 isl_die(map
->ctx
, isl_error_invalid
,
9822 "index out of bounds", goto error
);
9823 if (pos2
>= isl_map_dim(map
, type2
))
9824 isl_die(map
->ctx
, isl_error_invalid
,
9825 "index out of bounds", goto error
);
9827 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
9828 i
= isl_basic_map_alloc_equality(bmap
);
9831 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
9832 pos1
+= isl_basic_map_offset(bmap
, type1
);
9833 pos2
+= isl_basic_map_offset(bmap
, type2
);
9834 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
9835 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
9836 bmap
= isl_basic_map_finalize(bmap
);
9838 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
9842 isl_basic_map_free(bmap
);
9847 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
9851 isl_local_space
*ls
;
9856 if (!isl_basic_map_divs_known(bmap
))
9857 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
9858 "some divs are unknown", return NULL
);
9860 ls
= isl_basic_map_get_local_space(bmap
);
9861 div
= isl_local_space_get_div(ls
, pos
);
9862 isl_local_space_free(ls
);
9867 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
9870 return isl_basic_map_get_div(bset
, pos
);
9873 /* Plug in "subs" for dimension "type", "pos" of "bset".
9875 * Let i be the dimension to replace and let "subs" be of the form
9879 * Any integer division with a non-zero coefficient for i,
9881 * floor((a i + g)/m)
9885 * floor((a f + d g)/(m d))
9887 * Constraints of the form
9895 __isl_give isl_basic_set
*isl_basic_set_substitute(
9896 __isl_take isl_basic_set
*bset
,
9897 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
9903 if (bset
&& isl_basic_set_plain_is_empty(bset
))
9906 bset
= isl_basic_set_cow(bset
);
9910 ctx
= isl_basic_set_get_ctx(bset
);
9911 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
9912 isl_die(ctx
, isl_error_invalid
,
9913 "spaces don't match", goto error
);
9914 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
9915 isl_die(ctx
, isl_error_unsupported
,
9916 "cannot handle divs yet", goto error
);
9918 pos
+= isl_basic_set_offset(bset
, type
);
9922 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9923 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
9925 isl_int_set(v
, bset
->eq
[i
][pos
]);
9926 isl_int_set_si(bset
->eq
[i
][pos
], 0);
9927 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
9928 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
9931 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9932 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
9934 isl_int_set(v
, bset
->ineq
[i
][pos
]);
9935 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
9936 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
9937 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
9940 for (i
= 0; i
< bset
->n_div
; ++i
) {
9941 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
9943 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
9944 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
9945 isl_seq_combine(bset
->div
[i
] + 1,
9946 subs
->v
->el
[0], bset
->div
[i
] + 1,
9947 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
9948 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
9953 bset
= isl_basic_set_simplify(bset
);
9954 return isl_basic_set_finalize(bset
);
9956 isl_basic_set_free(bset
);
9960 /* Plug in "subs" for dimension "type", "pos" of "set".
9962 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
9963 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
9967 if (set
&& isl_set_plain_is_empty(set
))
9970 set
= isl_set_cow(set
);
9974 for (i
= set
->n
- 1; i
>= 0; --i
) {
9975 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
9978 if (isl_basic_set_plain_is_empty(set
->p
[i
])) {
9979 isl_basic_set_free(set
->p
[i
]);
9980 if (i
!= set
->n
- 1)
9981 set
->p
[i
] = set
->p
[set
->n
- 1];