HomeSort by relevance Sort by last modified time
    Searched refs:counts_ (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/base/metrics/
sample_vector.cc 18 : counts_(bucket_ranges->bucket_count()),
27 subtle::NoBarrier_Store(&counts_[bucket_index],
28 subtle::NoBarrier_Load(&counts_[bucket_index]) + count);
35 return subtle::NoBarrier_Load(&counts_[bucket_index]);
40 for (size_t i = 0; i < counts_.size(); i++) {
41 count += subtle::NoBarrier_Load(&counts_[i]);
47 DCHECK(bucket_index < counts_.size());
48 return subtle::NoBarrier_Load(&counts_[bucket_index]);
53 new SampleVectorIterator(&counts_, bucket_ranges_));
64 while (index < counts_.size() && !iter->Done())
    [all...]
sample_vector.h 49 std::vector<HistogramBase::AtomicCount> counts_; member in class:base::SampleVector
76 const std::vector<HistogramBase::AtomicCount>* counts_; member in class:base::SampleVectorIterator
histogram_unittest.cc 320 snapshot->counts_[3] += 100; // Sample count won't match redundant count.
323 snapshot->counts_[2] -= 200;
328 snapshot->counts_[1] += 100;
  /external/chromium_org/net/spdy/
hpack_huffman_aggregator.cc 34 : counts_(256, 0),
149 encoders_.front().second->SetCharCountsStorage(&counts_, &total_counts_);
156 const size_t kRangeMax = counts_.size() + 1;
165 // Copy |counts_| into a SampleVector.
167 for (size_t i = 0; i != counts_.size(); ++i) {
168 samples.Accumulate(i + 1, counts_[i]);
179 counts_.assign(counts_.size(), 0);
hpack_huffman_aggregator.h 65 std::vector<size_t> counts_; member in class:net::HpackHuffmanAggregator
hpack_huffman_aggregator_test.cc 34 return &agg_->counts_;
  /external/chromium_org/media/base/
demuxer_perftest.cc 68 const std::vector<int>& counts() { return counts_; }
81 std::vector<int> counts_; member in class:media::StreamReader
94 counts_.push_back(0);
102 counts_.push_back(0);
124 counts_[index]++;
  /external/chromium_org/net/dns/
host_resolver_impl.cc 414 memset(counts_, 0, sizeof(counts_));
427 ++counts_[req_priority];
434 DCHECK_GT(counts_[req_priority], 0u);
436 --counts_[req_priority];
438 for (i = highest_priority_; i > MINIMUM_PRIORITY && !counts_[i]; --i);
449 size_t counts_[NUM_PRIORITIES]; member in class:net::__anon13832::PriorityTracker
    [all...]
  /art/runtime/gc/
heap.cc 1486 uint64_t* const counts_; member in class:art::gc::InstanceCounter
    [all...]

Completed in 384 milliseconds