27 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }  argument
28 #define TREE_DECODE(probs, limit, i) \  argument
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)  argument
36 #define TREE_6_DECODE(probs, i) \  argument
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) \  argument
57   { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
133   CLzmaProb *probs = p->probs;  in LzmaDec_DecodeReal()  local
160     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
165       prob = probs + Literal;  in LzmaDec_DecodeReal()
200       prob = probs + IsRep + state;  in LzmaDec_DecodeReal()
205         prob = probs + LenCoder;  in LzmaDec_DecodeReal()
212         prob = probs + IsRepG0 + state;  in LzmaDec_DecodeReal()
216           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
232           prob = probs + IsRepG1 + state;  in LzmaDec_DecodeReal()
241             prob = probs + IsRepG2 + state;  in LzmaDec_DecodeReal()
259         prob = probs + RepLenCoder;  in LzmaDec_DecodeReal()
297         prob = probs + PosSlot +  in LzmaDec_DecodeReal()
308             prob = probs + SpecPos + distance - posSlot - 1;  in LzmaDec_DecodeReal()
345             prob = probs + Align;  in LzmaDec_DecodeReal()
492   CLzmaProb *probs = p->probs;  in LzmaDec_TryDummy()  local
502     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
509       prob = probs + Literal;  in LzmaDec_TryDummy()
544       prob = probs + IsRep + state;  in LzmaDec_TryDummy()
549         prob = probs + LenCoder;  in LzmaDec_TryDummy()
556         prob = probs + IsRepG0 + state;  in LzmaDec_TryDummy()
560           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
575           prob = probs + IsRepG1 + state;  in LzmaDec_TryDummy()
583             prob = probs + IsRepG2 + state;  in LzmaDec_TryDummy()
595         prob = probs + RepLenCoder;  in LzmaDec_TryDummy()
633         prob = probs + PosSlot +  in LzmaDec_TryDummy()
645             prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;  in LzmaDec_TryDummy()
658             prob = probs + Align;  in LzmaDec_TryDummy()
711   CLzmaProb *probs = p->probs;  in LzmaDec_InitStateReal()  local
713     probs[i] = kBitModelTotal >> 1;  in LzmaDec_InitStateReal()
882   alloc->Free(alloc, p->probs);  in LzmaDec_FreeProbs()
883   p->probs = 0;  in LzmaDec_FreeProbs()
927   if (p->probs == 0 || numProbs != p->numProbs)  in LzmaDec_AllocateProbs2()
930     p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));  in LzmaDec_AllocateProbs2()
932     if (p->probs == 0)  in LzmaDec_AllocateProbs2()