}
}
-/* Creates a canonical Huffman code from an array of symbol frequencies.
+/* make_canonical_huffman_code: - Creates a canonical Huffman code from an array
+ * of symbol frequencies.
*
* The algorithm used is similar to the well-known algorithm that builds a
* Huffman tree using a minheap. In that algorithm, the leaf nodes are
* for symbol i.
*/
void make_canonical_huffman_code(unsigned num_syms, unsigned max_codeword_len,
- const u32 freq_tab[], u8 lens[],
+ const freq_t freq_tab[], u8 lens[],
u16 codewords[])
{
/* We require at least 2 possible symbols in the alphabet to produce a