Coverage Report

Created: 2026-05-24 07:45

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/aom/av1/encoder/pass2_strategy.c
Line
Count
Source
1
/*
2
 * Copyright (c) 2019, Alliance for Open Media. All rights reserved.
3
 *
4
 * This source code is subject to the terms of the BSD 2 Clause License and
5
 * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
6
 * was not distributed with this source code in the LICENSE file, you can
7
 * obtain it at www.aomedia.org/license/software. If the Alliance for Open
8
 * Media Patent License 1.0 was not distributed with this source code in the
9
 * PATENTS file, you can obtain it at www.aomedia.org/license/patent.
10
 */
11
12
/*!\defgroup gf_group_algo Golden Frame Group
13
 * \ingroup high_level_algo
14
 * Algorithms regarding determining the length of GF groups and defining GF
15
 * group structures.
16
 * @{
17
 */
18
/*! @} - end defgroup gf_group_algo */
19
20
#include <assert.h>
21
#include <limits.h>
22
#include <stdint.h>
23
24
#include "aom_dsp/aom_dsp_common.h"
25
#include "aom_mem/aom_mem.h"
26
#include "config/aom_config.h"
27
#include "config/aom_scale_rtcd.h"
28
29
#include "aom/aom_codec.h"
30
#include "aom/aom_encoder.h"
31
32
#include "av1/common/av1_common_int.h"
33
34
#include "av1/encoder/encoder.h"
35
#include "av1/encoder/firstpass.h"
36
#include "av1/encoder/gop_structure.h"
37
#include "av1/encoder/pass2_strategy.h"
38
#include "av1/encoder/ratectrl.h"
39
#include "av1/encoder/rc_utils.h"
40
#include "av1/encoder/temporal_filter.h"
41
#if CONFIG_THREE_PASS
42
#include "av1/encoder/thirdpass.h"
43
#endif
44
#include "av1/encoder/tpl_model.h"
45
#include "av1/encoder/encode_strategy.h"
46
47
0
#define DEFAULT_KF_BOOST 2300
48
0
#define DEFAULT_GF_BOOST 2000
49
#define GROUP_ADAPTIVE_MAXQ 1
50
51
static void init_gf_stats(GF_GROUP_STATS *gf_stats);
52
#if CONFIG_THREE_PASS
53
static int define_gf_group_pass3(AV1_COMP *cpi, EncodeFrameParams *frame_params,
54
                                 int is_final_pass);
55
#endif
56
57
// Calculate an active area of the image that discounts formatting
58
// bars and partially discounts other 0 energy areas.
59
0
#define MIN_ACTIVE_AREA 0.5
60
0
#define MAX_ACTIVE_AREA 1.0
61
static double calculate_active_area(const FRAME_INFO *frame_info,
62
0
                                    const FIRSTPASS_STATS *this_frame) {
63
0
  const double active_pct =
64
0
      1.0 -
65
0
      ((this_frame->intra_skip_pct / 2) +
66
0
       ((this_frame->inactive_zone_rows * 2) / (double)frame_info->mb_rows));
67
0
  return fclamp(active_pct, MIN_ACTIVE_AREA, MAX_ACTIVE_AREA);
68
0
}
69
70
// Calculate a modified Error used in distributing bits between easier and
71
// harder frames.
72
0
#define ACT_AREA_CORRECTION 0.5
73
static double calculate_modified_err_new(const FRAME_INFO *frame_info,
74
                                         const FIRSTPASS_STATS *total_stats,
75
                                         const FIRSTPASS_STATS *this_stats,
76
                                         int vbrbias, double modified_error_min,
77
0
                                         double modified_error_max) {
78
0
  if (total_stats == NULL) {
79
0
    return 0;
80
0
  }
81
0
  const double av_weight = total_stats->weight / total_stats->count;
82
0
  const double av_err =
83
0
      (total_stats->coded_error * av_weight) / total_stats->count;
84
0
  double modified_error =
85
0
      av_err * pow(this_stats->coded_error * this_stats->weight /
86
0
                       DOUBLE_DIVIDE_CHECK(av_err),
87
0
                   vbrbias / 100.0);
88
89
  // Correction for active area. Frames with a reduced active area
90
  // (eg due to formatting bars) have a higher error per mb for the
91
  // remaining active MBs. The correction here assumes that coding
92
  // 0.5N blocks of complexity 2X is a little easier than coding N
93
  // blocks of complexity X.
94
0
  modified_error *=
95
0
      pow(calculate_active_area(frame_info, this_stats), ACT_AREA_CORRECTION);
96
97
0
  return fclamp(modified_error, modified_error_min, modified_error_max);
98
0
}
99
100
static double calculate_modified_err(const FRAME_INFO *frame_info,
101
                                     const TWO_PASS *twopass,
102
                                     const AV1EncoderConfig *oxcf,
103
0
                                     const FIRSTPASS_STATS *this_frame) {
104
0
  const FIRSTPASS_STATS *total_stats = twopass->stats_buf_ctx->total_stats;
105
0
  return calculate_modified_err_new(
106
0
      frame_info, total_stats, this_frame, oxcf->rc_cfg.vbrbias,
107
0
      twopass->modified_error_min, twopass->modified_error_max);
108
0
}
109
110
// Resets the first pass file to the given position using a relative seek from
111
// the current position.
112
static void reset_fpf_position(TWO_PASS_FRAME *p_frame,
113
0
                               const FIRSTPASS_STATS *position) {
114
0
  p_frame->stats_in = position;
115
0
}
116
117
static int input_stats(TWO_PASS *p, TWO_PASS_FRAME *p_frame,
118
0
                       FIRSTPASS_STATS *fps) {
119
0
  if (p_frame->stats_in >= p->stats_buf_ctx->stats_in_end) return EOF;
120
121
0
  *fps = *p_frame->stats_in;
122
0
  ++p_frame->stats_in;
123
0
  return 1;
124
0
}
125
126
static int input_stats_lap(TWO_PASS *p, TWO_PASS_FRAME *p_frame,
127
0
                           FIRSTPASS_STATS *fps) {
128
0
  if (p_frame->stats_in >= p->stats_buf_ctx->stats_in_end) return EOF;
129
130
0
  *fps = *p_frame->stats_in;
131
  /* Move old stats[0] out to accommodate for next frame stats  */
132
0
  memmove(p->frame_stats_arr[0], p->frame_stats_arr[1],
133
0
          (p->stats_buf_ctx->stats_in_end - p_frame->stats_in - 1) *
134
0
              sizeof(FIRSTPASS_STATS));
135
0
  p->stats_buf_ctx->stats_in_end--;
136
0
  return 1;
137
0
}
138
139
// Read frame stats at an offset from the current position.
140
static const FIRSTPASS_STATS *read_frame_stats(const TWO_PASS *p,
141
                                               const TWO_PASS_FRAME *p_frame,
142
0
                                               int offset) {
143
0
  if ((offset >= 0 &&
144
0
       p_frame->stats_in + offset >= p->stats_buf_ctx->stats_in_end) ||
145
0
      (offset < 0 &&
146
0
       p_frame->stats_in + offset < p->stats_buf_ctx->stats_in_start)) {
147
0
    return NULL;
148
0
  }
149
150
0
  return &p_frame->stats_in[offset];
151
0
}
152
153
// This function returns the maximum target rate per frame.
154
static int frame_max_bits(const RATE_CONTROL *rc,
155
0
                          const AV1EncoderConfig *oxcf) {
156
0
  int64_t max_bits = ((int64_t)rc->avg_frame_bandwidth *
157
0
                      (int64_t)oxcf->rc_cfg.vbrmax_section) /
158
0
                     100;
159
0
  if (max_bits < 0)
160
0
    max_bits = 0;
161
0
  else if (max_bits > rc->max_frame_bandwidth)
162
0
    max_bits = rc->max_frame_bandwidth;
163
164
0
  return (int)max_bits;
165
0
}
166
167
static const double q_pow_term[(QINDEX_RANGE >> 5) + 1] = { 0.65, 0.70, 0.75,
168
                                                            0.80, 0.85, 0.90,
169
                                                            0.95, 0.95, 0.95 };
170
0
#define ERR_DIVISOR 96.0
171
0
static double calc_correction_factor(double err_per_mb, int q) {
172
0
  const double error_term = err_per_mb / ERR_DIVISOR;
173
0
  const int index = q >> 5;
174
  // Adjustment to power term based on qindex
175
0
  const double power_term =
176
0
      q_pow_term[index] +
177
0
      (((q_pow_term[index + 1] - q_pow_term[index]) * (q % 32)) / 32.0);
178
0
  assert(error_term >= 0.0);
179
0
  return fclamp(pow(error_term, power_term), 0.05, 5.0);
180
0
}
181
182
// Based on history adjust expectations of bits per macroblock.
183
0
static void twopass_update_bpm_factor(AV1_COMP *cpi, int rate_err_tol) {
184
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
185
0
  const PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
186
187
  // Based on recent history adjust expectations of bits per macroblock.
188
0
  double damp_fac = AOMMAX(5.0, rate_err_tol / 10.0);
189
0
  double rate_err_factor = 1.0;
190
191
0
  int err_estimate = p_rc->rate_error_estimate;
192
0
  int64_t bits_left = twopass->bits_left;
193
0
  int64_t total_actual_bits = p_rc->total_actual_bits;
194
0
  int64_t bits_off_target = p_rc->vbr_bits_off_target;
195
0
  double rolling_arf_group_actual_bits =
196
0
      (double)twopass->rolling_arf_group_actual_bits;
197
0
  double rolling_arf_group_target_bits =
198
0
      (double)twopass->rolling_arf_group_target_bits;
199
200
#if CONFIG_FPMT_TEST
201
  const int is_parallel_frame =
202
      cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index] > 0 ? 1 : 0;
203
  const int simulate_parallel_frame =
204
      cpi->ppi->fpmt_unit_test_cfg == PARALLEL_SIMULATION_ENCODE
205
          ? is_parallel_frame
206
          : 0;
207
  total_actual_bits = simulate_parallel_frame ? p_rc->temp_total_actual_bits
208
                                              : p_rc->total_actual_bits;
209
  bits_off_target = simulate_parallel_frame ? p_rc->temp_vbr_bits_off_target
210
                                            : p_rc->vbr_bits_off_target;
211
  bits_left =
212
      simulate_parallel_frame ? p_rc->temp_bits_left : twopass->bits_left;
213
  rolling_arf_group_target_bits =
214
      (double)(simulate_parallel_frame
215
                   ? p_rc->temp_rolling_arf_group_target_bits
216
                   : twopass->rolling_arf_group_target_bits);
217
  rolling_arf_group_actual_bits =
218
      (double)(simulate_parallel_frame
219
                   ? p_rc->temp_rolling_arf_group_actual_bits
220
                   : twopass->rolling_arf_group_actual_bits);
221
  err_estimate = simulate_parallel_frame ? p_rc->temp_rate_error_estimate
222
                                         : p_rc->rate_error_estimate;
223
#endif
224
0
  double adj_limit_cap;
225
226
0
  if (rate_err_tol) {
227
0
    const double initial_adj_limit = 0.0626;
228
0
    const double abs_err_tol = 0.6 * rate_err_tol;
229
0
    const double step_size =
230
0
        (0.2 - initial_adj_limit) / (rate_err_tol - abs_err_tol);
231
0
    const double abs_err_till_now =
232
0
        100 *
233
0
        fabs((double)(bits_off_target) / AOMMAX(total_actual_bits, bits_left));
234
0
    adj_limit_cap = initial_adj_limit;
235
236
    // Increase the adj_limit_cap (i.e., allow a swifter adjustment rate) as the
237
    // abs_err_till_now increases.
238
0
    if (abs_err_till_now >= abs_err_tol) {
239
0
      adj_limit_cap =
240
0
          AOMMIN(0.2, initial_adj_limit +
241
0
                          (abs_err_till_now - abs_err_tol) * step_size);
242
0
    }
243
0
  } else {
244
    // Force adj_limit_cap to 0.2 when rate_err_tol is 0.
245
0
    adj_limit_cap = 0.2;
246
0
  }
247
248
0
  const double adj_limit =
249
0
      AOMMAX(adj_limit_cap, (double)(100 - rate_err_tol) / 200.0);
250
0
  const double min_fac = 1.0 - adj_limit;
251
0
  const double max_fac = 1.0 + adj_limit;
252
253
#if CONFIG_THREE_PASS
254
  if (cpi->third_pass_ctx && cpi->third_pass_ctx->frame_info_count > 0) {
255
    int64_t actual_bits = 0;
256
    int64_t target_bits = 0;
257
    double factor = 0.0;
258
    int count = 0;
259
    for (int i = 0; i < cpi->third_pass_ctx->frame_info_count; i++) {
260
      actual_bits += cpi->third_pass_ctx->frame_info[i].actual_bits;
261
      target_bits += cpi->third_pass_ctx->frame_info[i].bits_allocated;
262
      factor += cpi->third_pass_ctx->frame_info[i].bpm_factor;
263
      count++;
264
    }
265
266
    if (count == 0) {
267
      factor = 1.0;
268
    } else {
269
      factor /= (double)count;
270
    }
271
272
    factor *= (double)actual_bits / DOUBLE_DIVIDE_CHECK((double)target_bits);
273
274
    if ((twopass->bpm_factor <= 1 && factor < twopass->bpm_factor) ||
275
        (twopass->bpm_factor >= 1 && factor > twopass->bpm_factor)) {
276
      twopass->bpm_factor = fclamp(factor, min_fac, max_fac);
277
    }
278
  }
279
#endif  // CONFIG_THREE_PASS
280
281
0
  if (p_rc->bits_off_target && total_actual_bits > 0) {
282
0
    if (cpi->ppi->lap_enabled) {
283
0
      rate_err_factor = rolling_arf_group_actual_bits /
284
0
                        DOUBLE_DIVIDE_CHECK(rolling_arf_group_target_bits);
285
0
    } else {
286
0
      rate_err_factor = 1.0 - ((double)(bits_off_target) /
287
0
                               AOMMAX(total_actual_bits, bits_left));
288
0
    }
289
290
    // Adjustment is damped if this is 1 pass with look ahead processing
291
    // (as there are only ever a few frames of data) and for all but the first
292
    // GOP in normal two pass.
293
0
    if ((twopass->bpm_factor != 1.0) || cpi->ppi->lap_enabled) {
294
0
      rate_err_factor = 1.0 + ((rate_err_factor - 1.0) / damp_fac);
295
0
    }
296
0
    rate_err_factor = AOMMAX(min_fac, AOMMIN(max_fac, rate_err_factor));
297
0
  }
298
299
  // Is the rate control trending in the right direction. Only make
300
  // an adjustment if things are getting worse.
301
0
  if ((rate_err_factor < 1.0 && err_estimate >= 0) ||
302
0
      (rate_err_factor > 1.0 && err_estimate <= 0)) {
303
0
    twopass->bpm_factor *= rate_err_factor;
304
0
    if (rate_err_tol >= 100) {
305
0
      twopass->bpm_factor =
306
0
          AOMMAX(min_fac, AOMMIN(max_fac, twopass->bpm_factor));
307
0
    } else {
308
0
      twopass->bpm_factor = AOMMAX(0.1, AOMMIN(10.0, twopass->bpm_factor));
309
0
    }
310
0
  }
311
0
}
312
313
0
static int qbpm_enumerator(int rate_err_tol, bool use_smaller_enumerator) {
314
0
  return (use_smaller_enumerator ? 1050000 : 1125750) +
315
0
         ((300000 * AOMMIN(75, AOMMAX(rate_err_tol - 25, 0))) / 75);
316
0
}
317
318
// Similar to find_qindex_by_rate() function in ratectrl.c, but includes
319
// calculation of a correction_factor.
320
static int find_qindex_by_rate_with_correction(
321
    uint64_t desired_bits_per_mb, aom_bit_depth_t bit_depth,
322
    double error_per_mb, double group_weight_factor, int rate_err_tol,
323
0
    int best_qindex, int worst_qindex, bool use_smaller_enumerator) {
324
0
  assert(best_qindex <= worst_qindex);
325
0
  int low = best_qindex;
326
0
  int high = worst_qindex;
327
328
0
  while (low < high) {
329
0
    const int mid = (low + high) >> 1;
330
0
    const double mid_factor = calc_correction_factor(error_per_mb, mid);
331
0
    const double q = av1_convert_qindex_to_q(mid, bit_depth);
332
0
    const int enumerator =
333
0
        qbpm_enumerator(rate_err_tol, use_smaller_enumerator);
334
0
    const uint64_t mid_bits_per_mb =
335
0
        (uint64_t)((enumerator * mid_factor * group_weight_factor) / q);
336
337
0
    if (mid_bits_per_mb > desired_bits_per_mb) {
338
0
      low = mid + 1;
339
0
    } else {
340
0
      high = mid;
341
0
    }
342
0
  }
343
0
  return low;
344
0
}
345
346
/*!\brief Choose a target maximum Q for a group of frames
347
 *
348
 * \ingroup rate_control
349
 *
350
 * This function is used to estimate a suitable maximum Q for a
351
 * group of frames. Inititally it is called to get a crude estimate
352
 * for the whole clip. It is then called for each ARF/GF group to get
353
 * a revised estimate for that group.
354
 *
355
 * \param[in]    cpi                 Top-level encoder structure
356
 * \param[in]    av_frame_err        The average per frame coded error score
357
 *                                   for frames making up this section/group.
358
 * \param[in]    inactive_zone       Used to mask off /ignore part of the
359
 *                                   frame. The most common use case is where
360
 *                                   a wide format video (e.g. 16:9) is
361
 *                                   letter-boxed into a more square format.
362
 *                                   Here we want to ignore the bands at the
363
 *                                   top and bottom.
364
 * \param[in]    av_target_bandwidth The target bits per frame
365
 *
366
 * \return The maximum Q for frames in the group.
367
 */
368
static int get_twopass_worst_quality(AV1_COMP *cpi, const double av_frame_err,
369
                                     double inactive_zone,
370
0
                                     int av_target_bandwidth) {
371
0
  const RATE_CONTROL *const rc = &cpi->rc;
372
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
373
0
  const RateControlCfg *const rc_cfg = &oxcf->rc_cfg;
374
0
  inactive_zone = fclamp(inactive_zone, 0.0, 0.9999);
375
376
  // Use a smaller qbpm_enumerator for the first GOP.
377
0
  const bool use_smaller_enumerator =
378
0
      ((cpi->ppi->p_rc.total_actual_bits == 0) ? true : false);
379
380
0
  if (av_target_bandwidth <= 0) {
381
0
    return rc->worst_quality;  // Highest value allowed
382
0
  } else {
383
0
    const int num_mbs = (oxcf->resize_cfg.resize_mode != RESIZE_NONE)
384
0
                            ? cpi->initial_mbs
385
0
                            : cpi->common.mi_params.MBs;
386
0
    const int active_mbs = AOMMAX(1, num_mbs - (int)(num_mbs * inactive_zone));
387
0
    const double av_err_per_mb = av_frame_err / (1.0 - inactive_zone);
388
0
    const uint64_t target_norm_bits_per_mb =
389
0
        ((uint64_t)av_target_bandwidth << BPER_MB_NORMBITS) / active_mbs;
390
0
    int rate_err_tol = AOMMIN(rc_cfg->under_shoot_pct, rc_cfg->over_shoot_pct);
391
392
    // Update bpm correction factor based on previous GOP rate error.
393
0
    twopass_update_bpm_factor(cpi, rate_err_tol);
394
395
    // Try and pick a max Q that will be high enough to encode the
396
    // content at the given rate.
397
0
    int q = find_qindex_by_rate_with_correction(
398
0
        target_norm_bits_per_mb, cpi->common.seq_params->bit_depth,
399
0
        av_err_per_mb, cpi->ppi->twopass.bpm_factor, rate_err_tol,
400
0
        rc->best_quality, rc->worst_quality, use_smaller_enumerator);
401
402
    // Restriction on active max q for constrained quality mode.
403
0
    if (rc_cfg->mode == AOM_CQ) q = AOMMAX(q, rc_cfg->cq_level);
404
0
    return q;
405
0
  }
406
0
}
407
408
0
#define INTRA_PART 0.005
409
#define DEFAULT_DECAY_LIMIT 0.75
410
0
#define LOW_SR_DIFF_TRHESH 0.01
411
0
#define NCOUNT_FRAME_II_THRESH 5.0
412
0
#define LOW_CODED_ERR_PER_MB 0.01
413
414
/* This function considers how the quality of prediction may be deteriorating
415
 * with distance. It comapres the coded error for the last frame and the
416
 * second reference frame (usually two frames old) and also applies a factor
417
 * based on the extent of INTRA coding.
418
 *
419
 * The decay factor is then used to reduce the contribution of frames further
420
 * from the alt-ref or golden frame, to the bitframe boost calculation for that
421
 * alt-ref or golden frame.
422
 */
423
0
static double get_sr_decay_rate(const FIRSTPASS_STATS *frame) {
424
0
  double sr_diff = (frame->sr_coded_error - frame->coded_error);
425
0
  double sr_decay = 1.0;
426
0
  double modified_pct_inter;
427
0
  double modified_pcnt_intra;
428
429
0
  modified_pct_inter = frame->pcnt_inter;
430
0
  if ((frame->coded_error > LOW_CODED_ERR_PER_MB) &&
431
0
      ((frame->intra_error / DOUBLE_DIVIDE_CHECK(frame->coded_error)) <
432
0
       (double)NCOUNT_FRAME_II_THRESH)) {
433
0
    modified_pct_inter = frame->pcnt_inter - frame->pcnt_neutral;
434
0
  }
435
0
  modified_pcnt_intra = 100 * (1.0 - modified_pct_inter);
436
437
0
  if ((sr_diff > LOW_SR_DIFF_TRHESH)) {
438
0
    double sr_diff_part = ((sr_diff * 0.25) / frame->intra_error);
439
0
    sr_decay = 1.0 - sr_diff_part - (INTRA_PART * modified_pcnt_intra);
440
0
  }
441
0
  return AOMMAX(sr_decay, DEFAULT_DECAY_LIMIT);
442
0
}
443
444
// This function gives an estimate of how badly we believe the prediction
445
// quality is decaying from frame to frame.
446
0
static double get_zero_motion_factor(const FIRSTPASS_STATS *frame) {
447
0
  const double zero_motion_pct = frame->pcnt_inter - frame->pcnt_motion;
448
0
  double sr_decay = get_sr_decay_rate(frame);
449
0
  return AOMMIN(sr_decay, zero_motion_pct);
450
0
}
451
452
0
#define DEFAULT_ZM_FACTOR 0.5
453
0
static double get_prediction_decay_rate(const FIRSTPASS_STATS *frame_stats) {
454
0
  const double sr_decay_rate = get_sr_decay_rate(frame_stats);
455
0
  double zero_motion_factor =
456
0
      DEFAULT_ZM_FACTOR * (frame_stats->pcnt_inter - frame_stats->pcnt_motion);
457
458
  // Clamp value to range 0.0 to 1.0
459
  // This should happen anyway if input values are sensibly clamped but checked
460
  // here just in case.
461
0
  if (zero_motion_factor > 1.0)
462
0
    zero_motion_factor = 1.0;
463
0
  else if (zero_motion_factor < 0.0)
464
0
    zero_motion_factor = 0.0;
465
466
0
  return AOMMAX(zero_motion_factor,
467
0
                (sr_decay_rate + ((1.0 - sr_decay_rate) * zero_motion_factor)));
468
0
}
469
470
// Function to test for a condition where a complex transition is followed
471
// by a static section. For example in slide shows where there is a fade
472
// between slides. This is to help with more optimal kf and gf positioning.
473
static int detect_transition_to_still(const FIRSTPASS_INFO *firstpass_info,
474
                                      int next_stats_index,
475
                                      const int min_gf_interval,
476
                                      const int frame_interval,
477
                                      const int still_interval,
478
                                      const double loop_decay_rate,
479
0
                                      const double last_decay_rate) {
480
  // Break clause to detect very still sections after motion
481
  // For example a static image after a fade or other transition
482
  // instead of a clean scene cut.
483
0
  if (frame_interval > min_gf_interval && loop_decay_rate >= 0.999 &&
484
0
      last_decay_rate < 0.9) {
485
0
    int stats_left =
486
0
        av1_firstpass_info_future_count(firstpass_info, next_stats_index);
487
0
    if (stats_left >= still_interval) {
488
0
      int j;
489
      // Look ahead a few frames to see if static condition persists...
490
0
      for (j = 0; j < still_interval; ++j) {
491
0
        const FIRSTPASS_STATS *stats =
492
0
            av1_firstpass_info_peek(firstpass_info, next_stats_index + j);
493
0
        if (stats->pcnt_inter - stats->pcnt_motion < 0.999) break;
494
0
      }
495
      // Only if it does do we signal a transition to still.
496
0
      return j == still_interval;
497
0
    }
498
0
  }
499
0
  return 0;
500
0
}
501
502
// This function detects a flash through the high relative pcnt_second_ref
503
// score in the frame following a flash frame. The offset passed in should
504
// reflect this.
505
static int detect_flash(const TWO_PASS *twopass,
506
0
                        const TWO_PASS_FRAME *twopass_frame, const int offset) {
507
0
  const FIRSTPASS_STATS *const next_frame =
508
0
      read_frame_stats(twopass, twopass_frame, offset);
509
510
  // What we are looking for here is a situation where there is a
511
  // brief break in prediction (such as a flash) but subsequent frames
512
  // are reasonably well predicted by an earlier (pre flash) frame.
513
  // The recovery after a flash is indicated by a high pcnt_second_ref
514
  // compared to pcnt_inter.
515
0
  return next_frame != NULL &&
516
0
         next_frame->pcnt_second_ref > next_frame->pcnt_inter &&
517
0
         next_frame->pcnt_second_ref >= 0.5;
518
0
}
519
520
// Update the motion related elements to the GF arf boost calculation.
521
static void accumulate_frame_motion_stats(const FIRSTPASS_STATS *stats,
522
                                          GF_GROUP_STATS *gf_stats, double f_w,
523
0
                                          double f_h) {
524
0
  const double pct = stats->pcnt_motion;
525
526
  // Accumulate Motion In/Out of frame stats.
527
0
  gf_stats->this_frame_mv_in_out = stats->mv_in_out_count * pct;
528
0
  gf_stats->mv_in_out_accumulator += gf_stats->this_frame_mv_in_out;
529
0
  gf_stats->abs_mv_in_out_accumulator += fabs(gf_stats->this_frame_mv_in_out);
530
531
  // Accumulate a measure of how uniform (or conversely how random) the motion
532
  // field is (a ratio of abs(mv) / mv).
533
0
  if (pct > 0.05) {
534
0
    const double mvr_ratio =
535
0
        fabs(stats->mvr_abs) / DOUBLE_DIVIDE_CHECK(fabs(stats->MVr));
536
0
    const double mvc_ratio =
537
0
        fabs(stats->mvc_abs) / DOUBLE_DIVIDE_CHECK(fabs(stats->MVc));
538
539
0
    gf_stats->mv_ratio_accumulator +=
540
0
        pct *
541
0
        (mvr_ratio < stats->mvr_abs * f_h ? mvr_ratio : stats->mvr_abs * f_h);
542
0
    gf_stats->mv_ratio_accumulator +=
543
0
        pct *
544
0
        (mvc_ratio < stats->mvc_abs * f_w ? mvc_ratio : stats->mvc_abs * f_w);
545
0
  }
546
0
}
547
548
static void accumulate_this_frame_stats(const FIRSTPASS_STATS *stats,
549
                                        const double mod_frame_err,
550
0
                                        GF_GROUP_STATS *gf_stats) {
551
0
  gf_stats->gf_group_err += mod_frame_err;
552
0
#if GROUP_ADAPTIVE_MAXQ
553
0
  gf_stats->gf_group_raw_error += stats->coded_error;
554
0
#endif
555
0
  gf_stats->gf_group_skip_pct += stats->intra_skip_pct;
556
0
  gf_stats->gf_group_inactive_zone_rows += stats->inactive_zone_rows;
557
0
}
558
559
static void accumulate_next_frame_stats(const FIRSTPASS_STATS *stats,
560
                                        const int flash_detected,
561
                                        const int frames_since_key,
562
                                        const int cur_idx,
563
                                        GF_GROUP_STATS *gf_stats, int f_w,
564
0
                                        int f_h) {
565
0
  accumulate_frame_motion_stats(stats, gf_stats, f_w, f_h);
566
  // sum up the metric values of current gf group
567
0
  gf_stats->avg_sr_coded_error += stats->sr_coded_error;
568
0
  gf_stats->avg_pcnt_second_ref += stats->pcnt_second_ref;
569
0
  gf_stats->avg_new_mv_count += stats->new_mv_count;
570
0
  gf_stats->avg_wavelet_energy += stats->frame_avg_wavelet_energy;
571
0
  if (fabs(stats->raw_error_stdev) > 0.000001) {
572
0
    gf_stats->non_zero_stdev_count++;
573
0
    gf_stats->avg_raw_err_stdev += stats->raw_error_stdev;
574
0
  }
575
576
  // Accumulate the effect of prediction quality decay
577
0
  if (!flash_detected) {
578
0
    gf_stats->last_loop_decay_rate = gf_stats->loop_decay_rate;
579
0
    gf_stats->loop_decay_rate = get_prediction_decay_rate(stats);
580
581
0
    gf_stats->decay_accumulator =
582
0
        gf_stats->decay_accumulator * gf_stats->loop_decay_rate;
583
584
    // Monitor for static sections.
585
0
    if ((frames_since_key + cur_idx - 1) > 1) {
586
0
      gf_stats->zero_motion_accumulator = AOMMIN(
587
0
          gf_stats->zero_motion_accumulator, get_zero_motion_factor(stats));
588
0
    }
589
0
  }
590
0
}
591
592
0
static void average_gf_stats(const int total_frame, GF_GROUP_STATS *gf_stats) {
593
0
  if (total_frame) {
594
0
    gf_stats->avg_sr_coded_error /= total_frame;
595
0
    gf_stats->avg_pcnt_second_ref /= total_frame;
596
0
    gf_stats->avg_new_mv_count /= total_frame;
597
0
    gf_stats->avg_wavelet_energy /= total_frame;
598
0
  }
599
600
0
  if (gf_stats->non_zero_stdev_count)
601
0
    gf_stats->avg_raw_err_stdev /= gf_stats->non_zero_stdev_count;
602
0
}
603
604
0
#define BOOST_FACTOR 12.5
605
0
static double baseline_err_per_mb(const FRAME_INFO *frame_info) {
606
0
  unsigned int screen_area = frame_info->frame_height * frame_info->frame_width;
607
608
  // Use a different error per mb factor for calculating boost for
609
  //  different formats.
610
0
  if (screen_area <= 640 * 360) {
611
0
    return 500.0;
612
0
  } else {
613
0
    return 1000.0;
614
0
  }
615
0
}
616
617
// scale_max_boost = (cpi->oxcf.mode != REALTIME) in most cases as it was only
618
// tuned in non-rtc cases. The only exception is when we derive
619
// gfu_boost_average, we pass scale_max_boost = false for better coding
620
// efficiency.
621
static double calc_frame_boost(const PRIMARY_RATE_CONTROL *p_rc,
622
                               const FRAME_INFO *frame_info,
623
                               const FIRSTPASS_STATS *this_frame,
624
                               double this_frame_mv_in_out, double max_boost,
625
0
                               const bool scale_max_boost) {
626
0
  double frame_boost;
627
0
  const double lq = av1_convert_qindex_to_q(p_rc->avg_frame_qindex[INTER_FRAME],
628
0
                                            frame_info->bit_depth);
629
0
  const double boost_q_correction = AOMMIN((0.5 + (lq * 0.015)), 1.5);
630
0
  const double active_area = calculate_active_area(frame_info, this_frame);
631
632
  // Underlying boost factor is based on inter error ratio.
633
0
  frame_boost = AOMMAX(baseline_err_per_mb(frame_info) * active_area,
634
0
                       this_frame->intra_error * active_area) /
635
0
                DOUBLE_DIVIDE_CHECK(this_frame->coded_error);
636
0
  frame_boost = frame_boost * BOOST_FACTOR * boost_q_correction;
637
638
  // Increase boost for frames where new data coming into frame (e.g. zoom out).
639
  // Slightly reduce boost if there is a net balance of motion out of the frame
640
  // (zoom in). The range for this_frame_mv_in_out is -1.0 to +1.0.
641
0
  if (this_frame_mv_in_out > 0.0) {
642
0
    frame_boost += frame_boost * (this_frame_mv_in_out * 2.0);
643
0
    if (scale_max_boost) max_boost += max_boost * (this_frame_mv_in_out * 2.0);
644
0
  }
645
  // In the extreme case the boost is halved.
646
0
  else {
647
0
    frame_boost += frame_boost * (this_frame_mv_in_out / 2.0);
648
0
  }
649
650
0
  return AOMMIN(frame_boost, max_boost * boost_q_correction);
651
0
}
652
653
static double calc_kf_frame_boost(const PRIMARY_RATE_CONTROL *p_rc,
654
                                  const FRAME_INFO *frame_info,
655
                                  const FIRSTPASS_STATS *this_frame,
656
0
                                  double *sr_accumulator, double max_boost) {
657
0
  double frame_boost;
658
0
  const double lq = av1_convert_qindex_to_q(p_rc->avg_frame_qindex[INTER_FRAME],
659
0
                                            frame_info->bit_depth);
660
0
  const double boost_q_correction = AOMMIN((0.50 + (lq * 0.015)), 2.00);
661
0
  const double active_area = calculate_active_area(frame_info, this_frame);
662
663
  // Underlying boost factor is based on inter error ratio.
664
0
  frame_boost = AOMMAX(baseline_err_per_mb(frame_info) * active_area,
665
0
                       this_frame->intra_error * active_area) /
666
0
                DOUBLE_DIVIDE_CHECK(
667
0
                    (this_frame->coded_error + *sr_accumulator) * active_area);
668
669
  // Update the accumulator for second ref error difference.
670
  // This is intended to give an indication of how much the coded error is
671
  // increasing over time.
672
0
  *sr_accumulator += (this_frame->sr_coded_error - this_frame->coded_error);
673
0
  *sr_accumulator = AOMMAX(0.0, *sr_accumulator);
674
675
  // Q correction and scaling
676
  // The 40.0 value here is an experimentally derived baseline minimum.
677
  // This value is in line with the minimum per frame boost in the alt_ref
678
  // boost calculation.
679
0
  frame_boost = ((frame_boost + 40.0) * boost_q_correction);
680
681
0
  return AOMMIN(frame_boost, max_boost * boost_q_correction);
682
0
}
683
684
static int get_projected_gfu_boost(const PRIMARY_RATE_CONTROL *p_rc,
685
                                   int gfu_boost, int frames_to_project,
686
0
                                   int num_stats_used_for_gfu_boost) {
687
  /*
688
   * If frames_to_project is equal to num_stats_used_for_gfu_boost,
689
   * it means that gfu_boost was calculated over frames_to_project to
690
   * begin with(ie; all stats required were available), hence return
691
   * the original boost.
692
   */
693
0
  if (num_stats_used_for_gfu_boost >= frames_to_project) return gfu_boost;
694
695
0
  double min_boost_factor = sqrt(p_rc->baseline_gf_interval);
696
  // Get the current tpl factor (number of frames = frames_to_project).
697
0
  double tpl_factor = av1_get_gfu_boost_projection_factor(
698
0
      min_boost_factor, MAX_GFUBOOST_FACTOR, frames_to_project);
699
  // Get the tpl factor when number of frames = num_stats_used_for_prior_boost.
700
0
  double tpl_factor_num_stats = av1_get_gfu_boost_projection_factor(
701
0
      min_boost_factor, MAX_GFUBOOST_FACTOR, num_stats_used_for_gfu_boost);
702
0
  int projected_gfu_boost =
703
0
      (int)rint((tpl_factor * gfu_boost) / tpl_factor_num_stats);
704
0
  return projected_gfu_boost;
705
0
}
706
707
0
#define GF_MAX_BOOST 90.0
708
0
#define GF_MIN_BOOST 50
709
0
#define MIN_DECAY_FACTOR 0.01
710
int av1_calc_arf_boost(const TWO_PASS *twopass,
711
                       const TWO_PASS_FRAME *twopass_frame,
712
                       const PRIMARY_RATE_CONTROL *p_rc, FRAME_INFO *frame_info,
713
                       int offset, int f_frames, int b_frames,
714
                       int *num_fpstats_used, int *num_fpstats_required,
715
0
                       int project_gfu_boost, const bool scale_max_boost) {
716
0
  int i;
717
0
  GF_GROUP_STATS gf_stats;
718
0
  init_gf_stats(&gf_stats);
719
0
  double boost_score = (double)NORMAL_BOOST;
720
0
  int arf_boost;
721
0
  int flash_detected = 0;
722
0
  if (num_fpstats_used) *num_fpstats_used = 0;
723
724
  // Search forward from the proposed arf/next gf position.
725
0
  for (i = 0; i < f_frames; ++i) {
726
0
    const FIRSTPASS_STATS *this_frame =
727
0
        read_frame_stats(twopass, twopass_frame, i + offset);
728
0
    if (this_frame == NULL) break;
729
730
    // Update the motion related elements to the boost calculation.
731
0
    accumulate_frame_motion_stats(this_frame, &gf_stats,
732
0
                                  frame_info->frame_width,
733
0
                                  frame_info->frame_height);
734
735
    // We want to discount the flash frame itself and the recovery
736
    // frame that follows as both will have poor scores.
737
0
    flash_detected = detect_flash(twopass, twopass_frame, i + offset) ||
738
0
                     detect_flash(twopass, twopass_frame, i + offset + 1);
739
740
    // Accumulate the effect of prediction quality decay.
741
0
    if (!flash_detected) {
742
0
      gf_stats.decay_accumulator *= get_prediction_decay_rate(this_frame);
743
0
      gf_stats.decay_accumulator = gf_stats.decay_accumulator < MIN_DECAY_FACTOR
744
0
                                       ? MIN_DECAY_FACTOR
745
0
                                       : gf_stats.decay_accumulator;
746
0
    }
747
748
0
    boost_score += gf_stats.decay_accumulator *
749
0
                   calc_frame_boost(p_rc, frame_info, this_frame,
750
0
                                    gf_stats.this_frame_mv_in_out, GF_MAX_BOOST,
751
0
                                    scale_max_boost);
752
0
    if (num_fpstats_used) (*num_fpstats_used)++;
753
0
  }
754
755
0
  arf_boost = (int)boost_score;
756
757
  // Reset for backward looking loop.
758
0
  boost_score = 0.0;
759
0
  init_gf_stats(&gf_stats);
760
  // Search backward towards last gf position.
761
0
  for (i = -1; i >= -b_frames; --i) {
762
0
    const FIRSTPASS_STATS *this_frame =
763
0
        read_frame_stats(twopass, twopass_frame, i + offset);
764
0
    if (this_frame == NULL) break;
765
766
    // Update the motion related elements to the boost calculation.
767
0
    accumulate_frame_motion_stats(this_frame, &gf_stats,
768
0
                                  frame_info->frame_width,
769
0
                                  frame_info->frame_height);
770
771
    // We want to discount the the flash frame itself and the recovery
772
    // frame that follows as both will have poor scores.
773
0
    flash_detected = detect_flash(twopass, twopass_frame, i + offset) ||
774
0
                     detect_flash(twopass, twopass_frame, i + offset + 1);
775
776
    // Cumulative effect of prediction quality decay.
777
0
    if (!flash_detected) {
778
0
      gf_stats.decay_accumulator *= get_prediction_decay_rate(this_frame);
779
0
      gf_stats.decay_accumulator = gf_stats.decay_accumulator < MIN_DECAY_FACTOR
780
0
                                       ? MIN_DECAY_FACTOR
781
0
                                       : gf_stats.decay_accumulator;
782
0
    }
783
784
0
    boost_score += gf_stats.decay_accumulator *
785
0
                   calc_frame_boost(p_rc, frame_info, this_frame,
786
0
                                    gf_stats.this_frame_mv_in_out, GF_MAX_BOOST,
787
0
                                    scale_max_boost);
788
0
    if (num_fpstats_used) (*num_fpstats_used)++;
789
0
  }
790
0
  arf_boost += (int)boost_score;
791
792
0
  if (project_gfu_boost) {
793
0
    assert(num_fpstats_required != NULL);
794
0
    assert(num_fpstats_used != NULL);
795
0
    *num_fpstats_required = f_frames + b_frames;
796
0
    arf_boost = get_projected_gfu_boost(p_rc, arf_boost, *num_fpstats_required,
797
0
                                        *num_fpstats_used);
798
0
  }
799
800
0
  if (arf_boost < ((b_frames + f_frames) * GF_MIN_BOOST))
801
0
    arf_boost = ((b_frames + f_frames) * GF_MIN_BOOST);
802
803
0
  return arf_boost;
804
0
}
805
806
// Calculate a section intra ratio used in setting max loop filter.
807
static int calculate_section_intra_ratio(const FIRSTPASS_STATS *begin,
808
                                         const FIRSTPASS_STATS *end,
809
0
                                         int section_length) {
810
0
  const FIRSTPASS_STATS *s = begin;
811
0
  double intra_error = 0.0;
812
0
  double coded_error = 0.0;
813
0
  int i = 0;
814
815
0
  while (s < end && i < section_length) {
816
0
    intra_error += s->intra_error;
817
0
    coded_error += s->coded_error;
818
0
    ++s;
819
0
    ++i;
820
0
  }
821
822
0
  return (int)(intra_error / DOUBLE_DIVIDE_CHECK(coded_error));
823
0
}
824
825
/*!\brief Calculates the bit target for this GF/ARF group
826
 *
827
 * \ingroup rate_control
828
 *
829
 * Calculates the total bits to allocate in this GF/ARF group.
830
 *
831
 * \param[in]    cpi              Top-level encoder structure
832
 * \param[in]    gf_group_err     Cumulative coded error score for the
833
 *                                frames making up this group.
834
 *
835
 * \return The target total number of bits for this GF/ARF group.
836
 */
837
static int64_t calculate_total_gf_group_bits(AV1_COMP *cpi,
838
0
                                             double gf_group_err) {
839
0
  const RATE_CONTROL *const rc = &cpi->rc;
840
0
  const PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
841
0
  const TWO_PASS *const twopass = &cpi->ppi->twopass;
842
0
  const int max_bits = frame_max_bits(rc, &cpi->oxcf);
843
0
  int64_t total_group_bits;
844
845
  // Calculate the bits to be allocated to the group as a whole.
846
0
  if ((twopass->kf_group_bits > 0) && (twopass->kf_group_error_left > 0)) {
847
0
    total_group_bits = (int64_t)(twopass->kf_group_bits *
848
0
                                 (gf_group_err / twopass->kf_group_error_left));
849
0
  } else {
850
0
    total_group_bits = 0;
851
0
  }
852
853
  // Clamp odd edge cases.
854
0
  total_group_bits = (total_group_bits < 0) ? 0
855
0
                     : (total_group_bits > twopass->kf_group_bits)
856
0
                         ? twopass->kf_group_bits
857
0
                         : total_group_bits;
858
859
  // Clip based on user supplied data rate variability limit.
860
0
  if (total_group_bits > (int64_t)max_bits * p_rc->baseline_gf_interval)
861
0
    total_group_bits = (int64_t)max_bits * p_rc->baseline_gf_interval;
862
863
0
  return total_group_bits;
864
0
}
865
866
// Calculate the number of bits to assign to boosted frames in a group.
867
static int calculate_boost_bits(int frame_count, int boost,
868
0
                                int64_t total_group_bits) {
869
0
  int allocation_chunks;
870
871
  // return 0 for invalid inputs (could arise e.g. through rounding errors)
872
0
  if (!boost || (total_group_bits <= 0)) return 0;
873
874
0
  if (frame_count <= 0) return (int)(AOMMIN(total_group_bits, INT_MAX));
875
876
0
  allocation_chunks = (frame_count * 100) + boost;
877
878
  // Prevent overflow.
879
0
  if (boost > 1023) {
880
0
    int divisor = boost >> 10;
881
0
    boost /= divisor;
882
0
    allocation_chunks /= divisor;
883
0
  }
884
885
  // Calculate the number of extra bits for use in the boosted frame or frames.
886
0
  return AOMMAX((int)(((int64_t)boost * total_group_bits) / allocation_chunks),
887
0
                0);
888
0
}
889
890
// Calculate the boost factor based on the number of bits assigned, i.e. the
891
// inverse of calculate_boost_bits().
892
static int calculate_boost_factor(int frame_count, int bits,
893
0
                                  int64_t total_group_bits) {
894
0
  return (int)(100.0 * frame_count * bits / (total_group_bits - bits));
895
0
}
896
897
// Reduce the number of bits assigned to keyframe or arf if necessary, to
898
// prevent bitrate spikes that may break level constraints.
899
// frame_type: 0: keyframe; 1: arf.
900
static int adjust_boost_bits_for_target_level(const AV1_COMP *const cpi,
901
                                              RATE_CONTROL *const rc,
902
                                              int bits_assigned,
903
                                              int64_t group_bits,
904
0
                                              int frame_type) {
905
0
  const AV1_COMMON *const cm = &cpi->common;
906
0
  const SequenceHeader *const seq_params = cm->seq_params;
907
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
908
0
  const int temporal_layer_id = cm->temporal_layer_id;
909
0
  const int spatial_layer_id = cm->spatial_layer_id;
910
0
  for (int index = 0; index < seq_params->operating_points_cnt_minus_1 + 1;
911
0
       ++index) {
912
0
    if (!is_in_operating_point(seq_params->operating_point_idc[index],
913
0
                               temporal_layer_id, spatial_layer_id)) {
914
0
      continue;
915
0
    }
916
917
0
    const AV1_LEVEL target_level =
918
0
        cpi->ppi->level_params.target_seq_level_idx[index];
919
0
    if (target_level >= SEQ_LEVELS) continue;
920
921
0
    assert(is_valid_seq_level_idx(target_level));
922
923
0
    const double level_bitrate_limit = av1_get_max_bitrate_for_level(
924
0
        target_level, seq_params->tier[0], seq_params->profile);
925
0
    const int target_bits_per_frame =
926
0
        (int)(level_bitrate_limit / cpi->framerate);
927
0
    if (frame_type == 0) {
928
      // Maximum bits for keyframe is 8 times the target_bits_per_frame.
929
0
      const int level_enforced_max_kf_bits = target_bits_per_frame * 8;
930
0
      if (bits_assigned > level_enforced_max_kf_bits) {
931
0
        const int frames = rc->frames_to_key - 1;
932
0
        p_rc->kf_boost = calculate_boost_factor(
933
0
            frames, level_enforced_max_kf_bits, group_bits);
934
0
        bits_assigned =
935
0
            calculate_boost_bits(frames, p_rc->kf_boost, group_bits);
936
0
      }
937
0
    } else if (frame_type == 1) {
938
      // Maximum bits for arf is 4 times the target_bits_per_frame.
939
0
      const int level_enforced_max_arf_bits = target_bits_per_frame * 4;
940
0
      if (bits_assigned > level_enforced_max_arf_bits) {
941
0
        p_rc->gfu_boost =
942
0
            calculate_boost_factor(p_rc->baseline_gf_interval,
943
0
                                   level_enforced_max_arf_bits, group_bits);
944
0
        bits_assigned = calculate_boost_bits(p_rc->baseline_gf_interval,
945
0
                                             p_rc->gfu_boost, group_bits);
946
0
      }
947
0
    } else {
948
0
      assert(0);
949
0
    }
950
0
  }
951
952
0
  return bits_assigned;
953
0
}
954
955
// Allocate bits to each frame in a GF / ARF group
956
static void allocate_gf_group_bits(GF_GROUP *gf_group,
957
                                   PRIMARY_RATE_CONTROL *const p_rc,
958
                                   RATE_CONTROL *const rc,
959
                                   int64_t gf_group_bits, int gf_arf_bits,
960
0
                                   int key_frame, int use_arf) {
961
0
  static const double layer_fraction[MAX_ARF_LAYERS + 1] = { 1.0,  0.70, 0.55,
962
0
                                                             0.60, 0.60, 1.0,
963
0
                                                             1.0 };
964
0
  int64_t total_group_bits = gf_group_bits;
965
0
  int base_frame_bits;
966
0
  const int gf_group_size = gf_group->size;
967
0
  int layer_frames[MAX_ARF_LAYERS + 1] = { 0 };
968
969
  // For key frames the frame target rate is already set and it
970
  // is also the golden frame.
971
  // === [frame_index == 0] ===
972
0
  int frame_index = !!key_frame;
973
974
  // Subtract the extra bits set aside for ARF frames from the Group Total
975
0
  if (use_arf) total_group_bits -= gf_arf_bits;
976
977
0
  int num_frames =
978
0
      AOMMAX(1, p_rc->baseline_gf_interval - (rc->frames_since_key == 0));
979
0
  base_frame_bits = (int)(total_group_bits / num_frames);
980
981
  // Check the number of frames in each layer in case we have a
982
  // non standard group length.
983
0
  int max_arf_layer = gf_group->max_layer_depth - 1;
984
0
  for (int idx = frame_index; idx < gf_group_size; ++idx) {
985
0
    if ((gf_group->update_type[idx] == ARF_UPDATE) ||
986
0
        (gf_group->update_type[idx] == INTNL_ARF_UPDATE)) {
987
0
      layer_frames[gf_group->layer_depth[idx]]++;
988
0
    }
989
0
  }
990
991
  // Allocate extra bits to each ARF layer
992
0
  int i;
993
0
  int layer_extra_bits[MAX_ARF_LAYERS + 1] = { 0 };
994
0
  assert(max_arf_layer <= MAX_ARF_LAYERS);
995
0
  for (i = 1; i <= max_arf_layer; ++i) {
996
0
    double fraction = (i == max_arf_layer) ? 1.0 : layer_fraction[i];
997
0
    layer_extra_bits[i] =
998
0
        (int)((gf_arf_bits * fraction) / AOMMAX(1, layer_frames[i]));
999
0
    gf_arf_bits -= (int)(gf_arf_bits * fraction);
1000
0
  }
1001
1002
  // Now combine ARF layer and baseline bits to give total bits for each frame.
1003
0
  int arf_extra_bits;
1004
0
  for (int idx = frame_index; idx < gf_group_size; ++idx) {
1005
0
    switch (gf_group->update_type[idx]) {
1006
0
      case ARF_UPDATE:
1007
0
      case INTNL_ARF_UPDATE:
1008
0
        arf_extra_bits = layer_extra_bits[gf_group->layer_depth[idx]];
1009
0
        gf_group->bit_allocation[idx] =
1010
0
            (base_frame_bits > INT_MAX - arf_extra_bits)
1011
0
                ? INT_MAX
1012
0
                : (base_frame_bits + arf_extra_bits);
1013
0
        break;
1014
0
      case INTNL_OVERLAY_UPDATE:
1015
0
      case OVERLAY_UPDATE: gf_group->bit_allocation[idx] = 0; break;
1016
0
      default: gf_group->bit_allocation[idx] = base_frame_bits; break;
1017
0
    }
1018
0
  }
1019
1020
  // Set the frame following the current GOP to 0 bit allocation. For ARF
1021
  // groups, this next frame will be overlay frame, which is the first frame
1022
  // in the next GOP. For GF group, next GOP will overwrite the rate allocation.
1023
  // Setting this frame to use 0 bit (of out the current GOP budget) will
1024
  // simplify logics in reference frame management.
1025
0
  if (gf_group_size < MAX_STATIC_GF_GROUP_LENGTH)
1026
0
    gf_group->bit_allocation[gf_group_size] = 0;
1027
0
}
1028
1029
// Returns true if KF group and GF group both are almost completely static.
1030
static inline int is_almost_static(double gf_zero_motion, int kf_zero_motion,
1031
0
                                   int is_lap_enabled) {
1032
0
  if (is_lap_enabled) {
1033
    /*
1034
     * when LAP enabled kf_zero_motion is not reliable, so use strict
1035
     * constraint on gf_zero_motion.
1036
     */
1037
0
    return (gf_zero_motion >= 0.999);
1038
0
  } else {
1039
0
    return (gf_zero_motion >= 0.995) &&
1040
0
           (kf_zero_motion >= STATIC_KF_GROUP_THRESH);
1041
0
  }
1042
0
}
1043
1044
0
#define ARF_ABS_ZOOM_THRESH 4.4
1045
static inline int detect_gf_cut(AV1_COMP *cpi, int frame_index, int cur_start,
1046
                                int flash_detected, int active_max_gf_interval,
1047
                                int active_min_gf_interval,
1048
0
                                GF_GROUP_STATS *gf_stats) {
1049
0
  RATE_CONTROL *const rc = &cpi->rc;
1050
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
1051
0
  AV1_COMMON *const cm = &cpi->common;
1052
  // Motion breakout threshold for loop below depends on image size.
1053
0
  const double mv_ratio_accumulator_thresh = (cm->height + cm->width) / 4.0;
1054
1055
0
  if (!flash_detected) {
1056
    // Break clause to detect very still sections after motion. For example,
1057
    // a static image after a fade or other transition.
1058
1059
    // TODO(angiebird): This is a temporary change, we will avoid using
1060
    // twopass_frame.stats_in in the follow-up CL
1061
0
    int index = (int)(cpi->twopass_frame.stats_in -
1062
0
                      twopass->stats_buf_ctx->stats_in_start);
1063
0
    if (detect_transition_to_still(&twopass->firstpass_info, index,
1064
0
                                   rc->min_gf_interval, frame_index - cur_start,
1065
0
                                   5, gf_stats->loop_decay_rate,
1066
0
                                   gf_stats->last_loop_decay_rate)) {
1067
0
      return 1;
1068
0
    }
1069
0
  }
1070
1071
  // Some conditions to breakout after min interval.
1072
0
  if (frame_index - cur_start >= active_min_gf_interval &&
1073
      // If possible don't break very close to a kf
1074
0
      (rc->frames_to_key - frame_index >= rc->min_gf_interval) &&
1075
0
      ((frame_index - cur_start) & 0x01) && !flash_detected &&
1076
0
      (gf_stats->mv_ratio_accumulator > mv_ratio_accumulator_thresh ||
1077
0
       gf_stats->abs_mv_in_out_accumulator > ARF_ABS_ZOOM_THRESH)) {
1078
0
    return 1;
1079
0
  }
1080
1081
  // If almost totally static, we will not use the the max GF length later,
1082
  // so we can continue for more frames.
1083
0
  if ((frame_index - cur_start) >= active_max_gf_interval + 1 &&
1084
0
      ((cpi->oxcf.mode != REALTIME) ||
1085
0
       !is_almost_static(gf_stats->zero_motion_accumulator,
1086
0
                         twopass->kf_zeromotion_pct, cpi->ppi->lap_enabled))) {
1087
0
    return 1;
1088
0
  }
1089
0
  return 0;
1090
0
}
1091
1092
static int is_shorter_gf_interval_better(
1093
0
    AV1_COMP *cpi, const EncodeFrameParams *frame_params) {
1094
0
  if (av1_use_tpl_for_extrc(&cpi->ext_ratectrl) ||
1095
0
      av1_encode_for_extrc(&cpi->ext_ratectrl)) {
1096
0
    return 0;
1097
0
  }
1098
0
  const RATE_CONTROL *const rc = &cpi->rc;
1099
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
1100
0
  int gop_length_decision_method = cpi->sf.tpl_sf.gop_length_decision_method;
1101
0
  int shorten_gf_interval;
1102
1103
0
  av1_tpl_preload_rc_estimate(cpi, frame_params);
1104
1105
0
  if (gop_length_decision_method == 2) {
1106
    // GF group length is decided based on GF boost and tpl stats of ARFs from
1107
    // base layer, (base+1) layer.
1108
0
    shorten_gf_interval =
1109
0
        (p_rc->gfu_boost <
1110
0
         p_rc->num_stats_used_for_gfu_boost * GF_MIN_BOOST * 1.4) &&
1111
0
        !av1_tpl_setup_stats(cpi, 3, frame_params);
1112
0
  } else {
1113
0
    int do_complete_tpl = 1;
1114
0
    GF_GROUP *const gf_group = &cpi->ppi->gf_group;
1115
0
    int is_temporal_filter_enabled =
1116
0
        (rc->frames_since_key > 0 && gf_group->arf_index > -1);
1117
1118
0
    if (gop_length_decision_method == 1) {
1119
      // Check if tpl stats of ARFs from base layer, (base+1) layer,
1120
      // (base+2) layer can decide the GF group length.
1121
0
      int gop_length_eval = av1_tpl_setup_stats(cpi, 2, frame_params);
1122
1123
0
      if (gop_length_eval != 2) {
1124
0
        do_complete_tpl = 0;
1125
0
        shorten_gf_interval = !gop_length_eval;
1126
0
      }
1127
0
    }
1128
1129
0
    if (do_complete_tpl) {
1130
      // Decide GF group length based on complete tpl stats.
1131
0
      shorten_gf_interval = !av1_tpl_setup_stats(cpi, 1, frame_params);
1132
      // Tpl stats is reused when the ARF is temporally filtered and GF
1133
      // interval is not shortened.
1134
0
      if (is_temporal_filter_enabled && !shorten_gf_interval) {
1135
0
        cpi->skip_tpl_setup_stats = 1;
1136
#if CONFIG_BITRATE_ACCURACY && !CONFIG_THREE_PASS
1137
        assert(cpi->gf_frame_index == 0);
1138
        av1_vbr_rc_update_q_index_list(&cpi->vbr_rc_info, &cpi->ppi->tpl_data,
1139
                                       gf_group,
1140
                                       cpi->common.seq_params->bit_depth);
1141
#endif  // CONFIG_BITRATE_ACCURACY
1142
0
      }
1143
0
    }
1144
0
  }
1145
0
  return shorten_gf_interval;
1146
0
}
1147
1148
#define MIN_SHRINK_LEN 6  // the minimum length of gf if we are shrinking
1149
0
#define SMOOTH_FILT_LEN 7
1150
0
#define HALF_FILT_LEN (SMOOTH_FILT_LEN / 2)
1151
0
#define WINDOW_SIZE 7
1152
0
#define HALF_WIN (WINDOW_SIZE / 2)
1153
1154
// Smooth filter intra_error and coded_error in firstpass stats.
1155
// If stats[i].is_flash==1, the ith element should not be used in the filtering.
1156
static void smooth_filter_stats(const FIRSTPASS_STATS *stats, int start_idx,
1157
                                int last_idx, double *filt_intra_err,
1158
0
                                double *filt_coded_err) {
1159
  // A 7-tap gaussian smooth filter
1160
0
  static const double smooth_filt[SMOOTH_FILT_LEN] = { 0.006, 0.061, 0.242,
1161
0
                                                       0.383, 0.242, 0.061,
1162
0
                                                       0.006 };
1163
0
  int i, j;
1164
0
  for (i = start_idx; i <= last_idx; i++) {
1165
0
    double total_wt = 0;
1166
0
    for (j = -HALF_FILT_LEN; j <= HALF_FILT_LEN; j++) {
1167
0
      int idx = clamp(i + j, start_idx, last_idx);
1168
0
      if (stats[idx].is_flash) continue;
1169
1170
0
      filt_intra_err[i] +=
1171
0
          smooth_filt[j + HALF_FILT_LEN] * stats[idx].intra_error;
1172
0
      total_wt += smooth_filt[j + HALF_FILT_LEN];
1173
0
    }
1174
0
    if (total_wt > 0.01) {
1175
0
      filt_intra_err[i] /= total_wt;
1176
0
    } else {
1177
0
      filt_intra_err[i] = stats[i].intra_error;
1178
0
    }
1179
0
  }
1180
0
  for (i = start_idx; i <= last_idx; i++) {
1181
0
    double total_wt = 0;
1182
0
    for (j = -HALF_FILT_LEN; j <= HALF_FILT_LEN; j++) {
1183
0
      int idx = clamp(i + j, start_idx, last_idx);
1184
      // Coded error involves idx and idx - 1.
1185
0
      if (stats[idx].is_flash || (idx > 0 && stats[idx - 1].is_flash)) continue;
1186
1187
0
      filt_coded_err[i] +=
1188
0
          smooth_filt[j + HALF_FILT_LEN] * stats[idx].coded_error;
1189
0
      total_wt += smooth_filt[j + HALF_FILT_LEN];
1190
0
    }
1191
0
    if (total_wt > 0.01) {
1192
0
      filt_coded_err[i] /= total_wt;
1193
0
    } else {
1194
0
      filt_coded_err[i] = stats[i].coded_error;
1195
0
    }
1196
0
  }
1197
0
}
1198
1199
// Calculate gradient
1200
static void get_gradient(const double *values, int start, int last,
1201
0
                         double *grad) {
1202
0
  if (start == last) {
1203
0
    grad[start] = 0;
1204
0
    return;
1205
0
  }
1206
0
  for (int i = start; i <= last; i++) {
1207
0
    int prev = AOMMAX(i - 1, start);
1208
0
    int next = AOMMIN(i + 1, last);
1209
0
    grad[i] = (values[next] - values[prev]) / (next - prev);
1210
0
  }
1211
0
}
1212
1213
static int find_next_scenecut(const FIRSTPASS_STATS *const stats_start,
1214
0
                              int first, int last) {
1215
  // Identify unstable areas caused by scenecuts.
1216
  // Find the max and 2nd max coded error, and the average of the rest frames.
1217
  // If there is only one frame that yields a huge coded error, it is likely a
1218
  // scenecut.
1219
0
  double this_ratio, max_prev_ratio, max_next_ratio, max_prev_coded,
1220
0
      max_next_coded;
1221
1222
0
  if (last - first == 0) return -1;
1223
1224
0
  for (int i = first; i <= last; i++) {
1225
0
    if (stats_start[i].is_flash || (i > 0 && stats_start[i - 1].is_flash))
1226
0
      continue;
1227
0
    double temp_intra = AOMMAX(stats_start[i].intra_error, 0.01);
1228
0
    this_ratio = stats_start[i].coded_error / temp_intra;
1229
    // find the avg ratio in the preceding neighborhood
1230
0
    max_prev_ratio = 0;
1231
0
    max_prev_coded = 0;
1232
0
    for (int j = AOMMAX(first, i - HALF_WIN); j < i; j++) {
1233
0
      if (stats_start[j].is_flash || (j > 0 && stats_start[j - 1].is_flash))
1234
0
        continue;
1235
0
      temp_intra = AOMMAX(stats_start[j].intra_error, 0.01);
1236
0
      double temp_ratio = stats_start[j].coded_error / temp_intra;
1237
0
      if (temp_ratio > max_prev_ratio) {
1238
0
        max_prev_ratio = temp_ratio;
1239
0
      }
1240
0
      if (stats_start[j].coded_error > max_prev_coded) {
1241
0
        max_prev_coded = stats_start[j].coded_error;
1242
0
      }
1243
0
    }
1244
    // find the avg ratio in the following neighborhood
1245
0
    max_next_ratio = 0;
1246
0
    max_next_coded = 0;
1247
0
    for (int j = i + 1; j <= AOMMIN(i + HALF_WIN, last); j++) {
1248
0
      if (stats_start[i].is_flash || (i > 0 && stats_start[i - 1].is_flash))
1249
0
        continue;
1250
0
      temp_intra = AOMMAX(stats_start[j].intra_error, 0.01);
1251
0
      double temp_ratio = stats_start[j].coded_error / temp_intra;
1252
0
      if (temp_ratio > max_next_ratio) {
1253
0
        max_next_ratio = temp_ratio;
1254
0
      }
1255
0
      if (stats_start[j].coded_error > max_next_coded) {
1256
0
        max_next_coded = stats_start[j].coded_error;
1257
0
      }
1258
0
    }
1259
1260
0
    if (max_prev_ratio < 0.001 && max_next_ratio < 0.001) {
1261
      // the ratios are very small, only check a small fixed threshold
1262
0
      if (this_ratio < 0.02) continue;
1263
0
    } else {
1264
      // check if this frame has a larger ratio than the neighborhood
1265
0
      double max_sr = stats_start[i].sr_coded_error;
1266
0
      if (i < last) max_sr = AOMMAX(max_sr, stats_start[i + 1].sr_coded_error);
1267
0
      double max_sr_fr_ratio =
1268
0
          max_sr / AOMMAX(stats_start[i].coded_error, 0.01);
1269
1270
0
      if (max_sr_fr_ratio > 1.2) continue;
1271
0
      if (this_ratio < 2 * AOMMAX(max_prev_ratio, max_next_ratio) &&
1272
0
          stats_start[i].coded_error <
1273
0
              2 * AOMMAX(max_prev_coded, max_next_coded)) {
1274
0
        continue;
1275
0
      }
1276
0
    }
1277
0
    return i;
1278
0
  }
1279
0
  return -1;
1280
0
}
1281
1282
// Remove the region with index next_region.
1283
// parameter merge: 0: merge with previous; 1: merge with next; 2:
1284
// merge with both, take type from previous if possible
1285
// After removing, next_region will be the index of the next region.
1286
static void remove_region(int merge, REGIONS *regions, int *num_regions,
1287
0
                          int *next_region) {
1288
0
  int k = *next_region;
1289
0
  assert(k < *num_regions);
1290
0
  if (*num_regions == 1) {
1291
0
    *num_regions = 0;
1292
0
    return;
1293
0
  }
1294
0
  if (k == 0) {
1295
0
    merge = 1;
1296
0
  } else if (k == *num_regions - 1) {
1297
0
    merge = 0;
1298
0
  }
1299
0
  int num_merge = (merge == 2) ? 2 : 1;
1300
0
  switch (merge) {
1301
0
    case 0:
1302
0
      regions[k - 1].last = regions[k].last;
1303
0
      *next_region = k;
1304
0
      break;
1305
0
    case 1:
1306
0
      regions[k + 1].start = regions[k].start;
1307
0
      *next_region = k + 1;
1308
0
      break;
1309
0
    case 2:
1310
0
      regions[k - 1].last = regions[k + 1].last;
1311
0
      *next_region = k;
1312
0
      break;
1313
0
    default: assert(0);
1314
0
  }
1315
0
  *num_regions -= num_merge;
1316
0
  for (k = *next_region - (merge == 1); k < *num_regions; k++) {
1317
0
    regions[k] = regions[k + num_merge];
1318
0
  }
1319
0
}
1320
1321
// Insert a region in the cur_region_idx. The start and last should both be in
1322
// the current region. After insertion, the cur_region_idx will point to the
1323
// last region that was splitted from the original region.
1324
static void insert_region(int start, int last, REGION_TYPES type,
1325
                          REGIONS *regions, int *num_regions,
1326
0
                          int *cur_region_idx) {
1327
0
  int k = *cur_region_idx;
1328
0
  REGION_TYPES this_region_type = regions[k].type;
1329
0
  int this_region_last = regions[k].last;
1330
0
  int num_add = (start != regions[k].start) + (last != regions[k].last);
1331
  // move the following regions further to the back
1332
0
  for (int r = *num_regions - 1; r > k; r--) {
1333
0
    regions[r + num_add] = regions[r];
1334
0
  }
1335
0
  *num_regions += num_add;
1336
0
  if (start > regions[k].start) {
1337
0
    regions[k].last = start - 1;
1338
0
    k++;
1339
0
    regions[k].start = start;
1340
0
  }
1341
0
  regions[k].type = type;
1342
0
  if (last < this_region_last) {
1343
0
    regions[k].last = last;
1344
0
    k++;
1345
0
    regions[k].start = last + 1;
1346
0
    regions[k].last = this_region_last;
1347
0
    regions[k].type = this_region_type;
1348
0
  } else {
1349
0
    regions[k].last = this_region_last;
1350
0
  }
1351
0
  *cur_region_idx = k;
1352
0
}
1353
1354
// Get the average of stats inside a region.
1355
static void analyze_region(const FIRSTPASS_STATS *stats, int k,
1356
0
                           REGIONS *regions) {
1357
0
  int i;
1358
0
  regions[k].avg_cor_coeff = 0;
1359
0
  regions[k].avg_sr_fr_ratio = 0;
1360
0
  regions[k].avg_intra_err = 0;
1361
0
  regions[k].avg_coded_err = 0;
1362
1363
0
  int check_first_sr = (k != 0);
1364
1365
0
  for (i = regions[k].start; i <= regions[k].last; i++) {
1366
0
    if (i > regions[k].start || check_first_sr) {
1367
0
      double num_frames =
1368
0
          (double)(regions[k].last - regions[k].start + check_first_sr);
1369
0
      double max_coded_error =
1370
0
          AOMMAX(stats[i].coded_error, stats[i - 1].coded_error);
1371
0
      double this_ratio =
1372
0
          stats[i].sr_coded_error / AOMMAX(max_coded_error, 0.001);
1373
0
      regions[k].avg_sr_fr_ratio += this_ratio / num_frames;
1374
0
    }
1375
1376
0
    regions[k].avg_intra_err +=
1377
0
        stats[i].intra_error / (double)(regions[k].last - regions[k].start + 1);
1378
0
    regions[k].avg_coded_err +=
1379
0
        stats[i].coded_error / (double)(regions[k].last - regions[k].start + 1);
1380
1381
0
    regions[k].avg_cor_coeff +=
1382
0
        AOMMAX(stats[i].cor_coeff, 0.001) /
1383
0
        (double)(regions[k].last - regions[k].start + 1);
1384
0
    regions[k].avg_noise_var +=
1385
0
        AOMMAX(stats[i].noise_var, 0.001) /
1386
0
        (double)(regions[k].last - regions[k].start + 1);
1387
0
  }
1388
0
}
1389
1390
// Calculate the regions stats of every region.
1391
static void get_region_stats(const FIRSTPASS_STATS *stats, REGIONS *regions,
1392
0
                             int num_regions) {
1393
0
  for (int k = 0; k < num_regions; k++) {
1394
0
    analyze_region(stats, k, regions);
1395
0
  }
1396
0
}
1397
1398
// Find tentative stable regions
1399
static int find_stable_regions(const FIRSTPASS_STATS *stats,
1400
                               const double *grad_coded, int this_start,
1401
0
                               int this_last, REGIONS *regions) {
1402
0
  int i, j, k = 0;
1403
0
  regions[k].start = this_start;
1404
0
  for (i = this_start; i <= this_last; i++) {
1405
    // Check mean and variance of stats in a window
1406
0
    double mean_intra = 0.001, var_intra = 0.001;
1407
0
    double mean_coded = 0.001, var_coded = 0.001;
1408
0
    int count = 0;
1409
0
    for (j = -HALF_WIN; j <= HALF_WIN; j++) {
1410
0
      int idx = clamp(i + j, this_start, this_last);
1411
0
      if (stats[idx].is_flash || (idx > 0 && stats[idx - 1].is_flash)) continue;
1412
0
      mean_intra += stats[idx].intra_error;
1413
0
      var_intra += stats[idx].intra_error * stats[idx].intra_error;
1414
0
      mean_coded += stats[idx].coded_error;
1415
0
      var_coded += stats[idx].coded_error * stats[idx].coded_error;
1416
0
      count++;
1417
0
    }
1418
1419
0
    REGION_TYPES cur_type;
1420
0
    if (count > 0) {
1421
0
      mean_intra /= (double)count;
1422
0
      var_intra /= (double)count;
1423
0
      mean_coded /= (double)count;
1424
0
      var_coded /= (double)count;
1425
0
      int is_intra_stable = (var_intra / (mean_intra * mean_intra) < 1.03);
1426
0
      int is_coded_stable = (var_coded / (mean_coded * mean_coded) < 1.04 &&
1427
0
                             fabs(grad_coded[i]) / mean_coded < 0.05) ||
1428
0
                            mean_coded / mean_intra < 0.05;
1429
0
      int is_coded_small = mean_coded < 0.5 * mean_intra;
1430
0
      cur_type = (is_intra_stable && is_coded_stable && is_coded_small)
1431
0
                     ? STABLE_REGION
1432
0
                     : HIGH_VAR_REGION;
1433
0
    } else {
1434
0
      cur_type = HIGH_VAR_REGION;
1435
0
    }
1436
1437
    // mark a new region if type changes
1438
0
    if (i == regions[k].start) {
1439
      // first frame in the region
1440
0
      regions[k].type = cur_type;
1441
0
    } else if (cur_type != regions[k].type) {
1442
      // Append a new region
1443
0
      regions[k].last = i - 1;
1444
0
      regions[k + 1].start = i;
1445
0
      regions[k + 1].type = cur_type;
1446
0
      k++;
1447
0
    }
1448
0
  }
1449
0
  regions[k].last = this_last;
1450
0
  return k + 1;
1451
0
}
1452
1453
// Clean up regions that should be removed or merged.
1454
0
static void cleanup_regions(REGIONS *regions, int *num_regions) {
1455
0
  int k = 0;
1456
0
  while (k < *num_regions) {
1457
0
    if ((k > 0 && regions[k - 1].type == regions[k].type &&
1458
0
         regions[k].type != SCENECUT_REGION) ||
1459
0
        regions[k].last < regions[k].start) {
1460
0
      remove_region(0, regions, num_regions, &k);
1461
0
    } else {
1462
0
      k++;
1463
0
    }
1464
0
  }
1465
0
}
1466
1467
// Remove regions that are of type and shorter than length.
1468
// Merge it with its neighboring regions.
1469
static void remove_short_regions(REGIONS *regions, int *num_regions,
1470
0
                                 REGION_TYPES type, int length) {
1471
0
  int k = 0;
1472
0
  while (k < *num_regions && (*num_regions) > 1) {
1473
0
    if ((regions[k].last - regions[k].start + 1 < length &&
1474
0
         regions[k].type == type)) {
1475
      // merge current region with the previous and next regions
1476
0
      remove_region(2, regions, num_regions, &k);
1477
0
    } else {
1478
0
      k++;
1479
0
    }
1480
0
  }
1481
0
  cleanup_regions(regions, num_regions);
1482
0
}
1483
1484
static void adjust_unstable_region_bounds(const FIRSTPASS_STATS *stats,
1485
0
                                          REGIONS *regions, int *num_regions) {
1486
0
  int i, j, k;
1487
  // Remove regions that are too short. Likely noise.
1488
0
  remove_short_regions(regions, num_regions, STABLE_REGION, HALF_WIN);
1489
0
  remove_short_regions(regions, num_regions, HIGH_VAR_REGION, HALF_WIN);
1490
1491
0
  get_region_stats(stats, regions, *num_regions);
1492
1493
  // Adjust region boundaries. The thresholds are empirically obtained, but
1494
  // overall the performance is not very sensitive to small changes to them.
1495
0
  for (k = 0; k < *num_regions; k++) {
1496
0
    if (regions[k].type == STABLE_REGION) continue;
1497
0
    if (k > 0) {
1498
      // Adjust previous boundary.
1499
      // First find the average intra/coded error in the previous
1500
      // neighborhood.
1501
0
      double avg_intra_err = 0;
1502
0
      const int starti = AOMMAX(regions[k - 1].last - WINDOW_SIZE + 1,
1503
0
                                regions[k - 1].start + 1);
1504
0
      const int lasti = regions[k - 1].last;
1505
0
      int counti = 0;
1506
0
      for (i = starti; i <= lasti; i++) {
1507
0
        avg_intra_err += stats[i].intra_error;
1508
0
        counti++;
1509
0
      }
1510
0
      if (counti > 0) {
1511
0
        avg_intra_err = AOMMAX(avg_intra_err / (double)counti, 0.001);
1512
0
        int count_coded = 0, count_grad = 0;
1513
0
        for (j = lasti + 1; j <= regions[k].last; j++) {
1514
0
          const int intra_close =
1515
0
              fabs(stats[j].intra_error - avg_intra_err) / avg_intra_err < 0.1;
1516
0
          const int coded_small = stats[j].coded_error / avg_intra_err < 0.1;
1517
0
          const int coeff_close = stats[j].cor_coeff > 0.995;
1518
0
          if (!coeff_close || !coded_small) count_coded--;
1519
0
          if (intra_close && count_coded >= 0 && count_grad >= 0) {
1520
            // this frame probably belongs to the previous stable region
1521
0
            regions[k - 1].last = j;
1522
0
            regions[k].start = j + 1;
1523
0
          } else {
1524
0
            break;
1525
0
          }
1526
0
        }
1527
0
      }
1528
0
    }  // if k > 0
1529
0
    if (k < *num_regions - 1) {
1530
      // Adjust next boundary.
1531
      // First find the average intra/coded error in the next neighborhood.
1532
0
      double avg_intra_err = 0;
1533
0
      const int starti = regions[k + 1].start;
1534
0
      const int lasti = AOMMIN(regions[k + 1].last - 1,
1535
0
                               regions[k + 1].start + WINDOW_SIZE - 1);
1536
0
      int counti = 0;
1537
0
      for (i = starti; i <= lasti; i++) {
1538
0
        avg_intra_err += stats[i].intra_error;
1539
0
        counti++;
1540
0
      }
1541
0
      if (counti > 0) {
1542
0
        avg_intra_err = AOMMAX(avg_intra_err / (double)counti, 0.001);
1543
        // At the boundary, coded error is large, but still the frame is stable
1544
0
        int count_coded = 1, count_grad = 1;
1545
0
        for (j = starti - 1; j >= regions[k].start; j--) {
1546
0
          const int intra_close =
1547
0
              fabs(stats[j].intra_error - avg_intra_err) / avg_intra_err < 0.1;
1548
0
          const int coded_small =
1549
0
              stats[j + 1].coded_error / avg_intra_err < 0.1;
1550
0
          const int coeff_close = stats[j].cor_coeff > 0.995;
1551
0
          if (!coeff_close || !coded_small) count_coded--;
1552
0
          if (intra_close && count_coded >= 0 && count_grad >= 0) {
1553
            // this frame probably belongs to the next stable region
1554
0
            regions[k + 1].start = j;
1555
0
            regions[k].last = j - 1;
1556
0
          } else {
1557
0
            break;
1558
0
          }
1559
0
        }
1560
0
      }
1561
0
    }  // if k < *num_regions - 1
1562
0
  }  // end of loop over all regions
1563
1564
0
  cleanup_regions(regions, num_regions);
1565
0
  remove_short_regions(regions, num_regions, HIGH_VAR_REGION, HALF_WIN);
1566
0
  get_region_stats(stats, regions, *num_regions);
1567
1568
  // If a stable regions has higher error than neighboring high var regions,
1569
  // or if the stable region has a lower average correlation,
1570
  // then it should be merged with them
1571
0
  k = 0;
1572
0
  while (k < *num_regions && (*num_regions) > 1) {
1573
0
    if (regions[k].type == STABLE_REGION &&
1574
0
        (regions[k].last - regions[k].start + 1) < 2 * WINDOW_SIZE &&
1575
0
        ((k > 0 &&  // previous regions
1576
0
          (regions[k].avg_coded_err > regions[k - 1].avg_coded_err * 1.01 ||
1577
0
           regions[k].avg_cor_coeff < regions[k - 1].avg_cor_coeff * 0.999)) &&
1578
0
         (k < *num_regions - 1 &&  // next region
1579
0
          (regions[k].avg_coded_err > regions[k + 1].avg_coded_err * 1.01 ||
1580
0
           regions[k].avg_cor_coeff < regions[k + 1].avg_cor_coeff * 0.999)))) {
1581
      // merge current region with the previous and next regions
1582
0
      remove_region(2, regions, num_regions, &k);
1583
0
      analyze_region(stats, k - 1, regions);
1584
0
    } else if (regions[k].type == HIGH_VAR_REGION &&
1585
0
               (regions[k].last - regions[k].start + 1) < 2 * WINDOW_SIZE &&
1586
0
               ((k > 0 &&  // previous regions
1587
0
                 (regions[k].avg_coded_err <
1588
0
                      regions[k - 1].avg_coded_err * 0.99 ||
1589
0
                  regions[k].avg_cor_coeff >
1590
0
                      regions[k - 1].avg_cor_coeff * 1.001)) &&
1591
0
                (k < *num_regions - 1 &&  // next region
1592
0
                 (regions[k].avg_coded_err <
1593
0
                      regions[k + 1].avg_coded_err * 0.99 ||
1594
0
                  regions[k].avg_cor_coeff >
1595
0
                      regions[k + 1].avg_cor_coeff * 1.001)))) {
1596
      // merge current region with the previous and next regions
1597
0
      remove_region(2, regions, num_regions, &k);
1598
0
      analyze_region(stats, k - 1, regions);
1599
0
    } else {
1600
0
      k++;
1601
0
    }
1602
0
  }
1603
1604
0
  remove_short_regions(regions, num_regions, STABLE_REGION, WINDOW_SIZE);
1605
0
  remove_short_regions(regions, num_regions, HIGH_VAR_REGION, HALF_WIN);
1606
0
}
1607
1608
// Identify blending regions.
1609
static void find_blending_regions(const FIRSTPASS_STATS *stats,
1610
0
                                  REGIONS *regions, int *num_regions) {
1611
0
  int i, k = 0;
1612
  // Blending regions will have large content change, therefore will have a
1613
  // large consistent change in intra error.
1614
0
  int count_stable = 0;
1615
0
  while (k < *num_regions) {
1616
0
    if (regions[k].type == STABLE_REGION) {
1617
0
      k++;
1618
0
      count_stable++;
1619
0
      continue;
1620
0
    }
1621
0
    int dir = 0;
1622
0
    int start = 0, last;
1623
0
    for (i = regions[k].start; i <= regions[k].last; i++) {
1624
      // First mark the regions that has consistent large change of intra error.
1625
0
      if (k == 0 && i == regions[k].start) continue;
1626
0
      if (stats[i].is_flash || (i > 0 && stats[i - 1].is_flash)) continue;
1627
0
      double grad = stats[i].intra_error - stats[i - 1].intra_error;
1628
0
      int large_change = fabs(grad) / AOMMAX(stats[i].intra_error, 0.01) > 0.05;
1629
0
      int this_dir = 0;
1630
0
      if (large_change) {
1631
0
        this_dir = (grad > 0) ? 1 : -1;
1632
0
      }
1633
      // the current trend continues
1634
0
      if (dir == this_dir) continue;
1635
0
      if (dir != 0) {
1636
        // Mark the end of a new large change group and add it
1637
0
        last = i - 1;
1638
0
        insert_region(start, last, BLENDING_REGION, regions, num_regions, &k);
1639
0
      }
1640
0
      dir = this_dir;
1641
0
      if (k == 0 && i == regions[k].start + 1) {
1642
0
        start = i - 1;
1643
0
      } else {
1644
0
        start = i;
1645
0
      }
1646
0
    }
1647
0
    if (dir != 0) {
1648
0
      last = regions[k].last;
1649
0
      insert_region(start, last, BLENDING_REGION, regions, num_regions, &k);
1650
0
    }
1651
0
    k++;
1652
0
  }
1653
1654
  // If the blending region has very low correlation, mark it as high variance
1655
  // since we probably cannot benefit from it anyways.
1656
0
  get_region_stats(stats, regions, *num_regions);
1657
0
  for (k = 0; k < *num_regions; k++) {
1658
0
    if (regions[k].type != BLENDING_REGION) continue;
1659
0
    if (regions[k].last == regions[k].start || regions[k].avg_cor_coeff < 0.6 ||
1660
0
        count_stable == 0)
1661
0
      regions[k].type = HIGH_VAR_REGION;
1662
0
  }
1663
0
  get_region_stats(stats, regions, *num_regions);
1664
1665
  // It is possible for blending to result in a "dip" in intra error (first
1666
  // decrease then increase). Therefore we need to find the dip and combine the
1667
  // two regions.
1668
0
  k = 1;
1669
0
  while (k < *num_regions) {
1670
0
    if (k < *num_regions - 1 && regions[k].type == HIGH_VAR_REGION) {
1671
      // Check if this short high variance regions is actually in the middle of
1672
      // a blending region.
1673
0
      if (regions[k - 1].type == BLENDING_REGION &&
1674
0
          regions[k + 1].type == BLENDING_REGION &&
1675
0
          regions[k].last - regions[k].start < 3) {
1676
0
        int prev_dir = (stats[regions[k - 1].last].intra_error -
1677
0
                        stats[regions[k - 1].last - 1].intra_error) > 0
1678
0
                           ? 1
1679
0
                           : -1;
1680
0
        int next_dir = (stats[regions[k + 1].last].intra_error -
1681
0
                        stats[regions[k + 1].last - 1].intra_error) > 0
1682
0
                           ? 1
1683
0
                           : -1;
1684
0
        if (prev_dir < 0 && next_dir > 0) {
1685
          // This is possibly a mid region of blending. Check the ratios
1686
0
          double ratio_thres = AOMMIN(regions[k - 1].avg_sr_fr_ratio,
1687
0
                                      regions[k + 1].avg_sr_fr_ratio) *
1688
0
                               0.95;
1689
0
          if (regions[k].avg_sr_fr_ratio > ratio_thres) {
1690
0
            regions[k].type = BLENDING_REGION;
1691
0
            remove_region(2, regions, num_regions, &k);
1692
0
            analyze_region(stats, k - 1, regions);
1693
0
            continue;
1694
0
          }
1695
0
        }
1696
0
      }
1697
0
    }
1698
    // Check if we have a pair of consecutive blending regions.
1699
0
    if (regions[k - 1].type == BLENDING_REGION &&
1700
0
        regions[k].type == BLENDING_REGION) {
1701
0
      int prev_dir = (stats[regions[k - 1].last].intra_error -
1702
0
                      stats[regions[k - 1].last - 1].intra_error) > 0
1703
0
                         ? 1
1704
0
                         : -1;
1705
0
      int next_dir = (stats[regions[k].last].intra_error -
1706
0
                      stats[regions[k].last - 1].intra_error) > 0
1707
0
                         ? 1
1708
0
                         : -1;
1709
1710
      // if both are too short, no need to check
1711
0
      int total_length = regions[k].last - regions[k - 1].start + 1;
1712
0
      if (total_length < 4) {
1713
0
        regions[k - 1].type = HIGH_VAR_REGION;
1714
0
        k++;
1715
0
        continue;
1716
0
      }
1717
1718
0
      int to_merge = 0;
1719
0
      if (prev_dir < 0 && next_dir > 0) {
1720
        // In this case we check the last frame in the previous region.
1721
0
        double prev_length =
1722
0
            (double)(regions[k - 1].last - regions[k - 1].start + 1);
1723
0
        double last_ratio, ratio_thres;
1724
0
        if (prev_length < 2.01) {
1725
          // if the previous region is very short
1726
0
          double max_coded_error =
1727
0
              AOMMAX(stats[regions[k - 1].last].coded_error,
1728
0
                     stats[regions[k - 1].last - 1].coded_error);
1729
0
          last_ratio = stats[regions[k - 1].last].sr_coded_error /
1730
0
                       AOMMAX(max_coded_error, 0.001);
1731
0
          ratio_thres = regions[k].avg_sr_fr_ratio * 0.95;
1732
0
        } else {
1733
0
          double max_coded_error =
1734
0
              AOMMAX(stats[regions[k - 1].last].coded_error,
1735
0
                     stats[regions[k - 1].last - 1].coded_error);
1736
0
          last_ratio = stats[regions[k - 1].last].sr_coded_error /
1737
0
                       AOMMAX(max_coded_error, 0.001);
1738
0
          double prev_ratio =
1739
0
              (regions[k - 1].avg_sr_fr_ratio * prev_length - last_ratio) /
1740
0
              (prev_length - 1.0);
1741
0
          ratio_thres = AOMMIN(prev_ratio, regions[k].avg_sr_fr_ratio) * 0.95;
1742
0
        }
1743
0
        if (last_ratio > ratio_thres) {
1744
0
          to_merge = 1;
1745
0
        }
1746
0
      }
1747
1748
0
      if (to_merge) {
1749
0
        remove_region(0, regions, num_regions, &k);
1750
0
        analyze_region(stats, k - 1, regions);
1751
0
        continue;
1752
0
      } else {
1753
        // These are possibly two separate blending regions. Mark the boundary
1754
        // frame as HIGH_VAR_REGION to separate the two.
1755
0
        int prev_k = k - 1;
1756
0
        insert_region(regions[prev_k].last, regions[prev_k].last,
1757
0
                      HIGH_VAR_REGION, regions, num_regions, &prev_k);
1758
0
        analyze_region(stats, prev_k, regions);
1759
0
        k = prev_k + 1;
1760
0
        analyze_region(stats, k, regions);
1761
0
      }
1762
0
    }
1763
0
    k++;
1764
0
  }
1765
0
  cleanup_regions(regions, num_regions);
1766
0
}
1767
1768
// Clean up decision for blendings. Remove blending regions that are too short.
1769
// Also if a very short high var region is between a blending and a stable
1770
// region, just merge it with one of them.
1771
0
static void cleanup_blendings(REGIONS *regions, int *num_regions) {
1772
0
  int k = 0;
1773
0
  while (k < (*num_regions) && (*num_regions) > 1) {
1774
0
    int is_short_blending = regions[k].type == BLENDING_REGION &&
1775
0
                            regions[k].last - regions[k].start + 1 < 5;
1776
0
    int is_short_hv = regions[k].type == HIGH_VAR_REGION &&
1777
0
                      regions[k].last - regions[k].start + 1 < 5;
1778
0
    int has_stable_neighbor =
1779
0
        ((k > 0 && regions[k - 1].type == STABLE_REGION) ||
1780
0
         (k < *num_regions - 1 && regions[k + 1].type == STABLE_REGION));
1781
0
    int has_blend_neighbor =
1782
0
        ((k > 0 && regions[k - 1].type == BLENDING_REGION) ||
1783
0
         (k < *num_regions - 1 && regions[k + 1].type == BLENDING_REGION));
1784
0
    int total_neighbors = (k > 0) + (k < *num_regions - 1);
1785
1786
0
    if (is_short_blending ||
1787
0
        (is_short_hv &&
1788
0
         has_stable_neighbor + has_blend_neighbor >= total_neighbors)) {
1789
      // Remove this region.Try to determine whether to combine it with the
1790
      // previous or next region.
1791
0
      int merge;
1792
0
      double prev_diff =
1793
0
          (k > 0)
1794
0
              ? fabs(regions[k].avg_cor_coeff - regions[k - 1].avg_cor_coeff)
1795
0
              : 1;
1796
0
      double next_diff =
1797
0
          (k < *num_regions - 1)
1798
0
              ? fabs(regions[k].avg_cor_coeff - regions[k + 1].avg_cor_coeff)
1799
0
              : 1;
1800
      // merge == 0 means to merge with previous, 1 means to merge with next
1801
0
      merge = prev_diff > next_diff;
1802
0
      remove_region(merge, regions, num_regions, &k);
1803
0
    } else {
1804
0
      k++;
1805
0
    }
1806
0
  }
1807
0
  cleanup_regions(regions, num_regions);
1808
0
}
1809
1810
static void free_firstpass_stats_buffers(REGIONS *temp_regions,
1811
                                         double *filt_intra_err,
1812
                                         double *filt_coded_err,
1813
0
                                         double *grad_coded) {
1814
0
  aom_free(temp_regions);
1815
0
  aom_free(filt_intra_err);
1816
0
  aom_free(filt_coded_err);
1817
0
  aom_free(grad_coded);
1818
0
}
1819
1820
// Identify stable and unstable regions from first pass stats.
1821
// stats_start points to the first frame to analyze.
1822
// |offset| is the offset from the current frame to the frame stats_start is
1823
// pointing to.
1824
// Returns 0 on success, -1 on memory allocation failure.
1825
static int identify_regions(const FIRSTPASS_STATS *const stats_start,
1826
                            int total_frames, int offset, REGIONS *regions,
1827
0
                            int *total_regions) {
1828
0
  int k;
1829
0
  if (total_frames <= 1) return 0;
1830
1831
  // store the initial decisions
1832
0
  REGIONS *temp_regions =
1833
0
      (REGIONS *)aom_malloc(total_frames * sizeof(temp_regions[0]));
1834
  // buffers for filtered stats
1835
0
  double *filt_intra_err =
1836
0
      (double *)aom_calloc(total_frames, sizeof(*filt_intra_err));
1837
0
  double *filt_coded_err =
1838
0
      (double *)aom_calloc(total_frames, sizeof(*filt_coded_err));
1839
0
  double *grad_coded = (double *)aom_calloc(total_frames, sizeof(*grad_coded));
1840
0
  if (!(temp_regions && filt_intra_err && filt_coded_err && grad_coded)) {
1841
0
    free_firstpass_stats_buffers(temp_regions, filt_intra_err, filt_coded_err,
1842
0
                                 grad_coded);
1843
0
    return -1;
1844
0
  }
1845
0
  av1_zero_array(temp_regions, total_frames);
1846
1847
0
  int cur_region = 0, this_start = 0, this_last;
1848
1849
0
  int next_scenecut = -1;
1850
0
  do {
1851
    // first get the obvious scenecuts
1852
0
    next_scenecut =
1853
0
        find_next_scenecut(stats_start, this_start, total_frames - 1);
1854
0
    this_last = (next_scenecut >= 0) ? (next_scenecut - 1) : total_frames - 1;
1855
1856
    // low-pass filter the needed stats
1857
0
    smooth_filter_stats(stats_start, this_start, this_last, filt_intra_err,
1858
0
                        filt_coded_err);
1859
0
    get_gradient(filt_coded_err, this_start, this_last, grad_coded);
1860
1861
    // find tentative stable regions and unstable regions
1862
0
    int num_regions = find_stable_regions(stats_start, grad_coded, this_start,
1863
0
                                          this_last, temp_regions);
1864
1865
0
    adjust_unstable_region_bounds(stats_start, temp_regions, &num_regions);
1866
1867
0
    get_region_stats(stats_start, temp_regions, num_regions);
1868
1869
    // Try to identify blending regions in the unstable regions
1870
0
    find_blending_regions(stats_start, temp_regions, &num_regions);
1871
0
    cleanup_blendings(temp_regions, &num_regions);
1872
1873
    // The flash points should all be considered high variance points
1874
0
    k = 0;
1875
0
    while (k < num_regions) {
1876
0
      if (temp_regions[k].type != STABLE_REGION) {
1877
0
        k++;
1878
0
        continue;
1879
0
      }
1880
0
      int start = temp_regions[k].start;
1881
0
      int last = temp_regions[k].last;
1882
0
      for (int i = start; i <= last; i++) {
1883
0
        if (stats_start[i].is_flash) {
1884
0
          insert_region(i, i, HIGH_VAR_REGION, temp_regions, &num_regions, &k);
1885
0
        }
1886
0
      }
1887
0
      k++;
1888
0
    }
1889
0
    cleanup_regions(temp_regions, &num_regions);
1890
1891
    // copy the regions in the scenecut group
1892
0
    for (k = 0; k < num_regions; k++) {
1893
0
      if (temp_regions[k].last < temp_regions[k].start &&
1894
0
          k == num_regions - 1) {
1895
0
        num_regions--;
1896
0
        break;
1897
0
      }
1898
0
      regions[k + cur_region] = temp_regions[k];
1899
0
    }
1900
0
    cur_region += num_regions;
1901
1902
    // add the scenecut region
1903
0
    if (next_scenecut > -1) {
1904
      // add the scenecut region, and find the next scenecut
1905
0
      regions[cur_region].type = SCENECUT_REGION;
1906
0
      regions[cur_region].start = next_scenecut;
1907
0
      regions[cur_region].last = next_scenecut;
1908
0
      cur_region++;
1909
0
      this_start = next_scenecut + 1;
1910
0
    }
1911
0
  } while (next_scenecut >= 0);
1912
1913
0
  *total_regions = cur_region;
1914
0
  get_region_stats(stats_start, regions, *total_regions);
1915
1916
0
  for (k = 0; k < *total_regions; k++) {
1917
    // If scenecuts are very minor, mark them as high variance.
1918
0
    if (regions[k].type != SCENECUT_REGION ||
1919
0
        regions[k].avg_cor_coeff *
1920
0
                (1 - stats_start[regions[k].start].noise_var /
1921
0
                         regions[k].avg_intra_err) <
1922
0
            0.8) {
1923
0
      continue;
1924
0
    }
1925
0
    regions[k].type = HIGH_VAR_REGION;
1926
0
  }
1927
0
  cleanup_regions(regions, total_regions);
1928
0
  get_region_stats(stats_start, regions, *total_regions);
1929
1930
0
  for (k = 0; k < *total_regions; k++) {
1931
0
    regions[k].start += offset;
1932
0
    regions[k].last += offset;
1933
0
  }
1934
1935
0
  free_firstpass_stats_buffers(temp_regions, filt_intra_err, filt_coded_err,
1936
0
                               grad_coded);
1937
0
  return 0;
1938
0
}
1939
1940
static int find_regions_index(const REGIONS *regions, int num_regions,
1941
0
                              int frame_idx) {
1942
0
  for (int k = 0; k < num_regions; k++) {
1943
0
    if (regions[k].start <= frame_idx && regions[k].last >= frame_idx) {
1944
0
      return k;
1945
0
    }
1946
0
  }
1947
0
  return -1;
1948
0
}
1949
1950
/*!\brief Determine the length of future GF groups.
1951
 *
1952
 * \ingroup gf_group_algo
1953
 * This function decides the gf group length of future frames in batch
1954
 *
1955
 * \param[in]    cpi              Top-level encoder structure
1956
 * \param[in]    max_gop_length   Maximum length of the GF group
1957
 * \param[in]    max_intervals    Maximum number of intervals to decide
1958
 *
1959
 * \remark Nothing is returned. Instead, cpi->ppi->rc.gf_intervals is
1960
 * changed to store the decided GF group lengths.
1961
 */
1962
static void calculate_gf_length(AV1_COMP *cpi, int max_gop_length,
1963
0
                                int max_intervals) {
1964
0
  RATE_CONTROL *const rc = &cpi->rc;
1965
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
1966
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
1967
0
  FIRSTPASS_STATS next_frame;
1968
0
  const FIRSTPASS_STATS *const start_pos = cpi->twopass_frame.stats_in;
1969
0
  const FIRSTPASS_STATS *const stats = start_pos - (rc->frames_since_key == 0);
1970
1971
0
  const int f_w = cpi->common.width;
1972
0
  const int f_h = cpi->common.height;
1973
0
  int i;
1974
1975
0
  int flash_detected;
1976
1977
0
  av1_zero(next_frame);
1978
1979
0
  if (has_no_stats_stage(cpi)) {
1980
0
    for (i = 0; i < MAX_NUM_GF_INTERVALS; i++) {
1981
0
      p_rc->gf_intervals[i] = AOMMIN(rc->max_gf_interval, max_gop_length);
1982
0
    }
1983
0
    p_rc->cur_gf_index = 0;
1984
0
    rc->intervals_till_gf_calculate_due = MAX_NUM_GF_INTERVALS;
1985
0
    return;
1986
0
  }
1987
1988
  // TODO(urvang): Try logic to vary min and max interval based on q.
1989
0
  const int active_min_gf_interval = rc->min_gf_interval;
1990
0
  const int active_max_gf_interval =
1991
0
      AOMMIN(rc->max_gf_interval, max_gop_length);
1992
0
  const int min_shrink_int = AOMMAX(MIN_SHRINK_LEN, active_min_gf_interval);
1993
1994
0
  i = (rc->frames_since_key == 0);
1995
0
  max_intervals = cpi->ppi->lap_enabled ? 1 : max_intervals;
1996
0
  int count_cuts = 1;
1997
  // If cpi->gf_state.arf_gf_boost_lst is 0, we are starting with a KF or GF.
1998
0
  int cur_start = -1 + !cpi->ppi->gf_state.arf_gf_boost_lst, cur_last;
1999
0
  int cut_pos[MAX_NUM_GF_INTERVALS + 1] = { -1 };
2000
0
  int cut_here;
2001
0
  GF_GROUP_STATS gf_stats;
2002
0
  init_gf_stats(&gf_stats);
2003
0
  while (count_cuts < max_intervals + 1) {
2004
    // reaches next key frame, break here
2005
0
    if (i >= rc->frames_to_key) {
2006
0
      cut_here = 2;
2007
0
    } else if (i - cur_start >= rc->static_scene_max_gf_interval) {
2008
      // reached maximum len, but nothing special yet (almost static)
2009
      // let's look at the next interval
2010
0
      cut_here = 1;
2011
0
    } else if (EOF == input_stats(twopass, &cpi->twopass_frame, &next_frame)) {
2012
      // reaches last frame, break
2013
0
      cut_here = 2;
2014
0
    } else {
2015
      // Test for the case where there is a brief flash but the prediction
2016
      // quality back to an earlier frame is then restored.
2017
0
      flash_detected = detect_flash(twopass, &cpi->twopass_frame, 0);
2018
      // TODO(bohanli): remove redundant accumulations here, or unify
2019
      // this and the ones in define_gf_group
2020
0
      accumulate_next_frame_stats(&next_frame, flash_detected,
2021
0
                                  rc->frames_since_key, i, &gf_stats, f_w, f_h);
2022
2023
0
      cut_here = detect_gf_cut(cpi, i, cur_start, flash_detected,
2024
0
                               active_max_gf_interval, active_min_gf_interval,
2025
0
                               &gf_stats);
2026
0
    }
2027
0
    if (cut_here) {
2028
0
      cur_last = i - 1;  // the current last frame in the gf group
2029
0
      int ori_last = cur_last;
2030
      // The region frame idx does not start from the same frame as cur_start
2031
      // and cur_last. Need to offset them.
2032
0
      int offset = rc->frames_since_key - p_rc->regions_offset;
2033
0
      REGIONS *regions = p_rc->regions;
2034
0
      int num_regions = p_rc->num_regions;
2035
2036
0
      int scenecut_idx = -1;
2037
      // only try shrinking if interval smaller than active_max_gf_interval
2038
0
      if (cur_last - cur_start <= active_max_gf_interval &&
2039
0
          cur_last > cur_start) {
2040
        // find the region indices of where the first and last frame belong.
2041
0
        int k_start =
2042
0
            find_regions_index(regions, num_regions, cur_start + offset);
2043
0
        int k_last =
2044
0
            find_regions_index(regions, num_regions, cur_last + offset);
2045
0
        if (cur_start + offset == 0) k_start = 0;
2046
2047
        // See if we have a scenecut in between
2048
0
        for (int r = k_start + 1; r <= k_last; r++) {
2049
0
          if (regions[r].type == SCENECUT_REGION &&
2050
0
              regions[r].last - offset - cur_start > active_min_gf_interval) {
2051
0
            scenecut_idx = r;
2052
0
            break;
2053
0
          }
2054
0
        }
2055
2056
        // if the found scenecut is very close to the end, ignore it.
2057
0
        if (regions[num_regions - 1].last - regions[scenecut_idx].last < 4) {
2058
0
          scenecut_idx = -1;
2059
0
        }
2060
2061
0
        if (scenecut_idx != -1) {
2062
          // If we have a scenecut, then stop at it.
2063
          // TODO(bohanli): add logic here to stop before the scenecut and for
2064
          // the next gop start from the scenecut with GF
2065
0
          int is_minor_sc =
2066
0
              (regions[scenecut_idx].avg_cor_coeff *
2067
0
                   (1 - stats[regions[scenecut_idx].start - offset].noise_var /
2068
0
                            regions[scenecut_idx].avg_intra_err) >
2069
0
               0.6);
2070
0
          cur_last = regions[scenecut_idx].last - offset - !is_minor_sc;
2071
0
        } else {
2072
0
          int is_last_analysed = (k_last == num_regions - 1) &&
2073
0
                                 (cur_last + offset == regions[k_last].last);
2074
0
          int not_enough_regions =
2075
0
              k_last - k_start <=
2076
0
              1 + (regions[k_start].type == SCENECUT_REGION);
2077
          // if we are very close to the end, then do not shrink since it may
2078
          // introduce intervals that are too short
2079
0
          if (!(is_last_analysed && not_enough_regions)) {
2080
0
            const double arf_length_factor = 0.1;
2081
0
            double best_score = 0;
2082
0
            int best_j = -1;
2083
0
            const int first_frame = regions[0].start - offset;
2084
0
            const int last_frame = regions[num_regions - 1].last - offset;
2085
            // score of how much the arf helps the whole GOP
2086
0
            double base_score = 0.0;
2087
0
            int count_base = 0;
2088
0
            bool static_frames = false;
2089
2090
            // Accumulate base_score in
2091
0
            for (int j = cur_start + 1; j < cur_start + min_shrink_int; j++) {
2092
0
              if (stats + j >= twopass->stats_buf_ctx->stats_in_end) break;
2093
0
              base_score = (base_score + 1.0) * stats[j].cor_coeff;
2094
0
              count_base++;
2095
0
            }
2096
2097
0
            if (count_base && base_score / count_base > 0.992) {
2098
0
              static_frames = true;
2099
0
            }
2100
2101
0
            int met_blending = 0;   // Whether we have met blending areas before
2102
0
            int last_blending = 0;  // Whether the previous frame if blending
2103
0
            for (int j = cur_start + min_shrink_int; j <= cur_last; j++) {
2104
0
              if (stats + j >= twopass->stats_buf_ctx->stats_in_end) break;
2105
0
              base_score = (base_score + 1.0) * stats[j].cor_coeff;
2106
0
              int this_reg =
2107
0
                  find_regions_index(regions, num_regions, j + offset);
2108
0
              if (this_reg < 0) continue;
2109
              // A GOP should include at most 1 blending region.
2110
0
              if (regions[this_reg].type == BLENDING_REGION) {
2111
0
                last_blending = 1;
2112
0
                if (met_blending) {
2113
0
                  break;
2114
0
                } else {
2115
0
                  base_score = 0;
2116
0
                  continue;
2117
0
                }
2118
0
              } else {
2119
0
                if (last_blending) met_blending = 1;
2120
0
                last_blending = 0;
2121
0
              }
2122
2123
              // Add the factor of how good the neighborhood is for this
2124
              // candidate arf.
2125
0
              double this_score = arf_length_factor * base_score;
2126
0
              double temp_accu_coeff = 1.0;
2127
              // following frames
2128
0
              int count_f = 0;
2129
0
              for (int n = j + 1; n <= j + 3 && n <= last_frame; n++) {
2130
0
                if (stats + n >= twopass->stats_buf_ctx->stats_in_end) break;
2131
0
                temp_accu_coeff *= stats[n].cor_coeff;
2132
0
                this_score +=
2133
0
                    temp_accu_coeff *
2134
0
                    sqrt(AOMMAX(0.5,
2135
0
                                1 - stats[n].noise_var /
2136
0
                                        AOMMAX(stats[n].intra_error, 0.001)));
2137
0
                count_f++;
2138
0
              }
2139
              // preceding frames
2140
0
              temp_accu_coeff = 1.0;
2141
0
              for (int n = j; n > j - 3 * 2 + count_f && n > first_frame; n--) {
2142
0
                if (stats + n < twopass->stats_buf_ctx->stats_in_start) break;
2143
0
                temp_accu_coeff *= stats[n].cor_coeff;
2144
0
                this_score +=
2145
0
                    temp_accu_coeff *
2146
0
                    sqrt(AOMMAX(0.5,
2147
0
                                1 - stats[n].noise_var /
2148
0
                                        AOMMAX(stats[n].intra_error, 0.001)));
2149
0
              }
2150
2151
              // Slightly relax the condition for videos starting with frozen
2152
              // frames.
2153
0
              if (this_score + (static_frames ? 0.5 : 0) > best_score) {
2154
0
                best_score = this_score;
2155
0
                best_j = j;
2156
0
              }
2157
0
            }
2158
2159
            // For blending areas, move one more frame in case we missed the
2160
            // first blending frame.
2161
0
            int best_reg =
2162
0
                find_regions_index(regions, num_regions, best_j + offset);
2163
0
            if (best_reg < num_regions - 1 && best_reg > 0) {
2164
0
              if (regions[best_reg - 1].type == BLENDING_REGION &&
2165
0
                  regions[best_reg + 1].type == BLENDING_REGION) {
2166
0
                if (best_j + offset == regions[best_reg].start &&
2167
0
                    best_j + offset < regions[best_reg].last) {
2168
0
                  best_j += 1;
2169
0
                } else if (best_j + offset == regions[best_reg].last &&
2170
0
                           best_j + offset > regions[best_reg].start) {
2171
0
                  best_j -= 1;
2172
0
                }
2173
0
              }
2174
0
            }
2175
2176
0
            if (cur_last - best_j < 2) best_j = cur_last;
2177
0
            if (best_j > 0 && best_score > 0.1) cur_last = best_j;
2178
            // if cannot find anything, just cut at the original place.
2179
0
          }
2180
0
        }
2181
0
      }
2182
0
      cut_pos[count_cuts] = cur_last;
2183
0
      count_cuts++;
2184
2185
      // reset pointers to the shrunken location
2186
0
      cpi->twopass_frame.stats_in = start_pos + cur_last;
2187
0
      cur_start = cur_last;
2188
0
      int cur_region_idx =
2189
0
          find_regions_index(regions, num_regions, cur_start + 1 + offset);
2190
0
      if (cur_region_idx >= 0)
2191
0
        if (regions[cur_region_idx].type == SCENECUT_REGION) cur_start++;
2192
2193
0
      i = cur_last;
2194
2195
0
      if (cut_here > 1 && cur_last == ori_last) break;
2196
2197
      // reset accumulators
2198
0
      init_gf_stats(&gf_stats);
2199
0
    }
2200
0
    ++i;
2201
0
  }
2202
2203
  // save intervals
2204
0
  rc->intervals_till_gf_calculate_due = count_cuts - 1;
2205
0
  for (int n = 1; n < count_cuts; n++) {
2206
0
    p_rc->gf_intervals[n - 1] = cut_pos[n] - cut_pos[n - 1];
2207
0
  }
2208
0
  p_rc->cur_gf_index = 0;
2209
0
  cpi->twopass_frame.stats_in = start_pos;
2210
0
}
2211
2212
0
static void correct_frames_to_key(AV1_COMP *cpi) {
2213
0
  int lookahead_size =
2214
0
      av1_lookahead_depth(cpi->ppi->lookahead, cpi->compressor_stage);
2215
0
  if (lookahead_size <
2216
0
      av1_lookahead_pop_sz(cpi->ppi->lookahead, cpi->compressor_stage)) {
2217
0
    assert(
2218
0
        IMPLIES(cpi->oxcf.pass != AOM_RC_ONE_PASS && cpi->ppi->frames_left > 0,
2219
0
                lookahead_size == cpi->ppi->frames_left));
2220
0
    cpi->rc.frames_to_key = AOMMIN(cpi->rc.frames_to_key, lookahead_size);
2221
0
  } else if (cpi->ppi->frames_left > 0) {
2222
    // Correct frames to key based on limit
2223
0
    cpi->rc.frames_to_key =
2224
0
        AOMMIN(cpi->rc.frames_to_key, cpi->ppi->frames_left);
2225
0
  }
2226
0
}
2227
2228
/*!\brief Define a GF group in one pass mode when no look ahead stats are
2229
 * available.
2230
 *
2231
 * \ingroup gf_group_algo
2232
 * This function defines the structure of a GF group, along with various
2233
 * parameters regarding bit-allocation and quality setup in the special
2234
 * case of one pass encoding where no lookahead stats are avialable.
2235
 *
2236
 * \param[in]    cpi             Top-level encoder structure
2237
 * \param[in]    is_final_pass   Whether it is the second call to
2238
 *                               define_gf_group().
2239
 *
2240
 * \remark Nothing is returned. Instead, cpi->ppi->gf_group is changed.
2241
 */
2242
0
static void define_gf_group_pass0(AV1_COMP *cpi, const int is_final_pass) {
2243
0
  RATE_CONTROL *const rc = &cpi->rc;
2244
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
2245
0
  GF_GROUP *const gf_group = &cpi->ppi->gf_group;
2246
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
2247
0
  const GFConfig *const gf_cfg = &oxcf->gf_cfg;
2248
0
  int target;
2249
2250
0
  p_rc->baseline_gf_interval = p_rc->gf_intervals[p_rc->cur_gf_index];
2251
0
  rc->intervals_till_gf_calculate_due--;
2252
0
  p_rc->cur_gf_index++;
2253
2254
  // correct frames_to_key when lookahead queue is flushing
2255
0
  correct_frames_to_key(cpi);
2256
2257
0
  if (p_rc->baseline_gf_interval > rc->frames_to_key)
2258
0
    p_rc->baseline_gf_interval = rc->frames_to_key;
2259
2260
0
  p_rc->gfu_boost = DEFAULT_GF_BOOST;
2261
0
  p_rc->constrained_gf_group =
2262
0
      (p_rc->baseline_gf_interval >= rc->frames_to_key) ? 1 : 0;
2263
2264
  // Default for pyr_height if inputs not set.
2265
0
  if (oxcf->gf_cfg.gf_max_pyr_height == 0 ||
2266
0
      oxcf->gf_cfg.gf_min_pyr_height == 0) {
2267
0
    gf_group->max_layer_depth_allowed = 1;
2268
0
  } else {
2269
0
    gf_group->max_layer_depth_allowed = oxcf->gf_cfg.gf_max_pyr_height;
2270
0
  }
2271
2272
  // Rare case when the look-ahead is less than the target GOP length, can't
2273
  // generate ARF frame.
2274
  // Also disable ARF frame if the motion content (source_sad) is high in
2275
  // lookahead buffer.
2276
0
  const uint64_t thresh_sad = 8 * 64 * 64;
2277
0
  if (p_rc->baseline_gf_interval > gf_cfg->lag_in_frames ||
2278
0
      !is_altref_enabled(gf_cfg->lag_in_frames, gf_cfg->enable_auto_arf) ||
2279
0
      p_rc->baseline_gf_interval < rc->min_gf_interval ||
2280
0
      rc->frame_source_sad_lag[0] > thresh_sad) {
2281
0
    gf_group->max_layer_depth_allowed = 0;
2282
0
  }
2283
2284
  // Set up the structure of this Group-Of-Pictures (same as GF_GROUP)
2285
0
  av1_gop_setup_structure(cpi, is_final_pass);
2286
2287
  // Allocate bits to each of the frames in the GF group.
2288
  // TODO(sarahparker) Extend this to work with pyramid structure.
2289
0
  for (int cur_index = 0; cur_index < gf_group->size; ++cur_index) {
2290
0
    const FRAME_UPDATE_TYPE cur_update_type = gf_group->update_type[cur_index];
2291
0
    if (oxcf->rc_cfg.mode == AOM_CBR) {
2292
0
      if (cur_update_type == KF_UPDATE) {
2293
0
        target = av1_calc_iframe_target_size_one_pass_cbr(cpi);
2294
0
      } else {
2295
0
        target = av1_calc_pframe_target_size_one_pass_cbr(cpi, cur_update_type);
2296
0
      }
2297
0
    } else {
2298
0
      if (cur_update_type == KF_UPDATE) {
2299
0
        target = av1_calc_iframe_target_size_one_pass_vbr(cpi);
2300
0
      } else {
2301
0
        target = av1_calc_pframe_target_size_one_pass_vbr(cpi, cur_update_type);
2302
0
      }
2303
0
    }
2304
0
    gf_group->bit_allocation[cur_index] = target;
2305
0
  }
2306
0
}
2307
2308
static inline void set_baseline_gf_interval(PRIMARY_RATE_CONTROL *p_rc,
2309
0
                                            int arf_position) {
2310
0
  p_rc->baseline_gf_interval = arf_position;
2311
0
}
2312
2313
// initialize GF_GROUP_STATS
2314
0
static void init_gf_stats(GF_GROUP_STATS *gf_stats) {
2315
0
  gf_stats->gf_group_err = 0.0;
2316
0
  gf_stats->gf_group_raw_error = 0.0;
2317
0
  gf_stats->gf_group_skip_pct = 0.0;
2318
0
  gf_stats->gf_group_inactive_zone_rows = 0.0;
2319
2320
0
  gf_stats->mv_ratio_accumulator = 0.0;
2321
0
  gf_stats->decay_accumulator = 1.0;
2322
0
  gf_stats->zero_motion_accumulator = 1.0;
2323
0
  gf_stats->loop_decay_rate = 1.0;
2324
0
  gf_stats->last_loop_decay_rate = 1.0;
2325
0
  gf_stats->this_frame_mv_in_out = 0.0;
2326
0
  gf_stats->mv_in_out_accumulator = 0.0;
2327
0
  gf_stats->abs_mv_in_out_accumulator = 0.0;
2328
2329
0
  gf_stats->avg_sr_coded_error = 0.0;
2330
0
  gf_stats->avg_pcnt_second_ref = 0.0;
2331
0
  gf_stats->avg_new_mv_count = 0.0;
2332
0
  gf_stats->avg_wavelet_energy = 0.0;
2333
0
  gf_stats->avg_raw_err_stdev = 0.0;
2334
0
  gf_stats->non_zero_stdev_count = 0;
2335
0
}
2336
2337
static void accumulate_gop_stats(AV1_COMP *cpi, int is_intra_only, int f_w,
2338
                                 int f_h, FIRSTPASS_STATS *next_frame,
2339
                                 const FIRSTPASS_STATS *start_pos,
2340
0
                                 GF_GROUP_STATS *gf_stats, int *idx) {
2341
0
  int i, flash_detected;
2342
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
2343
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
2344
0
  RATE_CONTROL *const rc = &cpi->rc;
2345
0
  FRAME_INFO *frame_info = &cpi->frame_info;
2346
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
2347
2348
0
  init_gf_stats(gf_stats);
2349
0
  av1_zero(*next_frame);
2350
2351
  // If this is a key frame or the overlay from a previous arf then
2352
  // the error score / cost of this frame has already been accounted for.
2353
0
  i = is_intra_only;
2354
  // get the determined gf group length from p_rc->gf_intervals
2355
0
  while (i < p_rc->gf_intervals[p_rc->cur_gf_index]) {
2356
    // read in the next frame
2357
0
    if (EOF == input_stats(twopass, &cpi->twopass_frame, next_frame)) break;
2358
    // Accumulate error score of frames in this gf group.
2359
0
    double mod_frame_err =
2360
0
        calculate_modified_err(frame_info, twopass, oxcf, next_frame);
2361
    // accumulate stats for this frame
2362
0
    accumulate_this_frame_stats(next_frame, mod_frame_err, gf_stats);
2363
0
    ++i;
2364
0
  }
2365
2366
0
  reset_fpf_position(&cpi->twopass_frame, start_pos);
2367
2368
0
  i = is_intra_only;
2369
0
  input_stats(twopass, &cpi->twopass_frame, next_frame);
2370
0
  while (i < p_rc->gf_intervals[p_rc->cur_gf_index]) {
2371
    // read in the next frame
2372
0
    if (EOF == input_stats(twopass, &cpi->twopass_frame, next_frame)) break;
2373
2374
    // Test for the case where there is a brief flash but the prediction
2375
    // quality back to an earlier frame is then restored.
2376
0
    flash_detected = detect_flash(twopass, &cpi->twopass_frame, 0);
2377
2378
    // accumulate stats for next frame
2379
0
    accumulate_next_frame_stats(next_frame, flash_detected,
2380
0
                                rc->frames_since_key, i, gf_stats, f_w, f_h);
2381
2382
0
    ++i;
2383
0
  }
2384
2385
0
  i = p_rc->gf_intervals[p_rc->cur_gf_index];
2386
0
  average_gf_stats(i, gf_stats);
2387
2388
0
  *idx = i;
2389
0
}
2390
2391
static void update_gop_length(RATE_CONTROL *rc, PRIMARY_RATE_CONTROL *p_rc,
2392
0
                              int idx, int is_final_pass) {
2393
0
  if (is_final_pass) {
2394
0
    rc->intervals_till_gf_calculate_due--;
2395
0
    p_rc->cur_gf_index++;
2396
0
  }
2397
2398
  // Was the group length constrained by the requirement for a new KF?
2399
0
  p_rc->constrained_gf_group = (idx >= rc->frames_to_key) ? 1 : 0;
2400
2401
0
  set_baseline_gf_interval(p_rc, idx);
2402
0
  rc->frames_till_gf_update_due = p_rc->baseline_gf_interval;
2403
0
}
2404
2405
// #define FIXED_ARF_BITS
2406
#ifdef FIXED_ARF_BITS
2407
#define ARF_BITS_FRACTION 0.75
2408
#endif
2409
/*!\brief Distributes bits to frames in a group
2410
 *
2411
 *\ingroup rate_control
2412
 *
2413
 * This function decides on the allocation of bits between the different
2414
 * frames and types of frame in a GF/ARF group.
2415
 *
2416
 * \param[in]   cpi           Top - level encoder instance structure
2417
 * \param[in]   rc            Rate control data
2418
 * \param[in]   gf_group      GF/ARF group data structure
2419
 * \param[in]   is_key_frame  Indicates if the first frame in the group is
2420
 *                            also a key frame.
2421
 * \param[in]   use_arf       Are ARF frames enabled or is this a GF only
2422
 *                            uni-directional group.
2423
 * \param[in]   gf_group_bits Bits available to be allocated.
2424
 *
2425
 * \remark No return but updates the rate control and group data structures
2426
 *         to reflect the allocation of bits.
2427
 */
2428
void av1_gop_bit_allocation(const AV1_COMP *cpi, RATE_CONTROL *const rc,
2429
                            GF_GROUP *gf_group, int is_key_frame, int use_arf,
2430
0
                            int64_t gf_group_bits) {
2431
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
2432
  // Calculate the extra bits to be used for boosted frame(s)
2433
#ifdef FIXED_ARF_BITS
2434
  int gf_arf_bits = (int)(ARF_BITS_FRACTION * gf_group_bits);
2435
#else
2436
0
  int gf_arf_bits = calculate_boost_bits(
2437
0
      p_rc->baseline_gf_interval - (rc->frames_since_key == 0), p_rc->gfu_boost,
2438
0
      gf_group_bits);
2439
0
#endif
2440
2441
0
  gf_arf_bits = adjust_boost_bits_for_target_level(cpi, rc, gf_arf_bits,
2442
0
                                                   gf_group_bits, 1);
2443
2444
  // Allocate bits to each of the frames in the GF group.
2445
0
  allocate_gf_group_bits(gf_group, p_rc, rc, gf_group_bits, gf_arf_bits,
2446
0
                         is_key_frame, use_arf);
2447
0
}
2448
#undef ARF_BITS_FRACTION
2449
2450
#define MAX_GF_BOOST 5400
2451
0
#define REDUCE_GF_LENGTH_THRESH 4
2452
0
#define REDUCE_GF_LENGTH_TO_KEY_THRESH 9
2453
0
#define REDUCE_GF_LENGTH_BY 1
2454
static void set_gop_bits_boost(AV1_COMP *cpi, int i, int is_intra_only,
2455
                               int is_final_pass, int use_alt_ref,
2456
                               int alt_offset, const FIRSTPASS_STATS *start_pos,
2457
0
                               GF_GROUP_STATS *gf_stats) {
2458
  // Should we use the alternate reference frame.
2459
0
  AV1_COMMON *const cm = &cpi->common;
2460
0
  RATE_CONTROL *const rc = &cpi->rc;
2461
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
2462
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
2463
0
  GF_GROUP *gf_group = &cpi->ppi->gf_group;
2464
0
  FRAME_INFO *frame_info = &cpi->frame_info;
2465
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
2466
0
  const RateControlCfg *const rc_cfg = &oxcf->rc_cfg;
2467
2468
0
  if (cpi->oxcf.mode != REALTIME) {
2469
0
    TWO_PASS_FRAME stats_in_backup = cpi->twopass_frame;
2470
0
    int gfu_boost_sum = 0;
2471
0
    int gfu_count = 0;
2472
0
    int accumulate_i = 0;
2473
0
    if (rc->frames_since_key == 0) {
2474
0
      for (int k = 0; k < MAX_NUM_GF_INTERVALS; k++) {
2475
0
        if (p_rc->gf_intervals[k] == 0) {
2476
0
          break;
2477
0
        }
2478
2479
0
        int new_i = p_rc->gf_intervals[k];
2480
0
        int ext_len_new = new_i - (k == 0 ? is_intra_only : 0);
2481
0
        if (use_alt_ref) {
2482
0
          if (accumulate_i >= rc->frames_to_key) {
2483
0
            break;
2484
0
          }
2485
0
          const int forward_frames =
2486
0
              (rc->frames_to_key - accumulate_i - new_i >= ext_len_new)
2487
0
                  ? ext_len_new
2488
0
                  : AOMMAX(0, rc->frames_to_key - accumulate_i - new_i);
2489
0
          if (k) {
2490
0
            cpi->twopass_frame.stats_in += new_i;
2491
0
            if (cpi->twopass_frame.stats_in >=
2492
0
                twopass->stats_buf_ctx->stats_in_end) {
2493
0
              cpi->twopass_frame.stats_in =
2494
0
                  twopass->stats_buf_ctx->stats_in_end;
2495
0
            }
2496
0
          }
2497
0
          reset_fpf_position(&cpi->twopass_frame, cpi->twopass_frame.stats_in);
2498
          // Calculate the boost for alt ref. Note that we pass the
2499
          // scale_max_boost=false to derive gfu_boost_average, which can help
2500
          // the coding efficiency for some clips with global motion.
2501
0
          int gfu_boost_tmp = av1_calc_arf_boost(
2502
0
              twopass, &cpi->twopass_frame, p_rc, frame_info, alt_offset,
2503
0
              forward_frames, ext_len_new, &p_rc->num_stats_used_for_gfu_boost,
2504
0
              &p_rc->num_stats_required_for_gfu_boost, cpi->ppi->lap_enabled,
2505
0
              /*scale_max_boost=*/false);
2506
0
          gfu_boost_sum += gfu_boost_tmp;
2507
0
        }
2508
0
        gfu_count++;
2509
0
        accumulate_i += new_i;
2510
0
      }
2511
0
      assert(gfu_count > 0);
2512
0
      p_rc->gfu_boost_average = gfu_boost_sum / gfu_count;
2513
0
    }
2514
0
    cpi->twopass_frame = stats_in_backup;
2515
0
  }
2516
2517
0
  int ext_len = i - is_intra_only;
2518
0
  const bool scale_max_boost = (cpi->oxcf.mode != REALTIME);
2519
2520
0
  if (use_alt_ref) {
2521
0
    const int forward_frames = (rc->frames_to_key - i >= ext_len)
2522
0
                                   ? ext_len
2523
0
                                   : AOMMAX(0, rc->frames_to_key - i);
2524
2525
    // Calculate the boost for alt ref.
2526
0
    p_rc->gfu_boost = av1_calc_arf_boost(
2527
0
        twopass, &cpi->twopass_frame, p_rc, frame_info, alt_offset,
2528
0
        forward_frames, ext_len, &p_rc->num_stats_used_for_gfu_boost,
2529
0
        &p_rc->num_stats_required_for_gfu_boost, cpi->ppi->lap_enabled,
2530
0
        scale_max_boost);
2531
0
  } else {
2532
0
    reset_fpf_position(&cpi->twopass_frame, start_pos);
2533
0
    p_rc->gfu_boost =
2534
0
        AOMMIN(MAX_GF_BOOST,
2535
0
               av1_calc_arf_boost(twopass, &cpi->twopass_frame, p_rc,
2536
0
                                  frame_info, alt_offset, ext_len, 0,
2537
0
                                  &p_rc->num_stats_used_for_gfu_boost,
2538
0
                                  &p_rc->num_stats_required_for_gfu_boost,
2539
0
                                  cpi->ppi->lap_enabled, scale_max_boost));
2540
0
  }
2541
2542
0
#define LAST_ALR_BOOST_FACTOR 0.2f
2543
0
  p_rc->arf_boost_factor = 1.0;
2544
0
  if (use_alt_ref && !is_lossless_requested(rc_cfg)) {
2545
    // Reduce the boost of altref in the last gf group
2546
0
    if (rc->frames_to_key - ext_len == REDUCE_GF_LENGTH_BY ||
2547
0
        rc->frames_to_key - ext_len == 0) {
2548
0
      p_rc->arf_boost_factor = LAST_ALR_BOOST_FACTOR;
2549
0
    }
2550
0
  }
2551
2552
  // Reset the file position.
2553
0
  reset_fpf_position(&cpi->twopass_frame, start_pos);
2554
0
  if (cpi->ppi->lap_enabled) {
2555
    // Since we don't have enough stats to know the actual error of the
2556
    // gf group, we assume error of each frame to be equal to 1 and set
2557
    // the error of the group as baseline_gf_interval.
2558
0
    gf_stats->gf_group_err = p_rc->baseline_gf_interval;
2559
0
  }
2560
  // Calculate the bits to be allocated to the gf/arf group as a whole
2561
0
  p_rc->gf_group_bits =
2562
0
      calculate_total_gf_group_bits(cpi, gf_stats->gf_group_err);
2563
2564
0
#if GROUP_ADAPTIVE_MAXQ
2565
  // Calculate an estimate of the maxq needed for the group.
2566
  // We are more aggressive about correcting for sections
2567
  // where there could be significant overshoot than for easier
2568
  // sections where we do not wish to risk creating an overshoot
2569
  // of the allocated bit budget.
2570
0
  if ((rc_cfg->mode != AOM_Q) && (p_rc->baseline_gf_interval > 1) &&
2571
0
      is_final_pass) {
2572
0
    const int vbr_group_bits_per_frame =
2573
0
        (int)(p_rc->gf_group_bits / p_rc->baseline_gf_interval);
2574
0
    const double group_av_err =
2575
0
        gf_stats->gf_group_raw_error / p_rc->baseline_gf_interval;
2576
0
    const double group_av_skip_pct =
2577
0
        gf_stats->gf_group_skip_pct / p_rc->baseline_gf_interval;
2578
0
    const double group_av_inactive_zone =
2579
0
        ((gf_stats->gf_group_inactive_zone_rows * 2) /
2580
0
         (p_rc->baseline_gf_interval * (double)cm->mi_params.mb_rows));
2581
2582
0
    int tmp_q;
2583
0
    tmp_q = get_twopass_worst_quality(
2584
0
        cpi, group_av_err, (group_av_skip_pct + group_av_inactive_zone),
2585
0
        vbr_group_bits_per_frame);
2586
0
    rc->active_worst_quality = AOMMAX(tmp_q, rc->active_worst_quality >> 1);
2587
0
  }
2588
0
#endif
2589
2590
  // Adjust KF group bits and error remaining.
2591
0
  if (is_final_pass) twopass->kf_group_error_left -= gf_stats->gf_group_err;
2592
2593
  // Reset the file position.
2594
0
  reset_fpf_position(&cpi->twopass_frame, start_pos);
2595
2596
  // Calculate a section intra ratio used in setting max loop filter.
2597
0
  if (rc->frames_since_key != 0) {
2598
0
    twopass->section_intra_rating = calculate_section_intra_ratio(
2599
0
        start_pos, twopass->stats_buf_ctx->stats_in_end,
2600
0
        p_rc->baseline_gf_interval);
2601
0
  }
2602
2603
0
  av1_gop_bit_allocation(cpi, rc, gf_group, rc->frames_since_key == 0,
2604
0
                         use_alt_ref, p_rc->gf_group_bits);
2605
2606
  // TODO(jingning): Generalize this condition.
2607
0
  if (is_final_pass) {
2608
0
    cpi->ppi->gf_state.arf_gf_boost_lst = use_alt_ref;
2609
2610
    // Reset rolling actual and target bits counters for ARF groups.
2611
0
    twopass->rolling_arf_group_target_bits = 1;
2612
0
    twopass->rolling_arf_group_actual_bits = 1;
2613
0
  }
2614
#if CONFIG_BITRATE_ACCURACY
2615
  if (is_final_pass) {
2616
    av1_vbr_rc_set_gop_bit_budget(&cpi->vbr_rc_info,
2617
                                  p_rc->baseline_gf_interval);
2618
  }
2619
#endif
2620
0
}
2621
2622
/*!\brief Define a GF group.
2623
 *
2624
 * \ingroup gf_group_algo
2625
 * This function defines the structure of a GF group, along with various
2626
 * parameters regarding bit-allocation and quality setup.
2627
 *
2628
 * \param[in]    cpi             Top-level encoder structure
2629
 * \param[in]    frame_params    Structure with frame parameters
2630
 * \param[in]    is_final_pass   Whether this is the final pass for the
2631
 *                               GF group, or a trial (non-zero)
2632
 *
2633
 * \remark Nothing is returned. Instead, cpi->ppi->gf_group is changed.
2634
 */
2635
static void define_gf_group(AV1_COMP *cpi, EncodeFrameParams *frame_params,
2636
0
                            int is_final_pass) {
2637
0
  AV1_COMMON *const cm = &cpi->common;
2638
0
  RATE_CONTROL *const rc = &cpi->rc;
2639
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
2640
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
2641
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
2642
0
  FIRSTPASS_STATS next_frame;
2643
0
  const FIRSTPASS_STATS *const start_pos = cpi->twopass_frame.stats_in;
2644
0
  GF_GROUP *gf_group = &cpi->ppi->gf_group;
2645
0
  const GFConfig *const gf_cfg = &oxcf->gf_cfg;
2646
0
  const RateControlCfg *const rc_cfg = &oxcf->rc_cfg;
2647
0
  const int f_w = cm->width;
2648
0
  const int f_h = cm->height;
2649
0
  int i;
2650
0
  const int is_intra_only = rc->frames_since_key == 0;
2651
2652
0
  cpi->ppi->internal_altref_allowed = (gf_cfg->gf_max_pyr_height > 1);
2653
2654
  // Reset the GF group data structures unless this is a key
2655
  // frame in which case it will already have been done.
2656
0
  if (!is_intra_only) {
2657
0
    av1_zero(cpi->ppi->gf_group);
2658
0
    cpi->gf_frame_index = 0;
2659
0
  }
2660
2661
0
  if (has_no_stats_stage(cpi)) {
2662
0
    define_gf_group_pass0(cpi, is_final_pass);
2663
0
    return;
2664
0
  }
2665
2666
#if CONFIG_THREE_PASS
2667
  if (cpi->third_pass_ctx && oxcf->pass == AOM_RC_THIRD_PASS) {
2668
    int ret = define_gf_group_pass3(cpi, frame_params, is_final_pass);
2669
    if (ret == 0) return;
2670
2671
    av1_free_thirdpass_ctx(cpi->third_pass_ctx);
2672
    cpi->third_pass_ctx = NULL;
2673
  }
2674
#endif  // CONFIG_THREE_PASS
2675
2676
  // correct frames_to_key when lookahead queue is emptying
2677
0
  if (cpi->ppi->lap_enabled) {
2678
0
    correct_frames_to_key(cpi);
2679
0
  }
2680
2681
0
  GF_GROUP_STATS gf_stats;
2682
0
  accumulate_gop_stats(cpi, is_intra_only, f_w, f_h, &next_frame, start_pos,
2683
0
                       &gf_stats, &i);
2684
2685
0
  const int can_disable_arf = !gf_cfg->gf_min_pyr_height;
2686
2687
  // If this is a key frame or the overlay from a previous arf then
2688
  // the error score / cost of this frame has already been accounted for.
2689
0
  const int active_min_gf_interval = rc->min_gf_interval;
2690
2691
  // Disable internal ARFs for "still" gf groups.
2692
  //   zero_motion_accumulator: minimum percentage of (0,0) motion;
2693
  //   avg_sr_coded_error:      average of the SSE per pixel of each frame;
2694
  //   avg_raw_err_stdev:       average of the standard deviation of (0,0)
2695
  //                            motion error per block of each frame.
2696
0
  const int can_disable_internal_arfs = gf_cfg->gf_min_pyr_height <= 1;
2697
0
  if (can_disable_internal_arfs &&
2698
0
      gf_stats.zero_motion_accumulator > MIN_ZERO_MOTION &&
2699
0
      gf_stats.avg_sr_coded_error < MAX_SR_CODED_ERROR &&
2700
0
      gf_stats.avg_raw_err_stdev < MAX_RAW_ERR_VAR) {
2701
0
    cpi->ppi->internal_altref_allowed = 0;
2702
0
  }
2703
2704
0
  int use_alt_ref;
2705
0
  if (can_disable_arf) {
2706
0
    use_alt_ref =
2707
0
        p_rc->use_arf_in_this_kf_group && (i < gf_cfg->lag_in_frames) &&
2708
0
        (i >= MIN_GF_INTERVAL) &&
2709
0
        ((cpi->oxcf.mode != REALTIME) ||
2710
0
         !is_almost_static(gf_stats.zero_motion_accumulator,
2711
0
                           twopass->kf_zeromotion_pct, cpi->ppi->lap_enabled));
2712
0
  } else {
2713
0
    use_alt_ref = p_rc->use_arf_in_this_kf_group &&
2714
0
                  (i < gf_cfg->lag_in_frames) && (i > 2);
2715
0
  }
2716
0
  if (use_alt_ref) {
2717
0
    gf_group->max_layer_depth_allowed = gf_cfg->gf_max_pyr_height;
2718
0
  } else {
2719
0
    gf_group->max_layer_depth_allowed = 0;
2720
0
  }
2721
2722
0
  int alt_offset = 0;
2723
  // The length reduction strategy is tweaked for certain cases, and doesn't
2724
  // work well for certain other cases.
2725
0
  const int allow_gf_length_reduction =
2726
0
      ((rc_cfg->mode == AOM_Q && rc_cfg->cq_level <= 128) ||
2727
0
       !cpi->ppi->internal_altref_allowed) &&
2728
0
      !is_lossless_requested(rc_cfg);
2729
2730
0
  if (allow_gf_length_reduction && use_alt_ref) {
2731
    // adjust length of this gf group if one of the following condition met
2732
    // 1: only one overlay frame left and this gf is too long
2733
    // 2: next gf group is too short to have arf compared to the current gf
2734
2735
    // maximum length of next gf group
2736
0
    const int next_gf_len = rc->frames_to_key - i;
2737
0
    const int single_overlay_left =
2738
0
        next_gf_len == 0 && i > REDUCE_GF_LENGTH_THRESH;
2739
    // the next gf is probably going to have a ARF but it will be shorter than
2740
    // this gf
2741
0
    const int unbalanced_gf =
2742
0
        i > REDUCE_GF_LENGTH_TO_KEY_THRESH &&
2743
0
        next_gf_len + 1 < REDUCE_GF_LENGTH_TO_KEY_THRESH &&
2744
0
        next_gf_len + 1 >= rc->min_gf_interval;
2745
2746
0
    if (single_overlay_left || unbalanced_gf) {
2747
0
      const int roll_back = REDUCE_GF_LENGTH_BY;
2748
      // Reduce length only if active_min_gf_interval will be respected later.
2749
0
      if (i - roll_back >= active_min_gf_interval + 1) {
2750
0
        alt_offset = -roll_back;
2751
0
        i -= roll_back;
2752
0
        if (is_final_pass) rc->intervals_till_gf_calculate_due = 0;
2753
0
        p_rc->gf_intervals[p_rc->cur_gf_index] -= roll_back;
2754
0
        reset_fpf_position(&cpi->twopass_frame, start_pos);
2755
0
        accumulate_gop_stats(cpi, is_intra_only, f_w, f_h, &next_frame,
2756
0
                             start_pos, &gf_stats, &i);
2757
0
      }
2758
0
    }
2759
0
  }
2760
2761
0
  update_gop_length(rc, p_rc, i, is_final_pass);
2762
2763
  // Set up the structure of this Group-Of-Pictures (same as GF_GROUP)
2764
0
  av1_gop_setup_structure(cpi, is_final_pass);
2765
2766
0
  set_gop_bits_boost(cpi, i, is_intra_only, is_final_pass, use_alt_ref,
2767
0
                     alt_offset, start_pos, &gf_stats);
2768
2769
0
  frame_params->frame_type =
2770
0
      rc->frames_since_key == 0 ? KEY_FRAME : INTER_FRAME;
2771
0
  frame_params->show_frame =
2772
0
      !(gf_group->update_type[cpi->gf_frame_index] == ARF_UPDATE ||
2773
0
        gf_group->update_type[cpi->gf_frame_index] == INTNL_ARF_UPDATE);
2774
0
}
2775
2776
#if CONFIG_THREE_PASS
2777
/*!\brief Define a GF group for the third apss.
2778
 *
2779
 * \ingroup gf_group_algo
2780
 * This function defines the structure of a GF group for the third pass, along
2781
 * with various parameters regarding bit-allocation and quality setup based on
2782
 * the two-pass bitstream.
2783
 * Much of the function still uses the strategies used for the second pass and
2784
 * relies on first pass statistics. It is expected that over time these portions
2785
 * would be replaced with strategies specific to the third pass.
2786
 *
2787
 * \param[in]    cpi             Top-level encoder structure
2788
 * \param[in]    frame_params    Structure with frame parameters
2789
 * \param[in]    is_final_pass   Whether this is the final pass for the
2790
 *                               GF group, or a trial (non-zero)
2791
 *
2792
 * \return       0: Success;
2793
 *              -1: There are conflicts between the bitstream and current config
2794
 *               The values in cpi->ppi->gf_group are also changed.
2795
 */
2796
static int define_gf_group_pass3(AV1_COMP *cpi, EncodeFrameParams *frame_params,
2797
                                 int is_final_pass) {
2798
  if (!cpi->third_pass_ctx) return -1;
2799
  AV1_COMMON *const cm = &cpi->common;
2800
  RATE_CONTROL *const rc = &cpi->rc;
2801
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
2802
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
2803
  FIRSTPASS_STATS next_frame;
2804
  const FIRSTPASS_STATS *const start_pos = cpi->twopass_frame.stats_in;
2805
  GF_GROUP *gf_group = &cpi->ppi->gf_group;
2806
  const GFConfig *const gf_cfg = &oxcf->gf_cfg;
2807
  const int f_w = cm->width;
2808
  const int f_h = cm->height;
2809
  int i;
2810
  const int is_intra_only = rc->frames_since_key == 0;
2811
2812
  cpi->ppi->internal_altref_allowed = (gf_cfg->gf_max_pyr_height > 1);
2813
2814
  // Reset the GF group data structures unless this is a key
2815
  // frame in which case it will already have been done.
2816
  if (!is_intra_only) {
2817
    av1_zero(cpi->ppi->gf_group);
2818
    cpi->gf_frame_index = 0;
2819
  }
2820
2821
  GF_GROUP_STATS gf_stats;
2822
  accumulate_gop_stats(cpi, is_intra_only, f_w, f_h, &next_frame, start_pos,
2823
                       &gf_stats, &i);
2824
2825
  const int can_disable_arf = !gf_cfg->gf_min_pyr_height;
2826
2827
  // TODO(any): set cpi->ppi->internal_altref_allowed accordingly;
2828
2829
  int use_alt_ref = av1_check_use_arf(cpi->third_pass_ctx);
2830
  if (use_alt_ref == 0 && !can_disable_arf) return -1;
2831
  if (use_alt_ref) {
2832
    gf_group->max_layer_depth_allowed = gf_cfg->gf_max_pyr_height;
2833
  } else {
2834
    gf_group->max_layer_depth_allowed = 0;
2835
  }
2836
2837
  update_gop_length(rc, p_rc, i, is_final_pass);
2838
2839
  // Set up the structure of this Group-Of-Pictures (same as GF_GROUP)
2840
  av1_gop_setup_structure(cpi, is_final_pass);
2841
2842
  set_gop_bits_boost(cpi, i, is_intra_only, is_final_pass, use_alt_ref, 0,
2843
                     start_pos, &gf_stats);
2844
2845
  frame_params->frame_type = cpi->third_pass_ctx->frame_info[0].frame_type;
2846
  frame_params->show_frame = cpi->third_pass_ctx->frame_info[0].is_show_frame;
2847
  return 0;
2848
}
2849
#endif  // CONFIG_THREE_PASS
2850
2851
// Minimum % intra coding observed in first pass (1.0 = 100%)
2852
0
#define MIN_INTRA_LEVEL 0.25
2853
// Minimum ratio between the % of intra coding and inter coding in the first
2854
// pass after discounting neutral blocks (discounting neutral blocks in this
2855
// way helps catch scene cuts in clips with very flat areas or letter box
2856
// format clips with image padding.
2857
0
#define INTRA_VS_INTER_THRESH 2.0
2858
// Hard threshold where the first pass chooses intra for almost all blocks.
2859
// In such a case even if the frame is not a scene cut coding a key frame
2860
// may be a good option.
2861
0
#define VERY_LOW_INTER_THRESH 0.05
2862
// Maximum threshold for the relative ratio of intra error score vs best
2863
// inter error score.
2864
0
#define KF_II_ERR_THRESHOLD 1.9
2865
// In real scene cuts there is almost always a sharp change in the intra
2866
// or inter error score.
2867
0
#define ERR_CHANGE_THRESHOLD 0.4
2868
// For real scene cuts we expect an improvment in the intra inter error
2869
// ratio in the next frame.
2870
0
#define II_IMPROVEMENT_THRESHOLD 3.5
2871
0
#define KF_II_MAX 128.0
2872
// Intra / Inter threshold very low
2873
0
#define VERY_LOW_II 1.5
2874
// Clean slide transitions we expect a sharp single frame spike in error.
2875
0
#define ERROR_SPIKE 5.0
2876
2877
// Slide show transition detection.
2878
// Tests for case where there is very low error either side of the current frame
2879
// but much higher just for this frame. This can help detect key frames in
2880
// slide shows even where the slides are pictures of different sizes.
2881
// Also requires that intra and inter errors are very similar to help eliminate
2882
// harmful false positives.
2883
// It will not help if the transition is a fade or other multi-frame effect.
2884
static int slide_transition(const FIRSTPASS_STATS *this_frame,
2885
                            const FIRSTPASS_STATS *last_frame,
2886
0
                            const FIRSTPASS_STATS *next_frame) {
2887
0
  return (this_frame->intra_error < (this_frame->coded_error * VERY_LOW_II)) &&
2888
0
         (this_frame->coded_error > (last_frame->coded_error * ERROR_SPIKE)) &&
2889
0
         (this_frame->coded_error > (next_frame->coded_error * ERROR_SPIKE));
2890
0
}
2891
2892
// Threshold for use of the lagging second reference frame. High second ref
2893
// usage may point to a transient event like a flash or occlusion rather than
2894
// a real scene cut.
2895
// We adapt the threshold based on number of frames in this key-frame group so
2896
// far.
2897
0
static double get_second_ref_usage_thresh(int frame_count_so_far) {
2898
0
  const int adapt_upto = 32;
2899
0
  const double min_second_ref_usage_thresh = 0.085;
2900
0
  const double second_ref_usage_thresh_max_delta = 0.035;
2901
0
  if (frame_count_so_far >= adapt_upto) {
2902
0
    return min_second_ref_usage_thresh + second_ref_usage_thresh_max_delta;
2903
0
  }
2904
0
  return min_second_ref_usage_thresh +
2905
0
         ((double)frame_count_so_far / (adapt_upto - 1)) *
2906
0
             second_ref_usage_thresh_max_delta;
2907
0
}
2908
2909
static int test_candidate_kf(const FIRSTPASS_INFO *firstpass_info,
2910
                             int this_stats_index, int frame_count_so_far,
2911
                             enum aom_rc_mode rc_mode, int scenecut_mode,
2912
0
                             int num_mbs) {
2913
0
  const FIRSTPASS_STATS *last_stats =
2914
0
      av1_firstpass_info_peek(firstpass_info, this_stats_index - 1);
2915
0
  const FIRSTPASS_STATS *this_stats =
2916
0
      av1_firstpass_info_peek(firstpass_info, this_stats_index);
2917
0
  const FIRSTPASS_STATS *next_stats =
2918
0
      av1_firstpass_info_peek(firstpass_info, this_stats_index + 1);
2919
0
  if (last_stats == NULL || this_stats == NULL || next_stats == NULL) {
2920
0
    return 0;
2921
0
  }
2922
2923
0
  int is_viable_kf = 0;
2924
0
  double pcnt_intra = 1.0 - this_stats->pcnt_inter;
2925
0
  double modified_pcnt_inter =
2926
0
      this_stats->pcnt_inter - this_stats->pcnt_neutral;
2927
0
  const double second_ref_usage_thresh =
2928
0
      get_second_ref_usage_thresh(frame_count_so_far);
2929
0
  int frames_to_test_after_candidate_key = SCENE_CUT_KEY_TEST_INTERVAL;
2930
0
  int count_for_tolerable_prediction = 3;
2931
2932
  // We do "-1" because the candidate key is not counted.
2933
0
  int stats_after_this_stats =
2934
0
      av1_firstpass_info_future_count(firstpass_info, this_stats_index) - 1;
2935
2936
0
  if (scenecut_mode == ENABLE_SCENECUT_MODE_1) {
2937
0
    if (stats_after_this_stats < 3) {
2938
0
      return 0;
2939
0
    } else {
2940
0
      frames_to_test_after_candidate_key = 3;
2941
0
      count_for_tolerable_prediction = 1;
2942
0
    }
2943
0
  }
2944
  // Make sure we have enough stats after the candidate key.
2945
0
  frames_to_test_after_candidate_key =
2946
0
      AOMMIN(frames_to_test_after_candidate_key, stats_after_this_stats);
2947
2948
  // Does the frame satisfy the primary criteria of a key frame?
2949
  // See above for an explanation of the test criteria.
2950
  // If so, then examine how well it predicts subsequent frames.
2951
0
  if (IMPLIES(rc_mode == AOM_Q, frame_count_so_far >= 3) &&
2952
0
      (this_stats->pcnt_second_ref < second_ref_usage_thresh) &&
2953
0
      (next_stats->pcnt_second_ref < second_ref_usage_thresh) &&
2954
0
      ((this_stats->pcnt_inter < VERY_LOW_INTER_THRESH) ||
2955
0
       slide_transition(this_stats, last_stats, next_stats) ||
2956
0
       ((pcnt_intra > MIN_INTRA_LEVEL) &&
2957
0
        (pcnt_intra > (INTRA_VS_INTER_THRESH * modified_pcnt_inter)) &&
2958
0
        ((this_stats->intra_error /
2959
0
          DOUBLE_DIVIDE_CHECK(this_stats->coded_error)) <
2960
0
         KF_II_ERR_THRESHOLD) &&
2961
0
        ((fabs(last_stats->coded_error - this_stats->coded_error) /
2962
0
              DOUBLE_DIVIDE_CHECK(this_stats->coded_error) >
2963
0
          ERR_CHANGE_THRESHOLD) ||
2964
0
         (fabs(last_stats->intra_error - this_stats->intra_error) /
2965
0
              DOUBLE_DIVIDE_CHECK(this_stats->intra_error) >
2966
0
          ERR_CHANGE_THRESHOLD) ||
2967
0
         ((next_stats->intra_error /
2968
0
           DOUBLE_DIVIDE_CHECK(next_stats->coded_error)) >
2969
0
          II_IMPROVEMENT_THRESHOLD))))) {
2970
0
    int i;
2971
0
    double boost_score = 0.0;
2972
0
    double old_boost_score = 0.0;
2973
0
    double decay_accumulator = 1.0;
2974
2975
    // Examine how well the key frame predicts subsequent frames.
2976
0
    for (i = 1; i <= frames_to_test_after_candidate_key; ++i) {
2977
      // Get the next frame details
2978
0
      const FIRSTPASS_STATS *local_next_frame =
2979
0
          av1_firstpass_info_peek(firstpass_info, this_stats_index + i);
2980
2981
0
      if ((local_next_frame->intra_error - this_stats->intra_error) /
2982
0
                  DOUBLE_DIVIDE_CHECK(this_stats->intra_error) >
2983
0
              0.1 &&
2984
0
          this_stats->coded_error > local_next_frame->coded_error * 6) {
2985
0
        break;
2986
0
      }
2987
2988
0
      double next_iiratio =
2989
0
          (BOOST_FACTOR * local_next_frame->intra_error /
2990
0
           DOUBLE_DIVIDE_CHECK(local_next_frame->coded_error));
2991
2992
0
      if (next_iiratio > KF_II_MAX) next_iiratio = KF_II_MAX;
2993
2994
      // Cumulative effect of decay in prediction quality.
2995
0
      if (local_next_frame->pcnt_inter > 0.85)
2996
0
        decay_accumulator *= local_next_frame->pcnt_inter;
2997
0
      else
2998
0
        decay_accumulator *= (0.85 + local_next_frame->pcnt_inter) / 2.0;
2999
3000
      // Keep a running total.
3001
0
      boost_score += (decay_accumulator * next_iiratio);
3002
3003
      // Test various breakout clauses.
3004
      // TODO(any): Test of intra error should be normalized to an MB.
3005
0
      if ((local_next_frame->pcnt_inter < 0.05) || (next_iiratio < 1.5) ||
3006
0
          (((local_next_frame->pcnt_inter - local_next_frame->pcnt_neutral) <
3007
0
            0.20) &&
3008
0
           (next_iiratio < 3.0)) ||
3009
0
          ((boost_score - old_boost_score) < 3.0) ||
3010
0
          (local_next_frame->intra_error < (200.0 / (double)num_mbs))) {
3011
0
        break;
3012
0
      }
3013
3014
0
      old_boost_score = boost_score;
3015
0
    }
3016
3017
    // If there is tolerable prediction for at least the next 3 frames then
3018
    // break out else discard this potential key frame and move on
3019
0
    if (boost_score > 30.0 && (i > count_for_tolerable_prediction)) {
3020
0
      is_viable_kf = 1;
3021
0
    } else {
3022
0
      is_viable_kf = 0;
3023
0
    }
3024
0
  }
3025
0
  return is_viable_kf;
3026
0
}
3027
3028
0
#define FRAMES_TO_CHECK_DECAY 8
3029
0
#define KF_MIN_FRAME_BOOST 80.0
3030
0
#define KF_MAX_FRAME_BOOST 128.0
3031
#define MIN_KF_BOOST 600  // Minimum boost for non-static KF interval
3032
#define MAX_KF_BOOST 3200
3033
#define MIN_STATIC_KF_BOOST 5400  // Minimum boost for static KF interval
3034
3035
0
static int detect_app_forced_key(AV1_COMP *cpi) {
3036
0
  int num_frames_to_app_forced_key = is_forced_keyframe_pending(
3037
0
      cpi->ppi->lookahead, cpi->ppi->lookahead->max_sz, cpi->compressor_stage);
3038
0
  return num_frames_to_app_forced_key;
3039
0
}
3040
3041
0
static int get_projected_kf_boost(AV1_COMP *cpi) {
3042
  /*
3043
   * If num_stats_used_for_kf_boost >= frames_to_key, then
3044
   * all stats needed for prior boost calculation are available.
3045
   * Hence projecting the prior boost is not needed in this cases.
3046
   */
3047
0
  if (cpi->ppi->p_rc.num_stats_used_for_kf_boost >= cpi->rc.frames_to_key)
3048
0
    return cpi->ppi->p_rc.kf_boost;
3049
3050
  // Get the current tpl factor (number of frames = frames_to_key).
3051
0
  double tpl_factor = av1_get_kf_boost_projection_factor(cpi->rc.frames_to_key);
3052
  // Get the tpl factor when number of frames = num_stats_used_for_kf_boost.
3053
0
  double tpl_factor_num_stats = av1_get_kf_boost_projection_factor(
3054
0
      cpi->ppi->p_rc.num_stats_used_for_kf_boost);
3055
0
  int projected_kf_boost =
3056
0
      (int)rint((tpl_factor * cpi->ppi->p_rc.kf_boost) / tpl_factor_num_stats);
3057
0
  return projected_kf_boost;
3058
0
}
3059
3060
/*!\brief Determine the location of the next key frame
3061
 *
3062
 * \ingroup gf_group_algo
3063
 * This function decides the placement of the next key frame when a
3064
 * scenecut is detected or the maximum key frame distance is reached.
3065
 *
3066
 * \param[in]    cpi              Top-level encoder structure
3067
 * \param[in]    firstpass_info   struct for firstpass info
3068
 * \param[in]    num_frames_to_detect_scenecut Maximum lookahead frames.
3069
 * \param[in]    search_start_idx   the start index for searching key frame.
3070
 *                                  Set it to one if we already know the
3071
 *                                  current frame is key frame. Otherwise,
3072
 *                                  set it to zero.
3073
 *
3074
 * \return       Number of frames to the next key including the current frame.
3075
 */
3076
static int define_kf_interval(AV1_COMP *cpi,
3077
                              const FIRSTPASS_INFO *firstpass_info,
3078
                              int num_frames_to_detect_scenecut,
3079
0
                              int search_start_idx) {
3080
0
  const TWO_PASS *const twopass = &cpi->ppi->twopass;
3081
0
  const RATE_CONTROL *const rc = &cpi->rc;
3082
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
3083
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
3084
0
  const KeyFrameCfg *const kf_cfg = &oxcf->kf_cfg;
3085
0
  double recent_loop_decay[FRAMES_TO_CHECK_DECAY];
3086
0
  double decay_accumulator = 1.0;
3087
0
  int i = 0, j;
3088
0
  int frames_to_key = search_start_idx;
3089
0
  int frames_since_key = rc->frames_since_key + 1;
3090
0
  int scenecut_detected = 0;
3091
3092
0
  int num_frames_to_next_key = detect_app_forced_key(cpi);
3093
3094
0
  if (num_frames_to_detect_scenecut == 0) {
3095
0
    if (num_frames_to_next_key != -1)
3096
0
      return num_frames_to_next_key;
3097
0
    else
3098
0
      return rc->frames_to_key;
3099
0
  }
3100
3101
0
  if (num_frames_to_next_key != -1)
3102
0
    num_frames_to_detect_scenecut =
3103
0
        AOMMIN(num_frames_to_detect_scenecut, num_frames_to_next_key);
3104
3105
  // Initialize the decay rates for the recent frames to check
3106
0
  for (j = 0; j < FRAMES_TO_CHECK_DECAY; ++j) recent_loop_decay[j] = 1.0;
3107
3108
0
  i = 0;
3109
0
  const int num_mbs = (oxcf->resize_cfg.resize_mode != RESIZE_NONE)
3110
0
                          ? cpi->initial_mbs
3111
0
                          : cpi->common.mi_params.MBs;
3112
0
  const int future_stats_count =
3113
0
      av1_firstpass_info_future_count(firstpass_info, 0);
3114
3115
0
  while (frames_to_key < future_stats_count &&
3116
0
         frames_to_key < num_frames_to_detect_scenecut) {
3117
    // Provided that we are not at the end of the file...
3118
0
    if ((cpi->ppi->p_rc.enable_scenecut_detection > 0) && kf_cfg->auto_key &&
3119
0
        frames_to_key + 1 < future_stats_count) {
3120
0
      double loop_decay_rate;
3121
3122
      // Check for a scene cut.
3123
0
      if (frames_since_key >= kf_cfg->key_freq_min) {
3124
0
        scenecut_detected = test_candidate_kf(
3125
0
            &twopass->firstpass_info, frames_to_key, frames_since_key,
3126
0
            oxcf->rc_cfg.mode, cpi->ppi->p_rc.enable_scenecut_detection,
3127
0
            num_mbs);
3128
0
        if (scenecut_detected) {
3129
0
          int test_next_gop = 0;
3130
3131
0
          for (int idx = 0; idx < 32; ++idx) {
3132
0
            const FIRSTPASS_STATS *next_stats =
3133
0
                av1_firstpass_info_peek(firstpass_info, frames_to_key + idx);
3134
3135
0
            if (next_stats == NULL) continue;
3136
3137
0
            if (cpi->common.current_frame.frame_number + frames_to_key + idx >
3138
0
                    2 &&
3139
0
                next_stats->lt_coded_error * 2.5 < next_stats->coded_error)
3140
0
              test_next_gop = 1;
3141
0
          }
3142
3143
0
          if (!test_next_gop) break;
3144
0
        }
3145
0
      }
3146
3147
      // How fast is the prediction quality decaying?
3148
0
      const FIRSTPASS_STATS *next_stats =
3149
0
          av1_firstpass_info_peek(firstpass_info, frames_to_key + 1);
3150
0
      loop_decay_rate = get_prediction_decay_rate(next_stats);
3151
3152
      // We want to know something about the recent past... rather than
3153
      // as used elsewhere where we are concerned with decay in prediction
3154
      // quality since the last GF or KF.
3155
0
      recent_loop_decay[i % FRAMES_TO_CHECK_DECAY] = loop_decay_rate;
3156
0
      decay_accumulator = 1.0;
3157
0
      for (j = 0; j < FRAMES_TO_CHECK_DECAY; ++j)
3158
0
        decay_accumulator *= recent_loop_decay[j];
3159
3160
      // Special check for transition or high motion followed by a
3161
      // static scene.
3162
0
      if (frames_since_key >= kf_cfg->key_freq_min) {
3163
0
        scenecut_detected = detect_transition_to_still(
3164
0
            firstpass_info, frames_to_key + 1, rc->min_gf_interval, i,
3165
0
            kf_cfg->key_freq_max - i, loop_decay_rate, decay_accumulator);
3166
0
        if (scenecut_detected) {
3167
          // In the case of transition followed by a static scene, the key frame
3168
          // could be a good predictor for the following frames, therefore we
3169
          // do not use an arf.
3170
0
          p_rc->use_arf_in_this_kf_group = 0;
3171
0
          break;
3172
0
        }
3173
0
      }
3174
3175
      // Step on to the next frame.
3176
0
      ++frames_to_key;
3177
0
      ++frames_since_key;
3178
3179
      // If we don't have a real key frame within the next two
3180
      // key_freq_max intervals then break out of the loop.
3181
0
      if (frames_to_key >= 2 * kf_cfg->key_freq_max) {
3182
0
        break;
3183
0
      }
3184
0
    } else {
3185
0
      ++frames_to_key;
3186
0
      ++frames_since_key;
3187
0
    }
3188
0
    ++i;
3189
0
  }
3190
0
  if (cpi->ppi->lap_enabled && !scenecut_detected)
3191
0
    frames_to_key = num_frames_to_next_key;
3192
3193
0
  return frames_to_key;
3194
0
}
3195
3196
static double get_kf_group_avg_error(TWO_PASS *twopass,
3197
                                     TWO_PASS_FRAME *twopass_frame,
3198
                                     const FIRSTPASS_STATS *first_frame,
3199
                                     const FIRSTPASS_STATS *start_position,
3200
0
                                     int frames_to_key) {
3201
0
  FIRSTPASS_STATS cur_frame = *first_frame;
3202
0
  int num_frames, i;
3203
0
  double kf_group_avg_error = 0.0;
3204
3205
0
  reset_fpf_position(twopass_frame, start_position);
3206
3207
0
  for (i = 0; i < frames_to_key; ++i) {
3208
0
    kf_group_avg_error += cur_frame.coded_error;
3209
0
    if (EOF == input_stats(twopass, twopass_frame, &cur_frame)) break;
3210
0
  }
3211
0
  num_frames = i + 1;
3212
0
  num_frames = AOMMIN(num_frames, frames_to_key);
3213
0
  kf_group_avg_error = kf_group_avg_error / num_frames;
3214
3215
0
  return (kf_group_avg_error);
3216
0
}
3217
3218
static int64_t get_kf_group_bits(AV1_COMP *cpi, double kf_group_err,
3219
0
                                 double kf_group_avg_error) {
3220
0
  RATE_CONTROL *const rc = &cpi->rc;
3221
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
3222
0
  int64_t kf_group_bits;
3223
0
  if (cpi->ppi->lap_enabled) {
3224
0
    kf_group_bits = (int64_t)rc->frames_to_key * rc->avg_frame_bandwidth;
3225
0
    if (cpi->oxcf.rc_cfg.vbr_corpus_complexity_lap) {
3226
0
      double vbr_corpus_complexity_lap =
3227
0
          cpi->oxcf.rc_cfg.vbr_corpus_complexity_lap / 10.0;
3228
      /* Get the average corpus complexity of the frame */
3229
0
      kf_group_bits = (int64_t)(kf_group_bits * (kf_group_avg_error /
3230
0
                                                 vbr_corpus_complexity_lap));
3231
0
    }
3232
0
  } else {
3233
0
    kf_group_bits = (int64_t)(twopass->bits_left *
3234
0
                              (kf_group_err / twopass->modified_error_left));
3235
0
  }
3236
3237
0
  return kf_group_bits;
3238
0
}
3239
3240
0
static int calc_avg_stats(AV1_COMP *cpi, FIRSTPASS_STATS *avg_frame_stat) {
3241
0
  RATE_CONTROL *const rc = &cpi->rc;
3242
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
3243
0
  FIRSTPASS_STATS cur_frame;
3244
0
  av1_zero(cur_frame);
3245
0
  int num_frames = 0;
3246
  // Accumulate total stat using available number of stats.
3247
0
  for (num_frames = 0; num_frames < (rc->frames_to_key - 1); ++num_frames) {
3248
0
    if (EOF == input_stats(twopass, &cpi->twopass_frame, &cur_frame)) break;
3249
0
    av1_accumulate_stats(avg_frame_stat, &cur_frame);
3250
0
  }
3251
3252
0
  if (num_frames < 2) {
3253
0
    return num_frames;
3254
0
  }
3255
  // Average the total stat
3256
0
  avg_frame_stat->weight = avg_frame_stat->weight / num_frames;
3257
0
  avg_frame_stat->intra_error = avg_frame_stat->intra_error / num_frames;
3258
0
  avg_frame_stat->frame_avg_wavelet_energy =
3259
0
      avg_frame_stat->frame_avg_wavelet_energy / num_frames;
3260
0
  avg_frame_stat->coded_error = avg_frame_stat->coded_error / num_frames;
3261
0
  avg_frame_stat->sr_coded_error = avg_frame_stat->sr_coded_error / num_frames;
3262
0
  avg_frame_stat->pcnt_inter = avg_frame_stat->pcnt_inter / num_frames;
3263
0
  avg_frame_stat->pcnt_motion = avg_frame_stat->pcnt_motion / num_frames;
3264
0
  avg_frame_stat->pcnt_second_ref =
3265
0
      avg_frame_stat->pcnt_second_ref / num_frames;
3266
0
  avg_frame_stat->pcnt_neutral = avg_frame_stat->pcnt_neutral / num_frames;
3267
0
  avg_frame_stat->intra_skip_pct = avg_frame_stat->intra_skip_pct / num_frames;
3268
0
  avg_frame_stat->inactive_zone_rows =
3269
0
      avg_frame_stat->inactive_zone_rows / num_frames;
3270
0
  avg_frame_stat->inactive_zone_cols =
3271
0
      avg_frame_stat->inactive_zone_cols / num_frames;
3272
0
  avg_frame_stat->MVr = avg_frame_stat->MVr / num_frames;
3273
0
  avg_frame_stat->mvr_abs = avg_frame_stat->mvr_abs / num_frames;
3274
0
  avg_frame_stat->MVc = avg_frame_stat->MVc / num_frames;
3275
0
  avg_frame_stat->mvc_abs = avg_frame_stat->mvc_abs / num_frames;
3276
0
  avg_frame_stat->MVrv = avg_frame_stat->MVrv / num_frames;
3277
0
  avg_frame_stat->MVcv = avg_frame_stat->MVcv / num_frames;
3278
0
  avg_frame_stat->mv_in_out_count =
3279
0
      avg_frame_stat->mv_in_out_count / num_frames;
3280
0
  avg_frame_stat->new_mv_count = avg_frame_stat->new_mv_count / num_frames;
3281
0
  avg_frame_stat->count = avg_frame_stat->count / num_frames;
3282
0
  avg_frame_stat->duration = avg_frame_stat->duration / num_frames;
3283
3284
0
  return num_frames;
3285
0
}
3286
3287
static double get_kf_boost_score(AV1_COMP *cpi, double kf_raw_err,
3288
                                 double *zero_motion_accumulator,
3289
0
                                 double *sr_accumulator, int use_avg_stat) {
3290
0
  RATE_CONTROL *const rc = &cpi->rc;
3291
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
3292
0
  FRAME_INFO *const frame_info = &cpi->frame_info;
3293
0
  FIRSTPASS_STATS frame_stat;
3294
0
  av1_zero(frame_stat);
3295
0
  int i = 0, num_stat_used = 0;
3296
0
  double boost_score = 0.0;
3297
0
  const double kf_max_boost =
3298
0
      cpi->oxcf.rc_cfg.mode == AOM_Q
3299
0
          ? fclamp(rc->frames_to_key * 2.0, KF_MIN_FRAME_BOOST,
3300
0
                   KF_MAX_FRAME_BOOST)
3301
0
          : KF_MAX_FRAME_BOOST;
3302
3303
  // Calculate the average using available number of stats.
3304
0
  if (use_avg_stat) num_stat_used = calc_avg_stats(cpi, &frame_stat);
3305
3306
0
  for (i = num_stat_used; i < (rc->frames_to_key - 1); ++i) {
3307
0
    if (!use_avg_stat &&
3308
0
        EOF == input_stats(twopass, &cpi->twopass_frame, &frame_stat))
3309
0
      break;
3310
3311
    // Monitor for static sections.
3312
    // For the first frame in kf group, the second ref indicator is invalid.
3313
0
    if (i > 0) {
3314
0
      *zero_motion_accumulator =
3315
0
          AOMMIN(*zero_motion_accumulator, get_zero_motion_factor(&frame_stat));
3316
0
    } else {
3317
0
      *zero_motion_accumulator = frame_stat.pcnt_inter - frame_stat.pcnt_motion;
3318
0
    }
3319
3320
    // Not all frames in the group are necessarily used in calculating boost.
3321
0
    if ((*sr_accumulator < (kf_raw_err * 1.50)) &&
3322
0
        (i <= rc->max_gf_interval * 2)) {
3323
0
      double frame_boost;
3324
0
      double zm_factor;
3325
3326
      // Factor 0.75-1.25 based on how much of frame is static.
3327
0
      zm_factor = (0.75 + (*zero_motion_accumulator / 2.0));
3328
3329
0
      if (i < 2) *sr_accumulator = 0.0;
3330
0
      frame_boost =
3331
0
          calc_kf_frame_boost(&cpi->ppi->p_rc, frame_info, &frame_stat,
3332
0
                              sr_accumulator, kf_max_boost);
3333
0
      boost_score += frame_boost * zm_factor;
3334
0
    }
3335
0
  }
3336
0
  return boost_score;
3337
0
}
3338
3339
/*!\brief Interval(in seconds) to clip key-frame distance to in LAP.
3340
 */
3341
0
#define MAX_KF_BITS_INTERVAL_SINGLE_PASS 5
3342
3343
/*!\brief Determine the next key frame group
3344
 *
3345
 * \ingroup gf_group_algo
3346
 * This function decides the placement of the next key frame, and
3347
 * calculates the bit allocation of the KF group and the keyframe itself.
3348
 *
3349
 * \param[in]    cpi              Top-level encoder structure
3350
 * \param[in]    this_frame       Pointer to first pass stats
3351
 */
3352
0
static void find_next_key_frame(AV1_COMP *cpi, FIRSTPASS_STATS *this_frame) {
3353
0
  RATE_CONTROL *const rc = &cpi->rc;
3354
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
3355
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
3356
0
  GF_GROUP *const gf_group = &cpi->ppi->gf_group;
3357
0
  FRAME_INFO *const frame_info = &cpi->frame_info;
3358
0
  AV1_COMMON *const cm = &cpi->common;
3359
0
  CurrentFrame *const current_frame = &cm->current_frame;
3360
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
3361
0
  const KeyFrameCfg *const kf_cfg = &oxcf->kf_cfg;
3362
0
  const FIRSTPASS_STATS first_frame = *this_frame;
3363
0
  FIRSTPASS_STATS next_frame;
3364
0
  const FIRSTPASS_INFO *firstpass_info = &twopass->firstpass_info;
3365
0
  av1_zero(next_frame);
3366
3367
0
  rc->frames_since_key = 0;
3368
  // Use arfs if possible.
3369
0
  p_rc->use_arf_in_this_kf_group = is_altref_enabled(
3370
0
      oxcf->gf_cfg.lag_in_frames, oxcf->gf_cfg.enable_auto_arf);
3371
3372
  // Reset the GF group data structures.
3373
0
  av1_zero(*gf_group);
3374
0
  cpi->gf_frame_index = 0;
3375
3376
  // KF is always a GF so clear frames till next gf counter.
3377
0
  rc->frames_till_gf_update_due = 0;
3378
3379
0
  if (has_no_stats_stage(cpi)) {
3380
0
    int num_frames_to_app_forced_key = detect_app_forced_key(cpi);
3381
0
    p_rc->this_key_frame_forced =
3382
0
        current_frame->frame_number != 0 && rc->frames_to_key == 0;
3383
0
    if (num_frames_to_app_forced_key != -1)
3384
0
      rc->frames_to_key = num_frames_to_app_forced_key;
3385
0
    else
3386
0
      rc->frames_to_key = AOMMAX(1, kf_cfg->key_freq_max);
3387
0
    correct_frames_to_key(cpi);
3388
0
    p_rc->kf_boost = DEFAULT_KF_BOOST;
3389
0
    gf_group->update_type[0] = KF_UPDATE;
3390
0
    return;
3391
0
  }
3392
0
  int i;
3393
0
  const FIRSTPASS_STATS *const start_position = cpi->twopass_frame.stats_in;
3394
0
  int kf_bits = 0;
3395
0
  double zero_motion_accumulator = 1.0;
3396
0
  double boost_score = 0.0;
3397
0
  double kf_raw_err = 0.0;
3398
0
  double kf_mod_err = 0.0;
3399
0
  double sr_accumulator = 0.0;
3400
0
  double kf_group_avg_error = 0.0;
3401
0
  int frames_to_key, frames_to_key_clipped = INT_MAX;
3402
0
  int64_t kf_group_bits_clipped = INT64_MAX;
3403
3404
  // Is this a forced key frame by interval.
3405
0
  p_rc->this_key_frame_forced = p_rc->next_key_frame_forced;
3406
3407
0
  twopass->kf_group_bits = 0;        // Total bits available to kf group
3408
0
  twopass->kf_group_error_left = 0;  // Group modified error score.
3409
3410
0
  kf_raw_err = this_frame->intra_error;
3411
0
  kf_mod_err = calculate_modified_err(frame_info, twopass, oxcf, this_frame);
3412
3413
0
  if (cpi->ext_ratectrl.ready &&
3414
0
      (cpi->ext_ratectrl.funcs.rc_type & AOM_RC_GOP) != 0 &&
3415
0
      cpi->ext_ratectrl.funcs.get_key_frame_decision != NULL) {
3416
0
    aom_rc_key_frame_decision_t key_frame_decision;
3417
0
    aom_codec_err_t codec_status = av1_extrc_get_key_frame_decision(
3418
0
        &cpi->ext_ratectrl, &key_frame_decision);
3419
0
    if (codec_status == AOM_CODEC_OK) {
3420
0
      rc->frames_to_key = key_frame_decision.key_frame_group_size;
3421
0
    } else {
3422
0
      aom_internal_error(cpi->common.error, codec_status,
3423
0
                         "av1_extrc_get_key_frame_decision() failed");
3424
0
    }
3425
0
  } else {
3426
    // We assume the current frame is a key frame and we are looking for the
3427
    // next key frame. Therefore search_start_idx = 1
3428
0
    frames_to_key =
3429
0
        define_kf_interval(cpi, firstpass_info, kf_cfg->key_freq_max,
3430
0
                           /*search_start_idx=*/1);
3431
3432
0
    if (frames_to_key != -1) {
3433
0
      rc->frames_to_key = AOMMIN(kf_cfg->key_freq_max, frames_to_key);
3434
0
    } else {
3435
0
      rc->frames_to_key = kf_cfg->key_freq_max;
3436
0
    }
3437
0
  }
3438
3439
0
  if (cpi->ppi->lap_enabled) correct_frames_to_key(cpi);
3440
3441
  // If there is a max kf interval set by the user we must obey it.
3442
  // We already breakout of the loop above at 2x max.
3443
  // This code centers the extra kf if the actual natural interval
3444
  // is between 1x and 2x.
3445
0
  if (kf_cfg->auto_key && rc->frames_to_key > kf_cfg->key_freq_max) {
3446
0
    FIRSTPASS_STATS tmp_frame = first_frame;
3447
3448
0
    rc->frames_to_key /= 2;
3449
3450
    // Reset to the start of the group.
3451
0
    reset_fpf_position(&cpi->twopass_frame, start_position);
3452
    // Rescan to get the correct error data for the forced kf group.
3453
0
    for (i = 0; i < rc->frames_to_key; ++i) {
3454
0
      if (EOF == input_stats(twopass, &cpi->twopass_frame, &tmp_frame)) break;
3455
0
    }
3456
0
    p_rc->next_key_frame_forced = 1;
3457
0
  } else if ((cpi->twopass_frame.stats_in ==
3458
0
                  twopass->stats_buf_ctx->stats_in_end &&
3459
0
              is_stat_consumption_stage_twopass(cpi)) ||
3460
0
             rc->frames_to_key >= kf_cfg->key_freq_max) {
3461
0
    p_rc->next_key_frame_forced = 1;
3462
0
  } else {
3463
0
    p_rc->next_key_frame_forced = 0;
3464
0
  }
3465
3466
0
  double kf_group_err = 0;
3467
0
  for (i = 0; i < rc->frames_to_key; ++i) {
3468
0
    const FIRSTPASS_STATS *this_stats =
3469
0
        av1_firstpass_info_peek(&twopass->firstpass_info, i);
3470
0
    if (this_stats != NULL) {
3471
      // Accumulate kf group error.
3472
0
      kf_group_err += calculate_modified_err_new(
3473
0
          frame_info, &firstpass_info->total_stats, this_stats,
3474
0
          oxcf->rc_cfg.vbrbias, twopass->modified_error_min,
3475
0
          twopass->modified_error_max);
3476
0
      ++p_rc->num_stats_used_for_kf_boost;
3477
0
    }
3478
0
  }
3479
3480
  // Calculate the number of bits that should be assigned to the kf group.
3481
0
  if ((twopass->bits_left > 0 && twopass->modified_error_left > 0.0) ||
3482
0
      (cpi->ppi->lap_enabled && oxcf->rc_cfg.mode != AOM_Q)) {
3483
    // Maximum number of bits for a single normal frame (not key frame).
3484
0
    const int max_bits = frame_max_bits(rc, oxcf);
3485
3486
    // Maximum number of bits allocated to the key frame group.
3487
0
    int64_t max_grp_bits;
3488
3489
0
    if (oxcf->rc_cfg.vbr_corpus_complexity_lap) {
3490
0
      kf_group_avg_error =
3491
0
          get_kf_group_avg_error(twopass, &cpi->twopass_frame, &first_frame,
3492
0
                                 start_position, rc->frames_to_key);
3493
0
    }
3494
3495
    // Default allocation based on bits left and relative
3496
    // complexity of the section.
3497
0
    twopass->kf_group_bits =
3498
0
        get_kf_group_bits(cpi, kf_group_err, kf_group_avg_error);
3499
    // Clip based on maximum per frame rate defined by the user.
3500
0
    max_grp_bits = (int64_t)max_bits * (int64_t)rc->frames_to_key;
3501
0
    if (twopass->kf_group_bits > max_grp_bits)
3502
0
      twopass->kf_group_bits = max_grp_bits;
3503
0
  } else {
3504
0
    twopass->kf_group_bits = 0;
3505
0
  }
3506
0
  twopass->kf_group_bits = AOMMAX(0, twopass->kf_group_bits);
3507
3508
0
  if (cpi->ppi->lap_enabled) {
3509
    // In the case of single pass based on LAP, frames to  key may have an
3510
    // inaccurate value, and hence should be clipped to an appropriate
3511
    // interval.
3512
0
    frames_to_key_clipped =
3513
0
        (int)(MAX_KF_BITS_INTERVAL_SINGLE_PASS * cpi->framerate);
3514
3515
    // This variable calculates the bits allocated to kf_group with a clipped
3516
    // frames_to_key.
3517
0
    if (rc->frames_to_key > frames_to_key_clipped) {
3518
0
      kf_group_bits_clipped =
3519
0
          (int64_t)((double)twopass->kf_group_bits * frames_to_key_clipped /
3520
0
                    rc->frames_to_key);
3521
0
    }
3522
0
  }
3523
3524
  // Reset the first pass file position.
3525
0
  reset_fpf_position(&cpi->twopass_frame, start_position);
3526
3527
  // Scan through the kf group collating various stats used to determine
3528
  // how many bits to spend on it.
3529
0
  boost_score = get_kf_boost_score(cpi, kf_raw_err, &zero_motion_accumulator,
3530
0
                                   &sr_accumulator, 0);
3531
0
  reset_fpf_position(&cpi->twopass_frame, start_position);
3532
  // Store the zero motion percentage
3533
0
  twopass->kf_zeromotion_pct = (int)(zero_motion_accumulator * 100.0);
3534
3535
  // Calculate a section intra ratio used in setting max loop filter.
3536
0
  twopass->section_intra_rating = calculate_section_intra_ratio(
3537
0
      start_position, twopass->stats_buf_ctx->stats_in_end, rc->frames_to_key);
3538
3539
0
  p_rc->kf_boost = (int)boost_score;
3540
3541
0
  if (cpi->ppi->lap_enabled) {
3542
0
    if (oxcf->rc_cfg.mode == AOM_Q) {
3543
0
      p_rc->kf_boost = get_projected_kf_boost(cpi);
3544
0
    } else {
3545
      // TODO(any): Explore using average frame stats for AOM_Q as well.
3546
0
      boost_score = get_kf_boost_score(
3547
0
          cpi, kf_raw_err, &zero_motion_accumulator, &sr_accumulator, 1);
3548
0
      reset_fpf_position(&cpi->twopass_frame, start_position);
3549
0
      p_rc->kf_boost += (int)boost_score;
3550
0
    }
3551
0
  }
3552
3553
  // Special case for static / slide show content but don't apply
3554
  // if the kf group is very short.
3555
0
  if ((zero_motion_accumulator > STATIC_KF_GROUP_FLOAT_THRESH) &&
3556
0
      (rc->frames_to_key > 8)) {
3557
0
    p_rc->kf_boost = AOMMAX(p_rc->kf_boost, MIN_STATIC_KF_BOOST);
3558
0
  } else {
3559
    // Apply various clamps for min and max boost
3560
0
    p_rc->kf_boost = AOMMAX(p_rc->kf_boost, (rc->frames_to_key * 3));
3561
0
    p_rc->kf_boost = AOMMAX(p_rc->kf_boost, MIN_KF_BOOST);
3562
#ifdef STRICT_RC
3563
    p_rc->kf_boost = AOMMIN(p_rc->kf_boost, MAX_KF_BOOST);
3564
#endif
3565
0
  }
3566
3567
  // Work out how many bits to allocate for the key frame itself.
3568
  // In case of LAP enabled for VBR, if the frames_to_key value is
3569
  // very high, we calculate the bits based on a clipped value of
3570
  // frames_to_key.
3571
0
  kf_bits = calculate_boost_bits(
3572
0
      AOMMIN(rc->frames_to_key, frames_to_key_clipped) - 1, p_rc->kf_boost,
3573
0
      AOMMIN(twopass->kf_group_bits, kf_group_bits_clipped));
3574
0
  kf_bits = adjust_boost_bits_for_target_level(cpi, rc, kf_bits,
3575
0
                                               twopass->kf_group_bits, 0);
3576
3577
0
  twopass->kf_group_bits -= kf_bits;
3578
3579
  // Save the bits to spend on the key frame.
3580
0
  gf_group->bit_allocation[0] = kf_bits;
3581
0
  gf_group->update_type[0] = KF_UPDATE;
3582
3583
  // Note the total error score of the kf group minus the key frame itself.
3584
0
  if (cpi->ppi->lap_enabled)
3585
    // As we don't have enough stats to know the actual error of the group,
3586
    // we assume the complexity of each frame to be equal to 1, and set the
3587
    // error as the number of frames in the group(minus the keyframe).
3588
0
    twopass->kf_group_error_left = (double)(rc->frames_to_key - 1);
3589
0
  else
3590
0
    twopass->kf_group_error_left = kf_group_err - kf_mod_err;
3591
3592
  // Adjust the count of total modified error left.
3593
  // The count of bits left is adjusted elsewhere based on real coded frame
3594
  // sizes.
3595
0
  twopass->modified_error_left -= kf_group_err;
3596
0
}
3597
3598
#define ARF_STATS_OUTPUT 0
3599
#if ARF_STATS_OUTPUT
3600
unsigned int arf_count = 0;
3601
#endif
3602
3603
0
static int get_section_target_bandwidth(AV1_COMP *cpi) {
3604
0
  AV1_COMMON *const cm = &cpi->common;
3605
0
  CurrentFrame *const current_frame = &cm->current_frame;
3606
0
  RATE_CONTROL *const rc = &cpi->rc;
3607
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
3608
0
  int64_t section_target_bandwidth;
3609
0
  const int frames_left = (int)(twopass->stats_buf_ctx->total_stats->count -
3610
0
                                current_frame->frame_number);
3611
0
  if (cpi->ppi->lap_enabled)
3612
0
    section_target_bandwidth = rc->avg_frame_bandwidth;
3613
0
  else {
3614
0
    section_target_bandwidth = twopass->bits_left / frames_left;
3615
0
    section_target_bandwidth = AOMMIN(section_target_bandwidth, INT_MAX);
3616
0
  }
3617
0
  return (int)section_target_bandwidth;
3618
0
}
3619
3620
static inline void set_twopass_params_based_on_fp_stats(
3621
0
    AV1_COMP *cpi, const FIRSTPASS_STATS *this_frame_ptr) {
3622
0
  if (this_frame_ptr == NULL) return;
3623
3624
0
  TWO_PASS_FRAME *twopass_frame = &cpi->twopass_frame;
3625
  // The multiplication by 256 reverses a scaling factor of (>> 8)
3626
  // applied when combining MB error values for the frame.
3627
0
  twopass_frame->mb_av_energy = log1p(this_frame_ptr->intra_error);
3628
3629
0
  const FIRSTPASS_STATS *const total_stats =
3630
0
      cpi->ppi->twopass.stats_buf_ctx->total_stats;
3631
0
  if (is_fp_wavelet_energy_invalid(total_stats) == 0) {
3632
0
    twopass_frame->frame_avg_haar_energy =
3633
0
        log1p(this_frame_ptr->frame_avg_wavelet_energy);
3634
0
  }
3635
3636
  // Set the frame content type flag.
3637
0
  if (this_frame_ptr->intra_skip_pct >= FC_ANIMATION_THRESH)
3638
0
    twopass_frame->fr_content_type = FC_GRAPHICS_ANIMATION;
3639
0
  else
3640
0
    twopass_frame->fr_content_type = FC_NORMAL;
3641
0
}
3642
3643
static void process_first_pass_stats(AV1_COMP *cpi,
3644
0
                                     FIRSTPASS_STATS *this_frame) {
3645
0
  AV1_COMMON *const cm = &cpi->common;
3646
0
  CurrentFrame *const current_frame = &cm->current_frame;
3647
0
  RATE_CONTROL *const rc = &cpi->rc;
3648
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
3649
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
3650
0
  FIRSTPASS_STATS *total_stats = twopass->stats_buf_ctx->total_stats;
3651
3652
0
  if (cpi->oxcf.rc_cfg.mode != AOM_Q && current_frame->frame_number == 0 &&
3653
0
      cpi->gf_frame_index == 0 && total_stats &&
3654
0
      twopass->stats_buf_ctx->total_left_stats) {
3655
0
    if (cpi->ppi->lap_enabled) {
3656
      /*
3657
       * Accumulate total_stats using available limited number of stats,
3658
       * and assign it to total_left_stats.
3659
       */
3660
0
      *twopass->stats_buf_ctx->total_left_stats = *total_stats;
3661
0
    }
3662
    // Special case code for first frame.
3663
0
    const int section_target_bandwidth = get_section_target_bandwidth(cpi);
3664
0
    const double section_length =
3665
0
        twopass->stats_buf_ctx->total_left_stats->count;
3666
0
    const double section_error =
3667
0
        twopass->stats_buf_ctx->total_left_stats->coded_error / section_length;
3668
0
    const double section_intra_skip =
3669
0
        twopass->stats_buf_ctx->total_left_stats->intra_skip_pct /
3670
0
        section_length;
3671
0
    const double section_inactive_zone =
3672
0
        (twopass->stats_buf_ctx->total_left_stats->inactive_zone_rows * 2) /
3673
0
        ((double)cm->mi_params.mb_rows * section_length);
3674
0
    const int tmp_q = get_twopass_worst_quality(
3675
0
        cpi, section_error, section_intra_skip + section_inactive_zone,
3676
0
        section_target_bandwidth);
3677
3678
0
    rc->active_worst_quality = tmp_q;
3679
0
    rc->ni_av_qi = tmp_q;
3680
0
    p_rc->last_q[INTER_FRAME] = tmp_q;
3681
0
    p_rc->avg_q = av1_convert_qindex_to_q(tmp_q, cm->seq_params->bit_depth);
3682
0
    p_rc->avg_frame_qindex[INTER_FRAME] = tmp_q;
3683
0
    p_rc->last_q[KEY_FRAME] = (tmp_q + cpi->oxcf.rc_cfg.best_allowed_q) / 2;
3684
0
    p_rc->avg_frame_qindex[KEY_FRAME] = p_rc->last_q[KEY_FRAME];
3685
0
  }
3686
3687
0
  if (cpi->twopass_frame.stats_in < twopass->stats_buf_ctx->stats_in_end) {
3688
0
    *this_frame = *cpi->twopass_frame.stats_in;
3689
0
    ++cpi->twopass_frame.stats_in;
3690
0
  }
3691
0
  set_twopass_params_based_on_fp_stats(cpi, this_frame);
3692
0
}
3693
3694
0
void av1_setup_target_rate(AV1_COMP *cpi) {
3695
0
  RATE_CONTROL *const rc = &cpi->rc;
3696
0
  GF_GROUP *const gf_group = &cpi->ppi->gf_group;
3697
3698
0
  int target_rate = gf_group->bit_allocation[cpi->gf_frame_index];
3699
3700
0
  if (has_no_stats_stage(cpi)) {
3701
0
    av1_rc_set_frame_target(cpi, target_rate, cpi->common.width,
3702
0
                            cpi->common.height);
3703
0
  }
3704
3705
0
  rc->base_frame_target = target_rate;
3706
0
}
3707
3708
static void mark_flashes(FIRSTPASS_STATS *first_stats,
3709
0
                         FIRSTPASS_STATS *last_stats) {
3710
0
  FIRSTPASS_STATS *this_stats = first_stats, *next_stats;
3711
0
  while (this_stats < last_stats - 1) {
3712
0
    next_stats = this_stats + 1;
3713
0
    if (next_stats->pcnt_second_ref > next_stats->pcnt_inter &&
3714
0
        next_stats->pcnt_second_ref >= 0.5) {
3715
0
      this_stats->is_flash = 1;
3716
0
    } else {
3717
0
      this_stats->is_flash = 0;
3718
0
    }
3719
0
    this_stats = next_stats;
3720
0
  }
3721
  // We always treat the last one as none flash.
3722
0
  if (last_stats - 1 >= first_stats) {
3723
0
    (last_stats - 1)->is_flash = 0;
3724
0
  }
3725
0
}
3726
3727
// Smooth-out the noise variance so it is more stable
3728
// Returns 0 on success, -1 on memory allocation failure.
3729
// TODO(bohanli): Use a better low-pass filter than averaging
3730
static int smooth_filter_noise(FIRSTPASS_STATS *first_stats,
3731
0
                               FIRSTPASS_STATS *last_stats) {
3732
0
  int len = (int)(last_stats - first_stats);
3733
0
  double *smooth_noise = aom_malloc(len * sizeof(*smooth_noise));
3734
0
  if (!smooth_noise) return -1;
3735
3736
0
  for (int i = 0; i < len; i++) {
3737
0
    double total_noise = 0;
3738
0
    double total_wt = 0;
3739
0
    for (int j = -HALF_FILT_LEN; j <= HALF_FILT_LEN; j++) {
3740
0
      int idx = clamp(i + j, 0, len - 1);
3741
0
      if (first_stats[idx].is_flash) continue;
3742
3743
0
      total_noise += first_stats[idx].noise_var;
3744
0
      total_wt += 1.0;
3745
0
    }
3746
0
    if (total_wt > 0.01) {
3747
0
      total_noise /= total_wt;
3748
0
    } else {
3749
0
      total_noise = first_stats[i].noise_var;
3750
0
    }
3751
0
    smooth_noise[i] = total_noise;
3752
0
  }
3753
3754
0
  for (int i = 0; i < len; i++) {
3755
0
    first_stats[i].noise_var = smooth_noise[i];
3756
0
  }
3757
3758
0
  aom_free(smooth_noise);
3759
0
  return 0;
3760
0
}
3761
3762
// Estimate the noise variance of each frame from the first pass stats
3763
static void estimate_noise(FIRSTPASS_STATS *first_stats,
3764
                           FIRSTPASS_STATS *last_stats,
3765
0
                           struct aom_internal_error_info *error_info) {
3766
0
  FIRSTPASS_STATS *this_stats, *next_stats;
3767
0
  double C1, C2, C3, noise;
3768
0
  for (this_stats = first_stats + 2; this_stats < last_stats; this_stats++) {
3769
0
    this_stats->noise_var = 0.0;
3770
    // flashes tend to have high correlation of innovations, so ignore them.
3771
0
    if (this_stats->is_flash || (this_stats - 1)->is_flash ||
3772
0
        (this_stats - 2)->is_flash)
3773
0
      continue;
3774
3775
0
    C1 = (this_stats - 1)->intra_error *
3776
0
         (this_stats->intra_error - this_stats->coded_error);
3777
0
    C2 = (this_stats - 2)->intra_error *
3778
0
         ((this_stats - 1)->intra_error - (this_stats - 1)->coded_error);
3779
0
    C3 = (this_stats - 2)->intra_error *
3780
0
         (this_stats->intra_error - this_stats->sr_coded_error);
3781
0
    if (C1 <= 0 || C2 <= 0 || C3 <= 0) continue;
3782
0
    C1 = sqrt(C1);
3783
0
    C2 = sqrt(C2);
3784
0
    C3 = sqrt(C3);
3785
3786
0
    noise = (this_stats - 1)->intra_error - C1 * C2 / C3;
3787
0
    noise = AOMMAX(noise, 0.01);
3788
0
    this_stats->noise_var = noise;
3789
0
  }
3790
3791
  // Copy noise from the neighbor if the noise value is not trustworthy
3792
0
  for (this_stats = first_stats + 2; this_stats < last_stats; this_stats++) {
3793
0
    if (this_stats->is_flash || (this_stats - 1)->is_flash ||
3794
0
        (this_stats - 2)->is_flash)
3795
0
      continue;
3796
0
    if (this_stats->noise_var < 1.0) {
3797
0
      int found = 0;
3798
      // TODO(bohanli): consider expanding to two directions at the same time
3799
0
      for (next_stats = this_stats + 1; next_stats < last_stats; next_stats++) {
3800
0
        if (next_stats->is_flash || (next_stats - 1)->is_flash ||
3801
0
            (next_stats - 2)->is_flash || next_stats->noise_var < 1.0)
3802
0
          continue;
3803
0
        found = 1;
3804
0
        this_stats->noise_var = next_stats->noise_var;
3805
0
        break;
3806
0
      }
3807
0
      if (found) continue;
3808
0
      for (next_stats = this_stats - 1; next_stats >= first_stats + 2;
3809
0
           next_stats--) {
3810
0
        if (next_stats->is_flash || (next_stats - 1)->is_flash ||
3811
0
            (next_stats - 2)->is_flash || next_stats->noise_var < 1.0)
3812
0
          continue;
3813
0
        this_stats->noise_var = next_stats->noise_var;
3814
0
        break;
3815
0
      }
3816
0
    }
3817
0
  }
3818
3819
  // copy the noise if this is a flash
3820
0
  for (this_stats = first_stats + 2; this_stats < last_stats; this_stats++) {
3821
0
    if (this_stats->is_flash || (this_stats - 1)->is_flash ||
3822
0
        (this_stats - 2)->is_flash) {
3823
0
      int found = 0;
3824
0
      for (next_stats = this_stats + 1; next_stats < last_stats; next_stats++) {
3825
0
        if (next_stats->is_flash || (next_stats - 1)->is_flash ||
3826
0
            (next_stats - 2)->is_flash)
3827
0
          continue;
3828
0
        found = 1;
3829
0
        this_stats->noise_var = next_stats->noise_var;
3830
0
        break;
3831
0
      }
3832
0
      if (found) continue;
3833
0
      for (next_stats = this_stats - 1; next_stats >= first_stats + 2;
3834
0
           next_stats--) {
3835
0
        if (next_stats->is_flash || (next_stats - 1)->is_flash ||
3836
0
            (next_stats - 2)->is_flash)
3837
0
          continue;
3838
0
        this_stats->noise_var = next_stats->noise_var;
3839
0
        break;
3840
0
      }
3841
0
    }
3842
0
  }
3843
3844
  // if we are at the first 2 frames, copy the noise
3845
0
  for (this_stats = first_stats;
3846
0
       this_stats < first_stats + 2 && (first_stats + 2) < last_stats;
3847
0
       this_stats++) {
3848
0
    this_stats->noise_var = (first_stats + 2)->noise_var;
3849
0
  }
3850
3851
0
  if (smooth_filter_noise(first_stats, last_stats) == -1) {
3852
0
    aom_internal_error(error_info, AOM_CODEC_MEM_ERROR,
3853
0
                       "Error allocating buffers in smooth_filter_noise()");
3854
0
  }
3855
0
}
3856
3857
// Estimate correlation coefficient of each frame with its previous frame.
3858
static void estimate_coeff(FIRSTPASS_STATS *first_stats,
3859
0
                           FIRSTPASS_STATS *last_stats) {
3860
0
  FIRSTPASS_STATS *this_stats;
3861
0
  for (this_stats = first_stats + 1; this_stats < last_stats; this_stats++) {
3862
0
    const double C =
3863
0
        sqrt(AOMMAX((this_stats - 1)->intra_error *
3864
0
                        (this_stats->intra_error - this_stats->coded_error),
3865
0
                    0.001));
3866
0
    const double cor_coeff =
3867
0
        C /
3868
0
        AOMMAX((this_stats - 1)->intra_error - this_stats->noise_var, 0.001);
3869
3870
0
    this_stats->cor_coeff =
3871
0
        cor_coeff *
3872
0
        sqrt(AOMMAX((this_stats - 1)->intra_error - this_stats->noise_var,
3873
0
                    0.001) /
3874
0
             AOMMAX(this_stats->intra_error - this_stats->noise_var, 0.001));
3875
    // clip correlation coefficient.
3876
0
    this_stats->cor_coeff = fclamp(this_stats->cor_coeff, 0.0, 1.0);
3877
0
  }
3878
0
  first_stats->cor_coeff = 1.0;
3879
0
}
3880
3881
static void get_one_pass_rt_lag_params(AV1_COMP *cpi, unsigned int frame_flags,
3882
0
                                       EncodeFrameParams *const frame_params) {
3883
0
  RATE_CONTROL *const rc = &cpi->rc;
3884
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
3885
0
  GF_GROUP *const gf_group = &cpi->ppi->gf_group;
3886
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
3887
  // Check forced key frames.
3888
0
  const int frames_to_next_forced_key = detect_app_forced_key(cpi);
3889
0
  if (frames_to_next_forced_key == 0) {
3890
0
    rc->frames_to_key = 0;
3891
0
    frame_flags &= FRAMEFLAGS_KEY;
3892
0
  } else if (frames_to_next_forced_key > 0 &&
3893
0
             frames_to_next_forced_key < rc->frames_to_key) {
3894
0
    rc->frames_to_key = frames_to_next_forced_key;
3895
0
  }
3896
0
  frame_params->frame_type = gf_group->frame_type[cpi->gf_frame_index];
3897
0
  if (cpi->gf_frame_index < gf_group->size && !(frame_flags & FRAMEFLAGS_KEY)) {
3898
0
    av1_setup_target_rate(cpi);
3899
0
  }
3900
  // Keyframe processing.
3901
0
  if (rc->frames_to_key <= 0) {
3902
0
    const KeyFrameCfg *const kf_cfg = &oxcf->kf_cfg;
3903
0
    assert(rc->frames_to_key == 0);
3904
    // Define next KF group.
3905
0
    frame_params->frame_type = KEY_FRAME;
3906
0
    rc->frames_since_key = 0;
3907
    // Use arfs if possible.
3908
0
    p_rc->use_arf_in_this_kf_group = is_altref_enabled(
3909
0
        oxcf->gf_cfg.lag_in_frames, oxcf->gf_cfg.enable_auto_arf);
3910
    // Reset the GF group data structures.
3911
0
    av1_zero(*gf_group);
3912
0
    cpi->gf_frame_index = 0;
3913
    // KF is always a GF so clear frames till next gf counter.
3914
0
    rc->frames_till_gf_update_due = 0;
3915
0
    int num_frames_to_app_forced_key = detect_app_forced_key(cpi);
3916
0
    p_rc->this_key_frame_forced =
3917
0
        cpi->common.current_frame.frame_number != 0 && rc->frames_to_key == 0;
3918
0
    if (num_frames_to_app_forced_key != -1)
3919
0
      rc->frames_to_key = num_frames_to_app_forced_key;
3920
0
    else
3921
0
      rc->frames_to_key = AOMMAX(1, kf_cfg->key_freq_max);
3922
0
    correct_frames_to_key(cpi);
3923
0
    p_rc->kf_boost = DEFAULT_KF_BOOST;
3924
0
    gf_group->update_type[0] = KF_UPDATE;
3925
0
  }
3926
  // Define a new GF/ARF group. (Should always enter here for key frames).
3927
0
  if (cpi->gf_frame_index == gf_group->size) {
3928
0
    int max_gop_length =
3929
0
        (oxcf->gf_cfg.lag_in_frames >= 32)
3930
0
            ? AOMMIN(MAX_GF_INTERVAL, oxcf->gf_cfg.lag_in_frames -
3931
0
                                          oxcf->algo_cfg.arnr_max_frames / 2)
3932
0
            : MAX_GF_LENGTH_LAP;
3933
    // Limit the max gop length for the last gop in 1 pass setting.
3934
0
    max_gop_length = AOMMIN(max_gop_length, rc->frames_to_key);
3935
    // Go through source frames in lookahead buffer and compute source metrics:
3936
    // scene change, frame average source sad, etc.
3937
0
    int num_frames = 1;
3938
0
    int scene_change_gop_frame_index = 0;
3939
0
    rc->frame_source_sad_lag[0] = 0;
3940
0
    rc->avg_source_sad = 0;
3941
0
    for (int i = 1; i < max_gop_length; i++) {
3942
0
      EncodeFrameInput frame_input;
3943
0
      memset(&frame_input, 0, sizeof(frame_input));
3944
0
      struct lookahead_entry *e =
3945
0
          av1_lookahead_peek(cpi->ppi->lookahead, i, cpi->compressor_stage);
3946
0
      struct lookahead_entry *e_prev =
3947
0
          av1_lookahead_peek(cpi->ppi->lookahead, i - 1, cpi->compressor_stage);
3948
0
      if (e != NULL && e_prev != NULL) {
3949
0
        frame_input.source = &e->img;
3950
0
        frame_input.last_source = &e_prev->img;
3951
0
        rc->high_source_sad_lag[i] = -1;
3952
0
        rc->frame_source_sad_lag[i] = 0;
3953
0
        av1_rc_scene_detection_onepass_rt(cpi, &frame_input);
3954
0
        rc->high_source_sad_lag[i] = rc->high_source_sad;
3955
0
        rc->frame_source_sad_lag[i] = rc->frame_source_sad;
3956
0
        if (rc->high_source_sad_lag[i] == 1 && i > 1) {
3957
          // Scene change, so exit and constrain the gop to this frame.
3958
0
          scene_change_gop_frame_index = i;
3959
0
          break;
3960
0
        }
3961
0
        num_frames++;
3962
0
        rc->frame_source_sad_lag[0] += rc->frame_source_sad_lag[i];
3963
0
      }
3964
0
    }
3965
0
    if (scene_change_gop_frame_index > 0)
3966
0
      max_gop_length = AOMMIN(max_gop_length, scene_change_gop_frame_index);
3967
0
    rc->frame_source_sad_lag[0] = rc->frame_source_sad_lag[0] / num_frames;
3968
0
    calculate_gf_length(cpi, max_gop_length, MAX_NUM_GF_INTERVALS);
3969
0
    define_gf_group(cpi, frame_params, 0);
3970
0
    rc->frames_till_gf_update_due = p_rc->baseline_gf_interval;
3971
0
    frame_params->frame_type = gf_group->frame_type[cpi->gf_frame_index];
3972
0
    av1_setup_target_rate(cpi);
3973
    // Reset the source_sad parameters for the encoding.
3974
0
    rc->high_source_sad = 0;
3975
0
    rc->frame_source_sad = UINT64_MAX;
3976
0
    rc->avg_source_sad = 0;
3977
0
  }
3978
0
}
3979
3980
void av1_get_second_pass_params(AV1_COMP *cpi,
3981
                                EncodeFrameParams *const frame_params,
3982
0
                                unsigned int frame_flags) {
3983
0
  RATE_CONTROL *const rc = &cpi->rc;
3984
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
3985
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
3986
0
  GF_GROUP *const gf_group = &cpi->ppi->gf_group;
3987
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
3988
3989
0
  if (is_one_pass_rt_lag_params(cpi)) {
3990
0
    get_one_pass_rt_lag_params(cpi, frame_flags, frame_params);
3991
0
    return;
3992
0
  }
3993
3994
0
  if (cpi->ext_ratectrl.ready &&
3995
0
      (cpi->ext_ratectrl.funcs.rc_type & AOM_RC_GOP) != 0 &&
3996
0
      cpi->ext_ratectrl.funcs.get_gop_decision != NULL) {
3997
0
    frame_params->show_frame =
3998
0
        !(gf_group->update_type[cpi->gf_frame_index] == ARF_UPDATE ||
3999
0
          gf_group->update_type[cpi->gf_frame_index] == INTNL_ARF_UPDATE);
4000
0
  }
4001
4002
0
  if (cpi->use_ducky_encode &&
4003
0
      cpi->ducky_encode_info.frame_info.gop_mode == DUCKY_ENCODE_GOP_MODE_RCL) {
4004
0
    frame_params->frame_type = gf_group->frame_type[cpi->gf_frame_index];
4005
0
    frame_params->show_frame =
4006
0
        !(gf_group->update_type[cpi->gf_frame_index] == ARF_UPDATE ||
4007
0
          gf_group->update_type[cpi->gf_frame_index] == INTNL_ARF_UPDATE);
4008
0
    if (cpi->gf_frame_index == 0) {
4009
0
      av1_tf_info_reset(&cpi->ppi->tf_info);
4010
0
      av1_tf_info_filtering(&cpi->ppi->tf_info, cpi, gf_group);
4011
0
    }
4012
0
    return;
4013
0
  }
4014
4015
0
  if (cpi->common.current_frame.frame_number == 0 &&
4016
0
      cpi->ext_ratectrl.funcs.send_firstpass_stats != NULL) {
4017
0
    const aom_codec_err_t codec_status = av1_extrc_send_firstpass_stats(
4018
0
        &cpi->ext_ratectrl, &cpi->ppi->twopass.firstpass_info);
4019
0
    if (codec_status != AOM_CODEC_OK) {
4020
0
      aom_internal_error(cpi->common.error, codec_status,
4021
0
                         "av1_extrc_send_firstpass_stats() failed");
4022
0
    }
4023
0
  }
4024
4025
0
  const FIRSTPASS_STATS *const start_pos = cpi->twopass_frame.stats_in;
4026
0
  int update_total_stats = 0;
4027
4028
0
  if (is_stat_consumption_stage(cpi) && !cpi->twopass_frame.stats_in) return;
4029
4030
  // Check forced key frames.
4031
0
  const int frames_to_next_forced_key = detect_app_forced_key(cpi);
4032
0
  if (frames_to_next_forced_key == 0) {
4033
0
    rc->frames_to_key = 0;
4034
0
    frame_flags &= FRAMEFLAGS_KEY;
4035
0
  } else if (frames_to_next_forced_key > 0 &&
4036
0
             frames_to_next_forced_key < rc->frames_to_key) {
4037
0
    rc->frames_to_key = frames_to_next_forced_key;
4038
0
  }
4039
4040
0
  assert(cpi->twopass_frame.stats_in != NULL);
4041
0
  const int update_type = gf_group->update_type[cpi->gf_frame_index];
4042
0
  frame_params->frame_type = gf_group->frame_type[cpi->gf_frame_index];
4043
4044
0
  if (cpi->gf_frame_index < gf_group->size && !(frame_flags & FRAMEFLAGS_KEY)) {
4045
0
    assert(cpi->gf_frame_index < gf_group->size);
4046
4047
0
    av1_setup_target_rate(cpi);
4048
4049
    // If this is an arf frame then we dont want to read the stats file or
4050
    // advance the input pointer as we already have what we need.
4051
0
    if (update_type == ARF_UPDATE || update_type == INTNL_ARF_UPDATE) {
4052
0
      const FIRSTPASS_STATS *const this_frame_ptr =
4053
0
          read_frame_stats(twopass, &cpi->twopass_frame,
4054
0
                           gf_group->arf_src_offset[cpi->gf_frame_index]);
4055
0
      set_twopass_params_based_on_fp_stats(cpi, this_frame_ptr);
4056
0
      return;
4057
0
    }
4058
0
  }
4059
4060
0
  if (oxcf->rc_cfg.mode == AOM_Q)
4061
0
    rc->active_worst_quality = oxcf->rc_cfg.cq_level;
4062
4063
0
  if (cpi->gf_frame_index == gf_group->size) {
4064
0
    if (cpi->ppi->lap_enabled && cpi->ppi->p_rc.enable_scenecut_detection) {
4065
0
      const int num_frames_to_detect_scenecut = MAX_GF_LENGTH_LAP + 1;
4066
0
      const int frames_to_key = define_kf_interval(
4067
0
          cpi, &twopass->firstpass_info, num_frames_to_detect_scenecut,
4068
0
          /*search_start_idx=*/0);
4069
0
      if (frames_to_key != -1)
4070
0
        rc->frames_to_key = AOMMIN(rc->frames_to_key, frames_to_key);
4071
0
    }
4072
0
  }
4073
4074
0
  FIRSTPASS_STATS this_frame;
4075
0
  av1_zero(this_frame);
4076
  // call above fn
4077
0
  if (is_stat_consumption_stage(cpi)) {
4078
0
    if (cpi->gf_frame_index < gf_group->size || rc->frames_to_key == 0) {
4079
0
      process_first_pass_stats(cpi, &this_frame);
4080
0
      update_total_stats = 1;
4081
0
    }
4082
0
  } else {
4083
0
    rc->active_worst_quality = oxcf->rc_cfg.cq_level;
4084
0
  }
4085
4086
  // Keyframe and section processing.
4087
0
  FIRSTPASS_STATS this_frame_copy;
4088
0
  this_frame_copy = this_frame;
4089
0
  if (rc->frames_to_key <= 0) {
4090
0
    assert(rc->frames_to_key == 0);
4091
    // Define next KF group and assign bits to it.
4092
0
    frame_params->frame_type = KEY_FRAME;
4093
0
    find_next_key_frame(cpi, &this_frame);
4094
0
    this_frame = this_frame_copy;
4095
    // Mark prev gop arf source as unusable
4096
0
    cpi->ppi->tpl_data.prev_gop_arf_disp_order = -1;
4097
0
  }
4098
4099
0
  if (rc->frames_to_fwd_kf <= 0)
4100
0
    rc->frames_to_fwd_kf = oxcf->kf_cfg.fwd_kf_dist;
4101
4102
  // Define a new GF/ARF group. (Should always enter here for key frames).
4103
0
  if (cpi->gf_frame_index == gf_group->size) {
4104
0
    av1_tf_info_reset(&cpi->ppi->tf_info);
4105
#if CONFIG_BITRATE_ACCURACY && !CONFIG_THREE_PASS
4106
    vbr_rc_reset_gop_data(&cpi->vbr_rc_info);
4107
#endif  // CONFIG_BITRATE_ACCURACY
4108
0
    int max_gop_length =
4109
0
        (oxcf->gf_cfg.lag_in_frames >= 32)
4110
0
            ? AOMMIN(MAX_GF_INTERVAL, oxcf->gf_cfg.lag_in_frames -
4111
0
                                          oxcf->algo_cfg.arnr_max_frames / 2)
4112
0
            : MAX_GF_LENGTH_LAP;
4113
4114
    // Handle forward key frame when enabled.
4115
0
    if (oxcf->kf_cfg.fwd_kf_dist > 0)
4116
0
      max_gop_length = AOMMIN(rc->frames_to_fwd_kf + 1, max_gop_length);
4117
4118
    // Use the provided gop size in low delay setting
4119
0
    if (oxcf->gf_cfg.lag_in_frames == 0) max_gop_length = rc->max_gf_interval;
4120
4121
    // Limit the max gop length for the last gop in 1 pass setting.
4122
0
    max_gop_length = AOMMIN(max_gop_length, rc->frames_to_key);
4123
4124
    // Identify regions if needed.
4125
    // TODO(bohanli): identify regions for all stats available.
4126
0
    if (rc->frames_since_key == 0 || rc->frames_since_key == 1 ||
4127
0
        (p_rc->frames_till_regions_update - rc->frames_since_key <
4128
0
             rc->frames_to_key &&
4129
0
         p_rc->frames_till_regions_update - rc->frames_since_key <
4130
0
             max_gop_length + 1)) {
4131
      // how many frames we can analyze from this frame
4132
0
      int rest_frames =
4133
0
          AOMMIN(rc->frames_to_key, MAX_FIRSTPASS_ANALYSIS_FRAMES);
4134
0
      int available_frames = (int)(twopass->stats_buf_ctx->stats_in_end -
4135
0
                                   cpi->twopass_frame.stats_in);
4136
0
      if (!cpi->ppi->lap_enabled) {
4137
0
        available_frames += (rc->frames_since_key == 0);
4138
0
      }
4139
0
      rest_frames = AOMMIN(rest_frames, available_frames);
4140
0
      p_rc->frames_till_regions_update = rest_frames;
4141
4142
0
      int ret;
4143
0
      if (cpi->ppi->lap_enabled) {
4144
0
        mark_flashes(twopass->stats_buf_ctx->stats_in_start,
4145
0
                     twopass->stats_buf_ctx->stats_in_end);
4146
0
        estimate_noise(twopass->stats_buf_ctx->stats_in_start,
4147
0
                       twopass->stats_buf_ctx->stats_in_end, cpi->common.error);
4148
0
        estimate_coeff(twopass->stats_buf_ctx->stats_in_start,
4149
0
                       twopass->stats_buf_ctx->stats_in_end);
4150
0
        ret = identify_regions(cpi->twopass_frame.stats_in, rest_frames, 0,
4151
0
                               p_rc->regions, &p_rc->num_regions);
4152
0
      } else {
4153
0
        ret = identify_regions(
4154
0
            cpi->twopass_frame.stats_in - (rc->frames_since_key == 0),
4155
0
            rest_frames, 0, p_rc->regions, &p_rc->num_regions);
4156
0
      }
4157
0
      if (ret == -1) {
4158
0
        aom_internal_error(cpi->common.error, AOM_CODEC_MEM_ERROR,
4159
0
                           "Error allocating buffers in identify_regions");
4160
0
      }
4161
0
    }
4162
4163
0
    int cur_region_idx =
4164
0
        find_regions_index(p_rc->regions, p_rc->num_regions,
4165
0
                           rc->frames_since_key - p_rc->regions_offset);
4166
0
    if ((cur_region_idx >= 0 &&
4167
0
         p_rc->regions[cur_region_idx].type == SCENECUT_REGION) ||
4168
0
        rc->frames_since_key == 0) {
4169
      // If we start from a scenecut, then the last GOP's arf boost is not
4170
      // needed for this GOP.
4171
0
      cpi->ppi->gf_state.arf_gf_boost_lst = 0;
4172
0
    }
4173
4174
0
    int need_gf_len = 1;
4175
#if CONFIG_THREE_PASS
4176
    if (cpi->third_pass_ctx && oxcf->pass == AOM_RC_THIRD_PASS) {
4177
      // set up bitstream to read
4178
      if (!cpi->third_pass_ctx->input_file_name && oxcf->two_pass_output) {
4179
        cpi->third_pass_ctx->input_file_name = oxcf->two_pass_output;
4180
      }
4181
      av1_open_second_pass_log(cpi, 1);
4182
      THIRD_PASS_GOP_INFO *gop_info = &cpi->third_pass_ctx->gop_info;
4183
      // Read in GOP information from the second pass file.
4184
      av1_read_second_pass_gop_info(cpi->second_pass_log_stream, gop_info,
4185
                                    cpi->common.error);
4186
#if CONFIG_BITRATE_ACCURACY
4187
      TPL_INFO *tpl_info;
4188
      AOM_CHECK_MEM_ERROR(cpi->common.error, tpl_info,
4189
                          aom_malloc(sizeof(*tpl_info)));
4190
      av1_read_tpl_info(tpl_info, cpi->second_pass_log_stream,
4191
                        cpi->common.error);
4192
      aom_free(tpl_info);
4193
#if CONFIG_THREE_PASS
4194
      // TODO(angiebird): Put this part into a func
4195
      cpi->vbr_rc_info.cur_gop_idx++;
4196
#endif  // CONFIG_THREE_PASS
4197
#endif  // CONFIG_BITRATE_ACCURACY
4198
      // Read in third_pass_info from the bitstream.
4199
      av1_set_gop_third_pass(cpi->third_pass_ctx);
4200
      // Read in per-frame info from second-pass encoding
4201
      av1_read_second_pass_per_frame_info(
4202
          cpi->second_pass_log_stream, cpi->third_pass_ctx->frame_info,
4203
          gop_info->num_frames, cpi->common.error);
4204
4205
      p_rc->cur_gf_index = 0;
4206
      p_rc->gf_intervals[0] = cpi->third_pass_ctx->gop_info.gf_length;
4207
      need_gf_len = 0;
4208
    }
4209
#endif  // CONFIG_THREE_PASS
4210
4211
0
    if (need_gf_len) {
4212
      // If we cannot obtain GF group length from second_pass_file
4213
      // TODO(jingning): Resolve the redundant calls here.
4214
0
      if (rc->intervals_till_gf_calculate_due == 0 || 1) {
4215
0
        calculate_gf_length(cpi, max_gop_length, MAX_NUM_GF_INTERVALS);
4216
0
      }
4217
0
      if (max_gop_length > 16 && oxcf->algo_cfg.enable_tpl_model &&
4218
0
          oxcf->gf_cfg.lag_in_frames >= 32 &&
4219
0
          cpi->sf.tpl_sf.gop_length_decision_method != 3) {
4220
0
        int this_idx = rc->frames_since_key +
4221
0
                       p_rc->gf_intervals[p_rc->cur_gf_index] -
4222
0
                       p_rc->regions_offset - 1;
4223
0
        int this_region =
4224
0
            find_regions_index(p_rc->regions, p_rc->num_regions, this_idx);
4225
0
        int next_region =
4226
0
            find_regions_index(p_rc->regions, p_rc->num_regions, this_idx + 1);
4227
        // TODO(angiebird): Figure out why this_region and next_region are -1 in
4228
        // unit test like AltRefFramePresenceTestLarge (aomedia:3134)
4229
0
        int is_last_scenecut =
4230
0
            p_rc->gf_intervals[p_rc->cur_gf_index] >= rc->frames_to_key ||
4231
0
            (this_region != -1 &&
4232
0
             p_rc->regions[this_region].type == SCENECUT_REGION) ||
4233
0
            (next_region != -1 &&
4234
0
             p_rc->regions[next_region].type == SCENECUT_REGION);
4235
4236
0
        int ori_gf_int = p_rc->gf_intervals[p_rc->cur_gf_index];
4237
4238
0
        if (p_rc->gf_intervals[p_rc->cur_gf_index] > 16 &&
4239
0
            rc->min_gf_interval <= 16) {
4240
          // The calculate_gf_length function is previously used with
4241
          // max_gop_length = 32 with look-ahead gf intervals.
4242
0
          define_gf_group(cpi, frame_params, 0);
4243
0
          av1_tf_info_filtering(&cpi->ppi->tf_info, cpi, gf_group);
4244
0
          this_frame = this_frame_copy;
4245
4246
0
          if (is_shorter_gf_interval_better(cpi, frame_params)) {
4247
            // A shorter gf interval is better.
4248
            // TODO(jingning): Remove redundant computations here.
4249
0
            max_gop_length = 16;
4250
0
            calculate_gf_length(cpi, max_gop_length, 1);
4251
0
            if (is_last_scenecut &&
4252
0
                (ori_gf_int - p_rc->gf_intervals[p_rc->cur_gf_index] < 4)) {
4253
0
              p_rc->gf_intervals[p_rc->cur_gf_index] = ori_gf_int;
4254
0
            }
4255
0
          }
4256
0
        }
4257
0
      }
4258
0
    }
4259
4260
0
    define_gf_group(cpi, frame_params, 0);
4261
4262
0
    if (gf_group->update_type[cpi->gf_frame_index] != ARF_UPDATE &&
4263
0
        rc->frames_since_key > 0)
4264
0
      process_first_pass_stats(cpi, &this_frame);
4265
4266
0
    define_gf_group(cpi, frame_params, 1);
4267
4268
#if CONFIG_THREE_PASS
4269
    // write gop info if needed for third pass. Per-frame info is written after
4270
    // each frame is encoded.
4271
    av1_write_second_pass_gop_info(cpi);
4272
#endif  // CONFIG_THREE_PASS
4273
4274
0
    av1_tf_info_filtering(&cpi->ppi->tf_info, cpi, gf_group);
4275
4276
0
    rc->frames_till_gf_update_due = p_rc->baseline_gf_interval;
4277
0
    assert(cpi->gf_frame_index == 0);
4278
#if ARF_STATS_OUTPUT
4279
    {
4280
      FILE *fpfile;
4281
      fpfile = fopen("arf.stt", "a");
4282
      ++arf_count;
4283
      fprintf(fpfile, "%10d %10d %10d %10d %10d\n",
4284
              cpi->common.current_frame.frame_number,
4285
              rc->frames_till_gf_update_due, cpi->ppi->p_rc.kf_boost, arf_count,
4286
              p_rc->gfu_boost);
4287
4288
      fclose(fpfile);
4289
    }
4290
#endif
4291
0
  }
4292
0
  assert(cpi->gf_frame_index < gf_group->size);
4293
4294
0
  if (gf_group->update_type[cpi->gf_frame_index] == ARF_UPDATE ||
4295
0
      gf_group->update_type[cpi->gf_frame_index] == INTNL_ARF_UPDATE) {
4296
0
    reset_fpf_position(&cpi->twopass_frame, start_pos);
4297
4298
0
    const FIRSTPASS_STATS *const this_frame_ptr =
4299
0
        read_frame_stats(twopass, &cpi->twopass_frame,
4300
0
                         gf_group->arf_src_offset[cpi->gf_frame_index]);
4301
0
    set_twopass_params_based_on_fp_stats(cpi, this_frame_ptr);
4302
0
  } else {
4303
    // Back up this frame's stats for updating total stats during post encode.
4304
0
    cpi->twopass_frame.this_frame = update_total_stats ? start_pos : NULL;
4305
0
  }
4306
4307
0
  frame_params->frame_type = gf_group->frame_type[cpi->gf_frame_index];
4308
0
  av1_setup_target_rate(cpi);
4309
0
}
4310
4311
0
void av1_init_second_pass(AV1_COMP *cpi) {
4312
0
  const AV1EncoderConfig *const oxcf = &cpi->oxcf;
4313
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
4314
0
  FRAME_INFO *const frame_info = &cpi->frame_info;
4315
0
  double frame_rate;
4316
0
  FIRSTPASS_STATS *stats;
4317
4318
0
  if (!twopass->stats_buf_ctx->stats_in_end) return;
4319
4320
0
  mark_flashes(twopass->stats_buf_ctx->stats_in_start,
4321
0
               twopass->stats_buf_ctx->stats_in_end);
4322
0
  estimate_noise(twopass->stats_buf_ctx->stats_in_start,
4323
0
                 twopass->stats_buf_ctx->stats_in_end, cpi->common.error);
4324
0
  estimate_coeff(twopass->stats_buf_ctx->stats_in_start,
4325
0
                 twopass->stats_buf_ctx->stats_in_end);
4326
4327
0
  stats = twopass->stats_buf_ctx->total_stats;
4328
4329
0
  *stats = *twopass->stats_buf_ctx->stats_in_end;
4330
0
  *twopass->stats_buf_ctx->total_left_stats = *stats;
4331
4332
0
  frame_rate = 10000000.0 * stats->count / stats->duration;
4333
  // Each frame can have a different duration, as the frame rate in the source
4334
  // isn't guaranteed to be constant. The frame rate prior to the first frame
4335
  // encoded in the second pass is a guess. However, the sum duration is not.
4336
  // It is calculated based on the actual durations of all frames from the
4337
  // first pass.
4338
0
  av1_new_framerate(cpi, frame_rate);
4339
0
  twopass->bits_left =
4340
0
      (int64_t)(stats->duration * oxcf->rc_cfg.target_bandwidth / 10000000.0);
4341
4342
#if CONFIG_BITRATE_ACCURACY
4343
  av1_vbr_rc_init(&cpi->vbr_rc_info, twopass->bits_left,
4344
                  (int)round(stats->count));
4345
#endif
4346
4347
#if CONFIG_RATECTRL_LOG
4348
  rc_log_init(&cpi->rc_log);
4349
#endif
4350
4351
  // This variable monitors how far behind the second ref update is lagging.
4352
0
  twopass->sr_update_lag = 1;
4353
4354
  // Scan the first pass file and calculate a modified total error based upon
4355
  // the bias/power function used to allocate bits.
4356
0
  {
4357
0
    const double avg_error =
4358
0
        stats->coded_error / DOUBLE_DIVIDE_CHECK(stats->count);
4359
0
    const FIRSTPASS_STATS *s = cpi->twopass_frame.stats_in;
4360
0
    double modified_error_total = 0.0;
4361
0
    twopass->modified_error_min =
4362
0
        (avg_error * oxcf->rc_cfg.vbrmin_section) / 100;
4363
0
    twopass->modified_error_max =
4364
0
        (avg_error * oxcf->rc_cfg.vbrmax_section) / 100;
4365
0
    while (s < twopass->stats_buf_ctx->stats_in_end) {
4366
0
      modified_error_total +=
4367
0
          calculate_modified_err(frame_info, twopass, oxcf, s);
4368
0
      ++s;
4369
0
    }
4370
0
    twopass->modified_error_left = modified_error_total;
4371
0
  }
4372
4373
  // Reset the vbr bits off target counters
4374
0
  cpi->ppi->p_rc.vbr_bits_off_target = 0;
4375
0
  cpi->ppi->p_rc.vbr_bits_off_target_fast = 0;
4376
4377
0
  cpi->ppi->p_rc.rate_error_estimate = 0;
4378
4379
  // Static sequence monitor variables.
4380
0
  twopass->kf_zeromotion_pct = 100;
4381
0
  twopass->last_kfgroup_zeromotion_pct = 100;
4382
4383
  // Initialize bits per macro_block estimate correction factor.
4384
0
  twopass->bpm_factor = 1.0;
4385
  // Initialize actual and target bits counters for ARF groups so that
4386
  // at the start we have a neutral bpm adjustment.
4387
0
  twopass->rolling_arf_group_target_bits = 1;
4388
0
  twopass->rolling_arf_group_actual_bits = 1;
4389
0
}
4390
4391
0
void av1_init_single_pass_lap(AV1_COMP *cpi) {
4392
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
4393
4394
0
  if (!twopass->stats_buf_ctx->stats_in_end) return;
4395
4396
  // This variable monitors how far behind the second ref update is lagging.
4397
0
  twopass->sr_update_lag = 1;
4398
4399
0
  twopass->bits_left = 0;
4400
0
  twopass->modified_error_min = 0.0;
4401
0
  twopass->modified_error_max = 0.0;
4402
0
  twopass->modified_error_left = 0.0;
4403
4404
  // Reset the vbr bits off target counters
4405
0
  cpi->ppi->p_rc.vbr_bits_off_target = 0;
4406
0
  cpi->ppi->p_rc.vbr_bits_off_target_fast = 0;
4407
4408
0
  cpi->ppi->p_rc.rate_error_estimate = 0;
4409
4410
  // Static sequence monitor variables.
4411
0
  twopass->kf_zeromotion_pct = 100;
4412
0
  twopass->last_kfgroup_zeromotion_pct = 100;
4413
4414
  // Initialize bits per macro_block estimate correction factor.
4415
0
  twopass->bpm_factor = 1.0;
4416
  // Initialize actual and target bits counters for ARF groups so that
4417
  // at the start we have a neutral bpm adjustment.
4418
0
  twopass->rolling_arf_group_target_bits = 1;
4419
0
  twopass->rolling_arf_group_actual_bits = 1;
4420
0
}
4421
4422
0
#define MINQ_ADJ_LIMIT 48
4423
0
#define MINQ_ADJ_LIMIT_CQ 20
4424
0
#define HIGH_UNDERSHOOT_RATIO 2
4425
0
void av1_twopass_postencode_update(AV1_COMP *cpi) {
4426
0
  TWO_PASS *const twopass = &cpi->ppi->twopass;
4427
0
  RATE_CONTROL *const rc = &cpi->rc;
4428
0
  PRIMARY_RATE_CONTROL *const p_rc = &cpi->ppi->p_rc;
4429
0
  const RateControlCfg *const rc_cfg = &cpi->oxcf.rc_cfg;
4430
4431
  // Increment the stats_in pointer.
4432
0
  if (is_stat_consumption_stage(cpi) &&
4433
0
      !(cpi->use_ducky_encode && cpi->ducky_encode_info.frame_info.gop_mode ==
4434
0
                                     DUCKY_ENCODE_GOP_MODE_RCL) &&
4435
0
      (cpi->gf_frame_index < cpi->ppi->gf_group.size ||
4436
0
       rc->frames_to_key == 0)) {
4437
0
    const int update_type = cpi->ppi->gf_group.update_type[cpi->gf_frame_index];
4438
0
    if (update_type != ARF_UPDATE && update_type != INTNL_ARF_UPDATE) {
4439
0
      FIRSTPASS_STATS this_frame;
4440
0
      assert(cpi->twopass_frame.stats_in >
4441
0
             twopass->stats_buf_ctx->stats_in_start);
4442
0
      --cpi->twopass_frame.stats_in;
4443
0
      if (cpi->ppi->lap_enabled) {
4444
0
        input_stats_lap(twopass, &cpi->twopass_frame, &this_frame);
4445
0
      } else {
4446
0
        input_stats(twopass, &cpi->twopass_frame, &this_frame);
4447
0
      }
4448
0
    } else if (cpi->ppi->lap_enabled) {
4449
0
      cpi->twopass_frame.stats_in = twopass->stats_buf_ctx->stats_in_start;
4450
0
    }
4451
0
  }
4452
4453
  // VBR correction is done through rc->vbr_bits_off_target. Based on the
4454
  // sign of this value, a limited % adjustment is made to the target rate
4455
  // of subsequent frames, to try and push it back towards 0. This method
4456
  // is designed to prevent extreme behaviour at the end of a clip
4457
  // or group of frames.
4458
0
  p_rc->vbr_bits_off_target += rc->base_frame_target - rc->projected_frame_size;
4459
0
  twopass->bits_left = AOMMAX(twopass->bits_left - rc->base_frame_target, 0);
4460
4461
0
  if (cpi->do_update_vbr_bits_off_target_fast) {
4462
    // Subtract current frame's fast_extra_bits.
4463
0
    p_rc->vbr_bits_off_target_fast -= rc->frame_level_fast_extra_bits;
4464
0
    rc->frame_level_fast_extra_bits = 0;
4465
0
  }
4466
4467
  // Target vs actual bits for this arf group.
4468
0
  if (twopass->rolling_arf_group_target_bits >
4469
0
      INT_MAX - rc->base_frame_target) {
4470
0
    twopass->rolling_arf_group_target_bits = INT_MAX;
4471
0
  } else {
4472
0
    twopass->rolling_arf_group_target_bits += rc->base_frame_target;
4473
0
  }
4474
0
  twopass->rolling_arf_group_actual_bits += rc->projected_frame_size;
4475
4476
  // Calculate the pct rc error.
4477
0
  if (p_rc->total_actual_bits) {
4478
0
    p_rc->rate_error_estimate =
4479
0
        (int)((p_rc->vbr_bits_off_target * 100) / p_rc->total_actual_bits);
4480
0
    p_rc->rate_error_estimate = clamp(p_rc->rate_error_estimate, -100, 100);
4481
0
  } else {
4482
0
    p_rc->rate_error_estimate = 0;
4483
0
  }
4484
4485
#if CONFIG_FPMT_TEST
4486
  /* The variables temp_vbr_bits_off_target, temp_bits_left,
4487
   * temp_rolling_arf_group_target_bits, temp_rolling_arf_group_actual_bits
4488
   * temp_rate_error_estimate are introduced for quality simulation purpose,
4489
   * it retains the value previous to the parallel encode frames. The
4490
   * variables are updated based on the update flag.
4491
   *
4492
   * If there exist show_existing_frames between parallel frames, then to
4493
   * retain the temp state do not update it. */
4494
  const int simulate_parallel_frame =
4495
      cpi->ppi->fpmt_unit_test_cfg == PARALLEL_SIMULATION_ENCODE;
4496
  int show_existing_between_parallel_frames =
4497
      (cpi->ppi->gf_group.update_type[cpi->gf_frame_index] ==
4498
           INTNL_OVERLAY_UPDATE &&
4499
       cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index + 1] == 2);
4500
4501
  if (cpi->do_frame_data_update && !show_existing_between_parallel_frames &&
4502
      simulate_parallel_frame) {
4503
    cpi->ppi->p_rc.temp_vbr_bits_off_target = p_rc->vbr_bits_off_target;
4504
    cpi->ppi->p_rc.temp_bits_left = twopass->bits_left;
4505
    cpi->ppi->p_rc.temp_rolling_arf_group_target_bits =
4506
        twopass->rolling_arf_group_target_bits;
4507
    cpi->ppi->p_rc.temp_rolling_arf_group_actual_bits =
4508
        twopass->rolling_arf_group_actual_bits;
4509
    cpi->ppi->p_rc.temp_rate_error_estimate = p_rc->rate_error_estimate;
4510
  }
4511
#endif
4512
  // Update the active best quality pyramid.
4513
0
  if (!rc->is_src_frame_alt_ref) {
4514
0
    const int pyramid_level =
4515
0
        cpi->ppi->gf_group.layer_depth[cpi->gf_frame_index];
4516
0
    int i;
4517
0
    for (i = pyramid_level; i <= MAX_ARF_LAYERS; ++i) {
4518
0
      p_rc->active_best_quality[i] = cpi->common.quant_params.base_qindex;
4519
#if CONFIG_TUNE_VMAF
4520
      if (cpi->vmaf_info.original_qindex != -1 &&
4521
          (cpi->oxcf.tune_cfg.tuning >= AOM_TUNE_VMAF_WITH_PREPROCESSING &&
4522
           cpi->oxcf.tune_cfg.tuning <= AOM_TUNE_VMAF_NEG_MAX_GAIN)) {
4523
        p_rc->active_best_quality[i] = cpi->vmaf_info.original_qindex;
4524
      }
4525
#endif
4526
0
    }
4527
0
  }
4528
4529
#if 0
4530
  {
4531
    AV1_COMMON *cm = &cpi->common;
4532
    FILE *fpfile;
4533
    fpfile = fopen("details.stt", "a");
4534
    fprintf(fpfile,
4535
            "%10d %10d %10d %10" PRId64 " %10" PRId64
4536
            " %10d %10d %10d %10.4lf %10.4lf %10.4lf %10.4lf\n",
4537
            cm->current_frame.frame_number, rc->base_frame_target,
4538
            rc->projected_frame_size, rc->total_actual_bits,
4539
            rc->vbr_bits_off_target, p_rc->rate_error_estimate,
4540
            twopass->rolling_arf_group_target_bits,
4541
            twopass->rolling_arf_group_actual_bits,
4542
            (double)twopass->rolling_arf_group_actual_bits /
4543
                (double)twopass->rolling_arf_group_target_bits,
4544
            twopass->bpm_factor,
4545
            av1_convert_qindex_to_q(cpi->common.quant_params.base_qindex,
4546
                                    cm->seq_params->bit_depth),
4547
            av1_convert_qindex_to_q(rc->active_worst_quality,
4548
                                    cm->seq_params->bit_depth));
4549
    fclose(fpfile);
4550
  }
4551
#endif
4552
4553
0
  if (cpi->common.current_frame.frame_type != KEY_FRAME) {
4554
0
    twopass->kf_group_bits -= rc->base_frame_target;
4555
0
    twopass->last_kfgroup_zeromotion_pct = twopass->kf_zeromotion_pct;
4556
0
  }
4557
0
  twopass->kf_group_bits = AOMMAX(twopass->kf_group_bits, 0);
4558
4559
  // If the rate control is drifting consider adjustment to min or maxq.
4560
0
  if ((rc_cfg->mode != AOM_Q) && !cpi->rc.is_src_frame_alt_ref &&
4561
0
      (p_rc->rolling_target_bits > 0)) {
4562
0
    int minq_adj_limit;
4563
0
    int maxq_adj_limit;
4564
0
    minq_adj_limit =
4565
0
        (rc_cfg->mode == AOM_CQ ? MINQ_ADJ_LIMIT_CQ : MINQ_ADJ_LIMIT);
4566
0
    maxq_adj_limit = rc->worst_quality - rc->active_worst_quality;
4567
4568
    // Undershoot
4569
0
    if ((rc_cfg->under_shoot_pct < 100) &&
4570
0
        (p_rc->rolling_actual_bits < p_rc->rolling_target_bits)) {
4571
0
      int pct_error =
4572
0
          ((p_rc->rolling_target_bits - p_rc->rolling_actual_bits) * 100) /
4573
0
          p_rc->rolling_target_bits;
4574
4575
0
      if ((pct_error >= rc_cfg->under_shoot_pct) &&
4576
0
          (p_rc->rate_error_estimate > 0)) {
4577
0
        twopass->extend_minq += 1;
4578
0
      }
4579
0
      twopass->extend_maxq -= 1;
4580
      // Overshoot
4581
0
    } else if ((rc_cfg->over_shoot_pct < 100) &&
4582
0
               (p_rc->rolling_actual_bits > p_rc->rolling_target_bits)) {
4583
0
      int pct_error =
4584
0
          ((p_rc->rolling_actual_bits - p_rc->rolling_target_bits) * 100) /
4585
0
          p_rc->rolling_target_bits;
4586
4587
0
      pct_error = clamp(pct_error, 0, 100);
4588
0
      if ((pct_error >= rc_cfg->over_shoot_pct) &&
4589
0
          (p_rc->rate_error_estimate < 0)) {
4590
0
        twopass->extend_maxq += 1;
4591
0
      }
4592
0
      twopass->extend_minq -= 1;
4593
0
    } else {
4594
      // Adjustment for extreme local overshoot.
4595
      // Only applies when normal adjustment above is not used (e.g.
4596
      // when threshold is set to 100).
4597
0
      if (rc->projected_frame_size > (2 * rc->base_frame_target) &&
4598
0
          rc->projected_frame_size > (2 * rc->avg_frame_bandwidth))
4599
0
        ++twopass->extend_maxq;
4600
      // Unwind extreme overshoot adjustment.
4601
0
      else if (p_rc->rolling_target_bits > p_rc->rolling_actual_bits)
4602
0
        --twopass->extend_maxq;
4603
0
    }
4604
0
    twopass->extend_minq =
4605
0
        clamp(twopass->extend_minq, -minq_adj_limit, minq_adj_limit);
4606
0
    twopass->extend_maxq = clamp(twopass->extend_maxq, 0, maxq_adj_limit);
4607
4608
    // If there is a big and undexpected undershoot then feed the extra
4609
    // bits back in quickly. One situation where this may happen is if a
4610
    // frame is unexpectedly almost perfectly predicted by the ARF or GF
4611
    // but not very well predcited by the previous frame.
4612
0
    if (!frame_is_kf_gf_arf(cpi) && !cpi->rc.is_src_frame_alt_ref) {
4613
0
      int fast_extra_thresh = rc->base_frame_target / HIGH_UNDERSHOOT_RATIO;
4614
0
      if (rc->projected_frame_size < fast_extra_thresh) {
4615
0
        p_rc->vbr_bits_off_target_fast +=
4616
0
            fast_extra_thresh - rc->projected_frame_size;
4617
0
        p_rc->vbr_bits_off_target_fast =
4618
0
            AOMMIN(p_rc->vbr_bits_off_target_fast,
4619
0
                   (4 * (int64_t)rc->avg_frame_bandwidth));
4620
0
      }
4621
0
    }
4622
4623
#if CONFIG_FPMT_TEST
4624
    if (cpi->do_frame_data_update && !show_existing_between_parallel_frames &&
4625
        simulate_parallel_frame) {
4626
      cpi->ppi->p_rc.temp_vbr_bits_off_target_fast =
4627
          p_rc->vbr_bits_off_target_fast;
4628
      cpi->ppi->p_rc.temp_extend_minq = twopass->extend_minq;
4629
      cpi->ppi->p_rc.temp_extend_maxq = twopass->extend_maxq;
4630
    }
4631
#endif
4632
0
  }
4633
4634
  // Update the frame probabilities obtained from parallel encode frames
4635
0
  FrameProbInfo *const frame_probs = &cpi->ppi->frame_probs;
4636
#if CONFIG_FPMT_TEST
4637
  /* The variable temp_active_best_quality is introduced only for quality
4638
   * simulation purpose, it retains the value previous to the parallel
4639
   * encode frames. The variable is updated based on the update flag.
4640
   *
4641
   * If there exist show_existing_frames between parallel frames, then to
4642
   * retain the temp state do not update it. */
4643
  if (cpi->do_frame_data_update && !show_existing_between_parallel_frames &&
4644
      simulate_parallel_frame) {
4645
    int i;
4646
    const int pyramid_level =
4647
        cpi->ppi->gf_group.layer_depth[cpi->gf_frame_index];
4648
    if (!rc->is_src_frame_alt_ref) {
4649
      for (i = pyramid_level; i <= MAX_ARF_LAYERS; ++i)
4650
        cpi->ppi->p_rc.temp_active_best_quality[i] =
4651
            p_rc->active_best_quality[i];
4652
    }
4653
  }
4654
4655
  // Update the frame probabilities obtained from parallel encode frames
4656
  FrameProbInfo *const temp_frame_probs_simulation =
4657
      simulate_parallel_frame ? &cpi->ppi->temp_frame_probs_simulation
4658
                              : frame_probs;
4659
  FrameProbInfo *const temp_frame_probs =
4660
      simulate_parallel_frame ? &cpi->ppi->temp_frame_probs : NULL;
4661
#endif
4662
0
  int i, j, loop;
4663
  // Sequentially do average on temp_frame_probs_simulation which holds
4664
  // probabilities of last frame before parallel encode
4665
0
  for (loop = 0; loop <= cpi->num_frame_recode; loop++) {
4666
    // Sequentially update tx_type_probs
4667
0
    if (cpi->do_update_frame_probs_txtype[loop] &&
4668
0
        (cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index] > 0)) {
4669
0
      const FRAME_UPDATE_TYPE update_type =
4670
0
          get_frame_update_type(&cpi->ppi->gf_group, cpi->gf_frame_index);
4671
0
      for (i = 0; i < TX_SIZES_ALL; i++) {
4672
0
        int left = 1024;
4673
4674
0
        for (j = TX_TYPES - 1; j >= 0; j--) {
4675
0
          const int new_prob =
4676
0
              cpi->frame_new_probs[loop].tx_type_probs[update_type][i][j];
4677
#if CONFIG_FPMT_TEST
4678
          int prob =
4679
              (temp_frame_probs_simulation->tx_type_probs[update_type][i][j] +
4680
               new_prob) >>
4681
              1;
4682
          left -= prob;
4683
          if (j == 0) prob += left;
4684
          temp_frame_probs_simulation->tx_type_probs[update_type][i][j] = prob;
4685
#else
4686
0
          int prob =
4687
0
              (frame_probs->tx_type_probs[update_type][i][j] + new_prob) >> 1;
4688
0
          left -= prob;
4689
0
          if (j == 0) prob += left;
4690
0
          frame_probs->tx_type_probs[update_type][i][j] = prob;
4691
0
#endif
4692
0
        }
4693
0
      }
4694
0
    }
4695
4696
    // Sequentially update obmc_probs
4697
0
    if (cpi->do_update_frame_probs_obmc[loop] &&
4698
0
        cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index] > 0) {
4699
0
      const FRAME_UPDATE_TYPE update_type =
4700
0
          get_frame_update_type(&cpi->ppi->gf_group, cpi->gf_frame_index);
4701
4702
0
      for (i = 0; i < BLOCK_SIZES_ALL; i++) {
4703
0
        const int new_prob =
4704
0
            cpi->frame_new_probs[loop].obmc_probs[update_type][i];
4705
#if CONFIG_FPMT_TEST
4706
        temp_frame_probs_simulation->obmc_probs[update_type][i] =
4707
            (temp_frame_probs_simulation->obmc_probs[update_type][i] +
4708
             new_prob) >>
4709
            1;
4710
#else
4711
0
        frame_probs->obmc_probs[update_type][i] =
4712
0
            (frame_probs->obmc_probs[update_type][i] + new_prob) >> 1;
4713
0
#endif
4714
0
      }
4715
0
    }
4716
4717
    // Sequentially update warped_probs
4718
0
    if (cpi->do_update_frame_probs_warp[loop] &&
4719
0
        cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index] > 0) {
4720
0
      const FRAME_UPDATE_TYPE update_type =
4721
0
          get_frame_update_type(&cpi->ppi->gf_group, cpi->gf_frame_index);
4722
0
      const int new_prob = cpi->frame_new_probs[loop].warped_probs[update_type];
4723
#if CONFIG_FPMT_TEST
4724
      temp_frame_probs_simulation->warped_probs[update_type] =
4725
          (temp_frame_probs_simulation->warped_probs[update_type] + new_prob) >>
4726
          1;
4727
#else
4728
0
      frame_probs->warped_probs[update_type] =
4729
0
          (frame_probs->warped_probs[update_type] + new_prob) >> 1;
4730
0
#endif
4731
0
    }
4732
4733
    // Sequentially update switchable_interp_probs
4734
0
    if (cpi->do_update_frame_probs_interpfilter[loop] &&
4735
0
        cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index] > 0) {
4736
0
      const FRAME_UPDATE_TYPE update_type =
4737
0
          get_frame_update_type(&cpi->ppi->gf_group, cpi->gf_frame_index);
4738
4739
0
      for (i = 0; i < SWITCHABLE_FILTER_CONTEXTS; i++) {
4740
0
        int left = 1536;
4741
4742
0
        for (j = SWITCHABLE_FILTERS - 1; j >= 0; j--) {
4743
0
          const int new_prob = cpi->frame_new_probs[loop]
4744
0
                                   .switchable_interp_probs[update_type][i][j];
4745
#if CONFIG_FPMT_TEST
4746
          int prob = (temp_frame_probs_simulation
4747
                          ->switchable_interp_probs[update_type][i][j] +
4748
                      new_prob) >>
4749
                     1;
4750
          left -= prob;
4751
          if (j == 0) prob += left;
4752
4753
          temp_frame_probs_simulation
4754
              ->switchable_interp_probs[update_type][i][j] = prob;
4755
#else
4756
0
          int prob = (frame_probs->switchable_interp_probs[update_type][i][j] +
4757
0
                      new_prob) >>
4758
0
                     1;
4759
0
          left -= prob;
4760
0
          if (j == 0) prob += left;
4761
0
          frame_probs->switchable_interp_probs[update_type][i][j] = prob;
4762
0
#endif
4763
0
        }
4764
0
      }
4765
0
    }
4766
0
  }
4767
4768
#if CONFIG_FPMT_TEST
4769
  // Copying temp_frame_probs_simulation to temp_frame_probs based on
4770
  // the flag
4771
  if (cpi->do_frame_data_update &&
4772
      cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index] > 0 &&
4773
      simulate_parallel_frame) {
4774
    for (int update_type_idx = 0; update_type_idx < FRAME_UPDATE_TYPES;
4775
         update_type_idx++) {
4776
      for (i = 0; i < BLOCK_SIZES_ALL; i++) {
4777
        temp_frame_probs->obmc_probs[update_type_idx][i] =
4778
            temp_frame_probs_simulation->obmc_probs[update_type_idx][i];
4779
      }
4780
      temp_frame_probs->warped_probs[update_type_idx] =
4781
          temp_frame_probs_simulation->warped_probs[update_type_idx];
4782
      for (i = 0; i < TX_SIZES_ALL; i++) {
4783
        for (j = 0; j < TX_TYPES; j++) {
4784
          temp_frame_probs->tx_type_probs[update_type_idx][i][j] =
4785
              temp_frame_probs_simulation->tx_type_probs[update_type_idx][i][j];
4786
        }
4787
      }
4788
      for (i = 0; i < SWITCHABLE_FILTER_CONTEXTS; i++) {
4789
        for (j = 0; j < SWITCHABLE_FILTERS; j++) {
4790
          temp_frame_probs->switchable_interp_probs[update_type_idx][i][j] =
4791
              temp_frame_probs_simulation
4792
                  ->switchable_interp_probs[update_type_idx][i][j];
4793
        }
4794
      }
4795
    }
4796
  }
4797
#endif
4798
  // Update framerate obtained from parallel encode frames
4799
0
  if (cpi->common.show_frame &&
4800
0
      cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index] > 0)
4801
0
    cpi->framerate = cpi->new_framerate;
4802
#if CONFIG_FPMT_TEST
4803
  // SIMULATION PURPOSE
4804
  int show_existing_between_parallel_frames_cndn =
4805
      (cpi->ppi->gf_group.update_type[cpi->gf_frame_index] ==
4806
           INTNL_OVERLAY_UPDATE &&
4807
       cpi->ppi->gf_group.frame_parallel_level[cpi->gf_frame_index + 1] == 2);
4808
  if (cpi->common.show_frame && !show_existing_between_parallel_frames_cndn &&
4809
      cpi->do_frame_data_update && simulate_parallel_frame)
4810
    cpi->temp_framerate = cpi->framerate;
4811
#endif
4812
0
}