/src/libvpx/vp9/common/vp9_blockd.c
Line | Count | Source |
1 | | /* |
2 | | * Copyright (c) 2014 The WebM project authors. All Rights Reserved. |
3 | | * |
4 | | * Use of this source code is governed by a BSD-style license |
5 | | * that can be found in the LICENSE file in the root of the source |
6 | | * tree. An additional intellectual property rights grant can be found |
7 | | * in the file PATENTS. All contributing project authors may |
8 | | * be found in the AUTHORS file in the root of the source tree. |
9 | | */ |
10 | | |
11 | | #include "vp9/common/vp9_blockd.h" |
12 | | |
13 | | PREDICTION_MODE vp9_left_block_mode(const MODE_INFO *cur_mi, |
14 | 6.75M | const MODE_INFO *left_mi, int b) { |
15 | 6.75M | if (b == 0 || b == 2) { |
16 | 4.63M | if (!left_mi || is_inter_block(left_mi)) return DC_PRED; |
17 | | |
18 | 3.93M | return get_y_mode(left_mi, b + 1); |
19 | 4.63M | } else { |
20 | 2.12M | assert(b == 1 || b == 3); |
21 | 2.12M | return cur_mi->bmi[b - 1].as_mode; |
22 | 2.12M | } |
23 | 6.75M | } |
24 | | |
25 | | PREDICTION_MODE vp9_above_block_mode(const MODE_INFO *cur_mi, |
26 | 6.75M | const MODE_INFO *above_mi, int b) { |
27 | 6.75M | if (b == 0 || b == 1) { |
28 | 4.64M | if (!above_mi || is_inter_block(above_mi)) return DC_PRED; |
29 | | |
30 | 3.68M | return get_y_mode(above_mi, b + 2); |
31 | 4.64M | } else { |
32 | 2.11M | assert(b == 2 || b == 3); |
33 | 2.11M | return cur_mi->bmi[b - 2].as_mode; |
34 | 2.11M | } |
35 | 6.75M | } |
36 | | |
37 | | void vp9_foreach_transformed_block_in_plane( |
38 | | const MACROBLOCKD *const xd, BLOCK_SIZE bsize, int plane, |
39 | 251M | foreach_transformed_block_visitor visit, void *arg) { |
40 | 251M | const struct macroblockd_plane *const pd = &xd->plane[plane]; |
41 | 251M | const MODE_INFO *mi = xd->mi[0]; |
42 | | // block and transform sizes, in number of 4x4 blocks log 2 ("*_b") |
43 | | // 4x4=0, 8x8=2, 16x16=4, 32x32=6, 64x64=8 |
44 | | // transform size varies per plane, look it up in a common way. |
45 | 251M | const TX_SIZE tx_size = plane ? get_uv_tx_size(mi, pd) : mi->tx_size; |
46 | 251M | const BLOCK_SIZE plane_bsize = get_plane_block_size(bsize, pd); |
47 | 251M | const int num_4x4_w = num_4x4_blocks_wide_lookup[plane_bsize]; |
48 | 251M | const int num_4x4_h = num_4x4_blocks_high_lookup[plane_bsize]; |
49 | 251M | const int step = 1 << (tx_size << 1); |
50 | 251M | int i = 0, r, c; |
51 | | |
52 | | // If mb_to_right_edge is < 0 we are in a situation in which |
53 | | // the current block size extends into the UMV and we won't |
54 | | // visit the sub blocks that are wholly within the UMV. |
55 | 251M | const int max_blocks_wide = |
56 | 251M | num_4x4_w + (xd->mb_to_right_edge >= 0 |
57 | 251M | ? 0 |
58 | 251M | : xd->mb_to_right_edge >> (5 + pd->subsampling_x)); |
59 | 251M | const int max_blocks_high = |
60 | 251M | num_4x4_h + (xd->mb_to_bottom_edge >= 0 |
61 | 251M | ? 0 |
62 | 251M | : xd->mb_to_bottom_edge >> (5 + pd->subsampling_y)); |
63 | 251M | const int extra_step = ((num_4x4_w - max_blocks_wide) >> tx_size) * step; |
64 | | |
65 | | // Keep track of the row and column of the blocks we use so that we know |
66 | | // if we are in the unrestricted motion border. |
67 | 563M | for (r = 0; r < max_blocks_high; r += (1 << tx_size)) { |
68 | | // Skip visiting the sub blocks that are wholly within the UMV. |
69 | 752M | for (c = 0; c < max_blocks_wide; c += (1 << tx_size)) { |
70 | 440M | visit(plane, i, r, c, plane_bsize, tx_size, arg); |
71 | 440M | i += step; |
72 | 440M | } |
73 | 312M | i += extra_step; |
74 | 312M | } |
75 | 251M | } |
76 | | |
77 | | void vp9_foreach_transformed_block(const MACROBLOCKD *const xd, |
78 | | BLOCK_SIZE bsize, |
79 | | foreach_transformed_block_visitor visit, |
80 | 6.63M | void *arg) { |
81 | 6.63M | int plane; |
82 | | |
83 | 26.5M | for (plane = 0; plane < MAX_MB_PLANE; ++plane) |
84 | 19.9M | vp9_foreach_transformed_block_in_plane(xd, bsize, plane, visit, arg); |
85 | 6.63M | } |
86 | | |
87 | | void vp9_set_contexts(const MACROBLOCKD *xd, struct macroblockd_plane *pd, |
88 | | BLOCK_SIZE plane_bsize, TX_SIZE tx_size, int has_eob, |
89 | 40.7M | int aoff, int loff) { |
90 | 40.7M | ENTROPY_CONTEXT *const a = pd->above_context + aoff; |
91 | 40.7M | ENTROPY_CONTEXT *const l = pd->left_context + loff; |
92 | 40.7M | const int tx_size_in_blocks = 1 << tx_size; |
93 | | |
94 | | // above |
95 | 40.7M | if (has_eob && xd->mb_to_right_edge < 0) { |
96 | 33.2k | int i; |
97 | 33.2k | const int blocks_wide = num_4x4_blocks_wide_lookup[plane_bsize] + |
98 | 33.2k | (xd->mb_to_right_edge >> (5 + pd->subsampling_x)); |
99 | 33.2k | int above_contexts = tx_size_in_blocks; |
100 | 33.2k | if (above_contexts + aoff > blocks_wide) |
101 | 3.89k | above_contexts = blocks_wide - aoff; |
102 | | |
103 | 95.5k | for (i = 0; i < above_contexts; ++i) a[i] = has_eob; |
104 | 40.1k | for (i = above_contexts; i < tx_size_in_blocks; ++i) a[i] = 0; |
105 | 40.6M | } else { |
106 | 40.6M | memset(a, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks); |
107 | 40.6M | } |
108 | | |
109 | | // left |
110 | 40.7M | if (has_eob && xd->mb_to_bottom_edge < 0) { |
111 | 34.6k | int i; |
112 | 34.6k | const int blocks_high = num_4x4_blocks_high_lookup[plane_bsize] + |
113 | 34.6k | (xd->mb_to_bottom_edge >> (5 + pd->subsampling_y)); |
114 | 34.6k | int left_contexts = tx_size_in_blocks; |
115 | 34.6k | if (left_contexts + loff > blocks_high) left_contexts = blocks_high - loff; |
116 | | |
117 | 82.9k | for (i = 0; i < left_contexts; ++i) l[i] = has_eob; |
118 | 45.8k | for (i = left_contexts; i < tx_size_in_blocks; ++i) l[i] = 0; |
119 | 40.6M | } else { |
120 | 40.6M | memset(l, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks); |
121 | 40.6M | } |
122 | 40.7M | } |
123 | | |
124 | 42.2k | void vp9_setup_block_planes(MACROBLOCKD *xd, int ss_x, int ss_y) { |
125 | 42.2k | int i; |
126 | | |
127 | 169k | for (i = 0; i < MAX_MB_PLANE; i++) { |
128 | 126k | xd->plane[i].subsampling_x = i ? ss_x : 0; |
129 | 126k | xd->plane[i].subsampling_y = i ? ss_y : 0; |
130 | 126k | } |
131 | 42.2k | } |