FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/tests/checkasm/aes.c
Date: 2025-04-25 22:50:00
Exec Total Coverage
Lines: 22 26 84.6%
Functions: 1 1 100.0%
Branches: 19 30 63.3%

Line Branch Exec Source
1 /*
2 * Copyright (c) 2015 Rodger Combs <rodger.combs@gmail.com>
3 *
4 * This file is part of FFmpeg.
5 *
6 * FFmpeg is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License along
17 * with FFmpeg; if not, write to the Free Software Foundation, Inc.,
18 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
19 */
20
21 #include "checkasm.h"
22 #include "libavutil/aes.h"
23 #include "libavutil/aes_internal.h"
24 #include "libavutil/internal.h"
25
26 #define MAX_COUNT 16
27
28 13 void checkasm_check_aes(void)
29 {
30 int i, j, d;
31 AVAES b;
32 uint8_t pt[MAX_COUNT * 16];
33 uint8_t temp[2][MAX_COUNT * 16];
34 uint8_t iv[2][16];
35
36
2/2
✓ Branch 0 taken 26 times.
✓ Branch 1 taken 13 times.
39 for (d = 0; d <= 1; d++) {
37
2/2
✓ Branch 0 taken 78 times.
✓ Branch 1 taken 26 times.
104 for (i = 128; i <= 256; i += 64) {
38 78 av_aes_init(&b, (const uint8_t*)"PI=3.1415926535897932384626433..", i, d);
39
4/4
✓ Branch 2 taken 39 times.
✓ Branch 3 taken 39 times.
✓ Branch 5 taken 12 times.
✓ Branch 6 taken 66 times.
78 if (check_func(b.crypt, "aes_%scrypt_%i", d ? "de" : "en", i)) {
40 12 declare_func(void, AVAES *a, uint8_t *dst, const uint8_t *src,
41 int count, uint8_t *iv, int rounds);
42 12 int count = (rnd() & (MAX_COUNT - 1)) + 1;
43
2/2
✓ Branch 0 taken 3072 times.
✓ Branch 1 taken 12 times.
3084 for (j = 0; j < 16 * MAX_COUNT; j++)
44 3072 pt[j] = rnd();
45
2/2
✓ Branch 0 taken 192 times.
✓ Branch 1 taken 12 times.
204 for (j = 0; j < 16; j++)
46 192 iv[0][j] = iv[1][j] = rnd();
47 12 call_ref(&b, temp[0], pt, count, iv[0], b.rounds);
48 12 call_new(&b, temp[1], pt, count, iv[1], b.rounds);
49
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
12 if (memcmp(temp[0], temp[1], sizeof(16 * count)))
50 fail();
51
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
12 if (memcmp(iv[0], iv[1], sizeof(iv[0])))
52 fail();
53 12 call_ref(&b, temp[0], pt, count, NULL, b.rounds);
54 12 call_new(&b, temp[1], pt, count, NULL, b.rounds);
55
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
12 if (memcmp(temp[0], temp[1], sizeof(16 * count)))
56 fail();
57
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
12 if (memcmp(iv[0], iv[1], sizeof(iv[0])))
58 fail();
59
1/8
✗ Branch 1 not taken.
✓ Branch 2 taken 12 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
✗ Branch 13 not taken.
✗ Branch 14 not taken.
✗ Branch 15 not taken.
✗ Branch 16 not taken.
12 bench_new(&b, temp[1], pt, MAX_COUNT, NULL, b.rounds);
60 }
61 }
62
2/2
✓ Branch 0 taken 13 times.
✓ Branch 1 taken 13 times.
26 report("%scrypt", d ? "de" : "en");
63 }
64 13 }
65