11b362b15af34006e6a11974088a46d42b903418eJohann/* 21b362b15af34006e6a11974088a46d42b903418eJohann * Copyright (c) 2011 The WebM project authors. All Rights Reserved. 31b362b15af34006e6a11974088a46d42b903418eJohann * 41b362b15af34006e6a11974088a46d42b903418eJohann * Use of this source code is governed by a BSD-style license 51b362b15af34006e6a11974088a46d42b903418eJohann * that can be found in the LICENSE file in the root of the source 61b362b15af34006e6a11974088a46d42b903418eJohann * tree. An additional intellectual property rights grant can be found 71b362b15af34006e6a11974088a46d42b903418eJohann * in the file PATENTS. All contributing project authors may 81b362b15af34006e6a11974088a46d42b903418eJohann * be found in the AUTHORS file in the root of the source tree. 91b362b15af34006e6a11974088a46d42b903418eJohann */ 101b362b15af34006e6a11974088a46d42b903418eJohann 11ba164dffc5a6795bce97fae02b51ccf3330e15e4hkuang#include <assert.h> 12ba164dffc5a6795bce97fae02b51ccf3330e15e4hkuang 131b362b15af34006e6a11974088a46d42b903418eJohann#include "error_concealment.h" 141b362b15af34006e6a11974088a46d42b903418eJohann#include "onyxd_int.h" 151b362b15af34006e6a11974088a46d42b903418eJohann#include "decodemv.h" 161b362b15af34006e6a11974088a46d42b903418eJohann#include "vpx_mem/vpx_mem.h" 171b362b15af34006e6a11974088a46d42b903418eJohann#include "vp8/common/findnearmv.h" 181b362b15af34006e6a11974088a46d42b903418eJohann 191b362b15af34006e6a11974088a46d42b903418eJohann#define MIN(x,y) (((x)<(y))?(x):(y)) 201b362b15af34006e6a11974088a46d42b903418eJohann#define MAX(x,y) (((x)>(y))?(x):(y)) 211b362b15af34006e6a11974088a46d42b903418eJohann 221b362b15af34006e6a11974088a46d42b903418eJohann#define FLOOR(x,q) ((x) & -(1 << (q))) 231b362b15af34006e6a11974088a46d42b903418eJohann 241b362b15af34006e6a11974088a46d42b903418eJohann#define NUM_NEIGHBORS 20 251b362b15af34006e6a11974088a46d42b903418eJohann 261b362b15af34006e6a11974088a46d42b903418eJohanntypedef struct ec_position 271b362b15af34006e6a11974088a46d42b903418eJohann{ 281b362b15af34006e6a11974088a46d42b903418eJohann int row; 291b362b15af34006e6a11974088a46d42b903418eJohann int col; 301b362b15af34006e6a11974088a46d42b903418eJohann} EC_POS; 311b362b15af34006e6a11974088a46d42b903418eJohann 321b362b15af34006e6a11974088a46d42b903418eJohann/* 331b362b15af34006e6a11974088a46d42b903418eJohann * Regenerate the table in Matlab with: 341b362b15af34006e6a11974088a46d42b903418eJohann * x = meshgrid((1:4), (1:4)); 351b362b15af34006e6a11974088a46d42b903418eJohann * y = meshgrid((1:4), (1:4))'; 361b362b15af34006e6a11974088a46d42b903418eJohann * W = round((1./(sqrt(x.^2 + y.^2))*2^7)); 371b362b15af34006e6a11974088a46d42b903418eJohann * W(1,1) = 0; 381b362b15af34006e6a11974088a46d42b903418eJohann */ 391b362b15af34006e6a11974088a46d42b903418eJohannstatic const int weights_q7[5][5] = { 401b362b15af34006e6a11974088a46d42b903418eJohann { 0, 128, 64, 43, 32 }, 411b362b15af34006e6a11974088a46d42b903418eJohann {128, 91, 57, 40, 31 }, 421b362b15af34006e6a11974088a46d42b903418eJohann { 64, 57, 45, 36, 29 }, 431b362b15af34006e6a11974088a46d42b903418eJohann { 43, 40, 36, 30, 26 }, 441b362b15af34006e6a11974088a46d42b903418eJohann { 32, 31, 29, 26, 23 } 451b362b15af34006e6a11974088a46d42b903418eJohann}; 461b362b15af34006e6a11974088a46d42b903418eJohann 471b362b15af34006e6a11974088a46d42b903418eJohannint vp8_alloc_overlap_lists(VP8D_COMP *pbi) 481b362b15af34006e6a11974088a46d42b903418eJohann{ 491b362b15af34006e6a11974088a46d42b903418eJohann if (pbi->overlaps != NULL) 501b362b15af34006e6a11974088a46d42b903418eJohann { 511b362b15af34006e6a11974088a46d42b903418eJohann vpx_free(pbi->overlaps); 521b362b15af34006e6a11974088a46d42b903418eJohann pbi->overlaps = NULL; 531b362b15af34006e6a11974088a46d42b903418eJohann } 541b362b15af34006e6a11974088a46d42b903418eJohann 551b362b15af34006e6a11974088a46d42b903418eJohann pbi->overlaps = vpx_calloc(pbi->common.mb_rows * pbi->common.mb_cols, 561b362b15af34006e6a11974088a46d42b903418eJohann sizeof(MB_OVERLAP)); 571b362b15af34006e6a11974088a46d42b903418eJohann 581b362b15af34006e6a11974088a46d42b903418eJohann if (pbi->overlaps == NULL) 591b362b15af34006e6a11974088a46d42b903418eJohann return -1; 601b362b15af34006e6a11974088a46d42b903418eJohann 611b362b15af34006e6a11974088a46d42b903418eJohann return 0; 621b362b15af34006e6a11974088a46d42b903418eJohann} 631b362b15af34006e6a11974088a46d42b903418eJohann 641b362b15af34006e6a11974088a46d42b903418eJohannvoid vp8_de_alloc_overlap_lists(VP8D_COMP *pbi) 651b362b15af34006e6a11974088a46d42b903418eJohann{ 661b362b15af34006e6a11974088a46d42b903418eJohann vpx_free(pbi->overlaps); 671b362b15af34006e6a11974088a46d42b903418eJohann pbi->overlaps = NULL; 681b362b15af34006e6a11974088a46d42b903418eJohann} 691b362b15af34006e6a11974088a46d42b903418eJohann 701b362b15af34006e6a11974088a46d42b903418eJohann/* Inserts a new overlap area value to the list of overlaps of a block */ 711b362b15af34006e6a11974088a46d42b903418eJohannstatic void assign_overlap(OVERLAP_NODE* overlaps, 721b362b15af34006e6a11974088a46d42b903418eJohann union b_mode_info *bmi, 731b362b15af34006e6a11974088a46d42b903418eJohann int overlap) 741b362b15af34006e6a11974088a46d42b903418eJohann{ 751b362b15af34006e6a11974088a46d42b903418eJohann int i; 761b362b15af34006e6a11974088a46d42b903418eJohann if (overlap <= 0) 771b362b15af34006e6a11974088a46d42b903418eJohann return; 781b362b15af34006e6a11974088a46d42b903418eJohann /* Find and assign to the next empty overlap node in the list of overlaps. 791b362b15af34006e6a11974088a46d42b903418eJohann * Empty is defined as bmi == NULL */ 801b362b15af34006e6a11974088a46d42b903418eJohann for (i = 0; i < MAX_OVERLAPS; i++) 811b362b15af34006e6a11974088a46d42b903418eJohann { 821b362b15af34006e6a11974088a46d42b903418eJohann if (overlaps[i].bmi == NULL) 831b362b15af34006e6a11974088a46d42b903418eJohann { 841b362b15af34006e6a11974088a46d42b903418eJohann overlaps[i].bmi = bmi; 851b362b15af34006e6a11974088a46d42b903418eJohann overlaps[i].overlap = overlap; 861b362b15af34006e6a11974088a46d42b903418eJohann break; 871b362b15af34006e6a11974088a46d42b903418eJohann } 881b362b15af34006e6a11974088a46d42b903418eJohann } 891b362b15af34006e6a11974088a46d42b903418eJohann} 901b362b15af34006e6a11974088a46d42b903418eJohann 911b362b15af34006e6a11974088a46d42b903418eJohann/* Calculates the overlap area between two 4x4 squares, where the first 921b362b15af34006e6a11974088a46d42b903418eJohann * square has its upper-left corner at (b1_row, b1_col) and the second 931b362b15af34006e6a11974088a46d42b903418eJohann * square has its upper-left corner at (b2_row, b2_col). Doesn't 941b362b15af34006e6a11974088a46d42b903418eJohann * properly handle squares which do not overlap. 951b362b15af34006e6a11974088a46d42b903418eJohann */ 961b362b15af34006e6a11974088a46d42b903418eJohannstatic int block_overlap(int b1_row, int b1_col, int b2_row, int b2_col) 971b362b15af34006e6a11974088a46d42b903418eJohann{ 981b362b15af34006e6a11974088a46d42b903418eJohann const int int_top = MAX(b1_row, b2_row); // top 991b362b15af34006e6a11974088a46d42b903418eJohann const int int_left = MAX(b1_col, b2_col); // left 1001b362b15af34006e6a11974088a46d42b903418eJohann /* Since each block is 4x4 pixels, adding 4 (Q3) to the left/top edge 1011b362b15af34006e6a11974088a46d42b903418eJohann * gives us the right/bottom edge. 1021b362b15af34006e6a11974088a46d42b903418eJohann */ 1031b362b15af34006e6a11974088a46d42b903418eJohann const int int_right = MIN(b1_col + (4<<3), b2_col + (4<<3)); // right 1041b362b15af34006e6a11974088a46d42b903418eJohann const int int_bottom = MIN(b1_row + (4<<3), b2_row + (4<<3)); // bottom 1051b362b15af34006e6a11974088a46d42b903418eJohann return (int_bottom - int_top) * (int_right - int_left); 1061b362b15af34006e6a11974088a46d42b903418eJohann} 1071b362b15af34006e6a11974088a46d42b903418eJohann 1081b362b15af34006e6a11974088a46d42b903418eJohann/* Calculates the overlap area for all blocks in a macroblock at position 1091b362b15af34006e6a11974088a46d42b903418eJohann * (mb_row, mb_col) in macroblocks, which are being overlapped by a given 1101b362b15af34006e6a11974088a46d42b903418eJohann * overlapping block at position (new_row, new_col) (in pixels, Q3). The 1111b362b15af34006e6a11974088a46d42b903418eJohann * first block being overlapped in the macroblock has position (first_blk_row, 1121b362b15af34006e6a11974088a46d42b903418eJohann * first_blk_col) in blocks relative the upper-left corner of the image. 1131b362b15af34006e6a11974088a46d42b903418eJohann */ 1141b362b15af34006e6a11974088a46d42b903418eJohannstatic void calculate_overlaps_mb(B_OVERLAP *b_overlaps, union b_mode_info *bmi, 1151b362b15af34006e6a11974088a46d42b903418eJohann int new_row, int new_col, 1161b362b15af34006e6a11974088a46d42b903418eJohann int mb_row, int mb_col, 1171b362b15af34006e6a11974088a46d42b903418eJohann int first_blk_row, int first_blk_col) 1181b362b15af34006e6a11974088a46d42b903418eJohann{ 1191b362b15af34006e6a11974088a46d42b903418eJohann /* Find the blocks within this MB (defined by mb_row, mb_col) which are 1201b362b15af34006e6a11974088a46d42b903418eJohann * overlapped by bmi and calculate and assign overlap for each of those 1211b362b15af34006e6a11974088a46d42b903418eJohann * blocks. */ 1221b362b15af34006e6a11974088a46d42b903418eJohann 1231b362b15af34006e6a11974088a46d42b903418eJohann /* Block coordinates relative the upper-left block */ 1241b362b15af34006e6a11974088a46d42b903418eJohann const int rel_ol_blk_row = first_blk_row - mb_row * 4; 1251b362b15af34006e6a11974088a46d42b903418eJohann const int rel_ol_blk_col = first_blk_col - mb_col * 4; 1261b362b15af34006e6a11974088a46d42b903418eJohann /* If the block partly overlaps any previous MB, these coordinates 1271b362b15af34006e6a11974088a46d42b903418eJohann * can be < 0. We don't want to access blocks in previous MBs. 1281b362b15af34006e6a11974088a46d42b903418eJohann */ 1291b362b15af34006e6a11974088a46d42b903418eJohann const int blk_idx = MAX(rel_ol_blk_row,0) * 4 + MAX(rel_ol_blk_col,0); 1301b362b15af34006e6a11974088a46d42b903418eJohann /* Upper left overlapping block */ 1311b362b15af34006e6a11974088a46d42b903418eJohann B_OVERLAP *b_ol_ul = &(b_overlaps[blk_idx]); 1321b362b15af34006e6a11974088a46d42b903418eJohann 1331b362b15af34006e6a11974088a46d42b903418eJohann /* Calculate and assign overlaps for all blocks in this MB 1341b362b15af34006e6a11974088a46d42b903418eJohann * which the motion compensated block overlaps 1351b362b15af34006e6a11974088a46d42b903418eJohann */ 1361b362b15af34006e6a11974088a46d42b903418eJohann /* Avoid calculating overlaps for blocks in later MBs */ 1371b362b15af34006e6a11974088a46d42b903418eJohann int end_row = MIN(4 + mb_row * 4 - first_blk_row, 2); 1381b362b15af34006e6a11974088a46d42b903418eJohann int end_col = MIN(4 + mb_col * 4 - first_blk_col, 2); 1391b362b15af34006e6a11974088a46d42b903418eJohann int row, col; 1401b362b15af34006e6a11974088a46d42b903418eJohann 1411b362b15af34006e6a11974088a46d42b903418eJohann /* Check if new_row and new_col are evenly divisible by 4 (Q3), 1421b362b15af34006e6a11974088a46d42b903418eJohann * and if so we shouldn't check neighboring blocks 1431b362b15af34006e6a11974088a46d42b903418eJohann */ 1441b362b15af34006e6a11974088a46d42b903418eJohann if (new_row >= 0 && (new_row & 0x1F) == 0) 1451b362b15af34006e6a11974088a46d42b903418eJohann end_row = 1; 1461b362b15af34006e6a11974088a46d42b903418eJohann if (new_col >= 0 && (new_col & 0x1F) == 0) 1471b362b15af34006e6a11974088a46d42b903418eJohann end_col = 1; 1481b362b15af34006e6a11974088a46d42b903418eJohann 1491b362b15af34006e6a11974088a46d42b903418eJohann /* Check if the overlapping block partly overlaps a previous MB 1501b362b15af34006e6a11974088a46d42b903418eJohann * and if so, we're overlapping fewer blocks in this MB. 1511b362b15af34006e6a11974088a46d42b903418eJohann */ 1521b362b15af34006e6a11974088a46d42b903418eJohann if (new_row < (mb_row*16)<<3) 1531b362b15af34006e6a11974088a46d42b903418eJohann end_row = 1; 1541b362b15af34006e6a11974088a46d42b903418eJohann if (new_col < (mb_col*16)<<3) 1551b362b15af34006e6a11974088a46d42b903418eJohann end_col = 1; 1561b362b15af34006e6a11974088a46d42b903418eJohann 1571b362b15af34006e6a11974088a46d42b903418eJohann for (row = 0; row < end_row; ++row) 1581b362b15af34006e6a11974088a46d42b903418eJohann { 1591b362b15af34006e6a11974088a46d42b903418eJohann for (col = 0; col < end_col; ++col) 1601b362b15af34006e6a11974088a46d42b903418eJohann { 1611b362b15af34006e6a11974088a46d42b903418eJohann /* input in Q3, result in Q6 */ 1621b362b15af34006e6a11974088a46d42b903418eJohann const int overlap = block_overlap(new_row, new_col, 1631b362b15af34006e6a11974088a46d42b903418eJohann (((first_blk_row + row) * 1641b362b15af34006e6a11974088a46d42b903418eJohann 4) << 3), 1651b362b15af34006e6a11974088a46d42b903418eJohann (((first_blk_col + col) * 1661b362b15af34006e6a11974088a46d42b903418eJohann 4) << 3)); 1671b362b15af34006e6a11974088a46d42b903418eJohann assign_overlap(b_ol_ul[row * 4 + col].overlaps, bmi, overlap); 1681b362b15af34006e6a11974088a46d42b903418eJohann } 1691b362b15af34006e6a11974088a46d42b903418eJohann } 1701b362b15af34006e6a11974088a46d42b903418eJohann} 1711b362b15af34006e6a11974088a46d42b903418eJohann 1721b362b15af34006e6a11974088a46d42b903418eJohannvoid vp8_calculate_overlaps(MB_OVERLAP *overlap_ul, 1731b362b15af34006e6a11974088a46d42b903418eJohann int mb_rows, int mb_cols, 1741b362b15af34006e6a11974088a46d42b903418eJohann union b_mode_info *bmi, 1751b362b15af34006e6a11974088a46d42b903418eJohann int b_row, int b_col) 1761b362b15af34006e6a11974088a46d42b903418eJohann{ 1771b362b15af34006e6a11974088a46d42b903418eJohann MB_OVERLAP *mb_overlap; 1781b362b15af34006e6a11974088a46d42b903418eJohann int row, col, rel_row, rel_col; 1791b362b15af34006e6a11974088a46d42b903418eJohann int new_row, new_col; 1801b362b15af34006e6a11974088a46d42b903418eJohann int end_row, end_col; 1811b362b15af34006e6a11974088a46d42b903418eJohann int overlap_b_row, overlap_b_col; 1821b362b15af34006e6a11974088a46d42b903418eJohann int overlap_mb_row, overlap_mb_col; 1831b362b15af34006e6a11974088a46d42b903418eJohann 1841b362b15af34006e6a11974088a46d42b903418eJohann /* mb subpixel position */ 1851b362b15af34006e6a11974088a46d42b903418eJohann row = (4 * b_row) << 3; /* Q3 */ 1861b362b15af34006e6a11974088a46d42b903418eJohann col = (4 * b_col) << 3; /* Q3 */ 1871b362b15af34006e6a11974088a46d42b903418eJohann 1881b362b15af34006e6a11974088a46d42b903418eJohann /* reverse compensate for motion */ 1891b362b15af34006e6a11974088a46d42b903418eJohann new_row = row - bmi->mv.as_mv.row; 1901b362b15af34006e6a11974088a46d42b903418eJohann new_col = col - bmi->mv.as_mv.col; 1911b362b15af34006e6a11974088a46d42b903418eJohann 1921b362b15af34006e6a11974088a46d42b903418eJohann if (new_row >= ((16*mb_rows) << 3) || new_col >= ((16*mb_cols) << 3)) 1931b362b15af34006e6a11974088a46d42b903418eJohann { 1941b362b15af34006e6a11974088a46d42b903418eJohann /* the new block ended up outside the frame */ 1951b362b15af34006e6a11974088a46d42b903418eJohann return; 1961b362b15af34006e6a11974088a46d42b903418eJohann } 1971b362b15af34006e6a11974088a46d42b903418eJohann 1981b362b15af34006e6a11974088a46d42b903418eJohann if (new_row <= (-4 << 3) || new_col <= (-4 << 3)) 1991b362b15af34006e6a11974088a46d42b903418eJohann { 2001b362b15af34006e6a11974088a46d42b903418eJohann /* outside the frame */ 2011b362b15af34006e6a11974088a46d42b903418eJohann return; 2021b362b15af34006e6a11974088a46d42b903418eJohann } 2031b362b15af34006e6a11974088a46d42b903418eJohann /* overlapping block's position in blocks */ 2041b362b15af34006e6a11974088a46d42b903418eJohann overlap_b_row = FLOOR(new_row / 4, 3) >> 3; 2051b362b15af34006e6a11974088a46d42b903418eJohann overlap_b_col = FLOOR(new_col / 4, 3) >> 3; 2061b362b15af34006e6a11974088a46d42b903418eJohann 2071b362b15af34006e6a11974088a46d42b903418eJohann /* overlapping block's MB position in MBs 2081b362b15af34006e6a11974088a46d42b903418eJohann * operations are done in Q3 2091b362b15af34006e6a11974088a46d42b903418eJohann */ 2101b362b15af34006e6a11974088a46d42b903418eJohann overlap_mb_row = FLOOR((overlap_b_row << 3) / 4, 3) >> 3; 2111b362b15af34006e6a11974088a46d42b903418eJohann overlap_mb_col = FLOOR((overlap_b_col << 3) / 4, 3) >> 3; 2121b362b15af34006e6a11974088a46d42b903418eJohann 2131b362b15af34006e6a11974088a46d42b903418eJohann end_row = MIN(mb_rows - overlap_mb_row, 2); 2141b362b15af34006e6a11974088a46d42b903418eJohann end_col = MIN(mb_cols - overlap_mb_col, 2); 2151b362b15af34006e6a11974088a46d42b903418eJohann 2161b362b15af34006e6a11974088a46d42b903418eJohann /* Don't calculate overlap for MBs we don't overlap */ 2171b362b15af34006e6a11974088a46d42b903418eJohann /* Check if the new block row starts at the last block row of the MB */ 2181b362b15af34006e6a11974088a46d42b903418eJohann if (abs(new_row - ((16*overlap_mb_row) << 3)) < ((3*4) << 3)) 2191b362b15af34006e6a11974088a46d42b903418eJohann end_row = 1; 2201b362b15af34006e6a11974088a46d42b903418eJohann /* Check if the new block col starts at the last block col of the MB */ 2211b362b15af34006e6a11974088a46d42b903418eJohann if (abs(new_col - ((16*overlap_mb_col) << 3)) < ((3*4) << 3)) 2221b362b15af34006e6a11974088a46d42b903418eJohann end_col = 1; 2231b362b15af34006e6a11974088a46d42b903418eJohann 2241b362b15af34006e6a11974088a46d42b903418eJohann /* find the MB(s) this block is overlapping */ 2251b362b15af34006e6a11974088a46d42b903418eJohann for (rel_row = 0; rel_row < end_row; ++rel_row) 2261b362b15af34006e6a11974088a46d42b903418eJohann { 2271b362b15af34006e6a11974088a46d42b903418eJohann for (rel_col = 0; rel_col < end_col; ++rel_col) 2281b362b15af34006e6a11974088a46d42b903418eJohann { 2291b362b15af34006e6a11974088a46d42b903418eJohann if (overlap_mb_row + rel_row < 0 || 2301b362b15af34006e6a11974088a46d42b903418eJohann overlap_mb_col + rel_col < 0) 2311b362b15af34006e6a11974088a46d42b903418eJohann continue; 2321b362b15af34006e6a11974088a46d42b903418eJohann mb_overlap = overlap_ul + (overlap_mb_row + rel_row) * mb_cols + 2331b362b15af34006e6a11974088a46d42b903418eJohann overlap_mb_col + rel_col; 2341b362b15af34006e6a11974088a46d42b903418eJohann 2351b362b15af34006e6a11974088a46d42b903418eJohann calculate_overlaps_mb(mb_overlap->overlaps, bmi, 2361b362b15af34006e6a11974088a46d42b903418eJohann new_row, new_col, 2371b362b15af34006e6a11974088a46d42b903418eJohann overlap_mb_row + rel_row, 2381b362b15af34006e6a11974088a46d42b903418eJohann overlap_mb_col + rel_col, 2391b362b15af34006e6a11974088a46d42b903418eJohann overlap_b_row + rel_row, 2401b362b15af34006e6a11974088a46d42b903418eJohann overlap_b_col + rel_col); 2411b362b15af34006e6a11974088a46d42b903418eJohann } 2421b362b15af34006e6a11974088a46d42b903418eJohann } 2431b362b15af34006e6a11974088a46d42b903418eJohann} 2441b362b15af34006e6a11974088a46d42b903418eJohann 2451b362b15af34006e6a11974088a46d42b903418eJohann/* Estimates a motion vector given the overlapping blocks' motion vectors. 2461b362b15af34006e6a11974088a46d42b903418eJohann * Filters out all overlapping blocks which do not refer to the correct 2471b362b15af34006e6a11974088a46d42b903418eJohann * reference frame type. 2481b362b15af34006e6a11974088a46d42b903418eJohann */ 2491b362b15af34006e6a11974088a46d42b903418eJohannstatic void estimate_mv(const OVERLAP_NODE *overlaps, union b_mode_info *bmi) 2501b362b15af34006e6a11974088a46d42b903418eJohann{ 2511b362b15af34006e6a11974088a46d42b903418eJohann int i; 2521b362b15af34006e6a11974088a46d42b903418eJohann int overlap_sum = 0; 2531b362b15af34006e6a11974088a46d42b903418eJohann int row_acc = 0; 2541b362b15af34006e6a11974088a46d42b903418eJohann int col_acc = 0; 2551b362b15af34006e6a11974088a46d42b903418eJohann 2561b362b15af34006e6a11974088a46d42b903418eJohann bmi->mv.as_int = 0; 2571b362b15af34006e6a11974088a46d42b903418eJohann for (i=0; i < MAX_OVERLAPS; ++i) 2581b362b15af34006e6a11974088a46d42b903418eJohann { 2591b362b15af34006e6a11974088a46d42b903418eJohann if (overlaps[i].bmi == NULL) 2601b362b15af34006e6a11974088a46d42b903418eJohann break; 2611b362b15af34006e6a11974088a46d42b903418eJohann col_acc += overlaps[i].overlap * overlaps[i].bmi->mv.as_mv.col; 2621b362b15af34006e6a11974088a46d42b903418eJohann row_acc += overlaps[i].overlap * overlaps[i].bmi->mv.as_mv.row; 2631b362b15af34006e6a11974088a46d42b903418eJohann overlap_sum += overlaps[i].overlap; 2641b362b15af34006e6a11974088a46d42b903418eJohann } 2651b362b15af34006e6a11974088a46d42b903418eJohann if (overlap_sum > 0) 2661b362b15af34006e6a11974088a46d42b903418eJohann { 2671b362b15af34006e6a11974088a46d42b903418eJohann /* Q9 / Q6 = Q3 */ 2681b362b15af34006e6a11974088a46d42b903418eJohann bmi->mv.as_mv.col = col_acc / overlap_sum; 2691b362b15af34006e6a11974088a46d42b903418eJohann bmi->mv.as_mv.row = row_acc / overlap_sum; 2701b362b15af34006e6a11974088a46d42b903418eJohann } 2711b362b15af34006e6a11974088a46d42b903418eJohann else 2721b362b15af34006e6a11974088a46d42b903418eJohann { 2731b362b15af34006e6a11974088a46d42b903418eJohann bmi->mv.as_mv.col = 0; 2741b362b15af34006e6a11974088a46d42b903418eJohann bmi->mv.as_mv.row = 0; 2751b362b15af34006e6a11974088a46d42b903418eJohann } 2761b362b15af34006e6a11974088a46d42b903418eJohann} 2771b362b15af34006e6a11974088a46d42b903418eJohann 2781b362b15af34006e6a11974088a46d42b903418eJohann/* Estimates all motion vectors for a macroblock given the lists of 2791b362b15af34006e6a11974088a46d42b903418eJohann * overlaps for each block. Decides whether or not the MVs must be clamped. 2801b362b15af34006e6a11974088a46d42b903418eJohann */ 2811b362b15af34006e6a11974088a46d42b903418eJohannstatic void estimate_mb_mvs(const B_OVERLAP *block_overlaps, 2821b362b15af34006e6a11974088a46d42b903418eJohann MODE_INFO *mi, 2831b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_left_edge, 2841b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_right_edge, 2851b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_top_edge, 2861b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_bottom_edge) 2871b362b15af34006e6a11974088a46d42b903418eJohann{ 2881b362b15af34006e6a11974088a46d42b903418eJohann int row, col; 2891b362b15af34006e6a11974088a46d42b903418eJohann int non_zero_count = 0; 2901b362b15af34006e6a11974088a46d42b903418eJohann MV * const filtered_mv = &(mi->mbmi.mv.as_mv); 2911b362b15af34006e6a11974088a46d42b903418eJohann union b_mode_info * const bmi = mi->bmi; 2921b362b15af34006e6a11974088a46d42b903418eJohann filtered_mv->col = 0; 2931b362b15af34006e6a11974088a46d42b903418eJohann filtered_mv->row = 0; 2941b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.need_to_clamp_mvs = 0; 2951b362b15af34006e6a11974088a46d42b903418eJohann for (row = 0; row < 4; ++row) 2961b362b15af34006e6a11974088a46d42b903418eJohann { 2971b362b15af34006e6a11974088a46d42b903418eJohann int this_b_to_top_edge = mb_to_top_edge + ((row*4)<<3); 2981b362b15af34006e6a11974088a46d42b903418eJohann int this_b_to_bottom_edge = mb_to_bottom_edge - ((row*4)<<3); 2991b362b15af34006e6a11974088a46d42b903418eJohann for (col = 0; col < 4; ++col) 3001b362b15af34006e6a11974088a46d42b903418eJohann { 3011b362b15af34006e6a11974088a46d42b903418eJohann int i = row * 4 + col; 3021b362b15af34006e6a11974088a46d42b903418eJohann int this_b_to_left_edge = mb_to_left_edge + ((col*4)<<3); 3031b362b15af34006e6a11974088a46d42b903418eJohann int this_b_to_right_edge = mb_to_right_edge - ((col*4)<<3); 3041b362b15af34006e6a11974088a46d42b903418eJohann /* Estimate vectors for all blocks which are overlapped by this */ 3051b362b15af34006e6a11974088a46d42b903418eJohann /* type. Interpolate/extrapolate the rest of the block's MVs */ 3061b362b15af34006e6a11974088a46d42b903418eJohann estimate_mv(block_overlaps[i].overlaps, &(bmi[i])); 3071b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.need_to_clamp_mvs |= vp8_check_mv_bounds( 3081b362b15af34006e6a11974088a46d42b903418eJohann &bmi[i].mv, 3091b362b15af34006e6a11974088a46d42b903418eJohann this_b_to_left_edge, 3101b362b15af34006e6a11974088a46d42b903418eJohann this_b_to_right_edge, 3111b362b15af34006e6a11974088a46d42b903418eJohann this_b_to_top_edge, 3121b362b15af34006e6a11974088a46d42b903418eJohann this_b_to_bottom_edge); 3131b362b15af34006e6a11974088a46d42b903418eJohann if (bmi[i].mv.as_int != 0) 3141b362b15af34006e6a11974088a46d42b903418eJohann { 3151b362b15af34006e6a11974088a46d42b903418eJohann ++non_zero_count; 3161b362b15af34006e6a11974088a46d42b903418eJohann filtered_mv->col += bmi[i].mv.as_mv.col; 3171b362b15af34006e6a11974088a46d42b903418eJohann filtered_mv->row += bmi[i].mv.as_mv.row; 3181b362b15af34006e6a11974088a46d42b903418eJohann } 3191b362b15af34006e6a11974088a46d42b903418eJohann } 3201b362b15af34006e6a11974088a46d42b903418eJohann } 3211b362b15af34006e6a11974088a46d42b903418eJohann if (non_zero_count > 0) 3221b362b15af34006e6a11974088a46d42b903418eJohann { 3231b362b15af34006e6a11974088a46d42b903418eJohann filtered_mv->col /= non_zero_count; 3241b362b15af34006e6a11974088a46d42b903418eJohann filtered_mv->row /= non_zero_count; 3251b362b15af34006e6a11974088a46d42b903418eJohann } 3261b362b15af34006e6a11974088a46d42b903418eJohann} 3271b362b15af34006e6a11974088a46d42b903418eJohann 3281b362b15af34006e6a11974088a46d42b903418eJohannstatic void calc_prev_mb_overlaps(MB_OVERLAP *overlaps, MODE_INFO *prev_mi, 3291b362b15af34006e6a11974088a46d42b903418eJohann int mb_row, int mb_col, 3301b362b15af34006e6a11974088a46d42b903418eJohann int mb_rows, int mb_cols) 3311b362b15af34006e6a11974088a46d42b903418eJohann{ 3321b362b15af34006e6a11974088a46d42b903418eJohann int sub_row; 3331b362b15af34006e6a11974088a46d42b903418eJohann int sub_col; 3341b362b15af34006e6a11974088a46d42b903418eJohann for (sub_row = 0; sub_row < 4; ++sub_row) 3351b362b15af34006e6a11974088a46d42b903418eJohann { 3361b362b15af34006e6a11974088a46d42b903418eJohann for (sub_col = 0; sub_col < 4; ++sub_col) 3371b362b15af34006e6a11974088a46d42b903418eJohann { 3381b362b15af34006e6a11974088a46d42b903418eJohann vp8_calculate_overlaps( 3391b362b15af34006e6a11974088a46d42b903418eJohann overlaps, mb_rows, mb_cols, 3401b362b15af34006e6a11974088a46d42b903418eJohann &(prev_mi->bmi[sub_row * 4 + sub_col]), 3411b362b15af34006e6a11974088a46d42b903418eJohann 4 * mb_row + sub_row, 3421b362b15af34006e6a11974088a46d42b903418eJohann 4 * mb_col + sub_col); 3431b362b15af34006e6a11974088a46d42b903418eJohann } 3441b362b15af34006e6a11974088a46d42b903418eJohann } 3451b362b15af34006e6a11974088a46d42b903418eJohann} 3461b362b15af34006e6a11974088a46d42b903418eJohann 3471b362b15af34006e6a11974088a46d42b903418eJohann/* Estimate all missing motion vectors. This function does the same as the one 3481b362b15af34006e6a11974088a46d42b903418eJohann * above, but has different input arguments. */ 3491b362b15af34006e6a11974088a46d42b903418eJohannstatic void estimate_missing_mvs(MB_OVERLAP *overlaps, 3501b362b15af34006e6a11974088a46d42b903418eJohann MODE_INFO *mi, MODE_INFO *prev_mi, 3511b362b15af34006e6a11974088a46d42b903418eJohann int mb_rows, int mb_cols, 3521b362b15af34006e6a11974088a46d42b903418eJohann unsigned int first_corrupt) 3531b362b15af34006e6a11974088a46d42b903418eJohann{ 3541b362b15af34006e6a11974088a46d42b903418eJohann int mb_row, mb_col; 3551b362b15af34006e6a11974088a46d42b903418eJohann vpx_memset(overlaps, 0, sizeof(MB_OVERLAP) * mb_rows * mb_cols); 3561b362b15af34006e6a11974088a46d42b903418eJohann /* First calculate the overlaps for all blocks */ 3571b362b15af34006e6a11974088a46d42b903418eJohann for (mb_row = 0; mb_row < mb_rows; ++mb_row) 3581b362b15af34006e6a11974088a46d42b903418eJohann { 3591b362b15af34006e6a11974088a46d42b903418eJohann for (mb_col = 0; mb_col < mb_cols; ++mb_col) 3601b362b15af34006e6a11974088a46d42b903418eJohann { 3611b362b15af34006e6a11974088a46d42b903418eJohann /* We're only able to use blocks referring to the last frame 3621b362b15af34006e6a11974088a46d42b903418eJohann * when extrapolating new vectors. 3631b362b15af34006e6a11974088a46d42b903418eJohann */ 3641b362b15af34006e6a11974088a46d42b903418eJohann if (prev_mi->mbmi.ref_frame == LAST_FRAME) 3651b362b15af34006e6a11974088a46d42b903418eJohann { 3661b362b15af34006e6a11974088a46d42b903418eJohann calc_prev_mb_overlaps(overlaps, prev_mi, 3671b362b15af34006e6a11974088a46d42b903418eJohann mb_row, mb_col, 3681b362b15af34006e6a11974088a46d42b903418eJohann mb_rows, mb_cols); 3691b362b15af34006e6a11974088a46d42b903418eJohann } 3701b362b15af34006e6a11974088a46d42b903418eJohann ++prev_mi; 3711b362b15af34006e6a11974088a46d42b903418eJohann } 3721b362b15af34006e6a11974088a46d42b903418eJohann ++prev_mi; 3731b362b15af34006e6a11974088a46d42b903418eJohann } 3741b362b15af34006e6a11974088a46d42b903418eJohann 3751b362b15af34006e6a11974088a46d42b903418eJohann mb_row = first_corrupt / mb_cols; 3761b362b15af34006e6a11974088a46d42b903418eJohann mb_col = first_corrupt - mb_row * mb_cols; 3771b362b15af34006e6a11974088a46d42b903418eJohann mi += mb_row*(mb_cols + 1) + mb_col; 3781b362b15af34006e6a11974088a46d42b903418eJohann /* Go through all macroblocks in the current image with missing MVs 3791b362b15af34006e6a11974088a46d42b903418eJohann * and calculate new MVs using the overlaps. 3801b362b15af34006e6a11974088a46d42b903418eJohann */ 3811b362b15af34006e6a11974088a46d42b903418eJohann for (; mb_row < mb_rows; ++mb_row) 3821b362b15af34006e6a11974088a46d42b903418eJohann { 3831b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_top_edge = -((mb_row * 16)) << 3; 3841b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_bottom_edge = ((mb_rows - 1 - mb_row) * 16) << 3; 3851b362b15af34006e6a11974088a46d42b903418eJohann for (; mb_col < mb_cols; ++mb_col) 3861b362b15af34006e6a11974088a46d42b903418eJohann { 3871b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_left_edge = -((mb_col * 16) << 3); 3881b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_right_edge = ((mb_cols - 1 - mb_col) * 16) << 3; 3891b362b15af34006e6a11974088a46d42b903418eJohann const B_OVERLAP *block_overlaps = 3901b362b15af34006e6a11974088a46d42b903418eJohann overlaps[mb_row*mb_cols + mb_col].overlaps; 3911b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.ref_frame = LAST_FRAME; 3921b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.mode = SPLITMV; 3931b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.uv_mode = DC_PRED; 3941b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.partitioning = 3; 3951b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.segment_id = 0; 3961b362b15af34006e6a11974088a46d42b903418eJohann estimate_mb_mvs(block_overlaps, 3971b362b15af34006e6a11974088a46d42b903418eJohann mi, 3981b362b15af34006e6a11974088a46d42b903418eJohann mb_to_left_edge, 3991b362b15af34006e6a11974088a46d42b903418eJohann mb_to_right_edge, 4001b362b15af34006e6a11974088a46d42b903418eJohann mb_to_top_edge, 4011b362b15af34006e6a11974088a46d42b903418eJohann mb_to_bottom_edge); 4021b362b15af34006e6a11974088a46d42b903418eJohann ++mi; 4031b362b15af34006e6a11974088a46d42b903418eJohann } 4041b362b15af34006e6a11974088a46d42b903418eJohann mb_col = 0; 4051b362b15af34006e6a11974088a46d42b903418eJohann ++mi; 4061b362b15af34006e6a11974088a46d42b903418eJohann } 4071b362b15af34006e6a11974088a46d42b903418eJohann} 4081b362b15af34006e6a11974088a46d42b903418eJohann 4091b362b15af34006e6a11974088a46d42b903418eJohannvoid vp8_estimate_missing_mvs(VP8D_COMP *pbi) 4101b362b15af34006e6a11974088a46d42b903418eJohann{ 4111b362b15af34006e6a11974088a46d42b903418eJohann VP8_COMMON * const pc = &pbi->common; 4121b362b15af34006e6a11974088a46d42b903418eJohann estimate_missing_mvs(pbi->overlaps, 4131b362b15af34006e6a11974088a46d42b903418eJohann pc->mi, pc->prev_mi, 4141b362b15af34006e6a11974088a46d42b903418eJohann pc->mb_rows, pc->mb_cols, 4151b362b15af34006e6a11974088a46d42b903418eJohann pbi->mvs_corrupt_from_mb); 4161b362b15af34006e6a11974088a46d42b903418eJohann} 4171b362b15af34006e6a11974088a46d42b903418eJohann 4181b362b15af34006e6a11974088a46d42b903418eJohannstatic void assign_neighbor(EC_BLOCK *neighbor, MODE_INFO *mi, int block_idx) 4191b362b15af34006e6a11974088a46d42b903418eJohann{ 4201b362b15af34006e6a11974088a46d42b903418eJohann assert(mi->mbmi.ref_frame < MAX_REF_FRAMES); 4211b362b15af34006e6a11974088a46d42b903418eJohann neighbor->ref_frame = mi->mbmi.ref_frame; 4221b362b15af34006e6a11974088a46d42b903418eJohann neighbor->mv = mi->bmi[block_idx].mv.as_mv; 4231b362b15af34006e6a11974088a46d42b903418eJohann} 4241b362b15af34006e6a11974088a46d42b903418eJohann 4251b362b15af34006e6a11974088a46d42b903418eJohann/* Finds the neighboring blocks of a macroblocks. In the general case 4261b362b15af34006e6a11974088a46d42b903418eJohann * 20 blocks are found. If a fewer number of blocks are found due to 4271b362b15af34006e6a11974088a46d42b903418eJohann * image boundaries, those positions in the EC_BLOCK array are left "empty". 4281b362b15af34006e6a11974088a46d42b903418eJohann * The neighbors are enumerated with the upper-left neighbor as the first 4291b362b15af34006e6a11974088a46d42b903418eJohann * element, the second element refers to the neighbor to right of the previous 4301b362b15af34006e6a11974088a46d42b903418eJohann * neighbor, and so on. The last element refers to the neighbor below the first 4311b362b15af34006e6a11974088a46d42b903418eJohann * neighbor. 4321b362b15af34006e6a11974088a46d42b903418eJohann */ 4331b362b15af34006e6a11974088a46d42b903418eJohannstatic void find_neighboring_blocks(MODE_INFO *mi, 4341b362b15af34006e6a11974088a46d42b903418eJohann EC_BLOCK *neighbors, 4351b362b15af34006e6a11974088a46d42b903418eJohann int mb_row, int mb_col, 4361b362b15af34006e6a11974088a46d42b903418eJohann int mb_rows, int mb_cols, 4371b362b15af34006e6a11974088a46d42b903418eJohann int mi_stride) 4381b362b15af34006e6a11974088a46d42b903418eJohann{ 4391b362b15af34006e6a11974088a46d42b903418eJohann int i = 0; 4401b362b15af34006e6a11974088a46d42b903418eJohann int j; 4411b362b15af34006e6a11974088a46d42b903418eJohann if (mb_row > 0) 4421b362b15af34006e6a11974088a46d42b903418eJohann { 4431b362b15af34006e6a11974088a46d42b903418eJohann /* upper left */ 4441b362b15af34006e6a11974088a46d42b903418eJohann if (mb_col > 0) 4451b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15); 4461b362b15af34006e6a11974088a46d42b903418eJohann ++i; 4471b362b15af34006e6a11974088a46d42b903418eJohann /* above */ 4481b362b15af34006e6a11974088a46d42b903418eJohann for (j = 12; j < 16; ++j, ++i) 4491b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi - mi_stride, j); 4501b362b15af34006e6a11974088a46d42b903418eJohann } 4511b362b15af34006e6a11974088a46d42b903418eJohann else 4521b362b15af34006e6a11974088a46d42b903418eJohann i += 5; 4531b362b15af34006e6a11974088a46d42b903418eJohann if (mb_col < mb_cols - 1) 4541b362b15af34006e6a11974088a46d42b903418eJohann { 4551b362b15af34006e6a11974088a46d42b903418eJohann /* upper right */ 4561b362b15af34006e6a11974088a46d42b903418eJohann if (mb_row > 0) 4571b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12); 4581b362b15af34006e6a11974088a46d42b903418eJohann ++i; 4591b362b15af34006e6a11974088a46d42b903418eJohann /* right */ 4601b362b15af34006e6a11974088a46d42b903418eJohann for (j = 0; j <= 12; j += 4, ++i) 4611b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi + 1, j); 4621b362b15af34006e6a11974088a46d42b903418eJohann } 4631b362b15af34006e6a11974088a46d42b903418eJohann else 4641b362b15af34006e6a11974088a46d42b903418eJohann i += 5; 4651b362b15af34006e6a11974088a46d42b903418eJohann if (mb_row < mb_rows - 1) 4661b362b15af34006e6a11974088a46d42b903418eJohann { 4671b362b15af34006e6a11974088a46d42b903418eJohann /* lower right */ 4681b362b15af34006e6a11974088a46d42b903418eJohann if (mb_col < mb_cols - 1) 4691b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0); 4701b362b15af34006e6a11974088a46d42b903418eJohann ++i; 4711b362b15af34006e6a11974088a46d42b903418eJohann /* below */ 4721b362b15af34006e6a11974088a46d42b903418eJohann for (j = 0; j < 4; ++j, ++i) 4731b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi + mi_stride, j); 4741b362b15af34006e6a11974088a46d42b903418eJohann } 4751b362b15af34006e6a11974088a46d42b903418eJohann else 4761b362b15af34006e6a11974088a46d42b903418eJohann i += 5; 4771b362b15af34006e6a11974088a46d42b903418eJohann if (mb_col > 0) 4781b362b15af34006e6a11974088a46d42b903418eJohann { 4791b362b15af34006e6a11974088a46d42b903418eJohann /* lower left */ 4801b362b15af34006e6a11974088a46d42b903418eJohann if (mb_row < mb_rows - 1) 4811b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4); 4821b362b15af34006e6a11974088a46d42b903418eJohann ++i; 4831b362b15af34006e6a11974088a46d42b903418eJohann /* left */ 4841b362b15af34006e6a11974088a46d42b903418eJohann for (j = 3; j < 16; j += 4, ++i) 4851b362b15af34006e6a11974088a46d42b903418eJohann { 4861b362b15af34006e6a11974088a46d42b903418eJohann assign_neighbor(&neighbors[i], mi - 1, j); 4871b362b15af34006e6a11974088a46d42b903418eJohann } 4881b362b15af34006e6a11974088a46d42b903418eJohann } 4891b362b15af34006e6a11974088a46d42b903418eJohann else 4901b362b15af34006e6a11974088a46d42b903418eJohann i += 5; 4911b362b15af34006e6a11974088a46d42b903418eJohann assert(i == 20); 4921b362b15af34006e6a11974088a46d42b903418eJohann} 4931b362b15af34006e6a11974088a46d42b903418eJohann 4941b362b15af34006e6a11974088a46d42b903418eJohann/* Interpolates all motion vectors for a macroblock from the neighboring blocks' 4951b362b15af34006e6a11974088a46d42b903418eJohann * motion vectors. 4961b362b15af34006e6a11974088a46d42b903418eJohann */ 4971b362b15af34006e6a11974088a46d42b903418eJohannstatic void interpolate_mvs(MACROBLOCKD *mb, 4981b362b15af34006e6a11974088a46d42b903418eJohann EC_BLOCK *neighbors, 4991b362b15af34006e6a11974088a46d42b903418eJohann MV_REFERENCE_FRAME dom_ref_frame) 5001b362b15af34006e6a11974088a46d42b903418eJohann{ 5011b362b15af34006e6a11974088a46d42b903418eJohann int row, col, i; 5021b362b15af34006e6a11974088a46d42b903418eJohann MODE_INFO * const mi = mb->mode_info_context; 5031b362b15af34006e6a11974088a46d42b903418eJohann /* Table with the position of the neighboring blocks relative the position 5041b362b15af34006e6a11974088a46d42b903418eJohann * of the upper left block of the current MB. Starting with the upper left 5051b362b15af34006e6a11974088a46d42b903418eJohann * neighbor and going to the right. 5061b362b15af34006e6a11974088a46d42b903418eJohann */ 5071b362b15af34006e6a11974088a46d42b903418eJohann const EC_POS neigh_pos[NUM_NEIGHBORS] = { 5081b362b15af34006e6a11974088a46d42b903418eJohann {-1,-1}, {-1,0}, {-1,1}, {-1,2}, {-1,3}, 5091b362b15af34006e6a11974088a46d42b903418eJohann {-1,4}, {0,4}, {1,4}, {2,4}, {3,4}, 5101b362b15af34006e6a11974088a46d42b903418eJohann {4,4}, {4,3}, {4,2}, {4,1}, {4,0}, 5111b362b15af34006e6a11974088a46d42b903418eJohann {4,-1}, {3,-1}, {2,-1}, {1,-1}, {0,-1} 5121b362b15af34006e6a11974088a46d42b903418eJohann }; 5131b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.need_to_clamp_mvs = 0; 5141b362b15af34006e6a11974088a46d42b903418eJohann for (row = 0; row < 4; ++row) 5151b362b15af34006e6a11974088a46d42b903418eJohann { 5161b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_top_edge = mb->mb_to_top_edge + ((row*4)<<3); 5171b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_bottom_edge = mb->mb_to_bottom_edge - ((row*4)<<3); 5181b362b15af34006e6a11974088a46d42b903418eJohann for (col = 0; col < 4; ++col) 5191b362b15af34006e6a11974088a46d42b903418eJohann { 5201b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_left_edge = mb->mb_to_left_edge + ((col*4)<<3); 5211b362b15af34006e6a11974088a46d42b903418eJohann int mb_to_right_edge = mb->mb_to_right_edge - ((col*4)<<3); 5221b362b15af34006e6a11974088a46d42b903418eJohann int w_sum = 0; 5231b362b15af34006e6a11974088a46d42b903418eJohann int mv_row_sum = 0; 5241b362b15af34006e6a11974088a46d42b903418eJohann int mv_col_sum = 0; 5251b362b15af34006e6a11974088a46d42b903418eJohann int_mv * const mv = &(mi->bmi[row*4 + col].mv); 5261b362b15af34006e6a11974088a46d42b903418eJohann mv->as_int = 0; 5271b362b15af34006e6a11974088a46d42b903418eJohann for (i = 0; i < NUM_NEIGHBORS; ++i) 5281b362b15af34006e6a11974088a46d42b903418eJohann { 5291b362b15af34006e6a11974088a46d42b903418eJohann /* Calculate the weighted sum of neighboring MVs referring 5301b362b15af34006e6a11974088a46d42b903418eJohann * to the dominant frame type. 5311b362b15af34006e6a11974088a46d42b903418eJohann */ 5321b362b15af34006e6a11974088a46d42b903418eJohann const int w = weights_q7[abs(row - neigh_pos[i].row)] 5331b362b15af34006e6a11974088a46d42b903418eJohann [abs(col - neigh_pos[i].col)]; 5341b362b15af34006e6a11974088a46d42b903418eJohann if (neighbors[i].ref_frame != dom_ref_frame) 5351b362b15af34006e6a11974088a46d42b903418eJohann continue; 5361b362b15af34006e6a11974088a46d42b903418eJohann w_sum += w; 5371b362b15af34006e6a11974088a46d42b903418eJohann /* Q7 * Q3 = Q10 */ 5381b362b15af34006e6a11974088a46d42b903418eJohann mv_row_sum += w*neighbors[i].mv.row; 5391b362b15af34006e6a11974088a46d42b903418eJohann mv_col_sum += w*neighbors[i].mv.col; 5401b362b15af34006e6a11974088a46d42b903418eJohann } 5411b362b15af34006e6a11974088a46d42b903418eJohann if (w_sum > 0) 5421b362b15af34006e6a11974088a46d42b903418eJohann { 5431b362b15af34006e6a11974088a46d42b903418eJohann /* Avoid division by zero. 5441b362b15af34006e6a11974088a46d42b903418eJohann * Normalize with the sum of the coefficients 5451b362b15af34006e6a11974088a46d42b903418eJohann * Q3 = Q10 / Q7 5461b362b15af34006e6a11974088a46d42b903418eJohann */ 5471b362b15af34006e6a11974088a46d42b903418eJohann mv->as_mv.row = mv_row_sum / w_sum; 5481b362b15af34006e6a11974088a46d42b903418eJohann mv->as_mv.col = mv_col_sum / w_sum; 5491b362b15af34006e6a11974088a46d42b903418eJohann mi->mbmi.need_to_clamp_mvs |= vp8_check_mv_bounds( 5501b362b15af34006e6a11974088a46d42b903418eJohann mv, 5511b362b15af34006e6a11974088a46d42b903418eJohann mb_to_left_edge, 5521b362b15af34006e6a11974088a46d42b903418eJohann mb_to_right_edge, 5531b362b15af34006e6a11974088a46d42b903418eJohann mb_to_top_edge, 5541b362b15af34006e6a11974088a46d42b903418eJohann mb_to_bottom_edge); 5551b362b15af34006e6a11974088a46d42b903418eJohann } 5561b362b15af34006e6a11974088a46d42b903418eJohann } 5571b362b15af34006e6a11974088a46d42b903418eJohann } 5581b362b15af34006e6a11974088a46d42b903418eJohann} 5591b362b15af34006e6a11974088a46d42b903418eJohann 5601b362b15af34006e6a11974088a46d42b903418eJohannvoid vp8_interpolate_motion(MACROBLOCKD *mb, 5611b362b15af34006e6a11974088a46d42b903418eJohann int mb_row, int mb_col, 5621b362b15af34006e6a11974088a46d42b903418eJohann int mb_rows, int mb_cols, 5631b362b15af34006e6a11974088a46d42b903418eJohann int mi_stride) 5641b362b15af34006e6a11974088a46d42b903418eJohann{ 5651b362b15af34006e6a11974088a46d42b903418eJohann /* Find relevant neighboring blocks */ 5661b362b15af34006e6a11974088a46d42b903418eJohann EC_BLOCK neighbors[NUM_NEIGHBORS]; 5671b362b15af34006e6a11974088a46d42b903418eJohann int i; 5681b362b15af34006e6a11974088a46d42b903418eJohann /* Initialize the array. MAX_REF_FRAMES is interpreted as "doesn't exist" */ 5691b362b15af34006e6a11974088a46d42b903418eJohann for (i = 0; i < NUM_NEIGHBORS; ++i) 5701b362b15af34006e6a11974088a46d42b903418eJohann { 5711b362b15af34006e6a11974088a46d42b903418eJohann neighbors[i].ref_frame = MAX_REF_FRAMES; 5721b362b15af34006e6a11974088a46d42b903418eJohann neighbors[i].mv.row = neighbors[i].mv.col = 0; 5731b362b15af34006e6a11974088a46d42b903418eJohann } 5741b362b15af34006e6a11974088a46d42b903418eJohann find_neighboring_blocks(mb->mode_info_context, 5751b362b15af34006e6a11974088a46d42b903418eJohann neighbors, 5761b362b15af34006e6a11974088a46d42b903418eJohann mb_row, mb_col, 5771b362b15af34006e6a11974088a46d42b903418eJohann mb_rows, mb_cols, 5781b362b15af34006e6a11974088a46d42b903418eJohann mb->mode_info_stride); 5791b362b15af34006e6a11974088a46d42b903418eJohann /* Interpolate MVs for the missing blocks from the surrounding 5801b362b15af34006e6a11974088a46d42b903418eJohann * blocks which refer to the last frame. */ 5811b362b15af34006e6a11974088a46d42b903418eJohann interpolate_mvs(mb, neighbors, LAST_FRAME); 5821b362b15af34006e6a11974088a46d42b903418eJohann 5831b362b15af34006e6a11974088a46d42b903418eJohann mb->mode_info_context->mbmi.ref_frame = LAST_FRAME; 5841b362b15af34006e6a11974088a46d42b903418eJohann mb->mode_info_context->mbmi.mode = SPLITMV; 5851b362b15af34006e6a11974088a46d42b903418eJohann mb->mode_info_context->mbmi.uv_mode = DC_PRED; 5861b362b15af34006e6a11974088a46d42b903418eJohann mb->mode_info_context->mbmi.partitioning = 3; 5871b362b15af34006e6a11974088a46d42b903418eJohann mb->mode_info_context->mbmi.segment_id = 0; 5881b362b15af34006e6a11974088a46d42b903418eJohann} 5891b362b15af34006e6a11974088a46d42b903418eJohann 5901b362b15af34006e6a11974088a46d42b903418eJohannvoid vp8_conceal_corrupt_mb(MACROBLOCKD *xd) 5911b362b15af34006e6a11974088a46d42b903418eJohann{ 5921b362b15af34006e6a11974088a46d42b903418eJohann /* This macroblock has corrupt residual, use the motion compensated 5931b362b15af34006e6a11974088a46d42b903418eJohann image (predictor) for concealment */ 5941b362b15af34006e6a11974088a46d42b903418eJohann 5951b362b15af34006e6a11974088a46d42b903418eJohann /* The build predictor functions now output directly into the dst buffer, 5961b362b15af34006e6a11974088a46d42b903418eJohann * so the copies are no longer necessary */ 5971b362b15af34006e6a11974088a46d42b903418eJohann 5981b362b15af34006e6a11974088a46d42b903418eJohann} 599