| … | |
… | |
| 75 | asm ("rep movsb" \ |
75 | asm ("rep movsb" \ |
| 76 | : "=D" (dst), "=S" (src), "=c" (len) \ |
76 | : "=D" (dst), "=S" (src), "=c" (len) \ |
| 77 | : "0" (dst), "1" (src), "2" (len)); |
77 | : "0" (dst), "1" (src), "2" (len)); |
| 78 | #endif |
78 | #endif |
| 79 | |
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) |
|
|
90 | |
| 80 | /* |
91 | /* |
| 81 | * compressed format |
92 | * compressed format |
| 82 | * |
93 | * |
| 83 | * 000LLLLL <L+1> ; literal |
94 | * 000LLLLL <L+1> ; literal |
| 84 | * LLLooooo oooooooo ; backref L |
95 | * LLLooooo oooooooo ; backref L |
| … | |
… | |
| 116 | # endif |
127 | # endif |
| 117 | #endif |
128 | #endif |
| 118 | |
129 | |
| 119 | for (;;) |
130 | for (;;) |
| 120 | { |
131 | { |
| 121 | if (ip < in_end - 2) |
132 | if (expect_true (ip < in_end - 2)) |
| 122 | { |
133 | { |
| 123 | hval = NEXT (hval, ip); |
134 | hval = NEXT (hval, ip); |
| 124 | hslot = htab + IDX (hval); |
135 | hslot = htab + IDX (hval); |
| 125 | ref = *hslot; *hslot = ip; |
136 | ref = *hslot; *hslot = ip; |
| 126 | |
137 | |
| … | |
… | |
| 144 | /* match found at *ref++ */ |
155 | /* match found at *ref++ */ |
| 145 | unsigned int len = 2; |
156 | unsigned int len = 2; |
| 146 | unsigned int maxlen = in_end - ip - len; |
157 | unsigned int maxlen = in_end - ip - len; |
| 147 | maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
158 | maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
| 148 | |
159 | |
| 149 | if (op + lit + 1 + 3 >= out_end) |
160 | if (expect_false (op + lit + 1 + 3 >= out_end)) |
| 150 | return 0; |
161 | return 0; |
| 151 | |
|
|
| 152 | do |
|
|
| 153 | len++; |
|
|
| 154 | while (len < maxlen && ref[len] == ip[len]); |
|
|
| 155 | |
162 | |
| 156 | if (lit) |
163 | if (lit) |
| 157 | { |
164 | { |
| 158 | *op++ = lit - 1; |
165 | *op++ = lit - 1; |
| 159 | lit = -lit; |
166 | lit = -lit; |
| 160 | do |
167 | do |
| 161 | *op++ = ip[lit]; |
168 | *op++ = ip[lit]; |
| 162 | while (++lit); |
169 | while (++lit); |
| 163 | } |
170 | } |
| 164 | |
171 | |
|
|
172 | for (;;) |
|
|
173 | { |
|
|
174 | if (expect_true (ip < in_end - 2 - 8 && maxlen > 8)) |
|
|
175 | { |
|
|
176 | len++; if (ref [len] != ip [len]) break; |
|
|
177 | len++; if (ref [len] != ip [len]) break; |
|
|
178 | len++; if (ref [len] != ip [len]) break; |
|
|
179 | len++; if (ref [len] != ip [len]) break; |
|
|
180 | len++; if (ref [len] != ip [len]) break; |
|
|
181 | len++; if (ref [len] != ip [len]) break; |
|
|
182 | len++; if (ref [len] != ip [len]) break; |
|
|
183 | len++; if (ref [len] != ip [len]) break; |
|
|
184 | } |
|
|
185 | |
|
|
186 | do |
|
|
187 | len++; |
|
|
188 | while (len < maxlen && ref[len] == ip[len]); |
|
|
189 | |
|
|
190 | break; |
|
|
191 | } |
|
|
192 | |
| 165 | len -= 2; |
193 | len -= 2; |
| 166 | ip++; |
194 | ip++; |
| 167 | |
195 | |
| 168 | if (len < 7) |
196 | if (len < 7) |
| 169 | { |
197 | { |
| … | |
… | |
| 203 | while (len--); |
231 | while (len--); |
| 204 | #endif |
232 | #endif |
| 205 | continue; |
233 | continue; |
| 206 | } |
234 | } |
| 207 | } |
235 | } |
| 208 | else if (ip == in_end) |
236 | else if (expect_false (ip == in_end)) |
| 209 | break; |
237 | break; |
| 210 | |
238 | |
| 211 | /* one more literal byte we must copy */ |
239 | /* one more literal byte we must copy */ |
| 212 | lit++; |
240 | lit++; |
| 213 | ip++; |
241 | ip++; |
| 214 | |
242 | |
| 215 | if (lit == MAX_LIT) |
243 | if (expect_false (lit == MAX_LIT)) |
| 216 | { |
244 | { |
| 217 | if (op + 1 + MAX_LIT >= out_end) |
245 | if (op + 1 + MAX_LIT >= out_end) |
| 218 | return 0; |
246 | return 0; |
| 219 | |
247 | |
| 220 | *op++ = MAX_LIT - 1; |
248 | *op++ = MAX_LIT - 1; |
