Lines Matching refs:symbol
113 int symbol;
125 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
126 if (code_lengths[symbol] > max_code_length) {
127 max_code_length = code_lengths[symbol];
133 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
134 ++code_length_hist[code_lengths[symbol]];
139 // next_codes[code_len] denotes the code to be assigned to the next symbol
149 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
150 if (code_lengths[symbol] > 0) {
151 huff_codes[symbol] = next_codes[code_lengths[symbol]]++;
153 huff_codes[symbol] = NON_EXISTENT_SYMBOL;
189 int symbol, int code, int code_length) {
194 assert(symbol == (int16_t)symbol);
200 tree->lut_symbol_[idx] = (int16_t)symbol;
225 return 0; // trying to assign a symbol to already used code.
227 node->symbol_ = symbol; // Add symbol in this node.
235 int symbol;
242 // Find out number of symbols and the root symbol.
243 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
244 if (code_lengths[symbol] > 0) {
245 // Note: code length = 0 indicates non-existent symbol.
247 root_symbol = symbol;
272 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
273 if (code_lengths[symbol] > 0) {
274 if (!TreeAddSymbol(tree, symbol, codes[symbol],
275 code_lengths[symbol])) {
