Lines Matching refs:bitlen
880 static unsigned HuffmanTree_makeFromLengths(HuffmanTree * tree, const unsigned * bitlen, in HuffmanTree_makeFromLengths() argument
886 for(i = 0; i != numcodes; ++i) tree->lengths[i] = bitlen[i]; in HuffmanTree_makeFromLengths()
1103 unsigned * bitlen = (unsigned *)lodepng_malloc(NUM_DEFLATE_CODE_SYMBOLS * sizeof(unsigned)); in generateFixedLitLenTree() local
1104 if(!bitlen) return 83; /*alloc fail*/ in generateFixedLitLenTree()
1107 for(i = 0; i <= 143; ++i) bitlen[i] = 8; in generateFixedLitLenTree()
1108 for(i = 144; i <= 255; ++i) bitlen[i] = 9; in generateFixedLitLenTree()
1109 for(i = 256; i <= 279; ++i) bitlen[i] = 7; in generateFixedLitLenTree()
1110 for(i = 280; i <= 287; ++i) bitlen[i] = 8; in generateFixedLitLenTree()
1112 error = HuffmanTree_makeFromLengths(tree, bitlen, NUM_DEFLATE_CODE_SYMBOLS, 15); in generateFixedLitLenTree()
1114 lodepng_free(bitlen); in generateFixedLitLenTree()
1122 unsigned * bitlen = (unsigned *)lodepng_malloc(NUM_DISTANCE_SYMBOLS * sizeof(unsigned)); in generateFixedDistanceTree() local
1123 if(!bitlen) return 83; /*alloc fail*/ in generateFixedDistanceTree()
1126 for(i = 0; i != NUM_DISTANCE_SYMBOLS; ++i) bitlen[i] = 5; in generateFixedDistanceTree()
1127 error = HuffmanTree_makeFromLengths(tree, bitlen, NUM_DISTANCE_SYMBOLS, 15); in generateFixedDistanceTree()
1129 lodepng_free(bitlen); in generateFixedDistanceTree()