unsigned read_huffman_symbol_slow_path(const struct huffman_table* table,
struct bit_source* source);
-static inline unsigned read_huffman_symbol(const struct huffman_table* table,
- struct bit_source* source)
+static inline unsigned read_huffman_symbol_no_refill(
+ const struct huffman_table* table,
+ struct bit_source* source)
{
- possibly_refill(source, DEHUF_TABLE_BITS);
assert(source->bits_available >= DEHUF_TABLE_BITS);
unsigned lookup = peek_bits(source, DEHUF_TABLE_BITS);
int code = table->lookup_table_codes[lookup];
return code;
}
+static inline unsigned read_huffman_symbol(const struct huffman_table* table,
+ struct bit_source* source)
+{
+ possibly_refill(source, DEHUF_TABLE_BITS);
+ return read_huffman_symbol_no_refill(table, source);
+}
+
// procedure EXTEND (figure F.12)
// Fast lookup table for (1 << (bits - 1)).
0, 1 << 0, 1 << 1, 1 << 2, 1 << 3, 1 << 4, 1 << 5, 1 << 6, 1 << 7, 1 << 8, 1 << 9, 1 << 10, 1 << 11, 1 << 12, 1 << 13, 1 << 14
};
-static inline unsigned extend(int val, int bits)
+static inline unsigned extend(int val, unsigned bits)
{
if (val < bit_thresholds[bits]) {
return val + (-1 << bits) + 1;