1 /**************************************************************************
3 * Copyright 2013-2014 RAD Game Tools and Valve Software
4 * Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
20 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 **************************************************************************/
27 /* LzmaDec.c -- LZMA Decoder
28 2008-11-06 : Igor Pavlov : Public domain */
29 #include "vogl_core.h"
30 #include "lzma_LzmaDec.h"
37 #define kNumTopBits 24
38 #define kTopValue ((UInt32)1 << kNumTopBits)
40 #define kNumBitModelTotalBits 11
41 #define kBitModelTotal (1 << kNumBitModelTotalBits)
42 #define kNumMoveBits 5
44 #define RC_INIT_SIZE 5
47 if (range < kTopValue) \
50 code = (code << 8) | (*buf++); \
56 bound = (range >> kNumBitModelTotalBits) * ttt; \
60 *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));
64 *(p) = (CLzmaProb)(ttt - (ttt >> kNumMoveBits));
65 #define GET_BIT2(p, i, A0, A1) \
78 #define GET_BIT(p, i) GET_BIT2(p, i, ;, ;)
80 #define TREE_GET_BIT(probs, i) \
82 GET_BIT((probs + i), i); \
84 #define TREE_DECODE(probs, limit, i) \
89 TREE_GET_BIT(probs, i); \
90 } while (i < limit); \
94 /* #define _LZMA_SIZE_OPT */
97 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
99 #define TREE_6_DECODE(probs, i) \
102 TREE_GET_BIT(probs, i); \
103 TREE_GET_BIT(probs, i); \
104 TREE_GET_BIT(probs, i); \
105 TREE_GET_BIT(probs, i); \
106 TREE_GET_BIT(probs, i); \
107 TREE_GET_BIT(probs, i); \
112 #define NORMALIZE_CHECK \
113 if (range < kTopValue) \
115 if (buf >= bufLimit) \
116 return DUMMY_ERROR; \
118 code = (code << 8) | (*buf++); \
121 #define IF_BIT_0_CHECK(p) \
124 bound = (range >> kNumBitModelTotalBits) * ttt; \
126 #define UPDATE_0_CHECK range = bound;
127 #define UPDATE_1_CHECK \
130 #define GET_BIT2_CHECK(p, i, A0, A1) \
143 #define GET_BIT_CHECK(p, i) GET_BIT2_CHECK(p, i, ;, ;)
144 #define TREE_DECODE_CHECK(probs, limit, i) \
149 GET_BIT_CHECK(probs + i, i) \
150 } while (i < limit); \
154 #define kNumPosBitsMax 4
155 #define kNumPosStatesMax (1 << kNumPosBitsMax)
157 #define kLenNumLowBits 3
158 #define kLenNumLowSymbols (1 << kLenNumLowBits)
159 #define kLenNumMidBits 3
160 #define kLenNumMidSymbols (1 << kLenNumMidBits)
161 #define kLenNumHighBits 8
162 #define kLenNumHighSymbols (1 << kLenNumHighBits)
165 #define LenChoice2 (LenChoice + 1)
166 #define LenLow (LenChoice2 + 1)
167 #define LenMid (LenLow + (kNumPosStatesMax << kLenNumLowBits))
168 #define LenHigh (LenMid + (kNumPosStatesMax << kLenNumMidBits))
169 #define kNumLenProbs (LenHigh + kLenNumHighSymbols)
171 #define kNumStates 12
172 #define kNumLitStates 7
174 #define kStartPosModelIndex 4
175 #define kEndPosModelIndex 14
176 #define kNumFullDistances (1 << (kEndPosModelIndex >> 1))
178 #define kNumPosSlotBits 6
179 #define kNumLenToPosStates 4
181 #define kNumAlignBits 4
182 #define kAlignTableSize (1 << kNumAlignBits)
184 #define kMatchMinLen 2
185 #define kMatchSpecLenStart (kMatchMinLen + kLenNumLowSymbols + kLenNumMidSymbols + kLenNumHighSymbols)
188 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
189 #define IsRepG0 (IsRep + kNumStates)
190 #define IsRepG1 (IsRepG0 + kNumStates)
191 #define IsRepG2 (IsRepG1 + kNumStates)
192 #define IsRep0Long (IsRepG2 + kNumStates)
193 #define PosSlot (IsRep0Long + (kNumStates << kNumPosBitsMax))
194 #define SpecPos (PosSlot + (kNumLenToPosStates << kNumPosSlotBits))
195 #define Align (SpecPos + kNumFullDistances - kEndPosModelIndex)
196 #define LenCoder (Align + kAlignTableSize)
197 #define RepLenCoder (LenCoder + kNumLenProbs)
198 #define Literal (RepLenCoder + kNumLenProbs)
200 #define LZMA_BASE_SIZE 1846
201 #define LZMA_LIT_SIZE 768
203 #define LzmaProps_GetNumProbs(p) ((UInt32)LZMA_BASE_SIZE + (LZMA_LIT_SIZE << ((p)->lc + (p)->lp)))
205 #if Literal != LZMA_BASE_SIZE
208 static const Byte kLiteralNextStates[kNumStates * 2] =
210 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5,
211 7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10
214 #define LZMA_DIC_MIN (1 << 12)
216 /* First LZMA-symbol is always decoded.
217 And it decodes new LZMA-symbols while (buf < bufLimit), but "buf" is without last normalization
221 SZ_ERROR_DATA - Error
223 < kMatchSpecLenStart : normal remain
224 = kMatchSpecLenStart : finished
225 = kMatchSpecLenStart + 1 : Flush marker
226 = kMatchSpecLenStart + 2 : State Init Marker
229 static int MY_FAST_CALL LzmaDec_DecodeReal(CLzmaDec *p, SizeT limit, const Byte *bufLimit)
231 CLzmaProb *probs = p->probs;
233 unsigned state = p->state;
234 UInt32 rep0 = p->reps[0], rep1 = p->reps[1], rep2 = p->reps[2], rep3 = p->reps[3];
235 unsigned pbMask = ((unsigned)1 << (p->prop.pb)) - 1;
236 unsigned lpMask = ((unsigned)1 << (p->prop.lp)) - 1;
237 unsigned lc = p->prop.lc;
240 SizeT dicBufSize = p->dicBufSize;
241 SizeT dicPos = p->dicPos;
243 UInt32 processedPos = p->processedPos;
244 UInt32 checkDicSize = p->checkDicSize;
247 const Byte *buf = p->buf;
248 UInt32 range = p->range;
249 UInt32 code = p->code;
256 unsigned posState = processedPos & pbMask;
258 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
263 prob = probs + Literal;
264 if (checkDicSize != 0 || processedPos != 0)
265 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
266 (dic[(dicPos == 0 ? dicBufSize : dicPos) - 1] >> (8 - lc))));
268 if (state < kNumLitStates)
273 GET_BIT(prob + symbol, symbol)
274 } while (symbol < 0x100);
278 unsigned matchByte = p->dic[(dicPos - rep0) + ((dicPos < rep0) ? dicBufSize : 0)];
279 unsigned offs = 0x100;
286 bit = (matchByte & offs);
287 probLit = prob + offs + bit + symbol;
288 GET_BIT2(probLit, symbol, offs &= ~bit, offs &= bit)
289 } while (symbol < 0x100);
291 dic[dicPos++] = (Byte)symbol;
294 state = kLiteralNextStates[state];
295 /* if (state < 4) state = 0; else if (state < 10) state -= 3; else state -= 6; */
301 prob = probs + IsRep + state;
306 prob = probs + LenCoder;
311 if (checkDicSize == 0 && processedPos == 0)
312 return SZ_ERROR_DATA;
313 prob = probs + IsRepG0 + state;
317 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
321 dic[dicPos] = dic[(dicPos - rep0) + ((dicPos < rep0) ? dicBufSize : 0)];
324 state = state < kNumLitStates ? 9 : 11;
333 prob = probs + IsRepG1 + state;
342 prob = probs + IsRepG2 + state;
359 state = state < kNumLitStates ? 8 : 11;
360 prob = probs + RepLenCoder;
363 unsigned limit, offset;
364 CLzmaProb *probLen = prob + LenChoice;
368 probLen = prob + LenLow + (posState << kLenNumLowBits);
370 limit = (1 << kLenNumLowBits);
375 probLen = prob + LenChoice2;
379 probLen = prob + LenMid + (posState << kLenNumMidBits);
380 offset = kLenNumLowSymbols;
381 limit = (1 << kLenNumMidBits);
386 probLen = prob + LenHigh;
387 offset = kLenNumLowSymbols + kLenNumMidSymbols;
388 limit = (1 << kLenNumHighBits);
391 TREE_DECODE(probLen, limit, len);
395 if (state >= kNumStates)
398 prob = probs + PosSlot +
399 ((len < kNumLenToPosStates ? len : kNumLenToPosStates - 1) << kNumPosSlotBits);
400 TREE_6_DECODE(prob, distance);
401 if (distance >= kStartPosModelIndex)
403 unsigned posSlot = (unsigned)distance;
404 int numDirectBits = (int)(((distance >> 1) - 1));
405 distance = (2 | (distance & 1));
406 if (posSlot < kEndPosModelIndex)
408 distance <<= numDirectBits;
409 prob = probs + SpecPos + distance - posSlot - 1;
415 GET_BIT2(prob + i, i, ;, distance |= mask);
417 } while (--numDirectBits != 0);
422 numDirectBits -= kNumAlignBits;
431 t = (0 - ((UInt32)code >> 31)); /* (UInt32)((Int32)code >> 31) */
432 distance = (distance << 1) + (t + 1);
443 } while (--numDirectBits != 0);
444 prob = probs + Align;
445 distance <<= kNumAlignBits;
448 GET_BIT2(prob + i, i, ;, distance |= 1);
449 GET_BIT2(prob + i, i, ;, distance |= 2);
450 GET_BIT2(prob + i, i, ;, distance |= 4);
451 GET_BIT2(prob + i, i, ;, distance |= 8);
453 if (distance == (UInt32)0xFFFFFFFF)
455 len += kMatchSpecLenStart;
465 if (checkDicSize == 0)
467 if (distance >= processedPos)
468 return SZ_ERROR_DATA;
470 else if (distance >= checkDicSize)
471 return SZ_ERROR_DATA;
472 state = (state < kNumStates + kNumLitStates) ? kNumLitStates : kNumLitStates + 3;
473 /* state = kLiteralNextStates[state]; */
479 return SZ_ERROR_DATA;
481 SizeT rem = limit - dicPos;
482 unsigned curLen = ((rem < len) ? (unsigned)rem : len);
483 SizeT pos = (dicPos - rep0) + ((dicPos < rep0) ? dicBufSize : 0);
485 processedPos += curLen;
488 if (pos + curLen <= dicBufSize)
490 Byte *dest = dic + dicPos;
491 ptrdiff_t src = (ptrdiff_t)pos - (ptrdiff_t)dicPos;
492 const Byte *lim = dest + curLen;
495 *(dest) = (Byte) * (dest + src);
496 while (++dest != lim);
502 dic[dicPos++] = dic[pos];
503 if (++pos == dicBufSize)
505 } while (--curLen != 0);
509 } while (dicPos < limit && buf < bufLimit);
516 p->processedPos = processedPos;
526 static void MY_FAST_CALL LzmaDec_WriteRem(CLzmaDec *p, SizeT limit)
528 if (p->remainLen != 0 && p->remainLen < kMatchSpecLenStart)
531 SizeT dicPos = p->dicPos;
532 SizeT dicBufSize = p->dicBufSize;
533 unsigned len = p->remainLen;
534 UInt32 rep0 = p->reps[0];
535 if (limit - dicPos < len)
536 len = (unsigned)(limit - dicPos);
538 if (p->checkDicSize == 0 && p->prop.dicSize - p->processedPos <= len)
539 p->checkDicSize = p->prop.dicSize;
541 p->processedPos += len;
545 dic[dicPos] = dic[(dicPos - rep0) + ((dicPos < rep0) ? dicBufSize : 0)];
552 static int MY_FAST_CALL LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit)
556 SizeT limit2 = limit;
557 if (p->checkDicSize == 0)
559 UInt32 rem = p->prop.dicSize - p->processedPos;
560 if (limit - p->dicPos > rem)
561 limit2 = p->dicPos + rem;
563 RINOK(LzmaDec_DecodeReal(p, limit2, bufLimit));
564 if (p->processedPos >= p->prop.dicSize)
565 p->checkDicSize = p->prop.dicSize;
566 LzmaDec_WriteRem(p, limit);
567 } while (p->dicPos < limit && p->buf < bufLimit && p->remainLen < kMatchSpecLenStart);
569 if (p->remainLen > kMatchSpecLenStart)
571 p->remainLen = kMatchSpecLenStart;
578 DUMMY_ERROR, /* unexpected end of input stream */
584 static ELzmaDummy LzmaDec_TryDummy(const CLzmaDec *p, const Byte *buf, SizeT inSize)
586 UInt32 range = p->range;
587 UInt32 code = p->code;
588 const Byte *bufLimit = buf + inSize;
589 CLzmaProb *probs = p->probs;
590 unsigned state = p->state;
597 unsigned posState = (p->processedPos) & ((1 << p->prop.pb) - 1);
599 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
604 /* if (bufLimit - buf >= 7) return DUMMY_LIT; */
606 prob = probs + Literal;
607 if (p->checkDicSize != 0 || p->processedPos != 0)
608 prob += (LZMA_LIT_SIZE *
609 ((((p->processedPos) & ((1 << (p->prop.lp)) - 1)) << p->prop.lc) +
610 (p->dic[(p->dicPos == 0 ? p->dicBufSize : p->dicPos) - 1] >> (8 - p->prop.lc))));
612 if (state < kNumLitStates)
617 GET_BIT_CHECK(prob + symbol, symbol)
618 } while (symbol < 0x100);
622 unsigned matchByte = p->dic[p->dicPos - p->reps[0] +
623 ((p->dicPos < p->reps[0]) ? p->dicBufSize : 0)];
624 unsigned offs = 0x100;
631 bit = (matchByte & offs);
632 probLit = prob + offs + bit + symbol;
633 GET_BIT2_CHECK(probLit, symbol, offs &= ~bit, offs &= bit)
634 } while (symbol < 0x100);
643 prob = probs + IsRep + state;
648 prob = probs + LenCoder;
655 prob = probs + IsRepG0 + state;
659 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
674 prob = probs + IsRepG1 + state;
682 prob = probs + IsRepG2 + state;
694 prob = probs + RepLenCoder;
697 unsigned limit, offset;
698 CLzmaProb *probLen = prob + LenChoice;
699 IF_BIT_0_CHECK(probLen)
702 probLen = prob + LenLow + (posState << kLenNumLowBits);
704 limit = 1 << kLenNumLowBits;
709 probLen = prob + LenChoice2;
710 IF_BIT_0_CHECK(probLen)
713 probLen = prob + LenMid + (posState << kLenNumMidBits);
714 offset = kLenNumLowSymbols;
715 limit = 1 << kLenNumMidBits;
720 probLen = prob + LenHigh;
721 offset = kLenNumLowSymbols + kLenNumMidSymbols;
722 limit = 1 << kLenNumHighBits;
725 TREE_DECODE_CHECK(probLen, limit, len);
732 prob = probs + PosSlot +
733 ((len < kNumLenToPosStates ? len : kNumLenToPosStates - 1) << kNumPosSlotBits);
734 TREE_DECODE_CHECK(prob, 1 << kNumPosSlotBits, posSlot);
735 if (posSlot >= kStartPosModelIndex)
737 int numDirectBits = ((posSlot >> 1) - 1);
739 /* if (bufLimit - buf >= 8) return DUMMY_MATCH; */
741 if (posSlot < kEndPosModelIndex)
743 prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;
747 numDirectBits -= kNumAlignBits;
752 code -= range & (((code - range) >> 31) - 1);
753 /* if (code >= range) code -= range; */
754 } while (--numDirectBits != 0);
755 prob = probs + Align;
756 numDirectBits = kNumAlignBits;
762 GET_BIT_CHECK(prob + i, i);
763 } while (--numDirectBits != 0);
773 static void LzmaDec_InitRc(CLzmaDec *p, const Byte *data)
775 p->code = ((UInt32)data[1] << 24) | ((UInt32)data[2] << 16) | ((UInt32)data[3] << 8) | ((UInt32)data[4]);
776 p->range = 0xFFFFFFFF;
780 void LzmaDec_InitDicAndState(CLzmaDec *p, Bool initDic, Bool initState)
790 p->needInitState = 1;
793 p->needInitState = 1;
796 void LzmaDec_Init(CLzmaDec *p)
799 LzmaDec_InitDicAndState(p, True, True);
802 static void LzmaDec_InitStateReal(CLzmaDec *p)
804 UInt32 numProbs = Literal + ((UInt32)LZMA_LIT_SIZE << (p->prop.lc + p->prop.lp));
806 CLzmaProb *probs = p->probs;
807 for (i = 0; i < numProbs; i++)
808 probs[i] = kBitModelTotal >> 1;
809 p->reps[0] = p->reps[1] = p->reps[2] = p->reps[3] = 1;
811 p->needInitState = 0;
814 SRes LzmaDec_DecodeToDic(CLzmaDec *p, SizeT dicLimit, const Byte *src, SizeT *srcLen,
815 ELzmaFinishMode finishMode, ELzmaStatus *status)
817 SizeT inSize = *srcLen;
819 LzmaDec_WriteRem(p, dicLimit);
821 *status = LZMA_STATUS_NOT_SPECIFIED;
823 while (p->remainLen != kMatchSpecLenStart)
827 if (p->needFlush != 0)
829 for (; inSize > 0 && p->tempBufSize < RC_INIT_SIZE; (*srcLen)++, inSize--)
830 p->tempBuf[p->tempBufSize++] = *src++;
831 if (p->tempBufSize < RC_INIT_SIZE)
833 *status = LZMA_STATUS_NEEDS_MORE_INPUT;
836 if (p->tempBuf[0] != 0)
837 return SZ_ERROR_DATA;
839 LzmaDec_InitRc(p, p->tempBuf);
844 if (p->dicPos >= dicLimit)
846 if (p->remainLen == 0 && p->code == 0)
848 *status = LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK;
851 if (finishMode == LZMA_FINISH_ANY)
853 *status = LZMA_STATUS_NOT_FINISHED;
856 if (p->remainLen != 0)
858 *status = LZMA_STATUS_NOT_FINISHED;
859 return SZ_ERROR_DATA;
864 if (p->needInitState)
865 LzmaDec_InitStateReal(p);
867 if (p->tempBufSize == 0)
870 const Byte *bufLimit;
871 if (inSize < LZMA_REQUIRED_INPUT_MAX || checkEndMarkNow)
873 int dummyRes = LzmaDec_TryDummy(p, src, inSize);
874 if (dummyRes == DUMMY_ERROR)
876 memcpy(p->tempBuf, src, inSize);
877 p->tempBufSize = (unsigned)inSize;
879 *status = LZMA_STATUS_NEEDS_MORE_INPUT;
882 if (checkEndMarkNow && dummyRes != DUMMY_MATCH)
884 *status = LZMA_STATUS_NOT_FINISHED;
885 return SZ_ERROR_DATA;
890 bufLimit = src + inSize - LZMA_REQUIRED_INPUT_MAX;
892 if (LzmaDec_DecodeReal2(p, dicLimit, bufLimit) != 0)
893 return SZ_ERROR_DATA;
894 processed = (SizeT)(p->buf - src);
895 (*srcLen) += processed;
901 unsigned rem = p->tempBufSize, lookAhead = 0;
902 while (rem < LZMA_REQUIRED_INPUT_MAX && lookAhead < inSize)
903 p->tempBuf[rem++] = src[lookAhead++];
904 p->tempBufSize = rem;
905 if (rem < LZMA_REQUIRED_INPUT_MAX || checkEndMarkNow)
907 int dummyRes = LzmaDec_TryDummy(p, p->tempBuf, rem);
908 if (dummyRes == DUMMY_ERROR)
910 (*srcLen) += lookAhead;
911 *status = LZMA_STATUS_NEEDS_MORE_INPUT;
914 if (checkEndMarkNow && dummyRes != DUMMY_MATCH)
916 *status = LZMA_STATUS_NOT_FINISHED;
917 return SZ_ERROR_DATA;
921 if (LzmaDec_DecodeReal2(p, dicLimit, p->buf) != 0)
922 return SZ_ERROR_DATA;
923 lookAhead -= (rem - (unsigned)(p->buf - p->tempBuf));
924 (*srcLen) += lookAhead;
931 *status = LZMA_STATUS_FINISHED_WITH_MARK;
932 return (p->code == 0) ? SZ_OK : SZ_ERROR_DATA;
935 SRes LzmaDec_DecodeToBuf(CLzmaDec *p, Byte *dest, SizeT *destLen, const Byte *src, SizeT *srcLen, ELzmaFinishMode finishMode, ELzmaStatus *status)
937 SizeT outSize = *destLen;
938 SizeT inSize = *srcLen;
939 *srcLen = *destLen = 0;
942 SizeT inSizeCur = inSize, outSizeCur, dicPos;
943 ELzmaFinishMode curFinishMode;
945 if (p->dicPos == p->dicBufSize)
948 if (outSize > p->dicBufSize - dicPos)
950 outSizeCur = p->dicBufSize;
951 curFinishMode = LZMA_FINISH_ANY;
955 outSizeCur = dicPos + outSize;
956 curFinishMode = finishMode;
959 res = LzmaDec_DecodeToDic(p, outSizeCur, src, &inSizeCur, curFinishMode, status);
962 *srcLen += inSizeCur;
963 outSizeCur = p->dicPos - dicPos;
964 memcpy(dest, p->dic + dicPos, outSizeCur);
966 outSize -= outSizeCur;
967 *destLen += outSizeCur;
970 if (outSizeCur == 0 || outSize == 0)
975 void LzmaDec_FreeProbs(CLzmaDec *p, ISzAlloc *alloc)
977 alloc->Free(alloc, p->probs);
981 static void LzmaDec_FreeDict(CLzmaDec *p, ISzAlloc *alloc)
983 alloc->Free(alloc, p->dic);
987 void LzmaDec_Free(CLzmaDec *p, ISzAlloc *alloc)
989 LzmaDec_FreeProbs(p, alloc);
990 LzmaDec_FreeDict(p, alloc);
993 SRes LzmaProps_Decode(CLzmaProps *p, const Byte *data, unsigned size)
998 if (size < LZMA_PROPS_SIZE)
999 return SZ_ERROR_UNSUPPORTED;
1001 dicSize = data[1] | ((UInt32)data[2] << 8) | ((UInt32)data[3] << 16) | ((UInt32)data[4] << 24);
1003 if (dicSize < LZMA_DIC_MIN)
1004 dicSize = LZMA_DIC_MIN;
1005 p->dicSize = dicSize;
1008 if (d >= (9 * 5 * 5))
1009 return SZ_ERROR_UNSUPPORTED;
1019 static SRes LzmaDec_AllocateProbs2(CLzmaDec *p, const CLzmaProps *propNew, ISzAlloc *alloc)
1021 UInt32 numProbs = LzmaProps_GetNumProbs(propNew);
1022 if (p->probs == 0 || numProbs != p->numProbs)
1024 LzmaDec_FreeProbs(p, alloc);
1025 p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));
1026 p->numProbs = numProbs;
1028 return SZ_ERROR_MEM;
1033 SRes LzmaDec_AllocateProbs(CLzmaDec *p, const Byte *props, unsigned propsSize, ISzAlloc *alloc)
1036 RINOK(LzmaProps_Decode(&propNew, props, propsSize));
1037 RINOK(LzmaDec_AllocateProbs2(p, &propNew, alloc));
1042 SRes LzmaDec_Allocate(CLzmaDec *p, const Byte *props, unsigned propsSize, ISzAlloc *alloc)
1046 RINOK(LzmaProps_Decode(&propNew, props, propsSize));
1047 RINOK(LzmaDec_AllocateProbs2(p, &propNew, alloc));
1048 dicBufSize = propNew.dicSize;
1049 if (p->dic == 0 || dicBufSize != p->dicBufSize)
1051 LzmaDec_FreeDict(p, alloc);
1052 p->dic = (Byte *)alloc->Alloc(alloc, dicBufSize);
1055 LzmaDec_FreeProbs(p, alloc);
1056 return SZ_ERROR_MEM;
1059 p->dicBufSize = dicBufSize;
1064 SRes LzmaDecode(Byte *dest, SizeT *destLen, const Byte *src, SizeT *srcLen,
1065 const Byte *propData, unsigned propSize, ELzmaFinishMode finishMode,
1066 ELzmaStatus *status, ISzAlloc *alloc)
1070 SizeT inSize = *srcLen;
1071 SizeT outSize = *destLen;
1072 *srcLen = *destLen = 0;
1073 if (inSize < RC_INIT_SIZE)
1074 return SZ_ERROR_INPUT_EOF;
1076 LzmaDec_Construct(&p);
1077 res = LzmaDec_AllocateProbs(&p, propData, propSize, alloc);
1081 p.dicBufSize = outSize;
1086 res = LzmaDec_DecodeToDic(&p, outSize, src, srcLen, finishMode, status);
1088 if (res == SZ_OK && *status == LZMA_STATUS_NEEDS_MORE_INPUT)
1089 res = SZ_ERROR_INPUT_EOF;
1091 (*destLen) = p.dicPos;
1092 LzmaDec_FreeProbs(&p, alloc);