blob: 2cfcd9b7d3d9f1980602c23c606c3776bda4bab1 [file] [log] [blame]
"Robert P. J. Day"63fc1a92006-07-02 19:47:05 +00001/* vi: set sw=4 ts=4: */
Rob Landleyc1d69902006-01-20 18:28:50 +00002/*
3 * Small lzma deflate implementation.
4 * Copyright (C) 2006 Aurelien Jacobs <aurel@gnuage.org>
5 *
6 * Based on LzmaDecode.c from the LZMA SDK 4.22 (http://www.7-zip.org/)
7 * Copyright (C) 1999-2005 Igor Pavlov
8 *
Rob Landleyb13fee42006-06-20 22:38:00 +00009 * Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
Rob Landleyc1d69902006-01-20 18:28:50 +000010 */
11
Rob Landleyc1d69902006-01-20 18:28:50 +000012#include "libbb.h"
Bernhard Reutner-Fischercfb53df2006-04-02 21:50:01 +000013#include "unarchive.h"
14
Denis Vlasenkoe3241842007-08-13 10:36:25 +000015#if ENABLE_FEATURE_LZMA_FAST
Denis Vlasenko3ad5d0c2007-06-12 20:54:54 +000016# define speed_inline ALWAYS_INLINE
Rob Landleyb13fee42006-06-20 22:38:00 +000017#else
18# define speed_inline
19#endif
20
21
22typedef struct {
23 int fd;
24 uint8_t *ptr;
Denis Vlasenko33762982007-01-05 14:04:47 +000025
26/* Was keeping rc on stack in unlzma and separately allocating buffer,
27 * but with "buffer 'attached to' allocated rc" code is smaller: */
28 /* uint8_t *buffer; */
29#define RC_BUFFER ((uint8_t*)(rc+1))
30
Rob Landleyb13fee42006-06-20 22:38:00 +000031 uint8_t *buffer_end;
Denis Vlasenko33762982007-01-05 14:04:47 +000032
33/* Had provisions for variable buffer, but we don't need it here */
34 /* int buffer_size; */
35#define RC_BUFFER_SIZE 0x10000
36
Rob Landleyb13fee42006-06-20 22:38:00 +000037 uint32_t code;
38 uint32_t range;
39 uint32_t bound;
40} rc_t;
41
Rob Landleyb13fee42006-06-20 22:38:00 +000042#define RC_TOP_BITS 24
43#define RC_MOVE_BITS 5
44#define RC_MODEL_TOTAL_BITS 11
45
46
47/* Called twice: once at startup and once in rc_normalize() */
Denis Vlasenko2bbdda02008-06-27 15:48:45 +000048static void rc_read(rc_t *rc)
Rob Landleyb13fee42006-06-20 22:38:00 +000049{
Denis Vlasenko33762982007-01-05 14:04:47 +000050 int buffer_size = safe_read(rc->fd, RC_BUFFER, RC_BUFFER_SIZE);
51 if (buffer_size <= 0)
Rob Landleyb13fee42006-06-20 22:38:00 +000052 bb_error_msg_and_die("unexpected EOF");
Denis Vlasenko98b8e942007-01-05 13:59:05 +000053 rc->ptr = RC_BUFFER;
Denis Vlasenko33762982007-01-05 14:04:47 +000054 rc->buffer_end = RC_BUFFER + buffer_size;
Rob Landleyb13fee42006-06-20 22:38:00 +000055}
56
57/* Called once */
Denis Vlasenko33762982007-01-05 14:04:47 +000058static rc_t* rc_init(int fd) /*, int buffer_size) */
Rob Landleyb13fee42006-06-20 22:38:00 +000059{
60 int i;
Denis Vlasenko2bbdda02008-06-27 15:48:45 +000061 rc_t *rc;
Denis Vlasenko98b8e942007-01-05 13:59:05 +000062
Denis Vlasenko2bbdda02008-06-27 15:48:45 +000063 rc = xmalloc(sizeof(*rc) + RC_BUFFER_SIZE);
Rob Landleyb13fee42006-06-20 22:38:00 +000064
65 rc->fd = fd;
Denis Vlasenko33762982007-01-05 14:04:47 +000066 /* rc->buffer_size = buffer_size; */
67 rc->buffer_end = RC_BUFFER + RC_BUFFER_SIZE;
Rob Landleyb13fee42006-06-20 22:38:00 +000068 rc->ptr = rc->buffer_end;
69
70 rc->code = 0;
71 rc->range = 0xFFFFFFFF;
72 for (i = 0; i < 5; i++) {
73 if (rc->ptr >= rc->buffer_end)
74 rc_read(rc);
75 rc->code = (rc->code << 8) | *rc->ptr++;
76 }
Denis Vlasenko98b8e942007-01-05 13:59:05 +000077 return rc;
Rob Landleyb13fee42006-06-20 22:38:00 +000078}
79
Denis Vlasenko98b8e942007-01-05 13:59:05 +000080/* Called once */
Denis Vlasenko2bbdda02008-06-27 15:48:45 +000081static ALWAYS_INLINE void rc_free(rc_t *rc)
Rob Landleyb13fee42006-06-20 22:38:00 +000082{
Denis Vlasenko2bbdda02008-06-27 15:48:45 +000083 free(rc);
Rob Landleyb13fee42006-06-20 22:38:00 +000084}
85
86/* Called twice, but one callsite is in speed_inline'd rc_is_bit_0_helper() */
Denis Vlasenko2bbdda02008-06-27 15:48:45 +000087static void rc_do_normalize(rc_t *rc)
Rob Landleyb13fee42006-06-20 22:38:00 +000088{
89 if (rc->ptr >= rc->buffer_end)
90 rc_read(rc);
91 rc->range <<= 8;
92 rc->code = (rc->code << 8) | *rc->ptr++;
93}
Denis Vlasenko2bbdda02008-06-27 15:48:45 +000094static ALWAYS_INLINE void rc_normalize(rc_t *rc)
Rob Landleyb13fee42006-06-20 22:38:00 +000095{
96 if (rc->range < (1 << RC_TOP_BITS)) {
97 rc_do_normalize(rc);
98 }
99}
100
Denis Vlasenkoe3241842007-08-13 10:36:25 +0000101/* rc_is_bit_0 is called 9 times */
Rob Landleyb13fee42006-06-20 22:38:00 +0000102/* Why rc_is_bit_0_helper exists?
Denis Vlasenkoe3241842007-08-13 10:36:25 +0000103 * Because we want to always expose (rc->code < rc->bound) to optimizer.
104 * Thus rc_is_bit_0 is always inlined, and rc_is_bit_0_helper is inlined
105 * only if we compile for speed.
Rob Landleyb13fee42006-06-20 22:38:00 +0000106 */
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000107static speed_inline uint32_t rc_is_bit_0_helper(rc_t *rc, uint16_t *p)
Rob Landleyb13fee42006-06-20 22:38:00 +0000108{
109 rc_normalize(rc);
110 rc->bound = *p * (rc->range >> RC_MODEL_TOTAL_BITS);
111 return rc->bound;
112}
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000113static ALWAYS_INLINE int rc_is_bit_0(rc_t *rc, uint16_t *p)
Rob Landleyb13fee42006-06-20 22:38:00 +0000114{
115 uint32_t t = rc_is_bit_0_helper(rc, p);
116 return rc->code < t;
117}
118
119/* Called ~10 times, but very small, thus inlined */
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000120static speed_inline void rc_update_bit_0(rc_t *rc, uint16_t *p)
Rob Landleyb13fee42006-06-20 22:38:00 +0000121{
122 rc->range = rc->bound;
123 *p += ((1 << RC_MODEL_TOTAL_BITS) - *p) >> RC_MOVE_BITS;
124}
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000125static speed_inline void rc_update_bit_1(rc_t *rc, uint16_t *p)
Rob Landleyb13fee42006-06-20 22:38:00 +0000126{
127 rc->range -= rc->bound;
128 rc->code -= rc->bound;
129 *p -= *p >> RC_MOVE_BITS;
130}
131
132/* Called 4 times in unlzma loop */
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000133static int rc_get_bit(rc_t *rc, uint16_t *p, int *symbol)
Rob Landleyb13fee42006-06-20 22:38:00 +0000134{
135 if (rc_is_bit_0(rc, p)) {
136 rc_update_bit_0(rc, p);
137 *symbol *= 2;
138 return 0;
139 } else {
140 rc_update_bit_1(rc, p);
141 *symbol = *symbol * 2 + 1;
142 return 1;
143 }
144}
145
146/* Called once */
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000147static ALWAYS_INLINE int rc_direct_bit(rc_t *rc)
Rob Landleyb13fee42006-06-20 22:38:00 +0000148{
149 rc_normalize(rc);
150 rc->range >>= 1;
151 if (rc->code >= rc->range) {
152 rc->code -= rc->range;
153 return 1;
154 }
155 return 0;
156}
157
158/* Called twice */
159static speed_inline void
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000160rc_bit_tree_decode(rc_t *rc, uint16_t *p, int num_levels, int *symbol)
Rob Landleyb13fee42006-06-20 22:38:00 +0000161{
162 int i = num_levels;
163
164 *symbol = 1;
165 while (i--)
166 rc_get_bit(rc, p + *symbol, symbol);
167 *symbol -= 1 << num_levels;
168}
Rob Landleyc1d69902006-01-20 18:28:50 +0000169
170
171typedef struct {
172 uint8_t pos;
173 uint32_t dict_size;
174 uint64_t dst_size;
175} __attribute__ ((packed)) lzma_header_t;
176
177
Denis Vlasenko33762982007-01-05 14:04:47 +0000178/* #defines will force compiler to compute/optimize each one with each usage.
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000179 * Have heart and use enum instead. */
180enum {
181 LZMA_BASE_SIZE = 1846,
182 LZMA_LIT_SIZE = 768,
Rob Landleyc1d69902006-01-20 18:28:50 +0000183
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000184 LZMA_NUM_POS_BITS_MAX = 4,
Rob Landleyc1d69902006-01-20 18:28:50 +0000185
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000186 LZMA_LEN_NUM_LOW_BITS = 3,
187 LZMA_LEN_NUM_MID_BITS = 3,
188 LZMA_LEN_NUM_HIGH_BITS = 8,
Rob Landleyc1d69902006-01-20 18:28:50 +0000189
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000190 LZMA_LEN_CHOICE = 0,
191 LZMA_LEN_CHOICE_2 = (LZMA_LEN_CHOICE + 1),
192 LZMA_LEN_LOW = (LZMA_LEN_CHOICE_2 + 1),
193 LZMA_LEN_MID = (LZMA_LEN_LOW \
194 + (1 << (LZMA_NUM_POS_BITS_MAX + LZMA_LEN_NUM_LOW_BITS))),
195 LZMA_LEN_HIGH = (LZMA_LEN_MID \
196 + (1 << (LZMA_NUM_POS_BITS_MAX + LZMA_LEN_NUM_MID_BITS))),
197 LZMA_NUM_LEN_PROBS = (LZMA_LEN_HIGH + (1 << LZMA_LEN_NUM_HIGH_BITS)),
Rob Landleyc1d69902006-01-20 18:28:50 +0000198
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000199 LZMA_NUM_STATES = 12,
200 LZMA_NUM_LIT_STATES = 7,
Rob Landleyc1d69902006-01-20 18:28:50 +0000201
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000202 LZMA_START_POS_MODEL_INDEX = 4,
203 LZMA_END_POS_MODEL_INDEX = 14,
204 LZMA_NUM_FULL_DISTANCES = (1 << (LZMA_END_POS_MODEL_INDEX >> 1)),
Rob Landleyc1d69902006-01-20 18:28:50 +0000205
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000206 LZMA_NUM_POS_SLOT_BITS = 6,
207 LZMA_NUM_LEN_TO_POS_STATES = 4,
Rob Landleyc1d69902006-01-20 18:28:50 +0000208
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000209 LZMA_NUM_ALIGN_BITS = 4,
Rob Landleyc1d69902006-01-20 18:28:50 +0000210
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000211 LZMA_MATCH_MIN_LEN = 2,
Rob Landleyc1d69902006-01-20 18:28:50 +0000212
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000213 LZMA_IS_MATCH = 0,
214 LZMA_IS_REP = (LZMA_IS_MATCH + (LZMA_NUM_STATES << LZMA_NUM_POS_BITS_MAX)),
215 LZMA_IS_REP_G0 = (LZMA_IS_REP + LZMA_NUM_STATES),
216 LZMA_IS_REP_G1 = (LZMA_IS_REP_G0 + LZMA_NUM_STATES),
217 LZMA_IS_REP_G2 = (LZMA_IS_REP_G1 + LZMA_NUM_STATES),
218 LZMA_IS_REP_0_LONG = (LZMA_IS_REP_G2 + LZMA_NUM_STATES),
219 LZMA_POS_SLOT = (LZMA_IS_REP_0_LONG \
220 + (LZMA_NUM_STATES << LZMA_NUM_POS_BITS_MAX)),
221 LZMA_SPEC_POS = (LZMA_POS_SLOT \
222 + (LZMA_NUM_LEN_TO_POS_STATES << LZMA_NUM_POS_SLOT_BITS)),
223 LZMA_ALIGN = (LZMA_SPEC_POS \
224 + LZMA_NUM_FULL_DISTANCES - LZMA_END_POS_MODEL_INDEX),
225 LZMA_LEN_CODER = (LZMA_ALIGN + (1 << LZMA_NUM_ALIGN_BITS)),
226 LZMA_REP_LEN_CODER = (LZMA_LEN_CODER + LZMA_NUM_LEN_PROBS),
227 LZMA_LITERAL = (LZMA_REP_LEN_CODER + LZMA_NUM_LEN_PROBS),
228};
229
Rob Landleyc1d69902006-01-20 18:28:50 +0000230
Denis Vlasenkodefc1ea2008-06-27 02:52:20 +0000231USE_DESKTOP(long long) int FAST_FUNC
Denis Vlasenkoc14d39e2007-06-08 13:05:39 +0000232unpack_lzma_stream(int src_fd, int dst_fd)
Rob Landleyc1d69902006-01-20 18:28:50 +0000233{
Denis Vlasenko97a8dd32006-10-01 15:55:11 +0000234 USE_DESKTOP(long long total_written = 0;)
Rob Landleyc1d69902006-01-20 18:28:50 +0000235 lzma_header_t header;
236 int lc, pb, lp;
237 uint32_t pos_state_mask;
238 uint32_t literal_pos_mask;
239 uint32_t pos;
240 uint16_t *p;
241 uint16_t *prob;
242 uint16_t *prob_lit;
243 int num_bits;
244 int num_probs;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000245 rc_t *rc;
Rob Landleyc1d69902006-01-20 18:28:50 +0000246 int i, mi;
247 uint8_t *buffer;
248 uint8_t previous_byte = 0;
249 size_t buffer_pos = 0, global_pos = 0;
250 int len = 0;
251 int state = 0;
252 uint32_t rep0 = 1, rep1 = 1, rep2 = 1, rep3 = 1;
253
Denis Vlasenko33762982007-01-05 14:04:47 +0000254 xread(src_fd, &header, sizeof(header));
Rob Landleyc1d69902006-01-20 18:28:50 +0000255
256 if (header.pos >= (9 * 5 * 5))
257 bb_error_msg_and_die("bad header");
258 mi = header.pos / 9;
259 lc = header.pos % 9;
260 pb = mi / 5;
261 lp = mi % 5;
262 pos_state_mask = (1 << pb) - 1;
263 literal_pos_mask = (1 << lp) - 1;
264
Rob Landleybba7f082006-05-29 05:51:12 +0000265 header.dict_size = SWAP_LE32(header.dict_size);
266 header.dst_size = SWAP_LE64(header.dst_size);
Rob Landleyc1d69902006-01-20 18:28:50 +0000267
268 if (header.dict_size == 0)
269 header.dict_size = 1;
270
271 buffer = xmalloc(MIN(header.dst_size, header.dict_size));
272
273 num_probs = LZMA_BASE_SIZE + (LZMA_LIT_SIZE << (lc + lp));
274 p = xmalloc(num_probs * sizeof(*p));
275 num_probs = LZMA_LITERAL + (LZMA_LIT_SIZE << (lc + lp));
276 for (i = 0; i < num_probs; i++)
277 p[i] = (1 << RC_MODEL_TOTAL_BITS) >> 1;
278
Denis Vlasenko33762982007-01-05 14:04:47 +0000279 rc = rc_init(src_fd); /*, RC_BUFFER_SIZE); */
Rob Landleyc1d69902006-01-20 18:28:50 +0000280
281 while (global_pos + buffer_pos < header.dst_size) {
282 int pos_state = (buffer_pos + global_pos) & pos_state_mask;
283
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000284 prob = p + LZMA_IS_MATCH + (state << LZMA_NUM_POS_BITS_MAX) + pos_state;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000285 if (rc_is_bit_0(rc, prob)) {
Rob Landleyc1d69902006-01-20 18:28:50 +0000286 mi = 1;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000287 rc_update_bit_0(rc, prob);
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000288 prob = (p + LZMA_LITERAL
289 + (LZMA_LIT_SIZE * ((((buffer_pos + global_pos) & literal_pos_mask) << lc)
290 + (previous_byte >> (8 - lc))
291 )
292 )
293 );
Rob Landleyc1d69902006-01-20 18:28:50 +0000294
295 if (state >= LZMA_NUM_LIT_STATES) {
296 int match_byte;
297
298 pos = buffer_pos - rep0;
299 while (pos >= header.dict_size)
300 pos += header.dict_size;
301 match_byte = buffer[pos];
302 do {
303 int bit;
304
305 match_byte <<= 1;
306 bit = match_byte & 0x100;
307 prob_lit = prob + 0x100 + bit + mi;
Denis Vlasenko444639c2008-03-02 18:56:23 +0000308 bit ^= (rc_get_bit(rc, prob_lit, &mi) << 8); /* 0x100 or 0 */
309 if (bit)
310 break;
Rob Landleyc1d69902006-01-20 18:28:50 +0000311 } while (mi < 0x100);
312 }
313 while (mi < 0x100) {
314 prob_lit = prob + mi;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000315 rc_get_bit(rc, prob_lit, &mi);
Rob Landleyc1d69902006-01-20 18:28:50 +0000316 }
Rob Landleyc1d69902006-01-20 18:28:50 +0000317
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000318 state -= 3;
319 if (state < 4-3)
320 state = 0;
321 if (state >= 10-3)
322 state -= 6-3;
323
324 previous_byte = (uint8_t) mi;
325#if ENABLE_FEATURE_LZMA_FAST
Denis Vlasenkoc0183e62008-03-18 03:13:25 +0000326 one_byte1:
Rob Landleyc1d69902006-01-20 18:28:50 +0000327 buffer[buffer_pos++] = previous_byte;
328 if (buffer_pos == header.dict_size) {
329 buffer_pos = 0;
330 global_pos += header.dict_size;
Denis Vlasenko6b06cb82008-05-15 21:30:45 +0000331 if (full_write(dst_fd, buffer, header.dict_size) != (ssize_t)header.dict_size)
Denis Vlasenko33762982007-01-05 14:04:47 +0000332 goto bad;
Denis Vlasenko97a8dd32006-10-01 15:55:11 +0000333 USE_DESKTOP(total_written += header.dict_size;)
Rob Landleyc1d69902006-01-20 18:28:50 +0000334 }
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000335#else
336 len = 1;
Denis Vlasenkoc0183e62008-03-18 03:13:25 +0000337 goto one_byte2;
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000338#endif
Rob Landleyc1d69902006-01-20 18:28:50 +0000339 } else {
340 int offset;
341 uint16_t *prob_len;
342
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000343 rc_update_bit_1(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000344 prob = p + LZMA_IS_REP + state;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000345 if (rc_is_bit_0(rc, prob)) {
346 rc_update_bit_0(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000347 rep3 = rep2;
348 rep2 = rep1;
349 rep1 = rep0;
350 state = state < LZMA_NUM_LIT_STATES ? 0 : 3;
351 prob = p + LZMA_LEN_CODER;
352 } else {
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000353 rc_update_bit_1(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000354 prob = p + LZMA_IS_REP_G0 + state;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000355 if (rc_is_bit_0(rc, prob)) {
356 rc_update_bit_0(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000357 prob = (p + LZMA_IS_REP_0_LONG
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000358 + (state << LZMA_NUM_POS_BITS_MAX)
359 + pos_state
360 );
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000361 if (rc_is_bit_0(rc, prob)) {
362 rc_update_bit_0(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000363
364 state = state < LZMA_NUM_LIT_STATES ? 9 : 11;
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000365#if ENABLE_FEATURE_LZMA_FAST
Rob Landleyc1d69902006-01-20 18:28:50 +0000366 pos = buffer_pos - rep0;
367 while (pos >= header.dict_size)
368 pos += header.dict_size;
369 previous_byte = buffer[pos];
Denis Vlasenkoc0183e62008-03-18 03:13:25 +0000370 goto one_byte1;
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000371#else
372 len = 1;
373 goto string;
374#endif
Rob Landleyc1d69902006-01-20 18:28:50 +0000375 } else {
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000376 rc_update_bit_1(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000377 }
378 } else {
379 uint32_t distance;
380
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000381 rc_update_bit_1(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000382 prob = p + LZMA_IS_REP_G1 + state;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000383 if (rc_is_bit_0(rc, prob)) {
384 rc_update_bit_0(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000385 distance = rep1;
386 } else {
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000387 rc_update_bit_1(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000388 prob = p + LZMA_IS_REP_G2 + state;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000389 if (rc_is_bit_0(rc, prob)) {
390 rc_update_bit_0(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000391 distance = rep2;
392 } else {
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000393 rc_update_bit_1(rc, prob);
Rob Landleyc1d69902006-01-20 18:28:50 +0000394 distance = rep3;
395 rep3 = rep2;
396 }
397 rep2 = rep1;
398 }
399 rep1 = rep0;
400 rep0 = distance;
401 }
402 state = state < LZMA_NUM_LIT_STATES ? 8 : 11;
403 prob = p + LZMA_REP_LEN_CODER;
404 }
405
406 prob_len = prob + LZMA_LEN_CHOICE;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000407 if (rc_is_bit_0(rc, prob_len)) {
408 rc_update_bit_0(rc, prob_len);
Rob Landleyc1d69902006-01-20 18:28:50 +0000409 prob_len = (prob + LZMA_LEN_LOW
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000410 + (pos_state << LZMA_LEN_NUM_LOW_BITS));
Rob Landleyc1d69902006-01-20 18:28:50 +0000411 offset = 0;
412 num_bits = LZMA_LEN_NUM_LOW_BITS;
413 } else {
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000414 rc_update_bit_1(rc, prob_len);
Rob Landleyc1d69902006-01-20 18:28:50 +0000415 prob_len = prob + LZMA_LEN_CHOICE_2;
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000416 if (rc_is_bit_0(rc, prob_len)) {
417 rc_update_bit_0(rc, prob_len);
Rob Landleyc1d69902006-01-20 18:28:50 +0000418 prob_len = (prob + LZMA_LEN_MID
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000419 + (pos_state << LZMA_LEN_NUM_MID_BITS));
Rob Landleyc1d69902006-01-20 18:28:50 +0000420 offset = 1 << LZMA_LEN_NUM_LOW_BITS;
421 num_bits = LZMA_LEN_NUM_MID_BITS;
422 } else {
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000423 rc_update_bit_1(rc, prob_len);
Rob Landleyc1d69902006-01-20 18:28:50 +0000424 prob_len = prob + LZMA_LEN_HIGH;
425 offset = ((1 << LZMA_LEN_NUM_LOW_BITS)
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000426 + (1 << LZMA_LEN_NUM_MID_BITS));
Rob Landleyc1d69902006-01-20 18:28:50 +0000427 num_bits = LZMA_LEN_NUM_HIGH_BITS;
428 }
429 }
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000430 rc_bit_tree_decode(rc, prob_len, num_bits, &len);
Rob Landleyc1d69902006-01-20 18:28:50 +0000431 len += offset;
432
433 if (state < 4) {
434 int pos_slot;
435
436 state += LZMA_NUM_LIT_STATES;
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000437 prob = p + LZMA_POS_SLOT +
438 ((len < LZMA_NUM_LEN_TO_POS_STATES ? len :
439 LZMA_NUM_LEN_TO_POS_STATES - 1)
440 << LZMA_NUM_POS_SLOT_BITS);
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000441 rc_bit_tree_decode(rc, prob, LZMA_NUM_POS_SLOT_BITS,
Rob Landleyc1d69902006-01-20 18:28:50 +0000442 &pos_slot);
443 if (pos_slot >= LZMA_START_POS_MODEL_INDEX) {
444 num_bits = (pos_slot >> 1) - 1;
445 rep0 = 2 | (pos_slot & 1);
446 if (pos_slot < LZMA_END_POS_MODEL_INDEX) {
447 rep0 <<= num_bits;
448 prob = p + LZMA_SPEC_POS + rep0 - pos_slot - 1;
449 } else {
450 num_bits -= LZMA_NUM_ALIGN_BITS;
451 while (num_bits--)
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000452 rep0 = (rep0 << 1) | rc_direct_bit(rc);
Rob Landleyc1d69902006-01-20 18:28:50 +0000453 prob = p + LZMA_ALIGN;
454 rep0 <<= LZMA_NUM_ALIGN_BITS;
455 num_bits = LZMA_NUM_ALIGN_BITS;
456 }
457 i = 1;
458 mi = 1;
459 while (num_bits--) {
Denis Vlasenko98b8e942007-01-05 13:59:05 +0000460 if (rc_get_bit(rc, prob + mi, &mi))
Rob Landleyc1d69902006-01-20 18:28:50 +0000461 rep0 |= i;
462 i <<= 1;
463 }
464 } else
465 rep0 = pos_slot;
466 if (++rep0 == 0)
467 break;
468 }
469
470 len += LZMA_MATCH_MIN_LEN;
Denis Vlasenkoc3fff872008-03-02 18:55:49 +0000471 SKIP_FEATURE_LZMA_FAST(string:)
Rob Landleyc1d69902006-01-20 18:28:50 +0000472 do {
473 pos = buffer_pos - rep0;
474 while (pos >= header.dict_size)
475 pos += header.dict_size;
476 previous_byte = buffer[pos];
Denis Vlasenkoc0183e62008-03-18 03:13:25 +0000477 SKIP_FEATURE_LZMA_FAST(one_byte2:)
Rob Landleyc1d69902006-01-20 18:28:50 +0000478 buffer[buffer_pos++] = previous_byte;
479 if (buffer_pos == header.dict_size) {
480 buffer_pos = 0;
481 global_pos += header.dict_size;
Denis Vlasenko6b06cb82008-05-15 21:30:45 +0000482 if (full_write(dst_fd, buffer, header.dict_size) != (ssize_t)header.dict_size)
Denis Vlasenko33762982007-01-05 14:04:47 +0000483 goto bad;
Denis Vlasenko97a8dd32006-10-01 15:55:11 +0000484 USE_DESKTOP(total_written += header.dict_size;)
Rob Landleyc1d69902006-01-20 18:28:50 +0000485 }
486 len--;
487 } while (len != 0 && buffer_pos < header.dst_size);
488 }
489 }
490
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000491 {
492 SKIP_DESKTOP(int total_written = 0; /* success */)
493 USE_DESKTOP(total_written += buffer_pos;)
494 if (full_write(dst_fd, buffer, buffer_pos) != (ssize_t)buffer_pos) {
Denis Vlasenko33762982007-01-05 14:04:47 +0000495 bad:
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000496 total_written = -1; /* failure */
497 }
Denis Vlasenko33762982007-01-05 14:04:47 +0000498 rc_free(rc);
Denis Vlasenko2bbdda02008-06-27 15:48:45 +0000499 free(p);
500 free(buffer);
501 return total_written;
Denis Vlasenko33762982007-01-05 14:04:47 +0000502 }
Rob Landleyc1d69902006-01-20 18:28:50 +0000503}