Lines Matching defs:probs

31 #define TREE_GET_BIT(probs, i) { GET_BIT2(probs + i, i, ;, ;); }

40 #define TREE_DECODE(probs, limit, i) \
41 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
46 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
48 #define TREE_6_DECODE(probs, i) \
50 TREE_GET_BIT(probs, i) \
51 TREE_GET_BIT(probs, i) \
52 TREE_GET_BIT(probs, i) \
53 TREE_GET_BIT(probs, i) \
54 TREE_GET_BIT(probs, i) \
55 TREE_GET_BIT(probs, i) \
79 #define TREE_DECODE_CHECK(probs, limit, i) \
80 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
132 #define GET_PROBS p->probs + kStartOffset
135 #define GET_PROBS p->probs
236 CLzmaProb *probs = GET_PROBS;
262 prob = probs + IsMatch + COMBINED_PS_STATE;
267 prob = probs + Literal;
325 prob = probs + IsRep + state;
330 prob = probs + LenCoder;
335 prob = probs + IsRepG0 + state;
339 prob = probs + IsRep0Long + COMBINED_PS_STATE;
362 prob = probs + IsRepG1 + state;
371 prob = probs + IsRepG2 + state;
389 prob = probs + RepLenCoder;
465 prob = probs + PosSlot +
476 prob = probs + SpecPos;
513 prob = probs + Align;
720 const CLzmaProb *probs = GET_PROBS;
731 prob = probs + IsMatch + COMBINED_PS_STATE;
736 prob = probs + Literal;
772 prob = probs + IsRep + state;
777 prob = probs + LenCoder;
784 prob = probs + IsRepG0 + state;
788 prob = probs + IsRep0Long + COMBINED_PS_STATE;
802 prob = probs + IsRepG1 + state;
810 prob = probs + IsRepG2 + state;
822 prob = probs + RepLenCoder;
860 prob = probs + PosSlot +
870 prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits);
883 prob = probs + Align;
991 CLzmaProb *probs = p->probs;
993 probs[i] = kBitModelTotal >> 1;
1242 ISzAlloc_Free(alloc, p->probs);
1243 p->probs = NULL;
1287 if (!p->probs || numProbs != p->numProbs)
1290 p->probs = (CLzmaProb *)ISzAlloc_Alloc(alloc, numProbs * sizeof(CLzmaProb));
1291 if (!p->probs)
1293 p->probs_1664 = p->probs + 1664;