1 /*
2 * This code implements the MD5 message-digest algorithm.
3 * The algorithm is due to Ron Rivest. This code was
4 * written by Colin Plumb in 1993, no copyright is claimed.
5 * This code is in the public domain; do with it what you wish.
6 *
7 * Equivalent code is available from RSA Data Security, Inc.
8 * This code has been tested against that, and is equivalent,
9 * except that you don't need to include two pages of legalese
10 * with every copy.
11 *
12 * To compute the message digest of a chunk of bytes, declare an
13 * MD5Context structure, pass it to MD5Init, call MD5Update as
14 * needed on buffers full of bytes, and then call MD5Final, which
15 * will fill a supplied 16-byte array with the digest.
16 */
17 #ifndef USE_PBMD5
18
19 #include "q_shared.h"
20 #include "qcommon.h"
21
22 typedef struct MD5Context {
23 uint32_t buf[4];
24 uint32_t bits[2];
25 unsigned char in[64];
26 } MD5_CTX;
27
28 #ifndef Q3_BIG_ENDIAN
29 #define byteReverse(buf, len) /* Nothing */
30 #else
31 static void byteReverse(unsigned char *buf, unsigned longs);
32
33 /*
34 * Note: this code is harmless on little-endian machines.
35 */
byteReverse(unsigned char * buf,unsigned longs)36 static void byteReverse(unsigned char *buf, unsigned longs)
37 {
38 uint32_t t;
39 do {
40 t = (uint32_t)
41 ((unsigned) buf[3] << 8 | buf[2]) << 16 |
42 ((unsigned) buf[1] << 8 | buf[0]);
43 *(uint32_t *) buf = t;
44 buf += 4;
45 } while (--longs);
46 }
47 #endif // Q3_BIG_ENDIAN
48
49 /*
50 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
51 * initialization constants.
52 */
MD5Init(struct MD5Context * ctx)53 static void MD5Init(struct MD5Context *ctx)
54 {
55 ctx->buf[0] = 0x67452301;
56 ctx->buf[1] = 0xefcdab89;
57 ctx->buf[2] = 0x98badcfe;
58 ctx->buf[3] = 0x10325476;
59
60 ctx->bits[0] = 0;
61 ctx->bits[1] = 0;
62 }
63 /* The four core functions - F1 is optimized somewhat */
64
65 /* #define F1(x, y, z) (x & y | ~x & z) */
66 #define F1(x, y, z) (z ^ (x & (y ^ z)))
67 #define F2(x, y, z) F1(z, x, y)
68 #define F3(x, y, z) (x ^ y ^ z)
69 #define F4(x, y, z) (y ^ (x | ~z))
70
71 /* This is the central step in the MD5 algorithm. */
72 #define MD5STEP(f, w, x, y, z, data, s) \
73 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
74
75 /*
76 * The core of the MD5 algorithm, this alters an existing MD5 hash to
77 * reflect the addition of 16 longwords of new data. MD5Update blocks
78 * the data and converts bytes into longwords for this routine.
79 */
MD5Transform(uint32_t buf[4],uint32_t const in[16])80 static void MD5Transform(uint32_t buf[4],
81 uint32_t const in[16])
82 {
83 uint32_t a, b, c, d;
84
85 a = buf[0];
86 b = buf[1];
87 c = buf[2];
88 d = buf[3];
89
90 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
91 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
92 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
93 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
94 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
95 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
96 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
97 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
98 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
99 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
100 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
101 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
102 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
103 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
104 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
105 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
106
107 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
108 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
109 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
110 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
111 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
112 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
113 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
114 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
115 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
116 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
117 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
118 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
119 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
120 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
121 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
122 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
123
124 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
125 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
126 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
127 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
128 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
129 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
130 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
131 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
132 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
133 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
134 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
135 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
136 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
137 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
138 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
139 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
140
141 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
142 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
143 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
144 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
145 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
146 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
147 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
148 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
149 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
150 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
151 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
152 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
153 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
154 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
155 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
156 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
157
158 buf[0] += a;
159 buf[1] += b;
160 buf[2] += c;
161 buf[3] += d;
162 }
163
164 /*
165 * Update context to reflect the concatenation of another buffer full
166 * of bytes.
167 */
MD5Update(struct MD5Context * ctx,unsigned char const * buf,unsigned len)168 static void MD5Update(struct MD5Context *ctx, unsigned char const *buf,
169 unsigned len)
170 {
171 uint32_t t;
172
173 /* Update bitcount */
174
175 t = ctx->bits[0];
176 if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
177 ctx->bits[1]++; /* Carry from low to high */
178 ctx->bits[1] += len >> 29;
179
180 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
181
182 /* Handle any leading odd-sized chunks */
183
184 if (t) {
185 unsigned char *p = (unsigned char *) ctx->in + t;
186
187 t = 64 - t;
188 if (len < t) {
189 memcpy(p, buf, len);
190 return;
191 }
192 memcpy(p, buf, t);
193 byteReverse(ctx->in, 16);
194 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
195 buf += t;
196 len -= t;
197 }
198 /* Process data in 64-byte chunks */
199
200 while (len >= 64) {
201 memcpy(ctx->in, buf, 64);
202 byteReverse(ctx->in, 16);
203 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
204 buf += 64;
205 len -= 64;
206 }
207
208 /* Handle any remaining bytes of data. */
209
210 memcpy(ctx->in, buf, len);
211 }
212
213
214 /*
215 * Final wrapup - pad to 64-byte boundary with the bit pattern
216 * 1 0* (64-bit count of bits processed, MSB-first)
217 */
MD5Final(struct MD5Context * ctx,unsigned char * digest)218 static void MD5Final(struct MD5Context *ctx, unsigned char *digest)
219 {
220 unsigned count;
221 unsigned char *p;
222
223 /* Compute number of bytes mod 64 */
224 count = (ctx->bits[0] >> 3) & 0x3F;
225
226 /* Set the first char of padding to 0x80. This is safe since there is
227 always at least one byte free */
228 p = ctx->in + count;
229 *p++ = 0x80;
230
231 /* Bytes of padding needed to make 64 bytes */
232 count = 64 - 1 - count;
233
234 /* Pad out to 56 mod 64 */
235 if (count < 8) {
236 /* Two lots of padding: Pad the first block to 64 bytes */
237 memset(p, 0, count);
238 byteReverse(ctx->in, 16);
239 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
240
241 /* Now fill the next block with 56 bytes */
242 memset(ctx->in, 0, 56);
243 } else {
244 /* Pad block to 56 bytes */
245 memset(p, 0, count - 8);
246 }
247 byteReverse(ctx->in, 14);
248
249 /* Append length in bits and transform */
250 ((uint32_t *) ctx->in)[14] = ctx->bits[0];
251 ((uint32_t *) ctx->in)[15] = ctx->bits[1];
252
253 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
254 byteReverse((unsigned char *) ctx->buf, 4);
255
256 if (digest!=NULL)
257 memcpy(digest, ctx->buf, 16);
258 memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */
259 }
260
261
Com_MD5File(const char * fn,int length,const char * prefix,int prefix_len)262 char *Com_MD5File( const char *fn, int length, const char *prefix, int prefix_len )
263 {
264 static char final[33] = {""};
265 unsigned char digest[16] = {""};
266 fileHandle_t f;
267 MD5_CTX md5;
268 byte buffer[2048];
269 int i;
270 int filelen = 0;
271 int r = 0;
272 int total = 0;
273
274 Q_strncpyz( final, "", sizeof( final ) );
275
276 filelen = FS_SV_FOpenFileRead( fn, &f );
277
278 if( !f ) {
279 return final;
280 }
281 if( filelen < 1 ) {
282 FS_FCloseFile( f );
283 return final;
284 }
285 if(filelen < length || !length) {
286 length = filelen;
287 }
288
289 MD5Init(&md5);
290
291 if( prefix_len && *prefix )
292 MD5Update(&md5 , (unsigned char *)prefix, prefix_len);
293
294 for(;;) {
295 r = FS_Read(buffer, sizeof(buffer), f);
296 if(r < 1)
297 break;
298 if(r + total > length)
299 r = length - total;
300 total += r;
301 MD5Update(&md5 , buffer, r);
302 if(r < sizeof(buffer) || total >= length)
303 break;
304 }
305 FS_FCloseFile(f);
306 MD5Final(&md5, digest);
307 final[0] = '\0';
308 for(i = 0; i < 16; i++) {
309 Q_strcat(final, sizeof(final), va("%02X", digest[i]));
310 }
311 return final;
312 }
313
314 #endif // USE_PBMD5
315