Coverage Report

Created: 2026-07-25 06:42

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/botan/src/lib/hash/md5/md5.cpp
Line
Count
Source
1
/*
2
* MD5
3
* (C) 1999-2008 Jack Lloyd
4
*
5
* Botan is released under the Simplified BSD License (see license.txt)
6
*/
7
8
#include <botan/internal/md5.h>
9
10
#include <botan/internal/bit_ops.h>
11
#include <botan/internal/loadstor.h>
12
#include <botan/internal/rotate.h>
13
#include <botan/internal/stl_util.h>
14
15
#include <array>
16
17
namespace Botan {
18
namespace {
19
20
/*
21
* MD5 FF Function
22
*/
23
template <size_t S>
24
3.04M
inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
25
3.04M
   A += choose(B, C, D) + M;
26
3.04M
   A = rotl<S>(A) + B;
27
3.04M
}
md5.cpp:void Botan::(anonymous namespace)::FF<7ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
24
762k
inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
25
762k
   A += choose(B, C, D) + M;
26
762k
   A = rotl<S>(A) + B;
27
762k
}
md5.cpp:void Botan::(anonymous namespace)::FF<12ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
24
762k
inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
25
762k
   A += choose(B, C, D) + M;
26
762k
   A = rotl<S>(A) + B;
27
762k
}
md5.cpp:void Botan::(anonymous namespace)::FF<17ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
24
762k
inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
25
762k
   A += choose(B, C, D) + M;
26
762k
   A = rotl<S>(A) + B;
27
762k
}
md5.cpp:void Botan::(anonymous namespace)::FF<22ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
24
762k
inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
25
762k
   A += choose(B, C, D) + M;
26
762k
   A = rotl<S>(A) + B;
27
762k
}
28
29
/*
30
* MD5 GG Function
31
*/
32
template <size_t S>
33
3.04M
inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
34
3.04M
   A += choose(D, B, C) + M;
35
3.04M
   A = rotl<S>(A) + B;
36
3.04M
}
md5.cpp:void Botan::(anonymous namespace)::GG<5ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
33
762k
inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
34
762k
   A += choose(D, B, C) + M;
35
762k
   A = rotl<S>(A) + B;
36
762k
}
md5.cpp:void Botan::(anonymous namespace)::GG<9ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
33
762k
inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
34
762k
   A += choose(D, B, C) + M;
35
762k
   A = rotl<S>(A) + B;
36
762k
}
md5.cpp:void Botan::(anonymous namespace)::GG<14ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
33
762k
inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
34
762k
   A += choose(D, B, C) + M;
35
762k
   A = rotl<S>(A) + B;
36
762k
}
md5.cpp:void Botan::(anonymous namespace)::GG<20ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
33
762k
inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
34
762k
   A += choose(D, B, C) + M;
35
762k
   A = rotl<S>(A) + B;
36
762k
}
37
38
/*
39
* MD5 HH Function
40
*/
41
template <size_t S>
42
3.04M
inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
43
3.04M
   A += (B ^ C ^ D) + M;
44
3.04M
   A = rotl<S>(A) + B;
45
3.04M
}
md5.cpp:void Botan::(anonymous namespace)::HH<4ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
42
762k
inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
43
762k
   A += (B ^ C ^ D) + M;
44
762k
   A = rotl<S>(A) + B;
45
762k
}
md5.cpp:void Botan::(anonymous namespace)::HH<11ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
42
762k
inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
43
762k
   A += (B ^ C ^ D) + M;
44
762k
   A = rotl<S>(A) + B;
45
762k
}
md5.cpp:void Botan::(anonymous namespace)::HH<16ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
42
762k
inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
43
762k
   A += (B ^ C ^ D) + M;
44
762k
   A = rotl<S>(A) + B;
45
762k
}
md5.cpp:void Botan::(anonymous namespace)::HH<23ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
42
762k
inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
43
762k
   A += (B ^ C ^ D) + M;
44
762k
   A = rotl<S>(A) + B;
45
762k
}
46
47
/*
48
* MD5 II Function
49
*/
50
template <size_t S>
51
3.04M
inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
52
   // This expr is choose(D, B ^ C, ~C), but that is slower
53
3.04M
   A += (C ^ (B | ~D)) + M;
54
3.04M
   A = rotl<S>(A) + B;
55
3.04M
}
md5.cpp:void Botan::(anonymous namespace)::II<6ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
51
762k
inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
52
   // This expr is choose(D, B ^ C, ~C), but that is slower
53
762k
   A += (C ^ (B | ~D)) + M;
54
762k
   A = rotl<S>(A) + B;
55
762k
}
md5.cpp:void Botan::(anonymous namespace)::II<10ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
51
762k
inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
52
   // This expr is choose(D, B ^ C, ~C), but that is slower
53
762k
   A += (C ^ (B | ~D)) + M;
54
762k
   A = rotl<S>(A) + B;
55
762k
}
md5.cpp:void Botan::(anonymous namespace)::II<15ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
51
762k
inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
52
   // This expr is choose(D, B ^ C, ~C), but that is slower
53
762k
   A += (C ^ (B | ~D)) + M;
54
762k
   A = rotl<S>(A) + B;
55
762k
}
md5.cpp:void Botan::(anonymous namespace)::II<21ul>(unsigned int&, unsigned int, unsigned int, unsigned int, unsigned int)
Line
Count
Source
51
762k
inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
52
   // This expr is choose(D, B ^ C, ~C), but that is slower
53
762k
   A += (C ^ (B | ~D)) + M;
54
762k
   A = rotl<S>(A) + B;
55
762k
}
56
57
}  // namespace
58
59
/*
60
* MD5 Compression Function
61
*/
62
24.8k
void MD5::compress_n(MD5::digest_type& digest, std::span<const uint8_t> input, size_t blocks) {
63
24.8k
   uint32_t A = digest[0];
64
24.8k
   uint32_t B = digest[1];
65
24.8k
   uint32_t C = digest[2];
66
24.8k
   uint32_t D = digest[3];
67
24.8k
   std::array<uint32_t, 16> M{};
68
69
24.8k
   BufferSlicer in(input);
70
71
215k
   for(size_t i = 0; i != blocks; ++i) {
72
190k
      load_le(M, in.take<block_bytes>());
73
74
      // clang-format off
75
76
190k
      FF< 7>(A, B, C, D, M[ 0] + 0xD76AA478);
77
190k
      FF<12>(D, A, B, C, M[ 1] + 0xE8C7B756);
78
190k
      FF<17>(C, D, A, B, M[ 2] + 0x242070DB);
79
190k
      FF<22>(B, C, D, A, M[ 3] + 0xC1BDCEEE);
80
190k
      FF< 7>(A, B, C, D, M[ 4] + 0xF57C0FAF);
81
190k
      FF<12>(D, A, B, C, M[ 5] + 0x4787C62A);
82
190k
      FF<17>(C, D, A, B, M[ 6] + 0xA8304613);
83
190k
      FF<22>(B, C, D, A, M[ 7] + 0xFD469501);
84
190k
      FF< 7>(A, B, C, D, M[ 8] + 0x698098D8);
85
190k
      FF<12>(D, A, B, C, M[ 9] + 0x8B44F7AF);
86
190k
      FF<17>(C, D, A, B, M[10] + 0xFFFF5BB1);
87
190k
      FF<22>(B, C, D, A, M[11] + 0x895CD7BE);
88
190k
      FF< 7>(A, B, C, D, M[12] + 0x6B901122);
89
190k
      FF<12>(D, A, B, C, M[13] + 0xFD987193);
90
190k
      FF<17>(C, D, A, B, M[14] + 0xA679438E);
91
190k
      FF<22>(B, C, D, A, M[15] + 0x49B40821);
92
93
190k
      GG< 5>(A, B, C, D, M[ 1] + 0xF61E2562);
94
190k
      GG< 9>(D, A, B, C, M[ 6] + 0xC040B340);
95
190k
      GG<14>(C, D, A, B, M[11] + 0x265E5A51);
96
190k
      GG<20>(B, C, D, A, M[ 0] + 0xE9B6C7AA);
97
190k
      GG< 5>(A, B, C, D, M[ 5] + 0xD62F105D);
98
190k
      GG< 9>(D, A, B, C, M[10] + 0x02441453);
99
190k
      GG<14>(C, D, A, B, M[15] + 0xD8A1E681);
100
190k
      GG<20>(B, C, D, A, M[ 4] + 0xE7D3FBC8);
101
190k
      GG< 5>(A, B, C, D, M[ 9] + 0x21E1CDE6);
102
190k
      GG< 9>(D, A, B, C, M[14] + 0xC33707D6);
103
190k
      GG<14>(C, D, A, B, M[ 3] + 0xF4D50D87);
104
190k
      GG<20>(B, C, D, A, M[ 8] + 0x455A14ED);
105
190k
      GG< 5>(A, B, C, D, M[13] + 0xA9E3E905);
106
190k
      GG< 9>(D, A, B, C, M[ 2] + 0xFCEFA3F8);
107
190k
      GG<14>(C, D, A, B, M[ 7] + 0x676F02D9);
108
190k
      GG<20>(B, C, D, A, M[12] + 0x8D2A4C8A);
109
110
190k
      HH< 4>(A, B, C, D, M[ 5] + 0xFFFA3942);
111
190k
      HH<11>(D, A, B, C, M[ 8] + 0x8771F681);
112
190k
      HH<16>(C, D, A, B, M[11] + 0x6D9D6122);
113
190k
      HH<23>(B, C, D, A, M[14] + 0xFDE5380C);
114
190k
      HH< 4>(A, B, C, D, M[ 1] + 0xA4BEEA44);
115
190k
      HH<11>(D, A, B, C, M[ 4] + 0x4BDECFA9);
116
190k
      HH<16>(C, D, A, B, M[ 7] + 0xF6BB4B60);
117
190k
      HH<23>(B, C, D, A, M[10] + 0xBEBFBC70);
118
190k
      HH< 4>(A, B, C, D, M[13] + 0x289B7EC6);
119
190k
      HH<11>(D, A, B, C, M[ 0] + 0xEAA127FA);
120
190k
      HH<16>(C, D, A, B, M[ 3] + 0xD4EF3085);
121
190k
      HH<23>(B, C, D, A, M[ 6] + 0x04881D05);
122
190k
      HH< 4>(A, B, C, D, M[ 9] + 0xD9D4D039);
123
190k
      HH<11>(D, A, B, C, M[12] + 0xE6DB99E5);
124
190k
      HH<16>(C, D, A, B, M[15] + 0x1FA27CF8);
125
190k
      HH<23>(B, C, D, A, M[ 2] + 0xC4AC5665);
126
127
190k
      II< 6>(A, B, C, D, M[ 0] + 0xF4292244);
128
190k
      II<10>(D, A, B, C, M[ 7] + 0x432AFF97);
129
190k
      II<15>(C, D, A, B, M[14] + 0xAB9423A7);
130
190k
      II<21>(B, C, D, A, M[ 5] + 0xFC93A039);
131
190k
      II< 6>(A, B, C, D, M[12] + 0x655B59C3);
132
190k
      II<10>(D, A, B, C, M[ 3] + 0x8F0CCC92);
133
190k
      II<15>(C, D, A, B, M[10] + 0xFFEFF47D);
134
190k
      II<21>(B, C, D, A, M[ 1] + 0x85845DD1);
135
190k
      II< 6>(A, B, C, D, M[ 8] + 0x6FA87E4F);
136
190k
      II<10>(D, A, B, C, M[15] + 0xFE2CE6E0);
137
190k
      II<15>(C, D, A, B, M[ 6] + 0xA3014314);
138
190k
      II<21>(B, C, D, A, M[13] + 0x4E0811A1);
139
190k
      II< 6>(A, B, C, D, M[ 4] + 0xF7537E82);
140
190k
      II<10>(D, A, B, C, M[11] + 0xBD3AF235);
141
190k
      II<15>(C, D, A, B, M[ 2] + 0x2AD7D2BB);
142
190k
      II<21>(B, C, D, A, M[ 9] + 0xEB86D391);
143
144
      // clang-format off
145
146
190k
      A = (digest[0] += A);
147
190k
      B = (digest[1] += B);
148
190k
      C = (digest[2] += C);
149
190k
      D = (digest[3] += D);
150
190k
   }
151
24.8k
}
152
153
11.4k
void MD5::init(digest_type& digest) {
154
11.4k
   digest.assign({0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476});
155
11.4k
}
156
157
128
std::unique_ptr<HashFunction> MD5::new_object() const {
158
128
   return std::make_unique<MD5>();
159
128
}
160
161
0
std::unique_ptr<HashFunction> MD5::copy_state() const {
162
0
   return std::make_unique<MD5>(*this);
163
0
}
164
165
45.9k
void MD5::add_data(std::span<const uint8_t> input) {
166
45.9k
   m_md.update(input);
167
45.9k
}
168
169
10.4k
void MD5::final_result(std::span<uint8_t> output) {
170
10.4k
   m_md.final(output);
171
10.4k
}
172
173
}  // namespace Botan