Coverage Report

Created: 2025-06-13 07:07

/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
4.28M
                                                 void *fun_ctxt) {
24
4.28M
  if (!xd->up_available) return;
25
26
4.07M
  const int num_planes = av1_num_planes(cm);
27
4.07M
  int nb_count = 0;
28
4.07M
  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
4.07M
  MB_MODE_INFO **prev_row_mi = xd->mi - mi_col - 1 * xd->mi_stride;
32
4.07M
  const int end_col = AOMMIN(mi_col + xd->width, cm->mi_params.mi_cols);
33
4.07M
  uint8_t mi_step;
34
8.75M
  for (int above_mi_col = mi_col; above_mi_col < end_col && nb_count < nb_max;
35
4.68M
       above_mi_col += mi_step) {
36
4.68M
    MB_MODE_INFO **above_mi = prev_row_mi + above_mi_col;
37
4.68M
    mi_step =
38
4.68M
        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
4.68M
    if (mi_step == 1) {
45
297k
      above_mi_col &= ~1;
46
297k
      above_mi = prev_row_mi + above_mi_col + 1;
47
297k
      mi_step = 2;
48
297k
    }
49
4.68M
    if (is_neighbor_overlappable(*above_mi)) {
50
4.16M
      ++nb_count;
51
4.16M
      fun(xd, 0, above_mi_col - mi_col, AOMMIN(xd->width, mi_step), 0,
52
4.16M
          *above_mi, fun_ctxt, num_planes);
53
4.16M
    }
54
4.68M
  }
55
4.07M
}
decodeframe.c:foreach_overlappable_nb_above
Line
Count
Source
23
624k
                                                 void *fun_ctxt) {
24
624k
  if (!xd->up_available) return;
25
26
624k
  const int num_planes = av1_num_planes(cm);
27
624k
  int nb_count = 0;
28
624k
  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
624k
  MB_MODE_INFO **prev_row_mi = xd->mi - mi_col - 1 * xd->mi_stride;
32
624k
  const int end_col = AOMMIN(mi_col + xd->width, cm->mi_params.mi_cols);
33
624k
  uint8_t mi_step;
34
1.31M
  for (int above_mi_col = mi_col; above_mi_col < end_col && nb_count < nb_max;
35
695k
       above_mi_col += mi_step) {
36
695k
    MB_MODE_INFO **above_mi = prev_row_mi + above_mi_col;
37
695k
    mi_step =
38
695k
        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
695k
    if (mi_step == 1) {
45
46.1k
      above_mi_col &= ~1;
46
46.1k
      above_mi = prev_row_mi + above_mi_col + 1;
47
46.1k
      mi_step = 2;
48
46.1k
    }
49
695k
    if (is_neighbor_overlappable(*above_mi)) {
50
627k
      ++nb_count;
51
627k
      fun(xd, 0, above_mi_col - mi_col, AOMMIN(xd->width, mi_step), 0,
52
627k
          *above_mi, fun_ctxt, num_planes);
53
627k
    }
54
695k
  }
55
624k
}
reconinter.c:foreach_overlappable_nb_above
Line
Count
Source
23
3.65M
                                                 void *fun_ctxt) {
24
3.65M
  if (!xd->up_available) return;
25
26
3.44M
  const int num_planes = av1_num_planes(cm);
27
3.44M
  int nb_count = 0;
28
3.44M
  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
3.44M
  MB_MODE_INFO **prev_row_mi = xd->mi - mi_col - 1 * xd->mi_stride;
32
3.44M
  const int end_col = AOMMIN(mi_col + xd->width, cm->mi_params.mi_cols);
33
3.44M
  uint8_t mi_step;
34
7.43M
  for (int above_mi_col = mi_col; above_mi_col < end_col && nb_count < nb_max;
35
3.99M
       above_mi_col += mi_step) {
36
3.99M
    MB_MODE_INFO **above_mi = prev_row_mi + above_mi_col;
37
3.99M
    mi_step =
38
3.99M
        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.99M
    if (mi_step == 1) {
45
251k
      above_mi_col &= ~1;
46
251k
      above_mi = prev_row_mi + above_mi_col + 1;
47
251k
      mi_step = 2;
48
251k
    }
49
3.99M
    if (is_neighbor_overlappable(*above_mi)) {
50
3.53M
      ++nb_count;
51
3.53M
      fun(xd, 0, above_mi_col - mi_col, AOMMIN(xd->width, mi_step), 0,
52
3.53M
          *above_mi, fun_ctxt, num_planes);
53
3.53M
    }
54
3.99M
  }
55
3.44M
}
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.75M
                                                void *fun_ctxt) {
61
1.75M
  if (!xd->left_available) return;
62
63
1.70M
  const int num_planes = av1_num_planes(cm);
64
1.70M
  int nb_count = 0;
65
  // prev_col_mi points into the mi array, starting at the top of the
66
  // previous column
67
1.70M
  const int mi_row = xd->mi_row;
68
1.70M
  MB_MODE_INFO **prev_col_mi = xd->mi - 1 - mi_row * xd->mi_stride;
69
1.70M
  const int end_row = AOMMIN(mi_row + xd->height, cm->mi_params.mi_rows);
70
1.70M
  uint8_t mi_step;
71
3.65M
  for (int left_mi_row = mi_row; left_mi_row < end_row && nb_count < nb_max;
72
1.94M
       left_mi_row += mi_step) {
73
1.94M
    MB_MODE_INFO **left_mi = prev_col_mi + left_mi_row * xd->mi_stride;
74
1.94M
    mi_step =
75
1.94M
        AOMMIN(mi_size_high[left_mi[0]->bsize], mi_size_high[BLOCK_64X64]);
76
1.94M
    if (mi_step == 1) {
77
148k
      left_mi_row &= ~1;
78
148k
      left_mi = prev_col_mi + (left_mi_row + 1) * xd->mi_stride;
79
148k
      mi_step = 2;
80
148k
    }
81
1.94M
    if (is_neighbor_overlappable(*left_mi)) {
82
1.71M
      ++nb_count;
83
1.71M
      fun(xd, left_mi_row - mi_row, 0, AOMMIN(xd->height, mi_step), 1, *left_mi,
84
1.71M
          fun_ctxt, num_planes);
85
1.71M
    }
86
1.94M
  }
87
1.70M
}
decodeframe.c:foreach_overlappable_nb_left
Line
Count
Source
60
627k
                                                void *fun_ctxt) {
61
627k
  if (!xd->left_available) return;
62
63
627k
  const int num_planes = av1_num_planes(cm);
64
627k
  int nb_count = 0;
65
  // prev_col_mi points into the mi array, starting at the top of the
66
  // previous column
67
627k
  const int mi_row = xd->mi_row;
68
627k
  MB_MODE_INFO **prev_col_mi = xd->mi - 1 - mi_row * xd->mi_stride;
69
627k
  const int end_row = AOMMIN(mi_row + xd->height, cm->mi_params.mi_rows);
70
627k
  uint8_t mi_step;
71
1.31M
  for (int left_mi_row = mi_row; left_mi_row < end_row && nb_count < nb_max;
72
689k
       left_mi_row += mi_step) {
73
689k
    MB_MODE_INFO **left_mi = prev_col_mi + left_mi_row * xd->mi_stride;
74
689k
    mi_step =
75
689k
        AOMMIN(mi_size_high[left_mi[0]->bsize], mi_size_high[BLOCK_64X64]);
76
689k
    if (mi_step == 1) {
77
59.4k
      left_mi_row &= ~1;
78
59.4k
      left_mi = prev_col_mi + (left_mi_row + 1) * xd->mi_stride;
79
59.4k
      mi_step = 2;
80
59.4k
    }
81
689k
    if (is_neighbor_overlappable(*left_mi)) {
82
622k
      ++nb_count;
83
622k
      fun(xd, left_mi_row - mi_row, 0, AOMMIN(xd->height, mi_step), 1, *left_mi,
84
622k
          fun_ctxt, num_planes);
85
622k
    }
86
689k
  }
87
627k
}
reconinter.c:foreach_overlappable_nb_left
Line
Count
Source
60
1.13M
                                                void *fun_ctxt) {
61
1.13M
  if (!xd->left_available) return;
62
63
1.07M
  const int num_planes = av1_num_planes(cm);
64
1.07M
  int nb_count = 0;
65
  // prev_col_mi points into the mi array, starting at the top of the
66
  // previous column
67
1.07M
  const int mi_row = xd->mi_row;
68
1.07M
  MB_MODE_INFO **prev_col_mi = xd->mi - 1 - mi_row * xd->mi_stride;
69
1.07M
  const int end_row = AOMMIN(mi_row + xd->height, cm->mi_params.mi_rows);
70
1.07M
  uint8_t mi_step;
71
2.33M
  for (int left_mi_row = mi_row; left_mi_row < end_row && nb_count < nb_max;
72
1.25M
       left_mi_row += mi_step) {
73
1.25M
    MB_MODE_INFO **left_mi = prev_col_mi + left_mi_row * xd->mi_stride;
74
1.25M
    mi_step =
75
1.25M
        AOMMIN(mi_size_high[left_mi[0]->bsize], mi_size_high[BLOCK_64X64]);
76
1.25M
    if (mi_step == 1) {
77
89.0k
      left_mi_row &= ~1;
78
89.0k
      left_mi = prev_col_mi + (left_mi_row + 1) * xd->mi_stride;
79
89.0k
      mi_step = 2;
80
89.0k
    }
81
1.25M
    if (is_neighbor_overlappable(*left_mi)) {
82
1.09M
      ++nb_count;
83
1.09M
      fun(xd, left_mi_row - mi_row, 0, AOMMIN(xd->height, mi_step), 1, *left_mi,
84
1.09M
          fun_ctxt, num_planes);
85
1.09M
    }
86
1.25M
  }
87
1.07M
}
88
89
#endif  // AOM_AV1_COMMON_OBMC_H_