546     HuffmanTreeCode* const huffman_code) {  in ClearHuffmanTreeIfOnlyOneSymbol()  argument
549   for (k = 0; k < huffman_code->num_symbols; ++k) {  in ClearHuffmanTreeIfOnlyOneSymbol()
550     if (huffman_code->code_lengths[k] != 0) {  in ClearHuffmanTreeIfOnlyOneSymbol()
555   for (k = 0; k < huffman_code->num_symbols; ++k) {  in ClearHuffmanTreeIfOnlyOneSymbol()
556     huffman_code->code_lengths[k] = 0;  in ClearHuffmanTreeIfOnlyOneSymbol()
557     huffman_code->codes[k] = 0;  in ClearHuffmanTreeIfOnlyOneSymbol()
564     const HuffmanTreeCode* const huffman_code) {  in StoreHuffmanTreeToBitMask()  argument
569     VP8LPutBits(bw, huffman_code->codes[ix], huffman_code->code_lengths[ix]);  in StoreHuffmanTreeToBitMask()
593   HuffmanTreeCode huffman_code;  in StoreFullHuffmanCode()  local
594   huffman_code.num_symbols = CODE_LENGTH_CODES;  in StoreFullHuffmanCode()
595   huffman_code.code_lengths = code_length_bitdepth;  in StoreFullHuffmanCode()
596   huffman_code.codes = code_length_bitdepth_symbols;  in StoreFullHuffmanCode()
608     VP8LCreateHuffmanTree(histogram, 7, buf_rle, huff_tree, &huffman_code);  in StoreFullHuffmanCode()
612   ClearHuffmanTreeIfOnlyOneSymbol(&huffman_code);  in StoreFullHuffmanCode()
648     StoreHuffmanTreeToBitMask(bw, tokens, length, &huffman_code);  in StoreFullHuffmanCode()
656                              const HuffmanTreeCode* const huffman_code) {  in StoreHuffmanCode()  argument
664   for (i = 0; i < huffman_code->num_symbols && count < 3; ++i) {  in StoreHuffmanCode()
665     if (huffman_code->code_lengths[i] != 0) {  in StoreHuffmanCode()
688     StoreFullHuffmanCode(bw, huff_tree, tokens, huffman_code);  in StoreHuffmanCode()