34 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }  argument
35 #define TREE_DECODE(probs, limit, i) \  argument
36   { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
41 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)  argument
43 #define TREE_6_DECODE(probs, i) \  argument
45   TREE_GET_BIT(probs, i); \
46   TREE_GET_BIT(probs, i); \
47   TREE_GET_BIT(probs, i); \
48   TREE_GET_BIT(probs, i); \
49   TREE_GET_BIT(probs, i); \
50   TREE_GET_BIT(probs, i); \
63 #define TREE_DECODE_CHECK(probs, limit, i) \  argument
64   { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
150   CLzmaProb *probs = p->probs;  in LzmaDec_DecodeReal()  local
177     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
182       prob = probs + Literal;  in LzmaDec_DecodeReal()
218       prob = probs + IsRep + state;  in LzmaDec_DecodeReal()
223         prob = probs + LenCoder;  in LzmaDec_DecodeReal()
230         prob = probs + IsRepG0 + state;  in LzmaDec_DecodeReal()
234           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_DecodeReal()
250           prob = probs + IsRepG1 + state;  in LzmaDec_DecodeReal()
259             prob = probs + IsRepG2 + state;  in LzmaDec_DecodeReal()
277         prob = probs + RepLenCoder;  in LzmaDec_DecodeReal()
315         prob = probs + PosSlot +  in LzmaDec_DecodeReal()
326             prob = probs + SpecPos + distance - posSlot - 1;  in LzmaDec_DecodeReal()
363             prob = probs + Align;  in LzmaDec_DecodeReal()
511   CLzmaProb *probs = p->probs;  in LzmaDec_TryDummy()  local
521     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
528       prob = probs + Literal;  in LzmaDec_TryDummy()
563       prob = probs + IsRep + state;  in LzmaDec_TryDummy()
568         prob = probs + LenCoder;  in LzmaDec_TryDummy()
575         prob = probs + IsRepG0 + state;  in LzmaDec_TryDummy()
579           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;  in LzmaDec_TryDummy()
594           prob = probs + IsRepG1 + state;  in LzmaDec_TryDummy()
602             prob = probs + IsRepG2 + state;  in LzmaDec_TryDummy()
614         prob = probs + RepLenCoder;  in LzmaDec_TryDummy()
652         prob = probs + PosSlot +  in LzmaDec_TryDummy()
664             prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;  in LzmaDec_TryDummy()
677             prob = probs + Align;  in LzmaDec_TryDummy()
730   CLzmaProb *probs = p->probs;  in LzmaDec_InitStateReal()  local
732     probs[i] = kBitModelTotal >> 1;  in LzmaDec_InitStateReal()
903   if (p->probs != 0)  in LzmaDec_FreeProbs()
904   	alloc->Free(alloc, p->probs, (p->numProbs * sizeof (*p->probs)));  in LzmaDec_FreeProbs()
905   p->probs = 0;  in LzmaDec_FreeProbs()
950   if (p->probs == 0 || numProbs != p->numProbs)  in LzmaDec_AllocateProbs2()
953     p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));  in LzmaDec_AllocateProbs2()
955     if (p->probs == 0)  in LzmaDec_AllocateProbs2()