/external/llvm/lib/Fuzzer/test/ |
H A D | SimpleHashTest.cpp | 16 uint32_t Hash = 0x12039854; local 18 Hash += Data[i]; 19 Hash += (Hash << 10); 20 Hash ^= (Hash >> 6); 22 Hash += (Hash << 3); 23 Hash ^= (Hash >> 1 [all...] |
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
H A D | hash_copy_constructible.fail.cpp | 21 struct Hash { struct 24 Hash () {} function in struct:Hash 26 Hash (const Hash &); // declared but not defined 31 std::unordered_map<int, int, Hash<int> > m;
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
H A D | hash_copy_constructible.fail.cpp | 21 struct Hash { struct 24 Hash () {} function in struct:Hash 26 Hash (const Hash &); // declared but not defined 31 std::unordered_multimap<int, int, Hash<int> > m;
|
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
H A D | hash_copy_constructible.fail.cpp | 18 struct Hash { struct 21 Hash () {} function in struct:Hash 23 Hash (const Hash &); // declared but not defined 28 std::unordered_multiset<int, Hash<int> > m;
|
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
H A D | hash_copy_constructible.fail.cpp | 18 struct Hash { struct 21 Hash () {} function in struct:Hash 23 Hash (const Hash &); // declared but not defined 28 std::unordered_set<int, Hash<int> > m;
|
/external/libcxx/test/support/ |
H A D | poisoned_hash_helper.hpp | 24 // Test that the specified Hash meets the requirements of an enabled hash 25 template <class Hash, class Key, class InputKey = Key> 33 // Test that the specified Hash meets the requirements of a disabled hash. 34 template <class Hash, class Key> 130 template <class Hash, class Key, class InputKey> 134 static_assert(std::is_destructible<Hash>::value, ""); 136 static_assert(std::is_default_constructible<Hash>::value, ""); 137 static_assert(std::is_copy_constructible<Hash>::value, ""); 138 static_assert(std::is_move_constructible<Hash>::value, ""); 139 static_assert(std::is_copy_assignable<Hash> [all...] |
/external/llvm/unittests/Support/ |
H A D | raw_sha1_ostream_test.cpp | 35 auto Hash = toHex(Sha1Stream.sha1()); local 37 ASSERT_EQ("2EF7BDE608CE5404E97D5F042F95F89F1C232871", Hash); 45 auto Hash = toHex(Sha1Stream.sha1()); local 47 ASSERT_EQ("F7FF9E8B7BB2E09B70935A5D785E0CC5D9D0ABF0", Hash); 49 Hash = toHex(Sha1Stream.sha1()); 56 ASSERT_EQ(NonSplitHash, Hash); 62 auto Hash = toHex(Sha1Stream.sha1()); local 64 ASSERT_EQ("F7FF9E8B7BB2E09B70935A5D785E0CC5D9D0ABF0", Hash); 68 Hash = toHex(Sha1Stream.sha1()); 70 ASSERT_EQ("7447F2A5A42185C8CF91E632789C431830B59067", Hash); [all...] |
H A D | MD5Test.cpp | 24 MD5 Hash; local 25 Hash.update(Input); 27 Hash.final(MD5Res); 34 MD5 Hash; local 35 Hash.update(Input); 37 Hash.final(MD5Res);
|
/external/compiler-rt/lib/ubsan/ |
H A D | ubsan_handlers_cxx.h | 33 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash); 36 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
|
/external/swiftshader/third_party/PowerVR_SDK/Tools/ |
H A D | PVRTStringHash.cpp | 5 @Title String Hash 111 return (m_Hash == _Str.Hash()); 116 @Input Hash A hash to compare with 120 bool CPVRTStringHash::operator==(const CPVRTHash& Hash) const 122 return (m_Hash == Hash); 159 return (m_Hash != _Str.Hash()); 164 @Input Hash A hash to compare with 168 bool CPVRTStringHash::operator!=(const CPVRTHash& Hash) const 170 return (m_Hash != Hash); 184 @Function Hash 188 const CPVRTHash& CPVRTStringHash::Hash() const function in class:CPVRTStringHash [all...] |
H A D | PVRTStringHash.h | 98 @param[in] Hash A Hash to compare with 101 bool operator==(const CPVRTHash& Hash) const; 113 @param[in] Hash A Hash to compare with 116 bool operator!=(const CPVRTHash& Hash) const; 127 @fn Hash 130 const CPVRTHash& Hash() const;
|
/external/webrtc/webrtc/base/ |
H A D | socketaddresspair.cc | 37 size_t SocketAddressPair::Hash() const { function in class:rtc::SocketAddressPair 38 return src_.Hash() ^ dest_.Hash();
|
/external/libchrome/base/containers/ |
H A D | hash_tables.h | 46 class Hash = BASE_HASH_NAMESPACE::hash<Key>, 49 using hash_map = std::unordered_map<Key, T, Hash, Pred, Alloc>; 54 class Hash = BASE_HASH_NAMESPACE::hash<Key>, 57 using hash_multimap = std::unordered_multimap<Key, T, Hash, Pred, Alloc>; 61 class Hash = BASE_HASH_NAMESPACE::hash<Key>, 64 using hash_multiset = std::unordered_multiset<Key, Hash, Pred, Alloc>; 68 class Hash = BASE_HASH_NAMESPACE::hash<Key>, 71 using hash_set = std::unordered_set<Key, Hash, Pred, Alloc>;
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
H A D | FoldingSet.cpp | 1 //===-- Support/FoldingSet.cpp - Uniquing Hash Set --------------*- C++ -*-===// 33 unsigned Hash = static_cast<unsigned>(Size); local 36 Hash += Data & 0xFFFF; 37 unsigned Tmp = ((Data >> 16) << 11) ^ Hash; 38 Hash = (Hash << 16) ^ Tmp; 39 Hash += Hash >> 11; 43 Hash ^= Hash << 208 GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) argument [all...] |
/external/libchrome/sandbox/linux/bpf_dsl/ |
H A D | codegen_unittest.cc | 23 // Hash provides an abstraction for building "hash trees" from BPF 29 class Hash { class in namespace:sandbox::__anon10154 31 static const Hash kZero; 33 Hash() : digest_() {} function in class:sandbox::__anon10154::Hash 35 Hash(uint16_t code, function in class:sandbox::__anon10154::Hash 37 const Hash& jt = kZero, 38 const Hash& jf = kZero) 49 Hash(const Hash& hash) = default; 50 Hash [all...] |
/external/llvm/include/llvm/Support/ |
H A D | MD5.h | 71 MD5 Hash; local 72 Hash.update(Str); 74 Hash.final(Result);
|
/external/v8/src/ |
H A D | lookup-cache-inl.h | 13 int DescriptorLookupCache::Hash(Object* source, Name* name) { function in class:v8::internal::DescriptorLookupCache 24 int index = Hash(source, name); 32 int index = Hash(source, name);
|
/external/libcxx/test/std/containers/unord/unord.map/ |
H A D | swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 32 typedef test_hash<std::hash<int> > Hash; typedef 35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; 36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 37 C c2(0, Hash(2), Compare(2), Alloc(1, 2)); 43 assert(c1.hash_function() == Hash(2)); 52 assert(c2.hash_function() == Hash(1)); 60 typedef test_hash<std::hash<int> > Hash; typedef 63 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; 76 C c1(0, Hash( 108 typedef test_hash<std::hash<int> > Hash; typedef 150 typedef test_hash<std::hash<int> > Hash; typedef 212 typedef test_hash<std::hash<int> > Hash; typedef 240 typedef test_hash<std::hash<int> > Hash; typedef 288 typedef test_hash<std::hash<int> > Hash; typedef 330 typedef test_hash<std::hash<int> > Hash; typedef 392 typedef test_hash<std::hash<int> > Hash; typedef 420 typedef test_hash<std::hash<int> > Hash; typedef 468 typedef test_hash<std::hash<int> > Hash; typedef 510 typedef test_hash<std::hash<int> > Hash; typedef [all...] |
/external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
H A D | swap_non_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 32 typedef test_hash<std::hash<int> > Hash; typedef 35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; 36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 37 C c2(0, Hash(2), Compare(2), Alloc(1, 2)); 43 assert(c1.hash_function() == Hash(2)); 52 assert(c2.hash_function() == Hash(1)); 60 typedef test_hash<std::hash<int> > Hash; typedef 63 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; 76 C c1(0, Hash( 108 typedef test_hash<std::hash<int> > Hash; typedef 150 typedef test_hash<std::hash<int> > Hash; typedef 212 typedef test_hash<std::hash<int> > Hash; typedef 240 typedef test_hash<std::hash<int> > Hash; typedef 288 typedef test_hash<std::hash<int> > Hash; typedef 330 typedef test_hash<std::hash<int> > Hash; typedef 392 typedef test_hash<std::hash<int> > Hash; typedef 420 typedef test_hash<std::hash<int> > Hash; typedef 468 typedef test_hash<std::hash<int> > Hash; typedef 510 typedef test_hash<std::hash<int> > Hash; typedef [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/ |
H A D | swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 typedef test_hash<std::hash<int> > Hash; typedef 34 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 36 C c2(0, Hash(2), Compare(2), Alloc(1, 2)); 42 assert(c1.hash_function() == Hash(2)); 51 assert(c2.hash_function() == Hash(1)); 59 typedef test_hash<std::hash<int> > Hash; typedef 62 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; 75 C c1(0, Hash( 107 typedef test_hash<std::hash<int> > Hash; typedef 149 typedef test_hash<std::hash<int> > Hash; typedef 211 typedef test_hash<std::hash<int> > Hash; typedef 239 typedef test_hash<std::hash<int> > Hash; typedef 287 typedef test_hash<std::hash<int> > Hash; typedef 329 typedef test_hash<std::hash<int> > Hash; typedef 391 typedef test_hash<std::hash<int> > Hash; typedef 419 typedef test_hash<std::hash<int> > Hash; typedef 467 typedef test_hash<std::hash<int> > Hash; typedef 509 typedef test_hash<std::hash<int> > Hash; typedef [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
H A D | swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 typedef test_hash<std::hash<int> > Hash; typedef 34 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 36 C c2(0, Hash(2), Compare(2), Alloc(1, 2)); 42 assert(c1.hash_function() == Hash(2)); 51 assert(c2.hash_function() == Hash(1)); 59 typedef test_hash<std::hash<int> > Hash; typedef 62 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; 75 C c1(0, Hash( 107 typedef test_hash<std::hash<int> > Hash; typedef 149 typedef test_hash<std::hash<int> > Hash; typedef 211 typedef test_hash<std::hash<int> > Hash; typedef 239 typedef test_hash<std::hash<int> > Hash; typedef 287 typedef test_hash<std::hash<int> > Hash; typedef 329 typedef test_hash<std::hash<int> > Hash; typedef 391 typedef test_hash<std::hash<int> > Hash; typedef 419 typedef test_hash<std::hash<int> > Hash; typedef 467 typedef test_hash<std::hash<int> > Hash; typedef 509 typedef test_hash<std::hash<int> > Hash; typedef [all...] |
/external/libcxx/test/std/containers/unord/unord.set/ |
H A D | swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 typedef test_hash<std::hash<int> > Hash; typedef 34 typedef std::unordered_set<int, Hash, Compare, Alloc> C; 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 36 C c2(0, Hash(2), Compare(2), Alloc(1, 2)); 42 assert(c1.hash_function() == Hash(2)); 51 assert(c2.hash_function() == Hash(1)); 59 typedef test_hash<std::hash<int> > Hash; typedef 62 typedef std::unordered_set<int, Hash, Compare, Alloc> C; 75 C c1(0, Hash( 107 typedef test_hash<std::hash<int> > Hash; typedef 149 typedef test_hash<std::hash<int> > Hash; typedef 211 typedef test_hash<std::hash<int> > Hash; typedef 239 typedef test_hash<std::hash<int> > Hash; typedef 287 typedef test_hash<std::hash<int> > Hash; typedef 329 typedef test_hash<std::hash<int> > Hash; typedef 391 typedef test_hash<std::hash<int> > Hash; typedef 419 typedef test_hash<std::hash<int> > Hash; typedef 467 typedef test_hash<std::hash<int> > Hash; typedef 509 typedef test_hash<std::hash<int> > Hash; typedef [all...] |
/external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
H A D | swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 typedef test_hash<std::hash<int> > Hash; typedef 34 typedef std::unordered_set<int, Hash, Compare, Alloc> C; 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 36 C c2(0, Hash(2), Compare(2), Alloc(1, 2)); 42 assert(c1.hash_function() == Hash(2)); 51 assert(c2.hash_function() == Hash(1)); 59 typedef test_hash<std::hash<int> > Hash; typedef 62 typedef std::unordered_set<int, Hash, Compare, Alloc> C; 75 C c1(0, Hash( 107 typedef test_hash<std::hash<int> > Hash; typedef 149 typedef test_hash<std::hash<int> > Hash; typedef 211 typedef test_hash<std::hash<int> > Hash; typedef 239 typedef test_hash<std::hash<int> > Hash; typedef 287 typedef test_hash<std::hash<int> > Hash; typedef 329 typedef test_hash<std::hash<int> > Hash; typedef 391 typedef test_hash<std::hash<int> > Hash; typedef 419 typedef test_hash<std::hash<int> > Hash; typedef 467 typedef test_hash<std::hash<int> > Hash; typedef 509 typedef test_hash<std::hash<int> > Hash; typedef [all...] |
/external/v8/src/compiler/ |
H A D | node-cache.cc | 24 template <typename Key, typename Hash, typename Pred> 25 struct NodeCache<Key, Hash, Pred>::Entry { 31 template <typename Key, typename Hash, typename Pred> 32 bool NodeCache<Key, Hash, Pred>::Resize(Zone* zone) { 64 template <typename Key, typename Hash, typename Pred> 65 Node** NodeCache<Key, Hash, Pred>::Find(Zone* zone, Key key) { 102 template <typename Key, typename Hash, typename Pred> 103 void NodeCache<Key, Hash, Pred>::GetCachedNodes(ZoneVector<Node*>* nodes) {
|
/external/llvm/lib/DebugInfo/PDB/Raw/ |
H A D | Hash.cpp | 1 //===- Hash.cpp - PDB Hash Functions --------------------------------------===// 10 #include "llvm/DebugInfo/PDB/Raw/Hash.h" 33 // Maximum of 3 bytes left. Hash a 2 byte word if possible, then hash the 57 uint32_t Hash = 0xb170a1bf; local 65 Hash += Item; 66 Hash += (Hash << 10); 67 Hash ^= (Hash >> 127 uint32_t Hash = 0; local [all...] |