2 * Copyright 2010-2011 INRIA Saclay
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 #include <isl_map_private.h>
17 #include <isl_space_private.h>
18 #include <isl_union_map_private.h>
19 #include <isl/union_set.h>
21 /* Is this union set a parameter domain?
23 int isl_union_set_is_params(__isl_keep isl_union_set
*uset
)
30 if (uset
->table
.n
!= 1)
33 set
= isl_set_from_union_set(isl_union_set_copy(uset
));
34 params
= isl_set_is_params(set
);
39 static __isl_give isl_union_map
*isl_union_map_alloc(__isl_take isl_space
*dim
,
47 umap
= isl_calloc_type(dim
->ctx
, isl_union_map
);
53 if (isl_hash_table_init(dim
->ctx
, &umap
->table
, size
) < 0)
59 isl_union_map_free(umap
);
63 __isl_give isl_union_map
*isl_union_map_empty(__isl_take isl_space
*dim
)
65 return isl_union_map_alloc(dim
, 16);
68 __isl_give isl_union_set
*isl_union_set_empty(__isl_take isl_space
*dim
)
70 return isl_union_map_empty(dim
);
73 isl_ctx
*isl_union_map_get_ctx(__isl_keep isl_union_map
*umap
)
75 return umap
? umap
->dim
->ctx
: NULL
;
78 isl_ctx
*isl_union_set_get_ctx(__isl_keep isl_union_set
*uset
)
80 return uset
? uset
->dim
->ctx
: NULL
;
83 __isl_give isl_space
*isl_union_map_get_space(__isl_keep isl_union_map
*umap
)
87 return isl_space_copy(umap
->dim
);
90 __isl_give isl_space
*isl_union_set_get_space(__isl_keep isl_union_set
*uset
)
92 return isl_union_map_get_space(uset
);
95 static int free_umap_entry(void **entry
, void *user
)
97 isl_map
*map
= *entry
;
102 static int add_map(__isl_take isl_map
*map
, void *user
)
104 isl_union_map
**umap
= (isl_union_map
**)user
;
106 *umap
= isl_union_map_add_map(*umap
, map
);
111 __isl_give isl_union_map
*isl_union_map_dup(__isl_keep isl_union_map
*umap
)
118 dup
= isl_union_map_empty(isl_space_copy(umap
->dim
));
119 if (isl_union_map_foreach_map(umap
, &add_map
, &dup
) < 0)
123 isl_union_map_free(dup
);
127 __isl_give isl_union_map
*isl_union_map_cow(__isl_take isl_union_map
*umap
)
135 return isl_union_map_dup(umap
);
138 struct isl_union_align
{
143 static int align_entry(void **entry
, void *user
)
145 isl_map
*map
= *entry
;
147 struct isl_union_align
*data
= user
;
149 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
150 isl_map_get_space(map
));
152 data
->res
= isl_union_map_add_map(data
->res
,
153 isl_map_realign(isl_map_copy(map
), exp
));
158 /* Align the parameters of umap along those of model.
159 * The result has the parameters of model first, in the same order
160 * as they appear in model, followed by any remaining parameters of
161 * umap that do not appear in model.
163 __isl_give isl_union_map
*isl_union_map_align_params(
164 __isl_take isl_union_map
*umap
, __isl_take isl_space
*model
)
166 struct isl_union_align data
= { NULL
, NULL
};
171 if (isl_space_match(umap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
172 isl_space_free(model
);
176 model
= isl_space_params(model
);
177 data
.exp
= isl_parameter_alignment_reordering(umap
->dim
, model
);
181 data
.res
= isl_union_map_alloc(isl_space_copy(data
.exp
->dim
),
183 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
184 &align_entry
, &data
) < 0)
187 isl_reordering_free(data
.exp
);
188 isl_union_map_free(umap
);
189 isl_space_free(model
);
192 isl_reordering_free(data
.exp
);
193 isl_union_map_free(umap
);
194 isl_union_map_free(data
.res
);
195 isl_space_free(model
);
199 __isl_give isl_union_set
*isl_union_set_align_params(
200 __isl_take isl_union_set
*uset
, __isl_take isl_space
*model
)
202 return isl_union_map_align_params(uset
, model
);
205 __isl_give isl_union_map
*isl_union_map_union(__isl_take isl_union_map
*umap1
,
206 __isl_take isl_union_map
*umap2
)
208 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
209 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
211 umap1
= isl_union_map_cow(umap1
);
213 if (!umap1
|| !umap2
)
216 if (isl_union_map_foreach_map(umap2
, &add_map
, &umap1
) < 0)
219 isl_union_map_free(umap2
);
223 isl_union_map_free(umap1
);
224 isl_union_map_free(umap2
);
228 __isl_give isl_union_set
*isl_union_set_union(__isl_take isl_union_set
*uset1
,
229 __isl_take isl_union_set
*uset2
)
231 return isl_union_map_union(uset1
, uset2
);
234 __isl_give isl_union_map
*isl_union_map_copy(__isl_keep isl_union_map
*umap
)
243 __isl_give isl_union_set
*isl_union_set_copy(__isl_keep isl_union_set
*uset
)
245 return isl_union_map_copy(uset
);
248 void *isl_union_map_free(__isl_take isl_union_map
*umap
)
256 isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
257 &free_umap_entry
, NULL
);
258 isl_hash_table_clear(&umap
->table
);
259 isl_space_free(umap
->dim
);
264 void *isl_union_set_free(__isl_take isl_union_set
*uset
)
266 return isl_union_map_free(uset
);
269 static int has_dim(const void *entry
, const void *val
)
271 isl_map
*map
= (isl_map
*)entry
;
272 isl_space
*dim
= (isl_space
*)val
;
274 return isl_space_is_equal(map
->dim
, dim
);
277 __isl_give isl_union_map
*isl_union_map_add_map(__isl_take isl_union_map
*umap
,
278 __isl_take isl_map
*map
)
281 struct isl_hash_table_entry
*entry
;
286 if (isl_map_plain_is_empty(map
)) {
291 if (!isl_space_match(map
->dim
, isl_dim_param
, umap
->dim
, isl_dim_param
)) {
292 umap
= isl_union_map_align_params(umap
, isl_map_get_space(map
));
293 map
= isl_map_align_params(map
, isl_union_map_get_space(umap
));
296 umap
= isl_union_map_cow(umap
);
301 hash
= isl_space_get_hash(map
->dim
);
302 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
303 &has_dim
, map
->dim
, 1);
310 entry
->data
= isl_map_union(entry
->data
, isl_map_copy(map
));
319 isl_union_map_free(umap
);
323 __isl_give isl_union_set
*isl_union_set_add_set(__isl_take isl_union_set
*uset
,
324 __isl_take isl_set
*set
)
326 return isl_union_map_add_map(uset
, (isl_map
*)set
);
329 __isl_give isl_union_map
*isl_union_map_from_map(__isl_take isl_map
*map
)
337 dim
= isl_map_get_space(map
);
338 dim
= isl_space_params(dim
);
339 umap
= isl_union_map_empty(dim
);
340 umap
= isl_union_map_add_map(umap
, map
);
345 __isl_give isl_union_set
*isl_union_set_from_set(__isl_take isl_set
*set
)
347 return isl_union_map_from_map((isl_map
*)set
);
350 struct isl_union_map_foreach_data
352 int (*fn
)(__isl_take isl_map
*map
, void *user
);
356 static int call_on_copy(void **entry
, void *user
)
358 isl_map
*map
= *entry
;
359 struct isl_union_map_foreach_data
*data
;
360 data
= (struct isl_union_map_foreach_data
*)user
;
362 return data
->fn(isl_map_copy(map
), data
->user
);
365 int isl_union_map_n_map(__isl_keep isl_union_map
*umap
)
367 return umap
? umap
->table
.n
: 0;
370 int isl_union_set_n_set(__isl_keep isl_union_set
*uset
)
372 return uset
? uset
->table
.n
: 0;
375 int isl_union_map_foreach_map(__isl_keep isl_union_map
*umap
,
376 int (*fn
)(__isl_take isl_map
*map
, void *user
), void *user
)
378 struct isl_union_map_foreach_data data
= { fn
, user
};
383 return isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
384 &call_on_copy
, &data
);
387 static int copy_map(void **entry
, void *user
)
389 isl_map
*map
= *entry
;
390 isl_map
**map_p
= user
;
392 *map_p
= isl_map_copy(map
);
397 __isl_give isl_map
*isl_map_from_union_map(__isl_take isl_union_map
*umap
)
404 ctx
= isl_union_map_get_ctx(umap
);
405 if (umap
->table
.n
!= 1)
406 isl_die(ctx
, isl_error_invalid
,
407 "union map needs to contain elements in exactly "
408 "one space", return isl_union_map_free(umap
));
410 isl_hash_table_foreach(ctx
, &umap
->table
, ©_map
, &map
);
412 isl_union_map_free(umap
);
417 __isl_give isl_set
*isl_set_from_union_set(__isl_take isl_union_set
*uset
)
419 return isl_map_from_union_map(uset
);
422 __isl_give isl_map
*isl_union_map_extract_map(__isl_keep isl_union_map
*umap
,
423 __isl_take isl_space
*dim
)
426 struct isl_hash_table_entry
*entry
;
431 hash
= isl_space_get_hash(dim
);
432 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
435 return isl_map_empty(dim
);
437 return isl_map_copy(entry
->data
);
443 __isl_give isl_set
*isl_union_set_extract_set(__isl_keep isl_union_set
*uset
,
444 __isl_take isl_space
*dim
)
446 return (isl_set
*)isl_union_map_extract_map(uset
, dim
);
449 /* Check if umap contains a map in the given space.
451 __isl_give
int isl_union_map_contains(__isl_keep isl_union_map
*umap
,
452 __isl_keep isl_space
*dim
)
455 struct isl_hash_table_entry
*entry
;
460 hash
= isl_space_get_hash(dim
);
461 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
466 __isl_give
int isl_union_set_contains(__isl_keep isl_union_set
*uset
,
467 __isl_keep isl_space
*dim
)
469 return isl_union_map_contains(uset
, dim
);
472 int isl_union_set_foreach_set(__isl_keep isl_union_set
*uset
,
473 int (*fn
)(__isl_take isl_set
*set
, void *user
), void *user
)
475 return isl_union_map_foreach_map(uset
,
476 (int(*)(__isl_take isl_map
*, void*))fn
, user
);
479 struct isl_union_set_foreach_point_data
{
480 int (*fn
)(__isl_take isl_point
*pnt
, void *user
);
484 static int foreach_point(__isl_take isl_set
*set
, void *user
)
486 struct isl_union_set_foreach_point_data
*data
= user
;
489 r
= isl_set_foreach_point(set
, data
->fn
, data
->user
);
495 int isl_union_set_foreach_point(__isl_keep isl_union_set
*uset
,
496 int (*fn
)(__isl_take isl_point
*pnt
, void *user
), void *user
)
498 struct isl_union_set_foreach_point_data data
= { fn
, user
};
499 return isl_union_set_foreach_set(uset
, &foreach_point
, &data
);
502 struct isl_union_map_gen_bin_data
{
503 isl_union_map
*umap2
;
507 static int subtract_entry(void **entry
, void *user
)
509 struct isl_union_map_gen_bin_data
*data
= user
;
511 struct isl_hash_table_entry
*entry2
;
512 isl_map
*map
= *entry
;
514 hash
= isl_space_get_hash(map
->dim
);
515 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
516 hash
, &has_dim
, map
->dim
, 0);
517 map
= isl_map_copy(map
);
520 map
= isl_map_subtract(map
, isl_map_copy(entry2
->data
));
522 empty
= isl_map_is_empty(map
);
532 data
->res
= isl_union_map_add_map(data
->res
, map
);
537 static __isl_give isl_union_map
*gen_bin_op(__isl_take isl_union_map
*umap1
,
538 __isl_take isl_union_map
*umap2
, int (*fn
)(void **, void *))
540 struct isl_union_map_gen_bin_data data
= { NULL
, NULL
};
542 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
543 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
545 if (!umap1
|| !umap2
)
549 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
551 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
555 isl_union_map_free(umap1
);
556 isl_union_map_free(umap2
);
559 isl_union_map_free(umap1
);
560 isl_union_map_free(umap2
);
561 isl_union_map_free(data
.res
);
565 __isl_give isl_union_map
*isl_union_map_subtract(
566 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
568 return gen_bin_op(umap1
, umap2
, &subtract_entry
);
571 __isl_give isl_union_set
*isl_union_set_subtract(
572 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
574 return isl_union_map_subtract(uset1
, uset2
);
577 struct isl_union_map_gen_bin_set_data
{
582 static int intersect_params_entry(void **entry
, void *user
)
584 struct isl_union_map_gen_bin_set_data
*data
= user
;
585 isl_map
*map
= *entry
;
588 map
= isl_map_copy(map
);
589 map
= isl_map_intersect_params(map
, isl_set_copy(data
->set
));
591 empty
= isl_map_is_empty(map
);
597 data
->res
= isl_union_map_add_map(data
->res
, map
);
602 static __isl_give isl_union_map
*gen_bin_set_op(__isl_take isl_union_map
*umap
,
603 __isl_take isl_set
*set
, int (*fn
)(void **, void *))
605 struct isl_union_map_gen_bin_set_data data
= { NULL
, NULL
};
607 umap
= isl_union_map_align_params(umap
, isl_set_get_space(set
));
608 set
= isl_set_align_params(set
, isl_union_map_get_space(umap
));
614 data
.res
= isl_union_map_alloc(isl_space_copy(umap
->dim
),
616 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
620 isl_union_map_free(umap
);
624 isl_union_map_free(umap
);
626 isl_union_map_free(data
.res
);
630 __isl_give isl_union_map
*isl_union_map_intersect_params(
631 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
633 return gen_bin_set_op(umap
, set
, &intersect_params_entry
);
636 __isl_give isl_union_set
*isl_union_set_intersect_params(
637 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
639 return isl_union_map_intersect_params(uset
, set
);
642 struct isl_union_map_match_bin_data
{
643 isl_union_map
*umap2
;
645 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*);
648 static int match_bin_entry(void **entry
, void *user
)
650 struct isl_union_map_match_bin_data
*data
= user
;
652 struct isl_hash_table_entry
*entry2
;
653 isl_map
*map
= *entry
;
656 hash
= isl_space_get_hash(map
->dim
);
657 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
658 hash
, &has_dim
, map
->dim
, 0);
662 map
= isl_map_copy(map
);
663 map
= data
->fn(map
, isl_map_copy(entry2
->data
));
665 empty
= isl_map_is_empty(map
);
675 data
->res
= isl_union_map_add_map(data
->res
, map
);
680 static __isl_give isl_union_map
*match_bin_op(__isl_take isl_union_map
*umap1
,
681 __isl_take isl_union_map
*umap2
,
682 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*))
684 struct isl_union_map_match_bin_data data
= { NULL
, NULL
, fn
};
686 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
687 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
689 if (!umap1
|| !umap2
)
693 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
695 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
696 &match_bin_entry
, &data
) < 0)
699 isl_union_map_free(umap1
);
700 isl_union_map_free(umap2
);
703 isl_union_map_free(umap1
);
704 isl_union_map_free(umap2
);
705 isl_union_map_free(data
.res
);
709 __isl_give isl_union_map
*isl_union_map_intersect(
710 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
712 return match_bin_op(umap1
, umap2
, &isl_map_intersect
);
715 __isl_give isl_union_set
*isl_union_set_intersect(
716 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
718 return isl_union_map_intersect(uset1
, uset2
);
721 __isl_give isl_union_map
*isl_union_map_gist(__isl_take isl_union_map
*umap
,
722 __isl_take isl_union_map
*context
)
724 return match_bin_op(umap
, context
, &isl_map_gist
);
727 __isl_give isl_union_set
*isl_union_set_gist(__isl_take isl_union_set
*uset
,
728 __isl_take isl_union_set
*context
)
730 return isl_union_map_gist(uset
, context
);
733 static __isl_give isl_map
*lex_le_set(__isl_take isl_map
*set1
,
734 __isl_take isl_map
*set2
)
736 return isl_set_lex_le_set((isl_set
*)set1
, (isl_set
*)set2
);
739 static __isl_give isl_map
*lex_lt_set(__isl_take isl_map
*set1
,
740 __isl_take isl_map
*set2
)
742 return isl_set_lex_lt_set((isl_set
*)set1
, (isl_set
*)set2
);
745 __isl_give isl_union_map
*isl_union_set_lex_lt_union_set(
746 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
748 return match_bin_op(uset1
, uset2
, &lex_lt_set
);
751 __isl_give isl_union_map
*isl_union_set_lex_le_union_set(
752 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
754 return match_bin_op(uset1
, uset2
, &lex_le_set
);
757 __isl_give isl_union_map
*isl_union_set_lex_gt_union_set(
758 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
760 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2
, uset1
));
763 __isl_give isl_union_map
*isl_union_set_lex_ge_union_set(
764 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
766 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2
, uset1
));
769 __isl_give isl_union_map
*isl_union_map_lex_gt_union_map(
770 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
772 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2
, umap1
));
775 __isl_give isl_union_map
*isl_union_map_lex_ge_union_map(
776 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
778 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2
, umap1
));
781 static int intersect_domain_entry(void **entry
, void *user
)
783 struct isl_union_map_gen_bin_data
*data
= user
;
785 struct isl_hash_table_entry
*entry2
;
787 isl_map
*map
= *entry
;
790 dim
= isl_map_get_space(map
);
791 dim
= isl_space_domain(dim
);
792 hash
= isl_space_get_hash(dim
);
793 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
794 hash
, &has_dim
, dim
, 0);
799 map
= isl_map_copy(map
);
800 map
= isl_map_intersect_domain(map
, isl_set_copy(entry2
->data
));
802 empty
= isl_map_is_empty(map
);
812 data
->res
= isl_union_map_add_map(data
->res
, map
);
817 __isl_give isl_union_map
*isl_union_map_intersect_domain(
818 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
820 return gen_bin_op(umap
, uset
, &intersect_domain_entry
);
823 static int intersect_range_entry(void **entry
, void *user
)
825 struct isl_union_map_gen_bin_data
*data
= user
;
827 struct isl_hash_table_entry
*entry2
;
829 isl_map
*map
= *entry
;
832 dim
= isl_map_get_space(map
);
833 dim
= isl_space_range(dim
);
834 hash
= isl_space_get_hash(dim
);
835 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
836 hash
, &has_dim
, dim
, 0);
841 map
= isl_map_copy(map
);
842 map
= isl_map_intersect_range(map
, isl_set_copy(entry2
->data
));
844 empty
= isl_map_is_empty(map
);
854 data
->res
= isl_union_map_add_map(data
->res
, map
);
859 __isl_give isl_union_map
*isl_union_map_intersect_range(
860 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
862 return gen_bin_op(umap
, uset
, &intersect_range_entry
);
865 struct isl_union_map_bin_data
{
866 isl_union_map
*umap2
;
869 int (*fn
)(void **entry
, void *user
);
872 static int apply_range_entry(void **entry
, void *user
)
874 struct isl_union_map_bin_data
*data
= user
;
875 isl_map
*map2
= *entry
;
878 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
879 map2
->dim
, isl_dim_in
))
882 map2
= isl_map_apply_range(isl_map_copy(data
->map
), isl_map_copy(map2
));
884 empty
= isl_map_is_empty(map2
);
894 data
->res
= isl_union_map_add_map(data
->res
, map2
);
899 static int bin_entry(void **entry
, void *user
)
901 struct isl_union_map_bin_data
*data
= user
;
902 isl_map
*map
= *entry
;
905 if (isl_hash_table_foreach(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
912 static __isl_give isl_union_map
*bin_op(__isl_take isl_union_map
*umap1
,
913 __isl_take isl_union_map
*umap2
, int (*fn
)(void **entry
, void *user
))
915 struct isl_union_map_bin_data data
= { NULL
, NULL
, NULL
, fn
};
917 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
918 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
920 if (!umap1
|| !umap2
)
924 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
926 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
927 &bin_entry
, &data
) < 0)
930 isl_union_map_free(umap1
);
931 isl_union_map_free(umap2
);
934 isl_union_map_free(umap1
);
935 isl_union_map_free(umap2
);
936 isl_union_map_free(data
.res
);
940 __isl_give isl_union_map
*isl_union_map_apply_range(
941 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
943 return bin_op(umap1
, umap2
, &apply_range_entry
);
946 __isl_give isl_union_map
*isl_union_map_apply_domain(
947 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
949 umap1
= isl_union_map_reverse(umap1
);
950 umap1
= isl_union_map_apply_range(umap1
, umap2
);
951 return isl_union_map_reverse(umap1
);
954 __isl_give isl_union_set
*isl_union_set_apply(
955 __isl_take isl_union_set
*uset
, __isl_take isl_union_map
*umap
)
957 return isl_union_map_apply_range(uset
, umap
);
960 static int map_lex_lt_entry(void **entry
, void *user
)
962 struct isl_union_map_bin_data
*data
= user
;
963 isl_map
*map2
= *entry
;
965 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
966 map2
->dim
, isl_dim_out
))
969 map2
= isl_map_lex_lt_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
971 data
->res
= isl_union_map_add_map(data
->res
, map2
);
976 __isl_give isl_union_map
*isl_union_map_lex_lt_union_map(
977 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
979 return bin_op(umap1
, umap2
, &map_lex_lt_entry
);
982 static int map_lex_le_entry(void **entry
, void *user
)
984 struct isl_union_map_bin_data
*data
= user
;
985 isl_map
*map2
= *entry
;
987 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
988 map2
->dim
, isl_dim_out
))
991 map2
= isl_map_lex_le_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
993 data
->res
= isl_union_map_add_map(data
->res
, map2
);
998 __isl_give isl_union_map
*isl_union_map_lex_le_union_map(
999 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1001 return bin_op(umap1
, umap2
, &map_lex_le_entry
);
1004 static int product_entry(void **entry
, void *user
)
1006 struct isl_union_map_bin_data
*data
= user
;
1007 isl_map
*map2
= *entry
;
1009 map2
= isl_map_product(isl_map_copy(data
->map
), isl_map_copy(map2
));
1011 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1016 __isl_give isl_union_map
*isl_union_map_product(__isl_take isl_union_map
*umap1
,
1017 __isl_take isl_union_map
*umap2
)
1019 return bin_op(umap1
, umap2
, &product_entry
);
1022 __isl_give isl_union_set
*isl_union_set_product(__isl_take isl_union_set
*uset1
,
1023 __isl_take isl_union_set
*uset2
)
1025 return isl_union_map_product(uset1
, uset2
);
1028 static int range_product_entry(void **entry
, void *user
)
1030 struct isl_union_map_bin_data
*data
= user
;
1031 isl_map
*map2
= *entry
;
1033 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_in
,
1034 map2
->dim
, isl_dim_in
))
1037 map2
= isl_map_range_product(isl_map_copy(data
->map
),
1038 isl_map_copy(map2
));
1040 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1045 __isl_give isl_union_map
*isl_union_map_range_product(
1046 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1048 return bin_op(umap1
, umap2
, &range_product_entry
);
1051 static int flat_range_product_entry(void **entry
, void *user
)
1053 struct isl_union_map_bin_data
*data
= user
;
1054 isl_map
*map2
= *entry
;
1056 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_in
,
1057 map2
->dim
, isl_dim_in
))
1060 map2
= isl_map_flat_range_product(isl_map_copy(data
->map
),
1061 isl_map_copy(map2
));
1063 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1068 __isl_give isl_union_map
*isl_union_map_flat_range_product(
1069 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1071 return bin_op(umap1
, umap2
, &flat_range_product_entry
);
1074 static __isl_give isl_union_set
*cond_un_op(__isl_take isl_union_map
*umap
,
1075 int (*fn
)(void **, void *))
1082 res
= isl_union_map_alloc(isl_space_copy(umap
->dim
), umap
->table
.n
);
1083 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, &res
) < 0)
1086 isl_union_map_free(umap
);
1089 isl_union_map_free(umap
);
1090 isl_union_set_free(res
);
1094 static int from_range_entry(void **entry
, void *user
)
1096 isl_map
*set
= *entry
;
1097 isl_union_set
**res
= user
;
1099 *res
= isl_union_map_add_map(*res
,
1100 isl_map_from_range(isl_set_copy(set
)));
1105 __isl_give isl_union_map
*isl_union_map_from_range(
1106 __isl_take isl_union_set
*uset
)
1108 return cond_un_op(uset
, &from_range_entry
);
1111 __isl_give isl_union_map
*isl_union_map_from_domain(
1112 __isl_take isl_union_set
*uset
)
1114 return isl_union_map_reverse(isl_union_map_from_range(uset
));
1117 __isl_give isl_union_map
*isl_union_map_from_domain_and_range(
1118 __isl_take isl_union_set
*domain
, __isl_take isl_union_set
*range
)
1120 return isl_union_map_apply_range(isl_union_map_from_domain(domain
),
1121 isl_union_map_from_range(range
));
1124 static __isl_give isl_union_map
*un_op(__isl_take isl_union_map
*umap
,
1125 int (*fn
)(void **, void *))
1127 umap
= isl_union_map_cow(umap
);
1131 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, NULL
) < 0)
1136 isl_union_map_free(umap
);
1140 static int affine_entry(void **entry
, void *user
)
1142 isl_map
**map
= (isl_map
**)entry
;
1144 *map
= isl_map_from_basic_map(isl_map_affine_hull(*map
));
1146 return *map
? 0 : -1;
1149 __isl_give isl_union_map
*isl_union_map_affine_hull(
1150 __isl_take isl_union_map
*umap
)
1152 return un_op(umap
, &affine_entry
);
1155 __isl_give isl_union_set
*isl_union_set_affine_hull(
1156 __isl_take isl_union_set
*uset
)
1158 return isl_union_map_affine_hull(uset
);
1161 static int polyhedral_entry(void **entry
, void *user
)
1163 isl_map
**map
= (isl_map
**)entry
;
1165 *map
= isl_map_from_basic_map(isl_map_polyhedral_hull(*map
));
1167 return *map
? 0 : -1;
1170 __isl_give isl_union_map
*isl_union_map_polyhedral_hull(
1171 __isl_take isl_union_map
*umap
)
1173 return un_op(umap
, &polyhedral_entry
);
1176 __isl_give isl_union_set
*isl_union_set_polyhedral_hull(
1177 __isl_take isl_union_set
*uset
)
1179 return isl_union_map_polyhedral_hull(uset
);
1182 static int simple_entry(void **entry
, void *user
)
1184 isl_map
**map
= (isl_map
**)entry
;
1186 *map
= isl_map_from_basic_map(isl_map_simple_hull(*map
));
1188 return *map
? 0 : -1;
1191 __isl_give isl_union_map
*isl_union_map_simple_hull(
1192 __isl_take isl_union_map
*umap
)
1194 return un_op(umap
, &simple_entry
);
1197 __isl_give isl_union_set
*isl_union_set_simple_hull(
1198 __isl_take isl_union_set
*uset
)
1200 return isl_union_map_simple_hull(uset
);
1203 static int inplace_entry(void **entry
, void *user
)
1205 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*);
1206 isl_map
**map
= (isl_map
**)entry
;
1209 fn
= *(__isl_give isl_map
*(**)(__isl_take isl_map
*)) user
;
1210 copy
= fn(isl_map_copy(*map
));
1220 static __isl_give isl_union_map
*inplace(__isl_take isl_union_map
*umap
,
1221 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
1226 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1227 &inplace_entry
, &fn
) < 0)
1232 isl_union_map_free(umap
);
1236 __isl_give isl_union_map
*isl_union_map_coalesce(
1237 __isl_take isl_union_map
*umap
)
1239 return inplace(umap
, &isl_map_coalesce
);
1242 __isl_give isl_union_set
*isl_union_set_coalesce(
1243 __isl_take isl_union_set
*uset
)
1245 return isl_union_map_coalesce(uset
);
1248 __isl_give isl_union_map
*isl_union_map_detect_equalities(
1249 __isl_take isl_union_map
*umap
)
1251 return inplace(umap
, &isl_map_detect_equalities
);
1254 __isl_give isl_union_set
*isl_union_set_detect_equalities(
1255 __isl_take isl_union_set
*uset
)
1257 return isl_union_map_detect_equalities(uset
);
1260 __isl_give isl_union_map
*isl_union_map_compute_divs(
1261 __isl_take isl_union_map
*umap
)
1263 return inplace(umap
, &isl_map_compute_divs
);
1266 __isl_give isl_union_set
*isl_union_set_compute_divs(
1267 __isl_take isl_union_set
*uset
)
1269 return isl_union_map_compute_divs(uset
);
1272 static int lexmin_entry(void **entry
, void *user
)
1274 isl_map
**map
= (isl_map
**)entry
;
1276 *map
= isl_map_lexmin(*map
);
1278 return *map
? 0 : -1;
1281 __isl_give isl_union_map
*isl_union_map_lexmin(
1282 __isl_take isl_union_map
*umap
)
1284 return un_op(umap
, &lexmin_entry
);
1287 __isl_give isl_union_set
*isl_union_set_lexmin(
1288 __isl_take isl_union_set
*uset
)
1290 return isl_union_map_lexmin(uset
);
1293 static int lexmax_entry(void **entry
, void *user
)
1295 isl_map
**map
= (isl_map
**)entry
;
1297 *map
= isl_map_lexmax(*map
);
1299 return *map
? 0 : -1;
1302 __isl_give isl_union_map
*isl_union_map_lexmax(
1303 __isl_take isl_union_map
*umap
)
1305 return un_op(umap
, &lexmax_entry
);
1308 __isl_give isl_union_set
*isl_union_set_lexmax(
1309 __isl_take isl_union_set
*uset
)
1311 return isl_union_map_lexmax(uset
);
1314 static int universe_entry(void **entry
, void *user
)
1316 isl_map
*map
= *entry
;
1317 isl_union_map
**res
= user
;
1319 map
= isl_map_universe(isl_map_get_space(map
));
1320 *res
= isl_union_map_add_map(*res
, map
);
1325 __isl_give isl_union_map
*isl_union_map_universe(__isl_take isl_union_map
*umap
)
1327 return cond_un_op(umap
, &universe_entry
);
1330 __isl_give isl_union_set
*isl_union_set_universe(__isl_take isl_union_set
*uset
)
1332 return isl_union_map_universe(uset
);
1335 static int reverse_entry(void **entry
, void *user
)
1337 isl_map
*map
= *entry
;
1338 isl_union_map
**res
= user
;
1340 *res
= isl_union_map_add_map(*res
, isl_map_reverse(isl_map_copy(map
)));
1345 __isl_give isl_union_map
*isl_union_map_reverse(__isl_take isl_union_map
*umap
)
1347 return cond_un_op(umap
, &reverse_entry
);
1350 static int domain_entry(void **entry
, void *user
)
1352 isl_map
*map
= *entry
;
1353 isl_union_set
**res
= user
;
1355 *res
= isl_union_set_add_set(*res
, isl_map_domain(isl_map_copy(map
)));
1360 __isl_give isl_union_set
*isl_union_map_domain(__isl_take isl_union_map
*umap
)
1362 return cond_un_op(umap
, &domain_entry
);
1365 static int range_entry(void **entry
, void *user
)
1367 isl_map
*map
= *entry
;
1368 isl_union_set
**res
= user
;
1370 *res
= isl_union_set_add_set(*res
, isl_map_range(isl_map_copy(map
)));
1375 __isl_give isl_union_set
*isl_union_map_range(__isl_take isl_union_map
*umap
)
1377 return cond_un_op(umap
, &range_entry
);
1380 static int domain_map_entry(void **entry
, void *user
)
1382 isl_map
*map
= *entry
;
1383 isl_union_set
**res
= user
;
1385 *res
= isl_union_map_add_map(*res
,
1386 isl_map_domain_map(isl_map_copy(map
)));
1391 __isl_give isl_union_map
*isl_union_map_domain_map(
1392 __isl_take isl_union_map
*umap
)
1394 return cond_un_op(umap
, &domain_map_entry
);
1397 static int range_map_entry(void **entry
, void *user
)
1399 isl_map
*map
= *entry
;
1400 isl_union_set
**res
= user
;
1402 *res
= isl_union_map_add_map(*res
,
1403 isl_map_range_map(isl_map_copy(map
)));
1408 __isl_give isl_union_map
*isl_union_map_range_map(
1409 __isl_take isl_union_map
*umap
)
1411 return cond_un_op(umap
, &range_map_entry
);
1414 static int deltas_entry(void **entry
, void *user
)
1416 isl_map
*map
= *entry
;
1417 isl_union_set
**res
= user
;
1419 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1422 *res
= isl_union_set_add_set(*res
, isl_map_deltas(isl_map_copy(map
)));
1427 __isl_give isl_union_set
*isl_union_map_deltas(__isl_take isl_union_map
*umap
)
1429 return cond_un_op(umap
, &deltas_entry
);
1432 static int deltas_map_entry(void **entry
, void *user
)
1434 isl_map
*map
= *entry
;
1435 isl_union_map
**res
= user
;
1437 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1440 *res
= isl_union_map_add_map(*res
,
1441 isl_map_deltas_map(isl_map_copy(map
)));
1446 __isl_give isl_union_map
*isl_union_map_deltas_map(
1447 __isl_take isl_union_map
*umap
)
1449 return cond_un_op(umap
, &deltas_map_entry
);
1452 static int identity_entry(void **entry
, void *user
)
1454 isl_set
*set
= *entry
;
1455 isl_union_map
**res
= user
;
1457 *res
= isl_union_map_add_map(*res
, isl_set_identity(isl_set_copy(set
)));
1462 __isl_give isl_union_map
*isl_union_set_identity(__isl_take isl_union_set
*uset
)
1464 return cond_un_op(uset
, &identity_entry
);
1467 static int unwrap_entry(void **entry
, void *user
)
1469 isl_set
*set
= *entry
;
1470 isl_union_set
**res
= user
;
1472 if (!isl_set_is_wrapping(set
))
1475 *res
= isl_union_map_add_map(*res
, isl_set_unwrap(isl_set_copy(set
)));
1480 __isl_give isl_union_map
*isl_union_set_unwrap(__isl_take isl_union_set
*uset
)
1482 return cond_un_op(uset
, &unwrap_entry
);
1485 static int wrap_entry(void **entry
, void *user
)
1487 isl_map
*map
= *entry
;
1488 isl_union_set
**res
= user
;
1490 *res
= isl_union_set_add_set(*res
, isl_map_wrap(isl_map_copy(map
)));
1495 __isl_give isl_union_set
*isl_union_map_wrap(__isl_take isl_union_map
*umap
)
1497 return cond_un_op(umap
, &wrap_entry
);
1500 struct isl_union_map_is_subset_data
{
1501 isl_union_map
*umap2
;
1505 static int is_subset_entry(void **entry
, void *user
)
1507 struct isl_union_map_is_subset_data
*data
= user
;
1509 struct isl_hash_table_entry
*entry2
;
1510 isl_map
*map
= *entry
;
1512 hash
= isl_space_get_hash(map
->dim
);
1513 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1514 hash
, &has_dim
, map
->dim
, 0);
1516 data
->is_subset
= 0;
1520 data
->is_subset
= isl_map_is_subset(map
, entry2
->data
);
1521 if (data
->is_subset
< 0 || !data
->is_subset
)
1527 int isl_union_map_is_subset(__isl_keep isl_union_map
*umap1
,
1528 __isl_keep isl_union_map
*umap2
)
1530 struct isl_union_map_is_subset_data data
= { NULL
, 1 };
1532 umap1
= isl_union_map_copy(umap1
);
1533 umap2
= isl_union_map_copy(umap2
);
1534 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1535 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1537 if (!umap1
|| !umap2
)
1541 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1542 &is_subset_entry
, &data
) < 0 &&
1546 isl_union_map_free(umap1
);
1547 isl_union_map_free(umap2
);
1549 return data
.is_subset
;
1551 isl_union_map_free(umap1
);
1552 isl_union_map_free(umap2
);
1556 int isl_union_set_is_subset(__isl_keep isl_union_set
*uset1
,
1557 __isl_keep isl_union_set
*uset2
)
1559 return isl_union_map_is_subset(uset1
, uset2
);
1562 int isl_union_map_is_equal(__isl_keep isl_union_map
*umap1
,
1563 __isl_keep isl_union_map
*umap2
)
1567 if (!umap1
|| !umap2
)
1569 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1572 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1576 int isl_union_set_is_equal(__isl_keep isl_union_set
*uset1
,
1577 __isl_keep isl_union_set
*uset2
)
1579 return isl_union_map_is_equal(uset1
, uset2
);
1582 int isl_union_map_is_strict_subset(__isl_keep isl_union_map
*umap1
,
1583 __isl_keep isl_union_map
*umap2
)
1587 if (!umap1
|| !umap2
)
1589 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1592 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1593 if (is_subset
== -1)
1598 int isl_union_set_is_strict_subset(__isl_keep isl_union_set
*uset1
,
1599 __isl_keep isl_union_set
*uset2
)
1601 return isl_union_map_is_strict_subset(uset1
, uset2
);
1604 static int sample_entry(void **entry
, void *user
)
1606 isl_basic_map
**sample
= (isl_basic_map
**)user
;
1607 isl_map
*map
= *entry
;
1609 *sample
= isl_map_sample(isl_map_copy(map
));
1612 if (!isl_basic_map_plain_is_empty(*sample
))
1617 __isl_give isl_basic_map
*isl_union_map_sample(__isl_take isl_union_map
*umap
)
1619 isl_basic_map
*sample
= NULL
;
1624 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1625 &sample_entry
, &sample
) < 0 &&
1630 sample
= isl_basic_map_empty(isl_union_map_get_space(umap
));
1632 isl_union_map_free(umap
);
1636 isl_union_map_free(umap
);
1640 __isl_give isl_basic_set
*isl_union_set_sample(__isl_take isl_union_set
*uset
)
1642 return (isl_basic_set
*)isl_union_map_sample(uset
);
1645 struct isl_forall_data
{
1647 int (*fn
)(__isl_keep isl_map
*map
);
1650 static int forall_entry(void **entry
, void *user
)
1652 struct isl_forall_data
*data
= user
;
1653 isl_map
*map
= *entry
;
1655 data
->res
= data
->fn(map
);
1665 static int union_map_forall(__isl_keep isl_union_map
*umap
,
1666 int (*fn
)(__isl_keep isl_map
*map
))
1668 struct isl_forall_data data
= { 1, fn
};
1673 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1674 &forall_entry
, &data
) < 0 && data
.res
)
1680 struct isl_forall_user_data
{
1682 int (*fn
)(__isl_keep isl_map
*map
, void *user
);
1686 static int forall_user_entry(void **entry
, void *user
)
1688 struct isl_forall_user_data
*data
= user
;
1689 isl_map
*map
= *entry
;
1691 data
->res
= data
->fn(map
, data
->user
);
1701 /* Check if fn(map, user) returns true for all maps "map" in umap.
1703 static int union_map_forall_user(__isl_keep isl_union_map
*umap
,
1704 int (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
1706 struct isl_forall_user_data data
= { 1, fn
, user
};
1711 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1712 &forall_user_entry
, &data
) < 0 && data
.res
)
1718 int isl_union_map_is_empty(__isl_keep isl_union_map
*umap
)
1720 return union_map_forall(umap
, &isl_map_is_empty
);
1723 int isl_union_set_is_empty(__isl_keep isl_union_set
*uset
)
1725 return isl_union_map_is_empty(uset
);
1728 static int is_subset_of_identity(__isl_keep isl_map
*map
)
1737 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1740 dim
= isl_map_get_space(map
);
1741 id
= isl_map_identity(dim
);
1743 is_subset
= isl_map_is_subset(map
, id
);
1750 /* Check if the given map is single-valued.
1755 * and check if the result is a subset of the identity mapping.
1757 int isl_union_map_is_single_valued(__isl_keep isl_union_map
*umap
)
1759 isl_union_map
*test
;
1762 if (isl_union_map_n_map(umap
) == 1) {
1764 umap
= isl_union_map_copy(umap
);
1765 map
= isl_map_from_union_map(umap
);
1766 sv
= isl_map_is_single_valued(map
);
1771 test
= isl_union_map_reverse(isl_union_map_copy(umap
));
1772 test
= isl_union_map_apply_range(test
, isl_union_map_copy(umap
));
1774 sv
= union_map_forall(test
, &is_subset_of_identity
);
1776 isl_union_map_free(test
);
1781 int isl_union_map_is_injective(__isl_keep isl_union_map
*umap
)
1785 umap
= isl_union_map_copy(umap
);
1786 umap
= isl_union_map_reverse(umap
);
1787 in
= isl_union_map_is_single_valued(umap
);
1788 isl_union_map_free(umap
);
1793 /* Represents a map that has a fixed value (v) for one of its
1795 * The map in this structure is not reference counted, so it
1796 * is only valid while the isl_union_map from which it was
1797 * obtained is still alive.
1799 struct isl_fixed_map
{
1804 static struct isl_fixed_map
*alloc_isl_fixed_map_array(isl_ctx
*ctx
,
1808 struct isl_fixed_map
*v
;
1810 v
= isl_calloc_array(ctx
, struct isl_fixed_map
, n
);
1813 for (i
= 0; i
< n
; ++i
)
1814 isl_int_init(v
[i
].v
);
1818 static void free_isl_fixed_map_array(struct isl_fixed_map
*v
, int n
)
1824 for (i
= 0; i
< n
; ++i
)
1825 isl_int_clear(v
[i
].v
);
1829 /* Compare the "v" field of two isl_fixed_map structs.
1831 static int qsort_fixed_map_cmp(const void *p1
, const void *p2
)
1833 const struct isl_fixed_map
*e1
= (const struct isl_fixed_map
*) p1
;
1834 const struct isl_fixed_map
*e2
= (const struct isl_fixed_map
*) p2
;
1836 return isl_int_cmp(e1
->v
, e2
->v
);
1839 /* Internal data structure used while checking whether all maps
1840 * in a union_map have a fixed value for a given output dimension.
1841 * v is the list of maps, with the fixed value for the dimension
1842 * n is the number of maps considered so far
1843 * pos is the output dimension under investigation
1845 struct isl_fixed_dim_data
{
1846 struct isl_fixed_map
*v
;
1851 static int fixed_at_pos(__isl_keep isl_map
*map
, void *user
)
1853 struct isl_fixed_dim_data
*data
= user
;
1855 data
->v
[data
->n
].map
= map
;
1856 return isl_map_plain_is_fixed(map
, isl_dim_out
, data
->pos
,
1857 &data
->v
[data
->n
++].v
);
1860 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
1861 int first
, int n_range
);
1863 /* Given a list of the maps, with their fixed values at output dimension "pos",
1864 * check whether the ranges of the maps form an obvious partition.
1866 * We first sort the maps according to their fixed values.
1867 * If all maps have a different value, then we know the ranges form
1869 * Otherwise, we collect the maps with the same fixed value and
1870 * check whether each such collection is obviously injective
1871 * based on later dimensions.
1873 static int separates(struct isl_fixed_map
*v
, int n
,
1874 __isl_take isl_space
*dim
, int pos
, int n_range
)
1881 qsort(v
, n
, sizeof(*v
), &qsort_fixed_map_cmp
);
1883 for (i
= 0; i
+ 1 < n
; ++i
) {
1885 isl_union_map
*part
;
1888 for (j
= i
+ 1; j
< n
; ++j
)
1889 if (isl_int_ne(v
[i
].v
, v
[j
].v
))
1895 part
= isl_union_map_alloc(isl_space_copy(dim
), j
- i
);
1896 for (k
= i
; k
< j
; ++k
)
1897 part
= isl_union_map_add_map(part
,
1898 isl_map_copy(v
[k
].map
));
1900 injective
= plain_injective_on_range(part
, pos
+ 1, n_range
);
1909 isl_space_free(dim
);
1910 free_isl_fixed_map_array(v
, n
);
1913 isl_space_free(dim
);
1914 free_isl_fixed_map_array(v
, n
);
1918 /* Check whether the maps in umap have obviously distinct ranges.
1919 * In particular, check for an output dimension in the range
1920 * [first,n_range) for which all maps have a fixed value
1921 * and then check if these values, possibly along with fixed values
1922 * at later dimensions, entail distinct ranges.
1924 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
1925 int first
, int n_range
)
1929 struct isl_fixed_dim_data data
= { NULL
};
1931 ctx
= isl_union_map_get_ctx(umap
);
1936 n
= isl_union_map_n_map(umap
);
1938 isl_union_map_free(umap
);
1942 if (first
>= n_range
) {
1943 isl_union_map_free(umap
);
1947 data
.v
= alloc_isl_fixed_map_array(ctx
, n
);
1951 for (data
.pos
= first
; data
.pos
< n_range
; ++data
.pos
) {
1957 fixed
= union_map_forall_user(umap
, &fixed_at_pos
, &data
);
1962 dim
= isl_union_map_get_space(umap
);
1963 injective
= separates(data
.v
, n
, dim
, data
.pos
, n_range
);
1964 isl_union_map_free(umap
);
1968 free_isl_fixed_map_array(data
.v
, n
);
1969 isl_union_map_free(umap
);
1973 free_isl_fixed_map_array(data
.v
, n
);
1974 isl_union_map_free(umap
);
1978 /* Check whether the maps in umap that map to subsets of "ran"
1979 * have obviously distinct ranges.
1981 static int plain_injective_on_range_wrap(__isl_keep isl_set
*ran
, void *user
)
1983 isl_union_map
*umap
= user
;
1985 umap
= isl_union_map_copy(umap
);
1986 umap
= isl_union_map_intersect_range(umap
,
1987 isl_union_set_from_set(isl_set_copy(ran
)));
1988 return plain_injective_on_range(umap
, 0, isl_set_dim(ran
, isl_dim_set
));
1991 /* Check if the given union_map is obviously injective.
1993 * In particular, we first check if all individual maps are obviously
1994 * injective and then check if all the ranges of these maps are
1995 * obviously disjoint.
1997 int isl_union_map_plain_is_injective(__isl_keep isl_union_map
*umap
)
2000 isl_union_map
*univ
;
2003 in
= union_map_forall(umap
, &isl_map_plain_is_injective
);
2009 univ
= isl_union_map_universe(isl_union_map_copy(umap
));
2010 ran
= isl_union_map_range(univ
);
2012 in
= union_map_forall_user(ran
, &plain_injective_on_range_wrap
, umap
);
2014 isl_union_set_free(ran
);
2019 int isl_union_map_is_bijective(__isl_keep isl_union_map
*umap
)
2023 sv
= isl_union_map_is_single_valued(umap
);
2027 return isl_union_map_is_injective(umap
);
2030 static int zip_entry(void **entry
, void *user
)
2032 isl_map
*map
= *entry
;
2033 isl_union_map
**res
= user
;
2035 if (!isl_map_can_zip(map
))
2038 *res
= isl_union_map_add_map(*res
, isl_map_zip(isl_map_copy(map
)));
2043 __isl_give isl_union_map
*isl_union_map_zip(__isl_take isl_union_map
*umap
)
2045 return cond_un_op(umap
, &zip_entry
);
2048 static int lift_entry(void **entry
, void *user
)
2050 isl_set
*set
= *entry
;
2051 isl_union_set
**res
= user
;
2053 *res
= isl_union_set_add_set(*res
, isl_set_lift(isl_set_copy(set
)));
2058 __isl_give isl_union_set
*isl_union_set_lift(__isl_take isl_union_set
*uset
)
2060 return cond_un_op(uset
, &lift_entry
);
2063 static int coefficients_entry(void **entry
, void *user
)
2065 isl_set
*set
= *entry
;
2066 isl_union_set
**res
= user
;
2068 set
= isl_set_copy(set
);
2069 set
= isl_set_from_basic_set(isl_set_coefficients(set
));
2070 *res
= isl_union_set_add_set(*res
, set
);
2075 __isl_give isl_union_set
*isl_union_set_coefficients(
2076 __isl_take isl_union_set
*uset
)
2085 ctx
= isl_union_set_get_ctx(uset
);
2086 dim
= isl_space_set_alloc(ctx
, 0, 0);
2087 res
= isl_union_map_alloc(dim
, uset
->table
.n
);
2088 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2089 &coefficients_entry
, &res
) < 0)
2092 isl_union_set_free(uset
);
2095 isl_union_set_free(uset
);
2096 isl_union_set_free(res
);
2100 static int solutions_entry(void **entry
, void *user
)
2102 isl_set
*set
= *entry
;
2103 isl_union_set
**res
= user
;
2105 set
= isl_set_copy(set
);
2106 set
= isl_set_from_basic_set(isl_set_solutions(set
));
2108 *res
= isl_union_set_from_set(set
);
2110 *res
= isl_union_set_add_set(*res
, set
);
2118 __isl_give isl_union_set
*isl_union_set_solutions(
2119 __isl_take isl_union_set
*uset
)
2121 isl_union_set
*res
= NULL
;
2126 if (uset
->table
.n
== 0) {
2127 res
= isl_union_set_empty(isl_union_set_get_space(uset
));
2128 isl_union_set_free(uset
);
2132 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2133 &solutions_entry
, &res
) < 0)
2136 isl_union_set_free(uset
);
2139 isl_union_set_free(uset
);
2140 isl_union_set_free(res
);