/external/chromium_org/net/http/ |
H A D | des.cc | 92 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument 100 reinterpret_cast<DES_cblock*>(hash), &ks, DES_ENCRYPT); 105 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument 139 rv = PK11_CipherOp(ctxt, hash, reinterpret_cast<int*>(&n), 8, 145 rv = PK11_DigestFinal(ctxt, hash+8, &n, 0); 162 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument 166 key, 8, NULL, src, 8, hash, 8, &data_out_moved); 173 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument 210 CopyMemory(hash, src, 8); 214 CryptEncrypt(key, 0, FALSE, 0, hash, [all...] |
H A D | http_security_headers_unittest.cc | 541 HashValueVector::const_iterator hash = local 545 EXPECT_NE(dynamic_domain_state.pkp.spki_hashes.end(), hash); 547 hash = std::find_if(dynamic_domain_state.pkp.spki_hashes.begin(), 550 EXPECT_NE(dynamic_domain_state.pkp.spki_hashes.end(), hash); 565 hash = std::find_if(new_dynamic_domain_state.pkp.spki_hashes.begin(), 568 EXPECT_NE(new_dynamic_domain_state.pkp.spki_hashes.end(), hash); 570 hash = std::find_if(new_dynamic_domain_state.pkp.spki_hashes.begin(), 573 EXPECT_NE(new_dynamic_domain_state.pkp.spki_hashes.end(), hash);
|
H A D | transport_security_state_unittest.cc | 584 HashValue hash; local 585 if (!hash.FromString(type_and_base64)) 588 out->push_back(hash);
|
/external/chromium_org/ppapi/proxy/ |
H A D | interface_list.cc | 7 #include "base/hash.h" 376 int hash = InterfaceList::HashInterfaceName(name); local 378 new PpapiHostMsg_LogInterfaceUsage(hash));
|
/external/chromium_org/third_party/WebKit/Source/core/css/resolver/ |
H A D | MatchedPropertiesCache.cpp | 92 const CachedMatchedProperties* MatchedPropertiesCache::find(unsigned hash, const StyleResolverState& styleResolverState, const MatchResult& matchResult) argument 94 ASSERT(hash); 96 Cache::iterator it = m_cache.find(hash); 116 void MatchedPropertiesCache::add(const RenderStyle* style, const RenderStyle* parentStyle, unsigned hash, const MatchResult& matchResult) argument 127 ASSERT(hash); 128 Cache::AddResult addResult = m_cache.add(hash, nullptr);
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | DocumentMarker.cpp | 108 DocumentMarker::DocumentMarker(MarkerType type, unsigned startOffset, unsigned endOffset, const String& description, uint32_t hash) argument 113 , m_hash(hash) 140 , m_hash(marker.hash())
|
H A D | QualifiedName.cpp | 66 static unsigned hash(const QualifiedNameData& data) function in struct:blink::QNameComponentsTranslator
|
/external/chromium_org/third_party/WebKit/Source/core/frame/ |
H A D | Location.cpp | 135 String Location::hash() const function in class:blink::Location 140 return DOMURLUtilsReadOnly::hash(url()); 207 void Location::setHash(LocalDOMWindow* callingWindow, LocalDOMWindow* enteredWindow, const String& hash) argument 213 String newFragmentIdentifier = hash; 214 if (hash[0] == '#') 215 newFragmentIdentifier = hash.substring(1);
|
/external/chromium_org/third_party/WebKit/Source/platform/text/ |
H A D | TextChecking.h | 68 uint32_t hash; member in struct:blink::TextCheckingResult
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | HashFunctions.h | 37 // integer hash function 91 // Compound integer hash method: http://opendatastructures.org/versions/edition-0.1d/ods-java/node33.html#SECTION00832000000000000000 104 static unsigned hash(T key) { return intHash(static_cast<typename IntTypes<sizeof(T)>::UnsignedType>(key)); } function in struct:WTF::IntHash 111 static unsigned hash(T key) function in struct:WTF::FloatHash 122 // pointer identity hash function 125 static unsigned hash(T key) function in struct:WTF::PtrHash 131 return IntHash<uintptr_t>::hash(reinterpret_cast<uintptr_t>(key)); 142 using PtrHash<P*>::hash; 143 static unsigned hash(const RefPtr<P>& key) { return hash(ke function in struct:WTF::PtrHash 144 static unsigned hash(const PassRefPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash 153 static unsigned hash(const RawPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash 161 static unsigned hash(const OwnPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash 162 static unsigned hash(const PassOwnPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash 180 static unsigned hash(const std::pair<T, U>& p) function in struct:WTF::PairHash 193 static unsigned hash(const std::pair<T, U>& p) { return pairIntHash(p.first, p.second); } function in struct:WTF::IntPairHash [all...] |
/external/chromium_org/third_party/boringssl/src/crypto/lhash/ |
H A D | lhash.c | 67 * average chain length exceeds this value, the hash table will be resized. */ 71 _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) { argument 92 ret->hash = hash; 93 if (ret->hash == NULL) { 94 ret->hash = (lhash_hash_func) lh_strhash; 127 * is not NULL, then it also puts the hash value of |data| in |*out_hash|. */ 130 const uint32_t hash = lh->hash(data); local 134 *out_hash = hash; 224 uint32_t hash; local [all...] |
/external/chromium_org/third_party/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/chromium_org/third_party/icu/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/chromium_org/third_party/icu/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/chromium_org/third_party/icu/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/chromium_org/third_party/icu/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/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/skia/src/core/ |
H A D | SkResourceCache.h | 37 uint32_t hash() const { return fHash; } function in struct:SkResourceCache::Key 66 uint32_t getHash() const { return this->getKey().hash(); } 72 static uint32_t Hash(const Key& key) { return key.hash(); }
|
/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...] |