/external/perfetto/src/trace_processor/containers/ |
D | bit_vector.cc | 85 : size_(size), counts_(std::move(counts)), words_(std::move(words)) { in BitVector() 100 counts_.clear(); in Resize() 107 uint32_t old_blocks_size = static_cast<uint32_t>(counts_.size()); in Resize() 112 counts_.resize(new_blocks_size); in Resize() 134 counts_[i] = set_count; in Resize() 146 counts_[i] = count; in Resize() 162 return BitVector(words_, counts_, size_); in Copy() 277 for (uint32_t i = 0; i < counts_.size() - 1; ++i) { in UpdateSetBits() 278 counts_[i + 1] = counts_[i] + ConstBlockFromIndex(i).CountSetBits(); in UpdateSetBits()
|
D | bit_vector_iterators.cc | 48 static_cast<int32_t>(bv_->counts_[i]) + set_bit_count_diff_; in OnBlockChange() 51 bv_->counts_[i] = static_cast<uint32_t>(new_count); in OnBlockChange() 88 addr.block_idx == bv().counts_.size() - 1 in ReadSetBitBatch() 90 : bv().counts_[addr.block_idx + 1]; in ReadSetBitBatch()
|
D | bit_vector.h | 179 return counts_[addr.block_idx] + in CountSetBits() 194 auto it = std::upper_bound(counts_.begin(), counts_.end(), n); in IndexOfNthSet() 195 PERFETTO_DCHECK(it != counts_.begin()); in IndexOfNthSet() 199 static_cast<uint32_t>(std::distance(counts_.begin(), it) - 1); in IndexOfNthSet() 203 uint32_t set_in_block = n - counts_[block_idx]; in IndexOfNthSet() 224 uint32_t size = static_cast<uint32_t>(counts_.size()); in Set() 226 counts_[i]++; in Set() 245 uint32_t size = static_cast<uint32_t>(counts_.size()); in Clear() 247 counts_[i]--; in Clear() 268 counts_.emplace_back(t); in AppendFalse() [all …]
|
/external/libtextclassifier/native/lang_id/features/ |
D | char-ngram-feature.cc | 57 counts_.assign(ngram_id_dimension_, 0); in Setup() 68 SAFTM_CHECK_EQ(static_cast<int>(counts_.size()), ngram_id_dimension_); in ComputeNgramCounts() 104 int &ref_to_count_for_ngram = counts_[ngram_id]; in ComputeNgramCounts() 142 const float weight = counts_[ngram_id] / norm; in Evaluate() 147 counts_[ngram_id] = 0; in Evaluate()
|
D | char-ngram-feature.h | 82 mutable std::vector<int> counts_; variable
|
/external/libchrome/base/metrics/ |
D | sample_vector.h | 76 subtle::Acquire_Load(&counts_)); in counts() 81 subtle::Acquire_Load(&counts_)); in counts() 85 subtle::Release_Store(&counts_, reinterpret_cast<uintptr_t>(counts)); in set_counts() 106 mutable subtle::AtomicWord counts_ = 0; variable 176 const HistogramBase::AtomicCount* counts_; variable
|
D | sample_vector.cc | 265 if (subtle::NoBarrier_Load(&counts_) == 0) { in MountCountsStorageAndMoveSingleSample() 267 if (subtle::NoBarrier_Load(&counts_) == 0) { in MountCountsStorageAndMoveSingleSample() 367 : counts_(&(*counts)[0]), in SampleVectorIterator() 379 : counts_(counts), in SampleVectorIterator() 408 *count = subtle::NoBarrier_Load(&counts_[index_]); in Get() 423 if (subtle::NoBarrier_Load(&counts_[index_]) != 0) in SkipEmptyBuckets()
|
/external/cronet/base/metrics/ |
D | sample_vector.h | 84 return counts_.load(std::memory_order_acquire); in counts() 88 return counts_.load(std::memory_order_acquire); in counts() 92 counts_.store(counts, std::memory_order_release); in set_counts() 113 mutable std::atomic<HistogramBase::AtomicCount*> counts_{nullptr};
|
D | sample_vector.cc | 40 : counts_(counts), in IteratorTemplate() 76 if (subtle::NoBarrier_Load(&counts_[index_]) != 0) { in SkipEmptyBuckets() 83 raw_ptr<T> counts_; member in base::__anon8ce041880111::IteratorTemplate 103 *count = subtle::NoBarrier_Load(&counts_[index_]); in Get() 124 *count = subtle::NoBarrier_AtomicExchange(&counts_[index_], 0); in Get() 437 if (!counts_.load(std::memory_order_relaxed)) { in MountCountsStorageAndMoveSingleSample() 439 if (!counts_.load(std::memory_order_relaxed)) { in MountCountsStorageAndMoveSingleSample()
|
/external/cronet/net/tools/huffman_trie/huffman/ |
D | huffman_builder.cc | 57 counts_[character & 127] += 1; in RecordUsage() 122 nodes.reserve(counts_.size()); in BuildTree() 124 for (const auto& item : counts_) { in BuildTree()
|
D | huffman_builder.h | 76 std::map<uint8_t, uint32_t> counts_; variable
|
/external/cronet/net/dns/ |
D | host_resolver_manager.cc | 395 ++counts_[req_priority]; in Add() 402 DCHECK_GT(counts_[req_priority], 0u); in Remove() 404 --counts_[req_priority]; in Remove() 406 for (i = highest_priority_; i > MINIMUM_PRIORITY && !counts_[i]; --i) { in Remove() 418 size_t counts_[NUM_PRIORITIES] = {}; member in net::__anon69cc9fd70111::PriorityTracker
|