Lines Matching refs:limit
31 #define TREE_DECODE(probs, limit, i) \ argument
32 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
59 #define TREE_DECODE_CHECK(probs, limit, i) \ argument
60 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
134 static int MY_FAST_CALL LzmaDec_DecodeReal(CLzmaDec *p, SizeT limit, const Byte *bufLimit) in LzmaDec_DecodeReal() argument
273 unsigned limit, offset; in LzmaDec_DecodeReal() local
280 limit = (1 << kLenNumLowBits); in LzmaDec_DecodeReal()
291 limit = (1 << kLenNumMidBits); in LzmaDec_DecodeReal()
298 limit = (1 << kLenNumHighBits); in LzmaDec_DecodeReal()
301 TREE_DECODE(probLen, limit, len); in LzmaDec_DecodeReal()
395 if (limit == dicPos) in LzmaDec_DecodeReal()
398 SizeT rem = limit - dicPos; in LzmaDec_DecodeReal()
434 while (dicPos < limit && buf < bufLimit); in LzmaDec_DecodeReal()
454 static void MY_FAST_CALL LzmaDec_WriteRem(CLzmaDec *p, SizeT limit) in LzmaDec_WriteRem() argument
463 if (limit - dicPos < len) in LzmaDec_WriteRem()
464 len = (unsigned)(limit - dicPos); in LzmaDec_WriteRem()
480 static int MY_FAST_CALL LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit) in LzmaDec_DecodeReal2() argument
484 SizeT limit2 = limit; in LzmaDec_DecodeReal2()
488 if (limit - p->dicPos > rem) in LzmaDec_DecodeReal2()
494 LzmaDec_WriteRem(p, limit); in LzmaDec_DecodeReal2()
496 while (p->dicPos < limit && p->buf < bufLimit && p->remainLen < kMatchSpecLenStart); in LzmaDec_DecodeReal2()
624 unsigned limit, offset; in LzmaDec_TryDummy() local
631 limit = 1 << kLenNumLowBits; in LzmaDec_TryDummy()
642 limit = 1 << kLenNumMidBits; in LzmaDec_TryDummy()
649 limit = 1 << kLenNumHighBits; in LzmaDec_TryDummy()
652 TREE_DECODE_CHECK(probLen, limit, len); in LzmaDec_TryDummy()