Searched refs:cur_bits (Results 1 – 5 of 5) sorted by relevance
101 int cur_bits = 0; field in LZWEncoder256 cur_accum &= masks[cur_bits]; in output()258 if (cur_bits > 0) in output()259 cur_accum |= (code << cur_bits); in output()263 cur_bits += n_bits; in output()265 while (cur_bits >= 8) { in output()268 cur_bits -= 8; in output()288 while (cur_bits > 0) { in output()291 cur_bits -= 8; in output()
81 int cur_bits; /* # of bits in cur_accum */ member140 dinfo->cur_accum |= ((long)code) << dinfo->cur_bits; in output()141 dinfo->cur_bits += dinfo->n_bits; in output()143 while (dinfo->cur_bits >= 8) { in output()146 dinfo->cur_bits -= 8; in output()202 dinfo->cur_bits = 0; in compress_init()221 if (dinfo->cur_bits > 0) { in compress_term()
182 const double cur_bits =184 if (cur_bits < best_bits) {185 best_bits = cur_bits;
320 const double cur_bits = FN(BrotliHistogramBitCostDistance)( in FN() local322 if (cur_bits < best_bits) { in FN()323 best_bits = cur_bits; in FN()
1068 double cur_bits; in HistogramRemap() local1069 cur_bits = HistogramAddThresh(out_histo[k], in_histo[i], best_bits); in HistogramRemap()1070 if (k == 0 || cur_bits < best_bits) { in HistogramRemap()1071 best_bits = cur_bits; in HistogramRemap()