Lines Matching defs:symbol
59 #define NORMAL_LITER_DEC TREE_GET_BIT(prob, symbol)
64 probLit = prob + (offs + bit + symbol); \
65 GET_BIT2(probLit, symbol, offs ^= bit; , ;)
198 So first symbol can be only MATCH-NON-REP. And if that MATCH-NON-REP symbol
204 The first LZMA symbol will be decoded in any case.
210 that is enough for worst case LZMA symbol with one additional RangeCoder normalization for one bit.
265 unsigned symbol;
275 symbol = 1;
277 do { NORMAL_LITER_DEC } while (symbol < 0x100);
294 symbol = 1;
302 while (symbol < 0x100);
319 dic[dicPos++] = (Byte)symbol;
658 - Non-Rep-Match - is allowed only if it's end marker symbol
744 unsigned symbol = 1;
745 do { GET_BIT_CHECK(prob + symbol, symbol) } while (symbol < 0x100);
752 unsigned symbol = 1;
760 probLit = prob + (offs + bit + symbol);
761 GET_BIT2_CHECK(probLit, symbol, offs ^= bit; , ; )
763 while (symbol < 0x100);
937 When the decoder lookahead, and the lookahead symbol is not end_marker, we have two ways:
1160 // we decode one symbol from (p->tempBuf) here, so the (bufLimit) is equal to (p->buf)