[cygwin-apps/cygutils.git] / src / mcookie / 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.
 * ORIGINAL LICENSE:
 *   This code is in the public domain; do with it what you wish.
 * Revised 2002-07-12: Charles Wilson
 *    modified to work on cygwin; integrated into cygutils package
 *    Changes licensed under the GPL
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 * See the COPYING file for license information.
 */ 

/* 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
 * MD5Context structure, pass it to MD5Init, call MD5Update as
 * needed on buffers full of bytes, and then call MD5Final, which
 * will fill a supplied 16-byte array with the digest.
 */
#if HAVE_CONFIG_H
#include "config.h"
#endif
#include "common.h"

/* included by common.h *//*
#include <string.h>
*/
#include "md5.h"

#ifndef HIGHFIRST
#define byteReverse(buf, len)	/* Nothing */
#else
void byteReverse(unsigned char *buf, unsigned longs);

#ifndef ASM_MD5
/*
 * Note: this code is harmless on little-endian machines.
 */
void byteReverse(unsigned char *buf, unsigned longs)
{
    uint32 t;
    do {
	t = (uint32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
	    ((unsigned) buf[1] << 8 | buf[0]);
	*(uint32 *) buf = t;
	buf += 4;
    } while (--longs);
}
#endif
#endif

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

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

/*
 * Update context to reflect the concatenation of another buffer full
 * of bytes.
 */
void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
{
    uint32 t;

    /* Update bitcount */

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

    t = (t >> 3) & 0x3f;	/* Bytes already in shsInfo->data */

    /* Handle any leading odd-sized chunks */

    if (t) {
	unsigned char *p = (unsigned char *) ctx->in + t;

	t = 64 - t;
	if (len < t) {
	    memcpy(p, buf, len);
	    return;
	}
	memcpy(p, buf, t);
	byteReverse(ctx->in, 16);
	MD5Transform(ctx->buf, (uint32 *) ctx->in);
	buf += t;
	len -= t;
    }
    /* Process data in 64-byte chunks */

    while (len >= 64) {
	memcpy(ctx->in, buf, 64);
	byteReverse(ctx->in, 16);
	MD5Transform(ctx->buf, (uint32 *) 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 MD5Final(unsigned char digest[16], struct MD5Context *ctx)
{
    unsigned count;
    unsigned char *p;

    /* Compute number of bytes mod 64 */
    count = (ctx->bits[0] >> 3) & 0x3F;

    /* Set the first char of padding to 0x80.  This is safe since there is
       always at least one byte free */
    p = ctx->in + count;
    *p++ = 0x80;

    /* Bytes of padding needed to make 64 bytes */
    count = 64 - 1 - count;

    /* Pad out to 56 mod 64 */
    if (count < 8) {
	/* Two lots of padding:  Pad the first block to 64 bytes */
	memset(p, 0, count);
	byteReverse(ctx->in, 16);
	MD5Transform(ctx->buf, (uint32 *) ctx->in);

	/* Now fill the next block with 56 bytes */
	memset(ctx->in, 0, 56);
    } else {
	/* Pad block to 56 bytes */
	memset(p, 0, count - 8);
    }
    byteReverse(ctx->in, 14);

    /* Append length in bits and transform */
    ((uint32 *) ctx->in)[14] = ctx->bits[0];
    ((uint32 *) ctx->in)[15] = ctx->bits[1];

    MD5Transform(ctx->buf, (uint32 *) ctx->in);
    byteReverse((unsigned char *) 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, data, s) \
	( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )

/*
 * The core of the MD5 algorithm, this alters an existing MD5 hash to
 * reflect the addition of 16 longwords of new data.  MD5Update blocks
 * the data and converts bytes into longwords for this routine.
 */
void MD5Transform(uint32 buf[4], uint32 const in[16])
{
    register uint32 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
Commit	Line	Data
eb7cdcb6 CW	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	* ORIGINAL LICENSE:
	6	* This code is in the public domain; do with it what you wish.
	7	* Revised 2002-07-12: Charles Wilson
	8	* modified to work on cygwin; integrated into cygutils package
	9	* Changes licensed under the GPL
	10	*
	11	* This program is free software; you can redistribute it and/or
	12	* modify it under the terms of the GNU General Public License
	13	* as published by the Free Software Foundation; either version 2
	14	* of the License, or (at your option) any later version.
	15	*
	16	* This program is distributed in the hope that it will be useful,
	17	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	18	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	19	* GNU General Public License for more details.
	20	*
	21	* You should have received a copy of the GNU General Public License
	22	* along with this program; if not, write to the Free Software
	23	* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
	24	*
	25	* See the COPYING file for license information.
	26	*/
	27
	28	/* Equivalent code is available from RSA Data Security, Inc.
	29	* This code has been tested against that, and is equivalent,
	30	* except that you don't need to include two pages of legalese
	31	* with every copy.
	32	*
	33	* To compute the message digest of a chunk of bytes, declare an
	34	* MD5Context structure, pass it to MD5Init, call MD5Update as
	35	* needed on buffers full of bytes, and then call MD5Final, which
	36	* will fill a supplied 16-byte array with the digest.
	37	*/
	38	#if HAVE_CONFIG_H
	39	#include "config.h"
	40	#endif
	41	#include "common.h"
	42
	43	/* included by common.h //
	44	#include <string.h>
	45	*/
	46	#include "md5.h"
	47
	48	#ifndef HIGHFIRST
	49	#define byteReverse(buf, len) /* Nothing */
	50	#else
	51	void byteReverse(unsigned char *buf, unsigned longs);
	52
	53	#ifndef ASM_MD5
	54	/*
	55	* Note: this code is harmless on little-endian machines.
	56	*/
	57	void byteReverse(unsigned char *buf, unsigned longs)
	58	{
	59	uint32 t;
	60	do {
	61	t = (uint32) ((unsigned) buf[3] << 8 \| buf[2]) << 16 \|
	62	((unsigned) buf[1] << 8 \| buf[0]);
	63	(uint32 ) buf = t;
	64	buf += 4;
65	} while (--longs);
66	}
67	#endif
68	#endif
69
70	/*
71	* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
72	* initialization constants.
73	*/
74	void MD5Init(struct MD5Context *ctx)
75	{
76	ctx->buf[0] = 0x67452301;
77	ctx->buf[1] = 0xefcdab89;
78	ctx->buf[2] = 0x98badcfe;
79	ctx->buf[3] = 0x10325476;
80
81	ctx->bits[0] = 0;
82	ctx->bits[1] = 0;
83	}
84
85	/*
86	* Update context to reflect the concatenation of another buffer full
87	* of bytes.
88	*/
89	void MD5Update(struct MD5Context ctx, unsigned char const buf, unsigned len)
90	{
91	uint32 t;
92
93	/* Update bitcount */
94
95	t = ctx->bits[0];
96	if ((ctx->bits[0] = t + ((uint32) len << 3)) < t)
97	ctx->bits[1]++; /* Carry from low to high */
98	ctx->bits[1] += len >> 29;
99
100	t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
101
102	/* Handle any leading odd-sized chunks */
103
104	if (t) {
105	unsigned char p = (unsigned char ) ctx->in + t;
106
107	t = 64 - t;
108	if (len < t) {
109	memcpy(p, buf, len);
110	return;
111	}
112	memcpy(p, buf, t);
113	byteReverse(ctx->in, 16);
114	MD5Transform(ctx->buf, (uint32 *) ctx->in);
115	buf += t;
116	len -= t;
117	}
118	/* Process data in 64-byte chunks */
119
120	while (len >= 64) {
121	memcpy(ctx->in, buf, 64);
122	byteReverse(ctx->in, 16);
123	MD5Transform(ctx->buf, (uint32 *) ctx->in);
124	buf += 64;
125	len -= 64;
126	}
127
128	/* Handle any remaining bytes of data. */
129
130	memcpy(ctx->in, buf, len);
131	}
132
133	/*
134	* Final wrapup - pad to 64-byte boundary with the bit pattern
135	* 1 0* (64-bit count of bits processed, MSB-first)
136	*/
137	void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
138	{
139	unsigned count;
140	unsigned char *p;
141
142	/* Compute number of bytes mod 64 */
143	count = (ctx->bits[0] >> 3) & 0x3F;
144
145	/* Set the first char of padding to 0x80. This is safe since there is
146	always at least one byte free */
147	p = ctx->in + count;
148	*p++ = 0x80;
149
150	/* Bytes of padding needed to make 64 bytes */
151	count = 64 - 1 - count;
152
153	/* Pad out to 56 mod 64 */
154	if (count < 8) {
155	/* Two lots of padding: Pad the first block to 64 bytes */
156	memset(p, 0, count);
157	byteReverse(ctx->in, 16);
158	MD5Transform(ctx->buf, (uint32 *) ctx->in);
159
160	/* Now fill the next block with 56 bytes */
161	memset(ctx->in, 0, 56);
162	} else {
163	/* Pad block to 56 bytes */
164	memset(p, 0, count - 8);
165	}
166	byteReverse(ctx->in, 14);
167
168	/* Append length in bits and transform */
169	((uint32 *) ctx->in)[14] = ctx->bits[0];
170	((uint32 *) ctx->in)[15] = ctx->bits[1];
171
172	MD5Transform(ctx->buf, (uint32 *) ctx->in);
173	byteReverse((unsigned char *) ctx->buf, 4);
174	memcpy(digest, ctx->buf, 16);
175	memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
176	}
177
178	#ifndef ASM_MD5
179
180	/* The four core functions - F1 is optimized somewhat */
181
182	/* #define F1(x, y, z) (x & y \| ~x & z) */
183	#define F1(x, y, z) (z ^ (x & (y ^ z)))
184	#define F2(x, y, z) F1(z, x, y)
185	#define F3(x, y, z) (x ^ y ^ z)
186	#define F4(x, y, z) (y ^ (x \| ~z))
187
188	/* This is the central step in the MD5 algorithm. */
189	#define MD5STEP(f, w, x, y, z, data, s) \
190	( w += f(x, y, z) + data, w = w<<s \| w>>(32-s), w += x )
191
192	/*
193	* The core of the MD5 algorithm, this alters an existing MD5 hash to
194	* reflect the addition of 16 longwords of new data. MD5Update blocks
195	* the data and converts bytes into longwords for this routine.
196	*/
197	void MD5Transform(uint32 buf[4], uint32 const in[16])
198	{
199	register uint32 a, b, c, d;
200
201	a = buf[0];
202	b = buf[1];
203	c = buf[2];
204	d = buf[3];
205
206	MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
207	MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
208	MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
209	MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
210	MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
211	MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
212	MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
213	MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
214	MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
215	MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
216	MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
217	MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
218	MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
219	MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
220	MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
221	MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
222
223	MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
224	MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
225	MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
226	MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
227	MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
228	MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
229	MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
230	MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
231	MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
232	MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
233	MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
234	MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
235	MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
236	MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
237	MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
238	MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
239
240	MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
241	MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
242	MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
243	MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
244	MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
245	MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
246	MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
247	MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
248	MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
249	MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
250	MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
251	MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
252	MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
253	MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
254	MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
255	MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
256
257	MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
258	MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
259	MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
260	MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
261	MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
262	MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
263	MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
264	MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
265	MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
266	MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
267	MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
268	MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
269	MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
270	MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
271	MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
272	MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
273
274	buf[0] += a;
275	buf[1] += b;
276	buf[2] += c;
277	buf[3] += d;
278	}
279
280	#endif
281