Searched refs:table_bits (Results 1 – 4 of 4) sorted by relevance
79 int table_bits; /* key length of current table */ in BrotliBuildHuffmanTable() local110 table_bits = root_bits; in BrotliBuildHuffmanTable()111 table_size = 1 << table_bits; in BrotliBuildHuffmanTable()144 table_bits = NextTableBitSize(count, len, root_bits); in BrotliBuildHuffmanTable()145 table_size = 1 << table_bits; in BrotliBuildHuffmanTable()148 root_table[low].bits = (uint8_t)(table_bits + root_bits); in BrotliBuildHuffmanTable()
450 int table_bits = table[0]; in GetHuff() local451 val = table[Show(table_bits) + 2]; in GetHuff()457 Move( table_bits ); in GetHuff()552 int table_bits = table[0]; in GetHuff() local553 val = table[Show(table_bits) + 1]; in GetHuff()559 Move( table_bits ); in GetHuff()652 int table_bits= first_bits; in bsCreateDecodeHuffmanTable() local658 if( code_bits > table_bits ) in bsCreateDecodeHuffmanTable()660 int idx = code >> (code_bits -= table_bits); in bsCreateDecodeHuffmanTable()663 table_bits= sub_tables[idx].bits; in bsCreateDecodeHuffmanTable()[all …]
1582 size_t table_bits = 0;1587 ++table_bits;1590 size_t mnemonic_bits = table_bits + pfxbits + sfxbits;1610 best_table_bits = table_bits;
3294 size_t table_bits = 0;3299 ++table_bits;3302 size_t mnemonic_bits = table_bits + pfxbits + sfxbits;3322 best_table_bits = table_bits;