4 * Functions used for compression.
8 * Copyright (C) 2012, 2013 Eric Biggers
10 * This file is part of wimlib, a library for working with WIM files.
12 * wimlib is free software; you can redistribute it and/or modify it under the
13 * terms of the GNU General Public License as published by the Free
14 * Software Foundation; either version 3 of the License, or (at your option)
17 * wimlib is distributed in the hope that it will be useful, but WITHOUT ANY
18 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
19 * A PARTICULAR PURPOSE. See the GNU General Public License for more
22 * You should have received a copy of the GNU General Public License
23 * along with wimlib; if not, see http://www.gnu.org/licenses/.
30 static inline void flush_bits(struct output_bitstream *ostream)
32 *(u16*)ostream->bit_output = cpu_to_le16(ostream->bitbuf);
33 ostream->bit_output = ostream->next_bit_output;
34 ostream->next_bit_output = ostream->output;
36 ostream->num_bytes_remaining -= 2;
39 /* Writes @num_bits bits, given by the @num_bits least significant bits of
40 * @bits, to the output @ostream. */
41 int bitstream_put_bits(struct output_bitstream *ostream, output_bitbuf_t bits,
46 wimlib_assert(num_bits <= 16);
47 if (num_bits <= ostream->free_bits) {
48 ostream->bitbuf = (ostream->bitbuf << num_bits) | bits;
49 ostream->free_bits -= num_bits;
52 if (ostream->num_bytes_remaining + (ostream->output -
53 ostream->bit_output) < 2)
56 /* It is tricky to output the bits correctly. The correct way
57 * is to output little-endian 2-byte words, such that the bits
58 * in the SECOND byte logically precede those in the FIRST byte.
59 * While the byte order is little-endian, the bit order is
60 * big-endian; the first bit in a byte is the high-order one.
61 * Any multi-bit numbers are in bit-big-endian form, so the
62 * low-order bit of a multi-bit number is the LAST bit to be
64 rem_bits = num_bits - ostream->free_bits;
65 ostream->bitbuf <<= ostream->free_bits;
66 ostream->bitbuf |= bits >> rem_bits;
68 ostream->free_bits = 16 - rem_bits;
69 ostream->bitbuf = bits;
75 /* Flushes any remaining bits in the output buffer to the output byte stream. */
76 int flush_output_bitstream(struct output_bitstream *ostream)
78 if (ostream->num_bytes_remaining + (ostream->output -
79 ostream->bit_output) < 2)
81 if (ostream->free_bits != 16) {
82 ostream->bitbuf <<= ostream->free_bits;
88 /* Initializes an output bit buffer to write its output to the memory location
89 * pointer to by @data. */
90 void init_output_bitstream(struct output_bitstream *ostream, void *data,
93 wimlib_assert(num_bytes >= 4);
96 ostream->free_bits = 16;
97 ostream->bit_output = (u8*)data;
98 ostream->next_bit_output = (u8*)data + 2;
99 ostream->output = (u8*)data + 4;
100 ostream->num_bytes_remaining = num_bytes - 4;
103 /* Intermediate (non-leaf) node in a Huffman tree. */
104 typedef struct HuffmanNode {
111 struct HuffmanNode *left_child;
112 struct HuffmanNode *right_child;
115 /* Leaf node in a Huffman tree. The fields are in the same order as the
116 * HuffmanNode, so it can be cast to a HuffmanNode. There are no pointers to
117 * the children in the leaf node. */
127 /* Comparator function for HuffmanLeafNodes. Sorts primarily by symbol
128 * frequency and secondarily by symbol value. */
129 static int cmp_leaves_by_freq(const void *__leaf1, const void *__leaf2)
131 const HuffmanLeafNode *leaf1 = __leaf1;
132 const HuffmanLeafNode *leaf2 = __leaf2;
134 int freq_diff = (int)leaf1->freq - (int)leaf2->freq;
137 return (int)leaf1->sym - (int)leaf2->sym;
142 /* Comparator function for HuffmanLeafNodes. Sorts primarily by code length and
143 * secondarily by symbol value. */
144 static int cmp_leaves_by_code_len(const void *__leaf1, const void *__leaf2)
146 const HuffmanLeafNode *leaf1 = __leaf1;
147 const HuffmanLeafNode *leaf2 = __leaf2;
149 int code_len_diff = (int)leaf1->path_len - (int)leaf2->path_len;
151 if (code_len_diff == 0)
152 return (int)leaf1->sym - (int)leaf2->sym;
154 return code_len_diff;
157 /* Recursive function to calculate the depth of the leaves in a Huffman tree.
159 static void huffman_tree_compute_path_lengths(HuffmanNode *node, u16 cur_len)
161 if (node->sym == (u16)(-1)) {
162 /* Intermediate node. */
163 huffman_tree_compute_path_lengths(node->left_child, cur_len + 1);
164 huffman_tree_compute_path_lengths(node->right_child, cur_len + 1);
167 node->path_len = cur_len;
171 /* make_canonical_huffman_code: - Creates a canonical Huffman code from an array
172 * of symbol frequencies.
174 * The algorithm used is similar to the well-known algorithm that builds a
175 * Huffman tree using a minheap. In that algorithm, the leaf nodes are
176 * initialized and inserted into the minheap with the frequency as the key.
177 * Repeatedly, the top two nodes (nodes with the lowest frequency) are taken out
178 * of the heap and made the children of a new node that has a frequency equal to
179 * the sum of the two frequencies of its children. This new node is inserted
180 * into the heap. When all the nodes have been removed from the heap, what
181 * remains is the Huffman tree. The Huffman code for a symbol is given by the
182 * path to it in the tree, where each left pointer is mapped to a 0 bit and each
183 * right pointer is mapped to a 1 bit.
185 * The algorithm used here uses an optimization that removes the need to
186 * actually use a heap. The leaf nodes are first sorted by frequency, as
187 * opposed to being made into a heap. Note that this sorting step takes O(n log
188 * n) time vs. O(n) time for heapifying the array, where n is the number of
189 * symbols. However, the heapless method is probably faster overall, due to the
190 * time saved later. In the heapless method, whenever an intermediate node is
191 * created, it is not inserted into the sorted array. Instead, the intermediate
192 * nodes are kept in a separate array, which is easily kept sorted because every
193 * time an intermediate node is initialized, it will have a frequency at least
194 * as high as that of the previous intermediate node that was initialized. So
195 * whenever we want the 2 nodes, leaf or intermediate, that have the lowest
196 * frequency, we check the low-frequency ends of both arrays, which is an O(1)
199 * The function builds a canonical Huffman code, not just any Huffman code. A
200 * Huffman code is canonical if the codeword for each symbol numerically
201 * precedes the codeword for all other symbols of the same length that are
202 * numbered higher than the symbol, and additionally, all shorter codewords,
203 * 0-extended, numerically precede longer codewords. A canonical Huffman code
204 * is useful because it can be reconstructed by only knowing the path lengths in
205 * the tree. See the make_huffman_decode_table() function to see how to
206 * reconstruct a canonical Huffman code from only the lengths of the codes.
208 * @num_syms: The number of symbols in the alphabet.
210 * @max_codeword_len: The maximum allowed length of a codeword in the code.
211 * Note that if the code being created runs up against
212 * this restriction, the code ultimately created will be
213 * suboptimal, although there are some advantages for
214 * limiting the length of the codewords.
216 * @freq_tab: An array of length @num_syms that contains the frequencies
217 * of each symbol in the uncompressed data.
219 * @lens: An array of length @num_syms into which the lengths of the
220 * codewords for each symbol will be written.
222 * @codewords: An array of @num_syms short integers into which the
223 * codewords for each symbol will be written. The first
224 * lens[i] bits of codewords[i] will contain the codeword
227 void make_canonical_huffman_code(unsigned num_syms, unsigned max_codeword_len,
228 const freq_t freq_tab[], u8 lens[],
231 /* We require at least 2 possible symbols in the alphabet to produce a
232 * valid Huffman decoding table. It is allowed that fewer than 2 symbols
233 * are actually used, though. */
234 wimlib_assert(num_syms >= 2);
236 /* Initialize the lengths and codewords to 0 */
237 memset(lens, 0, num_syms * sizeof(lens[0]));
238 memset(codewords, 0, num_syms * sizeof(codewords[0]));
240 /* Calculate how many symbols have non-zero frequency. These are the
241 * symbols that actually appeared in the input. */
242 unsigned num_used_symbols = 0;
243 for (unsigned i = 0; i < num_syms; i++)
244 if (freq_tab[i] != 0)
248 /* It is impossible to make a code for num_used_symbols symbols if there
249 * aren't enough code bits to uniquely represent all of them. */
250 wimlib_assert((1 << max_codeword_len) > num_used_symbols);
252 /* Initialize the array of leaf nodes with the symbols and their
254 HuffmanLeafNode leaves[num_used_symbols];
255 unsigned leaf_idx = 0;
256 for (unsigned i = 0; i < num_syms; i++) {
257 if (freq_tab[i] != 0) {
258 leaves[leaf_idx].freq = freq_tab[i];
259 leaves[leaf_idx].sym = i;
260 leaves[leaf_idx].height = 0;
265 /* Deal with the special cases where num_used_symbols < 2. */
266 if (num_used_symbols < 2) {
267 if (num_used_symbols == 0) {
268 /* If num_used_symbols is 0, there are no symbols in the
269 * input, so it must be empty. This should be an error,
270 * but the LZX format expects this case to succeed. All
271 * the codeword lengths are simply marked as 0 (which
272 * was already done.) */
274 /* If only one symbol is present, the LZX format
275 * requires that the Huffman code include two codewords.
276 * One is not used. Note that this doesn't make the
277 * encoded data take up more room anyway, since binary
278 * data itself has 2 symbols. */
280 unsigned sym = leaves[0].sym;
285 /* dummy symbol is 1, real symbol is 0 */
289 /* dummy symbol is 0, real symbol is sym */
297 /* Otherwise, there are at least 2 symbols in the input, so we need to
298 * find a real Huffman code. */
301 /* Declare the array of intermediate nodes. An intermediate node is not
302 * associated with a symbol. Instead, it represents some binary code
303 * prefix that is shared between at least 2 codewords. There can be at
304 * most num_used_symbols - 1 intermediate nodes when creating a Huffman
305 * code. This is because if there were at least num_used_symbols nodes,
306 * the code would be suboptimal because there would be at least one
307 * unnecessary intermediate node.
309 * The worst case (greatest number of intermediate nodes) would be if
310 * all the intermediate nodes were chained together. This results in
311 * num_used_symbols - 1 intermediate nodes. If num_used_symbols is at
312 * least 17, this configuration would not be allowed because the LZX
313 * format constrains codes to 16 bits or less each. However, it is
314 * still possible for there to be more than 16 intermediate nodes, as
315 * long as no leaf has a depth of more than 16. */
316 HuffmanNode inodes[num_used_symbols - 1];
319 /* Pointer to the leaf node of lowest frequency that hasn't already been
320 * added as the child of some intermediate note. */
321 HuffmanLeafNode *cur_leaf;
323 /* Pointer past the end of the array of leaves. */
324 HuffmanLeafNode *end_leaf = &leaves[num_used_symbols];
326 /* Pointer to the intermediate node of lowest frequency. */
327 HuffmanNode *cur_inode;
329 /* Pointer to the next unallocated intermediate node. */
330 HuffmanNode *next_inode;
332 /* Only jump back to here if the maximum length of the codewords allowed
333 * by the LZX format (16 bits) is exceeded. */
334 try_building_tree_again:
336 /* Sort the leaves from those that correspond to the least frequent
337 * symbol, to those that correspond to the most frequent symbol. If two
338 * leaves have the same frequency, they are sorted by symbol. */
339 qsort(leaves, num_used_symbols, sizeof(leaves[0]), cmp_leaves_by_freq);
341 cur_leaf = &leaves[0];
342 cur_inode = &inodes[0];
343 next_inode = &inodes[0];
345 /* The following loop takes the two lowest frequency nodes of those
346 * remaining and makes them the children of the next available
347 * intermediate node. It continues until all the leaf nodes and
348 * intermediate nodes have been used up, or the maximum allowed length
349 * for the codewords is exceeded. For the latter case, we must adjust
350 * the frequencies to be more equal and then execute this loop again. */
353 /* Lowest frequency node. */
356 /* Second lowest frequency node. */
359 /* Get the lowest and second lowest frequency nodes from the
360 * remaining leaves or from the intermediate nodes. */
362 if (cur_leaf != end_leaf && (cur_inode == next_inode ||
363 cur_leaf->freq <= cur_inode->freq)) {
364 f1 = (HuffmanNode*)cur_leaf++;
365 } else if (cur_inode != next_inode) {
369 if (cur_leaf != end_leaf && (cur_inode == next_inode ||
370 cur_leaf->freq <= cur_inode->freq)) {
371 f2 = (HuffmanNode*)cur_leaf++;
372 } else if (cur_inode != next_inode) {
375 /* All nodes used up! */
379 /* next_inode becomes the parent of f1 and f2. */
381 next_inode->freq = f1->freq + f2->freq;
382 next_inode->sym = (u16)(-1); /* Invalid symbol. */
383 next_inode->left_child = f1;
384 next_inode->right_child = f2;
386 /* We need to keep track of the height so that we can detect if
387 * the length of a codeword has execeed max_codeword_len. The
388 * parent node has a height one higher than the maximum height
389 * of its children. */
390 next_inode->height = max(f1->height, f2->height) + 1;
392 /* Check to see if the code length of the leaf farthest away
393 * from next_inode has exceeded the maximum code length. */
394 if (next_inode->height > max_codeword_len) {
395 /* The code lengths can be made more uniform by making
396 * the frequencies more uniform. Divide all the
397 * frequencies by 2, leaving 1 as the minimum frequency.
398 * If this keeps happening, the symbol frequencies will
399 * approach equality, which makes their Huffman
400 * codewords approach the length
401 * log_2(num_used_symbols).
403 for (unsigned i = 0; i < num_used_symbols; i++)
404 if (leaves[i].freq > 1)
405 leaves[i].freq >>= 1;
406 goto try_building_tree_again;
411 /* The Huffman tree is now complete, and its height is no more than
412 * max_codeword_len. */
414 HuffmanNode *root = next_inode - 1;
415 wimlib_assert(root->height <= max_codeword_len);
417 /* Compute the path lengths for the leaf nodes. */
418 huffman_tree_compute_path_lengths(root, 0);
420 /* Sort the leaf nodes primarily by code length and secondarily by
422 qsort(leaves, num_used_symbols, sizeof(leaves[0]), cmp_leaves_by_code_len);
424 u16 cur_codeword = 0;
425 unsigned cur_codeword_len = 0;
426 for (unsigned i = 0; i < num_used_symbols; i++) {
428 /* Each time a codeword becomes one longer, the current codeword
429 * is left shifted by one place. This is part of the procedure
430 * for enumerating the canonical Huffman code. Additionally,
431 * whenever a codeword is used, 1 is added to the current
434 unsigned len_diff = leaves[i].path_len - cur_codeword_len;
435 cur_codeword <<= len_diff;
436 cur_codeword_len += len_diff;
438 u16 sym = leaves[i].sym;
439 codewords[sym] = cur_codeword;
440 lens[sym] = cur_codeword_len;