1 /* LzmaDec.c -- LZMA Decoder
2 2016-05-16 : Igor Pavlov : Public domain */
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 NORMAL_LITER_DEC GET_BIT(prob + symbol, symbol)
50 #define MATCHED_LITER_DEC \
52 bit = (matchByte & offs); \
53 probLit = prob + offs + bit + symbol; \
54 GET_BIT2(probLit, symbol, offs &= ~bit, offs &= bit)
56 #define NORMALIZE_CHECK if (range < kTopValue) { if (buf >= bufLimit) return DUMMY_ERROR; range <<= 8; code = (code << 8) | (*buf++); }
58 #define IF_BIT_0_CHECK(p) ttt = *(p); NORMALIZE_CHECK; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
59 #define UPDATE_0_CHECK range = bound;
60 #define UPDATE_1_CHECK range -= bound; code -= bound;
61 #define GET_BIT2_CHECK(p, i, A0, A1) IF_BIT_0_CHECK(p) \
62 { UPDATE_0_CHECK; i = (i + i); A0; } else \
63 { UPDATE_1_CHECK; i = (i + i) + 1; A1; }
64 #define GET_BIT_CHECK(p, i) GET_BIT2_CHECK(p, i, ; , ;)
65 #define TREE_DECODE_CHECK(probs, limit, i) \
66 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
69 #define kNumPosBitsMax 4
70 #define kNumPosStatesMax (1 << kNumPosBitsMax)
72 #define kLenNumLowBits 3
73 #define kLenNumLowSymbols (1 << kLenNumLowBits)
74 #define kLenNumMidBits 3
75 #define kLenNumMidSymbols (1 << kLenNumMidBits)
76 #define kLenNumHighBits 8
77 #define kLenNumHighSymbols (1 << kLenNumHighBits)
80 #define LenChoice2 (LenChoice + 1)
81 #define LenLow (LenChoice2 + 1)
82 #define LenMid (LenLow + (kNumPosStatesMax << kLenNumLowBits))
83 #define LenHigh (LenMid + (kNumPosStatesMax << kLenNumMidBits))
84 #define kNumLenProbs (LenHigh + kLenNumHighSymbols)
88 #define kNumLitStates 7
90 #define kStartPosModelIndex 4
91 #define kEndPosModelIndex 14
92 #define kNumFullDistances (1 << (kEndPosModelIndex >> 1))
94 #define kNumPosSlotBits 6
95 #define kNumLenToPosStates 4
97 #define kNumAlignBits 4
98 #define kAlignTableSize (1 << kNumAlignBits)
100 #define kMatchMinLen 2
101 #define kMatchSpecLenStart (kMatchMinLen + kLenNumLowSymbols + kLenNumMidSymbols + kLenNumHighSymbols)
104 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
105 #define IsRepG0 (IsRep + kNumStates)
106 #define IsRepG1 (IsRepG0 + kNumStates)
107 #define IsRepG2 (IsRepG1 + kNumStates)
108 #define IsRep0Long (IsRepG2 + kNumStates)
109 #define PosSlot (IsRep0Long + (kNumStates << kNumPosBitsMax))
110 #define SpecPos (PosSlot + (kNumLenToPosStates << kNumPosSlotBits))
111 #define Align (SpecPos + kNumFullDistances - kEndPosModelIndex)
112 #define LenCoder (Align + kAlignTableSize)
113 #define RepLenCoder (LenCoder + kNumLenProbs)
114 #define Literal (RepLenCoder + kNumLenProbs)
116 #define LZMA_BASE_SIZE 1846
117 #define LZMA_LIT_SIZE 0x300
119 #if Literal != LZMA_BASE_SIZE
123 #define LzmaProps_GetNumProbs(p) (Literal + ((UInt32)LZMA_LIT_SIZE << ((p)->lc + (p)->lp)))
125 #define LZMA_DIC_MIN (1 << 12)
127 /* First LZMA-symbol is always decoded.
128 And it decodes new LZMA-symbols while (buf < bufLimit), but "buf" is without last normalization
132 SZ_ERROR_DATA - Error
134 < kMatchSpecLenStart : normal remain
135 = kMatchSpecLenStart : finished
136 = kMatchSpecLenStart + 1 : Flush marker (unused now)
137 = kMatchSpecLenStart + 2 : State Init Marker (unused now)
140 static int MY_FAST_CALL
LzmaDec_DecodeReal(CLzmaDec
*p
, SizeT limit
, const Byte
*bufLimit
)
142 CLzmaProb
*probs
= p
->probs
;
144 unsigned state
= p
->state
;
145 UInt32 rep0
= p
->reps
[0], rep1
= p
->reps
[1], rep2
= p
->reps
[2], rep3
= p
->reps
[3];
146 unsigned pbMask
= ((unsigned)1 << (p
->prop
.pb
)) - 1;
147 unsigned lpMask
= ((unsigned)1 << (p
->prop
.lp
)) - 1;
148 unsigned lc
= p
->prop
.lc
;
151 SizeT dicBufSize
= p
->dicBufSize
;
152 SizeT dicPos
= p
->dicPos
;
154 UInt32 processedPos
= p
->processedPos
;
155 UInt32 checkDicSize
= p
->checkDicSize
;
158 const Byte
*buf
= p
->buf
;
159 UInt32 range
= p
->range
;
160 UInt32 code
= p
->code
;
167 unsigned posState
= processedPos
& pbMask
;
169 prob
= probs
+ IsMatch
+ (state
<< kNumPosBitsMax
) + posState
;
174 prob
= probs
+ Literal
;
175 if (processedPos
!= 0 || checkDicSize
!= 0)
176 prob
+= ((UInt32
)LZMA_LIT_SIZE
* (((processedPos
& lpMask
) << lc
) +
177 (dic
[(dicPos
== 0 ? dicBufSize
: dicPos
) - 1] >> (8 - lc
))));
180 if (state
< kNumLitStates
)
182 state
-= (state
< 4) ? state
: 3;
184 #ifdef _LZMA_SIZE_OPT
185 do { NORMAL_LITER_DEC
} while (symbol
< 0x100);
199 unsigned matchByte
= dic
[dicPos
- rep0
+ (dicPos
< rep0
? dicBufSize
: 0)];
200 unsigned offs
= 0x100;
201 state
-= (state
< 10) ? 3 : 6;
203 #ifdef _LZMA_SIZE_OPT
210 while (symbol
< 0x100);
227 dic
[dicPos
++] = (Byte
)symbol
;
233 prob
= probs
+ IsRep
+ state
;
238 prob
= probs
+ LenCoder
;
243 if (checkDicSize
== 0 && processedPos
== 0)
244 return SZ_ERROR_DATA
;
245 prob
= probs
+ IsRepG0
+ state
;
249 prob
= probs
+ IsRep0Long
+ (state
<< kNumPosBitsMax
) + posState
;
253 dic
[dicPos
] = dic
[dicPos
- rep0
+ (dicPos
< rep0
? dicBufSize
: 0)];
256 state
= state
< kNumLitStates
? 9 : 11;
265 prob
= probs
+ IsRepG1
+ state
;
274 prob
= probs
+ IsRepG2
+ state
;
291 state
= state
< kNumLitStates
? 8 : 11;
292 prob
= probs
+ RepLenCoder
;
295 #ifdef _LZMA_SIZE_OPT
297 unsigned lim
, offset
;
298 CLzmaProb
*probLen
= prob
+ LenChoice
;
302 probLen
= prob
+ LenLow
+ (posState
<< kLenNumLowBits
);
304 lim
= (1 << kLenNumLowBits
);
309 probLen
= prob
+ LenChoice2
;
313 probLen
= prob
+ LenMid
+ (posState
<< kLenNumMidBits
);
314 offset
= kLenNumLowSymbols
;
315 lim
= (1 << kLenNumMidBits
);
320 probLen
= prob
+ LenHigh
;
321 offset
= kLenNumLowSymbols
+ kLenNumMidSymbols
;
322 lim
= (1 << kLenNumHighBits
);
325 TREE_DECODE(probLen
, lim
, len
);
330 CLzmaProb
*probLen
= prob
+ LenChoice
;
334 probLen
= prob
+ LenLow
+ (posState
<< kLenNumLowBits
);
336 TREE_GET_BIT(probLen
, len
);
337 TREE_GET_BIT(probLen
, len
);
338 TREE_GET_BIT(probLen
, len
);
344 probLen
= prob
+ LenChoice2
;
348 probLen
= prob
+ LenMid
+ (posState
<< kLenNumMidBits
);
350 TREE_GET_BIT(probLen
, len
);
351 TREE_GET_BIT(probLen
, len
);
352 TREE_GET_BIT(probLen
, len
);
357 probLen
= prob
+ LenHigh
;
358 TREE_DECODE(probLen
, (1 << kLenNumHighBits
), len
);
359 len
+= kLenNumLowSymbols
+ kLenNumMidSymbols
;
365 if (state
>= kNumStates
)
368 prob
= probs
+ PosSlot
+
369 ((len
< kNumLenToPosStates
? len
: kNumLenToPosStates
- 1) << kNumPosSlotBits
);
370 TREE_6_DECODE(prob
, distance
);
371 if (distance
>= kStartPosModelIndex
)
373 unsigned posSlot
= (unsigned)distance
;
374 unsigned numDirectBits
= (unsigned)(((distance
>> 1) - 1));
375 distance
= (2 | (distance
& 1));
376 if (posSlot
< kEndPosModelIndex
)
378 distance
<<= numDirectBits
;
379 prob
= probs
+ SpecPos
+ distance
- posSlot
- 1;
385 GET_BIT2(prob
+ i
, i
, ; , distance
|= mask
);
388 while (--numDirectBits
!= 0);
393 numDirectBits
-= kNumAlignBits
;
402 t
= (0 - ((UInt32
)code
>> 31)); /* (UInt32)((Int32)code >> 31) */
403 distance
= (distance
<< 1) + (t
+ 1);
415 while (--numDirectBits
!= 0);
416 prob
= probs
+ Align
;
417 distance
<<= kNumAlignBits
;
420 GET_BIT2(prob
+ i
, i
, ; , distance
|= 1);
421 GET_BIT2(prob
+ i
, i
, ; , distance
|= 2);
422 GET_BIT2(prob
+ i
, i
, ; , distance
|= 4);
423 GET_BIT2(prob
+ i
, i
, ; , distance
|= 8);
425 if (distance
== (UInt32
)0xFFFFFFFF)
427 len
+= kMatchSpecLenStart
;
438 if (checkDicSize
== 0)
440 if (distance
>= processedPos
)
443 return SZ_ERROR_DATA
;
446 else if (distance
>= checkDicSize
)
449 return SZ_ERROR_DATA
;
451 state
= (state
< kNumStates
+ kNumLitStates
) ? kNumLitStates
: kNumLitStates
+ 3;
461 if ((rem
= limit
- dicPos
) == 0)
464 return SZ_ERROR_DATA
;
467 curLen
= ((rem
< len
) ? (unsigned)rem
: len
);
468 pos
= dicPos
- rep0
+ (dicPos
< rep0
? dicBufSize
: 0);
470 processedPos
+= curLen
;
473 if (curLen
<= dicBufSize
- pos
)
475 Byte
*dest
= dic
+ dicPos
;
476 ptrdiff_t src
= (ptrdiff_t)pos
- (ptrdiff_t)dicPos
;
477 const Byte
*lim
= dest
+ curLen
;
480 *(dest
) = (Byte
)*(dest
+ src
);
481 while (++dest
!= lim
);
487 dic
[dicPos
++] = dic
[pos
];
488 if (++pos
== dicBufSize
)
491 while (--curLen
!= 0);
496 while (dicPos
< limit
&& buf
< bufLimit
);
505 p
->processedPos
= processedPos
;
515 static void MY_FAST_CALL
LzmaDec_WriteRem(CLzmaDec
*p
, SizeT limit
)
517 if (p
->remainLen
!= 0 && p
->remainLen
< kMatchSpecLenStart
)
520 SizeT dicPos
= p
->dicPos
;
521 SizeT dicBufSize
= p
->dicBufSize
;
522 unsigned len
= p
->remainLen
;
523 SizeT rep0
= p
->reps
[0]; /* we use SizeT to avoid the BUG of VC14 for AMD64 */
524 SizeT rem
= limit
- dicPos
;
526 len
= (unsigned)(rem
);
528 if (p
->checkDicSize
== 0 && p
->prop
.dicSize
- p
->processedPos
<= len
)
529 p
->checkDicSize
= p
->prop
.dicSize
;
531 p
->processedPos
+= len
;
536 dic
[dicPos
] = dic
[dicPos
- rep0
+ (dicPos
< rep0
? dicBufSize
: 0)];
543 static int MY_FAST_CALL
LzmaDec_DecodeReal2(CLzmaDec
*p
, SizeT limit
, const Byte
*bufLimit
)
547 SizeT limit2
= limit
;
548 if (p
->checkDicSize
== 0)
550 UInt32 rem
= p
->prop
.dicSize
- p
->processedPos
;
551 if (limit
- p
->dicPos
> rem
)
552 limit2
= p
->dicPos
+ rem
;
555 RINOK(LzmaDec_DecodeReal(p
, limit2
, bufLimit
));
557 if (p
->checkDicSize
== 0 && p
->processedPos
>= p
->prop
.dicSize
)
558 p
->checkDicSize
= p
->prop
.dicSize
;
560 LzmaDec_WriteRem(p
, limit
);
562 while (p
->dicPos
< limit
&& p
->buf
< bufLimit
&& p
->remainLen
< kMatchSpecLenStart
);
564 if (p
->remainLen
> kMatchSpecLenStart
)
565 p
->remainLen
= kMatchSpecLenStart
;
572 DUMMY_ERROR
, /* unexpected end of input stream */
578 static ELzmaDummy
LzmaDec_TryDummy(const CLzmaDec
*p
, const Byte
*buf
, SizeT inSize
)
580 UInt32 range
= p
->range
;
581 UInt32 code
= p
->code
;
582 const Byte
*bufLimit
= buf
+ inSize
;
583 const CLzmaProb
*probs
= p
->probs
;
584 unsigned state
= p
->state
;
588 const CLzmaProb
*prob
;
591 unsigned posState
= (p
->processedPos
) & ((1 << p
->prop
.pb
) - 1);
593 prob
= probs
+ IsMatch
+ (state
<< kNumPosBitsMax
) + posState
;
598 /* if (bufLimit - buf >= 7) return DUMMY_LIT; */
600 prob
= probs
+ Literal
;
601 if (p
->checkDicSize
!= 0 || p
->processedPos
!= 0)
602 prob
+= ((UInt32
)LZMA_LIT_SIZE
*
603 ((((p
->processedPos
) & ((1 << (p
->prop
.lp
)) - 1)) << p
->prop
.lc
) +
604 (p
->dic
[(p
->dicPos
== 0 ? p
->dicBufSize
: p
->dicPos
) - 1] >> (8 - p
->prop
.lc
))));
606 if (state
< kNumLitStates
)
609 do { GET_BIT_CHECK(prob
+ symbol
, symbol
) } while (symbol
< 0x100);
613 unsigned matchByte
= p
->dic
[p
->dicPos
- p
->reps
[0] +
614 (p
->dicPos
< p
->reps
[0] ? p
->dicBufSize
: 0)];
615 unsigned offs
= 0x100;
620 const CLzmaProb
*probLit
;
622 bit
= (matchByte
& offs
);
623 probLit
= prob
+ offs
+ bit
+ symbol
;
624 GET_BIT2_CHECK(probLit
, symbol
, offs
&= ~bit
, offs
&= bit
)
626 while (symbol
< 0x100);
635 prob
= probs
+ IsRep
+ state
;
640 prob
= probs
+ LenCoder
;
647 prob
= probs
+ IsRepG0
+ state
;
651 prob
= probs
+ IsRep0Long
+ (state
<< kNumPosBitsMax
) + posState
;
666 prob
= probs
+ IsRepG1
+ state
;
674 prob
= probs
+ IsRepG2
+ state
;
686 prob
= probs
+ RepLenCoder
;
689 unsigned limit
, offset
;
690 const CLzmaProb
*probLen
= prob
+ LenChoice
;
691 IF_BIT_0_CHECK(probLen
)
694 probLen
= prob
+ LenLow
+ (posState
<< kLenNumLowBits
);
696 limit
= 1 << kLenNumLowBits
;
701 probLen
= prob
+ LenChoice2
;
702 IF_BIT_0_CHECK(probLen
)
705 probLen
= prob
+ LenMid
+ (posState
<< kLenNumMidBits
);
706 offset
= kLenNumLowSymbols
;
707 limit
= 1 << kLenNumMidBits
;
712 probLen
= prob
+ LenHigh
;
713 offset
= kLenNumLowSymbols
+ kLenNumMidSymbols
;
714 limit
= 1 << kLenNumHighBits
;
717 TREE_DECODE_CHECK(probLen
, limit
, len
);
724 prob
= probs
+ PosSlot
+
725 ((len
< kNumLenToPosStates
? len
: kNumLenToPosStates
- 1) <<
727 TREE_DECODE_CHECK(prob
, 1 << kNumPosSlotBits
, posSlot
);
728 if (posSlot
>= kStartPosModelIndex
)
730 unsigned numDirectBits
= ((posSlot
>> 1) - 1);
732 /* if (bufLimit - buf >= 8) return DUMMY_MATCH; */
734 if (posSlot
< kEndPosModelIndex
)
736 prob
= probs
+ SpecPos
+ ((2 | (posSlot
& 1)) << numDirectBits
) - posSlot
- 1;
740 numDirectBits
-= kNumAlignBits
;
745 code
-= range
& (((code
- range
) >> 31) - 1);
746 /* if (code >= range) code -= range; */
748 while (--numDirectBits
!= 0);
749 prob
= probs
+ Align
;
750 numDirectBits
= kNumAlignBits
;
756 GET_BIT_CHECK(prob
+ i
, i
);
758 while (--numDirectBits
!= 0);
769 void LzmaDec_InitDicAndState(CLzmaDec
*p
, Bool initDic
, Bool initState
)
779 p
->needInitState
= 1;
782 p
->needInitState
= 1;
785 void LzmaDec_Init(CLzmaDec
*p
)
788 LzmaDec_InitDicAndState(p
, True
, True
);
791 static void LzmaDec_InitStateReal(CLzmaDec
*p
)
793 SizeT numProbs
= LzmaProps_GetNumProbs(&p
->prop
);
795 CLzmaProb
*probs
= p
->probs
;
796 for (i
= 0; i
< numProbs
; i
++)
797 probs
[i
] = kBitModelTotal
>> 1;
798 p
->reps
[0] = p
->reps
[1] = p
->reps
[2] = p
->reps
[3] = 1;
800 p
->needInitState
= 0;
803 SRes
LzmaDec_DecodeToDic(CLzmaDec
*p
, SizeT dicLimit
, const Byte
*src
, SizeT
*srcLen
,
804 ELzmaFinishMode finishMode
, ELzmaStatus
*status
)
806 SizeT inSize
= *srcLen
;
808 LzmaDec_WriteRem(p
, dicLimit
);
810 *status
= LZMA_STATUS_NOT_SPECIFIED
;
812 while (p
->remainLen
!= kMatchSpecLenStart
)
818 for (; inSize
> 0 && p
->tempBufSize
< RC_INIT_SIZE
; (*srcLen
)++, inSize
--)
819 p
->tempBuf
[p
->tempBufSize
++] = *src
++;
820 if (p
->tempBufSize
< RC_INIT_SIZE
)
822 *status
= LZMA_STATUS_NEEDS_MORE_INPUT
;
825 if (p
->tempBuf
[0] != 0)
826 return SZ_ERROR_DATA
;
828 ((UInt32
)p
->tempBuf
[1] << 24)
829 | ((UInt32
)p
->tempBuf
[2] << 16)
830 | ((UInt32
)p
->tempBuf
[3] << 8)
831 | ((UInt32
)p
->tempBuf
[4]);
832 p
->range
= 0xFFFFFFFF;
838 if (p
->dicPos
>= dicLimit
)
840 if (p
->remainLen
== 0 && p
->code
== 0)
842 *status
= LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK
;
845 if (finishMode
== LZMA_FINISH_ANY
)
847 *status
= LZMA_STATUS_NOT_FINISHED
;
850 if (p
->remainLen
!= 0)
852 *status
= LZMA_STATUS_NOT_FINISHED
;
853 return SZ_ERROR_DATA
;
858 if (p
->needInitState
)
859 LzmaDec_InitStateReal(p
);
861 if (p
->tempBufSize
== 0)
864 const Byte
*bufLimit
;
865 if (inSize
< LZMA_REQUIRED_INPUT_MAX
|| checkEndMarkNow
)
867 int dummyRes
= LzmaDec_TryDummy(p
, src
, inSize
);
868 if (dummyRes
== DUMMY_ERROR
)
870 memcpy(p
->tempBuf
, src
, inSize
);
871 p
->tempBufSize
= (unsigned)inSize
;
873 *status
= LZMA_STATUS_NEEDS_MORE_INPUT
;
876 if (checkEndMarkNow
&& dummyRes
!= DUMMY_MATCH
)
878 *status
= LZMA_STATUS_NOT_FINISHED
;
879 return SZ_ERROR_DATA
;
884 bufLimit
= src
+ inSize
- LZMA_REQUIRED_INPUT_MAX
;
886 if (LzmaDec_DecodeReal2(p
, dicLimit
, bufLimit
) != 0)
887 return SZ_ERROR_DATA
;
888 processed
= (SizeT
)(p
->buf
- src
);
889 (*srcLen
) += processed
;
895 unsigned rem
= p
->tempBufSize
, lookAhead
= 0;
896 while (rem
< LZMA_REQUIRED_INPUT_MAX
&& lookAhead
< inSize
)
897 p
->tempBuf
[rem
++] = src
[lookAhead
++];
898 p
->tempBufSize
= rem
;
899 if (rem
< LZMA_REQUIRED_INPUT_MAX
|| checkEndMarkNow
)
901 int dummyRes
= LzmaDec_TryDummy(p
, p
->tempBuf
, rem
);
902 if (dummyRes
== DUMMY_ERROR
)
904 (*srcLen
) += lookAhead
;
905 *status
= LZMA_STATUS_NEEDS_MORE_INPUT
;
908 if (checkEndMarkNow
&& dummyRes
!= DUMMY_MATCH
)
910 *status
= LZMA_STATUS_NOT_FINISHED
;
911 return SZ_ERROR_DATA
;
915 if (LzmaDec_DecodeReal2(p
, dicLimit
, p
->buf
) != 0)
916 return SZ_ERROR_DATA
;
919 unsigned kkk
= (unsigned)(p
->buf
- p
->tempBuf
);
921 return SZ_ERROR_FAIL
; /* some internal error */
924 return SZ_ERROR_FAIL
; /* some internal error */
927 (*srcLen
) += lookAhead
;
934 *status
= LZMA_STATUS_FINISHED_WITH_MARK
;
935 return (p
->code
== 0) ? SZ_OK
: SZ_ERROR_DATA
;
938 SRes
LzmaDec_DecodeToBuf(CLzmaDec
*p
, Byte
*dest
, SizeT
*destLen
, const Byte
*src
, SizeT
*srcLen
, ELzmaFinishMode finishMode
, ELzmaStatus
*status
)
940 SizeT outSize
= *destLen
;
941 SizeT inSize
= *srcLen
;
942 *srcLen
= *destLen
= 0;
945 SizeT inSizeCur
= inSize
, outSizeCur
, dicPos
;
946 ELzmaFinishMode curFinishMode
;
948 if (p
->dicPos
== p
->dicBufSize
)
951 if (outSize
> p
->dicBufSize
- dicPos
)
953 outSizeCur
= p
->dicBufSize
;
954 curFinishMode
= LZMA_FINISH_ANY
;
958 outSizeCur
= dicPos
+ outSize
;
959 curFinishMode
= finishMode
;
962 res
= LzmaDec_DecodeToDic(p
, outSizeCur
, src
, &inSizeCur
, curFinishMode
, status
);
965 *srcLen
+= inSizeCur
;
966 outSizeCur
= p
->dicPos
- dicPos
;
967 memcpy(dest
, p
->dic
+ dicPos
, outSizeCur
);
969 outSize
-= outSizeCur
;
970 *destLen
+= outSizeCur
;
973 if (outSizeCur
== 0 || outSize
== 0)
978 void LzmaDec_FreeProbs(CLzmaDec
*p
, ISzAlloc
*alloc
)
980 alloc
->Free(alloc
, p
->probs
);
984 static void LzmaDec_FreeDict(CLzmaDec
*p
, ISzAlloc
*alloc
)
986 alloc
->Free(alloc
, p
->dic
);
990 void LzmaDec_Free(CLzmaDec
*p
, ISzAlloc
*alloc
)
992 LzmaDec_FreeProbs(p
, alloc
);
993 LzmaDec_FreeDict(p
, alloc
);
996 SRes
LzmaProps_Decode(CLzmaProps
*p
, const Byte
*data
, unsigned size
)
1001 if (size
< LZMA_PROPS_SIZE
)
1002 return SZ_ERROR_UNSUPPORTED
;
1004 dicSize
= data
[1] | ((UInt32
)data
[2] << 8) | ((UInt32
)data
[3] << 16) | ((UInt32
)data
[4] << 24);
1006 if (dicSize
< LZMA_DIC_MIN
)
1007 dicSize
= LZMA_DIC_MIN
;
1008 p
->dicSize
= dicSize
;
1011 if (d
>= (9 * 5 * 5))
1012 return SZ_ERROR_UNSUPPORTED
;
1022 static SRes
LzmaDec_AllocateProbs2(CLzmaDec
*p
, const CLzmaProps
*propNew
, ISzAlloc
*alloc
)
1024 UInt32 numProbs
= LzmaProps_GetNumProbs(propNew
);
1025 if (!p
->probs
|| numProbs
!= p
->numProbs
)
1027 LzmaDec_FreeProbs(p
, alloc
);
1028 p
->probs
= (CLzmaProb
*)alloc
->Alloc(alloc
, numProbs
* sizeof(CLzmaProb
));
1029 p
->numProbs
= numProbs
;
1031 return SZ_ERROR_MEM
;
1036 SRes
LzmaDec_AllocateProbs(CLzmaDec
*p
, const Byte
*props
, unsigned propsSize
, ISzAlloc
*alloc
)
1039 RINOK(LzmaProps_Decode(&propNew
, props
, propsSize
));
1040 RINOK(LzmaDec_AllocateProbs2(p
, &propNew
, alloc
));
1045 SRes
LzmaDec_Allocate(CLzmaDec
*p
, const Byte
*props
, unsigned propsSize
, ISzAlloc
*alloc
)
1049 RINOK(LzmaProps_Decode(&propNew
, props
, propsSize
));
1050 RINOK(LzmaDec_AllocateProbs2(p
, &propNew
, alloc
));
1053 UInt32 dictSize
= propNew
.dicSize
;
1054 SizeT mask
= ((UInt32
)1 << 12) - 1;
1055 if (dictSize
>= ((UInt32
)1 << 30)) mask
= ((UInt32
)1 << 22) - 1;
1056 else if (dictSize
>= ((UInt32
)1 << 22)) mask
= ((UInt32
)1 << 20) - 1;;
1057 dicBufSize
= ((SizeT
)dictSize
+ mask
) & ~mask
;
1058 if (dicBufSize
< dictSize
)
1059 dicBufSize
= dictSize
;
1062 if (!p
->dic
|| dicBufSize
!= p
->dicBufSize
)
1064 LzmaDec_FreeDict(p
, alloc
);
1065 p
->dic
= (Byte
*)alloc
->Alloc(alloc
, dicBufSize
);
1068 LzmaDec_FreeProbs(p
, alloc
);
1069 return SZ_ERROR_MEM
;
1072 p
->dicBufSize
= dicBufSize
;
1077 SRes
LzmaDecode(Byte
*dest
, SizeT
*destLen
, const Byte
*src
, SizeT
*srcLen
,
1078 const Byte
*propData
, unsigned propSize
, ELzmaFinishMode finishMode
,
1079 ELzmaStatus
*status
, ISzAlloc
*alloc
)
1083 SizeT outSize
= *destLen
, inSize
= *srcLen
;
1084 *destLen
= *srcLen
= 0;
1085 *status
= LZMA_STATUS_NOT_SPECIFIED
;
1086 if (inSize
< RC_INIT_SIZE
)
1087 return SZ_ERROR_INPUT_EOF
;
1088 LzmaDec_Construct(&p
);
1089 RINOK(LzmaDec_AllocateProbs(&p
, propData
, propSize
, alloc
));
1091 p
.dicBufSize
= outSize
;
1094 res
= LzmaDec_DecodeToDic(&p
, outSize
, src
, srcLen
, finishMode
, status
);
1095 *destLen
= p
.dicPos
;
1096 if (res
== SZ_OK
&& *status
== LZMA_STATUS_NEEDS_MORE_INPUT
)
1097 res
= SZ_ERROR_INPUT_EOF
;
1098 LzmaDec_FreeProbs(&p
, alloc
);