Home
last modified time | relevance | path

Searched refs:alphabet_size (Results 1 – 9 of 9) sorted by relevance

/external/brotli/c/enc/
Dblock_encoder_inc.h17 const size_t alphabet_size = self->alphabet_size_; in FN() local
18 const size_t table_size = histograms_size * alphabet_size; in FN()
26 size_t ix = i * alphabet_size; in FN()
27 BuildAndStoreHuffmanTree(&histograms[i].data_[0], alphabet_size, tree, in FN()
Dmetablock_inc.h46 MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size, in FN()
54 self->alphabet_size_ = alphabet_size; in FN()
Dbrotli_bit_stream.c811 size_t alphabet_size = num_types + repeat_code; in StoreTrivialContextMap() local
816 memset(histogram, 0, alphabet_size * sizeof(histogram[0])); in StoreTrivialContextMap()
822 for (i = context_bits; i < alphabet_size; ++i) { in StoreTrivialContextMap()
825 BuildAndStoreHuffmanTree(histogram, alphabet_size, tree, in StoreTrivialContextMap()
854 static void InitBlockEncoder(BlockEncoder* self, size_t alphabet_size, in InitBlockEncoder() argument
857 self->alphabet_size_ = alphabet_size; in InitBlockEncoder()
Dmetablock.c197 MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size, in InitContextBlockSplitter() argument
205 self->alphabet_size_ = alphabet_size; in InitContextBlockSplitter()
/external/brotli/c/dec/
Dstate.c156 HuffmanTreeGroup* group, uint32_t alphabet_size, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
158 const size_t max_table_size = kMaxHuffmanTableSize[(alphabet_size + 31) >> 5]; in BrotliDecoderHuffmanTreeGroupInit()
163 group->alphabet_size = (uint16_t)alphabet_size; in BrotliDecoderHuffmanTreeGroupInit()
Ddecode.c435 uint32_t alphabet_size, BrotliDecoderState* s) { in ReadSimpleHuffmanSymbols() argument
438 uint32_t max_bits = Log2Floor(alphabet_size - 1); in ReadSimpleHuffmanSymbols()
448 if (v >= alphabet_size) { in ReadSimpleHuffmanSymbols()
504 uint32_t repeat_delta, uint32_t alphabet_size, uint32_t* symbol, in ProcessRepeatedCodeLength() argument
526 if (*symbol + repeat_delta > alphabet_size) { in ProcessRepeatedCodeLength()
528 *symbol = alphabet_size; in ProcessRepeatedCodeLength()
552 uint32_t alphabet_size, BrotliDecoderState* s) { in ReadSymbolCodeLengths() argument
565 while (symbol < alphabet_size && space > 0) { in ReadSymbolCodeLengths()
590 ProcessRepeatedCodeLength(code_len, repeat_delta, alphabet_size, in ReadSymbolCodeLengths()
600 uint32_t alphabet_size, BrotliDecoderState* s) { in SafeReadSymbolCodeLengths() argument
[all …]
Dhuffman.h60 uint16_t alphabet_size; member
Dstate.h240 BrotliDecoderState* s, HuffmanTreeGroup* group, uint32_t alphabet_size,
/external/webp/src/dec/
Dvp8l_dec.c309 static int ReadHuffmanCode(int alphabet_size, VP8LDecoder* const dec, in ReadHuffmanCode() argument
316 memset(code_lengths, 0, alphabet_size * sizeof(*code_lengths)); in ReadHuffmanCode()
342 ok = ReadHuffmanCodeLengths(dec, code_length_code_lengths, alphabet_size, in ReadHuffmanCode()
349 code_lengths, alphabet_size); in ReadHuffmanCode()
397 int alphabet_size = kAlphabetSize[j]; in ReadHuffmanCodes() local
399 alphabet_size += 1 << color_cache_bits; in ReadHuffmanCodes()
401 if (max_alphabet_size < alphabet_size) { in ReadHuffmanCodes()
402 max_alphabet_size = alphabet_size; in ReadHuffmanCodes()
426 int alphabet_size = kAlphabetSize[j]; in ReadHuffmanCodes() local
429 alphabet_size += 1 << color_cache_bits; in ReadHuffmanCodes()
[all …]