Lines Matching defs:bits
71 static inline double bits2qp(RateControlEntry *rce, double bits)
73 if (bits < 0.9) {
74 av_log(NULL, AV_LOG_ERROR, "bits<0.9\n");
76 return rce->qscale * (double)(rce->i_tex_bits + rce->p_tex_bits + 1) / bits;
244 double q, bits;
271 bits = av_expr_eval(rcc->rc_eq_eval, const_values, rce);
272 if (isnan(bits)) {
277 rcc->pass1_rc_eq_output_sum += bits;
278 bits *= rate_factor;
279 if (bits < 0.0)
280 bits = 0.0;
281 bits += 1.0; // avoid 1/0 issues
292 bits = qp2bits(rce, rco[i].qscale); // FIXME move at end to really force it?
294 bits *= rco[i].quality_factor;
297 q = bits2qp(rce, bits);
316 double complexity[5] = { 0 }; // approximate bits at quant=1
317 uint64_t const_bits[5] = { 0 }; // quantizer independent bits
410 /* find expected bits */
413 double bits;
417 bits = qp2bits(rce, rce->new_qscale) + rce->mv_bits + rce->misc_bits;
418 bits += 8 * ff_vbv_update(s, bits);
421 expected_bits += bits;
625 double bits = s->rc_initial_cplx * (i / 10000.0 + 1.0) * s->mb_num;
636 rce.mc_mb_var_sum = bits * s->mb_num / 100000;
646 rce.i_tex_bits = bits;
652 rce.p_tex_bits = bits * 0.9;
653 rce.mv_bits = bits * 0.1;
763 float bits, cplx, factor;
809 bits = cplx * factor;
811 bits_sum += bits;
813 bits_tab[i] = bits;
880 double bits;
953 bits = predict_size(&rcc->pred[pict_type], rce->qscale, sqrt(var));
956 rce->i_tex_bits = bits;
962 rce->p_tex_bits = bits * 0.9;
963 rce->mv_bits = bits * 0.1;