| /external/chromium_org/net/quic/crypto/ |
| null_decrypter.cc | 29 uint128 hash; local
30 if (!ReadHash(&reader, &hash)) {
39 if (hash != ComputeHash(buffer)) {
54 uint128 hash; local
55 if (!ReadHash(&reader, &hash)) {
65 if (hash != ComputeHash(buffer)) {
75 bool NullDecrypter::ReadHash(QuicDataReader* reader, uint128* hash) {
82 *hash = hi;
83 *hash <<= 64;
84 *hash += lo
[all...] |
| /external/kernel-headers/original/linux/sunrpc/ |
| svcauth.h | 17 #include <linux/hash.h>
49 struct hlist_node hash; member in struct:auth_domain
132 unsigned long hash = 0; local
143 hash = hash_long(hash^l, BITS_PER_LONG);
145 return hash >> (BITS_PER_LONG - bits);
150 unsigned long hash = 0; local
162 hash = hash_long(hash^l, BITS_PER_LONG);
164 return hash >> (BITS_PER_LONG - bits)
[all...] |
| /external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/ |
| hash.h | 59 // Make hash<T> be the same as less<T>. Note that everywhere where custom
60 // hash functions are defined in the protobuf code, they are also defined such
63 struct hash { struct in namespace:google::protobuf
64 // Dummy, just to make derivative hash functions compile.
77 struct hash<const char*> { struct in namespace:google::protobuf
78 // Dummy, just to make derivative hash functions compile.
90 typename HashFcn = hash<Key>,
98 typename HashFcn = hash<Key>,
108 struct hash : public HASH_NAMESPACE::hash_compare<Key> {
121 struct hash<const char*
190 struct hash<string> { struct in namespace:google::protobuf
203 struct hash<pair<First, Second> > { struct in namespace:google::protobuf
[all...] |
| /external/protobuf/src/google/protobuf/stubs/ |
| hash.h | 59 // Make hash<T> be the same as less<T>. Note that everywhere where custom
60 // hash functions are defined in the protobuf code, they are also defined such
63 struct hash { struct in namespace:google::protobuf
64 // Dummy, just to make derivative hash functions compile.
77 struct hash<const char*> { struct in namespace:google::protobuf
78 // Dummy, just to make derivative hash functions compile.
90 typename HashFcn = hash<Key>,
96 typename HashFcn = hash<Key>,
104 struct hash : public HASH_NAMESPACE::hash_compare<Key> {
117 struct hash<const char*
178 struct hash<string> { struct in namespace:google::protobuf
191 struct hash<pair<First, Second> > { struct in namespace:google::protobuf
[all...] |
| /external/libphonenumber/java/src/com/android/i18n/phonenumbers/ |
| Phonenumber.java | 227 int hash = 41; local
228 hash = (53 * hash) + getCountryCode();
229 hash = (53 * hash) + Long.valueOf(getNationalNumber()).hashCode();
230 hash = (53 * hash) + getExtension().hashCode();
231 hash = (53 * hash) + (isItalianLeadingZero() ? 1231 : 1237);
232 hash = (53 * hash) + getRawInput().hashCode()
[all...] |
| /art/compiler/utils/ |
| dedupe_set_test.cc | 29 size_t hash = 0; local
31 hash += c;
32 hash += hash << 10;
33 hash += hash >> 6;
35 return hash;
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| cache.cc | 11 #include "util/hash.h"
34 uint32_t hash; // Hash of key(); used for fast sharding and comparisons member in struct:leveldb::__anon11714::LRUHandle
48 // We provide our own simple hash table since it removes a whole bunch
49 // of porting hacks and is also faster than some of the built-in hash
58 LRUHandle* Lookup(const Slice& key, uint32_t hash) {
59 return *FindPointer(key, hash);
63 LRUHandle** ptr = FindPointer(h->key(), h->hash);
78 LRUHandle* Remove(const Slice& key, uint32_t hash) {
79 LRUHandle** ptr = FindPointer(key, hash);
119 uint32_t hash = h->hash; local
295 const uint32_t hash = HashSlice(key); local
299 const uint32_t hash = HashSlice(key); local
307 const uint32_t hash = HashSlice(key); local
[all...] |
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_init.c | 20 #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize
25 @param hash The index of the hash you want to use
30 int hmac_init(hmac_state *hmac, int hash, const unsigned char *key, unsigned long keylen)
40 /* valid hash? */
41 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
44 hmac->hash = hash;
45 hashsize = hash_descriptor[hash].hashsize;
68 if ((err = hash_memory(hash, key, keylen, hmac->key, &z)) != CRYPT_OK)
[all...] |
| /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cert/selector/ |
| MSOutlookKeyIdCalculator.java | 15 byte[] hash = new byte[dig.getDigestSize()];
29 dig.doFinal(hash, 0);
31 return hash;
|
| /external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p6.cpp | 17 template<typename T> struct hash { }; struct
24 hash<T> h;
32 template<> struct hash<S> { struct
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| PathCache.h | 27 hash::StringCompare<llvm::StringRef> > HashEntryType;
30 typedef HashTable<HashEntryType, hash::StringHash<hash::BKDR>, EntryFactory<HashEntryType> > PathCache;
|
| /hardware/samsung_slsi/exynos5/mobicore/daemon/Daemon/Server/public/ |
| NetlinkServer.h | 104 * Retreive connection based on hash.
105 * Search the peer connections hashmap for a hash and return
112 uint64_t hash
124 uint64_t hash,
137 uint64_t hash
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
|
| /system/core/libcutils/ |
| hashmap.c | 29 int hash; member in struct:Entry
37 int (*hash)(void* key); member in struct:Hashmap
44 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB)) {
45 assert(hash != NULL);
69 map->hash = hash;
81 int h = map->hash(key);
97 static inline size_t calculateIndex(size_t bucketCount, int hash) {
98 return ((size_t) hash) & (bucketCount - 1);
118 size_t index = calculateIndex(newBucketCount, entry->hash);
190 int hash = hashKey(map, key); local
222 int hash = hashKey(map, key); local
237 int hash = hashKey(map, key); local
253 int hash = hashKey(map, key); local
285 int hash = hashKey(map, key); local
[all...] |
