This is an automated email from the git hooks/post-receive script.

smcv pushed a commit to annotated tag 1.42d
in repository iortcw.

commit 1aa33060f258e77ed389d0c86450de4c2e1c8bd2
Author: m4n4t4...@gmail.com 
<m4n4t4...@gmail.com@e65d2741-a53d-b2dc-ae96-bb75fa5e4c4a>
Date:   Fri Jan 24 01:05:21 2014 +0000

    MP: Add the Punkbuster implementation of MD5
---
 MP/code/qcommon/pbmd5.c | 381 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 381 insertions(+)

diff --git a/MP/code/qcommon/pbmd5.c b/MP/code/qcommon/pbmd5.c
new file mode 100644
index 0000000..524c9c9
--- /dev/null
+++ b/MP/code/qcommon/pbmd5.c
@@ -0,0 +1,381 @@
+//
+// PunkBuster Implementation of MD5 by RSA Data Security, Inc.
+//
+
+//
+// md5.h
+//
+// style modified by Tony Ray, January 2001
+// added support for randomizing initialization constants in MD5Init()
+
+/*
+ **********************************************************************
+ ** md5.h -- Header file for implementation of MD5                   **
+ ** RSA Data Security, Inc. MD5 Message Digest Algorithm             **
+ ** Created: 2/17/90 RLR                                             **
+ ** Revised: 12/27/90 SRD,AJ,BSK,JT Reference C version              **
+ ** Revised (for MD5): RLR 4/27/91                                   **
+ **   -- G modified to have y&~z instead of y&z                      **
+ **   -- FF, GG, HH modified to add in last register done            **
+ **   -- Access pattern: round 2 works mod 5, round 3 works mod 3    **
+ **   -- distinct additive constant for each step                    **
+ **   -- round 4 added, working mod 7                                **
+ **********************************************************************
+ */
+
+/*
+ **********************************************************************
+ ** Copyright (C) 1990, RSA Data Security, Inc. 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.                                   **
+ **********************************************************************
+ */
+#ifdef USE_PBMD5
+
+#include "q_shared.h"
+#include "qcommon.h"
+
+/* typedef a 32 bit type */
+typedef unsigned long int UINT4;
+
+/* Data structure for MD5 (Message Digest) computation */
+typedef struct {
+       UINT4 i[2];                 /* number of _bits_ handled mod 2^64 */
+       UINT4 buf[4];                                  /* scratch buffer */
+       unsigned char in[64];                            /* input buffer */
+       unsigned char digest[16];   /* actual digest after MD5Final call */
+} MD5_CTX;
+
+
+//
+// md5.cpp
+//
+// style modified by Tony Ray, January 2001
+// added support for randomizing initialization constants in MD5Init()
+
+/*
+ **********************************************************************
+ ** md5.c                                                            **
+ ** RSA Data Security, Inc. MD5 Message Digest Algorithm             **
+ ** Created: 2/17/90 RLR                                             **
+ ** Revised: 1/91 SRD,AJ,BSK,JT Reference C Version                  **
+ **********************************************************************
+ */
+
+/*
+ **********************************************************************
+ ** Copyright (C) 1990, RSA Data Security, Inc. 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.                                   **
+ **********************************************************************
+ */
+
+//#include "md5.h"
+
+static unsigned char PADDING[64] = {
+       0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+/* F, G and H are basic MD5 functions: selection, majority, parity */
+#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 ) 
+ (UINT4)( ac ); ( a ) = ROTATE_LEFT( ( a ), ( s ) ); ( a ) += ( b ); }
+#define GG( a, b, c, d, x, s, ac ) {( a ) += G( ( b ), ( c ), ( d ) ) + ( x ) 
+ (UINT4)( ac ); ( a ) = ROTATE_LEFT( ( a ), ( s ) ); ( a ) += ( b ); }
+#define HH( a, b, c, d, x, s, ac ) {( a ) += H( ( b ), ( c ), ( d ) ) + ( x ) 
+ (UINT4)( ac ); ( a ) = ROTATE_LEFT( ( a ), ( s ) ); ( a ) += ( b ); }
+#define II( a, b, c, d, x, s, ac ) {( a ) += I( ( b ), ( c ), ( d ) ) + ( x ) 
+ (UINT4)( ac ); ( a ) = ROTATE_LEFT( ( a ), ( s ) ); ( a ) += ( b ); }
+
+
+/* Basic MD5 step. Transform buf based on in.
+ */
+static void Transform( UINT4 *buf, UINT4 *in ) {
+       UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
+
+       /* Round 1 */
+#define S11 7
+#define S12 12
+#define S13 17
+#define S14 22
+       FF( a, b, c, d, in[ 0], S11, (UINT4) 3614090360u ); /* 1 */
+       FF( d, a, b, c, in[ 1], S12, (UINT4) 3905402710u ); /* 2 */
+       FF( c, d, a, b, in[ 2], S13, (UINT4)  606105819u ); /* 3 */
+       FF( b, c, d, a, in[ 3], S14, (UINT4) 3250441966u ); /* 4 */
+       FF( a, b, c, d, in[ 4], S11, (UINT4) 4118548399u ); /* 5 */
+       FF( d, a, b, c, in[ 5], S12, (UINT4) 1200080426u ); /* 6 */
+       FF( c, d, a, b, in[ 6], S13, (UINT4) 2821735955u ); /* 7 */
+       FF( b, c, d, a, in[ 7], S14, (UINT4) 4249261313u ); /* 8 */
+       FF( a, b, c, d, in[ 8], S11, (UINT4) 1770035416u ); /* 9 */
+       FF( d, a, b, c, in[ 9], S12, (UINT4) 2336552879u ); /* 10 */
+       FF( c, d, a, b, in[10], S13, (UINT4) 4294925233u ); /* 11 */
+       FF( b, c, d, a, in[11], S14, (UINT4) 2304563134u ); /* 12 */
+       FF( a, b, c, d, in[12], S11, (UINT4) 1804603682u ); /* 13 */
+       FF( d, a, b, c, in[13], S12, (UINT4) 4254626195u ); /* 14 */
+       FF( c, d, a, b, in[14], S13, (UINT4) 2792965006u ); /* 15 */
+       FF( b, c, d, a, in[15], S14, (UINT4) 1236535329u ); /* 16 */
+
+       /* Round 2 */
+#define S21 5
+#define S22 9
+#define S23 14
+#define S24 20
+       GG( a, b, c, d, in[ 1], S21, (UINT4) 4129170786u ); /* 17 */
+       GG( d, a, b, c, in[ 6], S22, (UINT4) 3225465664u ); /* 18 */
+       GG( c, d, a, b, in[11], S23, (UINT4)  643717713u ); /* 19 */
+       GG( b, c, d, a, in[ 0], S24, (UINT4) 3921069994u ); /* 20 */
+       GG( a, b, c, d, in[ 5], S21, (UINT4) 3593408605u ); /* 21 */
+       GG( d, a, b, c, in[10], S22, (UINT4)   38016083u ); /* 22 */
+       GG( c, d, a, b, in[15], S23, (UINT4) 3634488961u ); /* 23 */
+       GG( b, c, d, a, in[ 4], S24, (UINT4) 3889429448u ); /* 24 */
+       GG( a, b, c, d, in[ 9], S21, (UINT4)  568446438u ); /* 25 */
+       GG( d, a, b, c, in[14], S22, (UINT4) 3275163606u ); /* 26 */
+       GG( c, d, a, b, in[ 3], S23, (UINT4) 4107603335u ); /* 27 */
+       GG( b, c, d, a, in[ 8], S24, (UINT4) 1163531501u ); /* 28 */
+       GG( a, b, c, d, in[13], S21, (UINT4) 2850285829u ); /* 29 */
+       GG( d, a, b, c, in[ 2], S22, (UINT4) 4243563512u ); /* 30 */
+       GG( c, d, a, b, in[ 7], S23, (UINT4) 1735328473u ); /* 31 */
+       GG( b, c, d, a, in[12], S24, (UINT4) 2368359562u ); /* 32 */
+
+       /* Round 3 */
+#define S31 4
+#define S32 11
+#define S33 16
+#define S34 23
+       HH( a, b, c, d, in[ 5], S31, (UINT4) 4294588738u ); /* 33 */
+       HH( d, a, b, c, in[ 8], S32, (UINT4) 2272392833u ); /* 34 */
+       HH( c, d, a, b, in[11], S33, (UINT4) 1839030562u ); /* 35 */
+       HH( b, c, d, a, in[14], S34, (UINT4) 4259657740u ); /* 36 */
+       HH( a, b, c, d, in[ 1], S31, (UINT4) 2763975236u ); /* 37 */
+       HH( d, a, b, c, in[ 4], S32, (UINT4) 1272893353u ); /* 38 */
+       HH( c, d, a, b, in[ 7], S33, (UINT4) 4139469664u ); /* 39 */
+       HH( b, c, d, a, in[10], S34, (UINT4) 3200236656u ); /* 40 */
+       HH( a, b, c, d, in[13], S31, (UINT4)  681279174u ); /* 41 */
+       HH( d, a, b, c, in[ 0], S32, (UINT4) 3936430074u ); /* 42 */
+       HH( c, d, a, b, in[ 3], S33, (UINT4) 3572445317u ); /* 43 */
+       HH( b, c, d, a, in[ 6], S34, (UINT4)   76029189u ); /* 44 */
+       HH( a, b, c, d, in[ 9], S31, (UINT4) 3654602809u ); /* 45 */
+       HH( d, a, b, c, in[12], S32, (UINT4) 3873151461u ); /* 46 */
+       HH( c, d, a, b, in[15], S33, (UINT4)  530742520u ); /* 47 */
+       HH( b, c, d, a, in[ 2], S34, (UINT4) 3299628645u ); /* 48 */
+
+       /* Round 4 */
+#define S41 6
+#define S42 10
+#define S43 15
+#define S44 21
+       II( a, b, c, d, in[ 0], S41, (UINT4) 4096336452u ); /* 49 */
+       II( d, a, b, c, in[ 7], S42, (UINT4) 1126891415u ); /* 50 */
+       II( c, d, a, b, in[14], S43, (UINT4) 2878612391u ); /* 51 */
+       II( b, c, d, a, in[ 5], S44, (UINT4) 4237533241u ); /* 52 */
+       II( a, b, c, d, in[12], S41, (UINT4) 1700485571u ); /* 53 */
+       II( d, a, b, c, in[ 3], S42, (UINT4) 2399980690u ); /* 54 */
+       II( c, d, a, b, in[10], S43, (UINT4) 4293915773u ); /* 55 */
+       II( b, c, d, a, in[ 1], S44, (UINT4) 2240044497u ); /* 56 */
+       II( a, b, c, d, in[ 8], S41, (UINT4) 1873313359u ); /* 57 */
+       II( d, a, b, c, in[15], S42, (UINT4) 4264355552u ); /* 58 */
+       II( c, d, a, b, in[ 6], S43, (UINT4) 2734768916u ); /* 59 */
+       II( b, c, d, a, in[13], S44, (UINT4) 1309151649u ); /* 60 */
+       II( a, b, c, d, in[ 4], S41, (UINT4) 4149444226u ); /* 61 */
+       II( d, a, b, c, in[11], S42, (UINT4) 3174756917u ); /* 62 */
+       II( c, d, a, b, in[ 2], S43, (UINT4)  718787259u ); /* 63 */
+       II( b, c, d, a, in[ 9], S44, (UINT4) 3951481745u ); /* 64 */
+
+       buf[0] += a;
+       buf[1] += b;
+       buf[2] += c;
+       buf[3] += d;
+}
+
+static void MD5Init( MD5_CTX *mdContext, unsigned long pseudoRandomNumber ) {
+       mdContext->i[0] = mdContext->i[1] = (UINT4)0;
+
+       /* Load magic initialization constants.
+        */
+       mdContext->buf[0] = (UINT4)0x67452301 + pseudoRandomNumber * 11 ;
+       mdContext->buf[1] = (UINT4)0xefcdab89 + pseudoRandomNumber * 71 ;
+       mdContext->buf[2] = (UINT4)0x98badcfe + pseudoRandomNumber * 37 ;
+       mdContext->buf[3] = (UINT4)0x10325476 + pseudoRandomNumber * 97 ;
+}
+
+static void MD5Update( MD5_CTX *mdContext, unsigned char *inBuf, unsigned int 
inLen ) {
+       UINT4 in[16];
+       int mdi;
+       unsigned int i, ii;
+
+       /* compute number of bytes mod 64 */
+       mdi = (int)( ( mdContext->i[0] >> 3 ) & 0x3F );
+
+       /* update number of bits */
+       if ( ( mdContext->i[0] + ( (UINT4)inLen << 3 ) ) < mdContext->i[0] ) {
+               mdContext->i[1]++;
+       }
+       mdContext->i[0] += ( (UINT4)inLen << 3 );
+       mdContext->i[1] += ( (UINT4)inLen >> 29 );
+
+       while ( inLen-- ) {
+               /* add new character to buffer, increment mdi */
+               mdContext->in[mdi++] = *inBuf++;
+
+               /* transform if necessary */
+               if ( mdi == 0x40 ) {
+                       for ( i = 0, ii = 0; i < 16; i++, ii += 4 )
+                               in[i] = ( ( (UINT4)mdContext->in[ii + 3] ) << 
24 ) |
+                                               ( ( (UINT4)mdContext->in[ii + 
2] ) << 16 ) |
+                                               ( ( (UINT4)mdContext->in[ii + 
1] ) << 8 ) |
+                                               ( (UINT4)mdContext->in[ii] );
+                       Transform( mdContext->buf, in );
+                       mdi = 0;
+               }
+       }
+}
+
+static void MD5Final( MD5_CTX *mdContext ) {
+       UINT4 in[16];
+       int mdi;
+       unsigned int i, ii;
+       unsigned int padLen;
+
+       /* save number of bits */
+       in[14] = mdContext->i[0];
+       in[15] = mdContext->i[1];
+
+       /* compute number of bytes mod 64 */
+       mdi = (int)( ( mdContext->i[0] >> 3 ) & 0x3F );
+
+       /* pad out to 56 mod 64 */
+       padLen = ( mdi < 56 ) ? ( 56 - mdi ) : ( 120 - mdi );
+       MD5Update( mdContext, PADDING, padLen );
+
+       /* append length in bits and transform */
+       for ( i = 0, ii = 0; i < 14; i++, ii += 4 )
+               in[i] = ( ( (UINT4)mdContext->in[ii + 3] ) << 24 ) |
+                               ( ( (UINT4)mdContext->in[ii + 2] ) << 16 ) |
+                               ( ( (UINT4)mdContext->in[ii + 1] ) << 8 ) |
+                               ( (UINT4)mdContext->in[ii] );
+       Transform( mdContext->buf, in );
+
+       /* store buffer in digest */
+       for ( i = 0, ii = 0; i < 4; i++, ii += 4 ) {
+               mdContext->digest[ii] = (unsigned char)( mdContext->buf[i] & 
0xFF );
+               mdContext->digest[ii + 1] =
+                       (unsigned char)( ( mdContext->buf[i] >> 8 ) & 0xFF );
+               mdContext->digest[ii + 2] =
+                       (unsigned char)( ( mdContext->buf[i] >> 16 ) & 0xFF );
+               mdContext->digest[ii + 3] =
+                       (unsigned char)( ( mdContext->buf[i] >> 24 ) & 0xFF );
+       }
+}
+
+
+char *do_md5x( char *data, int len, int seed );
+int get_num( char *str, int *len );
+
+
+char *Com_PBMD5File( char *key ) {
+       char    *k;
+
+       k = key;
+
+       Com_DPrintf( "GUID of cdkey %s: ", k );
+
+       // Process first seed
+       k = do_md5x( k, strlen( k ), get_num( "0x00b684a3", NULL ) );
+
+       // Process second seed
+       k = do_md5x( k, 32, get_num( "0x00051a56", NULL ) );
+
+       Com_DPrintf( "%s\n", k );
+
+       return k;
+}
+
+
+char *do_md5x( char *data, int len, int seed ) {
+       MD5_CTX ctx;
+       int i;
+       char      *p;
+       static char ret[33];
+       static const char hex[] = "0123456789abcdef";
+
+       MD5Init( &ctx, seed );
+       MD5Update( &ctx, (unsigned char *)data, len );
+       MD5Final( &ctx );
+
+       p = ret;
+       for ( i = 0; i < 16; i++ ) {
+               *p++ = hex[ctx.digest[i] >> 4];
+               *p++ = hex[ctx.digest[i] & 15];
+       }
+       *p = 0;
+       return( ret );
+}
+
+
+
+int get_num( char *str, int *len ) {
+       int num,
+               tmp;
+
+       if ( !len ) {
+               len = &tmp;
+       }
+       *len = 0;
+       if ( !str[0] ) {
+               return( 0 );
+       }
+       if ( ( strlen( str ) > 2 ) && ( str[0] == '0' ) && ( tolower( str[1] ) 
== 'x' ) ) {
+               sscanf( str + 2, "%x%n", &num, len );
+       } else {
+               sscanf( str, "%d%n", &num, len );
+       }
+       return( num );
+}
+
+#endif // USE_PBMD5
+

-- 
Alioth's /usr/local/bin/git-commit-notice on 
/srv/git.debian.org/git/pkg-games/iortcw.git

_______________________________________________
Pkg-games-commits mailing list
Pkg-games-commits@lists.alioth.debian.org
http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-games-commits

Reply via email to