| /external/llvm/lib/CodeGen/ |
| BranchFolding.h | 34 unsigned Hash;
38 : Hash(h), Block(b) {}
40 unsigned getHash() const { return Hash; }
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| float-weight.h | 54 ssize_t Hash() const {
|
| product-weight.h | 72 ssize_t Hash() const {
73 ssize_t h1 = value1_.Hash();
74 ssize_t h2 = value2_.Hash();
|
| string-weight.h | 108 ssize_t Hash() const;
267 inline ssize_t StringWeight<L, S>::Hash() const {
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| BranchIsland.h | 121 struct Hash
126 hash::StringHash<hash::DJB> str_hasher;
168 Key::Hash,
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| QualifiedName.h | 108 // Hash table deleted values, which are only constructed and never copied or destroyed.
165 static unsigned hash(const QualifiedName& name) { return hash(name.impl()); } function in struct:WebCore::QualifiedNameHash
167 static unsigned hash(const QualifiedName::QualifiedNameImpl* name) function in struct:WebCore::QualifiedNameHash
187 typedef WebCore::QualifiedNameHash Hash;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| RetainPtr.h | 81 // Hash table deleted values, which are only constructed and never copied or destroyed.
291 using PtrHash<typename RetainPtr<P>::PtrType>::hash;
292 static unsigned hash(const RetainPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
299 template<typename P> struct DefaultHash<RetainPtr<P> > { typedef PtrHash<RetainPtr<P> > Hash; };
|
| /external/chromium_org/third_party/WebKit/Source/wtf/text/ |
| AtomicString.h | 83 // Hash table deleted values, which are only constructed and never copied or destroyed.
252 // AtomicStringHash is the default hash for AtomicString
255 typedef AtomicStringHash Hash;
|
| StringImpl.h | 137 // Ensure that the hash is computed so that AtomicStringHash can call existingHash()
141 hash();
171 StringImpl(unsigned length, unsigned hash, StaticStringTag)
174 , m_hash(hash)
184 static StringImpl* createStatic(const char* string, unsigned length, unsigned hash);
235 // The high bits of 'hash' are always empty, but we prefer to store our flags
237 // So, we shift left and right when setting and getting our hash code.
238 void setHash(unsigned hash) const
241 // Multiple clients assume that StringHasher is the canonical string hash function.
242 ASSERT(hash == (is8Bit() ? StringHasher::computeHashAndMaskTop8Bits(characters8(), m_length) : StringHasher::c (…)
266 unsigned hash() const function in class:WTF::StringImpl
[all...] |
| WTFString.h | 424 // Hash table deleted values, which are only constructed and never copied or destroyed.
662 // StringHash is the default hash for String
665 typedef StringHash Hash;
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| hash.h | 15 // A (forgetful) hash table to the data seen by the compressor, to
47 inline uint32_t Hash(const uint8_t *data) {
49 // If kMinLength is 2 or 3, we hash the first 3 bytes of data.
55 // If kMinLength is at least 4, we hash the first 4 bytes of data.
114 // A (forgetful) hash table to the data seen by the compressor, to
117 // This is a hash map of fixed size (kBucketSize) to a ring buffer of
119 // index positions of the given hash key in the compressed data.
144 // Compute a hash from these, and store the value of ix at that position.
146 const uint32_t key = Hash<kBucketBits, kMinLength>(data);
296 const uint32_t key = Hash<kBucketBits, kMinLength>(&data[cur_ix_masked])
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| socketaddress.cc | 272 size_t SocketAddress::Hash() const {
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkImageFilter.cpp | 356 uint32_t hash = 0; local
364 hash ^= k;
365 hash = (hash << 13) | (hash >> 19);
366 hash *= 5;
367 hash += 0xe6546b64;
370 // hash ^= size;
371 hash ^= hash >> 16
[all...] |
| SkTDynamicHash.h | 17 // static uint32_t Hash(const Key&) { ... }
35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
36 SkASSERT(hash);
220 // fCapacity is always a power of 2, so this masks the correct low bits to index into our hash.
224 return Hash(key) & this->hashMask();
234 static uint32_t Hash(const Key& key) { return Traits::Hash(key); }
|
| /external/chromium_org/third_party/webrtc/base/ |
| socketaddress.cc | 255 size_t SocketAddress::Hash() const {
|
| /external/chromium_org/v8/src/ |
| serialize.h | 95 static uint32_t Hash(Address key) {
396 return serialization_map_->Lookup(Key(obj), Hash(obj), false) != NULL;
402 serialization_map_->Lookup(Key(obj), Hash(obj), false)->value));
408 serialization_map_->Lookup(Key(obj), Hash(obj), true);
413 static uint32_t Hash(HeapObject* obj) {
|
| hydrogen-bce.cc | 25 uint32_t Hash() {
310 &(Lookup(key, key->Hash(), true, ZoneAllocationPolicy(zone))->value));
317 Lookup(key, key->Hash(), true, ZoneAllocationPolicy(zone))->value = data;
322 Remove(key, key->Hash());
|
| scopeinfo.cc | 410 int ContextSlotCache::Hash(Object* data, String* name) {
414 return static_cast<int>((addr_hash ^ name->Hash()) % kLength);
422 int index = Hash(data, name);
444 int index = Hash(*data, *internalized_name);
473 int index = Hash(*data, *name);
|
| /external/llvm/include/llvm/IR/ |
| Metadata.h | 81 /// Hash - If the MDNode is uniqued cache the hash to speed up lookup.
82 unsigned Hash;
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIEHash.h | 26 /// \brief An object containing the capability of hashing and adding hash
105 /// \brief Adds the parent context of \param Die to the hash.
108 /// \brief Adds the attributes of \param Die to the hash.
111 /// \brief Computes the full DWARF4 7.27 hash of the DIE.
114 // Routines that add DIEValues to the hash.
116 /// \brief Adds \param Value to the hash.
117 void update(uint8_t Value) { Hash.update(Value); }
119 /// \brief Encodes and adds \param Value to the hash as a ULEB128.
122 /// \brief Encodes and adds \param Value to the hash as a SLEB128.
126 /// \brief Adds \param Str to the hash and includes a NULL byte
[all...] |
| /external/skia/src/core/ |
| SkImageFilter.cpp | 356 uint32_t hash = 0; local
364 hash ^= k;
365 hash = (hash << 13) | (hash >> 19);
366 hash *= 5;
367 hash += 0xe6546b64;
370 // hash ^= size;
371 hash ^= hash >> 16
[all...] |
| SkTDynamicHash.h | 17 // static uint32_t Hash(const Key&) { ... }
35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) {
36 SkASSERT(hash);
220 // fCapacity is always a power of 2, so this masks the correct low bits to index into our hash.
224 return Hash(key) & this->hashMask();
234 static uint32_t Hash(const Key& key) { return Traits::Hash(key); }
|
| /external/chromium_org/components/metrics/ |
| metrics_log.cc | 70 // Computes a SHA-1 hash of |data| and returns it as a hex string.
109 uma_proto_.set_client_id(Hash(client_id));
142 uint64 MetricsLog::Hash(const std::string& value) {
143 uint64 hash = metrics::HashMetricName(value); local
147 // that happens, all we get to see (server side) is a hash of the histogram
151 DVLOG(1) << "Metrics: Hash numeric [" << value << "]=[" << hash << "]"; local
153 return hash;
178 user_action->set_name_hash(Hash(key));
190 histogram_proto->set_name_hash(Hash(histogram_name))
[all...] |
| /external/chromium_org/third_party/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/llvm/include/llvm/MC/MCParser/ |
| MCAsmLexer.h | 50 Amp, AmpAmp, Exclaim, ExclaimEqual, Percent, Hash,
|
