Searched refs:lengths (Results 1 – 2 of 2) sorted by relevance
658 unsigned* lengths; /*the lengths of the huffman codes*/ member668 tree->lengths = 0; in HuffmanTree_init()675 lodepng_free(tree->lengths); in HuffmanTree_cleanup()700 unsigned l = tree->lengths[i]; in HuffmanTree_makeTable()737 unsigned l = tree->lengths[i]; in HuffmanTree_makeTable()823 for(bits = 0; bits != tree->numcodes; ++bits) ++blcount[tree->lengths[bits]]; in HuffmanTree_makeFromLengths2()830 if(tree->lengths[n] != 0) { in HuffmanTree_makeFromLengths2()831 tree->codes[n] = nextcode[tree->lengths[n]]++; in HuffmanTree_makeFromLengths2()833 tree->codes[n] &= ((1u << tree->lengths[n]) - 1u); in HuffmanTree_makeFromLengths2()853 tree->lengths = (unsigned*)lodepng_malloc(numcodes * sizeof(unsigned)); in HuffmanTree_makeFromLengths()[all …]
962 unsigned lodepng_huffman_code_lengths(unsigned* lengths, const unsigned* frequencies,
