HomeSort by relevance Sort by last modified time
    Searched defs:histo (Results 1 - 11 of 11) sorted by null

  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/info/
HistogramView.java 43 int[] histo = new int[256 * 3]; local
55 histo[r]++;
56 histo[256 + g]++;
57 histo[512 + b]++;
60 return histo;
  /external/chromium_org/third_party/libwebp/enc/
analysis.c 116 static int GetAlpha(const VP8Histogram* const histo) {
121 const int value = histo->distribution[k];
153 // 'int' type is ok for histo, and won't overflow
246 VP8Histogram histo = { { 0 } }; local
251 0, 16, &histo);
252 alpha = GetAlpha(&histo);
290 cur_histo ^= 1; // keep track of best histo so far.
315 VP8Histogram histo = { { 0 } }; local
319 16, 16 + 4 + 4, &histo);
320 alpha = GetAlpha(&histo);
    [all...]
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
880 VP8LHistogram histo; local
    [all...]
vp8l.c 193 const VP8LHistogram* const histo = histogram_image->histograms[i]; local
196 const int num_symbols = (k == 0) ? VP8LHistogramNumCodes(histo)
228 VP8LHistogram* const histo = histogram_image->histograms[i]; local
229 ok = ok && VP8LCreateHuffmanTree(histo->literal_, 15, codes + 0);
230 ok = ok && VP8LCreateHuffmanTree(histo->red_, 15, codes + 1);
231 ok = ok && VP8LCreateHuffmanTree(histo->blue_, 15, codes + 2);
232 ok = ok && VP8LCreateHuffmanTree(histo->alpha_, 15, codes + 3);
233 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4);
647 VP8LHistogram* const histo = (VP8LHistogram*)malloc(sizeof(*histo)); local
    [all...]
  /external/webp/src/enc/
analysis.c 116 static int GetAlpha(const VP8Histogram* const histo) {
121 const int value = histo->distribution[k];
153 // 'int' type is ok for histo, and won't overflow
246 VP8Histogram histo = { { 0 } }; local
251 0, 16, &histo);
252 alpha = GetAlpha(&histo);
290 cur_histo ^= 1; // keep track of best histo so far.
315 VP8Histogram histo = { { 0 } }; local
319 16, 16 + 4 + 4, &histo);
320 alpha = GetAlpha(&histo);
    [all...]
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
880 VP8LHistogram histo; local
    [all...]
vp8l.c 193 const VP8LHistogram* const histo = histogram_image->histograms[i]; local
196 const int num_symbols = (k == 0) ? VP8LHistogramNumCodes(histo)
228 VP8LHistogram* const histo = histogram_image->histograms[i]; local
229 ok = ok && VP8LCreateHuffmanTree(histo->literal_, 15, codes + 0);
230 ok = ok && VP8LCreateHuffmanTree(histo->red_, 15, codes + 1);
231 ok = ok && VP8LCreateHuffmanTree(histo->blue_, 15, codes + 2);
232 ok = ok && VP8LCreateHuffmanTree(histo->alpha_, 15, codes + 3);
233 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4);
647 VP8LHistogram* const histo = (VP8LHistogram*)malloc(sizeof(*histo)); local
    [all...]
  /external/valgrind/main/exp-dhat/
dh_main.c 212 UInt* histo; /* [0 .. xsize-1] */ member in struct:__anon29873
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...]
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/
ImageCurves.java 339 int[] histo = new int[256 * 3]; local
351 histo[r]++;
352 histo[256 + g]++;
353 histo[512 + b]++;
356 return histo;
  /external/chromium_org/third_party/libwebp/dsp/
lossless.c 533 int histo[4][256]; local
543 memset(&histo[0][0], 0, sizeof(histo));
561 ++histo[0][predict_diff >> 24];
562 ++histo[1][((predict_diff >> 16) & 0xff)];
563 ++histo[2][((predict_diff >> 8) & 0xff)];
564 ++histo[3][(predict_diff & 0xff)];
567 cur_diff = PredictionCostSpatialHistogram(accumulated, histo);
622 int histo[4][256]; local
623 memset(histo, 0, sizeof(histo))
902 int histo[256] = { 0 }; local
934 int histo[256] = { 0 }; local
    [all...]
  /external/webp/src/dsp/
lossless.c 533 int histo[4][256]; local
543 memset(&histo[0][0], 0, sizeof(histo));
561 ++histo[0][predict_diff >> 24];
562 ++histo[1][((predict_diff >> 16) & 0xff)];
563 ++histo[2][((predict_diff >> 8) & 0xff)];
564 ++histo[3][(predict_diff & 0xff)];
567 cur_diff = PredictionCostSpatialHistogram(accumulated, histo);
622 int histo[4][256]; local
623 memset(histo, 0, sizeof(histo))
902 int histo[256] = { 0 }; local
934 int histo[256] = { 0 }; local
    [all...]

Completed in 521 milliseconds