Bug Summary

File:rootdir/src/libs/common/MD5Sum.cpp
Warning:line 187, column 67
Access of 'PADDING' at an overflowing index, while it holds only 64 'unsigned char' elements

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name MD5Sum.cpp -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -pic-is-pie -mframe-pointer=all -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fdebug-compilation-dir=/rootdir/src/libs/common -fcoverage-compilation-dir=/rootdir/src/libs/common -resource-dir /usr/lib/llvm-19/lib/clang/19 -D HAVE_CONFIG_H -I . -I ../../.. -D USE_WX_EXTENSIONS -D HAVE_BFD -I /usr/lib/x86_64-linux-gnu/wx/include/gtk3-unicode-3.2 -I /usr/include/wx-3.2 -D _FILE_OFFSET_BITS=64 -D WXUSINGDLL -D __WXGTK__ -D wxUSE_GUI=0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/14/../../../../include/c++/14 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/14/../../../../include/x86_64-linux-gnu/c++/14 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/14/../../../../include/c++/14/backward -internal-isystem /usr/lib/llvm-19/lib/clang/19/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/14/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -Wno-register -fdeprecated-macro -ferror-limit 19 -fgnuc-version=4.2.1 -fskip-odr-check-in-gmf -fcxx-exceptions -fexceptions -analyzer-checker deadcode.DeadStores -analyzer-checker alpha.deadcode.UnreachableCode -analyzer-checker alpha.core.CastSize -analyzer-checker alpha.core.CastToStruct -analyzer-checker alpha.core.IdenticalExpr -analyzer-checker alpha.security.ArrayBoundV2 -analyzer-checker alpha.security.MallocOverflow -analyzer-checker alpha.security.ReturnPtrRange -analyzer-checker alpha.unix.SimpleStream -analyzer-checker alpha.unix.cstring.BufferOverlap -analyzer-checker alpha.unix.cstring.NotNullTerminated -analyzer-checker alpha.unix.cstring.OutOfBounds -analyzer-checker alpha.core.FixedAddr -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /rootdir/html-report/2024-12-16-222823-17165-1 -x c++ MD5Sum.cpp
1//
2// This file is part of the aMule Project.
3//
4// Copyright (c) 2003-2011 aMule Team ( admin@amule.org / http://www.amule.org )
5//
6// Any parts of this program derived from the xMule, lMule or eMule project,
7// or contributed by third-party developers are copyrighted by their
8// respective authors.
9//
10// This program is free software; you can redistribute it and/or modify
11// it under the terms of the GNU General Public License as published by
12// the Free Software Foundation; either version 2 of the License, or
13// (at your option) any later version.
14//
15// This program is distributed in the hope that it will be useful,
16// but WITHOUT ANY WARRANTY; without even the implied warranty of
17// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18// GNU General Public License for more details.
19//
20// You should have received a copy of the GNU General Public License
21// along with this program; if not, write to the Free Software
22// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
23//
24
25
26#include "StringFunctions.h"
27#include "Format.h" // Needed for CFormat
28
29#include "MD5Sum.h" // Interface declarations.
30
31typedef struct {
32 uint32_t state[4];
33 uint32_t count[2];
34 unsigned char buffer[64];
35} MD5_CTX;
36
37void MD5Init (MD5_CTX *);
38void MD5Update (MD5_CTX *, const unsigned char *, size_t);
39void MD5Final (unsigned char [16], MD5_CTX *);
40
41MD5Sum::MD5Sum()
42{
43}
44
45MD5Sum::MD5Sum(const wxString& sSource)
46{
47 Calculate(sSource);
48}
49
50MD5Sum::MD5Sum(const uint8* buffer, size_t len)
51{
52 Calculate(buffer, len);
1
Calling 'MD5Sum::Calculate'
→
53}
54
55void MD5Sum::Calculate(const wxString& sSource)
56{
57 // Nothing we can do against this unicode2char
58 Calculate( (const uint8*)(const char*)unicode2char(sSource), sSource.Length());
59}
60
61void MD5Sum::Calculate(const uint8* buffer, size_t len)
62{
63 MD5_CTX context;
64 unsigned char digest[16];
65
66 MD5Init (&context);
67 MD5Update (&context, buffer, len);
2
←
Calling 'MD5Update'
→
6
←
Returning from 'MD5Update'
→
68 MD5Final (digest, &context);
7
←
Calling 'MD5Final'
→
69
70 memcpy(m_rawhash, digest, 16);
71 m_sHash.Clear();
72}
73
74wxString MD5Sum::GetHash()
75{
76 if (m_sHash.empty()) {
77 // That's still far from optimal, but called much less often.
78 for (int i = 0; i < 16; ++i) {
79 wxString sT;
80 sT = CFormat(wxT("%02x")L"%02x") % m_rawhash[i];
81 m_sHash += sT;
82 }
83 }
84 return m_sHash;
85}
86
87#define S117 7
88#define S1212 12
89#define S1317 17
90#define S1422 22
91#define S215 5
92#define S229 9
93#define S2314 14
94#define S2420 20
95#define S314 4
96#define S3211 11
97#define S3316 16
98#define S3423 23
99#define S416 6
100#define S4210 10
101#define S4315 15
102#define S4421 21
103
104static void MD5Transform (uint32_t [4], const unsigned char [64]);
105static void Encode (unsigned char *, uint32_t *, size_t);
106static void Decode (uint32_t *, const unsigned char *, size_t);
107
108static const unsigned char PADDING[64] = {
109 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
110 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
111 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
112};
113
114/* F, G, H and I are basic MD5 functions.
115 */
116#define F(x, y, z)(((x) & (y)) | ((~x) & (z))) (((x) & (y)) | ((~x) & (z)))
117#define G(x, y, z)(((x) & (z)) | ((y) & (~z))) (((x) & (z)) | ((y) & (~z)))
118#define H(x, y, z)((x) ^ (y) ^ (z)) ((x) ^ (y) ^ (z))
119#define I(x, y, z)((y) ^ ((x) | (~z))) ((y) ^ ((x) | (~z)))
120
121/* ROTATE_LEFT rotates x left n bits.
122 15-April-2003 Sony: use _MSC_VER intrinsic to save some cycles
123 */
124#ifdef _MSC_VER
125#pragma intrinsic(_rotl)
126#define ROTATE_LEFT(x, n)(((x) << (n)) | ((x) >> (32-(n)))) _rotl((x), (n))
127#else
128#define ROTATE_LEFT(x, n)(((x) << (n)) | ((x) >> (32-(n)))) (((x) << (n)) | ((x) >> (32-(n))))
129#endif
130
131/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
132Rotation is separate from addition to prevent recomputation.
133*/
134/* Defines must be on one line to work with GCC-2.95.3 */
135#define FF(a, b, c, d, x, s, ac){ (a) += ((((b)) & ((c))) | ((~(b)) & ((d)))) + (x) +
(uint32_t)(ac); (a) = ((((a)) << ((s))) | (((a)) >>
(32-((s))))); (a) += (b); } { (a) += F ((b), (c), (d))((((b)) & ((c))) | ((~(b)) & ((d)))) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT ((a), (s))((((a)) << ((s))) | (((a)) >> (32-((s))))); (a) += (b); }
136#define GG(a, b, c, d, x, s, ac){ (a) += ((((b)) & ((d))) | (((c)) & (~(d)))) + (x) +
(uint32_t)(ac); (a) = ((((a)) << ((s))) | (((a)) >>
(32-((s))))); (a) += (b); } { (a) += G ((b), (c), (d))((((b)) & ((d))) | (((c)) & (~(d)))) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT ((a), (s))((((a)) << ((s))) | (((a)) >> (32-((s))))); (a) += (b); }
137#define HH(a, b, c, d, x, s, ac){ (a) += (((b)) ^ ((c)) ^ ((d))) + (x) + (uint32_t)(ac); (a) =
((((a)) << ((s))) | (((a)) >> (32-((s))))); (a) +=
(b); } { (a) += H ((b), (c), (d))(((b)) ^ ((c)) ^ ((d))) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT ((a), (s))((((a)) << ((s))) | (((a)) >> (32-((s))))); (a) += (b); }
138#define II(a, b, c, d, x, s, ac){ (a) += (((c)) ^ (((b)) | (~(d)))) + (x) + (uint32_t)(ac); (
a) = ((((a)) << ((s))) | (((a)) >> (32-((s))))); (
a) += (b); } { (a) += I ((b), (c), (d))(((c)) ^ (((b)) | (~(d)))) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT ((a), (s))((((a)) << ((s))) | (((a)) >> (32-((s))))); (a) += (b); }
139
140/* MD5 initialization. Begins an MD5 operation, writing a new context.
141 */
142void MD5Init (MD5_CTX *context)
143{
144 context->count[0] = context->count[1] = 0;
145 /* Load magic initialization constants.
146*/
147 context->state[0] = 0x67452301;
148 context->state[1] = 0xefcdab89;
149 context->state[2] = 0x98badcfe;
150 context->state[3] = 0x10325476;
151}
152
153/* MD5 block update operation. Continues an MD5 message-digest
154 operation, processing another message block, and updating the
155 context.
156 */
157void MD5Update (MD5_CTX *context, const unsigned char *input, size_t inputLen)
158{
159 off_t index;
160 size_t i, partLen;
161
162 /* Compute number of bytes mod 64 */
163 index = (context->count[0] >> 3) & 0x3F;
164
165 /* Update number of bits */
166 if ((context->count[0] += ((uint32_t)inputLen << 3)) < ((uint32_t)inputLen << 3)) {
3
←
Taking false branch
→
11
←
Assuming the condition is false
→
12
←
Taking false branch
→
167 context->count[1]++;
168 }
169
170 context->count[1] += ((uint32_t)inputLen >> 29);
171 partLen = 64 - index;
172
173 /* Transform as many times as possible. */
174 if (inputLen >= partLen) {
4
←
Assuming 'inputLen' is < 'partLen'
→
5
←
Taking false branch
→
13
←
Assuming 'inputLen' is >= 'partLen'
→
14
←
Taking true branch
→
175 memcpy((unsigned char*)&context->buffer[index], (unsigned char*)input, partLen);
176 MD5Transform (context->state, context->buffer);
177
178 for (i = partLen; i + 63 < inputLen; i += 64) {
15
←
Assuming the condition is true
→
16
←
Loop condition is true. Entering loop body
→
18
←
Assuming the condition is false
→
19
←
Loop condition is false. Execution continues on line 181
→
179 MD5Transform (context->state, &input[i]);
17
←
Assuming index is less than 64, the number of 'const unsigned char' elements in 'PADDING'
→
180 }
181 index = 0;
182 } else {
183 i = 0;
184 }
185
186 /* Buffer remaining input */
187 memcpy((unsigned char*)&context->buffer[index], (unsigned char*)&input[i], inputLen-i);
20
←
Access of 'PADDING' at an overflowing index, while it holds only 64 'unsigned char' elements
188}
189
190/* MD5 finalization. Ends an MD5 message-digest operation, writing the
191 * the message digest and zeroizing the context.
192 */
193void MD5Final (unsigned char digest[16], MD5_CTX *context)
194{
195 unsigned char bits[8];
196 off_t index;
197 size_t padLen;
198
199 /* Save number of bits */
200 Encode (bits, context->count, 8);
201
202 /* Pad out to 56 mod 64. */
203 index = (context->count[0] >> 3) & 0x3f;
204
205 padLen = (index < 56) ? (56 - index) : (120 - index);
8
←
Assuming 'index' is < 56
→
9
←
'?' condition is true
→
206
207 MD5Update (context, PADDING, padLen);
10
←
Calling 'MD5Update'
→
208
209 /* Append length (before padding) */
210 MD5Update (context, bits, 8);
211
212 /* Store state in digest */
213 Encode (digest, context->state, 16);
214
215 /* Zeroize sensitive information.*/
216 memset((unsigned char*)context, 0, sizeof (*context));
217}
218
219/* MD5 basic transformation. Transforms state based on block.
220 */
221static void MD5Transform (uint32_t state[4], const unsigned char block[64])
222{
223 uint32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];
224
225 Decode (x, block, 64);
226
227 /* Round 1 */
228 FF (a, b, c, d, x[ 0], S11, 0xd76aa478){ (a) += ((((b)) & ((c))) | ((~(b)) & ((d)))) + (x[ 0
]) + (uint32_t)(0xd76aa478); (a) = ((((a)) << ((7))) | (
((a)) >> (32-((7))))); (a) += (b); }; /* 1 */
229 FF (d, a, b, c, x[ 1], S12, 0xe8c7b756){ (d) += ((((a)) & ((b))) | ((~(a)) & ((c)))) + (x[ 1
]) + (uint32_t)(0xe8c7b756); (d) = ((((d)) << ((12))) |
(((d)) >> (32-((12))))); (d) += (a); }; /* 2 */
230 FF (c, d, a, b, x[ 2], S13, 0x242070db){ (c) += ((((d)) & ((a))) | ((~(d)) & ((b)))) + (x[ 2
]) + (uint32_t)(0x242070db); (c) = ((((c)) << ((17))) |
(((c)) >> (32-((17))))); (c) += (d); }; /* 3 */
231 FF (b, c, d, a, x[ 3], S14, 0xc1bdceee){ (b) += ((((c)) & ((d))) | ((~(c)) & ((a)))) + (x[ 3
]) + (uint32_t)(0xc1bdceee); (b) = ((((b)) << ((22))) |
(((b)) >> (32-((22))))); (b) += (c); }; /* 4 */
232 FF (a, b, c, d, x[ 4], S11, 0xf57c0faf){ (a) += ((((b)) & ((c))) | ((~(b)) & ((d)))) + (x[ 4
]) + (uint32_t)(0xf57c0faf); (a) = ((((a)) << ((7))) | (
((a)) >> (32-((7))))); (a) += (b); }; /* 5 */
233 FF (d, a, b, c, x[ 5], S12, 0x4787c62a){ (d) += ((((a)) & ((b))) | ((~(a)) & ((c)))) + (x[ 5
]) + (uint32_t)(0x4787c62a); (d) = ((((d)) << ((12))) |
(((d)) >> (32-((12))))); (d) += (a); }; /* 6 */
234 FF (c, d, a, b, x[ 6], S13, 0xa8304613){ (c) += ((((d)) & ((a))) | ((~(d)) & ((b)))) + (x[ 6
]) + (uint32_t)(0xa8304613); (c) = ((((c)) << ((17))) |
(((c)) >> (32-((17))))); (c) += (d); }; /* 7 */
235 FF (b, c, d, a, x[ 7], S14, 0xfd469501){ (b) += ((((c)) & ((d))) | ((~(c)) & ((a)))) + (x[ 7
]) + (uint32_t)(0xfd469501); (b) = ((((b)) << ((22))) |
(((b)) >> (32-((22))))); (b) += (c); }; /* 8 */
236 FF (a, b, c, d, x[ 8], S11, 0x698098d8){ (a) += ((((b)) & ((c))) | ((~(b)) & ((d)))) + (x[ 8
]) + (uint32_t)(0x698098d8); (a) = ((((a)) << ((7))) | (
((a)) >> (32-((7))))); (a) += (b); }; /* 9 */
237 FF (d, a, b, c, x[ 9], S12, 0x8b44f7af){ (d) += ((((a)) & ((b))) | ((~(a)) & ((c)))) + (x[ 9
]) + (uint32_t)(0x8b44f7af); (d) = ((((d)) << ((12))) |
(((d)) >> (32-((12))))); (d) += (a); }; /* 10 */
238 FF (c, d, a, b, x[10], S13, 0xffff5bb1){ (c) += ((((d)) & ((a))) | ((~(d)) & ((b)))) + (x[10
]) + (uint32_t)(0xffff5bb1); (c) = ((((c)) << ((17))) |
(((c)) >> (32-((17))))); (c) += (d); }; /* 11 */
239 FF (b, c, d, a, x[11], S14, 0x895cd7be){ (b) += ((((c)) & ((d))) | ((~(c)) & ((a)))) + (x[11
]) + (uint32_t)(0x895cd7be); (b) = ((((b)) << ((22))) |
(((b)) >> (32-((22))))); (b) += (c); }; /* 12 */
240 FF (a, b, c, d, x[12], S11, 0x6b901122){ (a) += ((((b)) & ((c))) | ((~(b)) & ((d)))) + (x[12
]) + (uint32_t)(0x6b901122); (a) = ((((a)) << ((7))) | (
((a)) >> (32-((7))))); (a) += (b); }; /* 13 */
241 FF (d, a, b, c, x[13], S12, 0xfd987193){ (d) += ((((a)) & ((b))) | ((~(a)) & ((c)))) + (x[13
]) + (uint32_t)(0xfd987193); (d) = ((((d)) << ((12))) |
(((d)) >> (32-((12))))); (d) += (a); }; /* 14 */
242 FF (c, d, a, b, x[14], S13, 0xa679438e){ (c) += ((((d)) & ((a))) | ((~(d)) & ((b)))) + (x[14
]) + (uint32_t)(0xa679438e); (c) = ((((c)) << ((17))) |
(((c)) >> (32-((17))))); (c) += (d); }; /* 15 */
243 FF (b, c, d, a, x[15], S14, 0x49b40821){ (b) += ((((c)) & ((d))) | ((~(c)) & ((a)))) + (x[15
]) + (uint32_t)(0x49b40821); (b) = ((((b)) << ((22))) |
(((b)) >> (32-((22))))); (b) += (c); }; /* 16 */
244
245 /* Round 2 */
246 GG (a, b, c, d, x[ 1], S21, 0xf61e2562){ (a) += ((((b)) & ((d))) | (((c)) & (~(d)))) + (x[ 1
]) + (uint32_t)(0xf61e2562); (a) = ((((a)) << ((5))) | (
((a)) >> (32-((5))))); (a) += (b); }; /* 17 */
247 GG (d, a, b, c, x[ 6], S22, 0xc040b340){ (d) += ((((a)) & ((c))) | (((b)) & (~(c)))) + (x[ 6
]) + (uint32_t)(0xc040b340); (d) = ((((d)) << ((9))) | (
((d)) >> (32-((9))))); (d) += (a); }; /* 18 */
248 GG (c, d, a, b, x[11], S23, 0x265e5a51){ (c) += ((((d)) & ((b))) | (((a)) & (~(b)))) + (x[11
]) + (uint32_t)(0x265e5a51); (c) = ((((c)) << ((14))) |
(((c)) >> (32-((14))))); (c) += (d); }; /* 19 */
249 GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa){ (b) += ((((c)) & ((a))) | (((d)) & (~(a)))) + (x[ 0
]) + (uint32_t)(0xe9b6c7aa); (b) = ((((b)) << ((20))) |
(((b)) >> (32-((20))))); (b) += (c); }; /* 20 */
250 GG (a, b, c, d, x[ 5], S21, 0xd62f105d){ (a) += ((((b)) & ((d))) | (((c)) & (~(d)))) + (x[ 5
]) + (uint32_t)(0xd62f105d); (a) = ((((a)) << ((5))) | (
((a)) >> (32-((5))))); (a) += (b); }; /* 21 */
251 GG (d, a, b, c, x[10], S22, 0x2441453){ (d) += ((((a)) & ((c))) | (((b)) & (~(c)))) + (x[10
]) + (uint32_t)(0x2441453); (d) = ((((d)) << ((9))) | (
((d)) >> (32-((9))))); (d) += (a); }; /* 22 */
252 GG (c, d, a, b, x[15], S23, 0xd8a1e681){ (c) += ((((d)) & ((b))) | (((a)) & (~(b)))) + (x[15
]) + (uint32_t)(0xd8a1e681); (c) = ((((c)) << ((14))) |
(((c)) >> (32-((14))))); (c) += (d); }; /* 23 */
253 GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8){ (b) += ((((c)) & ((a))) | (((d)) & (~(a)))) + (x[ 4
]) + (uint32_t)(0xe7d3fbc8); (b) = ((((b)) << ((20))) |
(((b)) >> (32-((20))))); (b) += (c); }; /* 24 */
254 GG (a, b, c, d, x[ 9], S21, 0x21e1cde6){ (a) += ((((b)) & ((d))) | (((c)) & (~(d)))) + (x[ 9
]) + (uint32_t)(0x21e1cde6); (a) = ((((a)) << ((5))) | (
((a)) >> (32-((5))))); (a) += (b); }; /* 25 */
255 GG (d, a, b, c, x[14], S22, 0xc33707d6){ (d) += ((((a)) & ((c))) | (((b)) & (~(c)))) + (x[14
]) + (uint32_t)(0xc33707d6); (d) = ((((d)) << ((9))) | (
((d)) >> (32-((9))))); (d) += (a); }; /* 26 */
256 GG (c, d, a, b, x[ 3], S23, 0xf4d50d87){ (c) += ((((d)) & ((b))) | (((a)) & (~(b)))) + (x[ 3
]) + (uint32_t)(0xf4d50d87); (c) = ((((c)) << ((14))) |
(((c)) >> (32-((14))))); (c) += (d); }; /* 27 */
257 GG (b, c, d, a, x[ 8], S24, 0x455a14ed){ (b) += ((((c)) & ((a))) | (((d)) & (~(a)))) + (x[ 8
]) + (uint32_t)(0x455a14ed); (b) = ((((b)) << ((20))) |
(((b)) >> (32-((20))))); (b) += (c); }; /* 28 */
258 GG (a, b, c, d, x[13], S21, 0xa9e3e905){ (a) += ((((b)) & ((d))) | (((c)) & (~(d)))) + (x[13
]) + (uint32_t)(0xa9e3e905); (a) = ((((a)) << ((5))) | (
((a)) >> (32-((5))))); (a) += (b); }; /* 29 */
259 GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8){ (d) += ((((a)) & ((c))) | (((b)) & (~(c)))) + (x[ 2
]) + (uint32_t)(0xfcefa3f8); (d) = ((((d)) << ((9))) | (
((d)) >> (32-((9))))); (d) += (a); }; /* 30 */
260 GG (c, d, a, b, x[ 7], S23, 0x676f02d9){ (c) += ((((d)) & ((b))) | (((a)) & (~(b)))) + (x[ 7
]) + (uint32_t)(0x676f02d9); (c) = ((((c)) << ((14))) |
(((c)) >> (32-((14))))); (c) += (d); }; /* 31 */
261 GG (b, c, d, a, x[12], S24, 0x8d2a4c8a){ (b) += ((((c)) & ((a))) | (((d)) & (~(a)))) + (x[12
]) + (uint32_t)(0x8d2a4c8a); (b) = ((((b)) << ((20))) |
(((b)) >> (32-((20))))); (b) += (c); }; /* 32 */
262
263 /* Round 3 */
264 HH (a, b, c, d, x[ 5], S31, 0xfffa3942){ (a) += (((b)) ^ ((c)) ^ ((d))) + (x[ 5]) + (uint32_t)(0xfffa3942
); (a) = ((((a)) << ((4))) | (((a)) >> (32-((4)))
)); (a) += (b); }; /* 33 */
265 HH (d, a, b, c, x[ 8], S32, 0x8771f681){ (d) += (((a)) ^ ((b)) ^ ((c))) + (x[ 8]) + (uint32_t)(0x8771f681
); (d) = ((((d)) << ((11))) | (((d)) >> (32-((11)
)))); (d) += (a); }; /* 34 */
266 HH (c, d, a, b, x[11], S33, 0x6d9d6122){ (c) += (((d)) ^ ((a)) ^ ((b))) + (x[11]) + (uint32_t)(0x6d9d6122
); (c) = ((((c)) << ((16))) | (((c)) >> (32-((16)
)))); (c) += (d); }; /* 35 */
267 HH (b, c, d, a, x[14], S34, 0xfde5380c){ (b) += (((c)) ^ ((d)) ^ ((a))) + (x[14]) + (uint32_t)(0xfde5380c
); (b) = ((((b)) << ((23))) | (((b)) >> (32-((23)
)))); (b) += (c); }; /* 36 */
268 HH (a, b, c, d, x[ 1], S31, 0xa4beea44){ (a) += (((b)) ^ ((c)) ^ ((d))) + (x[ 1]) + (uint32_t)(0xa4beea44
); (a) = ((((a)) << ((4))) | (((a)) >> (32-((4)))
)); (a) += (b); }; /* 37 */
269 HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9){ (d) += (((a)) ^ ((b)) ^ ((c))) + (x[ 4]) + (uint32_t)(0x4bdecfa9
); (d) = ((((d)) << ((11))) | (((d)) >> (32-((11)
)))); (d) += (a); }; /* 38 */
270 HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60){ (c) += (((d)) ^ ((a)) ^ ((b))) + (x[ 7]) + (uint32_t)(0xf6bb4b60
); (c) = ((((c)) << ((16))) | (((c)) >> (32-((16)
)))); (c) += (d); }; /* 39 */
271 HH (b, c, d, a, x[10], S34, 0xbebfbc70){ (b) += (((c)) ^ ((d)) ^ ((a))) + (x[10]) + (uint32_t)(0xbebfbc70
); (b) = ((((b)) << ((23))) | (((b)) >> (32-((23)
)))); (b) += (c); }; /* 40 */
272 HH (a, b, c, d, x[13], S31, 0x289b7ec6){ (a) += (((b)) ^ ((c)) ^ ((d))) + (x[13]) + (uint32_t)(0x289b7ec6
); (a) = ((((a)) << ((4))) | (((a)) >> (32-((4)))
)); (a) += (b); }; /* 41 */
273 HH (d, a, b, c, x[ 0], S32, 0xeaa127fa){ (d) += (((a)) ^ ((b)) ^ ((c))) + (x[ 0]) + (uint32_t)(0xeaa127fa
); (d) = ((((d)) << ((11))) | (((d)) >> (32-((11)
)))); (d) += (a); }; /* 42 */
274 HH (c, d, a, b, x[ 3], S33, 0xd4ef3085){ (c) += (((d)) ^ ((a)) ^ ((b))) + (x[ 3]) + (uint32_t)(0xd4ef3085
); (c) = ((((c)) << ((16))) | (((c)) >> (32-((16)
)))); (c) += (d); }; /* 43 */
275 HH (b, c, d, a, x[ 6], S34, 0x4881d05){ (b) += (((c)) ^ ((d)) ^ ((a))) + (x[ 6]) + (uint32_t)(0x4881d05
); (b) = ((((b)) << ((23))) | (((b)) >> (32-((23)
)))); (b) += (c); }; /* 44 */
276 HH (a, b, c, d, x[ 9], S31, 0xd9d4d039){ (a) += (((b)) ^ ((c)) ^ ((d))) + (x[ 9]) + (uint32_t)(0xd9d4d039
); (a) = ((((a)) << ((4))) | (((a)) >> (32-((4)))
)); (a) += (b); }; /* 45 */
277 HH (d, a, b, c, x[12], S32, 0xe6db99e5){ (d) += (((a)) ^ ((b)) ^ ((c))) + (x[12]) + (uint32_t)(0xe6db99e5
); (d) = ((((d)) << ((11))) | (((d)) >> (32-((11)
)))); (d) += (a); }; /* 46 */
278 HH (c, d, a, b, x[15], S33, 0x1fa27cf8){ (c) += (((d)) ^ ((a)) ^ ((b))) + (x[15]) + (uint32_t)(0x1fa27cf8
); (c) = ((((c)) << ((16))) | (((c)) >> (32-((16)
)))); (c) += (d); }; /* 47 */
279 HH (b, c, d, a, x[ 2], S34, 0xc4ac5665){ (b) += (((c)) ^ ((d)) ^ ((a))) + (x[ 2]) + (uint32_t)(0xc4ac5665
); (b) = ((((b)) << ((23))) | (((b)) >> (32-((23)
)))); (b) += (c); }; /* 48 */
280
281 /* Round 4 */
282 II (a, b, c, d, x[ 0], S41, 0xf4292244){ (a) += (((c)) ^ (((b)) | (~(d)))) + (x[ 0]) + (uint32_t)(0xf4292244
); (a) = ((((a)) << ((6))) | (((a)) >> (32-((6)))
)); (a) += (b); }; /* 49 */
283 II (d, a, b, c, x[ 7], S42, 0x432aff97){ (d) += (((b)) ^ (((a)) | (~(c)))) + (x[ 7]) + (uint32_t)(0x432aff97
); (d) = ((((d)) << ((10))) | (((d)) >> (32-((10)
)))); (d) += (a); }; /* 50 */
284 II (c, d, a, b, x[14], S43, 0xab9423a7){ (c) += (((a)) ^ (((d)) | (~(b)))) + (x[14]) + (uint32_t)(0xab9423a7
); (c) = ((((c)) << ((15))) | (((c)) >> (32-((15)
)))); (c) += (d); }; /* 51 */
285 II (b, c, d, a, x[ 5], S44, 0xfc93a039){ (b) += (((d)) ^ (((c)) | (~(a)))) + (x[ 5]) + (uint32_t)(0xfc93a039
); (b) = ((((b)) << ((21))) | (((b)) >> (32-((21)
)))); (b) += (c); }; /* 52 */
286 II (a, b, c, d, x[12], S41, 0x655b59c3){ (a) += (((c)) ^ (((b)) | (~(d)))) + (x[12]) + (uint32_t)(0x655b59c3
); (a) = ((((a)) << ((6))) | (((a)) >> (32-((6)))
)); (a) += (b); }; /* 53 */
287 II (d, a, b, c, x[ 3], S42, 0x8f0ccc92){ (d) += (((b)) ^ (((a)) | (~(c)))) + (x[ 3]) + (uint32_t)(0x8f0ccc92
); (d) = ((((d)) << ((10))) | (((d)) >> (32-((10)
)))); (d) += (a); }; /* 54 */
288 II (c, d, a, b, x[10], S43, 0xffeff47d){ (c) += (((a)) ^ (((d)) | (~(b)))) + (x[10]) + (uint32_t)(0xffeff47d
); (c) = ((((c)) << ((15))) | (((c)) >> (32-((15)
)))); (c) += (d); }; /* 55 */
289 II (b, c, d, a, x[ 1], S44, 0x85845dd1){ (b) += (((d)) ^ (((c)) | (~(a)))) + (x[ 1]) + (uint32_t)(0x85845dd1
); (b) = ((((b)) << ((21))) | (((b)) >> (32-((21)
)))); (b) += (c); }; /* 56 */
290 II (a, b, c, d, x[ 8], S41, 0x6fa87e4f){ (a) += (((c)) ^ (((b)) | (~(d)))) + (x[ 8]) + (uint32_t)(0x6fa87e4f
); (a) = ((((a)) << ((6))) | (((a)) >> (32-((6)))
)); (a) += (b); }; /* 57 */
291 II (d, a, b, c, x[15], S42, 0xfe2ce6e0){ (d) += (((b)) ^ (((a)) | (~(c)))) + (x[15]) + (uint32_t)(0xfe2ce6e0
); (d) = ((((d)) << ((10))) | (((d)) >> (32-((10)
)))); (d) += (a); }; /* 58 */
292 II (c, d, a, b, x[ 6], S43, 0xa3014314){ (c) += (((a)) ^ (((d)) | (~(b)))) + (x[ 6]) + (uint32_t)(0xa3014314
); (c) = ((((c)) << ((15))) | (((c)) >> (32-((15)
)))); (c) += (d); }; /* 59 */
293 II (b, c, d, a, x[13], S44, 0x4e0811a1){ (b) += (((d)) ^ (((c)) | (~(a)))) + (x[13]) + (uint32_t)(0x4e0811a1
); (b) = ((((b)) << ((21))) | (((b)) >> (32-((21)
)))); (b) += (c); }; /* 60 */
294 II (a, b, c, d, x[ 4], S41, 0xf7537e82){ (a) += (((c)) ^ (((b)) | (~(d)))) + (x[ 4]) + (uint32_t)(0xf7537e82
); (a) = ((((a)) << ((6))) | (((a)) >> (32-((6)))
)); (a) += (b); }; /* 61 */
295 II (d, a, b, c, x[11], S42, 0xbd3af235){ (d) += (((b)) ^ (((a)) | (~(c)))) + (x[11]) + (uint32_t)(0xbd3af235
); (d) = ((((d)) << ((10))) | (((d)) >> (32-((10)
)))); (d) += (a); }; /* 62 */
296 II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb){ (c) += (((a)) ^ (((d)) | (~(b)))) + (x[ 2]) + (uint32_t)(0x2ad7d2bb
); (c) = ((((c)) << ((15))) | (((c)) >> (32-((15)
)))); (c) += (d); }; /* 63 */
297 II (b, c, d, a, x[ 9], S44, 0xeb86d391){ (b) += (((d)) ^ (((c)) | (~(a)))) + (x[ 9]) + (uint32_t)(0xeb86d391
); (b) = ((((b)) << ((21))) | (((b)) >> (32-((21)
)))); (b) += (c); }; /* 64 */
298
299 state[0] += a;
300 state[1] += b;
301 state[2] += c;
302 state[3] += d;
303
304 /* Zeroize sensitive information.
305 */
306 memset((unsigned char*)x, 0, sizeof (x));
307}
308
309/* Encodes input (uint32_t) into output (unsigned char). Assumes len is
310 a multiple of 4.
311 */
312static void Encode (unsigned char *output, uint32_t *input, size_t len)
313{
314 size_t i, j;
315
316 for (i = 0, j = 0; j < len; i++, j += 4) {
317 output[j] = (unsigned char)(input[i] & 0xff);
318 output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
319 output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
320 output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
321 }
322}
323
324/* Decodes input (unsigned char) into output (uint32_t). Assumes len is
325 a multiple of 4.
326 */
327static void Decode (uint32_t *output, const unsigned char *input, size_t len)
328{
329 wxASSERT( !(len & 3) )do { if ( !(len & 3) ) { } else if ( wxTheAssertHandler &&
(wxOnAssert("MD5Sum.cpp", 329, __FUNCTION__, "!(len & 3)"
, (const char*)__null), wxTrapInAssert) ) { wxTrapInAssert = false
; asm volatile ("int $3"); } } while ( (void)0, 0 );
330 size_t i, j;
331
332 for (i = 0, j = 0; j < len; i++, j += 4) {
333 output[i] = ((uint32_t)input[j]) | (((uint32_t)input[j+1]) << 8) | (((uint32_t)input[j+2]) << 16) | (((uint32_t)input[j+3]) << 24);
334 }
335}
336
337// File_checked_for_headers