/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union

Bug Summary

File:	tools/polly/lib/External/isl/isl_union_map.c
Warning:	line 1102, column 9 Use of memory after it is freed
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name isl_union_map.c -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-eagerly-assume -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 -mrelocation-model pic -pic-level 2 -mthread-model posix -fmath-errno -masm-verbose -mconstructor-aliases -munwind-tables -fuse-init-array -target-cpu x86-64 -dwarf-column-info -debugger-tuning=gdb -momit-leaf-frame-pointer -ffunction-sections -fdata-sections -resource-dir /usr/lib/llvm-7/lib/clang/7.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/polly/lib/External -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/pet/include -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/ppcg/include -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/ppcg/imath -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/polly/lib/External/ppcg -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/include -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/imath -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/polly/lib/External/isl -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/polly/include -I /usr/include/jsoncpp -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/polly/lib/External/isl/include -I /build/llvm-toolchain-snapshot-7~svn329677/tools/polly/include -I /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/include -I /build/llvm-toolchain-snapshot-7~svn329677/include -U NDEBUG -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-7/lib/clang/7.0.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=gnu99 -fconst-strings -fdebug-compilation-dir /build/llvm-toolchain-snapshot-7~svn329677/build-llvm/tools/polly/lib/External -fdebug-prefix-map=/build/llvm-toolchain-snapshot-7~svn329677=. -ferror-limit 19 -fmessage-length 0 -stack-protector 2 -fobjc-runtime=gcc -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-checker optin.performance.Padding -analyzer-output=html -analyzer-config stable-report-filename=true -o /tmp/scan-build-2018-04-11-031539-24776-1 -x c /build/llvm-toolchain-snapshot-7~svn329677/tools/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#define ISL_DIM_H
17#include <isl_map_private.h>
18#include <isl_union_map_private.h>
19#include <isl/ctx.h>
20#include <isl/hash.h>
21#include <isl/aff.h>
22#include <isl/map.h>
23#include <isl/set.h>
24#include <isl_space_private.h>
25#include <isl/union_set.h>
26#include <isl_maybe_map.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>

33/* Return the number of parameters of "umap", where "type"
* is required to be set to isl_dim_param.
*/
36unsigned isl_union_map_dim(__isl_keep isl_union_map *umap,
enum isl_dim_type type)
38{
if (!umap)
return 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 44); return 0; } while (0)
	"can only reference parameters", return 0)do { isl_handle_error(isl_union_map_get_ctx(umap), isl_error_invalid
, "can only reference parameters", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 44); return 0; } while (0);

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

49/* Return the number of parameters of "uset", where "type"
* is required to be set to isl_dim_param.
*/
52unsigned isl_union_set_dim(__isl_keep isl_union_setisl_union_map *uset,
enum isl_dim_type type)
54{
return isl_union_map_dim(uset, type);
56}

58/* Return the id of the specified dimension.
*/
60__isl_give isl_id *isl_union_map_get_dim_id(__isl_keep isl_union_map *umap,
enum isl_dim_type type, unsigned pos)
62{
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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 68); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 68); return ((void*)0); } while (0);

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

73/* Is this union set a parameter domain?
*/
75isl_bool isl_union_set_is_params(__isl_keep isl_union_setisl_union_map *uset)
76{
isl_setisl_map *set;
isl_bool params;

if (!uset)
2
←
Assuming 'uset' is non-null→
3
←
Taking false branch→
return isl_bool_error;
if (uset->table.n != 1)
4
←
Assuming the condition is false→
5
←
Taking false branch→
return isl_bool_false;

set = isl_set_from_union_set(isl_union_set_copy(uset));
6
←
Calling 'isl_set_from_union_set'→
17
←
Returning; memory was released via 1st parameter→
params = isl_set_is_params(set);
isl_set_free(set);
return params;
89}

91static __isl_give isl_union_map *isl_union_map_alloc(
__isl_take isl_space *space, int size)
93{
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;
112}

114__isl_give isl_union_map *isl_union_map_empty(__isl_take isl_space *space)
115{
return isl_union_map_alloc(space, 16);
117}

119__isl_give isl_union_setisl_union_map *isl_union_set_empty(__isl_take isl_space *space)
120{
return isl_union_map_empty(space);
122}

124isl_ctx *isl_union_map_get_ctx(__isl_keep isl_union_map *umap)
125{
return umap ? umap->dim->ctx : NULL((void*)0);
127}

129isl_ctx *isl_union_set_get_ctx(__isl_keep isl_union_setisl_union_map *uset)
130{
return uset ? uset->dim->ctx : NULL((void*)0);
132}

134/* Return the space of "umap".
*/
136__isl_keep isl_space *isl_union_map_peek_space(__isl_keep isl_union_map *umap)
137{
return umap ? umap->dim : NULL((void*)0);
139}

141__isl_give isl_space *isl_union_map_get_space(__isl_keep isl_union_map *umap)
142{
return isl_space_copy(isl_union_map_peek_space(umap));
144}

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

158__isl_give isl_space *isl_union_set_get_space(__isl_keep isl_union_setisl_union_map *uset)
159{
return isl_union_map_get_space(uset);
161}

163static isl_stat free_umap_entry(void **entry, void *user)
164{
isl_map *map = *entry;
isl_map_free(map);
return isl_stat_ok;
168}

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

*umap = isl_union_map_add_map(*umap, map);

return isl_stat_ok;
177}

179__isl_give isl_union_map *isl_union_map_dup(__isl_keep isl_union_map *umap)
180{
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;
190error:
isl_union_map_free(dup);
return NULL((void*)0);
193}

195__isl_give isl_union_map *isl_union_map_cow(__isl_take isl_union_map *umap)
196{
if (!umap)
return NULL((void*)0);

if (umap->ref == 1)
return umap;
umap->ref--;
return isl_union_map_dup(umap);
204}

206struct isl_union_align {
isl_reordering *exp;
isl_union_map *res;
209};

211static isl_stat align_entry(void **entry, void *user)
212{
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;
224}

226/* 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.
*/
231__isl_give isl_union_map *isl_union_map_align_params(
__isl_take isl_union_map *umap, __isl_take isl_space *model)
233{
struct isl_union_align data = { NULL((void*)0), NULL((void*)0) };
isl_bool equal_params;

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

equal_params = isl_space_has_equal_params(umap->dim, model);
if (equal_params < 0)
goto error;
if (equal_params) {
isl_space_free(model);
return umap;
}

model = isl_space_params(model);
data.exp = isl_parameter_alignment_reordering(umap->dim, model);
if (!data.exp)
goto error;

data.res = isl_union_map_alloc(isl_space_copy(data.exp->dim),
			umap->table.n);
if (isl_hash_table_foreach(umap->dim->ctx, &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;
263error:
isl_reordering_free(data.exp);
isl_union_map_free(umap);
isl_union_map_free(data.res);
isl_space_free(model);
return NULL((void*)0);
269}

271__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)
273{
return isl_union_map_align_params(uset, model);
275}

277__isl_give isl_union_map *isl_union_map_union(__isl_take isl_union_map *umap1,
__isl_take isl_union_map *umap2)
279{
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;
294error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
return NULL((void*)0);
298}

300__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)
302{
return isl_union_map_union(uset1, uset2);
304}

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

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

315__isl_give isl_union_setisl_union_map *isl_union_set_copy(__isl_keep isl_union_setisl_union_map *uset)
316{
return isl_union_map_copy(uset);
318}

320__isl_null isl_union_map *isl_union_map_free(__isl_take isl_union_map *umap)
321{
if (!umap)
11
←
Taking false branch→
return NULL((void*)0);

if (--umap->ref > 0)
12
←
Assuming the condition is false→
13
←
Taking false branch→
return NULL((void*)0);

isl_hash_table_foreach(umap->dim->ctx, &umap->table,
	       &free_umap_entry, NULL((void*)0));
isl_hash_table_clear(&umap->table);
isl_space_free(umap->dim);
free(umap);
14
←
Memory is released→
return NULL((void*)0);
334}

336__isl_null isl_union_setisl_union_map *isl_union_set_free(__isl_take isl_union_setisl_union_map *uset)
337{
return isl_union_map_free(uset);
339}

341/* Do "umap" and "space" have the same parameters?
*/
343isl_bool isl_union_map_space_has_equal_params(__isl_keep isl_union_map *umap,
__isl_keep isl_space *space)
345{
isl_space *umap_space;

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

352/* Do "uset" and "space" have the same parameters?
*/
354isl_bool isl_union_set_space_has_equal_params(__isl_keep isl_union_setisl_union_map *uset,
__isl_keep isl_space *space)
356{
return isl_union_map_space_has_equal_params(uset_to_umap(uset), space);
358}

360static int has_space(const void *entry, const void *val)
361{
isl_map *map = (isl_map *)entry;
isl_space *space = (isl_space *) val;

return isl_space_is_equal(map->dim, space);
366}

368__isl_give isl_union_map *isl_union_map_add_map(__isl_take isl_union_map *umap,
__isl_take isl_map *map)
370{
uint32_t hash;
struct isl_hash_table_entry *entry;
isl_bool aligned;

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);

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

hash = isl_space_get_hash(map->dim);
entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
		    &has_space, map->dim, 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;
412error:
isl_map_free(map);
isl_union_map_free(umap);
return NULL((void*)0);
416}

418__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)
420{
return isl_union_map_add_map(uset, set_to_map(set));
422}

424__isl_give isl_union_map *isl_union_map_from_map(__isl_take isl_map *map)
425{
isl_space *dim;
isl_union_map *umap;

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

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

return umap;
438}

440__isl_give isl_union_setisl_union_map *isl_union_set_from_set(__isl_take isl_setisl_map *set)
441{
return isl_union_map_from_map(set_to_map(set));
443}

445__isl_give isl_union_map *isl_union_map_from_basic_map(
__isl_take isl_basic_map *bmap)
447{
return isl_union_map_from_map(isl_map_from_basic_map(bmap));
449}

451__isl_give isl_union_setisl_union_map *isl_union_set_from_basic_set(
__isl_take isl_basic_setisl_basic_map *bset)
453{
return isl_union_map_from_basic_map(bset);
455}

457struct isl_union_map_foreach_data
458{
isl_stat (*fn)(__isl_take isl_map *map, void *user);
void *user;
461};

463static isl_stat call_on_copy(void **entry, void *user)
464{
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);
470}

472int isl_union_map_n_map(__isl_keep isl_union_map *umap)
473{
return umap ? umap->table.n : 0;
475}

477int isl_union_set_n_set(__isl_keep isl_union_setisl_union_map *uset)
478{
return uset ? uset->table.n : 0;
480}

482isl_stat isl_union_map_foreach_map(__isl_keep isl_union_map *umap,
isl_stat (*fn)(__isl_take isl_map *map, void *user), void *user)
484{
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);
492}

494/* 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.
*/
502struct isl_union_map_every_data {
isl_bool (*test)(__isl_keep isl_map *map, void *user);
void *user;
int failed;
506};

508/* Call data->test on "map".
* If this fails, then set data->failed and abort.
*/
511static isl_stat call_every(void **entry, void *user)
512{
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;
524}

526/* Does "test" succeed on every map in "umap"?
*/
528isl_bool isl_union_map_every_map(__isl_keep isl_union_map *umap,
isl_bool (*test)(__isl_keep isl_map *map, void *user), void *user)
530{
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;
544}

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

*map_p = isl_map_copy(map);

return isl_stat_error;
554}

556__isl_give isl_map *isl_map_from_union_map(__isl_take isl_union_map *umap)
557{
isl_ctx *ctx;
isl_map *map = NULL((void*)0);

if (!umap)
8
←
Taking false branch→
return NULL((void*)0);
ctx = isl_union_map_get_ctx(umap);
if (umap->table.n != 1)
9
←
Taking false branch→
isl_die(ctx, isl_error_invalid,do { isl_handle_error(ctx, isl_error_invalid, "union map needs to contain elements in exactly "
 "one space", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 567); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 567); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 567); goto error; } while (0);

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

isl_union_map_free(umap);
10
←
Calling 'isl_union_map_free'→
15
←
Returning; memory was released via 1st parameter→

return map;
574error:
isl_union_map_free(umap);
return NULL((void*)0);
577}

579__isl_give isl_setisl_map *isl_set_from_union_set(__isl_take isl_union_setisl_union_map *uset)
580{
return isl_map_from_union_map(uset);
7
←
Calling 'isl_map_from_union_map'→
16
←
Returning; memory was released via 1st parameter→
582}

584/* Extract the map in "umap" that lives in the given space (ignoring
* parameters).
*/
587__isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap,
__isl_take isl_space *space)
589{
uint32_t hash;
struct isl_hash_table_entry *entry;

space = isl_space_drop_dims(space, isl_dim_param,
			0, isl_space_dim(space, isl_dim_param));
space = isl_space_align_params(space, isl_union_map_get_space(umap));
if (!umap || !space)
goto error;

hash = isl_space_get_hash(space);
entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
		    &has_space, space, 0);
if (!entry)
return isl_map_empty(space);
isl_space_free(space);
return isl_map_copy(entry->data);
606error:
isl_space_free(space);
return NULL((void*)0);
609}

611__isl_give isl_setisl_map *isl_union_set_extract_set(__isl_keep isl_union_setisl_union_map *uset,
__isl_take isl_space *dim)
613{
return set_from_map(isl_union_map_extract_map(uset, dim));
615}

617/* Check if umap contains a map in the given space.
*/
619isl_bool isl_union_map_contains(__isl_keep isl_union_map *umap,
__isl_keep isl_space *space)
621{
uint32_t hash;
struct isl_hash_table_entry *entry;

if (!umap || !space)
return isl_bool_error;

hash = isl_space_get_hash(space);
entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
		    &has_space, space, 0);
return !!entry;
632}

634isl_bool isl_union_set_contains(__isl_keep isl_union_setisl_union_map *uset,
__isl_keep isl_space *space)
636{
return isl_union_map_contains(uset, space);
638}

640isl_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)
642{
return isl_union_map_foreach_map(uset,
(isl_stat(*)(__isl_take isl_map *, void*))fn, user);
645}

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

652static isl_stat foreach_point(__isl_take isl_setisl_map *set, void *user)
653{
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;
661}

663isl_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)
665{
struct isl_union_set_foreach_point_data data = { fn, user };
return isl_union_set_foreach_set(uset, &foreach_point, &data);
668}

670/* 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.
*/
687struct 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);
693};

695/* 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.
*/
700struct isl_union_map_gen_bin_data {
struct isl_bin_op_control *control;
isl_union_map *umap2;
isl_union_map *res;
704};

706/* Add a copy of "map" to "res" and return the result.
*/
708static __isl_give isl_union_map *bin_add_map(__isl_take isl_union_map *res,
__isl_keep isl_map *map)
710{
return isl_union_map_add_map(res, isl_map_copy(map));
712}

714/* Combine "map1" and "map2", add the result to "res" and return the result.
* Check whether the result is empty before adding it to "res".
*/
717static __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)
720{
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);
733}

735/* Dummy match_space function that simply returns the input space.
*/
737static __isl_give isl_space *identity(__isl_take isl_space *space)
738{
return space;
740}

742/* 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".
*/
752static __isl_keep isl_maybe_isl_map bin_try_get_match(
struct isl_union_map_gen_bin_data *data, __isl_keep isl_map *map)
754{
uint32_t hash;
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);
if (!space)
return res;
hash = isl_space_get_hash(space);
entry2 = isl_hash_table_find(isl_union_map_get_ctx(data->umap2),
		     &data->umap2->table, hash,
		     &has_space, space, 0);
isl_space_free(space);
res.valid = entry2 != NULL((void*)0);
if (entry2)
res.value = entry2->data;

return res;
782}

784/* 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.
*/
793static isl_stat gen_bin_entry(void **entry, void *user)
794{
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;
813}

815/* 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.
*/
819static __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)
821{
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;
840error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
isl_union_map_free(data.res);
return NULL((void*)0);
845}

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

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

859__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)
861{
return isl_union_map_subtract(uset1, uset2);
863}

865struct isl_union_map_gen_bin_set_data {
isl_setisl_map *set;
isl_union_map *res;
868};

870static isl_stat intersect_params_entry(void **entry, void *user)
871{
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;
888}

890static __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 *))
892{
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;
911error:
isl_union_map_free(umap);
isl_set_free(set);
isl_union_map_free(data.res);
return NULL((void*)0);
916}

918/* Intersect "umap" with the parameter domain "set".
*
* If "set" does not have any constraints, then we can return immediately.
*/
922__isl_give isl_union_map *isl_union_map_intersect_params(
__isl_take isl_union_map *umap, __isl_take isl_setisl_map *set)
924{
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);
936error:
isl_union_map_free(umap);
isl_set_free(set);
return NULL((void*)0);
940}

942__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)
944{
return isl_union_map_intersect_params(uset, set);
946}

948static __isl_give isl_union_map *union_map_intersect_params(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
950{
return isl_union_map_intersect_params(umap,
				isl_set_from_union_set(uset));
953}

955static __isl_give isl_union_map *union_map_gist_params(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
957{
return isl_union_map_gist_params(umap, isl_set_from_union_set(uset));
959}

961struct 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*);
965};

967static isl_stat match_bin_entry(void **entry, void *user)
968{
struct isl_union_map_match_bin_data *data = user;
uint32_t hash;
struct isl_hash_table_entry *entry2;
isl_map *map = *entry;
int empty;

hash = isl_space_get_hash(map->dim);
entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
		     hash, &has_space, map->dim, 0);
if (!entry2)
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;
997}

999static __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*))
1002{
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;
1021error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
isl_union_map_free(data.res);
return NULL((void*)0);
1026}

1028__isl_give isl_union_map *isl_union_map_intersect(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1030{
return match_bin_op(umap1, umap2, &isl_map_intersect);
1032}

1034/* 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.
*/
1039__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)
1041{
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);
1053error:
isl_union_set_free(uset1);
isl_union_set_free(uset2);
return NULL((void*)0);
1057}

1059static isl_stat gist_params_entry(void **entry, void *user)
1060{
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;
1077}

1079__isl_give isl_union_map *isl_union_map_gist_params(
__isl_take isl_union_map *umap, __isl_take isl_setisl_map *set)
1081{
return gen_bin_set_op(umap, set, &gist_params_entry);
1083}

1085__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)
1087{
return isl_union_map_gist_params(uset, set);
1089}

1091__isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap,
__isl_take isl_union_map *context)
1093{
return match_bin_op(umap, context, &isl_map_gist);
1095}

1097__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)
1099{
if (isl_union_set_is_params(context))
1
Calling 'isl_union_set_is_params'→
18
←
Returning; memory was released via 1st parameter→
19
←
Assuming the condition is false→
20
←
Taking false branch→
return union_map_gist_params(uset, context);
return isl_union_map_gist(uset, context);
21
←
Use of memory after it is freed
1103}

1105/* 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.
*/
1110__isl_give isl_union_map *isl_union_map_plain_gist(
__isl_take isl_union_map *umap, __isl_take isl_union_map *context)
1112{
return match_bin_op(umap, context, &isl_map_plain_gist);
1114}

1116/* 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.
*/
1121__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)
1123{
return isl_union_map_plain_gist(uset, context);
1125}

1127static __isl_give isl_map *lex_le_set(__isl_take isl_map *set1,
__isl_take isl_map *set2)
1129{
return isl_set_lex_le_set(set_from_map(set1), set_from_map(set2));
1131}

1133static __isl_give isl_map *lex_lt_set(__isl_take isl_map *set1,
__isl_take isl_map *set2)
1135{
return isl_set_lex_lt_set(set_from_map(set1), set_from_map(set2));
1137}

1139__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)
1141{
return match_bin_op(uset1, uset2, &lex_lt_set);
1143}

1145__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)
1147{
return match_bin_op(uset1, uset2, &lex_le_set);
1149}

1151__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)
1153{
return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2, uset1));
1155}

1157__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)
1159{
return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2, uset1));
1161}

1163__isl_give isl_union_map *isl_union_map_lex_gt_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1165{
return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2, umap1));
1167}

1169__isl_give isl_union_map *isl_union_map_lex_ge_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1171{
return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2, umap1));
1173}

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

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

1188/* Intersect the domain of "umap" with "uset".
* If "uset" is a parameters domain, then intersect the parameter
* domain of "umap" with this set.
*/
1192__isl_give isl_union_map *isl_union_map_intersect_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1194{
if (isl_union_set_is_params(uset))
return union_map_intersect_params(umap, uset);
else
return union_map_intersect_domain(umap, uset);
1199}

1201/* Remove the elements of "uset" from the domain of "umap".
*/
1203__isl_give isl_union_map *isl_union_map_subtract_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *dom)
1205{
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);
1213}

1215/* Remove the elements of "uset" from the range of "umap".
*/
1217__isl_give isl_union_map *isl_union_map_subtract_range(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *dom)
1219{
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);
1227}

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

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

1242/* 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.
*/
1246__isl_give isl_union_map *isl_union_map_gist_domain(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1248{
if (isl_union_set_is_params(uset))
return union_map_gist_params(umap, uset);
else
return union_map_gist_domain(umap, uset);
1253}

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

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

1268__isl_give isl_union_map *isl_union_map_intersect_range(
__isl_take isl_union_map *umap, __isl_take isl_union_setisl_union_map *uset)
1270{
struct isl_bin_op_control control = {
.match_space = &isl_space_range,
.fn_map = &isl_map_intersect_range,
};

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

1279/* 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.
*/
1283__isl_give isl_union_map *isl_union_map_intersect_range_factor_range(
__isl_take isl_union_map *umap, __isl_take isl_union_map *factor)
1285{
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);
1293}

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

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

if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out,
		 map2->dim, isl_dim_in))
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;
1327}

1329static isl_stat bin_entry(void **entry, void *user)
1330{
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;
1340}

1342static __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))
1345{
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;
1364error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
isl_union_map_free(data.res);
return NULL((void*)0);
1369}

1371__isl_give isl_union_map *isl_union_map_apply_range(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1373{
return bin_op(umap1, umap2, &apply_range_entry);
1375}

1377__isl_give isl_union_map *isl_union_map_apply_domain(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1379{
umap1 = isl_union_map_reverse(umap1);
umap1 = isl_union_map_apply_range(umap1, umap2);
return isl_union_map_reverse(umap1);
1383}

1385__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)
1387{
return isl_union_map_apply_range(uset, umap);
1389}

1391static isl_stat map_lex_lt_entry(void **entry, void *user)
1392{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;

if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out,
		 map2->dim, isl_dim_out))
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;
1405}

1407__isl_give isl_union_map *isl_union_map_lex_lt_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1409{
return bin_op(umap1, umap2, &map_lex_lt_entry);
1411}

1413static isl_stat map_lex_le_entry(void **entry, void *user)
1414{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;

if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out,
		 map2->dim, isl_dim_out))
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;
1427}

1429__isl_give isl_union_map *isl_union_map_lex_le_union_map(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1431{
return bin_op(umap1, umap2, &map_lex_le_entry);
1433}

1435static isl_stat product_entry(void **entry, void *user)
1436{
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;
1445}

1447__isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1,
__isl_take isl_union_map *umap2)
1449{
return bin_op(umap1, umap2, &product_entry);
1451}

1453static isl_stat set_product_entry(void **entry, void *user)
1454{
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;
1463}

1465__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)
1467{
return bin_op(uset1, uset2, &set_product_entry);
1469}

1471static isl_stat domain_product_entry(void **entry, void *user)
1472{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;

if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out,
		 map2->dim, isl_dim_out))
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;
1486}

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

1496static isl_stat range_product_entry(void **entry, void *user)
1497{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;

if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_in,
		 map2->dim, isl_dim_in))
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;
1511}

1513__isl_give isl_union_map *isl_union_map_range_product(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1515{
return bin_op(umap1, umap2, &range_product_entry);
1517}

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

if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out,
		 map2->dim, isl_dim_out))
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;
1537}

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

1547static isl_stat flat_range_product_entry(void **entry, void *user)
1548{
struct isl_union_map_bin_data *data = user;
isl_map *map2 = *entry;

if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_in,
		 map2->dim, isl_dim_in))
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;
1562}

1564__isl_give isl_union_map *isl_union_map_flat_range_product(
__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1566{
return bin_op(umap1, umap2, &flat_range_product_entry);
1568}

1570/* 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.
* "fn_map" specifies how the maps (selected by "filter")
* should be transformed.
*/
1587struct 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);
1593};

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

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

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

1621/* 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 and either add the result to data->res or
* replace the original entry by the result (if control->inplace is set).
*/
1629static isl_stat un_entry(void **entry, void *user)
1630{
struct isl_union_map_un_data *data = user;
isl_map *map = *entry;

if (data->control->filter) {
isl_bool ok;

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

map = data->control->fn_map(isl_map_copy(map));
if (!map)
return isl_stat_error;
if (data->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;
1657}

1659/* 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.
*/
1666static __isl_give isl_union_map *un_op(__isl_take isl_union_map *umap,
struct isl_un_op_control *control)
1668{
struct isl_union_map_un_data data = { control };

if (!umap)
return NULL((void*)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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 1676); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 1676); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 1676); 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;
1696}

1698__isl_give isl_union_map *isl_union_map_from_range(
__isl_take isl_union_setisl_union_map *uset)
1700{
struct isl_un_op_control control = {
.fn_map = &isl_map_from_range,
};
return un_op(uset, &control);
1705}

1707__isl_give isl_union_map *isl_union_map_from_domain(
__isl_take isl_union_setisl_union_map *uset)
1709{
return isl_union_map_reverse(isl_union_map_from_range(uset));
1711}

1713__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)
1715{
return isl_union_map_apply_range(isl_union_map_from_domain(domain),
		         isl_union_map_from_range(range));
1718}

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

return un_op(umap, &control);
1732}

1734/* Compute the affine hull of "map" and return the result as an isl_map.
*/
1736static __isl_give isl_map *isl_map_affine_hull_map(__isl_take isl_map *map)
1737{
return isl_map_from_basic_map(isl_map_affine_hull(map));
1739}

1741__isl_give isl_union_map *isl_union_map_affine_hull(
__isl_take isl_union_map *umap)
1743{
return total(umap, &isl_map_affine_hull_map);
1745}

1747__isl_give isl_union_setisl_union_map *isl_union_set_affine_hull(
__isl_take isl_union_setisl_union_map *uset)
1749{
return isl_union_map_affine_hull(uset);
1751}

1753/* 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.
*/
1757static __isl_give isl_setisl_map *combined_lineality_space(__isl_take isl_setisl_map *set)
1758{
return isl_set_from_basic_set(isl_set_combined_lineality_space(set));
1760}

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

1775/* Compute the polyhedral hull of "map" and return the result as an isl_map.
*/
1777static __isl_give isl_map *isl_map_polyhedral_hull_map(__isl_take isl_map *map)
1778{
return isl_map_from_basic_map(isl_map_polyhedral_hull(map));
1780}

1782__isl_give isl_union_map *isl_union_map_polyhedral_hull(
__isl_take isl_union_map *umap)
1784{
return total(umap, &isl_map_polyhedral_hull_map);
1786}

1788__isl_give isl_union_setisl_union_map *isl_union_set_polyhedral_hull(
__isl_take isl_union_setisl_union_map *uset)
1790{
return isl_union_map_polyhedral_hull(uset);
1792}

1794/* 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.
*/
1798static __isl_give isl_map *isl_map_simple_hull_map(__isl_take isl_map *map)
1799{
return isl_map_from_basic_map(isl_map_simple_hull(map));
1801}

1803__isl_give isl_union_map *isl_union_map_simple_hull(
__isl_take isl_union_map *umap)
1805{
return total(umap, &isl_map_simple_hull_map);
1807}

1809__isl_give isl_union_setisl_union_map *isl_union_set_simple_hull(
__isl_take isl_union_setisl_union_map *uset)
1811{
return isl_union_map_simple_hull(uset);
1813}

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

return un_op(umap, &control);
1824}

1826/* 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.
*/
1830__isl_give isl_union_map *isl_union_map_remove_redundancies(
__isl_take isl_union_map *umap)
1832{
return inplace(umap, &isl_map_remove_redundancies);
1834}

1836/* Remove redundant constraints in each of the basic sets of "uset".
*/
1838__isl_give isl_union_setisl_union_map *isl_union_set_remove_redundancies(
__isl_take isl_union_setisl_union_map *uset)
1840{
return isl_union_map_remove_redundancies(uset);
1842}

1844__isl_give isl_union_map *isl_union_map_coalesce(
__isl_take isl_union_map *umap)
1846{
return inplace(umap, &isl_map_coalesce);
1848}

1850__isl_give isl_union_setisl_union_map *isl_union_set_coalesce(
__isl_take isl_union_setisl_union_map *uset)
1852{
return isl_union_map_coalesce(uset);
1854}

1856__isl_give isl_union_map *isl_union_map_detect_equalities(
__isl_take isl_union_map *umap)
1858{
return inplace(umap, &isl_map_detect_equalities);
1860}

1862__isl_give isl_union_setisl_union_map *isl_union_set_detect_equalities(
__isl_take isl_union_setisl_union_map *uset)
1864{
return isl_union_map_detect_equalities(uset);
1866}

1868__isl_give isl_union_map *isl_union_map_compute_divs(
__isl_take isl_union_map *umap)
1870{
return inplace(umap, &isl_map_compute_divs);
1872}

1874__isl_give isl_union_setisl_union_map *isl_union_set_compute_divs(
__isl_take isl_union_setisl_union_map *uset)
1876{
return isl_union_map_compute_divs(uset);
1878}

1880__isl_give isl_union_map *isl_union_map_lexmin(
__isl_take isl_union_map *umap)
1882{
return total(umap, &isl_map_lexmin);
1884}

1886__isl_give isl_union_setisl_union_map *isl_union_set_lexmin(
__isl_take isl_union_setisl_union_map *uset)
1888{
return isl_union_map_lexmin(uset);
1890}

1892__isl_give isl_union_map *isl_union_map_lexmax(
__isl_take isl_union_map *umap)
1894{
return total(umap, &isl_map_lexmax);
1896}

1898__isl_give isl_union_setisl_union_map *isl_union_set_lexmax(
__isl_take isl_union_setisl_union_map *uset)
1900{
return isl_union_map_lexmax(uset);
1902}

1904/* Return the universe in the space of "map".
*/
1906static __isl_give isl_map *universe(__isl_take isl_map *map)
1907{
isl_space *space;

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

1915__isl_give isl_union_map *isl_union_map_universe(__isl_take isl_union_map *umap)
1916{
struct isl_un_op_control control = {
.fn_map = &universe,
};
return un_op(umap, &control);
1921}

1923__isl_give isl_union_setisl_union_map *isl_union_set_universe(__isl_take isl_union_setisl_union_map *uset)
1924{
return isl_union_map_universe(uset);
1926}

1928__isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap)
1929{
struct isl_un_op_control control = {
.fn_map = &isl_map_reverse,
};
return un_op(umap, &control);
1934}

1936/* Compute the parameter domain of the given union map.
*/
1938__isl_give isl_setisl_map *isl_union_map_params(__isl_take isl_union_map *umap)
1939{
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));
1955error:
isl_union_map_free(umap);
return NULL((void*)0);
1958}

1960/* Compute the parameter domain of the given union set.
*/
1962__isl_give isl_setisl_map *isl_union_set_params(__isl_take isl_union_setisl_union_map *uset)
1963{
return isl_union_map_params(uset);
1965}

1967__isl_give isl_union_setisl_union_map *isl_union_map_domain(__isl_take isl_union_map *umap)
1968{
struct isl_un_op_control control = {
.fn_map = &isl_map_domain,
};
return un_op(umap, &control);
1973}

1975__isl_give isl_union_setisl_union_map *isl_union_map_range(__isl_take isl_union_map *umap)
1976{
struct isl_un_op_control control = {
.fn_map = &isl_map_range,
};
return un_op(umap, &control);
1981}

1983__isl_give isl_union_map *isl_union_map_domain_map(
__isl_take isl_union_map *umap)
1985{
struct isl_un_op_control control = {
.fn_map = &isl_map_domain_map,
};
return un_op(umap, &control);
1990}

1992/* Construct an isl_pw_multi_aff that maps "map" to its domain and
* add the result to "res".
*/
1995static isl_stat domain_map_upma(__isl_take isl_map *map, void *user)
1996{
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;

2007}

2009/* Return an isl_union_pw_multi_aff that maps a wrapped copy of "umap"
* to its domain.
*/
2012__isl_give isl_union_pw_multi_aff *isl_union_map_domain_map_union_pw_multi_aff(
__isl_take isl_union_map *umap)
2014{
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;
2023}

2025__isl_give isl_union_map *isl_union_map_range_map(
__isl_take isl_union_map *umap)
2027{
struct isl_un_op_control control = {
.fn_map = &isl_map_range_map,
};
return un_op(umap, &control);
2032}

2034/* Given a collection of wrapped maps of the form A[B -> C],
* return the collection of maps A[B -> C] -> B.
*/
2037__isl_give isl_union_map *isl_union_set_wrapped_domain_map(
__isl_take isl_union_setisl_union_map *uset)
2039{
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);
2047}

2049/* Does "map" relate elements from the same space?
*/
2051static isl_bool equal_tuples(__isl_keep isl_map *map, void *user)
2052{
return isl_space_tuple_is_equal(map->dim, isl_dim_in,
			map->dim, isl_dim_out);
2055}

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

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

2076__isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_setisl_union_map *uset)
2077{
struct isl_un_op_control control = {
.fn_map = &isl_set_identity,
};
return un_op(uset, &control);
2082}

2084/* Construct an identity isl_pw_multi_aff on "set" and add it to *res.
*/
2086static isl_stat identity_upma(__isl_take isl_setisl_map *set, void *user)
2087{
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;
2098}

2100/* Return an identity function on "uset" in the form
* of an isl_union_pw_multi_aff.
*/
2103__isl_give isl_union_pw_multi_aff *isl_union_set_identity_union_pw_multi_aff(
__isl_take isl_union_setisl_union_map *uset)
2105{
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;
2114}

2116/* For each map in "umap" of the form [A -> B] -> C,
* construct the map A -> C and collect the results.
*/
2119__isl_give isl_union_map *isl_union_map_domain_factor_domain(
__isl_take isl_union_map *umap)
2121{
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);
2129}

2131/* For each map in "umap" of the form [A -> B] -> C,
* construct the map B -> C and collect the results.
*/
2134__isl_give isl_union_map *isl_union_map_domain_factor_range(
__isl_take isl_union_map *umap)
2136{
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);
2144}

2146/* For each map in "umap" of the form A -> [B -> C],
* construct the map A -> B and collect the results.
*/
2149__isl_give isl_union_map *isl_union_map_range_factor_domain(
__isl_take isl_union_map *umap)
2151{
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);
2159}

2161/* For each map in "umap" of the form A -> [B -> C],
* construct the map A -> C and collect the results.
*/
2164__isl_give isl_union_map *isl_union_map_range_factor_range(
__isl_take isl_union_map *umap)
2166{
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);
2174}

2176/* For each map in "umap" of the form [A -> B] -> [C -> D],
* construct the map A -> C and collect the results.
*/
2179__isl_give isl_union_map *isl_union_map_factor_domain(
__isl_take isl_union_map *umap)
2181{
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);
2189}

2191/* For each map in "umap" of the form [A -> B] -> [C -> D],
* construct the map B -> D and collect the results.
*/
2194__isl_give isl_union_map *isl_union_map_factor_range(
__isl_take isl_union_map *umap)
2196{
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);
2204}

2206__isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_setisl_union_map *uset)
2207{
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);
2215}

2217__isl_give isl_union_setisl_union_map *isl_union_map_wrap(__isl_take isl_union_map *umap)
2218{
struct isl_un_op_control control = {
.fn_map = &isl_map_wrap,
};
return un_op(umap, &control);
2223}

2225struct isl_union_map_is_subset_data {
isl_union_map *umap2;
isl_bool is_subset;
2228};

2230static isl_stat is_subset_entry(void **entry, void *user)
2231{
struct isl_union_map_is_subset_data *data = user;
uint32_t hash;
struct isl_hash_table_entry *entry2;
isl_map *map = *entry;

hash = isl_space_get_hash(map->dim);
entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
		     hash, &has_space, map->dim, 0);
if (!entry2) {
int empty = isl_map_is_empty(map);
if (empty < 0)
	return isl_stat_error;
if (empty)
	return isl_stat_ok;
data->is_subset = 0;
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;
2255}

2257isl_bool isl_union_map_is_subset(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2259{
struct isl_union_map_is_subset_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_subset_entry, &data) < 0 &&
   data.is_subset)
goto error;

isl_union_map_free(umap1);
isl_union_map_free(umap2);

return data.is_subset;
2280error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
return isl_bool_error;
2284}

2286isl_bool isl_union_set_is_subset(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2288{
return isl_union_map_is_subset(uset1, uset2);
2290}

2292isl_bool isl_union_map_is_equal(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2294{
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;
2304}

2306isl_bool isl_union_set_is_equal(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2308{
return isl_union_map_is_equal(uset1, uset2);
2310}

2312isl_bool isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2314{
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);
if (is_subset == isl_bool_error)
return is_subset;
return !is_subset;
2326}

2328isl_bool isl_union_set_is_strict_subset(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2330{
return isl_union_map_is_strict_subset(uset1, uset2);
2332}

2334/* 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.
*/
2339struct isl_union_map_is_disjoint_data {
isl_union_map *umap2;
isl_bool is_disjoint;
2342};

2344/* Check if "map" is disjoint from data->umap2 and abort
* the search if it is not.
*/
2347static isl_stat is_disjoint_entry(void **entry, void *user)
2348{
struct isl_union_map_is_disjoint_data *data = user;
uint32_t hash;
struct isl_hash_table_entry *entry2;
isl_map *map = *entry;

hash = isl_space_get_hash(map->dim);
entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
		     hash, &has_space, map->dim, 0);
if (!entry2)
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;
2365}

2367/* Are "umap1" and "umap2" disjoint?
*/
2369isl_bool isl_union_map_is_disjoint(__isl_keep isl_union_map *umap1,
__isl_keep isl_union_map *umap2)
2371{
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;
2394error:
isl_union_map_free(umap1);
isl_union_map_free(umap2);
return isl_bool_error;
2398}

2400/* Are "uset1" and "uset2" disjoint?
*/
2402isl_bool isl_union_set_is_disjoint(__isl_keep isl_union_setisl_union_map *uset1,
__isl_keep isl_union_setisl_union_map *uset2)
2404{
return isl_union_map_is_disjoint(uset1, uset2);
2406}

2408static isl_stat sample_entry(void **entry, void *user)
2409{
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;
2419}

2421__isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap)
2422{
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;
2439error:
isl_union_map_free(umap);
return NULL((void*)0);
2442}

2444__isl_give isl_basic_setisl_basic_map *isl_union_set_sample(__isl_take isl_union_setisl_union_map *uset)
2445{
return bset_from_bmap(isl_union_map_sample(uset));
2447}

2449/* Return an element in "uset" in the form of an isl_point.
* Return a void isl_point if "uset" is empty.
*/
2452__isl_give isl_point *isl_union_set_sample_point(__isl_take isl_union_setisl_union_map *uset)
2453{
return isl_basic_set_sample_point(isl_union_set_sample(uset));
2455}

2457struct isl_forall_data {
isl_bool res;
isl_bool (*fn)(__isl_keep isl_map *map);
2460};

2462static isl_stat forall_entry(void **entry, void *user)
2463{
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;
2475}

2477static isl_bool union_map_forall(__isl_keep isl_union_map *umap,
isl_bool (*fn)(__isl_keep isl_map *map))
2479{
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;
2490}

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

2498static isl_stat forall_user_entry(void **entry, void *user)
2499{
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;
2511}

2513/* Check if fn(map, user) returns true for all maps "map" in umap.
*/
2515static isl_bool union_map_forall_user(__isl_keep isl_union_map *umap,
isl_bool (*fn)(__isl_keep isl_map *map, void *user), void *user)
2517{
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;
2528}

2530/* Is "umap" obviously empty?
*/
2532isl_bool isl_union_map_plain_is_empty(__isl_keep isl_union_map *umap)
2533{
if (!umap)
return isl_bool_error;
return isl_union_map_n_map(umap) == 0;
2537}

2539isl_bool isl_union_map_is_empty(__isl_keep isl_union_map *umap)
2540{
return union_map_forall(umap, &isl_map_is_empty);
2542}

2544isl_bool isl_union_set_is_empty(__isl_keep isl_union_setisl_union_map *uset)
2545{
return isl_union_map_is_empty(uset);
2547}

2549static isl_bool is_subset_of_identity(__isl_keep isl_map *map)
2550{
isl_bool is_subset;
isl_space *dim;
isl_map *id;

if (!map)
return isl_bool_error;

if (!isl_space_tuple_is_equal(map->dim, isl_dim_in,
			map->dim, isl_dim_out))
return isl_bool_false;

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

is_subset = isl_map_is_subset(map, id);

isl_map_free(id);

return is_subset;
2570}

2572/* Given an isl_union_map that consists of a single map, check
* if it is single-valued.
*/
2575static isl_bool single_map_is_single_valued(__isl_keep isl_union_map *umap)
2576{
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;
2586}

2588/* 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.
*/
2593struct isl_union_map_is_sv_data {
isl_union_map *umap;
isl_bool sv;
2596};

2598/* 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.
*/
2613static isl_stat single_valued_on_domain(__isl_take isl_setisl_map *set, void *user)
2614{
struct isl_union_map_is_sv_data *data = user;
isl_union_map *umap, *test;

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

if (isl_union_map_n_map(umap) == 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;
2637}

2639/* 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.
*/
2645isl_bool isl_union_map_is_single_valued(__isl_keep isl_union_map *umap)
2646{
isl_union_map *universe;
isl_union_setisl_union_map *domain;
struct isl_union_map_is_sv_data data;

if (isl_union_map_n_map(umap) == 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;
2665}

2667isl_bool isl_union_map_is_injective(__isl_keep isl_union_map *umap)
2668{
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;
2677}

2679/* 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.
*/
2691static isl_stat map_plain_is_not_identity(__isl_take isl_map *map, void *user)
2692{
isl_bool *non_identity = user;
isl_bool equal;
isl_space *space;

space = isl_map_get_space(map);
equal = isl_space_tuple_is_equal(space, isl_dim_in, space, 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_space_free(space);
isl_map_free(map);

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

return isl_stat_ok;
2710}

2712/* 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.
*/
2718static isl_bool isl_union_map_plain_is_not_identity(
__isl_keep isl_union_map *umap)
2720{
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;
2730}

2732/* 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.
*/
2738static isl_stat map_is_identity(__isl_take isl_map *map, void *user)
2739{
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;
2749}

2751/* 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.
*/
2757isl_bool isl_union_map_is_identity(__isl_keep isl_union_map *umap)
2758{
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;
2772}

2774/* 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.
*/
2780struct isl_fixed_map {
isl_int v;
isl_map *map;
2783};

2785static struct isl_fixed_map *alloc_isl_fixed_map_array(isl_ctx *ctx,
int n)
2787{
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;
2797}

2799static void free_isl_fixed_map_array(struct isl_fixed_map *v, int n)
2800{
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);
2808}

2810/* Compare the "v" field of two isl_fixed_map structs.
*/
2812static int qsort_fixed_map_cmp(const void *p1, const void *p2)
2813{
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));
2818}

2820/* 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
*/
2826struct isl_fixed_dim_data {
struct isl_fixed_map *v;
int n;
int pos;
2830};

2832static isl_bool fixed_at_pos(__isl_keep isl_map *map, void *user)
2833{
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);
2839}

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

2844/* 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.
*/
2854static int separates(struct isl_fixed_map *v, int n,
__isl_take isl_space *dim, int pos, int n_range)
2856{
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(dim), 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(dim);
free_isl_fixed_map_array(v, n);
return i + 1 >= n;
2893error:
isl_space_free(dim);
free_isl_fixed_map_array(v, n);
return -1;
2897}

2899/* 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.
*/
2905static isl_bool plain_injective_on_range(__isl_take isl_union_map *umap,
int first, int n_range)
2907{
isl_ctx *ctx;
int 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 (!umap)
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 *dim;

data.n = 0;
fixed = union_map_forall_user(umap, &fixed_at_pos, &data);
if (fixed < 0)
	goto error;
if (!fixed)
	continue;
dim = isl_union_map_get_space(umap);
injective = separates(data.v, n, dim, 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;
2953error:
free_isl_fixed_map_array(data.v, n);
isl_union_map_free(umap);
return isl_bool_error;
2957}

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

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, isl_set_dim(ran, isl_dim_set));
2971}

2973/* 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.
*/
2979isl_bool isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap)
2980{
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;
2999}

3001isl_bool isl_union_map_is_bijective(__isl_keep isl_union_map *umap)
3002{
isl_bool sv;

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

return isl_union_map_is_injective(umap);
3010}

3012__isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap)
3013{
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);
3021}

3023/* Given a union map, take the maps of the form A -> (B -> C) and
* return the union of the corresponding maps (A -> B) -> C.
*/
3026__isl_give isl_union_map *isl_union_map_uncurry(__isl_take isl_union_map *umap)
3027{
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);
3035}

3037/* Given a union map, take the maps of the form (A -> B) -> C and
* return the union of the corresponding maps A -> (B -> C).
*/
3040__isl_give isl_union_map *isl_union_map_curry(__isl_take isl_union_map *umap)
3041{
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);
3049}

3051/* 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)).
*/
3054__isl_give isl_union_map *isl_union_map_range_curry(
__isl_take isl_union_map *umap)
3056{
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);
3064}

3066__isl_give isl_union_setisl_union_map *isl_union_set_lift(__isl_take isl_union_setisl_union_map *uset)
3067{
struct isl_un_op_control control = {
.fn_map = &isl_set_lift,
};
return un_op(uset, &control);
3072}

3074static isl_stat coefficients_entry(void **entry, void *user)
3075{
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;
3084}

3086__isl_give isl_union_setisl_union_map *isl_union_set_coefficients(
__isl_take isl_union_setisl_union_map *uset)
3088{
isl_ctx *ctx;
isl_space *dim;
isl_union_setisl_union_map *res;

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

ctx = isl_union_set_get_ctx(uset);
dim = isl_space_set_alloc(ctx, 0, 0);
res = isl_union_map_alloc(dim, 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;
3105error:
isl_union_set_free(uset);
isl_union_set_free(res);
return NULL((void*)0);
3109}

3111static isl_stat solutions_entry(void **entry, void *user)
3112{
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;
3127}

3129__isl_give isl_union_setisl_union_map *isl_union_set_solutions(
__isl_take isl_union_setisl_union_map *uset)
3131{
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;
3149error:
isl_union_set_free(uset);
isl_union_set_free(res);
return NULL((void*)0);
3153}

3155/* Is the domain space of "map" equal to "space"?
*/
3157static int domain_match(__isl_keep isl_map *map, __isl_keep isl_space *space)
3158{
return isl_space_tuple_is_equal(map->dim, isl_dim_in,
			space, isl_dim_out);
3161}

3163/* Is the range space of "map" equal to "space"?
*/
3165static int range_match(__isl_keep isl_map *map, __isl_keep isl_space *space)
3166{
return isl_space_tuple_is_equal(map->dim, isl_dim_out,
			space, isl_dim_out);
3169}

3171/* Is the set space of "map" equal to "space"?
*/
3173static int set_match(__isl_keep isl_map *map, __isl_keep isl_space *space)
3174{
return isl_space_tuple_is_equal(map->dim, isl_dim_set,
			space, isl_dim_out);
3177}

3179/* 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.
*/
3187struct 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);
3194};

3196/* 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.
*/
3201static isl_stat preimage_entry(void **entry, void *user)
3202{
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;
3226}

3228/* 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.
*/
3234static __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))
3239{
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;
3266error:
isl_union_map_free(umap);
isl_pw_multi_aff_free(pma);
return NULL((void*)0);
3270}

3272/* 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".
*/
3279__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)
3281{
return preimage_pw_multi_aff(umap, pma, &domain_match,
			&isl_map_preimage_domain_pw_multi_aff);
3284}

3286/* 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".
*/
3293__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)
3295{
return preimage_pw_multi_aff(umap, pma, &range_match,
			&isl_map_preimage_range_pw_multi_aff);
3298}

3300/* 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".
*/
3306__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)
3308{
return preimage_pw_multi_aff(uset, pma, &set_match,
			&isl_set_preimage_pw_multi_aff);
3311}

3313/* 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".
*/
3320__isl_give isl_union_map *isl_union_map_preimage_domain_multi_aff(
__isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma)
3322{
return isl_union_map_preimage_domain_pw_multi_aff(umap,
			isl_pw_multi_aff_from_multi_aff(ma));
3325}

3327/* 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".
*/
3334__isl_give isl_union_map *isl_union_map_preimage_range_multi_aff(
__isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma)
3336{
return isl_union_map_preimage_range_pw_multi_aff(umap,
			isl_pw_multi_aff_from_multi_aff(ma));
3339}

3341/* 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".
*/
3347__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)
3349{
return isl_union_set_preimage_pw_multi_aff(uset,
			isl_pw_multi_aff_from_multi_aff(ma));
3352}

3354/* 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.
*/
3362struct 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);
3369};

3371/* 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.
*/
3376static isl_stat preimage_mpa_entry(void **entry, void *user)
3377{
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;
3401}

3403/* 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.
*/
3409static __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))
3414{
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;
3441error:
isl_union_map_free(umap);
isl_multi_pw_aff_free(mpa);
return NULL((void*)0);
3445}

3447/* 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".
*/
3454__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)
3456{
return preimage_multi_pw_aff(umap, mpa, &domain_match,
			&isl_map_preimage_domain_multi_pw_aff);
3459}

3461/* 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.
*/
3467struct 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);
3472};

3474/* 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.
*/
3477static isl_stat preimage_upma(__isl_take isl_pw_multi_aff *pma, void *user)
3478{
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;
3487}

3489/* 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.
*/
3495static __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))
3500{
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;
3514}

3516/* 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".
*/
3524__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)
3527{
return preimage_union_pw_multi_aff(umap, upma,
		&isl_union_map_preimage_domain_pw_multi_aff);
3530}

3532/* 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".
*/
3540__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)
3543{
return preimage_union_pw_multi_aff(umap, upma,
		&isl_union_map_preimage_range_pw_multi_aff);
3546}

3548/* 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".
*/
3555__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)
3558{
return preimage_union_pw_multi_aff(uset, upma,
			&isl_union_set_preimage_pw_multi_aff);
3561}

3563/* Reset the user pointer on all identifiers of parameters and tuples
* of the spaces of "umap".
*/
3566__isl_give isl_union_map *isl_union_map_reset_user(
__isl_take isl_union_map *umap)
3568{
umap = isl_union_map_cow(umap);
if (!umap)
return NULL((void*)0);
umap->dim = isl_space_reset_user(umap->dim);
if (!umap->dim)
return isl_union_map_free(umap);
return total(umap, &isl_map_reset_user);
3576}

3578/* Reset the user pointer on all identifiers of parameters and tuples
* of the spaces of "uset".
*/
3581__isl_give isl_union_setisl_union_map *isl_union_set_reset_user(
__isl_take isl_union_setisl_union_map *uset)
3583{
return isl_union_map_reset_user(uset);
3585}

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

3596/* Remove all existentially quantified variables and integer divisions
* from "uset" using Fourier-Motzkin elimination.
*/
3599__isl_give isl_union_setisl_union_map *isl_union_set_remove_divs(
__isl_take isl_union_setisl_union_map *uset)
3601{
return isl_union_map_remove_divs(uset);
3603}

3605/* 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.
*/
3610struct isl_union_map_project_out_data {
enum isl_dim_type type;
unsigned first;
unsigned n;

isl_union_map *res;
3616};

3618/* Turn the data->n dimensions of type data->type, starting at data->first
* into existentially quantified variables and add the result to data->res.
*/
3621static isl_stat project_out(__isl_take isl_map *map, void *user)
3622{
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;
3629}

3631/* 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.
*/
3636__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)
3639{
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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 3649); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 3649); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 3649); 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;
3660}

3662/* Project out all parameters from "umap" by existentially quantifying
* over them.
*/
3665__isl_give isl_union_map *isl_union_map_project_out_all_params(
__isl_take isl_union_map *umap)
3667{
unsigned n;

if (!umap)
return NULL((void*)0);
n = isl_union_map_dim(umap, isl_dim_param);
return isl_union_map_project_out(umap, isl_dim_param, 0, n);
3674}

3676/* 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.
*/
3681__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)
3684{
return isl_union_map_project_out(uset, type, first, n);
3686}

3688/* Internal data structure for isl_union_map_involves_dims.
* "first" and "n" are the arguments for the isl_map_involves_dims calls.
*/
3691struct isl_union_map_involves_dims_data {
unsigned first;
unsigned n;
3694};

3696/* Does "map" _not_ involve the data->n parameters starting at data->first?
*/
3698static isl_bool map_excludes(__isl_keep isl_map *map, void *user)
3699{
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);
if (involves < 0)
return isl_bool_error;
return !involves;
3708}

3710/* 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.
*/
3718isl_bool isl_union_map_involves_dims(__isl_keep isl_union_map *umap,
enum isl_dim_type type, unsigned first, unsigned n)
3720{
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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 3726); 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", "/build/llvm-toolchain-snapshot-7~svn329677/tools/polly/lib/External/isl/isl_union_map.c"
, 3726); return isl_bool_error; } while (0);

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

if (excludes < 0)
return isl_bool_error;

return !excludes;
3734}

3736/* 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.
*/
3740struct isl_union_map_reset_range_space_data {
isl_space *range;
isl_union_map *res;
3743};

3745/* Replace the range space of "map" by the range space of data->range and
* add the result to data->res.
*/
3748static isl_stat reset_range_space(__isl_take isl_map *map, void *user)
3749{
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;
3761}

3763/* 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.
*/
3772__isl_give isl_union_map *isl_union_map_reset_range_space(
__isl_take isl_union_map *umap, __isl_take isl_space *space)
3774{
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;
3784}

3786/* 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.
*/
3792struct 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;
3797};

3799/* 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.
*/
3803static isl_stat order_at(__isl_take isl_map *map, void *user)
3804{
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;
3819}

3821/* 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.
*/
3825static __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))
3829{
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));
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;
3845}

3847/* Return the subset of "umap" where the domain and the range
* have equal "mupa" values.
*/
3850__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)
3853{
return isl_union_map_order_at_multi_union_pw_aff(umap, mupa,
				&isl_multi_pw_aff_eq_map);
3856}

3858/* Return the subset of "umap" where the domain has a lexicographically
* smaller "mupa" value than the range.
*/
3861__isl_give isl_union_map *isl_union_map_lex_lt_at_multi_union_pw_aff(
__isl_take isl_union_map *umap,
__isl_take isl_multi_union_pw_aff *mupa)
3864{
return isl_union_map_order_at_multi_union_pw_aff(umap, mupa,
				&isl_multi_pw_aff_lex_lt_map);
3867}

3869/* Return the subset of "umap" where the domain has a lexicographically
* greater "mupa" value than the range.
*/
3872__isl_give isl_union_map *isl_union_map_lex_gt_at_multi_union_pw_aff(
__isl_take isl_union_map *umap,
__isl_take isl_multi_union_pw_aff *mupa)
3875{
return isl_union_map_order_at_multi_union_pw_aff(umap, mupa,
				&isl_multi_pw_aff_lex_gt_map);
3878}

3880/* Return the union of the elements in the list "list".
*/
3882__isl_give isl_union_setisl_union_map *isl_union_set_list_union(
__isl_take isl_union_set_listisl_union_map_list *list)
3884{
int i, n;
isl_ctx *ctx;
isl_space *space;
isl_union_setisl_union_map *res;

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

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

n = isl_union_set_list_n_union_set(list);
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;
3907}

3909/* Update *hash with the hash value of "map".
*/
3911static isl_stat add_hash(__isl_take isl_map *map, void *user)
3912{
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;
3921}

3923/* Return a hash value that digests "umap".
*/
3925uint32_t isl_union_map_get_hash(__isl_keep isl_union_map *umap)
3926{
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;
3937}

3939/* Return a hash value that digests "uset".
*/
3941uint32_t isl_union_set_get_hash(__isl_keep isl_union_setisl_union_map *uset)
3942{
return isl_union_map_get_hash(uset);
3944}

3946/* Add the number of basic sets in "set" to "n".
*/
3948static isl_stat add_n(__isl_take isl_setisl_map *set, void *user)
3949{
int *n = user;

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

return isl_stat_ok;
3956}

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

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

return n;
3968}

3970/* Add the basic sets in "set" to "list".
*/
3972static isl_stat add_list(__isl_take isl_setisl_map *set, void *user)
3973{
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;
3984}

3986/* Return a list containing all the basic sets in "uset".
*
* First construct a list of the appropriate size and
* then add all the elements.
*/
3991__isl_give isl_basic_set_listisl_basic_map_list *isl_union_set_get_basic_set_list(
__isl_keep isl_union_setisl_union_map *uset)
3993{
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;
4009}

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

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

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

4029/* Dummy isl_un_op_control transformation callback that
* simply returns the input.
*/
4032static __isl_give isl_map *map_id(__isl_take isl_map *map)
4033{
return map;
4035}

4037/* 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.
*/
4043__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)
4046{
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);
4054}