2 * Copyright 2010-2011 INRIA Saclay
3 * Copyright 2013-2014 Ecole Normale Superieure
4 * Copyright 2014 INRIA Rocquencourt
5 * Copyright 2016-2017 Sven Verdoolaege
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
10 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
13 * B.P. 105 - 78153 Le Chesnay, France
16 #include <isl_map_private.h>
17 #include <isl_union_map_private.h>
20 #include <isl_aff_private.h>
23 #include <isl_space_private.h>
24 #include <isl/union_set.h>
25 #include <isl_maybe_map.h>
26 #include <isl_id_private.h>
28 #include <bset_from_bmap.c>
29 #include <set_to_map.c>
30 #include <set_from_map.c>
31 #include <uset_to_umap.c>
32 #include <uset_from_umap.c>
33 #include <set_list_from_map_list_inl.c>
36 #define TYPE isl_union_map
38 #include "has_single_reference_templ.c"
40 #include "check_single_reference_templ.c"
42 /* Return the number of parameters of "umap", where "type"
43 * is required to be set to isl_dim_param.
45 isl_size
isl_union_map_dim(__isl_keep isl_union_map
*umap
,
46 enum isl_dim_type type
)
49 return isl_size_error
;
51 if (type
!= isl_dim_param
)
52 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
53 "can only reference parameters", return isl_size_error
);
55 return isl_space_dim(umap
->dim
, type
);
58 /* Return the number of parameters of "uset", where "type"
59 * is required to be set to isl_dim_param.
61 isl_size
isl_union_set_dim(__isl_keep isl_union_set
*uset
,
62 enum isl_dim_type type
)
64 return isl_union_map_dim(uset
, type
);
67 /* Return the id of the specified dimension.
69 __isl_give isl_id
*isl_union_map_get_dim_id(__isl_keep isl_union_map
*umap
,
70 enum isl_dim_type type
, unsigned pos
)
75 if (type
!= isl_dim_param
)
76 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
77 "can only reference parameters", return NULL
);
79 return isl_space_get_dim_id(umap
->dim
, type
, pos
);
82 /* Is this union set a parameter domain?
84 isl_bool
isl_union_set_is_params(__isl_keep isl_union_set
*uset
)
90 return isl_bool_error
;
91 if (uset
->table
.n
!= 1)
92 return isl_bool_false
;
94 set
= isl_set_from_union_set(isl_union_set_copy(uset
));
95 params
= isl_set_is_params(set
);
100 /* Is this union map actually a parameter domain?
101 * Users should never call this function. Outside of isl,
102 * a union map can never be a parameter domain.
104 isl_bool
isl_union_map_is_params(__isl_keep isl_union_map
*umap
)
106 return isl_union_set_is_params(uset_from_umap(umap
));
109 static __isl_give isl_union_map
*isl_union_map_alloc(
110 __isl_take isl_space
*space
, int size
)
114 space
= isl_space_params(space
);
118 umap
= isl_calloc_type(space
->ctx
, isl_union_map
);
120 isl_space_free(space
);
126 if (isl_hash_table_init(space
->ctx
, &umap
->table
, size
) < 0)
127 return isl_union_map_free(umap
);
132 /* Create an empty union map without specifying any parameters.
134 __isl_give isl_union_map
*isl_union_map_empty_ctx(isl_ctx
*ctx
)
136 return isl_union_map_empty_space(isl_space_unit(ctx
));
139 __isl_give isl_union_map
*isl_union_map_empty_space(__isl_take isl_space
*space
)
141 return isl_union_map_alloc(space
, 16);
144 /* This is an alternative name for the function above.
146 __isl_give isl_union_map
*isl_union_map_empty(__isl_take isl_space
*space
)
148 return isl_union_map_empty_space(space
);
151 /* Create an empty union set without specifying any parameters.
153 __isl_give isl_union_set
*isl_union_set_empty_ctx(isl_ctx
*ctx
)
155 return uset_from_umap(isl_union_map_empty_ctx(ctx
));
158 __isl_give isl_union_set
*isl_union_set_empty_space(__isl_take isl_space
*space
)
160 return uset_from_umap(isl_union_map_empty_space(space
));
163 /* This is an alternative name for the function above.
165 __isl_give isl_union_set
*isl_union_set_empty(__isl_take isl_space
*space
)
167 return isl_union_set_empty_space(space
);
170 isl_ctx
*isl_union_map_get_ctx(__isl_keep isl_union_map
*umap
)
172 return umap
? umap
->dim
->ctx
: NULL
;
175 isl_ctx
*isl_union_set_get_ctx(__isl_keep isl_union_set
*uset
)
177 return uset
? uset
->dim
->ctx
: NULL
;
180 /* Return the space of "umap".
182 __isl_keep isl_space
*isl_union_map_peek_space(__isl_keep isl_union_map
*umap
)
184 return umap
? umap
->dim
: NULL
;
187 /* Return the space of "uset".
189 __isl_keep isl_space
*isl_union_set_peek_space(__isl_keep isl_union_set
*uset
)
191 return isl_union_map_peek_space(uset_to_umap(uset
));
194 __isl_give isl_space
*isl_union_map_get_space(__isl_keep isl_union_map
*umap
)
196 return isl_space_copy(isl_union_map_peek_space(umap
));
199 /* Return the position of the parameter with the given name
201 * Return -1 if no such dimension can be found.
203 int isl_union_map_find_dim_by_name(__isl_keep isl_union_map
*umap
,
204 enum isl_dim_type type
, const char *name
)
208 return isl_space_find_dim_by_name(umap
->dim
, type
, name
);
211 __isl_give isl_space
*isl_union_set_get_space(__isl_keep isl_union_set
*uset
)
213 return isl_union_map_get_space(uset
);
216 static isl_stat
free_umap_entry(void **entry
, void *user
)
218 isl_map
*map
= *entry
;
223 static isl_stat
add_map(__isl_take isl_map
*map
, void *user
)
225 isl_union_map
**umap
= (isl_union_map
**)user
;
227 *umap
= isl_union_map_add_map(*umap
, map
);
232 __isl_give isl_union_map
*isl_union_map_dup(__isl_keep isl_union_map
*umap
)
239 dup
= isl_union_map_empty(isl_space_copy(umap
->dim
));
240 if (isl_union_map_foreach_map(umap
, &add_map
, &dup
) < 0)
244 isl_union_map_free(dup
);
248 __isl_give isl_union_map
*isl_union_map_cow(__isl_take isl_union_map
*umap
)
256 return isl_union_map_dup(umap
);
259 struct isl_union_align
{
264 static isl_stat
align_entry(void **entry
, void *user
)
266 isl_map
*map
= *entry
;
268 struct isl_union_align
*data
= user
;
270 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
271 isl_map_get_space(map
));
273 data
->res
= isl_union_map_add_map(data
->res
,
274 isl_map_realign(isl_map_copy(map
), exp
));
279 /* Align the parameters of umap along those of model.
280 * The result has the parameters of model first, in the same order
281 * as they appear in model, followed by any remaining parameters of
282 * umap that do not appear in model.
284 __isl_give isl_union_map
*isl_union_map_align_params(
285 __isl_take isl_union_map
*umap
, __isl_take isl_space
*model
)
287 struct isl_union_align data
= { NULL
, NULL
};
288 isl_bool equal_params
;
293 equal_params
= isl_space_has_equal_params(umap
->dim
, model
);
294 if (equal_params
< 0)
297 isl_space_free(model
);
301 data
.exp
= isl_parameter_alignment_reordering(umap
->dim
, model
);
305 data
.res
= isl_union_map_alloc(isl_reordering_get_space(data
.exp
),
307 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
308 &align_entry
, &data
) < 0)
311 isl_reordering_free(data
.exp
);
312 isl_union_map_free(umap
);
313 isl_space_free(model
);
316 isl_reordering_free(data
.exp
);
317 isl_union_map_free(umap
);
318 isl_union_map_free(data
.res
);
319 isl_space_free(model
);
323 __isl_give isl_union_set
*isl_union_set_align_params(
324 __isl_take isl_union_set
*uset
, __isl_take isl_space
*model
)
326 return isl_union_map_align_params(uset
, model
);
329 __isl_give isl_union_map
*isl_union_map_union(__isl_take isl_union_map
*umap1
,
330 __isl_take isl_union_map
*umap2
)
332 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
333 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
335 umap1
= isl_union_map_cow(umap1
);
337 if (!umap1
|| !umap2
)
340 if (isl_union_map_foreach_map(umap2
, &add_map
, &umap1
) < 0)
343 isl_union_map_free(umap2
);
347 isl_union_map_free(umap1
);
348 isl_union_map_free(umap2
);
352 __isl_give isl_union_set
*isl_union_set_union(__isl_take isl_union_set
*uset1
,
353 __isl_take isl_union_set
*uset2
)
355 return isl_union_map_union(uset1
, uset2
);
358 __isl_give isl_union_map
*isl_union_map_copy(__isl_keep isl_union_map
*umap
)
367 __isl_give isl_union_set
*isl_union_set_copy(__isl_keep isl_union_set
*uset
)
369 return isl_union_map_copy(uset
);
372 __isl_null isl_union_map
*isl_union_map_free(__isl_take isl_union_map
*umap
)
380 isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
381 &free_umap_entry
, NULL
);
382 isl_hash_table_clear(&umap
->table
);
383 isl_space_free(umap
->dim
);
388 __isl_null isl_union_set
*isl_union_set_free(__isl_take isl_union_set
*uset
)
390 return isl_union_map_free(uset
);
393 /* Do "umap" and "space" have the same parameters?
395 isl_bool
isl_union_map_space_has_equal_params(__isl_keep isl_union_map
*umap
,
396 __isl_keep isl_space
*space
)
398 isl_space
*umap_space
;
400 umap_space
= isl_union_map_peek_space(umap
);
401 return isl_space_has_equal_params(umap_space
, space
);
404 /* Do "uset" and "space" have the same parameters?
406 isl_bool
isl_union_set_space_has_equal_params(__isl_keep isl_union_set
*uset
,
407 __isl_keep isl_space
*space
)
409 return isl_union_map_space_has_equal_params(uset_to_umap(uset
), space
);
412 /* Is the space of the map at "entry" equal to "space", ignoring parameters?
414 static isl_bool
has_space_tuples(const void *entry
, const void *val
)
416 isl_map
*map
= (isl_map
*)entry
;
417 isl_space
*space
= (isl_space
*) val
;
419 return isl_map_has_space_tuples(map
, space
);
422 /* Find the entry in "umap" with space "space" (ignoring parameters),
423 * returning isl_hash_table_entry_none if no such entry appears in "umap" and
425 * If "reserve" is set, then an entry is created if it does
426 * not exist already. Since this modifies the hash table in-place,
427 * this means "umap" must have a single reference when "reserve" is set.
429 static struct isl_hash_table_entry
*isl_union_map_find_entry(
430 __isl_keep isl_union_map
*umap
, __isl_keep isl_space
*space
,
437 if (reserve
&& isl_union_map_check_single_reference(umap
) < 0)
440 hash
= isl_space_get_tuple_hash(space
);
441 return isl_hash_table_find(isl_union_map_get_ctx(umap
), &umap
->table
,
442 hash
, &has_space_tuples
, space
, reserve
);
445 /* Find the entry in "uset" with space "space" (ignoring parameters),
446 * returning isl_hash_table_entry_none if no such entry appears in "uset" and
448 * If "reserve" is set, then an entry is created if it does
449 * not exist already. In this case, a NULL return indicates an error.
451 struct isl_hash_table_entry
*isl_union_set_find_entry(
452 __isl_keep isl_union_set
*uset
, __isl_keep isl_space
*space
,
455 return isl_union_map_find_entry(uset_to_umap(uset
), space
, reserve
);
458 __isl_give isl_union_map
*isl_union_map_add_map(__isl_take isl_union_map
*umap
,
459 __isl_take isl_map
*map
)
461 struct isl_hash_table_entry
*entry
;
468 if (isl_map_plain_is_empty(map
)) {
473 aligned
= isl_map_space_has_equal_params(map
, umap
->dim
);
477 umap
= isl_union_map_align_params(umap
, isl_map_get_space(map
));
478 map
= isl_map_align_params(map
, isl_union_map_get_space(umap
));
481 umap
= isl_union_map_cow(umap
);
483 space
= isl_map_peek_space(map
);
484 entry
= isl_union_map_find_entry(umap
, space
, 1);
491 entry
->data
= isl_map_union(entry
->data
, isl_map_copy(map
));
500 isl_union_map_free(umap
);
504 __isl_give isl_union_set
*isl_union_set_add_set(__isl_take isl_union_set
*uset
,
505 __isl_take isl_set
*set
)
507 return isl_union_map_add_map(uset
, set_to_map(set
));
510 __isl_give isl_union_map
*isl_union_map_from_map(__isl_take isl_map
*map
)
518 space
= isl_map_get_space(map
);
519 space
= isl_space_params(space
);
520 umap
= isl_union_map_empty(space
);
521 umap
= isl_union_map_add_map(umap
, map
);
526 __isl_give isl_union_set
*isl_union_set_from_set(__isl_take isl_set
*set
)
528 return isl_union_map_from_map(set_to_map(set
));
531 __isl_give isl_union_map
*isl_union_map_from_basic_map(
532 __isl_take isl_basic_map
*bmap
)
534 return isl_union_map_from_map(isl_map_from_basic_map(bmap
));
537 __isl_give isl_union_set
*isl_union_set_from_basic_set(
538 __isl_take isl_basic_set
*bset
)
540 return isl_union_map_from_basic_map(bset
);
543 struct isl_union_map_foreach_data
545 isl_stat (*fn
)(__isl_take isl_map
*map
, void *user
);
549 static isl_stat
call_on_copy(void **entry
, void *user
)
551 isl_map
*map
= *entry
;
552 struct isl_union_map_foreach_data
*data
;
553 data
= (struct isl_union_map_foreach_data
*)user
;
555 return data
->fn(isl_map_copy(map
), data
->user
);
558 isl_size
isl_union_map_n_map(__isl_keep isl_union_map
*umap
)
560 return umap
? umap
->table
.n
: isl_size_error
;
563 isl_size
isl_union_set_n_set(__isl_keep isl_union_set
*uset
)
565 return uset
? uset
->table
.n
: isl_size_error
;
568 isl_stat
isl_union_map_foreach_map(__isl_keep isl_union_map
*umap
,
569 isl_stat (*fn
)(__isl_take isl_map
*map
, void *user
), void *user
)
571 struct isl_union_map_foreach_data data
= { fn
, user
};
574 return isl_stat_error
;
576 return isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
577 &call_on_copy
, &data
);
580 /* Internal data structure for isl_union_map_every_map.
582 * "test" is the user-specified callback function.
583 * "user" is the user-specified callback function argument.
585 * "failed" is initialized to 0 and set to 1 if "test" fails
588 struct isl_union_map_every_data
{
589 isl_bool (*test
)(__isl_keep isl_map
*map
, void *user
);
594 /* Call data->test on "map".
595 * If this fails, then set data->failed and abort.
597 static isl_stat
call_every(void **entry
, void *user
)
599 isl_map
*map
= *entry
;
600 struct isl_union_map_every_data
*data
= user
;
603 r
= data
->test(map
, data
->user
);
605 return isl_stat_error
;
609 return isl_stat_error
;
612 /* Does "test" succeed on every map in "umap"?
614 isl_bool
isl_union_map_every_map(__isl_keep isl_union_map
*umap
,
615 isl_bool (*test
)(__isl_keep isl_map
*map
, void *user
), void *user
)
617 struct isl_union_map_every_data data
= { test
, user
, 0 };
621 return isl_bool_error
;
623 r
= isl_hash_table_foreach(isl_union_map_get_ctx(umap
), &umap
->table
,
626 return isl_bool_true
;
628 return isl_bool_false
;
629 return isl_bool_error
;
632 /* Add "map" to "list".
634 static isl_stat
add_list_map(__isl_take isl_map
*map
, void *user
)
636 isl_map_list
**list
= user
;
638 *list
= isl_map_list_add(*list
, map
);
641 return isl_stat_error
;
645 /* Return the maps in "umap" as a list.
647 * First construct a list of the appropriate size and then add all the
650 __isl_give isl_map_list
*isl_union_map_get_map_list(
651 __isl_keep isl_union_map
*umap
)
657 n_maps
= isl_union_map_n_map(umap
);
660 ctx
= isl_union_map_get_ctx(umap
);
661 list
= isl_map_list_alloc(ctx
, n_maps
);
663 if (isl_union_map_foreach_map(umap
, &add_list_map
, &list
) < 0)
664 list
= isl_map_list_free(list
);
669 /* Return the sets in "uset" as a list.
671 __isl_give isl_set_list
*isl_union_set_get_set_list(
672 __isl_keep isl_union_set
*uset
)
674 return set_list_from_map_list(
675 isl_union_map_get_map_list(uset_to_umap(uset
)));
678 /* Can "umap" be converted to an isl_map?
679 * That is, does it contain elements in exactly one space?
681 isl_bool
isl_union_map_isa_map(__isl_keep isl_union_map
*umap
)
685 n
= isl_union_map_n_map(umap
);
687 return isl_bool_error
;
688 return isl_bool_ok(n
== 1);
691 /* Can "uset" be converted to an isl_set?
692 * That is, does it contain elements in exactly one space?
694 isl_bool
isl_union_set_isa_set(__isl_keep isl_union_set
*uset
)
696 return isl_union_map_isa_map(uset_to_umap(uset
));
699 static isl_stat
copy_map(void **entry
, void *user
)
701 isl_map
*map
= *entry
;
702 isl_map
**map_p
= user
;
704 *map_p
= isl_map_copy(map
);
706 return isl_stat_error
;
709 __isl_give isl_map
*isl_map_from_union_map(__isl_take isl_union_map
*umap
)
715 is_map
= isl_union_map_isa_map(umap
);
718 ctx
= isl_union_map_get_ctx(umap
);
720 isl_die(ctx
, isl_error_invalid
,
721 "union map needs to contain elements in exactly "
722 "one space", goto error
);
724 isl_hash_table_foreach(ctx
, &umap
->table
, ©_map
, &map
);
726 isl_union_map_free(umap
);
730 isl_union_map_free(umap
);
734 __isl_give isl_set
*isl_set_from_union_set(__isl_take isl_union_set
*uset
)
736 return isl_map_from_union_map(uset
);
739 /* Extract the map in "umap" that lives in the given space (ignoring
742 __isl_give isl_map
*isl_union_map_extract_map(__isl_keep isl_union_map
*umap
,
743 __isl_take isl_space
*space
)
745 struct isl_hash_table_entry
*entry
;
747 entry
= isl_union_map_find_entry(umap
, space
, 0);
750 if (entry
== isl_hash_table_entry_none
)
751 return isl_map_empty(space
);
752 isl_space_free(space
);
753 return isl_map_copy(entry
->data
);
755 isl_space_free(space
);
759 __isl_give isl_set
*isl_union_set_extract_set(__isl_keep isl_union_set
*uset
,
760 __isl_take isl_space
*space
)
762 return set_from_map(isl_union_map_extract_map(uset
, space
));
765 /* Check if umap contains a map in the given space (ignoring parameters).
767 isl_bool
isl_union_map_contains(__isl_keep isl_union_map
*umap
,
768 __isl_keep isl_space
*space
)
770 struct isl_hash_table_entry
*entry
;
772 space
= isl_space_drop_all_params(isl_space_copy(space
));
773 space
= isl_space_align_params(space
, isl_union_map_get_space(umap
));
774 entry
= isl_union_map_find_entry(umap
, space
, 0);
775 isl_space_free(space
);
777 return isl_bool_error
;
778 return isl_bool_ok(entry
!= isl_hash_table_entry_none
);
781 isl_bool
isl_union_set_contains(__isl_keep isl_union_set
*uset
,
782 __isl_keep isl_space
*space
)
784 return isl_union_map_contains(uset
, space
);
787 isl_stat
isl_union_set_foreach_set(__isl_keep isl_union_set
*uset
,
788 isl_stat (*fn
)(__isl_take isl_set
*set
, void *user
), void *user
)
790 return isl_union_map_foreach_map(uset
,
791 (isl_stat(*)(__isl_take isl_map
*, void*))fn
, user
);
794 /* Internal data structure for isl_union_set_every_set.
796 * "test" is the user-specified callback function.
797 * "user" is the user-specified callback function argument.
799 struct isl_test_set_from_map_data
{
800 isl_bool (*test
)(__isl_keep isl_set
*set
, void *user
);
804 /* Call data->test on "map", which is part of an isl_union_set and
805 * therefore known to be an isl_set.
807 static isl_bool
test_set_from_map(__isl_keep isl_map
*map
, void *user
)
809 struct isl_test_set_from_map_data
*data
= user
;
811 return data
->test(set_from_map(map
), data
->user
);
814 /* Does "test" succeed on every set in "uset"?
816 isl_bool
isl_union_set_every_set(__isl_keep isl_union_set
*uset
,
817 isl_bool (*test
)(__isl_keep isl_set
*set
, void *user
), void *user
)
819 struct isl_test_set_from_map_data data
= { test
, user
};
821 return isl_union_map_every_map(uset_to_umap(uset
),
822 &test_set_from_map
, &data
);
825 struct isl_union_set_foreach_point_data
{
826 isl_stat (*fn
)(__isl_take isl_point
*pnt
, void *user
);
830 static isl_stat
foreach_point(__isl_take isl_set
*set
, void *user
)
832 struct isl_union_set_foreach_point_data
*data
= user
;
835 r
= isl_set_foreach_point(set
, data
->fn
, data
->user
);
841 isl_stat
isl_union_set_foreach_point(__isl_keep isl_union_set
*uset
,
842 isl_stat (*fn
)(__isl_take isl_point
*pnt
, void *user
), void *user
)
844 struct isl_union_set_foreach_point_data data
= { fn
, user
};
845 return isl_union_set_foreach_set(uset
, &foreach_point
, &data
);
848 /* Data structure that specifies how gen_bin_op should
849 * construct results from the inputs.
851 * If "subtract" is set, then a map in the first input is copied to the result
852 * if there is no corresponding map in the second input.
853 * Otherwise, a map in the first input with no corresponding map
854 * in the second input is ignored.
855 * If "filter" is not NULL, then it specifies which maps in the first
856 * input may have a matching map in the second input.
857 * In particular, it makes sure that "match_space" can be called
858 * on the space of the map.
859 * "match_space" specifies how to transform the space of a map
860 * in the first input to the space of the corresponding map
861 * in the second input.
862 * "fn_map" specifies how the matching maps, one from each input,
863 * should be combined to form a map in the result.
865 struct isl_bin_op_control
{
867 isl_bool (*filter
)(__isl_keep isl_map
*map
);
868 __isl_give isl_space
*(*match_space
)(__isl_take isl_space
*space
);
869 __isl_give isl_map
*(*fn_map
)(__isl_take isl_map
*map1
,
870 __isl_take isl_map
*map2
);
873 /* Internal data structure for gen_bin_op.
874 * "control" specifies how the maps in the result should be constructed.
875 * "umap2" is a pointer to the second argument.
876 * "res" collects the results.
878 struct isl_union_map_gen_bin_data
{
879 struct isl_bin_op_control
*control
;
880 isl_union_map
*umap2
;
884 /* Add a copy of "map" to "res" and return the result.
886 static __isl_give isl_union_map
*bin_add_map(__isl_take isl_union_map
*res
,
887 __isl_keep isl_map
*map
)
889 return isl_union_map_add_map(res
, isl_map_copy(map
));
892 /* Combine "map1" and "map2", add the result to "res" and return the result.
893 * Check whether the result is empty before adding it to "res".
895 static __isl_give isl_union_map
*bin_add_pair(__isl_take isl_union_map
*res
,
896 __isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
,
897 struct isl_union_map_gen_bin_data
*data
)
902 map
= data
->control
->fn_map(isl_map_copy(map1
), isl_map_copy(map2
));
903 empty
= isl_map_is_empty(map
);
904 if (empty
< 0 || empty
) {
907 return isl_union_map_free(res
);
910 return isl_union_map_add_map(res
, map
);
913 /* Dummy match_space function that simply returns the input space.
915 static __isl_give isl_space
*identity(__isl_take isl_space
*space
)
920 /* Look for the map in data->umap2 that corresponds to "map", if any.
921 * Return (isl_bool_true, matching map) if there is one,
922 * (isl_bool_false, NULL) if there is no matching map and
923 * (isl_bool_error, NULL) on error.
925 * If not NULL, then data->control->filter specifies whether "map"
926 * can have any matching map. If so,
927 * data->control->match_space specifies which map in data->umap2
928 * corresponds to "map".
930 static __isl_keep isl_maybe_isl_map
bin_try_get_match(
931 struct isl_union_map_gen_bin_data
*data
, __isl_keep isl_map
*map
)
933 struct isl_hash_table_entry
*entry2
;
935 isl_maybe_isl_map res
= { isl_bool_error
, NULL
};
937 if (data
->control
->filter
) {
938 res
.valid
= data
->control
->filter(map
);
939 if (res
.valid
< 0 || !res
.valid
)
941 res
.valid
= isl_bool_error
;
944 space
= isl_map_get_space(map
);
945 if (data
->control
->match_space
!= &identity
)
946 space
= data
->control
->match_space(space
);
947 entry2
= isl_union_map_find_entry(data
->umap2
, space
, 0);
948 isl_space_free(space
);
950 res
.valid
= isl_bool_ok(entry2
!= isl_hash_table_entry_none
);
951 if (res
.valid
>= 0 && res
.valid
)
952 res
.value
= entry2
->data
;
957 /* isl_hash_table_foreach callback for gen_bin_op.
958 * Look for the map in data->umap2 that corresponds
959 * to the map that "entry" points to, apply the binary operation and
960 * add the result to data->res.
962 * If no corresponding map can be found, then the effect depends
963 * on data->control->subtract. If it is set, then the current map
964 * is added directly to the result. Otherwise, it is ignored.
966 static isl_stat
gen_bin_entry(void **entry
, void *user
)
968 struct isl_union_map_gen_bin_data
*data
= user
;
969 isl_map
*map
= *entry
;
972 m
= bin_try_get_match(data
, map
);
974 return isl_stat_error
;
975 if (!m
.valid
&& !data
->control
->subtract
)
979 data
->res
= bin_add_map(data
->res
, map
);
981 data
->res
= bin_add_pair(data
->res
, map
, m
.value
, data
);
983 return isl_stat_error
;
988 /* Apply a binary operation to "umap1" and "umap2" based on "control".
989 * Run over all maps in "umap1" and look for the corresponding map in "umap2"
992 static __isl_give isl_union_map
*gen_bin_op(__isl_take isl_union_map
*umap1
,
993 __isl_take isl_union_map
*umap2
, struct isl_bin_op_control
*control
)
995 struct isl_union_map_gen_bin_data data
= { control
, NULL
, NULL
};
997 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
998 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1000 if (!umap1
|| !umap2
)
1004 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
1006 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1007 &gen_bin_entry
, &data
) < 0)
1010 isl_union_map_free(umap1
);
1011 isl_union_map_free(umap2
);
1014 isl_union_map_free(umap1
);
1015 isl_union_map_free(umap2
);
1016 isl_union_map_free(data
.res
);
1020 __isl_give isl_union_map
*isl_union_map_subtract(
1021 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1023 struct isl_bin_op_control control
= {
1025 .match_space
= &identity
,
1026 .fn_map
= &isl_map_subtract
,
1029 return gen_bin_op(umap1
, umap2
, &control
);
1032 __isl_give isl_union_set
*isl_union_set_subtract(
1033 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
1035 return isl_union_map_subtract(uset1
, uset2
);
1038 struct isl_union_map_gen_bin_set_data
{
1043 static isl_stat
intersect_params_entry(void **entry
, void *user
)
1045 struct isl_union_map_gen_bin_set_data
*data
= user
;
1046 isl_map
*map
= *entry
;
1049 map
= isl_map_copy(map
);
1050 map
= isl_map_intersect_params(map
, isl_set_copy(data
->set
));
1052 empty
= isl_map_is_empty(map
);
1055 return isl_stat_error
;
1058 data
->res
= isl_union_map_add_map(data
->res
, map
);
1063 static __isl_give isl_union_map
*gen_bin_set_op(__isl_take isl_union_map
*umap
,
1064 __isl_take isl_set
*set
, isl_stat (*fn
)(void **, void *))
1066 struct isl_union_map_gen_bin_set_data data
= { NULL
, NULL
};
1068 umap
= isl_union_map_align_params(umap
, isl_set_get_space(set
));
1069 set
= isl_set_align_params(set
, isl_union_map_get_space(umap
));
1075 data
.res
= isl_union_map_alloc(isl_space_copy(umap
->dim
),
1077 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1081 isl_union_map_free(umap
);
1085 isl_union_map_free(umap
);
1087 isl_union_map_free(data
.res
);
1091 /* Intersect "umap" with the parameter domain "set".
1093 * If "set" does not have any constraints, then we can return immediately.
1095 __isl_give isl_union_map
*isl_union_map_intersect_params(
1096 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
1100 is_universe
= isl_set_plain_is_universe(set
);
1101 if (is_universe
< 0)
1108 return gen_bin_set_op(umap
, set
, &intersect_params_entry
);
1110 isl_union_map_free(umap
);
1115 __isl_give isl_union_set
*isl_union_set_intersect_params(
1116 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
1118 return isl_union_map_intersect_params(uset
, set
);
1121 static __isl_give isl_union_map
*union_map_intersect_params(
1122 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1124 return isl_union_map_intersect_params(umap
,
1125 isl_set_from_union_set(uset
));
1128 static __isl_give isl_union_map
*union_map_gist_params(
1129 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1131 return isl_union_map_gist_params(umap
, isl_set_from_union_set(uset
));
1134 struct isl_union_map_match_bin_data
{
1135 isl_union_map
*umap2
;
1137 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*);
1140 static isl_stat
match_bin_entry(void **entry
, void *user
)
1142 struct isl_union_map_match_bin_data
*data
= user
;
1143 struct isl_hash_table_entry
*entry2
;
1145 isl_map
*map
= *entry
;
1148 space
= isl_map_peek_space(map
);
1149 entry2
= isl_union_map_find_entry(data
->umap2
, space
, 0);
1151 return isl_stat_error
;
1152 if (entry2
== isl_hash_table_entry_none
)
1155 map
= isl_map_copy(map
);
1156 map
= data
->fn(map
, isl_map_copy(entry2
->data
));
1158 empty
= isl_map_is_empty(map
);
1161 return isl_stat_error
;
1168 data
->res
= isl_union_map_add_map(data
->res
, map
);
1173 static __isl_give isl_union_map
*match_bin_op(__isl_take isl_union_map
*umap1
,
1174 __isl_take isl_union_map
*umap2
,
1175 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*))
1177 struct isl_union_map_match_bin_data data
= { NULL
, NULL
, fn
};
1179 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1180 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1182 if (!umap1
|| !umap2
)
1186 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
1188 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1189 &match_bin_entry
, &data
) < 0)
1192 isl_union_map_free(umap1
);
1193 isl_union_map_free(umap2
);
1196 isl_union_map_free(umap1
);
1197 isl_union_map_free(umap2
);
1198 isl_union_map_free(data
.res
);
1202 __isl_give isl_union_map
*isl_union_map_intersect(
1203 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1205 return match_bin_op(umap1
, umap2
, &isl_map_intersect
);
1208 /* Compute the intersection of the two union_sets.
1209 * As a special case, if exactly one of the two union_sets
1210 * is a parameter domain, then intersect the parameter domain
1211 * of the other one with this set.
1213 __isl_give isl_union_set
*isl_union_set_intersect(
1214 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
1218 p1
= isl_union_set_is_params(uset1
);
1219 p2
= isl_union_set_is_params(uset2
);
1220 if (p1
< 0 || p2
< 0)
1223 return union_map_intersect_params(uset1
, uset2
);
1225 return union_map_intersect_params(uset2
, uset1
);
1226 return isl_union_map_intersect(uset1
, uset2
);
1228 isl_union_set_free(uset1
);
1229 isl_union_set_free(uset2
);
1233 static isl_stat
gist_params_entry(void **entry
, void *user
)
1235 struct isl_union_map_gen_bin_set_data
*data
= user
;
1236 isl_map
*map
= *entry
;
1239 map
= isl_map_copy(map
);
1240 map
= isl_map_gist_params(map
, isl_set_copy(data
->set
));
1242 empty
= isl_map_is_empty(map
);
1245 return isl_stat_error
;
1248 data
->res
= isl_union_map_add_map(data
->res
, map
);
1253 __isl_give isl_union_map
*isl_union_map_gist_params(
1254 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
1256 return gen_bin_set_op(umap
, set
, &gist_params_entry
);
1259 __isl_give isl_union_set
*isl_union_set_gist_params(
1260 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
1262 return isl_union_map_gist_params(uset
, set
);
1265 __isl_give isl_union_map
*isl_union_map_gist(__isl_take isl_union_map
*umap
,
1266 __isl_take isl_union_map
*context
)
1268 return match_bin_op(umap
, context
, &isl_map_gist
);
1271 __isl_give isl_union_set
*isl_union_set_gist(__isl_take isl_union_set
*uset
,
1272 __isl_take isl_union_set
*context
)
1274 if (isl_union_set_is_params(context
))
1275 return union_map_gist_params(uset
, context
);
1276 return isl_union_map_gist(uset
, context
);
1279 /* For each map in "umap", remove the constraints in the corresponding map
1281 * Each map in "context" is assumed to consist of a single disjunct and
1282 * to have explicit representations for all local variables.
1284 __isl_give isl_union_map
*isl_union_map_plain_gist(
1285 __isl_take isl_union_map
*umap
, __isl_take isl_union_map
*context
)
1287 return match_bin_op(umap
, context
, &isl_map_plain_gist
);
1290 /* For each set in "uset", remove the constraints in the corresponding set
1292 * Each set in "context" is assumed to consist of a single disjunct and
1293 * to have explicit representations for all local variables.
1295 __isl_give isl_union_set
*isl_union_set_plain_gist(
1296 __isl_take isl_union_set
*uset
, __isl_take isl_union_set
*context
)
1298 return isl_union_map_plain_gist(uset
, context
);
1301 static __isl_give isl_map
*lex_le_set(__isl_take isl_map
*set1
,
1302 __isl_take isl_map
*set2
)
1304 return isl_set_lex_le_set(set_from_map(set1
), set_from_map(set2
));
1307 static __isl_give isl_map
*lex_lt_set(__isl_take isl_map
*set1
,
1308 __isl_take isl_map
*set2
)
1310 return isl_set_lex_lt_set(set_from_map(set1
), set_from_map(set2
));
1313 __isl_give isl_union_map
*isl_union_set_lex_lt_union_set(
1314 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
1316 return match_bin_op(uset1
, uset2
, &lex_lt_set
);
1319 __isl_give isl_union_map
*isl_union_set_lex_le_union_set(
1320 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
1322 return match_bin_op(uset1
, uset2
, &lex_le_set
);
1325 __isl_give isl_union_map
*isl_union_set_lex_gt_union_set(
1326 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
1328 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2
, uset1
));
1331 __isl_give isl_union_map
*isl_union_set_lex_ge_union_set(
1332 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
1334 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2
, uset1
));
1337 __isl_give isl_union_map
*isl_union_map_lex_gt_union_map(
1338 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1340 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2
, umap1
));
1343 __isl_give isl_union_map
*isl_union_map_lex_ge_union_map(
1344 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1346 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2
, umap1
));
1349 /* Intersect the domain of "umap" with "uset".
1351 static __isl_give isl_union_map
*union_map_intersect_domain(
1352 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1354 struct isl_bin_op_control control
= {
1355 .match_space
= &isl_space_domain
,
1356 .fn_map
= &isl_map_intersect_domain
,
1359 return gen_bin_op(umap
, uset
, &control
);
1362 /* Intersect the domain of "umap" with "uset".
1363 * If "uset" is a parameters domain, then intersect the parameter
1364 * domain of "umap" with this set.
1366 __isl_give isl_union_map
*isl_union_map_intersect_domain_union_set(
1367 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1369 if (isl_union_set_is_params(uset
))
1370 return union_map_intersect_params(umap
, uset
);
1372 return union_map_intersect_domain(umap
, uset
);
1375 /* This is an alternative name for the function above.
1377 __isl_give isl_union_map
*isl_union_map_intersect_domain(
1378 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1380 return isl_union_map_intersect_domain_union_set(umap
, uset
);
1383 /* Remove the elements of "uset" from the domain of "umap".
1385 __isl_give isl_union_map
*isl_union_map_subtract_domain(
1386 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
1388 struct isl_bin_op_control control
= {
1390 .match_space
= &isl_space_domain
,
1391 .fn_map
= &isl_map_subtract_domain
,
1394 return gen_bin_op(umap
, dom
, &control
);
1397 /* Remove the elements of "uset" from the range of "umap".
1399 __isl_give isl_union_map
*isl_union_map_subtract_range(
1400 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
1402 struct isl_bin_op_control control
= {
1404 .match_space
= &isl_space_range
,
1405 .fn_map
= &isl_map_subtract_range
,
1408 return gen_bin_op(umap
, dom
, &control
);
1411 /* Compute the gist of "umap" with respect to the domain "uset".
1413 static __isl_give isl_union_map
*union_map_gist_domain(
1414 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1416 struct isl_bin_op_control control
= {
1417 .match_space
= &isl_space_domain
,
1418 .fn_map
= &isl_map_gist_domain
,
1421 return gen_bin_op(umap
, uset
, &control
);
1424 /* Compute the gist of "umap" with respect to the domain "uset".
1425 * If "uset" is a parameters domain, then compute the gist
1426 * with respect to this parameter domain.
1428 __isl_give isl_union_map
*isl_union_map_gist_domain(
1429 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1431 if (isl_union_set_is_params(uset
))
1432 return union_map_gist_params(umap
, uset
);
1434 return union_map_gist_domain(umap
, uset
);
1437 /* Compute the gist of "umap" with respect to the range "uset".
1439 __isl_give isl_union_map
*isl_union_map_gist_range(
1440 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1442 struct isl_bin_op_control control
= {
1443 .match_space
= &isl_space_range
,
1444 .fn_map
= &isl_map_gist_range
,
1447 return gen_bin_op(umap
, uset
, &control
);
1450 __isl_give isl_union_map
*isl_union_map_intersect_range_union_set(
1451 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1453 struct isl_bin_op_control control
= {
1454 .match_space
= &isl_space_range
,
1455 .fn_map
= &isl_map_intersect_range
,
1458 return gen_bin_op(umap
, uset
, &control
);
1461 /* This is an alternative name for the function above.
1463 __isl_give isl_union_map
*isl_union_map_intersect_range(
1464 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1466 return isl_union_map_intersect_range_union_set(umap
, uset
);
1469 /* Intersect each map in "umap" in a space [A -> B] -> C
1470 * with the corresponding map in "factor" in the space A -> C and
1471 * collect the results.
1473 __isl_give isl_union_map
*isl_union_map_intersect_domain_factor_domain(
1474 __isl_take isl_union_map
*umap
, __isl_take isl_union_map
*factor
)
1476 struct isl_bin_op_control control
= {
1477 .filter
= &isl_map_domain_is_wrapping
,
1478 .match_space
= &isl_space_domain_factor_domain
,
1479 .fn_map
= &isl_map_intersect_domain_factor_domain
,
1482 return gen_bin_op(umap
, factor
, &control
);
1485 /* Intersect each map in "umap" in a space [A -> B] -> C
1486 * with the corresponding map in "factor" in the space B -> C and
1487 * collect the results.
1489 __isl_give isl_union_map
*isl_union_map_intersect_domain_factor_range(
1490 __isl_take isl_union_map
*umap
, __isl_take isl_union_map
*factor
)
1492 struct isl_bin_op_control control
= {
1493 .filter
= &isl_map_domain_is_wrapping
,
1494 .match_space
= &isl_space_domain_factor_range
,
1495 .fn_map
= &isl_map_intersect_domain_factor_range
,
1498 return gen_bin_op(umap
, factor
, &control
);
1501 /* Intersect each map in "umap" in a space A -> [B -> C]
1502 * with the corresponding map in "factor" in the space A -> B and
1503 * collect the results.
1505 __isl_give isl_union_map
*isl_union_map_intersect_range_factor_domain(
1506 __isl_take isl_union_map
*umap
, __isl_take isl_union_map
*factor
)
1508 struct isl_bin_op_control control
= {
1509 .filter
= &isl_map_range_is_wrapping
,
1510 .match_space
= &isl_space_range_factor_domain
,
1511 .fn_map
= &isl_map_intersect_range_factor_domain
,
1514 return gen_bin_op(umap
, factor
, &control
);
1517 /* Intersect each map in "umap" in a space A -> [B -> C]
1518 * with the corresponding map in "factor" in the space A -> C and
1519 * collect the results.
1521 __isl_give isl_union_map
*isl_union_map_intersect_range_factor_range(
1522 __isl_take isl_union_map
*umap
, __isl_take isl_union_map
*factor
)
1524 struct isl_bin_op_control control
= {
1525 .filter
= &isl_map_range_is_wrapping
,
1526 .match_space
= &isl_space_range_factor_range
,
1527 .fn_map
= &isl_map_intersect_range_factor_range
,
1530 return gen_bin_op(umap
, factor
, &control
);
1533 struct isl_union_map_bin_data
{
1534 isl_union_map
*umap2
;
1537 isl_stat (*fn
)(void **entry
, void *user
);
1540 static isl_stat
apply_range_entry(void **entry
, void *user
)
1542 struct isl_union_map_bin_data
*data
= user
;
1543 isl_map
*map2
= *entry
;
1544 isl_bool empty
, match
;
1546 match
= isl_map_tuple_is_equal(data
->map
, isl_dim_out
,
1549 return isl_stat_error
;
1553 map2
= isl_map_apply_range(isl_map_copy(data
->map
), isl_map_copy(map2
));
1555 empty
= isl_map_is_empty(map2
);
1558 return isl_stat_error
;
1565 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1570 static isl_stat
bin_entry(void **entry
, void *user
)
1572 struct isl_union_map_bin_data
*data
= user
;
1573 isl_map
*map
= *entry
;
1576 if (isl_hash_table_foreach(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1577 data
->fn
, data
) < 0)
1578 return isl_stat_error
;
1583 static __isl_give isl_union_map
*bin_op(__isl_take isl_union_map
*umap1
,
1584 __isl_take isl_union_map
*umap2
,
1585 isl_stat (*fn
)(void **entry
, void *user
))
1587 struct isl_union_map_bin_data data
= { NULL
, NULL
, NULL
, fn
};
1589 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1590 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1592 if (!umap1
|| !umap2
)
1596 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
1598 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1599 &bin_entry
, &data
) < 0)
1602 isl_union_map_free(umap1
);
1603 isl_union_map_free(umap2
);
1606 isl_union_map_free(umap1
);
1607 isl_union_map_free(umap2
);
1608 isl_union_map_free(data
.res
);
1612 __isl_give isl_union_map
*isl_union_map_apply_range(
1613 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1615 return bin_op(umap1
, umap2
, &apply_range_entry
);
1618 __isl_give isl_union_map
*isl_union_map_apply_domain(
1619 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1621 umap1
= isl_union_map_reverse(umap1
);
1622 umap1
= isl_union_map_apply_range(umap1
, umap2
);
1623 return isl_union_map_reverse(umap1
);
1626 __isl_give isl_union_set
*isl_union_set_apply(
1627 __isl_take isl_union_set
*uset
, __isl_take isl_union_map
*umap
)
1629 return isl_union_map_apply_range(uset
, umap
);
1632 static isl_stat
map_lex_lt_entry(void **entry
, void *user
)
1634 struct isl_union_map_bin_data
*data
= user
;
1635 isl_map
*map2
= *entry
;
1638 match
= isl_map_tuple_is_equal(data
->map
, isl_dim_out
,
1641 return isl_stat_error
;
1645 map2
= isl_map_lex_lt_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1647 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1652 __isl_give isl_union_map
*isl_union_map_lex_lt_union_map(
1653 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1655 return bin_op(umap1
, umap2
, &map_lex_lt_entry
);
1658 static isl_stat
map_lex_le_entry(void **entry
, void *user
)
1660 struct isl_union_map_bin_data
*data
= user
;
1661 isl_map
*map2
= *entry
;
1664 match
= isl_map_tuple_is_equal(data
->map
, isl_dim_out
,
1667 return isl_stat_error
;
1671 map2
= isl_map_lex_le_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1673 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1678 __isl_give isl_union_map
*isl_union_map_lex_le_union_map(
1679 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1681 return bin_op(umap1
, umap2
, &map_lex_le_entry
);
1684 static isl_stat
product_entry(void **entry
, void *user
)
1686 struct isl_union_map_bin_data
*data
= user
;
1687 isl_map
*map2
= *entry
;
1689 map2
= isl_map_product(isl_map_copy(data
->map
), isl_map_copy(map2
));
1691 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1696 __isl_give isl_union_map
*isl_union_map_product(__isl_take isl_union_map
*umap1
,
1697 __isl_take isl_union_map
*umap2
)
1699 return bin_op(umap1
, umap2
, &product_entry
);
1702 static isl_stat
set_product_entry(void **entry
, void *user
)
1704 struct isl_union_map_bin_data
*data
= user
;
1705 isl_set
*set2
= *entry
;
1707 set2
= isl_set_product(isl_set_copy(data
->map
), isl_set_copy(set2
));
1709 data
->res
= isl_union_set_add_set(data
->res
, set2
);
1714 __isl_give isl_union_set
*isl_union_set_product(__isl_take isl_union_set
*uset1
,
1715 __isl_take isl_union_set
*uset2
)
1717 return bin_op(uset1
, uset2
, &set_product_entry
);
1720 static isl_stat
domain_product_entry(void **entry
, void *user
)
1722 struct isl_union_map_bin_data
*data
= user
;
1723 isl_map
*map2
= *entry
;
1726 match
= isl_map_tuple_is_equal(data
->map
, isl_dim_out
,
1729 return isl_stat_error
;
1733 map2
= isl_map_domain_product(isl_map_copy(data
->map
),
1734 isl_map_copy(map2
));
1736 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1741 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
1743 __isl_give isl_union_map
*isl_union_map_domain_product(
1744 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1746 return bin_op(umap1
, umap2
, &domain_product_entry
);
1749 static isl_stat
range_product_entry(void **entry
, void *user
)
1751 struct isl_union_map_bin_data
*data
= user
;
1752 isl_map
*map2
= *entry
;
1755 match
= isl_map_tuple_is_equal(data
->map
, isl_dim_in
, map2
, isl_dim_in
);
1757 return isl_stat_error
;
1761 map2
= isl_map_range_product(isl_map_copy(data
->map
),
1762 isl_map_copy(map2
));
1764 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1769 __isl_give isl_union_map
*isl_union_map_range_product(
1770 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1772 return bin_op(umap1
, umap2
, &range_product_entry
);
1775 /* If data->map A -> B and "map2" C -> D have the same range space,
1776 * then add (A, C) -> (B * D) to data->res.
1778 static isl_stat
flat_domain_product_entry(void **entry
, void *user
)
1780 struct isl_union_map_bin_data
*data
= user
;
1781 isl_map
*map2
= *entry
;
1784 match
= isl_map_tuple_is_equal(data
->map
, isl_dim_out
,
1787 return isl_stat_error
;
1791 map2
= isl_map_flat_domain_product(isl_map_copy(data
->map
),
1792 isl_map_copy(map2
));
1794 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1799 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D).
1801 __isl_give isl_union_map
*isl_union_map_flat_domain_product(
1802 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1804 return bin_op(umap1
, umap2
, &flat_domain_product_entry
);
1807 static isl_stat
flat_range_product_entry(void **entry
, void *user
)
1809 struct isl_union_map_bin_data
*data
= user
;
1810 isl_map
*map2
= *entry
;
1813 match
= isl_map_tuple_is_equal(data
->map
, isl_dim_in
, map2
, isl_dim_in
);
1815 return isl_stat_error
;
1819 map2
= isl_map_flat_range_product(isl_map_copy(data
->map
),
1820 isl_map_copy(map2
));
1822 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1827 __isl_give isl_union_map
*isl_union_map_flat_range_product(
1828 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1830 return bin_op(umap1
, umap2
, &flat_range_product_entry
);
1833 /* Data structure that specifies how un_op should modify
1834 * the maps in the union map.
1836 * If "inplace" is set, then the maps in the input union map
1837 * are modified in place. This means that "fn_map" should not
1838 * change the meaning of the map or that the union map only
1839 * has a single reference.
1840 * If "total" is set, then all maps need to be modified and
1841 * the results need to live in the same space.
1842 * Otherwise, a new union map is constructed to store the results.
1843 * If "filter" is not NULL, then only the input maps that satisfy "filter"
1844 * are taken into account. "filter_user" is passed as the second argument
1845 * to "filter". No filter can be set if "inplace" or
1847 * At most one of "fn_map" or "fn_map2" can be set, specifying
1848 * how the maps (selected by "filter") should be transformed.
1849 * If "fn_map2" is set, then "fn_map2_user" is passed as the second argument.
1851 struct isl_un_op_control
{
1854 isl_bool (*filter
)(__isl_keep isl_map
*map
, void *user
);
1856 __isl_give isl_map
*(*fn_map
)(__isl_take isl_map
*map
);
1857 __isl_give isl_map
*(*fn_map2
)(__isl_take isl_map
*map
, void *user
);
1861 /* Data structure for wrapping the data for un_op_filter_drop_user.
1862 * "filter" is the function that is being wrapped.
1864 struct isl_un_op_drop_user_data
{
1865 isl_bool (*filter
)(__isl_keep isl_map
*map
);
1868 /* Wrapper for isl_un_op_control filters that do not require
1869 * a second argument.
1870 * Simply call data->filter without the second argument.
1872 static isl_bool
un_op_filter_drop_user(__isl_keep isl_map
*map
, void *user
)
1874 struct isl_un_op_drop_user_data
*data
= user
;
1875 return data
->filter(map
);
1878 /* Internal data structure for "un_op".
1879 * "control" specifies how the maps in the union map should be modified.
1880 * "res" collects the results.
1882 struct isl_union_map_un_data
{
1883 struct isl_un_op_control
*control
;
1887 /* isl_hash_table_foreach callback for un_op.
1888 * Handle the map that "entry" points to.
1890 * If control->filter is set, then check if this map satisfies the filter.
1891 * If so (or if control->filter is not set), modify the map
1892 * by calling control->fn_map or control->fn_map2 (if set) and
1893 * either add the result to data->res or
1894 * replace the original entry by the result (if control->inplace is set).
1896 static isl_stat
un_entry(void **entry
, void *user
)
1898 struct isl_union_map_un_data
*data
= user
;
1899 struct isl_un_op_control
*control
= data
->control
;
1900 isl_map
*map
= *entry
;
1902 if (control
->filter
) {
1905 ok
= control
->filter(map
, control
->filter_user
);
1907 return isl_stat_error
;
1912 map
= isl_map_copy(map
);
1913 if (control
->fn_map2
!= NULL
)
1914 map
= control
->fn_map2(map
, control
->fn_map2_user
);
1915 else if (control
->fn_map
!= NULL
)
1916 map
= control
->fn_map(map
);
1918 return isl_stat_error
;
1919 if (control
->inplace
) {
1920 isl_map_free(*entry
);
1923 data
->res
= isl_union_map_add_map(data
->res
, map
);
1925 return isl_stat_error
;
1931 /* Modify the maps in "umap" based on "control".
1932 * If control->inplace is set, then modify the maps in "umap" in-place.
1933 * Otherwise, create a new union map to hold the results.
1934 * If control->total is set, then perform an inplace computation
1935 * if "umap" is only referenced once. Otherwise, create a new union map
1936 * to store the results.
1938 static __isl_give isl_union_map
*un_op(__isl_take isl_union_map
*umap
,
1939 struct isl_un_op_control
*control
)
1941 struct isl_union_map_un_data data
= { control
};
1945 if (!!control
->fn_map
&& !!control
->fn_map2
)
1946 isl_die(isl_union_map_get_ctx(umap
), isl_error_internal
,
1947 "at most one mapping function can be specified",
1948 return isl_union_map_free(umap
));
1949 if ((control
->inplace
|| control
->total
) && control
->filter
)
1950 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
1951 "inplace/total modification cannot be filtered",
1952 return isl_union_map_free(umap
));
1954 if (control
->total
&& umap
->ref
== 1)
1955 control
->inplace
= 1;
1956 if (control
->inplace
) {
1961 space
= isl_union_map_get_space(umap
);
1962 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
1964 if (isl_hash_table_foreach(isl_union_map_get_ctx(umap
),
1965 &umap
->table
, &un_entry
, &data
) < 0)
1966 data
.res
= isl_union_map_free(data
.res
);
1968 if (control
->inplace
)
1970 isl_union_map_free(umap
);
1974 __isl_give isl_union_map
*isl_union_map_from_range(
1975 __isl_take isl_union_set
*uset
)
1977 struct isl_un_op_control control
= {
1978 .fn_map
= &isl_map_from_range
,
1980 return un_op(uset
, &control
);
1983 __isl_give isl_union_map
*isl_union_map_from_domain(
1984 __isl_take isl_union_set
*uset
)
1986 return isl_union_map_reverse(isl_union_map_from_range(uset
));
1989 __isl_give isl_union_map
*isl_union_map_from_domain_and_range(
1990 __isl_take isl_union_set
*domain
, __isl_take isl_union_set
*range
)
1992 return isl_union_map_apply_range(isl_union_map_from_domain(domain
),
1993 isl_union_map_from_range(range
));
1996 /* Modify the maps in "umap" by applying "fn" on them.
1997 * "fn" should apply to all maps in "umap" and should not modify the space.
1999 static __isl_give isl_union_map
*total(__isl_take isl_union_map
*umap
,
2000 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
2002 struct isl_un_op_control control
= {
2007 return un_op(umap
, &control
);
2010 /* Compute the affine hull of "map" and return the result as an isl_map.
2012 static __isl_give isl_map
*isl_map_affine_hull_map(__isl_take isl_map
*map
)
2014 return isl_map_from_basic_map(isl_map_affine_hull(map
));
2017 __isl_give isl_union_map
*isl_union_map_affine_hull(
2018 __isl_take isl_union_map
*umap
)
2020 return total(umap
, &isl_map_affine_hull_map
);
2023 __isl_give isl_union_set
*isl_union_set_affine_hull(
2024 __isl_take isl_union_set
*uset
)
2026 return isl_union_map_affine_hull(uset
);
2029 /* Wrapper around isl_set_combined_lineality_space
2030 * that returns the combined lineality space in the form of an isl_set
2031 * instead of an isl_basic_set.
2033 static __isl_give isl_set
*combined_lineality_space(__isl_take isl_set
*set
)
2035 return isl_set_from_basic_set(isl_set_combined_lineality_space(set
));
2038 /* For each set in "uset", compute the (linear) hull
2039 * of the lineality spaces of its basic sets and
2040 * collect and return the results.
2042 __isl_give isl_union_set
*isl_union_set_combined_lineality_space(
2043 __isl_take isl_union_set
*uset
)
2045 struct isl_un_op_control control
= {
2046 .fn_map
= &combined_lineality_space
,
2048 return un_op(uset
, &control
);
2051 /* Compute the polyhedral hull of "map" and return the result as an isl_map.
2053 static __isl_give isl_map
*isl_map_polyhedral_hull_map(__isl_take isl_map
*map
)
2055 return isl_map_from_basic_map(isl_map_polyhedral_hull(map
));
2058 __isl_give isl_union_map
*isl_union_map_polyhedral_hull(
2059 __isl_take isl_union_map
*umap
)
2061 return total(umap
, &isl_map_polyhedral_hull_map
);
2064 __isl_give isl_union_set
*isl_union_set_polyhedral_hull(
2065 __isl_take isl_union_set
*uset
)
2067 return isl_union_map_polyhedral_hull(uset
);
2070 /* Compute a superset of the convex hull of "map" that is described
2071 * by only translates of the constraints in the constituents of "map" and
2072 * return the result as an isl_map.
2074 static __isl_give isl_map
*isl_map_simple_hull_map(__isl_take isl_map
*map
)
2076 return isl_map_from_basic_map(isl_map_simple_hull(map
));
2079 __isl_give isl_union_map
*isl_union_map_simple_hull(
2080 __isl_take isl_union_map
*umap
)
2082 return total(umap
, &isl_map_simple_hull_map
);
2085 __isl_give isl_union_set
*isl_union_set_simple_hull(
2086 __isl_take isl_union_set
*uset
)
2088 return isl_union_map_simple_hull(uset
);
2091 static __isl_give isl_union_map
*inplace(__isl_take isl_union_map
*umap
,
2092 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
2094 struct isl_un_op_control control
= {
2099 return un_op(umap
, &control
);
2102 /* Remove redundant constraints in each of the basic maps of "umap".
2103 * Since removing redundant constraints does not change the meaning
2104 * or the space, the operation can be performed in-place.
2106 __isl_give isl_union_map
*isl_union_map_remove_redundancies(
2107 __isl_take isl_union_map
*umap
)
2109 return inplace(umap
, &isl_map_remove_redundancies
);
2112 /* Remove redundant constraints in each of the basic sets of "uset".
2114 __isl_give isl_union_set
*isl_union_set_remove_redundancies(
2115 __isl_take isl_union_set
*uset
)
2117 return isl_union_map_remove_redundancies(uset
);
2120 __isl_give isl_union_map
*isl_union_map_coalesce(
2121 __isl_take isl_union_map
*umap
)
2123 return inplace(umap
, &isl_map_coalesce
);
2126 __isl_give isl_union_set
*isl_union_set_coalesce(
2127 __isl_take isl_union_set
*uset
)
2129 return isl_union_map_coalesce(uset
);
2132 __isl_give isl_union_map
*isl_union_map_detect_equalities(
2133 __isl_take isl_union_map
*umap
)
2135 return inplace(umap
, &isl_map_detect_equalities
);
2138 __isl_give isl_union_set
*isl_union_set_detect_equalities(
2139 __isl_take isl_union_set
*uset
)
2141 return isl_union_map_detect_equalities(uset
);
2144 __isl_give isl_union_map
*isl_union_map_compute_divs(
2145 __isl_take isl_union_map
*umap
)
2147 return inplace(umap
, &isl_map_compute_divs
);
2150 __isl_give isl_union_set
*isl_union_set_compute_divs(
2151 __isl_take isl_union_set
*uset
)
2153 return isl_union_map_compute_divs(uset
);
2156 __isl_give isl_union_map
*isl_union_map_lexmin(
2157 __isl_take isl_union_map
*umap
)
2159 return total(umap
, &isl_map_lexmin
);
2162 __isl_give isl_union_set
*isl_union_set_lexmin(
2163 __isl_take isl_union_set
*uset
)
2165 return isl_union_map_lexmin(uset
);
2168 __isl_give isl_union_map
*isl_union_map_lexmax(
2169 __isl_take isl_union_map
*umap
)
2171 return total(umap
, &isl_map_lexmax
);
2174 __isl_give isl_union_set
*isl_union_set_lexmax(
2175 __isl_take isl_union_set
*uset
)
2177 return isl_union_map_lexmax(uset
);
2180 /* Return the universe in the space of "map".
2182 static __isl_give isl_map
*universe(__isl_take isl_map
*map
)
2186 space
= isl_map_get_space(map
);
2188 return isl_map_universe(space
);
2191 __isl_give isl_union_map
*isl_union_map_universe(__isl_take isl_union_map
*umap
)
2193 struct isl_un_op_control control
= {
2194 .fn_map
= &universe
,
2196 return un_op(umap
, &control
);
2199 __isl_give isl_union_set
*isl_union_set_universe(__isl_take isl_union_set
*uset
)
2201 return isl_union_map_universe(uset
);
2204 __isl_give isl_union_map
*isl_union_map_reverse(__isl_take isl_union_map
*umap
)
2206 struct isl_un_op_control control
= {
2207 .fn_map
= &isl_map_reverse
,
2209 return un_op(umap
, &control
);
2212 /* Given a union map, take the maps of the form A -> (B -> C) and
2213 * return the union of the corresponding maps A -> (C -> B).
2215 __isl_give isl_union_map
*isl_union_map_range_reverse(
2216 __isl_take isl_union_map
*umap
)
2218 struct isl_un_op_drop_user_data data
= { &isl_map_range_is_wrapping
};
2219 struct isl_un_op_control control
= {
2220 .filter
= &un_op_filter_drop_user
,
2221 .filter_user
= &data
,
2222 .fn_map
= &isl_map_range_reverse
,
2224 return un_op(umap
, &control
);
2227 /* Compute the parameter domain of the given union map.
2229 __isl_give isl_set
*isl_union_map_params(__isl_take isl_union_map
*umap
)
2231 struct isl_un_op_control control
= {
2232 .fn_map
= &isl_map_params
,
2236 empty
= isl_union_map_is_empty(umap
);
2241 space
= isl_union_map_get_space(umap
);
2242 isl_union_map_free(umap
);
2243 return isl_set_empty(space
);
2245 return isl_set_from_union_set(un_op(umap
, &control
));
2247 isl_union_map_free(umap
);
2251 /* Compute the parameter domain of the given union set.
2253 __isl_give isl_set
*isl_union_set_params(__isl_take isl_union_set
*uset
)
2255 return isl_union_map_params(uset
);
2258 __isl_give isl_union_set
*isl_union_map_domain(__isl_take isl_union_map
*umap
)
2260 struct isl_un_op_control control
= {
2261 .fn_map
= &isl_map_domain
,
2263 return un_op(umap
, &control
);
2266 __isl_give isl_union_set
*isl_union_map_range(__isl_take isl_union_map
*umap
)
2268 struct isl_un_op_control control
= {
2269 .fn_map
= &isl_map_range
,
2271 return un_op(umap
, &control
);
2274 __isl_give isl_union_map
*isl_union_map_domain_map(
2275 __isl_take isl_union_map
*umap
)
2277 struct isl_un_op_control control
= {
2278 .fn_map
= &isl_map_domain_map
,
2280 return un_op(umap
, &control
);
2283 /* Construct an isl_pw_multi_aff that maps "map" to its domain and
2284 * add the result to "res".
2286 static isl_stat
domain_map_upma(__isl_take isl_map
*map
, void *user
)
2288 isl_union_pw_multi_aff
**res
= user
;
2290 isl_pw_multi_aff
*pma
;
2292 ma
= isl_multi_aff_domain_map(isl_map_get_space(map
));
2293 pma
= isl_pw_multi_aff_alloc(isl_map_wrap(map
), ma
);
2294 *res
= isl_union_pw_multi_aff_add_pw_multi_aff(*res
, pma
);
2296 return *res
? isl_stat_ok
: isl_stat_error
;
2300 /* Return an isl_union_pw_multi_aff that maps a wrapped copy of "umap"
2303 __isl_give isl_union_pw_multi_aff
*isl_union_map_domain_map_union_pw_multi_aff(
2304 __isl_take isl_union_map
*umap
)
2306 isl_union_pw_multi_aff
*res
;
2308 res
= isl_union_pw_multi_aff_empty(isl_union_map_get_space(umap
));
2309 if (isl_union_map_foreach_map(umap
, &domain_map_upma
, &res
) < 0)
2310 res
= isl_union_pw_multi_aff_free(res
);
2312 isl_union_map_free(umap
);
2316 __isl_give isl_union_map
*isl_union_map_range_map(
2317 __isl_take isl_union_map
*umap
)
2319 struct isl_un_op_control control
= {
2320 .fn_map
= &isl_map_range_map
,
2322 return un_op(umap
, &control
);
2325 /* Given a collection of wrapped maps of the form A[B -> C],
2326 * return the collection of maps A[B -> C] -> B.
2328 __isl_give isl_union_map
*isl_union_set_wrapped_domain_map(
2329 __isl_take isl_union_set
*uset
)
2331 struct isl_un_op_drop_user_data data
= { &isl_set_is_wrapping
};
2332 struct isl_un_op_control control
= {
2333 .filter
= &un_op_filter_drop_user
,
2334 .filter_user
= &data
,
2335 .fn_map
= &isl_set_wrapped_domain_map
,
2337 return un_op(uset
, &control
);
2340 /* Does "map" relate elements from the same space?
2342 static isl_bool
equal_tuples(__isl_keep isl_map
*map
, void *user
)
2344 return isl_map_tuple_is_equal(map
, isl_dim_in
, map
, isl_dim_out
);
2347 __isl_give isl_union_set
*isl_union_map_deltas(__isl_take isl_union_map
*umap
)
2349 struct isl_un_op_control control
= {
2350 .filter
= &equal_tuples
,
2351 .fn_map
= &isl_map_deltas
,
2353 return un_op(umap
, &control
);
2356 __isl_give isl_union_map
*isl_union_map_deltas_map(
2357 __isl_take isl_union_map
*umap
)
2359 struct isl_un_op_control control
= {
2360 .filter
= &equal_tuples
,
2361 .fn_map
= &isl_map_deltas_map
,
2363 return un_op(umap
, &control
);
2366 __isl_give isl_union_map
*isl_union_set_identity(__isl_take isl_union_set
*uset
)
2368 struct isl_un_op_control control
= {
2369 .fn_map
= &isl_set_identity
,
2371 return un_op(uset
, &control
);
2374 /* Construct an identity isl_pw_multi_aff on "set" and add it to *res.
2376 static isl_stat
identity_upma(__isl_take isl_set
*set
, void *user
)
2378 isl_union_pw_multi_aff
**res
= user
;
2380 isl_pw_multi_aff
*pma
;
2382 space
= isl_space_map_from_set(isl_set_get_space(set
));
2383 pma
= isl_pw_multi_aff_identity(space
);
2384 pma
= isl_pw_multi_aff_intersect_domain(pma
, set
);
2385 *res
= isl_union_pw_multi_aff_add_pw_multi_aff(*res
, pma
);
2387 return *res
? isl_stat_ok
: isl_stat_error
;
2390 /* Return an identity function on "uset" in the form
2391 * of an isl_union_pw_multi_aff.
2393 __isl_give isl_union_pw_multi_aff
*isl_union_set_identity_union_pw_multi_aff(
2394 __isl_take isl_union_set
*uset
)
2396 isl_union_pw_multi_aff
*res
;
2398 res
= isl_union_pw_multi_aff_empty(isl_union_set_get_space(uset
));
2399 if (isl_union_set_foreach_set(uset
, &identity_upma
, &res
) < 0)
2400 res
= isl_union_pw_multi_aff_free(res
);
2402 isl_union_set_free(uset
);
2406 /* For each map in "umap" of the form [A -> B] -> C,
2407 * construct the map A -> C and collect the results.
2409 __isl_give isl_union_map
*isl_union_map_domain_factor_domain(
2410 __isl_take isl_union_map
*umap
)
2412 struct isl_un_op_drop_user_data data
= { &isl_map_domain_is_wrapping
};
2413 struct isl_un_op_control control
= {
2414 .filter
= &un_op_filter_drop_user
,
2415 .filter_user
= &data
,
2416 .fn_map
= &isl_map_domain_factor_domain
,
2418 return un_op(umap
, &control
);
2421 /* For each map in "umap" of the form [A -> B] -> C,
2422 * construct the map B -> C and collect the results.
2424 __isl_give isl_union_map
*isl_union_map_domain_factor_range(
2425 __isl_take isl_union_map
*umap
)
2427 struct isl_un_op_drop_user_data data
= { &isl_map_domain_is_wrapping
};
2428 struct isl_un_op_control control
= {
2429 .filter
= &un_op_filter_drop_user
,
2430 .filter_user
= &data
,
2431 .fn_map
= &isl_map_domain_factor_range
,
2433 return un_op(umap
, &control
);
2436 /* For each map in "umap" of the form A -> [B -> C],
2437 * construct the map A -> B and collect the results.
2439 __isl_give isl_union_map
*isl_union_map_range_factor_domain(
2440 __isl_take isl_union_map
*umap
)
2442 struct isl_un_op_drop_user_data data
= { &isl_map_range_is_wrapping
};
2443 struct isl_un_op_control control
= {
2444 .filter
= &un_op_filter_drop_user
,
2445 .filter_user
= &data
,
2446 .fn_map
= &isl_map_range_factor_domain
,
2448 return un_op(umap
, &control
);
2451 /* For each map in "umap" of the form A -> [B -> C],
2452 * construct the map A -> C and collect the results.
2454 __isl_give isl_union_map
*isl_union_map_range_factor_range(
2455 __isl_take isl_union_map
*umap
)
2457 struct isl_un_op_drop_user_data data
= { &isl_map_range_is_wrapping
};
2458 struct isl_un_op_control control
= {
2459 .filter
= &un_op_filter_drop_user
,
2460 .filter_user
= &data
,
2461 .fn_map
= &isl_map_range_factor_range
,
2463 return un_op(umap
, &control
);
2466 /* For each map in "umap" of the form [A -> B] -> [C -> D],
2467 * construct the map A -> C and collect the results.
2469 __isl_give isl_union_map
*isl_union_map_factor_domain(
2470 __isl_take isl_union_map
*umap
)
2472 struct isl_un_op_drop_user_data data
= { &isl_map_is_product
};
2473 struct isl_un_op_control control
= {
2474 .filter
= &un_op_filter_drop_user
,
2475 .filter_user
= &data
,
2476 .fn_map
= &isl_map_factor_domain
,
2478 return un_op(umap
, &control
);
2481 /* For each map in "umap" of the form [A -> B] -> [C -> D],
2482 * construct the map B -> D and collect the results.
2484 __isl_give isl_union_map
*isl_union_map_factor_range(
2485 __isl_take isl_union_map
*umap
)
2487 struct isl_un_op_drop_user_data data
= { &isl_map_is_product
};
2488 struct isl_un_op_control control
= {
2489 .filter
= &un_op_filter_drop_user
,
2490 .filter_user
= &data
,
2491 .fn_map
= &isl_map_factor_range
,
2493 return un_op(umap
, &control
);
2496 __isl_give isl_union_map
*isl_union_set_unwrap(__isl_take isl_union_set
*uset
)
2498 struct isl_un_op_drop_user_data data
= { &isl_set_is_wrapping
};
2499 struct isl_un_op_control control
= {
2500 .filter
= &un_op_filter_drop_user
,
2501 .filter_user
= &data
,
2502 .fn_map
= &isl_set_unwrap
,
2504 return un_op(uset
, &control
);
2507 __isl_give isl_union_set
*isl_union_map_wrap(__isl_take isl_union_map
*umap
)
2509 struct isl_un_op_control control
= {
2510 .fn_map
= &isl_map_wrap
,
2512 return un_op(umap
, &control
);
2515 struct isl_union_map_is_subset_data
{
2516 isl_union_map
*umap2
;
2520 static isl_stat
is_subset_entry(void **entry
, void *user
)
2522 struct isl_union_map_is_subset_data
*data
= user
;
2523 struct isl_hash_table_entry
*entry2
;
2525 isl_map
*map
= *entry
;
2527 space
= isl_map_peek_space(map
);
2528 entry2
= isl_union_map_find_entry(data
->umap2
, space
, 0);
2530 return isl_stat_error
;
2531 if (entry2
== isl_hash_table_entry_none
) {
2532 int empty
= isl_map_is_empty(map
);
2534 return isl_stat_error
;
2537 data
->is_subset
= isl_bool_false
;
2538 return isl_stat_error
;
2541 data
->is_subset
= isl_map_is_subset(map
, entry2
->data
);
2542 if (data
->is_subset
< 0 || !data
->is_subset
)
2543 return isl_stat_error
;
2548 isl_bool
isl_union_map_is_subset(__isl_keep isl_union_map
*umap1
,
2549 __isl_keep isl_union_map
*umap2
)
2551 struct isl_union_map_is_subset_data data
= { NULL
, isl_bool_true
};
2553 if (!umap1
|| !umap2
)
2554 return isl_bool_error
;
2557 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
2558 &is_subset_entry
, &data
) < 0 &&
2560 return isl_bool_error
;
2562 return data
.is_subset
;
2565 isl_bool
isl_union_set_is_subset(__isl_keep isl_union_set
*uset1
,
2566 __isl_keep isl_union_set
*uset2
)
2568 return isl_union_map_is_subset(uset1
, uset2
);
2571 isl_bool
isl_union_map_is_equal(__isl_keep isl_union_map
*umap1
,
2572 __isl_keep isl_union_map
*umap2
)
2576 if (!umap1
|| !umap2
)
2577 return isl_bool_error
;
2578 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
2579 if (is_subset
!= isl_bool_true
)
2581 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
2585 isl_bool
isl_union_set_is_equal(__isl_keep isl_union_set
*uset1
,
2586 __isl_keep isl_union_set
*uset2
)
2588 return isl_union_map_is_equal(uset1
, uset2
);
2591 isl_bool
isl_union_map_is_strict_subset(__isl_keep isl_union_map
*umap1
,
2592 __isl_keep isl_union_map
*umap2
)
2596 if (!umap1
|| !umap2
)
2597 return isl_bool_error
;
2598 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
2599 if (is_subset
!= isl_bool_true
)
2601 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
2602 return isl_bool_not(is_subset
);
2605 isl_bool
isl_union_set_is_strict_subset(__isl_keep isl_union_set
*uset1
,
2606 __isl_keep isl_union_set
*uset2
)
2608 return isl_union_map_is_strict_subset(uset1
, uset2
);
2611 /* Internal data structure for isl_union_map_is_disjoint.
2612 * umap2 is the union map with which we are comparing.
2613 * is_disjoint is initialized to 1 and is set to 0 as soon
2614 * as the union maps turn out not to be disjoint.
2616 struct isl_union_map_is_disjoint_data
{
2617 isl_union_map
*umap2
;
2618 isl_bool is_disjoint
;
2621 /* Check if "map" is disjoint from data->umap2 and abort
2622 * the search if it is not.
2624 static isl_stat
is_disjoint_entry(void **entry
, void *user
)
2626 struct isl_union_map_is_disjoint_data
*data
= user
;
2627 struct isl_hash_table_entry
*entry2
;
2629 isl_map
*map
= *entry
;
2631 space
= isl_map_peek_space(map
);
2632 entry2
= isl_union_map_find_entry(data
->umap2
, space
, 0);
2634 return isl_stat_error
;
2635 if (entry2
== isl_hash_table_entry_none
)
2638 data
->is_disjoint
= isl_map_is_disjoint(map
, entry2
->data
);
2639 if (data
->is_disjoint
< 0 || !data
->is_disjoint
)
2640 return isl_stat_error
;
2645 /* Are "umap1" and "umap2" disjoint?
2647 isl_bool
isl_union_map_is_disjoint(__isl_keep isl_union_map
*umap1
,
2648 __isl_keep isl_union_map
*umap2
)
2650 struct isl_union_map_is_disjoint_data data
= { NULL
, isl_bool_true
};
2652 umap1
= isl_union_map_copy(umap1
);
2653 umap2
= isl_union_map_copy(umap2
);
2654 umap1
= isl_union_map_align_params(umap1
,
2655 isl_union_map_get_space(umap2
));
2656 umap2
= isl_union_map_align_params(umap2
,
2657 isl_union_map_get_space(umap1
));
2659 if (!umap1
|| !umap2
)
2663 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
2664 &is_disjoint_entry
, &data
) < 0 &&
2668 isl_union_map_free(umap1
);
2669 isl_union_map_free(umap2
);
2671 return data
.is_disjoint
;
2673 isl_union_map_free(umap1
);
2674 isl_union_map_free(umap2
);
2675 return isl_bool_error
;
2678 /* Are "uset1" and "uset2" disjoint?
2680 isl_bool
isl_union_set_is_disjoint(__isl_keep isl_union_set
*uset1
,
2681 __isl_keep isl_union_set
*uset2
)
2683 return isl_union_map_is_disjoint(uset1
, uset2
);
2686 static isl_stat
sample_entry(void **entry
, void *user
)
2688 isl_basic_map
**sample
= (isl_basic_map
**)user
;
2689 isl_map
*map
= *entry
;
2691 *sample
= isl_map_sample(isl_map_copy(map
));
2693 return isl_stat_error
;
2694 if (!isl_basic_map_plain_is_empty(*sample
))
2695 return isl_stat_error
;
2699 __isl_give isl_basic_map
*isl_union_map_sample(__isl_take isl_union_map
*umap
)
2701 isl_basic_map
*sample
= NULL
;
2706 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2707 &sample_entry
, &sample
) < 0 &&
2712 sample
= isl_basic_map_empty(isl_union_map_get_space(umap
));
2714 isl_union_map_free(umap
);
2718 isl_union_map_free(umap
);
2722 __isl_give isl_basic_set
*isl_union_set_sample(__isl_take isl_union_set
*uset
)
2724 return bset_from_bmap(isl_union_map_sample(uset
));
2727 /* Return an element in "uset" in the form of an isl_point.
2728 * Return a void isl_point if "uset" is empty.
2730 __isl_give isl_point
*isl_union_set_sample_point(__isl_take isl_union_set
*uset
)
2732 return isl_basic_set_sample_point(isl_union_set_sample(uset
));
2735 struct isl_forall_data
{
2737 isl_bool (*fn
)(__isl_keep isl_map
*map
);
2740 static isl_stat
forall_entry(void **entry
, void *user
)
2742 struct isl_forall_data
*data
= user
;
2743 isl_map
*map
= *entry
;
2745 data
->res
= data
->fn(map
);
2747 return isl_stat_error
;
2750 return isl_stat_error
;
2755 static isl_bool
union_map_forall(__isl_keep isl_union_map
*umap
,
2756 isl_bool (*fn
)(__isl_keep isl_map
*map
))
2758 struct isl_forall_data data
= { isl_bool_true
, fn
};
2761 return isl_bool_error
;
2763 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2764 &forall_entry
, &data
) < 0 && data
.res
)
2765 return isl_bool_error
;
2770 struct isl_forall_user_data
{
2772 isl_bool (*fn
)(__isl_keep isl_map
*map
, void *user
);
2776 static isl_stat
forall_user_entry(void **entry
, void *user
)
2778 struct isl_forall_user_data
*data
= user
;
2779 isl_map
*map
= *entry
;
2781 data
->res
= data
->fn(map
, data
->user
);
2783 return isl_stat_error
;
2786 return isl_stat_error
;
2791 /* Check if fn(map, user) returns true for all maps "map" in umap.
2793 static isl_bool
union_map_forall_user(__isl_keep isl_union_map
*umap
,
2794 isl_bool (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
2796 struct isl_forall_user_data data
= { isl_bool_true
, fn
, user
};
2799 return isl_bool_error
;
2801 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2802 &forall_user_entry
, &data
) < 0 && data
.res
)
2803 return isl_bool_error
;
2808 /* Is "umap" obviously empty?
2810 isl_bool
isl_union_map_plain_is_empty(__isl_keep isl_union_map
*umap
)
2814 n
= isl_union_map_n_map(umap
);
2816 return isl_bool_error
;
2820 isl_bool
isl_union_map_is_empty(__isl_keep isl_union_map
*umap
)
2822 return union_map_forall(umap
, &isl_map_is_empty
);
2825 isl_bool
isl_union_set_is_empty(__isl_keep isl_union_set
*uset
)
2827 return isl_union_map_is_empty(uset
);
2830 static isl_bool
is_subset_of_identity(__isl_keep isl_map
*map
)
2837 match
= isl_map_tuple_is_equal(map
, isl_dim_in
, map
, isl_dim_out
);
2839 return isl_bool_error
;
2841 return isl_bool_false
;
2843 space
= isl_map_get_space(map
);
2844 id
= isl_map_identity(space
);
2846 is_subset
= isl_map_is_subset(map
, id
);
2853 /* Given an isl_union_map that consists of a single map, check
2854 * if it is single-valued.
2856 static isl_bool
single_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2861 umap
= isl_union_map_copy(umap
);
2862 map
= isl_map_from_union_map(umap
);
2863 sv
= isl_map_is_single_valued(map
);
2869 /* Internal data structure for single_valued_on_domain.
2871 * "umap" is the union map to be tested.
2872 * "sv" is set to 1 as long as "umap" may still be single-valued.
2874 struct isl_union_map_is_sv_data
{
2875 isl_union_map
*umap
;
2879 /* Check if the data->umap is single-valued on "set".
2881 * If data->umap consists of a single map on "set", then test it
2884 * Otherwise, compute
2888 * check if the result is a subset of the identity mapping and
2889 * store the result in data->sv.
2891 * Terminate as soon as data->umap has been determined not to
2894 static isl_stat
single_valued_on_domain(__isl_take isl_set
*set
, void *user
)
2896 struct isl_union_map_is_sv_data
*data
= user
;
2897 isl_union_map
*umap
, *test
;
2900 umap
= isl_union_map_copy(data
->umap
);
2901 umap
= isl_union_map_intersect_domain(umap
,
2902 isl_union_set_from_set(set
));
2904 n
= isl_union_map_n_map(umap
);
2906 data
->sv
= isl_bool_error
;
2907 } else if (n
== 1) {
2908 data
->sv
= single_map_is_single_valued(umap
);
2909 isl_union_map_free(umap
);
2911 test
= isl_union_map_reverse(isl_union_map_copy(umap
));
2912 test
= isl_union_map_apply_range(test
, umap
);
2914 data
->sv
= union_map_forall(test
, &is_subset_of_identity
);
2916 isl_union_map_free(test
);
2919 if (data
->sv
< 0 || !data
->sv
)
2920 return isl_stat_error
;
2924 /* Check if the given map is single-valued.
2926 * If the union map consists of a single map, then test it as an isl_map.
2927 * Otherwise, check if the union map is single-valued on each of its
2930 isl_bool
isl_union_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2932 isl_union_map
*universe
;
2933 isl_union_set
*domain
;
2934 struct isl_union_map_is_sv_data data
;
2937 n
= isl_union_map_n_map(umap
);
2939 return isl_bool_error
;
2941 return single_map_is_single_valued(umap
);
2943 universe
= isl_union_map_universe(isl_union_map_copy(umap
));
2944 domain
= isl_union_map_domain(universe
);
2946 data
.sv
= isl_bool_true
;
2948 if (isl_union_set_foreach_set(domain
,
2949 &single_valued_on_domain
, &data
) < 0 && data
.sv
)
2950 data
.sv
= isl_bool_error
;
2951 isl_union_set_free(domain
);
2956 isl_bool
isl_union_map_is_injective(__isl_keep isl_union_map
*umap
)
2960 umap
= isl_union_map_copy(umap
);
2961 umap
= isl_union_map_reverse(umap
);
2962 in
= isl_union_map_is_single_valued(umap
);
2963 isl_union_map_free(umap
);
2968 /* Is "map" obviously not an identity relation because
2969 * it maps elements from one space to another space?
2970 * Update *non_identity accordingly.
2972 * In particular, if the domain and range spaces are the same,
2973 * then the map is not considered to obviously not be an identity relation.
2974 * Otherwise, the map is considered to obviously not be an identity relation
2975 * if it is is non-empty.
2977 * If "map" is determined to obviously not be an identity relation,
2978 * then the search is aborted.
2980 static isl_stat
map_plain_is_not_identity(__isl_take isl_map
*map
, void *user
)
2982 isl_bool
*non_identity
= user
;
2985 equal
= isl_map_tuple_is_equal(map
, isl_dim_in
, map
, isl_dim_out
);
2986 if (equal
>= 0 && !equal
)
2987 *non_identity
= isl_bool_not(isl_map_is_empty(map
));
2989 *non_identity
= isl_bool_not(equal
);
2992 if (*non_identity
< 0 || *non_identity
)
2993 return isl_stat_error
;
2998 /* Is "umap" obviously not an identity relation because
2999 * it maps elements from one space to another space?
3001 * As soon as a map has been found that maps elements to a different space,
3002 * non_identity is changed and the search is aborted.
3004 static isl_bool
isl_union_map_plain_is_not_identity(
3005 __isl_keep isl_union_map
*umap
)
3007 isl_bool non_identity
;
3009 non_identity
= isl_bool_false
;
3010 if (isl_union_map_foreach_map(umap
, &map_plain_is_not_identity
,
3011 &non_identity
) < 0 &&
3012 non_identity
== isl_bool_false
)
3013 return isl_bool_error
;
3015 return non_identity
;
3018 /* Does "map" only map elements to themselves?
3019 * Update *identity accordingly.
3021 * If "map" is determined not to be an identity relation,
3022 * then the search is aborted.
3024 static isl_stat
map_is_identity(__isl_take isl_map
*map
, void *user
)
3026 isl_bool
*identity
= user
;
3028 *identity
= isl_map_is_identity(map
);
3031 if (*identity
< 0 || !*identity
)
3032 return isl_stat_error
;
3037 /* Does "umap" only map elements to themselves?
3039 * First check if there are any maps that map elements to different spaces.
3040 * If not, then check that all the maps (between identical spaces)
3041 * are identity relations.
3043 isl_bool
isl_union_map_is_identity(__isl_keep isl_union_map
*umap
)
3045 isl_bool non_identity
;
3048 non_identity
= isl_union_map_plain_is_not_identity(umap
);
3049 if (non_identity
< 0 || non_identity
)
3050 return isl_bool_not(non_identity
);
3052 identity
= isl_bool_true
;
3053 if (isl_union_map_foreach_map(umap
, &map_is_identity
, &identity
) < 0 &&
3054 identity
== isl_bool_true
)
3055 return isl_bool_error
;
3060 /* Represents a map that has a fixed value (v) for one of its
3062 * The map in this structure is not reference counted, so it
3063 * is only valid while the isl_union_map from which it was
3064 * obtained is still alive.
3066 struct isl_fixed_map
{
3071 static struct isl_fixed_map
*alloc_isl_fixed_map_array(isl_ctx
*ctx
,
3075 struct isl_fixed_map
*v
;
3077 v
= isl_calloc_array(ctx
, struct isl_fixed_map
, n
);
3080 for (i
= 0; i
< n
; ++i
)
3081 isl_int_init(v
[i
].v
);
3085 static void free_isl_fixed_map_array(struct isl_fixed_map
*v
, int n
)
3091 for (i
= 0; i
< n
; ++i
)
3092 isl_int_clear(v
[i
].v
);
3096 /* Compare the "v" field of two isl_fixed_map structs.
3098 static int qsort_fixed_map_cmp(const void *p1
, const void *p2
)
3100 const struct isl_fixed_map
*e1
= (const struct isl_fixed_map
*) p1
;
3101 const struct isl_fixed_map
*e2
= (const struct isl_fixed_map
*) p2
;
3103 return isl_int_cmp(e1
->v
, e2
->v
);
3106 /* Internal data structure used while checking whether all maps
3107 * in a union_map have a fixed value for a given output dimension.
3108 * v is the list of maps, with the fixed value for the dimension
3109 * n is the number of maps considered so far
3110 * pos is the output dimension under investigation
3112 struct isl_fixed_dim_data
{
3113 struct isl_fixed_map
*v
;
3118 static isl_bool
fixed_at_pos(__isl_keep isl_map
*map
, void *user
)
3120 struct isl_fixed_dim_data
*data
= user
;
3122 data
->v
[data
->n
].map
= map
;
3123 return isl_map_plain_is_fixed(map
, isl_dim_out
, data
->pos
,
3124 &data
->v
[data
->n
++].v
);
3127 static isl_bool
plain_injective_on_range(__isl_take isl_union_map
*umap
,
3128 int first
, int n_range
);
3130 /* Given a list of the maps, with their fixed values at output dimension "pos",
3131 * check whether the ranges of the maps form an obvious partition.
3133 * We first sort the maps according to their fixed values.
3134 * If all maps have a different value, then we know the ranges form
3136 * Otherwise, we collect the maps with the same fixed value and
3137 * check whether each such collection is obviously injective
3138 * based on later dimensions.
3140 static int separates(struct isl_fixed_map
*v
, int n
,
3141 __isl_take isl_space
*space
, int pos
, int n_range
)
3148 qsort(v
, n
, sizeof(*v
), &qsort_fixed_map_cmp
);
3150 for (i
= 0; i
+ 1 < n
; ++i
) {
3152 isl_union_map
*part
;
3155 for (j
= i
+ 1; j
< n
; ++j
)
3156 if (isl_int_ne(v
[i
].v
, v
[j
].v
))
3162 part
= isl_union_map_alloc(isl_space_copy(space
), j
- i
);
3163 for (k
= i
; k
< j
; ++k
)
3164 part
= isl_union_map_add_map(part
,
3165 isl_map_copy(v
[k
].map
));
3167 injective
= plain_injective_on_range(part
, pos
+ 1, n_range
);
3176 isl_space_free(space
);
3177 free_isl_fixed_map_array(v
, n
);
3180 isl_space_free(space
);
3181 free_isl_fixed_map_array(v
, n
);
3185 /* Check whether the maps in umap have obviously distinct ranges.
3186 * In particular, check for an output dimension in the range
3187 * [first,n_range) for which all maps have a fixed value
3188 * and then check if these values, possibly along with fixed values
3189 * at later dimensions, entail distinct ranges.
3191 static isl_bool
plain_injective_on_range(__isl_take isl_union_map
*umap
,
3192 int first
, int n_range
)
3196 struct isl_fixed_dim_data data
= { NULL
};
3198 ctx
= isl_union_map_get_ctx(umap
);
3200 n
= isl_union_map_n_map(umap
);
3205 isl_union_map_free(umap
);
3206 return isl_bool_true
;
3209 if (first
>= n_range
) {
3210 isl_union_map_free(umap
);
3211 return isl_bool_false
;
3214 data
.v
= alloc_isl_fixed_map_array(ctx
, n
);
3218 for (data
.pos
= first
; data
.pos
< n_range
; ++data
.pos
) {
3224 fixed
= union_map_forall_user(umap
, &fixed_at_pos
, &data
);
3229 space
= isl_union_map_get_space(umap
);
3230 injective
= separates(data
.v
, n
, space
, data
.pos
, n_range
);
3231 isl_union_map_free(umap
);
3235 free_isl_fixed_map_array(data
.v
, n
);
3236 isl_union_map_free(umap
);
3238 return isl_bool_false
;
3240 free_isl_fixed_map_array(data
.v
, n
);
3241 isl_union_map_free(umap
);
3242 return isl_bool_error
;
3245 /* Check whether the maps in umap that map to subsets of "ran"
3246 * have obviously distinct ranges.
3248 static isl_bool
plain_injective_on_range_wrap(__isl_keep isl_set
*ran
,
3252 isl_union_map
*umap
= user
;
3254 dim
= isl_set_dim(ran
, isl_dim_set
);
3256 return isl_bool_error
;
3258 umap
= isl_union_map_copy(umap
);
3259 umap
= isl_union_map_intersect_range(umap
,
3260 isl_union_set_from_set(isl_set_copy(ran
)));
3261 return plain_injective_on_range(umap
, 0, dim
);
3264 /* Check if the given union_map is obviously injective.
3266 * In particular, we first check if all individual maps are obviously
3267 * injective and then check if all the ranges of these maps are
3268 * obviously disjoint.
3270 isl_bool
isl_union_map_plain_is_injective(__isl_keep isl_union_map
*umap
)
3273 isl_union_map
*univ
;
3276 in
= union_map_forall(umap
, &isl_map_plain_is_injective
);
3278 return isl_bool_error
;
3280 return isl_bool_false
;
3282 univ
= isl_union_map_universe(isl_union_map_copy(umap
));
3283 ran
= isl_union_map_range(univ
);
3285 in
= union_map_forall_user(ran
, &plain_injective_on_range_wrap
, umap
);
3287 isl_union_set_free(ran
);
3292 isl_bool
isl_union_map_is_bijective(__isl_keep isl_union_map
*umap
)
3296 sv
= isl_union_map_is_single_valued(umap
);
3300 return isl_union_map_is_injective(umap
);
3303 __isl_give isl_union_map
*isl_union_map_zip(__isl_take isl_union_map
*umap
)
3305 struct isl_un_op_drop_user_data data
= { &isl_map_can_zip
};
3306 struct isl_un_op_control control
= {
3307 .filter
= &un_op_filter_drop_user
,
3308 .filter_user
= &data
,
3309 .fn_map
= &isl_map_zip
,
3311 return un_op(umap
, &control
);
3314 /* Given a union map, take the maps of the form A -> (B -> C) and
3315 * return the union of the corresponding maps (A -> B) -> C.
3317 __isl_give isl_union_map
*isl_union_map_uncurry(__isl_take isl_union_map
*umap
)
3319 struct isl_un_op_drop_user_data data
= { &isl_map_can_uncurry
};
3320 struct isl_un_op_control control
= {
3321 .filter
= &un_op_filter_drop_user
,
3322 .filter_user
= &data
,
3323 .fn_map
= &isl_map_uncurry
,
3325 return un_op(umap
, &control
);
3328 /* Given a union map, take the maps of the form (A -> B) -> C and
3329 * return the union of the corresponding maps A -> (B -> C).
3331 __isl_give isl_union_map
*isl_union_map_curry(__isl_take isl_union_map
*umap
)
3333 struct isl_un_op_drop_user_data data
= { &isl_map_can_curry
};
3334 struct isl_un_op_control control
= {
3335 .filter
= &un_op_filter_drop_user
,
3336 .filter_user
= &data
,
3337 .fn_map
= &isl_map_curry
,
3339 return un_op(umap
, &control
);
3342 /* Given a union map, take the maps of the form A -> ((B -> C) -> D) and
3343 * return the union of the corresponding maps A -> (B -> (C -> D)).
3345 __isl_give isl_union_map
*isl_union_map_range_curry(
3346 __isl_take isl_union_map
*umap
)
3348 struct isl_un_op_drop_user_data data
= { &isl_map_can_range_curry
};
3349 struct isl_un_op_control control
= {
3350 .filter
= &un_op_filter_drop_user
,
3351 .filter_user
= &data
,
3352 .fn_map
= &isl_map_range_curry
,
3354 return un_op(umap
, &control
);
3357 __isl_give isl_union_set
*isl_union_set_lift(__isl_take isl_union_set
*uset
)
3359 struct isl_un_op_control control
= {
3360 .fn_map
= &isl_set_lift
,
3362 return un_op(uset
, &control
);
3365 static isl_stat
coefficients_entry(void **entry
, void *user
)
3367 isl_set
*set
= *entry
;
3368 isl_union_set
**res
= user
;
3370 set
= isl_set_copy(set
);
3371 set
= isl_set_from_basic_set(isl_set_coefficients(set
));
3372 *res
= isl_union_set_add_set(*res
, set
);
3377 __isl_give isl_union_set
*isl_union_set_coefficients(
3378 __isl_take isl_union_set
*uset
)
3387 ctx
= isl_union_set_get_ctx(uset
);
3388 space
= isl_space_set_alloc(ctx
, 0, 0);
3389 res
= isl_union_map_alloc(space
, uset
->table
.n
);
3390 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
3391 &coefficients_entry
, &res
) < 0)
3394 isl_union_set_free(uset
);
3397 isl_union_set_free(uset
);
3398 isl_union_set_free(res
);
3402 static isl_stat
solutions_entry(void **entry
, void *user
)
3404 isl_set
*set
= *entry
;
3405 isl_union_set
**res
= user
;
3407 set
= isl_set_copy(set
);
3408 set
= isl_set_from_basic_set(isl_set_solutions(set
));
3410 *res
= isl_union_set_from_set(set
);
3412 *res
= isl_union_set_add_set(*res
, set
);
3415 return isl_stat_error
;
3420 __isl_give isl_union_set
*isl_union_set_solutions(
3421 __isl_take isl_union_set
*uset
)
3423 isl_union_set
*res
= NULL
;
3428 if (uset
->table
.n
== 0) {
3429 res
= isl_union_set_empty(isl_union_set_get_space(uset
));
3430 isl_union_set_free(uset
);
3434 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
3435 &solutions_entry
, &res
) < 0)
3438 isl_union_set_free(uset
);
3441 isl_union_set_free(uset
);
3442 isl_union_set_free(res
);
3446 /* Is the domain space of "map" equal to "space"?
3448 static int domain_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
3450 return isl_map_space_tuple_is_equal(map
, isl_dim_in
,
3451 space
, isl_dim_out
);
3454 /* Is the range space of "map" equal to "space"?
3456 static int range_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
3458 return isl_map_space_tuple_is_equal(map
, isl_dim_out
,
3459 space
, isl_dim_out
);
3462 /* Is the set space of "map" equal to "space"?
3464 static int set_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
3466 return isl_map_space_tuple_is_equal(map
, isl_dim_set
,
3467 space
, isl_dim_out
);
3470 /* Internal data structure for preimage_pw_multi_aff.
3472 * "pma" is the function under which the preimage should be taken.
3473 * "space" is the space of "pma".
3474 * "res" collects the results.
3475 * "fn" computes the preimage for a given map.
3476 * "match" returns true if "fn" can be called.
3478 struct isl_union_map_preimage_data
{
3480 isl_pw_multi_aff
*pma
;
3482 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
3483 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3484 __isl_take isl_pw_multi_aff
*pma
);
3487 /* Call data->fn to compute the preimage of the domain or range of *entry
3488 * under the function represented by data->pma, provided the domain/range
3489 * space of *entry matches the target space of data->pma
3490 * (as given by data->match), and add the result to data->res.
3492 static isl_stat
preimage_entry(void **entry
, void *user
)
3495 isl_map
*map
= *entry
;
3496 struct isl_union_map_preimage_data
*data
= user
;
3499 m
= data
->match(map
, data
->space
);
3501 return isl_stat_error
;
3505 map
= isl_map_copy(map
);
3506 map
= data
->fn(map
, isl_pw_multi_aff_copy(data
->pma
));
3508 empty
= isl_map_is_empty(map
);
3509 if (empty
< 0 || empty
) {
3511 return empty
< 0 ? isl_stat_error
: isl_stat_ok
;
3514 data
->res
= isl_union_map_add_map(data
->res
, map
);
3519 /* Compute the preimage of the domain or range of "umap" under the function
3520 * represented by "pma".
3521 * In other words, plug in "pma" in the domain or range of "umap".
3522 * The function "fn" performs the actual preimage computation on a map,
3523 * while "match" determines to which maps the function should be applied.
3525 static __isl_give isl_union_map
*preimage_pw_multi_aff(
3526 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
,
3527 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
3528 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3529 __isl_take isl_pw_multi_aff
*pma
))
3533 struct isl_union_map_preimage_data data
;
3535 umap
= isl_union_map_align_params(umap
,
3536 isl_pw_multi_aff_get_space(pma
));
3537 pma
= isl_pw_multi_aff_align_params(pma
, isl_union_map_get_space(umap
));
3542 ctx
= isl_union_map_get_ctx(umap
);
3543 space
= isl_union_map_get_space(umap
);
3544 data
.space
= isl_pw_multi_aff_get_space(pma
);
3546 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
3549 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_entry
,
3551 data
.res
= isl_union_map_free(data
.res
);
3553 isl_space_free(data
.space
);
3554 isl_union_map_free(umap
);
3555 isl_pw_multi_aff_free(pma
);
3558 isl_union_map_free(umap
);
3559 isl_pw_multi_aff_free(pma
);
3563 /* Compute the preimage of the domain of "umap" under the function
3564 * represented by "pma".
3565 * In other words, plug in "pma" in the domain of "umap".
3566 * The result contains maps that live in the same spaces as the maps of "umap"
3567 * with domain space equal to the target space of "pma",
3568 * except that the domain has been replaced by the domain space of "pma".
3570 __isl_give isl_union_map
*isl_union_map_preimage_domain_pw_multi_aff(
3571 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
3573 return preimage_pw_multi_aff(umap
, pma
, &domain_match
,
3574 &isl_map_preimage_domain_pw_multi_aff
);
3577 /* Compute the preimage of the range of "umap" under the function
3578 * represented by "pma".
3579 * In other words, plug in "pma" in the range of "umap".
3580 * The result contains maps that live in the same spaces as the maps of "umap"
3581 * with range space equal to the target space of "pma",
3582 * except that the range has been replaced by the domain space of "pma".
3584 __isl_give isl_union_map
*isl_union_map_preimage_range_pw_multi_aff(
3585 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
3587 return preimage_pw_multi_aff(umap
, pma
, &range_match
,
3588 &isl_map_preimage_range_pw_multi_aff
);
3591 /* Compute the preimage of "uset" under the function represented by "pma".
3592 * In other words, plug in "pma" in "uset".
3593 * The result contains sets that live in the same spaces as the sets of "uset"
3594 * with space equal to the target space of "pma",
3595 * except that the space has been replaced by the domain space of "pma".
3597 __isl_give isl_union_set
*isl_union_set_preimage_pw_multi_aff(
3598 __isl_take isl_union_set
*uset
, __isl_take isl_pw_multi_aff
*pma
)
3600 return preimage_pw_multi_aff(uset
, pma
, &set_match
,
3601 &isl_set_preimage_pw_multi_aff
);
3604 /* Compute the preimage of the domain of "umap" under the function
3605 * represented by "ma".
3606 * In other words, plug in "ma" in the domain of "umap".
3607 * The result contains maps that live in the same spaces as the maps of "umap"
3608 * with domain space equal to the target space of "ma",
3609 * except that the domain has been replaced by the domain space of "ma".
3611 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_aff(
3612 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
3614 return isl_union_map_preimage_domain_pw_multi_aff(umap
,
3615 isl_pw_multi_aff_from_multi_aff(ma
));
3618 /* Compute the preimage of the range of "umap" under the function
3619 * represented by "ma".
3620 * In other words, plug in "ma" in the range of "umap".
3621 * The result contains maps that live in the same spaces as the maps of "umap"
3622 * with range space equal to the target space of "ma",
3623 * except that the range has been replaced by the domain space of "ma".
3625 __isl_give isl_union_map
*isl_union_map_preimage_range_multi_aff(
3626 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
3628 return isl_union_map_preimage_range_pw_multi_aff(umap
,
3629 isl_pw_multi_aff_from_multi_aff(ma
));
3632 /* Compute the preimage of "uset" under the function represented by "ma".
3633 * In other words, plug in "ma" in "uset".
3634 * The result contains sets that live in the same spaces as the sets of "uset"
3635 * with space equal to the target space of "ma",
3636 * except that the space has been replaced by the domain space of "ma".
3638 __isl_give isl_union_map
*isl_union_set_preimage_multi_aff(
3639 __isl_take isl_union_set
*uset
, __isl_take isl_multi_aff
*ma
)
3641 return isl_union_set_preimage_pw_multi_aff(uset
,
3642 isl_pw_multi_aff_from_multi_aff(ma
));
3645 /* Internal data structure for preimage_multi_pw_aff.
3647 * "mpa" is the function under which the preimage should be taken.
3648 * "space" is the space of "mpa".
3649 * "res" collects the results.
3650 * "fn" computes the preimage for a given map.
3651 * "match" returns true if "fn" can be called.
3653 struct isl_union_map_preimage_mpa_data
{
3655 isl_multi_pw_aff
*mpa
;
3657 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
3658 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3659 __isl_take isl_multi_pw_aff
*mpa
);
3662 /* Call data->fn to compute the preimage of the domain or range of *entry
3663 * under the function represented by data->mpa, provided the domain/range
3664 * space of *entry matches the target space of data->mpa
3665 * (as given by data->match), and add the result to data->res.
3667 static isl_stat
preimage_mpa_entry(void **entry
, void *user
)
3670 isl_map
*map
= *entry
;
3671 struct isl_union_map_preimage_mpa_data
*data
= user
;
3674 m
= data
->match(map
, data
->space
);
3676 return isl_stat_error
;
3680 map
= isl_map_copy(map
);
3681 map
= data
->fn(map
, isl_multi_pw_aff_copy(data
->mpa
));
3683 empty
= isl_map_is_empty(map
);
3684 if (empty
< 0 || empty
) {
3686 return empty
< 0 ? isl_stat_error
: isl_stat_ok
;
3689 data
->res
= isl_union_map_add_map(data
->res
, map
);
3694 /* Compute the preimage of the domain or range of "umap" under the function
3695 * represented by "mpa".
3696 * In other words, plug in "mpa" in the domain or range of "umap".
3697 * The function "fn" performs the actual preimage computation on a map,
3698 * while "match" determines to which maps the function should be applied.
3700 static __isl_give isl_union_map
*preimage_multi_pw_aff(
3701 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
,
3702 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
3703 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3704 __isl_take isl_multi_pw_aff
*mpa
))
3708 struct isl_union_map_preimage_mpa_data data
;
3710 umap
= isl_union_map_align_params(umap
,
3711 isl_multi_pw_aff_get_space(mpa
));
3712 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_union_map_get_space(umap
));
3717 ctx
= isl_union_map_get_ctx(umap
);
3718 space
= isl_union_map_get_space(umap
);
3719 data
.space
= isl_multi_pw_aff_get_space(mpa
);
3721 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
3724 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_mpa_entry
,
3726 data
.res
= isl_union_map_free(data
.res
);
3728 isl_space_free(data
.space
);
3729 isl_union_map_free(umap
);
3730 isl_multi_pw_aff_free(mpa
);
3733 isl_union_map_free(umap
);
3734 isl_multi_pw_aff_free(mpa
);
3738 /* Compute the preimage of the domain of "umap" under the function
3739 * represented by "mpa".
3740 * In other words, plug in "mpa" in the domain of "umap".
3741 * The result contains maps that live in the same spaces as the maps of "umap"
3742 * with domain space equal to the target space of "mpa",
3743 * except that the domain has been replaced by the domain space of "mpa".
3745 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_pw_aff(
3746 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
)
3748 return preimage_multi_pw_aff(umap
, mpa
, &domain_match
,
3749 &isl_map_preimage_domain_multi_pw_aff
);
3752 /* Internal data structure for preimage_upma.
3754 * "umap" is the map of which the preimage should be computed.
3755 * "res" collects the results.
3756 * "fn" computes the preimage for a given piecewise multi-affine function.
3758 struct isl_union_map_preimage_upma_data
{
3759 isl_union_map
*umap
;
3761 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
3762 __isl_take isl_pw_multi_aff
*pma
);
3765 /* Call data->fn to compute the preimage of the domain or range of data->umap
3766 * under the function represented by pma and add the result to data->res.
3768 static isl_stat
preimage_upma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
3770 struct isl_union_map_preimage_upma_data
*data
= user
;
3771 isl_union_map
*umap
;
3773 umap
= isl_union_map_copy(data
->umap
);
3774 umap
= data
->fn(umap
, pma
);
3775 data
->res
= isl_union_map_union(data
->res
, umap
);
3777 return data
->res
? isl_stat_ok
: isl_stat_error
;
3780 /* Compute the preimage of the domain or range of "umap" under the function
3781 * represented by "upma".
3782 * In other words, plug in "upma" in the domain or range of "umap".
3783 * The function "fn" performs the actual preimage computation
3784 * on a piecewise multi-affine function.
3786 static __isl_give isl_union_map
*preimage_union_pw_multi_aff(
3787 __isl_take isl_union_map
*umap
,
3788 __isl_take isl_union_pw_multi_aff
*upma
,
3789 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
3790 __isl_take isl_pw_multi_aff
*pma
))
3792 struct isl_union_map_preimage_upma_data data
;
3795 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
3797 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
3798 &preimage_upma
, &data
) < 0)
3799 data
.res
= isl_union_map_free(data
.res
);
3801 isl_union_map_free(umap
);
3802 isl_union_pw_multi_aff_free(upma
);
3807 /* Compute the preimage of the domain of "umap" under the function
3808 * represented by "upma".
3809 * In other words, plug in "upma" in the domain of "umap".
3810 * The result contains maps that live in the same spaces as the maps of "umap"
3811 * with domain space equal to one of the target spaces of "upma",
3812 * except that the domain has been replaced by one of the domain spaces that
3813 * correspond to that target space of "upma".
3815 __isl_give isl_union_map
*isl_union_map_preimage_domain_union_pw_multi_aff(
3816 __isl_take isl_union_map
*umap
,
3817 __isl_take isl_union_pw_multi_aff
*upma
)
3819 return preimage_union_pw_multi_aff(umap
, upma
,
3820 &isl_union_map_preimage_domain_pw_multi_aff
);
3823 /* Compute the preimage of the range of "umap" under the function
3824 * represented by "upma".
3825 * In other words, plug in "upma" in the range of "umap".
3826 * The result contains maps that live in the same spaces as the maps of "umap"
3827 * with range space equal to one of the target spaces of "upma",
3828 * except that the range has been replaced by one of the domain spaces that
3829 * correspond to that target space of "upma".
3831 __isl_give isl_union_map
*isl_union_map_preimage_range_union_pw_multi_aff(
3832 __isl_take isl_union_map
*umap
,
3833 __isl_take isl_union_pw_multi_aff
*upma
)
3835 return preimage_union_pw_multi_aff(umap
, upma
,
3836 &isl_union_map_preimage_range_pw_multi_aff
);
3839 /* Compute the preimage of "uset" under the function represented by "upma".
3840 * In other words, plug in "upma" in the range of "uset".
3841 * The result contains sets that live in the same spaces as the sets of "uset"
3842 * with space equal to one of the target spaces of "upma",
3843 * except that the space has been replaced by one of the domain spaces that
3844 * correspond to that target space of "upma".
3846 __isl_give isl_union_set
*isl_union_set_preimage_union_pw_multi_aff(
3847 __isl_take isl_union_set
*uset
,
3848 __isl_take isl_union_pw_multi_aff
*upma
)
3850 return preimage_union_pw_multi_aff(uset
, upma
,
3851 &isl_union_set_preimage_pw_multi_aff
);
3854 /* Reset the user pointer on all identifiers of parameters and tuples
3855 * of the spaces of "umap".
3857 __isl_give isl_union_map
*isl_union_map_reset_user(
3858 __isl_take isl_union_map
*umap
)
3860 umap
= isl_union_map_cow(umap
);
3863 umap
->dim
= isl_space_reset_user(umap
->dim
);
3865 return isl_union_map_free(umap
);
3866 return total(umap
, &isl_map_reset_user
);
3869 /* Reset the user pointer on all identifiers of parameters and tuples
3870 * of the spaces of "uset".
3872 __isl_give isl_union_set
*isl_union_set_reset_user(
3873 __isl_take isl_union_set
*uset
)
3875 return isl_union_map_reset_user(uset
);
3878 /* Remove all existentially quantified variables and integer divisions
3879 * from "umap" using Fourier-Motzkin elimination.
3881 __isl_give isl_union_map
*isl_union_map_remove_divs(
3882 __isl_take isl_union_map
*umap
)
3884 return total(umap
, &isl_map_remove_divs
);
3887 /* Remove all existentially quantified variables and integer divisions
3888 * from "uset" using Fourier-Motzkin elimination.
3890 __isl_give isl_union_set
*isl_union_set_remove_divs(
3891 __isl_take isl_union_set
*uset
)
3893 return isl_union_map_remove_divs(uset
);
3896 /* Internal data structure for isl_union_map_project_out.
3897 * "type", "first" and "n" are the arguments for the isl_map_project_out
3899 * "res" collects the results.
3901 struct isl_union_map_project_out_data
{
3902 enum isl_dim_type type
;
3909 /* Turn the data->n dimensions of type data->type, starting at data->first
3910 * into existentially quantified variables and add the result to data->res.
3912 static isl_stat
project_out(__isl_take isl_map
*map
, void *user
)
3914 struct isl_union_map_project_out_data
*data
= user
;
3916 map
= isl_map_project_out(map
, data
->type
, data
->first
, data
->n
);
3917 data
->res
= isl_union_map_add_map(data
->res
, map
);
3922 /* Turn the "n" dimensions of type "type", starting at "first"
3923 * into existentially quantified variables.
3924 * Since the space of an isl_union_map only contains parameters,
3925 * type is required to be equal to isl_dim_param.
3927 __isl_give isl_union_map
*isl_union_map_project_out(
3928 __isl_take isl_union_map
*umap
,
3929 enum isl_dim_type type
, unsigned first
, unsigned n
)
3932 struct isl_union_map_project_out_data data
= { type
, first
, n
};
3937 if (type
!= isl_dim_param
)
3938 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
3939 "can only project out parameters",
3940 return isl_union_map_free(umap
));
3942 space
= isl_union_map_get_space(umap
);
3943 space
= isl_space_drop_dims(space
, type
, first
, n
);
3944 data
.res
= isl_union_map_empty(space
);
3945 if (isl_union_map_foreach_map(umap
, &project_out
, &data
) < 0)
3946 data
.res
= isl_union_map_free(data
.res
);
3948 isl_union_map_free(umap
);
3954 #define TYPE isl_union_map
3955 #include "isl_project_out_all_params_templ.c"
3957 /* Turn the "n" dimensions of type "type", starting at "first"
3958 * into existentially quantified variables.
3959 * Since the space of an isl_union_set only contains parameters,
3960 * "type" is required to be equal to isl_dim_param.
3962 __isl_give isl_union_set
*isl_union_set_project_out(
3963 __isl_take isl_union_set
*uset
,
3964 enum isl_dim_type type
, unsigned first
, unsigned n
)
3966 return isl_union_map_project_out(uset
, type
, first
, n
);
3969 /* Project out all parameters from "uset" by existentially quantifying
3972 __isl_give isl_union_set
*isl_union_set_project_out_all_params(
3973 __isl_take isl_union_set
*uset
)
3975 return uset_from_umap(
3976 isl_union_map_project_out_all_params(uset_to_umap(uset
)));
3979 /* Internal data structure for isl_union_map_involves_dims.
3980 * "first" and "n" are the arguments for the isl_map_involves_dims calls.
3982 struct isl_union_map_involves_dims_data
{
3987 /* Does "map" _not_ involve the data->n parameters starting at data->first?
3989 static isl_bool
map_excludes(__isl_keep isl_map
*map
, void *user
)
3991 struct isl_union_map_involves_dims_data
*data
= user
;
3994 involves
= isl_map_involves_dims(map
,
3995 isl_dim_param
, data
->first
, data
->n
);
3996 return isl_bool_not(involves
);
3999 /* Does "umap" involve any of the n parameters starting at first?
4000 * "type" is required to be set to isl_dim_param.
4002 * "umap" involves any of those parameters if any of its maps
4003 * involve the parameters. In other words, "umap" does not
4004 * involve any of the parameters if all its maps to not
4005 * involve the parameters.
4007 isl_bool
isl_union_map_involves_dims(__isl_keep isl_union_map
*umap
,
4008 enum isl_dim_type type
, unsigned first
, unsigned n
)
4010 struct isl_union_map_involves_dims_data data
= { first
, n
};
4013 if (type
!= isl_dim_param
)
4014 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
4015 "can only reference parameters", return isl_bool_error
);
4017 excludes
= union_map_forall_user(umap
, &map_excludes
, &data
);
4019 return isl_bool_not(excludes
);
4022 /* Internal data structure for isl_union_map_reset_range_space.
4023 * "range" is the space from which to set the range space.
4024 * "res" collects the results.
4026 struct isl_union_map_reset_range_space_data
{
4031 /* Replace the range space of "map" by the range space of data->range and
4032 * add the result to data->res.
4034 static isl_stat
reset_range_space(__isl_take isl_map
*map
, void *user
)
4036 struct isl_union_map_reset_range_space_data
*data
= user
;
4039 space
= isl_map_get_space(map
);
4040 space
= isl_space_domain(space
);
4041 space
= isl_space_extend_domain_with_range(space
,
4042 isl_space_copy(data
->range
));
4043 map
= isl_map_reset_space(map
, space
);
4044 data
->res
= isl_union_map_add_map(data
->res
, map
);
4046 return data
->res
? isl_stat_ok
: isl_stat_error
;
4049 /* Replace the range space of all the maps in "umap" by
4050 * the range space of "space".
4052 * This assumes that all maps have the same output dimension.
4053 * This function should therefore not be made publicly available.
4055 * Since the spaces of the maps change, so do their hash value.
4056 * We therefore need to create a new isl_union_map.
4058 __isl_give isl_union_map
*isl_union_map_reset_range_space(
4059 __isl_take isl_union_map
*umap
, __isl_take isl_space
*space
)
4061 struct isl_union_map_reset_range_space_data data
= { space
};
4063 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
4064 if (isl_union_map_foreach_map(umap
, &reset_range_space
, &data
) < 0)
4065 data
.res
= isl_union_map_free(data
.res
);
4067 isl_space_free(space
);
4068 isl_union_map_free(umap
);
4072 /* Check that "umap" and "space" have the same number of parameters.
4074 static isl_stat
check_union_map_space_equal_dim(__isl_keep isl_union_map
*umap
,
4075 __isl_keep isl_space
*space
)
4077 isl_size dim1
, dim2
;
4079 dim1
= isl_union_map_dim(umap
, isl_dim_param
);
4080 dim2
= isl_space_dim(space
, isl_dim_param
);
4081 if (dim1
< 0 || dim2
< 0)
4082 return isl_stat_error
;
4085 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
4086 "number of parameters does not match", return isl_stat_error
);
4089 /* Internal data structure for isl_union_map_reset_equal_dim_space.
4090 * "space" is the target space.
4091 * "res" collects the results.
4093 struct isl_union_map_reset_params_data
{
4098 /* Replace the parameters of "map" by those of data->space and
4099 * add the result to data->res.
4101 static isl_stat
reset_params(__isl_take isl_map
*map
, void *user
)
4103 struct isl_union_map_reset_params_data
*data
= user
;
4106 space
= isl_map_get_space(map
);
4107 space
= isl_space_replace_params(space
, data
->space
);
4108 map
= isl_map_reset_equal_dim_space(map
, space
);
4109 data
->res
= isl_union_map_add_map(data
->res
, map
);
4111 return data
->res
? isl_stat_ok
: isl_stat_error
;
4114 /* Replace the space of "umap" by "space", without modifying
4115 * the dimension of "umap", i.e., the number of parameters of "umap".
4117 * Since the hash values of the maps in the union map depend
4118 * on the parameters, a new union map needs to be constructed.
4120 __isl_give isl_union_map
*isl_union_map_reset_equal_dim_space(
4121 __isl_take isl_union_map
*umap
, __isl_take isl_space
*space
)
4123 struct isl_union_map_reset_params_data data
= { space
};
4125 isl_space
*umap_space
;
4127 umap_space
= isl_union_map_peek_space(umap
);
4128 equal
= isl_space_is_equal(umap_space
, space
);
4132 isl_space_free(space
);
4135 if (check_union_map_space_equal_dim(umap
, space
) < 0)
4138 data
.res
= isl_union_map_empty(isl_space_copy(space
));
4139 if (isl_union_map_foreach_map(umap
, &reset_params
, &data
) < 0)
4140 data
.res
= isl_union_map_free(data
.res
);
4142 isl_space_free(space
);
4143 isl_union_map_free(umap
);
4146 isl_union_map_free(umap
);
4147 isl_space_free(space
);
4151 /* Internal data structure for isl_union_map_order_at_multi_union_pw_aff.
4152 * "mupa" is the function from which the isl_multi_pw_affs are extracted.
4153 * "order" is applied to the extracted isl_multi_pw_affs that correspond
4154 * to the domain and the range of each map.
4155 * "res" collects the results.
4157 struct isl_union_order_at_data
{
4158 isl_multi_union_pw_aff
*mupa
;
4159 __isl_give isl_map
*(*order
)(__isl_take isl_multi_pw_aff
*mpa1
,
4160 __isl_take isl_multi_pw_aff
*mpa2
);
4164 /* Intersect "map" with the result of applying data->order to
4165 * the functions in data->mupa that apply to the domain and the range
4166 * of "map" and add the result to data->res.
4168 static isl_stat
order_at(__isl_take isl_map
*map
, void *user
)
4170 struct isl_union_order_at_data
*data
= user
;
4172 isl_multi_pw_aff
*mpa1
, *mpa2
;
4175 space
= isl_space_domain(isl_map_get_space(map
));
4176 mpa1
= isl_multi_union_pw_aff_extract_multi_pw_aff(data
->mupa
, space
);
4177 space
= isl_space_range(isl_map_get_space(map
));
4178 mpa2
= isl_multi_union_pw_aff_extract_multi_pw_aff(data
->mupa
, space
);
4179 order
= data
->order(mpa1
, mpa2
);
4180 map
= isl_map_intersect(map
, order
);
4181 data
->res
= isl_union_map_add_map(data
->res
, map
);
4183 return data
->res
? isl_stat_ok
: isl_stat_error
;
4186 /* If "mupa" has a non-trivial explicit domain, then intersect
4187 * domain and range of "umap" with this explicit domain.
4188 * If the explicit domain only describes constraints on the parameters,
4189 * then the intersection only needs to be performed once.
4191 static __isl_give isl_union_map
*intersect_explicit_domain(
4192 __isl_take isl_union_map
*umap
, __isl_keep isl_multi_union_pw_aff
*mupa
)
4194 isl_bool non_trivial
, is_params
;
4197 non_trivial
= isl_multi_union_pw_aff_has_non_trivial_domain(mupa
);
4198 if (non_trivial
< 0)
4199 return isl_union_map_free(umap
);
4202 mupa
= isl_multi_union_pw_aff_copy(mupa
);
4203 dom
= isl_multi_union_pw_aff_domain(mupa
);
4204 is_params
= isl_union_set_is_params(dom
);
4205 if (is_params
< 0) {
4206 isl_union_set_free(dom
);
4207 return isl_union_map_free(umap
);
4212 set
= isl_union_set_params(dom
);
4213 umap
= isl_union_map_intersect_params(umap
, set
);
4216 umap
= isl_union_map_intersect_domain(umap
, isl_union_set_copy(dom
));
4217 umap
= isl_union_map_intersect_range(umap
, dom
);
4221 /* Intersect each map in "umap" with the result of calling "order"
4222 * on the functions is "mupa" that apply to the domain and the range
4225 static __isl_give isl_union_map
*isl_union_map_order_at_multi_union_pw_aff(
4226 __isl_take isl_union_map
*umap
, __isl_take isl_multi_union_pw_aff
*mupa
,
4227 __isl_give isl_map
*(*order
)(__isl_take isl_multi_pw_aff
*mpa1
,
4228 __isl_take isl_multi_pw_aff
*mpa2
))
4230 struct isl_union_order_at_data data
;
4232 umap
= isl_union_map_align_params(umap
,
4233 isl_multi_union_pw_aff_get_space(mupa
));
4234 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
4235 isl_union_map_get_space(umap
));
4236 umap
= intersect_explicit_domain(umap
, mupa
);
4239 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
4240 if (isl_union_map_foreach_map(umap
, &order_at
, &data
) < 0)
4241 data
.res
= isl_union_map_free(data
.res
);
4243 isl_multi_union_pw_aff_free(mupa
);
4244 isl_union_map_free(umap
);
4248 /* Return the subset of "umap" where the domain and the range
4249 * have equal "mupa" values.
4251 __isl_give isl_union_map
*isl_union_map_eq_at_multi_union_pw_aff(
4252 __isl_take isl_union_map
*umap
,
4253 __isl_take isl_multi_union_pw_aff
*mupa
)
4255 return isl_union_map_order_at_multi_union_pw_aff(umap
, mupa
,
4256 &isl_multi_pw_aff_eq_map
);
4261 #include "isl_union_map_lex_templ.c"
4265 #include "isl_union_map_lex_templ.c"
4269 #include "isl_union_map_lex_templ.c"
4273 #include "isl_union_map_lex_templ.c"
4275 /* Return the union of the elements in the list "list".
4277 __isl_give isl_union_set
*isl_union_set_list_union(
4278 __isl_take isl_union_set_list
*list
)
4286 n
= isl_union_set_list_n_union_set(list
);
4290 ctx
= isl_union_set_list_get_ctx(list
);
4291 space
= isl_space_params_alloc(ctx
, 0);
4292 res
= isl_union_set_empty(space
);
4294 for (i
= 0; i
< n
; ++i
) {
4295 isl_union_set
*uset_i
;
4297 uset_i
= isl_union_set_list_get_union_set(list
, i
);
4298 res
= isl_union_set_union(res
, uset_i
);
4301 isl_union_set_list_free(list
);
4304 isl_union_set_list_free(list
);
4308 /* Update *hash with the hash value of "map".
4310 static isl_stat
add_hash(__isl_take isl_map
*map
, void *user
)
4312 uint32_t *hash
= user
;
4315 map_hash
= isl_map_get_hash(map
);
4316 isl_hash_hash(*hash
, map_hash
);
4322 /* Return a hash value that digests "umap".
4324 uint32_t isl_union_map_get_hash(__isl_keep isl_union_map
*umap
)
4331 hash
= isl_hash_init();
4332 if (isl_union_map_foreach_map(umap
, &add_hash
, &hash
) < 0)
4338 /* Return a hash value that digests "uset".
4340 uint32_t isl_union_set_get_hash(__isl_keep isl_union_set
*uset
)
4342 return isl_union_map_get_hash(uset
);
4345 /* Add the number of basic sets in "set" to "n".
4347 static isl_stat
add_n(__isl_take isl_set
*set
, void *user
)
4352 set_n
= isl_set_n_basic_set(set
);
4356 return set_n
< 0 ? isl_stat_error
: isl_stat_ok
;
4359 /* Return the total number of basic sets in "uset".
4361 int isl_union_set_n_basic_set(__isl_keep isl_union_set
*uset
)
4365 if (isl_union_set_foreach_set(uset
, &add_n
, &n
) < 0)
4371 /* Add the basic sets in "set" to "list".
4373 static isl_stat
add_list(__isl_take isl_set
*set
, void *user
)
4375 isl_basic_set_list
**list
= user
;
4376 isl_basic_set_list
*list_i
;
4378 list_i
= isl_set_get_basic_set_list(set
);
4379 *list
= isl_basic_set_list_concat(*list
, list_i
);
4383 return isl_stat_error
;
4387 /* Return a list containing all the basic sets in "uset".
4389 * First construct a list of the appropriate size and
4390 * then add all the elements.
4392 __isl_give isl_basic_set_list
*isl_union_set_get_basic_set_list(
4393 __isl_keep isl_union_set
*uset
)
4397 isl_basic_set_list
*list
;
4401 ctx
= isl_union_set_get_ctx(uset
);
4402 n
= isl_union_set_n_basic_set(uset
);
4405 list
= isl_basic_set_list_alloc(ctx
, n
);
4406 if (isl_union_set_foreach_set(uset
, &add_list
, &list
) < 0)
4407 list
= isl_basic_set_list_free(list
);
4412 /* Internal data structure for isl_union_map_remove_map_if.
4413 * "fn" and "user" are the arguments to isl_union_map_remove_map_if.
4415 struct isl_union_map_remove_map_if_data
{
4416 isl_bool (*fn
)(__isl_keep isl_map
*map
, void *user
);
4420 /* isl_un_op_control filter that negates the result of data->fn
4423 static isl_bool
not(__isl_keep isl_map
*map
, void *user
)
4425 struct isl_union_map_remove_map_if_data
*data
= user
;
4427 return isl_bool_not(data
->fn(map
, data
->user
));
4430 /* Dummy isl_un_op_control transformation callback that
4431 * simply returns the input.
4433 static __isl_give isl_map
*map_id(__isl_take isl_map
*map
)
4438 /* Call "fn" on every map in "umap" and remove those maps
4439 * for which the callback returns true.
4441 * Use un_op to keep only those maps that are not filtered out,
4442 * applying an identity transformation on them.
4444 __isl_give isl_union_map
*isl_union_map_remove_map_if(
4445 __isl_take isl_union_map
*umap
,
4446 isl_bool (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
4448 struct isl_union_map_remove_map_if_data data
= { fn
, user
};
4449 struct isl_un_op_control control
= {
4451 .filter_user
= &data
,
4454 return un_op(umap
, &control
);
4457 /* Does "map" have "space" as domain (ignoring parameters)?
4459 static isl_bool
has_domain_space_tuples(__isl_keep isl_map
*map
, void *user
)
4461 isl_space
*space
= user
;
4463 return isl_space_has_domain_tuples(space
, isl_map_peek_space(map
));
4466 /* Does "map" have "space" as range (ignoring parameters)?
4468 static isl_bool
has_range_space_tuples(__isl_keep isl_map
*map
, void *user
)
4470 isl_space
*space
= user
;
4472 return isl_space_has_range_tuples(space
, isl_map_peek_space(map
));
4475 /* Wrapper around isl_map_bind_range for use as a un_op callback.
4477 static __isl_give isl_map
*bind_range(__isl_take isl_map
*map
, void *user
)
4479 isl_multi_id
*tuple
= user
;
4481 return isl_map_bind_range(map
, isl_multi_id_copy(tuple
));
4484 /* Bind the output dimensions of "umap" to parameters with identifiers
4485 * specified by "tuple", living in the range space of "umap",
4486 * for those maps that have a matching range space.
4488 __isl_give isl_union_set
*isl_union_map_bind_range(
4489 __isl_take isl_union_map
*umap
, __isl_take isl_multi_id
*tuple
)
4491 struct isl_un_op_control control
= {
4492 .filter
= &has_range_space_tuples
,
4493 .filter_user
= isl_multi_id_peek_space(tuple
),
4494 .fn_map2
= &bind_range
,
4495 .fn_map2_user
= tuple
,
4497 isl_union_set
*bound
;
4499 bound
= uset_from_umap(un_op(umap
, &control
));
4500 isl_multi_id_free(tuple
);
4504 /* Only keep those elements in "umap" that have a domain in "space".
4506 __isl_give isl_union_map
*isl_union_map_intersect_domain_space(
4507 __isl_take isl_union_map
*umap
, __isl_take isl_space
*space
)
4509 struct isl_un_op_control control
= {
4510 .filter
= &has_domain_space_tuples
,
4511 .filter_user
= space
,
4514 umap
= un_op(umap
, &control
);
4515 isl_space_free(space
);
4519 /* Only keep those elements in "umap" that have a range in "space".
4521 __isl_give isl_union_map
*isl_union_map_intersect_range_space(
4522 __isl_take isl_union_map
*umap
, __isl_take isl_space
*space
)
4524 struct isl_un_op_control control
= {
4525 .filter
= &has_range_space_tuples
,
4526 .filter_user
= space
,
4529 umap
= un_op(umap
, &control
);
4530 isl_space_free(space
);