Line data    Source code

       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           0 : PREDICTION_MODE vp9_left_block_mode(const MODE_INFO *cur_mi,
      14             :                                     const MODE_INFO *left_mi, int b) {
      15           0 :   if (b == 0 || b == 2) {
      16           0 :     if (!left_mi || is_inter_block(left_mi)) return DC_PRED;
      17             : 
      18           0 :     return get_y_mode(left_mi, b + 1);
      19             :   } else {
      20           0 :     assert(b == 1 || b == 3);
      21           0 :     return cur_mi->bmi[b - 1].as_mode;
      22             :   }
      23             : }
      24             : 
      25           0 : PREDICTION_MODE vp9_above_block_mode(const MODE_INFO *cur_mi,
      26             :                                      const MODE_INFO *above_mi, int b) {
      27           0 :   if (b == 0 || b == 1) {
      28           0 :     if (!above_mi || is_inter_block(above_mi)) return DC_PRED;
      29             : 
      30           0 :     return get_y_mode(above_mi, b + 2);
      31             :   } else {
      32           0 :     assert(b == 2 || b == 3);
      33           0 :     return cur_mi->bmi[b - 2].as_mode;
      34             :   }
      35             : }
      36             : 
      37           0 : void vp9_foreach_transformed_block_in_plane(
      38             :     const MACROBLOCKD *const xd, BLOCK_SIZE bsize, int plane,
      39             :     foreach_transformed_block_visitor visit, void *arg) {
      40           0 :   const struct macroblockd_plane *const pd = &xd->plane[plane];
      41           0 :   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           0 :   const TX_SIZE tx_size = plane ? get_uv_tx_size(mi, pd) : mi->tx_size;
      46           0 :   const BLOCK_SIZE plane_bsize = get_plane_block_size(bsize, pd);
      47           0 :   const int num_4x4_w = num_4x4_blocks_wide_lookup[plane_bsize];
      48           0 :   const int num_4x4_h = num_4x4_blocks_high_lookup[plane_bsize];
      49           0 :   const int step = 1 << (tx_size << 1);
      50           0 :   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           0 :   const int max_blocks_wide =
      56           0 :       num_4x4_w + (xd->mb_to_right_edge >= 0 ? 0 : xd->mb_to_right_edge >>
      57           0 :                                                        (5 + pd->subsampling_x));
      58           0 :   const int max_blocks_high =
      59           0 :       num_4x4_h + (xd->mb_to_bottom_edge >= 0
      60             :                        ? 0
      61           0 :                        : xd->mb_to_bottom_edge >> (5 + pd->subsampling_y));
      62           0 :   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           0 :   for (r = 0; r < max_blocks_high; r += (1 << tx_size)) {
      67             :     // Skip visiting the sub blocks that are wholly within the UMV.
      68           0 :     for (c = 0; c < max_blocks_wide; c += (1 << tx_size)) {
      69           0 :       visit(plane, i, r, c, plane_bsize, tx_size, arg);
      70           0 :       i += step;
      71             :     }
      72           0 :     i += extra_step;
      73             :   }
      74           0 : }
      75             : 
      76           0 : 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           0 :   for (plane = 0; plane < MAX_MB_PLANE; ++plane)
      83           0 :     vp9_foreach_transformed_block_in_plane(xd, bsize, plane, visit, arg);
      84           0 : }
      85             : 
      86           0 : 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           0 :   ENTROPY_CONTEXT *const a = pd->above_context + aoff;
      90           0 :   ENTROPY_CONTEXT *const l = pd->left_context + loff;
      91           0 :   const int tx_size_in_blocks = 1 << tx_size;
      92             : 
      93             :   // above
      94           0 :   if (has_eob && xd->mb_to_right_edge < 0) {
      95             :     int i;
      96           0 :     const int blocks_wide = num_4x4_blocks_wide_lookup[plane_bsize] +
      97           0 :                             (xd->mb_to_right_edge >> (5 + pd->subsampling_x));
      98           0 :     int above_contexts = tx_size_in_blocks;
      99           0 :     if (above_contexts + aoff > blocks_wide)
     100           0 :       above_contexts = blocks_wide - aoff;
     101             : 
     102           0 :     for (i = 0; i < above_contexts; ++i) a[i] = has_eob;
     103           0 :     for (i = above_contexts; i < tx_size_in_blocks; ++i) a[i] = 0;
     104             :   } else {
     105           0 :     memset(a, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks);
     106             :   }
     107             : 
     108             :   // left
     109           0 :   if (has_eob && xd->mb_to_bottom_edge < 0) {
     110             :     int i;
     111           0 :     const int blocks_high = num_4x4_blocks_high_lookup[plane_bsize] +
     112           0 :                             (xd->mb_to_bottom_edge >> (5 + pd->subsampling_y));
     113           0 :     int left_contexts = tx_size_in_blocks;
     114           0 :     if (left_contexts + loff > blocks_high) left_contexts = blocks_high - loff;
     115             : 
     116           0 :     for (i = 0; i < left_contexts; ++i) l[i] = has_eob;
     117           0 :     for (i = left_contexts; i < tx_size_in_blocks; ++i) l[i] = 0;
     118             :   } else {
     119           0 :     memset(l, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks);
     120             :   }
     121           0 : }
     122             : 
     123           0 : void vp9_setup_block_planes(MACROBLOCKD *xd, int ss_x, int ss_y) {
     124             :   int i;
     125             : 
     126           0 :   for (i = 0; i < MAX_MB_PLANE; i++) {
     127           0 :     xd->plane[i].subsampling_x = i ? ss_x : 0;
     128           0 :     xd->plane[i].subsampling_y = i ? ss_y : 0;
     129             :   }
     130           0 : }