Coverage Report

Created: 2026-09-14 08:00

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/ffmpeg/libavutil/md5.c
Line
Count
Source
1
/*
2
 * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
3
 * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
4
 *
5
 * References:
6
 *  IETF RFC 1321: The MD5 Message-Digest Algorithm
7
 *       Ron Rivest. IETF, April, 1992
8
 *
9
 * based on http://ubiqx.org/libcifs/source/Auth/MD5.c
10
 *          from Christopher R. Hertel (crh@ubiqx.mn.org)
11
 * Simplified, cleaned and IMO redundant comments removed by Michael.
12
 *
13
 * If you use gcc, then version 4.1 or later and -fomit-frame-pointer is
14
 * strongly recommended.
15
 *
16
 * This file is part of FFmpeg.
17
 *
18
 * FFmpeg is free software; you can redistribute it and/or
19
 * modify it under the terms of the GNU Lesser General Public
20
 * License as published by the Free Software Foundation; either
21
 * version 2.1 of the License, or (at your option) any later version.
22
 *
23
 * FFmpeg is distributed in the hope that it will be useful,
24
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
25
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
26
 * Lesser General Public License for more details.
27
 *
28
 * You should have received a copy of the GNU Lesser General Public
29
 * License along with FFmpeg; if not, write to the Free Software
30
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
31
 */
32
33
#include <stdint.h>
34
#include <string.h>
35
36
#include "bswap.h"
37
#include "intreadwrite.h"
38
#include "macros.h"
39
#include "mem.h"
40
#include "md5.h"
41
42
typedef struct AVMD5 {
43
    uint64_t len;
44
    uint8_t  block[64];
45
    uint32_t ABCD[4];
46
} AVMD5;
47
48
const int av_md5_size = sizeof(AVMD5);
49
50
struct AVMD5 *av_md5_alloc(void)
51
41.5k
{
52
41.5k
    return av_mallocz(sizeof(struct AVMD5));
53
41.5k
}
54
55
static const uint8_t S[4][4] = {
56
    { 7, 12, 17, 22 },  /* round 1 */
57
    { 5,  9, 14, 20 },  /* round 2 */
58
    { 4, 11, 16, 23 },  /* round 3 */
59
    { 6, 10, 15, 21 }   /* round 4 */
60
};
61
62
static const uint32_t T[64] = { // T[i]= fabs(sin(i+1)<<32)
63
    0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,   /* round 1 */
64
    0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
65
    0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
66
    0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
67
68
    0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,   /* round 2 */
69
    0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
70
    0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
71
    0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
72
73
    0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,   /* round 3 */
74
    0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
75
    0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
76
    0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
77
78
    0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,   /* round 4 */
79
    0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
80
    0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
81
    0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
82
};
83
84
#define CORE(i, a, b, c, d)                                             \
85
925M
    do {                                                                \
86
925M
        t  = S[i >> 4][i & 3];                                          \
87
925M
        a += T[i];                                                      \
88
925M
                                                                        \
89
925M
        if (i < 32) {                                                   \
90
462M
            if (i < 16)                                                 \
91
462M
                a += (d ^ (b & (c ^ d)))  + AV_RL32(X+(       i  & 15));\
92
462M
            else                                                        \
93
462M
                a += ((d & b) | (~d & c)) + AV_RL32(X+((1 + 5*i) & 15));\
94
462M
        } else {                                                        \
95
462M
            if (i < 48)                                                 \
96
462M
                a += (b ^ c ^ d)          + AV_RL32(X+((5 + 3*i) & 15));\
97
462M
            else                                                        \
98
462M
                a += (c ^ (b | ~d))       + AV_RL32(X+((    7*i) & 15));\
99
462M
        }                                                               \
100
925M
        a = b + (a << t | a >> (32 - t));                               \
101
925M
    } while (0)
102
103
static void body(uint32_t ABCD[4], const uint8_t *src, size_t nblocks)
104
20.5M
{
105
20.5M
    const uint32_t *X;
106
20.5M
    uint32_t a, b, c, d, t;
107
108
34.9M
    for (size_t n = 0; n < nblocks; n++) {
109
14.4M
        a = ABCD[3];
110
14.4M
        b = ABCD[2];
111
14.4M
        c = ABCD[1];
112
14.4M
        d = ABCD[0];
113
114
14.4M
        X = (const uint32_t *)src + n * 16;
115
116
#if CONFIG_SMALL
117
        for (int i = 0; i < 64; i++) {
118
            CORE(i, a, b, c, d);
119
            t = d;
120
            d = c;
121
            c = b;
122
            b = a;
123
            a = t;
124
        }
125
#else
126
14.4M
#define CORE2(i)                                                        \
127
231M
        CORE(i, a, b, c, d); CORE((i + 1), d, a, b, c);                 \
128
231M
        CORE((i + 2), c, d, a, b); CORE((i + 3), b, c, d, a)
129
57.8M
#define CORE4(i) CORE2(i); CORE2((i + 4)); CORE2((i + 8)); CORE2((i + 12))
130
14.4M
        CORE4(0);
131
14.4M
        CORE4(16);
132
14.4M
        CORE4(32);
133
14.4M
        CORE4(48);
134
14.4M
#endif
135
136
14.4M
        ABCD[0] += d;
137
14.4M
        ABCD[1] += c;
138
14.4M
        ABCD[2] += b;
139
14.4M
        ABCD[3] += a;
140
14.4M
    }
141
20.5M
}
142
143
void av_md5_init(AVMD5 *ctx)
144
6.31M
{
145
6.31M
    ctx->len     = 0;
146
147
6.31M
    ctx->ABCD[0] = 0x10325476;
148
6.31M
    ctx->ABCD[1] = 0x98badcfe;
149
6.31M
    ctx->ABCD[2] = 0xefcdab89;
150
6.31M
    ctx->ABCD[3] = 0x67452301;
151
6.31M
}
152
153
void av_md5_update(AVMD5 *ctx, const uint8_t *src, size_t len)
154
266M
{
155
266M
    const uint8_t *end;
156
266M
    int j;
157
158
266M
    j         = ctx->len & 63;
159
266M
    ctx->len += len;
160
161
266M
    if (j) {
162
259M
        int cnt = FFMIN(len, 64 - j);
163
259M
        memcpy(ctx->block + j, src, cnt);
164
259M
        src += cnt;
165
259M
        len -= cnt;
166
259M
        if (j + cnt < 64)
167
252M
            return;
168
6.81M
        body(ctx->ABCD, ctx->block, 1);
169
6.81M
    }
170
171
13.6M
    end = src + (len & ~63);
172
13.6M
    if (!HAVE_FAST_UNALIGNED && ((intptr_t)src & 3)) {
173
0
       while (src < end) {
174
0
           memcpy(ctx->block, src, 64);
175
0
           body(ctx->ABCD, ctx->block, 1);
176
0
           src += 64;
177
0
        }
178
13.6M
    } else {
179
13.6M
        size_t nblocks = len / 64;
180
13.6M
        body(ctx->ABCD, src, nblocks);
181
13.6M
        src = end;
182
13.6M
    }
183
13.6M
    len &= 63;
184
13.6M
    if (len > 0)
185
6.81M
        memcpy(ctx->block, src, len);
186
13.6M
}
187
188
void av_md5_final(AVMD5 *ctx, uint8_t *dst)
189
6.31M
{
190
6.31M
    int i;
191
6.31M
    uint64_t finalcount = av_le2ne64(ctx->len << 3);
192
193
6.31M
    av_md5_update(ctx, "\200", 1);
194
252M
    while ((ctx->len & 63) != 56)
195
246M
        av_md5_update(ctx, "", 1);
196
197
6.31M
    av_md5_update(ctx, (uint8_t *) &finalcount, 8);
198
199
31.5M
    for (i = 0; i < 4; i++)
200
25.2M
        AV_WL32(dst + 4 * i, ctx->ABCD[3 - i]);
201
6.31M
}
202
203
void av_md5_sum(uint8_t *dst, const uint8_t *src, size_t len)
204
6.30M
{
205
6.30M
    AVMD5 ctx;
206
207
6.30M
    av_md5_init(&ctx);
208
6.30M
    av_md5_update(&ctx, src, len);
209
6.30M
    av_md5_final(&ctx, dst);
210
6.30M
}