[thirdparty/squid.git] / lib / md5.c

/*
 * This code implements the MD5 message-digest algorithm.
 * The algorithm is due to Ron Rivest.  This code was
 * written by Colin Plumb in 1993, no copyright is claimed.
 * This code is in the public domain; do with it what you wish.
 *
 * Equivalent code is available from RSA Data Security, Inc.
 * This code has been tested against that, and is equivalent,
 * except that you don't need to include two pages of legalese
 * with every copy.
 *
 * To compute the message digest of a chunk of bytes, declare an
 * SquidMD5Context structure, pass it to SquidMD5Init, call
 * SquidMD5Update as needed on buffers full of bytes, and then call
 * SquidMD5Final, which will fill a supplied 16-byte array with the
 * digest.
 *
 * Changed so as no longer to depend on Colin Plumb's `usual.h' header
 * definitions; now uses stuff from dpkg's config.h.
 *  - Ian Jackson <ian@chiark.greenend.org.uk>.
 * Still in the public domain.
 *
 * Changed SquidMD5Update to take a void * for easier use and some
 * other minor cleanup. - Henrik Nordstrom <henrik@henriknordstrom.net>.
 * Still in the public domain.
 *
 * Prefixed all symbols with "Squid" so they don't collide with
 * other libraries.  Duane Wessels <wessels@squid-cache.org>.
 * Still in the public domain.
 *
 */
#include "config.h"

#include "md5.h"

#if HAVE_STRING_H
#include <string.h>		/* for memcpy() */
#endif
#if HAVE_SYS_TYPES_H
#include <sys/types.h>		/* for stupid systems */
#endif

#ifdef WORDS_BIGENDIAN
void
static byteSwap(uint32_t * buf, unsigned words)
{
    uint8_t *p = (uint8_t *) buf;

    do {
	*buf++ = (uint32_t) ((unsigned) p[3] << 8 | p[2]) << 16 |
	    ((unsigned) p[1] << 8 | p[0]);
	p += 4;
    } while (--words);
}
#else
#define byteSwap(buf,words)
#endif

/*
 * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
 * initialization constants.
 */
void
SquidMD5Init(struct SquidMD5Context *ctx)
{
    ctx->buf[0] = 0x67452301;
    ctx->buf[1] = 0xefcdab89;
    ctx->buf[2] = 0x98badcfe;
    ctx->buf[3] = 0x10325476;

    ctx->bytes[0] = 0;
    ctx->bytes[1] = 0;
}

/*
 * Update context to reflect the concatenation of another buffer full
 * of bytes.
 */
void
SquidMD5Update(struct SquidMD5Context *ctx, const void *_buf, unsigned len)
{
    uint8_t const *buf = _buf;
    uint32_t t;

    /* Update byte count */

    t = ctx->bytes[0];
    if ((ctx->bytes[0] = t + len) < t)
	ctx->bytes[1]++;	/* Carry from low to high */

    t = 64 - (t & 0x3f);	/* Space available in ctx->in (at least 1) */
    if (t > len) {
	memcpy((uint8_t *) ctx->in + 64 - t, buf, len);
	return;
    }
    /* First chunk is an odd size */
    memcpy((uint8_t *) ctx->in + 64 - t, buf, t);
    byteSwap(ctx->in, 16);
    SquidMD5Transform(ctx->buf, ctx->in);
    buf += t;
    len -= t;

    /* Process data in 64-byte chunks */
    while (len >= 64) {
	memcpy(ctx->in, buf, 64);
	byteSwap(ctx->in, 16);
	SquidMD5Transform(ctx->buf, ctx->in);
	buf += 64;
	len -= 64;
    }

    /* Handle any remaining bytes of data. */
    memcpy(ctx->in, buf, len);
}

/*
 * Final wrapup - pad to 64-byte boundary with the bit pattern 
 * 1 0* (64-bit count of bits processed, MSB-first)
 */
void
SquidMD5Final(unsigned char digest[16], struct SquidMD5Context *ctx)
{
    int count = ctx->bytes[0] & 0x3f;	/* Number of bytes in ctx->in */
    uint8_t *p = (uint8_t *) ctx->in + count;

    /* Set the first char of padding to 0x80.  There is always room. */
    *p++ = 0x80;

    /* Bytes of padding needed to make 56 bytes (-8..55) */
    count = 56 - 1 - count;

    if (count < 0) {		/* Padding forces an extra block */
	memset(p, 0, count + 8);
	byteSwap(ctx->in, 16);
	SquidMD5Transform(ctx->buf, ctx->in);
	p = (uint8_t *) ctx->in;
	count = 56;
    }
    memset(p, 0, count);
    byteSwap(ctx->in, 14);

    /* Append length in bits and transform */
    ctx->in[14] = ctx->bytes[0] << 3;
    ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
    SquidMD5Transform(ctx->buf, ctx->in);

    byteSwap(ctx->buf, 4);
    memcpy(digest, ctx->buf, 16);
    memset(ctx, 0, sizeof(ctx));	/* In case it's sensitive */
}

#ifndef ASM_MD5

/* The four core functions - F1 is optimized somewhat */

/* #define F1(x, y, z) (x & y | ~x & z) */
#define F1(x, y, z) (z ^ (x & (y ^ z)))
#define F2(x, y, z) F1(z, x, y)
#define F3(x, y, z) (x ^ y ^ z)
#define F4(x, y, z) (y ^ (x | ~z))

/* This is the central step in the MD5 algorithm. */
#define MD5STEP(f,w,x,y,z,in,s) \
	 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x)

/*
 * The core of the MD5 algorithm, this alters an existing MD5 hash to
 * reflect the addition of 16 longwords of new data.  SquidMD5Update blocks
 * the data and converts bytes into longwords for this routine.
 */
void
SquidMD5Transform(uint32_t buf[4], uint32_t const in[16])
{
    register uint32_t a, b, c, d;

    a = buf[0];
    b = buf[1];
    c = buf[2];
    d = buf[3];

    MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
    MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
    MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
    MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
    MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
    MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
    MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
    MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
    MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
    MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
    MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
    MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
    MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
    MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
    MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
    MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);

    MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
    MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
    MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
    MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
    MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
    MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
    MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
    MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
    MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
    MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
    MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
    MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
    MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
    MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
    MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
    MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);

    MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
    MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
    MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
    MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
    MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
    MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
    MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
    MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
    MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
    MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
    MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
    MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
    MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
    MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
    MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
    MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);

    MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
    MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
    MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
    MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
    MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
    MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
    MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
    MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
    MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
    MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
    MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
    MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
    MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
    MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
    MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
    MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);

    buf[0] += a;
    buf[1] += b;
    buf[2] += c;
    buf[3] += d;
}

#endif /* !ASM_MD5 */
Commit	Line	Data
0e2cd867	1	/*
a34ac434	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
c3031d67	13	* SquidMD5Context structure, pass it to SquidMD5Init, call
	14	* SquidMD5Update as needed on buffers full of bytes, and then call
	15	* SquidMD5Final, which will fill a supplied 16-byte array with the
	16	* digest.
a34ac434	17	*
	18	* Changed so as no longer to depend on Colin Plumb's `usual.h' header
	19	* definitions; now uses stuff from dpkg's config.h.
	20	* - Ian Jackson <ian@chiark.greenend.org.uk>.
	21	* Still in the public domain.
	22	*
c3031d67	23	* Changed SquidMD5Update to take a void * for easier use and some
	24	* other minor cleanup. - Henrik Nordstrom <henrik@henriknordstrom.net>.
	25	* Still in the public domain.
	26	*
	27	* Prefixed all symbols with "Squid" so they don't collide with
	28	* other libraries. Duane Wessels <wessels@squid-cache.org>.
a34ac434	29	* Still in the public domain.
a34ac434	30	*
0e2cd867	31	*/
a34ac434	32	#include "config.h"
0e473d70	33
3d4022fa	34	#include "md5.h"
3d4022fa	35
dac27377	36	#if HAVE_STRING_H
a34ac434	37	#include <string.h> /* for memcpy() */
dac27377	38	#endif
a34ac434	39	#if HAVE_SYS_TYPES_H
a34ac434	40	#include <sys/types.h> /* for stupid systems */
dac27377	41	#endif
6507d007	42
a34ac434	43	#ifdef WORDS_BIGENDIAN
6507d007	44	void
c3031d67	45	static byteSwap(uint32_t * buf, unsigned words)
6507d007	46	{
a34ac434	47	uint8_t p = (uint8_t ) buf;
	48
	49	do {
	50	*buf++ = (uint32_t) ((unsigned) p[3] << 8 \| p[2]) << 16 \|
	51	((unsigned) p[1] << 8 \| p[0]);
	52	p += 4;
	53	} while (--words);
6507d007	54	}
a34ac434	55	#else
	56	#define byteSwap(buf,words)
	57	#endif
6507d007	58
6507d007	59	/*
a34ac434	60	* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
a34ac434	61	* initialization constants.
6507d007	62	*/
6507d007	63	void
c3031d67	64	SquidMD5Init(struct SquidMD5Context *ctx)
6507d007	65	{
a34ac434	66	ctx->buf[0] = 0x67452301;
	67	ctx->buf[1] = 0xefcdab89;
	68	ctx->buf[2] = 0x98badcfe;
	69	ctx->buf[3] = 0x10325476;
6507d007	70
a34ac434	71	ctx->bytes[0] = 0;
a34ac434	72	ctx->bytes[1] = 0;
6507d007	73	}
	74
	75	/*
a34ac434	76	* Update context to reflect the concatenation of another buffer full
a34ac434	77	* of bytes.
6507d007	78	*/
6507d007	79	void
c3031d67	80	SquidMD5Update(struct SquidMD5Context ctx, const void _buf, unsigned len)
6507d007	81	{
a34ac434	82	uint8_t const *buf = _buf;
a34ac434	83	uint32_t t;
6507d007	84
a34ac434	85	/* Update byte count */
6507d007	86
a34ac434	87	t = ctx->bytes[0];
	88	if ((ctx->bytes[0] = t + len) < t)
	89	ctx->bytes[1]++; /* Carry from low to high */
6507d007	90
a34ac434	91	t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */
	92	if (t > len) {
	93	memcpy((uint8_t *) ctx->in + 64 - t, buf, len);
	94	return;
	95	}
	96	/* First chunk is an odd size */
	97	memcpy((uint8_t *) ctx->in + 64 - t, buf, t);
	98	byteSwap(ctx->in, 16);
c3031d67	99	SquidMD5Transform(ctx->buf, ctx->in);
a34ac434	100	buf += t;
	101	len -= t;
	102
	103	/* Process data in 64-byte chunks */
	104	while (len >= 64) {
	105	memcpy(ctx->in, buf, 64);
	106	byteSwap(ctx->in, 16);
c3031d67	107	SquidMD5Transform(ctx->buf, ctx->in);
a34ac434	108	buf += 64;
	109	len -= 64;
	110	}
6507d007	111
a34ac434	112	/* Handle any remaining bytes of data. */
a34ac434	113	memcpy(ctx->in, buf, len);
6507d007	114	}
	115
	116	/*
a34ac434	117	* Final wrapup - pad to 64-byte boundary with the bit pattern
a34ac434	118	* 1 0* (64-bit count of bits processed, MSB-first)
6507d007	119	*/
a34ac434	120	void
c3031d67	121	SquidMD5Final(unsigned char digest[16], struct SquidMD5Context *ctx)
6507d007	122	{
a34ac434	123	int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */
a34ac434	124	uint8_t p = (uint8_t ) ctx->in + count;
6507d007	125
a34ac434	126	/* Set the first char of padding to 0x80. There is always room. */
a34ac434	127	*p++ = 0x80;
6507d007	128
a34ac434	129	/* Bytes of padding needed to make 56 bytes (-8..55) */
a34ac434	130	count = 56 - 1 - count;
6507d007	131
a34ac434	132	if (count < 0) { /* Padding forces an extra block */
	133	memset(p, 0, count + 8);
	134	byteSwap(ctx->in, 16);
c3031d67	135	SquidMD5Transform(ctx->buf, ctx->in);
a34ac434	136	p = (uint8_t *) ctx->in;
	137	count = 56;
	138	}
	139	memset(p, 0, count);
	140	byteSwap(ctx->in, 14);
6507d007	141
a34ac434	142	/* Append length in bits and transform */
	143	ctx->in[14] = ctx->bytes[0] << 3;
	144	ctx->in[15] = ctx->bytes[1] << 3 \| ctx->bytes[0] >> 29;
c3031d67	145	SquidMD5Transform(ctx->buf, ctx->in);
6507d007	146
a34ac434	147	byteSwap(ctx->buf, 4);
	148	memcpy(digest, ctx->buf, 16);
	149	memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
6507d007	150	}
6507d007	151
a34ac434	152	#ifndef ASM_MD5
6507d007	153
a34ac434	154	/* The four core functions - F1 is optimized somewhat */
6507d007	155
a34ac434	156	/* #define F1(x, y, z) (x & y \| ~x & z) */
	157	#define F1(x, y, z) (z ^ (x & (y ^ z)))
	158	#define F2(x, y, z) F1(z, x, y)
	159	#define F3(x, y, z) (x ^ y ^ z)
	160	#define F4(x, y, z) (y ^ (x \| ~z))
6507d007	161
a34ac434	162	/* This is the central step in the MD5 algorithm. */
	163	#define MD5STEP(f,w,x,y,z,in,s) \
	164	(w += f(x,y,z) + in, w = (w<<s \| w>>(32-s)) + x)
6507d007	165
6507d007	166	/*
a34ac434	167	* The core of the MD5 algorithm, this alters an existing MD5 hash to
c3031d67	168	* reflect the addition of 16 longwords of new data. SquidMD5Update blocks
a34ac434	169	* the data and converts bytes into longwords for this routine.
6507d007	170	*/
a34ac434	171	void
c3031d67	172	SquidMD5Transform(uint32_t buf[4], uint32_t const in[16])
6507d007	173	{
a34ac434	174	register uint32_t a, b, c, d;
	175
	176	a = buf[0];
	177	b = buf[1];
	178	c = buf[2];
	179	d = buf[3];
	180
	181	MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
	182	MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
	183	MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
	184	MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
	185	MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
	186	MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
	187	MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
	188	MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
	189	MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
	190	MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
	191	MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
	192	MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
	193	MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
	194	MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
	195	MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
	196	MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
	197
	198	MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
	199	MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
	200	MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
	201	MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
	202	MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
	203	MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
	204	MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
	205	MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
	206	MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
	207	MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
	208	MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
	209	MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
	210	MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
	211	MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
	212	MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
	213	MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
	214
	215	MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
	216	MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
	217	MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
	218	MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
	219	MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
	220	MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
	221	MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
	222	MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
	223	MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
	224	MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
	225	MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
	226	MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
	227	MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
	228	MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
	229	MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
	230	MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
	231
	232	MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
	233	MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
	234	MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
	235	MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
	236	MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
	237	MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
238	MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
239	MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
240	MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
241	MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
242	MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
243	MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
244	MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
245	MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
246	MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
247	MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
248
249	buf[0] += a;
250	buf[1] += b;
251	buf[2] += c;
252	buf[3] += d;
6507d007	253	}
461eef68	254
3d4022fa	255	#endif /* !ASM_MD5 */