680     unsigned * codes; /*the huffman codes (bit patterns representing the symbols)*/  member
691     tree->codes = 0;  in HuffmanTree_init()
699     lodepng_free(tree->codes);  in HuffmanTree_cleanup()
725         unsigned symbol = tree->codes[i];  in HuffmanTree_makeTable()
766         symbol = tree->codes[i]; /*the huffman bit pattern. i itself is the value.*/  in HuffmanTree_makeTable()
845     tree->codes = (unsigned *)lodepng_malloc(tree->numcodes * sizeof(unsigned));  in HuffmanTree_makeFromLengths2()
848     if(!tree->codes || !blcount || !nextcode) error = 83; /*alloc fail*/  in HuffmanTree_makeFromLengths2()
861                 tree->codes[n] = nextcode[tree->lengths[n]]++;  in HuffmanTree_makeFromLengths2()
863                 tree->codes[n] &= ((1u << tree->lengths[n]) - 1u);  in HuffmanTree_makeFromLengths2()
1885         writeBitsReversed(writer, tree_ll->codes[val], tree_ll->lengths[val]);  in writeLZ77data()
1898             writeBitsReversed(writer, tree_d->codes[distance_code], tree_d->lengths[distance_code]);  in writeLZ77data()
2101 …       writeBitsReversed(writer, tree_cl.codes[bitlen_lld_e[i]], tree_cl.lengths[bitlen_lld_e[i]]);  in deflateDynamic()
2114         writeBitsReversed(writer, tree_ll.codes[256], tree_ll.lengths[256]);  in deflateDynamic()
2166                 writeBitsReversed(writer, tree_ll.codes[data[i]], tree_ll.lengths[data[i]]);  in deflateFixed()
2170         if(!error) writeBitsReversed(writer, tree_ll.codes[256], tree_ll.lengths[256]);  in deflateFixed()