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);
243 void isl_union_set_free(__isl_take isl_union_set *uset)
245 isl_union_map_free(uset);
248 static int has_dim(const void *entry, const void *val)
250 isl_map *map = (isl_map *)entry;
251 isl_dim *dim = (isl_dim *)val;
253 return isl_dim_equal(map->dim, dim);
256 __isl_give isl_union_map *isl_union_map_add_map(__isl_take isl_union_map *umap,
257 __isl_take isl_map *map)
260 struct isl_hash_table_entry *entry;
262 if (isl_map_plain_is_empty(map)) {
267 umap = isl_union_map_cow(umap);
272 isl_assert(map->ctx, isl_dim_match(map->dim, isl_dim_param, umap->dim,
273 isl_dim_param), goto error);
275 hash = isl_dim_get_hash(map->dim);
276 entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
277 &has_dim, map->dim, 1);
284 entry->data = isl_map_union(entry->data, isl_map_copy(map));
293 isl_union_map_free(umap);
297 __isl_give isl_union_set *isl_union_set_add_set(__isl_take isl_union_set *uset,
298 __isl_take isl_set *set)
300 return isl_union_map_add_map(uset, (isl_map *)set);
303 __isl_give isl_union_map *isl_union_map_from_map(__isl_take isl_map *map)
311 dim = isl_map_get_dim(map);
312 dim = isl_dim_drop(dim, isl_dim_in, 0, isl_dim_size(dim, isl_dim_in));
313 dim = isl_dim_drop(dim, isl_dim_out, 0, isl_dim_size(dim, isl_dim_out));
314 umap = isl_union_map_empty(dim);
315 umap = isl_union_map_add_map(umap, map);
320 __isl_give isl_union_set *isl_union_set_from_set(__isl_take isl_set *set)
322 return isl_union_map_from_map((isl_map *)set);
325 struct isl_union_map_foreach_data
327 int (*fn)(__isl_take isl_map *map, void *user);
331 static int call_on_copy(void **entry, void *user)
333 isl_map *map = *entry;
334 struct isl_union_map_foreach_data *data;
335 data = (struct isl_union_map_foreach_data *)user;
337 return data->fn(isl_map_copy(map), data->user);
340 int isl_union_map_n_map(__isl_keep isl_union_map *umap)
342 return umap ? umap->table.n : 0;
345 int isl_union_set_n_set(__isl_keep isl_union_set *uset)
347 return uset ? uset->table.n : 0;
350 int isl_union_map_foreach_map(__isl_keep isl_union_map *umap,
351 int (*fn)(__isl_take isl_map *map, void *user), void *user)
353 struct isl_union_map_foreach_data data = { fn, user };
358 return isl_hash_table_foreach(umap->dim->ctx, &umap->table,
359 &call_on_copy, &data);
362 static int copy_map(void **entry, void *user)
364 isl_map *map = *entry;
365 isl_map **map_p = user;
367 *map_p = isl_map_copy(map);
372 __isl_give isl_map *isl_union_map_copy_map(__isl_keep isl_union_map *umap)
376 if (!umap || umap->table.n == 0)
379 isl_hash_table_foreach(umap->dim->ctx, &umap->table, ©_map, &map);
384 __isl_give isl_set *isl_union_set_copy_set(__isl_keep isl_union_set *uset)
386 return isl_union_map_copy_map(uset);
389 __isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap,
390 __isl_take isl_dim *dim)
393 struct isl_hash_table_entry *entry;
398 hash = isl_dim_get_hash(dim);
399 entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
402 return isl_map_empty(dim);
404 return isl_map_copy(entry->data);
410 __isl_give isl_set *isl_union_set_extract_set(__isl_keep isl_union_set *uset,
411 __isl_take isl_dim *dim)
413 return (isl_set *)isl_union_map_extract_map(uset, dim);
416 /* Check if umap contains a map in the given space.
418 __isl_give int isl_union_map_contains(__isl_keep isl_union_map *umap,
419 __isl_keep isl_dim *dim)
422 struct isl_hash_table_entry *entry;
427 hash = isl_dim_get_hash(dim);
428 entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
433 __isl_give int isl_union_set_contains(__isl_keep isl_union_set *uset,
434 __isl_keep isl_dim *dim)
436 return isl_union_map_contains(uset, dim);
439 int isl_union_set_foreach_set(__isl_keep isl_union_set *uset,
440 int (*fn)(__isl_take isl_set *set, void *user), void *user)
442 return isl_union_map_foreach_map(uset,
443 (int(*)(__isl_take isl_map *, void*))fn, user);
446 struct isl_union_set_foreach_point_data {
447 int (*fn)(__isl_take isl_point *pnt, void *user);
451 static int foreach_point(__isl_take isl_set *set, void *user)
453 struct isl_union_set_foreach_point_data *data = user;
456 r = isl_set_foreach_point(set, data->fn, data->user);
462 int isl_union_set_foreach_point(__isl_keep isl_union_set *uset,
463 int (*fn)(__isl_take isl_point *pnt, void *user), void *user)
465 struct isl_union_set_foreach_point_data data = { fn, user };
466 return isl_union_set_foreach_set(uset, &foreach_point, &data);
469 struct isl_union_map_gen_bin_data {
470 isl_union_map *umap2;
474 static int subtract_entry(void **entry, void *user)
476 struct isl_union_map_gen_bin_data *data = user;
478 struct isl_hash_table_entry *entry2;
479 isl_map *map = *entry;
481 hash = isl_dim_get_hash(map->dim);
482 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
483 hash, &has_dim, map->dim, 0);
484 map = isl_map_copy(map);
487 map = isl_map_subtract(map, isl_map_copy(entry2->data));
489 empty = isl_map_is_empty(map);
499 data->res = isl_union_map_add_map(data->res, map);
504 static __isl_give isl_union_map *gen_bin_op(__isl_take isl_union_map *umap1,
505 __isl_take isl_union_map *umap2, int (*fn)(void **, void *))
507 struct isl_union_map_gen_bin_data data = { NULL, NULL };
509 umap1 = isl_union_map_align_params(umap1, isl_union_map_get_dim(umap2));
510 umap2 = isl_union_map_align_params(umap2, isl_union_map_get_dim(umap1));
512 if (!umap1 || !umap2)
516 data.res = isl_union_map_alloc(isl_dim_copy(umap1->dim),
518 if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
522 isl_union_map_free(umap1);
523 isl_union_map_free(umap2);
526 isl_union_map_free(umap1);
527 isl_union_map_free(umap2);
528 isl_union_map_free(data.res);
532 __isl_give isl_union_map *isl_union_map_subtract(
533 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
535 return gen_bin_op(umap1, umap2, &subtract_entry);
538 __isl_give isl_union_set *isl_union_set_subtract(
539 __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
541 return isl_union_map_subtract(uset1, uset2);
544 struct isl_union_map_match_bin_data {
545 isl_union_map *umap2;
547 __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*);
550 static int match_bin_entry(void **entry, void *user)
552 struct isl_union_map_match_bin_data *data = user;
554 struct isl_hash_table_entry *entry2;
555 isl_map *map = *entry;
558 hash = isl_dim_get_hash(map->dim);
559 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
560 hash, &has_dim, map->dim, 0);
564 map = isl_map_copy(map);
565 map = data->fn(map, isl_map_copy(entry2->data));
567 empty = isl_map_is_empty(map);
577 data->res = isl_union_map_add_map(data->res, map);
582 static __isl_give isl_union_map *match_bin_op(__isl_take isl_union_map *umap1,
583 __isl_take isl_union_map *umap2,
584 __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*))
586 struct isl_union_map_match_bin_data data = { NULL, NULL, fn };
588 umap1 = isl_union_map_align_params(umap1, isl_union_map_get_dim(umap2));
589 umap2 = isl_union_map_align_params(umap2, isl_union_map_get_dim(umap1));
591 if (!umap1 || !umap2)
595 data.res = isl_union_map_alloc(isl_dim_copy(umap1->dim),
597 if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
598 &match_bin_entry, &data) < 0)
601 isl_union_map_free(umap1);
602 isl_union_map_free(umap2);
605 isl_union_map_free(umap1);
606 isl_union_map_free(umap2);
607 isl_union_map_free(data.res);
611 __isl_give isl_union_map *isl_union_map_intersect(
612 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
614 return match_bin_op(umap1, umap2, &isl_map_intersect);
617 __isl_give isl_union_set *isl_union_set_intersect(
618 __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
620 return isl_union_map_intersect(uset1, uset2);
623 __isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap,
624 __isl_take isl_union_map *context)
626 return match_bin_op(umap, context, &isl_map_gist);
629 __isl_give isl_union_set *isl_union_set_gist(__isl_take isl_union_set *uset,
630 __isl_take isl_union_set *context)
632 return isl_union_map_gist(uset, context);
635 static __isl_give isl_map *lex_le_set(__isl_take isl_map *set1,
636 __isl_take isl_map *set2)
638 return isl_set_lex_le_set((isl_set *)set1, (isl_set *)set2);
641 static __isl_give isl_map *lex_lt_set(__isl_take isl_map *set1,
642 __isl_take isl_map *set2)
644 return isl_set_lex_lt_set((isl_set *)set1, (isl_set *)set2);
647 __isl_give isl_union_map *isl_union_set_lex_lt_union_set(
648 __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
650 return match_bin_op(uset1, uset2, &lex_lt_set);
653 __isl_give isl_union_map *isl_union_set_lex_le_union_set(
654 __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
656 return match_bin_op(uset1, uset2, &lex_le_set);
659 __isl_give isl_union_map *isl_union_set_lex_gt_union_set(
660 __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
662 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2, uset1));
665 __isl_give isl_union_map *isl_union_set_lex_ge_union_set(
666 __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
668 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2, uset1));
671 __isl_give isl_union_map *isl_union_map_lex_gt_union_map(
672 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
674 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2, umap1));
677 __isl_give isl_union_map *isl_union_map_lex_ge_union_map(
678 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
680 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2, umap1));
683 static int intersect_domain_entry(void **entry, void *user)
685 struct isl_union_map_gen_bin_data *data = user;
687 struct isl_hash_table_entry *entry2;
689 isl_map *map = *entry;
692 dim = isl_map_get_dim(map);
693 dim = isl_dim_domain(dim);
694 hash = isl_dim_get_hash(dim);
695 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
696 hash, &has_dim, dim, 0);
701 map = isl_map_copy(map);
702 map = isl_map_intersect_domain(map, isl_set_copy(entry2->data));
704 empty = isl_map_is_empty(map);
714 data->res = isl_union_map_add_map(data->res, map);
719 __isl_give isl_union_map *isl_union_map_intersect_domain(
720 __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
722 return gen_bin_op(umap, uset, &intersect_domain_entry);
725 static int intersect_range_entry(void **entry, void *user)
727 struct isl_union_map_gen_bin_data *data = user;
729 struct isl_hash_table_entry *entry2;
731 isl_map *map = *entry;
734 dim = isl_map_get_dim(map);
735 dim = isl_dim_range(dim);
736 hash = isl_dim_get_hash(dim);
737 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
738 hash, &has_dim, dim, 0);
743 map = isl_map_copy(map);
744 map = isl_map_intersect_range(map, isl_set_copy(entry2->data));
746 empty = isl_map_is_empty(map);
756 data->res = isl_union_map_add_map(data->res, map);
761 __isl_give isl_union_map *isl_union_map_intersect_range(
762 __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
764 return gen_bin_op(umap, uset, &intersect_range_entry);
767 struct isl_union_map_bin_data {
768 isl_union_map *umap2;
771 int (*fn)(void **entry, void *user);
774 static int apply_range_entry(void **entry, void *user)
776 struct isl_union_map_bin_data *data = user;
777 isl_map *map2 = *entry;
780 if (!isl_dim_tuple_match(data->map->dim, isl_dim_out,
781 map2->dim, isl_dim_in))
784 map2 = isl_map_apply_range(isl_map_copy(data->map), isl_map_copy(map2));
786 empty = isl_map_is_empty(map2);
796 data->res = isl_union_map_add_map(data->res, map2);
801 static int bin_entry(void **entry, void *user)
803 struct isl_union_map_bin_data *data = user;
804 isl_map *map = *entry;
807 if (isl_hash_table_foreach(data->umap2->dim->ctx, &data->umap2->table,
814 static __isl_give isl_union_map *bin_op(__isl_take isl_union_map *umap1,
815 __isl_take isl_union_map *umap2, int (*fn)(void **entry, void *user))
817 struct isl_union_map_bin_data data = { NULL, NULL, NULL, fn };
819 umap1 = isl_union_map_align_params(umap1, isl_union_map_get_dim(umap2));
820 umap2 = isl_union_map_align_params(umap2, isl_union_map_get_dim(umap1));
822 if (!umap1 || !umap2)
826 data.res = isl_union_map_alloc(isl_dim_copy(umap1->dim),
828 if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
829 &bin_entry, &data) < 0)
832 isl_union_map_free(umap1);
833 isl_union_map_free(umap2);
836 isl_union_map_free(umap1);
837 isl_union_map_free(umap2);
838 isl_union_map_free(data.res);
842 __isl_give isl_union_map *isl_union_map_apply_range(
843 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
845 return bin_op(umap1, umap2, &apply_range_entry);
848 __isl_give isl_union_map *isl_union_map_apply_domain(
849 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
851 umap1 = isl_union_map_reverse(umap1);
852 umap1 = isl_union_map_apply_range(umap1, umap2);
853 return isl_union_map_reverse(umap1);
856 __isl_give isl_union_set *isl_union_set_apply(
857 __isl_take isl_union_set *uset, __isl_take isl_union_map *umap)
859 return isl_union_map_apply_range(uset, umap);
862 static int map_lex_lt_entry(void **entry, void *user)
864 struct isl_union_map_bin_data *data = user;
865 isl_map *map2 = *entry;
867 if (!isl_dim_tuple_match(data->map->dim, isl_dim_out,
868 map2->dim, isl_dim_out))
871 map2 = isl_map_lex_lt_map(isl_map_copy(data->map), isl_map_copy(map2));
873 data->res = isl_union_map_add_map(data->res, map2);
878 __isl_give isl_union_map *isl_union_map_lex_lt_union_map(
879 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
881 return bin_op(umap1, umap2, &map_lex_lt_entry);
884 static int map_lex_le_entry(void **entry, void *user)
886 struct isl_union_map_bin_data *data = user;
887 isl_map *map2 = *entry;
889 if (!isl_dim_tuple_match(data->map->dim, isl_dim_out,
890 map2->dim, isl_dim_out))
893 map2 = isl_map_lex_le_map(isl_map_copy(data->map), isl_map_copy(map2));
895 data->res = isl_union_map_add_map(data->res, map2);
900 __isl_give isl_union_map *isl_union_map_lex_le_union_map(
901 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
903 return bin_op(umap1, umap2, &map_lex_le_entry);
906 static int product_entry(void **entry, void *user)
908 struct isl_union_map_bin_data *data = user;
909 isl_map *map2 = *entry;
911 map2 = isl_map_product(isl_map_copy(data->map), isl_map_copy(map2));
913 data->res = isl_union_map_add_map(data->res, map2);
918 __isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1,
919 __isl_take isl_union_map *umap2)
921 return bin_op(umap1, umap2, &product_entry);
924 __isl_give isl_union_set *isl_union_set_product(__isl_take isl_union_set *uset1,
925 __isl_take isl_union_set *uset2)
927 return isl_union_map_product(uset1, uset2);
930 static int range_product_entry(void **entry, void *user)
932 struct isl_union_map_bin_data *data = user;
933 isl_map *map2 = *entry;
935 if (!isl_dim_tuple_match(data->map->dim, isl_dim_in,
936 map2->dim, isl_dim_in))
939 map2 = isl_map_range_product(isl_map_copy(data->map),
942 data->res = isl_union_map_add_map(data->res, map2);
947 __isl_give isl_union_map *isl_union_map_range_product(
948 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
950 return bin_op(umap1, umap2, &range_product_entry);
953 static int flat_range_product_entry(void **entry, void *user)
955 struct isl_union_map_bin_data *data = user;
956 isl_map *map2 = *entry;
958 if (!isl_dim_tuple_match(data->map->dim, isl_dim_in,
959 map2->dim, isl_dim_in))
962 map2 = isl_map_flat_range_product(isl_map_copy(data->map),
965 data->res = isl_union_map_add_map(data->res, map2);
970 __isl_give isl_union_map *isl_union_map_flat_range_product(
971 __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
973 return bin_op(umap1, umap2, &flat_range_product_entry);
976 __isl_give isl_union_map *isl_union_map_from_range(
977 __isl_take isl_union_set *uset)
982 __isl_give isl_union_map *isl_union_map_from_domain(
983 __isl_take isl_union_set *uset)
985 return isl_union_map_reverse(isl_union_map_from_range(uset));
988 __isl_give isl_union_map *isl_union_map_from_domain_and_range(
989 __isl_take isl_union_set *domain, __isl_take isl_union_set *range)
991 return isl_union_map_apply_range(isl_union_map_from_domain(domain),
992 isl_union_map_from_range(range));
995 static __isl_give isl_union_map *un_op(__isl_take isl_union_map *umap,
996 int (*fn)(void **, void *))
998 umap = isl_union_map_cow(umap);
1002 if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, NULL) < 0)
1007 isl_union_map_free(umap);
1011 static int affine_entry(void **entry, void *user)
1013 isl_map **map = (isl_map **)entry;
1015 *map = isl_map_from_basic_map(isl_map_affine_hull(*map));
1017 return *map ? 0 : -1;
1020 __isl_give isl_union_map *isl_union_map_affine_hull(
1021 __isl_take isl_union_map *umap)
1023 return un_op(umap, &affine_entry);
1026 __isl_give isl_union_set *isl_union_set_affine_hull(
1027 __isl_take isl_union_set *uset)
1029 return isl_union_map_affine_hull(uset);
1032 static int polyhedral_entry(void **entry, void *user)
1034 isl_map **map = (isl_map **)entry;
1036 *map = isl_map_from_basic_map(isl_map_polyhedral_hull(*map));
1038 return *map ? 0 : -1;
1041 __isl_give isl_union_map *isl_union_map_polyhedral_hull(
1042 __isl_take isl_union_map *umap)
1044 return un_op(umap, &polyhedral_entry);
1047 __isl_give isl_union_set *isl_union_set_polyhedral_hull(
1048 __isl_take isl_union_set *uset)
1050 return isl_union_map_polyhedral_hull(uset);
1053 static int simple_entry(void **entry, void *user)
1055 isl_map **map = (isl_map **)entry;
1057 *map = isl_map_from_basic_map(isl_map_simple_hull(*map));
1059 return *map ? 0 : -1;
1062 __isl_give isl_union_map *isl_union_map_simple_hull(
1063 __isl_take isl_union_map *umap)
1065 return un_op(umap, &simple_entry);
1068 __isl_give isl_union_set *isl_union_set_simple_hull(
1069 __isl_take isl_union_set *uset)
1071 return isl_union_map_simple_hull(uset);
1074 static int inplace_entry(void **entry, void *user)
1076 __isl_give isl_map *(*fn)(__isl_take isl_map *);
1077 isl_map **map = (isl_map **)entry;
1080 fn = *(__isl_give isl_map *(**)(__isl_take isl_map *)) user;
1081 copy = fn(isl_map_copy(*map));
1091 static __isl_give isl_union_map *inplace(__isl_take isl_union_map *umap,
1092 __isl_give isl_map *(*fn)(__isl_take isl_map *))
1097 if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1098 &inplace_entry, &fn) < 0)
1103 isl_union_map_free(umap);
1107 __isl_give isl_union_map *isl_union_map_coalesce(
1108 __isl_take isl_union_map *umap)
1110 return inplace(umap, &isl_map_coalesce);
1113 __isl_give isl_union_set *isl_union_set_coalesce(
1114 __isl_take isl_union_set *uset)
1116 return isl_union_map_coalesce(uset);
1119 __isl_give isl_union_map *isl_union_map_detect_equalities(
1120 __isl_take isl_union_map *umap)
1122 return inplace(umap, &isl_map_detect_equalities);
1125 __isl_give isl_union_set *isl_union_set_detect_equalities(
1126 __isl_take isl_union_set *uset)
1128 return isl_union_map_detect_equalities(uset);
1131 __isl_give isl_union_map *isl_union_map_compute_divs(
1132 __isl_take isl_union_map *umap)
1134 return inplace(umap, &isl_map_compute_divs);
1137 __isl_give isl_union_set *isl_union_set_compute_divs(
1138 __isl_take isl_union_set *uset)
1140 return isl_union_map_compute_divs(uset);
1143 static int lexmin_entry(void **entry, void *user)
1145 isl_map **map = (isl_map **)entry;
1147 *map = isl_map_lexmin(*map);
1149 return *map ? 0 : -1;
1152 __isl_give isl_union_map *isl_union_map_lexmin(
1153 __isl_take isl_union_map *umap)
1155 return un_op(umap, &lexmin_entry);
1158 __isl_give isl_union_set *isl_union_set_lexmin(
1159 __isl_take isl_union_set *uset)
1161 return isl_union_map_lexmin(uset);
1164 static int lexmax_entry(void **entry, void *user)
1166 isl_map **map = (isl_map **)entry;
1168 *map = isl_map_lexmax(*map);
1170 return *map ? 0 : -1;
1173 __isl_give isl_union_map *isl_union_map_lexmax(
1174 __isl_take isl_union_map *umap)
1176 return un_op(umap, &lexmax_entry);
1179 __isl_give isl_union_set *isl_union_set_lexmax(
1180 __isl_take isl_union_set *uset)
1182 return isl_union_map_lexmax(uset);
1185 static __isl_give isl_union_set *cond_un_op(__isl_take isl_union_map *umap,
1186 int (*fn)(void **, void *))
1193 res = isl_union_map_alloc(isl_dim_copy(umap->dim), umap->table.n);
1194 if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, &res) < 0)
1197 isl_union_map_free(umap);
1200 isl_union_map_free(umap);
1201 isl_union_set_free(res);
1205 static int universe_entry(void **entry, void *user)
1207 isl_map *map = *entry;
1208 isl_union_map **res = user;
1210 map = isl_map_universe(isl_map_get_dim(map));
1211 *res = isl_union_map_add_map(*res, map);
1216 __isl_give isl_union_map *isl_union_map_universe(__isl_take isl_union_map *umap)
1218 return cond_un_op(umap, &universe_entry);
1221 __isl_give isl_union_set *isl_union_set_universe(__isl_take isl_union_set *uset)
1223 return isl_union_map_universe(uset);
1226 static int reverse_entry(void **entry, void *user)
1228 isl_map *map = *entry;
1229 isl_union_map **res = user;
1231 *res = isl_union_map_add_map(*res, isl_map_reverse(isl_map_copy(map)));
1236 __isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap)
1238 return cond_un_op(umap, &reverse_entry);
1241 static int domain_entry(void **entry, void *user)
1243 isl_map *map = *entry;
1244 isl_union_set **res = user;
1246 *res = isl_union_set_add_set(*res, isl_map_domain(isl_map_copy(map)));
1251 __isl_give isl_union_set *isl_union_map_domain(__isl_take isl_union_map *umap)
1253 return cond_un_op(umap, &domain_entry);
1256 static int range_entry(void **entry, void *user)
1258 isl_map *map = *entry;
1259 isl_union_set **res = user;
1261 *res = isl_union_set_add_set(*res, isl_map_range(isl_map_copy(map)));
1266 __isl_give isl_union_set *isl_union_map_range(__isl_take isl_union_map *umap)
1268 return cond_un_op(umap, &range_entry);
1271 static int domain_map_entry(void **entry, void *user)
1273 isl_map *map = *entry;
1274 isl_union_set **res = user;
1276 *res = isl_union_map_add_map(*res,
1277 isl_map_domain_map(isl_map_copy(map)));
1282 __isl_give isl_union_map *isl_union_map_domain_map(
1283 __isl_take isl_union_map *umap)
1285 return cond_un_op(umap, &domain_map_entry);
1288 static int range_map_entry(void **entry, void *user)
1290 isl_map *map = *entry;
1291 isl_union_set **res = user;
1293 *res = isl_union_map_add_map(*res,
1294 isl_map_range_map(isl_map_copy(map)));
1299 __isl_give isl_union_map *isl_union_map_range_map(
1300 __isl_take isl_union_map *umap)
1302 return cond_un_op(umap, &range_map_entry);
1305 static int deltas_entry(void **entry, void *user)
1307 isl_map *map = *entry;
1308 isl_union_set **res = user;
1310 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1313 *res = isl_union_set_add_set(*res, isl_map_deltas(isl_map_copy(map)));
1318 __isl_give isl_union_set *isl_union_map_deltas(__isl_take isl_union_map *umap)
1320 return cond_un_op(umap, &deltas_entry);
1323 static int deltas_map_entry(void **entry, void *user)
1325 isl_map *map = *entry;
1326 isl_union_map **res = user;
1328 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1331 *res = isl_union_map_add_map(*res,
1332 isl_map_deltas_map(isl_map_copy(map)));
1337 __isl_give isl_union_map *isl_union_map_deltas_map(
1338 __isl_take isl_union_map *umap)
1340 return cond_un_op(umap, &deltas_map_entry);
1343 static int identity_entry(void **entry, void *user)
1345 isl_set *set = *entry;
1346 isl_union_map **res = user;
1348 *res = isl_union_map_add_map(*res, isl_set_identity(isl_set_copy(set)));
1353 __isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_set *uset)
1355 return cond_un_op(uset, &identity_entry);
1358 static int unwrap_entry(void **entry, void *user)
1360 isl_set *set = *entry;
1361 isl_union_set **res = user;
1363 if (!isl_set_is_wrapping(set))
1366 *res = isl_union_map_add_map(*res, isl_set_unwrap(isl_set_copy(set)));
1371 __isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_set *uset)
1373 return cond_un_op(uset, &unwrap_entry);
1376 static int wrap_entry(void **entry, void *user)
1378 isl_map *map = *entry;
1379 isl_union_set **res = user;
1381 *res = isl_union_set_add_set(*res, isl_map_wrap(isl_map_copy(map)));
1386 __isl_give isl_union_set *isl_union_map_wrap(__isl_take isl_union_map *umap)
1388 return cond_un_op(umap, &wrap_entry);
1391 struct isl_union_map_is_subset_data {
1392 isl_union_map *umap2;
1396 static int is_subset_entry(void **entry, void *user)
1398 struct isl_union_map_is_subset_data *data = user;
1400 struct isl_hash_table_entry *entry2;
1401 isl_map *map = *entry;
1403 hash = isl_dim_get_hash(map->dim);
1404 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
1405 hash, &has_dim, map->dim, 0);
1407 data->is_subset = 0;
1411 data->is_subset = isl_map_is_subset(map, entry2->data);
1412 if (data->is_subset < 0 || !data->is_subset)
1418 int isl_union_map_is_subset(__isl_keep isl_union_map *umap1,
1419 __isl_keep isl_union_map *umap2)
1421 struct isl_union_map_is_subset_data data = { NULL, 1 };
1423 umap1 = isl_union_map_copy(umap1);
1424 umap2 = isl_union_map_copy(umap2);
1425 umap1 = isl_union_map_align_params(umap1, isl_union_map_get_dim(umap2));
1426 umap2 = isl_union_map_align_params(umap2, isl_union_map_get_dim(umap1));
1428 if (!umap1 || !umap2)
1432 if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
1433 &is_subset_entry, &data) < 0 &&
1437 isl_union_map_free(umap1);
1438 isl_union_map_free(umap2);
1440 return data.is_subset;
1442 isl_union_map_free(umap1);
1443 isl_union_map_free(umap2);
1447 int isl_union_set_is_subset(__isl_keep isl_union_set *uset1,
1448 __isl_keep isl_union_set *uset2)
1450 return isl_union_map_is_subset(uset1, uset2);
1453 int isl_union_map_is_equal(__isl_keep isl_union_map *umap1,
1454 __isl_keep isl_union_map *umap2)
1458 if (!umap1 || !umap2)
1460 is_subset = isl_union_map_is_subset(umap1, umap2);
1463 is_subset = isl_union_map_is_subset(umap2, umap1);
1467 int isl_union_set_is_equal(__isl_keep isl_union_set *uset1,
1468 __isl_keep isl_union_set *uset2)
1470 return isl_union_map_is_equal(uset1, uset2);
1473 int isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1,
1474 __isl_keep isl_union_map *umap2)
1478 if (!umap1 || !umap2)
1480 is_subset = isl_union_map_is_subset(umap1, umap2);
1483 is_subset = isl_union_map_is_subset(umap2, umap1);
1484 if (is_subset == -1)
1489 int isl_union_set_is_strict_subset(__isl_keep isl_union_set *uset1,
1490 __isl_keep isl_union_set *uset2)
1492 return isl_union_map_is_strict_subset(uset1, uset2);
1495 static int sample_entry(void **entry, void *user)
1497 isl_basic_map **sample = (isl_basic_map **)user;
1498 isl_map *map = *entry;
1500 *sample = isl_map_sample(isl_map_copy(map));
1503 if (!isl_basic_map_plain_is_empty(*sample))
1508 __isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap)
1510 isl_basic_map *sample = NULL;
1515 if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1516 &sample_entry, &sample) < 0 &&
1521 sample = isl_basic_map_empty(isl_union_map_get_dim(umap));
1523 isl_union_map_free(umap);
1527 isl_union_map_free(umap);
1531 __isl_give isl_basic_set *isl_union_set_sample(__isl_take isl_union_set *uset)
1533 return (isl_basic_set *)isl_union_map_sample(uset);
1536 struct isl_forall_data {
1538 int (*fn)(__isl_keep isl_map *map);
1541 static int forall_entry(void **entry, void *user)
1543 struct isl_forall_data *data = user;
1544 isl_map *map = *entry;
1546 data->res = data->fn(map);
1556 static int union_map_forall(__isl_keep isl_union_map *umap,
1557 int (*fn)(__isl_keep isl_map *map))
1559 struct isl_forall_data data = { 1, fn };
1564 if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1565 &forall_entry, &data) < 0 && data.res)
1571 struct isl_forall_user_data {
1573 int (*fn)(__isl_keep isl_map *map, void *user);
1577 static int forall_user_entry(void **entry, void *user)
1579 struct isl_forall_user_data *data = user;
1580 isl_map *map = *entry;
1582 data->res = data->fn(map, data->user);
1592 /* Check if fn(map, user) returns true for all maps "map" in umap.
1594 static int union_map_forall_user(__isl_keep isl_union_map *umap,
1595 int (*fn)(__isl_keep isl_map *map, void *user), void *user)
1597 struct isl_forall_user_data data = { 1, fn, user };
1602 if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1603 &forall_user_entry, &data) < 0 && data.res)
1609 int isl_union_map_is_empty(__isl_keep isl_union_map *umap)
1611 return union_map_forall(umap, &isl_map_is_empty);
1614 int isl_union_set_is_empty(__isl_keep isl_union_set *uset)
1616 return isl_union_map_is_empty(uset);
1619 static int is_subset_of_identity(__isl_keep isl_map *map)
1628 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1631 dim = isl_map_get_dim(map);
1632 id = isl_map_identity(dim);
1634 is_subset = isl_map_is_subset(map, id);
1641 /* Check if the given map is single-valued.
1646 * and check if the result is a subset of the identity mapping.
1648 int isl_union_map_is_single_valued(__isl_keep isl_union_map *umap)
1650 isl_union_map *test;
1653 if (isl_union_map_n_map(umap) == 1) {
1654 isl_map *map = isl_union_map_copy_map(umap);
1655 sv = isl_map_is_single_valued(map);
1660 test = isl_union_map_reverse(isl_union_map_copy(umap));
1661 test = isl_union_map_apply_range(test, isl_union_map_copy(umap));
1663 sv = union_map_forall(test, &is_subset_of_identity);
1665 isl_union_map_free(test);
1670 int isl_union_map_is_injective(__isl_keep isl_union_map *umap)
1674 umap = isl_union_map_copy(umap);
1675 umap = isl_union_map_reverse(umap);
1676 in = isl_union_map_is_single_valued(umap);
1677 isl_union_map_free(umap);
1682 /* Represents a map that has a fixed value (v) for one of its
1684 * The map in this structure is not reference counted, so it
1685 * is only valid while the isl_union_map from which it was
1686 * obtained is still alive.
1688 struct isl_fixed_map {
1693 static struct isl_fixed_map *alloc_isl_fixed_map_array(isl_ctx *ctx,
1697 struct isl_fixed_map *v;
1699 v = isl_calloc_array(ctx, struct isl_fixed_map, n);
1702 for (i = 0; i < n; ++i)
1703 isl_int_init(v[i].v);
1707 static void free_isl_fixed_map_array(struct isl_fixed_map *v, int n)
1713 for (i = 0; i < n; ++i)
1714 isl_int_clear(v[i].v);
1718 /* Compare the "v" field of two isl_fixed_map structs.
1720 static int qsort_fixed_map_cmp(const void *p1, const void *p2)
1722 const struct isl_fixed_map *e1 = (const struct isl_fixed_map *) p1;
1723 const struct isl_fixed_map *e2 = (const struct isl_fixed_map *) p2;
1725 return isl_int_cmp(e1->v, e2->v);
1728 /* Internal data structure used while checking whether all maps
1729 * in a union_map have a fixed value for a given output dimension.
1730 * v is the list of maps, with the fixed value for the dimension
1731 * n is the number of maps considered so far
1732 * pos is the output dimension under investigation
1734 struct isl_fixed_dim_data {
1735 struct isl_fixed_map *v;
1740 static int fixed_at_pos(__isl_keep isl_map *map, void *user)
1742 struct isl_fixed_dim_data *data = user;
1744 data->v[data->n].map = map;
1745 return isl_map_plain_is_fixed(map, isl_dim_out, data->pos,
1746 &data->v[data->n++].v);
1749 static int plain_injective_on_range(__isl_take isl_union_map *umap,
1750 int first, int n_range);
1752 /* Given a list of the maps, with their fixed values at output dimension "pos",
1753 * check whether the ranges of the maps form an obvious partition.
1755 * We first sort the maps according to their fixed values.
1756 * If all maps have a different value, then we know the ranges form
1758 * Otherwise, we collect the maps with the same fixed value and
1759 * check whether each such collection is obviously injective
1760 * based on later dimensions.
1762 static int separates(struct isl_fixed_map *v, int n,
1763 __isl_take isl_dim *dim, int pos, int n_range)
1770 qsort(v, n, sizeof(*v), &qsort_fixed_map_cmp);
1772 for (i = 0; i + 1 < n; ++i) {
1774 isl_union_map *part;
1777 for (j = i + 1; j < n; ++j)
1778 if (isl_int_ne(v[i].v, v[j].v))
1784 part = isl_union_map_alloc(isl_dim_copy(dim), j - i);
1785 for (k = i; k < j; ++k)
1786 part = isl_union_map_add_map(part,
1787 isl_map_copy(v[k].map));
1789 injective = plain_injective_on_range(part, pos + 1, n_range);
1799 free_isl_fixed_map_array(v, n);
1803 free_isl_fixed_map_array(v, n);
1807 /* Check whether the maps in umap have obviously distinct ranges.
1808 * In particular, check for an output dimension in the range
1809 * [first,n_range) for which all maps have a fixed value
1810 * and then check if these values, possibly along with fixed values
1811 * at later dimensions, entail distinct ranges.
1813 static int plain_injective_on_range(__isl_take isl_union_map *umap,
1814 int first, int n_range)
1818 struct isl_fixed_dim_data data = { NULL };
1820 ctx = isl_union_map_get_ctx(umap);
1825 n = isl_union_map_n_map(umap);
1827 isl_union_map_free(umap);
1831 if (first >= n_range) {
1832 isl_union_map_free(umap);
1836 data.v = alloc_isl_fixed_map_array(ctx, n);
1840 for (data.pos = first; data.pos < n_range; ++data.pos) {
1846 fixed = union_map_forall_user(umap, &fixed_at_pos, &data);
1851 dim = isl_union_map_get_dim(umap);
1852 injective = separates(data.v, n, dim, data.pos, n_range);
1853 isl_union_map_free(umap);
1857 free_isl_fixed_map_array(data.v, n);
1858 isl_union_map_free(umap);
1862 free_isl_fixed_map_array(data.v, n);
1863 isl_union_map_free(umap);
1867 /* Check whether the maps in umap that map to subsets of "ran"
1868 * have obviously distinct ranges.
1870 static int plain_injective_on_range_wrap(__isl_keep isl_set *ran, void *user)
1872 isl_union_map *umap = user;
1874 umap = isl_union_map_copy(umap);
1875 umap = isl_union_map_intersect_range(umap,
1876 isl_union_set_from_set(isl_set_copy(ran)));
1877 return plain_injective_on_range(umap, 0, isl_set_dim(ran, isl_dim_set));
1880 /* Check if the given union_map is obviously injective.
1882 * In particular, we first check if all individual maps are obviously
1883 * injective and then check if all the ranges of these maps are
1884 * obviously disjoint.
1886 int isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap)
1889 isl_union_map *univ;
1892 in = union_map_forall(umap, &isl_map_plain_is_injective);
1898 univ = isl_union_map_universe(isl_union_map_copy(umap));
1899 ran = isl_union_map_range(univ);
1901 in = union_map_forall_user(ran, &plain_injective_on_range_wrap, umap);
1903 isl_union_set_free(ran);
1908 int isl_union_map_is_bijective(__isl_keep isl_union_map *umap)
1912 sv = isl_union_map_is_single_valued(umap);
1916 return isl_union_map_is_injective(umap);
1919 static int zip_entry(void **entry, void *user)
1921 isl_map *map = *entry;
1922 isl_union_map **res = user;
1924 if (!isl_map_can_zip(map))
1927 *res = isl_union_map_add_map(*res, isl_map_zip(isl_map_copy(map)));
1932 __isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap)
1934 return cond_un_op(umap, &zip_entry);
1937 static int lift_entry(void **entry, void *user)
1939 isl_set *set = *entry;
1940 isl_union_set **res = user;
1942 *res = isl_union_set_add_set(*res, isl_set_lift(isl_set_copy(set)));
1947 __isl_give isl_union_set *isl_union_set_lift(__isl_take isl_union_set *uset)
1949 return cond_un_op(uset, &lift_entry);
1952 static int coefficients_entry(void **entry, void *user)
1954 isl_set *set = *entry;
1955 isl_union_set **res = user;
1957 set = isl_set_copy(set);
1958 set = isl_set_from_basic_set(isl_set_coefficients(set));
1959 *res = isl_union_set_add_set(*res, set);
1964 __isl_give isl_union_set *isl_union_set_coefficients(
1965 __isl_take isl_union_set *uset)
1974 ctx = isl_union_set_get_ctx(uset);
1975 dim = isl_dim_set_alloc(ctx, 0, 0);
1976 res = isl_union_map_alloc(dim, uset->table.n);
1977 if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
1978 &coefficients_entry, &res) < 0)
1981 isl_union_set_free(uset);
1984 isl_union_set_free(uset);
1985 isl_union_set_free(res);
1989 static int solutions_entry(void **entry, void *user)
1991 isl_set *set = *entry;
1992 isl_union_set **res = user;
1994 set = isl_set_copy(set);
1995 set = isl_set_from_basic_set(isl_set_solutions(set));
1997 *res = isl_union_set_from_set(set);
1999 *res = isl_union_set_add_set(*res, set);
2007 __isl_give isl_union_set *isl_union_set_solutions(
2008 __isl_take isl_union_set *uset)
2010 isl_union_set *res = NULL;
2015 if (uset->table.n == 0) {
2016 res = isl_union_set_empty(isl_union_set_get_dim(uset));
2017 isl_union_set_free(uset);
2021 if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
2022 &solutions_entry, &res) < 0)
2025 isl_union_set_free(uset);
2028 isl_union_set_free(uset);
2029 isl_union_set_free(res);