Lines Matching refs:bitlen
631 static unsigned HuffmanTree_makeFromLengths(HuffmanTree* tree, const unsigned* bitlen,
637 for(i = 0; i < numcodes; i++) tree->lengths[i] = bitlen[i];
866 unsigned* bitlen = (unsigned*)lodepng_malloc(NUM_DEFLATE_CODE_SYMBOLS * sizeof(unsigned));
867 if(!bitlen) return 83; /*alloc fail*/
870 for(i = 0; i <= 143; i++) bitlen[i] = 8;
871 for(i = 144; i <= 255; i++) bitlen[i] = 9;
872 for(i = 256; i <= 279; i++) bitlen[i] = 7;
873 for(i = 280; i <= 287; i++) bitlen[i] = 8;
875 error = HuffmanTree_makeFromLengths(tree, bitlen, NUM_DEFLATE_CODE_SYMBOLS, 15);
877 lodepng_free(bitlen);
885 unsigned* bitlen = (unsigned*)lodepng_malloc(NUM_DISTANCE_SYMBOLS * sizeof(unsigned));
886 if(!bitlen) return 83; /*alloc fail*/
889 for(i = 0; i < NUM_DISTANCE_SYMBOLS; i++) bitlen[i] = 5;
890 error = HuffmanTree_makeFromLengths(tree, bitlen, NUM_DISTANCE_SYMBOLS, 15);
892 lodepng_free(bitlen);
1287 /*bitlen is the size in bits of the code*/
1288 static void addHuffmanSymbol(size_t* bp, ucvector* compressed, unsigned code, unsigned bitlen)
1290 addBitsToStreamReversed(bp, compressed, code, bitlen);
