Lines Matching refs:root_bits
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()
245 (uint8_t)(table_bits + root_bits), in BrotliBuildHuffmanTable()
250 code = ConstructHuffmanCode((uint8_t)(len - root_bits), (uint16_t)symbol); in BrotliBuildHuffmanTable()
262 int root_bits, in BrotliBuildSimpleHuffmanTable() argument
266 const uint32_t goal_size = 1U << root_bits; in BrotliBuildSimpleHuffmanTable()