2 * LZO1X Decompressor from MiniLZO
4 * Copyright (C) 1996-2005 Markus F.X.J. Oberhumer <markus@oberhumer.com>
6 * The full LZO package can be found at:
7 * http://www.oberhumer.com/opensource/lzo/
9 * Changed for kernel use by:
10 * Nitin Gupta <nitingupta910@gmail.com>
11 * Richard Purdie <rpurdie@openedhand.com>
15 #include <linux/lzo.h>
16 #include <asm/byteorder.h>
17 #include <asm/unaligned.h>
20 #define HAVE_IP(x, ip_end, ip) ((size_t)(ip_end - ip) < (x))
21 #define HAVE_OP(x, op_end, op) ((size_t)(op_end - op) < (x))
22 #define HAVE_LB(m_pos, out, op) (m_pos < out || m_pos >= op)
24 #define COPY4(dst, src) \
25 put_unaligned(get_unaligned((const u32 *)(src)), (u32 *)(dst))
27 static const unsigned char lzop_magic[] = {
28 0x89, 0x4c, 0x5a, 0x4f, 0x00, 0x0d, 0x0a, 0x1a, 0x0a
31 #define HEADER_HAS_FILTER 0x00000800L
33 static inline const unsigned char *parse_header(const unsigned char *src)
38 /* read magic: 9 first bytes */
39 for (i = 0; i < ARRAY_SIZE(lzop_magic); i++) {
40 if (*src++ != lzop_magic[i])
43 /* get version (2bytes), skip library version (2),
44 * 'need to be extracted' version (2) and
46 version = get_unaligned_be16(src);
48 if (version >= 0x0940)
50 if (get_unaligned_be32(src) & HEADER_HAS_FILTER)
51 src += 4; /* filter info */
53 /* skip flags, mode and mtime_low */
55 if (version >= 0x0940)
56 src += 4; /* skip mtime_high */
59 /* don't care about the file name, and skip checksum */
65 int lzop_decompress(const unsigned char *src, size_t src_len,
66 unsigned char *dst, size_t *dst_len)
68 unsigned char *start = dst;
69 const unsigned char *send = src + src_len;
74 src = parse_header(src);
79 /* read uncompressed block size */
80 dlen = get_unaligned_be32(src);
83 /* exit if last block */
85 *dst_len = dst - start;
89 /* read compressed block size, and skip block checksum info */
90 slen = get_unaligned_be32(src);
93 if (slen <= 0 || slen > dlen)
98 r = lzo1x_decompress_safe((u8 *) src, slen, dst, &tmp);
110 return LZO_E_INPUT_OVERRUN;
113 int lzo1x_decompress_safe(const unsigned char *in, size_t in_len,
114 unsigned char *out, size_t *out_len)
116 const unsigned char * const ip_end = in + in_len;
117 unsigned char * const op_end = out + *out_len;
118 const unsigned char *ip = in, *m_pos;
119 unsigned char *op = out;
128 if (HAVE_OP(t, op_end, op))
130 if (HAVE_IP(t + 1, ip_end, ip))
135 goto first_literal_run;
138 while ((ip < ip_end)) {
143 if (HAVE_IP(1, ip_end, ip))
148 if (HAVE_IP(1, ip_end, ip))
153 if (HAVE_OP(t + 3, op_end, op))
155 if (HAVE_IP(t + 4, ip_end, ip))
185 m_pos = op - (1 + M2_MAX_OFFSET);
189 if (HAVE_LB(m_pos, out, op))
190 goto lookbehind_overrun;
192 if (HAVE_OP(3, op_end, op))
204 m_pos -= (t >> 2) & 7;
207 if (HAVE_LB(m_pos, out, op))
208 goto lookbehind_overrun;
209 if (HAVE_OP(t + 3 - 1, op_end, op))
212 } else if (t >= 32) {
215 if (HAVE_IP(1, ip_end, ip))
220 if (HAVE_IP(1, ip_end, ip))
226 m_pos -= get_unaligned_le16(ip) >> 2;
228 } else if (t >= 16) {
230 m_pos -= (t & 8) << 11;
234 if (HAVE_IP(1, ip_end, ip))
239 if (HAVE_IP(1, ip_end, ip))
244 m_pos -= get_unaligned_le16(ip) >> 2;
254 if (HAVE_LB(m_pos, out, op))
255 goto lookbehind_overrun;
256 if (HAVE_OP(2, op_end, op))
264 if (HAVE_LB(m_pos, out, op))
265 goto lookbehind_overrun;
266 if (HAVE_OP(t + 3 - 1, op_end, op))
269 if (t >= 2 * 4 - (3 - 1) && (op - m_pos) >= 4) {
297 if (HAVE_OP(t, op_end, op))
299 if (HAVE_IP(t + 1, ip_end, ip))
310 } while (ip < ip_end);
314 return LZO_E_EOF_NOT_FOUND;
318 return (ip == ip_end ? LZO_E_OK :
319 (ip < ip_end ? LZO_E_INPUT_NOT_CONSUMED : LZO_E_INPUT_OVERRUN));
322 return LZO_E_INPUT_OVERRUN;
326 return LZO_E_OUTPUT_OVERRUN;
330 return LZO_E_LOOKBEHIND_OVERRUN;