Lines Matching refs:symbol
74 int symbol; in HuffmanCodeLengthsToCodes() local
86 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanCodeLengthsToCodes()
87 if (code_lengths[symbol] > max_code_length) { in HuffmanCodeLengthsToCodes()
88 max_code_length = code_lengths[symbol]; in HuffmanCodeLengthsToCodes()
94 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanCodeLengthsToCodes()
95 ++code_length_hist[code_lengths[symbol]]; in HuffmanCodeLengthsToCodes()
110 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanCodeLengthsToCodes()
111 if (code_lengths[symbol] > 0) { in HuffmanCodeLengthsToCodes()
112 huff_codes[symbol] = next_codes[code_lengths[symbol]]++; in HuffmanCodeLengthsToCodes()
114 huff_codes[symbol] = NON_EXISTENT_SYMBOL; in HuffmanCodeLengthsToCodes()
121 int symbol, int code, int code_length) { in TreeAddSymbol() argument
141 node->symbol_ = symbol; // Add symbol in this node. in TreeAddSymbol()
148 int symbol; in HuffmanTreeBuildImplicit() local
156 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanTreeBuildImplicit()
157 if (code_lengths[symbol] > 0) { in HuffmanTreeBuildImplicit()
160 root_symbol = symbol; in HuffmanTreeBuildImplicit()
188 for (symbol = 0; symbol < code_lengths_size; ++symbol) { in HuffmanTreeBuildImplicit()
189 if (code_lengths[symbol] > 0) { in HuffmanTreeBuildImplicit()
190 if (!TreeAddSymbol(tree, symbol, codes[symbol], code_lengths[symbol])) { in HuffmanTreeBuildImplicit()