This contains the private implementation of the suppression engine of libabigail.
More...
|
typedef unordered_set< const class_or_union * > | class_set_type |
| A convenience typedef for a set of pointer to class_or_union. More...
|
|
typedef unordered_set< const function_type * > | fn_set_type |
| A convenience typedef for a set of pointer to function_type. More...
|
|
typedef unordered_map< uint64_t_pair_type, bool, uint64_t_pair_hash > | type_comparison_result_type |
| A convenience typedef for a map which key is a pair of uint64_t and which value is a boolean. This is initially intended to cache the result of comparing two (sub-)types. More...
|
|
typedef std::pair< uint64_t, uint64_t > | uint64_t_pair_type |
| A convenience typedef for a pair of uint64_t which is initially intended to store a pair of pointer values. More...
|
|
typedef unordered_set< uint64_t_pair_type, uint64_t_pair_hash > | uint64_t_pairs_set_type |
| A convenience typedef for a set of uint64_t_pair. More...
|
|
|
template<typename input_iterator , typename deref_lambda > |
void | canonicalize_types (const input_iterator &begin, const input_iterator &end, deref_lambda deref, bool do_log=false, bool show_stats=false) |
| Compute the canonical type for all the IR types of the system. More...
|
|
bool | compare_using_locations (const decl_base *f, const decl_base *s) |
| Compare decls using their locations. More...
|
|
template<typename T > |
hash_t | do_hash_value (const shared_ptr< T > &tod) |
| Compute the hash value of an IR node and return it. More...
|
|
template<typename T > |
hash_t | do_hash_value (const T &tod) |
| Compute the hash value of an IR node and return it. More...
|
|
template<typename T > |
hash_t | do_hash_value (const T *tod) |
| Compute the hash value of an IR node and return it. More...
|
|
size_t | get_canonical_type_index (const type_base &t) |
| Getter of the canonical type index of a given type. More...
|
|
size_t | get_canonical_type_index (const type_base *t) |
| Getter of the canonical type index of a given type. More...
|
|
size_t | get_canonical_type_index (const type_base_sptr &t) |
| Getter of the canonical type index of a given type. More...
|
|
template<typename IteratorType , typename deref_lambda > |
void | hash_and_canonicalize_types (IteratorType begin, IteratorType end, deref_lambda deref, bool do_log=false, bool show_stats=false) |
| Hash and canonicalize a sequence of types. More...
|
|
bool | is_ptr_ref_or_qual_type (const type_base *t) |
| Helper to detect if a type is either a reference, a pointer, or a qualified type. More...
|
|
real_type::modifiers_type | operator& (real_type::modifiers_type l, real_type::modifiers_type r) |
| Bitwise AND operator for real_type::modifiers_type. More...
|
|
real_type::modifiers_type & | operator&= (real_type::modifiers_type &l, real_type::modifiers_type r) |
| Bitwise &= operator for real_type::modifiers_type. More...
|
|
real_type::modifiers_type | operator| (real_type::modifiers_type l, real_type::modifiers_type r) |
| Bitwise OR operator for real_type::modifiers_type. More...
|
|
real_type::modifiers_type & | operator|= (real_type::modifiers_type &l, real_type::modifiers_type r) |
| Bitwise |= operator for real_type::modifiers_type. More...
|
|
real_type::modifiers_type | operator~ (real_type::modifiers_type l) |
| Bitwise one's complement operator for real_type::modifiers_type. More...
|
|
bool | parse_real_type (const string &str, real_type &type) |
| Parse a real type from a string. More...
|
|
template<typename T > |
hash_t | set_or_get_cached_hash_value (const T &tod) |
| Set the hash value of an IR node and return it. More...
|
|
template<typename T > |
hash_t | set_or_get_cached_hash_value (const T *artifact) |
| Set the hash value of an IR node and return it. More...
|
|
template<typename IteratorType , typename deref_lambda > |
void | sort_and_canonicalize_types (IteratorType begin, IteratorType end, deref_lambda deref) |
| Sort and canonicalize a sequence of types. More...
|
|
template<typename IteratorType > |
void | sort_types_for_hash_computing_and_c14n (IteratorType begin, IteratorType end) |
| Sort types before hashing (and then canonicalizing) them. More...
|
|
void | sort_types_for_hash_computing_and_c14n (vector< type_base_sptr > &types) |
| Sort types right before hashing and canonicalizing them. More...
|
|
bool | type_is_suitable_for_hash_computing (const type_base &t) |
| Test if we should attempt to compute a hash value for a given type. More...
|
|
bool | type_originates_from_corpus (type_base_sptr t, corpus_sptr &c) |
| Test if a type originates from a corpus. More...
|
|
This contains the private implementation of the suppression engine of libabigail.
Definition in file abg-ir-priv.h.