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 
vp9_left_block_mode(const MODE_INFO * cur_mi,const MODE_INFO * left_mi,int b)13 PREDICTION_MODE vp9_left_block_mode(const MODE_INFO *cur_mi,
14                                     const MODE_INFO *left_mi, int b) {
15   if (b == 0 || b == 2) {
16     if (!left_mi || is_inter_block(&left_mi->mbmi))
17       return DC_PRED;
18 
19     return get_y_mode(left_mi, b + 1);
20   } else {
21     assert(b == 1 || b == 3);
22     return cur_mi->bmi[b - 1].as_mode;
23   }
24 }
25 
vp9_above_block_mode(const MODE_INFO * cur_mi,const MODE_INFO * above_mi,int b)26 PREDICTION_MODE vp9_above_block_mode(const MODE_INFO *cur_mi,
27                                      const MODE_INFO *above_mi, int b) {
28   if (b == 0 || b == 1) {
29     if (!above_mi || is_inter_block(&above_mi->mbmi))
30       return DC_PRED;
31 
32     return get_y_mode(above_mi, b + 2);
33   } else {
34     assert(b == 2 || b == 3);
35     return cur_mi->bmi[b - 2].as_mode;
36   }
37 }
38 
vp9_foreach_transformed_block_in_plane(const MACROBLOCKD * const xd,BLOCK_SIZE bsize,int plane,foreach_transformed_block_visitor visit,void * arg)39 void vp9_foreach_transformed_block_in_plane(
40     const MACROBLOCKD *const xd, BLOCK_SIZE bsize, int plane,
41     foreach_transformed_block_visitor visit, void *arg) {
42   const struct macroblockd_plane *const pd = &xd->plane[plane];
43   const MB_MODE_INFO* mbmi = &xd->mi[0]->mbmi;
44   // block and transform sizes, in number of 4x4 blocks log 2 ("*_b")
45   // 4x4=0, 8x8=2, 16x16=4, 32x32=6, 64x64=8
46   // transform size varies per plane, look it up in a common way.
47   const TX_SIZE tx_size = plane ? get_uv_tx_size(mbmi, pd)
48                                 : mbmi->tx_size;
49   const BLOCK_SIZE plane_bsize = get_plane_block_size(bsize, pd);
50   const int num_4x4_w = num_4x4_blocks_wide_lookup[plane_bsize];
51   const int num_4x4_h = num_4x4_blocks_high_lookup[plane_bsize];
52   const int step = 1 << (tx_size << 1);
53   int i = 0, r, c;
54 
55   // If mb_to_right_edge is < 0 we are in a situation in which
56   // the current block size extends into the UMV and we won't
57   // visit the sub blocks that are wholly within the UMV.
58   const int max_blocks_wide = num_4x4_w + (xd->mb_to_right_edge >= 0 ? 0 :
59       xd->mb_to_right_edge >> (5 + pd->subsampling_x));
60   const int max_blocks_high = num_4x4_h + (xd->mb_to_bottom_edge >= 0 ? 0 :
61       xd->mb_to_bottom_edge >> (5 + pd->subsampling_y));
62   const int extra_step = ((num_4x4_w - max_blocks_wide) >> tx_size) * step;
63 
64   // Keep track of the row and column of the blocks we use so that we know
65   // if we are in the unrestricted motion border.
66   for (r = 0; r < max_blocks_high; r += (1 << tx_size)) {
67     // Skip visiting the sub blocks that are wholly within the UMV.
68     for (c = 0; c < max_blocks_wide; c += (1 << tx_size)) {
69       visit(plane, i, plane_bsize, tx_size, arg);
70       i += step;
71     }
72     i += extra_step;
73   }
74 }
75 
vp9_foreach_transformed_block(const MACROBLOCKD * const xd,BLOCK_SIZE bsize,foreach_transformed_block_visitor visit,void * arg)76 void vp9_foreach_transformed_block(const MACROBLOCKD* const xd,
77                                    BLOCK_SIZE bsize,
78                                    foreach_transformed_block_visitor visit,
79                                    void *arg) {
80   int plane;
81 
82   for (plane = 0; plane < MAX_MB_PLANE; ++plane)
83     vp9_foreach_transformed_block_in_plane(xd, bsize, plane, visit, arg);
84 }
85 
vp9_set_contexts(const MACROBLOCKD * xd,struct macroblockd_plane * pd,BLOCK_SIZE plane_bsize,TX_SIZE tx_size,int has_eob,int aoff,int loff)86 void vp9_set_contexts(const MACROBLOCKD *xd, struct macroblockd_plane *pd,
87                       BLOCK_SIZE plane_bsize, TX_SIZE tx_size, int has_eob,
88                       int aoff, int loff) {
89   ENTROPY_CONTEXT *const a = pd->above_context + aoff;
90   ENTROPY_CONTEXT *const l = pd->left_context + loff;
91   const int tx_size_in_blocks = 1 << tx_size;
92 
93   // above
94   if (has_eob && xd->mb_to_right_edge < 0) {
95     int i;
96     const int blocks_wide = num_4x4_blocks_wide_lookup[plane_bsize] +
97                             (xd->mb_to_right_edge >> (5 + pd->subsampling_x));
98     int above_contexts = tx_size_in_blocks;
99     if (above_contexts + aoff > blocks_wide)
100       above_contexts = blocks_wide - aoff;
101 
102     for (i = 0; i < above_contexts; ++i)
103       a[i] = has_eob;
104     for (i = above_contexts; i < tx_size_in_blocks; ++i)
105       a[i] = 0;
106   } else {
107     memset(a, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks);
108   }
109 
110   // left
111   if (has_eob && xd->mb_to_bottom_edge < 0) {
112     int i;
113     const int blocks_high = num_4x4_blocks_high_lookup[plane_bsize] +
114                             (xd->mb_to_bottom_edge >> (5 + pd->subsampling_y));
115     int left_contexts = tx_size_in_blocks;
116     if (left_contexts + loff > blocks_high)
117       left_contexts = blocks_high - loff;
118 
119     for (i = 0; i < left_contexts; ++i)
120       l[i] = has_eob;
121     for (i = left_contexts; i < tx_size_in_blocks; ++i)
122       l[i] = 0;
123   } else {
124     memset(l, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks);
125   }
126 }
127 
vp9_setup_block_planes(MACROBLOCKD * xd,int ss_x,int ss_y)128 void vp9_setup_block_planes(MACROBLOCKD *xd, int ss_x, int ss_y) {
129   int i;
130 
131   for (i = 0; i < MAX_MB_PLANE; i++) {
132     xd->plane[i].subsampling_x = i ? ss_x : 0;
133     xd->plane[i].subsampling_y = i ? ss_y : 0;
134   }
135 }
136