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

  /external/chromium_org/third_party/leveldatabase/src/util/
histogram.h 30 enum { kNumBuckets = 154 };
31 static const double kBucketLimit[kNumBuckets];
32 double buckets_[kNumBuckets];
histogram.cc 12 const double Histogram::kBucketLimit[kNumBuckets] = {
34 min_ = kBucketLimit[kNumBuckets-1];
39 for (int i = 0; i < kNumBuckets; i++) {
47 while (b < kNumBuckets - 1 && kBucketLimit[b] <= value) {
64 for (int b = 0; b < kNumBuckets; b++) {
76 for (int b = 0; b < kNumBuckets; b++) {
119 for (int b = 0; b < kNumBuckets; b++) {
  /external/chromium_org/third_party/WebKit/Source/wtf/
PartitionAlloc.cpp 51 for (i = 0; i < kNumBuckets; ++i) {
130 for (i = 0; i < kNumBuckets; ++i) {
333 if (oldIndex > kNumBuckets)
334 oldIndex = kNumBuckets;
336 if (newIndex > kNumBuckets)
337 newIndex = kNumBuckets;
340 // Same bucket. But kNumBuckets indicates the fastMalloc "bucket" so in
342 if (oldIndex == kNumBuckets)
362 for (i = 0; i < kNumBuckets; ++i) {
PartitionAlloc.h 107 static const size_t kNumBuckets = (1 << kMaxAllocationOrder) / (1 << kBucketShift);
152 PartitionBucket buckets[kNumBuckets];
216 ASSERT(index < kNumBuckets);
  /external/chromium/chrome/browser/chromeos/
boot_times_loader.cc 256 const int kNumBuckets = 100;
266 kNumBuckets,
284 kNumBuckets,
  /external/chromium_org/chrome/browser/chromeos/
boot_times_loader.cc 165 const int kNumBuckets = 100;
180 kNumBuckets,
198 kNumBuckets,
  /external/chromium_org/third_party/leveldatabase/
env_chromium.cc 826 const int kNumBuckets = 18;
828 uma_name, kFirstEntry, kLastEntry, kNumBuckets,
837 const int kNumBuckets = 11;
839 uma_name, kMin, kMax, kNumBuckets,
850 const int kNumBuckets = kMaxRetryTimeMillis / kBucketSizeMillis + 2;
854 kNumBuckets,

Completed in 1998 milliseconds