29 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }  argument
30 #define TREE_DECODE(probs, limit, i) \  argument
31   { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
36 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)  argument
38 #define TREE_6_DECODE(probs, i) \  argument
40   TREE_GET_BIT(probs, i); \
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); \
65 #define TREE_DECODE_CHECK(probs, limit, i) \  argument
66   { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
142   CLzmaProb *probs = p->probs;  in LzmaDec_DecodeReal()  local
169     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
174       prob = probs + Literal;  in LzmaDec_DecodeReal()
232       prob = probs + IsRep + state;  in LzmaDec_DecodeReal()
237         prob = probs + LenCoder;  in LzmaDec_DecodeReal()
244         prob = probs + IsRepG0 + state;  in LzmaDec_DecodeReal()
248           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
264           prob = probs + IsRepG1 + state;  in LzmaDec_DecodeReal()
273             prob = probs + IsRepG2 + state;  in LzmaDec_DecodeReal()
291         prob = probs + RepLenCoder;  in LzmaDec_DecodeReal()
329         prob = probs + PosSlot +  in LzmaDec_DecodeReal()
340             prob = probs + SpecPos + distance - posSlot - 1;  in LzmaDec_DecodeReal()
377             prob = probs + Align;  in LzmaDec_DecodeReal()
525   CLzmaProb *probs = p->probs;  in LzmaDec_TryDummy()  local
535     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
542       prob = probs + Literal;  in LzmaDec_TryDummy()
577       prob = probs + IsRep + state;  in LzmaDec_TryDummy()
582         prob = probs + LenCoder;  in LzmaDec_TryDummy()
589         prob = probs + IsRepG0 + state;  in LzmaDec_TryDummy()
593           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
608           prob = probs + IsRepG1 + state;  in LzmaDec_TryDummy()
616             prob = probs + IsRepG2 + state;  in LzmaDec_TryDummy()
628         prob = probs + RepLenCoder;  in LzmaDec_TryDummy()
666         prob = probs + PosSlot +  in LzmaDec_TryDummy()
678             prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;  in LzmaDec_TryDummy()
691             prob = probs + Align;  in LzmaDec_TryDummy()
744   CLzmaProb *probs = p->probs;  in LzmaDec_InitStateReal()  local
746     probs[i] = kBitModelTotal >> 1;  in LzmaDec_InitStateReal()
915   alloc->Free(alloc, p->probs);  in LzmaDec_FreeProbs()
916   p->probs = 0;  in LzmaDec_FreeProbs()
960   if (p->probs == 0 || numProbs != p->numProbs)  in LzmaDec_AllocateProbs2()
963     p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));  in LzmaDec_AllocateProbs2()
965     if (p->probs == 0)  in LzmaDec_AllocateProbs2()