FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/tests/checkasm/cavsdsp.c
Date: 2026-09-02 05:15:20
Exec Total Coverage
Lines: 26 32 81.2%
Functions: 2 2 100.0%
Branches: 17 38 44.7%
Line Branch Exec Source
1 /*
2 * This file is part of FFmpeg.
3 *
4 * FFmpeg is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
8 *
9 * FFmpeg is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License along
15 * with FFmpeg; if not, write to the Free Software Foundation, Inc.,
16 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
17 */
18
19 #include <assert.h>
20 #include <stddef.h>
21 #include <string.h>
22
23 #include "checkasm.h"
24 #include "libavutil/intreadwrite.h"
25 #include "libavutil/macros.h"
26 #include "libavutil/mem_internal.h"
27 #include "libavcodec/cavsdsp.h"
28
29
30 enum {
31 // DECLARE_ALIGNED can't handle enum constants.
32 #define MAX_BLOCK_SIZE 16
33 MAX_STRIDE = 64,
34 /// BUF_SIZE is bigger than necessary in order to test strides > block width.
35 BUF_SIZE = ((MAX_BLOCK_SIZE - 1) * MAX_STRIDE + MAX_BLOCK_SIZE),
36 /**
37 * The qpel interpolation code accesses two lines above and three lines
38 * below the actual src block; it also accesses two pixels to the left
39 * and three to the right.
40 * The input is not subject to alignment requirements; making the input buffer
41 * bigger (by MAX_BLOCK_SIZE - 1) allows us to use a random misalignment.
42 */
43 INPUT_BUF_SIZE = (2 + (2 + MAX_BLOCK_SIZE - 1 + 3) * MAX_STRIDE + MAX_BLOCK_SIZE + 3 + (MAX_BLOCK_SIZE - 1))
44 };
45
46 #define randomize_buffers(buf0, buf1) \
47 do { \
48 static_assert(sizeof(buf0) == sizeof(buf1), "Incompatible buffers"); \
49 static_assert(!(sizeof(buf0) % 4), "Tail handling needed"); \
50 static_assert(sizeof(buf0[0]) == 1 && sizeof(buf1[0]) == 1, \
51 "Pointer arithmetic needs to be adapted"); \
52 for (size_t k = 0; k < sizeof(buf0); k += 4) { \
53 uint32_t r = rnd(); \
54 AV_WN32A(buf0 + k, r); \
55 AV_WN32A(buf1 + k, r); \
56 } \
57 } while (0)
58
59
60 14 static void check_cavs_qpeldsp(void)
61 {
62 DECLARE_ALIGNED(MAX_BLOCK_SIZE, uint8_t, srcbuf0)[INPUT_BUF_SIZE];
63 DECLARE_ALIGNED(MAX_BLOCK_SIZE, uint8_t, srcbuf1)[INPUT_BUF_SIZE];
64 DECLARE_ALIGNED(MAX_BLOCK_SIZE, uint8_t, dstbuf0)[BUF_SIZE];
65 DECLARE_ALIGNED(MAX_BLOCK_SIZE, uint8_t, dstbuf1)[BUF_SIZE];
66 CAVSDSPContext cavsdsp;
67 static const struct {
68 const char *name;
69 size_t offset;
70 } tests[] = {
71 #define TEST(NAME) { .name = #NAME, .offset = offsetof(CAVSDSPContext, NAME) }
72 TEST(put_cavs_qpel_pixels_tab),
73 TEST(avg_cavs_qpel_pixels_tab),
74 };
75 14 declare_func(void, uint8_t *dst, const uint8_t *src, ptrdiff_t stride);
76
77 14 ff_cavsdsp_init(&cavsdsp);
78
79
2/2
✓ Branch 0 taken 28 times.
✓ Branch 1 taken 14 times.
 42 for (size_t i = 0; i < FF_ARRAY_ELEMS(tests); ++i) {
80 28 qpel_mc_func (*func_tab)[16] = (qpel_mc_func (*)[16])((char*)&cavsdsp + tests[i].offset);
81
2/2
✓ Branch 0 taken 56 times.
✓ Branch 1 taken 28 times.
 84 for (unsigned j = 0; j < 2; ++j) {
82 56 const unsigned blocksize = MAX_BLOCK_SIZE >> j;
83
84
2/2
✓ Branch 0 taken 896 times.
✓ Branch 1 taken 56 times.
 952 for (unsigned dxy = 0; dxy < 16; ++dxy) {
85
2/2
✓ Branch 1 taken 84 times.
✓ Branch 2 taken 812 times.
 896 if (check_func(func_tab[j][dxy], "%s[%u][%u]", tests[i].name, j, dxy)) {
86 // Don't always use output that is 16-aligned.
87 84 size_t dst_offset = (rnd() % (MAX_BLOCK_SIZE / blocksize)) * blocksize;
88 84 ptrdiff_t stride = (rnd() % (MAX_STRIDE / blocksize) + 1) * blocksize;
89 84 size_t src_offset = 2 + 2 * stride + rnd() % MAX_BLOCK_SIZE;
90 84 const uint8_t *src0 = srcbuf0 + src_offset, *src1 = srcbuf1 + src_offset;
91 84 uint8_t *dst0 = dstbuf0 + dst_offset, *dst1 = dstbuf1 + dst_offset;
92
93
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 84 times.
 84 if (rnd() & 1) {
94 // Flip stride.
95 ✗ dst1 += (blocksize - 1) * stride;
96 ✗ dst0 += (blocksize - 1) * stride;
97 // We need two lines above src and three lines below the block,
98 // hence blocksize * stride.
99 ✗ src0 += blocksize * stride;
100 ✗ src1 += blocksize * stride;
101 ✗ stride = -stride;
102 }
103
104
2/2
✓ Branch 1 taken 27636 times.
✓ Branch 2 taken 84 times.
 27720 randomize_buffers(srcbuf0, srcbuf1);
105
2/2
✓ Branch 1 taken 20496 times.
✓ Branch 2 taken 84 times.
 20580 randomize_buffers(dstbuf0, dstbuf1);
106
1/2
✗ Branch 2 not taken.
✓ Branch 3 taken 84 times.
 84 call_ref(dst0, src0, stride);
107 84 call_new(dst1, src1, stride);
108
2/4
✓ Branch 0 taken 84 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 84 times.
 84 if (memcmp(srcbuf0, srcbuf1, sizeof(srcbuf0)) || memcmp(dstbuf0, dstbuf1, sizeof(dstbuf0)))
109 ✗ fail();
110
1/18
✗ Branch 1 not taken.
✓ Branch 2 taken 84 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 41 not taken.
✗ Branch 42 not taken.
✗ Branch 43 not taken.
✗ Branch 44 not taken.
✗ Branch 45 not taken.
✗ Branch 46 not taken.
✗ Branch 47 not taken.
✗ Branch 48 not taken.
✗ Branch 51 not taken.
✗ Branch 52 not taken.
✗ Branch 54 not taken.
✗ Branch 55 not taken.
✗ Branch 59 not taken.
✗ Branch 60 not taken.
 84 bench_new(dst0, src0, stride);
111 }
112 }
113 }
114 }
115 14 }
116
117 14 void checkasm_check_cavsdsp(void)
118 {
119 14 check_cavs_qpeldsp();
120 14 report("qpeldsp");
121 14 }
122