30 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }  argument
31 #define TREE_DECODE(probs, limit, i) \  argument
32   { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
37 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)  argument
39 #define TREE_6_DECODE(probs, i) \  argument
41   TREE_GET_BIT(probs, i); \
42   TREE_GET_BIT(probs, i); \
43   TREE_GET_BIT(probs, i); \
44   TREE_GET_BIT(probs, i); \
45   TREE_GET_BIT(probs, i); \
46   TREE_GET_BIT(probs, i); \
59 #define TREE_DECODE_CHECK(probs, limit, i) \  argument
60   { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
136   CLzmaProb *probs = p->probs;  in LzmaDec_DecodeReal()  local
165     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
170       prob = probs + Literal;  in LzmaDec_DecodeReal()
211       prob = probs + IsRep + state;  in LzmaDec_DecodeReal()
216         prob = probs + LenCoder;  in LzmaDec_DecodeReal()
223         prob = probs + IsRepG0 + state;  in LzmaDec_DecodeReal()
227           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
243           prob = probs + IsRepG1 + state;  in LzmaDec_DecodeReal()
252             prob = probs + IsRepG2 + state;  in LzmaDec_DecodeReal()
270         prob = probs + RepLenCoder;  in LzmaDec_DecodeReal()
308         prob = probs + PosSlot +  in LzmaDec_DecodeReal()
319             prob = probs + SpecPos + distance - posSlot - 1;  in LzmaDec_DecodeReal()
362             prob = probs + Align;  in LzmaDec_DecodeReal()
518   CLzmaProb *probs = p->probs;  in LzmaDec_TryDummy()  local
528     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
535       prob = probs + Literal;  in LzmaDec_TryDummy()
570       prob = probs + IsRep + state;  in LzmaDec_TryDummy()
575         prob = probs + LenCoder;  in LzmaDec_TryDummy()
582         prob = probs + IsRepG0 + state;  in LzmaDec_TryDummy()
586           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
601           prob = probs + IsRepG1 + state;  in LzmaDec_TryDummy()
609             prob = probs + IsRepG2 + state;  in LzmaDec_TryDummy()
621         prob = probs + RepLenCoder;  in LzmaDec_TryDummy()
659         prob = probs + PosSlot +  in LzmaDec_TryDummy()
671             prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;  in LzmaDec_TryDummy()
684             prob = probs + Align;  in LzmaDec_TryDummy()
737   CLzmaProb *probs = p->probs;  in LzmaDec_InitStateReal()  local
739     probs[i] = kBitModelTotal >> 1;  in LzmaDec_InitStateReal()
908   alloc->Free(alloc, p->probs);  in LzmaDec_FreeProbs()
909   p->probs = 0;  in LzmaDec_FreeProbs()
953   if (p->probs == 0 || numProbs != p->numProbs)  in LzmaDec_AllocateProbs2()
956     p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));  in LzmaDec_AllocateProbs2()
958     if (p->probs == 0)  in LzmaDec_AllocateProbs2()