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()
95   assert(root_bits > 0);  in BuildHuffmanTable()
143     int table_bits = root_bits;        // key length of current table  in BuildHuffmanTable()
147     for (len = 1, step = 2; len <= root_bits; ++len, step <<= 1) {  in BuildHuffmanTable()
164     for (len = root_bits + 1, step = 2; len <= MAX_ALLOWED_CODE_LENGTH;  in BuildHuffmanTable()
176           table_bits = NextTableBitSize(count, len, root_bits);  in BuildHuffmanTable()
180           root_table[low].bits = (uint8_t)(table_bits + root_bits);  in BuildHuffmanTable()
183         code.bits = (uint8_t)(len - root_bits);  in BuildHuffmanTable()
185         ReplicateValue(&table[key >> root_bits], step, table_size, code);  in BuildHuffmanTable()
205 int VP8LBuildHuffmanTable(HuffmanCode* const root_table, int root_bits,  in VP8LBuildHuffmanTable()  argument
212     total_size = BuildHuffmanTable(root_table, root_bits,  in VP8LBuildHuffmanTable()
218     total_size = BuildHuffmanTable(root_table, root_bits,  in VP8LBuildHuffmanTable()