| /external/chromium/net/socket_stream/ |
| socket_stream_metrics_unittest.cc | 6 #include "base/metrics/histogram.h"
12 using base::Histogram;
28 Histogram* histogram; local
33 Histogram::SampleSet original;
35 "Net.SocketStream.ProtocolType", &histogram)) {
36 histogram->SnapshotSample(&original);
47 "Net.SocketStream.ProtocolType", &histogram));
48 EXPECT_EQ(Histogram::kUmaTargetedHistogramFlag, histogram->flags())
60 Histogram* histogram; local
94 Histogram* histogram; local
[all...] |
| /external/chromium/base/metrics/ |
| histogram_unittest.cc | 5 // Test of Histogram class
7 #include "base/metrics/histogram.h"
21 Histogram* histogram(Histogram::FactoryGet(
22 "TestHistogram", 1, 1000, 10, Histogram::kNoFlags));
23 EXPECT_NE(reinterpret_cast<Histogram*>(NULL), histogram); local
24 Histogram* histogram1(Histogram::FactoryGet
85 EXPECT_NE(reinterpret_cast<Histogram*>(NULL), histogram); local
[all...] |
| histogram.cc | 5 // Histogram is an object that aggregates statistics, and can summarize them in
10 #include "base/metrics/histogram.h"
25 const uint32 Histogram::kCrcTable[256] = {0x0, 0x77073096L, 0xee0e612cL,
71 typedef Histogram::Count Count;
74 const size_t Histogram::kBucketCount_MAX = 16384u;
76 Histogram* Histogram::FactoryGet(const std::string& name,
81 Histogram* histogram(NULL);
89 if (!StatisticsRecorder::FindHistogram(name, &histogram)) {
[all...] |
| histogram.h | 5 // Histogram is an object that aggregates statistics, and can summarize them in
15 // That bucket allocation would actually result from construction of a histogram
17 // Histogram count(L"some name", 1, 64, 8);
22 // in each consecutive bucket. The Histogram class automatically calculates
28 // at the low end of the histogram scale, but allows the histogram to cover a
32 // pointer to a histogram. This static is explicitly initialized on any thread
60 // Provide easy general purpose histogram in a macro, just like stats counters.
77 static base::Histogram* counter(NULL); \
79 counter = base::Histogram::FactoryGet(name, min, max, bucket_count,
[all...] |
| /external/chromium/net/disk_cache/ |
| stats_histogram.cc | 12 using base::Histogram;
26 Histogram* histogram(NULL);
32 if (StatisticsRecorder::FindHistogram(name, &histogram)) {
33 DCHECK(histogram != NULL);
40 histogram = StatisticsRecorder::RegisterOrDeleteDuplicate(stats_histogram);
43 DCHECK(HISTOGRAM == histogram->histogram_type());
44 DCHECK(histogram->HasConstructorArguments(minimum, maximum, bucket_count));
48 StatsHistogram* return_histogram = static_cast<StatsHistogram*>(histogram);
[all...] |
| /external/e2fsprogs/misc/ |
| e2freefrag.h | 19 struct free_chunk_histogram histogram; /* histogram of all chunk sizes*/ member in struct:chunk_info
|
| e2freefrag.c | 69 info->histogram.fc_chunks[i] = 0;
70 info->histogram.fc_blocks[i] = 0;
81 info->histogram.fc_chunks[index]++;
82 info->histogram.fc_blocks[index] += chunk_size;
187 if (info->histogram.fc_chunks[i] != 0) {
195 info->histogram.fc_chunks[i],
196 info->histogram.fc_blocks[i],
197 (double)info->histogram.fc_blocks[i] * 100 /
|
| /external/webp/src/utils/ |
| huffman_encode.h | 40 int VP8LCreateHuffmanTree(int* const histogram, int tree_depth_limit,
|
| huffman_encode.c | 176 static int GenerateOptimalTree(const int* const histogram, int histogram_size,
186 if (histogram[i] != 0) {
211 // So, we try by faking histogram entries to be at least 'count_min'.
215 if (histogram[j] != 0) {
217 (histogram[j] < count_min) ? count_min : histogram[j];
425 int VP8LCreateHuffmanTree(int* const histogram, int tree_depth_limit,
428 if (!OptimizeHuffmanForRle(num_symbols, histogram)) {
431 if (!GenerateOptimalTree(histogram, num_symbols,
|
| /external/chromium/chrome/browser/extensions/ |
| extension_metrics_apitest.cc | 7 #include "base/metrics/histogram.h"
32 base::Histogram::ClassType type;
37 {"test.h.1", base::Histogram::HISTOGRAM, 1, 100, 50}, // custom
38 {"test.h.2", base::Histogram::LINEAR_HISTOGRAM, 1, 200, 50}, // custom
39 {"test.h.3", base::Histogram::LINEAR_HISTOGRAM, 1, 101, 102}, // percentage
40 {"test.time", base::Histogram::HISTOGRAM, 1, 10000, 50},
41 {"test.medium.time", base::Histogram::HISTOGRAM, 1, 180000, 50}
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| KeyboardParams.java | 115 private static int updateHistogramCounter(final SparseIntArray histogram, final int key) {
116 final int index = histogram.indexOfKey(key);
117 final int count = (index >= 0 ? histogram.get(key) : 0) + 1;
118 histogram.put(key, count);
|
| /external/chromium/chrome/common/ |
| metrics_helpers.cc | 29 using base::Histogram;
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.
388 // this code. If we moved this into the Histogram class, then we could use
391 const Histogram& histogram,
392 const Histogram::SampleSet& snapshot) {
395 snapshot.CheckSize(histogram);
[all...] |
| metrics_helpers.h | 17 #include "base/metrics/histogram.h"
57 // Record any changes in a given histogram for transmission.
58 void RecordHistogramDelta(const base::Histogram& histogram,
59 const base::Histogram::SampleSet& snapshot);
182 // calling for the marginal change (a.k.a., delta) in a histogram to be sent
191 // transmission, or to set a flag in each transmitted histogram.
192 void TransmitAllHistograms(base::Histogram::Flags flags_to_set,
199 const base::Histogram& histogram,
[all...] |
| /external/jpeg/ |
| 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:__anon9414
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/jpeg-6b/ |
| 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:__anon13254
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/libvorbis/vq/ |
| 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/ |
| 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) {
93 return add_histogram_sample_function_(histogram, sample);
224 // Returns the handle to the histogram.
|
| d8.h | 48 int32_t* Bind(const char* name, bool histogram);
288 static void AddHistogramSample(void* histogram, int sample);
|
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| ClusterManager.java | 239 // duration, histogram, etc.
259 HashMap<String, Long> histogram = new HashMap<String, Long>(); local
271 histogram.clear();
275 histogram.put(featureValue, Long.valueOf(map.get(featureValue)));
278 cluster.setHistogram(histogram);
302 HashMap<String, Long> histogram = cluster.getHistogram(); local
303 for (Map.Entry<String, Long> entry : histogram.entrySet()) {
|
| BaseCluster.java | 38 // Histogram illustrates the pattern of visit during time of day,
160 public void setHistogram(Map<String, Long> histogram) {
162 mHistogram.putAll(histogram);
|
| /external/chromium/chrome/browser/net/ |
| url_info.cc | 14 #include "base/metrics/histogram.h"
121 // Make a custom linear histogram for the region from 0 to boundary.
123 static base::Histogram* histogram(NULL);
124 if (!histogram)
125 histogram = base::LinearHistogram::FactoryTimeGet(
127 base::Histogram::kUmaTargetedHistogramFlag);
128 histogram->AddTime(queue_duration_);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/ui/ |
| ImageCurves.java | 375 private void drawHistogram(Canvas canvas, int[] histogram, int color, PorterDuff.Mode mode) {
377 for (int i = 0; i < histogram.length; i++) {
378 if (histogram[i] > max) {
379 max = histogram[i];
385 float wl = w / histogram.length;
400 for (int i = 0; i < histogram.length; i++) {
402 float l = histogram[i] * wh;
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| TimelineOverviewPane.js | 549 var histogram = new Array(width);
555 histogram[x] = Math.max(histogram[x] || 0, y);
566 for (var k = 0; k < histogram.length; k++) {
567 if (histogram[k]) {
568 initialY = histogram[k];
574 for (var x = 0; x < histogram.length; x++) {
575 if (!histogram[x])
577 ctx.lineTo(x, height - histogram[x]);
|
| /external/webp/src/enc/ |
| Android.mk | 26 histogram.c \
|
| /external/chromium/chrome/browser/tab_contents/ |
| 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);
|
