Home
last modified time | relevance | path

Searched refs:bucket_count (Results 1 – 24 of 24) sorted by relevance

/external/chromium/base/metrics/
Dhistogram.h76 #define HISTOGRAM_CUSTOM_COUNTS(name, sample, min, max, bucket_count) do { \ argument
79 counter = base::Histogram::FactoryGet(name, min, max, bucket_count, \
90 #define HISTOGRAM_CUSTOM_TIMES(name, sample, min, max, bucket_count) do { \ argument
93 counter = base::Histogram::FactoryTimeGet(name, min, max, bucket_count, \
100 #define HISTOGRAM_CLIPPED_TIMES(name, sample, min, max, bucket_count) do { \ argument
103 counter = base::Histogram::FactoryTimeGet(name, min, max, bucket_count, \
139 #define DHISTOGRAM_CUSTOM_TIMES(name, sample, min, max, bucket_count) \ argument
140 HISTOGRAM_CUSTOM_TIMES(name, sample, min, max, bucket_count)
141 #define DHISTOGRAM_CLIPPED_TIMES(name, sample, min, max, bucket_count) \ argument
142 HISTOGRAM_CLIPPED_TIMES(name, sample, min, max, bucket_count)
[all …]
Dhistogram.cc79 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()
[all …]
Dhistogram_unittest.cc287 size_t array_size = histogram->bucket_count(); in TEST()
/external/chromium/net/disk_cache/
Dstats_histogram.cc30 size_t bucket_count = disk_cache::Stats::kDataSizesLength; in StatsHistogramFactoryGet() local
37 new StatsHistogram(name, minimum, maximum, bucket_count); in StatsHistogramFactoryGet()
44 DCHECK(histogram->HasConstructorArguments(minimum, maximum, bucket_count)); in StatsHistogramFactoryGet()
71 size_t StatsHistogram::bucket_count() const { in bucket_count() function in disk_cache::StatsHistogram
Dstats_histogram.h34 Sample maximum, size_t bucket_count) in StatsHistogram() argument
35 : Histogram(name, minimum, maximum, bucket_count), init_(false) {} in StatsHistogram()
44 virtual size_t bucket_count() const;
Dhistogram_macros.h23 #define CACHE_HISTOGRAM_CUSTOM_COUNTS(name, sample, min, max, bucket_count) \ argument
28 name, min, max, bucket_count, \
42 #define CACHE_HISTOGRAM_CUSTOM_TIMES(name, sample, min, max, bucket_count) \ argument
47 name, min, max, bucket_count, \
/external/stlport/test/unit/
Dunordered_test.cpp302 size_t nbInserts = int_uset.bucket_count() - 1; in hash_policy()
312 size_t bucketsHint = int_uset.bucket_count() + 1; in hash_policy()
314 CPPUNIT_ASSERT( int_uset.bucket_count() >= bucketsHint ); in hash_policy()
326 CPPUNIT_ASSERT( int_uset.bucket_count() < int_uset.max_bucket_count() ); in buckets()
329 size_t nbBuckets = int_uset.bucket_count(); in buckets()
330 size_t nbInserts = int_uset.bucket_count() - 1; in buckets()
334 CPPUNIT_ASSERT( nbBuckets == int_uset.bucket_count() ); in buckets()
353 size_t nbBuckets = iumset.bucket_count(); in equal_range()
363 CPPUNIT_ASSERT( nbBuckets == iumset.bucket_count() ); in equal_range()
393 size_t nbBuckets = iumset.bucket_count(); in equal_range()
[all …]
/external/stlport/stlport/stl/debug/
D_hashtable.h187 _STLP_VERBOSE_ASSERT((__n < bucket_count()), _StlMsg_INVALID_ARGUMENT) in begin()
192 _STLP_VERBOSE_ASSERT((__n < bucket_count()), _StlMsg_INVALID_ARGUMENT) in end()
200 _STLP_VERBOSE_ASSERT((__n < bucket_count()), _StlMsg_INVALID_ARGUMENT) in begin()
205 _STLP_VERBOSE_ASSERT((__n < bucket_count()), _StlMsg_INVALID_ARGUMENT) in end()
315 size_type bucket_count() const { return _M_non_dbg_impl.bucket_count(); } in bucket_count() function
318 _STLP_VERBOSE_ASSERT((__n < bucket_count()), _StlMsg_INVALID_ARGUMENT) in elems_in_bucket()
/external/llvm/lib/CodeGen/AsmPrinter/
DDwarfAccelTable.cpp66 if (num > 1024) Header.bucket_count = num/4; in ComputeBucketCount()
67 if (num > 16) Header.bucket_count = num/2; in ComputeBucketCount()
68 else Header.bucket_count = num > 0 ? num : 1; in ComputeBucketCount()
101 Buckets.resize(Header.bucket_count); in FinalizeTable()
103 uint32_t bucket = Data[i]->HashValue % Header.bucket_count; in FinalizeTable()
118 Asm->EmitInt32(Header.bucket_count); in EmitHeader()
DDwarfAccelTable.h89 uint32_t bucket_count; // The number of buckets in this hash table. member
100 bucket_count (0), hashes_count (0), header_data_len (data_len) in TableHeader()
108 << "Bucket Count: " << bucket_count << "\n" in print()
/external/chromium/chrome/browser/chromeos/cros/
Dcros_library_loader.cc23 const size_t bucket_count(10); in addLibcrosTimeHistogram() local
29 bucket_count, in addLibcrosTimeHistogram()
/external/stlport/test/eh/
Dtest_hash_resize.h32 t.resize( 1+random_number(random_base) + t.bucket_count() ); in operator()
/external/stlport/stlport/stl/
D_unordered_set.h161 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
311 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_unordered_map.h175 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
335 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_hashtable.c366 if (bucket_count() >= __num_buckets_hint) { in rehash()
383 size_type __num_buckets = bucket_count(); in _M_enlarge()
397 size_type __num_buckets = bucket_count(); in _M_reduce()
483 size_t __num_buckets = bucket_count(); in _M_check()
D_hash_map.h224 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
410 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_hash_set.h219 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
401 size_type bucket_count() const { return _M_ht.bucket_count(); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_hashtable.h391 size_type bucket_count() const { return _M_buckets.size() - 1; }
400 float load_factor() const { return (float)size() / (float)bucket_count(); }
603 { return _M_bkt_num_key(__key, bucket_count()); }
/external/chromium/chrome/browser/net/websocket_experiment/
Dwebsocket_experiment_task.cc185 size_t bucket_count) { in GetTimesHistogramForConfig() argument
194 counter_name, min, max, bucket_count, in GetTimesHistogramForConfig()
215 size_t bucket_count) { in UpdateHistogramTimes() argument
217 config, name, min, max, bucket_count); in UpdateHistogramTimes()
/external/chromium/webkit/glue/
Dwebkitclient_impl.h51 const char* name, int sample, int min, int max, int bucket_count);
Dwebkitclient_impl.cc264 const char* name, int sample, int min, int max, int bucket_count) { in histogramCustomCounts() argument
268 base::Histogram::FactoryGet(name, min, max, bucket_count, in histogramCustomCounts()
/external/chromium/chrome/browser/extensions/
Dextension_metrics_apitest.cc132 EXPECT_EQ(r.buckets, histogram->bucket_count()); in ValidateHistograms()
/external/chromium/chrome/browser/
Dchrome_browser_application_mac_unittest.mm80 EXPECT_EQ(kUnknownNSException + 1, histograms[0]->bucket_count());
/external/chromium/chrome/common/
Dmetrics_helpers.cc407 for (size_t i = 0; i < histogram.bucket_count(); i++) { in RecordHistogramDelta()