Lines Matching full:symbols
192 symbols to deal with, and writes a sparse bitfield indicating which in get_next_block()
194 symbols back to the corresponding bytes. */ in get_next_block()
209 /* nSelectors: Every GROUP_SIZE many symbols we select a new in get_next_block()
231 for symTotal literal symbols, plus two run symbols (RUNA, in get_next_block()
285 * Huffman coded symbols into decoded symbols. base[] in get_next_block()
314 /* Count symbols coded for at each bit length */ in get_next_block()
319 *1)+symbols at this level), and base[] (number of in get_next_block()
320 *symbols to ignore at each bit length, which is limit in get_next_block()
321 *minus the cumulative count of symbols coded for in get_next_block()
330 future symbols.) At each level we're in get_next_block()
346 read this block's Huffman coded symbols from the file and in get_next_block()
356 /* Loop through compressed symbols. */ in get_next_block()
424 would use no symbols, but a run of length 0 in get_next_block()
436 of decoded symbols (dbuf) now. (The last literal in get_next_block()
466 *move only a small number of symbols, and are bound in get_next_block()
479 /* At this point, we've read all the Huffman-coded symbols in get_next_block()