Lines Matching refs:bits
95 // account for rle extra bits
100 int bits = 18 + 2 * max_depth; // huffman tree of huffman tree cost
102 bits += histogram[i] * cost[i]; // huffman tree bit cost
105 return bits;
127 int bits = 0;
129 bits += histogram.data_[i] * depth[i];
132 bits += 28;
134 bits += 37;
136 bits += HuffmanBitCost(depth, kSize);
138 return bits;