HomeSort by relevance Sort by last modified time
    Searched defs:Hash (Results 51 - 75 of 109) sorted by null

1 23 4 5

  /external/skia/src/gpu/text/
GrBatchFontCache.h 81 static uint32_t Hash(const GrFontDescKey& key) {
GrStencilAndCoverTextContext.h 119 static uint32_t Hash(const Key& key) {
120 SkASSERT(key.count() > 1); // 1-length keys should be using the blob-id hash map.
  /external/v8/src/
address-map.h 29 map->LookupOrInsert(Key(obj), Hash(obj));
31 return map->Lookup(Key(obj), Hash(obj));
35 static uint32_t Hash(HeapObject* obj) {
flags.cc 583 uint32_t FlagList::Hash() { return flag_hash; }
  /frameworks/compile/mclinker/include/mcld/LD/
BranchIsland.h 119 struct Hash {
122 hash::StringHash<hash::DJB> str_hasher;
159 typedef HashTable<StubEntryType, Key::Hash, EntryFactory<StubEntryType> >
  /external/guava/guava-tests/benchmark/com/google/common/collect/
MapBenchmark.java 40 @Param({"Hash", "LinkedHM", "MapMaker1", "Immutable"})
44 Hash {
64 return Collections.unmodifiableMap(Hash.create(keys));
69 return Collections.synchronizedMap(Hash.create(keys));
  /external/guava/guava-tests/test/com/google/common/collect/
BenchmarkHelpers.java 41 Hash {
105 Hash {
139 Hash {
193 Hash{
210 Hash {
  /external/libchrome/sandbox/linux/bpf_dsl/
codegen_unittest.cc 23 // Hash provides an abstraction for building "hash trees" from BPF
27 // convenient API for its use. However, any collision-resistant hash
29 class Hash {
31 static const Hash kZero;
33 Hash() : digest_() {}
35 Hash(uint16_t code,
37 const Hash& jt = kZero,
38 const Hash& jf = kZero)
49 Hash(const Hash& hash) = default member in class:sandbox::__anon14499::Hash
139 Hash& hash = prog_hashes.at(i - 1); local
    [all...]
  /external/llvm/lib/CodeGen/AsmPrinter/
DIEHash.h 26 /// \brief An object containing the capability of hashing and adding hash
95 /// \brief Adds the parent context of \param Die to the hash.
98 /// \brief Adds the attributes of \param Die to the hash.
101 /// \brief Computes the full DWARF4 7.27 hash of the DIE.
104 // Routines that add DIEValues to the hash.
106 /// \brief Adds \param Value to the hash.
107 void update(uint8_t Value) { Hash.update(Value); }
109 /// \brief Encodes and adds \param Value to the hash as a ULEB128.
112 /// \brief Encodes and adds \param Value to the hash as a SLEB128.
116 /// \brief Adds \param Str to the hash and includes a NULL byte
    [all...]
  /external/llvm/unittests/CodeGen/
DIEHashTest.cpp 40 DIEHash Hash;
44 uint64_t MD5Res = Hash.computeTypeSignature(Die);
59 // The exact same hash GCC produces for this DIE.
73 // The exact same hash GCC produces for this DIE.
101 // The exact same hash GCC produces for this DIE.
328 // Check that the hash for a pointer-to-member matches regardless of whether the
406 // Check that the hash for a pointer-to-member matches regardless of whether the
482 // causes a hash to differ when the containing type is a declaration in one TU
540 // The exact same hash GCC produces for this DIE.
558 // The exact same hash GCC produces for this DIE
    [all...]
  /external/llvm/unittests/ProfileData/
CoverageMappingTest.cpp 54 uint64_t Hash;
59 OneFunctionCoverageReader(StringRef Name, uint64_t Hash,
62 : Name(Name), Hash(Hash), Filenames(Filenames), Regions(Regions),
71 Record.FunctionHash = Hash;
143 void loadCoverageMapping(StringRef FuncName, uint64_t Hash) {
150 OneFunctionCoverageReader CovReader(FuncName, Hash, Filenames, OutputCMRs);
  /external/skia/src/core/
SkGlyph.h 140 static uint32_t Hash(uint32_t glyphId) {
SkResourceCache.h 49 uint32_t hash() const { return fHash; } function in struct:SkResourceCache::Key
80 uint32_t getHash() const { return this->getKey().hash(); }
90 static uint32_t Hash(const Key& key) { return key.hash(); }
259 class Hash;
260 Hash* fHash;
SkTDynamicHash.h 17 // static uint32_t Hash(const Key&) { ... }
35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
36 SkASSERT(hash);
62 explicit ConstIter(const SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
63 SkASSERT(hash);
267 // fCapacity is always a power of 2, so this masks the correct low bits to index into our hash.
271 return Hash(key) & this->hashMask();
281 static uint32_t Hash(const Key& key) { return Traits::Hash(key);
    [all...]
SkImageFilter.cpp 540 static uint32_t Hash(const Key& key) {
SkResourceCache.cpp 56 class SkResourceCache::Hash :
65 fHash = new Hash;
  /external/webrtc/webrtc/base/
socketaddress.cc 250 size_t SocketAddress::Hash() const {
  /external/llvm/include/llvm/MC/MCParser/
MCAsmLexer.h 50 Amp, AmpAmp, Exclaim, ExclaimEqual, Percent, Hash,
  /external/skia/src/gpu/
GrResourceCache.h 285 static uint32_t Hash(const GrScratchKey& key) { return key.hash(); }
292 static uint32_t Hash(const GrUniqueKey& key) { return key.hash(); }
  /external/v8/src/crankshaft/
hydrogen-bce.cc 25 uint32_t Hash() {
319 &(ZoneHashMap::LookupOrInsert(key, key->Hash(),
327 ZoneHashMap::LookupOrInsert(key, key->Hash(), ZoneAllocationPolicy(zone))
333 Remove(key, key->Hash());
  /external/clang/lib/CodeGen/
CodeGenPGO.cpp 48 /// PGOHash produces a stable hash of a given function's control flow.
50 /// Changing the output of this hash will invalidate all previously generated
53 /// \note When this hash does eventually change (years?), we still need to
55 /// profile data format and use the matching hash function.
66 /// \brief Hash values for AST nodes.
72 /// AST node will affect the hash of every function that contains that node.
98 // old hash calculation for file formats that used the old hash.
111 /// The function hash.
112 PGOHash Hash;
    [all...]
  /external/clang/lib/Lex/
HeaderSearch.cpp 141 // Construct the name <ModuleName>-<hash of ModuleMapPath>.pcm which should
143 // in the hash are safe (because any translation unit can only import one
155 llvm::hash_code Hash =
160 llvm::APInt(64, size_t(Hash)).toStringUnsigned(HashStr, /*Radix*/36);
    [all...]
  /external/llvm/include/llvm/ProfileData/
InstrProf.h 222 // A map from MD5 hash keys to function name strings.
224 // A map from function runtime address to function name MD5 hash.
252 /// Map a function address to its name's MD5 hash. This interface
262 /// Return function's PGO name from the name's md5 hash value.
326 InstrProfRecord(StringRef Name, uint64_t Hash, std::vector<uint64_t> Counts)
327 : Name(Name), Hash(Hash), Counts(std::move(Counts)) {}
329 uint64_t Hash;
389 // Map indirect call target name hash to name string.
494 MD5 Hash;
    [all...]
  /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
61 /// \brief A single item in the hash table.
67 const typename Info::hash_value_type Hash;
71 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {
    [all...]
  /external/v8/src/ast/
scopeinfo.cc 641 int ContextSlotCache::Hash(Object* data, String* name) {
645 return static_cast<int>((addr_hash ^ name->Hash()) % kLength);
652 int index = Hash(data, name);
675 int index = Hash(*data, *internalized_name);
705 int index = Hash(*data, *name);

Completed in 2042 milliseconds

1 23 4 5