| /external/webkit/Source/JavaScriptCore/wtf/text/ |
| AtomicString.h | 52 // Hash table deleted values, which are only constructed and never copied or destroyed.
185 // AtomicStringHash is the default hash for AtomicString
188 typedef AtomicStringHash Hash;
|
| StringImpl.h | 83 // Ensure that the hash is computed so that AtomicStringHash can call existingHash()
86 hash();
135 void setHash(unsigned hash)
139 ASSERT(hash == StringHasher::computeHash(m_data, m_length));
140 m_hash = hash;
238 unsigned hash() const { if (!m_hash) m_hash = StringHasher::computeHash(m_data, m_length); return m_hash; } function in class:WTF::StringImpl
398 // StringHash is the default hash for StringImpl* and RefPtr<StringImpl>
401 typedef StringHash Hash;
404 typedef StringHash Hash;
|
| WTFString.h | 346 // Hash table deleted values, which are only constructed and never copied or destroyed.
496 // StringHash is the default hash for String
499 typedef StringHash Hash;
|
| /external/webkit/Source/WebCore/dom/ |
| QualifiedName.h | 120 static unsigned hash(const QualifiedName& name) { return hash(name.impl()); } function in struct:WebCore::QualifiedNameHash
122 static unsigned hash(const QualifiedName::QualifiedNameImpl* name) function in struct:WebCore::QualifiedNameHash
141 typedef WebCore::QualifiedNameHash Hash;
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| socketaddress.cc | 256 size_t SocketAddress::Hash() const {
|
| /external/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 41 /// Large sets use a classic exponentially-probed hash table. Empty buckets are
44 /// (-2), to allow deletion. The hash table is resized when the table is 3/4 or
129 unsigned Hash(const void *Ptr) const {
|
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 1 //===-- Support/FoldingSet.cpp - Uniquing Hash Set --------------*- C++ -*-===//
10 // This file implements a hash set that can be used to remove duplication of
29 /// ComputeHash - Compute a strong hash value for this FoldingSetNodeIDRef,
33 unsigned Hash = static_cast<unsigned>(Size);
36 Hash += Data & 0xFFFF;
37 unsigned Tmp = ((Data >> 16) << 11) ^ Hash;
38 Hash = (Hash << 16) ^ Tmp;
39 Hash += Hash >> 11
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| string-weight.h | 108 ssize_t Hash() const;
267 inline ssize_t StringWeight<L, S>::Hash() const {
|
| /external/v8/src/ |
| scopeinfo.cc | 523 int ContextSlotCache::Hash(Object* data, String* name) {
527 return static_cast<int>((addr_hash ^ name->Hash()) % kLength);
534 int index = Hash(data, name);
552 int index = Hash(data, symbol);
578 int index = Hash(data, name);
|
| d8.cc | 355 int CounterMap::Hash(const char* name) {
|
| debug.h | 178 // Calculate the hash value from the key (script id).
179 static uint32_t Hash(int key) { return ComputeIntegerHash(key); }
[all...] |
| profile-generator.h | 82 const char* AddOrDisposeString(char* str, uint32_t hash);
84 // Mapping of strings by String::Hash to const char* strings.
836 static uint32_t Hash(HeapThing thing) {
[all...] |
| heap.h | [all...] |
| heap.cc | 2211 int hash; local
2231 int hash; local
[all...] |
| objects.cc | 786 self->Hash(); // Force regeneration of the hash value.
834 self->Hash(); // Force regeneration of the hash value.
2457 int hash = (static_cast<uint32_t>( local
4440 uint32_t hash = name->Hash(); local
4471 uint32_t hash = name->Hash(); local
5731 uint32_t hash = 0; local
8504 uint32_t hash = source->Hash(); local
8864 uint32_t hash = Shape::HashForObject(key, k); local
9371 uint32_t hash = c1 + (c1 << 10); local
9633 uint32_t hash = 0; local
[all...] |
| objects.h | [all...] |
| /external/webkit/Source/WebCore/platform/ |
| KURL.h | 393 // KURLHash is the default hash for String
396 typedef WebCore::KURLHash Hash;
|
| /external/webkit/Source/WebCore/platform/win/ |
| COMPtr.h | 62 // Hash table deleted values, which are only constructed and never copied or destroyed.
231 using PtrHash<P*>::hash;
232 static unsigned hash(const COMPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
239 template<typename P> struct DefaultHash<COMPtr<P> > { typedef PtrHash<COMPtr<P> > Hash; };
|
| /external/llvm/include/llvm/MC/MCParser/ |
| MCAsmLexer.h | 51 Amp, AmpAmp, Exclaim, ExclaimEqual, Percent, Hash,
|
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 659 // Map from PHI hash values to PHI nodes. If multiple PHIs have
660 // the same hash value, the element is the first PHI in the
664 // Maintain linked lists of PHI nodes with common hash values.
670 // Compute a hash value on the operands. Instcombine will likely have sorted
673 uintptr_t Hash = 0;
674 // This hash algorithm is quite weak as hash functions go, but it seems
677 Hash ^= reinterpret_cast<uintptr_t>(static_cast<Value *>(*I));
678 Hash = (Hash << 7) | (Hash >> (sizeof(uintptr_t) * CHAR_BIT - 7))
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| MergeFunctions.cpp | 12 // A hash is computed from the function, based on its type and number of
17 // important that the hash function be high quality. The equality comparison
75 /// Creates a hash-code for the function which is the same for any two
103 : Func(Func), Hash(profileFunction(Func)), TD(TD) {}
106 unsigned getHash() const { return Hash; }
118 explicit ComparableFunction(unsigned Hash)
119 : Func(NULL), Hash(Hash), TD(NULL) {}
122 unsigned Hash;
463 // in the hash first
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 243 /// HashMachineInstr - Compute a hash value for MI and its operands.
245 unsigned Hash = MI->getOpcode();
271 Hash += ((OperandHash << 3) | Op.getType()) << (i&31);
273 return Hash;
276 /// HashEndOfMBB - Hash the last instruction in the MBB.
575 /// hash CurHash (guaranteed to match the last element). Build the vector
619 /// RemoveBlocksWithHash - Remove all blocks with hash CurHash from
720 // Sort by hash value so that blocks with identical end sequences sort
728 // Build SameTails, identifying the set of blocks with this hash code
735 // instructions in common, remove all blocks with this hash code and retry
[all...] |
| MachineInstr.cpp | [all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 125 block cipher and hash function to ensure that they compile and execute to the published design specifications. The library
254 related issue is if you use the same symmetric cipher, hash or public key state data in multiple threads. Normally
[all...] |
| /external/clang/lib/Frontend/ |
| ASTUnit.cpp | 272 // temporary, CanQualType-based hash table to find the associated value.
362 // Save the current top-level hash value.
681 /// \brief Preprocessor callback class that updates a hash value with the names
684 unsigned &Hash;
687 explicit MacroDefinitionTrackerPPCallbacks(unsigned &Hash) : Hash(Hash) { }
690 Hash = llvm::HashString(MacroNameTok.getIdentifierInfo()->getName(), Hash);
694 /// \brief Add the given declaration to the hash of all top-level entities
[all...] |
