Searched refs:hash (Results 176 - 200 of 965) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRDebugEventListener.h243 - (void) createNilNode:(unsigned)hash;
246 - (void) createNode:(unsigned)hash text:(NSString *)text type:(NSInteger)type;
249 - (void) createNode:(unsigned)hash fromTokenAtIndex:(NSInteger)tokenIndex;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRDebugEventListener.h243 - (void) createNilNode:(unsigned)hash;
246 - (void) createNode:(unsigned)hash text:(NSString *)text type:(NSInteger)type;
249 - (void) createNode:(unsigned)hash fromTokenAtIndex:(NSInteger)tokenIndex;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRDebugEventListener.h243 - (void) createNilNode:(unsigned)hash;
246 - (void) createNode:(unsigned)hash text:(NSString *)text type:(NSInteger)type;
249 - (void) createNode:(unsigned)hash fromTokenAtIndex:(NSInteger)tokenIndex;
H A DANTLRPtrStack.h38 /* form hash value for string s */
39 - (NSInteger)hash:(NSString *)s;
/external/guava/guava/src/com/google/common/hash/
H A DBloomFilterStrategies.java3 package com.google.common.hash;
13 * be mapped to a {@link BloomFilter} of {@code M} bits and {@code k} hash functions. These
23 * performance of a Bloom filter (yet only needs two 32bit hash functions).
29 long hash64 = Hashing.murmur3_128().newHasher().putObject(object, funnel).hash().asLong();
44 long hash64 = Hashing.murmur3_128().newHasher().putObject(object, funnel).hash().asLong();
H A DFunnels.java15 package com.google.common.hash;
H A DHashFunction.java15 package com.google.common.hash;
23 * A hash function is a collision-averse pure function that maps an arbitrary block of
24 * data to a number called a <i>hash code</i>.
31 * <li><b>block of data:</b> the input for a hash function is always, in concept, an
36 * <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit
39 * {@code long} value is clearly insufficient to hold all hash code values, this API
40 * represents a hash code as an instance of {@link HashCode}.
45 * <li><b>collision-averse:</b> while it can't be helped that a hash functio
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
H A DMapHashCodeTester.java41 expectedHashCode += hash(entry);
69 expectedHashCode += hash(entry);
75 + "a null element in an entry counts as having a hash of zero).",
79 private static int hash(Map.Entry<?, ?> e) { method in class:MapHashCodeTester
/external/webkit/Source/WebCore/platform/graphics/chromium/
H A DFontPlatformDataChromiumWin.h53 // Used for deleted values in the font cache's hash tables. The hash table
76 unsigned hash() const function in class:WebCore::FontPlatformData
78 return m_font ? m_font->hash() : NULL;
107 unsigned hash() const function in class:WebCore::FontPlatformData::RefCountedHFONT
/external/wpa_supplicant_6/wpa_supplicant/src/utils/
H A Duuid.c86 u8 hash[SHA1_MAC_LEN]; local
99 sha1_vector(2, addr, len, hash);
100 os_memcpy(uuid, hash, 16);
/external/dropbear/libtomcrypt/src/pk/dsa/
H A Ddsa_decrypt_key.c36 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 */
H A Ddsa_verify_hash.c25 @param hash The hash that was signed
26 @param hashlen The length of the hash that was signed
32 const unsigned char *hash, unsigned long hashlen,
61 if ((err = mp_read_unsigned_bin(u1, (unsigned char *)hash, hashlen)) != CRYPT_OK) { goto error; }
88 @param hash The hash that was signed
89 @param hashlen The length of the hash that was signed
95 const unsigned char *hash, unsigned long hashlen,
114 err = dsa_verify_hash_raw(r, s, hash, hashle
31 dsa_verify_hash_raw( void *r, void *s, const unsigned char *hash, unsigned long hashlen, int *stat, dsa_key *key) argument
94 dsa_verify_hash(const unsigned char *sig, unsigned long siglen, const unsigned char *hash, unsigned long hashlen, int *stat, dsa_key *key) argument
[all...]
/external/dropbear/libtomcrypt/src/pk/ecc/
H A Decc_decrypt_key.c41 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/
H A Drsa_verify_hash.c24 @param hash The hash of the message that was signed
25 @param hashlen The length of the hash of the message that was signed (octets)
27 @param hash_idx The index of the desired hash
34 const unsigned char *hash, unsigned long hashlen,
43 LTC_ARGCHK(hash != NULL);
59 /* valid hash ? */
95 err = pkcs_1_pss_decode(hash, hashlen, tmpbuf, x, saltlen, hash_idx, modulus_bitlen, stat);
109 /* allocate temp buffer for decoded hash */
122 /* now we must decode out[0...outlen-1] using ASN.1, test the OID and then test the hash */
33 rsa_verify_hash_ex(const unsigned char *sig, unsigned long siglen, const unsigned char *hash, unsigned long hashlen, int padding, int hash_idx, unsigned long saltlen, int *stat, rsa_key *key) argument
[all...]
/external/guava/guava-testlib/src/com/google/common/testing/
H A DEquivalenceTester.java73 int itemHash = equivalence.hash(item);
74 int relatedHash = equivalence.hash(related);
75 assertEquals("the hash (" + itemHash + ") of $ITEM must be equal to the hash ("
120 assertEquals("the hash of " + item + " must be consistent", equivalence.hash(item),
121 equivalence.hash(item));
/external/guava/guava-tests/test/com/google/common/hash/
H A DMessageDigestHashFunctionTest.java3 package com.google.common.hash;
/external/mesa3d/src/mesa/program/
H A Dhash_table.h26 * \brief Implementation of a generic, opaque hash table data type.
46 * Creates a hash table with the specified number of buckets. The supplied
47 * \c hash and \c compare routines are used when adding elements to the table
50 * \param num_buckets Number of buckets (bins) in the hash table.
51 * \param hash Function used to compute hash value of input keys.
55 hash_func_t hash, hash_compare_func_t compare);
59 * Release all memory associated with a hash table
68 * Flush all entries from a hash table
76 * Search a hash tabl
[all...]
/external/oprofile/libop/
H A Dop_interface.h67 unsigned int hash; member in struct:op_note
84 /** size of hash map in bytes */
/external/webkit/LayoutTests/fast/url/resources/
H A Dutilities.js42 elmt.hash
/external/webkit/Source/JavaScriptCore/wtf/text/
H A DAtomicStringHash.h38 static unsigned hash(const AtomicString& key) function in struct:WTF::AtomicStringHash
51 // AtomicStringHash is the default hash for AtomicString
/external/webkit/Source/WebCore/bindings/v8/
H A Dnpruntime.cpp89 static unsigned hash(const StringKey& key) function in struct:npruntime::StringKeyHash
91 // Compute string hash.
92 unsigned hash = 0; local
97 hash += c;
98 hash += (hash << 10);
99 hash ^= (hash >> 6);
101 hash += (hash <<
[all...]
/external/webkit/Source/WebCore/platform/graphics/haiku/
H A DFontPlatformData.h60 unsigned hash() const;
/external/skia/src/gpu/
H A DGrTHashCache.h35 T* removeAt(int index, uint32_t hash);
57 static unsigned hash2Index(uint32_t hash) { argument
58 hash ^= hash >> 16;
60 hash ^= hash >> 8;
62 return hash & kHashMask;
122 // update the hash
138 // update our hash table (overwrites any dupe's position in the hash)
[all...]
/external/wpa_supplicant_6/wpa_supplicant/src/wps/
H A Dwps_common.c33 u8 hash[SHA256_MAC_LEN], *opos; local
53 hmac_sha256_vector(key, SHA256_MAC_LEN, 4, addr, len, hash);
55 os_memcpy(opos, hash, SHA256_MAC_LEN);
59 os_memcpy(opos, hash, left);
134 u8 hash[SHA256_MAC_LEN]; local
137 (dev_passwd_len + 1) / 2, hash);
138 os_memcpy(wps->psk1, hash, WPS_PSK_LEN);
141 dev_passwd_len / 2, hash);
142 os_memcpy(wps->psk2, hash, WPS_PSK_LEN);
/external/openssl/crypto/err/
H A Derr.c237 void (*cb_thread_release)(LHASH_OF(ERR_STATE) **hash); member in struct:st_ERR_FNS
252 static void int_thread_release(LHASH_OF(ERR_STATE) **hash);
382 LHASH_OF(ERR_STRING_DATA) *hash;
385 hash = ERRFN(err_get)(0);
386 if (!hash)
390 p = lh_ERR_STRING_DATA_retrieve(hash, d);
399 LHASH_OF(ERR_STRING_DATA) *hash;
402 hash = ERRFN(err_get)(1);
403 if (!hash)
407 p = lh_ERR_STRING_DATA_insert(hash,
[all...]

Completed in 3389 milliseconds

1234567891011>>