491   unsigned maxbitlen; /*maximum number of bits a single code can get*/  member
599   if(!uivector_resizev(&blcount, tree->maxbitlen + 1, 0)  in HuffmanTree_makeFromLengths2()
600   || !uivector_resizev(&nextcode, tree->maxbitlen + 1, 0))  in HuffmanTree_makeFromLengths2()
608     for(bits = 1; bits <= tree->maxbitlen; bits++)  in HuffmanTree_makeFromLengths2()
632                                             size_t numcodes, unsigned maxbitlen)  in HuffmanTree_makeFromLengths()  argument
639   tree->maxbitlen = maxbitlen;  in HuffmanTree_makeFromLengths()
715                                       size_t numcodes, unsigned maxbitlen)  in lodepng_huffman_code_lengths()  argument
783       for(j = 1; j <= maxbitlen && !error; j++) /*each of the remaining rows*/  in lodepng_huffman_code_lengths()
805         if(j < maxbitlen)  in lodepng_huffman_code_lengths()
835 …                                              size_t mincodes, size_t numcodes, unsigned maxbitlen)  in HuffmanTree_makeFromFrequencies()  argument
839   tree->maxbitlen = maxbitlen;  in HuffmanTree_makeFromFrequencies()
846   error = lodepng_huffman_code_lengths(tree->lengths, frequencies, numcodes, maxbitlen);  in HuffmanTree_makeFromFrequencies()