1 | /* |
1 | /* |
2 | * Copyright (c) 2000-2002 Marc Alexander Lehmann <pcg@goof.com> |
2 | * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de> |
3 | * |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without modifica- |
4 | * Redistribution and use in source and binary forms, with or without modifica- |
5 | * tion, are permitted provided that the following conditions are met: |
5 | * tion, are permitted provided that the following conditions are met: |
6 | * |
6 | * |
7 | * 1. Redistributions of source code must retain the above copyright notice, |
7 | * 1. Redistributions of source code must retain the above copyright notice, |
… | |
… | |
9 | * |
9 | * |
10 | * 2. Redistributions in binary form must reproduce the above copyright |
10 | * 2. Redistributions in binary form must reproduce the above copyright |
11 | * notice, this list of conditions and the following disclaimer in the |
11 | * notice, this list of conditions and the following disclaimer in the |
12 | * documentation and/or other materials provided with the distribution. |
12 | * documentation and/or other materials provided with the distribution. |
13 | * |
13 | * |
14 | * 3. The name of the author may not be used to endorse or promote products |
|
|
15 | * derived from this software without specific prior written permission. |
|
|
16 | * |
|
|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
14 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
15 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
16 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
17 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
18 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
22 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
23 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
20 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
24 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
21 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
25 | * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
22 | * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
26 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
23 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
24 | * |
|
|
25 | * Alternatively, the contents of this file may be used under the terms of |
|
|
26 | * the GNU General Public License version 2 (the "GPL"), in which case the |
|
|
27 | * provisions of the GPL are applicable instead of the above. If you wish to |
|
|
28 | * allow the use of your version of this file only under the terms of the |
|
|
29 | * GPL and not to allow others to use your version of this file under the |
|
|
30 | * BSD license, indicate your decision by deleting the provisions above and |
|
|
31 | * replace them with the notice and other provisions required by the GPL. If |
|
|
32 | * you do not delete the provisions above, a recipient may use your version |
|
|
33 | * of this file under either the BSD or the GPL. |
27 | */ |
34 | */ |
28 | |
35 | |
29 | #include <errno.h> |
36 | #include "lzfP.h" |
30 | |
37 | |
31 | #include "lzfP.h" |
38 | #if AVOID_ERRNO |
|
|
39 | # define SET_ERRNO(n) |
|
|
40 | #else |
|
|
41 | # include <errno.h> |
|
|
42 | # define SET_ERRNO(n) errno = (n) |
|
|
43 | #endif |
|
|
44 | |
|
|
45 | #if (__i386 || __amd64) && __GNUC__ >= 3 |
|
|
46 | # define lzf_movsb(dst, src, len) \ |
|
|
47 | asm ("rep movsb" \ |
|
|
48 | : "=D" (dst), "=S" (src), "=c" (len) \ |
|
|
49 | : "0" (dst), "1" (src), "2" (len)); |
|
|
50 | #endif |
32 | |
51 | |
33 | unsigned int |
52 | unsigned int |
34 | lzf_decompress (const void *const in_data, unsigned int in_len, |
53 | lzf_decompress (const void *const in_data, unsigned int in_len, |
35 | void *out_data, unsigned int out_len) |
54 | void *out_data, unsigned int out_len) |
36 | { |
55 | { |
37 | u8 const *ip = in_data; |
56 | u8 const *ip = (const u8 *)in_data; |
38 | u8 *op = out_data; |
57 | u8 *op = (u8 *)out_data; |
39 | u8 const *const in_end = ip + in_len; |
58 | u8 const *const in_end = ip + in_len; |
40 | u8 *const out_end = op + out_len; |
59 | u8 *const out_end = op + out_len; |
41 | |
60 | |
42 | do |
61 | do |
43 | { |
62 | { |
… | |
… | |
47 | { |
66 | { |
48 | ctrl++; |
67 | ctrl++; |
49 | |
68 | |
50 | if (op + ctrl > out_end) |
69 | if (op + ctrl > out_end) |
51 | { |
70 | { |
52 | errno = E2BIG; |
71 | SET_ERRNO (E2BIG); |
53 | return 0; |
72 | return 0; |
54 | } |
73 | } |
55 | |
74 | |
56 | #if USE_MEMCPY |
75 | #if CHECK_INPUT |
|
|
76 | if (ip + ctrl > in_end) |
|
|
77 | { |
|
|
78 | SET_ERRNO (EINVAL); |
|
|
79 | return 0; |
|
|
80 | } |
|
|
81 | #endif |
|
|
82 | |
|
|
83 | #ifdef lzf_movsb |
57 | memcpy (op, ip, ctrl); |
84 | lzf_movsb (op, ip, ctrl); |
58 | op += ctrl; |
|
|
59 | ip += ctrl; |
|
|
60 | #else |
85 | #else |
61 | do |
86 | do |
62 | *op++ = *ip++; |
87 | *op++ = *ip++; |
63 | while (--ctrl); |
88 | while (--ctrl); |
64 | #endif |
89 | #endif |
… | |
… | |
67 | { |
92 | { |
68 | unsigned int len = ctrl >> 5; |
93 | unsigned int len = ctrl >> 5; |
69 | |
94 | |
70 | u8 *ref = op - ((ctrl & 0x1f) << 8) - 1; |
95 | u8 *ref = op - ((ctrl & 0x1f) << 8) - 1; |
71 | |
96 | |
|
|
97 | #if CHECK_INPUT |
|
|
98 | if (ip >= in_end) |
|
|
99 | { |
|
|
100 | SET_ERRNO (EINVAL); |
|
|
101 | return 0; |
|
|
102 | } |
|
|
103 | #endif |
72 | if (len == 7) |
104 | if (len == 7) |
|
|
105 | { |
73 | len += *ip++; |
106 | len += *ip++; |
|
|
107 | #if CHECK_INPUT |
|
|
108 | if (ip >= in_end) |
|
|
109 | { |
|
|
110 | SET_ERRNO (EINVAL); |
|
|
111 | return 0; |
|
|
112 | } |
|
|
113 | #endif |
74 | |
114 | } |
|
|
115 | |
75 | ref -= *ip++; |
116 | ref -= *ip++; |
76 | |
117 | |
77 | if (op + len + 2 > out_end) |
118 | if (op + len + 2 > out_end) |
78 | { |
119 | { |
79 | errno = E2BIG; |
120 | SET_ERRNO (E2BIG); |
80 | return 0; |
121 | return 0; |
81 | } |
122 | } |
82 | |
123 | |
83 | if (ref < (u8 *)out_data) |
124 | if (ref < (u8 *)out_data) |
84 | { |
125 | { |
85 | errno = EINVAL; |
126 | SET_ERRNO (EINVAL); |
86 | return 0; |
127 | return 0; |
87 | } |
128 | } |
88 | |
129 | |
|
|
130 | #ifdef lzf_movsb |
|
|
131 | len += 2; |
|
|
132 | lzf_movsb (op, ref, len); |
|
|
133 | #else |
89 | *op++ = *ref++; |
134 | *op++ = *ref++; |
90 | *op++ = *ref++; |
135 | *op++ = *ref++; |
91 | |
136 | |
92 | do |
137 | do |
93 | *op++ = *ref++; |
138 | *op++ = *ref++; |
94 | while (--len); |
139 | while (--len); |
|
|
140 | #endif |
95 | } |
141 | } |
96 | } |
142 | } |
97 | while (op < out_end && ip < in_end); |
143 | while (ip < in_end); |
98 | |
144 | |
99 | return op - (u8 *)out_data; |
145 | return op - (u8 *)out_data; |
100 | } |
146 | } |
101 | |
147 | |