868   int weight; /*the sum of all weights in this chain*/  member
889 static BPMNode* bpmnode_create(BPMLists* lists, int weight, unsigned index, BPMNode* tail) {  in bpmnode_create()  argument
911   result->weight = weight;  in bpmnode_create()
930         if(i < q && (j >= r || a[i].weight <= a[j].weight)) b[k] = a[i++];  in bpmnode_sort()
947     lists->chains1[c] = bpmnode_create(lists, leaves[lastindex].weight, lastindex + 1, 0);  in boundaryPM()
950     int sum = lists->chains0[c - 1]->weight + lists->chains1[c - 1]->weight;  in boundaryPM()
952     if(lastindex < numpresent && sum > leaves[lastindex].weight) {  in boundaryPM()
953 …lists->chains1[c] = bpmnode_create(lists, leaves[lastindex].weight, lastindex + 1, lists->chains1[…  in boundaryPM()
981       leaves[numpresent].weight = (int)frequencies[i];  in lodepng_huffman_code_lengths()
1018       bpmnode_create(&lists, leaves[0].weight, 1, 0);  in lodepng_huffman_code_lengths()
1019       bpmnode_create(&lists, leaves[1].weight, 2, 0);  in lodepng_huffman_code_lengths()