916     BPMNode ** chains1;  member
932             for(node = lists->chains1[i]; node != 0; node = node->tail) node->in_use = 1;  in bpmnode_create()
976     unsigned lastindex = lists->chains1[c]->index;  in boundaryPM()
980         lists->chains0[c] = lists->chains1[c];  in boundaryPM()
981         lists->chains1[c] = bpmnode_create(lists, leaves[lastindex].weight, lastindex + 1, 0);  in boundaryPM()
985         int sum = lists->chains0[c - 1]->weight + lists->chains1[c - 1]->weight;  in boundaryPM()
986         lists->chains0[c] = lists->chains1[c];  in boundaryPM()
988 …lists->chains1[c] = bpmnode_create(lists, leaves[lastindex].weight, lastindex + 1, lists->chains1[…  in boundaryPM()
991         lists->chains1[c] = bpmnode_create(lists, sum, lastindex, lists->chains1[c - 1]);  in boundaryPM()
1050         lists.chains1 = (BPMNode **)lodepng_malloc(lists.listsize * sizeof(BPMNode *));  in lodepng_huffman_code_lengths()
1051 …if(!lists.memory || !lists.freelist || !lists.chains0 || !lists.chains1) error = 83; /*alloc fail*/  in lodepng_huffman_code_lengths()
1061                 lists.chains1[i] = &lists.memory[1];  in lodepng_huffman_code_lengths()
1067             for(node = lists.chains1[maxbitlen - 1]; node; node = node->tail) {  in lodepng_huffman_code_lengths()
1075         lodepng_free(lists.chains1);  in lodepng_huffman_code_lengths()