/external/chromium_org/third_party/smhasher/src/ |
H A D | KeysetTest.cpp | 10 // This should hopefully be a thorough and uambiguous test of whether a hash 13 bool VerificationTest ( pfHash hash, const int hashbits, uint32_t expected, bool verbose ) argument 32 hash(key,i,256-i,&hashes[i*hashbytes]); 35 // Then hash the result array 37 hash(hashes,hashbytes*256,0,final); 39 // The first four bytes of that hash, interpreted as a little-endian integer, is our 65 // A hash function should not be reading outside the bounds of the key. 68 // result in a different hash. 72 // The memory alignment of the key should not affect the hash result. 74 bool SanityTest ( pfHash hash, cons argument 162 AppendedZeroesTest( pfHash hash, const int hashbits ) argument 276 const hashtype & hash = (*it).first; local [all...] |
H A D | SpeedTest.cpp | 151 NEVER_INLINE int64_t timehash ( pfHash hash, const void * key, int len, int seed ) argument 159 hash(key,len,seed,temp); 168 double SpeedTest ( pfHash hash, uint32_t seed, const int trials, const int blocksize, const int align ) argument 192 double t = (double)timehash(hash,block,blocksize,itrial); 211 void BulkSpeedTest ( pfHash hash, uint32_t seed ) argument 220 double cycles = SpeedTest(hash,seed,trials,blocksize,align); 231 void TinySpeedTest ( pfHash hash, int hashsize, int keysize, uint32_t seed, bool verbose, double & /*outCycles*/ ) argument 237 double cycles = SpeedTest(hash,seed,trials,keysize,0); 239 printf("%8.2f cycles/hash\n",cycles);
|
H A D | md5.cpp | 366 unsigned int hash[4]; local 368 md5((unsigned char *)input,len,(unsigned char *)hash); 370 //return hash[0] ^ hash[1] ^ hash[2] ^ hash[3]; 372 return hash[0]; 377 unsigned int hash[4]; local 379 md5((unsigned char*)key,len,(unsigned char*)hash); 381 *(uint32_t*)out = hash[ [all...] |
/external/chromium_org/third_party/tlslite/tlslite/ |
H A D | messages.py | 556 def hash(self, clientRandom, serverRandom): member in class:ServerKeyExchange
|
/external/chromium_org/ui/gfx/ |
H A D | font_render_params_linux.cc | 11 #include "base/hash.h" 158 // Serialize |query| into a string and hash it to a value suitable for use as a 170 const uint32 hash = HashFontRenderParamsQuery(query); local 176 Cache::const_iterator it = synchronized_cache->cache.Get(hash); 178 DVLOG(1) << "Returning cached params for " << hash; 184 DVLOG(1) << "Computing params for " << hash 223 synchronized_cache->cache.Put(hash, params);
|
/external/compiler-rt/lib/builtins/ |
H A D | atomic.c | 116 intptr_t hash = (intptr_t)ptr; local 118 // same memory operation to hash to the same value and therefore use the same 120 hash >>= 4; 121 // Use the next bits as the basis for the hash 122 intptr_t low = hash & SPINLOCK_MASK; 123 // Now use the high(er) set of bits to perturb the hash, so that we don't 125 hash >>= 16; 126 hash ^= low; 128 return locks + (hash & SPINLOCK_MASK);
|
/external/compiler-rt/lib/msan/ |
H A D | msan_chained_origin_depot.cc | 22 u32 hash() const { function in struct:__msan::ChainedOriginDepotDesc 56 bool eq(u32 hash, const args_type &args) const { argument
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 36 static Node *find(Node *s, args_type args, u32 hash); 59 u32 hash) { 62 if (s->eq(hash, args)) { 98 uptr h = args.hash(); 57 find(Node *s, args_type args, u32 hash) argument
|
/external/deqp/framework/delibs/debase/ |
H A D | deString.c | 39 * \brief Compute hash from string. 40 * \param str String to compute hash value for. 41 * \return Computed hash value. 45 /* \note [pyry] This hash is used in DT_GNU_HASH and is proven 48 deUint32 hash = 5381; local 53 hash = (hash << 5) + hash + c; 55 return hash; 60 deUint32 hash local 74 deUint32 hash = 5381; local [all...] |
/external/freetype/src/cache/ |
H A D | ftcbasic.c | 287 FT_PtrDist hash; local 318 hash = FTC_BASIC_ATTR_HASH( &query.attrs ) + gindex; 324 hash, gindex, 330 hash, gindex, 363 FT_PtrDist hash; local 387 hash = FTC_BASIC_ATTR_HASH( &query.attrs ) + gindex; 392 hash, gindex, 474 FT_PtrDist hash; local 503 /* beware, the hash must be the same for all glyph ranges! */ 504 hash 552 FT_PtrDist hash; local [all...] |
H A D | ftccmap.c | 51 /* compute a query/node hash */ 245 FT_PtrDist hash; local 270 hash = FTC_CMAP_HASH( face_id, cmap_index, char_code ); 273 FTC_CACHE_LOOKUP_CMP( cache, ftc_cmap_node_compare, hash, &query, 276 error = FTC_Cache_Lookup( cache, hash, &query, &node );
|
/external/guava/guava/src/com/google/common/base/ |
H A D | Equivalence.java | 86 * Returns a hash code for {@code t}. 88 * <p>The {@code hash} has the following properties: 91 * {@code hash(x}} consistently return the same value provided {@code x} remains unchanged 92 * according to the definition of the equivalence. The hash need not remain consistent from 95 * if {@code equivalent(x, y)}, then {@code hash(x) == hash(y)}. It is <i>not</i> necessary 96 * that the hash be distributable accorss <i>inequivalence</i>. If {@code equivalence(x, y)} 97 * is false, {@code hash(x) == hash(y)} may still be true. 98 * <li>{@code hash(nul 101 public final int hash(@Nullable T t) { method in class:Equivalence [all...] |
/external/guava/guava/src/com/google/common/hash/ |
H A D | BloomFilter.java | 15 package com.google.common.hash; 23 import com.google.common.hash.BloomFilterStrategies.BitArray; 165 return create(funnel, expectedInsertions, 0.03); // FYI, for 3%, we always get 5 hash functions
|
H A D | Hashing.java | 15 package com.google.common.hash; 40 * Returns a general-purpose, <b>non-cryptographic-strength</b>, streaming hash function that 41 * produces hash codes of length at least {@code minimumBits}. Users without specific 42 * compatibility requirements and who do not persist the hash codes are encouraged to 43 * choose this hash function. 68 * Returns a hash function implementing the 77 * Returns a hash function implementing the 88 * Returns a hash function implementing the 98 * Returns a hash function implementing the 110 * Returns a hash functio [all...] |
/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | HashingTest.java | 17 package com.google.common.hash;
|
/external/guava/guava-tests/test/com/google/common/testing/ |
H A D | EquivalenceTesterTest.java | 177 "the hash (1) of TestObject{group=1, item=1} [group 1, item 1] must be " 178 + "equal to the hash (2) of TestObject{group=1, item=2} [group 1, item 2]"; 223 void expectHash(Object object, int hash) { argument 225 hashExpectationsBuilder.put(object, hash);
|
/external/icu/icu4c/source/common/ |
H A D | hash.h | 29 UHashtable* hash; member in class:Hashtable 111 hash = &hashObj; 112 uhash_setKeyDeleter(hash, uprv_deleteUObject); 117 UErrorCode& status) : hash(0) { 121 : hash(0) 132 : hash(0) 138 : hash(0) 145 if (hash != NULL) { 146 uhash_close(hash); 151 return uhash_setValueDeleter(hash, f [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | sortkey.cpp | 41 // A hash code of kInvalidHashCode indicates that the hash code needs 42 // to be computed. A hash code of kEmptyHashCode is used for empty keys 43 // and for any key whose computed hash code is kInvalidHashCode. 46 // The "bogus hash code" replaces a separate fBogus flag. 247 int32_t hash; local 249 hash = kEmptyHashCode; 251 hash = ustr_hashCharsN(s, length); 252 if (hash == kInvalidHashCode || hash [all...] |
/external/icu/icu4c/source/test/cintltst/ |
H A D | chashtst.c | 30 static void _put(UHashtable* hash, 35 static void _get(UHashtable* hash, 39 static void _remove(UHashtable* hash, 104 UHashtable *hash; local 106 hash = uhash_open(hashChars, isEqualChars, NULL, &status); 109 u_errorName(status), hash); 112 if (hash == NULL) { 116 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); 118 _put(hash, one, 1, 0); 119 _put(hash, omeg 154 UHashtable *hash; local 288 UHashtable *hash; local 336 _put(UHashtable* hash, const char* key, int32_t value, int32_t expectedOldValue) argument 355 _get(UHashtable* hash, const char* key, int32_t expectedValue) argument 372 _remove(UHashtable* hash, const char* key, int32_t expectedValue) argument [all...] |
/external/icu/icu4c/source/test/perf/unisetperf/draft/ |
H A D | bitset.cpp | 17 * 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...] |
/external/ipsec-tools/src/racoon/ |
H A D | vendorid.h | 97 vchar_t *hash; member in struct:vendor_id
|
/external/jemalloc/include/jemalloc/internal/ |
H A D | hash.h | 2 * The following hash function is based on MurmurHash3, placed into the public 27 void hash(const void *key, size_t len, const uint32_t seed, 321 hash(const void *key, size_t len, const uint32_t seed, size_t r_hash[2]) function
|
/external/libunwind/include/tdep-ia64/ |
H A D | script.h | 53 unsigned short coll_chain; /* used for hash collisions */ 70 /* hash table that maps instruction pointer to script index: */ 71 unsigned short hash[IA64_UNW_HASH_SIZE]; member in struct:ia64_script_cache
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pt_vsplit.c | 89 unsigned hash; local 93 hash = fetch % MAP_SIZE; 95 if (vsplit->cache.fetches[hash] != fetch) { 97 vsplit->cache.fetches[hash] = fetch; 98 vsplit->cache.draws[hash] = vsplit->cache.num_fetch_elts; 105 vsplit->draw_elts[vsplit->cache.num_draw_elts++] = vsplit->cache.draws[hash]; 118 unsigned hash = fetch % MAP_SIZE; local 119 vsplit->cache.fetches[hash] = fetch - 1; /* force update */
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | 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...] |