Mercurial > libavcodec.hg
annotate ratecontrol.c @ 678:9c7a661a9fbe libavcodec
fixing
fixing max_rate/min_rate
author | michaelni |
---|---|
date | Wed, 18 Sep 2002 09:08:03 +0000 |
parents | 79c43f519d02 |
children | 3d2da9b44cd8 |
rev | line source |
---|---|
329 | 1 /* |
428 | 2 * Rate control for video encoders |
3 * | |
4 * Copyright (c) 2002 Michael Niedermayer <michaelni@gmx.at> | |
5 * | |
6 * This library is free software; you can redistribute it and/or | |
7 * modify it under the terms of the GNU Lesser General Public | |
8 * License as published by the Free Software Foundation; either | |
9 * version 2 of the License, or (at your option) any later version. | |
10 * | |
11 * This library is distributed in the hope that it will be useful, | |
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 * Lesser General Public License for more details. | |
15 * | |
16 * You should have received a copy of the GNU Lesser General Public | |
17 * License along with this library; if not, write to the Free Software | |
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
19 */ | |
612 | 20 #include <math.h> |
21 #include "common.h" | |
329 | 22 #include "avcodec.h" |
428 | 23 #include "dsputil.h" |
329 | 24 #include "mpegvideo.h" |
25 | |
612 | 26 #undef NDEBUG // allways check asserts, the speed effect is far too small to disable them |
27 #include <assert.h> | |
329 | 28 |
627 | 29 #ifndef M_PI |
30 #define M_PI 3.14159265358979323846 | |
31 #endif | |
32 | |
33 #ifndef M_E | |
34 #define M_E 2.718281828 | |
35 #endif | |
36 | |
329 | 37 static int init_pass2(MpegEncContext *s); |
612 | 38 static double get_qscale(MpegEncContext *s, RateControlEntry *rce, double rate_factor, int frame_num); |
329 | 39 |
40 void ff_write_pass1_stats(MpegEncContext *s){ | |
612 | 41 sprintf(s->avctx->stats_out, "in:%d out:%d type:%d q:%d itex:%d ptex:%d mv:%d misc:%d fcode:%d bcode:%d mc-var:%d var:%d icount:%d;\n", |
329 | 42 s->picture_number, s->input_picture_number - s->max_b_frames, s->pict_type, |
612 | 43 s->qscale, s->i_tex_bits, s->p_tex_bits, s->mv_bits, s->misc_bits, |
44 s->f_code, s->b_code, s->mc_mb_var_sum, s->mb_var_sum, s->i_count); | |
329 | 45 } |
46 | |
47 int ff_rate_control_init(MpegEncContext *s) | |
48 { | |
49 RateControlContext *rcc= &s->rc_context; | |
612 | 50 int i; |
329 | 51 emms_c(); |
52 | |
612 | 53 for(i=0; i<5; i++){ |
54 rcc->pred[i].coeff= 7.0; | |
55 rcc->pred[i].count= 1.0; | |
56 | |
57 rcc->pred[i].decay= 0.4; | |
58 rcc->i_cplx_sum [i]= | |
59 rcc->p_cplx_sum [i]= | |
60 rcc->mv_bits_sum[i]= | |
61 rcc->qscale_sum [i]= | |
62 rcc->frame_count[i]= 1; // 1 is better cuz of 1/0 and such | |
63 rcc->last_qscale_for[i]=5; | |
64 } | |
65 rcc->buffer_index= s->avctx->rc_buffer_size/2; | |
66 | |
67 rcc->next_non_b_qscale=10; | |
68 rcc->next_p_qscale=10; | |
69 | |
70 if(s->flags&CODEC_FLAG_PASS2){ | |
329 | 71 int i; |
612 | 72 char *p; |
329 | 73 |
612 | 74 /* find number of pics */ |
75 p= s->avctx->stats_in; | |
76 for(i=-1; p; i++){ | |
77 p= strchr(p+1, ';'); | |
329 | 78 } |
612 | 79 i+= s->max_b_frames; |
80 rcc->entry = (RateControlEntry*)av_mallocz(i*sizeof(RateControlEntry)); | |
81 rcc->num_entries= i; | |
82 | |
83 /* init all to skiped p frames (with b frames we might have a not encoded frame at the end FIXME) */ | |
84 for(i=0; i<rcc->num_entries; i++){ | |
85 RateControlEntry *rce= &rcc->entry[i]; | |
86 rce->pict_type= rce->new_pict_type=P_TYPE; | |
87 rce->qscale= rce->new_qscale=2; | |
88 rce->misc_bits= s->mb_num + 10; | |
89 rce->mb_var_sum= s->mb_num*100; | |
90 } | |
91 | |
92 /* read stats */ | |
93 p= s->avctx->stats_in; | |
94 for(i=0; i<rcc->num_entries - s->max_b_frames; i++){ | |
329 | 95 RateControlEntry *rce; |
96 int picture_number; | |
97 int e; | |
612 | 98 char *next; |
99 | |
100 next= strchr(p, ';'); | |
101 if(next){ | |
102 (*next)=0; //sscanf in unbelieavle slow on looong strings //FIXME copy / dont write | |
103 next++; | |
104 } | |
105 e= sscanf(p, " in:%d ", &picture_number); | |
106 | |
107 assert(picture_number >= 0); | |
108 assert(picture_number < rcc->num_entries); | |
329 | 109 rce= &rcc->entry[picture_number]; |
612 | 110 |
111 e+=sscanf(p, " in:%*d out:%*d type:%d q:%d itex:%d ptex:%d mv:%d misc:%d fcode:%d bcode:%d mc-var:%d var:%d icount:%d", | |
112 &rce->pict_type, &rce->qscale, &rce->i_tex_bits, &rce->p_tex_bits, &rce->mv_bits, &rce->misc_bits, | |
113 &rce->f_code, &rce->b_code, &rce->mc_mb_var_sum, &rce->mb_var_sum, &rce->i_count); | |
114 if(e!=12){ | |
115 fprintf(stderr, "statistics are damaged at line %d, parser out=%d\n", i, e); | |
329 | 116 return -1; |
117 } | |
612 | 118 p= next; |
329 | 119 } |
120 | |
121 if(init_pass2(s) < 0) return -1; | |
122 } | |
123 | |
612 | 124 if(!(s->flags&CODEC_FLAG_PASS2)){ |
125 | |
126 rcc->short_term_qsum=0.001; | |
127 rcc->short_term_qcount=0.001; | |
329 | 128 |
612 | 129 rcc->pass1_bits =0.001; |
130 rcc->pass1_wanted_bits=0.001; | |
131 | |
132 /* init stuff with the user specified complexity */ | |
133 if(s->avctx->rc_initial_cplx){ | |
134 for(i=0; i<60*30; i++){ | |
135 double bits= s->avctx->rc_initial_cplx * (i/10000.0 + 1.0)*s->mb_num; | |
136 RateControlEntry rce; | |
137 double q; | |
138 | |
139 if (i%((s->gop_size+3)/4)==0) rce.pict_type= I_TYPE; | |
140 else if(i%(s->max_b_frames+1)) rce.pict_type= B_TYPE; | |
141 else rce.pict_type= P_TYPE; | |
142 | |
143 rce.new_pict_type= rce.pict_type; | |
144 rce.mc_mb_var_sum= bits*s->mb_num/100000; | |
145 rce.mb_var_sum = s->mb_num; | |
146 rce.qscale = 2; | |
147 rce.f_code = 2; | |
148 rce.b_code = 1; | |
149 rce.misc_bits= 1; | |
329 | 150 |
612 | 151 if(s->pict_type== I_TYPE){ |
152 rce.i_count = s->mb_num; | |
153 rce.i_tex_bits= bits; | |
154 rce.p_tex_bits= 0; | |
155 rce.mv_bits= 0; | |
156 }else{ | |
157 rce.i_count = 0; //FIXME we do know this approx | |
158 rce.i_tex_bits= 0; | |
159 rce.p_tex_bits= bits*0.9; | |
160 rce.mv_bits= bits*0.1; | |
161 } | |
162 rcc->i_cplx_sum [rce.pict_type] += rce.i_tex_bits*rce.qscale; | |
163 rcc->p_cplx_sum [rce.pict_type] += rce.p_tex_bits*rce.qscale; | |
164 rcc->mv_bits_sum[rce.pict_type] += rce.mv_bits; | |
165 rcc->frame_count[rce.pict_type] ++; | |
329 | 166 |
612 | 167 bits= rce.i_tex_bits + rce.p_tex_bits; |
168 | |
169 q= get_qscale(s, &rce, rcc->pass1_wanted_bits/rcc->pass1_bits, i); | |
170 rcc->pass1_wanted_bits+= s->bit_rate/(s->frame_rate / (double)FRAME_RATE_BASE); | |
171 } | |
172 } | |
173 | |
174 } | |
175 | |
329 | 176 return 0; |
177 } | |
178 | |
179 void ff_rate_control_uninit(MpegEncContext *s) | |
180 { | |
181 RateControlContext *rcc= &s->rc_context; | |
182 emms_c(); | |
183 | |
396
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
388
diff
changeset
|
184 av_freep(&rcc->entry); |
329 | 185 } |
186 | |
612 | 187 static inline double qp2bits(RateControlEntry *rce, double qp){ |
188 if(qp<=0.0){ | |
189 fprintf(stderr, "qp<=0.0\n"); | |
190 } | |
191 return rce->qscale * (double)(rce->i_tex_bits + rce->p_tex_bits+1)/ qp; | |
192 } | |
193 | |
194 static inline double bits2qp(RateControlEntry *rce, double bits){ | |
195 if(bits<0.9){ | |
196 fprintf(stderr, "bits<0.9\n"); | |
197 } | |
198 return rce->qscale * (double)(rce->i_tex_bits + rce->p_tex_bits+1)/ bits; | |
199 } | |
200 | |
201 static void update_rc_buffer(MpegEncContext *s, int frame_size){ | |
202 RateControlContext *rcc= &s->rc_context; | |
203 const double fps= (double)s->frame_rate / FRAME_RATE_BASE; | |
204 const double buffer_size= s->avctx->rc_buffer_size; | |
205 const double min_rate= s->avctx->rc_min_rate/fps; | |
206 const double max_rate= s->avctx->rc_max_rate/fps; | |
207 | |
208 if(buffer_size){ | |
209 rcc->buffer_index-= frame_size; | |
210 if(rcc->buffer_index < buffer_size/2 /*FIXME /2 */ || min_rate==0){ | |
211 rcc->buffer_index+= max_rate; | |
212 if(rcc->buffer_index >= buffer_size) | |
213 rcc->buffer_index= buffer_size-1; | |
214 }else{ | |
215 rcc->buffer_index+= min_rate; | |
216 } | |
217 | |
218 if(rcc->buffer_index < 0) | |
219 fprintf(stderr, "rc buffer underflow\n"); | |
220 if(rcc->buffer_index >= s->avctx->rc_buffer_size) | |
221 fprintf(stderr, "rc buffer overflow\n"); | |
222 } | |
223 } | |
224 | |
225 /** | |
226 * modifies the bitrate curve from pass1 for one frame | |
227 */ | |
228 static double get_qscale(MpegEncContext *s, RateControlEntry *rce, double rate_factor, int frame_num){ | |
229 RateControlContext *rcc= &s->rc_context; | |
230 double q, bits; | |
231 const int pict_type= rce->new_pict_type; | |
232 const double mb_num= s->mb_num; | |
233 int i; | |
234 const double last_q= rcc->last_qscale_for[pict_type]; | |
235 | |
236 double const_values[]={ | |
237 M_PI, | |
238 M_E, | |
239 rce->i_tex_bits*rce->qscale, | |
240 rce->p_tex_bits*rce->qscale, | |
241 (rce->i_tex_bits + rce->p_tex_bits)*(double)rce->qscale, | |
242 rce->mv_bits/mb_num, | |
243 rce->pict_type == B_TYPE ? (rce->f_code + rce->b_code)*0.5 : rce->f_code, | |
244 rce->i_count/mb_num, | |
245 rce->mc_mb_var_sum/mb_num, | |
246 rce->mb_var_sum/mb_num, | |
247 rce->pict_type == I_TYPE, | |
248 rce->pict_type == P_TYPE, | |
249 rce->pict_type == B_TYPE, | |
250 rcc->qscale_sum[pict_type] / (double)rcc->frame_count[pict_type], | |
251 s->qcompress, | |
252 /* rcc->last_qscale_for[I_TYPE], | |
253 rcc->last_qscale_for[P_TYPE], | |
254 rcc->last_qscale_for[B_TYPE], | |
255 rcc->next_non_b_qscale,*/ | |
256 rcc->i_cplx_sum[I_TYPE] / (double)rcc->frame_count[I_TYPE], | |
257 rcc->i_cplx_sum[P_TYPE] / (double)rcc->frame_count[P_TYPE], | |
258 rcc->p_cplx_sum[P_TYPE] / (double)rcc->frame_count[P_TYPE], | |
259 rcc->p_cplx_sum[B_TYPE] / (double)rcc->frame_count[B_TYPE], | |
260 (rcc->i_cplx_sum[pict_type] + rcc->p_cplx_sum[pict_type]) / (double)rcc->frame_count[pict_type], | |
261 0 | |
262 }; | |
263 char *const_names[]={ | |
264 "PI", | |
265 "E", | |
266 "iTex", | |
267 "pTex", | |
268 "tex", | |
269 "mv", | |
270 "fCode", | |
271 "iCount", | |
272 "mcVar", | |
273 "var", | |
274 "isI", | |
275 "isP", | |
276 "isB", | |
277 "avgQP", | |
278 "qComp", | |
279 /* "lastIQP", | |
280 "lastPQP", | |
281 "lastBQP", | |
282 "nextNonBQP",*/ | |
283 "avgIITex", | |
284 "avgPITex", | |
285 "avgPPTex", | |
286 "avgBPTex", | |
287 "avgTex", | |
288 NULL | |
289 }; | |
620
a5aa53b6e648
warning patch by (Dominik Mierzejewski <dominik at rangers dot eu dot org>)
michaelni
parents:
616
diff
changeset
|
290 static double (*func1[])(void *, double)={ |
612 | 291 bits2qp, |
292 qp2bits, | |
293 NULL | |
294 }; | |
295 char *func1_names[]={ | |
296 "bits2qp", | |
297 "qp2bits", | |
298 NULL | |
299 }; | |
300 | |
301 bits= ff_eval(s->avctx->rc_eq, const_values, const_names, func1, func1_names, NULL, NULL, rce); | |
302 | |
303 rcc->pass1_bits+= bits; | |
304 bits*=rate_factor; | |
305 if(bits<0.0) bits=0.0; | |
306 bits+= 1.0; //avoid 1/0 issues | |
307 | |
308 /* user override */ | |
309 for(i=0; i<s->avctx->rc_override_count; i++){ | |
310 RcOverride *rco= s->avctx->rc_override; | |
311 if(rco[i].start_frame > frame_num) continue; | |
312 if(rco[i].end_frame < frame_num) continue; | |
313 | |
314 if(rco[i].qscale) | |
315 bits= qp2bits(rce, rco[i].qscale); //FIXME move at end to really force it? | |
316 else | |
317 bits*= rco[i].quality_factor; | |
318 } | |
319 | |
320 q= bits2qp(rce, bits); | |
321 | |
322 /* I/B difference */ | |
323 if (pict_type==I_TYPE && s->avctx->i_quant_factor<0.0) | |
324 q= -q*s->avctx->i_quant_factor + s->avctx->i_quant_offset; | |
325 else if(pict_type==B_TYPE && s->avctx->b_quant_factor<0.0) | |
326 q= -q*s->avctx->b_quant_factor + s->avctx->b_quant_offset; | |
327 | |
328 /* last qscale / qdiff stuff */ | |
329 if (q > last_q + s->max_qdiff) q= last_q + s->max_qdiff; | |
330 else if(q < last_q - s->max_qdiff) q= last_q - s->max_qdiff; | |
331 | |
332 rcc->last_qscale_for[pict_type]= q; //Note we cant do that after blurring | |
333 | |
334 return q; | |
335 } | |
336 | |
337 /** | |
338 * gets the qmin & qmax for pict_type | |
339 */ | |
340 static void get_qminmax(int *qmin_ret, int *qmax_ret, MpegEncContext *s, int pict_type){ | |
341 int qmin= s->qmin; | |
342 int qmax= s->qmax; | |
343 | |
344 if(pict_type==B_TYPE){ | |
345 qmin= (int)(qmin*ABS(s->avctx->b_quant_factor)+s->avctx->b_quant_offset + 0.5); | |
346 qmax= (int)(qmax*ABS(s->avctx->b_quant_factor)+s->avctx->b_quant_offset + 0.5); | |
347 }else if(pict_type==I_TYPE){ | |
348 qmin= (int)(qmin*ABS(s->avctx->i_quant_factor)+s->avctx->i_quant_offset + 0.5); | |
349 qmax= (int)(qmax*ABS(s->avctx->i_quant_factor)+s->avctx->i_quant_offset + 0.5); | |
350 } | |
351 | |
352 if(qmin<1) qmin=1; | |
353 if(qmin==1 && s->qmin>1) qmin=2; //avoid qmin=1 unless the user wants qmin=1 | |
354 | |
355 if(qmin<3 && s->max_qcoeff<=128 && pict_type==I_TYPE) qmin=3; //reduce cliping problems | |
356 | |
357 if(qmax>31) qmax=31; | |
358 if(qmax<=qmin) qmax= qmin= (qmax+qmin+1)>>1; | |
359 | |
360 *qmin_ret= qmin; | |
361 *qmax_ret= qmax; | |
362 } | |
363 | |
364 static double modify_qscale(MpegEncContext *s, RateControlEntry *rce, double q, int frame_num){ | |
365 RateControlContext *rcc= &s->rc_context; | |
366 int qmin, qmax; | |
367 double bits; | |
368 const int pict_type= rce->new_pict_type; | |
369 const double buffer_size= s->avctx->rc_buffer_size; | |
370 const double min_rate= s->avctx->rc_min_rate; | |
371 const double max_rate= s->avctx->rc_max_rate; | |
372 | |
373 get_qminmax(&qmin, &qmax, s, pict_type); | |
374 | |
375 /* modulation */ | |
376 if(s->avctx->rc_qmod_freq && frame_num%s->avctx->rc_qmod_freq==0 && pict_type==P_TYPE) | |
377 q*= s->avctx->rc_qmod_amp; | |
378 | |
379 bits= qp2bits(rce, q); | |
678 | 380 //printf("q:%f\n", q); |
612 | 381 /* buffer overflow/underflow protection */ |
382 if(buffer_size){ | |
383 double expected_size= rcc->buffer_index - bits; | |
384 | |
385 if(min_rate){ | |
386 double d= 2*(buffer_size - (expected_size + min_rate))/buffer_size; | |
387 if(d>1.0) d=1.0; | |
678 | 388 else if(d<0.0001) d=0.0001; |
389 q*= pow(d, 1.0/s->avctx->rc_buffer_aggressivity); | |
612 | 390 } |
391 | |
392 if(max_rate){ | |
393 double d= 2*expected_size/buffer_size; | |
394 if(d>1.0) d=1.0; | |
678 | 395 else if(d<0.0001) d=0.0001; |
396 q/= pow(d, 1.0/s->avctx->rc_buffer_aggressivity); | |
612 | 397 } |
398 } | |
678 | 399 //printf("q:%f max:%f min:%f size:%f index:%d bits:%f agr:%f\n", q,max_rate, min_rate, buffer_size, rcc->buffer_index, bits, s->avctx->rc_buffer_aggressivity); |
615 | 400 if(s->avctx->rc_qsquish==0.0 || qmin==qmax){ |
612 | 401 if (q<qmin) q=qmin; |
402 else if(q>qmax) q=qmax; | |
403 }else{ | |
404 double min2= log(qmin); | |
405 double max2= log(qmax); | |
406 | |
407 q= log(q); | |
408 q= (q - min2)/(max2-min2) - 0.5; | |
409 q*= -4.0; | |
410 q= 1.0/(1.0 + exp(q)); | |
411 q= q*(max2-min2) + min2; | |
412 | |
413 q= exp(q); | |
414 } | |
415 | |
416 return q; | |
417 } | |
418 | |
329 | 419 //---------------------------------- |
420 // 1 Pass Code | |
421 | |
612 | 422 static double predict_size(Predictor *p, double q, double var) |
329 | 423 { |
424 return p->coeff*var / (q*p->count); | |
425 } | |
426 | |
612 | 427 static double predict_qp(Predictor *p, double size, double var) |
428 { | |
429 //printf("coeff:%f, count:%f, var:%f, size:%f//\n", p->coeff, p->count, var, size); | |
430 return p->coeff*var / (size*p->count); | |
431 } | |
432 | |
329 | 433 static void update_predictor(Predictor *p, double q, double var, double size) |
434 { | |
435 double new_coeff= size*q / (var + 1); | |
612 | 436 if(var<10) return; |
329 | 437 |
438 p->count*= p->decay; | |
439 p->coeff*= p->decay; | |
440 p->count++; | |
441 p->coeff+= new_coeff; | |
442 } | |
443 | |
444 int ff_rate_estimate_qscale(MpegEncContext *s) | |
445 { | |
446 float q; | |
612 | 447 int qscale, qmin, qmax; |
329 | 448 float br_compensation; |
449 double diff; | |
450 double short_term_q; | |
451 double fps; | |
612 | 452 int picture_number= s->picture_number; |
329 | 453 int64_t wanted_bits; |
612 | 454 RateControlContext *rcc= &s->rc_context; |
455 RateControlEntry local_rce, *rce; | |
456 double bits; | |
457 double rate_factor; | |
458 int var; | |
459 const int pict_type= s->pict_type; | |
329 | 460 emms_c(); |
461 | |
612 | 462 get_qminmax(&qmin, &qmax, s, pict_type); |
463 | |
329 | 464 fps= (double)s->frame_rate / FRAME_RATE_BASE; |
678 | 465 //printf("input_pic_num:%d pic_num:%d frame_rate:%d\n", s->input_picture_number, s->picture_number, s->frame_rate); |
329 | 466 /* update predictors */ |
467 if(picture_number>2){ | |
612 | 468 const int last_var= s->last_pict_type == I_TYPE ? rcc->last_mb_var_sum : rcc->last_mc_mb_var_sum; |
469 update_predictor(&rcc->pred[s->last_pict_type], rcc->last_qscale, sqrt(last_var), s->frame_bits); | |
329 | 470 } |
471 | |
612 | 472 if(s->flags&CODEC_FLAG_PASS2){ |
473 assert(picture_number>=0); | |
474 assert(picture_number<rcc->num_entries); | |
475 rce= &rcc->entry[picture_number]; | |
476 wanted_bits= rce->expected_bits; | |
477 }else{ | |
478 rce= &local_rce; | |
479 wanted_bits= (uint64_t)(s->bit_rate*(double)picture_number/fps); | |
329 | 480 } |
481 | |
482 diff= s->total_bits - wanted_bits; | |
483 br_compensation= (s->bit_rate_tolerance - diff)/s->bit_rate_tolerance; | |
484 if(br_compensation<=0.0) br_compensation=0.001; | |
612 | 485 |
486 var= pict_type == I_TYPE ? s->mb_var_sum : s->mc_mb_var_sum; | |
487 | |
488 if(s->flags&CODEC_FLAG_PASS2){ | |
489 if(pict_type!=I_TYPE) | |
490 assert(pict_type == rce->new_pict_type); | |
491 | |
492 q= rce->new_qscale / br_compensation; | |
493 //printf("%f %f %f last:%d var:%d type:%d//\n", q, rce->new_qscale, br_compensation, s->frame_bits, var, pict_type); | |
494 }else{ | |
495 rce->pict_type= | |
496 rce->new_pict_type= pict_type; | |
497 rce->mc_mb_var_sum= s->mc_mb_var_sum; | |
498 rce->mb_var_sum = s-> mb_var_sum; | |
499 rce->qscale = 2; | |
500 rce->f_code = s->f_code; | |
501 rce->b_code = s->b_code; | |
502 rce->misc_bits= 1; | |
503 | |
504 if(picture_number>0) | |
505 update_rc_buffer(s, s->frame_bits); | |
506 | |
507 bits= predict_size(&rcc->pred[pict_type], rce->qscale, sqrt(var)); | |
508 if(pict_type== I_TYPE){ | |
509 rce->i_count = s->mb_num; | |
510 rce->i_tex_bits= bits; | |
511 rce->p_tex_bits= 0; | |
512 rce->mv_bits= 0; | |
513 }else{ | |
514 rce->i_count = 0; //FIXME we do know this approx | |
515 rce->i_tex_bits= 0; | |
516 rce->p_tex_bits= bits*0.9; | |
517 | |
518 rce->mv_bits= bits*0.1; | |
519 } | |
520 rcc->i_cplx_sum [pict_type] += rce->i_tex_bits*rce->qscale; | |
521 rcc->p_cplx_sum [pict_type] += rce->p_tex_bits*rce->qscale; | |
522 rcc->mv_bits_sum[pict_type] += rce->mv_bits; | |
523 rcc->frame_count[pict_type] ++; | |
524 | |
525 bits= rce->i_tex_bits + rce->p_tex_bits; | |
526 rate_factor= rcc->pass1_wanted_bits/rcc->pass1_bits * br_compensation; | |
527 | |
528 q= get_qscale(s, rce, rate_factor, picture_number); | |
529 | |
615 | 530 assert(q>0.0); |
612 | 531 //printf("%f ", q); |
532 if (pict_type==I_TYPE && s->avctx->i_quant_factor>0.0) | |
533 q= rcc->next_p_qscale*s->avctx->i_quant_factor + s->avctx->i_quant_offset; | |
534 else if(pict_type==B_TYPE && s->avctx->b_quant_factor>0.0) | |
535 q= rcc->next_non_b_qscale*s->avctx->b_quant_factor + s->avctx->b_quant_offset; | |
536 //printf("%f ", q); | |
537 assert(q>0.0); | |
538 | |
539 if(pict_type==P_TYPE || s->intra_only){ //FIXME type dependant blur like in 2-pass | |
540 rcc->short_term_qsum*=s->qblur; | |
541 rcc->short_term_qcount*=s->qblur; | |
542 | |
543 rcc->short_term_qsum+= q; | |
544 rcc->short_term_qcount++; | |
545 //printf("%f ", q); | |
546 q= short_term_q= rcc->short_term_qsum/rcc->short_term_qcount; | |
547 //printf("%f ", q); | |
548 } | |
678 | 549 assert(q>0.0); |
550 | |
612 | 551 q= modify_qscale(s, rce, q, picture_number); |
552 | |
553 rcc->pass1_wanted_bits+= s->bit_rate/fps; | |
554 | |
615 | 555 assert(q>0.0); |
556 | |
612 | 557 if(pict_type != B_TYPE) rcc->next_non_b_qscale= q; |
558 if(pict_type == P_TYPE) rcc->next_p_qscale= q; | |
559 } | |
560 //printf("qmin:%d, qmax:%d, q:%f\n", qmin, qmax, q); | |
561 | |
562 | |
563 if (q<qmin) q=qmin; | |
564 else if(q>qmax) q=qmax; | |
565 | |
566 // printf("%f %d %d %d\n", q, picture_number, (int)wanted_bits, (int)s->total_bits); | |
567 | |
568 | |
329 | 569 //printf("%f %f %f\n", q, br_compensation, short_term_q); |
570 qscale= (int)(q + 0.5); | |
612 | 571 //printf("%d ", qscale); |
329 | 572 |
678 | 573 //printf("q:%d diff:%d comp:%f st_q:%f last_size:%d\n", qscale, (int)diff, br_compensation, |
574 // short_term_q, s->frame_bits); | |
329 | 575 //printf("%d %d\n", s->bit_rate, (int)fps); |
612 | 576 |
577 rcc->last_qscale= qscale; | |
578 rcc->last_mc_mb_var_sum= s->mc_mb_var_sum; | |
579 rcc->last_mb_var_sum= s->mb_var_sum; | |
329 | 580 return qscale; |
581 } | |
582 | |
583 //---------------------------------------------- | |
584 // 2-Pass code | |
585 | |
586 static int init_pass2(MpegEncContext *s) | |
587 { | |
588 RateControlContext *rcc= &s->rc_context; | |
589 int i; | |
590 double fps= (double)s->frame_rate / FRAME_RATE_BASE; | |
591 double complexity[5]={0,0,0,0,0}; // aproximate bits at quant=1 | |
592 double avg_quantizer[5]; | |
593 uint64_t const_bits[5]={0,0,0,0,0}; // quantizer idependant bits | |
594 uint64_t available_bits[5]; | |
595 uint64_t all_const_bits; | |
596 uint64_t all_available_bits= (uint64_t)(s->bit_rate*(double)rcc->num_entries/fps); | |
597 double rate_factor=0; | |
598 double step; | |
599 int last_i_frame=-10000000; | |
612 | 600 const int filter_size= (int)(s->qblur*4) | 1; |
601 double expected_bits; | |
602 double *qscale, *blured_qscale; | |
329 | 603 |
604 /* find complexity & const_bits & decide the pict_types */ | |
605 for(i=0; i<rcc->num_entries; i++){ | |
606 RateControlEntry *rce= &rcc->entry[i]; | |
607 | |
608 if(s->b_frame_strategy==0 || s->max_b_frames==0){ | |
609 rce->new_pict_type= rce->pict_type; | |
610 }else{ | |
611 int j; | |
612 int next_non_b_type=P_TYPE; | |
613 | |
614 switch(rce->pict_type){ | |
615 case I_TYPE: | |
616 if(i-last_i_frame>s->gop_size/2){ //FIXME this is not optimal | |
617 rce->new_pict_type= I_TYPE; | |
618 last_i_frame= i; | |
619 }else{ | |
620 rce->new_pict_type= P_TYPE; // will be caught by the scene detection anyway | |
621 } | |
622 break; | |
623 case P_TYPE: | |
624 rce->new_pict_type= P_TYPE; | |
625 break; | |
626 case B_TYPE: | |
627 for(j=i+1; j<i+s->max_b_frames+2 && j<rcc->num_entries; j++){ | |
628 if(rcc->entry[j].pict_type != B_TYPE){ | |
629 next_non_b_type= rcc->entry[j].pict_type; | |
630 break; | |
631 } | |
632 } | |
633 if(next_non_b_type==I_TYPE) | |
634 rce->new_pict_type= P_TYPE; | |
635 else | |
636 rce->new_pict_type= B_TYPE; | |
637 break; | |
638 } | |
639 } | |
612 | 640 rcc->i_cplx_sum [rce->pict_type] += rce->i_tex_bits*rce->qscale; |
641 rcc->p_cplx_sum [rce->pict_type] += rce->p_tex_bits*rce->qscale; | |
642 rcc->mv_bits_sum[rce->pict_type] += rce->mv_bits; | |
643 rcc->frame_count[rce->pict_type] ++; | |
329 | 644 |
645 complexity[rce->new_pict_type]+= (rce->i_tex_bits+ rce->p_tex_bits)*(double)rce->qscale; | |
646 const_bits[rce->new_pict_type]+= rce->mv_bits + rce->misc_bits; | |
647 } | |
648 all_const_bits= const_bits[I_TYPE] + const_bits[P_TYPE] + const_bits[B_TYPE]; | |
649 | |
650 if(all_available_bits < all_const_bits){ | |
651 fprintf(stderr, "requested bitrate is to low\n"); | |
652 return -1; | |
653 } | |
612 | 654 |
655 /* find average quantizers */ | |
656 avg_quantizer[P_TYPE]=0; | |
657 for(step=256*256; step>0.0000001; step*=0.5){ | |
658 double expected_bits=0; | |
659 avg_quantizer[P_TYPE]+= step; | |
660 | |
661 avg_quantizer[I_TYPE]= avg_quantizer[P_TYPE]*ABS(s->avctx->i_quant_factor) + s->avctx->i_quant_offset; | |
662 avg_quantizer[B_TYPE]= avg_quantizer[P_TYPE]*ABS(s->avctx->b_quant_factor) + s->avctx->b_quant_offset; | |
663 | |
664 expected_bits= | |
665 + all_const_bits | |
666 + complexity[I_TYPE]/avg_quantizer[I_TYPE] | |
667 + complexity[P_TYPE]/avg_quantizer[P_TYPE] | |
668 + complexity[B_TYPE]/avg_quantizer[B_TYPE]; | |
669 | |
670 if(expected_bits < all_available_bits) avg_quantizer[P_TYPE]-= step; | |
671 //printf("%f %lld %f\n", expected_bits, all_available_bits, avg_quantizer[P_TYPE]); | |
672 } | |
616
0fe52ab8042c
forgot the const bits in 2pass curve matching (patch (with rounding removed) by Rmi Guyomarch <rguyom at pobox dot com>)
michaelni
parents:
615
diff
changeset
|
673 //printf("qp_i:%f, qp_p:%f, qp_b:%f\n", avg_quantizer[I_TYPE],avg_quantizer[P_TYPE],avg_quantizer[B_TYPE]); |
329 | 674 |
675 for(i=0; i<5; i++){ | |
676 available_bits[i]= const_bits[i] + complexity[i]/avg_quantizer[i]; | |
677 } | |
678 //printf("%lld %lld %lld %lld\n", available_bits[I_TYPE], available_bits[P_TYPE], available_bits[B_TYPE], all_available_bits); | |
612 | 679 |
680 qscale= malloc(sizeof(double)*rcc->num_entries); | |
681 blured_qscale= malloc(sizeof(double)*rcc->num_entries); | |
682 | |
329 | 683 for(step=256*256; step>0.0000001; step*=0.5){ |
612 | 684 expected_bits=0; |
329 | 685 rate_factor+= step; |
612 | 686 |
687 rcc->buffer_index= s->avctx->rc_buffer_size/2; | |
688 | |
329 | 689 /* find qscale */ |
690 for(i=0; i<rcc->num_entries; i++){ | |
612 | 691 qscale[i]= get_qscale(s, &rcc->entry[i], rate_factor, i); |
692 } | |
693 assert(filter_size%2==1); | |
329 | 694 |
612 | 695 /* fixed I/B QP relative to P mode */ |
696 rcc->next_non_b_qscale= 10; | |
697 rcc->next_p_qscale= 10; | |
698 for(i=rcc->num_entries-1; i>=0; i--){ | |
699 RateControlEntry *rce= &rcc->entry[i]; | |
700 const int pict_type= rce->new_pict_type; | |
701 | |
702 if (pict_type==I_TYPE && s->avctx->i_quant_factor>0.0) | |
703 qscale[i]= rcc->next_p_qscale*s->avctx->i_quant_factor + s->avctx->i_quant_offset; | |
704 else if(pict_type==B_TYPE && s->avctx->b_quant_factor>0.0) | |
705 qscale[i]= rcc->next_non_b_qscale*s->avctx->b_quant_factor + s->avctx->b_quant_offset; | |
329 | 706 |
612 | 707 if(pict_type!=B_TYPE) |
708 rcc->next_non_b_qscale= qscale[i]; | |
709 if(pict_type==P_TYPE) | |
710 rcc->next_p_qscale= qscale[i]; | |
329 | 711 } |
712 | |
713 /* smooth curve */ | |
612 | 714 for(i=0; i<rcc->num_entries; i++){ |
715 RateControlEntry *rce= &rcc->entry[i]; | |
716 const int pict_type= rce->new_pict_type; | |
717 int j; | |
718 double q=0.0, sum=0.0; | |
719 | |
720 for(j=0; j<filter_size; j++){ | |
721 int index= i+j-filter_size/2; | |
722 double d= index-i; | |
723 double coeff= s->qblur==0 ? 1.0 : exp(-d*d/(s->qblur * s->qblur)); | |
724 | |
725 if(index < 0 || index >= rcc->num_entries) continue; | |
726 if(pict_type != rcc->entry[index].new_pict_type) continue; | |
727 q+= qscale[index] * coeff; | |
728 sum+= coeff; | |
729 } | |
730 blured_qscale[i]= q/sum; | |
731 } | |
329 | 732 |
733 /* find expected bits */ | |
734 for(i=0; i<rcc->num_entries; i++){ | |
735 RateControlEntry *rce= &rcc->entry[i]; | |
612 | 736 double bits; |
737 rce->new_qscale= modify_qscale(s, rce, blured_qscale[i], i); | |
616
0fe52ab8042c
forgot the const bits in 2pass curve matching (patch (with rounding removed) by Rmi Guyomarch <rguyom at pobox dot com>)
michaelni
parents:
615
diff
changeset
|
738 bits= qp2bits(rce, rce->new_qscale) + rce->mv_bits + rce->misc_bits; |
612 | 739 //printf("%d %f\n", rce->new_bits, blured_qscale[i]); |
740 update_rc_buffer(s, bits); | |
741 | |
329 | 742 rce->expected_bits= expected_bits; |
612 | 743 expected_bits += bits; |
329 | 744 } |
745 | |
612 | 746 // printf("%f %d %f\n", expected_bits, (int)all_available_bits, rate_factor); |
329 | 747 if(expected_bits > all_available_bits) rate_factor-= step; |
748 } | |
612 | 749 free(qscale); |
750 free(blured_qscale); | |
751 | |
752 if(abs(expected_bits/all_available_bits - 1.0) > 0.01 ){ | |
753 fprintf(stderr, "Error: 2pass curve failed to converge\n"); | |
754 return -1; | |
755 } | |
329 | 756 |
757 return 0; | |
758 } |