/external/chromium_org/third_party/tcmalloc/chromium/src/ |
profiledata.cc | 80 : hash_(0), 113 hash_ = new Bucket[kBuckets]; 115 memset(hash_, 0, sizeof(hash_[0]) * kBuckets); 171 Bucket* bucket = &hash_[b]; 207 delete[] hash_; 208 hash_ = 0; 246 Bucket* bucket = &hash_[b]; 280 Bucket* bucket = &hash_[h % kBuckets];
|
profiledata.h | 164 Bucket* hash_; // hash table member in class:ProfileData
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
profiledata.cc | 80 : hash_(0), 113 hash_ = new Bucket[kBuckets]; 115 memset(hash_, 0, sizeof(hash_[0]) * kBuckets); 171 Bucket* bucket = &hash_[b]; 207 delete[] hash_; 208 hash_ = 0; 246 Bucket* bucket = &hash_[b]; 280 Bucket* bucket = &hash_[h % kBuckets];
|
profiledata.h | 164 Bucket* hash_; // hash table member in class:ProfileData
|
/external/chromium_org/v8/test/cctest/ |
test-hashmap.cc | 46 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {} 50 HashMap::Entry* p = map_.Lookup(reinterpret_cast<void*>(x), hash_(x), true); 58 map_.Remove(reinterpret_cast<void*>(x), hash_(x)); 63 map_.Lookup(reinterpret_cast<void*>(x), hash_(x), false); 84 IntKeyHash hash_; member in class:IntSet
|
/external/chromium_org/chrome/browser/extensions/api/image_writer_private/ |
write_from_url_operation.cc | 27 hash_(hash), 147 if (hash_.empty()) { 167 if (download_hash != hash_) {
|
write_from_url_operation.h | 69 const std::string hash_; member in class:extensions::image_writer::WriteFromUrlOperation
|
/external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
elf_mem_image.cc | 119 if (!hash_) { 123 return hash_[1]; 187 hash_ = NULL; 275 hash_ = reinterpret_cast<ElfW(Word) *>(value); 300 if (!hash_ || !dynsym_ || !dynstr_ || !versym_ || 302 RAW_DCHECK(hash_, "invalid VDSO (no DT_HASH)");
|
elf_mem_image.h | 123 const ElfW(Word) *hash_; member in class:base::ElfMemImage
|
/external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
elf_mem_image.cc | 119 if (!hash_) { 123 return hash_[1]; 187 hash_ = NULL; 275 hash_ = reinterpret_cast<ElfW(Word) *>(value); 300 if (!hash_ || !dynsym_ || !dynstr_ || !versym_ || 302 RAW_DCHECK(hash_, "invalid VDSO (no DT_HASH)");
|
elf_mem_image.h | 123 const ElfW(Word) *hash_; member in class:base::ElfMemImage
|
/external/chromium_org/third_party/cld/base/ |
stl_decl_msvc.h | 72 // and use the NATIVE_HASH_NAMESPACE::hash_(set|map) implementation.
|
/external/chromium_org/net/quic/test_tools/ |
crypto_test_utils.cc | 279 hash_(hash), 289 if (hash == hash_ && index == index_) { 310 if (hash == hash_) { 320 *out_hash = hash_; 327 const uint64 hash_; member in class:net::test::MockCommonCertSets
|
/external/chromium_org/net/disk_cache/blockfile/ |
index_table_v3.cc | 338 EntryCell::EntryCell() : cell_num_(0), hash_(0), small_table_(false) { 347 hash_(hash), 371 hash_(hash), 389 hash_ &= (1 << kSmallTableHashShift) - 1; 390 hash_ |= GetCellSmallTableId(cell_) << kSmallTableHashShift; 391 return hash_; 394 hash_ &= (1 << kHashShift) - 1; 395 hash_ |= GetCellId(cell_) << kHashShift; 396 return hash_; [all...] |
index_table_v3.h | 58 uint32 hash() const { return hash_; } 95 // Recalculates hash_ assuming that only the low order bits are valid and the 102 uint32 hash_; member in class:disk_cache::EntryCell
|
/art/runtime/base/ |
stl_util.h | 38 // For hash_[multi]set, it is important that this deletes behind the iterator
|
/external/ceres-solver/internal/ceres/ |
stl_util.h | 44 // For hash_[multi]set, it is important that this deletes behind the iterator
|
/external/chromium_org/chrome/browser/chromeos/login/managed/ |
managed_user_authenticator.h | 66 std::string hash_; member in class:chromeos::ManagedUserAuthenticator::AuthAttempt
|
managed_user_authenticator.cc | 309 hash_ = hash; 335 return hash_;
|
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/ |
turnport.h | 113 const std::string& hash() const { return hash_; } 209 std::string hash_; // Digest of username:realm:password member in class:cricket::TurnPort
|
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/ |
stl_util.h | 47 // For hash_[multi]set, it is important that this deletes behind the iterator
|
/external/protobuf/src/google/protobuf/stubs/ |
stl_util-inl.h | 47 // For hash_[multi]set, it is important that this deletes behind the iterator
|
/frameworks/base/media/mca/filterfw/native/base/ |
utilities.h | 44 // For hash_[multi]set, it is important that this deletes behind the iterator
|
/frameworks/base/media/mca/filterpacks/native/base/ |
utilities.h | 44 // For hash_[multi]set, it is important that this deletes behind the iterator
|
/external/chromium_org/courgette/ |
adjustment_method_2.cc | 485 uint32 hash_; member in struct:courgette::adjustment_method_2::ShinglePattern::Index 539 base::StringAppendF(&s, " %x", index->hash_); 622 if (a.hash_ < b.hash_) return true; 623 if (a.hash_ > b.hash_) return false; 679 hash_ = hash; [all...] |