OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved. | 2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 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 | 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 | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
(...skipping 18 matching lines...) Expand all Loading... |
29 void vp9_tile_set_col(TileInfo *tile, const VP9_COMMON *cm, int col) { | 29 void vp9_tile_set_col(TileInfo *tile, const VP9_COMMON *cm, int col) { |
30 tile->mi_col_start = get_tile_offset(col, cm->mi_cols, cm->log2_tile_cols); | 30 tile->mi_col_start = get_tile_offset(col, cm->mi_cols, cm->log2_tile_cols); |
31 tile->mi_col_end = get_tile_offset(col + 1, cm->mi_cols, cm->log2_tile_cols); | 31 tile->mi_col_end = get_tile_offset(col + 1, cm->mi_cols, cm->log2_tile_cols); |
32 } | 32 } |
33 | 33 |
34 void vp9_tile_init(TileInfo *tile, const VP9_COMMON *cm, int row, int col) { | 34 void vp9_tile_init(TileInfo *tile, const VP9_COMMON *cm, int row, int col) { |
35 vp9_tile_set_row(tile, cm, row); | 35 vp9_tile_set_row(tile, cm, row); |
36 vp9_tile_set_col(tile, cm, col); | 36 vp9_tile_set_col(tile, cm, col); |
37 } | 37 } |
38 | 38 |
| 39 static int get_min_log2_tile_cols(const int sb64_cols) { |
| 40 int min_log2 = 0; |
| 41 while ((MAX_TILE_WIDTH_B64 << min_log2) < sb64_cols) |
| 42 ++min_log2; |
| 43 return min_log2; |
| 44 } |
| 45 |
| 46 static int get_max_log2_tile_cols(const int sb64_cols) { |
| 47 int max_log2 = 1; |
| 48 while ((sb64_cols >> max_log2) >= MIN_TILE_WIDTH_B64) |
| 49 ++max_log2; |
| 50 return max_log2 - 1; |
| 51 } |
| 52 |
39 void vp9_get_tile_n_bits(int mi_cols, | 53 void vp9_get_tile_n_bits(int mi_cols, |
40 int *min_log2_tile_cols, int *max_log2_tile_cols) { | 54 int *min_log2_tile_cols, int *max_log2_tile_cols) { |
41 const int sb_cols = mi_cols_aligned_to_sb(mi_cols) >> MI_BLOCK_SIZE_LOG2; | 55 const int sb64_cols = mi_cols_aligned_to_sb(mi_cols) >> MI_BLOCK_SIZE_LOG2; |
42 int min_log2 = 0, max_log2 = 0; | 56 *min_log2_tile_cols = get_min_log2_tile_cols(sb64_cols); |
43 | 57 *max_log2_tile_cols = get_max_log2_tile_cols(sb64_cols); |
44 // max | 58 assert(*min_log2_tile_cols <= *max_log2_tile_cols); |
45 while ((sb_cols >> max_log2) >= MIN_TILE_WIDTH_B64) | |
46 ++max_log2; | |
47 --max_log2; | |
48 if (max_log2 < 0) | |
49 max_log2 = 0; | |
50 | |
51 // min | |
52 while ((MAX_TILE_WIDTH_B64 << min_log2) < sb_cols) | |
53 ++min_log2; | |
54 | |
55 assert(min_log2 <= max_log2); | |
56 | |
57 *min_log2_tile_cols = min_log2; | |
58 *max_log2_tile_cols = max_log2; | |
59 } | 59 } |
OLD | NEW |