/* * 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 */ #include <isl_map_private.h> #include <isl_union_map_private.h> #include <isl/ctx.h> #include <isl/hash.h> #include <isl_aff_private.h> #include <isl/map.h> #include <isl/set.h> #include <isl_space_private.h> #include <isl/union_set.h> #include <isl_maybe_map.h> #include <isl_id_private.h> #include <bset_from_bmap.c> #include <set_to_map.c> #include <set_from_map.c> #include <uset_to_umap.c> #include <uset_from_umap.c> #include <set_list_from_map_list_inl.c> #undef TYPE #define TYPE … static #include "has_single_reference_templ.c" static #include "check_single_reference_templ.c" /* Return the number of parameters of "umap", where "type" * is required to be set to isl_dim_param. */ isl_size isl_union_map_dim(__isl_keep isl_union_map *umap, enum isl_dim_type type) { … } /* Return the number of parameters of "uset", where "type" * is required to be set to isl_dim_param. */ isl_size isl_union_set_dim(__isl_keep isl_union_set *uset, enum isl_dim_type type) { … } /* Return the id of the specified dimension. */ __isl_give isl_id *isl_union_map_get_dim_id(__isl_keep isl_union_map *umap, enum isl_dim_type type, unsigned pos) { … } /* Is this union set a parameter domain? */ isl_bool isl_union_set_is_params(__isl_keep isl_union_set *uset) { … } /* Is this union map actually a parameter domain? * Users should never call this function. Outside of isl, * a union map can never be a parameter domain. */ isl_bool isl_union_map_is_params(__isl_keep isl_union_map *umap) { … } static __isl_give isl_union_map *isl_union_map_alloc( __isl_take isl_space *space, int size) { … } /* Create an empty union map without specifying any parameters. */ __isl_give isl_union_map *isl_union_map_empty_ctx(isl_ctx *ctx) { … } __isl_give isl_union_map *isl_union_map_empty_space(__isl_take isl_space *space) { … } /* This is an alternative name for the function above. */ __isl_give isl_union_map *isl_union_map_empty(__isl_take isl_space *space) { … } /* Create an empty union set without specifying any parameters. */ __isl_give isl_union_set *isl_union_set_empty_ctx(isl_ctx *ctx) { … } __isl_give isl_union_set *isl_union_set_empty_space(__isl_take isl_space *space) { … } /* This is an alternative name for the function above. */ __isl_give isl_union_set *isl_union_set_empty(__isl_take isl_space *space) { … } isl_ctx *isl_union_map_get_ctx(__isl_keep isl_union_map *umap) { … } isl_ctx *isl_union_set_get_ctx(__isl_keep isl_union_set *uset) { … } /* Return the space of "umap". */ __isl_keep isl_space *isl_union_map_peek_space(__isl_keep isl_union_map *umap) { … } /* Return the space of "uset". */ __isl_keep isl_space *isl_union_set_peek_space(__isl_keep isl_union_set *uset) { … } __isl_give isl_space *isl_union_map_get_space(__isl_keep isl_union_map *umap) { … } /* Return the position of the parameter with the given name * in "umap". * Return -1 if no such dimension can be found. */ int isl_union_map_find_dim_by_name(__isl_keep isl_union_map *umap, enum isl_dim_type type, const char *name) { … } /* Return the position of the parameter with id "id" in "umap". * Return -1 if no such dimension can be found. */ static int isl_union_map_find_dim_by_id(__isl_keep isl_union_map *umap, enum isl_dim_type type, __isl_keep isl_id *id) { … } __isl_give isl_space *isl_union_set_get_space(__isl_keep isl_union_set *uset) { … } static isl_stat free_umap_entry(void **entry, void *user) { … } static isl_stat add_map(__isl_take isl_map *map, void *user) { … } __isl_give isl_union_map *isl_union_map_dup(__isl_keep isl_union_map *umap) { … } __isl_give isl_union_map *isl_union_map_cow(__isl_take isl_union_map *umap) { … } struct isl_union_align { … }; static isl_stat align_entry(void **entry, void *user) { … } /* 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. */ __isl_give isl_union_map *isl_union_map_align_params( __isl_take isl_union_map *umap, __isl_take isl_space *model) { … } __isl_give isl_union_set *isl_union_set_align_params( __isl_take isl_union_set *uset, __isl_take isl_space *model) { … } __isl_give isl_union_map *isl_union_map_union(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } __isl_give isl_union_set *isl_union_set_union(__isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } __isl_give isl_union_map *isl_union_map_copy(__isl_keep isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_copy(__isl_keep isl_union_set *uset) { … } __isl_null isl_union_map *isl_union_map_free(__isl_take isl_union_map *umap) { … } __isl_null isl_union_set *isl_union_set_free(__isl_take isl_union_set *uset) { … } /* Do "umap" and "space" have the same parameters? */ isl_bool isl_union_map_space_has_equal_params(__isl_keep isl_union_map *umap, __isl_keep isl_space *space) { … } /* Do "uset" and "space" have the same parameters? */ isl_bool isl_union_set_space_has_equal_params(__isl_keep isl_union_set *uset, __isl_keep isl_space *space) { … } /* Is the space of the map at "entry" equal to "space", ignoring parameters? */ static isl_bool has_space_tuples(const void *entry, const void *val) { … } /* Find the entry in "umap" with space "space" (ignoring parameters), * returning isl_hash_table_entry_none if no such entry appears in "umap" and * NULL on error. * If "reserve" is set, then an entry is created if it does * not exist already. Since this modifies the hash table in-place, * this means "umap" must have a single reference when "reserve" is set. */ static struct isl_hash_table_entry *isl_union_map_find_entry( __isl_keep isl_union_map *umap, __isl_keep isl_space *space, int reserve) { … } /* Find the entry in "uset" with space "space" (ignoring parameters), * returning isl_hash_table_entry_none if no such entry appears in "uset" and * NULL on error. * If "reserve" is set, then an entry is created if it does * not exist already. In this case, a NULL return indicates an error. */ struct isl_hash_table_entry *isl_union_set_find_entry( __isl_keep isl_union_set *uset, __isl_keep isl_space *space, int reserve) { … } __isl_give isl_union_map *isl_union_map_add_map(__isl_take isl_union_map *umap, __isl_take isl_map *map) { … } __isl_give isl_union_set *isl_union_set_add_set(__isl_take isl_union_set *uset, __isl_take isl_set *set) { … } __isl_give isl_union_map *isl_union_map_from_map(__isl_take isl_map *map) { … } /* This function performs the same operation as isl_union_map_from_map, * but is considered as a function on an isl_map when exported. */ __isl_give isl_union_map *isl_map_to_union_map(__isl_take isl_map *map) { … } __isl_give isl_union_set *isl_union_set_from_set(__isl_take isl_set *set) { … } /* This function performs the same operation as isl_union_set_from_set, * but is considered as a function on an isl_set when exported. */ __isl_give isl_union_set *isl_set_to_union_set(__isl_take isl_set *set) { … } __isl_give isl_union_map *isl_union_map_from_basic_map( __isl_take isl_basic_map *bmap) { … } __isl_give isl_union_set *isl_union_set_from_basic_set( __isl_take isl_basic_set *bset) { … } struct isl_union_map_foreach_data { … }; static isl_stat call_on_copy(void **entry, void *user) { … } isl_size isl_union_map_n_map(__isl_keep isl_union_map *umap) { … } isl_size isl_union_set_n_set(__isl_keep isl_union_set *uset) { … } isl_stat isl_union_map_foreach_map(__isl_keep isl_union_map *umap, isl_stat (*fn)(__isl_take isl_map *map, void *user), void *user) { … } /* 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. */ struct isl_union_map_every_data { … }; /* Call data->test on "map". * If this fails, then set data->failed and abort. */ static isl_stat call_every(void **entry, void *user) { … } /* Does "test" succeed on every map in "umap"? */ isl_bool isl_union_map_every_map(__isl_keep isl_union_map *umap, isl_bool (*test)(__isl_keep isl_map *map, void *user), void *user) { … } /* Add "map" to "list". */ static isl_stat add_list_map(__isl_take isl_map *map, void *user) { … } /* Return the maps in "umap" as a list. * * First construct a list of the appropriate size and then add all the * elements. */ __isl_give isl_map_list *isl_union_map_get_map_list( __isl_keep isl_union_map *umap) { … } /* Return the sets in "uset" as a list. */ __isl_give isl_set_list *isl_union_set_get_set_list( __isl_keep isl_union_set *uset) { … } /* Can "umap" be converted to an isl_map? * That is, does it contain elements in exactly one space? */ isl_bool isl_union_map_isa_map(__isl_keep isl_union_map *umap) { … } /* Can "uset" be converted to an isl_set? * That is, does it contain elements in exactly one space? */ isl_bool isl_union_set_isa_set(__isl_keep isl_union_set *uset) { … } static isl_stat copy_map(void **entry, void *user) { … } __isl_give isl_map *isl_map_from_union_map(__isl_take isl_union_map *umap) { … } /* This function performs the same operation as isl_map_from_union_map, * but is considered as a function on an isl_union_map when exported. */ __isl_give isl_map *isl_union_map_as_map(__isl_take isl_union_map *umap) { … } __isl_give isl_set *isl_set_from_union_set(__isl_take isl_union_set *uset) { … } /* This function performs the same operation as isl_set_from_union_set, * but is considered as a function on an isl_union_set when exported. */ __isl_give isl_set *isl_union_set_as_set(__isl_take isl_union_set *uset) { … } /* Extract the map in "umap" that lives in the given space (ignoring * parameters). */ __isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap, __isl_take isl_space *space) { … } __isl_give isl_set *isl_union_set_extract_set(__isl_keep isl_union_set *uset, __isl_take isl_space *space) { … } /* Check if umap contains a map in the given space (ignoring parameters). */ isl_bool isl_union_map_contains(__isl_keep isl_union_map *umap, __isl_keep isl_space *space) { … } isl_bool isl_union_set_contains(__isl_keep isl_union_set *uset, __isl_keep isl_space *space) { … } isl_stat isl_union_set_foreach_set(__isl_keep isl_union_set *uset, isl_stat (*fn)(__isl_take isl_set *set, void *user), void *user) { … } /* Internal data structure for isl_union_set_every_set. * * "test" is the user-specified callback function. * "user" is the user-specified callback function argument. */ struct isl_test_set_from_map_data { … }; /* Call data->test on "map", which is part of an isl_union_set and * therefore known to be an isl_set. */ static isl_bool test_set_from_map(__isl_keep isl_map *map, void *user) { … } /* Does "test" succeed on every set in "uset"? */ isl_bool isl_union_set_every_set(__isl_keep isl_union_set *uset, isl_bool (*test)(__isl_keep isl_set *set, void *user), void *user) { … } struct isl_union_set_foreach_point_data { … }; static isl_stat foreach_point(__isl_take isl_set *set, void *user) { … } isl_stat isl_union_set_foreach_point(__isl_keep isl_union_set *uset, isl_stat (*fn)(__isl_take isl_point *pnt, void *user), void *user) { … } /* 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. */ struct isl_bin_op_control { … }; /* 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. */ struct isl_union_map_gen_bin_data { … }; /* Add a copy of "map" to "res" and return the result. */ static __isl_give isl_union_map *bin_add_map(__isl_take isl_union_map *res, __isl_keep isl_map *map) { … } /* Combine "map1" and "map2", add the result to "res" and return the result. * Check whether the result is empty before adding it to "res". */ static __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) { … } /* Dummy match_space function that simply returns the input space. */ static __isl_give isl_space *identity(__isl_take isl_space *space) { … } /* 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". */ static __isl_keep isl_maybe_isl_map bin_try_get_match( struct isl_union_map_gen_bin_data *data, __isl_keep isl_map *map) { … } /* 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. */ static isl_stat gen_bin_entry(void **entry, void *user) { … } /* 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. */ static __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) { … } __isl_give isl_union_map *isl_union_map_subtract( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } __isl_give isl_union_set *isl_union_set_subtract( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } struct isl_union_map_gen_bin_set_data { … }; static isl_stat intersect_params_entry(void **entry, void *user) { … } static __isl_give isl_union_map *gen_bin_set_op(__isl_take isl_union_map *umap, __isl_take isl_set *set, isl_stat (*fn)(void **, void *)) { … } /* Intersect "umap" with the parameter domain "set". * * If "set" does not have any constraints, then we can return immediately. */ __isl_give isl_union_map *isl_union_map_intersect_params( __isl_take isl_union_map *umap, __isl_take isl_set *set) { … } __isl_give isl_union_set *isl_union_set_intersect_params( __isl_take isl_union_set *uset, __isl_take isl_set *set) { … } static __isl_give isl_union_map *union_map_intersect_params( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } static __isl_give isl_union_map *union_map_gist_params( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } struct isl_union_map_match_bin_data { … }; static isl_stat match_bin_entry(void **entry, void *user) { … } static __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*)) { … } __isl_give isl_union_map *isl_union_map_intersect( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } /* 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. */ __isl_give isl_union_set *isl_union_set_intersect( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } static isl_stat gist_params_entry(void **entry, void *user) { … } __isl_give isl_union_map *isl_union_map_gist_params( __isl_take isl_union_map *umap, __isl_take isl_set *set) { … } __isl_give isl_union_set *isl_union_set_gist_params( __isl_take isl_union_set *uset, __isl_take isl_set *set) { … } __isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap, __isl_take isl_union_map *context) { … } __isl_give isl_union_set *isl_union_set_gist(__isl_take isl_union_set *uset, __isl_take isl_union_set *context) { … } /* 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. */ __isl_give isl_union_map *isl_union_map_plain_gist( __isl_take isl_union_map *umap, __isl_take isl_union_map *context) { … } /* 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. */ __isl_give isl_union_set *isl_union_set_plain_gist( __isl_take isl_union_set *uset, __isl_take isl_union_set *context) { … } static __isl_give isl_map *lex_le_set(__isl_take isl_map *set1, __isl_take isl_map *set2) { … } static __isl_give isl_map *lex_lt_set(__isl_take isl_map *set1, __isl_take isl_map *set2) { … } __isl_give isl_union_map *isl_union_set_lex_lt_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } __isl_give isl_union_map *isl_union_set_lex_le_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } __isl_give isl_union_map *isl_union_set_lex_gt_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } __isl_give isl_union_map *isl_union_set_lex_ge_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } __isl_give isl_union_map *isl_union_map_lex_gt_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } __isl_give isl_union_map *isl_union_map_lex_ge_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } /* Intersect the domain of "umap" with "uset". */ static __isl_give isl_union_map *union_map_intersect_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } /* Intersect the domain of "umap" with "uset". * If "uset" is a parameters domain, then intersect the parameter * domain of "umap" with this set. */ __isl_give isl_union_map *isl_union_map_intersect_domain_union_set( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } /* This is an alternative name for the function above. */ __isl_give isl_union_map *isl_union_map_intersect_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } /* Remove the elements of "uset" from the domain of "umap". */ __isl_give isl_union_map *isl_union_map_subtract_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom) { … } /* Remove the elements of "uset" from the range of "umap". */ __isl_give isl_union_map *isl_union_map_subtract_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom) { … } /* Compute the gist of "umap" with respect to the domain "uset". */ static __isl_give isl_union_map *union_map_gist_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } /* 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. */ __isl_give isl_union_map *isl_union_map_gist_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } /* Compute the gist of "umap" with respect to the range "uset". */ __isl_give isl_union_map *isl_union_map_gist_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_intersect_range_union_set( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } /* This is an alternative name for the function above. */ __isl_give isl_union_map *isl_union_map_intersect_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { … } /* 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. */ __isl_give isl_union_map *isl_union_map_intersect_domain_factor_domain( __isl_take isl_union_map *umap, __isl_take isl_union_map *factor) { … } /* Intersect each map in "umap" in a space [A -> B] -> C * with the corresponding map in "factor" in the space B -> C and * collect the results. */ __isl_give isl_union_map *isl_union_map_intersect_domain_factor_range( __isl_take isl_union_map *umap, __isl_take isl_union_map *factor) { … } /* Intersect each map in "umap" in a space A -> [B -> C] * with the corresponding map in "factor" in the space A -> B and * collect the results. */ __isl_give isl_union_map *isl_union_map_intersect_range_factor_domain( __isl_take isl_union_map *umap, __isl_take isl_union_map *factor) { … } /* 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. */ __isl_give isl_union_map *isl_union_map_intersect_range_factor_range( __isl_take isl_union_map *umap, __isl_take isl_union_map *factor) { … } struct isl_union_map_bin_data { … }; static isl_stat apply_range_entry(void **entry, void *user) { … } static isl_stat bin_entry(void **entry, void *user) { … } static __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)) { … } /* Intersect each map in "umap" in a space [A -> B] -> C * with the corresponding set in "domain" in the space A and * collect the results. */ __isl_give isl_union_map * isl_union_map_intersect_domain_wrapped_domain_union_set( __isl_take isl_union_map *umap, __isl_take isl_union_set *domain) { … } /* Intersect each map in "umap" in a space A -> [B -> C] * with the corresponding set in "domain" in the space B and * collect the results. */ __isl_give isl_union_map * isl_union_map_intersect_range_wrapped_domain_union_set( __isl_take isl_union_map *umap, __isl_take isl_union_set *domain) { … } __isl_give isl_union_map *isl_union_map_apply_range( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } __isl_give isl_union_map *isl_union_map_apply_domain( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } __isl_give isl_union_set *isl_union_set_apply( __isl_take isl_union_set *uset, __isl_take isl_union_map *umap) { … } static isl_stat map_lex_lt_entry(void **entry, void *user) { … } __isl_give isl_union_map *isl_union_map_lex_lt_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } static isl_stat map_lex_le_entry(void **entry, void *user) { … } __isl_give isl_union_map *isl_union_map_lex_le_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } static isl_stat product_entry(void **entry, void *user) { … } __isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } static isl_stat set_product_entry(void **entry, void *user) { … } __isl_give isl_union_set *isl_union_set_product(__isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { … } static isl_stat domain_product_entry(void **entry, void *user) { … } /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D) */ __isl_give isl_union_map *isl_union_map_domain_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } static isl_stat range_product_entry(void **entry, void *user) { … } __isl_give isl_union_map *isl_union_map_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } /* If data->map A -> B and "map2" C -> D have the same range space, * then add (A, C) -> (B * D) to data->res. */ static isl_stat flat_domain_product_entry(void **entry, void *user) { … } /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D). */ __isl_give isl_union_map *isl_union_map_flat_domain_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } static isl_stat flat_range_product_entry(void **entry, void *user) { … } __isl_give isl_union_map *isl_union_map_flat_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { … } /* Data structure that specifies how un_op should modify * the maps in the union map. * * If "inplace" is set, then the maps in the input union map * are modified in place. This means that "fn_map" should not * change the meaning of the map or that the union map only * has a single reference. * If "total" is set, then all maps need to be modified and * the results need to live in the same space. * Otherwise, a new union map is constructed to store the results. * If "filter" is not NULL, then only the input maps that satisfy "filter" * are taken into account. "filter_user" is passed as the second argument * to "filter". No filter can be set if "inplace" or * "total" is set. * At most one of "fn_map" or "fn_map2" can be set, specifying * how the maps (selected by "filter") should be transformed. * If "fn_map2" is set, then "fn_map2_user" is passed as the second argument. */ struct isl_un_op_control { … }; /* Data structure for wrapping the data for un_op_filter_drop_user. * "filter" is the function that is being wrapped. */ struct isl_un_op_drop_user_data { … }; /* Wrapper for isl_un_op_control filters that do not require * a second argument. * Simply call data->filter without the second argument. */ static isl_bool un_op_filter_drop_user(__isl_keep isl_map *map, void *user) { … } /* Internal data structure for "un_op". * "control" specifies how the maps in the union map should be modified. * "res" collects the results. */ struct isl_union_map_un_data { … }; /* isl_hash_table_foreach callback for un_op. * Handle the map that "entry" points to. * * If control->filter is set, then check if this map satisfies the filter. * If so (or if control->filter is not set), modify the map * by calling control->fn_map or control->fn_map2 (if set) and * either add the result to data->res or * replace the original entry by the result (if control->inplace is set). */ static isl_stat un_entry(void **entry, void *user) { … } /* 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. */ static __isl_give isl_union_map *un_op(__isl_take isl_union_map *umap, struct isl_un_op_control *control) { … } __isl_give isl_union_map *isl_union_map_from_range( __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_from_domain( __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_from_domain_and_range( __isl_take isl_union_set *domain, __isl_take isl_union_set *range) { … } /* Modify the maps in "umap" by applying "fn" on them. * "fn" should apply to all maps in "umap" and should not modify the space. */ static __isl_give isl_union_map *total(__isl_take isl_union_map *umap, __isl_give isl_map *(*fn)(__isl_take isl_map *)) { … } /* Compute the affine hull of "map" and return the result as an isl_map. */ static __isl_give isl_map *isl_map_affine_hull_map(__isl_take isl_map *map) { … } __isl_give isl_union_map *isl_union_map_affine_hull( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_affine_hull( __isl_take isl_union_set *uset) { … } /* 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. */ static __isl_give isl_set *combined_lineality_space(__isl_take isl_set *set) { … } /* For each set in "uset", compute the (linear) hull * of the lineality spaces of its basic sets and * collect and return the results. */ __isl_give isl_union_set *isl_union_set_combined_lineality_space( __isl_take isl_union_set *uset) { … } /* Compute the polyhedral hull of "map" and return the result as an isl_map. */ static __isl_give isl_map *isl_map_polyhedral_hull_map(__isl_take isl_map *map) { … } __isl_give isl_union_map *isl_union_map_polyhedral_hull( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_polyhedral_hull( __isl_take isl_union_set *uset) { … } /* 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. */ static __isl_give isl_map *isl_map_simple_hull_map(__isl_take isl_map *map) { … } __isl_give isl_union_map *isl_union_map_simple_hull( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_simple_hull( __isl_take isl_union_set *uset) { … } static __isl_give isl_union_map *inplace(__isl_take isl_union_map *umap, __isl_give isl_map *(*fn)(__isl_take isl_map *)) { … } /* 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. */ __isl_give isl_union_map *isl_union_map_remove_redundancies( __isl_take isl_union_map *umap) { … } /* Remove redundant constraints in each of the basic sets of "uset". */ __isl_give isl_union_set *isl_union_set_remove_redundancies( __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_coalesce( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_coalesce( __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_detect_equalities( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_detect_equalities( __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_compute_divs( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_compute_divs( __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_lexmin( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_lexmin( __isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_lexmax( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_lexmax( __isl_take isl_union_set *uset) { … } /* Return the universe in the space of "map". */ static __isl_give isl_map *universe(__isl_take isl_map *map) { … } __isl_give isl_union_map *isl_union_map_universe(__isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_universe(__isl_take isl_union_set *uset) { … } __isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap) { … } /* Given a union map, take the maps of the form A -> (B -> C) and * return the union of the corresponding maps A -> (C -> B). */ __isl_give isl_union_map *isl_union_map_range_reverse( __isl_take isl_union_map *umap) { … } /* Compute the parameter domain of the given union map. */ __isl_give isl_set *isl_union_map_params(__isl_take isl_union_map *umap) { … } /* Compute the parameter domain of the given union set. */ __isl_give isl_set *isl_union_set_params(__isl_take isl_union_set *uset) { … } __isl_give isl_union_set *isl_union_map_domain(__isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_map_range(__isl_take isl_union_map *umap) { … } __isl_give isl_union_map *isl_union_map_domain_map( __isl_take isl_union_map *umap) { … } /* Construct an isl_pw_multi_aff that maps "map" to its domain and * add the result to "res". */ static isl_stat domain_map_upma(__isl_take isl_map *map, void *user) { … } /* Return an isl_union_pw_multi_aff that maps a wrapped copy of "umap" * to its domain. */ __isl_give isl_union_pw_multi_aff *isl_union_map_domain_map_union_pw_multi_aff( __isl_take isl_union_map *umap) { … } __isl_give isl_union_map *isl_union_map_range_map( __isl_take isl_union_map *umap) { … } /* Given a collection of wrapped maps of the form A[B -> C], * return the collection of maps A[B -> C] -> B. */ __isl_give isl_union_map *isl_union_set_wrapped_domain_map( __isl_take isl_union_set *uset) { … } /* Does "map" relate elements from the same space? */ static isl_bool equal_tuples(__isl_keep isl_map *map, void *user) { … } __isl_give isl_union_set *isl_union_map_deltas(__isl_take isl_union_map *umap) { … } __isl_give isl_union_map *isl_union_map_deltas_map( __isl_take isl_union_map *umap) { … } __isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_set *uset) { … } /* Construct an identity isl_pw_multi_aff on "set" and add it to *res. */ static isl_stat identity_upma(__isl_take isl_set *set, void *user) { … } /* Return an identity function on "uset" in the form * of an isl_union_pw_multi_aff. */ __isl_give isl_union_pw_multi_aff *isl_union_set_identity_union_pw_multi_aff( __isl_take isl_union_set *uset) { … } /* For each map in "umap" of the form [A -> B] -> C, * construct the map A -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_domain_factor_domain( __isl_take isl_union_map *umap) { … } /* For each map in "umap" of the form [A -> B] -> C, * construct the map B -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_domain_factor_range( __isl_take isl_union_map *umap) { … } /* For each map in "umap" of the form A -> [B -> C], * construct the map A -> B and collect the results. */ __isl_give isl_union_map *isl_union_map_range_factor_domain( __isl_take isl_union_map *umap) { … } /* For each map in "umap" of the form A -> [B -> C], * construct the map A -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_range_factor_range( __isl_take isl_union_map *umap) { … } /* For each map in "umap" of the form [A -> B] -> [C -> D], * construct the map A -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_factor_domain( __isl_take isl_union_map *umap) { … } /* For each map in "umap" of the form [A -> B] -> [C -> D], * construct the map B -> D and collect the results. */ __isl_give isl_union_map *isl_union_map_factor_range( __isl_take isl_union_map *umap) { … } __isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_set *uset) { … } __isl_give isl_union_set *isl_union_map_wrap(__isl_take isl_union_map *umap) { … } struct isl_union_map_is_subset_data { … }; static isl_stat is_subset_entry(void **entry, void *user) { … } isl_bool isl_union_map_is_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { … } isl_bool isl_union_set_is_subset(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { … } isl_bool isl_union_map_is_equal(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { … } isl_bool isl_union_set_is_equal(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { … } isl_bool isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { … } isl_bool isl_union_set_is_strict_subset(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { … } /* 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. */ struct isl_union_map_is_disjoint_data { … }; /* Check if "map" is disjoint from data->umap2 and abort * the search if it is not. */ static isl_stat is_disjoint_entry(void **entry, void *user) { … } /* Are "umap1" and "umap2" disjoint? */ isl_bool isl_union_map_is_disjoint(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { … } /* Are "uset1" and "uset2" disjoint? */ isl_bool isl_union_set_is_disjoint(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { … } static isl_stat sample_entry(void **entry, void *user) { … } __isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap) { … } __isl_give isl_basic_set *isl_union_set_sample(__isl_take isl_union_set *uset) { … } /* Return an element in "uset" in the form of an isl_point. * Return a void isl_point if "uset" is empty. */ __isl_give isl_point *isl_union_set_sample_point(__isl_take isl_union_set *uset) { … } struct isl_forall_data { … }; static isl_stat forall_entry(void **entry, void *user) { … } static isl_bool union_map_forall(__isl_keep isl_union_map *umap, isl_bool (*fn)(__isl_keep isl_map *map)) { … } struct isl_forall_user_data { … }; static isl_stat forall_user_entry(void **entry, void *user) { … } /* Check if fn(map, user) returns true for all maps "map" in umap. */ static isl_bool union_map_forall_user(__isl_keep isl_union_map *umap, isl_bool (*fn)(__isl_keep isl_map *map, void *user), void *user) { … } /* Is "umap" obviously empty? */ isl_bool isl_union_map_plain_is_empty(__isl_keep isl_union_map *umap) { … } isl_bool isl_union_map_is_empty(__isl_keep isl_union_map *umap) { … } isl_bool isl_union_set_is_empty(__isl_keep isl_union_set *uset) { … } static isl_bool is_subset_of_identity(__isl_keep isl_map *map) { … } /* Given an isl_union_map that consists of a single map, check * if it is single-valued. */ static isl_bool single_map_is_single_valued(__isl_keep isl_union_map *umap) { … } /* 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. */ struct isl_union_map_is_sv_data { … }; /* 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. */ static isl_stat single_valued_on_domain(__isl_take isl_set *set, void *user) { … } /* 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. */ isl_bool isl_union_map_is_single_valued(__isl_keep isl_union_map *umap) { … } isl_bool isl_union_map_is_injective(__isl_keep isl_union_map *umap) { … } /* 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. */ static isl_stat map_plain_is_not_identity(__isl_take isl_map *map, void *user) { … } /* 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. */ static isl_bool isl_union_map_plain_is_not_identity( __isl_keep isl_union_map *umap) { … } /* 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. */ static isl_stat map_is_identity(__isl_take isl_map *map, void *user) { … } /* 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. */ isl_bool isl_union_map_is_identity(__isl_keep isl_union_map *umap) { … } /* 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. */ struct isl_fixed_map { … }; static struct isl_fixed_map *alloc_isl_fixed_map_array(isl_ctx *ctx, int n) { … } static void free_isl_fixed_map_array(struct isl_fixed_map *v, int n) { … } /* Compare the "v" field of two isl_fixed_map structs. */ static int qsort_fixed_map_cmp(const void *p1, const void *p2) { … } /* 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 */ struct isl_fixed_dim_data { … }; static isl_bool fixed_at_pos(__isl_keep isl_map *map, void *user) { … } static isl_bool plain_injective_on_range(__isl_take isl_union_map *umap, int first, int n_range); /* 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. */ static int separates(struct isl_fixed_map *v, int n, __isl_take isl_space *space, int pos, int n_range) { … } /* 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. */ static isl_bool plain_injective_on_range(__isl_take isl_union_map *umap, int first, int n_range) { … } /* Check whether the maps in umap that map to subsets of "ran" * have obviously distinct ranges. */ static isl_bool plain_injective_on_range_wrap(__isl_keep isl_set *ran, void *user) { … } /* 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. */ isl_bool isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap) { … } isl_bool isl_union_map_is_bijective(__isl_keep isl_union_map *umap) { … } __isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap) { … } /* Given a union map, take the maps of the form A -> (B -> C) and * return the union of the corresponding maps (A -> B) -> C. */ __isl_give isl_union_map *isl_union_map_uncurry(__isl_take isl_union_map *umap) { … } /* Given a union map, take the maps of the form (A -> B) -> C and * return the union of the corresponding maps A -> (B -> C). */ __isl_give isl_union_map *isl_union_map_curry(__isl_take isl_union_map *umap) { … } /* 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)). */ __isl_give isl_union_map *isl_union_map_range_curry( __isl_take isl_union_map *umap) { … } __isl_give isl_union_set *isl_union_set_lift(__isl_take isl_union_set *uset) { … } static isl_stat coefficients_entry(void **entry, void *user) { … } __isl_give isl_union_set *isl_union_set_coefficients( __isl_take isl_union_set *uset) { … } static isl_stat solutions_entry(void **entry, void *user) { … } __isl_give isl_union_set *isl_union_set_solutions( __isl_take isl_union_set *uset) { … } /* Is the domain space of "map" equal to "space"? */ static int domain_match(__isl_keep isl_map *map, __isl_keep isl_space *space) { … } /* Is the range space of "map" equal to "space"? */ static int range_match(__isl_keep isl_map *map, __isl_keep isl_space *space) { … } /* Is the set space of "map" equal to "space"? */ static int set_match(__isl_keep isl_map *map, __isl_keep isl_space *space) { … } /* 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. */ struct isl_union_map_preimage_data { … }; /* 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. */ static isl_stat preimage_entry(void **entry, void *user) { … } /* 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. */ static __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)) { … } /* 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". */ __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) { … } /* 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". */ __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) { … } /* 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". */ __isl_give isl_union_set *isl_union_set_preimage_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_pw_multi_aff *pma) { … } /* 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". */ __isl_give isl_union_map *isl_union_map_preimage_domain_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma) { … } /* 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". */ __isl_give isl_union_map *isl_union_map_preimage_range_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma) { … } /* 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". */ __isl_give isl_union_map *isl_union_set_preimage_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_multi_aff *ma) { … } /* 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. */ struct isl_union_map_preimage_mpa_data { … }; /* 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. */ static isl_stat preimage_mpa_entry(void **entry, void *user) { … } /* 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. */ static __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)) { … } /* 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". */ __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) { … } /* 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. */ struct isl_union_map_preimage_upma_data { … }; /* 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. */ static isl_stat preimage_upma(__isl_take isl_pw_multi_aff *pma, void *user) { … } /* 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. */ static __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)) { … } /* 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". */ __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) { … } /* 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". */ __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) { … } /* 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". */ __isl_give isl_union_set *isl_union_set_preimage_union_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_union_pw_multi_aff *upma) { … } /* Reset the user pointer on all identifiers of parameters and tuples * of the spaces of "umap". */ __isl_give isl_union_map *isl_union_map_reset_user( __isl_take isl_union_map *umap) { … } /* Reset the user pointer on all identifiers of parameters and tuples * of the spaces of "uset". */ __isl_give isl_union_set *isl_union_set_reset_user( __isl_take isl_union_set *uset) { … } /* Remove all existentially quantified variables and integer divisions * from "umap" using Fourier-Motzkin elimination. */ __isl_give isl_union_map *isl_union_map_remove_divs( __isl_take isl_union_map *umap) { … } /* Remove all existentially quantified variables and integer divisions * from "uset" using Fourier-Motzkin elimination. */ __isl_give isl_union_set *isl_union_set_remove_divs( __isl_take isl_union_set *uset) { … } /* 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. */ struct isl_union_map_project_out_data { … }; /* Turn the data->n dimensions of type data->type, starting at data->first * into existentially quantified variables and add the result to data->res. */ static isl_stat project_out(__isl_take isl_map *map, void *user) { … } /* 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. */ __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) { … } #undef TYPE #define TYPE … #include "isl_project_out_all_params_templ.c" #include "isl_project_out_param_templ.c" /* 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. */ __isl_give isl_union_set *isl_union_set_project_out( __isl_take isl_union_set *uset, enum isl_dim_type type, unsigned first, unsigned n) { … } /* Project out all parameters from "uset" by existentially quantifying * over them. */ __isl_give isl_union_set *isl_union_set_project_out_all_params( __isl_take isl_union_set *uset) { … } /* Internal data structure for isl_union_map_involves_dims. * "first" and "n" are the arguments for the isl_map_involves_dims calls. */ struct isl_union_map_involves_dims_data { … }; /* Does "map" _not_ involve the data->n parameters starting at data->first? */ static isl_bool map_excludes(__isl_keep isl_map *map, void *user) { … } /* 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. */ isl_bool isl_union_map_involves_dims(__isl_keep isl_union_map *umap, enum isl_dim_type type, unsigned first, unsigned n) { … } /* 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. */ struct isl_union_map_reset_range_space_data { … }; /* Replace the range space of "map" by the range space of data->range and * add the result to data->res. */ static isl_stat reset_range_space(__isl_take isl_map *map, void *user) { … } /* 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. */ __isl_give isl_union_map *isl_union_map_reset_range_space( __isl_take isl_union_map *umap, __isl_take isl_space *space) { … } /* Check that "umap" and "space" have the same number of parameters. */ static isl_stat check_union_map_space_equal_dim(__isl_keep isl_union_map *umap, __isl_keep isl_space *space) { … } /* Internal data structure for isl_union_map_reset_equal_dim_space. * "space" is the target space. * "res" collects the results. */ struct isl_union_map_reset_params_data { … }; /* Replace the parameters of "map" by those of data->space and * add the result to data->res. */ static isl_stat reset_params(__isl_take isl_map *map, void *user) { … } /* Replace the space of "umap" by "space", without modifying * the dimension of "umap", i.e., the number of parameters of "umap". * * Since the hash values of the maps in the union map depend * on the parameters, a new union map needs to be constructed. */ __isl_give isl_union_map *isl_union_map_reset_equal_dim_space( __isl_take isl_union_map *umap, __isl_take isl_space *space) { … } /* 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. */ struct isl_union_order_at_data { … }; /* 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. */ static isl_stat order_at(__isl_take isl_map *map, void *user) { … } /* If "mupa" has a non-trivial explicit domain, then intersect * domain and range of "umap" with this explicit domain. * If the explicit domain only describes constraints on the parameters, * then the intersection only needs to be performed once. */ static __isl_give isl_union_map *intersect_explicit_domain( __isl_take isl_union_map *umap, __isl_keep isl_multi_union_pw_aff *mupa) { … } /* 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. */ static __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)) { … } /* Return the subset of "umap" where the domain and the range * have equal "mupa" values. */ __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) { … } #undef ORDER #define ORDER … #include "isl_union_map_lex_templ.c" #undef ORDER #define ORDER … #include "isl_union_map_lex_templ.c" #undef ORDER #define ORDER … #include "isl_union_map_lex_templ.c" #undef ORDER #define ORDER … #include "isl_union_map_lex_templ.c" /* Return the union of the elements in the list "list". */ __isl_give isl_union_set *isl_union_set_list_union( __isl_take isl_union_set_list *list) { … } /* Update *hash with the hash value of "map". */ static isl_stat add_hash(__isl_take isl_map *map, void *user) { … } /* Return a hash value that digests "umap". */ uint32_t isl_union_map_get_hash(__isl_keep isl_union_map *umap) { … } /* Return a hash value that digests "uset". */ uint32_t isl_union_set_get_hash(__isl_keep isl_union_set *uset) { … } /* Add the number of basic sets in "set" to "n". */ static isl_stat add_n(__isl_take isl_set *set, void *user) { … } /* Return the total number of basic sets in "uset". */ int isl_union_set_n_basic_set(__isl_keep isl_union_set *uset) { … } /* Add the basic sets in "set" to "list". */ static isl_stat add_list(__isl_take isl_set *set, void *user) { … } /* Return a list containing all the basic sets in "uset". * * First construct a list of the appropriate size and * then add all the elements. */ __isl_give isl_basic_set_list *isl_union_set_get_basic_set_list( __isl_keep isl_union_set *uset) { … } /* Internal data structure for isl_union_map_remove_map_if. * "fn" and "user" are the arguments to isl_union_map_remove_map_if. */ struct isl_union_map_remove_map_if_data { … }; /* isl_un_op_control filter that negates the result of data->fn * called on "map". */ static isl_bool not(__isl_keep isl_map *map, void *user) { … } /* Dummy isl_un_op_control transformation callback that * simply returns the input. */ static __isl_give isl_map *map_id(__isl_take isl_map *map) { … } /* 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. */ __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) { … } /* Does "map" have "space" as domain (ignoring parameters)? */ static isl_bool has_domain_space_tuples(__isl_keep isl_map *map, void *user) { … } /* Does "map" have "space" as range (ignoring parameters)? */ static isl_bool has_range_space_tuples(__isl_keep isl_map *map, void *user) { … } /* Wrapper around isl_map_bind_range for use as a un_op callback. */ static __isl_give isl_map *bind_range(__isl_take isl_map *map, void *user) { … } /* Bind the output dimensions of "umap" to parameters with identifiers * specified by "tuple", living in the range space of "umap", * for those maps that have a matching range space. */ __isl_give isl_union_set *isl_union_map_bind_range( __isl_take isl_union_map *umap, __isl_take isl_multi_id *tuple) { … } /* Only keep those elements in "umap" that have a domain in "space". */ __isl_give isl_union_map *isl_union_map_intersect_domain_space( __isl_take isl_union_map *umap, __isl_take isl_space *space) { … } /* Only keep those elements in "umap" that have a range in "space". */ __isl_give isl_union_map *isl_union_map_intersect_range_space( __isl_take isl_union_map *umap, __isl_take isl_space *space) { … }
Codebase Browser
llvm