1 /* LzmaDec.c -- LZMA Decoder
3 Copyright (c) 1999-2008 Igor Pavlov
4 Read LzmaDec.h for license options */
10 #define kNumTopBits 24
11 #define kTopValue ((UInt32)1 << kNumTopBits)
13 #define kNumBitModelTotalBits 11
14 #define kBitModelTotal (1 << kNumBitModelTotalBits)
15 #define kNumMoveBits 5
17 #define RC_INIT_SIZE 5
19 #define NORMALIZE if (range < kTopValue) { range <<= 8; code = (code << 8) | (*buf++); }
21 #define IF_BIT_0(p) ttt = *(p); NORMALIZE; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
22 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));
23 #define UPDATE_1(p) range -= bound; code -= bound; *(p) = (CLzmaProb)(ttt - (ttt >> kNumMoveBits));
24 #define GET_BIT2(p, i, A0, A1) IF_BIT_0(p) \
25 { UPDATE_0(p); i = (i + i); A0; } else \
26 { UPDATE_1(p); i = (i + i) + 1; A1; }
27 #define GET_BIT(p, i) GET_BIT2(p, i, ; , ;)
29 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
30 #define TREE_DECODE(probs, limit, i) \
31 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
33 /* #define _LZMA_SIZE_OPT */
36 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
38 #define TREE_6_DECODE(probs, i) \
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i); \
42 TREE_GET_BIT(probs, i); \
43 TREE_GET_BIT(probs, i); \
44 TREE_GET_BIT(probs, i); \
45 TREE_GET_BIT(probs, i); \
49 #define NORMALIZE_CHECK if (range < kTopValue) { if (buf >= bufLimit) return DUMMY_ERROR; range <<= 8; code = (code << 8) | (*buf++); }
51 #define IF_BIT_0_CHECK(p) ttt = *(p); NORMALIZE_CHECK; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
52 #define UPDATE_0_CHECK range = bound;
53 #define UPDATE_1_CHECK range -= bound; code -= bound;
54 #define GET_BIT2_CHECK(p, i, A0, A1) IF_BIT_0_CHECK(p) \
55 { UPDATE_0_CHECK; i = (i + i); A0; } else \
56 { UPDATE_1_CHECK; i = (i + i) + 1; A1; }
57 #define GET_BIT_CHECK(p, i) GET_BIT2_CHECK(p, i, ; , ;)
58 #define TREE_DECODE_CHECK(probs, limit, i) \
59 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while(i < limit); i -= limit; }
62 #define kNumPosBitsMax 4
63 #define kNumPosStatesMax (1 << kNumPosBitsMax)
65 #define kLenNumLowBits 3
66 #define kLenNumLowSymbols (1 << kLenNumLowBits)
67 #define kLenNumMidBits 3
68 #define kLenNumMidSymbols (1 << kLenNumMidBits)
69 #define kLenNumHighBits 8
70 #define kLenNumHighSymbols (1 << kLenNumHighBits)
73 #define LenChoice2 (LenChoice + 1)
74 #define LenLow (LenChoice2 + 1)
75 #define LenMid (LenLow + (kNumPosStatesMax << kLenNumLowBits))
76 #define LenHigh (LenMid + (kNumPosStatesMax << kLenNumMidBits))
77 #define kNumLenProbs (LenHigh + kLenNumHighSymbols)
81 #define kNumLitStates 7
83 #define kStartPosModelIndex 4
84 #define kEndPosModelIndex 14
85 #define kNumFullDistances (1 << (kEndPosModelIndex >> 1))
87 #define kNumPosSlotBits 6
88 #define kNumLenToPosStates 4
90 #define kNumAlignBits 4
91 #define kAlignTableSize (1 << kNumAlignBits)
93 #define kMatchMinLen 2
94 #define kMatchSpecLenStart (kMatchMinLen + kLenNumLowSymbols + kLenNumMidSymbols + kLenNumHighSymbols)
97 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
98 #define IsRepG0 (IsRep + kNumStates)
99 #define IsRepG1 (IsRepG0 + kNumStates)
100 #define IsRepG2 (IsRepG1 + kNumStates)
101 #define IsRep0Long (IsRepG2 + kNumStates)
102 #define PosSlot (IsRep0Long + (kNumStates << kNumPosBitsMax))
103 #define SpecPos (PosSlot + (kNumLenToPosStates << kNumPosSlotBits))
104 #define Align (SpecPos + kNumFullDistances - kEndPosModelIndex)
105 #define LenCoder (Align + kAlignTableSize)
106 #define RepLenCoder (LenCoder + kNumLenProbs)
107 #define Literal (RepLenCoder + kNumLenProbs)
109 #define LZMA_BASE_SIZE 1846
110 #define LZMA_LIT_SIZE 768
112 #define LzmaProps_GetNumProbs(p) ((UInt32)LZMA_BASE_SIZE + (LZMA_LIT_SIZE << ((p)->lc + (p)->lp)))
114 #if Literal != LZMA_BASE_SIZE
119 #define LZMA_STREAM_WAS_FINISHED_ID (-1)
120 #define LZMA_SPEC_LEN_OFFSET (-3)
123 Byte kLiteralNextStates
[kNumStates
* 2] =
125 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5,
126 7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10
129 #define LZMA_DIC_MIN (1 << 12)
131 /* First LZMA-symbol is always decoded.
132 And it decodes new LZMA-symbols while (buf < bufLimit), but "buf" is without last normalization
138 < kMatchSpecLenStart : normal remain
139 = kMatchSpecLenStart : finished
140 = kMatchSpecLenStart + 1 : Flush marker
141 = kMatchSpecLenStart + 2 : State Init Marker
144 static int MY_FAST_CALL
LzmaDec_DecodeReal(CLzmaDec
*p
, SizeT limit
, const Byte
*bufLimit
)
146 CLzmaProb
*probs
= p
->probs
;
148 unsigned state
= p
->state
;
149 UInt32 rep0
= p
->reps
[0], rep1
= p
->reps
[1], rep2
= p
->reps
[2], rep3
= p
->reps
[3];
150 unsigned pbMask
= ((unsigned)1 << (p
->prop
.pb
)) - 1;
151 unsigned lpMask
= ((unsigned)1 << (p
->prop
.lp
)) - 1;
152 unsigned lc
= p
->prop
.lc
;
155 SizeT dicBufSize
= p
->dicBufSize
;
156 SizeT dicPos
= p
->dicPos
;
158 UInt32 processedPos
= p
->processedPos
;
159 UInt32 checkDicSize
= p
->checkDicSize
;
162 const Byte
*buf
= p
->buf
;
163 UInt32 range
= p
->range
;
164 UInt32 code
= p
->code
;
171 unsigned posState
= processedPos
& pbMask
;
173 prob
= probs
+ IsMatch
+ (state
<< kNumPosBitsMax
) + posState
;
178 prob
= probs
+ Literal
;
179 if (checkDicSize
!= 0 || processedPos
!= 0)
180 prob
+= (LZMA_LIT_SIZE
* (((processedPos
& lpMask
) << lc
) +
181 (dic
[(dicPos
== 0 ? dicBufSize
: dicPos
) - 1] >> (8 - lc
))));
183 if (state
< kNumLitStates
)
186 do { GET_BIT(prob
+ symbol
, symbol
) } while (symbol
< 0x100);
190 unsigned matchByte
= p
->dic
[(dicPos
- rep0
) + ((dicPos
< rep0
) ? dicBufSize
: 0)];
191 unsigned offs
= 0x100;
198 bit
= (matchByte
& offs
);
199 probLit
= prob
+ offs
+ bit
+ symbol
;
200 GET_BIT2(probLit
, symbol
, offs
&= ~bit
, offs
&= bit
)
202 while (symbol
< 0x100);
204 dic
[dicPos
++] = (Byte
)symbol
;
207 state
= kLiteralNextStates
[state
];
208 /* if (state < 4) state = 0; else if (state < 10) state -= 3; else state -= 6; */
214 prob
= probs
+ IsRep
+ state
;
219 prob
= probs
+ LenCoder
;
224 if (checkDicSize
== 0 && processedPos
== 0)
225 return SZ_ERROR_DATA
;
226 prob
= probs
+ IsRepG0
+ state
;
230 prob
= probs
+ IsRep0Long
+ (state
<< kNumPosBitsMax
) + posState
;
234 dic
[dicPos
] = dic
[(dicPos
- rep0
) + ((dicPos
< rep0
) ? dicBufSize
: 0)];
237 state
= state
< kNumLitStates
? 9 : 11;
246 prob
= probs
+ IsRepG1
+ state
;
255 prob
= probs
+ IsRepG2
+ state
;
272 state
= state
< kNumLitStates
? 8 : 11;
273 prob
= probs
+ RepLenCoder
;
276 unsigned limit
, offset
;
277 CLzmaProb
*probLen
= prob
+ LenChoice
;
281 probLen
= prob
+ LenLow
+ (posState
<< kLenNumLowBits
);
283 limit
= (1 << kLenNumLowBits
);
288 probLen
= prob
+ LenChoice2
;
292 probLen
= prob
+ LenMid
+ (posState
<< kLenNumMidBits
);
293 offset
= kLenNumLowSymbols
;
294 limit
= (1 << kLenNumMidBits
);
299 probLen
= prob
+ LenHigh
;
300 offset
= kLenNumLowSymbols
+ kLenNumMidSymbols
;
301 limit
= (1 << kLenNumHighBits
);
304 TREE_DECODE(probLen
, limit
, len
);
308 if (state
>= kNumStates
)
311 prob
= probs
+ PosSlot
+
312 ((len
< kNumLenToPosStates
? len
: kNumLenToPosStates
- 1) << kNumPosSlotBits
);
313 TREE_6_DECODE(prob
, distance
);
314 if (distance
>= kStartPosModelIndex
)
316 unsigned posSlot
= (unsigned)distance
;
317 int numDirectBits
= (int)(((distance
>> 1) - 1));
318 distance
= (2 | (distance
& 1));
319 if (posSlot
< kEndPosModelIndex
)
321 distance
<<= numDirectBits
;
322 prob
= probs
+ SpecPos
+ distance
- posSlot
- 1;
328 GET_BIT2(prob
+ i
, i
, ; , distance
|= mask
);
331 while(--numDirectBits
!= 0);
336 numDirectBits
-= kNumAlignBits
;
345 t
= (0 - ((UInt32
)code
>> 31)); /* (UInt32)((Int32)code >> 31) */
346 distance
= (distance
<< 1) + (t
+ 1);
358 while (--numDirectBits
!= 0);
359 prob
= probs
+ Align
;
360 distance
<<= kNumAlignBits
;
363 GET_BIT2(prob
+ i
, i
, ; , distance
|= 1);
364 GET_BIT2(prob
+ i
, i
, ; , distance
|= 2);
365 GET_BIT2(prob
+ i
, i
, ; , distance
|= 4);
366 GET_BIT2(prob
+ i
, i
, ; , distance
|= 8);
368 if (distance
== (UInt32
)0xFFFFFFFF)
370 len
+= kMatchSpecLenStart
;
380 if (checkDicSize
== 0)
382 if (distance
>= processedPos
)
383 return SZ_ERROR_DATA
;
385 else if (distance
>= checkDicSize
)
386 return SZ_ERROR_DATA
;
387 state
= (state
< kNumStates
+ kNumLitStates
) ? kNumLitStates
: kNumLitStates
+ 3;
388 /* state = kLiteralNextStates[state]; */
394 SizeT rem
= limit
- dicPos
;
395 unsigned curLen
= ((rem
< len
) ? (unsigned)rem
: len
);
396 SizeT pos
= (dicPos
- rep0
) + ((dicPos
< rep0
) ? dicBufSize
: 0);
398 processedPos
+= curLen
;
401 if (pos
+ curLen
<= dicBufSize
)
403 Byte
*dest
= dic
+ dicPos
;
404 ptrdiff_t src
= (ptrdiff_t)pos
- (ptrdiff_t)dicPos
;
405 const Byte
*lim
= dest
+ curLen
;
408 *(dest
) = (Byte
)*(dest
+ src
);
409 while (++dest
!= lim
);
415 dic
[dicPos
++] = dic
[pos
];
416 if (++pos
== dicBufSize
)
419 while (--curLen
!= 0);
424 while (dicPos
< limit
&& buf
< bufLimit
);
431 p
->processedPos
= processedPos
;
441 static void MY_FAST_CALL
LzmaDec_WriteRem(CLzmaDec
*p
, SizeT limit
)
443 if (p
->remainLen
!= 0 && p
->remainLen
< kMatchSpecLenStart
)
446 SizeT dicPos
= p
->dicPos
;
447 SizeT dicBufSize
= p
->dicBufSize
;
448 unsigned len
= p
->remainLen
;
449 UInt32 rep0
= p
->reps
[0];
450 if (limit
- dicPos
< len
)
451 len
= (unsigned)(limit
- dicPos
);
453 if (p
->checkDicSize
== 0 && p
->prop
.dicSize
- p
->processedPos
<= len
)
454 p
->checkDicSize
= p
->prop
.dicSize
;
456 p
->processedPos
+= len
;
460 dic
[dicPos
] = dic
[(dicPos
- rep0
) + ((dicPos
< rep0
) ? dicBufSize
: 0)];
467 /* LzmaDec_DecodeReal2 decodes LZMA-symbols and sets p->needFlush and p->needInit, if required. */
469 static int MY_FAST_CALL
LzmaDec_DecodeReal2(CLzmaDec
*p
, SizeT limit
, const Byte
*bufLimit
)
473 SizeT limit2
= limit
;
474 if (p
->checkDicSize
== 0)
476 UInt32 rem
= p
->prop
.dicSize
- p
->processedPos
;
477 if (limit
- p
->dicPos
> rem
)
478 limit2
= p
->dicPos
+ rem
;
480 RINOK(LzmaDec_DecodeReal(p
, limit2
, bufLimit
));
481 if (p
->processedPos
>= p
->prop
.dicSize
)
482 p
->checkDicSize
= p
->prop
.dicSize
;
483 LzmaDec_WriteRem(p
, limit
);
485 while (p
->dicPos
< limit
&& p
->buf
< bufLimit
&& p
->remainLen
< kMatchSpecLenStart
);
487 if (p
->remainLen
> kMatchSpecLenStart
)
489 p
->remainLen
= kMatchSpecLenStart
;
496 DUMMY_ERROR
, /* unexpected end of input stream */
502 static ELzmaDummy
LzmaDec_TryDummy(const CLzmaDec
*p
, const Byte
*buf
, SizeT inSize
)
504 UInt32 range
= p
->range
;
505 UInt32 code
= p
->code
;
506 const Byte
*bufLimit
= buf
+ inSize
;
507 CLzmaProb
*probs
= p
->probs
;
508 unsigned state
= p
->state
;
515 unsigned posState
= (p
->processedPos
) & ((1 << p
->prop
.pb
) - 1);
517 prob
= probs
+ IsMatch
+ (state
<< kNumPosBitsMax
) + posState
;
522 /* if (bufLimit - buf >= 7) return DUMMY_LIT; */
524 prob
= probs
+ Literal
;
525 if (p
->checkDicSize
!= 0 || p
->processedPos
!= 0)
526 prob
+= (LZMA_LIT_SIZE
*
527 ((((p
->processedPos
) & ((1 << (p
->prop
.lp
)) - 1)) << p
->prop
.lc
) +
528 (p
->dic
[(p
->dicPos
== 0 ? p
->dicBufSize
: p
->dicPos
) - 1] >> (8 - p
->prop
.lc
))));
530 if (state
< kNumLitStates
)
533 do { GET_BIT_CHECK(prob
+ symbol
, symbol
) } while (symbol
< 0x100);
537 unsigned matchByte
= p
->dic
[p
->dicPos
- p
->reps
[0] +
538 ((p
->dicPos
< p
->reps
[0]) ? p
->dicBufSize
: 0)];
539 unsigned offs
= 0x100;
546 bit
= (matchByte
& offs
);
547 probLit
= prob
+ offs
+ bit
+ symbol
;
548 GET_BIT2_CHECK(probLit
, symbol
, offs
&= ~bit
, offs
&= bit
)
550 while (symbol
< 0x100);
559 prob
= probs
+ IsRep
+ state
;
564 prob
= probs
+ LenCoder
;
571 prob
= probs
+ IsRepG0
+ state
;
575 prob
= probs
+ IsRep0Long
+ (state
<< kNumPosBitsMax
) + posState
;
590 prob
= probs
+ IsRepG1
+ state
;
598 prob
= probs
+ IsRepG2
+ state
;
610 prob
= probs
+ RepLenCoder
;
613 unsigned limit
, offset
;
614 CLzmaProb
*probLen
= prob
+ LenChoice
;
615 IF_BIT_0_CHECK(probLen
)
618 probLen
= prob
+ LenLow
+ (posState
<< kLenNumLowBits
);
620 limit
= 1 << kLenNumLowBits
;
625 probLen
= prob
+ LenChoice2
;
626 IF_BIT_0_CHECK(probLen
)
629 probLen
= prob
+ LenMid
+ (posState
<< kLenNumMidBits
);
630 offset
= kLenNumLowSymbols
;
631 limit
= 1 << kLenNumMidBits
;
636 probLen
= prob
+ LenHigh
;
637 offset
= kLenNumLowSymbols
+ kLenNumMidSymbols
;
638 limit
= 1 << kLenNumHighBits
;
641 TREE_DECODE_CHECK(probLen
, limit
, len
);
648 prob
= probs
+ PosSlot
+
649 ((len
< kNumLenToPosStates
? len
: kNumLenToPosStates
- 1) <<
651 TREE_DECODE_CHECK(prob
, 1 << kNumPosSlotBits
, posSlot
);
652 if (posSlot
>= kStartPosModelIndex
)
654 int numDirectBits
= ((posSlot
>> 1) - 1);
656 /* if (bufLimit - buf >= 8) return DUMMY_MATCH; */
658 if (posSlot
< kEndPosModelIndex
)
660 prob
= probs
+ SpecPos
+ ((2 | (posSlot
& 1)) << numDirectBits
) - posSlot
- 1;
664 numDirectBits
-= kNumAlignBits
;
669 code
-= range
& (((code
- range
) >> 31) - 1);
670 /* if (code >= range) code -= range; */
672 while (--numDirectBits
!= 0);
673 prob
= probs
+ Align
;
674 numDirectBits
= kNumAlignBits
;
680 GET_BIT_CHECK(prob
+ i
, i
);
682 while(--numDirectBits
!= 0);
693 static void LzmaDec_InitRc(CLzmaDec
*p
, const Byte
*data
)
695 p
->code
= ((UInt32
)data
[1] << 24) | ((UInt32
)data
[2] << 16) | ((UInt32
)data
[3] << 8) | ((UInt32
)data
[4]);
696 p
->range
= 0xFFFFFFFF;
700 static void LzmaDec_InitDicAndState(CLzmaDec
*p
, Bool initDic
, Bool initState
)
710 p
->needInitState
= 1;
713 p
->needInitState
= 1;
716 void LzmaDec_Init(CLzmaDec
*p
)
719 LzmaDec_InitDicAndState(p
, True
, True
);
722 static void LzmaDec_InitStateReal(CLzmaDec
*p
)
724 UInt32 numProbs
= Literal
+ ((UInt32
)LZMA_LIT_SIZE
<< (p
->prop
.lc
+ p
->prop
.lp
));
726 CLzmaProb
*probs
= p
->probs
;
727 for (i
= 0; i
< numProbs
; i
++)
728 probs
[i
] = kBitModelTotal
>> 1;
729 p
->reps
[0] = p
->reps
[1] = p
->reps
[2] = p
->reps
[3] = 1;
731 p
->needInitState
= 0;
734 SRes
LzmaDec_DecodeToDic(CLzmaDec
*p
, SizeT dicLimit
, const Byte
*src
, SizeT
*srcLen
,
735 ELzmaFinishMode finishMode
, ELzmaStatus
*status
)
737 SizeT inSize
= *srcLen
;
739 LzmaDec_WriteRem(p
, dicLimit
);
741 *status
= LZMA_STATUS_NOT_SPECIFIED
;
743 while (p
->remainLen
!= kMatchSpecLenStart
)
747 if (p
->needFlush
!= 0)
749 for (; inSize
> 0 && p
->tempBufSize
< RC_INIT_SIZE
; (*srcLen
)++, inSize
--)
750 p
->tempBuf
[p
->tempBufSize
++] = *src
++;
751 if (p
->tempBufSize
< RC_INIT_SIZE
)
753 *status
= LZMA_STATUS_NEEDS_MORE_INPUT
;
756 if (p
->tempBuf
[0] != 0)
757 return SZ_ERROR_DATA
;
759 LzmaDec_InitRc(p
, p
->tempBuf
);
764 if (p
->dicPos
>= dicLimit
)
766 if (p
->remainLen
== 0 && p
->code
== 0)
768 *status
= LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK
;
771 if (finishMode
== LZMA_FINISH_ANY
)
773 *status
= LZMA_STATUS_NOT_FINISHED
;
776 if (p
->remainLen
!= 0)
778 *status
= LZMA_STATUS_NOT_FINISHED
;
779 return SZ_ERROR_DATA
;
784 if (p
->needInitState
)
785 LzmaDec_InitStateReal(p
);
787 if (p
->tempBufSize
== 0)
790 const Byte
*bufLimit
;
791 if (inSize
< LZMA_REQUIRED_INPUT_MAX
|| checkEndMarkNow
)
793 int dummyRes
= LzmaDec_TryDummy(p
, src
, inSize
);
794 if (dummyRes
== DUMMY_ERROR
)
796 memcpy(p
->tempBuf
, src
, inSize
);
797 p
->tempBufSize
= (unsigned)inSize
;
799 *status
= LZMA_STATUS_NEEDS_MORE_INPUT
;
802 if (checkEndMarkNow
&& dummyRes
!= DUMMY_MATCH
)
804 *status
= LZMA_STATUS_NOT_FINISHED
;
805 return SZ_ERROR_DATA
;
810 bufLimit
= src
+ inSize
- LZMA_REQUIRED_INPUT_MAX
;
812 if (LzmaDec_DecodeReal2(p
, dicLimit
, bufLimit
) != 0)
813 return SZ_ERROR_DATA
;
814 processed
= p
->buf
- src
;
815 (*srcLen
) += processed
;
821 unsigned rem
= p
->tempBufSize
, lookAhead
= 0;
822 while (rem
< LZMA_REQUIRED_INPUT_MAX
&& lookAhead
< inSize
)
823 p
->tempBuf
[rem
++] = src
[lookAhead
++];
824 p
->tempBufSize
= rem
;
825 if (rem
< LZMA_REQUIRED_INPUT_MAX
|| checkEndMarkNow
)
827 int dummyRes
= LzmaDec_TryDummy(p
, p
->tempBuf
, rem
);
828 if (dummyRes
== DUMMY_ERROR
)
830 (*srcLen
) += lookAhead
;
831 *status
= LZMA_STATUS_NEEDS_MORE_INPUT
;
834 if (checkEndMarkNow
&& dummyRes
!= DUMMY_MATCH
)
836 *status
= LZMA_STATUS_NOT_FINISHED
;
837 return SZ_ERROR_DATA
;
841 if (LzmaDec_DecodeReal2(p
, dicLimit
, p
->buf
) != 0)
842 return SZ_ERROR_DATA
;
843 lookAhead
-= (rem
- (unsigned)(p
->buf
- p
->tempBuf
));
844 (*srcLen
) += lookAhead
;
851 *status
= LZMA_STATUS_FINISHED_WITH_MARK
;
852 return (p
->code
== 0) ? SZ_OK
: SZ_ERROR_DATA
;
855 SRes
LzmaDec_DecodeToBuf(CLzmaDec
*p
, Byte
*dest
, SizeT
*destLen
, const Byte
*src
, SizeT
*srcLen
, ELzmaFinishMode finishMode
, ELzmaStatus
*status
)
857 SizeT outSize
= *destLen
;
858 SizeT inSize
= *srcLen
;
859 *srcLen
= *destLen
= 0;
862 SizeT inSizeCur
= inSize
, outSizeCur
, dicPos
;
863 ELzmaFinishMode curFinishMode
;
865 if (p
->dicPos
== p
->dicBufSize
)
868 if (outSize
> p
->dicBufSize
- dicPos
)
870 outSizeCur
= p
->dicBufSize
;
871 curFinishMode
= LZMA_FINISH_ANY
;
875 outSizeCur
= dicPos
+ outSize
;
876 curFinishMode
= finishMode
;
879 res
= LzmaDec_DecodeToDic(p
, outSizeCur
, src
, &inSizeCur
, curFinishMode
, status
);
882 *srcLen
+= inSizeCur
;
883 outSizeCur
= p
->dicPos
- dicPos
;
884 memcpy(dest
, p
->dic
+ dicPos
, outSizeCur
);
886 outSize
-= outSizeCur
;
887 *destLen
+= outSizeCur
;
890 if (outSizeCur
== 0 || outSize
== 0)
895 void LzmaDec_FreeProbs(CLzmaDec
*p
, ISzAlloc
*alloc
)
897 alloc
->Free(alloc
, p
->probs
);
901 static void LzmaDec_FreeDict(CLzmaDec
*p
, ISzAlloc
*alloc
)
903 alloc
->Free(alloc
, p
->dic
);
907 void LzmaDec_Free(CLzmaDec
*p
, ISzAlloc
*alloc
)
909 LzmaDec_FreeProbs(p
, alloc
);
910 LzmaDec_FreeDict(p
, alloc
);
913 SRes
LzmaProps_Decode(CLzmaProps
*p
, const Byte
*data
, unsigned size
)
918 if (size
< LZMA_PROPS_SIZE
)
919 return SZ_ERROR_UNSUPPORTED
;
921 dicSize
= data
[1] | ((UInt32
)data
[2] << 8) | ((UInt32
)data
[3] << 16) | ((UInt32
)data
[4] << 24);
923 if (dicSize
< LZMA_DIC_MIN
)
924 dicSize
= LZMA_DIC_MIN
;
925 p
->dicSize
= dicSize
;
928 if (d
>= (9 * 5 * 5))
929 return SZ_ERROR_UNSUPPORTED
;
939 static SRes
LzmaDec_AllocateProbs2(CLzmaDec
*p
, const CLzmaProps
*propNew
, ISzAlloc
*alloc
)
941 UInt32 numProbs
= LzmaProps_GetNumProbs(propNew
);
942 if (p
->probs
== 0 || numProbs
!= p
->numProbs
)
944 LzmaDec_FreeProbs(p
, alloc
);
945 p
->probs
= (CLzmaProb
*)alloc
->Alloc(alloc
, numProbs
* sizeof(CLzmaProb
));
946 p
->numProbs
= numProbs
;
953 SRes
LzmaDec_AllocateProbs(CLzmaDec
*p
, const Byte
*props
, unsigned propsSize
, ISzAlloc
*alloc
)
956 RINOK(LzmaProps_Decode(&propNew
, props
, propsSize
));
957 RINOK(LzmaDec_AllocateProbs2(p
, &propNew
, alloc
));
962 SRes
LzmaDec_Allocate(CLzmaDec
*p
, const Byte
*props
, unsigned propsSize
, ISzAlloc
*alloc
)
966 RINOK(LzmaProps_Decode(&propNew
, props
, propsSize
));
967 RINOK(LzmaDec_AllocateProbs2(p
, &propNew
, alloc
));
968 dicBufSize
= propNew
.dicSize
;
969 if (p
->dic
== 0 || dicBufSize
!= p
->dicBufSize
)
971 LzmaDec_FreeDict(p
, alloc
);
972 p
->dic
= (Byte
*)alloc
->Alloc(alloc
, dicBufSize
);
975 LzmaDec_FreeProbs(p
, alloc
);
979 p
->dicBufSize
= dicBufSize
;
984 SRes
LzmaDecode(Byte
*dest
, SizeT
*destLen
, const Byte
*src
, SizeT
*srcLen
,
985 const Byte
*propData
, unsigned propSize
, ELzmaFinishMode finishMode
,
986 ELzmaStatus
*status
, ISzAlloc
*alloc
)
990 SizeT inSize
= *srcLen
;
991 SizeT outSize
= *destLen
;
992 *srcLen
= *destLen
= 0;
993 if (inSize
< RC_INIT_SIZE
)
994 return SZ_ERROR_INPUT_EOF
;
996 LzmaDec_Construct(&p
);
997 res
= LzmaDec_AllocateProbs(&p
, propData
, propSize
, alloc
);
1001 p
.dicBufSize
= outSize
;
1006 res
= LzmaDec_DecodeToDic(&p
, outSize
, src
, srcLen
, finishMode
, status
);
1008 if (res
== SZ_OK
&& *status
== LZMA_STATUS_NEEDS_MORE_INPUT
)
1009 res
= SZ_ERROR_INPUT_EOF
;
1011 (*destLen
) = p
.dicPos
;
1012 LzmaDec_FreeProbs(&p
, alloc
);