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 static __isl_give isl_union_map
*union_map_intersect_params(
643 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
645 return isl_union_map_intersect_params(umap
,
646 isl_set_from_union_set(uset
));
649 static __isl_give isl_union_map
*union_map_gist_params(
650 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
652 return isl_union_map_gist_params(umap
, isl_set_from_union_set(uset
));
655 struct isl_union_map_match_bin_data
{
656 isl_union_map
*umap2
;
658 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*);
661 static int match_bin_entry(void **entry
, void *user
)
663 struct isl_union_map_match_bin_data
*data
= user
;
665 struct isl_hash_table_entry
*entry2
;
666 isl_map
*map
= *entry
;
669 hash
= isl_space_get_hash(map
->dim
);
670 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
671 hash
, &has_dim
, map
->dim
, 0);
675 map
= isl_map_copy(map
);
676 map
= data
->fn(map
, isl_map_copy(entry2
->data
));
678 empty
= isl_map_is_empty(map
);
688 data
->res
= isl_union_map_add_map(data
->res
, map
);
693 static __isl_give isl_union_map
*match_bin_op(__isl_take isl_union_map
*umap1
,
694 __isl_take isl_union_map
*umap2
,
695 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*))
697 struct isl_union_map_match_bin_data data
= { NULL
, NULL
, fn
};
699 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
700 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
702 if (!umap1
|| !umap2
)
706 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
708 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
709 &match_bin_entry
, &data
) < 0)
712 isl_union_map_free(umap1
);
713 isl_union_map_free(umap2
);
716 isl_union_map_free(umap1
);
717 isl_union_map_free(umap2
);
718 isl_union_map_free(data
.res
);
722 __isl_give isl_union_map
*isl_union_map_intersect(
723 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
725 return match_bin_op(umap1
, umap2
, &isl_map_intersect
);
728 /* Compute the intersection of the two union_sets.
729 * As a special case, if exactly one of the two union_sets
730 * is a parameter domain, then intersect the parameter domain
731 * of the other one with this set.
733 __isl_give isl_union_set
*isl_union_set_intersect(
734 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
738 p1
= isl_union_set_is_params(uset1
);
739 p2
= isl_union_set_is_params(uset2
);
740 if (p1
< 0 || p2
< 0)
743 return union_map_intersect_params(uset1
, uset2
);
745 return union_map_intersect_params(uset2
, uset1
);
746 return isl_union_map_intersect(uset1
, uset2
);
748 isl_union_set_free(uset1
);
749 isl_union_set_free(uset2
);
753 static int gist_params_entry(void **entry
, void *user
)
755 struct isl_union_map_gen_bin_set_data
*data
= user
;
756 isl_map
*map
= *entry
;
759 map
= isl_map_copy(map
);
760 map
= isl_map_gist_params(map
, isl_set_copy(data
->set
));
762 empty
= isl_map_is_empty(map
);
768 data
->res
= isl_union_map_add_map(data
->res
, map
);
773 __isl_give isl_union_map
*isl_union_map_gist_params(
774 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
776 return gen_bin_set_op(umap
, set
, &gist_params_entry
);
779 __isl_give isl_union_set
*isl_union_set_gist_params(
780 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
782 return isl_union_map_gist_params(uset
, set
);
785 __isl_give isl_union_map
*isl_union_map_gist(__isl_take isl_union_map
*umap
,
786 __isl_take isl_union_map
*context
)
788 return match_bin_op(umap
, context
, &isl_map_gist
);
791 __isl_give isl_union_set
*isl_union_set_gist(__isl_take isl_union_set
*uset
,
792 __isl_take isl_union_set
*context
)
794 return isl_union_map_gist(uset
, context
);
797 static __isl_give isl_map
*lex_le_set(__isl_take isl_map
*set1
,
798 __isl_take isl_map
*set2
)
800 return isl_set_lex_le_set((isl_set
*)set1
, (isl_set
*)set2
);
803 static __isl_give isl_map
*lex_lt_set(__isl_take isl_map
*set1
,
804 __isl_take isl_map
*set2
)
806 return isl_set_lex_lt_set((isl_set
*)set1
, (isl_set
*)set2
);
809 __isl_give isl_union_map
*isl_union_set_lex_lt_union_set(
810 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
812 return match_bin_op(uset1
, uset2
, &lex_lt_set
);
815 __isl_give isl_union_map
*isl_union_set_lex_le_union_set(
816 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
818 return match_bin_op(uset1
, uset2
, &lex_le_set
);
821 __isl_give isl_union_map
*isl_union_set_lex_gt_union_set(
822 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
824 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2
, uset1
));
827 __isl_give isl_union_map
*isl_union_set_lex_ge_union_set(
828 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
830 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2
, uset1
));
833 __isl_give isl_union_map
*isl_union_map_lex_gt_union_map(
834 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
836 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2
, umap1
));
839 __isl_give isl_union_map
*isl_union_map_lex_ge_union_map(
840 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
842 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2
, umap1
));
845 static int intersect_domain_entry(void **entry
, void *user
)
847 struct isl_union_map_gen_bin_data
*data
= user
;
849 struct isl_hash_table_entry
*entry2
;
851 isl_map
*map
= *entry
;
854 dim
= isl_map_get_space(map
);
855 dim
= isl_space_domain(dim
);
856 hash
= isl_space_get_hash(dim
);
857 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
858 hash
, &has_dim
, dim
, 0);
863 map
= isl_map_copy(map
);
864 map
= isl_map_intersect_domain(map
, isl_set_copy(entry2
->data
));
866 empty
= isl_map_is_empty(map
);
876 data
->res
= isl_union_map_add_map(data
->res
, map
);
881 /* Intersect the domain of "umap" with "uset".
882 * If "uset" is a parameters domain, then intersect the parameter
883 * domain of "umap" with this set.
885 __isl_give isl_union_map
*isl_union_map_intersect_domain(
886 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
888 if (isl_union_set_is_params(uset
))
889 return union_map_intersect_params(umap
, uset
);
890 return gen_bin_op(umap
, uset
, &intersect_domain_entry
);
893 static int gist_domain_entry(void **entry
, void *user
)
895 struct isl_union_map_gen_bin_data
*data
= user
;
897 struct isl_hash_table_entry
*entry2
;
899 isl_map
*map
= *entry
;
902 dim
= isl_map_get_space(map
);
903 dim
= isl_space_domain(dim
);
904 hash
= isl_space_get_hash(dim
);
905 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
906 hash
, &has_dim
, dim
, 0);
911 map
= isl_map_copy(map
);
912 map
= isl_map_gist_domain(map
, isl_set_copy(entry2
->data
));
914 empty
= isl_map_is_empty(map
);
920 data
->res
= isl_union_map_add_map(data
->res
, map
);
925 /* Compute the gist of "umap" with respect to the domain "uset".
926 * If "uset" is a parameters domain, then compute the gist
927 * with respect to this parameter domain.
929 __isl_give isl_union_map
*isl_union_map_gist_domain(
930 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
932 if (isl_union_set_is_params(uset
))
933 return union_map_gist_params(umap
, uset
);
934 return gen_bin_op(umap
, uset
, &gist_domain_entry
);
937 static int intersect_range_entry(void **entry
, void *user
)
939 struct isl_union_map_gen_bin_data
*data
= user
;
941 struct isl_hash_table_entry
*entry2
;
943 isl_map
*map
= *entry
;
946 dim
= isl_map_get_space(map
);
947 dim
= isl_space_range(dim
);
948 hash
= isl_space_get_hash(dim
);
949 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
950 hash
, &has_dim
, dim
, 0);
955 map
= isl_map_copy(map
);
956 map
= isl_map_intersect_range(map
, isl_set_copy(entry2
->data
));
958 empty
= isl_map_is_empty(map
);
968 data
->res
= isl_union_map_add_map(data
->res
, map
);
973 __isl_give isl_union_map
*isl_union_map_intersect_range(
974 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
976 return gen_bin_op(umap
, uset
, &intersect_range_entry
);
979 struct isl_union_map_bin_data
{
980 isl_union_map
*umap2
;
983 int (*fn
)(void **entry
, void *user
);
986 static int apply_range_entry(void **entry
, void *user
)
988 struct isl_union_map_bin_data
*data
= user
;
989 isl_map
*map2
= *entry
;
992 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
993 map2
->dim
, isl_dim_in
))
996 map2
= isl_map_apply_range(isl_map_copy(data
->map
), isl_map_copy(map2
));
998 empty
= isl_map_is_empty(map2
);
1008 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1013 static int bin_entry(void **entry
, void *user
)
1015 struct isl_union_map_bin_data
*data
= user
;
1016 isl_map
*map
= *entry
;
1019 if (isl_hash_table_foreach(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1020 data
->fn
, data
) < 0)
1026 static __isl_give isl_union_map
*bin_op(__isl_take isl_union_map
*umap1
,
1027 __isl_take isl_union_map
*umap2
, int (*fn
)(void **entry
, void *user
))
1029 struct isl_union_map_bin_data data
= { NULL
, NULL
, NULL
, fn
};
1031 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1032 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1034 if (!umap1
|| !umap2
)
1038 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
1040 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1041 &bin_entry
, &data
) < 0)
1044 isl_union_map_free(umap1
);
1045 isl_union_map_free(umap2
);
1048 isl_union_map_free(umap1
);
1049 isl_union_map_free(umap2
);
1050 isl_union_map_free(data
.res
);
1054 __isl_give isl_union_map
*isl_union_map_apply_range(
1055 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1057 return bin_op(umap1
, umap2
, &apply_range_entry
);
1060 __isl_give isl_union_map
*isl_union_map_apply_domain(
1061 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1063 umap1
= isl_union_map_reverse(umap1
);
1064 umap1
= isl_union_map_apply_range(umap1
, umap2
);
1065 return isl_union_map_reverse(umap1
);
1068 __isl_give isl_union_set
*isl_union_set_apply(
1069 __isl_take isl_union_set
*uset
, __isl_take isl_union_map
*umap
)
1071 return isl_union_map_apply_range(uset
, umap
);
1074 static int map_lex_lt_entry(void **entry
, void *user
)
1076 struct isl_union_map_bin_data
*data
= user
;
1077 isl_map
*map2
= *entry
;
1079 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
1080 map2
->dim
, isl_dim_out
))
1083 map2
= isl_map_lex_lt_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1085 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1090 __isl_give isl_union_map
*isl_union_map_lex_lt_union_map(
1091 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1093 return bin_op(umap1
, umap2
, &map_lex_lt_entry
);
1096 static int map_lex_le_entry(void **entry
, void *user
)
1098 struct isl_union_map_bin_data
*data
= user
;
1099 isl_map
*map2
= *entry
;
1101 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
1102 map2
->dim
, isl_dim_out
))
1105 map2
= isl_map_lex_le_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1107 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1112 __isl_give isl_union_map
*isl_union_map_lex_le_union_map(
1113 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1115 return bin_op(umap1
, umap2
, &map_lex_le_entry
);
1118 static int product_entry(void **entry
, void *user
)
1120 struct isl_union_map_bin_data
*data
= user
;
1121 isl_map
*map2
= *entry
;
1123 map2
= isl_map_product(isl_map_copy(data
->map
), isl_map_copy(map2
));
1125 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1130 __isl_give isl_union_map
*isl_union_map_product(__isl_take isl_union_map
*umap1
,
1131 __isl_take isl_union_map
*umap2
)
1133 return bin_op(umap1
, umap2
, &product_entry
);
1136 __isl_give isl_union_set
*isl_union_set_product(__isl_take isl_union_set
*uset1
,
1137 __isl_take isl_union_set
*uset2
)
1139 return isl_union_map_product(uset1
, uset2
);
1142 static int range_product_entry(void **entry
, void *user
)
1144 struct isl_union_map_bin_data
*data
= user
;
1145 isl_map
*map2
= *entry
;
1147 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_in
,
1148 map2
->dim
, isl_dim_in
))
1151 map2
= isl_map_range_product(isl_map_copy(data
->map
),
1152 isl_map_copy(map2
));
1154 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1159 __isl_give isl_union_map
*isl_union_map_range_product(
1160 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1162 return bin_op(umap1
, umap2
, &range_product_entry
);
1165 static int flat_range_product_entry(void **entry
, void *user
)
1167 struct isl_union_map_bin_data
*data
= user
;
1168 isl_map
*map2
= *entry
;
1170 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_in
,
1171 map2
->dim
, isl_dim_in
))
1174 map2
= isl_map_flat_range_product(isl_map_copy(data
->map
),
1175 isl_map_copy(map2
));
1177 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1182 __isl_give isl_union_map
*isl_union_map_flat_range_product(
1183 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1185 return bin_op(umap1
, umap2
, &flat_range_product_entry
);
1188 static __isl_give isl_union_set
*cond_un_op(__isl_take isl_union_map
*umap
,
1189 int (*fn
)(void **, void *))
1196 res
= isl_union_map_alloc(isl_space_copy(umap
->dim
), umap
->table
.n
);
1197 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, &res
) < 0)
1200 isl_union_map_free(umap
);
1203 isl_union_map_free(umap
);
1204 isl_union_set_free(res
);
1208 static int from_range_entry(void **entry
, void *user
)
1210 isl_map
*set
= *entry
;
1211 isl_union_set
**res
= user
;
1213 *res
= isl_union_map_add_map(*res
,
1214 isl_map_from_range(isl_set_copy(set
)));
1219 __isl_give isl_union_map
*isl_union_map_from_range(
1220 __isl_take isl_union_set
*uset
)
1222 return cond_un_op(uset
, &from_range_entry
);
1225 __isl_give isl_union_map
*isl_union_map_from_domain(
1226 __isl_take isl_union_set
*uset
)
1228 return isl_union_map_reverse(isl_union_map_from_range(uset
));
1231 __isl_give isl_union_map
*isl_union_map_from_domain_and_range(
1232 __isl_take isl_union_set
*domain
, __isl_take isl_union_set
*range
)
1234 return isl_union_map_apply_range(isl_union_map_from_domain(domain
),
1235 isl_union_map_from_range(range
));
1238 static __isl_give isl_union_map
*un_op(__isl_take isl_union_map
*umap
,
1239 int (*fn
)(void **, void *))
1241 umap
= isl_union_map_cow(umap
);
1245 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, NULL
) < 0)
1250 isl_union_map_free(umap
);
1254 static int affine_entry(void **entry
, void *user
)
1256 isl_map
**map
= (isl_map
**)entry
;
1258 *map
= isl_map_from_basic_map(isl_map_affine_hull(*map
));
1260 return *map
? 0 : -1;
1263 __isl_give isl_union_map
*isl_union_map_affine_hull(
1264 __isl_take isl_union_map
*umap
)
1266 return un_op(umap
, &affine_entry
);
1269 __isl_give isl_union_set
*isl_union_set_affine_hull(
1270 __isl_take isl_union_set
*uset
)
1272 return isl_union_map_affine_hull(uset
);
1275 static int polyhedral_entry(void **entry
, void *user
)
1277 isl_map
**map
= (isl_map
**)entry
;
1279 *map
= isl_map_from_basic_map(isl_map_polyhedral_hull(*map
));
1281 return *map
? 0 : -1;
1284 __isl_give isl_union_map
*isl_union_map_polyhedral_hull(
1285 __isl_take isl_union_map
*umap
)
1287 return un_op(umap
, &polyhedral_entry
);
1290 __isl_give isl_union_set
*isl_union_set_polyhedral_hull(
1291 __isl_take isl_union_set
*uset
)
1293 return isl_union_map_polyhedral_hull(uset
);
1296 static int simple_entry(void **entry
, void *user
)
1298 isl_map
**map
= (isl_map
**)entry
;
1300 *map
= isl_map_from_basic_map(isl_map_simple_hull(*map
));
1302 return *map
? 0 : -1;
1305 __isl_give isl_union_map
*isl_union_map_simple_hull(
1306 __isl_take isl_union_map
*umap
)
1308 return un_op(umap
, &simple_entry
);
1311 __isl_give isl_union_set
*isl_union_set_simple_hull(
1312 __isl_take isl_union_set
*uset
)
1314 return isl_union_map_simple_hull(uset
);
1317 static int inplace_entry(void **entry
, void *user
)
1319 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*);
1320 isl_map
**map
= (isl_map
**)entry
;
1323 fn
= *(__isl_give isl_map
*(**)(__isl_take isl_map
*)) user
;
1324 copy
= fn(isl_map_copy(*map
));
1334 static __isl_give isl_union_map
*inplace(__isl_take isl_union_map
*umap
,
1335 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
1340 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1341 &inplace_entry
, &fn
) < 0)
1346 isl_union_map_free(umap
);
1350 __isl_give isl_union_map
*isl_union_map_coalesce(
1351 __isl_take isl_union_map
*umap
)
1353 return inplace(umap
, &isl_map_coalesce
);
1356 __isl_give isl_union_set
*isl_union_set_coalesce(
1357 __isl_take isl_union_set
*uset
)
1359 return isl_union_map_coalesce(uset
);
1362 __isl_give isl_union_map
*isl_union_map_detect_equalities(
1363 __isl_take isl_union_map
*umap
)
1365 return inplace(umap
, &isl_map_detect_equalities
);
1368 __isl_give isl_union_set
*isl_union_set_detect_equalities(
1369 __isl_take isl_union_set
*uset
)
1371 return isl_union_map_detect_equalities(uset
);
1374 __isl_give isl_union_map
*isl_union_map_compute_divs(
1375 __isl_take isl_union_map
*umap
)
1377 return inplace(umap
, &isl_map_compute_divs
);
1380 __isl_give isl_union_set
*isl_union_set_compute_divs(
1381 __isl_take isl_union_set
*uset
)
1383 return isl_union_map_compute_divs(uset
);
1386 static int lexmin_entry(void **entry
, void *user
)
1388 isl_map
**map
= (isl_map
**)entry
;
1390 *map
= isl_map_lexmin(*map
);
1392 return *map
? 0 : -1;
1395 __isl_give isl_union_map
*isl_union_map_lexmin(
1396 __isl_take isl_union_map
*umap
)
1398 return un_op(umap
, &lexmin_entry
);
1401 __isl_give isl_union_set
*isl_union_set_lexmin(
1402 __isl_take isl_union_set
*uset
)
1404 return isl_union_map_lexmin(uset
);
1407 static int lexmax_entry(void **entry
, void *user
)
1409 isl_map
**map
= (isl_map
**)entry
;
1411 *map
= isl_map_lexmax(*map
);
1413 return *map
? 0 : -1;
1416 __isl_give isl_union_map
*isl_union_map_lexmax(
1417 __isl_take isl_union_map
*umap
)
1419 return un_op(umap
, &lexmax_entry
);
1422 __isl_give isl_union_set
*isl_union_set_lexmax(
1423 __isl_take isl_union_set
*uset
)
1425 return isl_union_map_lexmax(uset
);
1428 static int universe_entry(void **entry
, void *user
)
1430 isl_map
*map
= *entry
;
1431 isl_union_map
**res
= user
;
1433 map
= isl_map_universe(isl_map_get_space(map
));
1434 *res
= isl_union_map_add_map(*res
, map
);
1439 __isl_give isl_union_map
*isl_union_map_universe(__isl_take isl_union_map
*umap
)
1441 return cond_un_op(umap
, &universe_entry
);
1444 __isl_give isl_union_set
*isl_union_set_universe(__isl_take isl_union_set
*uset
)
1446 return isl_union_map_universe(uset
);
1449 static int reverse_entry(void **entry
, void *user
)
1451 isl_map
*map
= *entry
;
1452 isl_union_map
**res
= user
;
1454 *res
= isl_union_map_add_map(*res
, isl_map_reverse(isl_map_copy(map
)));
1459 __isl_give isl_union_map
*isl_union_map_reverse(__isl_take isl_union_map
*umap
)
1461 return cond_un_op(umap
, &reverse_entry
);
1464 static int domain_entry(void **entry
, void *user
)
1466 isl_map
*map
= *entry
;
1467 isl_union_set
**res
= user
;
1469 *res
= isl_union_set_add_set(*res
, isl_map_domain(isl_map_copy(map
)));
1474 __isl_give isl_union_set
*isl_union_map_domain(__isl_take isl_union_map
*umap
)
1476 return cond_un_op(umap
, &domain_entry
);
1479 static int range_entry(void **entry
, void *user
)
1481 isl_map
*map
= *entry
;
1482 isl_union_set
**res
= user
;
1484 *res
= isl_union_set_add_set(*res
, isl_map_range(isl_map_copy(map
)));
1489 __isl_give isl_union_set
*isl_union_map_range(__isl_take isl_union_map
*umap
)
1491 return cond_un_op(umap
, &range_entry
);
1494 static int domain_map_entry(void **entry
, void *user
)
1496 isl_map
*map
= *entry
;
1497 isl_union_set
**res
= user
;
1499 *res
= isl_union_map_add_map(*res
,
1500 isl_map_domain_map(isl_map_copy(map
)));
1505 __isl_give isl_union_map
*isl_union_map_domain_map(
1506 __isl_take isl_union_map
*umap
)
1508 return cond_un_op(umap
, &domain_map_entry
);
1511 static int range_map_entry(void **entry
, void *user
)
1513 isl_map
*map
= *entry
;
1514 isl_union_set
**res
= user
;
1516 *res
= isl_union_map_add_map(*res
,
1517 isl_map_range_map(isl_map_copy(map
)));
1522 __isl_give isl_union_map
*isl_union_map_range_map(
1523 __isl_take isl_union_map
*umap
)
1525 return cond_un_op(umap
, &range_map_entry
);
1528 static int deltas_entry(void **entry
, void *user
)
1530 isl_map
*map
= *entry
;
1531 isl_union_set
**res
= user
;
1533 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1536 *res
= isl_union_set_add_set(*res
, isl_map_deltas(isl_map_copy(map
)));
1541 __isl_give isl_union_set
*isl_union_map_deltas(__isl_take isl_union_map
*umap
)
1543 return cond_un_op(umap
, &deltas_entry
);
1546 static int deltas_map_entry(void **entry
, void *user
)
1548 isl_map
*map
= *entry
;
1549 isl_union_map
**res
= user
;
1551 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1554 *res
= isl_union_map_add_map(*res
,
1555 isl_map_deltas_map(isl_map_copy(map
)));
1560 __isl_give isl_union_map
*isl_union_map_deltas_map(
1561 __isl_take isl_union_map
*umap
)
1563 return cond_un_op(umap
, &deltas_map_entry
);
1566 static int identity_entry(void **entry
, void *user
)
1568 isl_set
*set
= *entry
;
1569 isl_union_map
**res
= user
;
1571 *res
= isl_union_map_add_map(*res
, isl_set_identity(isl_set_copy(set
)));
1576 __isl_give isl_union_map
*isl_union_set_identity(__isl_take isl_union_set
*uset
)
1578 return cond_un_op(uset
, &identity_entry
);
1581 static int unwrap_entry(void **entry
, void *user
)
1583 isl_set
*set
= *entry
;
1584 isl_union_set
**res
= user
;
1586 if (!isl_set_is_wrapping(set
))
1589 *res
= isl_union_map_add_map(*res
, isl_set_unwrap(isl_set_copy(set
)));
1594 __isl_give isl_union_map
*isl_union_set_unwrap(__isl_take isl_union_set
*uset
)
1596 return cond_un_op(uset
, &unwrap_entry
);
1599 static int wrap_entry(void **entry
, void *user
)
1601 isl_map
*map
= *entry
;
1602 isl_union_set
**res
= user
;
1604 *res
= isl_union_set_add_set(*res
, isl_map_wrap(isl_map_copy(map
)));
1609 __isl_give isl_union_set
*isl_union_map_wrap(__isl_take isl_union_map
*umap
)
1611 return cond_un_op(umap
, &wrap_entry
);
1614 struct isl_union_map_is_subset_data
{
1615 isl_union_map
*umap2
;
1619 static int is_subset_entry(void **entry
, void *user
)
1621 struct isl_union_map_is_subset_data
*data
= user
;
1623 struct isl_hash_table_entry
*entry2
;
1624 isl_map
*map
= *entry
;
1626 hash
= isl_space_get_hash(map
->dim
);
1627 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1628 hash
, &has_dim
, map
->dim
, 0);
1630 data
->is_subset
= 0;
1634 data
->is_subset
= isl_map_is_subset(map
, entry2
->data
);
1635 if (data
->is_subset
< 0 || !data
->is_subset
)
1641 int isl_union_map_is_subset(__isl_keep isl_union_map
*umap1
,
1642 __isl_keep isl_union_map
*umap2
)
1644 struct isl_union_map_is_subset_data data
= { NULL
, 1 };
1646 umap1
= isl_union_map_copy(umap1
);
1647 umap2
= isl_union_map_copy(umap2
);
1648 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1649 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1651 if (!umap1
|| !umap2
)
1655 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1656 &is_subset_entry
, &data
) < 0 &&
1660 isl_union_map_free(umap1
);
1661 isl_union_map_free(umap2
);
1663 return data
.is_subset
;
1665 isl_union_map_free(umap1
);
1666 isl_union_map_free(umap2
);
1670 int isl_union_set_is_subset(__isl_keep isl_union_set
*uset1
,
1671 __isl_keep isl_union_set
*uset2
)
1673 return isl_union_map_is_subset(uset1
, uset2
);
1676 int isl_union_map_is_equal(__isl_keep isl_union_map
*umap1
,
1677 __isl_keep isl_union_map
*umap2
)
1681 if (!umap1
|| !umap2
)
1683 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1686 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1690 int isl_union_set_is_equal(__isl_keep isl_union_set
*uset1
,
1691 __isl_keep isl_union_set
*uset2
)
1693 return isl_union_map_is_equal(uset1
, uset2
);
1696 int isl_union_map_is_strict_subset(__isl_keep isl_union_map
*umap1
,
1697 __isl_keep isl_union_map
*umap2
)
1701 if (!umap1
|| !umap2
)
1703 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1706 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1707 if (is_subset
== -1)
1712 int isl_union_set_is_strict_subset(__isl_keep isl_union_set
*uset1
,
1713 __isl_keep isl_union_set
*uset2
)
1715 return isl_union_map_is_strict_subset(uset1
, uset2
);
1718 static int sample_entry(void **entry
, void *user
)
1720 isl_basic_map
**sample
= (isl_basic_map
**)user
;
1721 isl_map
*map
= *entry
;
1723 *sample
= isl_map_sample(isl_map_copy(map
));
1726 if (!isl_basic_map_plain_is_empty(*sample
))
1731 __isl_give isl_basic_map
*isl_union_map_sample(__isl_take isl_union_map
*umap
)
1733 isl_basic_map
*sample
= NULL
;
1738 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1739 &sample_entry
, &sample
) < 0 &&
1744 sample
= isl_basic_map_empty(isl_union_map_get_space(umap
));
1746 isl_union_map_free(umap
);
1750 isl_union_map_free(umap
);
1754 __isl_give isl_basic_set
*isl_union_set_sample(__isl_take isl_union_set
*uset
)
1756 return (isl_basic_set
*)isl_union_map_sample(uset
);
1759 struct isl_forall_data
{
1761 int (*fn
)(__isl_keep isl_map
*map
);
1764 static int forall_entry(void **entry
, void *user
)
1766 struct isl_forall_data
*data
= user
;
1767 isl_map
*map
= *entry
;
1769 data
->res
= data
->fn(map
);
1779 static int union_map_forall(__isl_keep isl_union_map
*umap
,
1780 int (*fn
)(__isl_keep isl_map
*map
))
1782 struct isl_forall_data data
= { 1, fn
};
1787 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1788 &forall_entry
, &data
) < 0 && data
.res
)
1794 struct isl_forall_user_data
{
1796 int (*fn
)(__isl_keep isl_map
*map
, void *user
);
1800 static int forall_user_entry(void **entry
, void *user
)
1802 struct isl_forall_user_data
*data
= user
;
1803 isl_map
*map
= *entry
;
1805 data
->res
= data
->fn(map
, data
->user
);
1815 /* Check if fn(map, user) returns true for all maps "map" in umap.
1817 static int union_map_forall_user(__isl_keep isl_union_map
*umap
,
1818 int (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
1820 struct isl_forall_user_data data
= { 1, fn
, user
};
1825 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1826 &forall_user_entry
, &data
) < 0 && data
.res
)
1832 int isl_union_map_is_empty(__isl_keep isl_union_map
*umap
)
1834 return union_map_forall(umap
, &isl_map_is_empty
);
1837 int isl_union_set_is_empty(__isl_keep isl_union_set
*uset
)
1839 return isl_union_map_is_empty(uset
);
1842 static int is_subset_of_identity(__isl_keep isl_map
*map
)
1851 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1854 dim
= isl_map_get_space(map
);
1855 id
= isl_map_identity(dim
);
1857 is_subset
= isl_map_is_subset(map
, id
);
1864 /* Check if the given map is single-valued.
1869 * and check if the result is a subset of the identity mapping.
1871 int isl_union_map_is_single_valued(__isl_keep isl_union_map
*umap
)
1873 isl_union_map
*test
;
1876 if (isl_union_map_n_map(umap
) == 1) {
1878 umap
= isl_union_map_copy(umap
);
1879 map
= isl_map_from_union_map(umap
);
1880 sv
= isl_map_is_single_valued(map
);
1885 test
= isl_union_map_reverse(isl_union_map_copy(umap
));
1886 test
= isl_union_map_apply_range(test
, isl_union_map_copy(umap
));
1888 sv
= union_map_forall(test
, &is_subset_of_identity
);
1890 isl_union_map_free(test
);
1895 int isl_union_map_is_injective(__isl_keep isl_union_map
*umap
)
1899 umap
= isl_union_map_copy(umap
);
1900 umap
= isl_union_map_reverse(umap
);
1901 in
= isl_union_map_is_single_valued(umap
);
1902 isl_union_map_free(umap
);
1907 /* Represents a map that has a fixed value (v) for one of its
1909 * The map in this structure is not reference counted, so it
1910 * is only valid while the isl_union_map from which it was
1911 * obtained is still alive.
1913 struct isl_fixed_map
{
1918 static struct isl_fixed_map
*alloc_isl_fixed_map_array(isl_ctx
*ctx
,
1922 struct isl_fixed_map
*v
;
1924 v
= isl_calloc_array(ctx
, struct isl_fixed_map
, n
);
1927 for (i
= 0; i
< n
; ++i
)
1928 isl_int_init(v
[i
].v
);
1932 static void free_isl_fixed_map_array(struct isl_fixed_map
*v
, int n
)
1938 for (i
= 0; i
< n
; ++i
)
1939 isl_int_clear(v
[i
].v
);
1943 /* Compare the "v" field of two isl_fixed_map structs.
1945 static int qsort_fixed_map_cmp(const void *p1
, const void *p2
)
1947 const struct isl_fixed_map
*e1
= (const struct isl_fixed_map
*) p1
;
1948 const struct isl_fixed_map
*e2
= (const struct isl_fixed_map
*) p2
;
1950 return isl_int_cmp(e1
->v
, e2
->v
);
1953 /* Internal data structure used while checking whether all maps
1954 * in a union_map have a fixed value for a given output dimension.
1955 * v is the list of maps, with the fixed value for the dimension
1956 * n is the number of maps considered so far
1957 * pos is the output dimension under investigation
1959 struct isl_fixed_dim_data
{
1960 struct isl_fixed_map
*v
;
1965 static int fixed_at_pos(__isl_keep isl_map
*map
, void *user
)
1967 struct isl_fixed_dim_data
*data
= user
;
1969 data
->v
[data
->n
].map
= map
;
1970 return isl_map_plain_is_fixed(map
, isl_dim_out
, data
->pos
,
1971 &data
->v
[data
->n
++].v
);
1974 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
1975 int first
, int n_range
);
1977 /* Given a list of the maps, with their fixed values at output dimension "pos",
1978 * check whether the ranges of the maps form an obvious partition.
1980 * We first sort the maps according to their fixed values.
1981 * If all maps have a different value, then we know the ranges form
1983 * Otherwise, we collect the maps with the same fixed value and
1984 * check whether each such collection is obviously injective
1985 * based on later dimensions.
1987 static int separates(struct isl_fixed_map
*v
, int n
,
1988 __isl_take isl_space
*dim
, int pos
, int n_range
)
1995 qsort(v
, n
, sizeof(*v
), &qsort_fixed_map_cmp
);
1997 for (i
= 0; i
+ 1 < n
; ++i
) {
1999 isl_union_map
*part
;
2002 for (j
= i
+ 1; j
< n
; ++j
)
2003 if (isl_int_ne(v
[i
].v
, v
[j
].v
))
2009 part
= isl_union_map_alloc(isl_space_copy(dim
), j
- i
);
2010 for (k
= i
; k
< j
; ++k
)
2011 part
= isl_union_map_add_map(part
,
2012 isl_map_copy(v
[k
].map
));
2014 injective
= plain_injective_on_range(part
, pos
+ 1, n_range
);
2023 isl_space_free(dim
);
2024 free_isl_fixed_map_array(v
, n
);
2027 isl_space_free(dim
);
2028 free_isl_fixed_map_array(v
, n
);
2032 /* Check whether the maps in umap have obviously distinct ranges.
2033 * In particular, check for an output dimension in the range
2034 * [first,n_range) for which all maps have a fixed value
2035 * and then check if these values, possibly along with fixed values
2036 * at later dimensions, entail distinct ranges.
2038 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
2039 int first
, int n_range
)
2043 struct isl_fixed_dim_data data
= { NULL
};
2045 ctx
= isl_union_map_get_ctx(umap
);
2050 n
= isl_union_map_n_map(umap
);
2052 isl_union_map_free(umap
);
2056 if (first
>= n_range
) {
2057 isl_union_map_free(umap
);
2061 data
.v
= alloc_isl_fixed_map_array(ctx
, n
);
2065 for (data
.pos
= first
; data
.pos
< n_range
; ++data
.pos
) {
2071 fixed
= union_map_forall_user(umap
, &fixed_at_pos
, &data
);
2076 dim
= isl_union_map_get_space(umap
);
2077 injective
= separates(data
.v
, n
, dim
, data
.pos
, n_range
);
2078 isl_union_map_free(umap
);
2082 free_isl_fixed_map_array(data
.v
, n
);
2083 isl_union_map_free(umap
);
2087 free_isl_fixed_map_array(data
.v
, n
);
2088 isl_union_map_free(umap
);
2092 /* Check whether the maps in umap that map to subsets of "ran"
2093 * have obviously distinct ranges.
2095 static int plain_injective_on_range_wrap(__isl_keep isl_set
*ran
, void *user
)
2097 isl_union_map
*umap
= user
;
2099 umap
= isl_union_map_copy(umap
);
2100 umap
= isl_union_map_intersect_range(umap
,
2101 isl_union_set_from_set(isl_set_copy(ran
)));
2102 return plain_injective_on_range(umap
, 0, isl_set_dim(ran
, isl_dim_set
));
2105 /* Check if the given union_map is obviously injective.
2107 * In particular, we first check if all individual maps are obviously
2108 * injective and then check if all the ranges of these maps are
2109 * obviously disjoint.
2111 int isl_union_map_plain_is_injective(__isl_keep isl_union_map
*umap
)
2114 isl_union_map
*univ
;
2117 in
= union_map_forall(umap
, &isl_map_plain_is_injective
);
2123 univ
= isl_union_map_universe(isl_union_map_copy(umap
));
2124 ran
= isl_union_map_range(univ
);
2126 in
= union_map_forall_user(ran
, &plain_injective_on_range_wrap
, umap
);
2128 isl_union_set_free(ran
);
2133 int isl_union_map_is_bijective(__isl_keep isl_union_map
*umap
)
2137 sv
= isl_union_map_is_single_valued(umap
);
2141 return isl_union_map_is_injective(umap
);
2144 static int zip_entry(void **entry
, void *user
)
2146 isl_map
*map
= *entry
;
2147 isl_union_map
**res
= user
;
2149 if (!isl_map_can_zip(map
))
2152 *res
= isl_union_map_add_map(*res
, isl_map_zip(isl_map_copy(map
)));
2157 __isl_give isl_union_map
*isl_union_map_zip(__isl_take isl_union_map
*umap
)
2159 return cond_un_op(umap
, &zip_entry
);
2162 static int lift_entry(void **entry
, void *user
)
2164 isl_set
*set
= *entry
;
2165 isl_union_set
**res
= user
;
2167 *res
= isl_union_set_add_set(*res
, isl_set_lift(isl_set_copy(set
)));
2172 __isl_give isl_union_set
*isl_union_set_lift(__isl_take isl_union_set
*uset
)
2174 return cond_un_op(uset
, &lift_entry
);
2177 static int coefficients_entry(void **entry
, void *user
)
2179 isl_set
*set
= *entry
;
2180 isl_union_set
**res
= user
;
2182 set
= isl_set_copy(set
);
2183 set
= isl_set_from_basic_set(isl_set_coefficients(set
));
2184 *res
= isl_union_set_add_set(*res
, set
);
2189 __isl_give isl_union_set
*isl_union_set_coefficients(
2190 __isl_take isl_union_set
*uset
)
2199 ctx
= isl_union_set_get_ctx(uset
);
2200 dim
= isl_space_set_alloc(ctx
, 0, 0);
2201 res
= isl_union_map_alloc(dim
, uset
->table
.n
);
2202 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2203 &coefficients_entry
, &res
) < 0)
2206 isl_union_set_free(uset
);
2209 isl_union_set_free(uset
);
2210 isl_union_set_free(res
);
2214 static int solutions_entry(void **entry
, void *user
)
2216 isl_set
*set
= *entry
;
2217 isl_union_set
**res
= user
;
2219 set
= isl_set_copy(set
);
2220 set
= isl_set_from_basic_set(isl_set_solutions(set
));
2222 *res
= isl_union_set_from_set(set
);
2224 *res
= isl_union_set_add_set(*res
, set
);
2232 __isl_give isl_union_set
*isl_union_set_solutions(
2233 __isl_take isl_union_set
*uset
)
2235 isl_union_set
*res
= NULL
;
2240 if (uset
->table
.n
== 0) {
2241 res
= isl_union_set_empty(isl_union_set_get_space(uset
));
2242 isl_union_set_free(uset
);
2246 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2247 &solutions_entry
, &res
) < 0)
2250 isl_union_set_free(uset
);
2253 isl_union_set_free(uset
);
2254 isl_union_set_free(res
);