Lines Matching refs:chains1
885 BPMNode** chains1; member
900 for(node = lists->chains1[i]; node != 0; node = node->tail) node->in_use = 1; in bpmnode_create()
942 unsigned lastindex = lists->chains1[c]->index; in boundaryPM()
946 lists->chains0[c] = lists->chains1[c]; in boundaryPM()
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()
951 lists->chains0[c] = lists->chains1[c]; in boundaryPM()
953 …lists->chains1[c] = bpmnode_create(lists, leaves[lastindex].weight, lastindex + 1, lists->chains1[… in boundaryPM()
956 lists->chains1[c] = bpmnode_create(lists, sum, lastindex, lists->chains1[c - 1]); in boundaryPM()
1012 lists.chains1 = (BPMNode**)lodepng_malloc(lists.listsize * sizeof(BPMNode*)); in lodepng_huffman_code_lengths()
1013 …if(!lists.memory || !lists.freelist || !lists.chains0 || !lists.chains1) error = 83; /*alloc fail*/ in lodepng_huffman_code_lengths()
1023 lists.chains1[i] = &lists.memory[1]; in lodepng_huffman_code_lengths()
1029 for(node = lists.chains1[maxbitlen - 1]; node; node = node->tail) { in lodepng_huffman_code_lengths()
1037 lodepng_free(lists.chains1); in lodepng_huffman_code_lengths()