1 /*
2 * Copyright (c) 2016, Alliance for Open Media. All rights reserved
3 *
4 * This source code is subject to the terms of the BSD 2 Clause License and
5 * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
6 * was not distributed with this source code in the LICENSE file, you can
7 * obtain it at www.aomedia.org/license/software. If the Alliance for Open
8 * Media Patent License 1.0 was not distributed with this source code in the
9 * PATENTS file, you can obtain it at www.aomedia.org/license/patent.
10 */
11
12 #include "av1/common/tile_common.h"
13 #include "av1/common/onyxc_int.h"
14 #include "aom_dsp/aom_dsp_common.h"
15
16 #if CONFIG_DEPENDENT_HORZTILES
av1_tile_set_tg_boundary(TileInfo * tile,const AV1_COMMON * const cm,int row,int col)17 void av1_tile_set_tg_boundary(TileInfo *tile, const AV1_COMMON *const cm,
18 int row, int col) {
19 const int tg_start_row = cm->tile_group_start_row[row][col];
20 const int tg_start_col = cm->tile_group_start_col[row][col];
21 tile->tg_horz_boundary = ((row == tg_start_row && col >= tg_start_col) ||
22 (row == tg_start_row + 1 && col < tg_start_col));
23 #if CONFIG_MAX_TILE
24 if (cm->tile_row_independent[row]) {
25 tile->tg_horz_boundary = 1; // this tile row is independent
26 }
27 #endif
28 }
29 #endif
av1_tile_init(TileInfo * tile,const AV1_COMMON * cm,int row,int col)30 void av1_tile_init(TileInfo *tile, const AV1_COMMON *cm, int row, int col) {
31 av1_tile_set_row(tile, cm, row);
32 av1_tile_set_col(tile, cm, col);
33 #if CONFIG_DEPENDENT_HORZTILES
34 av1_tile_set_tg_boundary(tile, cm, row, col);
35 #endif
36 }
37
38 #if CONFIG_MAX_TILE
39
40 // Find smallest k>=0 such that (blk_size << k) >= target
tile_log2(int blk_size,int target)41 static int tile_log2(int blk_size, int target) {
42 int k;
43 for (k = 0; (blk_size << k) < target; k++) {
44 }
45 return k;
46 }
47
av1_get_tile_limits(AV1_COMMON * const cm)48 void av1_get_tile_limits(AV1_COMMON *const cm) {
49 int mi_cols = ALIGN_POWER_OF_TWO(cm->mi_cols, MAX_MIB_SIZE_LOG2);
50 int mi_rows = ALIGN_POWER_OF_TWO(cm->mi_rows, MAX_MIB_SIZE_LOG2);
51 int sb_cols = mi_cols >> MAX_MIB_SIZE_LOG2;
52 int sb_rows = mi_rows >> MAX_MIB_SIZE_LOG2;
53
54 cm->min_log2_tile_cols = tile_log2(MAX_TILE_WIDTH_SB, sb_cols);
55 cm->max_log2_tile_cols = tile_log2(1, AOMMIN(sb_cols, MAX_TILE_COLS));
56 cm->max_log2_tile_rows = tile_log2(1, AOMMIN(sb_rows, MAX_TILE_ROWS));
57 cm->min_log2_tiles = tile_log2(MAX_TILE_AREA_SB, sb_cols * sb_rows);
58 cm->min_log2_tiles = AOMMAX(cm->min_log2_tiles, cm->min_log2_tile_cols);
59 // TODO(dominic.symes@arm.com):
60 // Add in levelMinLog2Tiles as a lower limit when levels are defined
61 }
62
av1_calculate_tile_cols(AV1_COMMON * const cm)63 void av1_calculate_tile_cols(AV1_COMMON *const cm) {
64 int mi_cols = ALIGN_POWER_OF_TWO(cm->mi_cols, MAX_MIB_SIZE_LOG2);
65 int mi_rows = ALIGN_POWER_OF_TWO(cm->mi_rows, MAX_MIB_SIZE_LOG2);
66 int sb_cols = mi_cols >> MAX_MIB_SIZE_LOG2;
67 int sb_rows = mi_rows >> MAX_MIB_SIZE_LOG2;
68 int i;
69
70 if (cm->uniform_tile_spacing_flag) {
71 int start_sb;
72 int size_sb = ALIGN_POWER_OF_TWO(sb_cols, cm->log2_tile_cols);
73 size_sb >>= cm->log2_tile_cols;
74 assert(size_sb > 0);
75 for (i = 0, start_sb = 0; start_sb < sb_cols; i++) {
76 cm->tile_col_start_sb[i] = start_sb;
77 start_sb += size_sb;
78 }
79 cm->tile_cols = i;
80 cm->tile_col_start_sb[i] = sb_cols;
81 cm->min_log2_tile_rows = AOMMAX(cm->min_log2_tiles - cm->log2_tile_cols, 0);
82 cm->max_tile_height_sb = sb_rows >> cm->min_log2_tile_rows;
83 } else {
84 int max_tile_area_sb = (sb_rows * sb_cols);
85 int max_tile_width_sb = 0;
86 cm->log2_tile_cols = tile_log2(1, cm->tile_cols);
87 for (i = 0; i < cm->tile_cols; i++) {
88 int size_sb = cm->tile_col_start_sb[i + 1] - cm->tile_col_start_sb[i];
89 max_tile_width_sb = AOMMAX(max_tile_width_sb, size_sb);
90 }
91 if (cm->min_log2_tiles) {
92 max_tile_area_sb >>= (cm->min_log2_tiles + 1);
93 }
94 cm->max_tile_height_sb = AOMMAX(max_tile_area_sb / max_tile_width_sb, 1);
95 }
96 }
97
av1_calculate_tile_rows(AV1_COMMON * const cm)98 void av1_calculate_tile_rows(AV1_COMMON *const cm) {
99 int mi_rows = ALIGN_POWER_OF_TWO(cm->mi_rows, MAX_MIB_SIZE_LOG2);
100 int sb_rows = mi_rows >> MAX_MIB_SIZE_LOG2;
101 int start_sb, size_sb, i;
102
103 if (cm->uniform_tile_spacing_flag) {
104 size_sb = ALIGN_POWER_OF_TWO(sb_rows, cm->log2_tile_rows);
105 size_sb >>= cm->log2_tile_rows;
106 assert(size_sb > 0);
107 for (i = 0, start_sb = 0; start_sb < sb_rows; i++) {
108 cm->tile_row_start_sb[i] = start_sb;
109 start_sb += size_sb;
110 }
111 cm->tile_rows = i;
112 cm->tile_row_start_sb[i] = sb_rows;
113 } else {
114 cm->log2_tile_rows = tile_log2(1, cm->tile_rows);
115 }
116
117 #if CONFIG_DEPENDENT_HORZTILES
118 // Record which tile rows must be indpendent for parallelism
119 for (i = 0, start_sb = 0; i < cm->tile_rows; i++) {
120 cm->tile_row_independent[i] = 0;
121 if (cm->tile_row_start_sb[i + 1] - start_sb > cm->max_tile_height_sb) {
122 cm->tile_row_independent[i] = 1;
123 start_sb = cm->tile_row_start_sb[i];
124 }
125 }
126 #endif
127 }
128
av1_tile_set_row(TileInfo * tile,const AV1_COMMON * cm,int row)129 void av1_tile_set_row(TileInfo *tile, const AV1_COMMON *cm, int row) {
130 assert(row < cm->tile_rows);
131 int mi_row_start = cm->tile_row_start_sb[row] << MAX_MIB_SIZE_LOG2;
132 int mi_row_end = cm->tile_row_start_sb[row + 1] << MAX_MIB_SIZE_LOG2;
133 tile->mi_row_start = mi_row_start;
134 tile->mi_row_end = AOMMIN(mi_row_end, cm->mi_rows);
135 }
136
av1_tile_set_col(TileInfo * tile,const AV1_COMMON * cm,int col)137 void av1_tile_set_col(TileInfo *tile, const AV1_COMMON *cm, int col) {
138 assert(col < cm->tile_cols);
139 int mi_col_start = cm->tile_col_start_sb[col] << MAX_MIB_SIZE_LOG2;
140 int mi_col_end = cm->tile_col_start_sb[col + 1] << MAX_MIB_SIZE_LOG2;
141 tile->mi_col_start = mi_col_start;
142 tile->mi_col_end = AOMMIN(mi_col_end, cm->mi_cols);
143 }
144
145 #else
146
av1_tile_set_row(TileInfo * tile,const AV1_COMMON * cm,int row)147 void av1_tile_set_row(TileInfo *tile, const AV1_COMMON *cm, int row) {
148 tile->mi_row_start = row * cm->tile_height;
149 tile->mi_row_end = AOMMIN(tile->mi_row_start + cm->tile_height, cm->mi_rows);
150 }
151
av1_tile_set_col(TileInfo * tile,const AV1_COMMON * cm,int col)152 void av1_tile_set_col(TileInfo *tile, const AV1_COMMON *cm, int col) {
153 tile->mi_col_start = col * cm->tile_width;
154 tile->mi_col_end = AOMMIN(tile->mi_col_start + cm->tile_width, cm->mi_cols);
155 }
156
157 #if CONFIG_EXT_PARTITION
158 #define MIN_TILE_WIDTH_MAX_SB 2
159 #define MAX_TILE_WIDTH_MAX_SB 32
160 #else
161 #define MIN_TILE_WIDTH_MAX_SB 4
162 #define MAX_TILE_WIDTH_MAX_SB 64
163 #endif // CONFIG_EXT_PARTITION
164
get_min_log2_tile_cols(int max_sb_cols)165 static int get_min_log2_tile_cols(int max_sb_cols) {
166 int min_log2 = 0;
167 while ((MAX_TILE_WIDTH_MAX_SB << min_log2) < max_sb_cols) ++min_log2;
168 return min_log2;
169 }
170
get_max_log2_tile_cols(int max_sb_cols)171 static int get_max_log2_tile_cols(int max_sb_cols) {
172 int max_log2 = 1;
173 while ((max_sb_cols >> max_log2) >= MIN_TILE_WIDTH_MAX_SB) ++max_log2;
174 return max_log2 - 1;
175 }
176
av1_get_tile_n_bits(int mi_cols,int * min_log2_tile_cols,int * max_log2_tile_cols)177 void av1_get_tile_n_bits(int mi_cols, int *min_log2_tile_cols,
178 int *max_log2_tile_cols) {
179 const int max_sb_cols =
180 ALIGN_POWER_OF_TWO(mi_cols, MAX_MIB_SIZE_LOG2) >> MAX_MIB_SIZE_LOG2;
181 *min_log2_tile_cols = get_min_log2_tile_cols(max_sb_cols);
182 *max_log2_tile_cols = get_max_log2_tile_cols(max_sb_cols);
183 assert(*min_log2_tile_cols <= *max_log2_tile_cols);
184 }
185 #endif // CONFIG_MAX_TILE
186
av1_setup_frame_boundary_info(const AV1_COMMON * const cm)187 void av1_setup_frame_boundary_info(const AV1_COMMON *const cm) {
188 MODE_INFO *mi = cm->mi;
189 int col;
190 for (col = 0; col < cm->mi_cols; ++col) {
191 mi->mbmi.boundary_info |= FRAME_ABOVE_BOUNDARY | TILE_ABOVE_BOUNDARY;
192 mi += 1;
193 }
194
195 mi = cm->mi;
196 int row;
197 for (row = 0; row < cm->mi_rows; ++row) {
198 mi->mbmi.boundary_info |= FRAME_LEFT_BOUNDARY | TILE_LEFT_BOUNDARY;
199 mi += cm->mi_stride;
200 }
201
202 mi = cm->mi + (cm->mi_rows - 1) * cm->mi_stride;
203 for (col = 0; col < cm->mi_cols; ++col) {
204 mi->mbmi.boundary_info |= FRAME_BOTTOM_BOUNDARY | TILE_BOTTOM_BOUNDARY;
205 mi += 1;
206 }
207
208 mi = cm->mi + cm->mi_cols - 1;
209 for (row = 0; row < cm->mi_rows; ++row) {
210 mi->mbmi.boundary_info |= FRAME_RIGHT_BOUNDARY | TILE_RIGHT_BOUNDARY;
211 mi += cm->mi_stride;
212 }
213 }
214
get_tile_size(int mi_frame_size,int log2_tile_num,int * ntiles)215 int get_tile_size(int mi_frame_size, int log2_tile_num, int *ntiles) {
216 // Round the frame up to a whole number of max superblocks
217 mi_frame_size = ALIGN_POWER_OF_TWO(mi_frame_size, MAX_MIB_SIZE_LOG2);
218
219 // Divide by the signalled number of tiles, rounding up to the multiple of
220 // the max superblock size. To do this, shift right (and round up) to get the
221 // tile size in max super-blocks and then shift left again to convert it to
222 // mi units.
223 const int shift = log2_tile_num + MAX_MIB_SIZE_LOG2;
224 const int max_sb_tile_size =
225 ALIGN_POWER_OF_TWO(mi_frame_size, shift) >> shift;
226 const int mi_tile_size = max_sb_tile_size << MAX_MIB_SIZE_LOG2;
227
228 // The actual number of tiles is the ceiling of the frame size in mi units
229 // divided by mi_size. This is at most 1 << log2_tile_num but might be
230 // strictly less if max_sb_tile_size got rounded up significantly.
231 if (ntiles) {
232 *ntiles = (mi_frame_size + mi_tile_size - 1) / mi_tile_size;
233 assert(*ntiles <= (1 << log2_tile_num));
234 }
235
236 return mi_tile_size;
237 }
238
239 #if CONFIG_LOOPFILTERING_ACROSS_TILES
av1_setup_across_tile_boundary_info(const AV1_COMMON * const cm,const TileInfo * const tile_info)240 void av1_setup_across_tile_boundary_info(const AV1_COMMON *const cm,
241 const TileInfo *const tile_info) {
242 if (cm->tile_cols * cm->tile_rows > 1) {
243 const int mi_row = tile_info->mi_row_start;
244 const int mi_col = tile_info->mi_col_start;
245 MODE_INFO *const mi_start = cm->mi + mi_row * cm->mi_stride + mi_col;
246 assert(mi_start < cm->mip + cm->mi_alloc_size);
247 MODE_INFO *mi = 0;
248 const int row_diff = tile_info->mi_row_end - tile_info->mi_row_start;
249 const int col_diff = tile_info->mi_col_end - tile_info->mi_col_start;
250 int row, col;
251
252 #if CONFIG_DEPENDENT_HORZTILES
253 if (!cm->dependent_horz_tiles || tile_info->tg_horz_boundary)
254 #endif // CONFIG_DEPENDENT_HORZTILES
255 {
256 mi = mi_start;
257 for (col = 0; col < col_diff; ++col) {
258 mi->mbmi.boundary_info |= TILE_ABOVE_BOUNDARY;
259 mi += 1;
260 }
261 }
262
263 mi = mi_start;
264 for (row = 0; row < row_diff; ++row) {
265 mi->mbmi.boundary_info |= TILE_LEFT_BOUNDARY;
266 mi += cm->mi_stride;
267 }
268
269 mi = mi_start + (row_diff - 1) * cm->mi_stride;
270
271 // explicit bounds checking
272 assert(mi + col_diff <= cm->mip + cm->mi_alloc_size);
273
274 for (col = 0; col < col_diff; ++col) {
275 mi->mbmi.boundary_info |= TILE_BOTTOM_BOUNDARY;
276 mi += 1;
277 }
278
279 mi = mi_start + col_diff - 1;
280 for (row = 0; row < row_diff; ++row) {
281 mi->mbmi.boundary_info |= TILE_RIGHT_BOUNDARY;
282 mi += cm->mi_stride;
283 }
284 }
285 }
286
av1_disable_loopfilter_on_tile_boundary(const struct AV1Common * cm)287 int av1_disable_loopfilter_on_tile_boundary(const struct AV1Common *cm) {
288 return (!cm->loop_filter_across_tiles_enabled &&
289 (cm->tile_cols * cm->tile_rows > 1));
290 }
291 #endif // CONFIG_LOOPFILTERING_ACROSS_TILES
292