1184 …HuffmanTree tree_cl; /*the code tree for code length codes (the huffman tree for compressed huffma…  in getTreeInflateDynamic()  local
1199     HuffmanTree_init(&tree_cl);  in getTreeInflateDynamic()
1214         error = HuffmanTree_makeFromLengths(&tree_cl, bitlen_cl, NUM_CODE_LENGTH_CODES, 7);  in getTreeInflateDynamic()
1229             code = huffmanDecodeSymbol(reader, &tree_cl);  in getTreeInflateDynamic()
1305     HuffmanTree_cleanup(&tree_cl);  in getTreeInflateDynamic()
1926     HuffmanTree tree_cl; /*tree for encoding the code lengths representing tree_ll and tree_d*/  in deflateDynamic()  local
1951     HuffmanTree_init(&tree_cl);  in deflateDynamic()
2056         error = HuffmanTree_makeFromFrequencies(&tree_cl, frequencies_cl,  in deflateDynamic()
2063         while(numcodes_cl > 4u && tree_cl.lengths[CLCL_ORDER[numcodes_cl - 1u]] == 0) {  in deflateDynamic()
2097         for(i = 0; i != numcodes_cl; ++i) writeBits(writer, tree_cl.lengths[CLCL_ORDER[i]], 3);  in deflateDynamic()
2101 …       writeBitsReversed(writer, tree_cl.codes[bitlen_lld_e[i]], tree_cl.lengths[bitlen_lld_e[i]]);  in deflateDynamic()
2123     HuffmanTree_cleanup(&tree_cl);  in deflateDynamic()