Searched refs:histo (Results 1 - 16 of 16) sorted by relevance

/external/webp/src/enc/
H A Dhistogram.h73 VP8LHistogram* const histo);
76 void VP8LFreeHistogram(VP8LHistogram* const histo);
79 void VP8LFreeHistogramSet(VP8LHistogramSet* const histo);
91 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo,
H A Dhistogram.c57 void VP8LFreeHistogram(VP8LHistogram* const histo) { argument
58 WebPSafeFree(histo);
61 void VP8LFreeHistogramSet(VP8LHistogramSet* const histo) { argument
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_bit
65 VP8LHistogramStoreRefs(const VP8LBackwardRefs* const refs, VP8LHistogram* const histo) argument
129 VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo, const PixOrCopy* const v) argument
454 VP8LHistogram* const histo = orig_histograms[i]; local
474 VP8LHistogram* const histo = histograms[i]; local
482 VP8LHistogram* const histo = histograms[i]; local
[all...]
H A Dbackward_references.c496 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
840 VP8LHistogram* const histo = VP8LAllocateHistogram(cache_bits); local
892 VP8LHistogram* histo = VP8LAllocateHistogram(cache_bits); local
[all...]
H A Dvp8l.c199 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
[all...]
H A Danalysis.c113 static int GetAlpha(const VP8Histogram* const histo) { argument
118 const int value = histo->distribution[k];
154 // 'int' type is ok for histo, and won't overflow
248 VP8Histogram histo = { { 0 } }; local
253 0, 16, &histo);
254 alpha = GetAlpha(&histo);
290 cur_histo ^= 1; // keep track of best histo so far.
314 VP8Histogram histo = { { 0 } }; local
318 16, 16 + 4 + 4, &histo);
319 alpha = GetAlpha(&histo);
[all...]
/external/libdrm/tests/
H A Ddrmstat.c372 int histo[HISTOSIZE]; local
381 for (i = 0; i < HISTOSIZE; i++) histo[i] = 0;
391 if (wt <= 2.5) ++histo[8];
392 if (wt < 5.0) ++histo[0];
393 else if (wt < 50.0) ++histo[1];
394 else if (wt < 500.0) ++histo[2];
395 else if (wt < 5000.0) ++histo[3];
396 else if (wt < 50000.0) ++histo[4];
397 else if (wt < 500000.0) ++histo[5];
398 else if (wt < 5000000.0) ++histo[
[all...]
/external/llvm/utils/lit/lit/
H A Dutil.py129 histo = [set() for i in range(N)]
132 histo[bin].add(name)
151 for i,row in enumerate(histo):
/external/valgrind/exp-dhat/
H A Ddh_main.c212 UInt* histo; /* [0 .. xsize-1] */ member in struct:__anon16277
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...]
/external/webp/src/dsp/
H A Dlossless.c694 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
921 ++histo[TransformColorRed(green_to_red, argb[ix])]; // red.
924 cur_diff = PredictionCostCrossColor(accumulated_red_histo, histo);
982 int histo[256] = { 0 }; local
988 ++histo[TransformColorBlu
[all...]
H A Ddsp.h136 // Collect histogram for susceptibility calculation and accumulate in histo[].
140 struct VP8Histogram* const histo);
H A Denc.c45 VP8Histogram* const histo) {
57 histo->distribution[clipped_value]++;
43 CollectHistogram(const uint8_t* ref, const uint8_t* pred, int start_block, int end_block, VP8Histogram* const histo) argument
H A Denc_neon.c885 VP8Histogram* const histo) {
905 histo->distribution[out[k]]++;
883 CollectHistogram(const uint8_t* ref, const uint8_t* pred, int start_block, int end_block, VP8Histogram* const histo) argument
H A Denc_sse2.c59 VP8Histogram* const histo) {
94 histo->distribution[out[k]]++;
57 CollectHistogram(const uint8_t* ref, const uint8_t* pred, int start_block, int end_block, VP8Histogram* const histo) argument
/external/libvncserver/x11vnc/
H A Dcursor.c1013 int n_opaque, n_trans, n_alpha, len, histo[256]; local
1106 histo[i] = 0;
1119 histo[a]++;
1144 n_opaque += histo[i];
H A D8to24.c1365 int histo[65536]; variable
1911 if (db24 > 2) histo[idx]++;
1933 if (db24 > 2) {for(i=0;i<256;i++){histo[i]=0;}}
2053 if (db24 > 2) {for(i=0; i<256;i++) {fprintf(stderr, " cmap histo[%03d] %d\n", i, histo[i]);}}
H A Dscreen.c369 int i, k, *histo; local
389 histo = (int *) calloc(ncolor * sizeof(int), 1);
392 histo[i] = 0;
399 histo[n]++;
407 fprintf(stderr, " %03d: %7d %04x/%04x/%04x", i, histo[i],
413 free(histo);

Completed in 476 milliseconds