Lines Matching full:prob
49 #define NORMAL_LITER_DEC GET_BIT(prob + symbol, symbol)
53 probLit = prob + offs + bit + symbol; \
164 CLzmaProb *prob;
169 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
170 IF_BIT_0(prob)
173 UPDATE_0(prob);
174 prob = probs + Literal;
176 prob += ((UInt32)LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
232 UPDATE_1(prob);
233 prob = probs + IsRep + state;
234 IF_BIT_0(prob)
236 UPDATE_0(prob);
238 prob = probs + LenCoder;
242 UPDATE_1(prob);
245 prob = probs + IsRepG0 + state;
246 IF_BIT_0(prob)
248 UPDATE_0(prob);
249 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
250 IF_BIT_0(prob)
252 UPDATE_0(prob);
259 UPDATE_1(prob);
264 UPDATE_1(prob);
265 prob = probs + IsRepG1 + state;
266 IF_BIT_0(prob)
268 UPDATE_0(prob);
273 UPDATE_1(prob);
274 prob = probs + IsRepG2 + state;
275 IF_BIT_0(prob)
277 UPDATE_0(prob);
282 UPDATE_1(prob);
292 prob = probs + RepLenCoder;
298 CLzmaProb *probLen = prob + LenChoice;
302 probLen = prob + LenLow + (posState << kLenNumLowBits);
309 probLen = prob + LenChoice2;
313 probLen = prob + LenMid + (posState << kLenNumMidBits);
320 probLen = prob + LenHigh;
330 CLzmaProb *probLen = prob + LenChoice;
334 probLen = prob + LenLow + (posState << kLenNumLowBits);
344 probLen = prob + LenChoice2;
348 probLen = prob + LenMid + (posState << kLenNumMidBits);
357 probLen = prob + LenHigh;
368 prob = probs + PosSlot +
370 TREE_6_DECODE(prob, distance);
379 prob = probs + SpecPos + distance - posSlot - 1;
385 GET_BIT2(prob + i, i, ; , distance |= mask);
416 prob = probs + Align;
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);
588 const CLzmaProb *prob;
593 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
594 IF_BIT_0_CHECK(prob)
600 prob = probs + Literal;
602 prob += ((UInt32)LZMA_LIT_SIZE *
609 do { GET_BIT_CHECK(prob + symbol, symbol) } while (symbol < 0x100);
623 probLit = prob + offs + bit + symbol;
635 prob = probs + IsRep + state;
636 IF_BIT_0_CHECK(prob)
640 prob = probs + LenCoder;
647 prob = probs + IsRepG0 + state;
648 IF_BIT_0_CHECK(prob)
651 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
652 IF_BIT_0_CHECK(prob)
666 prob = probs + IsRepG1 + state;
667 IF_BIT_0_CHECK(prob)
674 prob = probs + IsRepG2 + state;
675 IF_BIT_0_CHECK(prob)
686 prob = probs + RepLenCoder;
690 const CLzmaProb *probLen = prob + LenChoice;
694 probLen = prob + LenLow + (posState << kLenNumLowBits);
701 probLen = prob + LenChoice2;
705 probLen = prob + LenMid + (posState << kLenNumMidBits);
712 probLen = prob + LenHigh;
724 prob = probs + PosSlot +
727 TREE_DECODE_CHECK(prob, 1 << kNumPosSlotBits, posSlot);
736 prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;
749 prob = probs + Align;
756 GET_BIT_CHECK(prob + i, i);
