| /external/wpa_supplicant/tests/ |
| test_sha256.c | 23 u8 hash[32]; member in struct:__anon6764
50 u8 hash[32]; member in struct:hmac_test
215 "Test Using Larger Than Block-Size Key - Hash Key First",
255 u8 hash[32]; local
265 sha256_vector(1, addr, len, hash);
266 if (memcmp(hash, tests[i].hash, 32) != 0) {
277 sha256_vector(2, addr, len, hash);
278 if (memcmp(hash, tests[i].hash, 32) != 0)
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/tests/ |
| test_sha256.c | 23 u8 hash[32]; member in struct:__anon6991
50 u8 hash[32]; member in struct:hmac_test
215 "Test Using Larger Than Block-Size Key - Hash Key First",
255 u8 hash[32]; local
265 sha256_vector(1, addr, len, hash);
266 if (memcmp(hash, tests[i].hash, 32) != 0) {
277 sha256_vector(2, addr, len, hash);
278 if (memcmp(hash, tests[i].hash, 32) != 0)
[all...] |
| /dalvik/libcore/security/src/main/java/java/security/ |
| CodeSigner.java | 36 // Cached hash code value
37 private transient int hash; field in class:CodeSigner
106 * Returns the hash code value for this {@code CodeSigner}. Returns the same
107 * hash code for {@code CodeSigner}s that are equal to each other as
110 * @return the hash code value for this {@code CodeSigner}.
116 if (hash == 0) {
117 hash = signerCertPath.hashCode()
120 return hash;
|
| Timestamp.java | 38 // Cached hash
39 private transient int hash; field in class:Timestamp
111 * Returns the hash code value for this {@code Timestamp}. Returns the same
112 * hash code for {@code Timestamp}s that are equal to each other as
115 * @return the hash code value for this {@code Timestamp}.
121 if (hash == 0) {
122 hash = timestamp.hashCode() ^ signerCertPath.hashCode();
124 return hash;
|
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_process.c | 32 if ((err = hash_is_valid(hmac->hash)) != CRYPT_OK) {
35 return hash_descriptor[hmac->hash].process(&hmac->md, in, inlen);
|
| /external/elfutils/libasm/ |
| symbolhash.c | 1 /* Symbol hash table implementation.
24 /* Definitions for the symbol hash table. */
|
| /external/elfutils/libelf/ |
| elf_hash.c | 0 /* Hash function used in ELF implementations.
25 #include <dl-hash.h>
|
| /external/elfutils/src/ |
| symbolhash.c | 1 /* Symbol hash table implementation.
23 /* Definitions for the symbol hash table. */
|
| versionhash.c | 1 /* Version symbol hash table implementation.
23 /* Definitions for the symbol hash table. */
|
| /external/iptables/extensions/ |
| libipt_CLUSTERIP.man | 23 .BI "--hash-init " "rnd"
24 Specify the random seed used for hash initialization.
|
| /external/openssl/crypto/store/ |
| README | 35 Key ID - the value is a 160 bit SHA1 hash
36 Issuer Key ID - the value is a 160 bit SHA1 hash
37 Subject Key ID - the value is a 160 bit SHA1 hash
38 Issuer/Serial Hash - the value is a 160 bit SHA1 hash
42 Certificate Hash - the value is a 160 bit SHA1 hash
49 Key ID, Issuer/Serial Hash or Subject to look up issuer certificates.
|
| /external/webkit/LayoutTests/http/tests/appcache/ |
| main-resource-hash.html | 31 ifr.setAttribute("src", "/resources/network-simulator.php?path=/appcache/resources/main-resource-hash-frame.html#bar");
46 ifr.setAttribute("src", "/resources/network-simulator.php?path=/appcache/resources/main-resource-hash-frame.html#foo");
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/generators/ |
| PKCS5S1ParametersGenerator.java | 11 * Note this generator is limited to the size of the hash produced by the
35 * the derived key function, the ith hash of the password and the salt.
60 * @exception IllegalArgumentException if the key length larger than the base hash size.
86 * @exception IllegalArgumentException if keySize + ivSize is larger than the base hash size.
112 * @exception IllegalArgumentException if the key length larger than the base hash size.
|
| /external/ppp/pppd/ |
| chap-md5.c | 64 unsigned char hash[MD5_HASH_SIZE]; local
70 /* Generate hash of ID, secret, challenge */
75 MD5_Final(hash, &ctx);
77 /* Test if our hash matches the peer's response */
78 if (memcmp(hash, response, MD5_HASH_SIZE) == 0) {
|
| tdb.c | 76 #define TDB_HASH_TOP(hash) (FREELIST_TOP + (BUCKET(hash)+1)*sizeof(tdb_off))
102 #define BUCKET(hash) ((hash) % tdb->header.hash_size)
164 plus a separate data list for each hash value */
170 u32 full_hash; /* the full 32 bit hash of the key */
541 printf("hash=%d\n", i);
921 /* initialise a new database with a specified hash size */
966 static tdb_off tdb_find(TDB_CONTEXT *tdb, TDB_DATA key, u32 hash,
971 /* read in the hash top *
1083 u32 hash; local
1118 u32 hash = tdb->hash_fn(&key); local
1418 u32 hash = tdb->hash_fn(&key); local
1430 u32 hash; local
1545 u32 hash; local
[all...] |
| /external/webkit/WebCore/bindings/v8/ |
| npruntime.cpp | 85 // Implement WTF::DefaultHash<StringKey>::Hash interface.
87 static unsigned hash(const StringKey& key) function in struct:npruntime::StringKeyHash
89 // Compute string hash.
90 unsigned hash = 0; local
95 hash += c;
96 hash += (hash << 10);
97 hash ^= (hash >> 6);
99 hash += (hash << 3)
[all...] |
| /external/webkit/WebCore/platform/graphics/chromium/ |
| FontPlatformDataChromiumWin.h | 52 // Used for deleted values in the font cache's hash tables. The hash table
72 unsigned hash() const function in class:WebCore::FontPlatformData
74 return m_font ? m_font->hash() : NULL;
103 unsigned hash() const function in class:WebCore::FontPlatformData::RefCountedHFONT
|
| /external/webkit/WebCore/plugins/ |
| PluginPackage.h | 63 unsigned hash() const;
126 static unsigned hash(const uintptr_t key) { return reinterpret_cast<PluginPackage*>(key)->hash(); } function in struct:WebCore::PluginPackageHash
127 static unsigned hash(const RefPtr<PluginPackage>& key) { return key->hash(); } function in struct:WebCore::PluginPackageHash
|
| /frameworks/base/awt/java/awt/image/ |
| PixelInterleavedSampleModel.java | 126 int hash = super.hashCode(); local
127 int tmp = hash >>> 8;
128 hash <<= 8;
129 hash |= tmp;
131 return hash ^ 0x66;
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| symtab.h | 0 /* Hash tables.
27 /* This is what each hash table entry points to. It may be embedded
45 /* An identifier hash table for cpplib and the front ends. */
75 /* Frees all memory associated with a hash table. */
96 /* Restore the hash table. */
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| hash_tables.sgml | 2 Hash Tables
44 or use a iterator to iterate over the key/value pairs in the hash table, see
62 <link linkend="glib-Hash-Tables">Hash Table</link>.
91 Specifies the type of the hash function which is passed to
95 The function is passed a key and should return a #guint hash value.
97 hash functions which can be used when the key is a #gpointer, #gint, and
102 The hash values should be evenly distributed over a fairly large range?
103 The modulus is taken with the hash table size (a prime number)
110 @Returns: the hash value corresponding to the key
[all...] |
| /external/bluetooth/glib/glib/ |
| ghash.c | 66 * Tracks the structure of the hash table, not its contents: is only
89 * good distribution with poor hash functions. */
170 * @hash_return: optional key hash return location
173 * Performs a lookup in the hash table. Virtually all hash operations
176 * This function first computes the hash value of the key using the
177 * user's hash function.
193 * We need to make sure our hash value is not one of these. */
204 /* We first check if our full hash values
235 * @hash_return: key hash return locatio
[all...] |
| /dalvik/libcore/luni/src/main/java/java/util/ |
| LinkedHashMap.java | 110 * the initial capacity of this hash map.
159 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next,
161 super(key, value, hash, next);
173 * to the hash table (which is properly the province of our superclass).
178 * the resulting hash table corrupt.
180 @Override void addNewEntry(K key, V value, int hash, int index) {
192 key, value, hash, table[index], header, oldTail);
216 K key, V value, int hash, HashMapEntry<K, V> next) {
220 = new LinkedEntry<K,V>(key, value, hash, next, header, oldTail);
247 int hash = key.hashCode() local
[all...] |
| /dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/ |
| TwoKeyHashMap.java | 33 * Reductive hash with two keys
156 int hash = key1.hashCode() + key2.hashCode(); local
157 int index = (hash & 0x7fffffff) % arrSize;
161 if (hash == e.hash && key1.equals(e.getKey1())
170 arr[index] = createEntry(hash, key1, key2, value, arr[index]);
197 int newIndex = (entry.hash & 0x7fffffff) % newArrSize;
295 int hash; field in class:TwoKeyHashMap.Entry
301 public Entry(int hash, E key1, K key2, V value, Entry<E, K, V> next) {
302 this.hash = hash
475 int hash = key1.hashCode() + key2.hashCode(); local
503 int hash = key1.hashCode() + key2.hashCode(); local
[all...] |
| /external/webkit/WebCore/platform/text/ |
| AtomicString.cpp | 49 static unsigned hash(const char* c) function in struct:WebCore::CStringTranslator
66 static void translate(StringImpl*& location, const char* const& c, unsigned hash)
69 location->setHash(hash);
135 static unsigned hash(const UCharBuffer& buf) function in struct:WebCore::UCharBufferTranslator
145 static void translate(StringImpl*& location, const UCharBuffer& buf, unsigned hash)
148 location->setHash(hash);
154 unsigned hash; member in struct:WebCore::HashAndCharacters
160 static unsigned hash(const HashAndCharacters& buffer) function in struct:WebCore::HashAndCharactersTranslator
162 ASSERT(buffer.hash == StringImpl::computeHash(buffer.characters, buffer.length));
163 return buffer.hash;
[all...] |
