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,
11 #include <isl_map_private.h>
16 #include <isl_dim_private.h>
17 #include <isl_union_map_private.h>
18 #include <isl/union_set.h>
20 static __isl_give isl_union_map
*isl_union_map_alloc(__isl_take isl_dim
*dim
,
28 umap
= isl_calloc_type(dim
->ctx
, isl_union_map
);
34 if (isl_hash_table_init(dim
->ctx
, &umap
->table
, size
) < 0)
40 isl_union_map_free(umap
);
44 __isl_give isl_union_map
*isl_union_map_empty(__isl_take isl_dim
*dim
)
46 return isl_union_map_alloc(dim
, 16);
49 __isl_give isl_union_set
*isl_union_set_empty(__isl_take isl_dim
*dim
)
51 return isl_union_map_empty(dim
);
54 isl_ctx
*isl_union_map_get_ctx(__isl_keep isl_union_map
*umap
)
56 return umap
? umap
->dim
->ctx
: NULL
;
59 isl_ctx
*isl_union_set_get_ctx(__isl_keep isl_union_set
*uset
)
61 return uset
? uset
->dim
->ctx
: NULL
;
64 __isl_give isl_dim
*isl_union_map_get_dim(__isl_keep isl_union_map
*umap
)
68 return isl_dim_copy(umap
->dim
);
71 __isl_give isl_dim
*isl_union_set_get_dim(__isl_keep isl_union_set
*uset
)
73 return isl_union_map_get_dim(uset
);
76 static int free_umap_entry(void **entry
, void *user
)
78 isl_map
*map
= *entry
;
83 static int add_map(__isl_take isl_map
*map
, void *user
)
85 isl_union_map
**umap
= (isl_union_map
**)user
;
87 *umap
= isl_union_map_add_map(*umap
, map
);
92 __isl_give isl_union_map
*isl_union_map_dup(__isl_keep isl_union_map
*umap
)
99 dup
= isl_union_map_empty(isl_dim_copy(umap
->dim
));
100 if (isl_union_map_foreach_map(umap
, &add_map
, &dup
) < 0)
104 isl_union_map_free(dup
);
108 __isl_give isl_union_map
*isl_union_map_cow(__isl_take isl_union_map
*umap
)
116 return isl_union_map_dup(umap
);
119 struct isl_union_align
{
124 static int align_entry(void **entry
, void *user
)
126 isl_map
*map
= *entry
;
128 struct isl_union_align
*data
= user
;
130 exp
= isl_reordering_extend_dim(isl_reordering_copy(data
->exp
),
131 isl_map_get_dim(map
));
133 data
->res
= isl_union_map_add_map(data
->res
,
134 isl_map_realign(isl_map_copy(map
), exp
));
139 /* Align the parameters of umap along those of model.
140 * The result has the parameters of model first, in the same order
141 * as they appear in model, followed by any remaining parameters of
142 * umap that do not appear in model.
144 __isl_give isl_union_map
*isl_union_map_align_params(
145 __isl_take isl_union_map
*umap
, __isl_take isl_dim
*model
)
147 struct isl_union_align data
= { NULL
, NULL
};
152 if (isl_dim_match(umap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
157 data
.exp
= isl_parameter_alignment_reordering(umap
->dim
, model
);
161 data
.res
= isl_union_map_alloc(isl_dim_copy(data
.exp
->dim
),
163 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
164 &align_entry
, &data
) < 0)
167 isl_reordering_free(data
.exp
);
168 isl_union_map_free(umap
);
172 isl_reordering_free(data
.exp
);
173 isl_union_map_free(umap
);
174 isl_union_map_free(data
.res
);
179 __isl_give isl_union_set
*isl_union_set_align_params(
180 __isl_take isl_union_set
*uset
, __isl_take isl_dim
*model
)
182 return isl_union_map_align_params(uset
, model
);
185 __isl_give isl_union_map
*isl_union_map_union(__isl_take isl_union_map
*umap1
,
186 __isl_take isl_union_map
*umap2
)
188 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_dim(umap2
));
189 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_dim(umap1
));
191 umap1
= isl_union_map_cow(umap1
);
193 if (!umap1
|| !umap2
)
196 if (isl_union_map_foreach_map(umap2
, &add_map
, &umap1
) < 0)
199 isl_union_map_free(umap2
);
203 isl_union_map_free(umap1
);
204 isl_union_map_free(umap2
);
208 __isl_give isl_union_set
*isl_union_set_union(__isl_take isl_union_set
*uset1
,
209 __isl_take isl_union_set
*uset2
)
211 return isl_union_map_union(uset1
, uset2
);
214 __isl_give isl_union_map
*isl_union_map_copy(__isl_keep isl_union_map
*umap
)
223 __isl_give isl_union_set
*isl_union_set_copy(__isl_keep isl_union_set
*uset
)
225 return isl_union_map_copy(uset
);
228 void *isl_union_map_free(__isl_take isl_union_map
*umap
)
236 isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
237 &free_umap_entry
, NULL
);
238 isl_hash_table_clear(&umap
->table
);
239 isl_dim_free(umap
->dim
);
244 void *isl_union_set_free(__isl_take isl_union_set
*uset
)
246 return isl_union_map_free(uset
);
249 static int has_dim(const void *entry
, const void *val
)
251 isl_map
*map
= (isl_map
*)entry
;
252 isl_dim
*dim
= (isl_dim
*)val
;
254 return isl_dim_equal(map
->dim
, dim
);
257 __isl_give isl_union_map
*isl_union_map_add_map(__isl_take isl_union_map
*umap
,
258 __isl_take isl_map
*map
)
261 struct isl_hash_table_entry
*entry
;
263 if (isl_map_plain_is_empty(map
)) {
268 umap
= isl_union_map_cow(umap
);
273 isl_assert(map
->ctx
, isl_dim_match(map
->dim
, isl_dim_param
, umap
->dim
,
274 isl_dim_param
), goto error
);
276 hash
= isl_dim_get_hash(map
->dim
);
277 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
278 &has_dim
, map
->dim
, 1);
285 entry
->data
= isl_map_union(entry
->data
, isl_map_copy(map
));
294 isl_union_map_free(umap
);
298 __isl_give isl_union_set
*isl_union_set_add_set(__isl_take isl_union_set
*uset
,
299 __isl_take isl_set
*set
)
301 return isl_union_map_add_map(uset
, (isl_map
*)set
);
304 __isl_give isl_union_map
*isl_union_map_from_map(__isl_take isl_map
*map
)
312 dim
= isl_map_get_dim(map
);
313 dim
= isl_dim_drop(dim
, isl_dim_in
, 0, isl_dim_size(dim
, isl_dim_in
));
314 dim
= isl_dim_drop(dim
, isl_dim_out
, 0, isl_dim_size(dim
, isl_dim_out
));
315 umap
= isl_union_map_empty(dim
);
316 umap
= isl_union_map_add_map(umap
, map
);
321 __isl_give isl_union_set
*isl_union_set_from_set(__isl_take isl_set
*set
)
323 return isl_union_map_from_map((isl_map
*)set
);
326 struct isl_union_map_foreach_data
328 int (*fn
)(__isl_take isl_map
*map
, void *user
);
332 static int call_on_copy(void **entry
, void *user
)
334 isl_map
*map
= *entry
;
335 struct isl_union_map_foreach_data
*data
;
336 data
= (struct isl_union_map_foreach_data
*)user
;
338 return data
->fn(isl_map_copy(map
), data
->user
);
341 int isl_union_map_n_map(__isl_keep isl_union_map
*umap
)
343 return umap
? umap
->table
.n
: 0;
346 int isl_union_set_n_set(__isl_keep isl_union_set
*uset
)
348 return uset
? uset
->table
.n
: 0;
351 int isl_union_map_foreach_map(__isl_keep isl_union_map
*umap
,
352 int (*fn
)(__isl_take isl_map
*map
, void *user
), void *user
)
354 struct isl_union_map_foreach_data data
= { fn
, user
};
359 return isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
360 &call_on_copy
, &data
);
363 static int copy_map(void **entry
, void *user
)
365 isl_map
*map
= *entry
;
366 isl_map
**map_p
= user
;
368 *map_p
= isl_map_copy(map
);
373 __isl_give isl_map
*isl_map_from_union_map(__isl_take isl_union_map
*umap
)
380 ctx
= isl_union_map_get_ctx(umap
);
381 if (umap
->table
.n
!= 1)
382 isl_die(ctx
, isl_error_invalid
,
383 "union map needs to contain elements in exactly "
384 "one space", return isl_union_map_free(umap
));
386 isl_hash_table_foreach(ctx
, &umap
->table
, ©_map
, &map
);
388 isl_union_map_free(umap
);
393 __isl_give isl_set
*isl_set_from_union_set(__isl_take isl_union_set
*uset
)
395 return isl_map_from_union_map(uset
);
398 __isl_give isl_map
*isl_union_map_extract_map(__isl_keep isl_union_map
*umap
,
399 __isl_take isl_dim
*dim
)
402 struct isl_hash_table_entry
*entry
;
407 hash
= isl_dim_get_hash(dim
);
408 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
411 return isl_map_empty(dim
);
413 return isl_map_copy(entry
->data
);
419 __isl_give isl_set
*isl_union_set_extract_set(__isl_keep isl_union_set
*uset
,
420 __isl_take isl_dim
*dim
)
422 return (isl_set
*)isl_union_map_extract_map(uset
, dim
);
425 /* Check if umap contains a map in the given space.
427 __isl_give
int isl_union_map_contains(__isl_keep isl_union_map
*umap
,
428 __isl_keep isl_dim
*dim
)
431 struct isl_hash_table_entry
*entry
;
436 hash
= isl_dim_get_hash(dim
);
437 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
442 __isl_give
int isl_union_set_contains(__isl_keep isl_union_set
*uset
,
443 __isl_keep isl_dim
*dim
)
445 return isl_union_map_contains(uset
, dim
);
448 int isl_union_set_foreach_set(__isl_keep isl_union_set
*uset
,
449 int (*fn
)(__isl_take isl_set
*set
, void *user
), void *user
)
451 return isl_union_map_foreach_map(uset
,
452 (int(*)(__isl_take isl_map
*, void*))fn
, user
);
455 struct isl_union_set_foreach_point_data
{
456 int (*fn
)(__isl_take isl_point
*pnt
, void *user
);
460 static int foreach_point(__isl_take isl_set
*set
, void *user
)
462 struct isl_union_set_foreach_point_data
*data
= user
;
465 r
= isl_set_foreach_point(set
, data
->fn
, data
->user
);
471 int isl_union_set_foreach_point(__isl_keep isl_union_set
*uset
,
472 int (*fn
)(__isl_take isl_point
*pnt
, void *user
), void *user
)
474 struct isl_union_set_foreach_point_data data
= { fn
, user
};
475 return isl_union_set_foreach_set(uset
, &foreach_point
, &data
);
478 struct isl_union_map_gen_bin_data
{
479 isl_union_map
*umap2
;
483 static int subtract_entry(void **entry
, void *user
)
485 struct isl_union_map_gen_bin_data
*data
= user
;
487 struct isl_hash_table_entry
*entry2
;
488 isl_map
*map
= *entry
;
490 hash
= isl_dim_get_hash(map
->dim
);
491 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
492 hash
, &has_dim
, map
->dim
, 0);
493 map
= isl_map_copy(map
);
496 map
= isl_map_subtract(map
, isl_map_copy(entry2
->data
));
498 empty
= isl_map_is_empty(map
);
508 data
->res
= isl_union_map_add_map(data
->res
, map
);
513 static __isl_give isl_union_map
*gen_bin_op(__isl_take isl_union_map
*umap1
,
514 __isl_take isl_union_map
*umap2
, int (*fn
)(void **, void *))
516 struct isl_union_map_gen_bin_data data
= { NULL
, NULL
};
518 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_dim(umap2
));
519 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_dim(umap1
));
521 if (!umap1
|| !umap2
)
525 data
.res
= isl_union_map_alloc(isl_dim_copy(umap1
->dim
),
527 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
531 isl_union_map_free(umap1
);
532 isl_union_map_free(umap2
);
535 isl_union_map_free(umap1
);
536 isl_union_map_free(umap2
);
537 isl_union_map_free(data
.res
);
541 __isl_give isl_union_map
*isl_union_map_subtract(
542 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
544 return gen_bin_op(umap1
, umap2
, &subtract_entry
);
547 __isl_give isl_union_set
*isl_union_set_subtract(
548 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
550 return isl_union_map_subtract(uset1
, uset2
);
553 struct isl_union_map_match_bin_data
{
554 isl_union_map
*umap2
;
556 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*);
559 static int match_bin_entry(void **entry
, void *user
)
561 struct isl_union_map_match_bin_data
*data
= user
;
563 struct isl_hash_table_entry
*entry2
;
564 isl_map
*map
= *entry
;
567 hash
= isl_dim_get_hash(map
->dim
);
568 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
569 hash
, &has_dim
, map
->dim
, 0);
573 map
= isl_map_copy(map
);
574 map
= data
->fn(map
, isl_map_copy(entry2
->data
));
576 empty
= isl_map_is_empty(map
);
586 data
->res
= isl_union_map_add_map(data
->res
, map
);
591 static __isl_give isl_union_map
*match_bin_op(__isl_take isl_union_map
*umap1
,
592 __isl_take isl_union_map
*umap2
,
593 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*))
595 struct isl_union_map_match_bin_data data
= { NULL
, NULL
, fn
};
597 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_dim(umap2
));
598 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_dim(umap1
));
600 if (!umap1
|| !umap2
)
604 data
.res
= isl_union_map_alloc(isl_dim_copy(umap1
->dim
),
606 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
607 &match_bin_entry
, &data
) < 0)
610 isl_union_map_free(umap1
);
611 isl_union_map_free(umap2
);
614 isl_union_map_free(umap1
);
615 isl_union_map_free(umap2
);
616 isl_union_map_free(data
.res
);
620 __isl_give isl_union_map
*isl_union_map_intersect(
621 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
623 return match_bin_op(umap1
, umap2
, &isl_map_intersect
);
626 __isl_give isl_union_set
*isl_union_set_intersect(
627 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
629 return isl_union_map_intersect(uset1
, uset2
);
632 __isl_give isl_union_map
*isl_union_map_gist(__isl_take isl_union_map
*umap
,
633 __isl_take isl_union_map
*context
)
635 return match_bin_op(umap
, context
, &isl_map_gist
);
638 __isl_give isl_union_set
*isl_union_set_gist(__isl_take isl_union_set
*uset
,
639 __isl_take isl_union_set
*context
)
641 return isl_union_map_gist(uset
, context
);
644 static __isl_give isl_map
*lex_le_set(__isl_take isl_map
*set1
,
645 __isl_take isl_map
*set2
)
647 return isl_set_lex_le_set((isl_set
*)set1
, (isl_set
*)set2
);
650 static __isl_give isl_map
*lex_lt_set(__isl_take isl_map
*set1
,
651 __isl_take isl_map
*set2
)
653 return isl_set_lex_lt_set((isl_set
*)set1
, (isl_set
*)set2
);
656 __isl_give isl_union_map
*isl_union_set_lex_lt_union_set(
657 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
659 return match_bin_op(uset1
, uset2
, &lex_lt_set
);
662 __isl_give isl_union_map
*isl_union_set_lex_le_union_set(
663 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
665 return match_bin_op(uset1
, uset2
, &lex_le_set
);
668 __isl_give isl_union_map
*isl_union_set_lex_gt_union_set(
669 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
671 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2
, uset1
));
674 __isl_give isl_union_map
*isl_union_set_lex_ge_union_set(
675 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
677 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2
, uset1
));
680 __isl_give isl_union_map
*isl_union_map_lex_gt_union_map(
681 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
683 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2
, umap1
));
686 __isl_give isl_union_map
*isl_union_map_lex_ge_union_map(
687 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
689 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2
, umap1
));
692 static int intersect_domain_entry(void **entry
, void *user
)
694 struct isl_union_map_gen_bin_data
*data
= user
;
696 struct isl_hash_table_entry
*entry2
;
698 isl_map
*map
= *entry
;
701 dim
= isl_map_get_dim(map
);
702 dim
= isl_dim_domain(dim
);
703 hash
= isl_dim_get_hash(dim
);
704 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
705 hash
, &has_dim
, dim
, 0);
710 map
= isl_map_copy(map
);
711 map
= isl_map_intersect_domain(map
, isl_set_copy(entry2
->data
));
713 empty
= isl_map_is_empty(map
);
723 data
->res
= isl_union_map_add_map(data
->res
, map
);
728 __isl_give isl_union_map
*isl_union_map_intersect_domain(
729 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
731 return gen_bin_op(umap
, uset
, &intersect_domain_entry
);
734 static int intersect_range_entry(void **entry
, void *user
)
736 struct isl_union_map_gen_bin_data
*data
= user
;
738 struct isl_hash_table_entry
*entry2
;
740 isl_map
*map
= *entry
;
743 dim
= isl_map_get_dim(map
);
744 dim
= isl_dim_range(dim
);
745 hash
= isl_dim_get_hash(dim
);
746 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
747 hash
, &has_dim
, dim
, 0);
752 map
= isl_map_copy(map
);
753 map
= isl_map_intersect_range(map
, isl_set_copy(entry2
->data
));
755 empty
= isl_map_is_empty(map
);
765 data
->res
= isl_union_map_add_map(data
->res
, map
);
770 __isl_give isl_union_map
*isl_union_map_intersect_range(
771 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
773 return gen_bin_op(umap
, uset
, &intersect_range_entry
);
776 struct isl_union_map_bin_data
{
777 isl_union_map
*umap2
;
780 int (*fn
)(void **entry
, void *user
);
783 static int apply_range_entry(void **entry
, void *user
)
785 struct isl_union_map_bin_data
*data
= user
;
786 isl_map
*map2
= *entry
;
789 if (!isl_dim_tuple_match(data
->map
->dim
, isl_dim_out
,
790 map2
->dim
, isl_dim_in
))
793 map2
= isl_map_apply_range(isl_map_copy(data
->map
), isl_map_copy(map2
));
795 empty
= isl_map_is_empty(map2
);
805 data
->res
= isl_union_map_add_map(data
->res
, map2
);
810 static int bin_entry(void **entry
, void *user
)
812 struct isl_union_map_bin_data
*data
= user
;
813 isl_map
*map
= *entry
;
816 if (isl_hash_table_foreach(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
823 static __isl_give isl_union_map
*bin_op(__isl_take isl_union_map
*umap1
,
824 __isl_take isl_union_map
*umap2
, int (*fn
)(void **entry
, void *user
))
826 struct isl_union_map_bin_data data
= { NULL
, NULL
, NULL
, fn
};
828 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_dim(umap2
));
829 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_dim(umap1
));
831 if (!umap1
|| !umap2
)
835 data
.res
= isl_union_map_alloc(isl_dim_copy(umap1
->dim
),
837 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
838 &bin_entry
, &data
) < 0)
841 isl_union_map_free(umap1
);
842 isl_union_map_free(umap2
);
845 isl_union_map_free(umap1
);
846 isl_union_map_free(umap2
);
847 isl_union_map_free(data
.res
);
851 __isl_give isl_union_map
*isl_union_map_apply_range(
852 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
854 return bin_op(umap1
, umap2
, &apply_range_entry
);
857 __isl_give isl_union_map
*isl_union_map_apply_domain(
858 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
860 umap1
= isl_union_map_reverse(umap1
);
861 umap1
= isl_union_map_apply_range(umap1
, umap2
);
862 return isl_union_map_reverse(umap1
);
865 __isl_give isl_union_set
*isl_union_set_apply(
866 __isl_take isl_union_set
*uset
, __isl_take isl_union_map
*umap
)
868 return isl_union_map_apply_range(uset
, umap
);
871 static int map_lex_lt_entry(void **entry
, void *user
)
873 struct isl_union_map_bin_data
*data
= user
;
874 isl_map
*map2
= *entry
;
876 if (!isl_dim_tuple_match(data
->map
->dim
, isl_dim_out
,
877 map2
->dim
, isl_dim_out
))
880 map2
= isl_map_lex_lt_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
882 data
->res
= isl_union_map_add_map(data
->res
, map2
);
887 __isl_give isl_union_map
*isl_union_map_lex_lt_union_map(
888 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
890 return bin_op(umap1
, umap2
, &map_lex_lt_entry
);
893 static int map_lex_le_entry(void **entry
, void *user
)
895 struct isl_union_map_bin_data
*data
= user
;
896 isl_map
*map2
= *entry
;
898 if (!isl_dim_tuple_match(data
->map
->dim
, isl_dim_out
,
899 map2
->dim
, isl_dim_out
))
902 map2
= isl_map_lex_le_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
904 data
->res
= isl_union_map_add_map(data
->res
, map2
);
909 __isl_give isl_union_map
*isl_union_map_lex_le_union_map(
910 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
912 return bin_op(umap1
, umap2
, &map_lex_le_entry
);
915 static int product_entry(void **entry
, void *user
)
917 struct isl_union_map_bin_data
*data
= user
;
918 isl_map
*map2
= *entry
;
920 map2
= isl_map_product(isl_map_copy(data
->map
), isl_map_copy(map2
));
922 data
->res
= isl_union_map_add_map(data
->res
, map2
);
927 __isl_give isl_union_map
*isl_union_map_product(__isl_take isl_union_map
*umap1
,
928 __isl_take isl_union_map
*umap2
)
930 return bin_op(umap1
, umap2
, &product_entry
);
933 __isl_give isl_union_set
*isl_union_set_product(__isl_take isl_union_set
*uset1
,
934 __isl_take isl_union_set
*uset2
)
936 return isl_union_map_product(uset1
, uset2
);
939 static int range_product_entry(void **entry
, void *user
)
941 struct isl_union_map_bin_data
*data
= user
;
942 isl_map
*map2
= *entry
;
944 if (!isl_dim_tuple_match(data
->map
->dim
, isl_dim_in
,
945 map2
->dim
, isl_dim_in
))
948 map2
= isl_map_range_product(isl_map_copy(data
->map
),
951 data
->res
= isl_union_map_add_map(data
->res
, map2
);
956 __isl_give isl_union_map
*isl_union_map_range_product(
957 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
959 return bin_op(umap1
, umap2
, &range_product_entry
);
962 static int flat_range_product_entry(void **entry
, void *user
)
964 struct isl_union_map_bin_data
*data
= user
;
965 isl_map
*map2
= *entry
;
967 if (!isl_dim_tuple_match(data
->map
->dim
, isl_dim_in
,
968 map2
->dim
, isl_dim_in
))
971 map2
= isl_map_flat_range_product(isl_map_copy(data
->map
),
974 data
->res
= isl_union_map_add_map(data
->res
, map2
);
979 __isl_give isl_union_map
*isl_union_map_flat_range_product(
980 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
982 return bin_op(umap1
, umap2
, &flat_range_product_entry
);
985 __isl_give isl_union_map
*isl_union_map_from_range(
986 __isl_take isl_union_set
*uset
)
991 __isl_give isl_union_map
*isl_union_map_from_domain(
992 __isl_take isl_union_set
*uset
)
994 return isl_union_map_reverse(isl_union_map_from_range(uset
));
997 __isl_give isl_union_map
*isl_union_map_from_domain_and_range(
998 __isl_take isl_union_set
*domain
, __isl_take isl_union_set
*range
)
1000 return isl_union_map_apply_range(isl_union_map_from_domain(domain
),
1001 isl_union_map_from_range(range
));
1004 static __isl_give isl_union_map
*un_op(__isl_take isl_union_map
*umap
,
1005 int (*fn
)(void **, void *))
1007 umap
= isl_union_map_cow(umap
);
1011 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, NULL
) < 0)
1016 isl_union_map_free(umap
);
1020 static int affine_entry(void **entry
, void *user
)
1022 isl_map
**map
= (isl_map
**)entry
;
1024 *map
= isl_map_from_basic_map(isl_map_affine_hull(*map
));
1026 return *map
? 0 : -1;
1029 __isl_give isl_union_map
*isl_union_map_affine_hull(
1030 __isl_take isl_union_map
*umap
)
1032 return un_op(umap
, &affine_entry
);
1035 __isl_give isl_union_set
*isl_union_set_affine_hull(
1036 __isl_take isl_union_set
*uset
)
1038 return isl_union_map_affine_hull(uset
);
1041 static int polyhedral_entry(void **entry
, void *user
)
1043 isl_map
**map
= (isl_map
**)entry
;
1045 *map
= isl_map_from_basic_map(isl_map_polyhedral_hull(*map
));
1047 return *map
? 0 : -1;
1050 __isl_give isl_union_map
*isl_union_map_polyhedral_hull(
1051 __isl_take isl_union_map
*umap
)
1053 return un_op(umap
, &polyhedral_entry
);
1056 __isl_give isl_union_set
*isl_union_set_polyhedral_hull(
1057 __isl_take isl_union_set
*uset
)
1059 return isl_union_map_polyhedral_hull(uset
);
1062 static int simple_entry(void **entry
, void *user
)
1064 isl_map
**map
= (isl_map
**)entry
;
1066 *map
= isl_map_from_basic_map(isl_map_simple_hull(*map
));
1068 return *map
? 0 : -1;
1071 __isl_give isl_union_map
*isl_union_map_simple_hull(
1072 __isl_take isl_union_map
*umap
)
1074 return un_op(umap
, &simple_entry
);
1077 __isl_give isl_union_set
*isl_union_set_simple_hull(
1078 __isl_take isl_union_set
*uset
)
1080 return isl_union_map_simple_hull(uset
);
1083 static int inplace_entry(void **entry
, void *user
)
1085 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*);
1086 isl_map
**map
= (isl_map
**)entry
;
1089 fn
= *(__isl_give isl_map
*(**)(__isl_take isl_map
*)) user
;
1090 copy
= fn(isl_map_copy(*map
));
1100 static __isl_give isl_union_map
*inplace(__isl_take isl_union_map
*umap
,
1101 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
1106 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1107 &inplace_entry
, &fn
) < 0)
1112 isl_union_map_free(umap
);
1116 __isl_give isl_union_map
*isl_union_map_coalesce(
1117 __isl_take isl_union_map
*umap
)
1119 return inplace(umap
, &isl_map_coalesce
);
1122 __isl_give isl_union_set
*isl_union_set_coalesce(
1123 __isl_take isl_union_set
*uset
)
1125 return isl_union_map_coalesce(uset
);
1128 __isl_give isl_union_map
*isl_union_map_detect_equalities(
1129 __isl_take isl_union_map
*umap
)
1131 return inplace(umap
, &isl_map_detect_equalities
);
1134 __isl_give isl_union_set
*isl_union_set_detect_equalities(
1135 __isl_take isl_union_set
*uset
)
1137 return isl_union_map_detect_equalities(uset
);
1140 __isl_give isl_union_map
*isl_union_map_compute_divs(
1141 __isl_take isl_union_map
*umap
)
1143 return inplace(umap
, &isl_map_compute_divs
);
1146 __isl_give isl_union_set
*isl_union_set_compute_divs(
1147 __isl_take isl_union_set
*uset
)
1149 return isl_union_map_compute_divs(uset
);
1152 static int lexmin_entry(void **entry
, void *user
)
1154 isl_map
**map
= (isl_map
**)entry
;
1156 *map
= isl_map_lexmin(*map
);
1158 return *map
? 0 : -1;
1161 __isl_give isl_union_map
*isl_union_map_lexmin(
1162 __isl_take isl_union_map
*umap
)
1164 return un_op(umap
, &lexmin_entry
);
1167 __isl_give isl_union_set
*isl_union_set_lexmin(
1168 __isl_take isl_union_set
*uset
)
1170 return isl_union_map_lexmin(uset
);
1173 static int lexmax_entry(void **entry
, void *user
)
1175 isl_map
**map
= (isl_map
**)entry
;
1177 *map
= isl_map_lexmax(*map
);
1179 return *map
? 0 : -1;
1182 __isl_give isl_union_map
*isl_union_map_lexmax(
1183 __isl_take isl_union_map
*umap
)
1185 return un_op(umap
, &lexmax_entry
);
1188 __isl_give isl_union_set
*isl_union_set_lexmax(
1189 __isl_take isl_union_set
*uset
)
1191 return isl_union_map_lexmax(uset
);
1194 static __isl_give isl_union_set
*cond_un_op(__isl_take isl_union_map
*umap
,
1195 int (*fn
)(void **, void *))
1202 res
= isl_union_map_alloc(isl_dim_copy(umap
->dim
), umap
->table
.n
);
1203 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, &res
) < 0)
1206 isl_union_map_free(umap
);
1209 isl_union_map_free(umap
);
1210 isl_union_set_free(res
);
1214 static int universe_entry(void **entry
, void *user
)
1216 isl_map
*map
= *entry
;
1217 isl_union_map
**res
= user
;
1219 map
= isl_map_universe(isl_map_get_dim(map
));
1220 *res
= isl_union_map_add_map(*res
, map
);
1225 __isl_give isl_union_map
*isl_union_map_universe(__isl_take isl_union_map
*umap
)
1227 return cond_un_op(umap
, &universe_entry
);
1230 __isl_give isl_union_set
*isl_union_set_universe(__isl_take isl_union_set
*uset
)
1232 return isl_union_map_universe(uset
);
1235 static int reverse_entry(void **entry
, void *user
)
1237 isl_map
*map
= *entry
;
1238 isl_union_map
**res
= user
;
1240 *res
= isl_union_map_add_map(*res
, isl_map_reverse(isl_map_copy(map
)));
1245 __isl_give isl_union_map
*isl_union_map_reverse(__isl_take isl_union_map
*umap
)
1247 return cond_un_op(umap
, &reverse_entry
);
1250 static int domain_entry(void **entry
, void *user
)
1252 isl_map
*map
= *entry
;
1253 isl_union_set
**res
= user
;
1255 *res
= isl_union_set_add_set(*res
, isl_map_domain(isl_map_copy(map
)));
1260 __isl_give isl_union_set
*isl_union_map_domain(__isl_take isl_union_map
*umap
)
1262 return cond_un_op(umap
, &domain_entry
);
1265 static int range_entry(void **entry
, void *user
)
1267 isl_map
*map
= *entry
;
1268 isl_union_set
**res
= user
;
1270 *res
= isl_union_set_add_set(*res
, isl_map_range(isl_map_copy(map
)));
1275 __isl_give isl_union_set
*isl_union_map_range(__isl_take isl_union_map
*umap
)
1277 return cond_un_op(umap
, &range_entry
);
1280 static int domain_map_entry(void **entry
, void *user
)
1282 isl_map
*map
= *entry
;
1283 isl_union_set
**res
= user
;
1285 *res
= isl_union_map_add_map(*res
,
1286 isl_map_domain_map(isl_map_copy(map
)));
1291 __isl_give isl_union_map
*isl_union_map_domain_map(
1292 __isl_take isl_union_map
*umap
)
1294 return cond_un_op(umap
, &domain_map_entry
);
1297 static int range_map_entry(void **entry
, void *user
)
1299 isl_map
*map
= *entry
;
1300 isl_union_set
**res
= user
;
1302 *res
= isl_union_map_add_map(*res
,
1303 isl_map_range_map(isl_map_copy(map
)));
1308 __isl_give isl_union_map
*isl_union_map_range_map(
1309 __isl_take isl_union_map
*umap
)
1311 return cond_un_op(umap
, &range_map_entry
);
1314 static int deltas_entry(void **entry
, void *user
)
1316 isl_map
*map
= *entry
;
1317 isl_union_set
**res
= user
;
1319 if (!isl_dim_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1322 *res
= isl_union_set_add_set(*res
, isl_map_deltas(isl_map_copy(map
)));
1327 __isl_give isl_union_set
*isl_union_map_deltas(__isl_take isl_union_map
*umap
)
1329 return cond_un_op(umap
, &deltas_entry
);
1332 static int deltas_map_entry(void **entry
, void *user
)
1334 isl_map
*map
= *entry
;
1335 isl_union_map
**res
= user
;
1337 if (!isl_dim_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1340 *res
= isl_union_map_add_map(*res
,
1341 isl_map_deltas_map(isl_map_copy(map
)));
1346 __isl_give isl_union_map
*isl_union_map_deltas_map(
1347 __isl_take isl_union_map
*umap
)
1349 return cond_un_op(umap
, &deltas_map_entry
);
1352 static int identity_entry(void **entry
, void *user
)
1354 isl_set
*set
= *entry
;
1355 isl_union_map
**res
= user
;
1357 *res
= isl_union_map_add_map(*res
, isl_set_identity(isl_set_copy(set
)));
1362 __isl_give isl_union_map
*isl_union_set_identity(__isl_take isl_union_set
*uset
)
1364 return cond_un_op(uset
, &identity_entry
);
1367 static int unwrap_entry(void **entry
, void *user
)
1369 isl_set
*set
= *entry
;
1370 isl_union_set
**res
= user
;
1372 if (!isl_set_is_wrapping(set
))
1375 *res
= isl_union_map_add_map(*res
, isl_set_unwrap(isl_set_copy(set
)));
1380 __isl_give isl_union_map
*isl_union_set_unwrap(__isl_take isl_union_set
*uset
)
1382 return cond_un_op(uset
, &unwrap_entry
);
1385 static int wrap_entry(void **entry
, void *user
)
1387 isl_map
*map
= *entry
;
1388 isl_union_set
**res
= user
;
1390 *res
= isl_union_set_add_set(*res
, isl_map_wrap(isl_map_copy(map
)));
1395 __isl_give isl_union_set
*isl_union_map_wrap(__isl_take isl_union_map
*umap
)
1397 return cond_un_op(umap
, &wrap_entry
);
1400 struct isl_union_map_is_subset_data
{
1401 isl_union_map
*umap2
;
1405 static int is_subset_entry(void **entry
, void *user
)
1407 struct isl_union_map_is_subset_data
*data
= user
;
1409 struct isl_hash_table_entry
*entry2
;
1410 isl_map
*map
= *entry
;
1412 hash
= isl_dim_get_hash(map
->dim
);
1413 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1414 hash
, &has_dim
, map
->dim
, 0);
1416 data
->is_subset
= 0;
1420 data
->is_subset
= isl_map_is_subset(map
, entry2
->data
);
1421 if (data
->is_subset
< 0 || !data
->is_subset
)
1427 int isl_union_map_is_subset(__isl_keep isl_union_map
*umap1
,
1428 __isl_keep isl_union_map
*umap2
)
1430 struct isl_union_map_is_subset_data data
= { NULL
, 1 };
1432 umap1
= isl_union_map_copy(umap1
);
1433 umap2
= isl_union_map_copy(umap2
);
1434 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_dim(umap2
));
1435 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_dim(umap1
));
1437 if (!umap1
|| !umap2
)
1441 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1442 &is_subset_entry
, &data
) < 0 &&
1446 isl_union_map_free(umap1
);
1447 isl_union_map_free(umap2
);
1449 return data
.is_subset
;
1451 isl_union_map_free(umap1
);
1452 isl_union_map_free(umap2
);
1456 int isl_union_set_is_subset(__isl_keep isl_union_set
*uset1
,
1457 __isl_keep isl_union_set
*uset2
)
1459 return isl_union_map_is_subset(uset1
, uset2
);
1462 int isl_union_map_is_equal(__isl_keep isl_union_map
*umap1
,
1463 __isl_keep isl_union_map
*umap2
)
1467 if (!umap1
|| !umap2
)
1469 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1472 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1476 int isl_union_set_is_equal(__isl_keep isl_union_set
*uset1
,
1477 __isl_keep isl_union_set
*uset2
)
1479 return isl_union_map_is_equal(uset1
, uset2
);
1482 int isl_union_map_is_strict_subset(__isl_keep isl_union_map
*umap1
,
1483 __isl_keep isl_union_map
*umap2
)
1487 if (!umap1
|| !umap2
)
1489 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1492 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1493 if (is_subset
== -1)
1498 int isl_union_set_is_strict_subset(__isl_keep isl_union_set
*uset1
,
1499 __isl_keep isl_union_set
*uset2
)
1501 return isl_union_map_is_strict_subset(uset1
, uset2
);
1504 static int sample_entry(void **entry
, void *user
)
1506 isl_basic_map
**sample
= (isl_basic_map
**)user
;
1507 isl_map
*map
= *entry
;
1509 *sample
= isl_map_sample(isl_map_copy(map
));
1512 if (!isl_basic_map_plain_is_empty(*sample
))
1517 __isl_give isl_basic_map
*isl_union_map_sample(__isl_take isl_union_map
*umap
)
1519 isl_basic_map
*sample
= NULL
;
1524 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1525 &sample_entry
, &sample
) < 0 &&
1530 sample
= isl_basic_map_empty(isl_union_map_get_dim(umap
));
1532 isl_union_map_free(umap
);
1536 isl_union_map_free(umap
);
1540 __isl_give isl_basic_set
*isl_union_set_sample(__isl_take isl_union_set
*uset
)
1542 return (isl_basic_set
*)isl_union_map_sample(uset
);
1545 struct isl_forall_data
{
1547 int (*fn
)(__isl_keep isl_map
*map
);
1550 static int forall_entry(void **entry
, void *user
)
1552 struct isl_forall_data
*data
= user
;
1553 isl_map
*map
= *entry
;
1555 data
->res
= data
->fn(map
);
1565 static int union_map_forall(__isl_keep isl_union_map
*umap
,
1566 int (*fn
)(__isl_keep isl_map
*map
))
1568 struct isl_forall_data data
= { 1, fn
};
1573 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1574 &forall_entry
, &data
) < 0 && data
.res
)
1580 struct isl_forall_user_data
{
1582 int (*fn
)(__isl_keep isl_map
*map
, void *user
);
1586 static int forall_user_entry(void **entry
, void *user
)
1588 struct isl_forall_user_data
*data
= user
;
1589 isl_map
*map
= *entry
;
1591 data
->res
= data
->fn(map
, data
->user
);
1601 /* Check if fn(map, user) returns true for all maps "map" in umap.
1603 static int union_map_forall_user(__isl_keep isl_union_map
*umap
,
1604 int (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
1606 struct isl_forall_user_data data
= { 1, fn
, user
};
1611 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1612 &forall_user_entry
, &data
) < 0 && data
.res
)
1618 int isl_union_map_is_empty(__isl_keep isl_union_map
*umap
)
1620 return union_map_forall(umap
, &isl_map_is_empty
);
1623 int isl_union_set_is_empty(__isl_keep isl_union_set
*uset
)
1625 return isl_union_map_is_empty(uset
);
1628 static int is_subset_of_identity(__isl_keep isl_map
*map
)
1637 if (!isl_dim_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1640 dim
= isl_map_get_dim(map
);
1641 id
= isl_map_identity(dim
);
1643 is_subset
= isl_map_is_subset(map
, id
);
1650 /* Check if the given map is single-valued.
1655 * and check if the result is a subset of the identity mapping.
1657 int isl_union_map_is_single_valued(__isl_keep isl_union_map
*umap
)
1659 isl_union_map
*test
;
1662 if (isl_union_map_n_map(umap
) == 1) {
1664 umap
= isl_union_map_copy(umap
);
1665 map
= isl_map_from_union_map(umap
);
1666 sv
= isl_map_is_single_valued(map
);
1671 test
= isl_union_map_reverse(isl_union_map_copy(umap
));
1672 test
= isl_union_map_apply_range(test
, isl_union_map_copy(umap
));
1674 sv
= union_map_forall(test
, &is_subset_of_identity
);
1676 isl_union_map_free(test
);
1681 int isl_union_map_is_injective(__isl_keep isl_union_map
*umap
)
1685 umap
= isl_union_map_copy(umap
);
1686 umap
= isl_union_map_reverse(umap
);
1687 in
= isl_union_map_is_single_valued(umap
);
1688 isl_union_map_free(umap
);
1693 /* Represents a map that has a fixed value (v) for one of its
1695 * The map in this structure is not reference counted, so it
1696 * is only valid while the isl_union_map from which it was
1697 * obtained is still alive.
1699 struct isl_fixed_map
{
1704 static struct isl_fixed_map
*alloc_isl_fixed_map_array(isl_ctx
*ctx
,
1708 struct isl_fixed_map
*v
;
1710 v
= isl_calloc_array(ctx
, struct isl_fixed_map
, n
);
1713 for (i
= 0; i
< n
; ++i
)
1714 isl_int_init(v
[i
].v
);
1718 static void free_isl_fixed_map_array(struct isl_fixed_map
*v
, int n
)
1724 for (i
= 0; i
< n
; ++i
)
1725 isl_int_clear(v
[i
].v
);
1729 /* Compare the "v" field of two isl_fixed_map structs.
1731 static int qsort_fixed_map_cmp(const void *p1
, const void *p2
)
1733 const struct isl_fixed_map
*e1
= (const struct isl_fixed_map
*) p1
;
1734 const struct isl_fixed_map
*e2
= (const struct isl_fixed_map
*) p2
;
1736 return isl_int_cmp(e1
->v
, e2
->v
);
1739 /* Internal data structure used while checking whether all maps
1740 * in a union_map have a fixed value for a given output dimension.
1741 * v is the list of maps, with the fixed value for the dimension
1742 * n is the number of maps considered so far
1743 * pos is the output dimension under investigation
1745 struct isl_fixed_dim_data
{
1746 struct isl_fixed_map
*v
;
1751 static int fixed_at_pos(__isl_keep isl_map
*map
, void *user
)
1753 struct isl_fixed_dim_data
*data
= user
;
1755 data
->v
[data
->n
].map
= map
;
1756 return isl_map_plain_is_fixed(map
, isl_dim_out
, data
->pos
,
1757 &data
->v
[data
->n
++].v
);
1760 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
1761 int first
, int n_range
);
1763 /* Given a list of the maps, with their fixed values at output dimension "pos",
1764 * check whether the ranges of the maps form an obvious partition.
1766 * We first sort the maps according to their fixed values.
1767 * If all maps have a different value, then we know the ranges form
1769 * Otherwise, we collect the maps with the same fixed value and
1770 * check whether each such collection is obviously injective
1771 * based on later dimensions.
1773 static int separates(struct isl_fixed_map
*v
, int n
,
1774 __isl_take isl_dim
*dim
, int pos
, int n_range
)
1781 qsort(v
, n
, sizeof(*v
), &qsort_fixed_map_cmp
);
1783 for (i
= 0; i
+ 1 < n
; ++i
) {
1785 isl_union_map
*part
;
1788 for (j
= i
+ 1; j
< n
; ++j
)
1789 if (isl_int_ne(v
[i
].v
, v
[j
].v
))
1795 part
= isl_union_map_alloc(isl_dim_copy(dim
), j
- i
);
1796 for (k
= i
; k
< j
; ++k
)
1797 part
= isl_union_map_add_map(part
,
1798 isl_map_copy(v
[k
].map
));
1800 injective
= plain_injective_on_range(part
, pos
+ 1, n_range
);
1810 free_isl_fixed_map_array(v
, n
);
1814 free_isl_fixed_map_array(v
, n
);
1818 /* Check whether the maps in umap have obviously distinct ranges.
1819 * In particular, check for an output dimension in the range
1820 * [first,n_range) for which all maps have a fixed value
1821 * and then check if these values, possibly along with fixed values
1822 * at later dimensions, entail distinct ranges.
1824 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
1825 int first
, int n_range
)
1829 struct isl_fixed_dim_data data
= { NULL
};
1831 ctx
= isl_union_map_get_ctx(umap
);
1836 n
= isl_union_map_n_map(umap
);
1838 isl_union_map_free(umap
);
1842 if (first
>= n_range
) {
1843 isl_union_map_free(umap
);
1847 data
.v
= alloc_isl_fixed_map_array(ctx
, n
);
1851 for (data
.pos
= first
; data
.pos
< n_range
; ++data
.pos
) {
1857 fixed
= union_map_forall_user(umap
, &fixed_at_pos
, &data
);
1862 dim
= isl_union_map_get_dim(umap
);
1863 injective
= separates(data
.v
, n
, dim
, data
.pos
, n_range
);
1864 isl_union_map_free(umap
);
1868 free_isl_fixed_map_array(data
.v
, n
);
1869 isl_union_map_free(umap
);
1873 free_isl_fixed_map_array(data
.v
, n
);
1874 isl_union_map_free(umap
);
1878 /* Check whether the maps in umap that map to subsets of "ran"
1879 * have obviously distinct ranges.
1881 static int plain_injective_on_range_wrap(__isl_keep isl_set
*ran
, void *user
)
1883 isl_union_map
*umap
= user
;
1885 umap
= isl_union_map_copy(umap
);
1886 umap
= isl_union_map_intersect_range(umap
,
1887 isl_union_set_from_set(isl_set_copy(ran
)));
1888 return plain_injective_on_range(umap
, 0, isl_set_dim(ran
, isl_dim_set
));
1891 /* Check if the given union_map is obviously injective.
1893 * In particular, we first check if all individual maps are obviously
1894 * injective and then check if all the ranges of these maps are
1895 * obviously disjoint.
1897 int isl_union_map_plain_is_injective(__isl_keep isl_union_map
*umap
)
1900 isl_union_map
*univ
;
1903 in
= union_map_forall(umap
, &isl_map_plain_is_injective
);
1909 univ
= isl_union_map_universe(isl_union_map_copy(umap
));
1910 ran
= isl_union_map_range(univ
);
1912 in
= union_map_forall_user(ran
, &plain_injective_on_range_wrap
, umap
);
1914 isl_union_set_free(ran
);
1919 int isl_union_map_is_bijective(__isl_keep isl_union_map
*umap
)
1923 sv
= isl_union_map_is_single_valued(umap
);
1927 return isl_union_map_is_injective(umap
);
1930 static int zip_entry(void **entry
, void *user
)
1932 isl_map
*map
= *entry
;
1933 isl_union_map
**res
= user
;
1935 if (!isl_map_can_zip(map
))
1938 *res
= isl_union_map_add_map(*res
, isl_map_zip(isl_map_copy(map
)));
1943 __isl_give isl_union_map
*isl_union_map_zip(__isl_take isl_union_map
*umap
)
1945 return cond_un_op(umap
, &zip_entry
);
1948 static int lift_entry(void **entry
, void *user
)
1950 isl_set
*set
= *entry
;
1951 isl_union_set
**res
= user
;
1953 *res
= isl_union_set_add_set(*res
, isl_set_lift(isl_set_copy(set
)));
1958 __isl_give isl_union_set
*isl_union_set_lift(__isl_take isl_union_set
*uset
)
1960 return cond_un_op(uset
, &lift_entry
);
1963 static int coefficients_entry(void **entry
, void *user
)
1965 isl_set
*set
= *entry
;
1966 isl_union_set
**res
= user
;
1968 set
= isl_set_copy(set
);
1969 set
= isl_set_from_basic_set(isl_set_coefficients(set
));
1970 *res
= isl_union_set_add_set(*res
, set
);
1975 __isl_give isl_union_set
*isl_union_set_coefficients(
1976 __isl_take isl_union_set
*uset
)
1985 ctx
= isl_union_set_get_ctx(uset
);
1986 dim
= isl_dim_set_alloc(ctx
, 0, 0);
1987 res
= isl_union_map_alloc(dim
, uset
->table
.n
);
1988 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
1989 &coefficients_entry
, &res
) < 0)
1992 isl_union_set_free(uset
);
1995 isl_union_set_free(uset
);
1996 isl_union_set_free(res
);
2000 static int solutions_entry(void **entry
, void *user
)
2002 isl_set
*set
= *entry
;
2003 isl_union_set
**res
= user
;
2005 set
= isl_set_copy(set
);
2006 set
= isl_set_from_basic_set(isl_set_solutions(set
));
2008 *res
= isl_union_set_from_set(set
);
2010 *res
= isl_union_set_add_set(*res
, set
);
2018 __isl_give isl_union_set
*isl_union_set_solutions(
2019 __isl_take isl_union_set
*uset
)
2021 isl_union_set
*res
= NULL
;
2026 if (uset
->table
.n
== 0) {
2027 res
= isl_union_set_empty(isl_union_set_get_dim(uset
));
2028 isl_union_set_free(uset
);
2032 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2033 &solutions_entry
, &res
) < 0)
2036 isl_union_set_free(uset
);
2039 isl_union_set_free(uset
);
2040 isl_union_set_free(res
);