Searched refs:distance_ (Results 1 - 7 of 7) sorted by relevance
| /external/webp/src/enc/ |
| H A D | histogram_enc.h | 39 uint32_t distance_[NUM_DISTANCE_CODES]; member in struct:__anon25851
|
| H A D | histogram_enc.c | 156 ++histo->distance_[code];
283 + PopulationCost(p->distance_, NUM_DISTANCE_CODES, NULL)
285 + VP8LExtraCost(p->distance_, NUM_DISTANCE_CODES);
331 GetCombinedEntropy(a->distance_, b->distance_, NUM_DISTANCE_CODES, 0);
333 VP8LExtraCostCombined(a->distance_, b->distance_, NUM_DISTANCE_CODES);
421 PopulationCost(h->distance_, NUM_DISTANCE_CODES, NULL) +
422 VP8LExtraCost(h->distance_, NUM_DISTANCE_CODES);
|
| H A D | backward_references_enc.c | 565 double distance_[NUM_DISTANCE_CODES]; member in struct:__anon25840
613 NUM_DISTANCE_CODES, histo->distance_, m->distance_);
644 return m->distance_[code] + extra_bits;
930 // the minimum in cost_model->distance_. The case where the offset cost is 0
936 if (cost_model->distance_[i] != 0) {
938 offset_cost_min = cost_model->distance_[i];
939 } else if (cost_model->distance_[i] < offset_cost_min) {
940 offset_cost_min = cost_model->distance_[i];
944 // In case all the cost_model->distance_ i
[all...] |
| H A D | vp8l_enc.c | 447 VP8LCreateHuffmanTree(histo->distance_, 15, buf_rle, huff_tree, codes + 4);
|
| /external/webp/src/dsp/ |
| H A D | lossless_enc_mips32.c | 388 ADD_VECTOR(a->distance_, b->distance_, out->distance_,
396 ADD_VECTOR_EQ(a->distance_, out->distance_, NUM_DISTANCE_CODES, 0);
|
| H A D | lossless_enc.c | 644 out->distance_[i] = a->distance_[i] + b->distance_[i];
656 out->distance_[i] += a->distance_[i];
|
| H A D | lossless_enc_sse2.c | 255 out->distance_[i] = a->distance_[i] + b->distance_[i];
|
Completed in 105 milliseconds