HomeSort by relevance Sort by last modified time
    Searched refs:histogram (Results 26 - 50 of 177) sorted by null

12 3 4 5 6 7 8

  /external/libchrome/base/metrics/
histogram.cc 5 // Histogram is an object that aggregates statistics, and can summarize them in
10 #include "base/metrics/histogram.h"
48 DLOG(ERROR) << "Pickle error decoding Histogram: " << *histogram_name;
53 // checks above and beyond those in Histogram::Initialize()
59 DLOG(ERROR) << "Values error decoding Histogram: " << histogram_name;
63 // We use the arguments to find or create the local version of the histogram
71 bool ValidateRangeChecksum(const HistogramBase& histogram,
73 const Histogram& casted_histogram =
74 static_cast<const Histogram&>(histogram);
96 HistogramBase* histogram = StatisticsRecorder::FindHistogram(name); local
390 HistogramBase* histogram = Histogram::FactoryGet( local
597 HistogramBase* histogram = StatisticsRecorder::FindHistogram(name); local
696 HistogramBase* histogram = LinearHistogram::FactoryGet( local
711 HistogramBase* histogram = StatisticsRecorder::FindHistogram(name); local
756 HistogramBase* histogram = BooleanHistogram::FactoryGet( local
775 HistogramBase* histogram = StatisticsRecorder::FindHistogram(name); local
868 HistogramBase* histogram = CustomHistogram::FactoryGet( local
    [all...]
sparse_histogram.cc 24 HistogramBase* histogram = StatisticsRecorder::FindHistogram(name); local
26 if (!histogram) {
30 histogram =
33 DCHECK_EQ(SPARSE_HISTOGRAM, histogram->GetHistogramType());
34 return histogram;
112 DLOG(ERROR) << "Pickle error decoding Histogram: " << histogram_name;
188 "Histogram: %s recorded %d samples",
histogram_delta_serialization.h 29 // Computes deltas in histogram bucket counts relative to the previous call to
42 void RecordDelta(const HistogramBase& histogram,
51 // Calculates deltas in histogram counters.
histogram_snapshot_manager_unittest.cc 22 void RecordDelta(const HistogramBase& histogram,
24 recorded_delta_histogram_names_.push_back(histogram.histogram_name());
sparse_histogram.h 27 base::HistogramBase* histogram = base::SparseHistogram::FactoryGet( \
29 histogram->Add(sample); \
78 // Write a common header message describing this histogram.
  /system/connectivity/shill/
metrics.cc 50 // histogram.h). Instead of remapping System Disconnect to 1 and
695 string histogram = GetFullMetricName(kMetricTimeOnlineSecondsSuffix,
698 SendToUMA(histogram,
771 string histogram = GetFullMetricName(kMetricDisconnectSuffix, technology);
772 SendToUMA(histogram,
784 string histogram = GetFullMetricName(kMetricSignalAtDisconnectSuffix,
786 SendToUMA(histogram,
    [all...]
  /art/runtime/base/
timing_logger.cc 24 #include "base/histogram-inl.h"
95 Histogram<uint64_t>* histogram; local
96 Histogram<uint64_t> dummy(label.c_str());
101 histogram = new Histogram<uint64_t>(label.c_str(), kInitialBucketSize, max_buckets);
102 histograms_.insert(histogram);
104 histogram = *it;
106 histogram->AddValue(delta_time);
111 bool operator()(const Histogram<uint64_t>* a, const Histogram<uint64_t>* b) const
    [all...]
  /external/v8/tools/
eval_gc_time.sh 150 --no-histogram \
159 --no-histogram \
  /frameworks/base/packages/EasterEgg/src/com/android/egg/neko/
NekoActivationActivity.java 44 MetricsLogger.histogram(this, "egg_neko_enable", 0);
52 MetricsLogger.histogram(this, "egg_neko_enable", 1);
  /external/libjpeg-turbo/
jquant2.c 36 * In the first pass over the image, we accumulate a histogram showing the
37 * usage count of each possible color. To keep the histogram to a reasonable
40 * in the same histogram cell.
85 * First we have the histogram data structure and routines for creating it.
92 * To maintain a fully accurate histogram, we'd need to allocate a "long"
96 * enough results. This reduces the recommended histogram size from 256Kb
98 * (In the second pass the histogram space is re-used for pixel mapping data;
102 * machines, we can't just allocate the histogram in one chunk. Instead
113 #define HIST_C0_BITS 5 /* bits of precision in R/B histogram */
114 #define HIST_C1_BITS 6 /* bits of precision in G histogram */
179 hist3d histogram; \/* pointer to the histogram *\/ member in struct:__anon15249
208 register hist3d histogram = cquantize->histogram; local
296 hist3d histogram = cquantize->histogram; local
484 hist3d histogram = cquantize->histogram; local
840 hist3d histogram = cquantize->histogram; local
899 hist3d histogram = cquantize->histogram; local
933 hist3d histogram = cquantize->histogram; local
1140 hist3d histogram = cquantize->histogram; local
    [all...]
  /external/opencv3/3rdparty/libjpeg/
jquant2.c 35 * In the first pass over the image, we accumulate a histogram showing the
36 * usage count of each possible color. To keep the histogram to a reasonable
39 * in the same histogram cell.
82 * you'll probably want to tweak the histogram sizes too.
103 * First we have the histogram data structure and routines for creating it.
110 * To maintain a fully accurate histogram, we'd need to allocate a "long"
114 * enough results. This reduces the recommended histogram size from 256Kb
116 * (In the second pass the histogram space is re-used for pixel mapping data;
120 * machines, we can't just allocate the histogram in one chunk. Instead
133 #define HIST_C0_BITS 5 /* bits of precision in R/B histogram */
202 hist3d histogram; \/* pointer to the histogram *\/ member in struct:__anon20368
231 register hist3d histogram = cquantize->histogram; local
319 hist3d histogram = cquantize->histogram; local
506 hist3d histogram = cquantize->histogram; local
862 hist3d histogram = cquantize->histogram; local
921 hist3d histogram = cquantize->histogram; local
955 hist3d histogram = cquantize->histogram; local
1171 hist3d histogram = cquantize->histogram; local
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/info/
HistogramView.java 81 private void drawHistogram(Canvas canvas, int[] histogram, int color, PorterDuff.Mode mode) {
83 for (int i = 0; i < histogram.length; i++) {
84 if (histogram[i] > max) {
85 max = histogram[i];
91 float wl = w / histogram.length;
114 for (int i = 0; i < histogram.length; i++) {
116 float l = histogram[i] * wh;
  /cts/apps/CameraITS/tests/inprog/
test_black_level.py 75 yhist,_ = numpy.histogram(yimg*255, 256, (0,256))
77 uhist,_ = numpy.histogram(uimg*255, 256, (0,256))
79 vhist,_ = numpy.histogram(vimg*255, 256, (0,256))
  /external/ImageMagick/MagickCore/
paint.c 655 static size_t **DestroyHistogramThreadSet(size_t **histogram)
660 assert(histogram != (size_t **) NULL);
662 if (histogram[i] != (size_t *) NULL)
663 histogram[i]=(size_t *) RelinquishMagickMemory(histogram[i]);
664 histogram=(size_t **) RelinquishMagickMemory(histogram);
665 return(histogram);
674 **histogram,
678 histogram=(size_t **) AcquireQuantumMemory(number_threads,sizeof(*histogram))
670 **histogram, local
770 *histogram; local
    [all...]
histogram.c 13 % MagickCore Histogram Methods %
50 #include "MagickCore/histogram.h"
336 % o histogram: the image histogram.
340 PixelInfo **histogram)
354 DefineImageHistogram(image,node_info->child[i],histogram);
363 **histogram=(*p);
364 (*histogram)++;
527 % o file: Write a histogram of the color distribution to this file handle.
536 *histogram;
526 *histogram; local
1008 *histogram; local
    [all...]
  /external/chromium-trace/catapult/telemetry/telemetry/util/
perf_tests_results_helper.py 18 perf_result_data_type.UNIMPORTANT_HISTOGRAM: 'HISTOGRAM ',
19 perf_result_data_type.HISTOGRAM: '*HISTOGRAM '}
39 histogram = json.loads(histogram_json)
41 if not 'buckets' in histogram:
45 for bucket in histogram['buckets']:
59 for bucket in histogram['buckets']:
  /external/v8/build/util/lib/common/
perf_tests_results_helper.py 19 perf_result_data_type.UNIMPORTANT_HISTOGRAM: 'HISTOGRAM ',
20 perf_result_data_type.HISTOGRAM: '*HISTOGRAM '}
40 histogram = json.loads(histogram_json)
42 if not 'buckets' in histogram:
46 for bucket in histogram['buckets']:
60 for bucket in histogram['buckets']:
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/
KeyboardParams.java 171 private static int updateHistogramCounter(final SparseIntArray histogram, final int key) {
172 final int index = histogram.indexOfKey(key);
173 final int count = (index >= 0 ? histogram.get(key) : 0) + 1;
174 histogram.put(key, count);
  /external/e2fsprogs/misc/
e2freefrag.c 71 info->histogram.fc_chunks[i] = 0;
72 info->histogram.fc_blocks[i] = 0;
84 info->histogram.fc_chunks[idx]++;
85 info->histogram.fc_blocks[idx] += chunk_size;
191 if (info->histogram.fc_chunks[i] != 0) {
199 info->histogram.fc_chunks[i],
200 info->histogram.fc_blocks[i],
201 (double)info->histogram.fc_blocks[i] * 100 /
  /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/opencv3/3rdparty/libwebp/utils/
huffman_encode.c 178 static int GenerateOptimalTree(const int* const histogram, int histogram_size,
188 if (histogram[i] != 0) {
213 // So, we try by faking histogram entries to be at least 'count_min'.
217 if (histogram[j] != 0) {
219 (histogram[j] < count_min) ? count_min : histogram[j];
427 int VP8LCreateHuffmanTree(int* const histogram, int tree_depth_limit,
430 if (!OptimizeHuffmanForRle(num_symbols, histogram)) {
433 if (!GenerateOptimalTree(histogram, num_symbols,
  /external/opencv3/modules/cudev/include/opencv2/cudev/grid/
histogram.hpp 53 #include "detail/histogram.hpp"
73 grid_histogram_detail::histogram<BIN_COUNT, Policy>(shrinkPtr(src),
91 grid_histogram_detail::histogram<BIN_COUNT, Policy>(shrinkPtr(src),
  /external/webp/src/utils/
huffman_encode.c 165 static void GenerateOptimalTree(const uint32_t* const histogram,
175 if (histogram[i] != 0) {
194 // So, we try by faking histogram entries to be at least 'count_min'.
198 if (histogram[j] != 0) {
200 (histogram[j] < count_min) ? count_min : histogram[j];
406 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit,
412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram);
413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit,
  /frameworks/base/services/core/java/com/android/server/pm/
OtaDexoptService.java 381 MetricsLogger.histogram(mContext, "ota_dexopt_available_space_before_mb",
383 MetricsLogger.histogram(mContext, "ota_dexopt_available_space_after_bulk_delete_mb",
385 MetricsLogger.histogram(mContext, "ota_dexopt_available_space_after_dexopt_mb",
388 MetricsLogger.histogram(mContext, "ota_dexopt_num_important_packages",
390 MetricsLogger.histogram(mContext, "ota_dexopt_num_other_packages", otherPackageCount);
392 MetricsLogger.histogram(mContext, "ota_dexopt_num_commands", dexoptCommandCountTotal);
393 MetricsLogger.histogram(mContext, "ota_dexopt_num_commands_executed",
398 MetricsLogger.histogram(mContext, "ota_dexopt_time_s", elapsedTimeSeconds);
  /toolchain/binutils/binutils-2.25/gprof/
hist.c 1 /* hist.c - Histogram related operations.
48 static histogram *find_histogram (bfd_vma lowpc, bfd_vma highpc);
49 static histogram *find_histogram_for_pc (bfd_vma pc);
51 histogram * histograms;
82 /* Reads just the header part of histogram record into
88 that the new histogram is compatible with already-set values
91 read_histogram_header (histogram *record,
118 /* We don't try to veryfy profrate is the same for all histogram
119 records. If we have two histogram records for the same
135 _("%s: dimension unit changed between histogram records\n
    [all...]

Completed in 2051 milliseconds

12 3 4 5 6 7 8