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
foreach_overlappable_nb_above(const AV1_COMMON * cm,MACROBLOCKD * xd,int nb_max,overlappable_nb_visitor_t fun,void * fun_ctxt)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 void *fun_ctxt) {
24 if (!xd->up_available) return;
25
26 const int num_planes = av1_num_planes(cm);
27 int nb_count = 0;
28 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 MB_MODE_INFO **prev_row_mi = xd->mi - mi_col - 1 * xd->mi_stride;
32 const int end_col = AOMMIN(mi_col + xd->width, cm->mi_params.mi_cols);
33 uint8_t mi_step;
34 for (int above_mi_col = mi_col; above_mi_col < end_col && nb_count < nb_max;
35 above_mi_col += mi_step) {
36 MB_MODE_INFO **above_mi = prev_row_mi + above_mi_col;
37 mi_step =
38 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 if (mi_step == 1) {
45 above_mi_col &= ~1;
46 above_mi = prev_row_mi + above_mi_col + 1;
47 mi_step = 2;
48 }
49 if (is_neighbor_overlappable(*above_mi)) {
50 ++nb_count;
51 fun(xd, 0, above_mi_col - mi_col, AOMMIN(xd->width, mi_step), 0,
52 *above_mi, fun_ctxt, num_planes);
53 }
54 }
55 }
56
foreach_overlappable_nb_left(const AV1_COMMON * cm,MACROBLOCKD * xd,int nb_max,overlappable_nb_visitor_t fun,void * fun_ctxt)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 void *fun_ctxt) {
61 if (!xd->left_available) return;
62
63 const int num_planes = av1_num_planes(cm);
64 int nb_count = 0;
65 // prev_col_mi points into the mi array, starting at the top of the
66 // previous column
67 const int mi_row = xd->mi_row;
68 MB_MODE_INFO **prev_col_mi = xd->mi - 1 - mi_row * xd->mi_stride;
69 const int end_row = AOMMIN(mi_row + xd->height, cm->mi_params.mi_rows);
70 uint8_t mi_step;
71 for (int left_mi_row = mi_row; left_mi_row < end_row && nb_count < nb_max;
72 left_mi_row += mi_step) {
73 MB_MODE_INFO **left_mi = prev_col_mi + left_mi_row * xd->mi_stride;
74 mi_step =
75 AOMMIN(mi_size_high[left_mi[0]->bsize], mi_size_high[BLOCK_64X64]);
76 if (mi_step == 1) {
77 left_mi_row &= ~1;
78 left_mi = prev_col_mi + (left_mi_row + 1) * xd->mi_stride;
79 mi_step = 2;
80 }
81 if (is_neighbor_overlappable(*left_mi)) {
82 ++nb_count;
83 fun(xd, left_mi_row - mi_row, 0, AOMMIN(xd->height, mi_step), 1, *left_mi,
84 fun_ctxt, num_planes);
85 }
86 }
87 }
88
89 #endif // AOM_AV1_COMMON_OBMC_H_
90