867 typedef struct BPMNode {  struct
870   struct BPMNode* tail; /*the next nodes in this chain (null if last)*/  argument
872 } BPMNode;  argument
878   BPMNode* memory;
881   BPMNode** freelist;
884   BPMNode** chains0;
885   BPMNode** chains1;
889 static BPMNode* bpmnode_create(BPMLists* lists, int weight, unsigned index, BPMNode* tail) {  in bpmnode_create()
891   BPMNode* result;  in bpmnode_create()
898       BPMNode* node;  in bpmnode_create()
918 static void bpmnode_sort(BPMNode* leaves, size_t num) {  in bpmnode_sort()
919   BPMNode* mem = (BPMNode*)lodepng_malloc(sizeof(*leaves) * num);  in bpmnode_sort()
922     BPMNode* a = (counter & 1) ? mem : leaves;  in bpmnode_sort()
923     BPMNode* b = (counter & 1) ? leaves : mem;  in bpmnode_sort()
941 static void boundaryPM(BPMLists* lists, BPMNode* leaves, size_t numpresent, int c, int num) {  in boundaryPM()
971   BPMNode* leaves; /*the symbols, only those with > 0 frequency*/  in lodepng_huffman_code_lengths()
976   leaves = (BPMNode*)lodepng_malloc(numcodes * sizeof(*leaves));  in lodepng_huffman_code_lengths()
1001     BPMNode* node;  in lodepng_huffman_code_lengths()
1009     lists.memory = (BPMNode*)lodepng_malloc(lists.memsize * sizeof(*lists.memory));  in lodepng_huffman_code_lengths()
1010     lists.freelist = (BPMNode**)lodepng_malloc(lists.memsize * sizeof(BPMNode*));  in lodepng_huffman_code_lengths()
1011     lists.chains0 = (BPMNode**)lodepng_malloc(lists.listsize * sizeof(BPMNode*));  in lodepng_huffman_code_lengths()
1012     lists.chains1 = (BPMNode**)lodepng_malloc(lists.listsize * sizeof(BPMNode*));  in lodepng_huffman_code_lengths()