| /external/webp/src/enc/ |
| histogram.h | 65 VP8LHistogram* const histo);
72 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo,
|
| backward_references.c | 414 VP8LHistogram histo; local
430 VP8LHistogramCreate(&histo, &refs, cache_bits);
432 VP8LHistogramNumCodes(&histo), histo.literal_, m->literal_);
434 VALUES_IN_BYTE, histo.red_, m->red_);
436 VALUES_IN_BYTE, histo.blue_, m->blue_);
438 VALUES_IN_BYTE, histo.alpha_, m->alpha_);
440 NUM_DISTANCE_CODES, histo.distance_, m->distance_);
768 VP8LHistogram* const histo = (VP8LHistogram*)malloc(sizeof(*histo)); local
878 VP8LHistogram histo; local
[all...] |
| histogram.c | 32 VP8LHistogram* const histo) {
35 VP8LHistogramAddSinglePixOrCopy(histo, &refs->refs[i]);
80 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo,
83 ++histo->alpha_[PixOrCopyLiteral(v, 3)];
84 ++histo->red_[PixOrCopyLiteral(v, 2)];
85 ++histo->literal_[PixOrCopyLiteral(v, 1)];
86 ++histo->blue_[PixOrCopyLiteral(v, 0)];
89 ++histo->literal_[literal_ix];
94 ++histo->literal_[256 + code];
97 ++histo->distance_[code]
[all...] |
| analysis.c | 114 static int GetAlpha(const VP8Histogram* const histo) {
119 const int value = histo->distribution[k];
151 // 'int' type is ok for histo, and won't overflow
244 VP8Histogram histo = { { 0 } }; local
249 0, 16, &histo);
250 alpha = GetAlpha(&histo);
288 cur_histo ^= 1; // keep track of best histo so far.
313 VP8Histogram histo = { { 0 } }; local
317 16, 16 + 4 + 4, &histo);
318 alpha = GetAlpha(&histo);
[all...] |
| vp8l.c | 191 const VP8LHistogram* const histo = histogram_image->histograms[i]; local
194 const int num_symbols = (k == 0) ? VP8LHistogramNumCodes(histo)
226 VP8LHistogram* const histo = histogram_image->histograms[i]; local
227 ok = ok && VP8LCreateHuffmanTree(histo->literal_, 15, codes + 0);
228 ok = ok && VP8LCreateHuffmanTree(histo->red_, 15, codes + 1);
229 ok = ok && VP8LCreateHuffmanTree(histo->blue_, 15, codes + 2);
230 ok = ok && VP8LCreateHuffmanTree(histo->alpha_, 15, codes + 3);
231 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4);
645 VP8LHistogram* const histo = (VP8LHistogram*)malloc(sizeof(*histo)); local
[all...] |
| /external/llvm/utils/lit/lit/ |
| Util.py | 111 histo = [set() for i in range(N)]
114 histo[bin].add(name)
133 for i,row in enumerate(histo):
|
| /external/webp/src/dsp/ |
| lossless.c | 531 int histo[4][256]; local
541 memset(&histo[0][0], 0, sizeof(histo));
559 ++histo[0][predict_diff >> 24];
560 ++histo[1][((predict_diff >> 16) & 0xff)];
561 ++histo[2][((predict_diff >> 8) & 0xff)];
562 ++histo[3][(predict_diff & 0xff)];
565 cur_diff = PredictionCostSpatialHistogram(accumulated, histo);
620 int histo[4][256]; local
621 memset(histo, 0, sizeof(histo))
900 int histo[256] = { 0 }; local
932 int histo[256] = { 0 }; local
[all...] |
| dsp.h | 86 // Collect histogram for susceptibility calculation and accumulate in histo[].
90 struct VP8Histogram* const histo);
|
| enc.c | 45 VP8Histogram* const histo) {
57 histo->distribution[clipped_value]++;
|
| enc_sse2.c | 59 VP8Histogram* const histo) {
94 histo->distribution[out[k]]++;
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/ui/ |
| ImageCurves.java | 346 int[] histo = new int[256 * 3]; local
358 histo[r]++;
359 histo[256 + g]++;
360 histo[512 + b]++;
363 return histo;
|
| /external/valgrind/main/exp-dhat/ |
| dh_main.c | 212 UInt* histo; /* [0 .. xsize-1] */ member in struct:__anon17017
245 // histo stuff
289 the access counts and histo data that have so far accumulated for
334 // histo stuff. First, do state transitions for xsize/xsize_tag.
340 tl_assert(!api->histo);
344 // and allocate the histo
346 api->histo = VG_(malloc)("dh.main.retire_Block.1",
348 VG_(memset)(api->histo, 0, api->xsize * sizeof(UInt));
359 // deallocate the histo, if any
360 if (api->histo) {
[all...] |
