/external/webkit/Source/JavaScriptCore/wtf/ |
D | HashFunctions.h | 142 …turn intHash((static_cast<uint64_t>(DefaultHash<T>::Hash::hash(p.first)) << 32 | DefaultHash<U>::H… 146 …return DefaultHash<T>::Hash::equal(a.first, b.first) && DefaultHash<U>::Hash::equal(a.second, b.se… 148 …static const bool safeToCompareToEmptyOrDeleted = DefaultHash<T>::Hash::safeToCompareToEmptyOrDele… 149 … && DefaultHash<U>::Hash::safeToCompareToEmptyOrDeleted; 154 template<> struct DefaultHash<short> { typedef IntHash<unsigned> Hash; }; 155 template<> struct DefaultHash<unsigned short> { typedef IntHash<unsigned> Hash; }; 156 template<> struct DefaultHash<int> { typedef IntHash<unsigned> Hash; }; 157 template<> struct DefaultHash<unsigned> { typedef IntHash<unsigned> Hash; }; 158 template<> struct DefaultHash<long> { typedef IntHash<unsigned long> Hash; }; 159 template<> struct DefaultHash<unsigned long> { typedef IntHash<unsigned long> Hash; }; [all …]
|
D | TCPackedCache.h | 154 array_[Hash(key)] = static_cast<T>(KeyToUpper(key) | value); in Put() 159 return KeyMatch(array_[Hash(key)], key); in Has() 168 T entry = array_[Hash(key)]; in GetOrDefault() 208 static size_t Hash(K key) { in Hash() function
|
/external/openssl/crypto/rsa/ |
D | rsa_pss.c | 74 const EVP_MD *Hash, const unsigned char *EM, int sLen) in RSA_verify_PKCS1_PSS() argument 76 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen); in RSA_verify_PKCS1_PSS() 80 const EVP_MD *Hash, const EVP_MD *mgf1Hash, in RSA_verify_PKCS1_PSS_mgf1() argument 93 mgf1Hash = Hash; in RSA_verify_PKCS1_PSS_mgf1() 95 hLen = EVP_MD_size(Hash); in RSA_verify_PKCS1_PSS_mgf1() 159 if (!EVP_DigestInit_ex(&ctx, Hash, NULL) in RSA_verify_PKCS1_PSS_mgf1() 189 const EVP_MD *Hash, int sLen) in RSA_padding_add_PKCS1_PSS() argument 191 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen); in RSA_padding_add_PKCS1_PSS() 196 const EVP_MD *Hash, const EVP_MD *mgf1Hash, int sLen) in RSA_padding_add_PKCS1_PSS_mgf1() argument 205 mgf1Hash = Hash; in RSA_padding_add_PKCS1_PSS_mgf1() [all …]
|
/external/v8/test/mjsunit/ |
D | call-stub.js | 28 function Hash() { class 36 Hash.prototype.m = function() { 40 var h = new Hash(); 55 Hash.prototype.wwwww = Hash.prototype.m;
|
/external/chromium/chrome/browser/visitedlink/ |
D | visitedlink_master.h | 160 Hash TryToAddURL(const GURL& url); 197 void WriteHashRangeToFile(Hash first_hash, Hash last_hash); 210 Hash AddFingerprint(Fingerprint fingerprint, bool send_notifications); 288 inline Hash IncrementHash(Hash hash) { in IncrementHash() 293 inline Hash DecrementHash(Hash hash) { in DecrementHash()
|
D | visitedlink_master.cc | 263 VisitedLinkMaster::Hash VisitedLinkMaster::TryToAddURL(const GURL& url) { in TryToAddURL() 299 Hash index = TryToAddURL(url); in AddURL() 311 Hash index = TryToAddURL(*i); in AddURLs() 383 VisitedLinkMaster::Hash VisitedLinkMaster::AddFingerprint( in AddFingerprint() 391 Hash cur_hash = HashFingerprint(fingerprint); in AddFingerprint() 392 Hash first_hash = cur_hash; in AddFingerprint() 452 Hash deleted_hash = HashFingerprint(fingerprint); in DeleteFingerprint() 458 Hash end_range = deleted_hash; in DeleteFingerprint() 460 Hash next_hash = IncrementHash(end_range); in DeleteFingerprint() 473 Hash stop_loop = IncrementHash(end_range); // The end range is inclusive. in DeleteFingerprint() [all …]
|
/external/webkit/Source/WebCore/platform/graphics/ |
D | IntRectHash.h | 40 …int64_t>(DefaultHash<WebCore::IntPoint>::Hash::hash(key.location())) << 32 | DefaultHash<WebCore::… 44 …turn DefaultHash<WebCore::IntPoint>::Hash::equal(a.location(), b.location()) && DefaultHash<WebCor… 48 template<> struct DefaultHash<WebCore::IntRect> { typedef IntHash<WebCore::IntRect> Hash; };
|
/external/chromium/chrome/common/ |
D | visitedlink_common.h | 51 typedef int32 Hash; typedef 55 static const Hash null_hash_; 112 static Hash HashFingerprint(Fingerprint fingerprint, int32 table_length) { in HashFingerprint() 115 return static_cast<Hash>(fingerprint % table_length); in HashFingerprint() 118 Hash HashFingerprint(Fingerprint fingerprint) const { in HashFingerprint()
|
D | visitedlink_common.cc | 14 const VisitedLinkCommon::Hash VisitedLinkCommon::null_hash_ = -1; 44 Hash first_hash = HashFingerprint(fingerprint); in IsVisited() 45 Hash cur_hash = first_hash; in IsVisited()
|
/external/webkit/Source/JavaScriptCore/runtime/ |
D | StructureTransitionTable.h | 43 struct Hash { struct 73 static void* finalizerContextFor(Hash::Key) in finalizerContextFor() argument 78 static inline Hash::Key keyForFinalizer(void* context, Structure* structure) in keyForFinalizer() 84 …typedef WeakGCMap<Hash::Key, Structure, WeakGCMapFinalizerCallback, Hash, HashTraits> TransitionMa… 86 static Hash::Key keyForWeakGCMapFinalizer(void* context, Structure*);
|
/external/chromium/third_party/libjingle/source/talk/base/ |
D | socketaddresspair.cc | 54 size_t SocketAddressPair::Hash() const { in Hash() function in talk_base::SocketAddressPair 55 return src_.Hash() ^ dest_.Hash(); in Hash()
|
/external/webkit/Source/JavaScriptCore/profiler/ |
D | CallIdentifier.h | 58 struct Hash { struct 73 unsigned hash() const { return Hash::hash(*this); } in hash() 85 template<> struct DefaultHash<JSC::CallIdentifier> { typedef JSC::CallIdentifier::Hash Hash; }; argument
|
/external/skia/include/gpu/ |
D | GrKey.h | 18 typedef intptr_t Hash; typedef 20 explicit GrKey(Hash hash) : fHash(hash) {} in GrKey() 36 const Hash fHash;
|
/external/markdown/tests/markdown-test/ |
D | backlash-escapes.txt | 25 Hash: \# 61 Hash: \# 96 Hash: `\#`
|
/external/markdown/MarkdownTest/Tests_2004/ |
D | Backslash escapes.text | 25 Hash: \# 61 Hash: \# 96 Hash: `\#`
|
/external/markdown/MarkdownTest/Tests_2007/ |
D | Backslash escapes.text | 25 Hash: \# 61 Hash: \# 96 Hash: `\#`
|
/external/chromium/net/disk_cache/ |
D | hash.h | 19 inline uint32 Hash(const char* key, size_t length) { in Hash() function 23 inline uint32 Hash(const std::string& key) { in Hash() function
|
/external/chromium/sdch/open-vcdiff/src/ |
D | rolling_hash_test.cc | 110 result_array[i] = hasher.Hash(&buffer[i]); in BM_DefaultHash() 120 uint32_t running_hash = hasher.Hash(buffer); in BM_UpdateHash() 144 uint32_t running_hash = hasher.Hash(buffer_); in UpdateHashMatchesHashForBlockSize() 152 EXPECT_EQ(running_hash, hasher.Hash(&buffer_[i + 1 - kBlockSize])); in UpdateHashMatchesHashForBlockSize()
|
D | blockhash_test.cc | 147 hashed_y = RollingHash<kBlockSize>::Hash(test_string_y); in SetUpTestCase() 148 hashed_e = RollingHash<kBlockSize>::Hash(test_string_e); in SetUpTestCase() 150 RollingHash<kBlockSize>::Hash(&search_string[index_of_f_in_fearsome]); in SetUpTestCase() 151 hashed_unaligned_e = RollingHash<kBlockSize>::Hash(test_string_unaligned_e); in SetUpTestCase() 152 hashed_all_Qs = RollingHash<kBlockSize>::Hash(test_string_all_Qs); in SetUpTestCase() 549 th_->AddOneIndexHash(i, RollingHash<kBlockSize>::Hash(&sample_text[i])); in TEST_F() 793 uint32_t hash_value = RollingHash<kBlockSize>::Hash( in TEST_F() 807 uint32_t hash_value = RollingHash<kBlockSize>::Hash( in TEST_F() 829 RollingHash<kBlockSize>::Hash(search_string_many_matches); in TEST_F() 854 EXPECT_EQ(hashed_f, RollingHash<kBlockSize>::Hash(fearsome_location)); in TEST_F()
|
/external/llvm/lib/CodeGen/ |
D | BranchFolding.h | 34 unsigned Hash; variable 38 : Hash(h), Block(b) {} in MergePotentialsElt() 40 unsigned getHash() const { return Hash; } in getHash()
|
/external/dropbear/libtomcrypt/notes/ |
D | hash_tv.txt | 1 Hash Test Vectors: 5 Hash: tiger 136 Hash: md2 171 Hash: md4 302 Hash: md5 433 Hash: sha1 564 Hash: sha224 695 Hash: sha256 826 Hash: sha384 1085 Hash: sha512 [all …]
|
/external/llvm/lib/Transforms/Utils/ |
D | Local.cpp | 678 uintptr_t Hash = 0; in EliminateDuplicatePHINodes() local 682 Hash ^= reinterpret_cast<uintptr_t>(static_cast<Value *>(*I)); in EliminateDuplicatePHINodes() 683 Hash = (Hash << 7) | (Hash >> (sizeof(uintptr_t) * CHAR_BIT - 7)); in EliminateDuplicatePHINodes() 687 Hash ^= reinterpret_cast<uintptr_t>(static_cast<BasicBlock *>(*I)); in EliminateDuplicatePHINodes() 688 Hash = (Hash << 7) | (Hash >> (sizeof(uintptr_t) * CHAR_BIT - 7)); in EliminateDuplicatePHINodes() 691 Hash >>= 1; in EliminateDuplicatePHINodes() 694 HashMap.insert(std::make_pair(Hash, PN)); in EliminateDuplicatePHINodes()
|
/external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
D | mootools-1.2.2-core-nc.js | 106 var Hash = new Native({ variable 118 Hash.implement({ 144 Hash.alias('forEach', 'each'); 187 …((type == 'arguments' || type == 'collection' || type == 'array') ? Array : Hash).each(iterable, f… 198 return new Hash(object); 277 unlinked = new Hash(object); 793 Hash.implement({ 805 return (Hash.keyOf(this, value) !== null); 809 Hash.each(properties, function(value, key){ 810 Hash.set(this, key, value); [all …]
|
/external/antlr/antlr-3.4/runtime/C/doxygen/ |
D | doxygengroups.dox | 81 /// \defgroup ANTLR3_HASH_BUCKET ANTLR3_HASH_BUCKET - Hash Table Bucket Class Definition 83 /// \defgroup ANTLR3_HASH_ENTRY ANTLR3_HASH_ENTRY - Hash Table Entry Class Definition 85 /// \defgroup ANTLR3_HASH_ENUM ANTLR3_HASH_ENUM - Hash Table Enumerator Class Definition 87 /// \defgroup ANTLR3_HASH_TABLE ANTLR3_HASH_TABLE - Hash Table Class Definition 181 /// \defgroup pANTLR3_HASH_BUCKET pANTLR3_HASH_BUCKET - Hash Table Bucket Implementation 183 /// \defgroup pANTLR3_HASH_ENTRY pANTLR3_HASH_ENTRY - Hash Table Entry Implementation 185 /// \defgroup pANTLR3_HASH_ENUM pANTLR3_HASH_ENUM - Hash Table Enumerator Implementation 187 /// \defgroup pANTLR3_HASH_TABLE pANTLR3_HASH_TABLE - Hash Table Implementation
|
/external/webkit/LayoutTests/fast/dom/HTMLAnchorElement/ |
D | set-href-attribute-hash-expected.txt | 6 Hash value does not start with '#' 8 Hash value starts with '#'
|