Lines Matching refs:probs
27 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
28 #define TREE_DECODE(probs, limit, i) \
29 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
34 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
36 #define TREE_6_DECODE(probs, i) \
38 TREE_GET_BIT(probs, i); \
39 TREE_GET_BIT(probs, i); \
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i); \
42 TREE_GET_BIT(probs, i); \
43 TREE_GET_BIT(probs, i); \
56 #define TREE_DECODE_CHECK(probs, limit, i) \
57 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
133 CLzmaProb *probs = p->probs;
160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
165 prob = probs + Literal;
200 prob = probs + IsRep + state;
205 prob = probs + LenCoder;
212 prob = probs + IsRepG0 + state;
216 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
232 prob = probs + IsRepG1 + state;
241 prob = probs + IsRepG2 + state;
259 prob = probs + RepLenCoder;
297 prob = probs + PosSlot +
308 prob = probs + SpecPos + distance - posSlot - 1;
345 prob = probs + Align;
492 CLzmaProb *probs = p->probs;
502 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
509 prob = probs + Literal;
544 prob = probs + IsRep + state;
549 prob = probs + LenCoder;
556 prob = probs + IsRepG0 + state;
560 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
575 prob = probs + IsRepG1 + state;
583 prob = probs + IsRepG2 + state;
595 prob = probs + RepLenCoder;
633 prob = probs + PosSlot +
645 prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;
658 prob = probs + Align;
711 CLzmaProb *probs = p->probs;
713 probs[i] = kBitModelTotal >> 1;
882 alloc->Free(alloc, p->probs);
883 p->probs = 0;
927 if (p->probs == 0 || numProbs != p->numProbs)
930 p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));
932 if (p->probs == 0)