Lines Matching refs:prob
155 CLzmaProb *prob;
160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
161 IF_BIT_0(prob)
164 UPDATE_0(prob);
165 prob = probs + Literal;
167 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
174 do { GET_BIT(prob + symbol, symbol) } while (symbol < 0x100);
188 probLit = prob + offs + bit + symbol;
199 UPDATE_1(prob);
200 prob = probs + IsRep + state;
201 IF_BIT_0(prob)
203 UPDATE_0(prob);
205 prob = probs + LenCoder;
209 UPDATE_1(prob);
212 prob = probs + IsRepG0 + state;
213 IF_BIT_0(prob)
215 UPDATE_0(prob);
216 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
217 IF_BIT_0(prob)
219 UPDATE_0(prob);
226 UPDATE_1(prob);
231 UPDATE_1(prob);
232 prob = probs + IsRepG1 + state;
233 IF_BIT_0(prob)
235 UPDATE_0(prob);
240 UPDATE_1(prob);
241 prob = probs + IsRepG2 + state;
242 IF_BIT_0(prob)
244 UPDATE_0(prob);
249 UPDATE_1(prob);
259 prob = probs + RepLenCoder;
263 CLzmaProb *probLen = prob + LenChoice;
267 probLen = prob + LenLow + (posState << kLenNumLowBits);
274 probLen = prob + LenChoice2;
278 probLen = prob + LenMid + (posState << kLenNumMidBits);
285 probLen = prob + LenHigh;
297 prob = probs + PosSlot +
299 TREE_6_DECODE(prob, distance);
308 prob = probs + SpecPos + distance - posSlot - 1;
314 GET_BIT2(prob + i, i, ; , distance |= mask);
345 prob = probs + Align;
349 GET_BIT2(prob + i, i, ; , distance |= 1);
350 GET_BIT2(prob + i, i, ; , distance |= 2);
351 GET_BIT2(prob + i, i, ; , distance |= 4);
352 GET_BIT2(prob + i, i, ; , distance |= 8);
497 CLzmaProb *prob;
502 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
503 IF_BIT_0_CHECK(prob)
509 prob = probs + Literal;
511 prob += (LZMA_LIT_SIZE *
518 do { GET_BIT_CHECK(prob + symbol, symbol) } while (symbol < 0x100);
532 probLit = prob + offs + bit + symbol;
544 prob = probs + IsRep + state;
545 IF_BIT_0_CHECK(prob)
549 prob = probs + LenCoder;
556 prob = probs + IsRepG0 + state;
557 IF_BIT_0_CHECK(prob)
560 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
561 IF_BIT_0_CHECK(prob)
575 prob = probs + IsRepG1 + state;
576 IF_BIT_0_CHECK(prob)
583 prob = probs + IsRepG2 + state;
584 IF_BIT_0_CHECK(prob)
595 prob = probs + RepLenCoder;
599 CLzmaProb *probLen = prob + LenChoice;
603 probLen = prob + LenLow + (posState << kLenNumLowBits);
610 probLen = prob + LenChoice2;
614 probLen = prob + LenMid + (posState << kLenNumMidBits);
621 probLen = prob + LenHigh;
633 prob = probs + PosSlot +
636 TREE_DECODE_CHECK(prob, 1 << kNumPosSlotBits, posSlot);
645 prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;
658 prob = probs + Align;
665 GET_BIT_CHECK(prob + i, i);
