| /external/chromium_org/third_party/libwebp/enc/ |
| histogram.h | 73 VP8LHistogram* const histo);
76 void VP8LFreeHistogram(VP8LHistogram* const histo);
79 void VP8LFreeHistogramSet(VP8LHistogramSet* const histo);
91 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo,
|
| histogram.c | 57 void VP8LFreeHistogram(VP8LHistogram* const histo) {
58 WebPSafeFree(histo);
61 void VP8LFreeHistogramSet(VP8LHistogramSet* const histo) {
62 WebPSafeFree(histo);
66 VP8LHistogram* const histo) {
69 VP8LHistogramAddSinglePixOrCopy(histo, c.cur_pos);
90 VP8LHistogram* histo = NULL; local
94 histo = (VP8LHistogram*)memory;
96 histo->literal_ = (uint32_t*)(memory + sizeof(VP8LHistogram));
97 VP8LHistogramInit(histo, cache_bits)
454 VP8LHistogram* const histo = orig_histograms[i]; local
474 VP8LHistogram* const histo = histograms[i]; local
482 VP8LHistogram* const histo = histograms[i]; local
[all...] |
| backward_references.c | 496 VP8LHistogram* histo = NULL; local
511 histo = VP8LAllocateHistogram(cache_bits);
512 if (histo == NULL) goto Error;
514 VP8LHistogramCreate(histo, refs, cache_bits);
517 VP8LHistogramNumCodes(histo->palette_code_bits_),
518 histo->literal_, m->literal_);
520 VALUES_IN_BYTE, histo->red_, m->red_);
522 VALUES_IN_BYTE, histo->blue_, m->blue_);
524 VALUES_IN_BYTE, histo->alpha_, m->alpha_);
526 NUM_DISTANCE_CODES, histo->distance_, m->distance_)
840 VP8LHistogram* const histo = VP8LAllocateHistogram(cache_bits); local
892 VP8LHistogram* histo = VP8LAllocateHistogram(cache_bits); local
[all...] |
| vp8l.c | 199 const VP8LHistogram* const histo = histogram_image->histograms[i]; local
203 (k == 0) ? VP8LHistogramNumCodes(histo->palette_code_bits_) :
240 VP8LHistogram* const histo = histogram_image->histograms[i]; local
241 VP8LCreateHuffmanTree(histo->literal_, 15, buf_rle, huff_tree, codes + 0);
242 VP8LCreateHuffmanTree(histo->red_, 15, buf_rle, huff_tree, codes + 1);
243 VP8LCreateHuffmanTree(histo->blue_, 15, buf_rle, huff_tree, codes + 2);
244 VP8LCreateHuffmanTree(histo->alpha_, 15, buf_rle, huff_tree, codes + 3);
245 VP8LCreateHuffmanTree(histo->distance_, 15, buf_rle, huff_tree, codes + 4);
709 VP8LHistogram* const histo = VP8LAllocateHistogram(1); local
710 if (histo == NULL) return VP8_ENC_ERROR_OUT_OF_MEMORY
[all...] |
| analysis.c | 113 static int GetAlpha(const VP8Histogram* const histo) {
118 const int value = histo->distribution[k];
150 // 'int' type is ok for histo, and won't overflow
244 VP8Histogram histo = { { 0 } }; local
249 0, 16, &histo);
250 alpha = GetAlpha(&histo);
286 cur_histo ^= 1; // keep track of best histo so far.
310 VP8Histogram histo = { { 0 } }; local
314 16, 16 + 4 + 4, &histo);
315 alpha = GetAlpha(&histo);
[all...] |
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| literal_cost.cc | 110 int histo = histogram[utf8_pos][data[masked_pos]];
111 if (histo == 0) {
112 histo = 1;
115 / histo);
156 int histo = histogram[data[(pos + i) & mask]];
157 if (histo == 0) {
158 histo = 1;
160 float lit_cost = log2(static_cast<double>(in_window) / histo);
|
| block_splitter.cc | 105 HistogramType histo; local
106 histo.Add(data + pos, stride);
107 vec->push_back(histo);
|
| /external/llvm/utils/lit/lit/ |
| util.py | 114 histo = [set() for i in range(N)]
117 histo[bin].add(name)
136 for i,row in enumerate(histo):
|
| /external/chromium_org/third_party/libwebp/dsp/ |
| lossless.c | 694 int histo[4][256]; local
695 memset(histo, 0, sizeof(histo));
716 (const int (*)[256])histo,
730 UpdateHisto(histo, argb[ix]);
915 int histo[256] = { 0 }; local
982 int histo[256] = { 0 }; local
[all...] |
| dsp.h | 120 // Collect histogram for susceptibility calculation and accumulate in histo[].
124 struct VP8Histogram* const histo);
|
| enc.c | 45 VP8Histogram* const histo) {
57 histo->distribution[clipped_value]++;
|
| enc_neon.c | [all...] |
| enc_sse2.c | 59 VP8Histogram* const histo) {
94 histo->distribution[out[k]]++;
[all...] |
| /external/chromium_org/media/cast/logging/ |
| stats_event_subscriber.cc | 66 scoped_ptr<base::ListValue> histo(new base::ListValue);
73 histo->Append(bucket.release());
85 histo->Append(bucket.release());
92 histo->Append(bucket.release());
94 return histo.Pass();
|
