| /external/brotli/enc/ |
| block_encoder_inc.h | 17 const size_t alphabet_size = self->alphabet_size_; local
18 const size_t table_size = histograms_size * alphabet_size;
26 size_t ix = i * alphabet_size;
27 BuildAndStoreHuffmanTree(&histograms[i].data_[0], alphabet_size, tree,
|
| metablock_inc.h | 46 MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size,
54 self->alphabet_size_ = alphabet_size;
|
| brotli_bit_stream.c | 811 size_t alphabet_size = num_types + repeat_code; local
816 memset(histogram, 0, alphabet_size * sizeof(histogram[0]));
822 for (i = context_bits; i < alphabet_size; ++i) {
825 BuildAndStoreHuffmanTree(histogram, alphabet_size, tree,
854 static void InitBlockEncoder(BlockEncoder* self, size_t alphabet_size,
857 self->alphabet_size_ = alphabet_size;
[all...] |
| metablock.c | 197 MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size,
205 self->alphabet_size_ = alphabet_size;
|
| /external/brotli/dec/ |
| huffman.h | 60 uint16_t alphabet_size; member in struct:__anon13463
|
| state.c | 153 HuffmanTreeGroup* group, uint32_t alphabet_size, uint32_t ntrees) {
155 const size_t max_table_size = kMaxHuffmanTableSize[(alphabet_size + 31) >> 5];
160 group->alphabet_size = (uint16_t)alphabet_size;
|
| decode.c | 420 uint32_t alphabet_size, BrotliDecoderState* s) {
423 uint32_t max_bits = Log2Floor(alphabet_size - 1);
433 if (v >= alphabet_size) {
489 uint32_t repeat_delta, uint32_t alphabet_size, uint32_t* symbol,
511 if (*symbol + repeat_delta > alphabet_size) {
513 *symbol = alphabet_size;
537 uint32_t alphabet_size, BrotliDecoderState* s) {
550 while (symbol < alphabet_size && space > 0) {
575 ProcessRepeatedCodeLength(code_len, repeat_delta, alphabet_size,
585 uint32_t alphabet_size, BrotliDecoderState* s)
[all...] |
| state.h | 243 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);
397 int alphabet_size = kAlphabetSize[j]; local
399 alphabet_size += 1 << color_cache_bits;
401 if (max_alphabet_size < alphabet_size) {
402 max_alphabet_size = alphabet_size;
426 int alphabet_size = kAlphabetSize[j]; local
429 alphabet_size += 1 << color_cache_bits
[all...] |
