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.9 by root, Mon Nov 5 23:28:40 2007 UTC vs.
Revision 1.16 by root, Mon Feb 23 23:46:10 2015 UTC

1/* 1/*
2 * Copyright (c) 2000-2007 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 * 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
15 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- 15 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
16 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO 16 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
17 * 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-
18 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 18 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
… …
41#else 41#else
42# include <errno.h> 42# include <errno.h>
43# define SET_ERRNO(n) errno = (n) 43# define SET_ERRNO(n) errno = (n)
44#endif 44#endif
45 45
46#if USE_REP_MOVSB /* small win on amd, big loss on intel */
46#if (__i386 || __amd64) && __GNUC__ >= 3 47#if (__i386 || __amd64) && __GNUC__ >= 3
47# define lzf_movsb(dst, src, len) \ 48# define lzf_movsb(dst, src, len) \
48 asm ("rep movsb" \ 49 asm ("rep movsb" \
49 : "=D" (dst), "=S" (src), "=c" (len) \ 50 : "=D" (dst), "=S" (src), "=c" (len) \
50 : "0" (dst), "1" (src), "2" (len)); 51 : "0" (dst), "1" (src), "2" (len));
51#endif 52#endif
53#endif
52 54
53unsigned int 55unsigned int
54lzf_decompress (const void *const in_data, unsigned int in_len, 56lzf_decompress (const void *const in_data, unsigned int in_len,
55 void *out_data, unsigned int out_len) 57 void *out_data, unsigned int out_len)
56{ 58{
57 u8 const *ip = (const u8 *)in_data; 59 u8 const *ip = (const u8 *)in_data;
58 u8 *op = (u8 *)out_data; 60 u8 *op = (u8 *)out_data;
… …
81 } 83 }
82#endif 84#endif
83 85
84#ifdef lzf_movsb 86#ifdef lzf_movsb
85 lzf_movsb (op, ip, ctrl); 87 lzf_movsb (op, ip, ctrl);
88#elif OPTIMISE_SIZE
89 while (ctrl--)
90 *op++ = *ip++;
86#else 91#else
92 switch (ctrl)
87 do 93 {
88 *op++ = *ip++; 94 case 32: *op++ = *ip++; case 31: *op++ = *ip++; case 30: *op++ = *ip++; case 29: *op++ = *ip++;
89 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 }
90#endif 103#endif
91 } 104 }
92 else /* back reference */ 105 else /* back reference */
93 { 106 {
94 unsigned int len = ctrl >> 5; 107 unsigned int len = ctrl >> 5;
… …
129 } 142 }
130 143
131#ifdef lzf_movsb 144#ifdef lzf_movsb
132 len += 2; 145 len += 2;
133 lzf_movsb (op, ref, len); 146 lzf_movsb (op, ref, len);
134#else 147#elif OPTIMISE_SIZE
135 *op++ = *ref++; 148 len += 2;
136 *op++ = *ref++;
137 149
138 do 150 do
139 *op++ = *ref++; 151 *op++ = *ref++;
140 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 }
141#endif 187#endif
142 } 188 }
143 } 189 }
144 while (ip < in_end); 190 while (ip < in_end);
145 191

Diff Legend

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