Cross Reference: /external/lzma/C/LzmaDec.c

Lines Matching full:probs
29 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }

30 #define TREE_DECODE(probs, limit, i) \

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)

38 #define TREE_6_DECODE(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); \

44   TREE_GET_BIT(probs, i); \

45   TREE_GET_BIT(probs, i); \

65 #define TREE_DECODE_CHECK(probs, limit, i) \

66   { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }

142   CLzmaProb *probs = p->probs;

169     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;

174       prob = probs + Literal;

232       prob = probs + IsRep + state;

237         prob = probs + LenCoder;

244         prob = probs + IsRepG0 + state;

248           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;

264           prob = probs + IsRepG1 + state;

273             prob = probs + IsRepG2 + state;

291         prob = probs + RepLenCoder;

329         prob = probs + PosSlot +

340             prob = probs + SpecPos + distance - posSlot - 1;

377             prob = probs + Align;

525   CLzmaProb *probs = p->probs;

535     prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;

542       prob = probs + Literal;

577       prob = probs + IsRep + state;

582         prob = probs + LenCoder;

589         prob = probs + IsRepG0 + state;

593           prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;

608           prob = probs + IsRepG1 + state;

616             prob = probs + IsRepG2 + state;

628         prob = probs + RepLenCoder;

666         prob = probs + PosSlot +

678             prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits) - posSlot - 1;

691             prob = probs + Align;

744   CLzmaProb *probs = p->probs;

746     probs[i] = kBitModelTotal >> 1;

915   alloc->Free(alloc, p->probs);

916   p->probs = 0;

960   if (p->probs == 0 || numProbs != p->numProbs)

963     p->probs = (CLzmaProb *)alloc->Alloc(alloc, numProbs * sizeof(CLzmaProb));

965     if (p->probs == 0)
OpenGrok
