From 0cc2a51c6c35b0839ce0374de6438df387544995 Mon Sep 17 00:00:00 2001 From: retro-wertz Date: Mon, 4 Feb 2019 14:59:13 +0800 Subject: [PATCH] Add missing files --- mednafen/md5.cpp | 260 +++++++++++++++++++++++++++++++++++++++++++++++ mednafen/md5.h | 41 ++++++++ 2 files changed, 301 insertions(+) create mode 100644 mednafen/md5.cpp create mode 100644 mednafen/md5.h diff --git a/mednafen/md5.cpp b/mednafen/md5.cpp new file mode 100644 index 0000000..89e193d --- /dev/null +++ b/mednafen/md5.cpp @@ -0,0 +1,260 @@ +/* + * RFC 1321 compliant MD5 implementation, + * by Christophe Devine ; + * this program is licensed under the GPL. + */ +/* Converted to C++ for use in Mednafen */ + +#include "mednafen-types.h" +#include +#include "md5.h" + +#define GET_UINT32(n,b,i) \ +{ \ + (n) = ( (uint32) (b)[(i) + 3] << 24 ) \ + | ( (uint32) (b)[(i) + 2] << 16 ) \ + | ( (uint32) (b)[(i) + 1] << 8 ) \ + | ( (uint32) (b)[(i) ] ); \ +} + +#define PUT_UINT32(n,b,i) \ +{ \ + (b)[(i) ] = (uint8) ( (n) ); \ + (b)[(i) + 1] = (uint8) ( (n) >> 8 ); \ + (b)[(i) + 2] = (uint8) ( (n) >> 16 ); \ + (b)[(i) + 3] = (uint8) ( (n) >> 24 ); \ +} + +md5_context::md5_context(void) +{ + + +} + +md5_context::~md5_context(void) +{ + +} + +void md5_context::starts(void) +{ + total[0] = 0; + total[1] = 0; + state[0] = 0x67452301; + state[1] = 0xEFCDAB89; + state[2] = 0x98BADCFE; + state[3] = 0x10325476; +} + +void md5_context::process(const uint8 data[64]) +{ + uint32 A, B, C, D, X[16]; + + GET_UINT32( X[0], data, 0 ); + GET_UINT32( X[1], data, 4 ); + GET_UINT32( X[2], data, 8 ); + GET_UINT32( X[3], data, 12 ); + GET_UINT32( X[4], data, 16 ); + GET_UINT32( X[5], data, 20 ); + GET_UINT32( X[6], data, 24 ); + GET_UINT32( X[7], data, 28 ); + GET_UINT32( X[8], data, 32 ); + GET_UINT32( X[9], data, 36 ); + GET_UINT32( X[10], data, 40 ); + GET_UINT32( X[11], data, 44 ); + GET_UINT32( X[12], data, 48 ); + GET_UINT32( X[13], data, 52 ); + GET_UINT32( X[14], data, 56 ); + GET_UINT32( X[15], data, 60 ); + +#define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n))) + +#define P(a,b,c,d,k,s,t) \ +{ \ + a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \ +} + + A = state[0]; + B = state[1]; + C = state[2]; + D = state[3]; + +#define F(x,y,z) (z ^ (x & (y ^ z))) + + P( A, B, C, D, 0, 7, 0xD76AA478 ); + P( D, A, B, C, 1, 12, 0xE8C7B756 ); + P( C, D, A, B, 2, 17, 0x242070DB ); + P( B, C, D, A, 3, 22, 0xC1BDCEEE ); + P( A, B, C, D, 4, 7, 0xF57C0FAF ); + P( D, A, B, C, 5, 12, 0x4787C62A ); + P( C, D, A, B, 6, 17, 0xA8304613 ); + P( B, C, D, A, 7, 22, 0xFD469501 ); + P( A, B, C, D, 8, 7, 0x698098D8 ); + P( D, A, B, C, 9, 12, 0x8B44F7AF ); + P( C, D, A, B, 10, 17, 0xFFFF5BB1 ); + P( B, C, D, A, 11, 22, 0x895CD7BE ); + P( A, B, C, D, 12, 7, 0x6B901122 ); + P( D, A, B, C, 13, 12, 0xFD987193 ); + P( C, D, A, B, 14, 17, 0xA679438E ); + P( B, C, D, A, 15, 22, 0x49B40821 ); + +#undef F + +#define F(x,y,z) (y ^ (z & (x ^ y))) + + P( A, B, C, D, 1, 5, 0xF61E2562 ); + P( D, A, B, C, 6, 9, 0xC040B340 ); + P( C, D, A, B, 11, 14, 0x265E5A51 ); + P( B, C, D, A, 0, 20, 0xE9B6C7AA ); + P( A, B, C, D, 5, 5, 0xD62F105D ); + P( D, A, B, C, 10, 9, 0x02441453 ); + P( C, D, A, B, 15, 14, 0xD8A1E681 ); + P( B, C, D, A, 4, 20, 0xE7D3FBC8 ); + P( A, B, C, D, 9, 5, 0x21E1CDE6 ); + P( D, A, B, C, 14, 9, 0xC33707D6 ); + P( C, D, A, B, 3, 14, 0xF4D50D87 ); + P( B, C, D, A, 8, 20, 0x455A14ED ); + P( A, B, C, D, 13, 5, 0xA9E3E905 ); + P( D, A, B, C, 2, 9, 0xFCEFA3F8 ); + P( C, D, A, B, 7, 14, 0x676F02D9 ); + P( B, C, D, A, 12, 20, 0x8D2A4C8A ); + +#undef F + +#define F(x,y,z) (x ^ y ^ z) + + P( A, B, C, D, 5, 4, 0xFFFA3942 ); + P( D, A, B, C, 8, 11, 0x8771F681 ); + P( C, D, A, B, 11, 16, 0x6D9D6122 ); + P( B, C, D, A, 14, 23, 0xFDE5380C ); + P( A, B, C, D, 1, 4, 0xA4BEEA44 ); + P( D, A, B, C, 4, 11, 0x4BDECFA9 ); + P( C, D, A, B, 7, 16, 0xF6BB4B60 ); + P( B, C, D, A, 10, 23, 0xBEBFBC70 ); + P( A, B, C, D, 13, 4, 0x289B7EC6 ); + P( D, A, B, C, 0, 11, 0xEAA127FA ); + P( C, D, A, B, 3, 16, 0xD4EF3085 ); + P( B, C, D, A, 6, 23, 0x04881D05 ); + P( A, B, C, D, 9, 4, 0xD9D4D039 ); + P( D, A, B, C, 12, 11, 0xE6DB99E5 ); + P( C, D, A, B, 15, 16, 0x1FA27CF8 ); + P( B, C, D, A, 2, 23, 0xC4AC5665 ); + +#undef F + +#define F(x,y,z) (y ^ (x | ~z)) + + P( A, B, C, D, 0, 6, 0xF4292244 ); + P( D, A, B, C, 7, 10, 0x432AFF97 ); + P( C, D, A, B, 14, 15, 0xAB9423A7 ); + P( B, C, D, A, 5, 21, 0xFC93A039 ); + P( A, B, C, D, 12, 6, 0x655B59C3 ); + P( D, A, B, C, 3, 10, 0x8F0CCC92 ); + P( C, D, A, B, 10, 15, 0xFFEFF47D ); + P( B, C, D, A, 1, 21, 0x85845DD1 ); + P( A, B, C, D, 8, 6, 0x6FA87E4F ); + P( D, A, B, C, 15, 10, 0xFE2CE6E0 ); + P( C, D, A, B, 6, 15, 0xA3014314 ); + P( B, C, D, A, 13, 21, 0x4E0811A1 ); + P( A, B, C, D, 4, 6, 0xF7537E82 ); + P( D, A, B, C, 11, 10, 0xBD3AF235 ); + P( C, D, A, B, 2, 15, 0x2AD7D2BB ); + P( B, C, D, A, 9, 21, 0xEB86D391 ); + +#undef F + + state[0] += A; + state[1] += B; + state[2] += C; + state[3] += D; +} + +void md5_context::update(const uint8 *input, uint32 length ) +{ + uint32 left, fill; + + if( ! length ) return; + + left = ( total[0] >> 3 ) & 0x3F; + fill = 64 - left; + + total[0] += length << 3; + total[1] += length >> 29; + + total[0] &= 0xFFFFFFFF; + total[1] += total[0] < ( length << 3 ); + + if( left && length >= fill ) + { + memcpy( (void *) (buffer + left), (void *) input, fill ); + process(buffer ); + length -= fill; + input += fill; + left = 0; + } + + while( length >= 64 ) + { + process(input ); + length -= 64; + input += 64; + } + + if( length ) + { + memcpy( (void *) (buffer + left), (void *) input, length ); + } +} + +static const uint8 md5_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 +}; + +void md5_context::finish(uint8 digest[16] ) +{ + uint32 last, padn; + uint8 msglen[8]; + + PUT_UINT32( total[0], msglen, 0 ); + PUT_UINT32( total[1], msglen, 4 ); + + last = ( total[0] >> 3 ) & 0x3F; + padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last ); + + update( md5_padding, padn ); + update( msglen, 8 ); + + PUT_UINT32( state[0], digest, 0 ); + PUT_UINT32( state[1], digest, 4 ); + PUT_UINT32( state[2], digest, 8 ); + PUT_UINT32( state[3], digest, 12 ); +} + + +/* Uses a static buffer, so beware of how it's used. */ +//static +std::string md5_context::asciistr(const uint8 digest[16], bool borked_order) +{ + static char str[33]; + static char trans[16]={'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'}; + int x; + + for(x=0;x<16;x++) + { + if(borked_order) + { + str[x*2]=trans[digest[x]&0x0F]; + str[x*2+1]=trans[digest[x]>>4]; + } + else + { + str[x*2+1]=trans[digest[x]&0x0F]; + str[x*2]=trans[digest[x]>>4]; + } + } + return(std::string(str)); +} diff --git a/mednafen/md5.h b/mednafen/md5.h new file mode 100644 index 0000000..2dd0337 --- /dev/null +++ b/mednafen/md5.h @@ -0,0 +1,41 @@ +#ifndef _MD5_H +#define _MD5_H + +#include + +class md5_context +{ + public: + md5_context(void); + ~md5_context(void); + + static std::string asciistr(const uint8 digest[16], bool borked_order); + std::string asciistr(void); + void starts(void); + void update(const uint8 *input, uint32 length); + inline void update_u32_as_lsb(const uint32 input) + { + uint8 buf[4]; + + buf[0] = input >> 0; + buf[1] = input >> 8; + buf[2] = input >> 16; + buf[3] = input >> 24; + + update(buf, 4); + } + + inline void update_string(const char *string) + { + update((const uint8 *)string, strlen(string)); + } + void finish(uint8 digest[16]); + + private: + void process(const uint8 data[64]); + uint32 total[2]; + uint32 state[4]; + uint8 buffer[64]; +}; + +#endif /* md5.h */