/external/chromium_org/third_party/libwebp/enc/ |
H A D | histogram.h | 67 VP8LHistogram* const histo); 74 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo,
|
H A D | 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 818 ComputeCacheHistogram(const uint32_t* const argb, int xsize, int ysize, const VP8LBackwardRefs* const refs, int cache_bits, VP8LHistogram* const histo) argument 880 VP8LHistogram histo; local [all...] |
H A D | analysis.c | 116 static int GetAlpha(const VP8Histogram* const histo) { argument 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...] |
H A D | histogram.c | 34 VP8LHistogram* const histo) { 37 VP8LHistogramAddSinglePixOrCopy(histo, &refs->refs[i]); 82 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo, argument 85 ++histo->alpha_[PixOrCopyLiteral(v, 3)]; 86 ++histo->red_[PixOrCopyLiteral(v, 2)]; 87 ++histo->literal_[PixOrCopyLiteral(v, 1)]; 88 ++histo->blue_[PixOrCopyLiteral(v, 0)]; 91 ++histo->literal_[literal_ix]; 96 ++histo->literal_[256 + code]; 99 ++histo 33 VP8LHistogramStoreRefs(const VP8LBackwardRefs* const refs, VP8LHistogram* const histo) argument [all...] |
H A D | 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/ |
H A D | histogram.h | 67 VP8LHistogram* const histo); 74 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo,
|
H A D | 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 818 ComputeCacheHistogram(const uint32_t* const argb, int xsize, int ysize, const VP8LBackwardRefs* const refs, int cache_bits, VP8LHistogram* const histo) argument 880 VP8LHistogram histo; local [all...] |
H A D | analysis.c | 116 static int GetAlpha(const VP8Histogram* const histo) { argument 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...] |
H A D | histogram.c | 34 VP8LHistogram* const histo) { 37 VP8LHistogramAddSinglePixOrCopy(histo, &refs->refs[i]); 82 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo, argument 85 ++histo->alpha_[PixOrCopyLiteral(v, 3)]; 86 ++histo->red_[PixOrCopyLiteral(v, 2)]; 87 ++histo->literal_[PixOrCopyLiteral(v, 1)]; 88 ++histo->blue_[PixOrCopyLiteral(v, 0)]; 91 ++histo->literal_[literal_ix]; 96 ++histo->literal_[256 + code]; 99 ++histo 33 VP8LHistogramStoreRefs(const VP8LBackwardRefs* const refs, VP8LHistogram* const histo) argument [all...] |
H A D | 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/chromium_org/tools/heapcheck/ |
H A D | heapcheck_test.py | 184 histo = {} 190 if hits in histo: 191 histo[hits].append(line) 193 histo[hits] = [line] 194 keys = histo.keys() 197 for line in histo[count]:
|
/external/llvm/utils/lit/lit/ |
H A D | Util.py | 112 histo = [set() for i in range(N)] 115 histo[bin].add(name) 134 for i,row in enumerate(histo):
|
/external/chromium_org/third_party/libwebp/dsp/ |
H A D | 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, 902 int histo[256] = { 0 }; local 934 int histo[256] = { 0 }; local [all...] |
H A D | dsp.h | 88 // Collect histogram for susceptibility calculation and accumulate in histo[]. 92 struct VP8Histogram* const histo);
|
H A D | enc.c | 47 VP8Histogram* const histo) { 59 histo->distribution[clipped_value]++; 45 CollectHistogram(const uint8_t* ref, const uint8_t* pred, int start_block, int end_block, VP8Histogram* const histo) argument
|
H A D | enc_sse2.c | 61 VP8Histogram* const histo) { 96 histo->distribution[out[k]]++; 59 CollectHistogramSSE2(const uint8_t* ref, const uint8_t* pred, int start_block, int end_block, VP8Histogram* const histo) argument
|
/external/webp/src/dsp/ |
H A D | 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, 902 int histo[256] = { 0 }; local 934 int histo[256] = { 0 }; local [all...] |
H A D | dsp.h | 88 // Collect histogram for susceptibility calculation and accumulate in histo[]. 92 struct VP8Histogram* const histo);
|
H A D | enc.c | 47 VP8Histogram* const histo) { 59 histo->distribution[clipped_value]++; 45 CollectHistogram(const uint8_t* ref, const uint8_t* pred, int start_block, int end_block, VP8Histogram* const histo) argument
|
H A D | enc_sse2.c | 61 VP8Histogram* const histo) { 96 histo->distribution[out[k]]++; 59 CollectHistogramSSE2(const uint8_t* ref, const uint8_t* pred, int start_block, int end_block, VP8Histogram* const histo) argument
|
/external/valgrind/main/exp-dhat/ |
H A D | dh_main.c | 212 UInt* histo; /* [0 .. xsize-1] */ member in struct:__anon27496 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...] |