/external/chromium_org/third_party/libsrtp/srtp/crypto/test/ |
H A D | sha1_driver.c | 57 unsigned hash_len; /* number of octets output by hash */ 59 uint8_t hash[MAX_HASH_OUT_LEN]; /* expected hash output */ member in struct:hash_test_case_t 83 tmp_len = hex_string_to_octet_string((char *)test_case->hash, hex_hash, hash_len*2); 113 if (0 == memcmp(test_case->hash, hash_value, 20)) { 116 octet_string_hex_string((const uint8_t *)test_case->hash, 20)); 124 octet_string_hex_string((const uint8_t *)test_case->hash, 20)); 480 printf("error adding hash test case (code %d)\n", err); 522 printf("error validating hash test case (error code %d)\n", err);
|
/external/chromium_org/third_party/mesa/src/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/chromium_org/third_party/mesa/src/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...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | r300_fragprog_swizzle.c | 44 unsigned int hash; /**< swizzle value this matches */ member in struct:swizzle_data 80 if (swz != GET_SWZ(sd->hash, comp)) 170 if (swz == GET_SWZ(sd->hash, comp)) {
|
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | hash_table.c | 26 * \brief Implementation of a generic, opaque hash table data type. 41 hash_func_t hash; member in struct:hash_table 57 hash_table_ctor(unsigned num_buckets, hash_func_t hash, argument 71 ht->hash = hash; 114 const unsigned hash_value = (*ht->hash)(key); 140 const unsigned hash_value = (*ht->hash)(key); 155 const unsigned hash_value = (*ht->hash)(key); 212 unsigned hash = 5381; local 216 hash [all...] |
/external/chromium_org/third_party/openssl/openssl/crypto/conf/ |
H A D | conf_lib.c | 72 void CONF_set_nconf(CONF *conf, LHASH_OF(CONF_VALUE) *hash) argument 78 conf->data = hash;
|
/external/chromium_org/third_party/openssl/openssl/crypto/txt_db/ |
H A D | txt_db.c | 218 LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp) 230 if ((idx=(LHASH_OF(OPENSSL_STRING) *)lh_new(hash,cmp)) == NULL) 217 TXT_DB_create_index(TXT_DB *db, int field, int (*qual)(OPENSSL_STRING *), LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp) argument
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrTHashTable.h | 64 static unsigned hash2Index(intptr_t hash) { argument 66 if (sizeof(hash) == 8) { 67 hash ^= hash >> 32; 70 hash ^= hash >> 16; 72 hash ^= hash >> 8; 74 return hash & kHashMask; 147 // update the hash [all...] |
/external/chromium_org/third_party/smhasher/src/ |
H A D | AvalancheTest.h | 3 // the hash function's output. Ideally, each output bits should flip 50% of 7 // hash function to fail to create an even, random distribution of hash values. 28 void calcBias ( pfHash hash, std::vector<int> & counts, int reps, Rand & r ) argument 45 hash(&K,keybytes,0,&A); 52 hash(&K,keybytes,0,&B); 69 bool AvalancheTest ( pfHash hash, const int reps ) argument 85 calcBias<keytype,hashtype>(hash,bins,reps,r); 111 void BicTest ( pfHash hash, const int keybit, const int reps, double & maxBias, int & maxA, int & maxB, bool verbose ) argument 132 hash( 197 BicTest( pfHash hash, const int reps ) argument 239 BicTest3( pfHash hash, const int reps, bool verbose = true ) argument 347 BicTest2( pfHash hash, const int reps, bool verbose = true ) argument [all...] |
H A D | DifferentialTest.h | 3 // see what happens to the hash value when we flip a few bits of the key. 104 void DiffTestRecurse ( pfHash hash, keytype & k1, keytype & k2, hashtype & h1, hashtype & h2, int start, int bitsleft, std::vector<keytype> & diffs ) argument 113 hash(&k2,sizeof(k2),0,&h2); 122 DiffTestRecurse(hash,k1,k2,h1,h2,i+1,bitsleft,diffs); 133 bool DiffTest ( pfHash hash, int diffbits, int reps, bool dumpCollisions ) argument 159 hash(&k1,sizeof(k1),0,(uint32_t*)&h1); 161 DiffTestRecurse<keytype,hashtype>(hash,k1,k2,h1,h2,0,diffbits,diffs); 174 // a large set of differential key pairs, hash them, and test the output 177 // This is a very hard test to pass - even if the hash values are well-distributed, 178 // the differences between hash value 189 DiffDistTest( pfHash hash, const int diffbits, int trials, double & worst, double & avg ) argument [all...] |
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/v8/src/ |
H A D | interface.cc | 51 void* name, uint32_t hash, Interface* interface, Zone* zone, bool* ok) { 74 ZoneHashMap::Entry* p = (*map)->Lookup(name, hash, !IsFrozen(), allocator); 163 this->DoAdd(p->key, p->hash, static_cast<Interface*>(p->value), zone, ok); 50 DoAdd( void* name, uint32_t hash, Interface* interface, Zone* zone, bool* ok) argument
|
/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;
|