492   unsigned numcodes; /*number of symbols in the alphabet = number of codes*/  member
529   tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned));  in HuffmanTree_make2DTree()
542   for(n = 0; n < tree->numcodes * 2; n++)  in HuffmanTree_make2DTree()
547   for(n = 0; n < tree->numcodes; n++) /*the codes*/  in HuffmanTree_make2DTree()
552 …  if(treepos > tree->numcodes - 2) return 55; /*oversubscribed, see comment in lodepng_error_text*/  in HuffmanTree_make2DTree()
566           tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes;  in HuffmanTree_make2DTree()
570       else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes;  in HuffmanTree_make2DTree()
574   for(n = 0; n < tree->numcodes * 2; n++)  in HuffmanTree_make2DTree()
596   tree->tree1d = (unsigned*)lodepng_malloc(tree->numcodes * sizeof(unsigned));  in HuffmanTree_makeFromLengths2()
606     for(bits = 0; bits < tree->numcodes; bits++) blcount.data[tree->lengths[bits]]++;  in HuffmanTree_makeFromLengths2()
613     for(n = 0; n < tree->numcodes; n++)  in HuffmanTree_makeFromLengths2()
632                                             size_t numcodes, unsigned maxbitlen)  in HuffmanTree_makeFromLengths()  argument
635   tree->lengths = (unsigned*)lodepng_malloc(numcodes * sizeof(unsigned));  in HuffmanTree_makeFromLengths()
637   for(i = 0; i < numcodes; i++) tree->lengths[i] = bitlen[i];  in HuffmanTree_makeFromLengths()
638   tree->numcodes = (unsigned)numcodes; /*number of symbols*/  in HuffmanTree_makeFromLengths()
698 static unsigned append_symbol_coins(Coin* coins, const unsigned* frequencies, unsigned numcodes, si…  in append_symbol_coins()  argument
702   for(i = 0; i < numcodes; i++)  in append_symbol_coins()
715                                       size_t numcodes, unsigned maxbitlen)  in lodepng_huffman_code_lengths()  argument
725   if(numcodes == 0) return 80; /*error: a tree of 0 symbols is not supposed to be made*/  in lodepng_huffman_code_lengths()
727   for(i = 0; i < numcodes; i++)  in lodepng_huffman_code_lengths()
736   for(i = 0; i < numcodes; i++) lengths[i] = 0;  in lodepng_huffman_code_lengths()
749     for(i = 0; i < numcodes; i++)  in lodepng_huffman_code_lengths()
777     error = append_symbol_coins(coins, frequencies, numcodes, sum);  in lodepng_huffman_code_lengths()
807           error = append_symbol_coins(coins + numcoins, frequencies, numcodes, sum);  in lodepng_huffman_code_lengths()
835 …                                              size_t mincodes, size_t numcodes, unsigned maxbitlen)  in HuffmanTree_makeFromFrequencies()  argument
838   while(!frequencies[numcodes - 1] && numcodes > mincodes) numcodes--; /*trim zeroes*/  in HuffmanTree_makeFromFrequencies()
840   tree->numcodes = (unsigned)numcodes; /*number of symbols*/  in HuffmanTree_makeFromFrequencies()
841   tree->lengths = (unsigned*)lodepng_realloc(tree->lengths, numcodes * sizeof(unsigned));  in HuffmanTree_makeFromFrequencies()
844   memset(tree->lengths, 0, numcodes * sizeof(unsigned));  in HuffmanTree_makeFromFrequencies()
846   error = lodepng_huffman_code_lengths(tree->lengths, frequencies, numcodes, maxbitlen);  in HuffmanTree_makeFromFrequencies()
915     if(ct < codetree->numcodes) return ct; /*the symbol is decoded, return it*/  in huffmanDecodeSymbol()
916     else treepos = ct - codetree->numcodes; /*symbol not yet decoded, instead move tree position*/  in huffmanDecodeSymbol()
918 …if(treepos >= codetree->numcodes) return (unsigned)(-1); /*error: it appeared outside the codetree…  in huffmanDecodeSymbol()
1766     numcodes_ll = tree_ll.numcodes; if(numcodes_ll > 286) numcodes_ll = 286;  in deflateDynamic()
1767     numcodes_d = tree_d.numcodes; if(numcodes_d > 30) numcodes_d = 30;  in deflateDynamic()
1834     if(!uivector_resize(&bitlen_cl, tree_cl.numcodes)) ERROR_BREAK(83 /*alloc fail*/);  in deflateDynamic()
1835     for(i = 0; i < tree_cl.numcodes; i++)  in deflateDynamic()