Lines Matching full:bitlen_d
948 unsigned* bitlen_d = 0; /*dist code lengths*/
949 /*code length code lengths ("clcl"), the bit lengths of the huffman tree used to compress bitlen_ll and bitlen_d*/
982 bitlen_d = (unsigned*)lodepng_malloc(NUM_DISTANCE_SYMBOLS * sizeof(unsigned));
983 if(!bitlen_ll || !bitlen_d) ERROR_BREAK(83 /*alloc fail*/);
985 for(i = 0; i < NUM_DISTANCE_SYMBOLS; i++) bitlen_d[i] = 0;
995 else bitlen_d[i - HLIT] = code;
1009 else value = bitlen_d[i - HLIT - 1];
1015 else bitlen_d[i - HLIT] = value;
1032 else bitlen_d[i - HLIT] = 0;
1049 else bitlen_d[i - HLIT] = 0;
1072 error = HuffmanTree_makeFromLengths(tree_d, bitlen_d, NUM_DISTANCE_SYMBOLS, 15);
1079 lodepng_free(bitlen_d);
