| /external/wpa_supplicant_8/src/eap_common/ |
| eap_peap_common.c | 21 u8 hash[SHA1_MAC_LEN]; local
27 addr[0] = hash;
72 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash) < 0)
75 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
78 os_memcpy(&buf[pos], hash, plen);
|
| /frameworks/base/services/java/com/android/server/am/ |
| PendingIntentRecord.java | 76 int hash = 23; local
77 hash = (ODD_PRIME_NUMBER*hash) + _f;
78 hash = (ODD_PRIME_NUMBER*hash) + _r;
79 hash = (ODD_PRIME_NUMBER*hash) + _userId;
81 hash = (ODD_PRIME_NUMBER*hash) + _w.hashCode();
84 hash = (ODD_PRIME_NUMBER*hash) + _a.hashCode()
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| hash.pass.cpp | 14 // long hash(const charT* low, const charT* high) const;
29 assert(f.hash(x1.data(), x1.data() + x1.size())
30 != f.hash(x2.data(), x2.data() + x2.size()));
36 assert(f.hash(x1.data(), x1.data() + x1.size())
37 != f.hash(x2.data(), x2.data() + x2.size()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.collate/locale.collate.byname/ |
| hash.pass.cpp | 14 // long hash(const charT* low, const charT* high) const;
31 assert(f.hash(x1.data(), x1.data() + x1.size())
32 != f.hash(x2.data(), x2.data() + x2.size()));
38 assert(f.hash(x1.data(), x1.data() + x1.size())
39 != f.hash(x2.data(), x2.data() + x2.size()));
|
| /external/libxml2/ |
| hash.c | 2 * hash.c: chained hash tables
33 * it seems that having hash randomization might be a good idea
41 #include <libxml/hash.h>
55 * A single entry in the hash table
69 * The entire hash table
83 * Calculate the hash key
167 * @size: the size of the hash table
204 * @size: the size of the hash table
205 * @dict: a dictionary to use for the hash
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/ |
| RSADigestSigner.java | 150 byte[] hash = new byte[digest.getDigestSize()];
151 digest.doFinal(hash, 0);
155 byte[] data = derEncode(hash);
176 byte[] hash = new byte[digest.getDigestSize()];
178 digest.doFinal(hash, 0);
186 expected = derEncode(hash);
199 int sigOffset = sig.length - hash.length - 2;
200 int expectedOffset = expected.length - hash.length - 2;
207 for (int i = 0; i < hash.length; i++)
231 byte[] hash)
[all...] |
| /external/chromium/chrome/common/ |
| visitedlink_common.h | 30 // for looking things up in the hash table, and for computing hash values and
50 // A hash value of a fingerprint
51 typedef int32 Hash;
53 // A fingerprint or hash value that does not exist
55 static const Hash null_hash_;
110 // Computes the hash value of the given fingerprint, this is used as a lookup
112 static Hash HashFingerprint(Fingerprint fingerprint, int32 table_length) {
115 return static_cast<Hash>(fingerprint % table_length);
118 Hash HashFingerprint(Fingerprint fingerprint) const
[all...] |
| /external/chromium_org/chrome/browser/spellchecker/ |
| feedback.cc | 30 Misspelling* Feedback::GetMisspelling(uint32 hash) {
31 HashMisspellingMap::iterator misspelling_it = misspellings_.find(hash);
106 text_[misspelling.GetMisspelledString()].erase(misspelling.hash);
113 bool Feedback::HasMisspelling(uint32 hash) const {
114 return !!misspellings_.count(hash);
120 misspellings_.find(misspelling.hash);
123 text_[existing_misspelling.GetMisspelledString()].erase(misspelling.hash);
129 renderer_hashes.erase(misspelling.hash);
134 misspellings_[misspelling.hash] = misspelling;
135 text_[misspelling.GetMisspelledString()].insert(misspelling.hash);
[all...] |
| /external/chromium_org/components/visitedlink/common/ |
| visitedlink_common.h | 31 // for looking things up in the hash table, and for computing hash values and
51 // A hash value of a fingerprint
52 typedef int32 Hash;
54 // A fingerprint or hash value that does not exist
56 static const Hash null_hash_;
111 // Computes the hash value of the given fingerprint, this is used as a lookup
113 static Hash HashFingerprint(Fingerprint fingerprint, int32 table_length) {
116 return static_cast<Hash>(fingerprint % table_length);
119 Hash HashFingerprint(Fingerprint fingerprint) const
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLIdentifier.cpp | 53 return table.contains(string->hash());
62 // computeHashAndMaskTop8Bits is the function StringImpl::hash() uses.
63 unsigned hash = StringHasher::computeHashAndMaskTop8Bits(characters, length); local
67 IdentifierTable::const_iterator it = table.find(hash);
70 // It's possible to have hash collisions between arbitrary strings and
99 unsigned hash = name->hash(); local
100 IdentifierTable::AddResult addResult = table.add(hash, name);
104 // We expect some hash collisions, but only for identical strings.
106 // Note: If you hit this ASSERT, then we had a hash collision amon
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_hash_table.c | 30 * General purpose hash table implementation.
33 * probing hash table implementation at some point -- as it is said they have
35 * a lock-free implementation of such hash tables .
54 /** Hash function */
55 unsigned (*hash)(void *key); member in struct:util_hash_table
79 util_hash_table_create(unsigned (*hash)(void *key),
94 ht->hash = hash;
154 key_hash = ht->hash(key);
191 key_hash = ht->hash(key)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_hash_table.c | 30 * General purpose hash table implementation.
33 * probing hash table implementation at some point -- as it is said they have
35 * a lock-free implementation of such hash tables .
54 /** Hash function */
55 unsigned (*hash)(void *key); member in struct:util_hash_table
79 util_hash_table_create(unsigned (*hash)(void *key),
94 ht->hash = hash;
154 key_hash = ht->hash(key);
191 key_hash = ht->hash(key)
[all...] |
| /frameworks/base/libs/hwui/ |
| PatchCache.cpp | 69 hash_t PatchCache::PatchDescription::hash() const { function in class:android::uirenderer::PatchCache::PatchDescription
70 uint32_t hash = JenkinsHashMix(0, android::hash_type(mPatch)); local
71 hash = JenkinsHashMix(hash, mBitmapWidth);
72 hash = JenkinsHashMix(hash, mBitmapHeight);
73 hash = JenkinsHashMix(hash, mPixelWidth);
74 hash = JenkinsHashMix(hash, mPixelHeight)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
| move_alloc.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
35 test_hash<std::hash<int> >,
50 test_hash<std::hash<int> >(8),
61 assert(c.hash_function() == test_hash<std::hash<int> >(8));
76 test_hash<std::hash<int> >,
91 test_hash<std::hash<int> >(8),
102 assert(c.hash_function() == test_hash<std::hash<int> >(8));
118 test_hash<std::hash<int> >,
133 test_hash<std::hash<int> >(8)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
66 assert(c.hash_function() == test_hash<std::hash<int> >(8));
78 test_hash<std::hash<int> >,
94 test_hash<std::hash<int> >(8),
113 assert(c.hash_function() == test_hash<std::hash<int> >(8));
126 test_hash<std::hash<int> >,
142 test_hash<std::hash<int> >(8)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8),
97 assert(c.hash_function() == test_hash<std::hash<int> >(8));
110 test_hash<std::hash<int> >,
126 test_hash<std::hash<int> >(8)
[all...] |
| move_alloc.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
34 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
60 assert(c.hash_function() == test_hash<std::hash<int> >(8));
75 test_hash<std::hash<int> >,
90 test_hash<std::hash<int> >(8),
101 assert(c.hash_function() == test_hash<std::hash<int> >(8));
117 test_hash<std::hash<int> >,
132 test_hash<std::hash<int> >(8)
[all...] |
| /sdk/emulator/qtools/ |
| hash_table.h | 81 // Professor Daniel J. Bernstein's hash function. See
86 uint32_t hash = 5381; local
90 hash = ((hash << 5) + hash) + *key;
92 return hash;
98 // Hash the key to get the table position
110 // Create a new hash entry and fill in the values
127 // Hash the key to get the table position
152 // Hash the key to get the table positio
[all...] |
| /dalvik/vm/hprof/ |
| HprofClass.cpp | 42 u4 hash; local
47 hash = (u4)clazz->classLoader;
49 hash = hash * 31 + c;
52 return hash;
86 /* We're using the hash table as a list.
87 * TODO: replace the hash table with a more suitable structure
|
| /external/chromium_org/net/quic/crypto/ |
| cert_compressor_test.cc | 57 "2A00000000000000" /* set hash 42 */
73 uint64 hash = QuicUtils::FNV1a_64_Hash(chain[0].data(), chain[0].size()); local
74 StringPiece hash_bytes(reinterpret_cast<char*>(&hash), sizeof(hash));
106 /* hash truncated */
112 /* hash and index truncated */
130 /* incorrect hash and index */
|
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| dsa_decrypt_key.c | 36 int hash, err; local
49 /* decode to find out hash */
56 hash = find_hash_oid(hashOID, decode[0].size);
57 if (hash_is_valid(hash) != CRYPT_OK) {
61 /* we now have the hash! */
96 if ((err = hash_memory(hash, expt, x, expt, &y)) != CRYPT_OK) {
100 /* ensure the hash of the shared secret is at least as big as the encrypt itself */
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_decrypt_key.c | 41 int hash, err; local
55 /* decode to find out hash */
62 hash = find_hash_oid(hashOID, decode[0].size);
63 if (hash_is_valid(hash) != CRYPT_OK) {
67 /* we now have the hash! */
107 if ((err = hash_memory(hash, ecc_shared, x, ecc_shared, &y)) != CRYPT_OK) {
111 /* ensure the hash of the shared secret is at least as big as the encrypt itself */
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_sign_hash.c | 15 RSA PKCS #1 v1.5 and v2 PSS sign hash, Tom St Denis and Andreas Lange
22 @param in The hash to sign
23 @param inlen The length of the hash to sign (octets)
29 @param hash_idx The index of the hash desired
55 /* valid prng and hash ? */
82 /* PKCS #1 v1.5 pad the hash */
96 hash OCTET STRING
|
| /libcore/luni/src/test/java/com/android/org/bouncycastle/crypto/digests/ |
| DigestTest.java | 46 assertEquals("Hash names must be equal",
48 assertEquals("Hash sizes must be equal",
50 assertEquals("Hash block sizes must be equal",
79 assertEquals("Hash sizes must be equal", oldLength, newLength);
86 System.out.println("Time for " + ITERATIONS + " x old hash processing: " + oldTime + " ms");
87 System.out.println("Time for " + ITERATIONS + " x new hash processing: " + newTime + " ms");
89 assertTrue("New hash should be faster", newTime < oldTime);
|
| /external/chromium_org/third_party/libxml/src/ |
| hash.c | 2 * hash.c: chained hash tables
25 #include <libxml/hash.h>
35 * A single entry in the hash table
49 * The entire hash table
60 * Calculate the hash key
138 * @size: the size of the hash table
168 * @size: the size of the hash table
169 * @dict: a dictionary to use for the hash
189 * @table: the hash tabl
[all...] |
