| /external/brotli/c/enc/ |
| block_encoder_inc.h | 16 const size_t alphabet_size, HuffmanTree* tree,
28 alphabet_size, tree, &self->depths_[ix], &self->bits_[ix],
|
| params.h | 26 uint32_t alphabet_size; member in struct:BrotliDistanceParams
|
| metablock_inc.h | 46 MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size,
54 self->alphabet_size_ = alphabet_size;
|
| metablock.c | 31 uint32_t alphabet_size, max_distance; local
36 alphabet_size = BROTLI_DISTANCE_ALPHABET_SIZE(
44 alphabet_size = BROTLI_DISTANCE_ALPHABET_SIZE(
58 dist_params->alphabet_size = alphabet_size;
340 MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size,
348 self->alphabet_size_ = alphabet_size;
|
| brotli_bit_stream.c | 365 const size_t alphabet_size,
387 size_t max_bits_counter = alphabet_size - 1;
814 size_t alphabet_size = num_types + repeat_code; local
819 memset(histogram, 0, alphabet_size * sizeof(histogram[0]));
825 for (i = context_bits; i < alphabet_size; ++i) {
828 BuildAndStoreHuffmanTree(histogram, alphabet_size, alphabet_size,
[all...] |
| backward_references_hq.c | 89 uint32_t distance_histogram_size = dist->alphabet_size;
95 self->cost_dist_ = BROTLI_ALLOC(m, float, dist->alphabet_size);
|
| encode.c | 620 uint32_t num_effective_dist_codes = block_params.dist.alphabet_size;
720 params->dist.alphabet_size =
[all...] |
| /external/brotli/c/dec/ |
| state.c | 145 HuffmanTreeGroup* group, uint32_t alphabet_size, uint32_t max_symbol,
148 const size_t max_table_size = kMaxHuffmanTableSize[(alphabet_size + 31) >> 5];
154 group->alphabet_size = (uint16_t)alphabet_size;
|
| huffman.h | 113 /* max_symbol is needed due to simple codes since log2(alphabet_size) could be
118 uint16_t alphabet_size; member in struct:__anon15562
|
| decode.c | 473 uint32_t alphabet_size, uint32_t max_symbol, BrotliDecoderState* s) {
476 uint32_t max_bits = Log2Floor(alphabet_size - 1);
541 uint32_t repeat_delta, uint32_t alphabet_size, uint32_t* symbol,
563 if (*symbol + repeat_delta > alphabet_size) {
565 *symbol = alphabet_size;
589 uint32_t alphabet_size, BrotliDecoderState* s) {
602 while (symbol < alphabet_size && space > 0) {
628 ProcessRepeatedCodeLength(code_len, repeat_delta, alphabet_size,
638 uint32_t alphabet_size, BrotliDecoderState* s) {
641 while (s->symbol < alphabet_size && s->space > 0)
1031 uint32_t alphabet_size = *num_htrees + s->max_run_length_prefix; local
2218 uint32_t alphabet_size = s->num_block_types[s->loop_counter] + 2; local
2228 uint32_t alphabet_size = BROTLI_NUM_BLOCK_LEN_SYMBOLS; local
[all...] |
| state.h | 244 BrotliDecoderState* s, HuffmanTreeGroup* group, uint32_t alphabet_size,
|
| /external/webp/src/dec/ |
| vp8l_dec.c | 309 static int ReadHuffmanCode(int alphabet_size, VP8LDecoder* const dec,
316 memset(code_lengths, 0, alphabet_size * sizeof(*code_lengths));
342 ok = ReadHuffmanCodeLengths(dec, code_length_code_lengths, alphabet_size,
349 code_lengths, alphabet_size);
436 int alphabet_size = kAlphabetSize[j]; local
438 alphabet_size += 1 << color_cache_bits;
440 if (max_alphabet_size < alphabet_size) {
441 max_alphabet_size = alphabet_size;
471 int alphabet_size = kAlphabetSize[j]; local
474 alphabet_size += 1 << color_cache_bits
[all...] |
