michael@0: /*
michael@0:  *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
michael@0:  *
michael@0:  *  Use of this source code is governed by a BSD-style license
michael@0:  *  that can be found in the LICENSE file in the root of the source
michael@0:  *  tree. An additional intellectual property rights grant can be found
michael@0:  *  in the file PATENTS.  All contributing project authors may
michael@0:  *  be found in the AUTHORS file in the root of the source tree.
michael@0:  */
michael@0: 
michael@0: #include "vp9/common/vp9_tile_common.h"
michael@0: 
michael@0: #include "vp9/common/vp9_onyxc_int.h"
michael@0: 
michael@0: #define MIN_TILE_WIDTH_B64 4
michael@0: #define MAX_TILE_WIDTH_B64 64
michael@0: 
michael@0: static int get_tile_offset(int idx, int mis, int log2) {
michael@0:   const int sb_cols = mi_cols_aligned_to_sb(mis) >> MI_BLOCK_SIZE_LOG2;
michael@0:   const int offset = ((idx * sb_cols) >> log2) << MI_BLOCK_SIZE_LOG2;
michael@0:   return MIN(offset, mis);
michael@0: }
michael@0: 
michael@0: void vp9_tile_init(TileInfo *tile, const VP9_COMMON *cm, int row, int col) {
michael@0:   tile->mi_row_start = get_tile_offset(row, cm->mi_rows, cm->log2_tile_rows);
michael@0:   tile->mi_row_end = get_tile_offset(row + 1, cm->mi_rows, cm->log2_tile_rows);
michael@0:   tile->mi_col_start = get_tile_offset(col, cm->mi_cols, cm->log2_tile_cols);
michael@0:   tile->mi_col_end = get_tile_offset(col + 1, cm->mi_cols, cm->log2_tile_cols);
michael@0: }
michael@0: 
michael@0: void vp9_get_tile_n_bits(int mi_cols,
michael@0:                          int *min_log2_tile_cols, int *max_log2_tile_cols) {
michael@0:   const int sb_cols = mi_cols_aligned_to_sb(mi_cols) >> MI_BLOCK_SIZE_LOG2;
michael@0:   int min_log2 = 0, max_log2 = 0;
michael@0: 
michael@0:   // max
michael@0:   while ((sb_cols >> max_log2) >= MIN_TILE_WIDTH_B64)
michael@0:     ++max_log2;
michael@0:   --max_log2;
michael@0:   if (max_log2 < 0)
michael@0:     max_log2 = 0;
michael@0: 
michael@0:   // min
michael@0:   while ((MAX_TILE_WIDTH_B64 << min_log2) < sb_cols)
michael@0:     ++min_log2;
michael@0: 
michael@0:   assert(min_log2 <= max_log2);
michael@0: 
michael@0:   *min_log2_tile_cols = min_log2;
michael@0:   *max_log2_tile_cols = max_log2;
michael@0: }