2010-05-18 17:58:33 +02:00
|
|
|
/*
|
2010-09-09 14:16:39 +02:00
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
2010-05-18 17:58:33 +02:00
|
|
|
*
|
2010-06-18 18:39:21 +02:00
|
|
|
* Use of this source code is governed by a BSD-style license
|
2010-06-04 22:19:40 +02:00
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
2010-06-18 18:39:21 +02:00
|
|
|
* in the file PATENTS. All contributing project authors may
|
2010-06-04 22:19:40 +02:00
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
2010-05-18 17:58:33 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <math.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <assert.h>
|
2012-01-13 01:55:44 +01:00
|
|
|
#include "vpx_config.h"
|
2012-11-09 02:09:30 +01:00
|
|
|
#include "vp8_rtcd.h"
|
2011-02-10 20:41:38 +01:00
|
|
|
#include "vp8/common/pragmas.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
#include "tokenize.h"
|
|
|
|
#include "treewriter.h"
|
|
|
|
#include "onyx_int.h"
|
|
|
|
#include "modecosts.h"
|
|
|
|
#include "encodeintra.h"
|
2012-05-24 16:44:03 +02:00
|
|
|
#include "pickinter.h"
|
2011-02-10 20:41:38 +01:00
|
|
|
#include "vp8/common/entropymode.h"
|
|
|
|
#include "vp8/common/reconinter.h"
|
|
|
|
#include "vp8/common/reconintra4x4.h"
|
|
|
|
#include "vp8/common/findnearmv.h"
|
2012-02-29 18:03:13 +01:00
|
|
|
#include "vp8/common/quant_common.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
#include "encodemb.h"
|
|
|
|
#include "quantize.h"
|
2012-03-06 01:50:33 +01:00
|
|
|
#include "vp8/common/variance.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
#include "mcomp.h"
|
2011-04-07 22:57:25 +02:00
|
|
|
#include "rdopt.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
#include "vpx_mem/vpx_mem.h"
|
2011-02-10 20:41:38 +01:00
|
|
|
#include "vp8/common/systemdependent.h"
|
2012-03-06 10:48:18 +01:00
|
|
|
#if CONFIG_TEMPORAL_DENOISING
|
|
|
|
#include "denoising.h"
|
|
|
|
#endif
|
2010-12-29 20:30:57 +01:00
|
|
|
extern void vp8_update_zbin_extra(VP8_COMP *cpi, MACROBLOCK *x);
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
#define MAXF(a,b) (((a) > (b)) ? (a) : (b))
|
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
typedef struct rate_distortion_struct
|
|
|
|
{
|
|
|
|
int rate2;
|
|
|
|
int rate_y;
|
|
|
|
int rate_uv;
|
|
|
|
int distortion2;
|
|
|
|
int distortion_uv;
|
|
|
|
} RATE_DISTORTION;
|
|
|
|
|
|
|
|
typedef struct best_mode_struct
|
|
|
|
{
|
|
|
|
int yrd;
|
|
|
|
int rd;
|
|
|
|
int intra_rd;
|
|
|
|
MB_MODE_INFO mbmode;
|
|
|
|
union b_mode_info bmodes[16];
|
|
|
|
PARTITION_INFO partition;
|
|
|
|
} BEST_MODE;
|
|
|
|
|
2011-03-17 22:07:59 +01:00
|
|
|
static const int auto_speed_thresh[17] =
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
1000,
|
|
|
|
200,
|
|
|
|
150,
|
|
|
|
130,
|
|
|
|
150,
|
|
|
|
125,
|
|
|
|
120,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
115,
|
|
|
|
105
|
|
|
|
};
|
|
|
|
|
|
|
|
const MB_PREDICTION_MODE vp8_mode_order[MAX_MODES] =
|
|
|
|
{
|
|
|
|
ZEROMV,
|
|
|
|
DC_PRED,
|
|
|
|
|
|
|
|
NEARESTMV,
|
|
|
|
NEARMV,
|
|
|
|
|
|
|
|
ZEROMV,
|
|
|
|
NEARESTMV,
|
|
|
|
|
|
|
|
ZEROMV,
|
|
|
|
NEARESTMV,
|
|
|
|
|
|
|
|
NEARMV,
|
|
|
|
NEARMV,
|
|
|
|
|
|
|
|
V_PRED,
|
|
|
|
H_PRED,
|
|
|
|
TM_PRED,
|
|
|
|
|
|
|
|
NEWMV,
|
|
|
|
NEWMV,
|
|
|
|
NEWMV,
|
|
|
|
|
|
|
|
SPLITMV,
|
|
|
|
SPLITMV,
|
|
|
|
SPLITMV,
|
|
|
|
|
|
|
|
B_PRED,
|
|
|
|
};
|
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
/* This table determines the search order in reference frame priority order,
|
|
|
|
* which may not necessarily match INTRA,LAST,GOLDEN,ARF
|
|
|
|
*/
|
|
|
|
const int vp8_ref_frame_order[MAX_MODES] =
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
1,
|
|
|
|
0,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
1,
|
|
|
|
1,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
2,
|
|
|
|
2,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
3,
|
|
|
|
3,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
2,
|
|
|
|
3,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
1,
|
|
|
|
2,
|
|
|
|
3,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
1,
|
|
|
|
2,
|
|
|
|
3,
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
0,
|
2010-05-18 17:58:33 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
static void fill_token_costs(
|
2012-04-17 09:40:56 +02:00
|
|
|
int c[BLOCK_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS][MAX_ENTROPY_TOKENS],
|
|
|
|
const vp8_prob p[BLOCK_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS][ENTROPY_NODES]
|
2010-05-18 17:58:33 +02:00
|
|
|
)
|
|
|
|
{
|
|
|
|
int i, j, k;
|
|
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < BLOCK_TYPES; i++)
|
|
|
|
for (j = 0; j < COEF_BANDS; j++)
|
|
|
|
for (k = 0; k < PREV_COEF_CONTEXTS; k++)
|
2012-04-17 09:40:56 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* check for pt=0 and band > 1 if block type 0
|
|
|
|
* and 0 if blocktype 1
|
|
|
|
*/
|
2012-04-17 09:40:56 +02:00
|
|
|
if (k == 0 && j > (i == 0))
|
|
|
|
vp8_cost_tokens2(c[i][j][k], p [i][j][k], vp8_coef_tree, 2);
|
2012-03-05 17:20:42 +01:00
|
|
|
else
|
2012-04-17 09:40:56 +02:00
|
|
|
vp8_cost_tokens(c[i][j][k], p [i][j][k], vp8_coef_tree);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2012-04-17 09:40:56 +02:00
|
|
|
static const int rd_iifactor[32] =
|
|
|
|
{
|
|
|
|
4, 4, 3, 2, 1, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0
|
|
|
|
};
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-24 04:59:12 +01:00
|
|
|
/* values are now correlated to quantizer */
|
2012-04-17 09:40:56 +02:00
|
|
|
static const int sad_per_bit16lut[QINDEX_RANGE] =
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-20 08:12:40 +02:00
|
|
|
2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
3, 3, 3, 3, 3, 3, 3, 3,
|
|
|
|
3, 3, 3, 3, 3, 3, 4, 4,
|
|
|
|
4, 4, 4, 4, 4, 4, 4, 4,
|
|
|
|
4, 4, 5, 5, 5, 5, 5, 5,
|
2010-12-24 04:59:12 +01:00
|
|
|
5, 5, 5, 5, 5, 5, 6, 6,
|
2011-05-20 08:12:40 +02:00
|
|
|
6, 6, 6, 6, 6, 6, 6, 6,
|
|
|
|
6, 6, 7, 7, 7, 7, 7, 7,
|
|
|
|
7, 7, 7, 7, 7, 7, 8, 8,
|
|
|
|
8, 8, 8, 8, 8, 8, 8, 8,
|
|
|
|
8, 8, 9, 9, 9, 9, 9, 9,
|
|
|
|
9, 9, 9, 9, 9, 9, 10, 10,
|
|
|
|
10, 10, 10, 10, 10, 10, 11, 11,
|
|
|
|
11, 11, 11, 11, 12, 12, 12, 12,
|
|
|
|
12, 12, 13, 13, 13, 13, 14, 14
|
2010-05-18 17:58:33 +02:00
|
|
|
};
|
2012-04-17 09:40:56 +02:00
|
|
|
static const int sad_per_bit4lut[QINDEX_RANGE] =
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-20 08:12:40 +02:00
|
|
|
2, 2, 2, 2, 2, 2, 3, 3,
|
|
|
|
3, 3, 3, 3, 3, 3, 3, 3,
|
|
|
|
3, 3, 3, 3, 4, 4, 4, 4,
|
|
|
|
4, 4, 4, 4, 4, 4, 5, 5,
|
|
|
|
5, 5, 5, 5, 6, 6, 6, 6,
|
|
|
|
6, 6, 6, 6, 6, 6, 6, 6,
|
|
|
|
7, 7, 7, 7, 7, 7, 7, 7,
|
2010-12-24 04:59:12 +01:00
|
|
|
7, 7, 7, 7, 7, 8, 8, 8,
|
2011-05-20 08:12:40 +02:00
|
|
|
8, 8, 9, 9, 9, 9, 9, 9,
|
|
|
|
10, 10, 10, 10, 10, 10, 10, 10,
|
|
|
|
11, 11, 11, 11, 11, 11, 11, 11,
|
|
|
|
12, 12, 12, 12, 12, 12, 12, 12,
|
|
|
|
13, 13, 13, 13, 13, 13, 13, 14,
|
|
|
|
14, 14, 14, 14, 15, 15, 15, 15,
|
|
|
|
16, 16, 16, 16, 17, 17, 17, 18,
|
|
|
|
18, 18, 19, 19, 19, 20, 20, 20,
|
2010-05-18 17:58:33 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
void vp8cx_initialize_me_consts(VP8_COMP *cpi, int QIndex)
|
|
|
|
{
|
2011-05-20 08:12:40 +02:00
|
|
|
cpi->mb.sadperbit16 = sad_per_bit16lut[QIndex];
|
|
|
|
cpi->mb.sadperbit4 = sad_per_bit4lut[QIndex];
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void vp8_initialize_rd_consts(VP8_COMP *cpi, int Qvalue)
|
|
|
|
{
|
|
|
|
int q;
|
|
|
|
int i;
|
2010-06-29 13:15:54 +02:00
|
|
|
double capped_q = (Qvalue < 160) ? (double)Qvalue : 160.0;
|
2012-03-06 17:47:12 +01:00
|
|
|
double rdconst = 2.80;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
vp8_clear_system_state();
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Further tests required to see if optimum is different
|
|
|
|
* for key frames, golden frames and arf frames.
|
|
|
|
*/
|
2010-06-29 13:15:54 +02:00
|
|
|
cpi->RDMULT = (int)(rdconst * (capped_q * capped_q));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Extend rate multiplier along side quantizer zbin increases */
|
2010-06-29 13:15:54 +02:00
|
|
|
if (cpi->zbin_over_quant > 0)
|
|
|
|
{
|
|
|
|
double oq_factor;
|
|
|
|
double modq;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Experimental code using the same basic equation as used for Q above
|
|
|
|
* The units of cpi->zbin_over_quant are 1/128 of Q bin size
|
|
|
|
*/
|
2010-06-29 13:15:54 +02:00
|
|
|
oq_factor = 1.0 + ((double)0.0015625 * cpi->zbin_over_quant);
|
|
|
|
modq = (int)((double)capped_q * oq_factor);
|
|
|
|
cpi->RDMULT = (int)(rdconst * (modq * modq));
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-06-07 18:34:46 +02:00
|
|
|
if (cpi->pass == 2 && (cpi->common.frame_type != KEY_FRAME))
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-19 23:16:39 +02:00
|
|
|
if (cpi->twopass.next_iiratio > 31)
|
2010-06-07 18:34:46 +02:00
|
|
|
cpi->RDMULT += (cpi->RDMULT * rd_iifactor[31]) >> 4;
|
2010-05-18 17:58:33 +02:00
|
|
|
else
|
2011-05-19 23:16:39 +02:00
|
|
|
cpi->RDMULT +=
|
|
|
|
(cpi->RDMULT * rd_iifactor[cpi->twopass.next_iiratio]) >> 4;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2011-06-21 01:30:26 +02:00
|
|
|
cpi->mb.errorperbit = (cpi->RDMULT / 110);
|
2011-01-26 07:24:22 +01:00
|
|
|
cpi->mb.errorperbit += (cpi->mb.errorperbit==0);
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
vp8_set_speed_features(cpi);
|
|
|
|
|
|
|
|
q = (int)pow(Qvalue, 1.25);
|
|
|
|
|
|
|
|
if (q < 8)
|
|
|
|
q = 8;
|
|
|
|
|
|
|
|
if (cpi->RDMULT > 1000)
|
|
|
|
{
|
|
|
|
cpi->RDDIV = 1;
|
|
|
|
cpi->RDMULT /= 100;
|
|
|
|
|
|
|
|
for (i = 0; i < MAX_MODES; i++)
|
|
|
|
{
|
|
|
|
if (cpi->sf.thresh_mult[i] < INT_MAX)
|
|
|
|
{
|
|
|
|
cpi->rd_threshes[i] = cpi->sf.thresh_mult[i] * q / 100;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
cpi->rd_threshes[i] = INT_MAX;
|
|
|
|
}
|
|
|
|
|
|
|
|
cpi->rd_baseline_thresh[i] = cpi->rd_threshes[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
cpi->RDDIV = 100;
|
|
|
|
|
|
|
|
for (i = 0; i < MAX_MODES; i++)
|
|
|
|
{
|
|
|
|
if (cpi->sf.thresh_mult[i] < (INT_MAX / q))
|
|
|
|
{
|
|
|
|
cpi->rd_threshes[i] = cpi->sf.thresh_mult[i] * q;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
cpi->rd_threshes[i] = INT_MAX;
|
|
|
|
}
|
|
|
|
|
|
|
|
cpi->rd_baseline_thresh[i] = cpi->rd_threshes[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-12-10 01:56:18 +01:00
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* build token cost array for the type of frame we have now */
|
2011-12-10 01:56:18 +01:00
|
|
|
FRAME_CONTEXT *l = &cpi->lfc_n;
|
|
|
|
|
|
|
|
if(cpi->common.refresh_alt_ref_frame)
|
|
|
|
l = &cpi->lfc_a;
|
|
|
|
else if(cpi->common.refresh_golden_frame)
|
|
|
|
l = &cpi->lfc_g;
|
|
|
|
|
|
|
|
fill_token_costs(
|
|
|
|
cpi->mb.token_costs,
|
|
|
|
(const vp8_prob( *)[8][3][11]) l->coef_probs
|
|
|
|
);
|
|
|
|
/*
|
|
|
|
fill_token_costs(
|
|
|
|
cpi->mb.token_costs,
|
|
|
|
(const vp8_prob( *)[8][3][11]) cpi->common.fc.coef_probs);
|
|
|
|
*/
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* TODO make these mode costs depend on last,alt or gold too. (jbb) */
|
2011-12-10 01:56:18 +01:00
|
|
|
vp8_init_mode_costs(cpi);
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void vp8_auto_select_speed(VP8_COMP *cpi)
|
|
|
|
{
|
2011-11-11 19:47:20 +01:00
|
|
|
int milliseconds_for_compress = (int)(1000000 / cpi->frame_rate);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
milliseconds_for_compress = milliseconds_for_compress * (16 - cpi->oxcf.cpu_used) / 16;
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
|
|
|
|
if (0)
|
|
|
|
{
|
|
|
|
FILE *f;
|
|
|
|
|
|
|
|
f = fopen("speed.stt", "a");
|
|
|
|
fprintf(f, " %8ld %10ld %10ld %10ld\n",
|
|
|
|
cpi->common.current_video_frame, cpi->Speed, milliseconds_for_compress, cpi->avg_pick_mode_time);
|
|
|
|
fclose(f);
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (cpi->avg_pick_mode_time < milliseconds_for_compress && (cpi->avg_encode_time - cpi->avg_pick_mode_time) < milliseconds_for_compress)
|
|
|
|
{
|
|
|
|
if (cpi->avg_pick_mode_time == 0)
|
|
|
|
{
|
|
|
|
cpi->Speed = 4;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (milliseconds_for_compress * 100 < cpi->avg_encode_time * 95)
|
|
|
|
{
|
|
|
|
cpi->Speed += 2;
|
|
|
|
cpi->avg_pick_mode_time = 0;
|
|
|
|
cpi->avg_encode_time = 0;
|
|
|
|
|
|
|
|
if (cpi->Speed > 16)
|
|
|
|
{
|
|
|
|
cpi->Speed = 16;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-03-17 22:07:59 +01:00
|
|
|
if (milliseconds_for_compress * 100 > cpi->avg_encode_time * auto_speed_thresh[cpi->Speed])
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
cpi->Speed -= 1;
|
|
|
|
cpi->avg_pick_mode_time = 0;
|
|
|
|
cpi->avg_encode_time = 0;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* In real-time mode, cpi->speed is in [4, 16]. */
|
|
|
|
if (cpi->Speed < 4)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
cpi->Speed = 4;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
cpi->Speed += 4;
|
|
|
|
|
|
|
|
if (cpi->Speed > 16)
|
|
|
|
cpi->Speed = 16;
|
|
|
|
|
|
|
|
|
|
|
|
cpi->avg_pick_mode_time = 0;
|
|
|
|
cpi->avg_encode_time = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int vp8_block_error_c(short *coeff, short *dqcoeff)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
{
|
|
|
|
int this_diff = coeff[i] - dqcoeff[i];
|
|
|
|
error += this_diff * this_diff;
|
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
int vp8_mbblock_error_c(MACROBLOCK *mb, int dc)
|
|
|
|
{
|
|
|
|
BLOCK *be;
|
|
|
|
BLOCKD *bd;
|
|
|
|
int i, j;
|
|
|
|
int berror, error = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
{
|
|
|
|
be = &mb->block[i];
|
|
|
|
bd = &mb->e_mbd.block[i];
|
|
|
|
|
|
|
|
berror = 0;
|
|
|
|
|
|
|
|
for (j = dc; j < 16; j++)
|
|
|
|
{
|
|
|
|
int this_diff = be->coeff[j] - bd->dqcoeff[j];
|
|
|
|
berror += this_diff * this_diff;
|
|
|
|
}
|
|
|
|
|
|
|
|
error += berror;
|
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
int vp8_mbuverror_c(MACROBLOCK *mb)
|
|
|
|
{
|
|
|
|
|
|
|
|
BLOCK *be;
|
|
|
|
BLOCKD *bd;
|
|
|
|
|
|
|
|
|
|
|
|
int i;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
for (i = 16; i < 24; i++)
|
|
|
|
{
|
|
|
|
be = &mb->block[i];
|
|
|
|
bd = &mb->e_mbd.block[i];
|
|
|
|
|
|
|
|
error += vp8_block_error_c(be->coeff, bd->dqcoeff);
|
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2012-01-13 01:55:44 +01:00
|
|
|
int VP8_UVSSE(MACROBLOCK *x)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
unsigned char *uptr, *vptr;
|
|
|
|
unsigned char *upred_ptr = (*(x->block[16].base_src) + x->block[16].src);
|
|
|
|
unsigned char *vpred_ptr = (*(x->block[20].base_src) + x->block[20].src);
|
|
|
|
int uv_stride = x->block[16].src_stride;
|
|
|
|
|
|
|
|
unsigned int sse1 = 0;
|
|
|
|
unsigned int sse2 = 0;
|
2011-08-24 20:42:26 +02:00
|
|
|
int mv_row = x->e_mbd.mode_info_context->mbmi.mv.as_mv.row;
|
|
|
|
int mv_col = x->e_mbd.mode_info_context->mbmi.mv.as_mv.col;
|
2010-05-18 17:58:33 +02:00
|
|
|
int offset;
|
2012-01-20 19:52:16 +01:00
|
|
|
int pre_stride = x->e_mbd.pre.uv_stride;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-08-24 20:42:26 +02:00
|
|
|
if (mv_row < 0)
|
|
|
|
mv_row -= 1;
|
|
|
|
else
|
|
|
|
mv_row += 1;
|
|
|
|
|
|
|
|
if (mv_col < 0)
|
|
|
|
mv_col -= 1;
|
|
|
|
else
|
|
|
|
mv_col += 1;
|
|
|
|
|
|
|
|
mv_row /= 2;
|
|
|
|
mv_col /= 2;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
offset = (mv_row >> 3) * pre_stride + (mv_col >> 3);
|
|
|
|
uptr = x->e_mbd.pre.u_buffer + offset;
|
|
|
|
vptr = x->e_mbd.pre.v_buffer + offset;
|
|
|
|
|
|
|
|
if ((mv_row | mv_col) & 7)
|
|
|
|
{
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_sub_pixel_variance8x8(uptr, pre_stride,
|
2011-05-22 06:51:21 +02:00
|
|
|
mv_col & 7, mv_row & 7, upred_ptr, uv_stride, &sse2);
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_sub_pixel_variance8x8(vptr, pre_stride,
|
2011-05-22 06:51:21 +02:00
|
|
|
mv_col & 7, mv_row & 7, vpred_ptr, uv_stride, &sse1);
|
2010-05-18 17:58:33 +02:00
|
|
|
sse2 += sse1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_variance8x8(uptr, pre_stride,
|
2011-05-25 11:54:34 +02:00
|
|
|
upred_ptr, uv_stride, &sse2);
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_variance8x8(vptr, pre_stride,
|
2011-05-25 11:54:34 +02:00
|
|
|
vpred_ptr, uv_stride, &sse1);
|
2010-05-18 17:58:33 +02:00
|
|
|
sse2 += sse1;
|
|
|
|
}
|
|
|
|
return sse2;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cost_coeffs(MACROBLOCK *mb, BLOCKD *b, int type, ENTROPY_CONTEXT *a, ENTROPY_CONTEXT *l)
|
|
|
|
{
|
|
|
|
int c = !type; /* start at coef 0, unless Y with Y2 */
|
2011-10-25 13:25:11 +02:00
|
|
|
int eob = (int)(*b->eob);
|
2010-05-18 17:58:33 +02:00
|
|
|
int pt ; /* surrounding block/prev coef predictor */
|
|
|
|
int cost = 0;
|
|
|
|
short *qcoeff_ptr = b->qcoeff;
|
|
|
|
|
|
|
|
VP8_COMBINEENTROPYCONTEXTS(pt, *a, *l);
|
|
|
|
|
|
|
|
# define QC( I) ( qcoeff_ptr [vp8_default_zig_zag1d[I]] )
|
|
|
|
|
|
|
|
for (; c < eob; c++)
|
|
|
|
{
|
|
|
|
int v = QC(c);
|
|
|
|
int t = vp8_dct_value_tokens_ptr[v].Token;
|
|
|
|
cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [t];
|
|
|
|
cost += vp8_dct_value_cost_ptr[v];
|
|
|
|
pt = vp8_prev_token_class[t];
|
|
|
|
}
|
|
|
|
|
|
|
|
# undef QC
|
|
|
|
|
|
|
|
if (c < 16)
|
|
|
|
cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [DCT_EOB_TOKEN];
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
pt = (c != !type); /* is eob first coefficient; */
|
2010-05-18 17:58:33 +02:00
|
|
|
*a = *l = pt;
|
|
|
|
|
|
|
|
return cost;
|
|
|
|
}
|
|
|
|
|
2010-11-17 19:15:13 +01:00
|
|
|
static int vp8_rdcost_mby(MACROBLOCK *mb)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
int cost = 0;
|
|
|
|
int b;
|
|
|
|
MACROBLOCKD *x = &mb->e_mbd;
|
2010-08-31 16:49:57 +02:00
|
|
|
ENTROPY_CONTEXT_PLANES t_above, t_left;
|
|
|
|
ENTROPY_CONTEXT *ta;
|
|
|
|
ENTROPY_CONTEXT *tl;
|
|
|
|
|
|
|
|
vpx_memcpy(&t_above, mb->e_mbd.above_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
vpx_memcpy(&t_left, mb->e_mbd.left_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-08-31 16:49:57 +02:00
|
|
|
ta = (ENTROPY_CONTEXT *)&t_above;
|
|
|
|
tl = (ENTROPY_CONTEXT *)&t_left;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
for (b = 0; b < 16; b++)
|
2011-02-23 22:37:08 +01:00
|
|
|
cost += cost_coeffs(mb, x->block + b, PLANE_TYPE_Y_NO_DC,
|
2010-08-31 16:49:57 +02:00
|
|
|
ta + vp8_block2above[b], tl + vp8_block2left[b]);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-02-23 22:37:08 +01:00
|
|
|
cost += cost_coeffs(mb, x->block + 24, PLANE_TYPE_Y2,
|
2010-11-17 19:15:13 +01:00
|
|
|
ta + vp8_block2above[24], tl + vp8_block2left[24]);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
return cost;
|
|
|
|
}
|
|
|
|
|
2011-01-26 19:46:34 +01:00
|
|
|
static void macro_block_yrd( MACROBLOCK *mb,
|
|
|
|
int *Rate,
|
2012-01-13 01:55:44 +01:00
|
|
|
int *Distortion)
|
2011-01-26 19:46:34 +01:00
|
|
|
{
|
|
|
|
int b;
|
|
|
|
MACROBLOCKD *const x = &mb->e_mbd;
|
|
|
|
BLOCK *const mb_y2 = mb->block + 24;
|
|
|
|
BLOCKD *const x_y2 = x->block + 24;
|
|
|
|
short *Y2DCPtr = mb_y2->src_diff;
|
|
|
|
BLOCK *beptr;
|
|
|
|
int d;
|
|
|
|
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_subtract_mby( mb->src_diff, *(mb->block[0].base_src),
|
2011-11-15 18:53:01 +01:00
|
|
|
mb->block[0].src_stride, mb->e_mbd.predictor, 16);
|
2011-01-26 19:46:34 +01:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Fdct and building the 2nd order block */
|
2011-01-26 19:46:34 +01:00
|
|
|
for (beptr = mb->block; beptr < mb->block + 16; beptr += 2)
|
|
|
|
{
|
2012-01-13 01:55:44 +01:00
|
|
|
mb->short_fdct8x4(beptr->src_diff, beptr->coeff, 32);
|
2011-01-26 19:46:34 +01:00
|
|
|
*Y2DCPtr++ = beptr->coeff[0];
|
|
|
|
*Y2DCPtr++ = beptr->coeff[16];
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* 2nd order fdct */
|
2011-01-26 19:46:34 +01:00
|
|
|
mb->short_walsh4x4(mb_y2->src_diff, mb_y2->coeff, 8);
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Quantization */
|
2011-01-26 19:46:34 +01:00
|
|
|
for (b = 0; b < 16; b++)
|
|
|
|
{
|
|
|
|
mb->quantize_b(&mb->block[b], &mb->e_mbd.block[b]);
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* DC predication and Quantization of 2nd Order block */
|
2011-01-26 19:46:34 +01:00
|
|
|
mb->quantize_b(mb_y2, x_y2);
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Distortion */
|
2012-01-13 01:55:44 +01:00
|
|
|
d = vp8_mbblock_error(mb, 1) << 2;
|
|
|
|
d += vp8_block_error(mb_y2->coeff, x_y2->dqcoeff);
|
2011-01-26 19:46:34 +01:00
|
|
|
|
|
|
|
*Distortion = (d >> 4);
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* rate */
|
2011-01-26 19:46:34 +01:00
|
|
|
*Rate = vp8_rdcost_mby(mb);
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-02-24 19:31:47 +01:00
|
|
|
static void copy_predictor(unsigned char *dst, const unsigned char *predictor)
|
2011-02-14 19:32:58 +01:00
|
|
|
{
|
2011-02-24 19:31:47 +01:00
|
|
|
const unsigned int *p = (const unsigned int *)predictor;
|
|
|
|
unsigned int *d = (unsigned int *)dst;
|
|
|
|
d[0] = p[0];
|
|
|
|
d[4] = p[4];
|
|
|
|
d[8] = p[8];
|
|
|
|
d[12] = p[12];
|
2011-02-14 19:32:58 +01:00
|
|
|
}
|
2011-02-08 22:50:43 +01:00
|
|
|
static int rd_pick_intra4x4block(
|
2010-05-18 17:58:33 +02:00
|
|
|
VP8_COMP *cpi,
|
|
|
|
MACROBLOCK *x,
|
|
|
|
BLOCK *be,
|
|
|
|
BLOCKD *b,
|
|
|
|
B_PREDICTION_MODE *best_mode,
|
2012-04-17 09:40:56 +02:00
|
|
|
const int *bmode_costs,
|
2010-05-18 17:58:33 +02:00
|
|
|
ENTROPY_CONTEXT *a,
|
|
|
|
ENTROPY_CONTEXT *l,
|
|
|
|
|
|
|
|
int *bestrate,
|
|
|
|
int *bestratey,
|
|
|
|
int *bestdistortion)
|
|
|
|
{
|
|
|
|
B_PREDICTION_MODE mode;
|
2011-02-14 19:32:58 +01:00
|
|
|
int best_rd = INT_MAX;
|
2010-05-18 17:58:33 +02:00
|
|
|
int rate = 0;
|
|
|
|
int distortion;
|
|
|
|
|
|
|
|
ENTROPY_CONTEXT ta = *a, tempa = *a;
|
|
|
|
ENTROPY_CONTEXT tl = *l, templ = *l;
|
2011-02-24 19:31:47 +01:00
|
|
|
/*
|
|
|
|
* The predictor buffer is a 2d buffer with a stride of 16. Create
|
|
|
|
* a temp buffer that meets the stride requirements, but we are only
|
|
|
|
* interested in the left 4x4 block
|
|
|
|
* */
|
|
|
|
DECLARE_ALIGNED_ARRAY(16, unsigned char, best_predictor, 16*4);
|
|
|
|
DECLARE_ALIGNED_ARRAY(16, short, best_dqcoeff, 16);
|
2012-01-20 19:52:16 +01:00
|
|
|
int dst_stride = x->e_mbd.dst.y_stride;
|
2012-07-31 23:21:55 +02:00
|
|
|
unsigned char *dst = x->e_mbd.dst.y_buffer + b->offset;
|
|
|
|
|
|
|
|
unsigned char *Above = dst - dst_stride;
|
|
|
|
unsigned char *yleft = dst - 1;
|
|
|
|
unsigned char top_left = Above[-1];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
for (mode = B_DC_PRED; mode <= B_HU_PRED; mode++)
|
|
|
|
{
|
|
|
|
int this_rd;
|
|
|
|
int ratey;
|
|
|
|
|
2011-02-14 19:32:58 +01:00
|
|
|
rate = bmode_costs[mode];
|
|
|
|
|
2012-08-01 20:17:57 +02:00
|
|
|
vp8_intra4x4_predict(Above, yleft, dst_stride, mode,
|
|
|
|
b->predictor, 16, top_left);
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_subtract_b(be, b, 16);
|
2012-01-13 01:55:44 +01:00
|
|
|
x->short_fdct4x4(be->src_diff, be->coeff, 32);
|
2011-02-14 19:32:58 +01:00
|
|
|
x->quantize_b(be, b);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
tempa = ta;
|
|
|
|
templ = tl;
|
|
|
|
|
2011-02-23 22:37:08 +01:00
|
|
|
ratey = cost_coeffs(x, b, PLANE_TYPE_Y_WITH_DC, &tempa, &templ);
|
2010-05-18 17:58:33 +02:00
|
|
|
rate += ratey;
|
2012-01-13 01:55:44 +01:00
|
|
|
distortion = vp8_block_error(be->coeff, b->dqcoeff) >> 2;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
this_rd = RDCOST(x->rdmult, x->rddiv, rate, distortion);
|
|
|
|
|
|
|
|
if (this_rd < best_rd)
|
|
|
|
{
|
|
|
|
*bestrate = rate;
|
|
|
|
*bestratey = ratey;
|
|
|
|
*bestdistortion = distortion;
|
|
|
|
best_rd = this_rd;
|
|
|
|
*best_mode = mode;
|
|
|
|
*a = tempa;
|
|
|
|
*l = templ;
|
2011-02-24 19:31:47 +01:00
|
|
|
copy_predictor(best_predictor, b->predictor);
|
|
|
|
vpx_memcpy(best_dqcoeff, b->dqcoeff, 32);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
2012-08-02 23:26:04 +02:00
|
|
|
b->bmi.as_mode = *best_mode;
|
2011-02-14 19:32:58 +01:00
|
|
|
|
2012-07-31 23:21:55 +02:00
|
|
|
vp8_short_idct4x4llm(best_dqcoeff, best_predictor, 16, dst, dst_stride);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-02-08 22:50:43 +01:00
|
|
|
return best_rd;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2011-06-08 18:05:05 +02:00
|
|
|
static int rd_pick_intra4x4mby_modes(VP8_COMP *cpi, MACROBLOCK *mb, int *Rate,
|
|
|
|
int *rate_y, int *Distortion, int best_rd)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
MACROBLOCKD *const xd = &mb->e_mbd;
|
|
|
|
int i;
|
|
|
|
int cost = mb->mbmode_cost [xd->frame_type] [B_PRED];
|
|
|
|
int distortion = 0;
|
|
|
|
int tot_rate_y = 0;
|
2011-07-26 03:44:59 +02:00
|
|
|
int64_t total_rd = 0;
|
2010-08-31 16:49:57 +02:00
|
|
|
ENTROPY_CONTEXT_PLANES t_above, t_left;
|
|
|
|
ENTROPY_CONTEXT *ta;
|
|
|
|
ENTROPY_CONTEXT *tl;
|
2012-04-17 09:40:56 +02:00
|
|
|
const int *bmode_costs;
|
2010-08-31 16:49:57 +02:00
|
|
|
|
|
|
|
vpx_memcpy(&t_above, mb->e_mbd.above_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
vpx_memcpy(&t_left, mb->e_mbd.left_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
|
|
|
|
ta = (ENTROPY_CONTEXT *)&t_above;
|
|
|
|
tl = (ENTROPY_CONTEXT *)&t_left;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-02-28 20:12:30 +01:00
|
|
|
intra_prediction_down_copy(xd, xd->dst.y_buffer - xd->dst.y_stride + 16);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-02-14 19:32:58 +01:00
|
|
|
bmode_costs = mb->inter_bmode_costs;
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
{
|
|
|
|
MODE_INFO *const mic = xd->mode_info_context;
|
|
|
|
const int mis = xd->mode_info_stride;
|
|
|
|
B_PREDICTION_MODE UNINITIALIZED_IS_SAFE(best_mode);
|
|
|
|
int UNINITIALIZED_IS_SAFE(r), UNINITIALIZED_IS_SAFE(ry), UNINITIALIZED_IS_SAFE(d);
|
|
|
|
|
2011-02-14 19:32:58 +01:00
|
|
|
if (mb->e_mbd.frame_type == KEY_FRAME)
|
|
|
|
{
|
2011-05-24 19:24:52 +02:00
|
|
|
const B_PREDICTION_MODE A = above_block_mode(mic, i, mis);
|
|
|
|
const B_PREDICTION_MODE L = left_block_mode(mic, i);
|
2011-02-14 19:32:58 +01:00
|
|
|
|
|
|
|
bmode_costs = mb->bmode_costs[A][L];
|
|
|
|
}
|
|
|
|
|
2011-02-08 22:50:43 +01:00
|
|
|
total_rd += rd_pick_intra4x4block(
|
2011-02-14 19:32:58 +01:00
|
|
|
cpi, mb, mb->block + i, xd->block + i, &best_mode, bmode_costs,
|
2010-08-31 16:49:57 +02:00
|
|
|
ta + vp8_block2above[i],
|
|
|
|
tl + vp8_block2left[i], &r, &ry, &d);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
cost += r;
|
|
|
|
distortion += d;
|
|
|
|
tot_rate_y += ry;
|
2011-05-24 19:24:52 +02:00
|
|
|
|
|
|
|
mic->bmi[i].as_mode = best_mode;
|
2011-02-08 22:50:43 +01:00
|
|
|
|
2011-07-26 03:44:59 +02:00
|
|
|
if(total_rd >= (int64_t)best_rd)
|
2011-02-24 19:31:47 +01:00
|
|
|
break;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2011-07-26 03:44:59 +02:00
|
|
|
if(total_rd >= (int64_t)best_rd)
|
2011-02-24 19:31:47 +01:00
|
|
|
return INT_MAX;
|
2011-02-08 22:50:43 +01:00
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
*Rate = cost;
|
2012-03-14 18:10:30 +01:00
|
|
|
*rate_y = tot_rate_y;
|
2010-05-18 17:58:33 +02:00
|
|
|
*Distortion = distortion;
|
|
|
|
|
|
|
|
return RDCOST(mb->rdmult, mb->rddiv, cost, distortion);
|
|
|
|
}
|
2011-06-08 18:05:05 +02:00
|
|
|
|
|
|
|
|
|
|
|
static int rd_pick_intra16x16mby_mode(VP8_COMP *cpi,
|
|
|
|
MACROBLOCK *x,
|
|
|
|
int *Rate,
|
|
|
|
int *rate_y,
|
|
|
|
int *Distortion)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
MB_PREDICTION_MODE mode;
|
|
|
|
MB_PREDICTION_MODE UNINITIALIZED_IS_SAFE(mode_selected);
|
|
|
|
int rate, ratey;
|
2011-01-27 17:50:29 +01:00
|
|
|
int distortion;
|
2010-05-18 17:58:33 +02:00
|
|
|
int best_rd = INT_MAX;
|
2011-01-26 19:46:34 +01:00
|
|
|
int this_rd;
|
2012-03-20 20:11:42 +01:00
|
|
|
MACROBLOCKD *xd = &x->e_mbd;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Y Search for 16x16 intra prediction mode */
|
2010-05-18 17:58:33 +02:00
|
|
|
for (mode = DC_PRED; mode <= TM_PRED; mode++)
|
|
|
|
{
|
2012-03-20 20:11:42 +01:00
|
|
|
xd->mode_info_context->mbmi.mode = mode;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-03-20 20:11:42 +01:00
|
|
|
vp8_build_intra_predictors_mby_s(xd,
|
|
|
|
xd->dst.y_buffer - xd->dst.y_stride,
|
|
|
|
xd->dst.y_buffer - 1,
|
|
|
|
xd->dst.y_stride,
|
|
|
|
xd->predictor,
|
|
|
|
16);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-01-13 01:55:44 +01:00
|
|
|
macro_block_yrd(x, &ratey, &distortion);
|
2012-03-20 20:11:42 +01:00
|
|
|
rate = ratey + x->mbmode_cost[xd->frame_type]
|
|
|
|
[xd->mode_info_context->mbmi.mode];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
this_rd = RDCOST(x->rdmult, x->rddiv, rate, distortion);
|
|
|
|
|
|
|
|
if (this_rd < best_rd)
|
|
|
|
{
|
|
|
|
mode_selected = mode;
|
|
|
|
best_rd = this_rd;
|
|
|
|
*Rate = rate;
|
|
|
|
*rate_y = ratey;
|
2011-01-27 17:50:29 +01:00
|
|
|
*Distortion = distortion;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-20 20:11:42 +01:00
|
|
|
xd->mode_info_context->mbmi.mode = mode_selected;
|
2010-05-18 17:58:33 +02:00
|
|
|
return best_rd;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int rd_cost_mbuv(MACROBLOCK *mb)
|
|
|
|
{
|
|
|
|
int b;
|
|
|
|
int cost = 0;
|
|
|
|
MACROBLOCKD *x = &mb->e_mbd;
|
2010-08-31 16:49:57 +02:00
|
|
|
ENTROPY_CONTEXT_PLANES t_above, t_left;
|
|
|
|
ENTROPY_CONTEXT *ta;
|
|
|
|
ENTROPY_CONTEXT *tl;
|
|
|
|
|
|
|
|
vpx_memcpy(&t_above, mb->e_mbd.above_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
vpx_memcpy(&t_left, mb->e_mbd.left_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-08-31 16:49:57 +02:00
|
|
|
ta = (ENTROPY_CONTEXT *)&t_above;
|
|
|
|
tl = (ENTROPY_CONTEXT *)&t_left;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-02-23 22:37:08 +01:00
|
|
|
for (b = 16; b < 24; b++)
|
|
|
|
cost += cost_coeffs(mb, x->block + b, PLANE_TYPE_UV,
|
2010-08-31 16:49:57 +02:00
|
|
|
ta + vp8_block2above[b], tl + vp8_block2left[b]);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
return cost;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-08-24 20:42:26 +02:00
|
|
|
static int rd_inter16x16_uv(VP8_COMP *cpi, MACROBLOCK *x, int *rate,
|
|
|
|
int *distortion, int fullpixel)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-08-24 20:42:26 +02:00
|
|
|
vp8_build_inter16x16_predictors_mbuv(&x->e_mbd);
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_subtract_mbuv(x->src_diff,
|
2011-11-15 18:53:01 +01:00
|
|
|
x->src.u_buffer, x->src.v_buffer, x->src.uv_stride,
|
|
|
|
&x->e_mbd.predictor[256], &x->e_mbd.predictor[320], 8);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-08-24 20:42:26 +02:00
|
|
|
vp8_transform_mbuv(x);
|
|
|
|
vp8_quantize_mbuv(x);
|
|
|
|
|
|
|
|
*rate = rd_cost_mbuv(x);
|
2012-01-13 01:55:44 +01:00
|
|
|
*distortion = vp8_mbuverror(x) / 4;
|
2011-08-24 20:42:26 +02:00
|
|
|
|
|
|
|
return RDCOST(x->rdmult, x->rddiv, *rate, *distortion);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int rd_inter4x4_uv(VP8_COMP *cpi, MACROBLOCK *x, int *rate,
|
|
|
|
int *distortion, int fullpixel)
|
|
|
|
{
|
|
|
|
vp8_build_inter4x4_predictors_mbuv(&x->e_mbd);
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_subtract_mbuv(x->src_diff,
|
2011-11-15 18:53:01 +01:00
|
|
|
x->src.u_buffer, x->src.v_buffer, x->src.uv_stride,
|
|
|
|
&x->e_mbd.predictor[256], &x->e_mbd.predictor[320], 8);
|
2011-08-24 20:42:26 +02:00
|
|
|
|
|
|
|
vp8_transform_mbuv(x);
|
|
|
|
vp8_quantize_mbuv(x);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
*rate = rd_cost_mbuv(x);
|
2012-01-13 01:55:44 +01:00
|
|
|
*distortion = vp8_mbuverror(x) / 4;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-01-07 15:41:13 +01:00
|
|
|
return RDCOST(x->rdmult, x->rddiv, *rate, *distortion);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2011-06-08 18:05:05 +02:00
|
|
|
static void rd_pick_intra_mbuv_mode(VP8_COMP *cpi, MACROBLOCK *x, int *rate, int *rate_tokenonly, int *distortion)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
MB_PREDICTION_MODE mode;
|
|
|
|
MB_PREDICTION_MODE UNINITIALIZED_IS_SAFE(mode_selected);
|
|
|
|
int best_rd = INT_MAX;
|
|
|
|
int UNINITIALIZED_IS_SAFE(d), UNINITIALIZED_IS_SAFE(r);
|
|
|
|
int rate_to;
|
2012-03-20 20:11:42 +01:00
|
|
|
MACROBLOCKD *xd = &x->e_mbd;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
for (mode = DC_PRED; mode <= TM_PRED; mode++)
|
|
|
|
{
|
|
|
|
int rate;
|
|
|
|
int distortion;
|
|
|
|
int this_rd;
|
|
|
|
|
2012-03-20 20:11:42 +01:00
|
|
|
xd->mode_info_context->mbmi.uv_mode = mode;
|
|
|
|
|
|
|
|
vp8_build_intra_predictors_mbuv_s(xd,
|
|
|
|
xd->dst.u_buffer - xd->dst.uv_stride,
|
|
|
|
xd->dst.v_buffer - xd->dst.uv_stride,
|
|
|
|
xd->dst.u_buffer - 1,
|
|
|
|
xd->dst.v_buffer - 1,
|
|
|
|
xd->dst.uv_stride,
|
|
|
|
&xd->predictor[256], &xd->predictor[320],
|
|
|
|
8);
|
|
|
|
|
|
|
|
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_subtract_mbuv(x->src_diff,
|
2011-11-15 18:53:01 +01:00
|
|
|
x->src.u_buffer, x->src.v_buffer, x->src.uv_stride,
|
2012-03-20 20:11:42 +01:00
|
|
|
&xd->predictor[256], &xd->predictor[320], 8);
|
2011-02-14 22:34:33 +01:00
|
|
|
vp8_transform_mbuv(x);
|
|
|
|
vp8_quantize_mbuv(x);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
rate_to = rd_cost_mbuv(x);
|
2012-03-20 20:11:42 +01:00
|
|
|
rate = rate_to + x->intra_uv_mode_cost[xd->frame_type][xd->mode_info_context->mbmi.uv_mode];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-01-13 01:55:44 +01:00
|
|
|
distortion = vp8_mbuverror(x) / 4;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-01-07 15:41:13 +01:00
|
|
|
this_rd = RDCOST(x->rdmult, x->rddiv, rate, distortion);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
if (this_rd < best_rd)
|
|
|
|
{
|
|
|
|
best_rd = this_rd;
|
|
|
|
d = distortion;
|
|
|
|
r = rate;
|
|
|
|
*rate_tokenonly = rate_to;
|
|
|
|
mode_selected = mode;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*rate = r;
|
|
|
|
*distortion = d;
|
|
|
|
|
2012-03-20 20:11:42 +01:00
|
|
|
xd->mode_info_context->mbmi.uv_mode = mode_selected;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int vp8_cost_mv_ref(MB_PREDICTION_MODE m, const int near_mv_ref_ct[4])
|
|
|
|
{
|
|
|
|
vp8_prob p [VP8_MVREFS-1];
|
|
|
|
assert(NEARESTMV <= m && m <= SPLITMV);
|
|
|
|
vp8_mv_ref_probs(p, near_mv_ref_ct);
|
2010-08-09 19:27:26 +02:00
|
|
|
return vp8_cost_token(vp8_mv_ref_tree, p,
|
|
|
|
vp8_mv_ref_encoding_array - NEARESTMV + m);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2011-05-12 16:50:16 +02:00
|
|
|
void vp8_set_mbmode_and_mvs(MACROBLOCK *x, MB_PREDICTION_MODE mb, int_mv *mv)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2010-08-12 22:25:43 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.mode = mb;
|
2011-05-12 16:50:16 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.mv.as_int = mv->as_int;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int labels2mode(
|
|
|
|
MACROBLOCK *x,
|
|
|
|
int const *labelings, int which_label,
|
|
|
|
B_PREDICTION_MODE this_mode,
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv *this_mv, int_mv *best_ref_mv,
|
2010-05-18 17:58:33 +02:00
|
|
|
int *mvcost[2]
|
|
|
|
)
|
|
|
|
{
|
|
|
|
MACROBLOCKD *const xd = & x->e_mbd;
|
|
|
|
MODE_INFO *const mic = xd->mode_info_context;
|
|
|
|
const int mis = xd->mode_info_stride;
|
|
|
|
|
|
|
|
int cost = 0;
|
|
|
|
int thismvcost = 0;
|
|
|
|
|
|
|
|
/* We have to be careful retrieving previously-encoded motion vectors.
|
|
|
|
Ones from this macroblock have to be pulled from the BLOCKD array
|
|
|
|
as they have not yet made it to the bmi array in our MB_MODE_INFO. */
|
|
|
|
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
do
|
|
|
|
{
|
|
|
|
BLOCKD *const d = xd->block + i;
|
|
|
|
const int row = i >> 2, col = i & 3;
|
|
|
|
|
|
|
|
B_PREDICTION_MODE m;
|
|
|
|
|
|
|
|
if (labelings[i] != which_label)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (col && labelings[i] == labelings[i-1])
|
|
|
|
m = LEFT4X4;
|
|
|
|
else if (row && labelings[i] == labelings[i-4])
|
|
|
|
m = ABOVE4X4;
|
|
|
|
else
|
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* the only time we should do costing for new motion vector
|
|
|
|
* or mode is when we are on a new label (jbb May 08, 2007)
|
|
|
|
*/
|
2010-05-18 17:58:33 +02:00
|
|
|
switch (m = this_mode)
|
|
|
|
{
|
|
|
|
case NEW4X4 :
|
|
|
|
thismvcost = vp8_mv_bit_cost(this_mv, best_ref_mv, mvcost, 102);
|
|
|
|
break;
|
|
|
|
case LEFT4X4:
|
2011-05-24 19:24:52 +02:00
|
|
|
this_mv->as_int = col ? d[-1].bmi.mv.as_int : left_block_mv(mic, i);
|
2010-05-18 17:58:33 +02:00
|
|
|
break;
|
|
|
|
case ABOVE4X4:
|
2011-05-24 19:24:52 +02:00
|
|
|
this_mv->as_int = row ? d[-4].bmi.mv.as_int : above_block_mv(mic, i, mis);
|
2010-05-18 17:58:33 +02:00
|
|
|
break;
|
|
|
|
case ZERO4X4:
|
2011-05-12 16:50:16 +02:00
|
|
|
this_mv->as_int = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
if (m == ABOVE4X4) /* replace above with left if same */
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv left_mv;
|
2011-05-24 19:24:52 +02:00
|
|
|
|
2011-05-12 16:50:16 +02:00
|
|
|
left_mv.as_int = col ? d[-1].bmi.mv.as_int :
|
2011-05-24 19:24:52 +02:00
|
|
|
left_block_mv(mic, i);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-12 16:50:16 +02:00
|
|
|
if (left_mv.as_int == this_mv->as_int)
|
2010-05-18 17:58:33 +02:00
|
|
|
m = LEFT4X4;
|
|
|
|
}
|
|
|
|
|
|
|
|
cost = x->inter_bmode_costs[ m];
|
|
|
|
}
|
|
|
|
|
2011-05-12 16:50:16 +02:00
|
|
|
d->bmi.mv.as_int = this_mv->as_int;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-19 21:03:36 +02:00
|
|
|
x->partition_info->bmi[i].mode = m;
|
|
|
|
x->partition_info->bmi[i].mv.as_int = this_mv->as_int;
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
while (++i < 16);
|
|
|
|
|
|
|
|
cost += thismvcost ;
|
|
|
|
return cost;
|
|
|
|
}
|
|
|
|
|
2010-08-31 16:49:57 +02:00
|
|
|
static int rdcost_mbsegment_y(MACROBLOCK *mb, const int *labels,
|
|
|
|
int which_label, ENTROPY_CONTEXT *ta,
|
|
|
|
ENTROPY_CONTEXT *tl)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
int cost = 0;
|
|
|
|
int b;
|
|
|
|
MACROBLOCKD *x = &mb->e_mbd;
|
|
|
|
|
|
|
|
for (b = 0; b < 16; b++)
|
|
|
|
if (labels[ b] == which_label)
|
2011-02-23 22:37:08 +01:00
|
|
|
cost += cost_coeffs(mb, x->block + b, PLANE_TYPE_Y_WITH_DC,
|
2010-08-31 16:49:57 +02:00
|
|
|
ta + vp8_block2above[b],
|
|
|
|
tl + vp8_block2left[b]);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
return cost;
|
|
|
|
|
|
|
|
}
|
2012-01-13 01:55:44 +01:00
|
|
|
static unsigned int vp8_encode_inter_mb_segment(MACROBLOCK *x, int const *labels, int which_label)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
unsigned int distortion = 0;
|
2012-01-20 19:52:16 +01:00
|
|
|
int pre_stride = x->e_mbd.pre.y_stride;
|
|
|
|
unsigned char *base_pre = x->e_mbd.pre.y_buffer;
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
{
|
|
|
|
if (labels[i] == which_label)
|
|
|
|
{
|
|
|
|
BLOCKD *bd = &x->e_mbd.block[i];
|
|
|
|
BLOCK *be = &x->block[i];
|
|
|
|
|
2012-01-20 19:52:16 +01:00
|
|
|
vp8_build_inter_predictors_b(bd, 16, base_pre, pre_stride, x->e_mbd.subpixel_predict);
|
2012-01-13 01:55:44 +01:00
|
|
|
vp8_subtract_b(be, bd, 16);
|
2012-01-13 01:55:44 +01:00
|
|
|
x->short_fdct4x4(be->src_diff, be->coeff, 32);
|
2010-06-04 00:08:44 +02:00
|
|
|
x->quantize_b(be, bd);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-01-13 01:55:44 +01:00
|
|
|
distortion += vp8_block_error(be->coeff, bd->dqcoeff);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return distortion;
|
|
|
|
}
|
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
|
|
|
|
static const unsigned int segmentation_to_sseshift[4] = {3, 3, 2, 0};
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv *ref_mv;
|
|
|
|
int_mv mvp;
|
2010-12-06 22:42:52 +01:00
|
|
|
|
|
|
|
int segment_rd;
|
|
|
|
int segment_num;
|
|
|
|
int r;
|
|
|
|
int d;
|
|
|
|
int segment_yrate;
|
|
|
|
B_PREDICTION_MODE modes[16];
|
2010-12-16 23:01:27 +01:00
|
|
|
int_mv mvs[16];
|
2010-12-06 22:42:52 +01:00
|
|
|
unsigned char eobs[16];
|
|
|
|
|
|
|
|
int mvthresh;
|
|
|
|
int *mdcounts;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
int_mv sv_mvp[4]; /* save 4 mvp from 8x8 */
|
|
|
|
int sv_istep[2]; /* save 2 initial step_param for 16x8/8x16 */
|
2010-12-23 17:23:03 +01:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
} BEST_SEG_INFO;
|
|
|
|
|
|
|
|
|
2011-03-17 22:07:59 +01:00
|
|
|
static void rd_check_segment(VP8_COMP *cpi, MACROBLOCK *x,
|
|
|
|
BEST_SEG_INFO *bsi, unsigned int segmentation)
|
2010-12-06 22:42:52 +01:00
|
|
|
{
|
|
|
|
int i;
|
2010-05-18 17:58:33 +02:00
|
|
|
int const *labels;
|
|
|
|
int br = 0;
|
|
|
|
int bd = 0;
|
2010-12-06 22:42:52 +01:00
|
|
|
B_PREDICTION_MODE this_mode;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-10-26 21:34:16 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
int label_count;
|
|
|
|
int this_segment_rd = 0;
|
|
|
|
int label_mv_thresh;
|
|
|
|
int rate = 0;
|
|
|
|
int sbr = 0;
|
|
|
|
int sbd = 0;
|
|
|
|
int segmentyrate = 0;
|
|
|
|
|
|
|
|
vp8_variance_fn_ptr_t *v_fn_ptr;
|
|
|
|
|
|
|
|
ENTROPY_CONTEXT_PLANES t_above, t_left;
|
|
|
|
ENTROPY_CONTEXT *ta;
|
|
|
|
ENTROPY_CONTEXT *tl;
|
|
|
|
ENTROPY_CONTEXT_PLANES t_above_b, t_left_b;
|
|
|
|
ENTROPY_CONTEXT *ta_b;
|
|
|
|
ENTROPY_CONTEXT *tl_b;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
vpx_memcpy(&t_above, x->e_mbd.above_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
vpx_memcpy(&t_left, x->e_mbd.left_context, sizeof(ENTROPY_CONTEXT_PLANES));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
ta = (ENTROPY_CONTEXT *)&t_above;
|
|
|
|
tl = (ENTROPY_CONTEXT *)&t_left;
|
|
|
|
ta_b = (ENTROPY_CONTEXT *)&t_above_b;
|
|
|
|
tl_b = (ENTROPY_CONTEXT *)&t_left_b;
|
|
|
|
|
|
|
|
br = 0;
|
|
|
|
bd = 0;
|
2010-06-11 20:33:49 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
v_fn_ptr = &cpi->fn_ptr[segmentation];
|
|
|
|
labels = vp8_mbsplits[segmentation];
|
|
|
|
label_count = vp8_mbsplit_count[segmentation];
|
2010-06-11 20:33:49 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* 64 makes this threshold really big effectively making it so that we
|
|
|
|
* very rarely check mvs on segments. setting this to 1 would make mv
|
|
|
|
* thresh roughly equal to what it is for macroblocks
|
|
|
|
*/
|
2010-12-06 22:42:52 +01:00
|
|
|
label_mv_thresh = 1 * bsi->mvthresh / label_count ;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Segmentation method overheads */
|
2010-12-06 22:42:52 +01:00
|
|
|
rate = vp8_cost_token(vp8_mbsplit_tree, vp8_mbsplit_probs, vp8_mbsplit_encodings + segmentation);
|
|
|
|
rate += vp8_cost_mv_ref(SPLITMV, bsi->mdcounts);
|
2011-01-07 15:41:13 +01:00
|
|
|
this_segment_rd += RDCOST(x->rdmult, x->rddiv, rate, 0);
|
2010-12-06 22:42:52 +01:00
|
|
|
br += rate;
|
|
|
|
|
|
|
|
for (i = 0; i < label_count; i++)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv mode_mv[B_MODE_COUNT];
|
2010-12-06 22:42:52 +01:00
|
|
|
int best_label_rd = INT_MAX;
|
|
|
|
B_PREDICTION_MODE mode_selected = ZERO4X4;
|
|
|
|
int bestlabelyrate = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* search for the best motion vector on this segment */
|
2010-12-06 22:42:52 +01:00
|
|
|
for (this_mode = LEFT4X4; this_mode <= NEW4X4 ; this_mode ++)
|
|
|
|
{
|
|
|
|
int this_rd;
|
|
|
|
int distortion;
|
|
|
|
int labelyrate;
|
|
|
|
ENTROPY_CONTEXT_PLANES t_above_s, t_left_s;
|
|
|
|
ENTROPY_CONTEXT *ta_s;
|
|
|
|
ENTROPY_CONTEXT *tl_s;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
vpx_memcpy(&t_above_s, &t_above, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
vpx_memcpy(&t_left_s, &t_left, sizeof(ENTROPY_CONTEXT_PLANES));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
ta_s = (ENTROPY_CONTEXT *)&t_above_s;
|
|
|
|
tl_s = (ENTROPY_CONTEXT *)&t_left_s;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
if (this_mode == NEW4X4)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2010-12-06 22:42:52 +01:00
|
|
|
int sseshift;
|
2010-05-18 17:58:33 +02:00
|
|
|
int num00;
|
2010-12-06 22:42:52 +01:00
|
|
|
int step_param = 0;
|
2010-12-23 17:23:03 +01:00
|
|
|
int further_steps;
|
2010-12-06 22:42:52 +01:00
|
|
|
int n;
|
|
|
|
int thissme;
|
|
|
|
int bestsme = INT_MAX;
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv temp_mv;
|
2010-12-06 22:42:52 +01:00
|
|
|
BLOCK *c;
|
|
|
|
BLOCKD *e;
|
2010-08-31 16:49:57 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Is the best so far sufficiently good that we cant justify
|
|
|
|
* doing a new motion search.
|
|
|
|
*/
|
2010-12-06 22:42:52 +01:00
|
|
|
if (best_label_rd < label_mv_thresh)
|
|
|
|
break;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-23 17:23:03 +01:00
|
|
|
if(cpi->compressor_speed)
|
|
|
|
{
|
|
|
|
if (segmentation == BLOCK_8X16 || segmentation == BLOCK_16X8)
|
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
bsi->mvp.as_int = bsi->sv_mvp[i].as_int;
|
|
|
|
if (i==1 && segmentation == BLOCK_16X8)
|
|
|
|
bsi->mvp.as_int = bsi->sv_mvp[2].as_int;
|
2010-12-23 17:23:03 +01:00
|
|
|
|
|
|
|
step_param = bsi->sv_istep[i];
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* use previous block's result as next block's MV
|
|
|
|
* predictor.
|
|
|
|
*/
|
2010-12-23 17:23:03 +01:00
|
|
|
if (segmentation == BLOCK_4X4 && i>0)
|
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
bsi->mvp.as_int = x->e_mbd.block[i-1].bmi.mv.as_int;
|
|
|
|
if (i==4 || i==8 || i==12)
|
|
|
|
bsi->mvp.as_int = x->e_mbd.block[i-4].bmi.mv.as_int;
|
2010-12-23 17:23:03 +01:00
|
|
|
step_param = 2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
further_steps = (MAX_MVSEARCH_STEPS - 1) - step_param;
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-06-01 20:41:05 +02:00
|
|
|
int sadpb = x->sadperbit4;
|
2011-07-07 17:21:41 +02:00
|
|
|
int_mv mvp_full;
|
|
|
|
|
|
|
|
mvp_full.as_mv.row = bsi->mvp.as_mv.row >>3;
|
|
|
|
mvp_full.as_mv.col = bsi->mvp.as_mv.col >>3;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* find first label */
|
2011-03-17 22:07:59 +01:00
|
|
|
n = vp8_mbsplit_offset[segmentation][i];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
c = &x->block[n];
|
|
|
|
e = &x->e_mbd.block[n];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
{
|
2011-07-07 17:21:41 +02:00
|
|
|
bestsme = cpi->diamond_search_sad(x, c, e, &mvp_full,
|
2010-07-01 03:58:54 +02:00
|
|
|
&mode_mv[NEW4X4], step_param,
|
|
|
|
sadpb, &num00, v_fn_ptr,
|
|
|
|
x->mvcost, bsi->ref_mv);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
n = num00;
|
|
|
|
num00 = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
while (n < further_steps)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2010-12-06 22:42:52 +01:00
|
|
|
n++;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
if (num00)
|
|
|
|
num00--;
|
2010-05-18 17:58:33 +02:00
|
|
|
else
|
|
|
|
{
|
2010-07-01 03:58:54 +02:00
|
|
|
thissme = cpi->diamond_search_sad(x, c, e,
|
2011-07-07 17:21:41 +02:00
|
|
|
&mvp_full, &temp_mv,
|
2010-07-01 03:58:54 +02:00
|
|
|
step_param + n, sadpb,
|
|
|
|
&num00, v_fn_ptr,
|
|
|
|
x->mvcost, bsi->ref_mv);
|
2010-12-06 22:42:52 +01:00
|
|
|
|
|
|
|
if (thissme < bestsme)
|
|
|
|
{
|
|
|
|
bestsme = thissme;
|
2011-05-12 16:50:16 +02:00
|
|
|
mode_mv[NEW4X4].as_int = temp_mv.as_int;
|
2010-12-06 22:42:52 +01:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
sseshift = segmentation_to_sseshift[segmentation];
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Should we do a full search (best quality only) */
|
2010-12-06 22:42:52 +01:00
|
|
|
if ((cpi->compressor_speed == 0) && (bestsme >> sseshift) > 4000)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-07-22 22:01:11 +02:00
|
|
|
/* Check if mvp_full is within the range. */
|
|
|
|
vp8_clamp_mv(&mvp_full, x->mv_col_min, x->mv_col_max, x->mv_row_min, x->mv_row_max);
|
|
|
|
|
2011-07-07 17:21:41 +02:00
|
|
|
thissme = cpi->full_search_sad(x, c, e, &mvp_full,
|
2010-07-01 03:58:54 +02:00
|
|
|
sadpb, 16, v_fn_ptr,
|
|
|
|
x->mvcost, bsi->ref_mv);
|
2010-12-06 22:42:52 +01:00
|
|
|
|
|
|
|
if (thissme < bestsme)
|
|
|
|
{
|
|
|
|
bestsme = thissme;
|
2011-05-12 16:50:16 +02:00
|
|
|
mode_mv[NEW4X4].as_int = e->bmi.mv.as_int;
|
2010-12-06 22:42:52 +01:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
else
|
2010-12-06 22:42:52 +01:00
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* The full search result is actually worse so
|
|
|
|
* re-instate the previous best vector
|
|
|
|
*/
|
2011-05-12 16:50:16 +02:00
|
|
|
e->bmi.mv.as_int = mode_mv[NEW4X4].as_int;
|
2010-12-06 22:42:52 +01:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
if (bestsme < INT_MAX)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-04-14 21:53:33 +02:00
|
|
|
int distortion;
|
2011-04-18 21:48:34 +02:00
|
|
|
unsigned int sse;
|
2011-06-01 20:41:05 +02:00
|
|
|
cpi->find_fractional_mv_step(x, c, e, &mode_mv[NEW4X4],
|
|
|
|
bsi->ref_mv, x->errorperbit, v_fn_ptr, x->mvcost,
|
|
|
|
&distortion, &sse);
|
2011-04-14 21:53:33 +02:00
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2010-12-06 22:42:52 +01:00
|
|
|
} /* NEW4X4 */
|
|
|
|
|
|
|
|
rate = labels2mode(x, labels, i, this_mode, &mode_mv[this_mode],
|
|
|
|
bsi->ref_mv, x->mvcost);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Trap vectors that reach beyond the UMV borders */
|
2011-05-12 16:50:16 +02:00
|
|
|
if (((mode_mv[this_mode].as_mv.row >> 3) < x->mv_row_min) || ((mode_mv[this_mode].as_mv.row >> 3) > x->mv_row_max) ||
|
|
|
|
((mode_mv[this_mode].as_mv.col >> 3) < x->mv_col_min) || ((mode_mv[this_mode].as_mv.col >> 3) > x->mv_col_max))
|
2010-12-06 22:42:52 +01:00
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-01-13 01:55:44 +01:00
|
|
|
distortion = vp8_encode_inter_mb_segment(x, labels, i) / 4;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
labelyrate = rdcost_mbsegment_y(x, labels, i, ta_s, tl_s);
|
|
|
|
rate += labelyrate;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-01-07 15:41:13 +01:00
|
|
|
this_rd = RDCOST(x->rdmult, x->rddiv, rate, distortion);
|
2010-08-31 16:49:57 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
if (this_rd < best_label_rd)
|
|
|
|
{
|
|
|
|
sbr = rate;
|
|
|
|
sbd = distortion;
|
|
|
|
bestlabelyrate = labelyrate;
|
|
|
|
mode_selected = this_mode;
|
|
|
|
best_label_rd = this_rd;
|
|
|
|
|
|
|
|
vpx_memcpy(ta_b, ta_s, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
vpx_memcpy(tl_b, tl_s, sizeof(ENTROPY_CONTEXT_PLANES));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
}
|
2010-12-06 22:42:52 +01:00
|
|
|
} /*for each 4x4 mode*/
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
vpx_memcpy(ta, ta_b, sizeof(ENTROPY_CONTEXT_PLANES));
|
|
|
|
vpx_memcpy(tl, tl_b, sizeof(ENTROPY_CONTEXT_PLANES));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
labels2mode(x, labels, i, mode_selected, &mode_mv[mode_selected],
|
|
|
|
bsi->ref_mv, x->mvcost);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
br += sbr;
|
|
|
|
bd += sbd;
|
|
|
|
segmentyrate += bestlabelyrate;
|
|
|
|
this_segment_rd += best_label_rd;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-23 17:23:03 +01:00
|
|
|
if (this_segment_rd >= bsi->segment_rd)
|
2010-12-06 22:42:52 +01:00
|
|
|
break;
|
2010-12-23 17:23:03 +01:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
} /* for each label */
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
if (this_segment_rd < bsi->segment_rd)
|
|
|
|
{
|
|
|
|
bsi->r = br;
|
|
|
|
bsi->d = bd;
|
|
|
|
bsi->segment_yrate = segmentyrate;
|
|
|
|
bsi->segment_rd = this_segment_rd;
|
|
|
|
bsi->segment_num = segmentation;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* store everything needed to come back to this!! */
|
2010-12-06 22:42:52 +01:00
|
|
|
for (i = 0; i < 16; i++)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-19 21:03:36 +02:00
|
|
|
bsi->mvs[i].as_mv = x->partition_info->bmi[i].mv.as_mv;
|
|
|
|
bsi->modes[i] = x->partition_info->bmi[i].mode;
|
2011-10-25 13:25:11 +02:00
|
|
|
bsi->eobs[i] = x->e_mbd.eobs[i];
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
2010-12-06 22:42:52 +01:00
|
|
|
}
|
2010-12-23 17:23:03 +01:00
|
|
|
|
2012-03-21 19:11:10 +01:00
|
|
|
static
|
2010-12-23 17:23:03 +01:00
|
|
|
void vp8_cal_step_param(int sr, int *sp)
|
|
|
|
{
|
|
|
|
int step = 0;
|
|
|
|
|
|
|
|
if (sr > MAX_FIRST_STEP) sr = MAX_FIRST_STEP;
|
|
|
|
else if (sr < 1) sr = 1;
|
|
|
|
|
|
|
|
while (sr>>=1)
|
|
|
|
step++;
|
|
|
|
|
|
|
|
*sp = MAX_MVSEARCH_STEPS - 1 - step;
|
|
|
|
}
|
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
static int vp8_rd_pick_best_mbsegmentation(VP8_COMP *cpi, MACROBLOCK *x,
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv *best_ref_mv, int best_rd,
|
2010-12-06 22:42:52 +01:00
|
|
|
int *mdcounts, int *returntotrate,
|
|
|
|
int *returnyrate, int *returndistortion,
|
|
|
|
int mvthresh)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
BEST_SEG_INFO bsi;
|
|
|
|
|
|
|
|
vpx_memset(&bsi, 0, sizeof(bsi));
|
|
|
|
|
|
|
|
bsi.segment_rd = best_rd;
|
|
|
|
bsi.ref_mv = best_ref_mv;
|
2011-05-12 16:50:16 +02:00
|
|
|
bsi.mvp.as_int = best_ref_mv->as_int;
|
2010-12-06 22:42:52 +01:00
|
|
|
bsi.mvthresh = mvthresh;
|
|
|
|
bsi.mdcounts = mdcounts;
|
|
|
|
|
|
|
|
for(i = 0; i < 16; i++)
|
|
|
|
{
|
|
|
|
bsi.modes[i] = ZERO4X4;
|
|
|
|
}
|
2010-12-23 17:23:03 +01:00
|
|
|
|
2010-12-16 23:01:27 +01:00
|
|
|
if(cpi->compressor_speed == 0)
|
|
|
|
{
|
|
|
|
/* for now, we will keep the original segmentation order
|
|
|
|
when in best quality mode */
|
2011-03-17 22:07:59 +01:00
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_16X8);
|
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_8X16);
|
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_8X8);
|
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_4X4);
|
2010-12-16 23:01:27 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2010-12-23 17:23:03 +01:00
|
|
|
int sr;
|
|
|
|
|
2011-03-17 22:07:59 +01:00
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_8X8);
|
2010-12-23 17:23:03 +01:00
|
|
|
|
2010-12-16 23:01:27 +01:00
|
|
|
if (bsi.segment_rd < best_rd)
|
|
|
|
{
|
2011-12-22 01:11:31 +01:00
|
|
|
int col_min = ((best_ref_mv->as_mv.col+7)>>3) - MAX_FULL_PEL_VAL;
|
|
|
|
int row_min = ((best_ref_mv->as_mv.row+7)>>3) - MAX_FULL_PEL_VAL;
|
2011-07-07 17:21:41 +02:00
|
|
|
int col_max = (best_ref_mv->as_mv.col>>3) + MAX_FULL_PEL_VAL;
|
|
|
|
int row_max = (best_ref_mv->as_mv.row>>3) + MAX_FULL_PEL_VAL;
|
2010-12-28 19:23:07 +01:00
|
|
|
|
|
|
|
int tmp_col_min = x->mv_col_min;
|
|
|
|
int tmp_col_max = x->mv_col_max;
|
|
|
|
int tmp_row_min = x->mv_row_min;
|
|
|
|
int tmp_row_max = x->mv_row_max;
|
|
|
|
|
|
|
|
/* Get intersection of UMV window and valid MV window to reduce # of checks in diamond search. */
|
|
|
|
if (x->mv_col_min < col_min )
|
|
|
|
x->mv_col_min = col_min;
|
|
|
|
if (x->mv_col_max > col_max )
|
|
|
|
x->mv_col_max = col_max;
|
|
|
|
if (x->mv_row_min < row_min )
|
|
|
|
x->mv_row_min = row_min;
|
|
|
|
if (x->mv_row_max > row_max )
|
|
|
|
x->mv_row_max = row_max;
|
|
|
|
|
|
|
|
/* Get 8x8 result */
|
2011-05-12 16:50:16 +02:00
|
|
|
bsi.sv_mvp[0].as_int = bsi.mvs[0].as_int;
|
|
|
|
bsi.sv_mvp[1].as_int = bsi.mvs[2].as_int;
|
|
|
|
bsi.sv_mvp[2].as_int = bsi.mvs[8].as_int;
|
|
|
|
bsi.sv_mvp[3].as_int = bsi.mvs[10].as_int;
|
2010-12-23 17:23:03 +01:00
|
|
|
|
2010-12-28 19:23:07 +01:00
|
|
|
/* Use 8x8 result as 16x8/8x16's predictor MV. Adjust search range according to the closeness of 2 MV. */
|
|
|
|
/* block 8X16 */
|
2010-12-23 17:23:03 +01:00
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
sr = MAXF((abs(bsi.sv_mvp[0].as_mv.row - bsi.sv_mvp[2].as_mv.row))>>3, (abs(bsi.sv_mvp[0].as_mv.col - bsi.sv_mvp[2].as_mv.col))>>3);
|
2010-12-23 17:23:03 +01:00
|
|
|
vp8_cal_step_param(sr, &bsi.sv_istep[0]);
|
|
|
|
|
2011-05-12 16:50:16 +02:00
|
|
|
sr = MAXF((abs(bsi.sv_mvp[1].as_mv.row - bsi.sv_mvp[3].as_mv.row))>>3, (abs(bsi.sv_mvp[1].as_mv.col - bsi.sv_mvp[3].as_mv.col))>>3);
|
2010-12-23 17:23:03 +01:00
|
|
|
vp8_cal_step_param(sr, &bsi.sv_istep[1]);
|
|
|
|
|
2011-03-17 22:07:59 +01:00
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_8X16);
|
2010-12-23 17:23:03 +01:00
|
|
|
}
|
|
|
|
|
2010-12-28 19:23:07 +01:00
|
|
|
/* block 16X8 */
|
2010-12-23 17:23:03 +01:00
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
sr = MAXF((abs(bsi.sv_mvp[0].as_mv.row - bsi.sv_mvp[1].as_mv.row))>>3, (abs(bsi.sv_mvp[0].as_mv.col - bsi.sv_mvp[1].as_mv.col))>>3);
|
2010-12-23 17:23:03 +01:00
|
|
|
vp8_cal_step_param(sr, &bsi.sv_istep[0]);
|
|
|
|
|
2011-05-12 16:50:16 +02:00
|
|
|
sr = MAXF((abs(bsi.sv_mvp[2].as_mv.row - bsi.sv_mvp[3].as_mv.row))>>3, (abs(bsi.sv_mvp[2].as_mv.col - bsi.sv_mvp[3].as_mv.col))>>3);
|
2010-12-23 17:23:03 +01:00
|
|
|
vp8_cal_step_param(sr, &bsi.sv_istep[1]);
|
|
|
|
|
2011-03-17 22:07:59 +01:00
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_16X8);
|
2010-12-23 17:23:03 +01:00
|
|
|
}
|
|
|
|
|
2010-12-28 19:23:07 +01:00
|
|
|
/* If 8x8 is better than 16x8/8x16, then do 4x4 search */
|
2011-01-10 23:21:55 +01:00
|
|
|
/* Not skip 4x4 if speed=0 (good quality) */
|
|
|
|
if (cpi->sf.no_skip_block4x4_search || bsi.segment_num == BLOCK_8X8) /* || (sv_segment_rd8x8-bsi.segment_rd) < sv_segment_rd8x8>>5) */
|
2010-12-23 17:23:03 +01:00
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
bsi.mvp.as_int = bsi.sv_mvp[0].as_int;
|
2011-03-17 22:07:59 +01:00
|
|
|
rd_check_segment(cpi, x, &bsi, BLOCK_4X4);
|
2010-12-23 17:23:03 +01:00
|
|
|
}
|
2010-12-28 19:23:07 +01:00
|
|
|
|
|
|
|
/* restore UMV window */
|
|
|
|
x->mv_col_min = tmp_col_min;
|
|
|
|
x->mv_col_max = tmp_col_max;
|
|
|
|
x->mv_row_min = tmp_row_min;
|
|
|
|
x->mv_row_max = tmp_row_max;
|
2010-12-16 23:01:27 +01:00
|
|
|
}
|
|
|
|
}
|
2010-12-06 22:42:52 +01:00
|
|
|
|
|
|
|
/* set it to the best */
|
2010-05-18 17:58:33 +02:00
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
{
|
|
|
|
BLOCKD *bd = &x->e_mbd.block[i];
|
|
|
|
|
2011-06-02 19:46:41 +02:00
|
|
|
bd->bmi.mv.as_int = bsi.mvs[i].as_int;
|
2011-10-25 13:25:11 +02:00
|
|
|
*bd->eob = bsi.eobs[i];
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
*returntotrate = bsi.r;
|
|
|
|
*returndistortion = bsi.d;
|
|
|
|
*returnyrate = bsi.segment_yrate;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
/* save partitions */
|
|
|
|
x->e_mbd.mode_info_context->mbmi.partitioning = bsi.segment_num;
|
|
|
|
x->partition_info->count = vp8_mbsplit_count[bsi.segment_num];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-09-02 22:17:52 +02:00
|
|
|
for (i = 0; i < x->partition_info->count; i++)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
int j;
|
|
|
|
|
2011-03-17 22:07:59 +01:00
|
|
|
j = vp8_mbsplit_offset[bsi.segment_num][i];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-19 21:03:36 +02:00
|
|
|
x->partition_info->bmi[i].mode = bsi.modes[j];
|
|
|
|
x->partition_info->bmi[i].mv.as_mv = bsi.mvs[j].as_mv;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2011-05-19 21:03:36 +02:00
|
|
|
/*
|
|
|
|
* used to set x->e_mbd.mode_info_context->mbmi.mv.as_int
|
|
|
|
*/
|
|
|
|
x->partition_info->bmi[15].mv.as_int = bsi.mvs[15].as_int;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-06 22:42:52 +01:00
|
|
|
return bsi.segment_rd;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* The improved MV prediction */
|
2011-01-26 18:03:13 +01:00
|
|
|
void vp8_mv_pred
|
2010-12-03 17:26:21 +01:00
|
|
|
(
|
|
|
|
VP8_COMP *cpi,
|
|
|
|
MACROBLOCKD *xd,
|
|
|
|
const MODE_INFO *here,
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv *mvp,
|
2010-12-03 17:26:21 +01:00
|
|
|
int refframe,
|
|
|
|
int *ref_frame_sign_bias,
|
|
|
|
int *sr,
|
|
|
|
int near_sadidx[]
|
|
|
|
)
|
|
|
|
{
|
|
|
|
const MODE_INFO *above = here - xd->mode_info_stride;
|
|
|
|
const MODE_INFO *left = here - 1;
|
|
|
|
const MODE_INFO *aboveleft = above - 1;
|
2011-01-25 21:54:34 +01:00
|
|
|
int_mv near_mvs[8];
|
|
|
|
int near_ref[8];
|
2010-12-03 17:26:21 +01:00
|
|
|
int_mv mv;
|
|
|
|
int vcnt=0;
|
|
|
|
int find=0;
|
|
|
|
int mb_offset;
|
|
|
|
|
2011-01-25 21:54:34 +01:00
|
|
|
int mvx[8];
|
|
|
|
int mvy[8];
|
2010-12-03 17:26:21 +01:00
|
|
|
int i;
|
|
|
|
|
|
|
|
mv.as_int = 0;
|
|
|
|
|
|
|
|
if(here->mbmi.ref_frame != INTRA_FRAME)
|
|
|
|
{
|
2011-01-25 21:54:34 +01:00
|
|
|
near_mvs[0].as_int = near_mvs[1].as_int = near_mvs[2].as_int = near_mvs[3].as_int = near_mvs[4].as_int = near_mvs[5].as_int = near_mvs[6].as_int = near_mvs[7].as_int = 0;
|
|
|
|
near_ref[0] = near_ref[1] = near_ref[2] = near_ref[3] = near_ref[4] = near_ref[5] = near_ref[6] = near_ref[7] = 0;
|
2010-12-03 17:26:21 +01:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* read in 3 nearby block's MVs from current frame as prediction
|
|
|
|
* candidates.
|
|
|
|
*/
|
2010-12-03 17:26:21 +01:00
|
|
|
if (above->mbmi.ref_frame != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
near_mvs[vcnt].as_int = above->mbmi.mv.as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(ref_frame_sign_bias[above->mbmi.ref_frame], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2010-12-03 17:26:21 +01:00
|
|
|
near_ref[vcnt] = above->mbmi.ref_frame;
|
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
if (left->mbmi.ref_frame != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
near_mvs[vcnt].as_int = left->mbmi.mv.as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(ref_frame_sign_bias[left->mbmi.ref_frame], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2010-12-03 17:26:21 +01:00
|
|
|
near_ref[vcnt] = left->mbmi.ref_frame;
|
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
if (aboveleft->mbmi.ref_frame != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
near_mvs[vcnt].as_int = aboveleft->mbmi.mv.as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(ref_frame_sign_bias[aboveleft->mbmi.ref_frame], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2010-12-03 17:26:21 +01:00
|
|
|
near_ref[vcnt] = aboveleft->mbmi.ref_frame;
|
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* read in 5 nearby block's MVs from last frame. */
|
2010-12-03 17:26:21 +01:00
|
|
|
if(cpi->common.last_frame_type != KEY_FRAME)
|
|
|
|
{
|
2011-01-25 21:54:34 +01:00
|
|
|
mb_offset = (-xd->mb_to_top_edge/128 + 1) * (xd->mode_info_stride +1) + (-xd->mb_to_left_edge/128 +1) ;
|
2010-12-03 17:26:21 +01:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* current in last frame */
|
2010-12-03 17:26:21 +01:00
|
|
|
if (cpi->lf_ref_frame[mb_offset] != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
near_mvs[vcnt].as_int = cpi->lfmv[mb_offset].as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(cpi->lf_ref_frame_sign_bias[mb_offset], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2010-12-03 17:26:21 +01:00
|
|
|
near_ref[vcnt] = cpi->lf_ref_frame[mb_offset];
|
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* above in last frame */
|
2011-01-25 21:54:34 +01:00
|
|
|
if (cpi->lf_ref_frame[mb_offset - xd->mode_info_stride-1] != INTRA_FRAME)
|
2010-12-03 17:26:21 +01:00
|
|
|
{
|
2011-01-25 21:54:34 +01:00
|
|
|
near_mvs[vcnt].as_int = cpi->lfmv[mb_offset - xd->mode_info_stride-1].as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(cpi->lf_ref_frame_sign_bias[mb_offset - xd->mode_info_stride-1], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2011-01-25 21:54:34 +01:00
|
|
|
near_ref[vcnt] = cpi->lf_ref_frame[mb_offset - xd->mode_info_stride-1];
|
2010-12-03 17:26:21 +01:00
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* left in last frame */
|
2010-12-03 17:26:21 +01:00
|
|
|
if (cpi->lf_ref_frame[mb_offset-1] != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
near_mvs[vcnt].as_int = cpi->lfmv[mb_offset -1].as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(cpi->lf_ref_frame_sign_bias[mb_offset -1], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2010-12-03 17:26:21 +01:00
|
|
|
near_ref[vcnt] = cpi->lf_ref_frame[mb_offset - 1];
|
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* right in last frame */
|
2011-01-25 21:54:34 +01:00
|
|
|
if (cpi->lf_ref_frame[mb_offset +1] != INTRA_FRAME)
|
2010-12-03 17:26:21 +01:00
|
|
|
{
|
2011-01-25 21:54:34 +01:00
|
|
|
near_mvs[vcnt].as_int = cpi->lfmv[mb_offset +1].as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(cpi->lf_ref_frame_sign_bias[mb_offset +1], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2011-01-25 21:54:34 +01:00
|
|
|
near_ref[vcnt] = cpi->lf_ref_frame[mb_offset +1];
|
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* below in last frame */
|
2011-01-25 21:54:34 +01:00
|
|
|
if (cpi->lf_ref_frame[mb_offset + xd->mode_info_stride +1] != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
near_mvs[vcnt].as_int = cpi->lfmv[mb_offset + xd->mode_info_stride +1].as_int;
|
2011-01-26 18:03:13 +01:00
|
|
|
mv_bias(cpi->lf_ref_frame_sign_bias[mb_offset + xd->mode_info_stride +1], refframe, &near_mvs[vcnt], ref_frame_sign_bias);
|
2011-01-25 21:54:34 +01:00
|
|
|
near_ref[vcnt] = cpi->lf_ref_frame[mb_offset + xd->mode_info_stride +1];
|
2010-12-03 17:26:21 +01:00
|
|
|
}
|
|
|
|
vcnt++;
|
|
|
|
}
|
|
|
|
|
|
|
|
for(i=0; i< vcnt; i++)
|
|
|
|
{
|
|
|
|
if(near_ref[near_sadidx[i]] != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
if(here->mbmi.ref_frame == near_ref[near_sadidx[i]])
|
|
|
|
{
|
|
|
|
mv.as_int = near_mvs[near_sadidx[i]].as_int;
|
|
|
|
find = 1;
|
2011-01-25 21:54:34 +01:00
|
|
|
if (i < 3)
|
2010-12-03 17:26:21 +01:00
|
|
|
*sr = 3;
|
|
|
|
else
|
|
|
|
*sr = 2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!find)
|
|
|
|
{
|
|
|
|
for(i=0; i<vcnt; i++)
|
|
|
|
{
|
|
|
|
mvx[i] = near_mvs[i].as_mv.row;
|
|
|
|
mvy[i] = near_mvs[i].as_mv.col;
|
|
|
|
}
|
|
|
|
|
2011-04-27 19:40:39 +02:00
|
|
|
insertsortmv(mvx, vcnt);
|
|
|
|
insertsortmv(mvy, vcnt);
|
2010-12-03 17:26:21 +01:00
|
|
|
mv.as_mv.row = mvx[vcnt/2];
|
|
|
|
mv.as_mv.col = mvy[vcnt/2];
|
|
|
|
|
|
|
|
find = 1;
|
2012-05-21 23:30:56 +02:00
|
|
|
/* sr is set to 0 to allow calling function to decide the search
|
|
|
|
* range.
|
|
|
|
*/
|
2010-12-03 17:26:21 +01:00
|
|
|
*sr = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Set up return values */
|
2011-05-12 16:50:16 +02:00
|
|
|
mvp->as_int = mv.as_int;
|
|
|
|
vp8_clamp_mv2(mvp, xd);
|
2010-12-03 17:26:21 +01:00
|
|
|
}
|
|
|
|
|
2011-01-28 16:00:20 +01:00
|
|
|
void vp8_cal_sad(VP8_COMP *cpi, MACROBLOCKD *xd, MACROBLOCK *x, int recon_yoffset, int near_sadidx[])
|
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* near_sad indexes:
|
|
|
|
* 0-cf above, 1-cf left, 2-cf aboveleft,
|
|
|
|
* 3-lf current, 4-lf above, 5-lf left, 6-lf right, 7-lf below
|
|
|
|
*/
|
|
|
|
int near_sad[8] = {0};
|
2011-06-23 19:54:02 +02:00
|
|
|
BLOCK *b = &x->block[0];
|
|
|
|
unsigned char *src_y_ptr = *(b->base_src);
|
2011-01-28 16:00:20 +01:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* calculate sad for current frame 3 nearby MBs. */
|
2011-01-28 16:00:20 +01:00
|
|
|
if( xd->mb_to_top_edge==0 && xd->mb_to_left_edge ==0)
|
|
|
|
{
|
|
|
|
near_sad[0] = near_sad[1] = near_sad[2] = INT_MAX;
|
|
|
|
}else if(xd->mb_to_top_edge==0)
|
2012-05-21 23:30:56 +02:00
|
|
|
{ /* only has left MB for sad calculation. */
|
2011-01-28 16:00:20 +01:00
|
|
|
near_sad[0] = near_sad[2] = INT_MAX;
|
2012-06-26 20:37:33 +02:00
|
|
|
near_sad[1] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, xd->dst.y_buffer - 16,xd->dst.y_stride, UINT_MAX);
|
2011-01-28 16:00:20 +01:00
|
|
|
}else if(xd->mb_to_left_edge ==0)
|
2012-05-21 23:30:56 +02:00
|
|
|
{ /* only has left MB for sad calculation. */
|
2011-01-28 16:00:20 +01:00
|
|
|
near_sad[1] = near_sad[2] = INT_MAX;
|
2012-06-26 20:37:33 +02:00
|
|
|
near_sad[0] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, xd->dst.y_buffer - xd->dst.y_stride *16,xd->dst.y_stride, UINT_MAX);
|
2011-01-28 16:00:20 +01:00
|
|
|
}else
|
|
|
|
{
|
2012-06-26 20:37:33 +02:00
|
|
|
near_sad[0] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, xd->dst.y_buffer - xd->dst.y_stride *16,xd->dst.y_stride, UINT_MAX);
|
|
|
|
near_sad[1] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, xd->dst.y_buffer - 16,xd->dst.y_stride, UINT_MAX);
|
|
|
|
near_sad[2] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, xd->dst.y_buffer - xd->dst.y_stride *16 -16,xd->dst.y_stride, UINT_MAX);
|
2011-01-28 16:00:20 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if(cpi->common.last_frame_type != KEY_FRAME)
|
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* calculate sad for last frame 5 nearby MBs. */
|
2011-01-28 16:00:20 +01:00
|
|
|
unsigned char *pre_y_buffer = cpi->common.yv12_fb[cpi->common.lst_fb_idx].y_buffer + recon_yoffset;
|
|
|
|
int pre_y_stride = cpi->common.yv12_fb[cpi->common.lst_fb_idx].y_stride;
|
|
|
|
|
|
|
|
if(xd->mb_to_top_edge==0) near_sad[4] = INT_MAX;
|
|
|
|
if(xd->mb_to_left_edge ==0) near_sad[5] = INT_MAX;
|
|
|
|
if(xd->mb_to_right_edge ==0) near_sad[6] = INT_MAX;
|
|
|
|
if(xd->mb_to_bottom_edge==0) near_sad[7] = INT_MAX;
|
|
|
|
|
|
|
|
if(near_sad[4] != INT_MAX)
|
2012-06-26 20:37:33 +02:00
|
|
|
near_sad[4] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, pre_y_buffer - pre_y_stride *16, pre_y_stride, UINT_MAX);
|
2011-01-28 16:00:20 +01:00
|
|
|
if(near_sad[5] != INT_MAX)
|
2012-06-26 20:37:33 +02:00
|
|
|
near_sad[5] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, pre_y_buffer - 16, pre_y_stride, UINT_MAX);
|
|
|
|
near_sad[3] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, pre_y_buffer, pre_y_stride, UINT_MAX);
|
2011-01-28 16:00:20 +01:00
|
|
|
if(near_sad[6] != INT_MAX)
|
2012-06-26 20:37:33 +02:00
|
|
|
near_sad[6] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, pre_y_buffer + 16, pre_y_stride, UINT_MAX);
|
2011-01-28 16:00:20 +01:00
|
|
|
if(near_sad[7] != INT_MAX)
|
2012-06-26 20:37:33 +02:00
|
|
|
near_sad[7] = cpi->fn_ptr[BLOCK_16X16].sdf(src_y_ptr, b->src_stride, pre_y_buffer + pre_y_stride *16, pre_y_stride, UINT_MAX);
|
2011-01-28 16:00:20 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if(cpi->common.last_frame_type != KEY_FRAME)
|
|
|
|
{
|
2011-04-27 19:40:39 +02:00
|
|
|
insertsortsad(near_sad, near_sadidx, 8);
|
2011-01-28 16:00:20 +01:00
|
|
|
}else
|
|
|
|
{
|
2011-04-27 19:40:39 +02:00
|
|
|
insertsortsad(near_sad, near_sadidx, 3);
|
2011-01-28 16:00:20 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-19 21:03:36 +02:00
|
|
|
static void rd_update_mvcount(VP8_COMP *cpi, MACROBLOCK *x, int_mv *best_ref_mv)
|
2011-05-13 16:56:45 +02:00
|
|
|
{
|
2011-05-19 21:03:36 +02:00
|
|
|
if (x->e_mbd.mode_info_context->mbmi.mode == SPLITMV)
|
2011-05-13 16:56:45 +02:00
|
|
|
{
|
2011-05-19 21:03:36 +02:00
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < x->partition_info->count; i++)
|
2011-05-13 16:56:45 +02:00
|
|
|
{
|
2011-05-19 21:03:36 +02:00
|
|
|
if (x->partition_info->bmi[i].mode == NEW4X4)
|
2011-05-13 16:56:45 +02:00
|
|
|
{
|
2011-05-19 21:03:36 +02:00
|
|
|
cpi->MVcount[0][mv_max+((x->partition_info->bmi[i].mv.as_mv.row
|
|
|
|
- best_ref_mv->as_mv.row) >> 1)]++;
|
|
|
|
cpi->MVcount[1][mv_max+((x->partition_info->bmi[i].mv.as_mv.col
|
|
|
|
- best_ref_mv->as_mv.col) >> 1)]++;
|
2011-05-13 16:56:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-05-19 21:03:36 +02:00
|
|
|
else if (x->e_mbd.mode_info_context->mbmi.mode == NEWMV)
|
2011-05-13 16:56:45 +02:00
|
|
|
{
|
2011-05-19 21:03:36 +02:00
|
|
|
cpi->MVcount[0][mv_max+((x->e_mbd.mode_info_context->mbmi.mv.as_mv.row
|
|
|
|
- best_ref_mv->as_mv.row) >> 1)]++;
|
|
|
|
cpi->MVcount[1][mv_max+((x->e_mbd.mode_info_context->mbmi.mv.as_mv.col
|
|
|
|
- best_ref_mv->as_mv.col) >> 1)]++;
|
2011-05-13 16:56:45 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
static int evaluate_inter_mode_rd(int mdcounts[4],
|
|
|
|
RATE_DISTORTION* rd,
|
|
|
|
int* disable_skip,
|
|
|
|
VP8_COMP *cpi, MACROBLOCK *x)
|
|
|
|
{
|
|
|
|
MB_PREDICTION_MODE this_mode = x->e_mbd.mode_info_context->mbmi.mode;
|
|
|
|
BLOCK *b = &x->block[0];
|
|
|
|
MACROBLOCKD *xd = &x->e_mbd;
|
|
|
|
int distortion;
|
|
|
|
vp8_build_inter16x16_predictors_mby(&x->e_mbd, x->e_mbd.predictor, 16);
|
|
|
|
|
|
|
|
if (cpi->active_map_enabled && x->active_ptr[0] == 0) {
|
|
|
|
x->skip = 1;
|
|
|
|
}
|
|
|
|
else if (x->encode_breakout)
|
|
|
|
{
|
|
|
|
unsigned int sse;
|
|
|
|
unsigned int var;
|
2012-05-08 20:45:35 +02:00
|
|
|
unsigned int threshold = (xd->block[0].dequant[1]
|
2012-03-06 10:48:18 +01:00
|
|
|
* xd->block[0].dequant[1] >>4);
|
|
|
|
|
|
|
|
if(threshold < x->encode_breakout)
|
|
|
|
threshold = x->encode_breakout;
|
|
|
|
|
|
|
|
var = vp8_variance16x16
|
|
|
|
(*(b->base_src), b->src_stride,
|
|
|
|
x->e_mbd.predictor, 16, &sse);
|
|
|
|
|
|
|
|
if (sse < threshold)
|
|
|
|
{
|
|
|
|
unsigned int q2dc = xd->block[24].dequant[0];
|
|
|
|
/* If theres is no codeable 2nd order dc
|
|
|
|
or a very small uniform pixel change change */
|
|
|
|
if ((sse - var < q2dc * q2dc >>4) ||
|
|
|
|
(sse /2 > var && sse-var < 64))
|
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Check u and v to make sure skip is ok */
|
2012-05-08 20:45:35 +02:00
|
|
|
unsigned int sse2 = VP8_UVSSE(x);
|
2012-03-06 10:48:18 +01:00
|
|
|
if (sse2 * 2 < threshold)
|
|
|
|
{
|
|
|
|
x->skip = 1;
|
|
|
|
rd->distortion2 = sse + sse2;
|
|
|
|
rd->rate2 = 500;
|
|
|
|
|
|
|
|
/* for best_yrd calculation */
|
|
|
|
rd->rate_uv = 0;
|
|
|
|
rd->distortion_uv = sse2;
|
|
|
|
|
|
|
|
*disable_skip = 1;
|
|
|
|
return RDCOST(x->rdmult, x->rddiv, rd->rate2,
|
|
|
|
rd->distortion2);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Add in the Mv/mode cost */
|
2012-03-06 10:48:18 +01:00
|
|
|
rd->rate2 += vp8_cost_mv_ref(this_mode, mdcounts);
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Y cost and distortion */
|
2012-03-06 10:48:18 +01:00
|
|
|
macro_block_yrd(x, &rd->rate_y, &distortion);
|
|
|
|
rd->rate2 += rd->rate_y;
|
|
|
|
rd->distortion2 += distortion;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* UV cost and distortion */
|
2012-03-06 10:48:18 +01:00
|
|
|
rd_inter16x16_uv(cpi, x, &rd->rate_uv, &rd->distortion_uv,
|
|
|
|
cpi->common.full_pixel);
|
|
|
|
rd->rate2 += rd->rate_uv;
|
|
|
|
rd->distortion2 += rd->distortion_uv;
|
|
|
|
return INT_MAX;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int calculate_final_rd_costs(int this_rd,
|
|
|
|
RATE_DISTORTION* rd,
|
|
|
|
int* other_cost,
|
|
|
|
int disable_skip,
|
|
|
|
int uv_intra_tteob,
|
|
|
|
int intra_rd_penalty,
|
|
|
|
VP8_COMP *cpi, MACROBLOCK *x)
|
|
|
|
{
|
|
|
|
MB_PREDICTION_MODE this_mode = x->e_mbd.mode_info_context->mbmi.mode;
|
2012-05-21 23:30:56 +02:00
|
|
|
|
|
|
|
/* Where skip is allowable add in the default per mb cost for the no
|
|
|
|
* skip case. where we then decide to skip we have to delete this and
|
|
|
|
* replace it with the cost of signalling a skip
|
|
|
|
*/
|
2012-03-06 10:48:18 +01:00
|
|
|
if (cpi->common.mb_no_coeff_skip)
|
|
|
|
{
|
|
|
|
*other_cost += vp8_cost_bit(cpi->prob_skip_false, 0);
|
|
|
|
rd->rate2 += *other_cost;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Estimate the reference frame signaling cost and add it
|
|
|
|
* to the rolling cost variable.
|
|
|
|
*/
|
|
|
|
rd->rate2 +=
|
|
|
|
x->ref_frame_cost[x->e_mbd.mode_info_context->mbmi.ref_frame];
|
|
|
|
|
|
|
|
if (!disable_skip)
|
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Test for the condition where skip block will be activated
|
|
|
|
* because there are no non zero coefficients and make any
|
|
|
|
* necessary adjustment for rate
|
|
|
|
*/
|
2012-03-06 10:48:18 +01:00
|
|
|
if (cpi->common.mb_no_coeff_skip)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int tteob;
|
|
|
|
int has_y2_block = (this_mode!=SPLITMV && this_mode!=B_PRED);
|
|
|
|
|
|
|
|
tteob = 0;
|
|
|
|
if(has_y2_block)
|
|
|
|
tteob += x->e_mbd.eobs[24];
|
|
|
|
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
tteob += (x->e_mbd.eobs[i] > has_y2_block);
|
|
|
|
|
|
|
|
if (x->e_mbd.mode_info_context->mbmi.ref_frame)
|
|
|
|
{
|
|
|
|
for (i = 16; i < 24; i++)
|
|
|
|
tteob += x->e_mbd.eobs[i];
|
|
|
|
}
|
|
|
|
else
|
|
|
|
tteob += uv_intra_tteob;
|
|
|
|
|
|
|
|
if (tteob == 0)
|
|
|
|
{
|
|
|
|
rd->rate2 -= (rd->rate_y + rd->rate_uv);
|
2012-05-21 23:30:56 +02:00
|
|
|
/* for best_yrd calculation */
|
2012-03-06 10:48:18 +01:00
|
|
|
rd->rate_uv = 0;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Back out no skip flag costing and add in skip flag costing */
|
2012-03-06 10:48:18 +01:00
|
|
|
if (cpi->prob_skip_false)
|
|
|
|
{
|
|
|
|
int prob_skip_cost;
|
|
|
|
|
|
|
|
prob_skip_cost = vp8_cost_bit(cpi->prob_skip_false, 1);
|
|
|
|
prob_skip_cost -= vp8_cost_bit(cpi->prob_skip_false, 0);
|
|
|
|
rd->rate2 += prob_skip_cost;
|
|
|
|
*other_cost += prob_skip_cost;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Calculate the final RD estimate for this mode */
|
2012-03-06 10:48:18 +01:00
|
|
|
this_rd = RDCOST(x->rdmult, x->rddiv, rd->rate2, rd->distortion2);
|
|
|
|
if (this_rd < INT_MAX && x->e_mbd.mode_info_context->mbmi.ref_frame
|
|
|
|
== INTRA_FRAME)
|
|
|
|
this_rd += intra_rd_penalty;
|
|
|
|
}
|
|
|
|
return this_rd;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void update_best_mode(BEST_MODE* best_mode, int this_rd,
|
|
|
|
RATE_DISTORTION* rd, int other_cost, MACROBLOCK *x)
|
|
|
|
{
|
|
|
|
MB_PREDICTION_MODE this_mode = x->e_mbd.mode_info_context->mbmi.mode;
|
|
|
|
|
|
|
|
other_cost +=
|
|
|
|
x->ref_frame_cost[x->e_mbd.mode_info_context->mbmi.ref_frame];
|
|
|
|
|
|
|
|
/* Calculate the final y RD estimate for this mode */
|
|
|
|
best_mode->yrd = RDCOST(x->rdmult, x->rddiv, (rd->rate2-rd->rate_uv-other_cost),
|
|
|
|
(rd->distortion2-rd->distortion_uv));
|
|
|
|
|
|
|
|
best_mode->rd = this_rd;
|
|
|
|
vpx_memcpy(&best_mode->mbmode, &x->e_mbd.mode_info_context->mbmi, sizeof(MB_MODE_INFO));
|
|
|
|
vpx_memcpy(&best_mode->partition, x->partition_info, sizeof(PARTITION_INFO));
|
|
|
|
|
|
|
|
if ((this_mode == B_PRED) || (this_mode == SPLITMV))
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
{
|
|
|
|
best_mode->bmodes[i] = x->e_mbd.block[i].bmi;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-01-11 23:38:58 +01:00
|
|
|
|
2011-12-14 21:35:04 +01:00
|
|
|
void vp8_rd_pick_inter_mode(VP8_COMP *cpi, MACROBLOCK *x, int recon_yoffset,
|
|
|
|
int recon_uvoffset, int *returnrate,
|
|
|
|
int *returndistortion, int *returnintra)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
|
|
|
BLOCK *b = &x->block[0];
|
|
|
|
BLOCKD *d = &x->e_mbd.block[0];
|
|
|
|
MACROBLOCKD *xd = &x->e_mbd;
|
2012-01-25 23:55:49 +01:00
|
|
|
int_mv best_ref_mv_sb[2];
|
|
|
|
int_mv mode_mv_sb[2][MB_MODE_COUNT];
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv best_ref_mv;
|
2012-01-25 23:55:49 +01:00
|
|
|
int_mv *mode_mv;
|
2010-05-18 17:58:33 +02:00
|
|
|
MB_PREDICTION_MODE this_mode;
|
|
|
|
int num00;
|
|
|
|
int best_mode_index = 0;
|
2012-03-06 10:48:18 +01:00
|
|
|
BEST_MODE best_mode;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
int i;
|
|
|
|
int mode_index;
|
|
|
|
int mdcounts[4];
|
|
|
|
int rate;
|
2012-03-06 10:48:18 +01:00
|
|
|
RATE_DISTORTION rd;
|
2010-05-18 17:58:33 +02:00
|
|
|
int uv_intra_rate, uv_intra_distortion, uv_intra_rate_tokenonly;
|
2012-02-17 15:15:08 +01:00
|
|
|
int uv_intra_tteob = 0;
|
2012-02-27 23:38:53 +01:00
|
|
|
int uv_intra_done = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-02-27 23:38:53 +01:00
|
|
|
MB_PREDICTION_MODE uv_intra_mode = 0;
|
2011-05-12 16:50:16 +02:00
|
|
|
int_mv mvp;
|
2011-01-25 21:54:34 +01:00
|
|
|
int near_sadidx[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
2010-12-03 17:26:21 +01:00
|
|
|
int saddone=0;
|
2012-05-21 23:30:56 +02:00
|
|
|
/* search range got from mv_pred(). It uses step_param levels. (0-7) */
|
|
|
|
int sr=0;
|
2010-12-03 17:26:21 +01:00
|
|
|
|
2012-01-11 23:38:58 +01:00
|
|
|
unsigned char *plane[4][3];
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
int ref_frame_map[4];
|
2011-12-14 21:35:04 +01:00
|
|
|
int sign_bias = 0;
|
2011-01-11 21:00:00 +01:00
|
|
|
|
2012-02-29 18:03:13 +01:00
|
|
|
int intra_rd_penalty = 10* vp8_dc_quant(cpi->common.base_qindex,
|
|
|
|
cpi->common.y1dc_delta_q);
|
|
|
|
|
2012-05-24 16:44:03 +02:00
|
|
|
#if CONFIG_TEMPORAL_DENOISING
|
|
|
|
unsigned int zero_mv_sse = INT_MAX, best_sse = INT_MAX,
|
|
|
|
best_rd_sse = INT_MAX;
|
|
|
|
#endif
|
|
|
|
|
2012-01-25 23:55:49 +01:00
|
|
|
mode_mv = mode_mv_sb[sign_bias];
|
|
|
|
best_ref_mv.as_int = 0;
|
2012-03-06 10:48:18 +01:00
|
|
|
best_mode.rd = INT_MAX;
|
|
|
|
best_mode.yrd = INT_MAX;
|
|
|
|
best_mode.intra_rd = INT_MAX;
|
2012-01-25 23:55:49 +01:00
|
|
|
vpx_memset(mode_mv_sb, 0, sizeof(mode_mv_sb));
|
2012-03-06 10:48:18 +01:00
|
|
|
vpx_memset(&best_mode.mbmode, 0, sizeof(best_mode.mbmode));
|
|
|
|
vpx_memset(&best_mode.bmodes, 0, sizeof(best_mode.bmodes));
|
2011-01-11 21:00:00 +01:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
/* Setup search priorities */
|
2012-01-11 23:38:58 +01:00
|
|
|
get_reference_search_order(cpi, ref_frame_map);
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
|
2011-12-14 21:35:04 +01:00
|
|
|
/* Check to see if there is at least 1 valid reference frame that we need
|
|
|
|
* to calculate near_mvs.
|
|
|
|
*/
|
|
|
|
if (ref_frame_map[1] > 0)
|
|
|
|
{
|
2012-01-25 23:55:49 +01:00
|
|
|
sign_bias = vp8_find_near_mvs_bias(&x->e_mbd,
|
|
|
|
x->e_mbd.mode_info_context,
|
|
|
|
mode_mv_sb,
|
|
|
|
best_ref_mv_sb,
|
|
|
|
mdcounts,
|
|
|
|
ref_frame_map[1],
|
|
|
|
cpi->common.ref_frame_sign_bias);
|
|
|
|
|
|
|
|
mode_mv = mode_mv_sb[sign_bias];
|
|
|
|
best_ref_mv.as_int = best_ref_mv_sb[sign_bias].as_int;
|
2011-12-14 21:35:04 +01:00
|
|
|
}
|
|
|
|
|
2012-01-11 23:38:58 +01:00
|
|
|
get_predictor_pointers(cpi, plane, recon_yoffset, recon_uvoffset);
|
2011-01-11 21:00:00 +01:00
|
|
|
|
|
|
|
*returnintra = INT_MAX;
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Count of the number of MBs tested so far this frame */
|
|
|
|
cpi->mbs_tested_so_far++;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
x->skip = 0;
|
|
|
|
|
|
|
|
for (mode_index = 0; mode_index < MAX_MODES; mode_index++)
|
|
|
|
{
|
|
|
|
int this_rd = INT_MAX;
|
|
|
|
int disable_skip = 0;
|
2010-12-16 15:38:02 +01:00
|
|
|
int other_cost = 0;
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
int this_ref_frame = ref_frame_map[vp8_ref_frame_order[mode_index]];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Test best rd so far against threshold for trying this mode. */
|
2012-03-06 10:48:18 +01:00
|
|
|
if (best_mode.rd <= cpi->rd_threshes[mode_index])
|
2010-05-18 17:58:33 +02:00
|
|
|
continue;
|
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
if (this_ref_frame < 0)
|
|
|
|
continue;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* These variables hold are rolling total cost and distortion for
|
|
|
|
* this mode
|
|
|
|
*/
|
2012-03-06 10:48:18 +01:00
|
|
|
rd.rate2 = 0;
|
|
|
|
rd.distortion2 = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
this_mode = vp8_mode_order[mode_index];
|
|
|
|
|
2010-08-12 22:25:43 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.mode = this_mode;
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame = this_ref_frame;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Only consider ZEROMV/ALTREF_FRAME for alt ref frame,
|
|
|
|
* unless ARNR filtering is enabled in which case we want
|
|
|
|
* an unfiltered alternative
|
|
|
|
*/
|
2011-01-14 15:52:15 +01:00
|
|
|
if (cpi->is_src_frame_alt_ref && (cpi->oxcf.arnr_max_frames == 0))
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2010-08-12 22:25:43 +02:00
|
|
|
if (this_mode != ZEROMV || x->e_mbd.mode_info_context->mbmi.ref_frame != ALTREF_FRAME)
|
2010-05-18 17:58:33 +02:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2011-01-11 21:00:00 +01:00
|
|
|
/* everything but intra */
|
|
|
|
if (x->e_mbd.mode_info_context->mbmi.ref_frame)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2012-01-11 23:38:58 +01:00
|
|
|
x->e_mbd.pre.y_buffer = plane[this_ref_frame][0];
|
|
|
|
x->e_mbd.pre.u_buffer = plane[this_ref_frame][1];
|
|
|
|
x->e_mbd.pre.v_buffer = plane[this_ref_frame][2];
|
2011-12-14 21:35:04 +01:00
|
|
|
|
2012-01-25 23:55:49 +01:00
|
|
|
if (sign_bias != cpi->common.ref_frame_sign_bias[this_ref_frame])
|
2011-12-14 21:35:04 +01:00
|
|
|
{
|
2012-01-25 23:55:49 +01:00
|
|
|
sign_bias = cpi->common.ref_frame_sign_bias[this_ref_frame];
|
|
|
|
mode_mv = mode_mv_sb[sign_bias];
|
|
|
|
best_ref_mv.as_int = best_ref_mv_sb[sign_bias].as_int;
|
2011-12-14 21:35:04 +01:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Check to see if the testing frequency for this mode is at its
|
|
|
|
* max If so then prevent it from being tested and increase the
|
|
|
|
* threshold for its testing
|
|
|
|
*/
|
2010-05-18 17:58:33 +02:00
|
|
|
if (cpi->mode_test_hit_counts[mode_index] && (cpi->mode_check_freq[mode_index] > 1))
|
|
|
|
{
|
|
|
|
if (cpi->mbs_tested_so_far <= cpi->mode_check_freq[mode_index] * cpi->mode_test_hit_counts[mode_index])
|
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Increase the threshold for coding this mode to make it
|
|
|
|
* less likely to be chosen
|
|
|
|
*/
|
2010-05-18 17:58:33 +02:00
|
|
|
cpi->rd_thresh_mult[mode_index] += 4;
|
|
|
|
|
|
|
|
if (cpi->rd_thresh_mult[mode_index] > MAX_THRESHMULT)
|
|
|
|
cpi->rd_thresh_mult[mode_index] = MAX_THRESHMULT;
|
|
|
|
|
|
|
|
cpi->rd_threshes[mode_index] = (cpi->rd_baseline_thresh[mode_index] >> 7) * cpi->rd_thresh_mult[mode_index];
|
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* We have now reached the point where we are going to test the
|
|
|
|
* current mode so increment the counter for the number of times
|
|
|
|
* it has been tested
|
|
|
|
*/
|
2010-05-18 17:58:33 +02:00
|
|
|
cpi->mode_test_hit_counts[mode_index] ++;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Experimental code. Special case for gf and arf zeromv modes.
|
|
|
|
* Increase zbin size to supress noise
|
|
|
|
*/
|
2010-05-18 17:58:33 +02:00
|
|
|
if (cpi->zbin_mode_boost_enabled)
|
|
|
|
{
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
if ( this_ref_frame == INTRA_FRAME )
|
2010-05-18 17:58:33 +02:00
|
|
|
cpi->zbin_mode_boost = 0;
|
2010-11-08 16:28:54 +01:00
|
|
|
else
|
|
|
|
{
|
|
|
|
if (vp8_mode_order[mode_index] == ZEROMV)
|
|
|
|
{
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
if (this_ref_frame != LAST_FRAME)
|
2010-11-08 16:28:54 +01:00
|
|
|
cpi->zbin_mode_boost = GF_ZEROMV_ZBIN_BOOST;
|
|
|
|
else
|
|
|
|
cpi->zbin_mode_boost = LF_ZEROMV_ZBIN_BOOST;
|
|
|
|
}
|
2011-03-08 02:58:37 +01:00
|
|
|
else if (vp8_mode_order[mode_index] == SPLITMV)
|
2010-11-08 16:28:54 +01:00
|
|
|
cpi->zbin_mode_boost = 0;
|
|
|
|
else
|
|
|
|
cpi->zbin_mode_boost = MV_ZBIN_BOOST;
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2010-12-29 20:30:57 +01:00
|
|
|
vp8_update_zbin_extra(cpi, x);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2012-02-27 23:38:53 +01:00
|
|
|
if(!uv_intra_done && this_ref_frame == INTRA_FRAME)
|
|
|
|
{
|
|
|
|
rd_pick_intra_mbuv_mode(cpi, x, &uv_intra_rate,
|
|
|
|
&uv_intra_rate_tokenonly,
|
|
|
|
&uv_intra_distortion);
|
|
|
|
uv_intra_mode = x->e_mbd.mode_info_context->mbmi.uv_mode;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Total of the eobs is used later to further adjust rate2. Since uv
|
|
|
|
* block's intra eobs will be overwritten when we check inter modes,
|
|
|
|
* we need to save uv_intra_tteob here.
|
|
|
|
*/
|
|
|
|
for (i = 16; i < 24; i++)
|
|
|
|
uv_intra_tteob += x->e_mbd.eobs[i];
|
|
|
|
|
|
|
|
uv_intra_done = 1;
|
|
|
|
}
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
switch (this_mode)
|
|
|
|
{
|
|
|
|
case B_PRED:
|
2011-02-08 22:50:43 +01:00
|
|
|
{
|
|
|
|
int tmp_rd;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Note the rate value returned here includes the cost of
|
|
|
|
* coding the BPRED mode: x->mbmode_cost[x->e_mbd.frame_type][BPRED]
|
|
|
|
*/
|
2012-03-06 10:48:18 +01:00
|
|
|
int distortion;
|
|
|
|
tmp_rd = rd_pick_intra4x4mby_modes(cpi, x, &rate, &rd.rate_y, &distortion, best_mode.yrd);
|
|
|
|
rd.rate2 += rate;
|
|
|
|
rd.distortion2 += distortion;
|
2011-02-08 22:50:43 +01:00
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
if(tmp_rd < best_mode.yrd)
|
2011-02-08 22:50:43 +01:00
|
|
|
{
|
2012-03-06 10:48:18 +01:00
|
|
|
rd.rate2 += uv_intra_rate;
|
|
|
|
rd.rate_uv = uv_intra_rate_tokenonly;
|
|
|
|
rd.distortion2 += uv_intra_distortion;
|
|
|
|
rd.distortion_uv = uv_intra_distortion;
|
2011-02-08 22:50:43 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
this_rd = INT_MAX;
|
|
|
|
disable_skip = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
case SPLITMV:
|
|
|
|
{
|
|
|
|
int tmp_rd;
|
2010-12-06 22:42:52 +01:00
|
|
|
int this_rd_thresh;
|
2012-03-06 10:48:18 +01:00
|
|
|
int distortion;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
Speed selection support for disabled reference frames
There was an implicit reference frame test order (typically LAST,
GOLD, ARF) in the mode selection logic, but this doesn't provide the
expected results when some reference frames are disabled. For
instance, in real-time mode, the speed selection logic often disables
the ARF modes. So if the user disables the LAST and GOLD frames, the
encoder was always choosing INTRA, when in reality searching the ARF
in this case has the same speed penalty as searching LAST would have
had.
Instead, introduce the notion of a reference frame search order. This
patch preserves the former priorities, so if a frame is disabled, the
other frames bump up a slot to take its place. This patch lays the
groundwork for doing something smarter in the frame test order, for
example considering temporal distance or looking at the frames used by
nearby blocks.
Change-Id: I1199149f8662a408537c653d2c021c7f1d29a700
2011-11-18 21:47:16 +01:00
|
|
|
this_rd_thresh = (vp8_ref_frame_order[mode_index] == 1) ? cpi->rd_threshes[THR_NEW1] : cpi->rd_threshes[THR_NEW3];
|
|
|
|
this_rd_thresh = (vp8_ref_frame_order[mode_index] == 2) ? cpi->rd_threshes[THR_NEW2] : this_rd_thresh;
|
2010-12-06 22:42:52 +01:00
|
|
|
|
|
|
|
tmp_rd = vp8_rd_pick_best_mbsegmentation(cpi, x, &best_ref_mv,
|
2012-03-06 10:48:18 +01:00
|
|
|
best_mode.yrd, mdcounts,
|
|
|
|
&rate, &rd.rate_y, &distortion, this_rd_thresh) ;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
rd.rate2 += rate;
|
|
|
|
rd.distortion2 += distortion;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* If even the 'Y' rd value of split is higher than best so far
|
|
|
|
* then dont bother looking at UV
|
|
|
|
*/
|
2012-03-06 10:48:18 +01:00
|
|
|
if (tmp_rd < best_mode.yrd)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Now work out UV cost and add it in */
|
2012-03-06 10:48:18 +01:00
|
|
|
rd_inter4x4_uv(cpi, x, &rd.rate_uv, &rd.distortion_uv, cpi->common.full_pixel);
|
|
|
|
rd.rate2 += rd.rate_uv;
|
|
|
|
rd.distortion2 += rd.distortion_uv;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
this_rd = INT_MAX;
|
|
|
|
disable_skip = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case DC_PRED:
|
|
|
|
case V_PRED:
|
|
|
|
case H_PRED:
|
|
|
|
case TM_PRED:
|
2012-03-06 10:48:18 +01:00
|
|
|
{
|
|
|
|
int distortion;
|
2010-08-12 22:25:43 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame = INTRA_FRAME;
|
2012-03-20 20:11:42 +01:00
|
|
|
|
|
|
|
vp8_build_intra_predictors_mby_s(xd,
|
|
|
|
xd->dst.y_buffer - xd->dst.y_stride,
|
|
|
|
xd->dst.y_buffer - 1,
|
|
|
|
xd->dst.y_stride,
|
|
|
|
xd->predictor,
|
|
|
|
16);
|
2012-03-06 10:48:18 +01:00
|
|
|
macro_block_yrd(x, &rd.rate_y, &distortion) ;
|
|
|
|
rd.rate2 += rd.rate_y;
|
|
|
|
rd.distortion2 += distortion;
|
|
|
|
rd.rate2 += x->mbmode_cost[x->e_mbd.frame_type][x->e_mbd.mode_info_context->mbmi.mode];
|
|
|
|
rd.rate2 += uv_intra_rate;
|
|
|
|
rd.rate_uv = uv_intra_rate_tokenonly;
|
|
|
|
rd.distortion2 += uv_intra_distortion;
|
|
|
|
rd.distortion_uv = uv_intra_distortion;
|
|
|
|
}
|
|
|
|
break;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
case NEWMV:
|
2011-05-06 18:51:31 +02:00
|
|
|
{
|
|
|
|
int thissme;
|
|
|
|
int bestsme = INT_MAX;
|
|
|
|
int step_param = cpi->sf.first_step;
|
|
|
|
int further_steps;
|
|
|
|
int n;
|
|
|
|
int do_refine=1; /* If last step (1-away) of n-step search doesn't pick the center point as the best match,
|
|
|
|
we will do a final 1-away diamond refining search */
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-06-01 20:41:05 +02:00
|
|
|
int sadpb = x->sadperbit16;
|
2011-07-07 17:21:41 +02:00
|
|
|
int_mv mvp_full;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-12-22 01:11:31 +01:00
|
|
|
int col_min = ((best_ref_mv.as_mv.col+7)>>3) - MAX_FULL_PEL_VAL;
|
|
|
|
int row_min = ((best_ref_mv.as_mv.row+7)>>3) - MAX_FULL_PEL_VAL;
|
2011-07-07 17:21:41 +02:00
|
|
|
int col_max = (best_ref_mv.as_mv.col>>3) + MAX_FULL_PEL_VAL;
|
|
|
|
int row_max = (best_ref_mv.as_mv.row>>3) + MAX_FULL_PEL_VAL;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
int tmp_col_min = x->mv_col_min;
|
|
|
|
int tmp_col_max = x->mv_col_max;
|
|
|
|
int tmp_row_min = x->mv_row_min;
|
|
|
|
int tmp_row_max = x->mv_row_max;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-07-08 20:08:45 +02:00
|
|
|
if(!saddone)
|
|
|
|
{
|
|
|
|
vp8_cal_sad(cpi,xd,x, recon_yoffset ,&near_sadidx[0] );
|
|
|
|
saddone = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
vp8_mv_pred(cpi, &x->e_mbd, x->e_mbd.mode_info_context, &mvp,
|
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame, cpi->common.ref_frame_sign_bias, &sr, &near_sadidx[0]);
|
|
|
|
|
2011-07-07 17:21:41 +02:00
|
|
|
mvp_full.as_mv.col = mvp.as_mv.col>>3;
|
|
|
|
mvp_full.as_mv.row = mvp.as_mv.row>>3;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Get intersection of UMV window and valid MV window to
|
|
|
|
* reduce # of checks in diamond search.
|
|
|
|
*/
|
2011-05-06 18:51:31 +02:00
|
|
|
if (x->mv_col_min < col_min )
|
|
|
|
x->mv_col_min = col_min;
|
|
|
|
if (x->mv_col_max > col_max )
|
|
|
|
x->mv_col_max = col_max;
|
|
|
|
if (x->mv_row_min < row_min )
|
|
|
|
x->mv_row_min = row_min;
|
|
|
|
if (x->mv_row_max > row_max )
|
|
|
|
x->mv_row_max = row_max;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* adjust search range according to sr from mv prediction */
|
2011-05-06 18:51:31 +02:00
|
|
|
if(sr > step_param)
|
|
|
|
step_param = sr;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Initial step/diamond search */
|
2011-05-06 18:51:31 +02:00
|
|
|
{
|
2011-07-07 17:21:41 +02:00
|
|
|
bestsme = cpi->diamond_search_sad(x, b, d, &mvp_full, &d->bmi.mv,
|
2010-07-01 03:58:54 +02:00
|
|
|
step_param, sadpb, &num00,
|
|
|
|
&cpi->fn_ptr[BLOCK_16X16],
|
|
|
|
x->mvcost, &best_ref_mv);
|
2011-05-12 16:50:16 +02:00
|
|
|
mode_mv[NEWMV].as_int = d->bmi.mv.as_int;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Further step/diamond searches as necessary */
|
2011-05-06 18:51:31 +02:00
|
|
|
n = 0;
|
|
|
|
further_steps = (cpi->sf.max_step_search_steps - 1) - step_param;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
n = num00;
|
|
|
|
num00 = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
/* If there won't be more n-step search, check to see if refining search is needed. */
|
|
|
|
if (n > further_steps)
|
|
|
|
do_refine = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
while (n < further_steps)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-06 18:51:31 +02:00
|
|
|
n++;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
if (num00)
|
|
|
|
num00--;
|
2010-05-18 17:58:33 +02:00
|
|
|
else
|
|
|
|
{
|
2011-07-07 17:21:41 +02:00
|
|
|
thissme = cpi->diamond_search_sad(x, b, d, &mvp_full,
|
2010-07-01 03:58:54 +02:00
|
|
|
&d->bmi.mv, step_param + n, sadpb, &num00,
|
|
|
|
&cpi->fn_ptr[BLOCK_16X16], x->mvcost,
|
|
|
|
&best_ref_mv);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
/* check to see if refining search is needed. */
|
|
|
|
if (num00 > (further_steps-n))
|
|
|
|
do_refine = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
if (thissme < bestsme)
|
|
|
|
{
|
|
|
|
bestsme = thissme;
|
2011-05-12 16:50:16 +02:00
|
|
|
mode_mv[NEWMV].as_int = d->bmi.mv.as_int;
|
2011-05-06 18:51:31 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
d->bmi.mv.as_int = mode_mv[NEWMV].as_int;
|
2011-05-06 18:51:31 +02:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
}
|
2011-05-06 18:51:31 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* final 1-away diamond refining search */
|
|
|
|
if (do_refine == 1)
|
|
|
|
{
|
|
|
|
int search_range;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
search_range = 8;
|
2010-12-14 23:39:25 +01:00
|
|
|
|
2010-07-01 03:58:54 +02:00
|
|
|
thissme = cpi->refining_search_sad(x, b, d, &d->bmi.mv, sadpb,
|
|
|
|
search_range, &cpi->fn_ptr[BLOCK_16X16],
|
|
|
|
x->mvcost, &best_ref_mv);
|
2011-05-06 18:51:31 +02:00
|
|
|
|
|
|
|
if (thissme < bestsme)
|
2011-04-18 21:48:34 +02:00
|
|
|
{
|
2011-05-06 18:51:31 +02:00
|
|
|
bestsme = thissme;
|
2011-05-12 16:50:16 +02:00
|
|
|
mode_mv[NEWMV].as_int = d->bmi.mv.as_int;
|
2011-04-14 21:53:33 +02:00
|
|
|
}
|
2011-05-06 18:51:31 +02:00
|
|
|
else
|
|
|
|
{
|
2011-05-12 16:50:16 +02:00
|
|
|
d->bmi.mv.as_int = mode_mv[NEWMV].as_int;
|
2011-05-06 18:51:31 +02:00
|
|
|
}
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
x->mv_col_min = tmp_col_min;
|
|
|
|
x->mv_col_max = tmp_col_max;
|
|
|
|
x->mv_row_min = tmp_row_min;
|
|
|
|
x->mv_row_max = tmp_row_max;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-06 18:51:31 +02:00
|
|
|
if (bestsme < INT_MAX)
|
|
|
|
{
|
|
|
|
int dis; /* TODO: use dis in distortion calculation later. */
|
|
|
|
unsigned int sse;
|
2011-06-01 20:41:05 +02:00
|
|
|
cpi->find_fractional_mv_step(x, b, d, &d->bmi.mv, &best_ref_mv,
|
|
|
|
x->errorperbit,
|
|
|
|
&cpi->fn_ptr[BLOCK_16X16],
|
|
|
|
x->mvcost, &dis, &sse);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2011-05-12 16:50:16 +02:00
|
|
|
mode_mv[NEWMV].as_int = d->bmi.mv.as_int;
|
2011-05-06 18:51:31 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Add the new motion vector cost to our rolling cost variable */
|
2012-03-06 10:48:18 +01:00
|
|
|
rd.rate2 += vp8_mv_bit_cost(&mode_mv[NEWMV], &best_ref_mv, x->mvcost, 96);
|
2011-05-06 18:51:31 +02:00
|
|
|
}
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
case NEARESTMV:
|
|
|
|
case NEARMV:
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Clip "next_nearest" so that it does not extend to far out
|
|
|
|
* of image
|
|
|
|
*/
|
2011-05-12 16:50:16 +02:00
|
|
|
vp8_clamp_mv2(&mode_mv[this_mode], xd);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Do not bother proceeding if the vector (from newmv, nearest
|
|
|
|
* or near) is 0,0 as this should then be coded using the zeromv
|
|
|
|
* mode.
|
|
|
|
*/
|
2011-05-12 16:50:16 +02:00
|
|
|
if (((this_mode == NEARMV) || (this_mode == NEARESTMV)) && (mode_mv[this_mode].as_int == 0))
|
2010-05-18 17:58:33 +02:00
|
|
|
continue;
|
|
|
|
|
|
|
|
case ZEROMV:
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Trap vectors that reach beyond the UMV borders
|
|
|
|
* Note that ALL New MV, Nearest MV Near MV and Zero MV code
|
|
|
|
* drops through to this point because of the lack of break
|
|
|
|
* statements in the previous two cases.
|
|
|
|
*/
|
2011-05-12 16:50:16 +02:00
|
|
|
if (((mode_mv[this_mode].as_mv.row >> 3) < x->mv_row_min) || ((mode_mv[this_mode].as_mv.row >> 3) > x->mv_row_max) ||
|
|
|
|
((mode_mv[this_mode].as_mv.col >> 3) < x->mv_col_min) || ((mode_mv[this_mode].as_mv.col >> 3) > x->mv_col_max))
|
2010-05-18 17:58:33 +02:00
|
|
|
continue;
|
|
|
|
|
|
|
|
vp8_set_mbmode_and_mvs(x, this_mode, &mode_mv[this_mode]);
|
2012-03-06 10:48:18 +01:00
|
|
|
this_rd = evaluate_inter_mode_rd(mdcounts, &rd,
|
|
|
|
&disable_skip, cpi, x);
|
2010-05-18 17:58:33 +02:00
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
this_rd = calculate_final_rd_costs(this_rd, &rd, &other_cost,
|
|
|
|
disable_skip, uv_intra_tteob,
|
|
|
|
intra_rd_penalty, cpi, x);
|
2010-12-16 15:38:02 +01:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Keep record of best intra distortion */
|
2012-03-06 10:48:18 +01:00
|
|
|
if ((x->e_mbd.mode_info_context->mbmi.ref_frame == INTRA_FRAME) &&
|
|
|
|
(this_rd < best_mode.intra_rd) )
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2012-03-06 10:48:18 +01:00
|
|
|
best_mode.intra_rd = this_rd;
|
|
|
|
*returnintra = rd.distortion2 ;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2012-03-06 10:48:18 +01:00
|
|
|
#if CONFIG_TEMPORAL_DENOISING
|
|
|
|
if (cpi->oxcf.noise_sensitivity)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2012-05-24 16:44:03 +02:00
|
|
|
unsigned int sse;
|
|
|
|
vp8_get_inter_mbpred_error(x,&cpi->fn_ptr[BLOCK_16X16],&sse,
|
|
|
|
mode_mv[this_mode]);
|
|
|
|
|
|
|
|
if (sse < best_rd_sse)
|
|
|
|
best_rd_sse = sse;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Store for later use by denoiser. */
|
2012-05-24 16:44:03 +02:00
|
|
|
if (this_mode == ZEROMV && sse < zero_mv_sse )
|
|
|
|
{
|
|
|
|
zero_mv_sse = sse;
|
|
|
|
x->best_zeromv_reference_frame =
|
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame;
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Store the best NEWMV in x for later use in the denoiser. */
|
2012-05-24 16:44:03 +02:00
|
|
|
if (x->e_mbd.mode_info_context->mbmi.mode == NEWMV &&
|
|
|
|
sse < best_sse)
|
|
|
|
{
|
|
|
|
best_sse = sse;
|
|
|
|
vp8_get_inter_mbpred_error(x,&cpi->fn_ptr[BLOCK_16X16],&best_sse,
|
|
|
|
mode_mv[this_mode]);
|
|
|
|
x->best_sse_inter_mode = NEWMV;
|
|
|
|
x->best_sse_mv = x->e_mbd.mode_info_context->mbmi.mv;
|
|
|
|
x->need_to_clamp_best_mvs =
|
|
|
|
x->e_mbd.mode_info_context->mbmi.need_to_clamp_mvs;
|
|
|
|
x->best_reference_frame =
|
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame;
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2012-03-06 10:48:18 +01:00
|
|
|
#endif
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Did this mode help.. i.i is it the new best mode */
|
2012-03-06 10:48:18 +01:00
|
|
|
if (this_rd < best_mode.rd || x->skip)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Note index of best mode so far */
|
2010-05-18 17:58:33 +02:00
|
|
|
best_mode_index = mode_index;
|
2012-03-06 10:48:18 +01:00
|
|
|
*returnrate = rd.rate2;
|
|
|
|
*returndistortion = rd.distortion2;
|
2010-05-18 17:58:33 +02:00
|
|
|
if (this_mode <= B_PRED)
|
|
|
|
{
|
2010-08-12 22:25:43 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.uv_mode = uv_intra_mode;
|
2011-05-24 19:24:52 +02:00
|
|
|
/* required for left and above block mv */
|
|
|
|
x->e_mbd.mode_info_context->mbmi.mv.as_int = 0;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2012-03-06 10:48:18 +01:00
|
|
|
update_best_mode(&best_mode, this_rd, &rd, other_cost, x);
|
2011-06-02 19:46:41 +02:00
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Testing this mode gave rise to an improvement in best error
|
|
|
|
* score. Lower threshold a bit for next time
|
|
|
|
*/
|
2010-05-18 17:58:33 +02:00
|
|
|
cpi->rd_thresh_mult[mode_index] = (cpi->rd_thresh_mult[mode_index] >= (MIN_THRESHMULT + 2)) ? cpi->rd_thresh_mult[mode_index] - 2 : MIN_THRESHMULT;
|
|
|
|
cpi->rd_threshes[mode_index] = (cpi->rd_baseline_thresh[mode_index] >> 7) * cpi->rd_thresh_mult[mode_index];
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* If the mode did not help improve the best error case then raise
|
|
|
|
* the threshold for testing that mode next time around.
|
|
|
|
*/
|
2010-05-18 17:58:33 +02:00
|
|
|
else
|
|
|
|
{
|
|
|
|
cpi->rd_thresh_mult[mode_index] += 4;
|
|
|
|
|
|
|
|
if (cpi->rd_thresh_mult[mode_index] > MAX_THRESHMULT)
|
|
|
|
cpi->rd_thresh_mult[mode_index] = MAX_THRESHMULT;
|
|
|
|
|
|
|
|
cpi->rd_threshes[mode_index] = (cpi->rd_baseline_thresh[mode_index] >> 7) * cpi->rd_thresh_mult[mode_index];
|
|
|
|
}
|
|
|
|
|
|
|
|
if (x->skip)
|
|
|
|
break;
|
change the threshold of DC check for encode breakout
Previously, the DC check is to make sure there is no code-able
DC shift for quantizer Q0, which has been verified rather
conservative. This commit changes the criteria to have two
components, DC and AC, to address the conservativeness. First,
it checks if all AC energy is enough to contribute a single
non-zero quantized AC coefficient. Second, for DC, the decision
to skip further considers two possible scenarios: 1. There is
no code-able 2nd order DC coefficient at all; 2 The residue is
relatively flat, but the uniform DC change is very small, i.e.
less than 1/2 gray level per pixel.
Comparing to previous criteria, the new criteria is about 10%
to 15% faster in encoding time with a very small quality loss.
(threshold ~1000 and quality range 33db-45db)
It should be noted that this commit enables "automatic" static
threshold for encodebreakout if a non-zero small value is passed
in to encoder.
Change-Id: I0f77719a1ac2c2dfddbd950d84920df374515ce3
2011-01-20 01:21:01 +01:00
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Reduce the activation RD thresholds for the best choice mode */
|
2010-05-18 17:58:33 +02:00
|
|
|
if ((cpi->rd_baseline_thresh[best_mode_index] > 0) && (cpi->rd_baseline_thresh[best_mode_index] < (INT_MAX >> 2)))
|
|
|
|
{
|
|
|
|
int best_adjustment = (cpi->rd_thresh_mult[best_mode_index] >> 2);
|
|
|
|
|
|
|
|
cpi->rd_thresh_mult[best_mode_index] = (cpi->rd_thresh_mult[best_mode_index] >= (MIN_THRESHMULT + best_adjustment)) ? cpi->rd_thresh_mult[best_mode_index] - best_adjustment : MIN_THRESHMULT;
|
|
|
|
cpi->rd_threshes[best_mode_index] = (cpi->rd_baseline_thresh[best_mode_index] >> 7) * cpi->rd_thresh_mult[best_mode_index];
|
|
|
|
}
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Note how often each mode chosen as best */
|
2010-05-18 17:58:33 +02:00
|
|
|
cpi->mode_chosen_counts[best_mode_index] ++;
|
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
#if CONFIG_TEMPORAL_DENOISING
|
|
|
|
if (cpi->oxcf.noise_sensitivity)
|
|
|
|
{
|
2012-05-24 16:44:03 +02:00
|
|
|
if (x->best_sse_inter_mode == DC_PRED)
|
2012-03-06 10:48:18 +01:00
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* No best MV found. */
|
2012-05-24 16:44:03 +02:00
|
|
|
x->best_sse_inter_mode = best_mode.mbmode.mode;
|
|
|
|
x->best_sse_mv = best_mode.mbmode.mv;
|
|
|
|
x->need_to_clamp_best_mvs = best_mode.mbmode.need_to_clamp_mvs;
|
|
|
|
x->best_reference_frame = best_mode.mbmode.ref_frame;
|
|
|
|
best_sse = best_rd_sse;
|
2012-03-06 10:48:18 +01:00
|
|
|
}
|
2012-05-24 16:44:03 +02:00
|
|
|
vp8_denoiser_denoise_mb(&cpi->denoiser, x, best_sse, zero_mv_sse,
|
|
|
|
recon_yoffset, recon_uvoffset);
|
|
|
|
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Reevaluate ZEROMV after denoising. */
|
2012-05-24 16:44:03 +02:00
|
|
|
if (best_mode.mbmode.ref_frame == INTRA_FRAME &&
|
|
|
|
x->best_zeromv_reference_frame != INTRA_FRAME)
|
|
|
|
{
|
|
|
|
int this_rd = INT_MAX;
|
|
|
|
int disable_skip = 0;
|
|
|
|
int other_cost = 0;
|
|
|
|
int this_ref_frame = x->best_zeromv_reference_frame;
|
|
|
|
rd.rate2 = x->ref_frame_cost[this_ref_frame] +
|
|
|
|
vp8_cost_mv_ref(ZEROMV, mdcounts);
|
|
|
|
rd.distortion2 = 0;
|
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* set up the proper prediction buffers for the frame */
|
2012-05-24 16:44:03 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame = this_ref_frame;
|
|
|
|
x->e_mbd.pre.y_buffer = plane[this_ref_frame][0];
|
|
|
|
x->e_mbd.pre.u_buffer = plane[this_ref_frame][1];
|
|
|
|
x->e_mbd.pre.v_buffer = plane[this_ref_frame][2];
|
|
|
|
|
|
|
|
x->e_mbd.mode_info_context->mbmi.mode = ZEROMV;
|
|
|
|
x->e_mbd.mode_info_context->mbmi.uv_mode = DC_PRED;
|
|
|
|
x->e_mbd.mode_info_context->mbmi.mv.as_int = 0;
|
|
|
|
|
|
|
|
this_rd = evaluate_inter_mode_rd(mdcounts, &rd, &disable_skip, cpi, x);
|
|
|
|
this_rd = calculate_final_rd_costs(this_rd, &rd, &other_cost,
|
|
|
|
disable_skip, uv_intra_tteob,
|
|
|
|
intra_rd_penalty, cpi, x);
|
|
|
|
if (this_rd < best_mode.rd || x->skip)
|
|
|
|
{
|
2012-05-21 23:30:56 +02:00
|
|
|
/* Note index of best mode so far */
|
2012-05-24 16:44:03 +02:00
|
|
|
best_mode_index = mode_index;
|
|
|
|
*returnrate = rd.rate2;
|
|
|
|
*returndistortion = rd.distortion2;
|
|
|
|
update_best_mode(&best_mode, this_rd, &rd, other_cost, x);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
}
|
|
|
|
#endif
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2011-05-31 20:24:42 +02:00
|
|
|
if (cpi->is_src_frame_alt_ref &&
|
2012-03-06 10:48:18 +01:00
|
|
|
(best_mode.mbmode.mode != ZEROMV || best_mode.mbmode.ref_frame != ALTREF_FRAME))
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-31 20:24:42 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.mode = ZEROMV;
|
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame = ALTREF_FRAME;
|
2010-08-12 22:25:43 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.mv.as_int = 0;
|
2011-05-31 20:24:42 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.uv_mode = DC_PRED;
|
|
|
|
x->e_mbd.mode_info_context->mbmi.mb_skip_coeff =
|
2011-12-22 01:11:31 +01:00
|
|
|
(cpi->common.mb_no_coeff_skip);
|
2011-05-31 20:24:42 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.partitioning = 0;
|
2011-04-11 19:05:08 +02:00
|
|
|
return;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2011-05-31 20:24:42 +02:00
|
|
|
|
2012-05-21 23:30:56 +02:00
|
|
|
/* macroblock modes */
|
2012-03-06 10:48:18 +01:00
|
|
|
vpx_memcpy(&x->e_mbd.mode_info_context->mbmi, &best_mode.mbmode, sizeof(MB_MODE_INFO));
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
if (best_mode.mbmode.mode == B_PRED)
|
2010-05-18 17:58:33 +02:00
|
|
|
{
|
2011-05-24 19:24:52 +02:00
|
|
|
for (i = 0; i < 16; i++)
|
2012-03-06 10:48:18 +01:00
|
|
|
xd->mode_info_context->bmi[i].as_mode = best_mode.bmodes[i].as_mode;
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
if (best_mode.mbmode.mode == SPLITMV)
|
2011-05-19 21:03:36 +02:00
|
|
|
{
|
2011-05-24 19:24:52 +02:00
|
|
|
for (i = 0; i < 16; i++)
|
2012-03-06 10:48:18 +01:00
|
|
|
xd->mode_info_context->bmi[i].mv.as_int = best_mode.bmodes[i].mv.as_int;
|
2011-05-24 19:24:52 +02:00
|
|
|
|
2012-03-06 10:48:18 +01:00
|
|
|
vpx_memcpy(x->partition_info, &best_mode.partition, sizeof(PARTITION_INFO));
|
2011-05-24 19:24:52 +02:00
|
|
|
|
2011-05-19 21:03:36 +02:00
|
|
|
x->e_mbd.mode_info_context->mbmi.mv.as_int =
|
|
|
|
x->partition_info->bmi[15].mv.as_int;
|
|
|
|
}
|
|
|
|
|
2011-12-14 21:35:04 +01:00
|
|
|
if (sign_bias
|
|
|
|
!= cpi->common.ref_frame_sign_bias[xd->mode_info_context->mbmi.ref_frame])
|
2012-01-25 23:55:49 +01:00
|
|
|
best_ref_mv.as_int = best_ref_mv_sb[!sign_bias].as_int;
|
2011-08-24 20:42:26 +02:00
|
|
|
|
2011-12-14 21:35:04 +01:00
|
|
|
rd_update_mvcount(cpi, x, &best_ref_mv);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2011-06-08 18:05:05 +02:00
|
|
|
|
|
|
|
void vp8_rd_pick_intra_mode(VP8_COMP *cpi, MACROBLOCK *x, int *rate_)
|
|
|
|
{
|
|
|
|
int error4x4, error16x16;
|
|
|
|
int rate4x4, rate16x16 = 0, rateuv;
|
|
|
|
int dist4x4, dist16x16, distuv;
|
|
|
|
int rate;
|
|
|
|
int rate4x4_tokenonly = 0;
|
|
|
|
int rate16x16_tokenonly = 0;
|
|
|
|
int rateuv_tokenonly = 0;
|
|
|
|
|
|
|
|
x->e_mbd.mode_info_context->mbmi.ref_frame = INTRA_FRAME;
|
|
|
|
|
|
|
|
rd_pick_intra_mbuv_mode(cpi, x, &rateuv, &rateuv_tokenonly, &distuv);
|
|
|
|
rate = rateuv;
|
|
|
|
|
|
|
|
error16x16 = rd_pick_intra16x16mby_mode(cpi, x,
|
|
|
|
&rate16x16, &rate16x16_tokenonly,
|
|
|
|
&dist16x16);
|
|
|
|
|
|
|
|
error4x4 = rd_pick_intra4x4mby_modes(cpi, x,
|
|
|
|
&rate4x4, &rate4x4_tokenonly,
|
|
|
|
&dist4x4, error16x16);
|
|
|
|
|
|
|
|
if (error4x4 < error16x16)
|
|
|
|
{
|
|
|
|
x->e_mbd.mode_info_context->mbmi.mode = B_PRED;
|
|
|
|
rate += rate4x4;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
rate += rate16x16;
|
|
|
|
}
|
|
|
|
|
|
|
|
*rate_ = rate;
|
|
|
|
}
|