/build/source/polly/lib/External/isl/isl_union

Bug Summary

File:	build/source/polly/lib/External/isl/isl_union_map.c
Warning:	line 391, column 25 Access to field 'ctx' results in a dereference of a null pointer (loaded from field 'dim')
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name isl_union_map.c -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fdebug-compilation-dir=/build/source/build-llvm/tools/clang/stage2-bins -fdebug-prefix-map=/build/source/build-llvm/tools/clang/stage2-bins=../../../../ -fdebug-prefix-map=/build/source/= -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/source/build-llvm/tools/clang/stage2-bins -resource-dir /usr/lib/llvm-19/lib/clang/19 -I tools/polly/lib/External -I /build/source/polly/lib/External -I /build/source/polly/lib/External/isl -I /build/source/polly/lib/External/isl/include -I /build/source/polly/lib/External/isl/imath -I tools/polly/lib/External/isl -I tools/polly/include -I /build/source/polly/lib/External/pet/include -I tools/polly/lib/External/isl/include -I /build/source/polly/include -I include -I /build/source/llvm/include -D _DEBUG -D _GLIBCXX_ASSERTIONS -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -D _FORTIFY_SOURCE=2 -D NDEBUG -U NDEBUG -internal-isystem /usr/lib/llvm-19/lib/clang/19/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -fmacro-prefix-map=/build/source/build-llvm/tools/clang/stage2-bins=../../../../ -fmacro-prefix-map=/build/source/= -fcoverage-prefix-map=/build/source/build-llvm/tools/clang/stage2-bins=../../../../ -fcoverage-prefix-map=/build/source/= -O2 -Wno-unused-command-line-argument -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=gnu99 -fconst-strings -ferror-limit 19 -stack-protector 2 -fgnuc-version=4.2.1 -fskip-odr-check-in-gmf -fcolor-diagnostics -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2024-04-02-020108-72015-1 -x c /build/source/polly/lib/External/isl/isl_union_map.c
1/*
* Copyright 2010-2011 INRIA Saclay
* Copyright 2013-2014 Ecole Normale Superieure
* Copyright 2014      INRIA Rocquencourt
* Copyright 2016-2017 Sven Verdoolaege
*
* Use of this software is governed by the MIT license
*
* Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
* Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
* 91893 Orsay, France 
* and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
* B.P. 105 - 78153 Le Chesnay, France
*/

16#include <isl_map_private.h>
17#include <isl_union_map_private.h>
18#include <isl/ctx.h>
19#include <isl/hash.h>
20#include <isl_aff_private.h>
21#include <isl/map.h>
22#include <isl/set.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>

35#undef TYPEisl_union_map
36#define TYPEisl_union_map	isl_union_map
37static
38#include "has_single_reference_templ.c"
39static
40#include "check_single_reference_templ.c"

42/* Return the number of parameters of "umap", where "type"
* is required to be set to isl_dim_param.
*/
45isl_size isl_union_map_dim(__isl_keep isl_union_map *umap,
enum isl_dim_type type)
47{
if (!umap)
return isl_size_error((int) -1);

if (type != isl_dim_param)
isl_die(isl_union_map_get_ctx(umap), isl_error_invalid,do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only reference parameters", "polly/lib/External/isl/isl_union_map.c"
, 53); return ((int) -1); } while (0)
	"can only reference parameters", return isl_size_error)do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only reference parameters", "polly/lib/External/isl/isl_union_map.c"
, 53); return ((int) -1); } while (0);

return isl_space_dim(umap->dim, type);
56}

58/* Return the number of parameters of "uset", where "type"
* is required to be set to isl_dim_param.
*/
61isl_size isl_union_set_dim(__isl_keep isl_union_setisl_union_map *uset,
enum isl_dim_type type)
63{
return isl_union_map_dim(uset, type);
65}

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,
enum isl_dim_type type, unsigned pos)
71{
if (!umap)
return NULL((void*)0);

if (type != isl_dim_param)
isl_die(isl_union_map_get_ctx(umap), isl_error_invalid,do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only reference parameters", "polly/lib/External/isl/isl_union_map.c"
, 77); return ((void*)0); } while (0)
	"can only reference parameters", return NULL)do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only reference parameters", "polly/lib/External/isl/isl_union_map.c"
, 77); return ((void*)0); } while (0);

return isl_space_get_dim_id(umap->dim, type, pos);
80}

82/* Is this union set a parameter domain?
*/
84isl_bool isl_union_set_is_params(__isl_keep isl_union_setisl_union_map *uset)
85{
isl_setisl_map *set;
isl_bool params;

if (!uset)
return isl_bool_error;
if (uset->table.n != 1)
return isl_bool_false;

set = isl_set_from_union_set(isl_union_set_copy(uset));
params = isl_set_is_params(set);
isl_set_free(set);
return params;
98}

100/* Is this union map actually a parameter domain?
* Users should never call this function.  Outside of isl,
* a union map can never be a parameter domain.
*/
104isl_bool isl_union_map_is_params(__isl_keep isl_union_map *umap)
105{
return isl_union_set_is_params(uset_from_umap(umap));
107}

109static __isl_give isl_union_map *isl_union_map_alloc(
__isl_take isl_space *space, int size)
111{
isl_union_map *umap;

space = isl_space_params(space);
if (!space)
return NULL((void*)0);

umap = isl_calloc_type(space->ctx, isl_union_map)((isl_union_map *)isl_calloc_or_die(space->ctx, 1, sizeof(
isl_union_map)));
if (!umap) {
isl_space_free(space);
return NULL((void*)0);
}

umap->ref = 1;
umap->dim = space;
if (isl_hash_table_init(space->ctx, &umap->table, size) < 0)
return isl_union_map_free(umap);

return umap;
130}

132/* Create an empty union map without specifying any parameters.
*/
134__isl_give isl_union_map *isl_union_map_empty_ctx(isl_ctx *ctx)
135{
return isl_union_map_empty_space(isl_space_unit(ctx));
137}

139__isl_give isl_union_map *isl_union_map_empty_space(__isl_take isl_space *space)
140{
return isl_union_map_alloc(space, 16);
142}

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)
147{
return isl_union_map_empty_space(space);
149}

151/* Create an empty union set without specifying any parameters.
*/
153__isl_give isl_union_setisl_union_map *isl_union_set_empty_ctx(isl_ctx *ctx)
154{
return uset_from_umap(isl_union_map_empty_ctx(ctx));
156}

158__isl_give isl_union_setisl_union_map *isl_union_set_empty_space(__isl_take isl_space *space)
159{
return uset_from_umap(isl_union_map_empty_space(space));
161}

163/* This is an alternative name for the function above.
*/
165__isl_give isl_union_setisl_union_map *isl_union_set_empty(__isl_take isl_space *space)
166{
return isl_union_set_empty_space(space);
168}

170isl_ctx *isl_union_map_get_ctx(__isl_keep isl_union_map *umap)
171{
return umap ? umap->dim->ctx : NULL((void*)0);
173}

175isl_ctx *isl_union_set_get_ctx(__isl_keep isl_union_setisl_union_map *uset)
176{
return uset ? uset->dim->ctx : NULL((void*)0);
178}

180/* Return the space of "umap".
*/
182__isl_keep isl_space *isl_union_map_peek_space(__isl_keep isl_union_map *umap)
183{
return umap ? umap->dim : NULL((void*)0);
185}

187/* Return the space of "uset".
*/
189__isl_keep isl_space *isl_union_set_peek_space(__isl_keep isl_union_setisl_union_map *uset)
190{
return isl_union_map_peek_space(uset_to_umap(uset));
192}

194__isl_give isl_space *isl_union_map_get_space(__isl_keep isl_union_map *umap)
195{
return isl_space_copy(isl_union_map_peek_space(umap));
197}

199/* Return the position of the parameter with the given name
* in "umap".
* Return -1 if no such dimension can be found.
*/
203int isl_union_map_find_dim_by_name(__isl_keep isl_union_map *umap,
enum isl_dim_type type, const char *name)
205{
if (!umap)
return -1;
return isl_space_find_dim_by_name(umap->dim, type, name);
209}

211/* Return the position of the parameter with id "id" in "umap".
* Return -1 if no such dimension can be found.
*/
214static int isl_union_map_find_dim_by_id(__isl_keep isl_union_map *umap,
enum isl_dim_type type, __isl_keep isl_id *id)
216{
isl_space *space;

space = isl_union_map_peek_space(umap);
return isl_space_find_dim_by_id(space, type, id);
221}

223__isl_give isl_space *isl_union_set_get_space(__isl_keep isl_union_setisl_union_map *uset)
224{
return isl_union_map_get_space(uset);
226}

228static isl_stat free_umap_entry(void **entry, void *user)
229{
isl_map *map = *entry;
isl_map_free(map);
return isl_stat_ok;
233}

235static isl_stat add_map(__isl_take isl_map *map, void *user)
236{
isl_union_map **umap = (isl_union_map **)user;

*umap = isl_union_map_add_map(*umap, map);

return isl_stat_ok;
242}

244__isl_give isl_union_map *isl_union_map_dup(__isl_keep isl_union_map *umap)
245{
isl_union_map *dup;

if (!umap)
return NULL((void*)0);

dup = isl_union_map_empty(isl_space_copy(umap->dim));
if (isl_union_map_foreach_map(umap, &add_map, &dup) < 0)
goto error;
return dup;
255error:
isl_union_map_free(dup);
return NULL((void*)0);
258}

260__isl_give isl_union_map *isl_union_map_cow(__isl_take isl_union_map *umap)
261{
if (!umap)
3
←
Assuming 'umap' is non-null→
4
←
Taking false branch→
return NULL((void*)0);

if (umap->ref == 1)
5
←
Assuming field 'ref' is equal to 1→
6
←
Taking true branch→
return umap;
7
←
Returning pointer (loaded from 'umap'), which participates in a condition later→
umap->ref--;
return isl_union_map_dup(umap);
269}

271struct isl_union_align {
isl_reordering *exp;
isl_union_map *res;
274};

276static isl_stat align_entry(void **entry, void *user)
277{
isl_map *map = *entry;
isl_reordering *exp;
struct isl_union_align *data = user;

exp = isl_reordering_extend_space(isl_reordering_copy(data->exp),
		    isl_map_get_space(map));

data->res = isl_union_map_add_map(data->res,
			isl_map_realign(isl_map_copy(map), exp));

return isl_stat_ok;
289}

291/* Align the parameters of umap along those of model.
* The result has the parameters of model first, in the same order
* as they appear in model, followed by any remaining parameters of
* umap that do not appear in model.
*/
296__isl_give isl_union_map *isl_union_map_align_params(
__isl_take isl_union_map *umap, __isl_take isl_space *model)
298{
struct isl_union_align data = { NULL((void*)0), NULL((void*)0) };
isl_space *space;
isl_bool equal_params;

space = isl_union_map_peek_space(umap);
equal_params = isl_space_has_equal_params(space, model);
if (equal_params < 0)
goto error;
if (equal_params) {
isl_space_free(model);
return umap;
}

data.exp = isl_parameter_alignment_reordering(space, model);
if (!data.exp)
goto error;

data.res = isl_union_map_alloc(isl_reordering_get_space(data.exp),
			umap->table.n);
if (isl_hash_table_foreach(isl_union_map_get_ctx(umap), &umap->table,
			&align_entry, &data) < 0)
goto error;

isl_reordering_free(data.exp);
isl_union_map_free(umap);
isl_space_free(model);
return data.res;
326error:
isl_reordering_free(data.exp);
isl_union_map_free(umap);
isl_union_map_free(data.res);
isl_space_free(model);
return NULL((void*)0);
332}

334__isl_give isl_union_setisl_union_map *isl_union_set_align_params(
__isl_take isl_union_setisl_union_map *uset, __isl_take isl_space *model)
336{
return isl_union_map_align_params(uset, model);
338}

340__isl_give isl_union_map *isl_union_map_union(__isl_take isl_union_map *umap1,
__isl_take isl_union_map *umap2)
342{
umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));

umap1 = isl_union_map_cow(umap1);

if (!umap1 || !umap2)
goto error;

if (isl_union_map_foreach_map(umap2, &add_map, &umap1) < 0)
goto error;

isl_union_map_free(umap2);

return umap1;
357error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
return NULL((void*)0);
361}

363__isl_give isl_union_setisl_union_map *isl_union_set_union(__isl_take isl_union_setisl_union_map *uset1,
__isl_take isl_union_setisl_union_map *uset2)
365{
return isl_union_map_union(uset1, uset2);
367}

369__isl_give isl_union_map *isl_union_map_copy(__isl_keep isl_union_map *umap)
370{
if (!umap)
return NULL((void*)0);

umap->ref++;
return umap;
376}

378__isl_give isl_union_setisl_union_map *isl_union_set_copy(__isl_keep isl_union_setisl_union_map *uset)
379{
return isl_union_map_copy(uset);
381}

383__isl_null isl_union_map *isl_union_map_free(__isl_take isl_union_map *umap)
384{
if (!umap13.1
'umap' is non-null
)
14
←
Taking false branch→
return NULL((void*)0);

if (--umap->ref > 0)
15
←
Taking false branch→
return NULL((void*)0);

isl_hash_table_foreach(umap->dim->ctx, &umap->table,
16
←
Access to field 'ctx' results in a dereference of a null pointer (loaded from field 'dim')
	       &free_umap_entry, NULL((void*)0));
isl_hash_table_clear(&umap->table);
isl_space_free(umap->dim);
free(umap);
return NULL((void*)0);
397}

399__isl_null isl_union_setisl_union_map *isl_union_set_free(__isl_take isl_union_setisl_union_map *uset)
400{
return isl_union_map_free(uset);
402}

404/* Do "umap" and "space" have the same parameters?
*/
406isl_bool isl_union_map_space_has_equal_params(__isl_keep isl_union_map *umap,
__isl_keep isl_space *space)
408{
isl_space *umap_space;

umap_space = isl_union_map_peek_space(umap);
return isl_space_has_equal_params(umap_space, space);
413}

415/* Do "uset" and "space" have the same parameters?
*/
417isl_bool isl_union_set_space_has_equal_params(__isl_keep isl_union_setisl_union_map *uset,
__isl_keep isl_space *space)
419{
return isl_union_map_space_has_equal_params(uset_to_umap(uset), space);
421}

423/* Is the space of the map at "entry" equal to "space", ignoring parameters?
*/
425static isl_bool has_space_tuples(const void *entry, const void *val)
426{
isl_map *map = (isl_map *)entry;
isl_space *space = (isl_space *) val;

return isl_map_has_space_tuples(map, space);
431}

433/* Find the entry in "umap" with space "space" (ignoring parameters),
* returning isl_hash_table_entry_none if no such entry appears in "umap" and
* NULL on error.
* If "reserve" is set, then an entry is created if it does
* not exist already.  Since this modifies the hash table in-place,
* this means "umap" must have a single reference when "reserve" is set.
*/
440static struct isl_hash_table_entry *isl_union_map_find_entry(
__isl_keep isl_union_map *umap, __isl_keep isl_space *space,
int reserve)
443{
uint32_t hash;

if (!umap || !space)
return NULL((void*)0);
if (reserve && isl_union_map_check_single_reference(umap) < 0)
return NULL((void*)0);

hash = isl_space_get_tuple_hash(space);
return isl_hash_table_find(isl_union_map_get_ctx(umap), &umap->table,
		    hash, &has_space_tuples, space, reserve);
454}

456/* Find the entry in "uset" with space "space" (ignoring parameters),
* returning isl_hash_table_entry_none if no such entry appears in "uset" and
* NULL on error.
* If "reserve" is set, then an entry is created if it does
* not exist already.  In this case, a NULL return indicates an error.
*/
462struct isl_hash_table_entry *isl_union_set_find_entry(
__isl_keep isl_union_setisl_union_map *uset, __isl_keep isl_space *space,
int reserve)
465{
return isl_union_map_find_entry(uset_to_umap(uset), space, reserve);
467}

469__isl_give isl_union_map *isl_union_map_add_map(__isl_take isl_union_map *umap,
__isl_take isl_map *map)
471{
struct isl_hash_table_entry *entry;
isl_bool aligned;
isl_space *space;

if (!map || !umap)
goto error;

if (isl_map_plain_is_empty(map)) {
isl_map_free(map);
return umap;
}

aligned = isl_map_space_has_equal_params(map, umap->dim);
if (aligned < 0)
goto error;
if (!aligned) {
umap = isl_union_map_align_params(umap, isl_map_get_space(map));
map = isl_map_align_params(map, isl_union_map_get_space(umap));
}

umap = isl_union_map_cow(umap);

space = isl_map_peek_space(map);
entry = isl_union_map_find_entry(umap, space, 1);
if (!entry)
goto error;

if (!entry->data)
entry->data = map;
else {
entry->data = isl_map_union(entry->data, isl_map_copy(map));
if (!entry->data)
	goto error;
isl_map_free(map);
}

return umap;
509error:
isl_map_free(map);
isl_union_map_free(umap);
return NULL((void*)0);
513}

515__isl_give isl_union_setisl_union_map *isl_union_set_add_set(__isl_take isl_union_setisl_union_map *uset,
__isl_take isl_setisl_map *set)
517{
return isl_union_map_add_map(uset, set_to_map(set));
519}

521__isl_give isl_union_map *isl_union_map_from_map(__isl_take isl_map *map)
522{
isl_space *space;
isl_union_map *umap;

if (!map)
return NULL((void*)0);

space = isl_map_get_space(map);
space = isl_space_params(space);
umap = isl_union_map_empty(space);
umap = isl_union_map_add_map(umap, map);

return umap;
535}

537/* This function performs the same operation as isl_union_map_from_map,
* but is considered as a function on an isl_map when exported.
*/
540__isl_give isl_union_map *isl_map_to_union_map(__isl_take isl_map *map)
541{
return isl_union_map_from_map(map);
543}

545__isl_give isl_union_setisl_union_map *isl_union_set_from_set(__isl_take isl_setisl_map *set)
546{
return isl_union_map_from_map(set_to_map(set));
548}

550/* This function performs the same operation as isl_union_set_from_set,
* but is considered as a function on an isl_set when exported.
*/
553__isl_give isl_union_setisl_union_map *isl_set_to_union_set(__isl_take isl_setisl_map *set)
554{
return isl_union_set_from_set(set);
556}

558__isl_give isl_union_map *isl_union_map_from_basic_map(
__isl_take isl_basic_map *bmap)
560{
return isl_union_map_from_map(isl_map_from_basic_map(bmap));
562}

564__isl_give isl_union_setisl_union_map *isl_union_set_from_basic_set(
__isl_take isl_basic_setisl_basic_map *bset)
566{
return isl_union_map_from_basic_map(bset);
568}

570struct isl_union_map_foreach_data
571{
isl_stat (*fn)(__isl_take isl_map *map, void *user);
void *user;
574};

576static isl_stat call_on_copy(void **entry, void *user)
577{
isl_map *map = *entry;
struct isl_union_map_foreach_data *data;
data = (struct isl_union_map_foreach_data *)user;

return data->fn(isl_map_copy(map), data->user);
583}

585isl_size isl_union_map_n_map(__isl_keep isl_union_map *umap)
586{
return umap ? umap->table.n : isl_size_error((int) -1);
588}

590isl_size isl_union_set_n_set(__isl_keep isl_union_setisl_union_map *uset)
591{
return uset ? uset->table.n : isl_size_error((int) -1);
593}

595isl_stat isl_union_map_foreach_map(__isl_keep isl_union_map *umap,
isl_stat (*fn)(__isl_take isl_map *map, void *user), void *user)
597{
struct isl_union_map_foreach_data data = { fn, user };

if (!umap)
return isl_stat_error;

return isl_hash_table_foreach(umap->dim->ctx, &umap->table,
		      &call_on_copy, &data);
605}

607/* Internal data structure for isl_union_map_every_map.
*
* "test" is the user-specified callback function.
* "user" is the user-specified callback function argument.
*
* "failed" is initialized to 0 and set to 1 if "test" fails
* on any map.
*/
615struct isl_union_map_every_data {
isl_bool (*test)(__isl_keep isl_map *map, void *user);
void *user;
int failed;
619};

621/* Call data->test on "map".
* If this fails, then set data->failed and abort.
*/
624static isl_stat call_every(void **entry, void *user)
625{
isl_map *map = *entry;
struct isl_union_map_every_data *data = user;
isl_bool r;

r = data->test(map, data->user);
if (r < 0)
return isl_stat_error;
if (r)
return isl_stat_ok;
data->failed = 1;
return isl_stat_error;
637}

639/* Does "test" succeed on every map in "umap"?
*/
641isl_bool isl_union_map_every_map(__isl_keep isl_union_map *umap,
isl_bool (*test)(__isl_keep isl_map *map, void *user), void *user)
643{
struct isl_union_map_every_data data = { test, user, 0 };
isl_stat r;

if (!umap)
return isl_bool_error;

r = isl_hash_table_foreach(isl_union_map_get_ctx(umap), &umap->table,
		      &call_every, &data);
if (r >= 0)
return isl_bool_true;
if (data.failed)
return isl_bool_false;
return isl_bool_error;
657}

659/* Add "map" to "list".
*/
661static isl_stat add_list_map(__isl_take isl_map *map, void *user)
662{
isl_map_list **list = user;

*list = isl_map_list_add(*list, map);

if (!*list)
return isl_stat_error;
return isl_stat_ok;
670}

672/* Return the maps in "umap" as a list.
*
* First construct a list of the appropriate size and then add all the
* elements.
*/
677__isl_give isl_map_list *isl_union_map_get_map_list(
__isl_keep isl_union_map *umap)
679{
isl_size n_maps;
isl_ctx *ctx;
isl_map_list *list;

n_maps = isl_union_map_n_map(umap);
if (n_maps < 0)
return NULL((void*)0);
ctx = isl_union_map_get_ctx(umap);
list = isl_map_list_alloc(ctx, n_maps);

if (isl_union_map_foreach_map(umap, &add_list_map, &list) < 0)
list = isl_map_list_free(list);

return list;
694}

696/* Return the sets in "uset" as a list.
*/
698__isl_give isl_set_listisl_map_list *isl_union_set_get_set_list(
__isl_keep isl_union_setisl_union_map *uset)
700{
return set_list_from_map_list(
isl_union_map_get_map_list(uset_to_umap(uset)));
703}

705/* Can "umap" be converted to an isl_map?
* That is, does it contain elements in exactly one space?
*/
708isl_bool isl_union_map_isa_map(__isl_keep isl_union_map *umap)
709{
isl_size n;

n = isl_union_map_n_map(umap);
if (n < 0)
return isl_bool_error;
return isl_bool_ok(n == 1);
716}

718/* Can "uset" be converted to an isl_set?
* That is, does it contain elements in exactly one space?
*/
721isl_bool isl_union_set_isa_set(__isl_keep isl_union_setisl_union_map *uset)
722{
return isl_union_map_isa_map(uset_to_umap(uset));
724}

726static isl_stat copy_map(void **entry, void *user)
727{
isl_map *map = *entry;
isl_map **map_p = user;

*map_p = isl_map_copy(map);

return isl_stat_error;
734}

736__isl_give isl_map *isl_map_from_union_map(__isl_take isl_union_map *umap)
737{
isl_bool is_map;
isl_ctx *ctx;
isl_map *map = NULL((void*)0);

is_map = isl_union_map_isa_map(umap);
if (is_map < 0)
goto error;
ctx = isl_union_map_get_ctx(umap);
if (!is_map)
isl_die(ctx, isl_error_invalid,do { isl_handle_error(ctx, isl_error_invalid, "union map needs to contain elements in exactly "
 "one space", "polly/lib/External/isl/isl_union_map.c", 749);
 goto error; } while (0)
	"union map needs to contain elements in exactly "do { isl_handle_error(ctx, isl_error_invalid, "union map needs to contain elements in exactly "
 "one space", "polly/lib/External/isl/isl_union_map.c", 749);
 goto error; } while (0)
	"one space", goto error)do { isl_handle_error(ctx, isl_error_invalid, "union map needs to contain elements in exactly "
 "one space", "polly/lib/External/isl/isl_union_map.c", 749);
 goto error; } while (0);

isl_hash_table_foreach(ctx, &umap->table, &copy_map, &map);

isl_union_map_free(umap);

return map;
756error:
isl_union_map_free(umap);
return NULL((void*)0);
759}

761/* This function performs the same operation as isl_map_from_union_map,
* but is considered as a function on an isl_union_map when exported.
*/
764__isl_give isl_map *isl_union_map_as_map(__isl_take isl_union_map *umap)
765{
return isl_map_from_union_map(umap);
767}

769__isl_give isl_setisl_map *isl_set_from_union_set(__isl_take isl_union_setisl_union_map *uset)
770{
return isl_map_from_union_map(uset);
772}

774/* This function performs the same operation as isl_set_from_union_set,
* but is considered as a function on an isl_union_set when exported.
*/
777__isl_give isl_setisl_map *isl_union_set_as_set(__isl_take isl_union_setisl_union_map *uset)
778{
return isl_set_from_union_set(uset);
780}

782/* Extract the map in "umap" that lives in the given space (ignoring
* parameters).
*/
785__isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap,
__isl_take isl_space *space)
787{
struct isl_hash_table_entry *entry;

entry = isl_union_map_find_entry(umap, space, 0);
if (!entry)
goto error;
if (entry == isl_hash_table_entry_none)
return isl_map_empty(space);
isl_space_free(space);
return isl_map_copy(entry->data);
797error:
isl_space_free(space);
return NULL((void*)0);
800}

802__isl_give isl_setisl_map *isl_union_set_extract_set(__isl_keep isl_union_setisl_union_map *uset,
__isl_take isl_space *space)
804{
return set_from_map(isl_union_map_extract_map(uset, space));
806}

808/* Check if umap contains a map in the given space (ignoring parameters).
*/
810isl_bool isl_union_map_contains(__isl_keep isl_union_map *umap,
__isl_keep isl_space *space)
812{
struct isl_hash_table_entry *entry;

space = isl_space_drop_all_params(isl_space_copy(space));
space = isl_space_align_params(space, isl_union_map_get_space(umap));
entry = isl_union_map_find_entry(umap, space, 0);
isl_space_free(space);
if (!entry)
return isl_bool_error;
return isl_bool_ok(entry != isl_hash_table_entry_none);
822}

824isl_bool isl_union_set_contains(__isl_keep isl_union_setisl_union_map *uset,
__isl_keep isl_space *space)
826{
return isl_union_map_contains(uset, space);
828}

830isl_stat isl_union_set_foreach_set(__isl_keep isl_union_setisl_union_map *uset,
isl_stat (*fn)(__isl_take isl_setisl_map *set, void *user), void *user)
832{
return isl_union_map_foreach_map(uset,
(isl_stat(*)(__isl_take isl_map *, void*))fn, user);
835}

837/* Internal data structure for isl_union_set_every_set.
*
* "test" is the user-specified callback function.
* "user" is the user-specified callback function argument.
*/
842struct isl_test_set_from_map_data {
isl_bool (*test)(__isl_keep isl_setisl_map *set, void *user);
void *user;
845};

847/* Call data->test on "map", which is part of an isl_union_set and
* therefore known to be an isl_set.
*/
850static isl_bool test_set_from_map(__isl_keep isl_map *map, void *user)
851{
struct isl_test_set_from_map_data *data = user;

return data->test(set_from_map(map), data->user);
855}

857/* Does "test" succeed on every set in "uset"?
*/
859isl_bool isl_union_set_every_set(__isl_keep isl_union_setisl_union_map *uset,
isl_bool (*test)(__isl_keep isl_setisl_map *set, void *user), void *user)
861{
struct isl_test_set_from_map_data data = { test, user };

return isl_union_map_every_map(uset_to_umap(uset),
			&test_set_from_map, &data);
866}

868struct isl_union_set_foreach_point_data {
isl_stat (*fn)(__isl_take isl_point *pnt, void *user);
void *user;
871};

873static isl_stat foreach_point(__isl_take isl_setisl_map *set, void *user)
874{
struct isl_union_set_foreach_point_data *data = user;
isl_stat r;

r = isl_set_foreach_point(set, data->fn, data->user);
isl_set_free(set);

return r;
882}

884isl_stat isl_union_set_foreach_point(__isl_keep isl_union_setisl_union_map *uset,
isl_stat (*fn)(__isl_take isl_point *pnt, void *user), void *user)
886{
struct isl_union_set_foreach_point_data data = { fn, user };
return isl_union_set_foreach_set(uset, &foreach_point, &data);
889}

891/* Data structure that specifies how gen_bin_op should
* construct results from the inputs.
*
* If "subtract" is set, then a map in the first input is copied to the result
* if there is no corresponding map in the second input.
* Otherwise, a map in the first input with no corresponding map
* in the second input is ignored.
* If "filter" is not NULL, then it specifies which maps in the first
* input may have a matching map in the second input.
* In particular, it makes sure that "match_space" can be called
* on the space of the map.
* "match_space" specifies how to transform the space of a map
* in the first input to the space of the corresponding map
* in the second input.
* "fn_map" specifies how the matching maps, one from each input,
* should be combined to form a map in the result.
*/
908struct isl_bin_op_control {
int subtract;
isl_bool (*filter)(__isl_keep isl_map *map);
__isl_give isl_space *(*match_space)(__isl_take isl_space *space);
__isl_give isl_map *(*fn_map)(__isl_take isl_map *map1,
__isl_take isl_map *map2);
914};

916/* Internal data structure for gen_bin_op.
* "control" specifies how the maps in the result should be constructed.
* "umap2" is a pointer to the second argument.
* "res" collects the results.
*/
921struct isl_union_map_gen_bin_data {
struct isl_bin_op_control *control;
isl_union_map *umap2;
isl_union_map *res;
925};

927/* Add a copy of "map" to "res" and return the result.
*/
929static __isl_give isl_union_map *bin_add_map(__isl_take isl_union_map *res,
__isl_keep isl_map *map)
931{
return isl_union_map_add_map(res, isl_map_copy(map));
933}

935/* Combine "map1" and "map2", add the result to "res" and return the result.
* Check whether the result is empty before adding it to "res".
*/
938static __isl_give isl_union_map *bin_add_pair(__isl_take isl_union_map *res,
__isl_keep isl_map *map1, __isl_keep isl_map *map2,
struct isl_union_map_gen_bin_data *data)
941{
isl_bool empty;
isl_map *map;

map = data->control->fn_map(isl_map_copy(map1), isl_map_copy(map2));
empty = isl_map_is_empty(map);
if (empty < 0 || empty) {
isl_map_free(map);
if (empty < 0)
	return isl_union_map_free(res);
return res;
}
return isl_union_map_add_map(res, map);
954}

956/* Dummy match_space function that simply returns the input space.
*/
958static __isl_give isl_space *identity(__isl_take isl_space *space)
959{
return space;
961}

963/* Look for the map in data->umap2 that corresponds to "map", if any.
* Return (isl_bool_true, matching map) if there is one,
* (isl_bool_false, NULL) if there is no matching map and
* (isl_bool_error, NULL) on error.
*
* If not NULL, then data->control->filter specifies whether "map"
* can have any matching map.  If so,
* data->control->match_space specifies which map in data->umap2
* corresponds to "map".
*/
973static __isl_keep isl_maybe_isl_map bin_try_get_match(
struct isl_union_map_gen_bin_data *data, __isl_keep isl_map *map)
975{
struct isl_hash_table_entry *entry2;
isl_space *space;
isl_maybe_isl_map res = { isl_bool_error, NULL((void*)0) };

if (data->control->filter) {
res.valid = data->control->filter(map);
if (res.valid < 0 || !res.valid)
	return res;
res.valid = isl_bool_error;
}

space = isl_map_get_space(map);
if (data->control->match_space != &identity)
space = data->control->match_space(space);
entry2 = isl_union_map_find_entry(data->umap2, space, 0);
isl_space_free(space);
if (entry2)
res.valid = isl_bool_ok(entry2 != isl_hash_table_entry_none);
if (res.valid >= 0 && res.valid)
res.value = entry2->data;

return res;
998}

1000/* isl_hash_table_foreach callback for gen_bin_op.
* Look for the map in data->umap2 that corresponds
* to the map that "entry" points to, apply the binary operation and
* add the result to data->res.
*
* If no corresponding map can be found, then the effect depends
* on data->control->subtract.  If it is set, then the current map
* is added directly to the result.  Otherwise, it is ignored.
*/
1009static isl_stat gen_bin_entry(void **entry, void *user)
1010{
struct isl_union_map_gen_bin_data *data = user;
isl_map *map = *entry;
isl_maybe_isl_map m;

m = bin_try_get_match(data, map);
if (m.valid < 0)
return isl_stat_error;
if (!m.valid && !data->control->subtract)
return isl_stat_ok;

if (!m.valid)
data->res = bin_add_map(data->res, map);
else
data->res = bin_add_pair(data->res, map, m.value, data);
if (!data->res)
return isl_stat_error;

return isl_stat_ok;
1029}

1031/* Apply a binary operation to "umap1" and "umap2" based on "control".
* Run over all maps in "umap1" and look for the corresponding map in "umap2"
* in gen_bin_entry.
*/
1035static __isl_give isl_union_map *gen_bin_op(__isl_take isl_union_map *umap1,
__isl_take isl_union_map *umap2, struct isl_bin_op_control *control)
1037{
struct isl_union_map_gen_bin_data data = { control, NULL((void*)0), NULL((void*)0) };

umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));

if (!umap1 || !umap2)
goto error;

data.umap2 = umap2;
data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
		       umap1->table.n);
if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
		   &gen_bin_entry, &data) < 0)
goto error;

isl_union_map_free(umap1);
isl_union_map_free(umap2);
return data.res;
1056error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
isl_union_map_free(data.res);
return NULL((void*)0);
1061}

1063__isl_give isl_union_map *isl_union_map_subtract(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1065{
struct isl_bin_op_control control = {
.subtract = 1,
.match_space = &identity,
.fn_map = &isl_map_subtract,
};

return gen_bin_op(umap1, umap2, &control);
1073}

1075__isl_give isl_union_setisl_union_map *isl_union_set_subtract(
__isl_take isl_union_setisl_union_map *uset1, __isl_take isl_union_setisl_union_map *uset2)
1077{
return isl_union_map_subtract(uset1, uset2);
1079}

1081struct isl_union_map_gen_bin_set_data {
isl_setisl_map *set;
isl_union_map *res;
1084};

1086static isl_stat intersect_params_entry(void **entry, void *user)
1087{
struct isl_union_map_gen_bin_set_data *data = user;
isl_map *map = *entry;
int empty;

map = isl_map_copy(map);
map = isl_map_intersect_params(map, isl_set_copy(data->set));

empty = isl_map_is_empty(map);
if (empty < 0) {
isl_map_free(map);
return isl_stat_error;
}

data->res = isl_union_map_add_map(data->res, map);

return isl_stat_ok;
1104}

1106static __isl_give isl_union_map *gen_bin_set_op(__isl_take isl_union_map *umap,
__isl_take isl_setisl_map *set, isl_stat (*fn)(void **, void *))
1108{
struct isl_union_map_gen_bin_set_data data = { NULL((void*)0), NULL((void*)0) };

umap = isl_union_map_align_params(umap, isl_set_get_space(set));
set = isl_set_align_params(set, isl_union_map_get_space(umap));

if (!umap || !set)
goto error;

data.set = set;
data.res = isl_union_map_alloc(isl_space_copy(umap->dim),
		       umap->table.n);
if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
		   fn, &data) < 0)
goto error;

isl_union_map_free(umap);
isl_set_free(set);
return data.res;
1127error:
isl_union_map_free(umap);
isl_set_free(set);
isl_union_map_free(data.res);
return NULL((void*)0);
1132}

1134/* Intersect "umap" with the parameter domain "set".
*
* If "set" does not have any constraints, then we can return immediately.
*/
1138__isl_give isl_union_map *isl_union_map_intersect_params(
__isl_take isl_union_map *umap, __isl_take isl_setisl_map *set)
1140{
int is_universe;

is_universe = isl_set_plain_is_universe(set);
if (is_universe < 0)
goto error;
if (is_universe) {
isl_set_free(set);
return umap;
}

return gen_bin_set_op(umap, set, &intersect_params_entry);
1152error:
isl_union_map_free(umap);
isl_set_free(set);
return NULL((void*)0);
1156}

1158__isl_give isl_union_setisl_union_map *isl_union_set_intersect_params(
__isl_take isl_union_setisl_union_map *uset, __isl_take isl_setisl_map *set)
1160{
return isl_union_map_intersect_params(uset, set);
1162}

1164static __isl_give isl_union_map *union_map_intersect_params(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1166{
return isl_union_map_intersect_params(umap,
				isl_set_from_union_set(uset));
1169}

1171static __isl_give isl_union_map *union_map_gist_params(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1173{
return isl_union_map_gist_params(umap, isl_set_from_union_set(uset));
1175}

1177struct isl_union_map_match_bin_data {
isl_union_map *umap2;
isl_union_map *res;
__isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*);
1181};

1183static isl_stat match_bin_entry(void **entry, void *user)
1184{
struct isl_union_map_match_bin_data *data = user;
struct isl_hash_table_entry *entry2;
isl_space *space;
isl_map *map = *entry;
int empty;

space = isl_map_peek_space(map);
entry2 = isl_union_map_find_entry(data->umap2, space, 0);
if (!entry2)
return isl_stat_error;
if (entry2 == isl_hash_table_entry_none)
return isl_stat_ok;

map = isl_map_copy(map);
map = data->fn(map, isl_map_copy(entry2->data));

empty = isl_map_is_empty(map);
if (empty < 0) {
isl_map_free(map);
return isl_stat_error;
}
if (empty) {
isl_map_free(map);
return isl_stat_ok;
}

data->res = isl_union_map_add_map(data->res, map);

return isl_stat_ok;
1214}

1216static __isl_give isl_union_map *match_bin_op(__isl_take isl_union_map *umap1,
__isl_take isl_union_map *umap2,
__isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*))
1219{
struct isl_union_map_match_bin_data data = { NULL((void*)0), NULL((void*)0), fn };

umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));

if (!umap1 || !umap2)
goto error;

data.umap2 = umap2;
data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
		       umap1->table.n);
if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
		   &match_bin_entry, &data) < 0)
goto error;

isl_union_map_free(umap1);
isl_union_map_free(umap2);
return data.res;
1238error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
isl_union_map_free(data.res);
return NULL((void*)0);
1243}

1245__isl_give isl_union_map *isl_union_map_intersect(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1247{
return match_bin_op(umap1, umap2, &isl_map_intersect);
1249}

1251/* Compute the intersection of the two union_sets.
* As a special case, if exactly one of the two union_sets
* is a parameter domain, then intersect the parameter domain
* of the other one with this set.
*/
1256__isl_give isl_union_setisl_union_map *isl_union_set_intersect(
__isl_take isl_union_setisl_union_map *uset1, __isl_take isl_union_setisl_union_map *uset2)
1258{
int p1, p2;

p1 = isl_union_set_is_params(uset1);
p2 = isl_union_set_is_params(uset2);
if (p1 < 0 || p2 < 0)
goto error;
if (!p1 && p2)
return union_map_intersect_params(uset1, uset2);
if (p1 && !p2)
return union_map_intersect_params(uset2, uset1);
return isl_union_map_intersect(uset1, uset2);
1270error:
isl_union_set_free(uset1);
isl_union_set_free(uset2);
return NULL((void*)0);
1274}

1276static isl_stat gist_params_entry(void **entry, void *user)
1277{
struct isl_union_map_gen_bin_set_data *data = user;
isl_map *map = *entry;
int empty;

map = isl_map_copy(map);
map = isl_map_gist_params(map, isl_set_copy(data->set));

empty = isl_map_is_empty(map);
if (empty < 0) {
isl_map_free(map);
return isl_stat_error;
}

data->res = isl_union_map_add_map(data->res, map);

return isl_stat_ok;
1294}

1296__isl_give isl_union_map *isl_union_map_gist_params(
__isl_take isl_union_map *umap, __isl_take isl_setisl_map *set)
1298{
return gen_bin_set_op(umap, set, &gist_params_entry);
1300}

1302__isl_give isl_union_setisl_union_map *isl_union_set_gist_params(
__isl_take isl_union_setisl_union_map *uset, __isl_take isl_setisl_map *set)
1304{
return isl_union_map_gist_params(uset, set);
1306}

1308__isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap,
__isl_take isl_union_map *context)
1310{
return match_bin_op(umap, context, &isl_map_gist);
1312}

1314__isl_give isl_union_setisl_union_map *isl_union_set_gist(__isl_take isl_union_setisl_union_map *uset,
__isl_take isl_union_setisl_union_map *context)
1316{
if (isl_union_set_is_params(context))
return union_map_gist_params(uset, context);
return isl_union_map_gist(uset, context);
1320}

1322/* For each map in "umap", remove the constraints in the corresponding map
* of "context".
* Each map in "context" is assumed to consist of a single disjunct and
* to have explicit representations for all local variables.
*/
1327__isl_give isl_union_map *isl_union_map_plain_gist(
__isl_take isl_union_map *umap, __isl_take isl_union_map *context)
1329{
return match_bin_op(umap, context, &isl_map_plain_gist);
1331}

1333/* For each set in "uset", remove the constraints in the corresponding set
* of "context".
* Each set in "context" is assumed to consist of a single disjunct and
* to have explicit representations for all local variables.
*/
1338__isl_give isl_union_setisl_union_map *isl_union_set_plain_gist(
__isl_take isl_union_setisl_union_map *uset, __isl_take isl_union_setisl_union_map *context)
1340{
return isl_union_map_plain_gist(uset, context);
1342}

1344static __isl_give isl_map *lex_le_set(__isl_take isl_map *set1,
__isl_take isl_map *set2)
1346{
return isl_set_lex_le_set(set_from_map(set1), set_from_map(set2));
1348}

1350static __isl_give isl_map *lex_lt_set(__isl_take isl_map *set1,
__isl_take isl_map *set2)
1352{
return isl_set_lex_lt_set(set_from_map(set1), set_from_map(set2));
1354}

1356__isl_give isl_union_map *isl_union_set_lex_lt_union_set(
__isl_take isl_union_setisl_union_map *uset1, __isl_take isl_union_setisl_union_map *uset2)
1358{
return match_bin_op(uset1, uset2, &lex_lt_set);
1360}

1362__isl_give isl_union_map *isl_union_set_lex_le_union_set(
__isl_take isl_union_setisl_union_map *uset1, __isl_take isl_union_setisl_union_map *uset2)
1364{
return match_bin_op(uset1, uset2, &lex_le_set);
1366}

1368__isl_give isl_union_map *isl_union_set_lex_gt_union_set(
__isl_take isl_union_setisl_union_map *uset1, __isl_take isl_union_setisl_union_map *uset2)
1370{
return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2, uset1));
1372}

1374__isl_give isl_union_map *isl_union_set_lex_ge_union_set(
__isl_take isl_union_setisl_union_map *uset1, __isl_take isl_union_setisl_union_map *uset2)
1376{
return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2, uset1));
1378}

1380__isl_give isl_union_map *isl_union_map_lex_gt_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1382{
return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2, umap1));
1384}

1386__isl_give isl_union_map *isl_union_map_lex_ge_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1388{
return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2, umap1));
1390}

1392/* Intersect the domain of "umap" with "uset".
*/
1394static __isl_give isl_union_map *union_map_intersect_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1396{
struct isl_bin_op_control control = {
.match_space = &isl_space_domain,
.fn_map = &isl_map_intersect_domain,
};

return gen_bin_op(umap, uset, &control);
1403}

1405/* Intersect the domain of "umap" with "uset".
* If "uset" is a parameters domain, then intersect the parameter
* domain of "umap" with this set.
*/
1409__isl_give isl_union_map *isl_union_map_intersect_domain_union_set(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1411{
if (isl_union_set_is_params(uset))
return union_map_intersect_params(umap, uset);
else
return union_map_intersect_domain(umap, uset);
1416}

1418/* This is an alternative name for the function above.
*/
1420__isl_give isl_union_map *isl_union_map_intersect_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1422{
return isl_union_map_intersect_domain_union_set(umap, uset);
1424}

1426/* Remove the elements of "uset" from the domain of "umap".
*/
1428__isl_give isl_union_map *isl_union_map_subtract_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *dom)
1430{
struct isl_bin_op_control control = {
.subtract = 1,
.match_space = &isl_space_domain,
.fn_map = &isl_map_subtract_domain,
};

return gen_bin_op(umap, dom, &control);
1438}

1440/* Remove the elements of "uset" from the range of "umap".
*/
1442__isl_give isl_union_map *isl_union_map_subtract_range(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *dom)
1444{
struct isl_bin_op_control control = {
.subtract = 1,
.match_space = &isl_space_range,
.fn_map = &isl_map_subtract_range,
};

return gen_bin_op(umap, dom, &control);
1452}

1454/* Compute the gist of "umap" with respect to the domain "uset".
*/
1456static __isl_give isl_union_map *union_map_gist_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1458{
struct isl_bin_op_control control = {
.match_space = &isl_space_domain,
.fn_map = &isl_map_gist_domain,
};

return gen_bin_op(umap, uset, &control);
1465}

1467/* Compute the gist of "umap" with respect to the domain "uset".
* If "uset" is a parameters domain, then compute the gist
* with respect to this parameter domain.
*/
1471__isl_give isl_union_map *isl_union_map_gist_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1473{
if (isl_union_set_is_params(uset))
return union_map_gist_params(umap, uset);
else
return union_map_gist_domain(umap, uset);
1478}

1480/* Compute the gist of "umap" with respect to the range "uset".
*/
1482__isl_give isl_union_map *isl_union_map_gist_range(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1484{
struct isl_bin_op_control control = {
.match_space = &isl_space_range,
.fn_map = &isl_map_gist_range,
};

return gen_bin_op(umap, uset, &control);
1491}

1493__isl_give isl_union_map *isl_union_map_intersect_range_union_set(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1495{
struct isl_bin_op_control control = {
.match_space = &isl_space_range,
.fn_map = &isl_map_intersect_range,
};

return gen_bin_op(umap, uset, &control);
1502}

1504/* This is an alternative name for the function above.
*/
1506__isl_give isl_union_map *isl_union_map_intersect_range(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1508{
return isl_union_map_intersect_range_union_set(umap, uset);
1510}

1512/* Intersect each map in "umap" in a space [A -> B] -> C
* with the corresponding map in "factor" in the space A -> C and
* collect the results.
*/
1516__isl_give isl_union_map *isl_union_map_intersect_domain_factor_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_map *factor)
1518{
struct isl_bin_op_control control = {
.filter = &isl_map_domain_is_wrapping,
.match_space = &isl_space_domain_factor_domain,
.fn_map = &isl_map_intersect_domain_factor_domain,
};

return gen_bin_op(umap, factor, &control);
1526}

1528/* Intersect each map in "umap" in a space [A -> B] -> C
* with the corresponding map in "factor" in the space B -> C and
* collect the results.
*/
1532__isl_give isl_union_map *isl_union_map_intersect_domain_factor_range(
__isl_take isl_union_map *umap, __isl_take isl_union_map *factor)
1534{
struct isl_bin_op_control control = {
.filter = &isl_map_domain_is_wrapping,
.match_space = &isl_space_domain_factor_range,
.fn_map = &isl_map_intersect_domain_factor_range,
};

return gen_bin_op(umap, factor, &control);
1542}

1544/* Intersect each map in "umap" in a space A -> [B -> C]
* with the corresponding map in "factor" in the space A -> B and
* collect the results.
*/
1548__isl_give isl_union_map *isl_union_map_intersect_range_factor_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_map *factor)
1550{
struct isl_bin_op_control control = {
.filter = &isl_map_range_is_wrapping,
.match_space = &isl_space_range_factor_domain,
.fn_map = &isl_map_intersect_range_factor_domain,
};

return gen_bin_op(umap, factor, &control);
1558}

1560/* Intersect each map in "umap" in a space A -> [B -> C]
* with the corresponding map in "factor" in the space A -> C and
* collect the results.
*/
1564__isl_give isl_union_map *isl_union_map_intersect_range_factor_range(
__isl_take isl_union_map *umap, __isl_take isl_union_map *factor)
1566{
struct isl_bin_op_control control = {
.filter = &isl_map_range_is_wrapping,
.match_space = &isl_space_range_factor_range,
.fn_map = &isl_map_intersect_range_factor_range,
};

return gen_bin_op(umap, factor, &control);
1574}

1576struct isl_union_map_bin_data {
isl_union_map *umap2;
isl_union_map *res;
isl_map *map;
isl_stat (*fn)(void **entry, void *user);
1581};

1583static isl_stat apply_range_entry(void **entry, void *user)
1584{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;
isl_bool empty, match;

match = isl_map_tuple_is_equal(data->map, isl_dim_out,
		map2, isl_dim_in);
if (match < 0)
return isl_stat_error;
if (!match)
return isl_stat_ok;

map2 = isl_map_apply_range(isl_map_copy(data->map), isl_map_copy(map2));

empty = isl_map_is_empty(map2);
if (empty < 0) {
isl_map_free(map2);
return isl_stat_error;
}
if (empty) {
isl_map_free(map2);
return isl_stat_ok;
}

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1611}

1613static isl_stat bin_entry(void **entry, void *user)
1614{
struct isl_union_map_bin_data *data = user;
isl_map *map = *entry;

data->map = map;
if (isl_hash_table_foreach(data->umap2->dim->ctx, &data->umap2->table,
		   data->fn, data) < 0)
return isl_stat_error;

return isl_stat_ok;
1624}

1626static __isl_give isl_union_map *bin_op(__isl_take isl_union_map *umap1,
__isl_take isl_union_map *umap2,
isl_stat (*fn)(void **entry, void *user))
1629{
struct isl_union_map_bin_data data = { NULL((void*)0), NULL((void*)0), NULL((void*)0), fn };

umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));

if (!umap1 || !umap2)
goto error;

data.umap2 = umap2;
data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
		       umap1->table.n);
if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
		   &bin_entry, &data) < 0)
goto error;

isl_union_map_free(umap1);
isl_union_map_free(umap2);
return data.res;
1648error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
isl_union_map_free(data.res);
return NULL((void*)0);
1653}

1655/* Intersect each map in "umap" in a space [A -> B] -> C
* with the corresponding set in "domain" in the space A and
* collect the results.
*/
1659__isl_give isl_union_map *
1660isl_union_map_intersect_domain_wrapped_domain_union_set(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *domain)
1662{
struct isl_bin_op_control control = {
.filter = &isl_map_domain_is_wrapping,
.match_space = &isl_space_domain_wrapped_domain,
.fn_map = &isl_map_intersect_domain_wrapped_domain,
};

return gen_bin_op(umap, domain, &control);
1670}

1672/* Intersect each map in "umap" in a space A -> [B -> C]
* with the corresponding set in "domain" in the space B and
* collect the results.
*/
1676__isl_give isl_union_map *
1677isl_union_map_intersect_range_wrapped_domain_union_set(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *domain)
1679{
struct isl_bin_op_control control = {
.filter = &isl_map_range_is_wrapping,
.match_space = &isl_space_range_wrapped_domain,
.fn_map = &isl_map_intersect_range_wrapped_domain,
};

return gen_bin_op(umap, domain, &control);
1687}

1689__isl_give isl_union_map *isl_union_map_apply_range(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1691{
return bin_op(umap1, umap2, &apply_range_entry);
1693}

1695__isl_give isl_union_map *isl_union_map_apply_domain(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1697{
umap1 = isl_union_map_reverse(umap1);
umap1 = isl_union_map_apply_range(umap1, umap2);
return isl_union_map_reverse(umap1);
1701}

1703__isl_give isl_union_setisl_union_map *isl_union_set_apply(
__isl_take isl_union_setisl_union_map *uset, __isl_take isl_union_map *umap)
1705{
return isl_union_map_apply_range(uset, umap);
1707}

1709static isl_stat map_lex_lt_entry(void **entry, void *user)
1710{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;
isl_bool match;

match = isl_map_tuple_is_equal(data->map, isl_dim_out,
		 map2, isl_dim_out);
if (match < 0)
return isl_stat_error;
if (!match)
return isl_stat_ok;

map2 = isl_map_lex_lt_map(isl_map_copy(data->map), isl_map_copy(map2));

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1727}

1729__isl_give isl_union_map *isl_union_map_lex_lt_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1731{
return bin_op(umap1, umap2, &map_lex_lt_entry);
1733}

1735static isl_stat map_lex_le_entry(void **entry, void *user)
1736{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;
isl_bool match;

match = isl_map_tuple_is_equal(data->map, isl_dim_out,
		 map2, isl_dim_out);
if (match < 0)
return isl_stat_error;
if (!match)
return isl_stat_ok;

map2 = isl_map_lex_le_map(isl_map_copy(data->map), isl_map_copy(map2));

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1753}

1755__isl_give isl_union_map *isl_union_map_lex_le_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1757{
return bin_op(umap1, umap2, &map_lex_le_entry);
1759}

1761static isl_stat product_entry(void **entry, void *user)
1762{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;

map2 = isl_map_product(isl_map_copy(data->map), isl_map_copy(map2));

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1771}

1773__isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1,
__isl_take isl_union_map *umap2)
1775{
return bin_op(umap1, umap2, &product_entry);
1777}

1779static isl_stat set_product_entry(void **entry, void *user)
1780{
struct isl_union_map_bin_data *data = user;
isl_setisl_map *set2 = *entry;

set2 = isl_set_product(isl_set_copy(data->map), isl_set_copy(set2));

data->res = isl_union_set_add_set(data->res, set2);

return isl_stat_ok;
1789}

1791__isl_give isl_union_setisl_union_map *isl_union_set_product(__isl_take isl_union_setisl_union_map *uset1,
__isl_take isl_union_setisl_union_map *uset2)
1793{
return bin_op(uset1, uset2, &set_product_entry);
1795}

1797static isl_stat domain_product_entry(void **entry, void *user)
1798{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;
isl_bool match;

match = isl_map_tuple_is_equal(data->map, isl_dim_out,
		 map2, isl_dim_out);
if (match < 0)
return isl_stat_error;
if (!match)
return isl_stat_ok;

map2 = isl_map_domain_product(isl_map_copy(data->map),
		     isl_map_copy(map2));

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1816}

1818/* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
*/
1820__isl_give isl_union_map *isl_union_map_domain_product(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1822{
return bin_op(umap1, umap2, &domain_product_entry);
1824}

1826static isl_stat range_product_entry(void **entry, void *user)
1827{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;
isl_bool match;

match = isl_map_tuple_is_equal(data->map, isl_dim_in, map2, isl_dim_in);
if (match < 0)
return isl_stat_error;
if (!match)
return isl_stat_ok;

map2 = isl_map_range_product(isl_map_copy(data->map),
		     isl_map_copy(map2));

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1844}

1846__isl_give isl_union_map *isl_union_map_range_product(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1848{
return bin_op(umap1, umap2, &range_product_entry);
1850}

1852/* If data->map A -> B and "map2" C -> D have the same range space,
* then add (A, C) -> (B * D) to data->res.
*/
1855static isl_stat flat_domain_product_entry(void **entry, void *user)
1856{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;
isl_bool match;

match = isl_map_tuple_is_equal(data->map, isl_dim_out,
		 map2, isl_dim_out);
if (match < 0)
return isl_stat_error;
if (!match)
return isl_stat_ok;

map2 = isl_map_flat_domain_product(isl_map_copy(data->map),
			  isl_map_copy(map2));

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1874}

1876/* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D).
*/
1878__isl_give isl_union_map *isl_union_map_flat_domain_product(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1880{
return bin_op(umap1, umap2, &flat_domain_product_entry);
1882}

1884static isl_stat flat_range_product_entry(void **entry, void *user)
1885{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;
isl_bool match;

match = isl_map_tuple_is_equal(data->map, isl_dim_in, map2, isl_dim_in);
if (match < 0)
return isl_stat_error;
if (!match)
return isl_stat_ok;

map2 = isl_map_flat_range_product(isl_map_copy(data->map),
			  isl_map_copy(map2));

data->res = isl_union_map_add_map(data->res, map2);

return isl_stat_ok;
1902}

1904__isl_give isl_union_map *isl_union_map_flat_range_product(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1906{
return bin_op(umap1, umap2, &flat_range_product_entry);
1908}

1910/* Data structure that specifies how un_op should modify
* the maps in the union map.
*
* If "inplace" is set, then the maps in the input union map
* are modified in place.  This means that "fn_map" should not
* change the meaning of the map or that the union map only
* has a single reference.
* If "total" is set, then all maps need to be modified and
* the results need to live in the same space.
* Otherwise, a new union map is constructed to store the results.
* If "filter" is not NULL, then only the input maps that satisfy "filter"
* are taken into account.  "filter_user" is passed as the second argument
* to "filter".  No filter can be set if "inplace" or
* "total" is set.
* At most one of "fn_map" or "fn_map2" can be set, specifying
* how the maps (selected by "filter") should be transformed.
* If "fn_map2" is set, then "fn_map2_user" is passed as the second argument.
*/
1928struct isl_un_op_control {
int inplace;
int total;
isl_bool (*filter)(__isl_keep isl_map *map, void *user);
void *filter_user;
__isl_give isl_map *(*fn_map)(__isl_take isl_map *map);
__isl_give isl_map *(*fn_map2)(__isl_take isl_map *map, void *user);
void *fn_map2_user;
1936};

1938/* Data structure for wrapping the data for un_op_filter_drop_user.
* "filter" is the function that is being wrapped.
*/
1941struct isl_un_op_drop_user_data {
isl_bool (*filter)(__isl_keep isl_map *map);
1943};

1945/* Wrapper for isl_un_op_control filters that do not require
* a second argument.
* Simply call data->filter without the second argument.
*/
1949static isl_bool un_op_filter_drop_user(__isl_keep isl_map *map, void *user)
1950{
struct isl_un_op_drop_user_data *data = user;
return data->filter(map);
1953}

1955/* Internal data structure for "un_op".
* "control" specifies how the maps in the union map should be modified.
* "res" collects the results.
*/
1959struct isl_union_map_un_data {
struct isl_un_op_control *control;
isl_union_map *res;
1962};

1964/* isl_hash_table_foreach callback for un_op.
* Handle the map that "entry" points to.
*
* If control->filter is set, then check if this map satisfies the filter.
* If so (or if control->filter is not set), modify the map
* by calling control->fn_map or control->fn_map2 (if set) and
* either add the result to data->res or
* replace the original entry by the result (if control->inplace is set).
*/
1973static isl_stat un_entry(void **entry, void *user)
1974{
struct isl_union_map_un_data *data = user;
struct isl_un_op_control *control = data->control;
isl_map *map = *entry;

if (control->filter) {
isl_bool ok;

ok = control->filter(map, control->filter_user);
if (ok < 0)
	return isl_stat_error;
if (!ok)
	return isl_stat_ok;
}

map = isl_map_copy(map);
if (control->fn_map2 != NULL((void*)0))
map = control->fn_map2(map, control->fn_map2_user);
else if (control->fn_map != NULL((void*)0))
map = control->fn_map(map);
if (!map)
return isl_stat_error;
if (control->inplace) {
isl_map_free(*entry);
*entry = map;
} else {
data->res = isl_union_map_add_map(data->res, map);
if (!data->res)
	return isl_stat_error;
}

return isl_stat_ok;
2006}

2008/* Modify the maps in "umap" based on "control".
* If control->inplace is set, then modify the maps in "umap" in-place.
* Otherwise, create a new union map to hold the results.
* If control->total is set, then perform an inplace computation
* if "umap" is only referenced once.  Otherwise, create a new union map
* to store the results.
*/
2015static __isl_give isl_union_map *un_op(__isl_take isl_union_map *umap,
struct isl_un_op_control *control)
2017{
struct isl_union_map_un_data data = { control };

if (!umap)
return NULL((void*)0);
if (!!control->fn_map && !!control->fn_map2)
isl_die(isl_union_map_get_ctx(umap), isl_error_internal,do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_internal
, "at most one mapping function can be specified", "polly/lib/External/isl/isl_union_map.c"
, 2025); return isl_union_map_free(umap); } while (0)
	"at most one mapping function can be specified",do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_internal
, "at most one mapping function can be specified", "polly/lib/External/isl/isl_union_map.c"
, 2025); return isl_union_map_free(umap); } while (0)
	return isl_union_map_free(umap))do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_internal
, "at most one mapping function can be specified", "polly/lib/External/isl/isl_union_map.c"
, 2025); return isl_union_map_free(umap); } while (0);
if ((control->inplace || control->total) && control->filter)
isl_die(isl_union_map_get_ctx(umap), isl_error_invalid,do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "inplace/total modification cannot be filtered", "polly/lib/External/isl/isl_union_map.c"
, 2029); return isl_union_map_free(umap); } while (0)
	"inplace/total modification cannot be filtered",do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "inplace/total modification cannot be filtered", "polly/lib/External/isl/isl_union_map.c"
, 2029); return isl_union_map_free(umap); } while (0)
	return isl_union_map_free(umap))do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "inplace/total modification cannot be filtered", "polly/lib/External/isl/isl_union_map.c"
, 2029); return isl_union_map_free(umap); } while (0);

if (control->total && umap->ref == 1)
control->inplace = 1;
if (control->inplace) {
data.res = umap;
} else {
isl_space *space;

space = isl_union_map_get_space(umap);
data.res = isl_union_map_alloc(space, umap->table.n);
}
if (isl_hash_table_foreach(isl_union_map_get_ctx(umap),
		    &umap->table, &un_entry, &data) < 0)
data.res = isl_union_map_free(data.res);

if (control->inplace)
return data.res;
isl_union_map_free(umap);
return data.res;
2049}

2051__isl_give isl_union_map *isl_union_map_from_range(
__isl_take isl_union_setisl_union_map *uset)
2053{
struct isl_un_op_control control = {
.fn_map = &isl_map_from_range,
};
return un_op(uset, &control);
2058}

2060__isl_give isl_union_map *isl_union_map_from_domain(
__isl_take isl_union_setisl_union_map *uset)
2062{
return isl_union_map_reverse(isl_union_map_from_range(uset));
2064}

2066__isl_give isl_union_map *isl_union_map_from_domain_and_range(
__isl_take isl_union_setisl_union_map *domain, __isl_take isl_union_setisl_union_map *range)
2068{
return isl_union_map_apply_range(isl_union_map_from_domain(domain),
		         isl_union_map_from_range(range));
2071}

2073/* Modify the maps in "umap" by applying "fn" on them.
* "fn" should apply to all maps in "umap" and should not modify the space.
*/
2076static __isl_give isl_union_map *total(__isl_take isl_union_map *umap,
__isl_give isl_map *(*fn)(__isl_take isl_map *))
2078{
struct isl_un_op_control control = {
.total = 1,
.fn_map = fn,
};

return un_op(umap, &control);
2085}

2087/* Compute the affine hull of "map" and return the result as an isl_map.
*/
2089static __isl_give isl_map *isl_map_affine_hull_map(__isl_take isl_map *map)
2090{
return isl_map_from_basic_map(isl_map_affine_hull(map));
2092}

2094__isl_give isl_union_map *isl_union_map_affine_hull(
__isl_take isl_union_map *umap)
2096{
return total(umap, &isl_map_affine_hull_map);
2098}

2100__isl_give isl_union_setisl_union_map *isl_union_set_affine_hull(
__isl_take isl_union_setisl_union_map *uset)
2102{
return isl_union_map_affine_hull(uset);
2104}

2106/* Wrapper around isl_set_combined_lineality_space
* that returns the combined lineality space in the form of an isl_set
* instead of an isl_basic_set.
*/
2110static __isl_give isl_setisl_map *combined_lineality_space(__isl_take isl_setisl_map *set)
2111{
return isl_set_from_basic_set(isl_set_combined_lineality_space(set));
2113}

2115/* For each set in "uset", compute the (linear) hull
* of the lineality spaces of its basic sets and
* collect and return the results.
*/
2119__isl_give isl_union_setisl_union_map *isl_union_set_combined_lineality_space(
__isl_take isl_union_setisl_union_map *uset)
2121{
struct isl_un_op_control control = {
.fn_map = &combined_lineality_space,
};
return un_op(uset, &control);
2126}

2128/* Compute the polyhedral hull of "map" and return the result as an isl_map.
*/
2130static __isl_give isl_map *isl_map_polyhedral_hull_map(__isl_take isl_map *map)
2131{
return isl_map_from_basic_map(isl_map_polyhedral_hull(map));
2133}

2135__isl_give isl_union_map *isl_union_map_polyhedral_hull(
__isl_take isl_union_map *umap)
2137{
return total(umap, &isl_map_polyhedral_hull_map);
2139}

2141__isl_give isl_union_setisl_union_map *isl_union_set_polyhedral_hull(
__isl_take isl_union_setisl_union_map *uset)
2143{
return isl_union_map_polyhedral_hull(uset);
2145}

2147/* Compute a superset of the convex hull of "map" that is described
* by only translates of the constraints in the constituents of "map" and
* return the result as an isl_map.
*/
2151static __isl_give isl_map *isl_map_simple_hull_map(__isl_take isl_map *map)
2152{
return isl_map_from_basic_map(isl_map_simple_hull(map));
2154}

2156__isl_give isl_union_map *isl_union_map_simple_hull(
__isl_take isl_union_map *umap)
2158{
return total(umap, &isl_map_simple_hull_map);
2160}

2162__isl_give isl_union_setisl_union_map *isl_union_set_simple_hull(
__isl_take isl_union_setisl_union_map *uset)
2164{
return isl_union_map_simple_hull(uset);
2166}

2168static __isl_give isl_union_map *inplace(__isl_take isl_union_map *umap,
__isl_give isl_map *(*fn)(__isl_take isl_map *))
2170{
struct isl_un_op_control control = {
.inplace = 1,
.fn_map = fn,
};

return un_op(umap, &control);
2177}

2179/* Remove redundant constraints in each of the basic maps of "umap".
* Since removing redundant constraints does not change the meaning
* or the space, the operation can be performed in-place.
*/
2183__isl_give isl_union_map *isl_union_map_remove_redundancies(
__isl_take isl_union_map *umap)
2185{
return inplace(umap, &isl_map_remove_redundancies);
2187}

2189/* Remove redundant constraints in each of the basic sets of "uset".
*/
2191__isl_give isl_union_setisl_union_map *isl_union_set_remove_redundancies(
__isl_take isl_union_setisl_union_map *uset)
2193{
return isl_union_map_remove_redundancies(uset);
2195}

2197__isl_give isl_union_map *isl_union_map_coalesce(
__isl_take isl_union_map *umap)
2199{
return inplace(umap, &isl_map_coalesce);
2201}

2203__isl_give isl_union_setisl_union_map *isl_union_set_coalesce(
__isl_take isl_union_setisl_union_map *uset)
2205{
return isl_union_map_coalesce(uset);
2207}

2209__isl_give isl_union_map *isl_union_map_detect_equalities(
__isl_take isl_union_map *umap)
2211{
return inplace(umap, &isl_map_detect_equalities);
2213}

2215__isl_give isl_union_setisl_union_map *isl_union_set_detect_equalities(
__isl_take isl_union_setisl_union_map *uset)
2217{
return isl_union_map_detect_equalities(uset);
2219}

2221__isl_give isl_union_map *isl_union_map_compute_divs(
__isl_take isl_union_map *umap)
2223{
return inplace(umap, &isl_map_compute_divs);
2225}

2227__isl_give isl_union_setisl_union_map *isl_union_set_compute_divs(
__isl_take isl_union_setisl_union_map *uset)
2229{
return isl_union_map_compute_divs(uset);
2231}

2233__isl_give isl_union_map *isl_union_map_lexmin(
__isl_take isl_union_map *umap)
2235{
return total(umap, &isl_map_lexmin);
2237}

2239__isl_give isl_union_setisl_union_map *isl_union_set_lexmin(
__isl_take isl_union_setisl_union_map *uset)
2241{
return isl_union_map_lexmin(uset);
2243}

2245__isl_give isl_union_map *isl_union_map_lexmax(
__isl_take isl_union_map *umap)
2247{
return total(umap, &isl_map_lexmax);
2249}

2251__isl_give isl_union_setisl_union_map *isl_union_set_lexmax(
__isl_take isl_union_setisl_union_map *uset)
2253{
return isl_union_map_lexmax(uset);
2255}

2257/* Return the universe in the space of "map".
*/
2259static __isl_give isl_map *universe(__isl_take isl_map *map)
2260{
isl_space *space;

space = isl_map_get_space(map);
isl_map_free(map);
return isl_map_universe(space);
2266}

2268__isl_give isl_union_map *isl_union_map_universe(__isl_take isl_union_map *umap)
2269{
struct isl_un_op_control control = {
.fn_map = &universe,
};
return un_op(umap, &control);
2274}

2276__isl_give isl_union_setisl_union_map *isl_union_set_universe(__isl_take isl_union_setisl_union_map *uset)
2277{
return isl_union_map_universe(uset);
2279}

2281__isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap)
2282{
struct isl_un_op_control control = {
.fn_map = &isl_map_reverse,
};
return un_op(umap, &control);
2287}

2289/* Given a union map, take the maps of the form A -> (B -> C) and
* return the union of the corresponding maps A -> (C -> B).
*/
2292__isl_give isl_union_map *isl_union_map_range_reverse(
__isl_take isl_union_map *umap)
2294{
struct isl_un_op_drop_user_data data = { &isl_map_range_is_wrapping };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_range_reverse,
};
return un_op(umap, &control);
2302}

2304/* Compute the parameter domain of the given union map.
*/
2306__isl_give isl_setisl_map *isl_union_map_params(__isl_take isl_union_map *umap)
2307{
struct isl_un_op_control control = {
.fn_map = &isl_map_params,
};
int empty;

empty = isl_union_map_is_empty(umap);
if (empty < 0)
goto error;
if (empty) {
isl_space *space;
space = isl_union_map_get_space(umap);
isl_union_map_free(umap);
return isl_set_empty(space);
}
return isl_set_from_union_set(un_op(umap, &control));
2323error:
isl_union_map_free(umap);
return NULL((void*)0);
2326}

2328/* Compute the parameter domain of the given union set.
*/
2330__isl_give isl_setisl_map *isl_union_set_params(__isl_take isl_union_setisl_union_map *uset)
2331{
return isl_union_map_params(uset);
2333}

2335__isl_give isl_union_setisl_union_map *isl_union_map_domain(__isl_take isl_union_map *umap)
2336{
struct isl_un_op_control control = {
.fn_map = &isl_map_domain,
};
return un_op(umap, &control);
2341}

2343__isl_give isl_union_setisl_union_map *isl_union_map_range(__isl_take isl_union_map *umap)
2344{
struct isl_un_op_control control = {
.fn_map = &isl_map_range,
};
return un_op(umap, &control);
2349}

2351__isl_give isl_union_map *isl_union_map_domain_map(
__isl_take isl_union_map *umap)
2353{
struct isl_un_op_control control = {
.fn_map = &isl_map_domain_map,
};
return un_op(umap, &control);
2358}

2360/* Construct an isl_pw_multi_aff that maps "map" to its domain and
* add the result to "res".
*/
2363static isl_stat domain_map_upma(__isl_take isl_map *map, void *user)
2364{
isl_union_pw_multi_aff **res = user;
isl_multi_aff *ma;
isl_pw_multi_aff *pma;

ma = isl_multi_aff_domain_map(isl_map_get_space(map));
pma = isl_pw_multi_aff_alloc(isl_map_wrap(map), ma);
*res = isl_union_pw_multi_aff_add_pw_multi_aff(*res, pma);

return *res ? isl_stat_ok : isl_stat_error;

2375}

2377/* Return an isl_union_pw_multi_aff that maps a wrapped copy of "umap"
* to its domain.
*/
2380__isl_give isl_union_pw_multi_aff *isl_union_map_domain_map_union_pw_multi_aff(
__isl_take isl_union_map *umap)
2382{
isl_union_pw_multi_aff *res;

res = isl_union_pw_multi_aff_empty(isl_union_map_get_space(umap));
if (isl_union_map_foreach_map(umap, &domain_map_upma, &res) < 0)
res = isl_union_pw_multi_aff_free(res);

isl_union_map_free(umap);
return res;
2391}

2393__isl_give isl_union_map *isl_union_map_range_map(
__isl_take isl_union_map *umap)
2395{
struct isl_un_op_control control = {
.fn_map = &isl_map_range_map,
};
return un_op(umap, &control);
2400}

2402/* Given a collection of wrapped maps of the form A[B -> C],
* return the collection of maps A[B -> C] -> B.
*/
2405__isl_give isl_union_map *isl_union_set_wrapped_domain_map(
__isl_take isl_union_setisl_union_map *uset)
2407{
struct isl_un_op_drop_user_data data = { &isl_set_is_wrapping };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_set_wrapped_domain_map,
};
return un_op(uset, &control);
2415}

2417/* Does "map" relate elements from the same space?
*/
2419static isl_bool equal_tuples(__isl_keep isl_map *map, void *user)
2420{
return isl_map_tuple_is_equal(map, isl_dim_in, map, isl_dim_out);
2422}

2424__isl_give isl_union_setisl_union_map *isl_union_map_deltas(__isl_take isl_union_map *umap)
2425{
struct isl_un_op_control control = {
.filter = &equal_tuples,
.fn_map = &isl_map_deltas,
};
return un_op(umap, &control);
2431}

2433__isl_give isl_union_map *isl_union_map_deltas_map(
__isl_take isl_union_map *umap)
2435{
struct isl_un_op_control control = {
.filter = &equal_tuples,
.fn_map = &isl_map_deltas_map,
};
return un_op(umap, &control);
2441}

2443__isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_setisl_union_map *uset)
2444{
struct isl_un_op_control control = {
.fn_map = &isl_set_identity,
};
return un_op(uset, &control);
2449}

2451/* Construct an identity isl_pw_multi_aff on "set" and add it to *res.
*/
2453static isl_stat identity_upma(__isl_take isl_setisl_map *set, void *user)
2454{
isl_union_pw_multi_aff **res = user;
isl_space *space;
isl_pw_multi_aff *pma;

space = isl_space_map_from_set(isl_set_get_space(set));
pma = isl_pw_multi_aff_identity(space);
pma = isl_pw_multi_aff_intersect_domain(pma, set);
*res = isl_union_pw_multi_aff_add_pw_multi_aff(*res, pma);

return *res ? isl_stat_ok : isl_stat_error;
2465}

2467/* Return an identity function on "uset" in the form
* of an isl_union_pw_multi_aff.
*/
2470__isl_give isl_union_pw_multi_aff *isl_union_set_identity_union_pw_multi_aff(
__isl_take isl_union_setisl_union_map *uset)
2472{
isl_union_pw_multi_aff *res;

res = isl_union_pw_multi_aff_empty(isl_union_set_get_space(uset));
if (isl_union_set_foreach_set(uset, &identity_upma, &res) < 0)
res = isl_union_pw_multi_aff_free(res);

isl_union_set_free(uset);
return res;
2481}

2483/* For each map in "umap" of the form [A -> B] -> C,
* construct the map A -> C and collect the results.
*/
2486__isl_give isl_union_map *isl_union_map_domain_factor_domain(
__isl_take isl_union_map *umap)
2488{
struct isl_un_op_drop_user_data data = { &isl_map_domain_is_wrapping };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_domain_factor_domain,
};
return un_op(umap, &control);
2496}

2498/* For each map in "umap" of the form [A -> B] -> C,
* construct the map B -> C and collect the results.
*/
2501__isl_give isl_union_map *isl_union_map_domain_factor_range(
__isl_take isl_union_map *umap)
2503{
struct isl_un_op_drop_user_data data = { &isl_map_domain_is_wrapping };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_domain_factor_range,
};
return un_op(umap, &control);
2511}

2513/* For each map in "umap" of the form A -> [B -> C],
* construct the map A -> B and collect the results.
*/
2516__isl_give isl_union_map *isl_union_map_range_factor_domain(
__isl_take isl_union_map *umap)
2518{
struct isl_un_op_drop_user_data data = { &isl_map_range_is_wrapping };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_range_factor_domain,
};
return un_op(umap, &control);
2526}

2528/* For each map in "umap" of the form A -> [B -> C],
* construct the map A -> C and collect the results.
*/
2531__isl_give isl_union_map *isl_union_map_range_factor_range(
__isl_take isl_union_map *umap)
2533{
struct isl_un_op_drop_user_data data = { &isl_map_range_is_wrapping };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_range_factor_range,
};
return un_op(umap, &control);
2541}

2543/* For each map in "umap" of the form [A -> B] -> [C -> D],
* construct the map A -> C and collect the results.
*/
2546__isl_give isl_union_map *isl_union_map_factor_domain(
__isl_take isl_union_map *umap)
2548{
struct isl_un_op_drop_user_data data = { &isl_map_is_product };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_factor_domain,
};
return un_op(umap, &control);
2556}

2558/* For each map in "umap" of the form [A -> B] -> [C -> D],
* construct the map B -> D and collect the results.
*/
2561__isl_give isl_union_map *isl_union_map_factor_range(
__isl_take isl_union_map *umap)
2563{
struct isl_un_op_drop_user_data data = { &isl_map_is_product };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_factor_range,
};
return un_op(umap, &control);
2571}

2573__isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_setisl_union_map *uset)
2574{
struct isl_un_op_drop_user_data data = { &isl_set_is_wrapping };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_set_unwrap,
};
return un_op(uset, &control);
2582}

2584__isl_give isl_union_setisl_union_map *isl_union_map_wrap(__isl_take isl_union_map *umap)
2585{
struct isl_un_op_control control = {
.fn_map = &isl_map_wrap,
};
return un_op(umap, &control);
2590}

2592struct isl_union_map_is_subset_data {
isl_union_map *umap2;
isl_bool is_subset;
2595};

2597static isl_stat is_subset_entry(void **entry, void *user)
2598{
struct isl_union_map_is_subset_data *data = user;
struct isl_hash_table_entry *entry2;
isl_space *space;
isl_map *map = *entry;

space = isl_map_peek_space(map);
entry2 = isl_union_map_find_entry(data->umap2, space, 0);
if (!entry2)
return isl_stat_error;
if (entry2 == isl_hash_table_entry_none) {
int empty = isl_map_is_empty(map);
if (empty < 0)
	return isl_stat_error;
if (empty)
	return isl_stat_ok;
data->is_subset = isl_bool_false;
return isl_stat_error;
}

data->is_subset = isl_map_is_subset(map, entry2->data);
if (data->is_subset < 0 || !data->is_subset)
return isl_stat_error;

return isl_stat_ok;
2623}

2625isl_bool isl_union_map_is_subset(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2627{
struct isl_union_map_is_subset_data data = { NULL((void*)0), isl_bool_true };

if (!umap1 || !umap2)
return isl_bool_error;

data.umap2 = umap2;
if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
		   &is_subset_entry, &data) < 0 &&
   data.is_subset)
return isl_bool_error;

return data.is_subset;
2640}

2642isl_bool isl_union_set_is_subset(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2644{
return isl_union_map_is_subset(uset1, uset2);
2646}

2648isl_bool isl_union_map_is_equal(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2650{
isl_bool is_subset;

if (!umap1 || !umap2)
return isl_bool_error;
is_subset = isl_union_map_is_subset(umap1, umap2);
if (is_subset != isl_bool_true)
return is_subset;
is_subset = isl_union_map_is_subset(umap2, umap1);
return is_subset;
2660}

2662isl_bool isl_union_set_is_equal(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2664{
return isl_union_map_is_equal(uset1, uset2);
2666}

2668isl_bool isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2670{
isl_bool is_subset;

if (!umap1 || !umap2)
return isl_bool_error;
is_subset = isl_union_map_is_subset(umap1, umap2);
if (is_subset != isl_bool_true)
return is_subset;
is_subset = isl_union_map_is_subset(umap2, umap1);
return isl_bool_not(is_subset);
2680}

2682isl_bool isl_union_set_is_strict_subset(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2684{
return isl_union_map_is_strict_subset(uset1, uset2);
2686}

2688/* Internal data structure for isl_union_map_is_disjoint.
* umap2 is the union map with which we are comparing.
* is_disjoint is initialized to 1 and is set to 0 as soon
* as the union maps turn out not to be disjoint.
*/
2693struct isl_union_map_is_disjoint_data {
isl_union_map *umap2;
isl_bool is_disjoint;
2696};

2698/* Check if "map" is disjoint from data->umap2 and abort
* the search if it is not.
*/
2701static isl_stat is_disjoint_entry(void **entry, void *user)
2702{
struct isl_union_map_is_disjoint_data *data = user;
struct isl_hash_table_entry *entry2;
isl_space *space;
isl_map *map = *entry;

space = isl_map_peek_space(map);
entry2 = isl_union_map_find_entry(data->umap2, space, 0);
if (!entry2)
return isl_stat_error;
if (entry2 == isl_hash_table_entry_none)
return isl_stat_ok;

data->is_disjoint = isl_map_is_disjoint(map, entry2->data);
if (data->is_disjoint < 0 || !data->is_disjoint)
return isl_stat_error;

return isl_stat_ok;
2720}

2722/* Are "umap1" and "umap2" disjoint?
*/
2724isl_bool isl_union_map_is_disjoint(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2726{
struct isl_union_map_is_disjoint_data data = { NULL((void*)0), isl_bool_true };

umap1 = isl_union_map_copy(umap1);
umap2 = isl_union_map_copy(umap2);
umap1 = isl_union_map_align_params(umap1,
				isl_union_map_get_space(umap2));
umap2 = isl_union_map_align_params(umap2,
				isl_union_map_get_space(umap1));

if (!umap1 || !umap2)
goto error;

data.umap2 = umap2;
if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
		   &is_disjoint_entry, &data) < 0 &&
   data.is_disjoint)
goto error;

isl_union_map_free(umap1);
isl_union_map_free(umap2);

return data.is_disjoint;
2749error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
return isl_bool_error;
2753}

2755/* Are "uset1" and "uset2" disjoint?
*/
2757isl_bool isl_union_set_is_disjoint(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2759{
return isl_union_map_is_disjoint(uset1, uset2);
2761}

2763static isl_stat sample_entry(void **entry, void *user)
2764{
isl_basic_map **sample = (isl_basic_map **)user;
isl_map *map = *entry;

*sample = isl_map_sample(isl_map_copy(map));
if (!*sample)
return isl_stat_error;
if (!isl_basic_map_plain_is_empty(*sample))
return isl_stat_error;
return isl_stat_ok;
2774}

2776__isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap)
2777{
isl_basic_map *sample = NULL((void*)0);

if (!umap)
return NULL((void*)0);

if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
		   &sample_entry, &sample) < 0 &&
   !sample)
goto error;

if (!sample)
sample = isl_basic_map_empty(isl_union_map_get_space(umap));

isl_union_map_free(umap);

return sample;
2794error:
isl_union_map_free(umap);
return NULL((void*)0);
2797}

2799__isl_give isl_basic_setisl_basic_map *isl_union_set_sample(__isl_take isl_union_setisl_union_map *uset)
2800{
return bset_from_bmap(isl_union_map_sample(uset));
2802}

2804/* Return an element in "uset" in the form of an isl_point.
* Return a void isl_point if "uset" is empty.
*/
2807__isl_give isl_point *isl_union_set_sample_point(__isl_take isl_union_setisl_union_map *uset)
2808{
return isl_basic_set_sample_point(isl_union_set_sample(uset));
2810}

2812struct isl_forall_data {
isl_bool res;
isl_bool (*fn)(__isl_keep isl_map *map);
2815};

2817static isl_stat forall_entry(void **entry, void *user)
2818{
struct isl_forall_data *data = user;
isl_map *map = *entry;

data->res = data->fn(map);
if (data->res < 0)
return isl_stat_error;

if (!data->res)
return isl_stat_error;

return isl_stat_ok;
2830}

2832static isl_bool union_map_forall(__isl_keep isl_union_map *umap,
isl_bool (*fn)(__isl_keep isl_map *map))
2834{
struct isl_forall_data data = { isl_bool_true, fn };

if (!umap)
return isl_bool_error;

if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
		   &forall_entry, &data) < 0 && data.res)
return isl_bool_error;

return data.res;
2845}

2847struct isl_forall_user_data {
isl_bool res;
isl_bool (*fn)(__isl_keep isl_map *map, void *user);
void *user;
2851};

2853static isl_stat forall_user_entry(void **entry, void *user)
2854{
struct isl_forall_user_data *data = user;
isl_map *map = *entry;

data->res = data->fn(map, data->user);
if (data->res < 0)
return isl_stat_error;

if (!data->res)
return isl_stat_error;

return isl_stat_ok;
2866}

2868/* Check if fn(map, user) returns true for all maps "map" in umap.
*/
2870static isl_bool union_map_forall_user(__isl_keep isl_union_map *umap,
isl_bool (*fn)(__isl_keep isl_map *map, void *user), void *user)
2872{
struct isl_forall_user_data data = { isl_bool_true, fn, user };

if (!umap)
return isl_bool_error;

if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
		   &forall_user_entry, &data) < 0 && data.res)
return isl_bool_error;

return data.res;
2883}

2885/* Is "umap" obviously empty?
*/
2887isl_bool isl_union_map_plain_is_empty(__isl_keep isl_union_map *umap)
2888{
isl_size n;

n = isl_union_map_n_map(umap);
if (n < 0)
return isl_bool_error;
return n == 0;
2895}

2897isl_bool isl_union_map_is_empty(__isl_keep isl_union_map *umap)
2898{
return union_map_forall(umap, &isl_map_is_empty);
2900}

2902isl_bool isl_union_set_is_empty(__isl_keep isl_union_setisl_union_map *uset)
2903{
return isl_union_map_is_empty(uset);
2905}

2907static isl_bool is_subset_of_identity(__isl_keep isl_map *map)
2908{
isl_bool is_subset;
isl_space *space;
isl_map *id;
isl_bool match;

match = isl_map_tuple_is_equal(map, isl_dim_in, map, isl_dim_out);
if (match < 0)
return isl_bool_error;
if (!match)
return isl_bool_false;

space = isl_map_get_space(map);
id = isl_map_identity(space);

is_subset = isl_map_is_subset(map, id);

isl_map_free(id);

return is_subset;
2928}

2930/* Given an isl_union_map that consists of a single map, check
* if it is single-valued.
*/
2933static isl_bool single_map_is_single_valued(__isl_keep isl_union_map *umap)
2934{
isl_map *map;
isl_bool sv;

umap = isl_union_map_copy(umap);
map = isl_map_from_union_map(umap);
sv = isl_map_is_single_valued(map);
isl_map_free(map);

return sv;
2944}

2946/* Internal data structure for single_valued_on_domain.
*
* "umap" is the union map to be tested.
* "sv" is set to 1 as long as "umap" may still be single-valued.
*/
2951struct isl_union_map_is_sv_data {
isl_union_map *umap;
isl_bool sv;
2954};

2956/* Check if the data->umap is single-valued on "set".
*
* If data->umap consists of a single map on "set", then test it
* as an isl_map.
*
* Otherwise, compute
*
*	M \circ M^-1
*
* check if the result is a subset of the identity mapping and
* store the result in data->sv.
*
* Terminate as soon as data->umap has been determined not to
* be single-valued.
*/
2971static isl_stat single_valued_on_domain(__isl_take isl_setisl_map *set, void *user)
2972{
struct isl_union_map_is_sv_data *data = user;
isl_union_map *umap, *test;
isl_size n;

umap = isl_union_map_copy(data->umap);
umap = isl_union_map_intersect_domain(umap,
				isl_union_set_from_set(set));

n = isl_union_map_n_map(umap);
if (n < 0) {
data->sv = isl_bool_error;
} else if (n == 1) {
data->sv = single_map_is_single_valued(umap);
isl_union_map_free(umap);
} else {
test = isl_union_map_reverse(isl_union_map_copy(umap));
test = isl_union_map_apply_range(test, umap);

data->sv = union_map_forall(test, &is_subset_of_identity);

isl_union_map_free(test);
}

if (data->sv < 0 || !data->sv)
return isl_stat_error;
return isl_stat_ok;
2999}

3001/* Check if the given map is single-valued.
*
* If the union map consists of a single map, then test it as an isl_map.
* Otherwise, check if the union map is single-valued on each of its
* domain spaces.
*/
3007isl_bool isl_union_map_is_single_valued(__isl_keep isl_union_map *umap)
3008{
isl_union_map *universe;
isl_union_setisl_union_map *domain;
struct isl_union_map_is_sv_data data;
isl_size n;

n = isl_union_map_n_map(umap);
if (n < 0)
return isl_bool_error;
if (n == 1)
return single_map_is_single_valued(umap);

universe = isl_union_map_universe(isl_union_map_copy(umap));
domain = isl_union_map_domain(universe);

data.sv = isl_bool_true;
data.umap = umap;
if (isl_union_set_foreach_set(domain,
	    &single_valued_on_domain, &data) < 0 && data.sv)
data.sv = isl_bool_error;
isl_union_set_free(domain);

return data.sv;
3031}

3033isl_bool isl_union_map_is_injective(__isl_keep isl_union_map *umap)
3034{
isl_bool in;

umap = isl_union_map_copy(umap);
umap = isl_union_map_reverse(umap);
in = isl_union_map_is_single_valued(umap);
isl_union_map_free(umap);

return in;
3043}

3045/* Is "map" obviously not an identity relation because
* it maps elements from one space to another space?
* Update *non_identity accordingly.
*
* In particular, if the domain and range spaces are the same,
* then the map is not considered to obviously not be an identity relation.
* Otherwise, the map is considered to obviously not be an identity relation
* if it is is non-empty.
*
* If "map" is determined to obviously not be an identity relation,
* then the search is aborted.
*/
3057static isl_stat map_plain_is_not_identity(__isl_take isl_map *map, void *user)
3058{
isl_bool *non_identity = user;
isl_bool equal;

equal = isl_map_tuple_is_equal(map, isl_dim_in, map, isl_dim_out);
if (equal >= 0 && !equal)
*non_identity = isl_bool_not(isl_map_is_empty(map));
else
*non_identity = isl_bool_not(equal);
isl_map_free(map);

if (*non_identity < 0 || *non_identity)
return isl_stat_error;

return isl_stat_ok;
3073}

3075/* Is "umap" obviously not an identity relation because
* it maps elements from one space to another space?
*
* As soon as a map has been found that maps elements to a different space,
* non_identity is changed and the search is aborted.
*/
3081static isl_bool isl_union_map_plain_is_not_identity(
__isl_keep isl_union_map *umap)
3083{
isl_bool non_identity;

non_identity = isl_bool_false;
if (isl_union_map_foreach_map(umap, &map_plain_is_not_identity,
			&non_identity) < 0 &&
   non_identity == isl_bool_false)
return isl_bool_error;

return non_identity;
3093}

3095/* Does "map" only map elements to themselves?
* Update *identity accordingly.
*
* If "map" is determined not to be an identity relation,
* then the search is aborted.
*/
3101static isl_stat map_is_identity(__isl_take isl_map *map, void *user)
3102{
isl_bool *identity = user;

*identity = isl_map_is_identity(map);
isl_map_free(map);

if (*identity < 0 || !*identity)
return isl_stat_error;

return isl_stat_ok;
3112}

3114/* Does "umap" only map elements to themselves?
*
* First check if there are any maps that map elements to different spaces.
* If not, then check that all the maps (between identical spaces)
* are identity relations.
*/
3120isl_bool isl_union_map_is_identity(__isl_keep isl_union_map *umap)
3121{
isl_bool non_identity;
isl_bool identity;

non_identity = isl_union_map_plain_is_not_identity(umap);
if (non_identity < 0 || non_identity)
return isl_bool_not(non_identity);

identity = isl_bool_true;
if (isl_union_map_foreach_map(umap, &map_is_identity, &identity) < 0 &&
   identity == isl_bool_true)
return isl_bool_error;

return identity;
3135}

3137/* Represents a map that has a fixed value (v) for one of its
* range dimensions.
* The map in this structure is not reference counted, so it
* is only valid while the isl_union_map from which it was
* obtained is still alive.
*/
3143struct isl_fixed_map {
isl_int v;
isl_map *map;
3146};

3148static struct isl_fixed_map *alloc_isl_fixed_map_array(isl_ctx *ctx,
int n)
3150{
int i;
struct isl_fixed_map *v;

v = isl_calloc_array(ctx, struct isl_fixed_map, n)((struct isl_fixed_map *)isl_calloc_or_die(ctx, n, sizeof(struct
 isl_fixed_map)));
if (!v)
return NULL((void*)0);
for (i = 0; i < n; ++i)
isl_int_init(v[i].v)isl_sioimath_init((v[i].v));
return v;
3160}

3162static void free_isl_fixed_map_array(struct isl_fixed_map *v, int n)
3163{
int i;

if (!v)
return;
for (i = 0; i < n; ++i)
isl_int_clear(v[i].v)isl_sioimath_clear((v[i].v));
free(v);
3171}

3173/* Compare the "v" field of two isl_fixed_map structs.
*/
3175static int qsort_fixed_map_cmp(const void *p1, const void *p2)
3176{
const struct isl_fixed_map *e1 = (const struct isl_fixed_map *) p1;
const struct isl_fixed_map *e2 = (const struct isl_fixed_map *) p2;

return isl_int_cmp(e1->v, e2->v)isl_sioimath_cmp(*(e1->v), *(e2->v));
3181}

3183/* Internal data structure used while checking whether all maps
* in a union_map have a fixed value for a given output dimension.
* v is the list of maps, with the fixed value for the dimension
* n is the number of maps considered so far
* pos is the output dimension under investigation
*/
3189struct isl_fixed_dim_data {
struct isl_fixed_map *v;
int n;
int pos;
3193};

3195static isl_bool fixed_at_pos(__isl_keep isl_map *map, void *user)
3196{
struct isl_fixed_dim_data *data = user;

data->v[data->n].map = map;
return isl_map_plain_is_fixed(map, isl_dim_out, data->pos,
		      &data->v[data->n++].v);
3202}

3204static isl_bool plain_injective_on_range(__isl_take isl_union_map *umap,
int first, int n_range);

3207/* Given a list of the maps, with their fixed values at output dimension "pos",
* check whether the ranges of the maps form an obvious partition.
*
* We first sort the maps according to their fixed values.
* If all maps have a different value, then we know the ranges form
* a partition.
* Otherwise, we collect the maps with the same fixed value and
* check whether each such collection is obviously injective
* based on later dimensions.
*/
3217static int separates(struct isl_fixed_map *v, int n,
__isl_take isl_space *space, int pos, int n_range)
3219{
int i;

if (!v)
goto error;

qsort(v, n, sizeof(*v), &qsort_fixed_map_cmp);

for (i = 0; i + 1 < n; ++i) {
int j, k;
isl_union_map *part;
int injective;

for (j = i + 1; j < n; ++j)
	if (isl_int_ne(v[i].v, v[j].v)(isl_sioimath_cmp(*(v[i].v), *(v[j].v)) != 0))
		break;

if (j == i + 1)
	continue;

part = isl_union_map_alloc(isl_space_copy(space), j - i);
for (k = i; k < j; ++k)
	part = isl_union_map_add_map(part,
				     isl_map_copy(v[k].map));

injective = plain_injective_on_range(part, pos + 1, n_range);
if (injective < 0)
	goto error;
if (!injective)
	break;

i = j - 1;
}

isl_space_free(space);
free_isl_fixed_map_array(v, n);
return i + 1 >= n;
3256error:
isl_space_free(space);
free_isl_fixed_map_array(v, n);
return -1;
3260}

3262/* Check whether the maps in umap have obviously distinct ranges.
* In particular, check for an output dimension in the range
* [first,n_range) for which all maps have a fixed value
* and then check if these values, possibly along with fixed values
* at later dimensions, entail distinct ranges.
*/
3268static isl_bool plain_injective_on_range(__isl_take isl_union_map *umap,
int first, int n_range)
3270{
isl_ctx *ctx;
isl_size n;
struct isl_fixed_dim_data data = { NULL((void*)0) };

ctx = isl_union_map_get_ctx(umap);

n = isl_union_map_n_map(umap);
if (n < 0)
goto error;

if (n <= 1) {
isl_union_map_free(umap);
return isl_bool_true;
}

if (first >= n_range) {
isl_union_map_free(umap);
return isl_bool_false;
}

data.v = alloc_isl_fixed_map_array(ctx, n);
if (!data.v)
goto error;

for (data.pos = first; data.pos < n_range; ++data.pos) {
isl_bool fixed;
int injective;
isl_space *space;

data.n = 0;
fixed = union_map_forall_user(umap, &fixed_at_pos, &data);
if (fixed < 0)
	goto error;
if (!fixed)
	continue;
space = isl_union_map_get_space(umap);
injective = separates(data.v, n, space, data.pos, n_range);
isl_union_map_free(umap);
return injective;
}

free_isl_fixed_map_array(data.v, n);
isl_union_map_free(umap);

return isl_bool_false;
3316error:
free_isl_fixed_map_array(data.v, n);
isl_union_map_free(umap);
return isl_bool_error;
3320}

3322/* Check whether the maps in umap that map to subsets of "ran"
* have obviously distinct ranges.
*/
3325static isl_bool plain_injective_on_range_wrap(__isl_keep isl_setisl_map *ran,
void *user)
3327{
isl_size dim;
isl_union_map *umap = user;

dim = isl_set_dim(ran, isl_dim_set);
if (dim < 0)
return isl_bool_error;

umap = isl_union_map_copy(umap);
umap = isl_union_map_intersect_range(umap,
	isl_union_set_from_set(isl_set_copy(ran)));
return plain_injective_on_range(umap, 0, dim);
3339}

3341/* Check if the given union_map is obviously injective.
*
* In particular, we first check if all individual maps are obviously
* injective and then check if all the ranges of these maps are
* obviously disjoint.
*/
3347isl_bool isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap)
3348{
isl_bool in;
isl_union_map *univ;
isl_union_setisl_union_map *ran;

in = union_map_forall(umap, &isl_map_plain_is_injective);
if (in < 0)
return isl_bool_error;
if (!in)
return isl_bool_false;

univ = isl_union_map_universe(isl_union_map_copy(umap));
ran = isl_union_map_range(univ);

in = union_map_forall_user(ran, &plain_injective_on_range_wrap, umap);

isl_union_set_free(ran);

return in;
3367}

3369isl_bool isl_union_map_is_bijective(__isl_keep isl_union_map *umap)
3370{
isl_bool sv;

sv = isl_union_map_is_single_valued(umap);
if (sv < 0 || !sv)
return sv;

return isl_union_map_is_injective(umap);
3378}

3380__isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap)
3381{
struct isl_un_op_drop_user_data data = { &isl_map_can_zip };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_zip,
};
return un_op(umap, &control);
3389}

3391/* Given a union map, take the maps of the form A -> (B -> C) and
* return the union of the corresponding maps (A -> B) -> C.
*/
3394__isl_give isl_union_map *isl_union_map_uncurry(__isl_take isl_union_map *umap)
3395{
struct isl_un_op_drop_user_data data = { &isl_map_can_uncurry };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_uncurry,
};
return un_op(umap, &control);
3403}

3405/* Given a union map, take the maps of the form (A -> B) -> C and
* return the union of the corresponding maps A -> (B -> C).
*/
3408__isl_give isl_union_map *isl_union_map_curry(__isl_take isl_union_map *umap)
3409{
struct isl_un_op_drop_user_data data = { &isl_map_can_curry };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_curry,
};
return un_op(umap, &control);
3417}

3419/* Given a union map, take the maps of the form A -> ((B -> C) -> D) and
* return the union of the corresponding maps A -> (B -> (C -> D)).
*/
3422__isl_give isl_union_map *isl_union_map_range_curry(
__isl_take isl_union_map *umap)
3424{
struct isl_un_op_drop_user_data data = { &isl_map_can_range_curry };
struct isl_un_op_control control = {
.filter = &un_op_filter_drop_user,
.filter_user = &data,
.fn_map = &isl_map_range_curry,
};
return un_op(umap, &control);
3432}

3434__isl_give isl_union_setisl_union_map *isl_union_set_lift(__isl_take isl_union_setisl_union_map *uset)
3435{
struct isl_un_op_control control = {
.fn_map = &isl_set_lift,
};
return un_op(uset, &control);
3440}

3442static isl_stat coefficients_entry(void **entry, void *user)
3443{
isl_setisl_map *set = *entry;
isl_union_setisl_union_map **res = user;

set = isl_set_copy(set);
set = isl_set_from_basic_set(isl_set_coefficients(set));
*res = isl_union_set_add_set(*res, set);

return isl_stat_ok;
3452}

3454__isl_give isl_union_setisl_union_map *isl_union_set_coefficients(
__isl_take isl_union_setisl_union_map *uset)
3456{
isl_ctx *ctx;
isl_space *space;
isl_union_setisl_union_map *res;

if (!uset)
return NULL((void*)0);

ctx = isl_union_set_get_ctx(uset);
space = isl_space_set_alloc(ctx, 0, 0);
res = isl_union_map_alloc(space, uset->table.n);
if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
		   &coefficients_entry, &res) < 0)
goto error;

isl_union_set_free(uset);
return res;
3473error:
isl_union_set_free(uset);
isl_union_set_free(res);
return NULL((void*)0);
3477}

3479static isl_stat solutions_entry(void **entry, void *user)
3480{
isl_setisl_map *set = *entry;
isl_union_setisl_union_map **res = user;

set = isl_set_copy(set);
set = isl_set_from_basic_set(isl_set_solutions(set));
if (!*res)
*res = isl_union_set_from_set(set);
else
*res = isl_union_set_add_set(*res, set);

if (!*res)
return isl_stat_error;

return isl_stat_ok;
3495}

3497__isl_give isl_union_setisl_union_map *isl_union_set_solutions(
__isl_take isl_union_setisl_union_map *uset)
3499{
isl_union_setisl_union_map *res = NULL((void*)0);

if (!uset)
return NULL((void*)0);

if (uset->table.n == 0) {
res = isl_union_set_empty(isl_union_set_get_space(uset));
isl_union_set_free(uset);
return res;
}

if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
		   &solutions_entry, &res) < 0)
goto error;

isl_union_set_free(uset);
return res;
3517error:
isl_union_set_free(uset);
isl_union_set_free(res);
return NULL((void*)0);
3521}

3523/* Is the domain space of "map" equal to "space"?
*/
3525static int domain_match(__isl_keep isl_map *map, __isl_keep isl_space *space)
3526{
return isl_map_space_tuple_is_equal(map, isl_dim_in,
			space, isl_dim_out);
3529}

3531/* Is the range space of "map" equal to "space"?
*/
3533static int range_match(__isl_keep isl_map *map, __isl_keep isl_space *space)
3534{
return isl_map_space_tuple_is_equal(map, isl_dim_out,
			space, isl_dim_out);
3537}

3539/* Is the set space of "map" equal to "space"?
*/
3541static int set_match(__isl_keep isl_map *map, __isl_keep isl_space *space)
3542{
return isl_map_space_tuple_is_equal(map, isl_dim_set,
			space, isl_dim_out);
3545}

3547/* Internal data structure for preimage_pw_multi_aff.
*
* "pma" is the function under which the preimage should be taken.
* "space" is the space of "pma".
* "res" collects the results.
* "fn" computes the preimage for a given map.
* "match" returns true if "fn" can be called.
*/
3555struct isl_union_map_preimage_data {
isl_space *space;
isl_pw_multi_aff *pma;
isl_union_map *res;
int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space);
__isl_give isl_map *(*fn)(__isl_take isl_map *map,
__isl_take isl_pw_multi_aff *pma);
3562};

3564/* Call data->fn to compute the preimage of the domain or range of *entry
* under the function represented by data->pma, provided the domain/range
* space of *entry matches the target space of data->pma
* (as given by data->match), and add the result to data->res.
*/
3569static isl_stat preimage_entry(void **entry, void *user)
3570{
int m;
isl_map *map = *entry;
struct isl_union_map_preimage_data *data = user;
isl_bool empty;

m = data->match(map, data->space);
if (m < 0)
return isl_stat_error;
if (!m)
return isl_stat_ok;

map = isl_map_copy(map);
map = data->fn(map, isl_pw_multi_aff_copy(data->pma));

empty = isl_map_is_empty(map);
if (empty < 0 || empty) {
isl_map_free(map);
return empty < 0 ? isl_stat_error : isl_stat_ok;
}

data->res = isl_union_map_add_map(data->res, map);

return isl_stat_ok;
3594}

3596/* Compute the preimage of the domain or range of "umap" under the function
* represented by "pma".
* In other words, plug in "pma" in the domain or range of "umap".
* The function "fn" performs the actual preimage computation on a map,
* while "match" determines to which maps the function should be applied.
*/
3602static __isl_give isl_union_map *preimage_pw_multi_aff(
__isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma,
int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space),
__isl_give isl_map *(*fn)(__isl_take isl_map *map,
__isl_take isl_pw_multi_aff *pma))
3607{
isl_ctx *ctx;
isl_space *space;
struct isl_union_map_preimage_data data;

umap = isl_union_map_align_params(umap,
			    isl_pw_multi_aff_get_space(pma));
pma = isl_pw_multi_aff_align_params(pma, isl_union_map_get_space(umap));

if (!umap || !pma)
goto error;

ctx = isl_union_map_get_ctx(umap);
space = isl_union_map_get_space(umap);
data.space = isl_pw_multi_aff_get_space(pma);
data.pma = pma;
data.res = isl_union_map_alloc(space, umap->table.n);
data.match = match;
data.fn = fn;
if (isl_hash_table_foreach(ctx, &umap->table, &preimage_entry,
			&data) < 0)
data.res = isl_union_map_free(data.res);

isl_space_free(data.space);
isl_union_map_free(umap);
isl_pw_multi_aff_free(pma);
return data.res;
3634error:
isl_union_map_free(umap);
isl_pw_multi_aff_free(pma);
return NULL((void*)0);
3638}

3640/* Compute the preimage of the domain of "umap" under the function
* represented by "pma".
* In other words, plug in "pma" in the domain of "umap".
* The result contains maps that live in the same spaces as the maps of "umap"
* with domain space equal to the target space of "pma",
* except that the domain has been replaced by the domain space of "pma".
*/
3647__isl_give isl_union_map *isl_union_map_preimage_domain_pw_multi_aff(
__isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma)
3649{
return preimage_pw_multi_aff(umap, pma, &domain_match,
			&isl_map_preimage_domain_pw_multi_aff);
3652}

3654/* Compute the preimage of the range of "umap" under the function
* represented by "pma".
* In other words, plug in "pma" in the range of "umap".
* The result contains maps that live in the same spaces as the maps of "umap"
* with range space equal to the target space of "pma",
* except that the range has been replaced by the domain space of "pma".
*/
3661__isl_give isl_union_map *isl_union_map_preimage_range_pw_multi_aff(
__isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma)
3663{
return preimage_pw_multi_aff(umap, pma, &range_match,
			&isl_map_preimage_range_pw_multi_aff);
3666}

3668/* Compute the preimage of "uset" under the function represented by "pma".
* In other words, plug in "pma" in "uset".
* The result contains sets that live in the same spaces as the sets of "uset"
* with space equal to the target space of "pma",
* except that the space has been replaced by the domain space of "pma".
*/
3674__isl_give isl_union_setisl_union_map *isl_union_set_preimage_pw_multi_aff(
__isl_take isl_union_setisl_union_map *uset, __isl_take isl_pw_multi_aff *pma)
3676{
return preimage_pw_multi_aff(uset, pma, &set_match,
			&isl_set_preimage_pw_multi_aff);
3679}

3681/* Compute the preimage of the domain of "umap" under the function
* represented by "ma".
* In other words, plug in "ma" in the domain of "umap".
* The result contains maps that live in the same spaces as the maps of "umap"
* with domain space equal to the target space of "ma",
* except that the domain has been replaced by the domain space of "ma".
*/
3688__isl_give isl_union_map *isl_union_map_preimage_domain_multi_aff(
__isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma)
3690{
return isl_union_map_preimage_domain_pw_multi_aff(umap,
			isl_pw_multi_aff_from_multi_aff(ma));
3693}

3695/* Compute the preimage of the range of "umap" under the function
* represented by "ma".
* In other words, plug in "ma" in the range of "umap".
* The result contains maps that live in the same spaces as the maps of "umap"
* with range space equal to the target space of "ma",
* except that the range has been replaced by the domain space of "ma".
*/
3702__isl_give isl_union_map *isl_union_map_preimage_range_multi_aff(
__isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma)
3704{
return isl_union_map_preimage_range_pw_multi_aff(umap,
			isl_pw_multi_aff_from_multi_aff(ma));
3707}

3709/* Compute the preimage of "uset" under the function represented by "ma".
* In other words, plug in "ma" in "uset".
* The result contains sets that live in the same spaces as the sets of "uset"
* with space equal to the target space of "ma",
* except that the space has been replaced by the domain space of "ma".
*/
3715__isl_give isl_union_map *isl_union_set_preimage_multi_aff(
__isl_take isl_union_setisl_union_map *uset, __isl_take isl_multi_aff *ma)
3717{
return isl_union_set_preimage_pw_multi_aff(uset,
			isl_pw_multi_aff_from_multi_aff(ma));
3720}

3722/* Internal data structure for preimage_multi_pw_aff.
*
* "mpa" is the function under which the preimage should be taken.
* "space" is the space of "mpa".
* "res" collects the results.
* "fn" computes the preimage for a given map.
* "match" returns true if "fn" can be called.
*/
3730struct isl_union_map_preimage_mpa_data {
isl_space *space;
isl_multi_pw_aff *mpa;
isl_union_map *res;
int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space);
__isl_give isl_map *(*fn)(__isl_take isl_map *map,
__isl_take isl_multi_pw_aff *mpa);
3737};

3739/* Call data->fn to compute the preimage of the domain or range of *entry
* under the function represented by data->mpa, provided the domain/range
* space of *entry matches the target space of data->mpa
* (as given by data->match), and add the result to data->res.
*/
3744static isl_stat preimage_mpa_entry(void **entry, void *user)
3745{
int m;
isl_map *map = *entry;
struct isl_union_map_preimage_mpa_data *data = user;
isl_bool empty;

m = data->match(map, data->space);
if (m < 0)
return isl_stat_error;
if (!m)
return isl_stat_ok;

map = isl_map_copy(map);
map = data->fn(map, isl_multi_pw_aff_copy(data->mpa));

empty = isl_map_is_empty(map);
if (empty < 0 || empty) {
isl_map_free(map);
return empty < 0 ? isl_stat_error : isl_stat_ok;
}

data->res = isl_union_map_add_map(data->res, map);

return isl_stat_ok;
3769}

3771/* Compute the preimage of the domain or range of "umap" under the function
* represented by "mpa".
* In other words, plug in "mpa" in the domain or range of "umap".
* The function "fn" performs the actual preimage computation on a map,
* while "match" determines to which maps the function should be applied.
*/
3777static __isl_give isl_union_map *preimage_multi_pw_aff(
__isl_take isl_union_map *umap, __isl_take isl_multi_pw_aff *mpa,
int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space),
__isl_give isl_map *(*fn)(__isl_take isl_map *map,
__isl_take isl_multi_pw_aff *mpa))
3782{
isl_ctx *ctx;
isl_space *space;
struct isl_union_map_preimage_mpa_data data;

umap = isl_union_map_align_params(umap,
			    isl_multi_pw_aff_get_space(mpa));
mpa = isl_multi_pw_aff_align_params(mpa, isl_union_map_get_space(umap));

if (!umap || !mpa)
goto error;

ctx = isl_union_map_get_ctx(umap);
space = isl_union_map_get_space(umap);
data.space = isl_multi_pw_aff_get_space(mpa);
data.mpa = mpa;
data.res = isl_union_map_alloc(space, umap->table.n);
data.match = match;
data.fn = fn;
if (isl_hash_table_foreach(ctx, &umap->table, &preimage_mpa_entry,
			&data) < 0)
data.res = isl_union_map_free(data.res);

isl_space_free(data.space);
isl_union_map_free(umap);
isl_multi_pw_aff_free(mpa);
return data.res;
3809error:
isl_union_map_free(umap);
isl_multi_pw_aff_free(mpa);
return NULL((void*)0);
3813}

3815/* Compute the preimage of the domain of "umap" under the function
* represented by "mpa".
* In other words, plug in "mpa" in the domain of "umap".
* The result contains maps that live in the same spaces as the maps of "umap"
* with domain space equal to the target space of "mpa",
* except that the domain has been replaced by the domain space of "mpa".
*/
3822__isl_give isl_union_map *isl_union_map_preimage_domain_multi_pw_aff(
__isl_take isl_union_map *umap, __isl_take isl_multi_pw_aff *mpa)
3824{
return preimage_multi_pw_aff(umap, mpa, &domain_match,
			&isl_map_preimage_domain_multi_pw_aff);
3827}

3829/* Internal data structure for preimage_upma.
*
* "umap" is the map of which the preimage should be computed.
* "res" collects the results.
* "fn" computes the preimage for a given piecewise multi-affine function.
*/
3835struct isl_union_map_preimage_upma_data {
isl_union_map *umap;
isl_union_map *res;
__isl_give isl_union_map *(*fn)(__isl_take isl_union_map *umap,
__isl_take isl_pw_multi_aff *pma);
3840};

3842/* Call data->fn to compute the preimage of the domain or range of data->umap
* under the function represented by pma and add the result to data->res.
*/
3845static isl_stat preimage_upma(__isl_take isl_pw_multi_aff *pma, void *user)
3846{
struct isl_union_map_preimage_upma_data *data = user;
isl_union_map *umap;

umap = isl_union_map_copy(data->umap);
umap = data->fn(umap, pma);
data->res = isl_union_map_union(data->res, umap);

return data->res ? isl_stat_ok : isl_stat_error;
3855}

3857/* Compute the preimage of the domain or range of "umap" under the function
* represented by "upma".
* In other words, plug in "upma" in the domain or range of "umap".
* The function "fn" performs the actual preimage computation
* on a piecewise multi-affine function.
*/
3863static __isl_give isl_union_map *preimage_union_pw_multi_aff(
__isl_take isl_union_map *umap,
__isl_take isl_union_pw_multi_aff *upma,
__isl_give isl_union_map *(*fn)(__isl_take isl_union_map *umap,
__isl_take isl_pw_multi_aff *pma))
3868{
struct isl_union_map_preimage_upma_data data;

data.umap = umap;
data.res = isl_union_map_empty(isl_union_map_get_space(umap));
data.fn = fn;
if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma,
				    &preimage_upma, &data) < 0)
data.res = isl_union_map_free(data.res);

isl_union_map_free(umap);
isl_union_pw_multi_aff_free(upma);

return data.res;
3882}

3884/* Compute the preimage of the domain of "umap" under the function
* represented by "upma".
* In other words, plug in "upma" in the domain of "umap".
* The result contains maps that live in the same spaces as the maps of "umap"
* with domain space equal to one of the target spaces of "upma",
* except that the domain has been replaced by one of the domain spaces that
* correspond to that target space of "upma".
*/
3892__isl_give isl_union_map *isl_union_map_preimage_domain_union_pw_multi_aff(
__isl_take isl_union_map *umap,
__isl_take isl_union_pw_multi_aff *upma)
3895{
return preimage_union_pw_multi_aff(umap, upma,
		&isl_union_map_preimage_domain_pw_multi_aff);
3898}

3900/* Compute the preimage of the range of "umap" under the function
* represented by "upma".
* In other words, plug in "upma" in the range of "umap".
* The result contains maps that live in the same spaces as the maps of "umap"
* with range space equal to one of the target spaces of "upma",
* except that the range has been replaced by one of the domain spaces that
* correspond to that target space of "upma".
*/
3908__isl_give isl_union_map *isl_union_map_preimage_range_union_pw_multi_aff(
__isl_take isl_union_map *umap,
__isl_take isl_union_pw_multi_aff *upma)
3911{
return preimage_union_pw_multi_aff(umap, upma,
		&isl_union_map_preimage_range_pw_multi_aff);
3914}

3916/* Compute the preimage of "uset" under the function represented by "upma".
* In other words, plug in "upma" in the range of "uset".
* The result contains sets that live in the same spaces as the sets of "uset"
* with space equal to one of the target spaces of "upma",
* except that the space has been replaced by one of the domain spaces that
* correspond to that target space of "upma".
*/
3923__isl_give isl_union_setisl_union_map *isl_union_set_preimage_union_pw_multi_aff(
__isl_take isl_union_setisl_union_map *uset,
__isl_take isl_union_pw_multi_aff *upma)
3926{
return preimage_union_pw_multi_aff(uset, upma,
			&isl_union_set_preimage_pw_multi_aff);
3929}

3931/* Reset the user pointer on all identifiers of parameters and tuples
* of the spaces of "umap".
*/
3934__isl_give isl_union_map *isl_union_map_reset_user(
__isl_take isl_union_map *umap)
3936{
umap = isl_union_map_cow(umap);
2
←
Calling 'isl_union_map_cow'→
8
←
Returning from 'isl_union_map_cow'→
if (!umap8.1
'umap' is non-null
)
9
←
Taking false branch→
return NULL((void*)0);
umap->dim = isl_space_reset_user(umap->dim);
10
←
Value assigned to field 'dim'→
if (!umap->dim)
11
←
Assuming field 'dim' is null→
12
←
Taking true branch→
return isl_union_map_free(umap);
13
←
Calling 'isl_union_map_free'→
return total(umap, &isl_map_reset_user);
3944}

3946/* Reset the user pointer on all identifiers of parameters and tuples
* of the spaces of "uset".
*/
3949__isl_give isl_union_setisl_union_map *isl_union_set_reset_user(
__isl_take isl_union_setisl_union_map *uset)
3951{
return isl_union_map_reset_user(uset);
1
Calling 'isl_union_map_reset_user'→
3953}

3955/* Remove all existentially quantified variables and integer divisions
* from "umap" using Fourier-Motzkin elimination.
*/
3958__isl_give isl_union_map *isl_union_map_remove_divs(
__isl_take isl_union_map *umap)
3960{
return total(umap, &isl_map_remove_divs);
3962}

3964/* Remove all existentially quantified variables and integer divisions
* from "uset" using Fourier-Motzkin elimination.
*/
3967__isl_give isl_union_setisl_union_map *isl_union_set_remove_divs(
__isl_take isl_union_setisl_union_map *uset)
3969{
return isl_union_map_remove_divs(uset);
3971}

3973/* Internal data structure for isl_union_map_project_out.
* "type", "first" and "n" are the arguments for the isl_map_project_out
* call.
* "res" collects the results.
*/
3978struct isl_union_map_project_out_data {
enum isl_dim_type type;
unsigned first;
unsigned n;

isl_union_map *res;
3984};

3986/* Turn the data->n dimensions of type data->type, starting at data->first
* into existentially quantified variables and add the result to data->res.
*/
3989static isl_stat project_out(__isl_take isl_map *map, void *user)
3990{
struct isl_union_map_project_out_data *data = user;

map = isl_map_project_out(map, data->type, data->first, data->n);
data->res = isl_union_map_add_map(data->res, map);

return isl_stat_ok;
3997}

3999/* Turn the "n" dimensions of type "type", starting at "first"
* into existentially quantified variables.
* Since the space of an isl_union_map only contains parameters,
* type is required to be equal to isl_dim_param.
*/
4004__isl_give isl_union_map *isl_union_map_project_out(
__isl_take isl_union_map *umap,
enum isl_dim_type type, unsigned first, unsigned n)
4007{
isl_space *space;
struct isl_union_map_project_out_data data = { type, first, n };

if (!umap)
return NULL((void*)0);

if (type != isl_dim_param)
isl_die(isl_union_map_get_ctx(umap), isl_error_invalid,do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only project out parameters", "polly/lib/External/isl/isl_union_map.c"
, 4017); return isl_union_map_free(umap); } while (0)
	"can only project out parameters",do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only project out parameters", "polly/lib/External/isl/isl_union_map.c"
, 4017); return isl_union_map_free(umap); } while (0)
	return isl_union_map_free(umap))do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only project out parameters", "polly/lib/External/isl/isl_union_map.c"
, 4017); return isl_union_map_free(umap); } while (0);

space = isl_union_map_get_space(umap);
space = isl_space_drop_dims(space, type, first, n);
data.res = isl_union_map_empty(space);
if (isl_union_map_foreach_map(umap, &project_out, &data) < 0)
data.res = isl_union_map_free(data.res);

isl_union_map_free(umap);

return data.res;
4028}

4030#undef TYPEisl_union_map
4031#define TYPEisl_union_map	isl_union_map
4032#include "isl_project_out_all_params_templ.c"
4033#include "isl_project_out_param_templ.c"

4035/* Turn the "n" dimensions of type "type", starting at "first"
* into existentially quantified variables.
* Since the space of an isl_union_set only contains parameters,
* "type" is required to be equal to isl_dim_param.
*/
4040__isl_give isl_union_setisl_union_map *isl_union_set_project_out(
__isl_take isl_union_setisl_union_map *uset,
enum isl_dim_type type, unsigned first, unsigned n)
4043{
return isl_union_map_project_out(uset, type, first, n);
4045}

4047/* Project out all parameters from "uset" by existentially quantifying
* over them.
*/
4050__isl_give isl_union_setisl_union_map *isl_union_set_project_out_all_params(
__isl_take isl_union_setisl_union_map *uset)
4052{
return uset_from_umap(
    isl_union_map_project_out_all_params(uset_to_umap(uset)));
4055}

4057/* Internal data structure for isl_union_map_involves_dims.
* "first" and "n" are the arguments for the isl_map_involves_dims calls.
*/
4060struct isl_union_map_involves_dims_data {
unsigned first;
unsigned n;
4063};

4065/* Does "map" _not_ involve the data->n parameters starting at data->first?
*/
4067static isl_bool map_excludes(__isl_keep isl_map *map, void *user)
4068{
struct isl_union_map_involves_dims_data *data = user;
isl_bool involves;

involves = isl_map_involves_dims(map,
			isl_dim_param, data->first, data->n);
return isl_bool_not(involves);
4075}

4077/* Does "umap" involve any of the n parameters starting at first?
* "type" is required to be set to isl_dim_param.
*
* "umap" involves any of those parameters if any of its maps
* involve the parameters.  In other words, "umap" does not
* involve any of the parameters if all its maps to not
* involve the parameters.
*/
4085isl_bool isl_union_map_involves_dims(__isl_keep isl_union_map *umap,
enum isl_dim_type type, unsigned first, unsigned n)
4087{
struct isl_union_map_involves_dims_data data = { first, n };
isl_bool excludes;

if (type != isl_dim_param)
isl_die(isl_union_map_get_ctx(umap), isl_error_invalid,do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only reference parameters", "polly/lib/External/isl/isl_union_map.c"
, 4093); return isl_bool_error; } while (0)
	"can only reference parameters", return isl_bool_error)do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only reference parameters", "polly/lib/External/isl/isl_union_map.c"
, 4093); return isl_bool_error; } while (0);

excludes = union_map_forall_user(umap, &map_excludes, &data);

return isl_bool_not(excludes);
4098}

4100/* Internal data structure for isl_union_map_reset_range_space.
* "range" is the space from which to set the range space.
* "res" collects the results.
*/
4104struct isl_union_map_reset_range_space_data {
isl_space *range;
isl_union_map *res;
4107};

4109/* Replace the range space of "map" by the range space of data->range and
* add the result to data->res.
*/
4112static isl_stat reset_range_space(__isl_take isl_map *map, void *user)
4113{
struct isl_union_map_reset_range_space_data *data = user;
isl_space *space;

space = isl_map_get_space(map);
space = isl_space_domain(space);
space = isl_space_extend_domain_with_range(space,
				isl_space_copy(data->range));
map = isl_map_reset_space(map, space);
data->res = isl_union_map_add_map(data->res, map);

return data->res ? isl_stat_ok : isl_stat_error;
4125}

4127/* Replace the range space of all the maps in "umap" by
* the range space of "space".
*
* This assumes that all maps have the same output dimension.
* This function should therefore not be made publicly available.
*
* Since the spaces of the maps change, so do their hash value.
* We therefore need to create a new isl_union_map.
*/
4136__isl_give isl_union_map *isl_union_map_reset_range_space(
__isl_take isl_union_map *umap, __isl_take isl_space *space)
4138{
struct isl_union_map_reset_range_space_data data = { space };

data.res = isl_union_map_empty(isl_union_map_get_space(umap));
if (isl_union_map_foreach_map(umap, &reset_range_space, &data) < 0)
data.res = isl_union_map_free(data.res);

isl_space_free(space);
isl_union_map_free(umap);
return data.res;
4148}

4150/* Check that "umap" and "space" have the same number of parameters.
*/
4152static isl_stat check_union_map_space_equal_dim(__isl_keep isl_union_map *umap,
__isl_keep isl_space *space)
4154{
isl_size dim1, dim2;

dim1 = isl_union_map_dim(umap, isl_dim_param);
dim2 = isl_space_dim(space, isl_dim_param);
if (dim1 < 0 || dim2 < 0)
return isl_stat_error;
if (dim1 == dim2)
return isl_stat_ok;
isl_die(isl_union_map_get_ctx(umap), isl_error_invalid,do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "number of parameters does not match", "polly/lib/External/isl/isl_union_map.c"
, 4164); return isl_stat_error; } while (0)
"number of parameters does not match", return isl_stat_error)do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "number of parameters does not match", "polly/lib/External/isl/isl_union_map.c"
, 4164); return isl_stat_error; } while (0);
4165}

4167/* Internal data structure for isl_union_map_reset_equal_dim_space.
* "space" is the target space.
* "res" collects the results.
*/
4171struct isl_union_map_reset_params_data {
isl_space *space;
isl_union_map *res;
4174};

4176/* Replace the parameters of "map" by those of data->space and
* add the result to data->res.
*/
4179static isl_stat reset_params(__isl_take isl_map *map, void *user)
4180{
struct isl_union_map_reset_params_data *data = user;
isl_space *space;

space = isl_map_get_space(map);
space = isl_space_replace_params(space, data->space);
map = isl_map_reset_equal_dim_space(map, space);
data->res = isl_union_map_add_map(data->res, map);

return data->res ? isl_stat_ok : isl_stat_error;
4190}

4192/* Replace the space of "umap" by "space", without modifying
* the dimension of "umap", i.e., the number of parameters of "umap".
*
* Since the hash values of the maps in the union map depend
* on the parameters, a new union map needs to be constructed.
*/
4198__isl_give isl_union_map *isl_union_map_reset_equal_dim_space(
__isl_take isl_union_map *umap, __isl_take isl_space *space)
4200{
struct isl_union_map_reset_params_data data = { space };
isl_bool equal;
isl_space *umap_space;

umap_space = isl_union_map_peek_space(umap);
equal = isl_space_is_equal(umap_space, space);
if (equal < 0)
goto error;
if (equal) {
isl_space_free(space);
return umap;
}
if (check_union_map_space_equal_dim(umap, space) < 0)
goto error;

data.res = isl_union_map_empty(isl_space_copy(space));
if (isl_union_map_foreach_map(umap, &reset_params, &data) < 0)
data.res = isl_union_map_free(data.res);

isl_space_free(space);
isl_union_map_free(umap);
return data.res;
4223error:
isl_union_map_free(umap);
isl_space_free(space);
return NULL((void*)0);
4227}

4229/* Internal data structure for isl_union_map_order_at_multi_union_pw_aff.
* "mupa" is the function from which the isl_multi_pw_affs are extracted.
* "order" is applied to the extracted isl_multi_pw_affs that correspond
* to the domain and the range of each map.
* "res" collects the results.
*/
4235struct isl_union_order_at_data {
isl_multi_union_pw_aff *mupa;
__isl_give isl_map *(*order)(__isl_take isl_multi_pw_aff *mpa1,
__isl_take isl_multi_pw_aff *mpa2);
isl_union_map *res;
4240};

4242/* Intersect "map" with the result of applying data->order to
* the functions in data->mupa that apply to the domain and the range
* of "map" and add the result to data->res.
*/
4246static isl_stat order_at(__isl_take isl_map *map, void *user)
4247{
struct isl_union_order_at_data *data = user;
isl_space *space;
isl_multi_pw_aff *mpa1, *mpa2;
isl_map *order;

space = isl_space_domain(isl_map_get_space(map));
mpa1 = isl_multi_union_pw_aff_extract_multi_pw_aff(data->mupa, space);
space = isl_space_range(isl_map_get_space(map));
mpa2 = isl_multi_union_pw_aff_extract_multi_pw_aff(data->mupa, space);
order = data->order(mpa1, mpa2);
map = isl_map_intersect(map, order);
data->res = isl_union_map_add_map(data->res, map);

return data->res ? isl_stat_ok : isl_stat_error;
4262}

4264/* If "mupa" has a non-trivial explicit domain, then intersect
* domain and range of "umap" with this explicit domain.
* If the explicit domain only describes constraints on the parameters,
* then the intersection only needs to be performed once.
*/
4269static __isl_give isl_union_map *intersect_explicit_domain(
__isl_take isl_union_map *umap, __isl_keep isl_multi_union_pw_aff *mupa)
4271{
isl_bool non_trivial, is_params;
isl_union_setisl_union_map *dom;

non_trivial = isl_multi_union_pw_aff_has_non_trivial_domain(mupa);
if (non_trivial < 0)
return isl_union_map_free(umap);
if (!non_trivial)
return umap;
mupa = isl_multi_union_pw_aff_copy(mupa);
dom = isl_multi_union_pw_aff_domain(mupa);
is_params = isl_union_set_is_params(dom);
if (is_params < 0) {
isl_union_set_free(dom);
return isl_union_map_free(umap);
}
if (is_params) {
isl_setisl_map *set;

set = isl_union_set_params(dom);
umap = isl_union_map_intersect_params(umap, set);
return umap;
}
umap = isl_union_map_intersect_domain(umap, isl_union_set_copy(dom));
umap = isl_union_map_intersect_range(umap, dom);
return umap;
4297}

4299/* Intersect each map in "umap" with the result of calling "order"
* on the functions is "mupa" that apply to the domain and the range
* of the map.
*/
4303static __isl_give isl_union_map *isl_union_map_order_at_multi_union_pw_aff(
__isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa,
__isl_give isl_map *(*order)(__isl_take isl_multi_pw_aff *mpa1,
__isl_take isl_multi_pw_aff *mpa2))
4307{
struct isl_union_order_at_data data;

umap = isl_union_map_align_params(umap,
		isl_multi_union_pw_aff_get_space(mupa));
mupa = isl_multi_union_pw_aff_align_params(mupa,
		isl_union_map_get_space(umap));
umap = intersect_explicit_domain(umap, mupa);
data.mupa = mupa;
data.order = order;
data.res = isl_union_map_empty(isl_union_map_get_space(umap));
if (isl_union_map_foreach_map(umap, &order_at, &data) < 0)
data.res = isl_union_map_free(data.res);

isl_multi_union_pw_aff_free(mupa);
isl_union_map_free(umap);
return data.res;
4324}

4326/* Return the subset of "umap" where the domain and the range
* have equal "mupa" values.
*/
4329__isl_give isl_union_map *isl_union_map_eq_at_multi_union_pw_aff(
__isl_take isl_union_map *umap,
__isl_take isl_multi_union_pw_aff *mupa)
4332{
return isl_union_map_order_at_multi_union_pw_aff(umap, mupa,
				&isl_multi_pw_aff_eq_map);
4335}

4337#undef ORDERgt
4338#define ORDERgt		le
4339#include "isl_union_map_lex_templ.c"

4341#undef ORDERgt
4342#define ORDERgt		lt
4343#include "isl_union_map_lex_templ.c"

4345#undef ORDERgt
4346#define ORDERgt		ge
4347#include "isl_union_map_lex_templ.c"

4349#undef ORDERgt
4350#define ORDERgt		gt
4351#include "isl_union_map_lex_templ.c"

4353/* Return the union of the elements in the list "list".
*/
4355__isl_give isl_union_setisl_union_map *isl_union_set_list_union(
__isl_take isl_union_set_listisl_union_map_list *list)
4357{
int i;
isl_size n;
isl_ctx *ctx;
isl_space *space;
isl_union_setisl_union_map *res;

n = isl_union_set_list_n_union_set(list);
if (n < 0)
goto error;

ctx = isl_union_set_list_get_ctx(list);
space = isl_space_params_alloc(ctx, 0);
res = isl_union_set_empty(space);

for (i = 0; i < n; ++i) {
isl_union_setisl_union_map *uset_i;

uset_i = isl_union_set_list_get_union_set(list, i);
res = isl_union_set_union(res, uset_i);
}

isl_union_set_list_free(list);
return res;
4381error:
isl_union_set_list_free(list);
return NULL((void*)0);
4384}

4386/* Update *hash with the hash value of "map".
*/
4388static isl_stat add_hash(__isl_take isl_map *map, void *user)
4389{
uint32_t *hash = user;
uint32_t map_hash;

map_hash = isl_map_get_hash(map);
isl_hash_hash(*hash, map_hash)do { do { *hash *= 16777619; *hash ^= (map_hash) & 0xFF; }
 while(0); do { *hash *= 16777619; *hash ^= ((map_hash) >>
 8) & 0xFF; } while(0); do { *hash *= 16777619; *hash ^= (
(map_hash) >> 16) & 0xFF; } while(0); do { *hash *=
 16777619; *hash ^= ((map_hash) >> 24) & 0xFF; } while
(0); } while(0);

isl_map_free(map);
return isl_stat_ok;
4398}

4400/* Return a hash value that digests "umap".
*/
4402uint32_t isl_union_map_get_hash(__isl_keep isl_union_map *umap)
4403{
uint32_t hash;

if (!umap)
return 0;

hash = isl_hash_init()(2166136261u);
if (isl_union_map_foreach_map(umap, &add_hash, &hash) < 0)
return 0;

return hash;
4414}

4416/* Return a hash value that digests "uset".
*/
4418uint32_t isl_union_set_get_hash(__isl_keep isl_union_setisl_union_map *uset)
4419{
return isl_union_map_get_hash(uset);
4421}

4423/* Add the number of basic sets in "set" to "n".
*/
4425static isl_stat add_n(__isl_take isl_setisl_map *set, void *user)
4426{
int *n = user;
isl_size set_n;

set_n = isl_set_n_basic_set(set);
*n += set_n;
isl_set_free(set);

return set_n < 0 ? isl_stat_error : isl_stat_ok;
4435}

4437/* Return the total number of basic sets in "uset".
*/
4439int isl_union_set_n_basic_set(__isl_keep isl_union_setisl_union_map *uset)
4440{
int n = 0;

if (isl_union_set_foreach_set(uset, &add_n, &n) < 0)
return -1;

return n;
4447}

4449/* Add the basic sets in "set" to "list".
*/
4451static isl_stat add_list(__isl_take isl_setisl_map *set, void *user)
4452{
isl_basic_set_listisl_basic_map_list **list = user;
isl_basic_set_listisl_basic_map_list *list_i;

list_i = isl_set_get_basic_set_list(set);
*list = isl_basic_set_list_concat(*list, list_i);
isl_set_free(set);

if (!*list)
return isl_stat_error;
return isl_stat_ok;
4463}

4465/* Return a list containing all the basic sets in "uset".
*
* First construct a list of the appropriate size and
* then add all the elements.
*/
4470__isl_give isl_basic_set_listisl_basic_map_list *isl_union_set_get_basic_set_list(
__isl_keep isl_union_setisl_union_map *uset)
4472{
int n;
isl_ctx *ctx;
isl_basic_set_listisl_basic_map_list *list;

if (!uset)
return NULL((void*)0);
ctx = isl_union_set_get_ctx(uset);
n = isl_union_set_n_basic_set(uset);
if (n < 0)
return NULL((void*)0);
list = isl_basic_set_list_alloc(ctx, n);
if (isl_union_set_foreach_set(uset, &add_list, &list) < 0)
list = isl_basic_set_list_free(list);

return list;
4488}

4490/* Internal data structure for isl_union_map_remove_map_if.
* "fn" and "user" are the arguments to isl_union_map_remove_map_if.
*/
4493struct isl_union_map_remove_map_if_data {
isl_bool (*fn)(__isl_keep isl_map *map, void *user);
void *user;
4496};

4498/* isl_un_op_control filter that negates the result of data->fn
* called on "map".
*/
4501static isl_bool not(__isl_keep isl_map *map, void *user)
4502{
struct isl_union_map_remove_map_if_data *data = user;

return isl_bool_not(data->fn(map, data->user));
4506}

4508/* Dummy isl_un_op_control transformation callback that
* simply returns the input.
*/
4511static __isl_give isl_map *map_id(__isl_take isl_map *map)
4512{
return map;
4514}

4516/* Call "fn" on every map in "umap" and remove those maps
* for which the callback returns true.
*
* Use un_op to keep only those maps that are not filtered out,
* applying an identity transformation on them.
*/
4522__isl_give isl_union_map *isl_union_map_remove_map_if(
__isl_take isl_union_map *umap,
isl_bool (*fn)(__isl_keep isl_map *map, void *user), void *user)
4525{
struct isl_union_map_remove_map_if_data data = { fn, user };
struct isl_un_op_control control = {
.filter = &not,
.filter_user = &data,
.fn_map = &map_id,
};
return un_op(umap, &control);
4533}

4535/* Does "map" have "space" as domain (ignoring parameters)?
*/
4537static isl_bool has_domain_space_tuples(__isl_keep isl_map *map, void *user)
4538{
isl_space *space = user;

return isl_space_has_domain_tuples(space, isl_map_peek_space(map));
4542}

4544/* Does "map" have "space" as range (ignoring parameters)?
*/
4546static isl_bool has_range_space_tuples(__isl_keep isl_map *map, void *user)
4547{
isl_space *space = user;

return isl_space_has_range_tuples(space, isl_map_peek_space(map));
4551}

4553/* Wrapper around isl_map_bind_range for use as a un_op callback.
*/
4555static __isl_give isl_map *bind_range(__isl_take isl_map *map, void *user)
4556{
isl_multi_id *tuple = user;

return isl_map_bind_range(map, isl_multi_id_copy(tuple));
4560}

4562/* Bind the output dimensions of "umap" to parameters with identifiers
* specified by "tuple", living in the range space of "umap",
* for those maps that have a matching range space.
*/
4566__isl_give isl_union_setisl_union_map *isl_union_map_bind_range(
__isl_take isl_union_map *umap, __isl_take isl_multi_id *tuple)
4568{
struct isl_un_op_control control = {
.filter = &has_range_space_tuples,
.filter_user = isl_multi_id_peek_space(tuple),
.fn_map2 = &bind_range,
.fn_map2_user = tuple,
};
isl_union_setisl_union_map *bound;

bound = uset_from_umap(un_op(umap, &control));
isl_multi_id_free(tuple);
return bound;
4580}

4582/* Only keep those elements in "umap" that have a domain in "space".
*/
4584__isl_give isl_union_map *isl_union_map_intersect_domain_space(
__isl_take isl_union_map *umap, __isl_take isl_space *space)
4586{
struct isl_un_op_control control = {
.filter = &has_domain_space_tuples,
.filter_user = space,
};

umap = un_op(umap, &control);
isl_space_free(space);
return umap;
4595}

4597/* Only keep those elements in "umap" that have a range in "space".
*/
4599__isl_give isl_union_map *isl_union_map_intersect_range_space(
__isl_take isl_union_map *umap, __isl_take isl_space *space)
4601{
struct isl_un_op_control control = {
.filter = &has_range_space_tuples,
.filter_user = space,
};

umap = un_op(umap, &control);
isl_space_free(space);
return umap;
4610}