Searched refs:HUFFMAN_TABLE_BITS (Results 1 – 4 of 4) sorted by relevance
25 #define HUFFMAN_TABLE_BITS 8 macro26 #define HUFFMAN_TABLE_MASK ((1 << HUFFMAN_TABLE_BITS) - 1)
39 #define HUFFMAN_TABLE_BITS 8U macro352 if (BROTLI_HC_FAST_LOAD_BITS(table) > HUFFMAN_TABLE_BITS) { in DecodeSymbol()353 uint32_t nbits = BROTLI_HC_FAST_LOAD_BITS(table) - HUFFMAN_TABLE_BITS; in DecodeSymbol()354 BrotliDropBits(br, HUFFMAN_TABLE_BITS); in DecodeSymbol()357 ((bits >> HUFFMAN_TABLE_BITS) & BitMask(nbits))); in DecodeSymbol()386 if (BROTLI_HC_FAST_LOAD_BITS(table) <= HUFFMAN_TABLE_BITS) { in SafeDecodeSymbol()395 if (available_bits <= HUFFMAN_TABLE_BITS) { in SafeDecodeSymbol()400 val = (val & BitMask(BROTLI_HC_FAST_LOAD_BITS(table))) >> HUFFMAN_TABLE_BITS; in SafeDecodeSymbol()401 available_bits -= HUFFMAN_TABLE_BITS; in SafeDecodeSymbol()407 BrotliDropBits(br, HUFFMAN_TABLE_BITS + BROTLI_HC_FAST_LOAD_BITS(table)); in SafeDecodeSymbol()[all …]
42 private static final int HUFFMAN_TABLE_BITS = 8; field in Decode245 if (bits <= HUFFMAN_TABLE_BITS) { in readSymbol()251 offset += (val & mask) >>> HUFFMAN_TABLE_BITS; in readSymbol()252 s.bitOffset += ((table[offset] >> 16) + HUFFMAN_TABLE_BITS); in readSymbol()433 Huffman.buildHuffmanTable(table, offset, HUFFMAN_TABLE_BITS, codeLengths, alphabetSize); in readHuffmanCode()
188 nbits = table->bits - HUFFMAN_TABLE_BITS; in ReadSymbol()190 VP8LSetBitPos(br, br->bit_pos_ + HUFFMAN_TABLE_BITS); in ReadSymbol()223 assert(huff->bits <= HUFFMAN_TABLE_BITS); in AccumulateHCode()348 size = VP8LBuildHuffmanTable(table, HUFFMAN_TABLE_BITS, in ReadHuffmanCode()