4 * Routines for LZX decompression. The LZX format has many similarities to the
5 * DEFLATE format used in zlib and gzip, but it's not quite the same.
7 * source: modified lzx.c from cabextract v0.5
8 * notes: This file has been modified from code taken from cabextract
9 * v0.5, which was, itself, a modified version of the
10 * lzx decompression code from unlzx.
12 * wimlib - Library for working with WIM files
14 * This library is free software; you can redistribute it and/or modify it under
15 * the terms of the GNU Lesser General Public License as published by the Free
16 * Software Foundation; either version 2.1 of the License, or (at your option) any
19 * This library is distributed in the hope that it will be useful, but WITHOUT ANY
20 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
21 * PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
23 * You should have received a copy of the GNU Lesser General Public License along
24 * with this library; if not, write to the Free Software Foundation, Inc., 59
25 * Temple Place, Suite 330, Boston, MA 02111-1307 USA
29 * This file has been customized for WIMLIB.
31 * Some notes on the LZX compression format as used in Windows Imaging (WIM)
34 * A compressed WIM file resource consists of a table of chunk offsets followed
35 * by compressed chunks. All compressed chunks except the last decompress to
36 * WIM_CHUNK_SIZE (= 32768) bytes. This is quite similar to the cabinet (.cab)
37 * file format, but they are not the same (at least based on M$'s
38 * documentation). According to the documentation, in the cabinet format, the
39 * LZX block size is independent from the CFDATA blocks and may span several
40 * CFDATA blocks. However, for WIM file resources, I have seen no case of a LZX
41 * block spanning multiple WIM chunks. This is probably done to make it easier
42 * to randomly access the compressed file resources. WIMLIB in fact makes use
43 * of this feature to allow semi-random access to file resources in the
44 * read_resource() function.
46 * Usually a WIM chunk will contain only one LZX block, but on rare occasions it
47 * may contain multiple LZX block. The LZX block are usually the aligned block
48 * type or verbatim block type, but can (very rarely) be the uncompressed block
49 * type. The size of a LZX block is specified by 1 or 17 bits following the 3
50 * bits that specify the block type. A '1' means to use the default block size
51 * (equal to 32768), while a '0' means that the block size is given by the next
54 * The cabinet format, as documented, allows for the possibility that a CFDATA
55 * chunk is up to 6144 bytes larger than the uncompressed data. In the WIM
56 * format, however, it appears that every chunk that would be 32768 bytes or
57 * more when compressed, is actually stored uncompressed. This is not
60 * The 'e8' preprocessing step that changes x86 call instructions to use
61 * absolute offsets instead of relative offsets relies on a filesize parameter.
62 * There is no such parameter for this in the WIM files (even though the size of
63 * the file resource could be used for this purpose), and instead a magic file
64 * size of 12000000 is used. The 'e8' preprocessing is always done, and there
65 * is no bit to indicate whether it is done or not.
70 * Some more notes about errors in Microsoft's documentation:
72 * Microsoft's LZX document and their implementation of the com.ms.util.cab Java
73 * package do not concur.
75 * In the LZX document, there is a table showing the correlation between window
76 * size and the number of position slots. It states that the 1MB window = 40
77 * slots and the 2MB window = 42 slots. In the implementation, 1MB = 42 slots,
78 * 2MB = 50 slots. The actual calculation is 'find the first slot whose position
79 * base is equal to or more than the required window size'. This would explain
80 * why other tables in the document refer to 50 slots rather than 42.
82 * The constant NUM_PRIMARY_LENS used in the decompression pseudocode is not
83 * defined in the specification.
85 * The LZX document states that aligned offset blocks have their aligned offset
86 * huffman tree AFTER the main and length trees. The implementation suggests
87 * that the aligned offset tree is BEFORE the main and length trees.
89 * The LZX document decoding algorithm states that, in an aligned offset block,
90 * if an extra_bits value is 1, 2 or 3, then that number of bits should be read
91 * and the result added to the match offset. This is correct for 1 and 2, but
92 * not 3, where just a huffman symbol (using the aligned tree) should be read.
94 * Regarding the E8 preprocessing, the LZX document states 'No translation may
95 * be performed on the last 6 bytes of the input block'. This is correct.
96 * However, the pseudocode provided checks for the *E8 leader* up to the last 6
97 * bytes. If the leader appears between -10 and -7 bytes from the end, this
98 * would cause the next four bytes to be modified, at least one of which would
99 * be in the last 6 bytes, which is not allowed according to the spec.
101 * The specification states that the huffman trees must always contain at least
102 * one element. However, many CAB files contain blocks where the length tree is
103 * completely empty (because there are no matches), and this is expected to
115 /* Huffman decoding tables and maps from symbols to code lengths. */
118 u16 maintree_decode_table[(1 << LZX_MAINTREE_TABLEBITS) +
119 (LZX_MAINTREE_NUM_SYMBOLS * 2)];
120 u8 maintree_lens[LZX_MAINTREE_NUM_SYMBOLS];
123 u16 lentree_decode_table[(1 << LZX_LENTREE_TABLEBITS) +
124 (LZX_LENTREE_NUM_SYMBOLS * 2)];
125 u8 lentree_lens[LZX_LENTREE_NUM_SYMBOLS];
128 u16 alignedtree_decode_table[(1 << LZX_ALIGNEDTREE_TABLEBITS) +
129 (LZX_ALIGNEDTREE_NUM_SYMBOLS * 2)];
130 u8 alignedtree_lens[LZX_ALIGNEDTREE_NUM_SYMBOLS];
135 * Reads a Huffman-encoded symbol using the pre-tree.
137 static inline int read_huffsym_using_pretree(struct input_bitstream *istream,
138 const u16 pretree_decode_table[],
139 const u8 pretree_lens[], uint *n)
141 return read_huffsym(istream, pretree_decode_table, pretree_lens,
142 LZX_PRETREE_NUM_SYMBOLS, LZX_PRETREE_TABLEBITS, n,
143 LZX_MAX_CODEWORD_LEN);
146 /* Reads a Huffman-encoded symbol using the main tree. */
147 static inline int read_huffsym_using_maintree(struct input_bitstream *istream,
148 const struct lzx_tables *tables,
151 return read_huffsym(istream, tables->maintree_decode_table,
152 tables->maintree_lens, LZX_MAINTREE_NUM_SYMBOLS,
153 LZX_MAINTREE_TABLEBITS, n, LZX_MAX_CODEWORD_LEN);
156 /* Reads a Huffman-encoded symbol using the length tree. */
157 static inline int read_huffsym_using_lentree(struct input_bitstream *istream,
158 const struct lzx_tables *tables,
161 return read_huffsym(istream, tables->lentree_decode_table,
162 tables->lentree_lens, LZX_LENTREE_NUM_SYMBOLS,
163 LZX_LENTREE_TABLEBITS, n, LZX_MAX_CODEWORD_LEN);
166 /* Reads a Huffman-encoded symbol using the aligned offset tree. */
167 static inline int read_huffsym_using_alignedtree(struct input_bitstream *istream,
168 const struct lzx_tables *tables,
171 return read_huffsym(istream, tables->alignedtree_decode_table,
172 tables->alignedtree_lens,
173 LZX_ALIGNEDTREE_NUM_SYMBOLS,
174 LZX_ALIGNEDTREE_TABLEBITS, n, 8);
178 * Reads the pretree from the input, then uses the pretree to decode @num_lens
179 * code length values from the input.
181 * @istream: The bit stream for the input. It is positioned on the beginning
182 * of the pretree for the code length values.
183 * @lens: An array that contains the length values from the previous time
184 * the code lengths for this Huffman tree were read, or all
185 * 0's if this is the first time.
186 * @num_lens: Number of length values to decode and return.
189 static int lzx_read_code_lens(struct input_bitstream *istream, u8 lens[],
192 /* Declare the decoding table and length table for the pretree. */
193 u16 pretree_decode_table[(1 << LZX_PRETREE_TABLEBITS) +
194 (LZX_PRETREE_NUM_SYMBOLS * 2)];
195 u8 pretree_lens[LZX_PRETREE_NUM_SYMBOLS];
200 /* Read the code lengths of the pretree codes. There are 20 lengths of
202 for (i = 0; i < LZX_PRETREE_NUM_SYMBOLS; i++) {
203 ret = bitstream_read_bits(istream, LZX_PRETREE_ELEMENT_SIZE,
207 pretree_lens[i] = len;
210 /* Make the decoding table for the pretree. */
211 ret = make_huffman_decode_table(pretree_decode_table,
212 LZX_PRETREE_NUM_SYMBOLS,
213 LZX_PRETREE_TABLEBITS,
215 LZX_MAX_CODEWORD_LEN);
219 /* Pointer past the last length value that needs to be filled in. */
220 u8 *lens_end = lens + num_lens;
224 /* Decode a symbol from the input. If the symbol is between 0
225 * and 16, it is the difference from the old length. If it is
226 * between 17 and 19, it is a special code that indicates that
227 * some number of the next lengths are all 0, or some number of
228 * the next lengths are all equal to the next symbol in the
236 ret = read_huffsym_using_pretree(istream, pretree_decode_table,
237 pretree_lens, &tree_code);
241 case 17: /* Run of 0's */
242 ret = bitstream_read_bits(istream, 4, &num_zeroes);
246 while (num_zeroes--) {
248 if (++lens == lens_end)
252 case 18: /* Longer run of 0's */
253 ret = bitstream_read_bits(istream, 5, &num_zeroes);
257 while (num_zeroes--) {
259 if (++lens == lens_end)
263 case 19: /* Run of identical lengths */
264 ret = bitstream_read_bits(istream, 1, &num_same);
269 ret = read_huffsym_using_pretree(istream,
270 pretree_decode_table,
271 pretree_lens, &code);
274 value = (char)*lens - (char)code;
279 if (++lens == lens_end)
283 default: /* Difference from old length. */
284 value = (char)*lens - (char)tree_code;
288 if (++lens == lens_end)
296 * Reads the header for an LZX-compressed block.
298 * @istream: The input bitstream.
299 * @block_size_ret: A pointer to an int into which the size of the block,
300 * in bytes, will be returned.
301 * @block_type_ret: A pointer to an int into which the type of the block
302 * (LZX_BLOCKTYPE_*) will be returned.
303 * @tables: A pointer to a lzx_tables structure in which the
304 * main tree, the length tree, and possibly the
305 * aligned offset tree will be constructed.
306 * @queue: A pointer to the least-recently-used queue into which
307 * R0, R1, and R2 will be written (only for uncompressed
308 * blocks, which contain this information in the header)
310 static int lzx_read_block_header(struct input_bitstream *istream,
311 int *block_size_ret, int *block_type_ret,
312 struct lzx_tables *tables,
313 struct lru_queue *queue)
323 ret = bitstream_ensure_bits(istream, 4);
325 ERROR("Input stream overrun!\n");
329 /* The first three bits tell us what kind of block it is, and are one
330 * of the LZX_BLOCKTYPE_* values. */
331 block_type = bitstream_read_bits_nocheck(istream, 3);
333 /* The next bit indicates whether the block size is the default (32768),
334 * indicated by a 1 bit, or whether the block size is given by the next
335 * 16 bits, indicated by a 0 bit. */
336 s = bitstream_read_bits_nocheck(istream, 1);
339 block_size = 1 << 15;
341 ret = bitstream_read_bits(istream, 16, &block_size);
344 block_size = to_le16(block_size);
347 switch (block_type) {
348 case LZX_BLOCKTYPE_ALIGNED:
350 /* Read the path lengths for the elements of the aligned tree,
353 for (i = 0; i < LZX_ALIGNEDTREE_NUM_SYMBOLS; i++) {
354 ret = bitstream_read_bits(istream,
355 LZX_ALIGNEDTREE_ELEMENT_SIZE,
359 tables->alignedtree_lens[i] = len;
362 LZX_DEBUG("Building the aligned tree.\n");
363 ret = make_huffman_decode_table(tables->alignedtree_decode_table,
364 LZX_ALIGNEDTREE_NUM_SYMBOLS,
365 LZX_ALIGNEDTREE_TABLEBITS,
366 tables->alignedtree_lens, 8);
368 ERROR("Failed to make the decode table for "
369 "the aligned offset tree!\n");
373 /* Fall though, since the rest of the header for aligned offset
374 * blocks is the same as that for verbatim blocks */
376 case LZX_BLOCKTYPE_VERBATIM:
377 if (block_type == LZX_BLOCKTYPE_VERBATIM)
378 LZX_DEBUG("Found verbatim block\n");
380 LZX_DEBUG("Reading path lengths for main tree.\n");
381 /* Read the path lengths for the first 256 elements of the main
383 ret = lzx_read_code_lens(istream, tables->maintree_lens,
386 ERROR("Failed to read the code lengths for "
387 "the first 256 elements of the main "
392 /* Read the path lengths for the remaining elements of the main
394 LZX_DEBUG("Reading path lengths for remaining elements of "
395 "main tree (%d elements).\n",
396 LZX_MAINTREE_NUM_SYMBOLS - LZX_NUM_CHARS);
397 ret = lzx_read_code_lens(istream,
398 tables->maintree_lens + LZX_NUM_CHARS,
399 LZX_MAINTREE_NUM_SYMBOLS - LZX_NUM_CHARS);
401 ERROR("Failed to read the path lengths for "
402 "the remaining elements of the main "
407 LZX_DEBUG("Building the Huffman decoding table for the main tree.\n");
409 ret = make_huffman_decode_table(tables->maintree_decode_table,
410 LZX_MAINTREE_NUM_SYMBOLS,
411 LZX_MAINTREE_TABLEBITS,
412 tables->maintree_lens,
413 LZX_MAX_CODEWORD_LEN);
415 ERROR("Failed to make the decode table for "
420 LZX_DEBUG("Reading path lengths for the length tree.\n");
421 ret = lzx_read_code_lens(istream, tables->lentree_lens,
422 LZX_LENTREE_NUM_SYMBOLS);
424 ERROR("Failed to read the path lengths "
425 "for the length tree!\n");
429 LZX_DEBUG("Building the length tree.\n");
430 ret = make_huffman_decode_table(tables->lentree_decode_table,
431 LZX_LENTREE_NUM_SYMBOLS,
432 LZX_LENTREE_TABLEBITS,
433 tables->lentree_lens,
434 LZX_MAX_CODEWORD_LEN);
436 ERROR("Failed to build the length Huffman "
443 case LZX_BLOCKTYPE_UNCOMPRESSED:
444 LZX_DEBUG("Found uncompressed block\n");
445 ret = align_input_bitstream(istream, true);
448 ret = bitstream_read_bytes(istream, sizeof(R), R);
451 array_to_le32(R, ARRAY_LEN(3));
457 LZX_DEBUG("Found invalid block\n");
460 *block_type_ret = block_type;
461 *block_size_ret = block_size;
466 * Decodes a compressed literal match value. It refers to some match_offset to
467 * a point earlier in the window, and some match_len, for which the data is to
468 * be copied to the current position in the window.
470 * @main_element: The start of the match data, as decoded using the main
472 * @block_type: The type of the block (LZX_BLOCKTYPE_ALIGNED or
473 * LZX_BLOCKTYPE_VERBATIM)
474 * @bytes_remaining: The amount of uncompressed data remaining to be
475 * uncompressed. It is an error if the match
476 * is longer than @bytes_remaining.
477 * @window: A pointer to the window into which the uncompressed
478 * data is being written.
479 * @window_pos: The current position in the window.
480 * @tables: Contains the Huffman tables for the block (main,
481 * length, and also aligned offset only for
482 * LZX_BLOCKTYPE_ALIGNED)
483 * @queue: The least-recently used queue for match offsets.
484 * @istream: The input bitstream.
486 * Returns the length of the match, or -1 on error (match would exceed
487 * the amount of data needing to be uncompressed, or match refers to data before
488 * the window, or the input bitstream ended unexpectedly).
490 static int lzx_decode_match(int main_element, int block_type,
491 int bytes_remaining, u8 *window, int window_pos,
492 const struct lzx_tables *tables,
493 struct lru_queue *queue,
494 struct input_bitstream *istream)
509 /* The main element is offset by 256 because values under 256 indicate a
511 main_element -= LZX_NUM_CHARS;
513 /* The length header consists of the lower 3 bits of the main element.
514 * The position slot is the rest of it. */
515 length_header = main_element & LZX_NUM_PRIMARY_LENS;
516 position_slot = main_element >> 3;
518 /* If the length_header is less than LZX_NUM_PRIMARY_LENS (= 7), it
519 * gives the match length as the offset from LZX_MIN_MATCH. Otherwise,
520 * the length is given by an additional symbol encoded using the length
521 * tree, offset by 9 (LZX_MIN_MATCH + LZX_NUM_PRIMARY_LENS) */
522 match_len = LZX_MIN_MATCH + length_header;
523 if (length_header == LZX_NUM_PRIMARY_LENS) {
524 ret = read_huffsym_using_lentree(istream, tables,
528 match_len += additional_len;
532 /* If the position_slot is 0, 1, or 2, the match offset is retrieved
533 * from the LRU queue. Otherwise, the match offset is not in the LRU
535 switch (position_slot) {
537 match_offset = queue->R0;
540 match_offset = queue->R1;
541 swap(queue->R0, queue->R1);
544 /* The queue doesn't work quite the same as a real LRU queue,
545 * since using the R2 offset doesn't bump the R1 offset down to
547 match_offset = queue->R2;
548 swap(queue->R0, queue->R2);
551 /* Otherwise, the offset was not encoded as one the offsets in
552 * the queue. Depending on the position slot, there is a
553 * certain number of extra bits that need to be read to fully
554 * decode the match offset. */
556 /* Look up the number of extra bits that need to be read. */
557 num_extra_bits = lzx_extra_bits[position_slot];
559 /* For aligned blocks, if there are at least 3 extra bits, the
560 * actual number of extra bits is 3 less, and they encode a
561 * number of 8-byte words that are added to the offset; there
562 * is then an additional symbol read using the aligned tree that
563 * specifies the actual byte alignment. */
564 if (block_type == LZX_BLOCKTYPE_ALIGNED && num_extra_bits >= 3) {
566 /* There is an error in the LZX "specification" at this
567 * point; it indicates that a Huffman symbol is to be
568 * read only if num_extra_bits is greater than 3, but
569 * actually it is if num_extra_bits is greater than or
570 * equal to 3. (Note that in the case with
571 * num_extra_bits == 3, the assignment to verbatim_bits
572 * will just set it to 0. ) */
573 ret = bitstream_read_bits(istream, num_extra_bits - 3,
580 ret = read_huffsym_using_alignedtree(istream, tables,
585 /* For non-aligned blocks, or for aligned blocks with
586 * less than 3 extra bits, the extra bits are added
587 * directly to the match offset, and the correction for
588 * the alignment is taken to be 0. */
589 ret = bitstream_read_bits(istream, num_extra_bits,
597 /* Calculate the match offset. */
598 match_offset = lzx_position_base[position_slot] + verbatim_bits +
601 /* Update the LRU queue. */
602 queue->R2 = queue->R1;
603 queue->R1 = queue->R0;
604 queue->R0 = match_offset;
608 /* Verify that the match is in the bounds of the part of the window
609 * currently in use, then copy the source of the match to the current
611 match_dest = window + window_pos;
612 match_src = match_dest - match_offset;
614 if (match_len > bytes_remaining) {
615 ERROR("Match of length %d bytes overflows uncompressed "
616 "block size!\n", match_len);
620 if (match_src < window) {
621 ERROR("Match of length %d bytes references data "
622 "before window (match_offset = %d, "
623 "window_pos = %d)\n", match_len,
624 match_offset, window_pos);
628 for (i = 0; i < match_len; i++)
629 match_dest[i] = match_src[i];
636 /* Undo the 'E8' preprocessing, where the targets of x86 CALL instructions were
637 * changed from relative offsets to absolute offsets. This type of
638 * preprocessing can be used on any binary data even if it is not actually
639 * machine code. It seems to always be used in WIM files, even though there is
640 * no bit to indicate that it actually is used, unlike in the LZX compressed
641 * format as used in other file formats, where a bit is reserved for that
643 static void undo_call_insn_preprocessing(u8 uncompressed_data[],
644 uint uncompressed_data_len)
647 int file_size = LZX_MAGIC_FILESIZE;
651 /* Not enabled in the last 6 bytes, which means the 5-byte call
652 * instruction cannot start in the last *10* bytes. */
653 while (i < uncompressed_data_len - 10) {
654 if (uncompressed_data[i] != 0xe8) {
658 abs_offset = to_le32(*(int32_t*)(uncompressed_data + i + 1));
660 if (abs_offset >= -i && abs_offset < file_size) {
661 if (abs_offset >= 0) {
662 /* "good translation" */
663 rel_offset = abs_offset - i;
665 /* "compensating translation" */
666 rel_offset = abs_offset + file_size;
668 *(int32_t*)(uncompressed_data + i + 1) =
676 * Decompresses a compressed block of data from which the header has already
679 * @block_type: The type of the block (LZX_BLOCKTYPE_VERBATIM or
680 * LZX_BLOCKTYPE_ALIGNED)
681 * @block_size: The size of the block, in bytes.
682 * @window: Pointer to the decompression window.
683 * @window_pos: The current position in the window. Will be 0 for the first
685 * @tables: The Huffman decoding tables for the block (main, length, and
686 * aligned offset, the latter only for LZX_BLOCKTYPE_ALIGNED)
687 * @queue: The least-recently-used queue for match offsets.
688 * @istream: The input bitstream for the compressed literals.
690 static int lzx_decompress_block(int block_type, int block_size, u8 *window,
692 const struct lzx_tables *tables,
693 struct lru_queue *queue,
694 struct input_bitstream *istream)
696 uint bytes_remaining;
701 bytes_remaining = block_size;
702 while (bytes_remaining > 0) {
704 ret = read_huffsym_using_maintree(istream, tables,
709 if (main_element < LZX_NUM_CHARS) {
710 /* literal: 0 to LZX_NUM_CHARS - 1 */
711 window[window_pos + block_size - bytes_remaining] =
715 /* match: LZX_NUM_CHARS to LZX_MAINTREE_NUM_SYMBOLS - 1 */
716 match_len = lzx_decode_match(main_element,
717 block_type, bytes_remaining, window,
718 block_size + window_pos -
720 tables, queue, istream);
724 bytes_remaining -= match_len;
731 * Decompresses a block of LZX-compressed data using a window size of 32768.
733 * @compressed_data: A pointer to the compressed data.
734 * @compressed_len: The length of the compressed data, in bytes.
735 * @uncompressed_data: A pointer to the buffer into which to write the
737 * @uncompressed_len: The length of the uncompressed data.
739 * Return non-zero on failure.
741 int lzx_decompress(const void *compressed_data, uint compressed_len,
742 void *uncompressed_data, uint uncompressed_len)
744 struct lzx_tables tables;
745 struct input_bitstream istream;
746 struct lru_queue queue;
747 uint bytes_remaining;
752 LZX_DEBUG("lzx_decompress (compressed_data = %p, compressed_len = %d, "
753 "uncompressed_data = %p, uncompressed_len = %d)\n",
754 compressed_data, compressed_len, uncompressed_data,
757 wimlib_assert(uncompressed_len <= 32768);
759 memset(tables.maintree_lens, 0, sizeof(tables.maintree_lens));
760 memset(tables.lentree_lens, 0, sizeof(tables.lentree_lens));
764 bytes_remaining = uncompressed_len;
766 init_input_bitstream(&istream, compressed_data, compressed_len);
768 /* The compressed data will consist of one or more blocks. The
769 * following loop decompresses one block, and it runs until there all
770 * the compressed data has been decompressed, so there are no more
773 while (bytes_remaining != 0) {
775 LZX_DEBUG("Reading block header.\n");
776 ret = lzx_read_block_header(&istream, &block_size, &block_type,
781 LZX_DEBUG("block_size = %d, bytes_remaining = %d\n",
782 block_size, bytes_remaining);
784 if (block_size > bytes_remaining) {
785 ERROR("Expected a block size of at most %d "
786 "bytes (found %d bytes)!\n",
787 bytes_remaining, block_size);
791 if (block_type == LZX_BLOCKTYPE_VERBATIM ||
792 block_type == LZX_BLOCKTYPE_ALIGNED) {
793 if (block_type == LZX_BLOCKTYPE_VERBATIM)
794 LZX_DEBUG("LZX_BLOCKTYPE_VERBATIM\n");
796 LZX_DEBUG("LZX_BLOCKTYPE_ALIGNED\n");
798 ret = lzx_decompress_block(block_type,
799 block_size, uncompressed_data,
800 uncompressed_len - bytes_remaining,
801 &tables, &queue, &istream);
804 } else if (block_type == LZX_BLOCKTYPE_UNCOMPRESSED) {
805 LZX_DEBUG("LZX_BLOCKTYPE_UNCOMPRESSED\n");
806 ret = bitstream_read_bytes(&istream, block_size,
813 align_input_bitstream(&istream, false);
815 ERROR("Unrecognized block type!\n");
819 bytes_remaining -= block_size;
821 if (bytes_remaining != 0)
822 LZX_DEBUG("%d bytes remaining\n", bytes_remaining);
826 if (uncompressed_len >= 10)
827 undo_call_insn_preprocessing(uncompressed_data, uncompressed_len);