| /external/ltrace/testsuite/ltrace.main/ |
| signals.exp | 25 } elseif [ regexp {Couldn't get .hash data} $exec_output ] {
26 fail "Couldn't get .hash data!"
|
| /external/ltrace/testsuite/ltrace.minor/ |
| libdl-simple.exp | 30 } elseif [ regexp {Couldn't get .hash data} $exec_output ] {
31 fail "Couldn't get .hash data!"
|
| print-instruction-pointer.exp | 24 } elseif [ regexp {Couldn't get .hash data} $exec_output ] {
25 fail "Couldn't get .hash data!"
|
| /external/ltrace/testsuite/ltrace.torture/ |
| ia64-sigill.exp | 22 } elseif [ regexp {Couldn't get .hash data} $exec_output ] {
23 fail "Couldn't get .hash data!"
|
| signals.exp | 25 } elseif [ regexp {Couldn't get .hash data} $exec_output ] {
26 fail "Couldn't get .hash data!"
|
| vfork-thread.exp | 24 } elseif [ regexp {Couldn't get .hash data} $exec_output ] {
25 fail "Couldn't get .hash data!"
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_keymap.c | 82 * Return 4-byte hash key for a block of bytes.
85 hash(const void *key, unsigned keySize) function
87 unsigned i, hash; local
91 hash = 0;
93 hash ^= (i + 1) * ((const unsigned *) key)[i];
96 /*hash = hash ^ (hash >> 11) ^ (hash >> 22);*/
98 return hash;
[all...] |
| /external/openssh/ |
| kexdhc.c | 103 u_char hash[SSH_DIGEST_MAX_LENGTH]; local
165 hashlen = sizeof(hash);
175 hash, &hashlen)) != 0)
178 if ((r = sshkey_verify(server_host_key, signature, slen, hash, hashlen,
190 memcpy(kex->session_id, hash, kex->session_id_len);
193 if ((r = kex_derive_keys_bn(ssh, hash, hashlen, shared_secret)) == 0)
196 explicit_bzero(hash, sizeof(hash));
|
| kexdhs.c | 94 u_char hash[SSH_DIGEST_MAX_LENGTH]; local
159 hashlen = sizeof(hash);
169 hash, &hashlen)) != 0)
180 memcpy(kex->session_id, hash, kex->session_id_len);
185 &signature, &slen, hash, hashlen, ssh->compat)) < 0)
198 if ((r = kex_derive_keys_bn(ssh, hash, hashlen, shared_secret)) == 0)
201 explicit_bzero(hash, sizeof(hash));
|
| kexecdhc.c | 109 u_char hash[SSH_DIGEST_MAX_LENGTH]; local
176 hashlen = sizeof(hash);
188 hash, &hashlen)) != 0)
191 if ((r = sshkey_verify(server_host_key, signature, slen, hash,
203 memcpy(kex->session_id, hash, kex->session_id_len);
206 if ((r = kex_derive_keys_bn(ssh, hash, hashlen, shared_secret)) == 0)
209 explicit_bzero(hash, sizeof(hash));
|
| kexgexc.c | 160 u_char hash[SSH_DIGEST_MAX_LENGTH]; local
229 hashlen = sizeof(hash);
242 hash, &hashlen)) != 0)
245 if ((r = sshkey_verify(server_host_key, signature, slen, hash,
257 memcpy(kex->session_id, hash, kex->session_id_len);
260 if ((r = kex_derive_keys_bn(ssh, hash, hashlen, shared_secret)) == 0)
263 explicit_bzero(hash, sizeof(hash));
|
| /external/vboot_reference/tests/ |
| sha_benchmark.c | 17 /* Table of hash function pointers and their description. */
20 Hashptr hash; member in struct:HashFxTable
39 /* Iterate through all the hash functions. */
42 hash_functions[i].hash(buffer, TEST_BUFFER_SIZE, digest);
|
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_pwd_common.h | 69 void eap_pwd_h_update(struct crypto_hash *hash, const u8 *data, size_t len);
70 void eap_pwd_h_final(struct crypto_hash *hash, u8 *digest);
|
| /external/wpa_supplicant_8/src/tls/ |
| pkcs5.c | 143 u8 hash[MD5_MAC_LEN]; local
154 if (md5_vector(2, addr, len, hash) < 0)
156 addr[0] = hash;
159 if (md5_vector(1, addr, len, hash) < 0)
163 wpa_hexdump_key(MSG_DEBUG, "PKCS #5: DES key", hash, 8);
164 wpa_hexdump_key(MSG_DEBUG, "PKCS #5: DES IV", hash + 8, 8);
166 return crypto_cipher_init(CRYPTO_CIPHER_ALG_DES, hash + 8, hash, 8);
|
| /frameworks/base/tests/CoreTests/android/core/ |
| Sha1Test.java | 50 byte[] hash = digest.digest();
51 String encodedHash = encodeHex(hash);
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashBase.h | 26 * \brief HashBucket is an entry in the hash table.
45 * HashTableImpl uses open-addressing, linear probing hash table.
46 * linear probing hash table obviously has high performance when the
49 * than the size of the hash table.
59 * example, on-device linkers needs a more light-weight hash function
61 * change the hash functions.
88 hasher& hash() { return m_Hasher; } function in class:mcld::HashTableImpl
90 const hasher& hash() const { return m_Hasher; } function in class:mcld::HashTableImpl
93 /// initialize the hash table.
109 /// doRehash - re-new the hash table, and rehash all elements into the ne
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| bucket_count.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
53 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
61 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| max_load_factor.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
47 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
54 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
| init.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
33 test_hash<std::hash<int> >,
52 assert(c.hash_function() == test_hash<std::hash<int> >());
65 test_hash<std::hash<int> >,
84 assert(c.hash_function() == test_hash<std::hash<int> >());
98 typedef test_hash<std::hash<int>> HF;
117 assert(c.hash_function() == test_hash<std::hash<int> >());
129 typedef test_hash<std::hash<int>> HF;
150 assert(!(c.hash_function() == test_hash<std::hash<int> >()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| max_load_factor.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
47 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
54 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| bucket_count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
52 typedef std::unordered_multiset<int, std::hash<int>,
60 typedef std::unordered_multiset<int, std::hash<int>,
|
| load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
51 typedef std::unordered_multiset<int, std::hash<int>,
69 typedef std::unordered_multiset<int, std::hash<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| bucket_count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
52 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
59 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
51 typedef std::unordered_set<int, std::hash<int>,
69 typedef std::unordered_set<int, std::hash<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/unord.hash/ |
| floating.pass.cpp | 13 // struct hash
32 std::hash<T> >::value), "");
33 std::hash<T> h;
|
