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

12 3 4 5

  /external/llvm/lib/CodeGen/AsmPrinter/
ByteStreamer.h 61 DIEHash &Hash;
63 HashingByteStreamer(DIEHash &H) : Hash(H) {}
65 Hash.update(Byte);
68 Hash.addSLEB128(DWord);
71 Hash.addULEB128(DWord);
  /frameworks/av/media/libstagefright/foundation/
AAtomizer.cpp 41 size_t index = AAtomizer::Hash(name) % n;
57 uint32_t AAtomizer::Hash(const char *s) {
  /external/libchrome/base/
location.h 36 // Comparator for hash map insertion.
51 // Hash operator for hash maps.
52 struct Hash {
54 // Compute the hash value using file name pointer and line number.
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
erase_const_iter.pass.cpp 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 struct Hash { size_t operator() (const TemplateConstructor &) const { return 0; } };
81 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
130 typedef std::unordered_multimap<T, int, Hash> C;
  /external/skia/src/core/
SkTMultiMap.h 26 static uint32_t Hash(const Key& key) { return HashTraits::Hash(key); }
  /external/skia/src/gpu/vk/
GrVkResource.h 42 static uint32_t Hash(const uint32_t& k) { return k; }
  /external/skia/tests/
DynamicHashTest.cpp 18 static uint32_t Hash(const int& key) { return key; }
22 class Hash : public SkTDynamicHash<Entry, int> {
24 Hash() : INHERITED() {}
45 Hash hash; local
46 ASSERT(hash.capacity() == 0);
48 hash.add(&a);
49 ASSERT(hash.capacity() == 4);
51 hash.add(&b);
52 ASSERT(hash.capacity() == 4)
67 Hash hash; local
79 Hash hash; local
114 Hash hash; local
140 Hash hash; local
193 Hash hash; local
    [all...]
  /external/skia/tools/
UrlDataManager.h 28 * Adds a data blob to the cache with a particular content type. UrlDataManager will hash
49 // We use the data as a hash, this is not really optimal but is fine until proven otherwise
54 static uint32_t Hash(const SkData& key) {
64 static uint32_t Hash(const SkString& key) {
  /external/v8/src/
version.h 22 static uint32_t Hash() {
identity-map.cc 42 int IdentityMapBase::Hash(Object* address) {
50 int start = Hash(address) & mask_;
67 int start = Hash(address) & mask_;
146 int pos = Hash(keys_[i]) & mask_;
  /external/clang/lib/StaticAnalyzer/Core/
IssueHash.cpp 163 llvm::MD5 Hash;
167 Hash.update(Content);
168 Hash.final(MD5Res);
  /external/llvm/lib/DebugInfo/DWARF/
DWARFAcceleratorTable.cpp 53 << "Hash function = " << format("0x%08x", Hdr.HashFunction) << '\n'
94 uint32_t Hash = AccelSection.getU32(&HashOffset);
96 if (Hash % Hdr.NumBuckets != Bucket)
100 OS << format(" Hash = 0x%08x Offset = 0x%08x\n", Hash, DataOffset);
  /external/llvm/lib/IR/
DebugInfoMetadata.cpp 180 unsigned Hash = 0;
187 Hash = Key.getHash();
196 Context, Storage, Hash, Tag, PreOps, DwarfOps),
LLVMContextImpl.cpp 192 /// MDOperand hash to the same value as a \a Metadata pointer.
206 unsigned Hash = hash_combine_range(N->op_begin() + Offset, N->op_end());
211 assert(Hash == RawHash &&
212 "Expected hash of MDOperand to equal hash of Metadata*");
215 return Hash;
  /external/skia/src/gpu/
GrGlyph.h 98 static inline uint32_t Hash(GrGlyph::PackedID key) {
  /external/skia/src/gpu/batches/
GrAADistanceFieldPathRenderer.h 72 static inline uint32_t Hash(Key key) {
  /external/skia/src/pdf/
SkPDFCanon.h 108 struct Hash {
111 return w.fPtr->hash();
115 SkTHashSet<WrapGS, WrapGS::Hash> fGraphicStateRecords;
  /external/v8/test/cctest/
test-hashmap.cc 47 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {}
92 static uint32_t Hash(uint32_t key) { return 23; }
96 void TestSet(IntKeyHash hash, int size) {
97 IntSet set(hash);
177 TestSet(Hash, 100);
  /system/core/metricsd/uploader/
metrics_log_base.cc 58 uma_proto_.set_client_id(Hash(client_id));
68 uint64_t MetricsLogBase::Hash(const std::string& value) {
69 uint64_t hash = metrics::HashMetricName(value); local
73 // that happens, all we get to see (server side) is a hash of the histogram
77 VLOG(1) << "Metrics: Hash numeric [" << value << "]=[" << hash << "]"; local
79 return hash;
111 user_action->set_name_hash(Hash(key));
125 histogram_proto->set_name_hash(Hash(histogram_name));
  /art/compiler/utils/
dedupe_set-inl.h 69 const StoreKey* Add(Thread* self, size_t hash, const InKey& in_key) REQUIRES(!lock_) {
71 HashedKey<InKey> hashed_in_key(hash, &in_key);
78 keys_.Insert(HashedKey<StoreKey> { hash, store_key });
83 // HashSet<> doesn't keep entries ordered by hash, so we actually allocate memory
89 // It may have been higher before a re-hash.
93 auto it = stats.find(key.Hash());
95 stats.insert({key.Hash(), 1u});
115 HashedKey(size_t hash, const T* key) : hash_(hash), key_(key) { }
117 size_t Hash() const
    [all...]
  /external/llvm/lib/CodeGen/
BranchFolding.h 39 unsigned Hash;
43 : Hash(h), Block(b) {}
45 unsigned getHash() const { return Hash; }
  /external/llvm/lib/Fuzzer/
FuzzerUtil.cpp 40 std::string Hash(const Unit &U) {
41 uint8_t Hash[kSHA1NumBytes];
42 ComputeSHA1(U.data(), U.size(), Hash);
45 SS << std::hex << std::setfill('0') << std::setw(2) << (unsigned)Hash[i];
  /external/skia/include/private/
SkTHash.h 21 // - static uint32_t Hash(K)
51 // Copy val into the hash table, returning a pointer to the copy now in the table.
62 uint32_t hash = Hash(key); local
63 int index = hash & (fCapacity-1);
69 if (!s.removed() && hash == s.hash && key == Traits::GetKey(s.val)) {
78 // Remove the value with this key from the hash table.
82 uint32_t hash = Hash(key) local
121 uint32_t hash = Hash(key); local
173 uint32_t hash = Traits::Hash(key); local
185 uint32_t hash; member in struct:SkTHashTable::Slot
    [all...]
  /external/skia/src/gpu/effects/
GrTextureStripAtlas.cpp 21 class GrTextureStripAtlas::Hash : public SkTDynamicHash<GrTextureStripAtlas::AtlasEntry,
26 GrTextureStripAtlas::Hash* GrTextureStripAtlas::gAtlasCache = nullptr;
28 GrTextureStripAtlas::Hash* GrTextureStripAtlas::GetCache() {
31 gAtlasCache = new Hash;
GrTextureStripAtlas.h 25 * Descriptor struct which we'll use as a hash table key
140 // Hash table entry for atlases
145 static uint32_t Hash(const Desc& desc) { return SkChecksum::Murmur3(&desc, sizeof(Desc)); }
154 class Hash;
155 static Hash* gAtlasCache;
157 static Hash* GetCache();

Completed in 614 milliseconds

12 3 4 5