| /external/llvm/include/llvm/ProfileData/ |
| InstrProfReader.h | 35 InstrProfRecord(StringRef Name, uint64_t Hash, ArrayRef<uint64_t> Counts)
36 : Name(Name), Hash(Hash), Counts(Counts) {}
38 uint64_t Hash;
107 /// Each record consists of a function name, a function hash, a number of
206 /// Trait for lookups into the on-disk hash table for the binary instrprof
246 // The first stored value is the hash.
247 uint64_t Hash = endian::readNext<uint64_t, little, unaligned>(D);
255 return InstrProfRecord(K, Hash, CountBuffer);
|
| /external/llvm/include/llvm/Support/ |
| OnDiskHashTable.h | 1 //===--- OnDiskHashTable.h - On-Disk Hash Table Implementation --*- C++ -*-===//
11 /// \brief Defines facilities for reading and writing on-disk hash tables.
29 /// \brief Generates an on disk hash table.
31 /// This needs an \c Info that handles storing values into the hash table's
32 /// payload and computes the hash for a given key. This should provide the
42 /// typedef uint32_t hash_value_type; // The type the hash function returns.
45 /// /// Calculate the hash for Key
59 /// \brief A single item in the hash table.
65 const typename Info::hash_value_type Hash;
69 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {
[all...] |
| /external/skia/src/gpu/ |
| GrResourceCache.h | 125 static uint32_t Hash(const GrResourceKey& key) { return key.getHash(); }
170 * For fast searches, we maintain a hash map based on the GrResourceKey.
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkScaledImageCache.cpp | 34 uint32_t hash = 0; local
42 hash ^= k;
43 hash = (hash << 13) | (hash >> 19);
44 hash *= 5;
45 hash += 0xe6546b64;
48 // hash ^= size;
49 hash ^= hash >> 16
[all...] |
| SkPictureFlat.h | 340 static uint32_t Hash(const SkFlatData& flat) { return flat.checksum(); }
|
| /external/chromium_org/v8/src/ |
| scanner.cc | 1154 uint32_t hash = Hash(key, is_one_byte); local
1221 uint32_t hash = (length << 1) | (is_one_byte ? 1 : 0) ; local
[all...] |
| debug.h | 166 // Calculate the hash value from the key (script id).
167 static uint32_t Hash(int key) {
|
| heap-snapshot-generator.h | 291 static uint32_t Hash(HeapThing thing) {
|
| d8.cc | 684 int CounterMap::Hash(const char* name) {
[all...] |
| bootstrapper.cc | [all...] |
| heap.h | [all...] |
| /external/clang/lib/CodeGen/ |
| CodeGenPGO.cpp | 207 /// PGOHash produces a stable hash of a given function's control flow.
209 /// Changing the output of this hash will invalidate all previously generated
212 /// \note When this hash does eventually change (years?), we still need to
214 /// profile data format and use the matching hash function.
225 /// \brief Hash values for AST nodes.
231 /// AST node will affect the hash of every function that contains that node.
257 // old hash calculation for file formats that used the old hash.
270 /// The function hash.
271 PGOHash Hash;
[all...] |
| CGExpr.cpp | 538 // Compute a hash of the mangled name of the type.
556 llvm::Value *Hash = emitHash16Bytes(Builder, Low, High);
557 Hash = Builder.CreateTrunc(Hash, IntPtrTy);
559 // Look the hash up in our cache.
564 llvm::Value *Slot = Builder.CreateAnd(Hash,
571 // If the hash isn't in the cache, call a runtime handler to perform the
581 llvm::Value *DynamicData[] = { Address, Hash };
582 EmitCheck(Builder.CreateICmpEQ(CacheVal, Hash),
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 819 // Map from PHI hash values to PHI nodes. If multiple PHIs have
820 // the same hash value, the element is the first PHI in the
824 // Maintain linked lists of PHI nodes with common hash values.
830 // Compute a hash value on the operands. Instcombine will likely have sorted
833 uintptr_t Hash = 0;
834 // This hash algorithm is quite weak as hash functions go, but it seems
[all...] |
| /external/skia/src/core/ |
| SkScaledImageCache.cpp | 34 uint32_t hash = 0; local
42 hash ^= k;
43 hash = (hash << 13) | (hash >> 19);
44 hash *= 5;
45 hash += 0xe6546b64;
48 // hash ^= size;
49 hash ^= hash >> 16
[all...] |
| SkPictureFlat.h | 340 static uint32_t Hash(const SkFlatData& flat) { return flat.checksum(); }
|
| /art/runtime/ |
| profiler.cc | 490 uint32_t index = Hash(method);
715 uint32_t ProfileSampleResults::Hash(mirror::ArtMethod* method) {
|
| class_linker.cc | 131 static size_t Hash(const char* s) {
133 size_t hash = 0; local
135 hash = hash * 31 + *s;
137 return hash;
3300 size_t hash = Hash(descriptor); local
3316 size_t hash = Hash(descriptor); local
3393 size_t hash = Hash(descriptor); local
3443 size_t hash = Hash(descriptor); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 260 /// HashMachineInstr - Compute a hash value for MI and its operands.
262 unsigned Hash = MI->getOpcode();
288 Hash += ((OperandHash << 3) | Op.getType()) << (i&31);
290 return Hash;
293 /// HashEndOfMBB - Hash the last instruction in the MBB.
591 /// hash CurHash (guaranteed to match the last element). Build the vector
634 /// RemoveBlocksWithHash - Remove all blocks with hash CurHash from
741 // Sort by hash value so that blocks with identical end sequences sort
749 // Build SameTails, identifying the set of blocks with this hash code
756 // instructions in common, remove all blocks with this hash code and retry
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/heap/ |
| Handle.h | 458 typename HashArg = typename DefaultHash<KeyArg>::Hash,
465 typename HashArg = typename DefaultHash<ValueArg>::Hash,
471 typename HashArg = typename DefaultHash<ValueArg>::Hash,
478 typename HashArg = typename DefaultHash<ValueArg>::Hash>
1082 static unsigned hash(const U& key) { return PtrHash<T*>::hash(key); } function in struct:WTF::PtrHash
1094 static unsigned hash(const RefPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
[all...] |
| HeapTest.cpp | 66 unsigned hash() { return IntHash<int>::hash(m_x); } function in class:WebCore::IntWrapper
96 static unsigned hash(const ThreadMarker& key) function in struct:WebCore::ThreadMarkerHash
119 ASSERT(one); // We use null first field to indicate empty slots in the hash table.
123 // placement new to mark slots in the hash table as being deleted. We will
158 typedef WebCore::ThreadMarkerHash Hash;
161 // ThreadMarkerHash is the default hash for ThreadMarker
168 // The hash algorithm for our custom pair class is just the standard double
169 // hash for pairs. Note that this means you can't mutate either of the parts of
170 // the pair while they are in the hash table, as that would change their has
411 unsigned hash() { return IntHash<int>::hash(m_x); } function in class:WebCore::OffHeapInt
2736 unsigned hash() { return IntHash<int>::hash(m_x); } function in class:WebCore::ThingWithDestructor
[all...] |
| /external/clang/lib/Frontend/ |
| ASTUnit.cpp | 390 // temporary, CanQualType-based hash table to find the associated value.
484 // Save the current top-level hash value.
776 /// \brief Preprocessor callback class that updates a hash value with the names
779 unsigned &Hash;
782 explicit MacroDefinitionTrackerPPCallbacks(unsigned &Hash) : Hash(Hash) { }
786 Hash = llvm::HashString(MacroNameTok.getIdentifierInfo()->getName(), Hash);
790 /// \brief Add the given declaration to the hash of all top-level entities
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 822 MDString *Hash = nullptr;
831 // We do not have any node. Generate and attatch the hash MDString to the
843 Hash = MDString::get(Inst->getContext(), os.str());
844 Inst->setMetadata(NodeId, MDNode::get(Inst->getContext(),Hash));
846 // We have a node. Grab its hash and return it.
849 Hash = cast<MDString>(Node->getOperand(0));
856 Hash = MDString::get(Arg->getContext(), os.str());
859 return Hash;
[all...] |
| /external/llvm/lib/Target/AArch64/AsmParser/ |
| AArch64AsmParser.cpp | [all...] |
