arch/arm/plat-feroceon/mv_hal/cesa/mvMD5.c - kernel/prism - Git at Google

 /*******************************************************************************
 Copyright (C) Marvell International Ltd. and its affiliates

 This software file (the "File") is owned and distributed by Marvell
 International Ltd. and/or its affiliates ("Marvell") under the following
 alternative licensing terms.  Once you have made an election to distribute the
 File under one of the following license alternatives, please (i) delete this
 introductory statement regarding license alternatives, (ii) delete the two
 license alternatives that you have not elected to use and (iii) preserve the
 Marvell copyright notice above.

 ********************************************************************************
 Marvell Commercial License Option

 If you received this File from Marvell and you have entered into a commercial
 license agreement (a "Commercial License") with Marvell, the File is licensed
 to you under the terms of the applicable Commercial License.

 ********************************************************************************
 Marvell GPL License Option

 If you received this File from Marvell, you may opt to use, redistribute and/or
 modify this File in accordance with the terms and conditions of the General
 Public License Version 2, June 1991 (the "GPL License"), a copy of which is
 available along with the File in the license.txt file or by writing to the Free
 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 or
 on the worldwide web at http://www.gnu.org/licenses/gpl.txt.

 THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE IMPLIED
 WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE ARE EXPRESSLY
 DISCLAIMED.  The GPL License provides additional details about this warranty
 disclaimer.
 ********************************************************************************
 Marvell BSD License Option

 If you received this File from Marvell, you may opt to use, redistribute and/or
 modify this File under the following licensing terms.
 Redistribution and use in source and binary forms, with or without modification,
 are permitted provided that the following conditions are met:

     *   Redistributions of source code must retain the above copyright notice,
 	    this list of conditions and the following disclaimer.

     *   Redistributions in binary form must reproduce the above copyright
 		notice, this list of conditions and the following disclaimer in the
 		documentation and/or other materials provided with the distribution.

     *   Neither the name of Marvell nor the names of its contributors may be
 		used to endorse or promote products derived from this software without
 		specific prior written permission.

 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
 ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
 ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 *******************************************************************************/

 #include "mvCommon.h"
 #include "mvOs.h"
 #include "mvMD5.h"

 static void mvMD5Transform(MV_U32 buf[4], MV_U32 const in[MV_MD5_MAC_LEN]);

 #ifdef MV_CPU_LE
 #define mvByteReverse(buf, len)	/* Nothing */
 #else
 static void mvByteReverse(unsigned char *buf, unsigned longs);

 /*
  * Note: this code is harmless on little-endian machines.
  */
 static void mvByteReverse(unsigned char *buf, unsigned longs)
 {
 	MV_U32 t;

 	do {
 		t = (MV_U32) ((unsigned)buf[3] << 8 | buf[2]) << 16 | ((unsigned)buf[1] << 8 | buf[0]);
 		*(MV_U32 *)buf = t;
 		buf += 4;
 	} while (--longs);
 }
 #endif

 /*
  * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
  * initialization constants.
  */
 void mvMD5Init(MV_MD5_CONTEXT *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 mvMD5Update(MV_MD5_CONTEXT *ctx, unsigned char const *buf, unsigned len)
 {
 	MV_U32 t;

 	/* Update bitcount */

 	t = ctx->bits[0];
 	ctx->bits[0] = t + ((MV_U32)len << 3);
 	if (ctx->bits[0] < 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);
 		mvByteReverse(ctx->in, MV_MD5_MAC_LEN);
 		mvMD5Transform(ctx->buf, (MV_U32 *)ctx->in);
 		buf += t;
 		len -= t;
 	}
 	/* Process data in 64-byte chunks */

 	while (len >= 64) {
 		memcpy(ctx->in, buf, 64);
 		mvByteReverse(ctx->in, MV_MD5_MAC_LEN);
 		mvMD5Transform(ctx->buf, (MV_U32 *)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 mvMD5Final(unsigned char digest[MV_MD5_MAC_LEN], MV_MD5_CONTEXT *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);
 		mvByteReverse(ctx->in, MV_MD5_MAC_LEN);
 		mvMD5Transform(ctx->buf, (MV_U32 *)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);
 	}
 	mvByteReverse(ctx->in, 14);

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

 	mvMD5Transform(ctx->buf, (MV_U32 *)ctx->in);
 	mvByteReverse((unsigned char *)ctx->buf, 4);
 	memcpy(digest, ctx->buf, MV_MD5_MAC_LEN);
 	memset(ctx, 0, sizeof(ctx));	/* In case it's sensitive */
 }

 /* 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.
  */
 static void mvMD5Transform(MV_U32 buf[4], MV_U32 const in[MV_MD5_MAC_LEN])
 {
 	register MV_U32 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;
 }

 void mvMD5(unsigned char const *buf, unsigned len, unsigned char *digest)
 {
 	MV_MD5_CONTEXT ctx;

 	mvMD5Init(&ctx);
 	mvMD5Update(&ctx, buf, len);
 	mvMD5Final(digest, &ctx);
 }

 void mvHmacMd5(unsigned char const *text, int text_len, unsigned char const *key, int key_len, unsigned char *digest)
 {
 	int i;
 	MV_MD5_CONTEXT ctx;
 	unsigned char k_ipad[64 + 1];	/* inner padding - key XORd with ipad */
 	unsigned char k_opad[64 + 1];	/* outer padding - key XORd with opad */

 	/* start out by storing key in pads */
 	memset(k_ipad, 0, 64);
 	memcpy(k_ipad, key, key_len);
 	memset(k_opad, 0, 64);
 	memcpy(k_opad, key, key_len);

 	/* XOR key with ipad and opad values */
 	for (i = 0; i < 64; i++) {
 		k_ipad[i] ^= 0x36;
 		k_opad[i] ^= 0x5c;
 	}

 	/* perform inner MD5 */
 	mvMD5Init(&ctx);	/* init ctx for 1st pass */
 	mvMD5Update(&ctx, k_ipad, 64);	/* start with inner pad */
 	mvMD5Update(&ctx, text, text_len);	/* then text of datagram */
 	mvMD5Final(digest, &ctx);	/* finish up 1st pass */

 	/* perform outer MD5 */
 	mvMD5Init(&ctx);	/* init ctx for 2nd pass */
 	mvMD5Update(&ctx, k_opad, 64);	/* start with outer pad */
 	mvMD5Update(&ctx, digest, 16);	/* then results of 1st hash */
 	mvMD5Final(digest, &ctx);	/* finish up 2nd pass */
 }
	/*******************************************************************************
	Copyright (C) Marvell International Ltd. and its affiliates

	This software file (the "File") is owned and distributed by Marvell
	International Ltd. and/or its affiliates ("Marvell") under the following
	alternative licensing terms. Once you have made an election to distribute the
	File under one of the following license alternatives, please (i) delete this
	introductory statement regarding license alternatives, (ii) delete the two
	license alternatives that you have not elected to use and (iii) preserve the
	Marvell copyright notice above.

	********************************************************************************
	Marvell Commercial License Option

	If you received this File from Marvell and you have entered into a commercial
	license agreement (a "Commercial License") with Marvell, the File is licensed
	to you under the terms of the applicable Commercial License.

	********************************************************************************
	Marvell GPL License Option

	If you received this File from Marvell, you may opt to use, redistribute and/or
	modify this File in accordance with the terms and conditions of the General
	Public License Version 2, June 1991 (the "GPL License"), a copy of which is
	available along with the File in the license.txt file or by writing to the Free
	Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 or
	on the worldwide web at http://www.gnu.org/licenses/gpl.txt.

	THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE IMPLIED
	WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE ARE EXPRESSLY
	DISCLAIMED. The GPL License provides additional details about this warranty
	disclaimer.
	********************************************************************************
	Marvell BSD License Option

	If you received this File from Marvell, you may opt to use, redistribute and/or
	modify this File under the following licensing terms.
	Redistribution and use in source and binary forms, with or without modification,
	are permitted provided that the following conditions are met:

	* Redistributions of source code must retain the above copyright notice,
	this list of conditions and the following disclaimer.

	* Redistributions in binary form must reproduce the above copyright
	notice, this list of conditions and the following disclaimer in the
	documentation and/or other materials provided with the distribution.

	* Neither the name of Marvell nor the names of its contributors may be
	used to endorse or promote products derived from this software without
	specific prior written permission.

	THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
	ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
	WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
	DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
	ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
	(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
	LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
	ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
	SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

	*******************************************************************************/

	#include "mvCommon.h"
	#include "mvOs.h"
	#include "mvMD5.h"

	static void mvMD5Transform(MV_U32 buf[4], MV_U32 const in[MV_MD5_MAC_LEN]);

	#ifdef MV_CPU_LE
	#define mvByteReverse(buf, len) /* Nothing */
	#else
	static void mvByteReverse(unsigned char *buf, unsigned longs);

	/*
	* Note: this code is harmless on little-endian machines.
	*/
	static void mvByteReverse(unsigned char *buf, unsigned longs)
	{
	MV_U32 t;

	do {
	t = (MV_U32) ((unsigned)buf[3] << 8 \| buf[2]) << 16 \| ((unsigned)buf[1] << 8 \| buf[0]);
	(MV_U32 )buf = t;
	buf += 4;
	} while (--longs);
	}
	#endif

	/*
	* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
	* initialization constants.
	*/
	void mvMD5Init(MV_MD5_CONTEXT *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 mvMD5Update(MV_MD5_CONTEXT ctx, unsigned char const buf, unsigned len)
	{
	MV_U32 t;

	/* Update bitcount */

	t = ctx->bits[0];
	ctx->bits[0] = t + ((MV_U32)len << 3);
	if (ctx->bits[0] < 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);
	mvByteReverse(ctx->in, MV_MD5_MAC_LEN);
	mvMD5Transform(ctx->buf, (MV_U32 *)ctx->in);
	buf += t;
	len -= t;
	}
	/* Process data in 64-byte chunks */

	while (len >= 64) {
	memcpy(ctx->in, buf, 64);
	mvByteReverse(ctx->in, MV_MD5_MAC_LEN);
	mvMD5Transform(ctx->buf, (MV_U32 *)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 mvMD5Final(unsigned char digest[MV_MD5_MAC_LEN], MV_MD5_CONTEXT *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);
	mvByteReverse(ctx->in, MV_MD5_MAC_LEN);
	mvMD5Transform(ctx->buf, (MV_U32 *)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);
	}
	mvByteReverse(ctx->in, 14);

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

	mvMD5Transform(ctx->buf, (MV_U32 *)ctx->in);
	mvByteReverse((unsigned char *)ctx->buf, 4);
	memcpy(digest, ctx->buf, MV_MD5_MAC_LEN);
	memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
	}

	/* 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.
	*/
	static void mvMD5Transform(MV_U32 buf[4], MV_U32 const in[MV_MD5_MAC_LEN])
	{
	register MV_U32 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;
	}

	void mvMD5(unsigned char const buf, unsigned len, unsigned char digest)
	{
	MV_MD5_CONTEXT ctx;

	mvMD5Init(&ctx);
	mvMD5Update(&ctx, buf, len);
	mvMD5Final(digest, &ctx);
	}

	void mvHmacMd5(unsigned char const text, int text_len, unsigned char const key, int key_len, unsigned char *digest)
	{
	int i;
	MV_MD5_CONTEXT ctx;
	unsigned char k_ipad[64 + 1]; /* inner padding - key XORd with ipad */
	unsigned char k_opad[64 + 1]; /* outer padding - key XORd with opad */

	/* start out by storing key in pads */
	memset(k_ipad, 0, 64);
	memcpy(k_ipad, key, key_len);
	memset(k_opad, 0, 64);
	memcpy(k_opad, key, key_len);

	/* XOR key with ipad and opad values */
	for (i = 0; i < 64; i++) {
	k_ipad[i] ^= 0x36;
	k_opad[i] ^= 0x5c;
	}

	/* perform inner MD5 */
	mvMD5Init(&ctx); /* init ctx for 1st pass */
	mvMD5Update(&ctx, k_ipad, 64); /* start with inner pad */
	mvMD5Update(&ctx, text, text_len); /* then text of datagram */
	mvMD5Final(digest, &ctx); /* finish up 1st pass */

	/* perform outer MD5 */
	mvMD5Init(&ctx); /* init ctx for 2nd pass */
	mvMD5Update(&ctx, k_opad, 64); /* start with outer pad */
	mvMD5Update(&ctx, digest, 16); /* then results of 1st hash */
	mvMD5Final(digest, &ctx); /* finish up 2nd pass */
	}