/src/aom/av1/common/obmc.h
Line | Count | Source |
1 | | /* |
2 | | * Copyright (c) 2017, Alliance for Open Media. All rights reserved. |
3 | | * |
4 | | * This source code is subject to the terms of the BSD 2 Clause License and |
5 | | * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License |
6 | | * was not distributed with this source code in the LICENSE file, you can |
7 | | * obtain it at www.aomedia.org/license/software. If the Alliance for Open |
8 | | * Media Patent License 1.0 was not distributed with this source code in the |
9 | | * PATENTS file, you can obtain it at www.aomedia.org/license/patent. |
10 | | */ |
11 | | |
12 | | #ifndef AOM_AV1_COMMON_OBMC_H_ |
13 | | #define AOM_AV1_COMMON_OBMC_H_ |
14 | | |
15 | | typedef void (*overlappable_nb_visitor_t)(MACROBLOCKD *xd, int rel_mi_row, |
16 | | int rel_mi_col, uint8_t op_mi_size, |
17 | | int dir, MB_MODE_INFO *nb_mi, |
18 | | void *fun_ctxt, const int num_planes); |
19 | | |
20 | | static inline void foreach_overlappable_nb_above(const AV1_COMMON *cm, |
21 | | MACROBLOCKD *xd, int nb_max, |
22 | | overlappable_nb_visitor_t fun, |
23 | 3.10M | void *fun_ctxt) { |
24 | 3.10M | if (!xd->up_available) return; |
25 | | |
26 | 2.94M | const int num_planes = av1_num_planes(cm); |
27 | 2.94M | int nb_count = 0; |
28 | 2.94M | const int mi_col = xd->mi_col; |
29 | | // prev_row_mi points into the mi array, starting at the beginning of the |
30 | | // previous row. |
31 | 2.94M | MB_MODE_INFO **prev_row_mi = xd->mi - mi_col - 1 * xd->mi_stride; |
32 | 2.94M | const int end_col = AOMMIN(mi_col + xd->width, cm->mi_params.mi_cols); |
33 | 2.94M | uint8_t mi_step; |
34 | 6.37M | for (int above_mi_col = mi_col; above_mi_col < end_col && nb_count < nb_max; |
35 | 3.42M | above_mi_col += mi_step) { |
36 | 3.42M | MB_MODE_INFO **above_mi = prev_row_mi + above_mi_col; |
37 | 3.42M | mi_step = |
38 | 3.42M | AOMMIN(mi_size_wide[above_mi[0]->bsize], mi_size_wide[BLOCK_64X64]); |
39 | | // If we're considering a block with width 4, it should be treated as |
40 | | // half of a pair of blocks with chroma information in the second. Move |
41 | | // above_mi_col back to the start of the pair if needed, set above_mbmi |
42 | | // to point at the block with chroma information, and set mi_step to 2 to |
43 | | // step over the entire pair at the end of the iteration. |
44 | 3.42M | if (mi_step == 1) { |
45 | 220k | above_mi_col &= ~1; |
46 | 220k | above_mi = prev_row_mi + above_mi_col + 1; |
47 | 220k | mi_step = 2; |
48 | 220k | } |
49 | 3.42M | if (is_neighbor_overlappable(*above_mi)) { |
50 | 2.98M | ++nb_count; |
51 | 2.98M | fun(xd, 0, above_mi_col - mi_col, AOMMIN(xd->width, mi_step), 0, |
52 | 2.98M | *above_mi, fun_ctxt, num_planes); |
53 | 2.98M | } |
54 | 3.42M | } |
55 | 2.94M | } decodeframe.c:foreach_overlappable_nb_above Line | Count | Source | 23 | 444k | void *fun_ctxt) { | 24 | 444k | if (!xd->up_available) return; | 25 | | | 26 | 444k | const int num_planes = av1_num_planes(cm); | 27 | 444k | int nb_count = 0; | 28 | 444k | const int mi_col = xd->mi_col; | 29 | | // prev_row_mi points into the mi array, starting at the beginning of the | 30 | | // previous row. | 31 | 444k | MB_MODE_INFO **prev_row_mi = xd->mi - mi_col - 1 * xd->mi_stride; | 32 | 444k | const int end_col = AOMMIN(mi_col + xd->width, cm->mi_params.mi_cols); | 33 | 444k | uint8_t mi_step; | 34 | 942k | for (int above_mi_col = mi_col; above_mi_col < end_col && nb_count < nb_max; | 35 | 497k | above_mi_col += mi_step) { | 36 | 497k | MB_MODE_INFO **above_mi = prev_row_mi + above_mi_col; | 37 | 497k | mi_step = | 38 | 497k | AOMMIN(mi_size_wide[above_mi[0]->bsize], mi_size_wide[BLOCK_64X64]); | 39 | | // If we're considering a block with width 4, it should be treated as | 40 | | // half of a pair of blocks with chroma information in the second. Move | 41 | | // above_mi_col back to the start of the pair if needed, set above_mbmi | 42 | | // to point at the block with chroma information, and set mi_step to 2 to | 43 | | // step over the entire pair at the end of the iteration. | 44 | 497k | if (mi_step == 1) { | 45 | 32.6k | above_mi_col &= ~1; | 46 | 32.6k | above_mi = prev_row_mi + above_mi_col + 1; | 47 | 32.6k | mi_step = 2; | 48 | 32.6k | } | 49 | 497k | if (is_neighbor_overlappable(*above_mi)) { | 50 | 436k | ++nb_count; | 51 | 436k | fun(xd, 0, above_mi_col - mi_col, AOMMIN(xd->width, mi_step), 0, | 52 | 436k | *above_mi, fun_ctxt, num_planes); | 53 | 436k | } | 54 | 497k | } | 55 | 444k | } |
reconinter.c:foreach_overlappable_nb_above Line | Count | Source | 23 | 2.66M | void *fun_ctxt) { | 24 | 2.66M | if (!xd->up_available) return; | 25 | | | 26 | 2.50M | const int num_planes = av1_num_planes(cm); | 27 | 2.50M | int nb_count = 0; | 28 | 2.50M | const int mi_col = xd->mi_col; | 29 | | // prev_row_mi points into the mi array, starting at the beginning of the | 30 | | // previous row. | 31 | 2.50M | MB_MODE_INFO **prev_row_mi = xd->mi - mi_col - 1 * xd->mi_stride; | 32 | 2.50M | const int end_col = AOMMIN(mi_col + xd->width, cm->mi_params.mi_cols); | 33 | 2.50M | uint8_t mi_step; | 34 | 5.43M | for (int above_mi_col = mi_col; above_mi_col < end_col && nb_count < nb_max; | 35 | 2.92M | above_mi_col += mi_step) { | 36 | 2.92M | MB_MODE_INFO **above_mi = prev_row_mi + above_mi_col; | 37 | 2.92M | mi_step = | 38 | 2.92M | AOMMIN(mi_size_wide[above_mi[0]->bsize], mi_size_wide[BLOCK_64X64]); | 39 | | // If we're considering a block with width 4, it should be treated as | 40 | | // half of a pair of blocks with chroma information in the second. Move | 41 | | // above_mi_col back to the start of the pair if needed, set above_mbmi | 42 | | // to point at the block with chroma information, and set mi_step to 2 to | 43 | | // step over the entire pair at the end of the iteration. | 44 | 2.92M | if (mi_step == 1) { | 45 | 187k | above_mi_col &= ~1; | 46 | 187k | above_mi = prev_row_mi + above_mi_col + 1; | 47 | 187k | mi_step = 2; | 48 | 187k | } | 49 | 2.92M | if (is_neighbor_overlappable(*above_mi)) { | 50 | 2.55M | ++nb_count; | 51 | 2.55M | fun(xd, 0, above_mi_col - mi_col, AOMMIN(xd->width, mi_step), 0, | 52 | 2.55M | *above_mi, fun_ctxt, num_planes); | 53 | 2.55M | } | 54 | 2.92M | } | 55 | 2.50M | } |
|
56 | | |
57 | | static inline void foreach_overlappable_nb_left(const AV1_COMMON *cm, |
58 | | MACROBLOCKD *xd, int nb_max, |
59 | | overlappable_nb_visitor_t fun, |
60 | 1.29M | void *fun_ctxt) { |
61 | 1.29M | if (!xd->left_available) return; |
62 | | |
63 | 1.25M | const int num_planes = av1_num_planes(cm); |
64 | 1.25M | int nb_count = 0; |
65 | | // prev_col_mi points into the mi array, starting at the top of the |
66 | | // previous column |
67 | 1.25M | const int mi_row = xd->mi_row; |
68 | 1.25M | MB_MODE_INFO **prev_col_mi = xd->mi - 1 - mi_row * xd->mi_stride; |
69 | 1.25M | const int end_row = AOMMIN(mi_row + xd->height, cm->mi_params.mi_rows); |
70 | 1.25M | uint8_t mi_step; |
71 | 2.69M | for (int left_mi_row = mi_row; left_mi_row < end_row && nb_count < nb_max; |
72 | 1.44M | left_mi_row += mi_step) { |
73 | 1.44M | MB_MODE_INFO **left_mi = prev_col_mi + left_mi_row * xd->mi_stride; |
74 | 1.44M | mi_step = |
75 | 1.44M | AOMMIN(mi_size_high[left_mi[0]->bsize], mi_size_high[BLOCK_64X64]); |
76 | 1.44M | if (mi_step == 1) { |
77 | 125k | left_mi_row &= ~1; |
78 | 125k | left_mi = prev_col_mi + (left_mi_row + 1) * xd->mi_stride; |
79 | 125k | mi_step = 2; |
80 | 125k | } |
81 | 1.44M | if (is_neighbor_overlappable(*left_mi)) { |
82 | 1.26M | ++nb_count; |
83 | 1.26M | fun(xd, left_mi_row - mi_row, 0, AOMMIN(xd->height, mi_step), 1, *left_mi, |
84 | 1.26M | fun_ctxt, num_planes); |
85 | 1.26M | } |
86 | 1.44M | } |
87 | 1.25M | } decodeframe.c:foreach_overlappable_nb_left Line | Count | Source | 60 | 446k | void *fun_ctxt) { | 61 | 446k | if (!xd->left_available) return; | 62 | | | 63 | 446k | const int num_planes = av1_num_planes(cm); | 64 | 446k | int nb_count = 0; | 65 | | // prev_col_mi points into the mi array, starting at the top of the | 66 | | // previous column | 67 | 446k | const int mi_row = xd->mi_row; | 68 | 446k | MB_MODE_INFO **prev_col_mi = xd->mi - 1 - mi_row * xd->mi_stride; | 69 | 446k | const int end_row = AOMMIN(mi_row + xd->height, cm->mi_params.mi_rows); | 70 | 446k | uint8_t mi_step; | 71 | 937k | for (int left_mi_row = mi_row; left_mi_row < end_row && nb_count < nb_max; | 72 | 490k | left_mi_row += mi_step) { | 73 | 490k | MB_MODE_INFO **left_mi = prev_col_mi + left_mi_row * xd->mi_stride; | 74 | 490k | mi_step = | 75 | 490k | AOMMIN(mi_size_high[left_mi[0]->bsize], mi_size_high[BLOCK_64X64]); | 76 | 490k | if (mi_step == 1) { | 77 | 47.4k | left_mi_row &= ~1; | 78 | 47.4k | left_mi = prev_col_mi + (left_mi_row + 1) * xd->mi_stride; | 79 | 47.4k | mi_step = 2; | 80 | 47.4k | } | 81 | 490k | if (is_neighbor_overlappable(*left_mi)) { | 82 | 430k | ++nb_count; | 83 | 430k | fun(xd, left_mi_row - mi_row, 0, AOMMIN(xd->height, mi_step), 1, *left_mi, | 84 | 430k | fun_ctxt, num_planes); | 85 | 430k | } | 86 | 490k | } | 87 | 446k | } |
reconinter.c:foreach_overlappable_nb_left Line | Count | Source | 60 | 849k | void *fun_ctxt) { | 61 | 849k | if (!xd->left_available) return; | 62 | | | 63 | 803k | const int num_planes = av1_num_planes(cm); | 64 | 803k | int nb_count = 0; | 65 | | // prev_col_mi points into the mi array, starting at the top of the | 66 | | // previous column | 67 | 803k | const int mi_row = xd->mi_row; | 68 | 803k | MB_MODE_INFO **prev_col_mi = xd->mi - 1 - mi_row * xd->mi_stride; | 69 | 803k | const int end_row = AOMMIN(mi_row + xd->height, cm->mi_params.mi_rows); | 70 | 803k | uint8_t mi_step; | 71 | 1.75M | for (int left_mi_row = mi_row; left_mi_row < end_row && nb_count < nb_max; | 72 | 955k | left_mi_row += mi_step) { | 73 | 955k | MB_MODE_INFO **left_mi = prev_col_mi + left_mi_row * xd->mi_stride; | 74 | 955k | mi_step = | 75 | 955k | AOMMIN(mi_size_high[left_mi[0]->bsize], mi_size_high[BLOCK_64X64]); | 76 | 955k | if (mi_step == 1) { | 77 | 77.7k | left_mi_row &= ~1; | 78 | 77.7k | left_mi = prev_col_mi + (left_mi_row + 1) * xd->mi_stride; | 79 | 77.7k | mi_step = 2; | 80 | 77.7k | } | 81 | 955k | if (is_neighbor_overlappable(*left_mi)) { | 82 | 830k | ++nb_count; | 83 | 830k | fun(xd, left_mi_row - mi_row, 0, AOMMIN(xd->height, mi_step), 1, *left_mi, | 84 | 830k | fun_ctxt, num_planes); | 85 | 830k | } | 86 | 955k | } | 87 | 803k | } |
|
88 | | |
89 | | #endif // AOM_AV1_COMMON_OBMC_H_ |