Searched refs:root_bits (Results 1 – 6 of 6) sorted by relevance
| /external/webp/src/utils/ |
| D | huffman_utils.c | 67 int len, int root_bits) { in NextTableBitSize() argument
68 int left = 1 << (len - root_bits); in NextTableBitSize()
75 return len - root_bits; in NextTableBitSize()
80 static int BuildHuffmanTable(HuffmanCode* const root_table, int root_bits, in BuildHuffmanTable() argument
84 int total_size = 1 << root_bits; // total size root table + 2nd level table in BuildHuffmanTable()
96 assert(root_bits > 0); in BuildHuffmanTable()
150 int table_bits = root_bits; // key length of current table in BuildHuffmanTable()
154 for (len = 1, step = 2; len <= root_bits; ++len, step <<= 1) { in BuildHuffmanTable()
172 for (len = root_bits + 1, step = 2; len <= MAX_ALLOWED_CODE_LENGTH; in BuildHuffmanTable()
184 table_bits = NextTableBitSize(count, len, root_bits); in BuildHuffmanTable()
[all …]
|
| D | huffman_utils.h | 104 int VP8LBuildHuffmanTable(HuffmanTables* const root_table, int root_bits,
|
| /external/brotli/c/dec/ |
| D | huffman.c | 93 int len, int root_bits) { in NextTableBitSize() argument
94 int left = 1 << (len - root_bits); in NextTableBitSize()
101 return len - root_bits; in NextTableBitSize()
170 int root_bits, in BrotliBuildHuffmanTable() argument
189 BROTLI_DCHECK(root_bits <= BROTLI_REVERSE_BITS_MAX); in BrotliBuildHuffmanTable()
190 BROTLI_DCHECK(BROTLI_HUFFMAN_MAX_CODE_LENGTH - root_bits <= in BrotliBuildHuffmanTable()
197 table_bits = root_bits; in BrotliBuildHuffmanTable()
231 key_step = BROTLI_REVERSE_BITS_LOWEST >> (root_bits - 1); in BrotliBuildHuffmanTable()
234 for (len = root_bits + 1, step = 2; len <= max_length; ++len) { in BrotliBuildHuffmanTable()
239 table_bits = NextTableBitSize(count, len, root_bits); in BrotliBuildHuffmanTable()
[all …]
|
| D | huffman.h | 97 int root_bits, const uint16_t* const symbol_lists, uint16_t* count);
104 int root_bits, uint16_t* symbols, uint32_t num_symbols);
|
| /external/cronet/third_party/brotli/dec/ |
| D | huffman.c | 93 int len, int root_bits) { in NextTableBitSize() argument
94 int left = 1 << (len - root_bits); in NextTableBitSize()
101 return len - root_bits; in NextTableBitSize()
170 int root_bits, in BrotliBuildHuffmanTable() argument
189 BROTLI_DCHECK(root_bits <= BROTLI_REVERSE_BITS_MAX); in BrotliBuildHuffmanTable()
190 BROTLI_DCHECK(BROTLI_HUFFMAN_MAX_CODE_LENGTH - root_bits <= in BrotliBuildHuffmanTable()
197 table_bits = root_bits; in BrotliBuildHuffmanTable()
231 key_step = BROTLI_REVERSE_BITS_LOWEST >> (root_bits - 1); in BrotliBuildHuffmanTable()
234 for (len = root_bits + 1, step = 2; len <= max_length; ++len) { in BrotliBuildHuffmanTable()
239 table_bits = NextTableBitSize(count, len, root_bits); in BrotliBuildHuffmanTable()
[all …]
|
| D | huffman.h | 97 int root_bits, const uint16_t* const symbol_lists, uint16_t* count);
104 int root_bits, uint16_t* symbols, uint32_t num_symbols);
|