Lines Matching defs:probs
46 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
47 #define TREE_DECODE(probs, limit, i) \
48 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
53 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
55 #define TREE_6_DECODE(probs, i) \
57 TREE_GET_BIT(probs, i); \
58 TREE_GET_BIT(probs, i); \
59 TREE_GET_BIT(probs, i); \
60 TREE_GET_BIT(probs, i); \
61 TREE_GET_BIT(probs, i); \
62 TREE_GET_BIT(probs, i); \
75 #define TREE_DECODE_CHECK(probs, limit, i) \
76 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
158 CLzmaProb *probs = p->probs;
185 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
190 prob = probs + Literal;
226 prob = probs + IsRep + state;
231 prob = probs + LenCoder;
238 prob = probs + IsRepG0 + state;
242 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
258 prob = probs + IsRepG1 + state;
267 prob = probs + IsRepG2 + state;
285 prob = probs + RepLenCoder;
323 prob = probs + PosSlot +
334 prob = probs + SpecPos + distance - posSlot - 1;
371 prob = probs + Align;
519 CLzmaProb *probs = p->probs;
529 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
536 prob = probs + Literal;
571 prob = probs + IsRep + state;
576 prob = probs + LenCoder;
583 prob = probs + IsRepG0 + state;
587 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
602 prob = probs + IsRepG1 + state;
610 prob = probs + IsRepG2 + state;
622 prob = probs + RepLenCoder;
660 prob = probs + PosSlot +
672 prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;
685 prob = probs + Align;
737 CLzmaProb *probs = p->probs;
739 probs[i] = kBitModelTotal >> 1;
908 alloc->Free(alloc, p->probs);
909 p->probs = 0;
953 if (p->probs == 0 || numProbs != p->numProbs)
956 p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));
958 if (p->probs == 0)