FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/libavcodec/tests/dct.c
Date: 2022-12-09 07:38:14
Exec Total Coverage
Lines: 209 251 83.3%
Functions: 7 8 87.5%
Branches: 150 178 84.3%

Line Branch Exec Source
1 /*
2 * (c) 2001 Fabrice Bellard
3 * 2007 Marc Hoffman <marc.hoffman@analog.com>
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 * DCT test (c) 2001 Fabrice Bellard
25 * Started from sample code by Juan J. Sierralta P.
26 */
27
28 #include "config.h"
29 #include "config_components.h"
30 #include <stdlib.h>
31 #include <stdio.h>
32 #include <string.h>
33 #if HAVE_UNISTD_H
34 #include <unistd.h>
35 #endif
36 #include <math.h>
37
38 #include "libavutil/cpu.h"
39 #include "libavutil/common.h"
40 #include "libavutil/internal.h"
41 #include "libavutil/lfg.h"
42 #include "libavutil/mem_internal.h"
43 #include "libavutil/time.h"
44
45 #include "libavcodec/dct.h"
46 #include "libavcodec/idctdsp.h"
47 #include "libavcodec/simple_idct.h"
48 #include "libavcodec/xvididct.h"
49 #include "libavcodec/aandcttab.h"
50 #include "libavcodec/faandct.h"
51 #include "libavcodec/faanidct.h"
52 #include "libavcodec/dctref.h"
53
54 struct algo {
55 const char *name;
56 void (*func)(int16_t *block);
57 enum idct_permutation_type perm_type;
58 int cpu_flag;
59 int nonspec;
60 };
61
62 static const struct algo fdct_tab[] = {
63 { "REF-DBL", ff_ref_fdct, FF_IDCT_PERM_NONE },
64 { "IJG-AAN-INT", ff_fdct_ifast, FF_IDCT_PERM_NONE },
65 { "IJG-LLM-INT", ff_jpeg_fdct_islow_8, FF_IDCT_PERM_NONE },
66 #if CONFIG_FAANDCT
67 { "FAAN", ff_faandct, FF_IDCT_PERM_NONE },
68 #endif /* CONFIG_FAANDCT */
69 };
70
71 60000 static void ff_prores_idct_wrap(int16_t *dst){
72 60000 LOCAL_ALIGNED(16, int16_t, qmat, [64]);
73 int i;
74
75
2/2
✓ Branch 0 taken 3840000 times.
✓ Branch 1 taken 60000 times.
3900000 for(i=0; i<64; i++){
76 3840000 qmat[i]=4;
77 }
78 60000 ff_prores_idct_10(dst, qmat);
79
2/2
✓ Branch 0 taken 3840000 times.
✓ Branch 1 taken 60000 times.
3900000 for(i=0; i<64; i++) {
80 3840000 dst[i] -= 512;
81 }
82 60000 }
83
84 static const struct algo idct_tab[] = {
85 { "REF-DBL", ff_ref_idct, FF_IDCT_PERM_NONE },
86 { "INT", ff_j_rev_dct, FF_IDCT_PERM_LIBMPEG2 },
87 { "SIMPLE-C", ff_simple_idct_int16_8bit, FF_IDCT_PERM_NONE },
88 { "SIMPLE-C10", ff_simple_idct_int16_10bit, FF_IDCT_PERM_NONE },
89 { "SIMPLE-C12", ff_simple_idct_int16_12bit, FF_IDCT_PERM_NONE, 0, 1 },
90 { "PR-C", ff_prores_idct_wrap, FF_IDCT_PERM_NONE, 0, 1 },
91 #if CONFIG_FAANIDCT
92 { "FAANI", ff_faanidct, FF_IDCT_PERM_NONE },
93 #endif /* CONFIG_FAANIDCT */
94 #if CONFIG_MPEG4_DECODER
95 { "XVID", ff_xvid_idct, FF_IDCT_PERM_NONE, 0, 1 },
96 #endif /* CONFIG_MPEG4_DECODER */
97 };
98
99 #if ARCH_AARCH64
100 #include "aarch64/dct.c"
101 #elif ARCH_ARM
102 #include "arm/dct.c"
103 #elif ARCH_PPC
104 #include "ppc/dct.c"
105 #elif ARCH_X86
106 #include "x86/dct.c"
107 #else
108 static const struct algo fdct_tab_arch[] = { { 0 } };
109 static const struct algo idct_tab_arch[] = { { 0 } };
110 #endif
111
112 #define AANSCALE_BITS 12
113
114 #define NB_ITS 20000
115 #define NB_ITS_SPEED 50000
116
117 DECLARE_ALIGNED(16, static int16_t, block)[64];
118 DECLARE_ALIGNED(8, static int16_t, block1)[64];
119
120 1120000 static void init_block(int16_t block[64], int test, int is_idct, AVLFG *prng, int vals)
121 {
122 int i, j;
123
124 1120000 memset(block, 0, 64 * sizeof(*block));
125
126
3/4
✓ Branch 0 taken 340000 times.
✓ Branch 1 taken 440000 times.
✓ Branch 2 taken 340000 times.
✗ Branch 3 not taken.
1120000 switch (test) {
127 340000 case 0:
128
2/2
✓ Branch 0 taken 21760000 times.
✓ Branch 1 taken 340000 times.
22100000 for (i = 0; i < 64; i++)
129 21760000 block[i] = (av_lfg_get(prng) % (2*vals)) -vals;
130
1/2
✓ Branch 0 taken 340000 times.
✗ Branch 1 not taken.
340000 if (is_idct) {
131 340000 ff_ref_fdct(block);
132
2/2
✓ Branch 0 taken 21760000 times.
✓ Branch 1 taken 340000 times.
22100000 for (i = 0; i < 64; i++)
133 21760000 block[i] >>= 3;
134 }
135 340000 break;
136 440000 case 1:
137 440000 j = av_lfg_get(prng) % 10 + 1;
138
2/2
✓ Branch 0 taken 2413686 times.
✓ Branch 1 taken 440000 times.
2853686 for (i = 0; i < j; i++) {
139 2413686 int idx = av_lfg_get(prng) % 64;
140 2413686 block[idx] = av_lfg_get(prng) % (2*vals) -vals;
141 }
142 440000 break;
143 340000 case 2:
144 340000 block[ 0] = av_lfg_get(prng) % (16*vals) - (8*vals);
145 340000 block[63] = (block[0] & 1) ^ 1;
146 340000 break;
147 }
148 1120000 }
149
150 1120000 static void permute(int16_t dst[64], const int16_t src[64],
151 enum idct_permutation_type perm_type)
152 {
153 int i;
154
155 #if ARCH_X86
156
2/2
✓ Branch 1 taken 60000 times.
✓ Branch 2 taken 1060000 times.
1120000 if (permute_x86(dst, src, perm_type))
157 60000 return;
158 #endif
159
160
3/4
✓ Branch 0 taken 60000 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 480000 times.
✓ Branch 3 taken 520000 times.
1060000 switch (perm_type) {
161 60000 case FF_IDCT_PERM_LIBMPEG2:
162
2/2
✓ Branch 0 taken 3840000 times.
✓ Branch 1 taken 60000 times.
3900000 for (i = 0; i < 64; i++)
163 3840000 dst[(i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2)] = src[i];
164 60000 break;
165 case FF_IDCT_PERM_PARTTRANS:
166 for (i = 0; i < 64; i++)
167 dst[(i & 0x24) | ((i & 3) << 3) | ((i >> 3) & 3)] = src[i];
168 break;
169 480000 case FF_IDCT_PERM_TRANSPOSE:
170
2/2
✓ Branch 0 taken 30720000 times.
✓ Branch 1 taken 480000 times.
31200000 for (i = 0; i < 64; i++)
171 30720000 dst[(i>>3) | ((i<<3)&0x38)] = src[i];
172 480000 break;
173 520000 default:
174
2/2
✓ Branch 0 taken 33280000 times.
✓ Branch 1 taken 520000 times.
33800000 for (i = 0; i < 64; i++)
175 33280000 dst[i] = src[i];
176 520000 break;
177 }
178 }
179
180 56 static int dct_error(const struct algo *dct, int test, int is_idct, int speed, const int bits)
181 {
182
2/2
✓ Branch 0 taken 51 times.
✓ Branch 1 taken 5 times.
56 void (*ref)(int16_t *block) = is_idct ? ff_ref_idct : ff_ref_fdct;
183 int it, i, scale;
184 int err_inf, v;
185 56 int64_t err2, ti, ti1, it1, err_sum = 0;
186 56 int64_t sysErr[64], sysErrMax = 0;
187 56 int64_t err2_matrix[64], err2_max = 0;
188 56 int maxout = 0;
189 56 int blockSumErrMax = 0, blockSumErr;
190 AVLFG prng;
191 56 const int vals=1<<bits;
192 double omse, ome;
193 int spec_err;
194
195 56 av_lfg_init(&prng, 1);
196
197 56 err_inf = 0;
198 56 err2 = 0;
199
2/2
✓ Branch 0 taken 3584 times.
✓ Branch 1 taken 56 times.
3640 for (i = 0; i < 64; i++)
200 3584 err2_matrix[i] = sysErr[i] = 0;
201
2/2
✓ Branch 0 taken 1120000 times.
✓ Branch 1 taken 56 times.
1120056 for (it = 0; it < NB_ITS; it++) {
202 1120000 init_block(block1, test, is_idct, &prng, vals);
203 1120000 permute(block, block1, dct->perm_type);
204
205 1120000 dct->func(block);
206 1120000 emms_c();
207
208
2/2
✓ Branch 0 taken 20000 times.
✓ Branch 1 taken 1100000 times.
1120000 if (!strcmp(dct->name, "IJG-AAN-INT")) {
209
2/2
✓ Branch 0 taken 1280000 times.
✓ Branch 1 taken 20000 times.
1300000 for (i = 0; i < 64; i++) {
210 1280000 scale = 8 * (1 << (AANSCALE_BITS + 11)) / ff_aanscales[i];
211 1280000 block[i] = (block[i] * scale) >> AANSCALE_BITS;
212 }
213 }
214
215 1120000 ref(block1);
216
2/2
✓ Branch 0 taken 60000 times.
✓ Branch 1 taken 1060000 times.
1120000 if (!strcmp(dct->name, "PR-SSE2"))
217
2/2
✓ Branch 0 taken 3840000 times.
✓ Branch 1 taken 60000 times.
3900000 for (i = 0; i < 64; i++)
218 3840000 block1[i] = av_clip(block1[i], 4-512, 1019-512);
219
220 1120000 blockSumErr = 0;
221
2/2
✓ Branch 0 taken 71680000 times.
✓ Branch 1 taken 1120000 times.
72800000 for (i = 0; i < 64; i++) {
222 71680000 int err = block[i] - block1[i];
223 71680000 err_sum += err;
224 71680000 v = abs(err);
225
2/2
✓ Branch 0 taken 61 times.
✓ Branch 1 taken 71679939 times.
71680000 if (v > err_inf)
226 61 err_inf = v;
227 71680000 err2_matrix[i] += v * v;
228 71680000 err2 += v * v;
229 71680000 sysErr[i] += block[i] - block1[i];
230 71680000 blockSumErr += v;
231
2/2
✓ Branch 0 taken 756 times.
✓ Branch 1 taken 71679244 times.
71680000 if (abs(block[i]) > maxout)
232 756 maxout = abs(block[i]);
233 }
234
2/2
✓ Branch 0 taken 246 times.
✓ Branch 1 taken 1119754 times.
1120000 if (blockSumErrMax < blockSumErr)
235 246 blockSumErrMax = blockSumErr;
236 }
237
2/2
✓ Branch 0 taken 3584 times.
✓ Branch 1 taken 56 times.
3640 for (i = 0; i < 64; i++) {
238 3584 sysErrMax = FFMAX(sysErrMax, FFABS(sysErr[i]));
239 3584 err2_max = FFMAX(err2_max , FFABS(err2_matrix[i]));
240 }
241
242
2/2
✓ Branch 0 taken 3584 times.
✓ Branch 1 taken 56 times.
3640 for (i = 0; i < 64; i++) {
243
2/2
✓ Branch 0 taken 448 times.
✓ Branch 1 taken 3136 times.
3584 if (i % 8 == 0)
244 448 printf("\n");
245 3584 printf("%7d ", (int) sysErr[i]);
246 }
247 56 printf("\n");
248
249 56 omse = (double) err2 / NB_ITS / 64;
250 56 ome = (double) err_sum / NB_ITS / 64;
251
252
7/8
✓ Branch 0 taken 51 times.
✓ Branch 1 taken 5 times.
✓ Branch 2 taken 51 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 36 times.
✓ Branch 5 taken 15 times.
✓ Branch 6 taken 4 times.
✓ Branch 7 taken 32 times.
56 spec_err = is_idct && (err_inf > 1 || omse > 0.02 || fabs(ome) > 0.0015);
253
2/2
✓ Branch 0 taken 39 times.
✓ Branch 1 taken 17 times.
56 if (test < 2)
254
6/6
✓ Branch 0 taken 34 times.
✓ Branch 1 taken 5 times.
✓ Branch 2 taken 28 times.
✓ Branch 3 taken 6 times.
✓ Branch 4 taken 2 times.
✓ Branch 5 taken 26 times.
39 spec_err = is_idct && ((double) err2_max / NB_ITS > 0.06 || (double) sysErrMax / NB_ITS > 0.015);
255
256 56 printf("%s %s: max_err=%d omse=%0.8f ome=%0.8f syserr=%0.8f maxout=%d blockSumErr=%d\n",
257 56 is_idct ? "IDCT" : "DCT", dct->name, err_inf,
258
2/2
✓ Branch 0 taken 51 times.
✓ Branch 1 taken 5 times.
56 omse, ome, (double) sysErrMax / NB_ITS,
259 maxout, blockSumErrMax);
260
261
3/4
✓ Branch 0 taken 13 times.
✓ Branch 1 taken 43 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 13 times.
56 if (spec_err && !dct->nonspec) {
262 printf("Failed!\n");
263 return 1;
264 }
265
266
1/2
✓ Branch 0 taken 56 times.
✗ Branch 1 not taken.
56 if (!speed)
267 56 return 0;
268
269 /* speed test */
270
271 init_block(block, test, is_idct, &prng, vals);
272 permute(block1, block, dct->perm_type);
273
274 ti = av_gettime_relative();
275 it1 = 0;
276 do {
277 for (it = 0; it < NB_ITS_SPEED; it++) {
278 memcpy(block, block1, sizeof(block));
279 dct->func(block);
280 }
281 emms_c();
282 it1 += NB_ITS_SPEED;
283 ti1 = av_gettime_relative() - ti;
284 } while (ti1 < 1000000);
285
286 printf("%s %s: %0.1f kdct/s\n", is_idct ? "IDCT" : "DCT", dct->name,
287 (double) it1 * 1000.0 / (double) ti1);
288
289 return 0;
290 }
291
292 DECLARE_ALIGNED(8, static uint8_t, img_dest)[64];
293 DECLARE_ALIGNED(8, static uint8_t, img_dest1)[64];
294
295 20000 static void idct248_ref(uint8_t *dest, ptrdiff_t linesize, int16_t *block)
296 {
297 static int init;
298 static double c8[8][8];
299 static double c4[4][4];
300 double block1[64], block2[64], block3[64];
301 double s, sum, v;
302 int i, j, k;
303
304
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 19999 times.
20000 if (!init) {
305 1 init = 1;
306
307
2/2
✓ Branch 0 taken 8 times.
✓ Branch 1 taken 1 times.
9 for (i = 0; i < 8; i++) {
308 8 sum = 0;
309
2/2
✓ Branch 0 taken 64 times.
✓ Branch 1 taken 8 times.
72 for (j = 0; j < 8; j++) {
310
2/2
✓ Branch 0 taken 8 times.
✓ Branch 1 taken 56 times.
64 s = (i == 0) ? sqrt(1.0 / 8.0) : sqrt(1.0 / 4.0);
311 64 c8[i][j] = s * cos(M_PI * i * (j + 0.5) / 8.0);
312 64 sum += c8[i][j] * c8[i][j];
313 }
314 }
315
316
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 1 times.
5 for (i = 0; i < 4; i++) {
317 4 sum = 0;
318
2/2
✓ Branch 0 taken 16 times.
✓ Branch 1 taken 4 times.
20 for (j = 0; j < 4; j++) {
319
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 12 times.
16 s = (i == 0) ? sqrt(1.0 / 4.0) : sqrt(1.0 / 2.0);
320 16 c4[i][j] = s * cos(M_PI * i * (j + 0.5) / 4.0);
321 16 sum += c4[i][j] * c4[i][j];
322 }
323 }
324 }
325
326 /* butterfly */
327 20000 s = 0.5 * sqrt(2.0);
328
2/2
✓ Branch 0 taken 80000 times.
✓ Branch 1 taken 20000 times.
100000 for (i = 0; i < 4; i++) {
329
2/2
✓ Branch 0 taken 640000 times.
✓ Branch 1 taken 80000 times.
720000 for (j = 0; j < 8; j++) {
330 640000 block1[8 * (2 * i) + j] =
331 640000 (block[8 * (2 * i) + j] + block[8 * (2 * i + 1) + j]) * s;
332 640000 block1[8 * (2 * i + 1) + j] =
333 640000 (block[8 * (2 * i) + j] - block[8 * (2 * i + 1) + j]) * s;
334 }
335 }
336
337 /* idct8 on lines */
338
2/2
✓ Branch 0 taken 160000 times.
✓ Branch 1 taken 20000 times.
180000 for (i = 0; i < 8; i++) {
339
2/2
✓ Branch 0 taken 1280000 times.
✓ Branch 1 taken 160000 times.
1440000 for (j = 0; j < 8; j++) {
340 1280000 sum = 0;
341
2/2
✓ Branch 0 taken 10240000 times.
✓ Branch 1 taken 1280000 times.
11520000 for (k = 0; k < 8; k++)
342 10240000 sum += c8[k][j] * block1[8 * i + k];
343 1280000 block2[8 * i + j] = sum;
344 }
345 }
346
347 /* idct4 */
348
2/2
✓ Branch 0 taken 160000 times.
✓ Branch 1 taken 20000 times.
180000 for (i = 0; i < 8; i++) {
349
2/2
✓ Branch 0 taken 640000 times.
✓ Branch 1 taken 160000 times.
800000 for (j = 0; j < 4; j++) {
350 /* top */
351 640000 sum = 0;
352
2/2
✓ Branch 0 taken 2560000 times.
✓ Branch 1 taken 640000 times.
3200000 for (k = 0; k < 4; k++)
353 2560000 sum += c4[k][j] * block2[8 * (2 * k) + i];
354 640000 block3[8 * (2 * j) + i] = sum;
355
356 /* bottom */
357 640000 sum = 0;
358
2/2
✓ Branch 0 taken 2560000 times.
✓ Branch 1 taken 640000 times.
3200000 for (k = 0; k < 4; k++)
359 2560000 sum += c4[k][j] * block2[8 * (2 * k + 1) + i];
360 640000 block3[8 * (2 * j + 1) + i] = sum;
361 }
362 }
363
364 /* clamp and store the result */
365
2/2
✓ Branch 0 taken 160000 times.
✓ Branch 1 taken 20000 times.
180000 for (i = 0; i < 8; i++) {
366
2/2
✓ Branch 0 taken 1280000 times.
✓ Branch 1 taken 160000 times.
1440000 for (j = 0; j < 8; j++) {
367 1280000 v = block3[8 * i + j];
368
2/2
✓ Branch 0 taken 53473 times.
✓ Branch 1 taken 1226527 times.
1280000 if (v < 0) v = 0;
369
2/2
✓ Branch 0 taken 54705 times.
✓ Branch 1 taken 1171822 times.
1226527 else if (v > 255) v = 255;
370 1280000 dest[i * linesize + j] = (int) rint(v);
371 }
372 }
373 20000 }
374
375 1 static void idct248_error(const char *name,
376 void (*idct248_put)(uint8_t *dest,
377 ptrdiff_t line_size,
378 int16_t *block),
379 int speed)
380 {
381 int it, i, it1, ti, ti1, err_max, v;
382 AVLFG prng;
383
384 1 av_lfg_init(&prng, 1);
385
386 /* just one test to see if code is correct (precision is less
387 important here) */
388 1 err_max = 0;
389
2/2
✓ Branch 0 taken 20000 times.
✓ Branch 1 taken 1 times.
20001 for (it = 0; it < NB_ITS; it++) {
390 /* XXX: use forward transform to generate values */
391
2/2
✓ Branch 0 taken 1280000 times.
✓ Branch 1 taken 20000 times.
1300000 for (i = 0; i < 64; i++)
392 1280000 block1[i] = av_lfg_get(&prng) % 256 - 128;
393 20000 block1[0] += 1024;
394
395
2/2
✓ Branch 0 taken 1280000 times.
✓ Branch 1 taken 20000 times.
1300000 for (i = 0; i < 64; i++)
396 1280000 block[i] = block1[i];
397 20000 idct248_ref(img_dest1, 8, block);
398
399
2/2
✓ Branch 0 taken 1280000 times.
✓ Branch 1 taken 20000 times.
1300000 for (i = 0; i < 64; i++)
400 1280000 block[i] = block1[i];
401 20000 idct248_put(img_dest, 8, block);
402
403
2/2
✓ Branch 0 taken 1280000 times.
✓ Branch 1 taken 20000 times.
1300000 for (i = 0; i < 64; i++) {
404 1280000 v = abs((int) img_dest[i] - (int) img_dest1[i]);
405
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1280000 times.
1280000 if (v == 255)
406 printf("%d %d\n", img_dest[i], img_dest1[i]);
407
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 1279999 times.
1280000 if (v > err_max)
408 1 err_max = v;
409 }
410 #if 0
411 printf("ref=\n");
412 for(i=0;i<8;i++) {
413 int j;
414 for(j=0;j<8;j++) {
415 printf(" %3d", img_dest1[i*8+j]);
416 }
417 printf("\n");
418 }
419
420 printf("out=\n");
421 for(i=0;i<8;i++) {
422 int j;
423 for(j=0;j<8;j++) {
424 printf(" %3d", img_dest[i*8+j]);
425 }
426 printf("\n");
427 }
428 #endif
429 }
430 1 printf("%s %s: err_inf=%d\n", 1 ? "IDCT248" : "DCT248", name, err_max);
431
432
1/2
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
1 if (!speed)
433 1 return;
434
435 ti = av_gettime_relative();
436 it1 = 0;
437 do {
438 for (it = 0; it < NB_ITS_SPEED; it++) {
439 for (i = 0; i < 64; i++)
440 block[i] = block1[i];
441 idct248_put(img_dest, 8, block);
442 }
443 emms_c();
444 it1 += NB_ITS_SPEED;
445 ti1 = av_gettime_relative() - ti;
446 } while (ti1 < 1000000);
447
448 printf("%s %s: %0.1f kdct/s\n", 1 ? "IDCT248" : "DCT248", name,
449 (double) it1 * 1000.0 / (double) ti1);
450 }
451
452 static void help(void)
453 {
454 printf("dct-test [-i] [<test-number>] [<bits>]\n"
455 "test-number 0 -> test with random matrixes\n"
456 " 1 -> test with random sparse matrixes\n"
457 " 2 -> do 3. test from MPEG-4 std\n"
458 "bits Number of time domain bits to use, 8 is default\n"
459 "-i test IDCT implementations\n"
460 "-4 test IDCT248 implementations\n"
461 "-t speed test\n");
462 }
463
464 #if !HAVE_GETOPT
465 #include "compat/getopt.c"
466 #endif
467
468 5 int main(int argc, char **argv)
469 {
470 5 int test_idct = 0, test_248_dct = 0;
471 int c, i;
472 5 int test = 1;
473 5 int speed = 0;
474 5 int err = 0;
475 5 int bits=8;
476
477 5 ff_ref_dct_init();
478
479 for (;;) {
480 9 c = getopt(argc, argv, "ih4t");
481
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 4 times.
9 if (c == -1)
482 5 break;
483
2/4
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
4 switch (c) {
484 3 case 'i':
485 3 test_idct = 1;
486 3 break;
487 1 case '4':
488 1 test_248_dct = 1;
489 1 break;
490 case 't':
491 speed = 1;
492 break;
493 default:
494 case 'h':
495 help();
496 return 0;
497 }
498 }
499
500
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 2 times.
5 if (optind < argc)
501 3 test = atoi(argv[optind]);
502
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5 times.
5 if(optind+1 < argc) bits= atoi(argv[optind+1]);
503
504 5 printf("ffmpeg DCT/IDCT test\n");
505
506
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 4 times.
5 if (test_248_dct) {
507 1 idct248_error("SIMPLE-C", ff_simple_idct248_put, speed);
508 } else {
509 4 const int cpu_flags = av_get_cpu_flags();
510
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1 times.
4 if (test_idct) {
511
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 3 times.
27 for (i = 0; i < FF_ARRAY_ELEMS(idct_tab); i++)
512 24 err |= dct_error(&idct_tab[i], test, test_idct, speed, bits);
513
514
2/2
✓ Branch 0 taken 27 times.
✓ Branch 1 taken 3 times.
30 for (i = 0; idct_tab_arch[i].name; i++)
515
1/2
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
27 if (!(~cpu_flags & idct_tab_arch[i].cpu_flag))
516 27 err |= dct_error(&idct_tab_arch[i], test, test_idct, speed, bits);
517 }
518 #if CONFIG_FDCTDSP
519 else {
520
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 1 times.
5 for (i = 0; i < FF_ARRAY_ELEMS(fdct_tab); i++)
521 4 err |= dct_error(&fdct_tab[i], test, test_idct, speed, bits);
522
523
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 1 times.
2 for (i = 0; fdct_tab_arch[i].name; i++)
524
1/2
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
1 if (!(~cpu_flags & fdct_tab_arch[i].cpu_flag))
525 1 err |= dct_error(&fdct_tab_arch[i], test, test_idct, speed, bits);
526 }
527 #endif /* CONFIG_FDCTDSP */
528 }
529
530
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5 times.
5 if (err)
531 printf("Error: %d.\n", err);
532
533 5 return !!err;
534 }
535