FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/libavcodec/h264_mvpred.h
Date: 2024-04-25 05:10:44
Exec Total Coverage
Lines: 490 492 99.6%
Functions: 14 14 100.0%
Branches: 363 364 99.7%

Line Branch Exec Source
1 /*
2 * H.26L/H.264/AVC/JVT/14496-10/... motion vector prediction
3 * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * H.264 / AVC / MPEG-4 part10 motion vector prediction.
25 * @author Michael Niedermayer <michaelni@gmx.at>
26 */
27
28 #ifndef AVCODEC_H264_MVPRED_H
29 #define AVCODEC_H264_MVPRED_H
30
31 #include "h264dec.h"
32 #include "mpegutils.h"
33 #include "rectangle.h"
34
35 #include "libavutil/avassert.h"
36 #include "libavutil/mem_internal.h"
37
38
39 /**
40 * Get the predicted intra4x4 prediction mode.
41 */
42 30569280 static av_always_inline int pred_intra_mode(const H264Context *h,
43 H264SliceContext *sl, int n)
44 {
45 30569280 const int index8 = scan8[n];
46 30569280 const int left = sl->intra4x4_pred_mode_cache[index8 - 1];
47 30569280 const int top = sl->intra4x4_pred_mode_cache[index8 - 8];
48 30569280 const int min = FFMIN(left, top);
49
50 ff_tlog(h->avctx, "mode:%d %d min:%d\n", left, top, min);
51
52
2/2
✓ Branch 0 taken 857159 times.
✓ Branch 1 taken 29712121 times.
30569280 if (min < 0)
53 857159 return DC_PRED;
54 else
55 29712121 return min;
56 }
57
58 3063282 static av_always_inline void write_back_intra_pred_mode(const H264Context *h,
59 H264SliceContext *sl)
60 {
61 3063282 int8_t *i4x4 = sl->intra4x4_pred_mode + h->mb2br_xy[sl->mb_xy];
62 3063282 int8_t *i4x4_cache = sl->intra4x4_pred_mode_cache;
63
64 3063282 AV_COPY32(i4x4, i4x4_cache + 4 + 8 * 4);
65 3063282 i4x4[4] = i4x4_cache[7 + 8 * 3];
66 3063282 i4x4[5] = i4x4_cache[7 + 8 * 2];
67 3063282 i4x4[6] = i4x4_cache[7 + 8 * 1];
68 3063282 }
69
70 10867483 static av_always_inline void write_back_non_zero_count(const H264Context *h,
71 H264SliceContext *sl)
72 {
73 10867483 const int mb_xy = sl->mb_xy;
74 10867483 uint8_t *nnz = h->non_zero_count[mb_xy];
75 10867483 uint8_t *nnz_cache = sl->non_zero_count_cache;
76
77 10867483 AV_COPY32(&nnz[ 0], &nnz_cache[4 + 8 * 1]);
78 10867483 AV_COPY32(&nnz[ 4], &nnz_cache[4 + 8 * 2]);
79 10867483 AV_COPY32(&nnz[ 8], &nnz_cache[4 + 8 * 3]);
80 10867483 AV_COPY32(&nnz[12], &nnz_cache[4 + 8 * 4]);
81 10867483 AV_COPY32(&nnz[16], &nnz_cache[4 + 8 * 6]);
82 10867483 AV_COPY32(&nnz[20], &nnz_cache[4 + 8 * 7]);
83 10867483 AV_COPY32(&nnz[32], &nnz_cache[4 + 8 * 11]);
84 10867483 AV_COPY32(&nnz[36], &nnz_cache[4 + 8 * 12]);
85
86
2/2
✓ Branch 0 taken 971539 times.
✓ Branch 1 taken 9895944 times.
10867483 if (!h->chroma_y_shift) {
87 971539 AV_COPY32(&nnz[24], &nnz_cache[4 + 8 * 8]);
88 971539 AV_COPY32(&nnz[28], &nnz_cache[4 + 8 * 9]);
89 971539 AV_COPY32(&nnz[40], &nnz_cache[4 + 8 * 13]);
90 971539 AV_COPY32(&nnz[44], &nnz_cache[4 + 8 * 14]);
91 }
92 10867483 }
93
94 14815949 static av_always_inline void write_back_motion_list(const H264Context *h,
95 H264SliceContext *sl,
96 int b_stride,
97 int b_xy, int b8_xy,
98 int mb_type, int list)
99 {
100 14815949 int16_t(*mv_dst)[2] = &h->cur_pic.motion_val[list][b_xy];
101 14815949 int16_t(*mv_src)[2] = &sl->mv_cache[list][scan8[0]];
102 14815949 AV_COPY128(mv_dst + 0 * b_stride, mv_src + 8 * 0);
103 14815949 AV_COPY128(mv_dst + 1 * b_stride, mv_src + 8 * 1);
104 14815949 AV_COPY128(mv_dst + 2 * b_stride, mv_src + 8 * 2);
105 14815949 AV_COPY128(mv_dst + 3 * b_stride, mv_src + 8 * 3);
106 if (CABAC(h)) {
107 10781536 uint8_t (*mvd_dst)[2] = &sl->mvd_table[list][FMO ? 8 * sl->mb_xy
108 10781536 : h->mb2br_xy[sl->mb_xy]];
109 10781536 uint8_t(*mvd_src)[2] = &sl->mvd_cache[list][scan8[0]];
110
2/2
✓ Branch 0 taken 5002752 times.
✓ Branch 1 taken 5778784 times.
10781536 if (IS_SKIP(mb_type)) {
111 5002752 AV_ZERO128(mvd_dst);
112 } else {
113 5778784 AV_COPY64(mvd_dst, mvd_src + 8 * 3);
114 5778784 AV_COPY16(mvd_dst + 3 + 3, mvd_src + 3 + 8 * 0);
115 5778784 AV_COPY16(mvd_dst + 3 + 2, mvd_src + 3 + 8 * 1);
116 5778784 AV_COPY16(mvd_dst + 3 + 1, mvd_src + 3 + 8 * 2);
117 }
118 }
119
120 {
121 14815949 int8_t *ref_index = &h->cur_pic.ref_index[list][b8_xy];
122 14815949 int8_t *ref_cache = sl->ref_cache[list];
123 14815949 ref_index[0 + 0 * 2] = ref_cache[scan8[0]];
124 14815949 ref_index[1 + 0 * 2] = ref_cache[scan8[4]];
125 14815949 ref_index[0 + 1 * 2] = ref_cache[scan8[8]];
126 14815949 ref_index[1 + 1 * 2] = ref_cache[scan8[12]];
127 }
128 14815949 }
129
130 11038514 static av_always_inline void write_back_motion(const H264Context *h,
131 H264SliceContext *sl,
132 int mb_type)
133 {
134 11038514 const int b_stride = h->b_stride;
135 11038514 const int b_xy = 4 * sl->mb_x + 4 * sl->mb_y * h->b_stride; // try mb2b(8)_xy
136 11038514 const int b8_xy = 4 * sl->mb_xy;
137
138
2/2
✓ Branch 0 taken 10228564 times.
✓ Branch 1 taken 809950 times.
11038514 if (USES_LIST(mb_type, 0)) {
139 10228564 write_back_motion_list(h, sl, b_stride, b_xy, b8_xy, mb_type, 0);
140 } else {
141 809950 fill_rectangle(&h->cur_pic.ref_index[0][b8_xy],
142 2, 2, 2, (uint8_t)LIST_NOT_USED, 1);
143 }
144
2/2
✓ Branch 0 taken 4587385 times.
✓ Branch 1 taken 6451129 times.
11038514 if (USES_LIST(mb_type, 1))
145 4587385 write_back_motion_list(h, sl, b_stride, b_xy, b8_xy, mb_type, 1);
146
147
2/2
✓ Branch 0 taken 4537652 times.
✓ Branch 1 taken 3146737 times.
7684389 if (sl->slice_type_nos == AV_PICTURE_TYPE_B && CABAC(h)) {
148
2/2
✓ Branch 0 taken 423010 times.
✓ Branch 1 taken 4114642 times.
4537652 if (IS_8X8(mb_type)) {
149 423010 uint8_t *direct_table = &h->direct_table[4 * sl->mb_xy];
150 423010 direct_table[1] = sl->sub_mb_type[1] >> 1;
151 423010 direct_table[2] = sl->sub_mb_type[2] >> 1;
152 423010 direct_table[3] = sl->sub_mb_type[3] >> 1;
153 }
154 }
155 11038514 }
156
157 295476 static av_always_inline int get_dct8x8_allowed(const H264Context *h, H264SliceContext *sl)
158 {
159
2/2
✓ Branch 0 taken 290599 times.
✓ Branch 1 taken 4877 times.
295476 if (h->ps.sps->direct_8x8_inference_flag)
160 290599 return !(AV_RN64A(sl->sub_mb_type) &
161 ((MB_TYPE_16x8 | MB_TYPE_8x16 | MB_TYPE_8x8) *
162 0x0001000100010001ULL));
163 else
164 4877 return !(AV_RN64A(sl->sub_mb_type) &
165 ((MB_TYPE_16x8 | MB_TYPE_8x16 | MB_TYPE_8x8 | MB_TYPE_DIRECT2) *
166 0x0001000100010001ULL));
167 }
168
169 18371322 static av_always_inline int fetch_diagonal_mv(const H264Context *h, H264SliceContext *sl,
170 const int16_t **C,
171 int i, int list, int part_width)
172 {
173 18371322 const int topright_ref = sl->ref_cache[list][i - 8 + part_width];
174
175 /* there is no consistent mapping of mvs to neighboring locations that will
176 * make mbaff happy, so we can't move all this logic to fill_caches */
177
2/2
✓ Branch 0 taken 2970413 times.
✓ Branch 1 taken 15400909 times.
18371322 if (FRAME_MBAFF(h)) {
178 #define SET_DIAG_MV(MV_OP, REF_OP, XY, Y4) \
179 const int xy = XY, y4 = Y4; \
180 const int mb_type = mb_types[xy + (y4 >> 2) * h->mb_stride]; \
181 if (!USES_LIST(mb_type, list)) \
182 return LIST_NOT_USED; \
183 mv = h->cur_pic_ptr->motion_val[list][h->mb2b_xy[xy] + 3 + y4 * h->b_stride]; \
184 sl->mv_cache[list][scan8[0] - 2][0] = mv[0]; \
185 sl->mv_cache[list][scan8[0] - 2][1] = mv[1] MV_OP; \
186 return h->cur_pic_ptr->ref_index[list][4 * xy + 1 + (y4 & ~1)] REF_OP;
187
188
2/2
✓ Branch 0 taken 1301972 times.
✓ Branch 1 taken 1668441 times.
2970413 if (topright_ref == PART_NOT_AVAILABLE
189
4/4
✓ Branch 0 taken 806932 times.
✓ Branch 1 taken 495040 times.
✓ Branch 2 taken 198920 times.
✓ Branch 3 taken 608012 times.
1301972 && i >= scan8[0] + 8 && (i & 7) == 4
190
2/2
✓ Branch 0 taken 190752 times.
✓ Branch 1 taken 8168 times.
198920 && sl->ref_cache[list][scan8[0] - 1] != PART_NOT_AVAILABLE) {
191 190752 const uint32_t *mb_types = h->cur_pic_ptr->mb_type;
192 const int16_t *mv;
193 190752 AV_ZERO32(sl->mv_cache[list][scan8[0] - 2]);
194 190752 *C = sl->mv_cache[list][scan8[0] - 2];
195
196
4/4
✓ Branch 0 taken 94008 times.
✓ Branch 1 taken 96744 times.
✓ Branch 2 taken 26720 times.
✓ Branch 3 taken 67288 times.
190752 if (!MB_FIELD(sl) && IS_INTERLACED(sl->left_type[0])) {
197
2/2
✓ Branch 0 taken 2841 times.
✓ Branch 1 taken 23879 times.
26720 SET_DIAG_MV(* 2, >> 1, sl->left_mb_xy[0] + h->mb_stride,
198 (sl->mb_y & 1) * 2 + (i >> 5));
199 }
200
4/4
✓ Branch 0 taken 96744 times.
✓ Branch 1 taken 67288 times.
✓ Branch 2 taken 36099 times.
✓ Branch 3 taken 60645 times.
164032 if (MB_FIELD(sl) && !IS_INTERLACED(sl->left_type[0])) {
201 // left shift will turn LIST_NOT_USED into PART_NOT_AVAILABLE, but that's OK.
202
2/2
✓ Branch 0 taken 5735 times.
✓ Branch 1 taken 30364 times.
36099 SET_DIAG_MV(/ 2, *2, sl->left_mb_xy[i >= 36], ((i >> 2)) & 3);
203 }
204 }
205 #undef SET_DIAG_MV
206 }
207
208
2/2
✓ Branch 0 taken 11657870 times.
✓ Branch 1 taken 6650633 times.
18308503 if (topright_ref != PART_NOT_AVAILABLE) {
209 11657870 *C = sl->mv_cache[list][i - 8 + part_width];
210 11657870 return topright_ref;
211 } else {
212 ff_tlog(h->avctx, "topright MV not available\n");
213
214 6650633 *C = sl->mv_cache[list][i - 8 - 1];
215 6650633 return sl->ref_cache[list][i - 8 - 1];
216 }
217 }
218
219 /**
220 * Get the predicted MV.
221 * @param n the block index
222 * @param part_width the width of the partition (4, 8,16) -> (1, 2, 4)
223 * @param mx the x component of the predicted motion vector
224 * @param my the y component of the predicted motion vector
225 */
226 17730406 static av_always_inline void pred_motion(const H264Context *const h,
227 H264SliceContext *sl,
228 int n,
229 int part_width, int list, int ref,
230 int *const mx, int *const my)
231 {
232 17730406 const int index8 = scan8[n];
233 17730406 const int top_ref = sl->ref_cache[list][index8 - 8];
234 17730406 const int left_ref = sl->ref_cache[list][index8 - 1];
235 17730406 const int16_t *const A = sl->mv_cache[list][index8 - 1];
236 17730406 const int16_t *const B = sl->mv_cache[list][index8 - 8];
237 const int16_t *C;
238 int diagonal_ref, match_count;
239
240 av_assert2(part_width == 1 || part_width == 2 || part_width == 4);
241
242 /* mv_cache
243 * B . . A T T T T
244 * U . . L . . , .
245 * U . . L . . . .
246 * U . . L . . , .
247 * . . . L . . . .
248 */
249
250 17730406 diagonal_ref = fetch_diagonal_mv(h, sl, &C, index8, list, part_width);
251 17730406 match_count = (diagonal_ref == ref) + (top_ref == ref) + (left_ref == ref);
252 ff_tlog(h->avctx, "pred_motion match_count=%d\n", match_count);
253
2/2
✓ Branch 0 taken 13138266 times.
✓ Branch 1 taken 4592140 times.
17730406 if (match_count > 1) { //most common
254 13138266 *mx = mid_pred(A[0], B[0], C[0]);
255 13138266 *my = mid_pred(A[1], B[1], C[1]);
256
2/2
✓ Branch 0 taken 3115502 times.
✓ Branch 1 taken 1476638 times.
4592140 } else if (match_count == 1) {
257
2/2
✓ Branch 0 taken 1967323 times.
✓ Branch 1 taken 1148179 times.
3115502 if (left_ref == ref) {
258 1967323 *mx = A[0];
259 1967323 *my = A[1];
260
2/2
✓ Branch 0 taken 822727 times.
✓ Branch 1 taken 325452 times.
1148179 } else if (top_ref == ref) {
261 822727 *mx = B[0];
262 822727 *my = B[1];
263 } else {
264 325452 *mx = C[0];
265 325452 *my = C[1];
266 }
267 } else {
268
4/4
✓ Branch 0 taken 243876 times.
✓ Branch 1 taken 1232762 times.
✓ Branch 2 taken 243463 times.
✓ Branch 3 taken 413 times.
1476638 if (top_ref == PART_NOT_AVAILABLE &&
269
2/2
✓ Branch 0 taken 217997 times.
✓ Branch 1 taken 25466 times.
243463 diagonal_ref == PART_NOT_AVAILABLE &&
270 left_ref != PART_NOT_AVAILABLE) {
271 217997 *mx = A[0];
272 217997 *my = A[1];
273 } else {
274 1258641 *mx = mid_pred(A[0], B[0], C[0]);
275 1258641 *my = mid_pred(A[1], B[1], C[1]);
276 }
277 }
278
279 ff_tlog(h->avctx,
280 "pred_motion (%2d %2d %2d) (%2d %2d %2d) (%2d %2d %2d) -> (%2d %2d %2d) at %2d %2d %d list %d\n",
281 top_ref, B[0], B[1], diagonal_ref, C[0], C[1], left_ref,
282 A[0], A[1], ref, *mx, *my, sl->mb_x, sl->mb_y, n, list);
283 17730406 }
284
285 /**
286 * Get the directionally predicted 16x8 MV.
287 * @param n the block index
288 * @param mx the x component of the predicted motion vector
289 * @param my the y component of the predicted motion vector
290 */
291 1438606 static av_always_inline void pred_16x8_motion(const H264Context *const h,
292 H264SliceContext *sl,
293 int n, int list, int ref,
294 int *const mx, int *const my)
295 {
296
2/2
✓ Branch 0 taken 718398 times.
✓ Branch 1 taken 720208 times.
1438606 if (n == 0) {
297 718398 const int top_ref = sl->ref_cache[list][scan8[0] - 8];
298 718398 const int16_t *const B = sl->mv_cache[list][scan8[0] - 8];
299
300 ff_tlog(h->avctx, "pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n",
301 top_ref, B[0], B[1], sl->mb_x, sl->mb_y, n, list);
302
303
2/2
✓ Branch 0 taken 416062 times.
✓ Branch 1 taken 302336 times.
718398 if (top_ref == ref) {
304 416062 *mx = B[0];
305 416062 *my = B[1];
306 416062 return;
307 }
308 } else {
309 720208 const int left_ref = sl->ref_cache[list][scan8[8] - 1];
310 720208 const int16_t *const A = sl->mv_cache[list][scan8[8] - 1];
311
312 ff_tlog(h->avctx, "pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n",
313 left_ref, A[0], A[1], sl->mb_x, sl->mb_y, n, list);
314
315
2/2
✓ Branch 0 taken 488999 times.
✓ Branch 1 taken 231209 times.
720208 if (left_ref == ref) {
316 488999 *mx = A[0];
317 488999 *my = A[1];
318 488999 return;
319 }
320 }
321
322 //RARE
323 533545 pred_motion(h, sl, n, 4, list, ref, mx, my);
324 }
325
326 /**
327 * Get the directionally predicted 8x16 MV.
328 * @param n the block index
329 * @param mx the x component of the predicted motion vector
330 * @param my the y component of the predicted motion vector
331 */
332 1283120 static av_always_inline void pred_8x16_motion(const H264Context *const h,
333 H264SliceContext *sl,
334 int n, int list, int ref,
335 int *const mx, int *const my)
336 {
337
2/2
✓ Branch 0 taken 642204 times.
✓ Branch 1 taken 640916 times.
1283120 if (n == 0) {
338 642204 const int left_ref = sl->ref_cache[list][scan8[0] - 1];
339 642204 const int16_t *const A = sl->mv_cache[list][scan8[0] - 1];
340
341 ff_tlog(h->avctx, "pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n",
342 left_ref, A[0], A[1], sl->mb_x, sl->mb_y, n, list);
343
344
2/2
✓ Branch 0 taken 411055 times.
✓ Branch 1 taken 231149 times.
642204 if (left_ref == ref) {
345 411055 *mx = A[0];
346 411055 *my = A[1];
347 411055 return;
348 }
349 } else {
350 const int16_t *C;
351 int diagonal_ref;
352
353 640916 diagonal_ref = fetch_diagonal_mv(h, sl, &C, scan8[4], list, 2);
354
355 ff_tlog(h->avctx, "pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n",
356 diagonal_ref, C[0], C[1], sl->mb_x, sl->mb_y, n, list);
357
358
2/2
✓ Branch 0 taken 377838 times.
✓ Branch 1 taken 263078 times.
640916 if (diagonal_ref == ref) {
359 377838 *mx = C[0];
360 377838 *my = C[1];
361 377838 return;
362 }
363 }
364
365 //RARE
366 494227 pred_motion(h, sl, n, 2, list, ref, mx, my);
367 }
368
369 #define FIX_MV_MBAFF(type, refn, mvn, idx) \
370 if (FRAME_MBAFF(h)) { \
371 if (MB_FIELD(sl)) { \
372 if (!IS_INTERLACED(type)) { \
373 refn <<= 1; \
374 AV_COPY32(mvbuf[idx], mvn); \
375 mvbuf[idx][1] /= 2; \
376 mvn = mvbuf[idx]; \
377 } \
378 } else { \
379 if (IS_INTERLACED(type)) { \
380 refn >>= 1; \
381 AV_COPY32(mvbuf[idx], mvn); \
382 mvbuf[idx][1] *= 2; \
383 mvn = mvbuf[idx]; \
384 } \
385 } \
386 }
387
388 1790601 static av_always_inline void pred_pskip_motion(const H264Context *const h,
389 H264SliceContext *sl)
390 {
391 DECLARE_ALIGNED(4, static const int16_t, zeromv)[2] = { 0 };
392 DECLARE_ALIGNED(4, int16_t, mvbuf)[3][2];
393 1790601 int8_t *ref = h->cur_pic.ref_index[0];
394 1790601 int16_t(*mv)[2] = h->cur_pic.motion_val[0];
395 int top_ref, left_ref, diagonal_ref, match_count, mx, my;
396 const int16_t *A, *B, *C;
397 1790601 int b_stride = h->b_stride;
398
399 1790601 fill_rectangle(&sl->ref_cache[0][scan8[0]], 4, 4, 8, 0, 1);
400
401 /* To avoid doing an entire fill_decode_caches, we inline the relevant
402 * parts here.
403 * FIXME: this is a partial duplicate of the logic in fill_decode_caches,
404 * but it's faster this way. Is there a way to avoid this duplication?
405 */
406
2/2
✓ Branch 0 taken 1695726 times.
✓ Branch 1 taken 94875 times.
1790601 if (USES_LIST(sl->left_type[LTOP], 0)) {
407 1695726 left_ref = ref[4 * sl->left_mb_xy[LTOP] + 1 + (sl->left_block[0] & ~1)];
408 1695726 A = mv[h->mb2b_xy[sl->left_mb_xy[LTOP]] + 3 + b_stride * sl->left_block[0]];
409
8/8
✓ Branch 0 taken 45498 times.
✓ Branch 1 taken 1650228 times.
✓ Branch 2 taken 7113 times.
✓ Branch 3 taken 38385 times.
✓ Branch 4 taken 1136 times.
✓ Branch 5 taken 5977 times.
✓ Branch 6 taken 1812 times.
✓ Branch 7 taken 36573 times.
1695726 FIX_MV_MBAFF(sl->left_type[LTOP], left_ref, A, 0);
410
2/2
✓ Branch 0 taken 1360901 times.
✓ Branch 1 taken 334825 times.
1695726 if (!(left_ref | AV_RN32A(A)))
411 1360901 goto zeromv;
412
2/2
✓ Branch 0 taken 37016 times.
✓ Branch 1 taken 57859 times.
94875 } else if (sl->left_type[LTOP]) {
413 37016 left_ref = LIST_NOT_USED;
414 37016 A = zeromv;
415 } else {
416 57859 goto zeromv;
417 }
418
419
2/2
✓ Branch 0 taken 340409 times.
✓ Branch 1 taken 31432 times.
371841 if (USES_LIST(sl->top_type, 0)) {
420 340409 top_ref = ref[4 * sl->top_mb_xy + 2];
421 340409 B = mv[h->mb2b_xy[sl->top_mb_xy] + 3 * b_stride];
422
8/8
✓ Branch 0 taken 19990 times.
✓ Branch 1 taken 320419 times.
✓ Branch 2 taken 2277 times.
✓ Branch 3 taken 17713 times.
✓ Branch 4 taken 1243 times.
✓ Branch 5 taken 1034 times.
✓ Branch 6 taken 1009 times.
✓ Branch 7 taken 16704 times.
340409 FIX_MV_MBAFF(sl->top_type, top_ref, B, 1);
423
2/2
✓ Branch 0 taken 60911 times.
✓ Branch 1 taken 279498 times.
340409 if (!(top_ref | AV_RN32A(B)))
424 60911 goto zeromv;
425
2/2
✓ Branch 0 taken 20503 times.
✓ Branch 1 taken 10929 times.
31432 } else if (sl->top_type) {
426 20503 top_ref = LIST_NOT_USED;
427 20503 B = zeromv;
428 } else {
429 10929 goto zeromv;
430 }
431
432 ff_tlog(h->avctx, "pred_pskip: (%d) (%d) at %2d %2d\n",
433 top_ref, left_ref, sl->mb_x, sl->mb_y);
434
435
2/2
✓ Branch 0 taken 257467 times.
✓ Branch 1 taken 42534 times.
300001 if (USES_LIST(sl->topright_type, 0)) {
436 257467 diagonal_ref = ref[4 * sl->topright_mb_xy + 2];
437 257467 C = mv[h->mb2b_xy[sl->topright_mb_xy] + 3 * b_stride];
438
8/8
✓ Branch 0 taken 8074 times.
✓ Branch 1 taken 249393 times.
✓ Branch 2 taken 1882 times.
✓ Branch 3 taken 6192 times.
✓ Branch 4 taken 908 times.
✓ Branch 5 taken 974 times.
✓ Branch 6 taken 835 times.
✓ Branch 7 taken 5357 times.
257467 FIX_MV_MBAFF(sl->topright_type, diagonal_ref, C, 2);
439
2/2
✓ Branch 0 taken 20195 times.
✓ Branch 1 taken 22339 times.
42534 } else if (sl->topright_type) {
440 20195 diagonal_ref = LIST_NOT_USED;
441 20195 C = zeromv;
442 } else {
443
2/2
✓ Branch 0 taken 21263 times.
✓ Branch 1 taken 1076 times.
22339 if (USES_LIST(sl->topleft_type, 0)) {
444 21263 diagonal_ref = ref[4 * sl->topleft_mb_xy + 1 +
445 21263 (sl->topleft_partition & 2)];
446 21263 C = mv[h->mb2b_xy[sl->topleft_mb_xy] + 3 + b_stride +
447 21263 (sl->topleft_partition & 2 * b_stride)];
448
8/8
✓ Branch 0 taken 9013 times.
✓ Branch 1 taken 12250 times.
✓ Branch 2 taken 53 times.
✓ Branch 3 taken 8960 times.
✓ Branch 4 taken 9 times.
✓ Branch 5 taken 44 times.
✓ Branch 6 taken 478 times.
✓ Branch 7 taken 8482 times.
21263 FIX_MV_MBAFF(sl->topleft_type, diagonal_ref, C, 2);
449
1/2
✓ Branch 0 taken 1076 times.
✗ Branch 1 not taken.
1076 } else if (sl->topleft_type) {
450 1076 diagonal_ref = LIST_NOT_USED;
451 1076 C = zeromv;
452 } else {
453 diagonal_ref = PART_NOT_AVAILABLE;
454 C = zeromv;
455 }
456 }
457
458 300001 match_count = !diagonal_ref + !top_ref + !left_ref;
459 ff_tlog(h->avctx, "pred_pskip_motion match_count=%d\n", match_count);
460
2/2
✓ Branch 0 taken 256085 times.
✓ Branch 1 taken 43916 times.
300001 if (match_count > 1) {
461 256085 mx = mid_pred(A[0], B[0], C[0]);
462 256085 my = mid_pred(A[1], B[1], C[1]);
463
2/2
✓ Branch 0 taken 37463 times.
✓ Branch 1 taken 6453 times.
43916 } else if (match_count == 1) {
464
2/2
✓ Branch 0 taken 18167 times.
✓ Branch 1 taken 19296 times.
37463 if (!left_ref) {
465 18167 mx = A[0];
466 18167 my = A[1];
467
2/2
✓ Branch 0 taken 8319 times.
✓ Branch 1 taken 10977 times.
19296 } else if (!top_ref) {
468 8319 mx = B[0];
469 8319 my = B[1];
470 } else {
471 10977 mx = C[0];
472 10977 my = C[1];
473 }
474 } else {
475 6453 mx = mid_pred(A[0], B[0], C[0]);
476 6453 my = mid_pred(A[1], B[1], C[1]);
477 }
478
479 300001 fill_rectangle(sl->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mx, my), 4);
480 300001 return;
481
482 1490600 zeromv:
483 1490600 fill_rectangle(sl->mv_cache[0][scan8[0]], 4, 4, 8, 0, 4);
484 1490600 return;
485 }
486
487 14972963 static void fill_decode_neighbors(const H264Context *h, H264SliceContext *sl, int mb_type)
488 {
489 14972963 const int mb_xy = sl->mb_xy;
490 int topleft_xy, top_xy, topright_xy, left_xy[LEFT_MBS];
491 static const uint8_t left_block_options[4][32] = {
492 { 0, 1, 2, 3, 7, 10, 8, 11, 3 + 0 * 4, 3 + 1 * 4, 3 + 2 * 4, 3 + 3 * 4, 1 + 4 * 4, 1 + 8 * 4, 1 + 5 * 4, 1 + 9 * 4 },
493 { 2, 2, 3, 3, 8, 11, 8, 11, 3 + 2 * 4, 3 + 2 * 4, 3 + 3 * 4, 3 + 3 * 4, 1 + 5 * 4, 1 + 9 * 4, 1 + 5 * 4, 1 + 9 * 4 },
494 { 0, 0, 1, 1, 7, 10, 7, 10, 3 + 0 * 4, 3 + 0 * 4, 3 + 1 * 4, 3 + 1 * 4, 1 + 4 * 4, 1 + 8 * 4, 1 + 4 * 4, 1 + 8 * 4 },
495 { 0, 2, 0, 2, 7, 10, 7, 10, 3 + 0 * 4, 3 + 2 * 4, 3 + 0 * 4, 3 + 2 * 4, 1 + 4 * 4, 1 + 8 * 4, 1 + 4 * 4, 1 + 8 * 4 }
496 };
497
498 14972963 sl->topleft_partition = -1;
499
500 14972963 top_xy = mb_xy - (h->mb_stride << MB_FIELD(sl));
501
502 /* Wow, what a mess, why didn't they simplify the interlacing & intra
503 * stuff, I can't imagine that these complex rules are worth it. */
504
505 14972963 topleft_xy = top_xy - 1;
506 14972963 topright_xy = top_xy + 1;
507 14972963 left_xy[LBOT] = left_xy[LTOP] = mb_xy - 1;
508 14972963 sl->left_block = left_block_options[0];
509
2/2
✓ Branch 0 taken 2302168 times.
✓ Branch 1 taken 12670795 times.
14972963 if (FRAME_MBAFF(h)) {
510 2302168 const int left_mb_field_flag = IS_INTERLACED(h->cur_pic.mb_type[mb_xy - 1]);
511 2302168 const int curr_mb_field_flag = IS_INTERLACED(mb_type);
512
2/2
✓ Branch 0 taken 1150972 times.
✓ Branch 1 taken 1151196 times.
2302168 if (sl->mb_y & 1) {
513
2/2
✓ Branch 0 taken 263274 times.
✓ Branch 1 taken 887698 times.
1150972 if (left_mb_field_flag != curr_mb_field_flag) {
514 263274 left_xy[LBOT] = left_xy[LTOP] = mb_xy - h->mb_stride - 1;
515
2/2
✓ Branch 0 taken 135744 times.
✓ Branch 1 taken 127530 times.
263274 if (curr_mb_field_flag) {
516 135744 left_xy[LBOT] += h->mb_stride;
517 135744 sl->left_block = left_block_options[3];
518 } else {
519 127530 topleft_xy += h->mb_stride;
520 /* take top left mv from the middle of the mb, as opposed
521 * to all other modes which use the bottom right partition */
522 127530 sl->topleft_partition = 0;
523 127530 sl->left_block = left_block_options[1];
524 }
525 }
526 } else {
527
2/2
✓ Branch 0 taken 326650 times.
✓ Branch 1 taken 824546 times.
1151196 if (curr_mb_field_flag) {
528 326650 topleft_xy += h->mb_stride & (((h->cur_pic.mb_type[top_xy - 1] >> 7) & 1) - 1);
529 326650 topright_xy += h->mb_stride & (((h->cur_pic.mb_type[top_xy + 1] >> 7) & 1) - 1);
530 326650 top_xy += h->mb_stride & (((h->cur_pic.mb_type[top_xy] >> 7) & 1) - 1);
531 }
532
2/2
✓ Branch 0 taken 263448 times.
✓ Branch 1 taken 887748 times.
1151196 if (left_mb_field_flag != curr_mb_field_flag) {
533
2/2
✓ Branch 0 taken 135717 times.
✓ Branch 1 taken 127731 times.
263448 if (curr_mb_field_flag) {
534 135717 left_xy[LBOT] += h->mb_stride;
535 135717 sl->left_block = left_block_options[3];
536 } else {
537 127731 sl->left_block = left_block_options[2];
538 }
539 }
540 }
541 }
542
543 14972963 sl->topleft_mb_xy = topleft_xy;
544 14972963 sl->top_mb_xy = top_xy;
545 14972963 sl->topright_mb_xy = topright_xy;
546 14972963 sl->left_mb_xy[LTOP] = left_xy[LTOP];
547 14972963 sl->left_mb_xy[LBOT] = left_xy[LBOT];
548 //FIXME do we need all in the context?
549
550 14972963 sl->topleft_type = h->cur_pic.mb_type[topleft_xy];
551 14972963 sl->top_type = h->cur_pic.mb_type[top_xy];
552 14972963 sl->topright_type = h->cur_pic.mb_type[topright_xy];
553 14972963 sl->left_type[LTOP] = h->cur_pic.mb_type[left_xy[LTOP]];
554 14972963 sl->left_type[LBOT] = h->cur_pic.mb_type[left_xy[LBOT]];
555
556 if (FMO) {
557 if (h->slice_table[topleft_xy] != sl->slice_num)
558 sl->topleft_type = 0;
559 if (h->slice_table[top_xy] != sl->slice_num)
560 sl->top_type = 0;
561 if (h->slice_table[left_xy[LTOP]] != sl->slice_num)
562 sl->left_type[LTOP] = sl->left_type[LBOT] = 0;
563 } else {
564
2/2
✓ Branch 0 taken 1531747 times.
✓ Branch 1 taken 13441216 times.
14972963 if (h->slice_table[topleft_xy] != sl->slice_num) {
565 1531747 sl->topleft_type = 0;
566
2/2
✓ Branch 0 taken 1150291 times.
✓ Branch 1 taken 381456 times.
1531747 if (h->slice_table[top_xy] != sl->slice_num)
567 1150291 sl->top_type = 0;
568
2/2
✓ Branch 0 taken 418570 times.
✓ Branch 1 taken 1113177 times.
1531747 if (h->slice_table[left_xy[LTOP]] != sl->slice_num)
569 418570 sl->left_type[LTOP] = sl->left_type[LBOT] = 0;
570 }
571 }
572
2/2
✓ Branch 0 taken 2333337 times.
✓ Branch 1 taken 12639626 times.
14972963 if (h->slice_table[topright_xy] != sl->slice_num)
573 2333337 sl->topright_type = 0;
574 14972963 }
575
576 13176703 static void fill_decode_caches(const H264Context *h, H264SliceContext *sl, int mb_type)
577 {
578 int topleft_xy, top_xy, topright_xy, left_xy[LEFT_MBS];
579 int topleft_type, top_type, topright_type, left_type[LEFT_MBS];
580 13176703 const uint8_t *left_block = sl->left_block;
581 int i;
582 uint8_t *nnz;
583 uint8_t *nnz_cache;
584
585 13176703 topleft_xy = sl->topleft_mb_xy;
586 13176703 top_xy = sl->top_mb_xy;
587 13176703 topright_xy = sl->topright_mb_xy;
588 13176703 left_xy[LTOP] = sl->left_mb_xy[LTOP];
589 13176703 left_xy[LBOT] = sl->left_mb_xy[LBOT];
590 13176703 topleft_type = sl->topleft_type;
591 13176703 top_type = sl->top_type;
592 13176703 topright_type = sl->topright_type;
593 13176703 left_type[LTOP] = sl->left_type[LTOP];
594 13176703 left_type[LBOT] = sl->left_type[LBOT];
595
596
2/2
✓ Branch 0 taken 10867484 times.
✓ Branch 1 taken 2309219 times.
13176703 if (!IS_SKIP(mb_type)) {
597
2/2
✓ Branch 0 taken 4064856 times.
✓ Branch 1 taken 6802628 times.
10867484 if (IS_INTRA(mb_type)) {
598
2/2
✓ Branch 0 taken 9021 times.
✓ Branch 1 taken 4055835 times.
4064856 int type_mask = h->ps.pps->constrained_intra_pred ? IS_INTRA(-1) : -1;
599 4064856 sl->topleft_samples_available =
600 4064856 sl->top_samples_available =
601 4064856 sl->left_samples_available = 0xFFFF;
602 4064856 sl->topright_samples_available = 0xEEEA;
603
604
2/2
✓ Branch 0 taken 299665 times.
✓ Branch 1 taken 3765191 times.
4064856 if (!(top_type & type_mask)) {
605 299665 sl->topleft_samples_available = 0xB3FF;
606 299665 sl->top_samples_available = 0x33FF;
607 299665 sl->topright_samples_available = 0x26EA;
608 }
609
2/2
✓ Branch 0 taken 219050 times.
✓ Branch 1 taken 3845806 times.
4064856 if (IS_INTERLACED(mb_type) != IS_INTERLACED(left_type[LTOP])) {
610
2/2
✓ Branch 0 taken 113906 times.
✓ Branch 1 taken 105144 times.
219050 if (IS_INTERLACED(mb_type)) {
611
2/2
✓ Branch 0 taken 16636 times.
✓ Branch 1 taken 97270 times.
113906 if (!(left_type[LTOP] & type_mask)) {
612 16636 sl->topleft_samples_available &= 0xDFFF;
613 16636 sl->left_samples_available &= 0x5FFF;
614 }
615
2/2
✓ Branch 0 taken 16641 times.
✓ Branch 1 taken 97265 times.
113906 if (!(left_type[LBOT] & type_mask)) {
616 16641 sl->topleft_samples_available &= 0xFF5F;
617 16641 sl->left_samples_available &= 0xFF5F;
618 }
619 } else {
620 105144 int left_typei = h->cur_pic.mb_type[left_xy[LTOP] + h->mb_stride];
621
622 av_assert2(left_xy[LTOP] == left_xy[LBOT]);
623
4/4
✓ Branch 0 taken 105099 times.
✓ Branch 1 taken 45 times.
✓ Branch 2 taken 8 times.
✓ Branch 3 taken 105091 times.
105144 if (!((left_typei & type_mask) && (left_type[LTOP] & type_mask))) {
624 53 sl->topleft_samples_available &= 0xDF5F;
625 53 sl->left_samples_available &= 0x5F5F;
626 }
627 }
628 } else {
629
2/2
✓ Branch 0 taken 67796 times.
✓ Branch 1 taken 3778010 times.
3845806 if (!(left_type[LTOP] & type_mask)) {
630 67796 sl->topleft_samples_available &= 0xDF5F;
631 67796 sl->left_samples_available &= 0x5F5F;
632 }
633 }
634
635
2/2
✓ Branch 0 taken 374646 times.
✓ Branch 1 taken 3690210 times.
4064856 if (!(topleft_type & type_mask))
636 374646 sl->topleft_samples_available &= 0x7FFF;
637
638
2/2
✓ Branch 0 taken 770782 times.
✓ Branch 1 taken 3294074 times.
4064856 if (!(topright_type & type_mask))
639 770782 sl->topright_samples_available &= 0xFBFF;
640
641
2/2
✓ Branch 0 taken 3063282 times.
✓ Branch 1 taken 1001574 times.
4064856 if (IS_INTRA4x4(mb_type)) {
642
2/2
✓ Branch 0 taken 2294950 times.
✓ Branch 1 taken 768332 times.
3063282 if (IS_INTRA4x4(top_type)) {
643 2294950 AV_COPY32(sl->intra4x4_pred_mode_cache + 4 + 8 * 0, sl->intra4x4_pred_mode + h->mb2br_xy[top_xy]);
644 } else {
645 768332 sl->intra4x4_pred_mode_cache[4 + 8 * 0] =
646 768332 sl->intra4x4_pred_mode_cache[5 + 8 * 0] =
647 768332 sl->intra4x4_pred_mode_cache[6 + 8 * 0] =
648
2/2
✓ Branch 0 taken 211648 times.
✓ Branch 1 taken 556684 times.
768332 sl->intra4x4_pred_mode_cache[7 + 8 * 0] = 2 - 3 * !(top_type & type_mask);
649 }
650
2/2
✓ Branch 0 taken 6126564 times.
✓ Branch 1 taken 3063282 times.
9189846 for (i = 0; i < 2; i++) {
651
2/2
✓ Branch 0 taken 4919045 times.
✓ Branch 1 taken 1207519 times.
6126564 if (IS_INTRA4x4(left_type[LEFT(i)])) {
652 4919045 int8_t *mode = sl->intra4x4_pred_mode + h->mb2br_xy[left_xy[LEFT(i)]];
653 4919045 sl->intra4x4_pred_mode_cache[3 + 8 * 1 + 2 * 8 * i] = mode[6 - left_block[0 + 2 * i]];
654 4919045 sl->intra4x4_pred_mode_cache[3 + 8 * 2 + 2 * 8 * i] = mode[6 - left_block[1 + 2 * i]];
655 } else {
656 1207519 sl->intra4x4_pred_mode_cache[3 + 8 * 1 + 2 * 8 * i] =
657
2/2
✓ Branch 0 taken 128521 times.
✓ Branch 1 taken 1078998 times.
1207519 sl->intra4x4_pred_mode_cache[3 + 8 * 2 + 2 * 8 * i] = 2 - 3 * !(left_type[LEFT(i)] & type_mask);
658 }
659 }
660 }
661 }
662
663 /*
664 * 0 . T T. T T T T
665 * 1 L . .L . . . .
666 * 2 L . .L . . . .
667 * 3 . T TL . . . .
668 * 4 L . .L . . . .
669 * 5 L . .. . . . .
670 */
671 /* FIXME: constraint_intra_pred & partitioning & nnz
672 * (let us hope this is just a typo in the spec) */
673 10867484 nnz_cache = sl->non_zero_count_cache;
674
2/2
✓ Branch 0 taken 9989358 times.
✓ Branch 1 taken 878126 times.
10867484 if (top_type) {
675 9989358 nnz = h->non_zero_count[top_xy];
676 9989358 AV_COPY32(&nnz_cache[4 + 8 * 0], &nnz[4 * 3]);
677
2/2
✓ Branch 0 taken 907099 times.
✓ Branch 1 taken 9082259 times.
9989358 if (!h->chroma_y_shift) {
678 907099 AV_COPY32(&nnz_cache[4 + 8 * 5], &nnz[4 * 7]);
679 907099 AV_COPY32(&nnz_cache[4 + 8 * 10], &nnz[4 * 11]);
680 } else {
681 9082259 AV_COPY32(&nnz_cache[4 + 8 * 5], &nnz[4 * 5]);
682 9082259 AV_COPY32(&nnz_cache[4 + 8 * 10], &nnz[4 * 9]);
683 }
684 } else {
685
2/2
✓ Branch 0 taken 333631 times.
✓ Branch 1 taken 174380 times.
878126 uint32_t top_empty = CABAC(h) && !IS_INTRA(mb_type) ? 0 : 0x40404040;
686 878126 AV_WN32A(&nnz_cache[4 + 8 * 0], top_empty);
687 878126 AV_WN32A(&nnz_cache[4 + 8 * 5], top_empty);
688 878126 AV_WN32A(&nnz_cache[4 + 8 * 10], top_empty);
689 }
690
691
2/2
✓ Branch 0 taken 21734968 times.
✓ Branch 1 taken 10867484 times.
32602452 for (i = 0; i < 2; i++) {
692
2/2
✓ Branch 0 taken 21108338 times.
✓ Branch 1 taken 626630 times.
21734968 if (left_type[LEFT(i)]) {
693 21108338 nnz = h->non_zero_count[left_xy[LEFT(i)]];
694 21108338 nnz_cache[3 + 8 * 1 + 2 * 8 * i] = nnz[left_block[8 + 0 + 2 * i]];
695 21108338 nnz_cache[3 + 8 * 2 + 2 * 8 * i] = nnz[left_block[8 + 1 + 2 * i]];
696
2/2
✓ Branch 0 taken 295798 times.
✓ Branch 1 taken 20812540 times.
21108338 if (CHROMA444(h)) {
697 295798 nnz_cache[3 + 8 * 6 + 2 * 8 * i] = nnz[left_block[8 + 0 + 2 * i] + 4 * 4];
698 295798 nnz_cache[3 + 8 * 7 + 2 * 8 * i] = nnz[left_block[8 + 1 + 2 * i] + 4 * 4];
699 295798 nnz_cache[3 + 8 * 11 + 2 * 8 * i] = nnz[left_block[8 + 0 + 2 * i] + 8 * 4];
700 295798 nnz_cache[3 + 8 * 12 + 2 * 8 * i] = nnz[left_block[8 + 1 + 2 * i] + 8 * 4];
701
2/2
✓ Branch 0 taken 1619188 times.
✓ Branch 1 taken 19193352 times.
20812540 } else if (CHROMA422(h)) {
702 1619188 nnz_cache[3 + 8 * 6 + 2 * 8 * i] = nnz[left_block[8 + 0 + 2 * i] - 2 + 4 * 4];
703 1619188 nnz_cache[3 + 8 * 7 + 2 * 8 * i] = nnz[left_block[8 + 1 + 2 * i] - 2 + 4 * 4];
704 1619188 nnz_cache[3 + 8 * 11 + 2 * 8 * i] = nnz[left_block[8 + 0 + 2 * i] - 2 + 8 * 4];
705 1619188 nnz_cache[3 + 8 * 12 + 2 * 8 * i] = nnz[left_block[8 + 1 + 2 * i] - 2 + 8 * 4];
706 } else {
707 19193352 nnz_cache[3 + 8 * 6 + 8 * i] = nnz[left_block[8 + 4 + 2 * i]];
708 19193352 nnz_cache[3 + 8 * 11 + 8 * i] = nnz[left_block[8 + 5 + 2 * i]];
709 }
710 } else {
711 626630 nnz_cache[3 + 8 * 1 + 2 * 8 * i] =
712 626630 nnz_cache[3 + 8 * 2 + 2 * 8 * i] =
713 626630 nnz_cache[3 + 8 * 6 + 2 * 8 * i] =
714 626630 nnz_cache[3 + 8 * 7 + 2 * 8 * i] =
715 626630 nnz_cache[3 + 8 * 11 + 2 * 8 * i] =
716
2/2
✓ Branch 0 taken 264788 times.
✓ Branch 1 taken 102114 times.
626630 nnz_cache[3 + 8 * 12 + 2 * 8 * i] = CABAC(h) && !IS_INTRA(mb_type) ? 0 : 64;
717 }
718 }
719
720 if (CABAC(h)) {
721 // top_cbp
722
2/2
✓ Branch 0 taken 6656911 times.
✓ Branch 1 taken 508011 times.
7164922 if (top_type)
723 6656911 sl->top_cbp = h->cbp_table[top_xy];
724 else
725
2/2
✓ Branch 0 taken 174380 times.
✓ Branch 1 taken 333631 times.
508011 sl->top_cbp = IS_INTRA(mb_type) ? 0x7CF : 0x00F;
726 // left_cbp
727
2/2
✓ Branch 0 taken 6981471 times.
✓ Branch 1 taken 183451 times.
7164922 if (left_type[LTOP]) {
728 6981471 sl->left_cbp = (h->cbp_table[left_xy[LTOP]] & 0x7F0) |
729 6981471 ((h->cbp_table[left_xy[LTOP]] >> (left_block[0] & (~1))) & 2) |
730 6981471 (((h->cbp_table[left_xy[LBOT]] >> (left_block[2] & (~1))) & 2) << 2);
731 } else {
732
2/2
✓ Branch 0 taken 51057 times.
✓ Branch 1 taken 132394 times.
183451 sl->left_cbp = IS_INTRA(mb_type) ? 0x7CF : 0x00F;
733 }
734 }
735 }
736
737
6/6
✓ Branch 0 taken 7020995 times.
✓ Branch 1 taken 6155708 times.
✓ Branch 2 taken 2956139 times.
✓ Branch 3 taken 4064856 times.
✓ Branch 4 taken 2892179 times.
✓ Branch 5 taken 63960 times.
13176703 if (IS_INTER(mb_type) || (IS_DIRECT(mb_type) && sl->direct_spatial_mv_pred)) {
738 int list;
739 9047887 int b_stride = h->b_stride;
740
2/2
✓ Branch 0 taken 14448982 times.
✓ Branch 1 taken 9047887 times.
23496869 for (list = 0; list < sl->list_count; list++) {
741 14448982 int8_t *ref_cache = &sl->ref_cache[list][scan8[0]];
742 14448982 int8_t *ref = h->cur_pic.ref_index[list];
743 14448982 int16_t(*mv_cache)[2] = &sl->mv_cache[list][scan8[0]];
744 14448982 int16_t(*mv)[2] = h->cur_pic.motion_val[list];
745
2/2
✓ Branch 0 taken 1361607 times.
✓ Branch 1 taken 13087375 times.
14448982 if (!USES_LIST(mb_type, list))
746 1361607 continue;
747 av_assert2(!(IS_DIRECT(mb_type) && !sl->direct_spatial_mv_pred));
748
749
2/2
✓ Branch 0 taken 10552137 times.
✓ Branch 1 taken 2535238 times.
13087375 if (USES_LIST(top_type, list)) {
750 10552137 const int b_xy = h->mb2b_xy[top_xy] + 3 * b_stride;
751 10552137 AV_COPY128(mv_cache[0 - 1 * 8], mv[b_xy + 0]);
752 10552137 ref_cache[0 - 1 * 8] =
753 10552137 ref_cache[1 - 1 * 8] = ref[4 * top_xy + 2];
754 10552137 ref_cache[2 - 1 * 8] =
755 10552137 ref_cache[3 - 1 * 8] = ref[4 * top_xy + 3];
756 } else {
757 2535238 AV_ZERO128(mv_cache[0 - 1 * 8]);
758
2/2
✓ Branch 0 taken 1520975 times.
✓ Branch 1 taken 1014263 times.
2535238 AV_WN32A(&ref_cache[0 - 1 * 8],
759 ((top_type ? LIST_NOT_USED : PART_NOT_AVAILABLE) & 0xFF) * 0x01010101u);
760 }
761
762
2/2
✓ Branch 0 taken 2817924 times.
✓ Branch 1 taken 10269451 times.
13087375 if (mb_type & (MB_TYPE_16x8 | MB_TYPE_8x8)) {
763
2/2
✓ Branch 0 taken 5635848 times.
✓ Branch 1 taken 2817924 times.
8453772 for (i = 0; i < 2; i++) {
764 5635848 int cache_idx = -1 + i * 2 * 8;
765
2/2
✓ Branch 0 taken 4820594 times.
✓ Branch 1 taken 815254 times.
5635848 if (USES_LIST(left_type[LEFT(i)], list)) {
766 4820594 const int b_xy = h->mb2b_xy[left_xy[LEFT(i)]] + 3;
767 4820594 const int b8_xy = 4 * left_xy[LEFT(i)] + 1;
768 4820594 AV_COPY32(mv_cache[cache_idx],
769 mv[b_xy + b_stride * left_block[0 + i * 2]]);
770 4820594 AV_COPY32(mv_cache[cache_idx + 8],
771 mv[b_xy + b_stride * left_block[1 + i * 2]]);
772 4820594 ref_cache[cache_idx] = ref[b8_xy + (left_block[0 + i * 2] & ~1)];
773 4820594 ref_cache[cache_idx + 8] = ref[b8_xy + (left_block[1 + i * 2] & ~1)];
774 } else {
775 815254 AV_ZERO32(mv_cache[cache_idx]);
776 815254 AV_ZERO32(mv_cache[cache_idx + 8]);
777 815254 ref_cache[cache_idx] =
778
2/2
✓ Branch 0 taken 581474 times.
✓ Branch 1 taken 233780 times.
815254 ref_cache[cache_idx + 8] = (left_type[LEFT(i)]) ? LIST_NOT_USED
779 : PART_NOT_AVAILABLE;
780 }
781 }
782 } else {
783
2/2
✓ Branch 0 taken 8807885 times.
✓ Branch 1 taken 1461566 times.
10269451 if (USES_LIST(left_type[LTOP], list)) {
784 8807885 const int b_xy = h->mb2b_xy[left_xy[LTOP]] + 3;
785 8807885 const int b8_xy = 4 * left_xy[LTOP] + 1;
786 8807885 AV_COPY32(mv_cache[-1], mv[b_xy + b_stride * left_block[0]]);
787 8807885 ref_cache[-1] = ref[b8_xy + (left_block[0] & ~1)];
788 } else {
789 1461566 AV_ZERO32(mv_cache[-1]);
790
2/2
✓ Branch 0 taken 1199989 times.
✓ Branch 1 taken 261577 times.
1461566 ref_cache[-1] = left_type[LTOP] ? LIST_NOT_USED
791 : PART_NOT_AVAILABLE;
792 }
793 }
794
795
2/2
✓ Branch 0 taken 9699411 times.
✓ Branch 1 taken 3387964 times.
13087375 if (USES_LIST(topright_type, list)) {
796 9699411 const int b_xy = h->mb2b_xy[topright_xy] + 3 * b_stride;
797 9699411 AV_COPY32(mv_cache[4 - 1 * 8], mv[b_xy]);
798 9699411 ref_cache[4 - 1 * 8] = ref[4 * topright_xy + 2];
799 } else {
800 3387964 AV_ZERO32(mv_cache[4 - 1 * 8]);
801
2/2
✓ Branch 0 taken 1469526 times.
✓ Branch 1 taken 1918438 times.
3387964 ref_cache[4 - 1 * 8] = topright_type ? LIST_NOT_USED
802 : PART_NOT_AVAILABLE;
803 }
804
4/4
✓ Branch 0 taken 10351963 times.
✓ Branch 1 taken 2735412 times.
✓ Branch 2 taken 1363053 times.
✓ Branch 3 taken 8988910 times.
13087375 if(ref_cache[2 - 1*8] < 0 || ref_cache[4 - 1 * 8] < 0) {
805
2/2
✓ Branch 0 taken 1840677 times.
✓ Branch 1 taken 2257788 times.
4098465 if (USES_LIST(topleft_type, list)) {
806 1840677 const int b_xy = h->mb2b_xy[topleft_xy] + 3 + b_stride +
807 1840677 (sl->topleft_partition & 2 * b_stride);
808 1840677 const int b8_xy = 4 * topleft_xy + 1 + (sl->topleft_partition & 2);
809 1840677 AV_COPY32(mv_cache[-1 - 1 * 8], mv[b_xy]);
810 1840677 ref_cache[-1 - 1 * 8] = ref[b8_xy];
811 } else {
812 2257788 AV_ZERO32(mv_cache[-1 - 1 * 8]);
813
2/2
✓ Branch 0 taken 1149782 times.
✓ Branch 1 taken 1108006 times.
2257788 ref_cache[-1 - 1 * 8] = topleft_type ? LIST_NOT_USED
814 : PART_NOT_AVAILABLE;
815 }
816 }
817
818
4/4
✓ Branch 0 taken 5784358 times.
✓ Branch 1 taken 7303017 times.
✓ Branch 2 taken 5143174 times.
✓ Branch 3 taken 641184 times.
13087375 if ((mb_type & (MB_TYPE_SKIP | MB_TYPE_DIRECT2)) && !FRAME_MBAFF(h))
819 5143174 continue;
820
821
2/2
✓ Branch 0 taken 7303017 times.
✓ Branch 1 taken 641184 times.
7944201 if (!(mb_type & (MB_TYPE_SKIP | MB_TYPE_DIRECT2))) {
822 7303017 uint8_t(*mvd_cache)[2] = &sl->mvd_cache[list][scan8[0]];
823 7303017 uint8_t(*mvd)[2] = sl->mvd_table[list];
824 7303017 ref_cache[2 + 8 * 0] =
825 7303017 ref_cache[2 + 8 * 2] = PART_NOT_AVAILABLE;
826 7303017 AV_ZERO32(mv_cache[2 + 8 * 0]);
827 7303017 AV_ZERO32(mv_cache[2 + 8 * 2]);
828
829 if (CABAC(h)) {
830
2/2
✓ Branch 0 taken 3906506 times.
✓ Branch 1 taken 977898 times.
4884404 if (USES_LIST(top_type, list)) {
831 3906506 const int b_xy = h->mb2br_xy[top_xy];
832 3906506 AV_COPY64(mvd_cache[0 - 1 * 8], mvd[b_xy + 0]);
833 } else {
834 977898 AV_ZERO64(mvd_cache[0 - 1 * 8]);
835 }
836
2/2
✓ Branch 0 taken 4133514 times.
✓ Branch 1 taken 750890 times.
4884404 if (USES_LIST(left_type[LTOP], list)) {
837 4133514 const int b_xy = h->mb2br_xy[left_xy[LTOP]] + 6;
838 4133514 AV_COPY16(mvd_cache[-1 + 0 * 8], mvd[b_xy - left_block[0]]);
839 4133514 AV_COPY16(mvd_cache[-1 + 1 * 8], mvd[b_xy - left_block[1]]);
840 } else {
841 750890 AV_ZERO16(mvd_cache[-1 + 0 * 8]);
842 750890 AV_ZERO16(mvd_cache[-1 + 1 * 8]);
843 }
844
2/2
✓ Branch 0 taken 4132980 times.
✓ Branch 1 taken 751424 times.
4884404 if (USES_LIST(left_type[LBOT], list)) {
845 4132980 const int b_xy = h->mb2br_xy[left_xy[LBOT]] + 6;
846 4132980 AV_COPY16(mvd_cache[-1 + 2 * 8], mvd[b_xy - left_block[2]]);
847 4132980 AV_COPY16(mvd_cache[-1 + 3 * 8], mvd[b_xy - left_block[3]]);
848 } else {
849 751424 AV_ZERO16(mvd_cache[-1 + 2 * 8]);
850 751424 AV_ZERO16(mvd_cache[-1 + 3 * 8]);
851 }
852 4884404 AV_ZERO16(mvd_cache[2 + 8 * 0]);
853 4884404 AV_ZERO16(mvd_cache[2 + 8 * 2]);
854
2/2
✓ Branch 0 taken 2704777 times.
✓ Branch 1 taken 2179627 times.
4884404 if (sl->slice_type_nos == AV_PICTURE_TYPE_B) {
855 2704777 uint8_t *direct_cache = &sl->direct_cache[scan8[0]];
856 2704777 uint8_t *direct_table = h->direct_table;
857 2704777 fill_rectangle(direct_cache, 4, 4, 8, MB_TYPE_16x16 >> 1, 1);
858
859
2/2
✓ Branch 0 taken 449432 times.
✓ Branch 1 taken 2255345 times.
2704777 if (IS_DIRECT(top_type)) {
860 449432 AV_WN32A(&direct_cache[-1 * 8],
861 0x01010101u * (MB_TYPE_DIRECT2 >> 1));
862
2/2
✓ Branch 0 taken 616288 times.
✓ Branch 1 taken 1639057 times.
2255345 } else if (IS_8X8(top_type)) {
863 616288 int b8_xy = 4 * top_xy;
864 616288 direct_cache[0 - 1 * 8] = direct_table[b8_xy + 2];
865 616288 direct_cache[2 - 1 * 8] = direct_table[b8_xy + 3];
866 } else {
867 1639057 AV_WN32A(&direct_cache[-1 * 8],
868 0x01010101 * (MB_TYPE_16x16 >> 1));
869 }
870
871
2/2
✓ Branch 0 taken 440391 times.
✓ Branch 1 taken 2264386 times.
2704777 if (IS_DIRECT(left_type[LTOP]))
872 440391 direct_cache[-1 + 0 * 8] = MB_TYPE_DIRECT2 >> 1;
873
2/2
✓ Branch 0 taken 652679 times.
✓ Branch 1 taken 1611707 times.
2264386 else if (IS_8X8(left_type[LTOP]))
874 652679 direct_cache[-1 + 0 * 8] = direct_table[4 * left_xy[LTOP] + 1 + (left_block[0] & ~1)];
875 else
876 1611707 direct_cache[-1 + 0 * 8] = MB_TYPE_16x16 >> 1;
877
878
2/2
✓ Branch 0 taken 439437 times.
✓ Branch 1 taken 2265340 times.
2704777 if (IS_DIRECT(left_type[LBOT]))
879 439437 direct_cache[-1 + 2 * 8] = MB_TYPE_DIRECT2 >> 1;
880
2/2
✓ Branch 0 taken 654834 times.
✓ Branch 1 taken 1610506 times.
2265340 else if (IS_8X8(left_type[LBOT]))
881 654834 direct_cache[-1 + 2 * 8] = direct_table[4 * left_xy[LBOT] + 1 + (left_block[2] & ~1)];
882 else
883 1610506 direct_cache[-1 + 2 * 8] = MB_TYPE_16x16 >> 1;
884 }
885 }
886 }
887
888 #define MAP_MVS \
889 MAP_F2F(scan8[0] - 1 - 1 * 8, topleft_type) \
890 MAP_F2F(scan8[0] + 0 - 1 * 8, top_type) \
891 MAP_F2F(scan8[0] + 1 - 1 * 8, top_type) \
892 MAP_F2F(scan8[0] + 2 - 1 * 8, top_type) \
893 MAP_F2F(scan8[0] + 3 - 1 * 8, top_type) \
894 MAP_F2F(scan8[0] + 4 - 1 * 8, topright_type) \
895 MAP_F2F(scan8[0] - 1 + 0 * 8, left_type[LTOP]) \
896 MAP_F2F(scan8[0] - 1 + 1 * 8, left_type[LTOP]) \
897 MAP_F2F(scan8[0] - 1 + 2 * 8, left_type[LBOT]) \
898 MAP_F2F(scan8[0] - 1 + 3 * 8, left_type[LBOT])
899
900
2/2
✓ Branch 0 taken 1795353 times.
✓ Branch 1 taken 6148848 times.
7944201 if (FRAME_MBAFF(h)) {
901
2/2
✓ Branch 0 taken 591894 times.
✓ Branch 1 taken 1203459 times.
1795353 if (MB_FIELD(sl)) {
902
903 #define MAP_F2F(idx, mb_type) \
904 if (!IS_INTERLACED(mb_type) && sl->ref_cache[list][idx] >= 0) { \
905 sl->ref_cache[list][idx] *= 2; \
906 sl->mv_cache[list][idx][1] /= 2; \
907 sl->mvd_cache[list][idx][1] >>= 1; \
908 }
909
910
40/40
✓ Branch 0 taken 332225 times.
✓ Branch 1 taken 259669 times.
✓ Branch 2 taken 172979 times.
✓ Branch 3 taken 159246 times.
✓ Branch 4 taken 307683 times.
✓ Branch 5 taken 284211 times.
✓ Branch 6 taken 170748 times.
✓ Branch 7 taken 136935 times.
✓ Branch 8 taken 307683 times.
✓ Branch 9 taken 284211 times.
✓ Branch 10 taken 170748 times.
✓ Branch 11 taken 136935 times.
✓ Branch 12 taken 307683 times.
✓ Branch 13 taken 284211 times.
✓ Branch 14 taken 170789 times.
✓ Branch 15 taken 136894 times.
✓ Branch 16 taken 307683 times.
✓ Branch 17 taken 284211 times.
✓ Branch 18 taken 170789 times.
✓ Branch 19 taken 136894 times.
✓ Branch 20 taken 332145 times.
✓ Branch 21 taken 259749 times.
✓ Branch 22 taken 178677 times.
✓ Branch 23 taken 153468 times.
✓ Branch 24 taken 247643 times.
✓ Branch 25 taken 344251 times.
✓ Branch 26 taken 169796 times.
✓ Branch 27 taken 77847 times.
✓ Branch 28 taken 247643 times.
✓ Branch 29 taken 344251 times.
✓ Branch 30 taken 159645 times.
✓ Branch 31 taken 87998 times.
✓ Branch 32 taken 247643 times.
✓ Branch 33 taken 344251 times.
✓ Branch 34 taken 159406 times.
✓ Branch 35 taken 88237 times.
✓ Branch 36 taken 247643 times.
✓ Branch 37 taken 344251 times.
✓ Branch 38 taken 159416 times.
✓ Branch 39 taken 88227 times.
591894 MAP_MVS
911 } else {
912
913 #undef MAP_F2F
914 #define MAP_F2F(idx, mb_type) \
915 if (IS_INTERLACED(mb_type) && sl->ref_cache[list][idx] >= 0) { \
916 sl->ref_cache[list][idx] >>= 1; \
917 sl->mv_cache[list][idx][1] *= 2; \
918 sl->mvd_cache[list][idx][1] <<= 1; \
919 }
920
921
40/40
✓ Branch 0 taken 211379 times.
✓ Branch 1 taken 992080 times.
✓ Branch 2 taken 157001 times.
✓ Branch 3 taken 54378 times.
✓ Branch 4 taken 99937 times.
✓ Branch 5 taken 1103522 times.
✓ Branch 6 taken 77205 times.
✓ Branch 7 taken 22732 times.
✓ Branch 8 taken 99937 times.
✓ Branch 9 taken 1103522 times.
✓ Branch 10 taken 77205 times.
✓ Branch 11 taken 22732 times.
✓ Branch 12 taken 99937 times.
✓ Branch 13 taken 1103522 times.
✓ Branch 14 taken 77271 times.
✓ Branch 15 taken 22666 times.
✓ Branch 16 taken 99937 times.
✓ Branch 17 taken 1103522 times.
✓ Branch 18 taken 77271 times.
✓ Branch 19 taken 22666 times.
✓ Branch 20 taken 104589 times.
✓ Branch 21 taken 1098870 times.
✓ Branch 22 taken 81623 times.
✓ Branch 23 taken 22966 times.
✓ Branch 24 taken 212823 times.
✓ Branch 25 taken 990636 times.
✓ Branch 26 taken 165316 times.
✓ Branch 27 taken 47507 times.
✓ Branch 28 taken 212823 times.
✓ Branch 29 taken 990636 times.
✓ Branch 30 taken 145857 times.
✓ Branch 31 taken 66966 times.
✓ Branch 32 taken 212823 times.
✓ Branch 33 taken 990636 times.
✓ Branch 34 taken 145814 times.
✓ Branch 35 taken 67009 times.
✓ Branch 36 taken 212823 times.
✓ Branch 37 taken 990636 times.
✓ Branch 38 taken 145683 times.
✓ Branch 39 taken 67140 times.
1203459 MAP_MVS
922 #undef MAP_F2F
923 }
924 }
925 }
926 }
927
928 13176703 sl->neighbor_transform_size = !!IS_8x8DCT(top_type) + !!IS_8x8DCT(left_type[LTOP]);
929 13176703 }
930
931 /**
932 * decodes a P_SKIP or B_SKIP macroblock
933 */
934 4235886 static void av_unused decode_mb_skip(const H264Context *h, H264SliceContext *sl)
935 {
936 4235886 const int mb_xy = sl->mb_xy;
937 4235886 int mb_type = 0;
938
939 4235886 memset(h->non_zero_count[mb_xy], 0, 48);
940
941
2/2
✓ Branch 0 taken 1542701 times.
✓ Branch 1 taken 2693185 times.
4235886 if (MB_FIELD(sl))
942 1542701 mb_type |= MB_TYPE_INTERLACED;
943
944
2/2
✓ Branch 0 taken 2445285 times.
✓ Branch 1 taken 1790601 times.
4235886 if (sl->slice_type_nos == AV_PICTURE_TYPE_B) {
945 // just for fill_caches. pred_direct_motion will set the real mb_type
946 2445285 mb_type |= MB_TYPE_L0L1 | MB_TYPE_DIRECT2 | MB_TYPE_SKIP;
947
2/2
✓ Branch 0 taken 2309219 times.
✓ Branch 1 taken 136066 times.
2445285 if (sl->direct_spatial_mv_pred) {
948 2309219 fill_decode_neighbors(h, sl, mb_type);
949 2309219 fill_decode_caches(h, sl, mb_type); //FIXME check what is needed and what not ...
950 }
951 2445285 ff_h264_pred_direct_motion(h, sl, &mb_type);
952 2445285 mb_type |= MB_TYPE_SKIP;
953 } else {
954 1790601 mb_type |= MB_TYPE_16x16 | MB_TYPE_P0L0 | MB_TYPE_P1L0 | MB_TYPE_SKIP;
955
956 1790601 fill_decode_neighbors(h, sl, mb_type);
957 1790601 pred_pskip_motion(h, sl);
958 }
959
960 4235886 write_back_motion(h, sl, mb_type);
961 4235886 h->cur_pic.mb_type[mb_xy] = mb_type;
962 4235886 h->cur_pic.qscale_table[mb_xy] = sl->qscale;
963 4235886 h->slice_table[mb_xy] = sl->slice_num;
964 4235886 sl->prev_mb_skipped = 1;
965 4235886 }
966
967 #endif /* AVCODEC_H264_MVPRED_H */
968