Lines Matching refs:HUFFMAN_TABLE_BITS
39 #define HUFFMAN_TABLE_BITS 8U
352 if (BROTLI_HC_FAST_LOAD_BITS(table) > HUFFMAN_TABLE_BITS) {
353 uint32_t nbits = BROTLI_HC_FAST_LOAD_BITS(table) - HUFFMAN_TABLE_BITS;
354 BrotliDropBits(br, HUFFMAN_TABLE_BITS);
357 ((bits >> HUFFMAN_TABLE_BITS) & BitMask(nbits)));
386 if (BROTLI_HC_FAST_LOAD_BITS(table) <= HUFFMAN_TABLE_BITS) {
395 if (available_bits <= HUFFMAN_TABLE_BITS) {
399 /* Speculatively drop HUFFMAN_TABLE_BITS. */
400 val = (val & BitMask(BROTLI_HC_FAST_LOAD_BITS(table))) >> HUFFMAN_TABLE_BITS;
401 available_bits -= HUFFMAN_TABLE_BITS;
407 BrotliDropBits(br, HUFFMAN_TABLE_BITS + BROTLI_HC_FAST_LOAD_BITS(table));
432 BROTLI_HC_ADJUST_TABLE_INDEX(table, BrotliGetBits(br, HUFFMAN_TABLE_BITS));
444 if (BROTLI_PREDICT_FALSE(*bits > HUFFMAN_TABLE_BITS)) {
447 uint32_t mask = BitMask((*bits - HUFFMAN_TABLE_BITS));
449 BrotliDropBits(br, HUFFMAN_TABLE_BITS);
450 BROTLI_HC_ADJUST_TABLE_INDEX(ext, (val >> HUFFMAN_TABLE_BITS) & mask);
801 table, HUFFMAN_TABLE_BITS, s->symbols_lists_array, s->symbol);
849 table, HUFFMAN_TABLE_BITS, s->symbol_lists, s->code_length_histo);