Lines Matching refs:limit
28 #define TREE_DECODE(probs, limit, i) \
29 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
56 #define TREE_DECODE_CHECK(probs, limit, i) \
57 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
131 static int MY_FAST_CALL LzmaDec_DecodeReal(CLzmaDec *p, SizeT limit, const Byte *bufLimit)
262 unsigned limit, offset;
269 limit = (1 << kLenNumLowBits);
280 limit = (1 << kLenNumMidBits);
287 limit = (1 << kLenNumHighBits);
290 TREE_DECODE(probLen, limit, len);
378 if (limit == dicPos)
381 SizeT rem = limit - dicPos;
411 while (dicPos < limit && buf < bufLimit);
428 static void MY_FAST_CALL LzmaDec_WriteRem(CLzmaDec *p, SizeT limit)
437 if (limit - dicPos < len)
438 len = (unsigned)(limit - dicPos);
454 static int MY_FAST_CALL LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit)
458 SizeT limit2 = limit;
462 if (limit - p->dicPos > rem)
468 LzmaDec_WriteRem(p, limit);
470 while (p->dicPos < limit && p->buf < bufLimit && p->remainLen < kMatchSpecLenStart);
598 unsigned limit, offset;
605 limit = 1 << kLenNumLowBits;
616 limit = 1 << kLenNumMidBits;
623 limit = 1 << kLenNumHighBits;
626 TREE_DECODE_CHECK(probLen, limit, len);