ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/liblzf/lzf_d.c
(Generate patch)

Comparing liblzf/lzf_d.c (file contents):
Revision 1.6 by root, Fri Jul 7 15:34:11 2006 UTC vs.
Revision 1.16 by root, Mon Feb 23 23:46:10 2015 UTC

1/* 1/*
2 * Copyright (c) 2000-2005 Marc Alexander Lehmann <schmorp@schmorp.de> 2 * Copyright (c) 2000-2010 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 * 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,
… …
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#if AVOID_ERRNO 39#if AVOID_ERRNO
… …
43#else 41#else
44# include <errno.h> 42# include <errno.h>
45# define SET_ERRNO(n) errno = (n) 43# define SET_ERRNO(n) errno = (n)
46#endif 44#endif
47 45
46#if USE_REP_MOVSB /* small win on amd, big loss on intel */
47#if (__i386 || __amd64) && __GNUC__ >= 3
48# define lzf_movsb(dst, src, len) \
49 asm ("rep movsb" \
50 : "=D" (dst), "=S" (src), "=c" (len) \
51 : "0" (dst), "1" (src), "2" (len));
52#endif
53#endif
54
48unsigned int 55unsigned int
49lzf_decompress (const void *const in_data, unsigned int in_len, 56lzf_decompress (const void *const in_data, unsigned int in_len,
50 void *out_data, unsigned int out_len) 57 void *out_data, unsigned int out_len)
51{ 58{
52 u8 const *ip = (const u8 *)in_data; 59 u8 const *ip = (const u8 *)in_data;
53 u8 *op = (u8 *)out_data; 60 u8 *op = (u8 *)out_data;
… …
74 SET_ERRNO (EINVAL); 81 SET_ERRNO (EINVAL);
75 return 0; 82 return 0;
76 } 83 }
77#endif 84#endif
78 85
79#if USE_MEMCPY 86#ifdef lzf_movsb
80 memcpy (op, ip, ctrl); 87 lzf_movsb (op, ip, ctrl);
81 op += ctrl; 88#elif OPTIMISE_SIZE
82 ip += ctrl; 89 while (ctrl--)
90 *op++ = *ip++;
83#else 91#else
92 switch (ctrl)
84 do 93 {
85 *op++ = *ip++; 94 case 32: *op++ = *ip++; case 31: *op++ = *ip++; case 30: *op++ = *ip++; case 29: *op++ = *ip++;
86 while (--ctrl); 95 case 28: *op++ = *ip++; case 27: *op++ = *ip++; case 26: *op++ = *ip++; case 25: *op++ = *ip++;
96 case 24: *op++ = *ip++; case 23: *op++ = *ip++; case 22: *op++ = *ip++; case 21: *op++ = *ip++;
97 case 20: *op++ = *ip++; case 19: *op++ = *ip++; case 18: *op++ = *ip++; case 17: *op++ = *ip++;
98 case 16: *op++ = *ip++; case 15: *op++ = *ip++; case 14: *op++ = *ip++; case 13: *op++ = *ip++;
99 case 12: *op++ = *ip++; case 11: *op++ = *ip++; case 10: *op++ = *ip++; case 9: *op++ = *ip++;
100 case 8: *op++ = *ip++; case 7: *op++ = *ip++; case 6: *op++ = *ip++; case 5: *op++ = *ip++;
101 case 4: *op++ = *ip++; case 3: *op++ = *ip++; case 2: *op++ = *ip++; case 1: *op++ = *ip++;
102 }
87#endif 103#endif
88 } 104 }
89 else /* back reference */ 105 else /* back reference */
90 { 106 {
91 unsigned int len = ctrl >> 5; 107 unsigned int len = ctrl >> 5;
… …
123 { 139 {
124 SET_ERRNO (EINVAL); 140 SET_ERRNO (EINVAL);
125 return 0; 141 return 0;
126 } 142 }
127 143
128 *op++ = *ref++; 144#ifdef lzf_movsb
129 *op++ = *ref++; 145 len += 2;
146 lzf_movsb (op, ref, len);
147#elif OPTIMISE_SIZE
148 len += 2;
130 149
131 do 150 do
132 *op++ = *ref++; 151 *op++ = *ref++;
133 while (--len); 152 while (--len);
153#else
154 switch (len)
155 {
156 default:
157 len += 2;
158
159 if (op >= ref + len)
160 {
161 /* disjunct areas */
162 memcpy (op, ref, len);
163 op += len;
164 }
165 else
166 {
167 /* overlapping, use octet by octet copying */
168 do
169 *op++ = *ref++;
170 while (--len);
171 }
172
173 break;
174
175 case 9: *op++ = *ref++;
176 case 8: *op++ = *ref++;
177 case 7: *op++ = *ref++;
178 case 6: *op++ = *ref++;
179 case 5: *op++ = *ref++;
180 case 4: *op++ = *ref++;
181 case 3: *op++ = *ref++;
182 case 2: *op++ = *ref++;
183 case 1: *op++ = *ref++;
184 case 0: *op++ = *ref++; /* two octets more */
185 *op++ = *ref++;
186 }
187#endif
134 } 188 }
135 } 189 }
136 while (ip < in_end); 190 while (ip < in_end);
137 191
138 return op - (u8 *)out_data; 192 return op - (u8 *)out_data;

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines