OLD | NEW |
---|---|
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 // The original file was copied from sqlite, and was in the public domain. | 5 // The original file was copied from sqlite, and was in the public domain. |
6 | 6 |
7 /* | 7 /* |
8 * This code implements the MD5 message-digest algorithm. | 8 * This code implements the MD5 message-digest algorithm. |
9 * The algorithm is due to Ron Rivest. This code was | 9 * The algorithm is due to Ron Rivest. This code was |
10 * written by Colin Plumb in 1993, no copyright is claimed. | 10 * written by Colin Plumb in 1993, no copyright is claimed. |
11 * This code is in the public domain; do with it what you wish. | 11 * This code is in the public domain; do with it what you wish. |
12 * | 12 * |
13 * Equivalent code is available from RSA Data Security, Inc. | 13 * Equivalent code is available from RSA Data Security, Inc. |
14 * This code has been tested against that, and is equivalent, | 14 * This code has been tested against that, and is equivalent, |
15 * except that you don't need to include two pages of legalese | 15 * except that you don't need to include two pages of legalese |
16 * with every copy. | 16 * with every copy. |
17 * | 17 * |
18 * To compute the message digest of a chunk of bytes, declare an | 18 * To compute the message digest of a chunk of bytes, declare an |
19 * MD5Context structure, pass it to MD5Init, call MD5Update as | 19 * MD5Context structure, pass it to MD5Init, call MD5Update as |
20 * needed on buffers full of bytes, and then call MD5Final, which | 20 * needed on buffers full of bytes, and then call MD5Final, which |
21 * will fill a supplied 16-byte array with the digest. | 21 * will fill a supplied 16-byte array with the digest. |
22 */ | 22 */ |
23 | 23 |
24 #include "base/md5.h" | 24 #include "base/md5.h" |
25 | 25 |
26 #include "base/basictypes.h" | 26 #include <stddef.h> |
27 #include <stdint.h> | |
27 | 28 |
28 namespace { | 29 namespace { |
29 | 30 |
30 struct Context { | 31 struct Context { |
31 uint32 buf[4]; | 32 uint32_t buf[4]; |
32 uint32 bits[2]; | 33 uint32_t bits[2]; |
33 unsigned char in[64]; | 34 unsigned char in[64]; |
34 }; | 35 }; |
35 | 36 |
36 /* | 37 /* |
37 * Note: this code is harmless on little-endian machines. | 38 * Note: this code is harmless on little-endian machines. |
38 */ | 39 */ |
39 void byteReverse(unsigned char *buf, unsigned longs) { | 40 void byteReverse(unsigned char *buf, unsigned longs) { |
40 uint32 t; | 41 uint32_t t; |
41 do { | 42 do { |
42 t = (uint32)((unsigned)buf[3]<<8 | buf[2]) << 16 | | 43 t = (uint32_t)((unsigned)buf[3] << 8 | buf[2]) << 16 | |
Nico
2015/04/01 17:38:40
Hm, running clang-format on files that aren't clan
tfarina
2015/04/01 17:57:48
I'm open to do anything you prefer. I think we hav
| |
43 ((unsigned)buf[1]<<8 | buf[0]); | 44 ((unsigned)buf[1] << 8 | buf[0]); |
44 *(uint32 *)buf = t; | 45 *(uint32_t*)buf = t; |
45 buf += 4; | 46 buf += 4; |
46 } while (--longs); | 47 } while (--longs); |
47 } | 48 } |
48 | 49 |
49 /* The four core functions - F1 is optimized somewhat */ | 50 /* The four core functions - F1 is optimized somewhat */ |
50 | 51 |
51 /* #define F1(x, y, z) (x & y | ~x & z) */ | 52 /* #define F1(x, y, z) (x & y | ~x & z) */ |
52 #define F1(x, y, z) (z ^ (x & (y ^ z))) | 53 #define F1(x, y, z) (z ^ (x & (y ^ z))) |
53 #define F2(x, y, z) F1(z, x, y) | 54 #define F2(x, y, z) F1(z, x, y) |
54 #define F3(x, y, z) (x ^ y ^ z) | 55 #define F3(x, y, z) (x ^ y ^ z) |
55 #define F4(x, y, z) (y ^ (x | ~z)) | 56 #define F4(x, y, z) (y ^ (x | ~z)) |
56 | 57 |
57 /* This is the central step in the MD5 algorithm. */ | 58 /* This is the central step in the MD5 algorithm. */ |
58 #define MD5STEP(f, w, x, y, z, data, s) \ | 59 #define MD5STEP(f, w, x, y, z, data, s) \ |
59 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) | 60 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) |
60 | 61 |
61 /* | 62 /* |
62 * The core of the MD5 algorithm, this alters an existing MD5 hash to | 63 * The core of the MD5 algorithm, this alters an existing MD5 hash to |
63 * reflect the addition of 16 longwords of new data. MD5Update blocks | 64 * reflect the addition of 16 longwords of new data. MD5Update blocks |
64 * the data and converts bytes into longwords for this routine. | 65 * the data and converts bytes into longwords for this routine. |
65 */ | 66 */ |
66 void MD5Transform(uint32 buf[4], const uint32 in[16]) { | 67 void MD5Transform(uint32_t buf[4], const uint32_t in[16]) { |
67 register uint32 a, b, c, d; | 68 uint32_t a, b, c, d; |
68 | 69 |
69 a = buf[0]; | 70 a = buf[0]; |
70 b = buf[1]; | 71 b = buf[1]; |
71 c = buf[2]; | 72 c = buf[2]; |
72 d = buf[3]; | 73 d = buf[3]; |
73 | 74 |
74 MD5STEP(F1, a, b, c, d, in[ 0]+0xd76aa478, 7); | 75 MD5STEP(F1, a, b, c, d, in[ 0]+0xd76aa478, 7); |
75 MD5STEP(F1, d, a, b, c, in[ 1]+0xe8c7b756, 12); | 76 MD5STEP(F1, d, a, b, c, in[ 1]+0xe8c7b756, 12); |
76 MD5STEP(F1, c, d, a, b, in[ 2]+0x242070db, 17); | 77 MD5STEP(F1, c, d, a, b, in[ 2]+0x242070db, 17); |
77 MD5STEP(F1, b, c, d, a, in[ 3]+0xc1bdceee, 22); | 78 MD5STEP(F1, b, c, d, a, in[ 3]+0xc1bdceee, 22); |
(...skipping 87 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
165 | 166 |
166 /* | 167 /* |
167 * Update context to reflect the concatenation of another buffer full | 168 * Update context to reflect the concatenation of another buffer full |
168 * of bytes. | 169 * of bytes. |
169 */ | 170 */ |
170 void MD5Update(MD5Context* context, const StringPiece& data) { | 171 void MD5Update(MD5Context* context, const StringPiece& data) { |
171 const unsigned char* inbuf = (const unsigned char*)data.data(); | 172 const unsigned char* inbuf = (const unsigned char*)data.data(); |
172 size_t len = data.size(); | 173 size_t len = data.size(); |
173 struct Context *ctx = (struct Context *)context; | 174 struct Context *ctx = (struct Context *)context; |
174 const unsigned char* buf = (const unsigned char*)inbuf; | 175 const unsigned char* buf = (const unsigned char*)inbuf; |
175 uint32 t; | 176 uint32_t t; |
176 | 177 |
177 /* Update bitcount */ | 178 /* Update bitcount */ |
178 | 179 |
179 t = ctx->bits[0]; | 180 t = ctx->bits[0]; |
180 if ((ctx->bits[0] = t + ((uint32)len << 3)) < t) | 181 if ((ctx->bits[0] = t + ((uint32_t)len << 3)) < t) |
181 ctx->bits[1]++; /* Carry from low to high */ | 182 ctx->bits[1]++; /* Carry from low to high */ |
182 ctx->bits[1] += static_cast<uint32>(len >> 29); | 183 ctx->bits[1] += static_cast<uint32_t>(len >> 29); |
183 | 184 |
184 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ | 185 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ |
185 | 186 |
186 /* Handle any leading odd-sized chunks */ | 187 /* Handle any leading odd-sized chunks */ |
187 | 188 |
188 if (t) { | 189 if (t) { |
189 unsigned char *p = (unsigned char *)ctx->in + t; | 190 unsigned char *p = (unsigned char *)ctx->in + t; |
190 | 191 |
191 t = 64-t; | 192 t = 64-t; |
192 if (len < t) { | 193 if (len < t) { |
193 memcpy(p, buf, len); | 194 memcpy(p, buf, len); |
194 return; | 195 return; |
195 } | 196 } |
196 memcpy(p, buf, t); | 197 memcpy(p, buf, t); |
197 byteReverse(ctx->in, 16); | 198 byteReverse(ctx->in, 16); |
198 MD5Transform(ctx->buf, (uint32 *)ctx->in); | 199 MD5Transform(ctx->buf, (uint32_t *)ctx->in); |
199 buf += t; | 200 buf += t; |
200 len -= t; | 201 len -= t; |
201 } | 202 } |
202 | 203 |
203 /* Process data in 64-byte chunks */ | 204 /* Process data in 64-byte chunks */ |
204 | 205 |
205 while (len >= 64) { | 206 while (len >= 64) { |
206 memcpy(ctx->in, buf, 64); | 207 memcpy(ctx->in, buf, 64); |
207 byteReverse(ctx->in, 16); | 208 byteReverse(ctx->in, 16); |
208 MD5Transform(ctx->buf, (uint32 *)ctx->in); | 209 MD5Transform(ctx->buf, (uint32_t *)ctx->in); |
209 buf += 64; | 210 buf += 64; |
210 len -= 64; | 211 len -= 64; |
211 } | 212 } |
212 | 213 |
213 /* Handle any remaining bytes of data. */ | 214 /* Handle any remaining bytes of data. */ |
214 | 215 |
215 memcpy(ctx->in, buf, len); | 216 memcpy(ctx->in, buf, len); |
216 } | 217 } |
217 | 218 |
218 /* | 219 /* |
(...skipping 14 matching lines...) Expand all Loading... | |
233 *p++ = 0x80; | 234 *p++ = 0x80; |
234 | 235 |
235 /* Bytes of padding needed to make 64 bytes */ | 236 /* Bytes of padding needed to make 64 bytes */ |
236 count = 64 - 1 - count; | 237 count = 64 - 1 - count; |
237 | 238 |
238 /* Pad out to 56 mod 64 */ | 239 /* Pad out to 56 mod 64 */ |
239 if (count < 8) { | 240 if (count < 8) { |
240 /* Two lots of padding: Pad the first block to 64 bytes */ | 241 /* Two lots of padding: Pad the first block to 64 bytes */ |
241 memset(p, 0, count); | 242 memset(p, 0, count); |
242 byteReverse(ctx->in, 16); | 243 byteReverse(ctx->in, 16); |
243 MD5Transform(ctx->buf, (uint32 *)ctx->in); | 244 MD5Transform(ctx->buf, (uint32_t *)ctx->in); |
244 | 245 |
245 /* Now fill the next block with 56 bytes */ | 246 /* Now fill the next block with 56 bytes */ |
246 memset(ctx->in, 0, 56); | 247 memset(ctx->in, 0, 56); |
247 } else { | 248 } else { |
248 /* Pad block to 56 bytes */ | 249 /* Pad block to 56 bytes */ |
249 memset(p, 0, count-8); | 250 memset(p, 0, count-8); |
250 } | 251 } |
251 byteReverse(ctx->in, 14); | 252 byteReverse(ctx->in, 14); |
252 | 253 |
253 /* Append length in bits and transform */ | 254 /* Append length in bits and transform */ |
254 memcpy(&ctx->in[14 * sizeof(ctx->bits[0])], | 255 memcpy(&ctx->in[14 * sizeof(ctx->bits[0])], |
255 &ctx->bits[0], | 256 &ctx->bits[0], |
256 sizeof(ctx->bits[0])); | 257 sizeof(ctx->bits[0])); |
257 memcpy(&ctx->in[15 * sizeof(ctx->bits[1])], | 258 memcpy(&ctx->in[15 * sizeof(ctx->bits[1])], |
258 &ctx->bits[1], | 259 &ctx->bits[1], |
259 sizeof(ctx->bits[1])); | 260 sizeof(ctx->bits[1])); |
260 | 261 |
261 MD5Transform(ctx->buf, (uint32 *)ctx->in); | 262 MD5Transform(ctx->buf, (uint32_t *)ctx->in); |
262 byteReverse((unsigned char *)ctx->buf, 4); | 263 byteReverse((unsigned char *)ctx->buf, 4); |
263 memcpy(digest->a, ctx->buf, 16); | 264 memcpy(digest->a, ctx->buf, 16); |
264 memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */ | 265 memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */ |
265 } | 266 } |
266 | 267 |
267 void MD5IntermediateFinal(MD5Digest* digest, const MD5Context* context) { | 268 void MD5IntermediateFinal(MD5Digest* digest, const MD5Context* context) { |
268 /* MD5Final mutates the MD5Context*. Make a copy for generating the | 269 /* MD5Final mutates the MD5Context*. Make a copy for generating the |
269 intermediate value. */ | 270 intermediate value. */ |
270 MD5Context context_copy; | 271 MD5Context context_copy; |
271 memcpy(&context_copy, context, sizeof(context_copy)); | 272 memcpy(&context_copy, context, sizeof(context_copy)); |
(...skipping 23 matching lines...) Expand all Loading... | |
295 MD5Final(digest, &ctx); | 296 MD5Final(digest, &ctx); |
296 } | 297 } |
297 | 298 |
298 std::string MD5String(const StringPiece& str) { | 299 std::string MD5String(const StringPiece& str) { |
299 MD5Digest digest; | 300 MD5Digest digest; |
300 MD5Sum(str.data(), str.length(), &digest); | 301 MD5Sum(str.data(), str.length(), &digest); |
301 return MD5DigestToBase16(digest); | 302 return MD5DigestToBase16(digest); |
302 } | 303 } |
303 | 304 |
304 } // namespace base | 305 } // namespace base |
OLD | NEW |