Searched refs:hash (Results 101 - 125 of 1525) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/icu/source/common/
H A Duhash.h29 * functions. These functions hash keys, compare keys, delete keys,
54 * UHashElement pointer. A hash element contains a key, value, and
95 * This is a single hash element.
108 * @return A NON-NEGATIVE hash code for parm.
159 UHashFunction *keyHasher; /* Computes hash from key.
219 * @param size The initial capacity of this hash table.
242 uhash_init(UHashtable *hash,
250 * @param hash The UHashtable to close. If hash is NULL no operation is performed.
253 uhash_close(UHashtable *hash);
[all...]
/external/e2fsprogs/lib/e2p/
H A Dhashstr.c20 struct hash { struct
25 static struct hash hash_list[] = {
34 struct hash *p;
46 * Returns the hash algorithm, or -1 on error
50 struct hash *p;
/external/elfutils/libelf/
H A Delf_hash.c58 #include <dl-hash.h>
/external/guava/guava/src/com/google/common/hash/
H A DFunnel.java15 package com.google.common.hash;
/external/icu4c/common/
H A Duhash.h31 * functions. These functions hash keys, compare keys, delete keys,
56 * UHashElement pointer. A hash element contains a key, value, and
88 * This is a single hash element.
101 * @return A NON-NEGATIVE hash code for parm.
139 UHashFunction *keyHasher; /* Computes hash from key.
199 * @param size The initial capacity of this hash table.
222 uhash_init(UHashtable *hash,
230 * @param hash The UHashtable to close. If hash is NULL no operation is performed.
233 uhash_close(UHashtable *hash);
[all...]
/external/chromium_org/chrome/common/
H A Dspellcheck_result.h33 : decoration(d), location(loc), length(len), replacement(rep), hash(h) {
40 uint32 hash; member in struct:SpellCheckResult
/external/chromium_org/third_party/WebKit/Source/modules/crypto/
H A DHmacKeyParams.cpp38 Algorithm* HmacKeyParams::hash() function in class:WebCore::HmacKeyParams
41 m_hash = Algorithm::create(m_algorithm.hmacKeyParams()->hash());
/external/chromium_org/third_party/WebKit/Source/platform/weborigin/
H A DKURLHash.h36 static unsigned hash(const KURL& key) function in struct:WebCore::KURLHash
38 return key.string().impl()->hash();
/external/chromium_org/third_party/WebKit/Source/web/
H A DWebTextCheckingResult.cpp47 result.hash = hash;
/external/jmonkeyengine/engine/src/core/com/jme3/shader/
H A DShaderKey.java87 int hash = 7;
88 hash = 41 * hash + name.hashCode();
89 hash = 41 * hash + fragName.hashCode();
90 hash = 41 * hash + (defines != null ? defines.getCompiled().hashCode() : 0);
91 return hash;
/external/apache-http/src/org/apache/http/auth/
H A DNTUserPrincipal.java88 int hash = LangUtils.HASH_SEED;
89 hash = LangUtils.hashCode(hash, this.username);
90 hash = LangUtils.hashCode(hash, this.domain);
91 return hash;
/external/apache-http/src/org/apache/http/message/
H A DBasicNameValuePair.java179 int hash = LangUtils.HASH_SEED;
180 hash = LangUtils.hashCode(hash, this.name);
181 hash = LangUtils.hashCode(hash, this.value);
182 return hash;
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dprog_cache.c39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...]
/external/mesa3d/src/mesa/program/
H A Dprog_cache.c39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DKeysetTest.h2 // Keyset tests generate various sorts of difficult-to-hash keysets and compare
3 // the distribution and collision frequency of the hash results against an
20 bool VerificationTest ( pfHash hash, const int hashbits, uint32_t expected, bool verbose );
21 bool SanityTest ( pfHash hash, const int hashbits );
22 void AppendedZeroesTest ( pfHash hash, const int hashbits );
30 pfHash hash, std::vector<hashtype> & hashes )
41 hash(key,(len+1) * sizeof(uint32_t),0,&h);
47 CombinationKeygenRecurse(key,len+1,maxlen,blocks,blockcount,hash,hashes);
53 bool CombinationKeyTest ( hashfunc<hashtype> hash, int maxlen, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument
63 CombinationKeygenRecurse<hashtype>(key,0,maxlen,blocks,blockcount,hash,hashe
28 CombinationKeygenRecurse( uint32_t * key, int len, int maxlen, uint32_t * blocks, int blockcount, pfHash hash, std::vector<hashtype> & hashes ) argument
85 PermutationKeygenRecurse( pfHash hash, uint32_t * blocks, int blockcount, int k, std::vector<hashtype> & hashes ) argument
109 PermutationKeyTest( hashfunc<hashtype> hash, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument
136 SparseKeygenRecurse( pfHash hash, int start, int bitsleft, bool inclusive, keytype & k, std::vector<hashtype> & hashes ) argument
165 SparseKeyTest( hashfunc<hashtype> hash, const int setbits, bool inclusive, bool testColl, bool testDist, bool drawDiagram ) argument
203 WindowedKeyTest( hashfunc<hashtype> hash, const int windowbits, bool testCollision, bool testDistribution, bool drawDiagram ) argument
250 CyclicKeyTest( pfHash hash, int cycleLen, int cycleReps, const int keycount, bool drawDiagram ) argument
299 TwoBytesTest2( pfHash hash, int maxlen, bool drawDiagram ) argument
321 TextKeyTest( hashfunc<hashtype> hash, const char * prefix, const char * coreset, const int corelen, const char * suffix, bool drawDiagram ) argument
377 ZeroKeyTest( pfHash hash, bool drawDiagram ) argument
412 SeedTest( pfHash hash, int keycount, bool drawDiagram ) argument
[all...]
/external/guava/guava-tests/test/com/google/common/hash/
H A DHashCodesTest.java3 package com.google.common.hash;
46 // expectedHashCodes must contain at least one hash code with 4 bytes
56 // expectedHashCodes must contain at least one hash code with 8 bytes
73 private void assertExpectedHashCode(ExpectedHashCode expected, HashCode hash) { argument
74 assertTrue(Arrays.equals(expected.bytes, hash.asBytes()));
75 byte[] bb = new byte[hash.bits() / 8];
76 hash.writeBytesTo(bb, 0, bb.length);
78 assertEquals(expected.asInt, hash.asInt());
81 hash.asLong();
85 assertEquals(expected.asLong.longValue(), hash
92 assertSideEffectFree(HashCode hash) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/
H A Dcso_cache.c51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type, argument
170 int hash_size = cso_hash_size(hash);
155 sanitize_hash(struct cso_cache *sc, struct cso_hash *hash, enum cso_cache_type type, int max_size) argument
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
206 cso_hash_find_data_from_template( struct cso_hash *hash, unsigned hash_key, void *templ, int size ) argument
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_cache.c51 uint32_t hash; member in struct:util_cache_entry
68 uint32_t (*hash)(const void *key); member in struct:util_cache
90 util_cache_create(uint32_t (*hash)(const void *key),
101 cache->hash = hash;
123 uint32_t hash,
127 uint32_t index = hash % cache->size;
142 if (current->hash == hash &&
186 uint32_t hash local
122 util_cache_entry_get(struct util_cache *cache, uint32_t hash, const void *key) argument
221 uint32_t hash = cache->hash(key); local
292 uint32_t hash; local
[all...]
H A Du_surfaces.c42 if(!us->u.hash)
43 us->u.hash = cso_hash_create();
45 ps = cso_hash_iter_data(cso_hash_find(us->u.hash, (layer << 8) | level));
71 cso_hash_insert(us->u.hash, (layer << 8) | level, ps);
85 cso_hash_erase(us->u.hash, cso_hash_find(us->u.hash, (ps->u.tex.first_layer << 8) | ps->u.tex.level));
96 if(us->u.hash)
99 iter = cso_hash_first_node(us->u.hash);
105 cso_hash_delete(us->u.hash);
106 us->u.hash
[all...]
/external/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_cache.c51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type, argument
170 int hash_size = cso_hash_size(hash);
155 sanitize_hash(struct cso_cache *sc, struct cso_hash *hash, enum cso_cache_type type, int max_size) argument
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
206 cso_hash_find_data_from_template( struct cso_hash *hash, unsigned hash_key, void *templ, int size ) argument
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_cache.c51 uint32_t hash; member in struct:util_cache_entry
68 uint32_t (*hash)(const void *key); member in struct:util_cache
90 util_cache_create(uint32_t (*hash)(const void *key),
101 cache->hash = hash;
123 uint32_t hash,
127 uint32_t index = hash % cache->size;
142 if (current->hash == hash &&
186 uint32_t hash local
122 util_cache_entry_get(struct util_cache *cache, uint32_t hash, const void *key) argument
221 uint32_t hash = cache->hash(key); local
292 uint32_t hash; local
[all...]
H A Du_surfaces.c42 if(!us->u.hash)
43 us->u.hash = cso_hash_create();
45 ps = cso_hash_iter_data(cso_hash_find(us->u.hash, (layer << 8) | level));
71 cso_hash_insert(us->u.hash, (layer << 8) | level, ps);
85 cso_hash_erase(us->u.hash, cso_hash_find(us->u.hash, (ps->u.tex.first_layer << 8) | ps->u.tex.level));
96 if(us->u.hash)
99 iter = cso_hash_first_node(us->u.hash);
105 cso_hash_delete(us->u.hash);
106 us->u.hash
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dext_attr.c32 * Compute the hash of an extended attribute.
36 __u32 hash = 0; local
41 hash = (hash << NAME_HASH_SHIFT) ^
42 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^
46 /* The hash needs to be calculated on the data in little-endian. */
51 hash = (hash << VALUE_HASH_SHIFT) ^
52 (hash >> (
[all...]
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/dh/
H A DDhExchange.java128 HashForSSH2Types hash = new HashForSSH2Types("SHA1");
135 hash.updateByteString(clientversion);
136 hash.updateByteString(serverversion);
137 hash.updateByteString(clientKexPayload);
138 hash.updateByteString(serverKexPayload);
139 hash.updateByteString(hostKey);
140 hash.updateBigInt(e);
141 hash.updateBigInt(f);
142 hash.updateBigInt(k);
144 return hash
[all...]
/external/chromium_org/third_party/icu/source/test/perf/unisetperf/draft/
H A Dbitset.cpp17 * Uses a simple hash table for compaction.
47 int32_t hash=(int32_t)(key>>55)&0x1ff; local
48 hash^=(int32_t)(key>>44)&0x7ff;
49 hash^=(int32_t)(key>>33)&0x7ff;
50 hash^=(int32_t)(key>>22)&0x7ff;
51 hash^=(int32_t)(key>>11)&0x7ff;
52 hash^=(int32_t)key&0x7ff;
54 if(values[hash]==0xffff) {
56 keys[hash]=key;
57 reverse[count]=hash;
[all...]

Completed in 709 milliseconds

1234567891011>>