Skip computing MV cost twice in hexagon search

Changes the first step of hexagon search to skip the zero offset since
the cost of the motion vector has already been computed.
This commit is contained in:
Arttu Ylä-Outinen 2017-08-04 13:22:59 +03:00
parent fa4648061d
commit 606d441362

View file

@ -659,7 +659,7 @@ static void hexagon_search(inter_search_info_t *info, vector2d_t extra_mv)
int best_index = 0;
// Search the initial 7 points of the hexagon.
for (int i = 0; i < 7; ++i) {
for (int i = 1; i < 7; ++i) {
if (check_mv_cost(info, mv.x + large_hexbs[i].x, mv.y + large_hexbs[i].y)) {
best_index = i;
}