Searched refs:hash (Results 276 - 300 of 1525) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/v8/src/
H A Dutils.h332 uint32_t hash = key; local
333 hash = hash ^ seed;
334 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1;
335 hash
345 uint64_t hash = key; local
[all...]
/external/v8/src/
H A Dutils.h260 uint32_t hash = key; local
261 hash = hash ^ seed;
262 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1;
263 hash
273 uint64_t hash = key; local
[all...]
/external/chromium_org/third_party/freetype/src/cache/
H A Dftccache.c87 /* get a top bucket for specified hash from cache,
88 * body for FTC_NODE__TOP_FOR_HASH( cache, hash )
92 FT_PtrDist hash )
98 idx = (FT_UInt)( hash & cache->mask );
100 idx = (FT_UInt)( hash & ( 2 * cache->mask + 1 ) );
109 * buckets array appropriately, we simply degrade the hash table's
153 if ( node->hash & ( mask + 1 ) )
215 /* otherwise, the hash table is balanced */
222 /* remove a node from its cache's hash table */
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash );
416 ftc_cache_add( FTC_Cache cache, FT_PtrDist hash, FTC_Node node ) argument
[all...]
/external/freetype/src/cache/
H A Dftccache.c87 /* get a top bucket for specified hash from cache,
88 * body for FTC_NODE__TOP_FOR_HASH( cache, hash )
92 FT_PtrDist hash )
98 idx = (FT_UInt)( hash & cache->mask );
100 idx = (FT_UInt)( hash & ( 2 * cache->mask + 1 ) );
109 * buckets array appropriately, we simply degrade the hash table's
153 if ( node->hash & ( mask + 1 ) )
215 /* otherwise, the hash table is balanced */
222 /* remove a node from its cache's hash table */
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash );
416 ftc_cache_add( FTC_Cache cache, FT_PtrDist hash, FTC_Node node ) argument
[all...]
/external/chromium_org/third_party/libxml/src/
H A Ddict.c272 * Calculate a hash key using a good hash function that works well for
273 * larger hash table sizes.
276 * http://burtleburtle.net/bob/hash/doobs.html
281 uint32_t hash; local
286 hash = 0;
289 hash += data[i];
290 hash += (hash << 10);
291 hash
315 uint32_t hash; local
[all...]
/external/libxml2/
H A Ddict.c31 * it seems that having hash randomization might be a good idea
36 * well but since the attack is based on growing a very big hash
37 * list we will use the BigKey algo as soon as the hash size grows
299 * Calculate a hash key using a good hash function that works well for
300 * larger hash table sizes.
303 * http://burtleburtle.net/bob/hash/doobs.html
308 uint32_t hash; local
313 hash = seed;
316 hash
342 uint32_t hash; local
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/dsa/
H A DDSASigner.java136 byte[] hash = new byte[digest.getDigestSize()];
138 digest.doFinal(hash, 0);
142 BigInteger[] sig = signer.generateSignature(hash);
156 byte[] hash = new byte[digest.getDigestSize()];
158 digest.doFinal(hash, 0);
171 return signer.verifySignature(hash, sig[0], sig[1]);
/external/chromium/chrome/browser/download/
H A Ddownload_safe_browsing_client.cc57 void DownloadSBClient::CheckDownloadHash(const std::string& hash, argument
70 hash));
99 void DownloadSBClient::CheckDownloadHashOnIOThread(const std::string& hash) { argument
103 if (sb_service_.get() && !sb_service_->CheckDownloadHash(hash, this)) {
107 OnDownloadHashCheckResult(hash, SafeBrowsingService::SAFE);
113 const std::string& hash, SafeBrowsingService::UrlCheckResult result) {
112 OnDownloadHashCheckResult( const std::string& hash, SafeBrowsingService::UrlCheckResult result) argument
/external/chromium/chrome/browser/visitedlink/
H A Dvisitedlink_master.h44 // (hash) of the link.
195 // hash functions to disk. The range is inclusive on both ends. The range can
212 // Deletes all fingerprints from the given vector from the current hash table
286 // Increases or decreases the given hash value by one, wrapping around as
288 inline Hash IncrementHash(Hash hash) { argument
289 if (hash >= table_length_ - 1)
291 return hash + 1;
293 inline Hash DecrementHash(Hash hash) { argument
294 if (hash <= 0)
296 return hash
[all...]
/external/chromium_org/chrome/common/metrics/
H A Dmetrics_log_base.cc37 // Converts the 8-byte prefix of an MD5 hash into a uint64 value.
38 inline uint64 HashToUInt64(const std::string& hash) { argument
40 DCHECK_GE(hash.size(), sizeof(value));
41 memcpy(&value, hash.data(), sizeof(value));
86 // Create an MD5 hash of the given |value|, represented as a byte buffer
96 uint64 hash = HashToUInt64(hash_str); local
100 // that happens, all we get to see (server side) is a hash of the histogram
104 DVLOG(1) << "Metrics: Hash numeric [" << value << "]=[" << hash << "]"; local
106 return hash;
/external/chromium_org/components/visitedlink/browser/
H A Dvisitedlink_master.h55 // (hash) of the link.
236 // hash functions to disk. The range is inclusive on both ends. The range can
253 // Deletes all fingerprints from the given vector from the current hash table
327 // Increases or decreases the given hash value by one, wrapping around as
329 inline Hash IncrementHash(Hash hash) { argument
330 if (hash >= table_length_ - 1)
332 return hash + 1;
334 inline Hash DecrementHash(Hash hash) { argument
335 if (hash <= 0)
337 return hash
[all...]
/external/chromium_org/content/browser/download/
H A Dbase_file_unittest.cc95 std::string hash; local
97 hash.assign(reinterpret_cast<const char*>(sha256_hash_),
99 return hash;
258 // Write data to the file and detach it, and calculate its sha256 hash.
260 // Calculate the final hash.
272 std::string hash; local
273 base_file_->GetHash(&hash);
276 EXPECT_EQ(expected_hash_hex, base::HexEncode(hash.data(), hash.size()));
315 std::string hash; local
337 std::string hash; local
353 std::string hash; local
413 std::string hash; local
515 std::string hash; local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/css/resolver/
H A DMatchedPropertiesCache.cpp62 const CachedMatchedProperties* MatchedPropertiesCache::find(unsigned hash, const StyleResolverState& styleResolverState, const MatchResult& matchResult) argument
64 ASSERT(hash);
66 Cache::iterator it = m_cache.find(hash);
86 void MatchedPropertiesCache::add(const RenderStyle* style, const RenderStyle* parentStyle, unsigned hash, const MatchResult& matchResult) argument
95 ASSERT(hash);
96 Cache::AddResult addResult = m_cache.add(hash, nullptr);
/external/dexmaker/src/dx/java/com/android/dx/rop/annotation/
H A DAnnotation.java84 int hash = type.hashCode();
85 hash = (hash * 31) + elements.hashCode();
86 hash = (hash * 31) + visibility.hashCode();
87 return hash;
/external/jmonkeyengine/engine/src/core/com/jme3/texture/
H A DTexture2D.java199 int hash = super.hashCode();
200 hash = 79 * hash + (this.wrapS != null ? this.wrapS.hashCode() : 0);
201 hash = 79 * hash + (this.wrapT != null ? this.wrapT.hashCode() : 0);
202 return hash;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/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/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;
/external/chromium_org/net/tools/quic/test_tools/
H A Dquic_test_utils.cc59 unsigned char hash[base::kSHA1Length]; local
61 hash); local
62 memcpy(&seed_, hash, sizeof(seed_));
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DDOMURLUtilsReadOnly.h71 static String hash(const KURL&);
72 static String hash(DOMURLUtilsReadOnly* impl) { return hash(impl->url()); } function in class:WebCore::DOMURLUtilsReadOnly
H A DVisitedLinkState.cpp100 if (LinkHash hash = linkHashForElement(element, attribute)) {
101 m_linksCheckedForVisitedState.add(hash);
102 if (blink::Platform::current()->isLinkVisited(hash))
/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();
/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/smack/src/org/apache/qpid/management/common/sasl/
H A DUsernameHashedPasswordCallbackHandler.java97 char[] hash = new char[digest.length ];
102 hash[index++] = (char) b;
105 return hash;

Completed in 649 milliseconds

<<11121314151617181920>>