1 | /* |
1 | /* |
2 | * Copyright (c) 2000-2005 Marc Alexander Lehmann <schmorp@schmorp.de> |
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, |
8 | * this list of conditions and the following disclaimer. |
8 | * this list of conditions and the following disclaimer. |
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 | * |
|
|
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 | * |
13 | * |
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- |
… | |
… | |
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. |
27 | * |
24 | * |
28 | * Alternatively, the contents of this file may be used under the terms of |
25 | * Alternatively, the contents of this file may be used under the terms of |
29 | * the GNU General Public License version 2 (the "GPL"), in which case the |
26 | * the GNU General Public License ("GPL") version 2 or any later version, |
30 | * provisions of the GPL are applicable instead of the above. If you wish to |
27 | * in which case the provisions of the GPL are applicable instead of |
31 | * allow the use of your version of this file only under the terms of the |
28 | * the above. If you wish to allow the use of your version of this file |
32 | * GPL and not to allow others to use your version of this file under the |
29 | * only under the terms of the GPL and not to allow others to use your |
33 | * BSD license, indicate your decision by deleting the provisions above and |
30 | * version of this file under the BSD license, indicate your decision |
34 | * replace them with the notice and other provisions required by the GPL. If |
31 | * by deleting the provisions above and replace them with the notice |
35 | * you do not delete the provisions above, a recipient may use your version |
32 | * and other provisions required by the GPL. If you do not delete the |
|
|
33 | * provisions above, a recipient may use your version of this file under |
36 | * of this file under either the BSD or the GPL. |
34 | * either the BSD or the GPL. |
37 | */ |
35 | */ |
38 | |
36 | |
39 | #include "lzfP.h" |
37 | #include "lzfP.h" |
40 | |
38 | |
41 | #define HSIZE (1 << (HLOG)) |
39 | #define HSIZE (1 << (HLOG)) |
… | |
… | |
76 | # define lzf_movsb(dst, src, len) \ |
74 | # define lzf_movsb(dst, src, len) \ |
77 | asm ("rep movsb" \ |
75 | asm ("rep movsb" \ |
78 | : "=D" (dst), "=S" (src), "=c" (len) \ |
76 | : "=D" (dst), "=S" (src), "=c" (len) \ |
79 | : "0" (dst), "1" (src), "2" (len)); |
77 | : "0" (dst), "1" (src), "2" (len)); |
80 | #endif |
78 | #endif |
|
|
79 | |
|
|
80 | #if __GNUC__ >= 3 |
|
|
81 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
82 | # define inline inline |
|
|
83 | #else |
|
|
84 | # define expect(expr,value) (expr) |
|
|
85 | # define inline static |
|
|
86 | #endif |
|
|
87 | |
|
|
88 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
89 | #define expect_true(expr) expect ((expr) != 0, 1) |
81 | |
90 | |
82 | /* |
91 | /* |
83 | * compressed format |
92 | * compressed format |
84 | * |
93 | * |
85 | * 000LLLLL <L+1> ; literal |
94 | * 000LLLLL <L+1> ; literal |
… | |
… | |
118 | # endif |
127 | # endif |
119 | #endif |
128 | #endif |
120 | |
129 | |
121 | for (;;) |
130 | for (;;) |
122 | { |
131 | { |
123 | if (ip < in_end - 2) |
132 | if (expect_true (ip < in_end - 2)) |
124 | { |
133 | { |
125 | hval = NEXT (hval, ip); |
134 | hval = NEXT (hval, ip); |
126 | hslot = htab + IDX (hval); |
135 | hslot = htab + IDX (hval); |
127 | ref = *hslot; *hslot = ip; |
136 | ref = *hslot; *hslot = ip; |
128 | |
137 | |
… | |
… | |
146 | /* match found at *ref++ */ |
155 | /* match found at *ref++ */ |
147 | unsigned int len = 2; |
156 | unsigned int len = 2; |
148 | unsigned int maxlen = in_end - ip - len; |
157 | unsigned int maxlen = in_end - ip - len; |
149 | maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
158 | maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
150 | |
159 | |
151 | if (op + lit + 1 + 3 >= out_end) |
160 | if (expect_false (op + lit + 1 + 3 >= out_end)) |
152 | return 0; |
161 | return 0; |
153 | |
162 | |
154 | do |
163 | do |
155 | len++; |
164 | len++; |
156 | while (len < maxlen && ref[len] == ip[len]); |
165 | while (len < maxlen && ref[len] == ip[len]); |
… | |
… | |
205 | while (len--); |
214 | while (len--); |
206 | #endif |
215 | #endif |
207 | continue; |
216 | continue; |
208 | } |
217 | } |
209 | } |
218 | } |
210 | else if (ip == in_end) |
219 | else if (expect_false (ip == in_end)) |
211 | break; |
220 | break; |
212 | |
221 | |
213 | /* one more literal byte we must copy */ |
222 | /* one more literal byte we must copy */ |
214 | lit++; |
223 | lit++; |
215 | ip++; |
224 | ip++; |
216 | |
225 | |
217 | if (lit == MAX_LIT) |
226 | if (expect_false (lit == MAX_LIT)) |
218 | { |
227 | { |
219 | if (op + 1 + MAX_LIT >= out_end) |
228 | if (op + 1 + MAX_LIT >= out_end) |
220 | return 0; |
229 | return 0; |
221 | |
230 | |
222 | *op++ = MAX_LIT - 1; |
231 | *op++ = MAX_LIT - 1; |