126                            int value, size_t num) {  in lodepng_memset()  argument
127   lv_memset(dst, value, num);  in lodepng_memset()
606 static unsigned reverseBits(unsigned bits, unsigned num) {  in reverseBits()  argument
609   for(i = 0; i < num; i++) result |= ((bits >> (num - i - 1u)) & 1u) << i;  in reverseBits()
746       unsigned num = 1u << (FIRSTBITS - l);  in HuffmanTree_makeTable()  local
748       for(j = 0; j < num; ++j) {  in HuffmanTree_makeTable()
763 …unsigned num = 1u << (tablelen - (l - FIRSTBITS)); /*amount of entries of this symbol in secondary…  in HuffmanTree_makeTable()  local
766       for(j = 0; j < num; ++j) {  in HuffmanTree_makeTable()
918 static void bpmnode_sort(BPMNode* leaves, size_t num) {  in bpmnode_sort()  argument
919   BPMNode* mem = (BPMNode*)lodepng_malloc(sizeof(*leaves) * num);  in bpmnode_sort()
921   for(width = 1; width < num; width *= 2) {  in bpmnode_sort()
925     for(p = 0; p < num; p += 2 * width) {  in bpmnode_sort()
926       size_t q = (p + width > num) ? num : (p + width);  in bpmnode_sort()
927       size_t r = (p + 2 * width > num) ? num : (p + 2 * width);  in bpmnode_sort()
936   if(counter & 1) lodepng_memcpy(leaves, mem, sizeof(*leaves) * num);  in bpmnode_sort()
941 static void boundaryPM(BPMLists* lists, BPMNode* leaves, size_t numpresent, int c, int num) {  in boundaryPM()  argument
959     if(num + 1 < (int)(2 * numpresent - 2)) {  in boundaryPM()
960       boundaryPM(lists, leaves, numpresent, c - 1, num);  in boundaryPM()
961       boundaryPM(lists, leaves, numpresent, c - 1, num);  in boundaryPM()
1926         unsigned num = j / 6u, rest = j % 6u;  in deflateDynamic()  local
1928         for(k = 0; k < num; ++k) {  in deflateDynamic()