Lines Matching refs:bucket_count
79 size_t bucket_count, in FactoryGet() argument
95 new Histogram(name, minimum, maximum, bucket_count); in FactoryGet()
103 DCHECK(histogram->HasConstructorArguments(minimum, maximum, bucket_count)); in FactoryGet()
110 size_t bucket_count, in FactoryTimeGet() argument
113 bucket_count, flags); in FactoryTimeGet()
165 size_t largest_non_empty_bucket = bucket_count() - 1; in WriteAscii()
174 for (size_t i = 0; i < bucket_count(); ++i) { in WriteAscii()
185 for (size_t i = 0; i < bucket_count(); ++i) { in WriteAscii()
194 if (0 == current && i < bucket_count() - 1 && 0 == snapshot.counts(i + 1)) { in WriteAscii()
195 while (i < bucket_count() - 1 && 0 == snapshot.counts(i + 1)) in WriteAscii()
220 pickle.WriteSize(histogram.bucket_count()); in SerializeHistogramInfo()
240 size_t bucket_count; in DeserializeHistogramInfo() local
250 !pickle.ReadSize(&iter, &bucket_count) || in DeserializeHistogramInfo()
262 INT_MAX / sizeof(Count) <= bucket_count || bucket_count < 2) { in DeserializeHistogramInfo()
275 histogram_name, declared_min, declared_max, bucket_count, flags); in DeserializeHistogramInfo()
278 histogram_name, declared_min, declared_max, bucket_count, flags); in DeserializeHistogramInfo()
289 DCHECK_EQ(render_histogram->bucket_count(), bucket_count); in DeserializeHistogramInfo()
313 for (size_t index = 0; index < bucket_count(); ++index) { in FindCorruption()
360 size_t Histogram::bucket_count() const { in bucket_count() function in base::Histogram
373 size_t bucket_count) { in HasConstructorArguments() argument
375 (bucket_count == bucket_count_)); in HasConstructorArguments()
380 size_t bucket_count) { in HasConstructorTimeDeltaArguments() argument
383 (bucket_count == bucket_count_)); in HasConstructorTimeDeltaArguments()
391 Sample maximum, size_t bucket_count) in Histogram() argument
395 bucket_count_(bucket_count), in Histogram()
397 ranges_(bucket_count + 1, 0), in Histogram()
404 TimeDelta maximum, size_t bucket_count) in Histogram() argument
408 bucket_count_(bucket_count), in Histogram()
410 ranges_(bucket_count + 1, 0), in Histogram()
442 while (bucket_count() > ++bucket_index) { in InitializeBucketRange()
446 log_ratio = (log_max - log_current) / (bucket_count() - bucket_index); in InitializeBucketRange()
459 DCHECK_EQ(bucket_count(), bucket_index); in InitializeBucketRange()
470 DCHECK_GT(ranges(bucket_count()), value); in BucketIndex()
472 size_t over = bucket_count(); in BucketIndex()
540 DCHECK_EQ(ranges_.size(), bucket_count() + 1); in CalculateRangeChecksum()
542 for (size_t index = 0; index < bucket_count(); ++index) in CalculateRangeChecksum()
603 for (size_t i = 0; i < bucket_count() ; ++i) { in GetPeakBucketSize()
675 counts_.resize(histogram.bucket_count(), 0); in Resize()
679 DCHECK_EQ(histogram.bucket_count(), counts_.size()); in CheckSize()
776 size_t bucket_count, in FactoryGet() argument
788 new LinearHistogram(name, minimum, maximum, bucket_count); in FactoryGet()
796 DCHECK(histogram->HasConstructorArguments(minimum, maximum, bucket_count)); in FactoryGet()
803 size_t bucket_count, in FactoryTimeGet() argument
806 bucket_count, flags); in FactoryTimeGet()
823 size_t bucket_count) in LinearHistogram() argument
824 : Histogram(name, minimum >= 1 ? minimum : 1, maximum, bucket_count) { in LinearHistogram()
830 size_t bucket_count) in LinearHistogram() argument
833 maximum, bucket_count) { in LinearHistogram()
841 for (i = 1; i < bucket_count(); ++i) { in InitializeBucketRange()
842 double linear_range = (min * (bucket_count() -1 - i) + max * (i - 1)) / in InitializeBucketRange()
843 (bucket_count() - 2); in InitializeBucketRange()
955 DCHECK_LE(custom_ranges.size(), bucket_count()); in InitializedCustomBucketRange()