268     HuffmanTreeCode* const huffman_code) {  in ClearHuffmanTreeIfOnlyOneSymbol()  argument
271   for (k = 0; k < huffman_code->num_symbols; ++k) {  in ClearHuffmanTreeIfOnlyOneSymbol()
272     if (huffman_code->code_lengths[k] != 0) {  in ClearHuffmanTreeIfOnlyOneSymbol()
277   for (k = 0; k < huffman_code->num_symbols; ++k) {  in ClearHuffmanTreeIfOnlyOneSymbol()
278     huffman_code->code_lengths[k] = 0;  in ClearHuffmanTreeIfOnlyOneSymbol()
279     huffman_code->codes[k] = 0;  in ClearHuffmanTreeIfOnlyOneSymbol()
286     const HuffmanTreeCode* const huffman_code) {  in StoreHuffmanTreeToBitMask()  argument
291     VP8LWriteBits(bw, huffman_code->code_lengths[ix], huffman_code->codes[ix]);  in StoreHuffmanTreeToBitMask()
313   HuffmanTreeCode huffman_code;  in StoreFullHuffmanCode()  local
318   huffman_code.num_symbols = CODE_LENGTH_CODES;  in StoreFullHuffmanCode()
319   huffman_code.code_lengths = code_length_bitdepth;  in StoreFullHuffmanCode()
320   huffman_code.codes = code_length_bitdepth_symbols;  in StoreFullHuffmanCode()
331     if (!VP8LCreateHuffmanTree(histogram, 7, &huffman_code)) {  in StoreFullHuffmanCode()
337   ClearHuffmanTreeIfOnlyOneSymbol(&huffman_code);  in StoreFullHuffmanCode()
368     StoreHuffmanTreeToBitMask(bw, tokens, length, &huffman_code);  in StoreFullHuffmanCode()
377                             const HuffmanTreeCode* const huffman_code) {  in StoreHuffmanCode()  argument
385   for (i = 0; i < huffman_code->num_symbols && count < 3; ++i) {  in StoreHuffmanCode()
386     if (huffman_code->code_lengths[i] != 0) {  in StoreHuffmanCode()
411     return StoreFullHuffmanCode(bw, huffman_code);  in StoreHuffmanCode()