common/lzma/LzmaDec.c

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