Lines Matching defs:limit
40 #define TREE_DECODE(probs, limit, i) \
41 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
79 #define TREE_DECODE_CHECK(probs, limit, i) \
80 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
195 if (p->dicPos == limit)
206 It decodes additional LZMA-symbols while (p->buf < bufLimit && dicPos < limit),
209 next iteration before limit (bufLimit + LZMA_REQUIRED_INPUT_MAX),
229 int Z7_FASTCALL LZMA_DECODE_REAL(CLzmaDec *p, SizeT limit, const Byte *bufLimit);
234 int Z7_FASTCALL LZMA_DECODE_REAL(CLzmaDec *p, SizeT limit, const Byte *bufLimit)
346 // The caller doesn't allow (dicPos == limit) case here
348 // if (dicPos == limit) { state = state < kNumLitStates ? 9 : 11; len = 1; break; }
553 if ((rem = limit - dicPos) == 0)
593 while (dicPos < limit && buf < bufLimit);
616 static void Z7_FASTCALL LzmaDec_WriteRem(CLzmaDec *p, SizeT limit)
627 SizeT rem = limit - dicPos;
673 It calls LZMA_DECODE_REAL() and it adjusts limit according (p->checkDicSize).
686 static int Z7_FASTCALL LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit)
691 if (limit - p->dicPos > rem)
692 limit = p->dicPos + rem;
695 int res = LZMA_DECODE_REAL(p, limit, bufLimit);
825 unsigned limit, offset;
832 limit = 1 << kLenNumLowBits;
843 limit = 1 << kLenNumLowBits;
850 limit = 1 << kLenNumHighBits;
853 TREE_DECODE_CHECK(probLen, limit, len)