682     unsigned maxbitlen; /*maximum number of bits a single code can get*/  member
846     blcount = (unsigned *)lodepng_malloc((tree->maxbitlen + 1) * sizeof(unsigned));  in HuffmanTree_makeFromLengths2()
847     nextcode = (unsigned *)lodepng_malloc((tree->maxbitlen + 1) * sizeof(unsigned));  in HuffmanTree_makeFromLengths2()
851         for(n = 0; n != tree->maxbitlen + 1; n++) blcount[n] = nextcode[n] = 0;  in HuffmanTree_makeFromLengths2()
855         for(bits = 1; bits <= tree->maxbitlen; ++bits) {  in HuffmanTree_makeFromLengths2()
881                                             size_t numcodes, unsigned maxbitlen)  in HuffmanTree_makeFromLengths()  argument
888     tree->maxbitlen = maxbitlen;  in HuffmanTree_makeFromLengths()
1002                                       size_t numcodes, unsigned maxbitlen)  in lodepng_huffman_code_lengths()  argument
1010     if((1u << maxbitlen) < (unsigned)numcodes) return 80; /*error: represent all symbols*/  in lodepng_huffman_code_lengths()
1043         lists.listsize = maxbitlen;  in lodepng_huffman_code_lengths()
1044         lists.memsize = 2 * maxbitlen * (maxbitlen + 1);  in lodepng_huffman_code_lengths()
1065 …; i != 2 * numpresent - 2; ++i) boundaryPM(&lists, leaves, numpresent, (int)maxbitlen - 1, (int)i);  in lodepng_huffman_code_lengths()
1067             for(node = lists.chains1[maxbitlen - 1]; node; node = node->tail) {  in lodepng_huffman_code_lengths()
1084 …                                              size_t mincodes, size_t numcodes, unsigned maxbitlen)  in HuffmanTree_makeFromFrequencies()  argument
1090     tree->maxbitlen = maxbitlen;  in HuffmanTree_makeFromFrequencies()
1093     error = lodepng_huffman_code_lengths(tree->lengths, frequencies, numcodes, maxbitlen);  in HuffmanTree_makeFromFrequencies()