diff --git a/src/emucore/MD5.cxx b/src/emucore/MD5.cxx index 798645de4..5cbed6bb2 100644 --- a/src/emucore/MD5.cxx +++ b/src/emucore/MD5.cxx @@ -18,280 +18,49 @@ // this file, and for a DISCLAIMER OF ALL WARRANTIES. //============================================================================ -#include "FSNode.hxx" #include "MD5.hxx" -/* - Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All - rights reserved. - - License to copy and use this software is granted provided that it - is identified as the "RSA Data Security, Inc. MD5 Message-Digest - Algorithm" in all material mentioning or referencing this software - or this function. - - License is also granted to make and use derivative works provided - that such works are identified as "derived from the RSA Data - Security, Inc. MD5 Message-Digest Algorithm" in all material - mentioning or referencing the derived work. - - RSA Data Security, Inc. makes no representations concerning either - the merchantability of this software or the suitability of this - software for any particular purpose. It is provided "as is" - without express or implied warranty of any kind. - - These notices must be retained in any copies of any part of this - documentation and/or software. -*/ - -namespace MD5 { - -// Setup the types used by the MD5 routines -using POINTER = uInt8*; - -// MD5 context. -struct MD5_CTX -{ - uInt32 state[4]; /* state (ABCD) */ - uInt32 count[2]; /* number of bits, modulo 2^64 (lsb first) */ - uInt8 buffer[64]; /* input buffer */ -}; - // Constants for MD5Transform routine. -#define S11 7 -#define S12 12 -#define S13 17 -#define S14 22 -#define S21 5 -#define S22 9 -#define S23 14 -#define S24 20 -#define S31 4 -#define S32 11 -#define S33 16 -#define S34 23 -#define S41 6 -#define S42 10 -#define S43 15 -#define S44 21 - -static void MD5Init(MD5_CTX*); -static void MD5Update(MD5_CTX*, const uInt8*, uInt32); -static void MD5Final(uInt8[16], MD5_CTX*); -static void MD5Transform(uInt32[4], const uInt8[64]); -static void Encode(uInt8*, const uInt32*, uInt32); -static void Decode(uInt32*, const uInt8*, uInt32); - -static uInt8 PADDING[64] = { - 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 -}; - -// F, G, H and I are basic MD5 functions. -#define F(x, y, z) (((x) & (y)) | ((~(x)) & (z))) -#define G(x, y, z) (((x) & (z)) | ((y) & (~(z)))) -#define H(x, y, z) ((x) ^ (y) ^ (z)) -#define I(x, y, z) ((y) ^ ((x) | (~(z)))) - -// ROTATE_LEFT rotates x left n bits. -#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n)))) - -// FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4. -// Rotation is separate from addition to prevent recomputation. -#define FF(a, b, c, d, x, s, ac) { \ - (a) += F ((b), (c), (d)) + (x) + uInt32(ac); \ - (a) = ROTATE_LEFT ((a), (s)); \ - (a) += (b); \ - } -#define GG(a, b, c, d, x, s, ac) { \ - (a) += G ((b), (c), (d)) + (x) + uInt32(ac); \ - (a) = ROTATE_LEFT ((a), (s)); \ - (a) += (b); \ - } -#define HH(a, b, c, d, x, s, ac) { \ - (a) += H ((b), (c), (d)) + (x) + uInt32(ac); \ - (a) = ROTATE_LEFT ((a), (s)); \ - (a) += (b); \ - } -#define II(a, b, c, d, x, s, ac) { \ - (a) += I ((b), (c), (d)) + (x) + uInt32(ac); \ - (a) = ROTATE_LEFT ((a), (s)); \ - (a) += (b); \ - } +namespace { + constexpr uInt32 + S11 = 7, + S12 = 12, + S13 = 17, + S14 = 22, + S21 = 5, + S22 = 9, + S23 = 14, + S24 = 20, + S31 = 4, + S32 = 11, + S33 = 16, + S34 = 23, + S41 = 6, + S42 = 10, + S43 = 15, + S44 = 21; +} // namespace +// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - // MD5 initialization. Begins an MD5 operation, writing a new context. -static void MD5Init(MD5_CTX* context) +void MD5::init() { - context->count[0] = context->count[1] = 0; - /* Load magic initialization constants. */ - context->state[0] = 0x67452301; - context->state[1] = 0xefcdab89; - context->state[2] = 0x98badcfe; - context->state[3] = 0x10325476; + finalized = false; + + count[0] = 0; + count[1] = 0; + + // Load magic initialization constants + state[0] = 0x67452301; + state[1] = 0xefcdab89; + state[2] = 0x98badcfe; + state[3] = 0x10325476; } -// MD5 block update operation. Continues an MD5 message-digest -// operation, processing another message block, and updating the -// context. -static void MD5Update(MD5_CTX* context, const uInt8* const input, - uInt32 inputLen) -{ - uInt32 i = 0; - - /* Compute number of bytes mod 64 */ - auto index = static_cast((context->count[0] >> 3) & 0x3F); - - /* Update number of bits */ - if ((context->count[0] += (inputLen << 3)) < (inputLen << 3)) // NOLINT - context->count[1]++; - context->count[1] += (inputLen >> 29); - - const uInt32 partLen = 64 - index; - - /* Transform as many times as possible. */ - if (inputLen >= partLen) { - memcpy (&context->buffer[index], input, partLen); - MD5Transform (context->state, context->buffer); - - for (i = partLen; i + 63 < inputLen; i += 64) - MD5Transform (context->state, &input[i]); - - index = 0; - } - else - i = 0; - - /* Buffer remaining input */ - memcpy(&context->buffer[index], &input[i], inputLen-i); -} - -// MD5 finalization. Ends an MD5 message-digest operation, writing the -// the message digest and zeroizing the context. -static void MD5Final(uInt8 digest[16], MD5_CTX* context) -{ - uInt8 bits[8]; - - /* Save number of bits */ - Encode (bits, context->count, 8); - - /* Pad out to 56 mod 64. */ - const auto index = static_cast((context->count[0] >> 3) & 0x3f); - const uInt32 padLen = (index < 56) ? (56 - index) : (120 - index); - MD5Update (context, PADDING, padLen); - - /* Append length (before padding) */ - MD5Update (context, bits, 8); - /* Store state in digest */ - Encode (digest, context->state, 16); - - /* Zeroize sensitive information. */ - memset (reinterpret_cast(context), 0, sizeof(*context)); -} - -// MD5 basic transformation. Transforms state based on block. -static void MD5Transform(uInt32 state[4], const uInt8 block[64]) -{ - uInt32 a = state[0], b = state[1], c = state[2], d = state[3], x[16]; - - Decode (x, block, 64); - - /* Round 1 */ - FF (a, b, c, d, x[ 0], S11, 0xd76aa478) /* 1 */ - FF (d, a, b, c, x[ 1], S12, 0xe8c7b756) /* 2 */ - FF (c, d, a, b, x[ 2], S13, 0x242070db) /* 3 */ - FF (b, c, d, a, x[ 3], S14, 0xc1bdceee) /* 4 */ - FF (a, b, c, d, x[ 4], S11, 0xf57c0faf) /* 5 */ - FF (d, a, b, c, x[ 5], S12, 0x4787c62a) /* 6 */ - FF (c, d, a, b, x[ 6], S13, 0xa8304613) /* 7 */ - FF (b, c, d, a, x[ 7], S14, 0xfd469501) /* 8 */ - FF (a, b, c, d, x[ 8], S11, 0x698098d8) /* 9 */ - FF (d, a, b, c, x[ 9], S12, 0x8b44f7af) /* 10 */ - FF (c, d, a, b, x[10], S13, 0xffff5bb1) /* 11 */ - FF (b, c, d, a, x[11], S14, 0x895cd7be) /* 12 */ - FF (a, b, c, d, x[12], S11, 0x6b901122) /* 13 */ - FF (d, a, b, c, x[13], S12, 0xfd987193) /* 14 */ - FF (c, d, a, b, x[14], S13, 0xa679438e) /* 15 */ - FF (b, c, d, a, x[15], S14, 0x49b40821) /* 16 */ - - /* Round 2 */ - GG (a, b, c, d, x[ 1], S21, 0xf61e2562) /* 17 */ - GG (d, a, b, c, x[ 6], S22, 0xc040b340) /* 18 */ - GG (c, d, a, b, x[11], S23, 0x265e5a51) /* 19 */ - GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa) /* 20 */ - GG (a, b, c, d, x[ 5], S21, 0xd62f105d) /* 21 */ - GG (d, a, b, c, x[10], S22, 0x2441453) /* 22 */ - GG (c, d, a, b, x[15], S23, 0xd8a1e681) /* 23 */ - GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8) /* 24 */ - GG (a, b, c, d, x[ 9], S21, 0x21e1cde6) /* 25 */ - GG (d, a, b, c, x[14], S22, 0xc33707d6) /* 26 */ - GG (c, d, a, b, x[ 3], S23, 0xf4d50d87) /* 27 */ - GG (b, c, d, a, x[ 8], S24, 0x455a14ed) /* 28 */ - GG (a, b, c, d, x[13], S21, 0xa9e3e905) /* 29 */ - GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8) /* 30 */ - GG (c, d, a, b, x[ 7], S23, 0x676f02d9) /* 31 */ - GG (b, c, d, a, x[12], S24, 0x8d2a4c8a) /* 32 */ - - /* Round 3 */ - HH (a, b, c, d, x[ 5], S31, 0xfffa3942) /* 33 */ - HH (d, a, b, c, x[ 8], S32, 0x8771f681) /* 34 */ - HH (c, d, a, b, x[11], S33, 0x6d9d6122) /* 35 */ - HH (b, c, d, a, x[14], S34, 0xfde5380c) /* 36 */ - HH (a, b, c, d, x[ 1], S31, 0xa4beea44) /* 37 */ - HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9) /* 38 */ - HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60) /* 39 */ - HH (b, c, d, a, x[10], S34, 0xbebfbc70) /* 40 */ - HH (a, b, c, d, x[13], S31, 0x289b7ec6) /* 41 */ - HH (d, a, b, c, x[ 0], S32, 0xeaa127fa) /* 42 */ - HH (c, d, a, b, x[ 3], S33, 0xd4ef3085) /* 43 */ - HH (b, c, d, a, x[ 6], S34, 0x4881d05) /* 44 */ - HH (a, b, c, d, x[ 9], S31, 0xd9d4d039) /* 45 */ - HH (d, a, b, c, x[12], S32, 0xe6db99e5) /* 46 */ - HH (c, d, a, b, x[15], S33, 0x1fa27cf8) /* 47 */ - HH (b, c, d, a, x[ 2], S34, 0xc4ac5665) /* 48 */ - - /* Round 4 */ - II (a, b, c, d, x[ 0], S41, 0xf4292244) /* 49 */ - II (d, a, b, c, x[ 7], S42, 0x432aff97) /* 50 */ - II (c, d, a, b, x[14], S43, 0xab9423a7) /* 51 */ - II (b, c, d, a, x[ 5], S44, 0xfc93a039) /* 52 */ - II (a, b, c, d, x[12], S41, 0x655b59c3) /* 53 */ - II (d, a, b, c, x[ 3], S42, 0x8f0ccc92) /* 54 */ - II (c, d, a, b, x[10], S43, 0xffeff47d) /* 55 */ - II (b, c, d, a, x[ 1], S44, 0x85845dd1) /* 56 */ - II (a, b, c, d, x[ 8], S41, 0x6fa87e4f) /* 57 */ - II (d, a, b, c, x[15], S42, 0xfe2ce6e0) /* 58 */ - II (c, d, a, b, x[ 6], S43, 0xa3014314) /* 59 */ - II (b, c, d, a, x[13], S44, 0x4e0811a1) /* 60 */ - II (a, b, c, d, x[ 4], S41, 0xf7537e82) /* 61 */ - II (d, a, b, c, x[11], S42, 0xbd3af235) /* 62 */ - II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb) /* 63 */ - II (b, c, d, a, x[ 9], S44, 0xeb86d391) /* 64 */ - - state[0] += a; - state[1] += b; - state[2] += c; - state[3] += d; - - /* Zeroize sensitive information. */ - memset (reinterpret_cast(x), 0, sizeof(x)); -} - -// Encodes input (uInt32) into output (uInt8). Assumes len is -// a multiple of 4. -static void Encode(uInt8* output, const uInt32* const input, uInt32 len) -{ - for (uInt32 i = 0, j = 0; j < len; ++i, j += 4) { - output[j] = static_cast(input[i] & 0xff); - output[j+1] = static_cast((input[i] >> 8) & 0xff); - output[j+2] = static_cast((input[i] >> 16) & 0xff); - output[j+3] = static_cast((input[i] >> 24) & 0xff); - } -} - -// Decodes input (uInt8) into output (uInt32). Assumes len is -// a multiple of 4. -static void Decode(uInt32* output, const uInt8* const input, uInt32 len) +// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - +// Decodes input (uInt8) into output (uInt32). +// Assumes len is a multiple of 4. +void MD5::decode(uInt32* output, const uInt8* const input, uInt32 len) { for (uInt32 i = 0, j = 0; j < len; ++i, j += 4) output[i] = (static_cast(input[j])) @@ -301,31 +70,190 @@ static void Decode(uInt32* output, const uInt8* const input, uInt32 len) } // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -string hash(string_view buffer) +// Encodes input (uInt32) into output (uInt8). +// Assumes len is a multiple of 4. +void MD5::encode(uInt8* output, const uInt32* const input, uInt32 len) { - return hash(reinterpret_cast(buffer.data()), buffer.size()); + for (uInt32 i = 0, j = 0; j < len; ++i, j += 4) { + output[j] = static_cast(input[i] & 0xff); + output[j+1] = static_cast((input[i] >> 8) & 0xff); + output[j+2] = static_cast((input[i] >> 16) & 0xff); + output[j+3] = static_cast((input[i] >> 24) & 0xff); + } } // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -string hash(const ByteBuffer& buffer, size_t length) +// Apply MD5 algo on a block. +void MD5::transform(const uInt8* const block) { - return hash(buffer.get(), length); + std::array x; + decode(x.data(), block, BLOCKSIZE); + + uInt32 a = state[0], b = state[1], c = state[2], d = state[3]; + + /* Round 1 */ + FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */ + FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */ + FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */ + FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */ + FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */ + FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */ + FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */ + FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */ + FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */ + FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */ + FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */ + FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */ + FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */ + FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */ + FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */ + FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */ + + /* Round 2 */ + GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */ + GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */ + GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */ + GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */ + GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */ + GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */ + GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */ + GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */ + GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */ + GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */ + GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */ + GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */ + GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */ + GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */ + GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */ + GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */ + + /* Round 3 */ + HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */ + HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */ + HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */ + HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */ + HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */ + HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */ + HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */ + HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */ + HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */ + HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */ + HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */ + HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */ + HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */ + HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */ + HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */ + HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */ + + /* Round 4 */ + II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */ + II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */ + II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */ + II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */ + II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */ + II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */ + II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */ + II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */ + II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */ + II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */ + II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */ + II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */ + II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */ + II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */ + II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */ + II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */ + + state[0] += a; + state[1] += b; + state[2] += c; + state[3] += d; + + // Zeroize sensitive information. + x.fill(0); } // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -string hash(const uInt8* buffer, size_t length) +// MD5 block update operation. +// Continues an MD5 message-digest operation, processing another message block. +void MD5::update(const uInt8* const input, uInt32 length) { + // Compute number of bytes mod 64 + auto index = count[0] / 8 % BLOCKSIZE; + + // Update number of bits + if ((count[0] += (length << 3)) < (length << 3)) // NOLINT + count[1]++; + count[1] += (length >> 29); + + // Number of bytes we need to fill in buffer + const uInt32 firstpart = 64 - index; + + // Transform as many times as possible. + uInt32 i = 0; + if (length >= firstpart) + { + // Fill buffer first, transform + std::copy_n(input, firstpart, buffer.data() + index); + transform(buffer.data()); + + // Transform chunks of BLOCKSIZE (64 bytes) + for (i = firstpart; i + BLOCKSIZE <= length; i += BLOCKSIZE) + transform(&input[i]); + + index = 0; + } + else + i = 0; + + // Buffer remaining input + std::copy_n(input + i, length - i, buffer.data() + index); +} + +// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - +// MD5 finalization. Ends an MD5 message-digest operation, writing the +// the message digest and zeroizing the context. +void MD5::finalize() +{ + static constexpr std::array padding = { + 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 + }; + + if (!finalized) { + // Save number of bits + std::array bits; + encode(bits.data(), count.data(), 8); + + // Pad out to 56 mod 64 + const uInt32 index = count[0] / 8 % 64; + const uInt32 padLen = (index < 56) ? (56 - index) : (120 - index); + update(padding.data(), padLen); + + // Append length (before padding) + update(bits.data(), 8); + + // Store state in digest + encode(digest.data(), state.data(), 16); + + // Zeroize sensitive information + buffer.fill(0); + count.fill(0); + + finalized = true; + } +} + +// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - +// Return hex representation of digest as string +string MD5::hexdigest() const +{ + if (!finalized) + return ""; + static constexpr char hex[] = "0123456789abcdef"; - MD5_CTX context{}; - uInt8 md5[16] = {0}; - const auto len32 = static_cast(length); // Always use 32-bit for now - - MD5Init(&context); - MD5Update(&context, buffer, len32); - MD5Final(md5, &context); - string result; - for(auto c: md5) + for(auto c: digest) { result += hex[(c >> 4) & 0x0f]; result += hex[c & 0x0f]; @@ -334,4 +262,26 @@ string hash(const uInt8* buffer, size_t length) return result; } -} // namespace MD5 +// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - +string MD5::hash(string_view buffer) +{ + return MD5::hash(reinterpret_cast(buffer.data()), buffer.size()); +} + +// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - +string MD5::hash(const ByteBuffer& buffer, size_t length) +{ + return MD5::hash(buffer.get(), length); +} + +// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - +string MD5::hash(const uInt8* buffer, size_t length) +{ + static MD5 ourMD5; // singleton + + ourMD5.init(); + ourMD5.update(buffer, static_cast(length)); + ourMD5.finalize(); + + return ourMD5.hexdigest(); +} diff --git a/src/emucore/MD5.hxx b/src/emucore/MD5.hxx index 831bb0713..b72cd0f77 100644 --- a/src/emucore/MD5.hxx +++ b/src/emucore/MD5.hxx @@ -15,40 +15,126 @@ // this file, and for a DISCLAIMER OF ALL WARRANTIES. //============================================================================ +/* MD5 + converted to C++ class by Frank Thilo (thilo@unix-ag.org) + for bzflag (http://www.bzflag.org) + + based on: + + md5.h and md5.c + reference implementation of RFC 1321 + + Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All +rights reserved. + +License to copy and use this software is granted provided that it +is identified as the "RSA Data Security, Inc. MD5 Message-Digest +Algorithm" in all material mentioning or referencing this software +or this function. + +License is also granted to make and use derivative works provided +that such works are identified as "derived from the RSA Data +Security, Inc. MD5 Message-Digest Algorithm" in all material +mentioning or referencing the derived work. + +RSA Data Security, Inc. makes no representations concerning either +the merchantability of this software or the suitability of this +software for any particular purpose. It is provided "as is" +without express or implied warranty of any kind. + +These notices must be retained in any copies of any part of this +documentation and/or software. +*/ + #ifndef MD5_HXX #define MD5_HXX -class FSNode; - #include "bspf.hxx" -namespace MD5 { +class MD5 +{ + public: + /** + Get the MD5 Message-Digest of the specified message with the + given length. The digest consists of 32 hexadecimal digits. - /** - Get the MD5 Message-Digest of the specified message with the - given length. The digest consists of 32 hexadecimal digits. + @param buffer The message to compute the digest of + @param length The length of the message - Note that currently, the length is truncated internally to - 32 bits, until the MD5 routines are rewritten for 64-bit. - Based on the size of data we currently use, this may never - actually happen. + @return The message-digest + */ + static string hash(const ByteBuffer& buffer, size_t length); + static string hash(const uInt8* buffer, size_t length); + /** + Ditto. - @param buffer The message to compute the digest of - @param length The length of the message + @param buffer The message to compute the digest of - @return The message-digest - */ - string hash(const ByteBuffer& buffer, size_t length); - string hash(const uInt8* buffer, size_t length); - /** - Dito. + @return The message - digest + */ + static string hash(string_view buffer); - @param buffer The message to compute the digest of + public: + MD5() = default; - @return The message - digest - */ - string hash(string_view buffer); + private: + void init(); + void update(const uInt8* const input, uInt32 length); + void finalize(); + string hexdigest() const; + void transform(const uInt8* block); + static void decode(uInt32* output, const uInt8* const input, uInt32 len); + static void encode(uInt8* output, const uInt32* const input, uInt32 len); -} // namespace MD5 + // F, G, H and I are basic MD5 functions. + FORCE_INLINE constexpr uInt32 F(uInt32 x, uInt32 y, uInt32 z) { + return (x&y) | (~x&z); + } + FORCE_INLINE constexpr uInt32 G(uInt32 x, uInt32 y, uInt32 z) { + return (x&z) | (y&~z); + } + FORCE_INLINE constexpr uInt32 H(uInt32 x, uInt32 y, uInt32 z) { + return x^y^z; + } + FORCE_INLINE constexpr uInt32 I(uInt32 x, uInt32 y, uInt32 z) { + return y ^ (x | ~z); + } + // rotate_left rotates x left n bits. + FORCE_INLINE constexpr uInt32 rotate_left(uInt32 x, int n) { + return (x << n) | (x >> (32-n)); + } + // FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4. + // Rotation is separate from addition to prevent recomputation. + FORCE_INLINE constexpr void FF(uInt32 &a, uInt32 b, uInt32 c, + uInt32 d, uInt32 x, uInt32 s, uInt32 ac) { + a = rotate_left(a+ F(b,c,d) + x + ac, s) + b; + } + FORCE_INLINE constexpr void GG(uInt32 &a, uInt32 b, uInt32 c, uInt32 d, + uInt32 x, uInt32 s, uInt32 ac) { + a = rotate_left(a + G(b,c,d) + x + ac, s) + b; + } + FORCE_INLINE constexpr void HH(uInt32 &a, uInt32 b, uInt32 c, uInt32 d, + uInt32 x, uInt32 s, uInt32 ac) { + a = rotate_left(a + H(b,c,d) + x + ac, s) + b; + } + FORCE_INLINE constexpr void II(uInt32 &a, uInt32 b, uInt32 c, uInt32 d, + uInt32 x, uInt32 s, uInt32 ac) { + a = rotate_left(a + I(b,c,d) + x + ac, s) + b; + } + + private: + static inline constexpr uInt32 BLOCKSIZE = 64; + bool finalized{false}; + std::array buffer; // bytes that didn't fit in last chunk + std::array count; // 64bit counter for number of bits (lo, hi) + std::array state; // digest so far + std::array digest; // the result + + private: + MD5(const MD5&) = delete; + MD5(MD5&&) = delete; + MD5& operator=(const MD5&) = delete; + MD5& operator=(MD5&&) = delete; +}; #endif