718     size_t i, numpresent, pointer, size; /*total table size*/  in HuffmanTree_makeTable()  local
761     numpresent = 0;  in HuffmanTree_makeTable()
769         numpresent++;  in HuffmanTree_makeTable()
803     if(numpresent < 2) {  in HuffmanTree_makeTable()
974 static void boundaryPM(BPMLists * lists, BPMNode * leaves, size_t numpresent, int c, int num)  in boundaryPM()  argument
979         if(lastindex >= numpresent) return;  in boundaryPM()
987         if(lastindex < numpresent && sum > leaves[lastindex].weight) {  in boundaryPM()
994         if(num + 1 < (int)(2 * numpresent - 2)) {  in boundaryPM()
995             boundaryPM(lists, leaves, numpresent, c - 1, num);  in boundaryPM()
996             boundaryPM(lists, leaves, numpresent, c - 1, num);  in boundaryPM()
1006     size_t numpresent = 0; /*number of symbols with non-zero frequency*/  in lodepng_huffman_code_lengths()  local
1017             leaves[numpresent].weight = (int)frequencies[i];  in lodepng_huffman_code_lengths()
1018             leaves[numpresent].index = i;  in lodepng_huffman_code_lengths()
1019             ++numpresent;  in lodepng_huffman_code_lengths()
1030     if(numpresent == 0) {  in lodepng_huffman_code_lengths()
1033     else if(numpresent == 1) {  in lodepng_huffman_code_lengths()
1041         bpmnode_sort(leaves, numpresent);  in lodepng_huffman_code_lengths()
1065 …for(i = 2; i != 2 * numpresent - 2; ++i) boundaryPM(&lists, leaves, numpresent, (int)maxbitlen - 1…  in lodepng_huffman_code_lengths()