| /external/v8/src/heap/ |
| heap-inl.h | 142 // Set length and hash fields of the allocated string.
172 // Set length and hash fields of the allocated string.
668 int DescriptorLookupCache::Hash(Object* source, Name* name) {
679 int index = Hash(source, name);
688 int index = Hash(source, name);
|
| heap.cc | 3992 int hash; local
5365 uint32_t hash = StringHasher::GetHashCore(raw_allocations_hash_); local
[all...] |
| /external/v8/src/snapshot/ |
| serializer-common.h | 26 static uint32_t Hash(Address key) {
|
| /art/runtime/ |
| profiler.cc | 496 uint32_t index = Hash(method);
721 uint32_t ProfileSampleResults::Hash(ArtMethod* method) {
|
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/ |
| btSparseSdf3.java | 341 public static long Hash(int x, int y, int z, btCollisionShape shape) {
|
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 273 /// HashMachineInstr - Compute a hash value for MI and its operands.
275 unsigned Hash = MI->getOpcode();
280 // hash_code here because it's not deterministic and we sort by hash value
308 Hash += ((OperandHash << 3) | Op.getType()) << (i & 31);
310 return Hash;
313 /// HashEndOfMBB - Hash the last instruction in the MBB.
628 /// hash CurHash (guaranteed to match the last element). Build the vector
672 /// RemoveBlocksWithHash - Remove all blocks with hash CurHash from
835 // Sort by hash value so that blocks with identical end sequences sort
843 // Build SameTails, identifying the set of blocks with this hash cod
[all...] |
| /external/llvm/lib/IR/ |
| LLVMContextImpl.h | 175 unsigned Hash;
179 : RawOps(Ops), Hash(calculateHash(Ops)) {}
183 : Ops(N->op_begin() + Offset, N->op_end()), Hash(N->getHash()) {}
208 unsigned getHash() const { return Hash; }
[all...] |
| /external/pdfium/xfa/src/fgas/src/font/ |
| fx_stdfontmgr.cpp | 889 void* Hash[2] = {(void*)(uintptr_t)pBuffer, (void*)(uintptr_t)iLength};
891 FX_HashCode_String_GetA((const FX_CHAR*)Hash, 2 * sizeof(void*));
[all...] |
| /external/skia/dm/ |
| DM.cpp | 48 "If true, write to FLAGS_writePath[0]/<hash>.png instead of "
164 struct Hash {
170 static SkTHashSet<Gold, Gold::Hash> gGold;
200 for (const SkString& hash : hashes) {
201 gUninterestingHashes.add(hash);
917 SkMD5 hash;
919 hash.writeStream(data, data->getLength());
929 hash.write(swizzle.getPixels(), swizzle.getSize());
931 hash.write(bitmap.getPixels(), bitmap.getSize());
935 hash.finish(digest)
[all...] |
| /external/skia/src/core/ |
| SkPictureFlat.h | 358 static uint32_t Hash(const SkFlatData& flat) { return flat.checksum(); }
|
| /external/skia/src/gpu/text/ |
| GrAtlasTextBlob.h | 88 static uint32_t Hash(const Key& key) {
|
| /external/v8/src/ast/ |
| ast.cc | 401 uint32_t hash = literal->Hash(); local
402 ZoneHashMap::Entry* entry = table.LookupOrInsert(literal, hash, allocator);
[all...] |
| /external/v8/src/parsing/ |
| scanner.cc | 1587 uint32_t hash = Hash(key, is_one_byte); local
1654 uint32_t hash = (length << 1) | (is_one_byte ? 1 : 0); local
[all...] |
| /external/v8/src/profiler/ |
| heap-snapshot-generator.h | 294 static uint32_t Hash(HeapThing thing) {
|
| /external/clang/lib/Frontend/ |
| ASTUnit.cpp | 386 // temporary, CanQualType-based hash table to find the associated value.
476 // Save the current top-level hash value.
763 /// \brief Preprocessor callback class that updates a hash value with the names
766 unsigned &Hash;
769 explicit MacroDefinitionTrackerPPCallbacks(unsigned &Hash) : Hash(Hash) { }
773 Hash = llvm::HashString(MacroNameTok.getIdentifierInfo()->getName(), Hash);
777 /// \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/IPO/ |
| MergeFunctions.cpp | 31 // As an optimization, a hash of the function structure is calculated first, and
32 // two functions are only compared if they have the same hash. This hash is
34 // the comparison function, then hash(F) == hash(G). This consistency property
36 // Collisions in the hash affect the speed of the pass but not the correctness
185 /// Hash a function. Equivalent functions will have the same hash, and unequal
456 FunctionComparator::FunctionHash Hash;
458 // Note the hash is recalculated potentially multiple times, but it is cheap
[all...] |
| /external/v8/src/ |
| d8.cc | 1013 int CounterMap::Hash(const char* name) {
[all...] |
| bootstrapper.cc | [all...] |
| objects.h | 3899 Object* hash = key->GetHash(); local
[all...] |
| /external/llvm/lib/Target/AArch64/AsmParser/ |
| AArch64AsmParser.cpp | [all...] |
| /external/llvm/tools/dsymutil/ |
| DwarfLinker.cpp | 94 /// specific DeclContext using a separate DenseMap keyed on the hash
118 DeclContext(unsigned Hash, uint32_t Line, uint32_t ByteSize, uint16_t Tag,
122 : QualifiedNameHash(Hash), Line(Line), ByteSize(ByteSize), Tag(Tag),
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExpr.cpp | 602 // Compute a hash of the mangled name of the type.
624 llvm::Value *Hash = emitHash16Bytes(Builder, Low, High);
625 Hash = Builder.CreateTrunc(Hash, IntPtrTy);
627 // Look the hash up in our cache.
632 llvm::Value *Slot = Builder.CreateAnd(Hash,
640 // If the hash isn't in the cache, call a runtime handler to perform the
644 llvm::Value *EqualHash = Builder.CreateICmpEQ(CacheVal, Hash);
651 llvm::Value *DynamicData[] = { Ptr, Hash };
[all...] |
| /external/zopfli/src/zopflipng/lodepng/ |
| lodepng.cpp | 1970 Hash hash; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| lmaccess.h | 741 LPBYTE Hash;
[all...] |
