/external/chromium/net/socket_stream/ |
H A D | socket_stream_metrics_unittest.cc | 6 #include "base/metrics/histogram.h" 28 Histogram* histogram; local 35 "Net.SocketStream.ProtocolType", &histogram)) { 36 histogram->SnapshotSample(&original); 47 "Net.SocketStream.ProtocolType", &histogram)); 48 EXPECT_EQ(Histogram::kUmaTargetedHistogramFlag, histogram->flags()); 51 histogram->SnapshotSample(&sample); 52 original.Resize(*histogram); // Ensure |original| size is same as |sample|. 60 Histogram* histogram; local 65 "Net.SocketStream.ConnectionType", &histogram)) { 94 Histogram* histogram; local [all...] |
/external/e2fsprogs/misc/ |
H A D | e2freefrag.h | 19 struct free_chunk_histogram histogram; /* histogram of all chunk sizes*/ member in struct:chunk_info
|
/external/chromium/base/metrics/ |
H A D | histogram_unittest.cc | 7 #include "base/metrics/histogram.h" 21 Histogram* histogram(Histogram::FactoryGet( 23 EXPECT_NE(reinterpret_cast<Histogram*>(NULL), histogram); local 27 EXPECT_NE(histogram, histogram1); 83 Histogram* histogram(Histogram::FactoryGet( 85 EXPECT_NE(reinterpret_cast<Histogram*>(NULL), histogram); local 157 Histogram* histogram(Histogram::FactoryGet( 160 EXPECT_EQ(0, histogram->ranges(0)); 163 EXPECT_EQ(power_of_2, histogram->ranges(i)); 166 EXPECT_EQ(INT_MAX, histogram [all...] |
H A D | histogram.cc | 10 #include "base/metrics/histogram.h" 81 Histogram* histogram(NULL); 89 if (!StatisticsRecorder::FindHistogram(name, &histogram)) { 98 histogram = 102 DCHECK_EQ(HISTOGRAM, histogram->histogram_type()); 103 DCHECK(histogram->HasConstructorArguments(minimum, maximum, bucket_count)); 104 return histogram; 139 // The following methods provide a graphical histogram display. 164 // nearly the largest bucket range without sliding over the histogram. 184 // Output the actual histogram grap 212 SerializeHistogramInfo(const Histogram& histogram, const SampleSet& snapshot) argument 674 Resize(const Histogram& histogram) argument 1016 RegisterOrDeleteDuplicate(Histogram* histogram) argument 1094 FindHistogram(const std::string& name, Histogram** histogram) argument [all...] |
/external/libvorbis/vq/ |
H A D | metrics.c | 44 float **histogram=NULL; variable 63 histogram=_ogg_calloc(books,sizeof(float *)); 75 histogram[i]=_ogg_calloc(b->entries,sizeof(float)); 169 sqrt((histogram_errorsq[book]+i*dim)[k]/histogram[book][i])); 185 (histogram_error[book]+i*dim)[k]/histogram[book][i]); 241 histogram[book][entry]++; 253 if(histogram[book][entry]==0 || histogram_hi[book][entry*dim+j]<error) 255 if(histogram[book][entry]==0 || histogram_lo[book][entry*dim+j]>error)
|
/external/v8/src/ |
H A D | counters.h | 50 // a histogram for passing to the AddHistogramSample function 56 // to a histogram created with CreateHistogram function 76 // Create a histogram by name. If the create is successful, 89 // Add a sample to a histogram created with the CreateHistogram 91 void AddHistogramSample(void* histogram, int sample) { argument 93 return add_histogram_sample_function_(histogram, sample); 224 // Returns the handle to the histogram.
|
H A D | d8.cc | 718 void Shell::AddHistogramSample(void* histogram, int sample) { argument 719 Counter* counter = reinterpret_cast<Counter*>(histogram);
|
/external/chromium/chrome/browser/tab_contents/ |
H A D | thumbnail_generator.cc | 11 #include "base/metrics/histogram.h" 381 int histogram[256] = {0}; local 382 color_utils::BuildLumaHistogram(bitmap, histogram); 384 int color_count = *std::max_element(histogram, histogram + 256);
|
/external/webp/src/utils/ |
H A D | huffman_encode.c | 181 static int GenerateOptimalTree(const int* const histogram, int histogram_size, argument 191 if (histogram[i] != 0) { 212 // So, we try by faking histogram entries to be at least 'count_min'. 216 if (histogram[j] != 0) { 218 (histogram[j] < count_min) ? count_min : histogram[j]; 426 int VP8LCreateHuffmanTree(int* const histogram, int tree_depth_limit, argument 429 if (!OptimizeHuffmanForRle(num_symbols, histogram)) { 432 if (!GenerateOptimalTree(histogram, num_symbols,
|
/external/chromium/chrome/common/ |
H A D | metrics_helpers.cc | 193 // The following log is VERY helpful when folks add some named histogram into 195 // that happens, all we get to see (server side) is a hash of the histogram 196 // name. We can then use this logging to find out what histogram name was 386 // TODO(JAR): A The following should really be part of the histogram class. 391 const Histogram& histogram, 395 snapshot.CheckSize(histogram); 399 OPEN_ELEMENT_FOR_SCOPE("histogram"); 401 WriteAttribute("name", CreateBase64Hash(histogram.histogram_name())); 407 for (size_t i = 0; i < histogram.bucket_count(); i++) { 410 WriteIntAttribute("min", histogram 390 RecordHistogramDelta( const Histogram& histogram, const Histogram::SampleSet& snapshot) argument 488 TransmitHistogramDelta( const base::Histogram& histogram, const base::Histogram::SampleSet& snapshot) argument 528 TransmitHistogram(const Histogram& histogram) argument [all...] |
/external/chromium/chrome/browser/extensions/ |
H A D | extension_service.cc | 13 #include "base/metrics/histogram.h" 1010 const Extension* e, const char* histogram) { 1014 histogram, 1009 RecordPermissionMessagesHistogram( const Extension* e, const char* histogram) argument
|
/external/jpeg/ |
H A D | jquant2.c | 34 * In the first pass over the image, we accumulate a histogram showing the 35 * usage count of each possible color. To keep the histogram to a reasonable 38 * in the same histogram cell. 81 * you'll probably want to tweak the histogram sizes too. 102 * First we have the histogram data structure and routines for creating it. 109 * To maintain a fully accurate histogram, we'd need to allocate a "long" 113 * enough results. This reduces the recommended histogram size from 256Kb 115 * (In the second pass the histogram space is re-used for pixel mapping data; 119 * machines, we can't just allocate the histogram in one chunk. Instead 132 #define HIST_C0_BITS 5 /* bits of precision in R/B histogram */ 201 hist3d histogram; /* pointer to the histogram */ member in struct:__anon7191 230 register hist3d histogram = cquantize->histogram; local 318 hist3d histogram = cquantize->histogram; local 505 hist3d histogram = cquantize->histogram; local 861 hist3d histogram = cquantize->histogram; local 920 hist3d histogram = cquantize->histogram; local 954 hist3d histogram = cquantize->histogram; local 1170 hist3d histogram = cquantize->histogram; local [all...] |
/external/libpng/ |
H A D | pngrtran.c | 147 * allowed, and a histogram if possible. If the current number 165 int num_palette, int maximum_colors, png_uint_16p histogram, 186 if (histogram != NULL) 217 if (histogram[png_ptr->dither_sort[j]] 218 < histogram[png_ptr->dither_sort[j + 1]]) 164 png_set_dither(png_structp png_ptr, png_colorp palette, int num_palette, int maximum_colors, png_uint_16p histogram, int full_dither) argument
|
/external/qemu/distrib/jpeg-6b/ |
H A D | jquant2.c | 34 * In the first pass over the image, we accumulate a histogram showing the 35 * usage count of each possible color. To keep the histogram to a reasonable 38 * in the same histogram cell. 81 * you'll probably want to tweak the histogram sizes too. 102 * First we have the histogram data structure and routines for creating it. 109 * To maintain a fully accurate histogram, we'd need to allocate a "long" 113 * enough results. This reduces the recommended histogram size from 256Kb 115 * (In the second pass the histogram space is re-used for pixel mapping data; 119 * machines, we can't just allocate the histogram in one chunk. Instead 132 #define HIST_C0_BITS 5 /* bits of precision in R/B histogram */ 201 hist3d histogram; /* pointer to the histogram */ member in struct:__anon11045 230 register hist3d histogram = cquantize->histogram; local 318 hist3d histogram = cquantize->histogram; local 505 hist3d histogram = cquantize->histogram; local 861 hist3d histogram = cquantize->histogram; local 920 hist3d histogram = cquantize->histogram; local 954 hist3d histogram = cquantize->histogram; local 1170 hist3d histogram = cquantize->histogram; local [all...] |
/external/qemu/distrib/libpng-1.2.19/ |
H A D | pngrtran.c | 124 * allowed, and a histogram if possible. If the current number 142 int num_palette, int maximum_colors, png_uint_16p histogram, 161 if (histogram != NULL) 190 if (histogram[png_ptr->dither_sort[j]] 191 < histogram[png_ptr->dither_sort[j + 1]]) 141 png_set_dither(png_structp png_ptr, png_colorp palette, int num_palette, int maximum_colors, png_uint_16p histogram, int full_dither) argument
|
/external/webp/src/enc/ |
H A D | vp8l.c | 318 int histogram[CODE_LENGTH_CODES] = { 0 }; local 321 ++histogram[tokens[i].code]; 324 if (!VP8LCreateHuffmanTree(histogram, 7, &huffman_code)) { 479 // Build histogram image and symbols from backward references. 482 // Create Huffman bit lengths and codes for each histogram image. 539 // Build histogram image and symbols from backward references. 546 // Create Huffman bit lengths and codes for each histogram image.
|