2 * This library is free software; you can redistribute it and/or
3 * modify it under the same terms as Perl itself.
5 * Copyright 1998-2000 Gisle Aas.
6 * Copyright 1995-1996 Neil Winton.
7 * Copyright 1991-1992 RSA Data Security, Inc.
9 * This code is derived from Neil Winton's MD5-1.7 Perl module, which in
10 * turn is derived from the reference implementation in RFC 1231 which
11 * comes with this message:
13 * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
16 * License to copy and use this software is granted provided that it
17 * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
18 * Algorithm" in all material mentioning or referencing this software
21 * License is also granted to make and use derivative works provided
22 * that such works are identified as "derived from the RSA Data
23 * Security, Inc. MD5 Message-Digest Algorithm" in all material
24 * mentioning or referencing the derived work.
26 * RSA Data Security, Inc. makes no representations concerning either
27 * the merchantability of this software or the suitability of this
28 * software for any particular purpose. It is provided "as is"
29 * without express or implied warranty of any kind.
31 * These notices must be retained in any copies of any part of this
32 * documentation and/or software.
45 /*#define MD5_DEBUG /**/
47 /* Perl does not guarantee that U32 is exactly 32 bits. Some system
48 * has no integral type with exactly 32 bits. For instance, A Cray has
49 * short, int and long all at 64 bits so we need to apply this macro
50 * to reduce U32 values to 32 bits at appropriate places. If U32
51 * really does have 32 bits then this is a no-op.
53 #if BYTEORDER > 0x4321 || defined(TRUNCATE_U32)
54 #define TO32(x) ((x) & 0xFFFFffff)
55 #define TRUNC32(x) ((x) &= 0xFFFFffff)
58 #define TRUNC32(x) /*nothing*/
61 /* The MD5 algorithm is defined in terms of little endian 32-bit
62 * values. The following macros (and functions) allow us to convert
63 * between native integers and such values.
66 #ifndef U32_ALIGNMENT_REQUIRED
67 #if BYTEORDER == 0x1234 /* 32-bit little endian */
68 #define BYTESWAP(x) (x) /* no-op */
70 #elif BYTEORDER == 0x4321 /* 32-bit big endian */
71 #define BYTESWAP(x) ((((x)&0xFF)<<24) \
73 |(((x)&0x0000FF00)<<8) \
74 |(((x)&0x00FF0000)>>8) )
79 static void u2s(U32 u, U8* s)
82 *s++ = (u >> 8) & 0xFF;
83 *s++ = (u >> 16) & 0xFF;
84 *s = (u >> 24) & 0xFF;
87 #define s2u(s,u) ((u) = (U32)(*s) | \
88 ((U32)(*(s+1)) << 8) | \
89 ((U32)(*(s+2)) << 16) | \
90 ((U32)(*(s+3)) << 24))
93 #define MD5_CTX_SIGNATURE 200003165
95 /* This stucture keeps the current state of algorithm.
98 U32 signature; /* safer cast in get_md5_ctx() */
99 U32 A, B, C, D; /* current digest */
100 U32 bytes_low; /* counts bytes in message */
101 U32 bytes_high; /* turn it into a 64-bit counter */
102 U8 buffer[128]; /* collect complete 64 byte blocks */
106 /* Padding is added at the end of the message in order to fill a
107 * complete 64 byte block (- 8 bytes for the message length). The
108 * padding is also the reason the buffer in MD5_CTX have to be
111 static unsigned char PADDING[64] = {
112 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
113 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
114 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
117 /* Constants for MD5Transform routine.
136 /* F, G, H and I are basic MD5 functions.
138 #define F(x, y, z) (((x) & ((y) ^ (z)) ^ (z)))
139 #define G(x, y, z) F(z, x, y)
140 #define H(x, y, z) ((x) ^ (y) ^ (z))
141 #define I(x, y, z) ((y) ^ ((x) | (~z)))
143 /* ROTATE_LEFT rotates x left n bits.
145 #define ROTATE_LEFT(x, n) (((x) << (n) | ((x) >> (32-(n)))))
147 /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
148 * Rotation is separate from addition to prevent recomputation.
150 #define FF(a, b, c, d, s, ac) \
151 (a) += F ((b), (c), (d)) + (NEXTx) + (U32)(ac); \
153 (a) = ROTATE_LEFT ((a), (s)); \
157 #define GG(a, b, c, d, x, s, ac) \
158 (a) += G ((b), (c), (d)) + X[x] + (U32)(ac); \
160 (a) = ROTATE_LEFT ((a), (s)); \
164 #define HH(a, b, c, d, x, s, ac) \
165 (a) += H ((b), (c), (d)) + X[x] + (U32)(ac); \
167 (a) = ROTATE_LEFT ((a), (s)); \
171 #define II(a, b, c, d, x, s, ac) \
172 (a) += I ((b), (c), (d)) + X[x] + (U32)(ac); \
174 (a) = ROTATE_LEFT ((a), (s)); \
180 MD5Init(MD5_CTX *ctx)
189 ctx->bytes_low = ctx->bytes_high = 0;
194 MD5Transform(MD5_CTX* ctx, const U8* buf, STRLEN blocks)
196 static int tcount = 0;
203 #ifndef U32_ALIGNMENT_REQUIRED
204 const U32 *x = (U32*)buf; /* really just type casting */
213 #if BYTEORDER == 0x1234 && !defined(U32_ALIGNMENT_REQUIRED)
217 U32 X[16]; /* converted values, used in round 2-4 */
221 #define NEXTx (tmp=*x++, *uptr++ = BYTESWAP(tmp))
223 #define NEXTx (s2u(buf,tmp), buf += 4, *uptr++ = tmp)
228 if (buf == ctx->buffer)
229 fprintf(stderr,"%5d: Transform ctx->buffer", ++tcount);
231 fprintf(stderr,"%5d: Transform %p (%d)", ++tcount, buf, blocks);
236 for (i = 0; i < 16; i++) {
237 fprintf(stderr,"%x,", x[i]);
239 fprintf(stderr,"]\n");
244 FF (a, b, c, d, S11, 0xd76aa478); /* 1 */
245 FF (d, a, b, c, S12, 0xe8c7b756); /* 2 */
246 FF (c, d, a, b, S13, 0x242070db); /* 3 */
247 FF (b, c, d, a, S14, 0xc1bdceee); /* 4 */
248 FF (a, b, c, d, S11, 0xf57c0faf); /* 5 */
249 FF (d, a, b, c, S12, 0x4787c62a); /* 6 */
250 FF (c, d, a, b, S13, 0xa8304613); /* 7 */
251 FF (b, c, d, a, S14, 0xfd469501); /* 8 */
252 FF (a, b, c, d, S11, 0x698098d8); /* 9 */
253 FF (d, a, b, c, S12, 0x8b44f7af); /* 10 */
254 FF (c, d, a, b, S13, 0xffff5bb1); /* 11 */
255 FF (b, c, d, a, S14, 0x895cd7be); /* 12 */
256 FF (a, b, c, d, S11, 0x6b901122); /* 13 */
257 FF (d, a, b, c, S12, 0xfd987193); /* 14 */
258 FF (c, d, a, b, S13, 0xa679438e); /* 15 */
259 FF (b, c, d, a, S14, 0x49b40821); /* 16 */
262 GG (a, b, c, d, 1, S21, 0xf61e2562); /* 17 */
263 GG (d, a, b, c, 6, S22, 0xc040b340); /* 18 */
264 GG (c, d, a, b, 11, S23, 0x265e5a51); /* 19 */
265 GG (b, c, d, a, 0, S24, 0xe9b6c7aa); /* 20 */
266 GG (a, b, c, d, 5, S21, 0xd62f105d); /* 21 */
267 GG (d, a, b, c, 10, S22, 0x2441453); /* 22 */
268 GG (c, d, a, b, 15, S23, 0xd8a1e681); /* 23 */
269 GG (b, c, d, a, 4, S24, 0xe7d3fbc8); /* 24 */
270 GG (a, b, c, d, 9, S21, 0x21e1cde6); /* 25 */
271 GG (d, a, b, c, 14, S22, 0xc33707d6); /* 26 */
272 GG (c, d, a, b, 3, S23, 0xf4d50d87); /* 27 */
273 GG (b, c, d, a, 8, S24, 0x455a14ed); /* 28 */
274 GG (a, b, c, d, 13, S21, 0xa9e3e905); /* 29 */
275 GG (d, a, b, c, 2, S22, 0xfcefa3f8); /* 30 */
276 GG (c, d, a, b, 7, S23, 0x676f02d9); /* 31 */
277 GG (b, c, d, a, 12, S24, 0x8d2a4c8a); /* 32 */
280 HH (a, b, c, d, 5, S31, 0xfffa3942); /* 33 */
281 HH (d, a, b, c, 8, S32, 0x8771f681); /* 34 */
282 HH (c, d, a, b, 11, S33, 0x6d9d6122); /* 35 */
283 HH (b, c, d, a, 14, S34, 0xfde5380c); /* 36 */
284 HH (a, b, c, d, 1, S31, 0xa4beea44); /* 37 */
285 HH (d, a, b, c, 4, S32, 0x4bdecfa9); /* 38 */
286 HH (c, d, a, b, 7, S33, 0xf6bb4b60); /* 39 */
287 HH (b, c, d, a, 10, S34, 0xbebfbc70); /* 40 */
288 HH (a, b, c, d, 13, S31, 0x289b7ec6); /* 41 */
289 HH (d, a, b, c, 0, S32, 0xeaa127fa); /* 42 */
290 HH (c, d, a, b, 3, S33, 0xd4ef3085); /* 43 */
291 HH (b, c, d, a, 6, S34, 0x4881d05); /* 44 */
292 HH (a, b, c, d, 9, S31, 0xd9d4d039); /* 45 */
293 HH (d, a, b, c, 12, S32, 0xe6db99e5); /* 46 */
294 HH (c, d, a, b, 15, S33, 0x1fa27cf8); /* 47 */
295 HH (b, c, d, a, 2, S34, 0xc4ac5665); /* 48 */
298 II (a, b, c, d, 0, S41, 0xf4292244); /* 49 */
299 II (d, a, b, c, 7, S42, 0x432aff97); /* 50 */
300 II (c, d, a, b, 14, S43, 0xab9423a7); /* 51 */
301 II (b, c, d, a, 5, S44, 0xfc93a039); /* 52 */
302 II (a, b, c, d, 12, S41, 0x655b59c3); /* 53 */
303 II (d, a, b, c, 3, S42, 0x8f0ccc92); /* 54 */
304 II (c, d, a, b, 10, S43, 0xffeff47d); /* 55 */
305 II (b, c, d, a, 1, S44, 0x85845dd1); /* 56 */
306 II (a, b, c, d, 8, S41, 0x6fa87e4f); /* 57 */
307 II (d, a, b, c, 15, S42, 0xfe2ce6e0); /* 58 */
308 II (c, d, a, b, 6, S43, 0xa3014314); /* 59 */
309 II (b, c, d, a, 13, S44, 0x4e0811a1); /* 60 */
310 II (a, b, c, d, 4, S41, 0xf7537e82); /* 61 */
311 II (d, a, b, c, 11, S42, 0xbd3af235); /* 62 */
312 II (c, d, a, b, 2, S43, 0x2ad7d2bb); /* 63 */
313 II (b, c, d, a, 9, S44, 0xeb86d391); /* 64 */
330 ctx_dump(MD5_CTX* ctx)
332 static char buf[1024];
333 sprintf(buf, "{A=%x,B=%x,C=%x,D=%x,%d,%d(%d)}",
334 ctx->A, ctx->B, ctx->C, ctx->D,
335 ctx->bytes_low, ctx->bytes_high, (ctx->bytes_low&0x3F));
342 MD5Update(MD5_CTX* ctx, const U8* buf, STRLEN len)
345 STRLEN fill = ctx->bytes_low & 0x3F;
348 static int ucount = 0;
349 fprintf(stderr,"%5i: Update(%s, %p, %d)\n", ++ucount, ctx_dump(ctx),
353 ctx->bytes_low += len;
354 if (ctx->bytes_low < len) /* wrap around */
358 STRLEN missing = 64 - fill;
360 Copy(buf, ctx->buffer + fill, len, U8);
363 Copy(buf, ctx->buffer + fill, missing, U8);
364 MD5Transform(ctx, ctx->buffer, 1);
371 MD5Transform(ctx, buf, blocks);
372 if ( (len &= 0x3F)) {
373 Copy(buf + (blocks << 6), ctx->buffer, len, U8);
379 MD5Final(U8* digest, MD5_CTX *ctx)
381 STRLEN fill = ctx->bytes_low & 0x3F;
382 STRLEN padlen = (fill < 56 ? 56 : 120) - fill;
383 U32 bits_low, bits_high;
385 fprintf(stderr," Final: %s\n", ctx_dump(ctx));
387 Copy(PADDING, ctx->buffer + fill, padlen, U8);
390 bits_low = ctx->bytes_low << 3;
391 bits_high = (ctx->bytes_high << 3) | (ctx->bytes_low >> 29);
393 *(U32*)(ctx->buffer + fill) = BYTESWAP(bits_low); fill += 4;
394 *(U32*)(ctx->buffer + fill) = BYTESWAP(bits_high); fill += 4;
396 u2s(bits_low, ctx->buffer + fill); fill += 4;
397 u2s(bits_high, ctx->buffer + fill); fill += 4;
400 MD5Transform(ctx, ctx->buffer, fill >> 6);
402 fprintf(stderr," Result: %s\n", ctx_dump(ctx));
406 *(U32*)digest = BYTESWAP(ctx->A); digest += 4;
407 *(U32*)digest = BYTESWAP(ctx->B); digest += 4;
408 *(U32*)digest = BYTESWAP(ctx->C); digest += 4;
409 *(U32*)digest = BYTESWAP(ctx->D);
412 u2s(ctx->B, digest+4);
413 u2s(ctx->C, digest+8);
414 u2s(ctx->D, digest+12);
419 #define INT2PTR(any,d) (any)(d)
422 static MD5_CTX* get_md5_ctx(SV* sv)
427 MD5_CTX* ctx = INT2PTR(MD5_CTX*, SvIV(sv));
428 if (ctx && ctx->signature == MD5_CTX_SIGNATURE) {
433 croak("Not a reference to a Digest::MD5 object");
434 return (MD5_CTX*)0; /* some compilers insist on a return value */
438 static char* hex_16(const unsigned char* from, char* to)
440 static char *hexdigits = "0123456789abcdef";
441 const unsigned char *end = from + 16;
445 *d++ = hexdigits[(*from >> 4)];
446 *d++ = hexdigits[(*from & 0x0F)];
453 static char* base64_16(const unsigned char* from, char* to)
455 static char* base64 =
456 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
457 const unsigned char *end = from + 16;
458 unsigned char c1, c2, c3;
463 *d++ = base64[c1>>2];
465 *d++ = base64[(c1 & 0x3) << 4];
470 *d++ = base64[((c1 & 0x3) << 4) | ((c2 & 0xF0) >> 4)];
471 *d++ = base64[((c2 & 0xF) << 2) | ((c3 & 0xC0) >>6)];
472 *d++ = base64[c3 & 0x3F];
483 static SV* make_mortal_sv(const unsigned char *src, int type)
495 ret = hex_16(src, result);
499 ret = base64_16(src, result);
503 croak("Bad convertion type (%d)", type);
506 return sv_2mortal(newSVpv(ret,len));
510 /********************************************************************/
512 typedef PerlIO* InputStream;
514 MODULE = Digest::MD5 PACKAGE = Digest::MD5
524 if (!SvROK(xclass)) {
526 char *sclass = SvPV(xclass, my_na);
527 New(55, context, 1, MD5_CTX);
528 context->signature = MD5_CTX_SIGNATURE;
529 ST(0) = sv_newmortal();
530 sv_setref_pv(ST(0), sclass, (void*)context);
531 SvREADONLY_on(SvRV(ST(0)));
533 context = get_md5_ctx(xclass);
548 MD5_CTX* context = get_md5_ctx(self);
553 for (i = 1; i < items; i++) {
554 data = (unsigned char *)(SvPVbyte(ST(i), len));
555 MD5Update(context, data, len);
557 XSRETURN(1); /* self */
564 MD5_CTX* context = get_md5_ctx(self);
565 STRLEN fill = context->bytes_low & 0x3F;
566 unsigned char buffer[4096];
571 /* The MD5Update() function is faster if it can work with
572 * complete blocks. This will fill up any buffered block
575 STRLEN missing = 64 - fill;
576 if ( (n = PerlIO_read(fh, buffer, missing)))
577 MD5Update(context, buffer, n);
579 XSRETURN(1); /* self */
582 /* Process blocks until EOF */
583 while ( (n = PerlIO_read(fh, buffer, sizeof(buffer)))) {
584 MD5Update(context, buffer, n);
587 XSRETURN(1); /* self */
593 Digest::MD5::digest = F_BIN
594 Digest::MD5::hexdigest = F_HEX
595 Digest::MD5::b64digest = F_B64
597 unsigned char digeststr[16];
599 MD5Final(digeststr, context);
600 MD5Init(context); /* In case it is reused */
601 ST(0) = make_mortal_sv(digeststr, ix);
607 Digest::MD5::md5 = F_BIN
608 Digest::MD5::md5_hex = F_HEX
609 Digest::MD5::md5_base64 = F_B64
615 unsigned char digeststr[16];
618 for (i = 0; i < items; i++) {
619 data = (unsigned char *)(SvPVbyte(ST(i), len));
620 MD5Update(&ctx, data, len);
622 MD5Final(digeststr, &ctx);
623 ST(0) = make_mortal_sv(digeststr, ix);