* @decode_table: The array in which to create the fast huffman decoding
* table. It must have a length of at least
* (2**table_bits) + 2 * num_syms to guarantee
- * that there is enough space.
+ * that there is enough space. Also must be 16-byte
+ * aligned (at least when USE_SSE2_FILL gets defined).
*
* @num_syms: Number of symbols in the alphabet, including symbols
* that do not appear in this particular input chunk.
left <<= 1;
left -= len_counts[len];
if (unlikely(left < 0)) { /* over-subscribed */
- ERROR("Invalid Huffman code (over-subscribed)");
+ DEBUG("Invalid Huffman code (over-subscribed)");
return -1;
}
}
table_num_entries * sizeof(decode_table[0]));
return 0;
} else {
- ERROR("Invalid Huffman code (incomplete set)");
+ DEBUG("Invalid Huffman code (incomplete set)");
return -1;
}
}
bitstream_remove_bits(istream, key_size);
do {
if (bitsleft == 0) {
- ERROR("Input stream exhausted");
+ DEBUG("Input stream exhausted");
return -1;
}
key_bits = sym + bitstream_peek_bits(istream, 1);