| 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 |
| 11 #include "vp9/common/vp9_tile_common.h" | 11 #include "vp9/common/vp9_tile_common.h" |
| 12 | 12 |
| 13 #define MIN_TILE_WIDTH_B64 4 | 13 #define MIN_TILE_WIDTH_B64 4 |
| 14 #define MAX_TILE_WIDTH_B64 64 | 14 #define MAX_TILE_WIDTH_B64 64 |
| 15 | 15 |
| 16 static int to_sbs(n_mis) { | 16 static int to_sbs(n_mis) { |
| 17 return mi_cols_aligned_to_sb(n_mis) >> LOG2_MI_BLOCK_SIZE; | 17 return mi_cols_aligned_to_sb(n_mis) >> MI_BLOCK_SIZE_LOG2; |
| 18 } | 18 } |
| 19 | 19 |
| 20 static void vp9_get_tile_offsets(int *min_tile_off, int *max_tile_off, | 20 static void vp9_get_tile_offsets(int *min_tile_off, int *max_tile_off, |
| 21 int tile_idx, int log2_n_tiles, int n_mis) { | 21 int tile_idx, int log2_n_tiles, int n_mis) { |
| 22 const int n_sbs = to_sbs(n_mis); | 22 const int n_sbs = to_sbs(n_mis); |
| 23 const int sb_off1 = (tile_idx * n_sbs) >> log2_n_tiles; | 23 const int sb_off1 = (tile_idx * n_sbs) >> log2_n_tiles; |
| 24 const int sb_off2 = ((tile_idx + 1) * n_sbs) >> log2_n_tiles; | 24 const int sb_off2 = ((tile_idx + 1) * n_sbs) >> log2_n_tiles; |
| 25 | 25 |
| 26 *min_tile_off = MIN(sb_off1 << 3, n_mis); | 26 *min_tile_off = MIN(sb_off1 << 3, n_mis); |
| 27 *max_tile_off = MIN(sb_off2 << 3, n_mis); | 27 *max_tile_off = MIN(sb_off2 << 3, n_mis); |
| (...skipping 24 matching lines...) Expand all Loading... |
| 52 | 52 |
| 53 for (min_log2_n_tiles = 0; | 53 for (min_log2_n_tiles = 0; |
| 54 (MAX_TILE_WIDTH_B64 << min_log2_n_tiles) < sb_cols; | 54 (MAX_TILE_WIDTH_B64 << min_log2_n_tiles) < sb_cols; |
| 55 min_log2_n_tiles++) {} | 55 min_log2_n_tiles++) {} |
| 56 | 56 |
| 57 assert(min_log2_n_tiles <= max_log2_n_tiles); | 57 assert(min_log2_n_tiles <= max_log2_n_tiles); |
| 58 | 58 |
| 59 *min_log2_tile_cols = min_log2_n_tiles; | 59 *min_log2_tile_cols = min_log2_n_tiles; |
| 60 *max_log2_tile_cols = max_log2_n_tiles; | 60 *max_log2_tile_cols = max_log2_n_tiles; |
| 61 } | 61 } |
| OLD | NEW |