| /third_party/libabigail/src/ |
| H A D | abg-hash.cc | 22 namespace hashing namespace
78 }//end namespace hashing
101 v = hashing::combine_hashes(v, size_t_hash(t.get_size_in_bits())); in operator ()()
102 v = hashing::combine_hashes(v, size_t_hash(t.get_alignment_in_bits())); in operator ()()
134 v = hashing::combine_hashes(v, str_hash(d.get_linkage_name())); in operator ()()
136 v = hashing::combine_hashes(v, str_hash(d.get_qualified_name())); in operator ()()
139 v = hashing::combine_hashes(v, get_member_access_specifier(d)); in operator ()()
140 v = hashing::combine_hashes(v, get_member_is_static(d)); in operator ()()
156 v = hashing::combine_hashes(v, decl_hash(t)); in operator ()()
157 v = hashing in operator ()()
[all...] |
| H A D | abg-ir-priv.h | 354 /// The hashing functor for a pair of uint64_t.
362 {return abigail::hashing::combine_hashes(p.first, p.second);} in operator ()()
|
| H A D | abg-comparison-priv.h | 54 /// A hashing functor for @ref types_or_decls_type.
62 return hashing::combine_hashes(h1, h2); in operator ()()
80 /// A hashing functor for using @ref diff_sptr and @ref diff* in a
|
| H A D | abg-dwarf-reader.cc | 142 {return abigail::hashing::combine_hashes(p.first, p.second);} in operator ()()
186 {return abigail::hashing::combine_hashes(p.source_, p.offset_);} in operator ()()
196 size_t h1 = abigail::hashing::combine_hashes(p.first.source_, in operator ()()
198 size_t h2 = abigail::hashing::combine_hashes(p.second.source_, in operator ()()
200 return abigail::hashing::combine_hashes(h1, h2); in operator ()()
|
| H A D | abg-ir.cc | 25717 /// This function intends to provides the fastest possible hashing for
25750 h = hashing::combine_hashes(h, hash_string(repr)); in hash_type_or_decl()
25759 h = hashing::combine_hashes(h, hash_string(repr)); in hash_type_or_decl()
25769 h = hashing::combine_hashes(h, hash_unsigned(p->get_index())); in hash_type_or_decl()
25770 h = hashing::combine_hashes(h, hash_bool(p->get_variadic_marker())); in hash_type_or_decl()
25780 h = hashing::combine_hashes(h, hash_member(*bs)); in hash_type_or_decl()
25781 h = hashing::combine_hashes(h, hash_size(bs->get_offset_in_bits())); in hash_type_or_decl()
25782 h = hashing::combine_hashes(h, hash_bool(bs->get_is_virtual())); in hash_type_or_decl()
25799 /// This function intends to provides the fastest possible hashing for
|
| H A D | abg-writer.cc | 112 /// The hashing functor of for the set of non canonicalized types, aka
461 /// in a hash table, hashing the type. So if the type has no id
469 /// in a hash table, hashing the type. So if the type has no id
491 size_t hash = hashing::fnv_hash(pretty); in get_id_for_type()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Support/ |
| H A D | Hashing.cpp | 10 // This file provides implementation bits for the LLVM common hashing
23 size_t llvm::hashing::detail::fixed_seed_override = 0;
28 hashing::detail::fixed_seed_override = fixed_value; in set_fixed_execution_hash_seed()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| H A D | Hashing.cpp | 9 // This file provides implementation bits for the LLVM common hashing
22 uint64_t llvm::hashing::detail::fixed_seed_override = 0;
27 hashing::detail::fixed_seed_override = fixed_value; in set_fixed_execution_hash_seed()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| H A D | Hashing.h | 1 //===-- llvm/ADT/Hashing.h - Utilities for hashing --------------*- C++ -*-===//
10 // This file implements the newly proposed standard C++ interfaces for hashing
18 // data. It is the intended product of hashing, and can be used to implement
25 // construction of hashing datastructures.
28 // user-defined type which wishes to be used within a hashing context. It
37 // Note that 'hash_combine_range' contains very special logic for hashing
62 /// This object represents the result of hashing some entity. It is intended to
63 /// be used to implement hashtables or other hashing-based data structures.
124 /// This hashing library uses a per-execution seed designed to change on each
142 namespace hashing { namespace
486 namespace hashing { global() namespace
610 namespace hashing { global() namespace
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | Hashing.h | 1 //===-- llvm/ADT/Hashing.h - Utilities for hashing --------------*- C++ -*-===//
9 // This file implements the newly proposed standard C++ interfaces for hashing
17 // data. It is the intended product of hashing, and can be used to implement
24 // construction of hashing datastructures.
27 // user-defined type which wishes to be used within a hashing context. It
36 // Note that 'hash_combine_range' contains very special logic for hashing
61 /// This object represents the result of hashing some entity. It is intended to
62 /// be used to implement hashtables or other hashing-based data structures.
123 /// This hashing library uses a per-execution seed designed to change on each
141 namespace hashing { namespace
484 namespace hashing { global() namespace
608 namespace hashing { global() namespace
[all...] |
| /third_party/libabigail/include/ |
| H A D | abg-hash.h | 17 /// Namespace for hashing.
18 namespace hashing namespace
27 }//end namespace hashing
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| H A D | FunctionComparator.cpp | 890 // without saving these values to an intermediate buffer. This form of hashing
901 Hash = hashing::detail::hash_16_bytes(Hash, V); in add()
|
| /third_party/node/deps/openssl/openssl/crypto/poly1305/asm/ |
| H A D | poly1305-armv4.pl | 562 @ 5*H4 - by 5*5 52-bit addends, or 57 bits. But when hashing the
|
| /third_party/openssl/crypto/poly1305/asm/ |
| H A D | poly1305-armv4.pl | 562 @ 5*H4 - by 5*5 52-bit addends, or 57 bits. But when hashing the
|