[thirdparty/dhcp.git] / dst / md5_dgst.c

/* crypto/md/md5_dgst.c */
/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 * 
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 * 
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. 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.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from 
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 * 
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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 AUTHOR 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.
 * 
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

/*
 * Portions Copyright (c) 2007 by Internet Systems Consortium, Inc. ("ISC")
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 *   Internet Systems Consortium, Inc.
 *   950 Charter Street
 *   Redwood City, CA 94063
 *   <info@isc.org>
 *   https://www.isc.org/
 */

#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include "md5_locl.h"

#ifdef USE_MD5 /* Added by ogud@tis.com 1998/1/26 */

const char *MD5_version="MD5 part of SSLeay 0.8.1 19-Jul-1997";

/* Implemented from RFC1321 The MD5 Message-Digest Algorithm
 */

#define INIT_DATA_A (unsigned long)0x67452301L
#define INIT_DATA_B (unsigned long)0xefcdab89L
#define INIT_DATA_C (unsigned long)0x98badcfeL
#define INIT_DATA_D (unsigned long)0x10325476L

#ifndef NOPROTO
static void md5_block(MD5_CTX *c, unsigned long *p);
#else
static void md5_block();
#endif

void MD5_Init(c)
MD5_CTX *c;
	{
	c->A=INIT_DATA_A;
	c->B=INIT_DATA_B;
	c->C=INIT_DATA_C;
	c->D=INIT_DATA_D;
	c->Nl=0;
	c->Nh=0;
	c->num=0;
	}

void MD5_Update(c, data, len)
MD5_CTX *c;
const register unsigned char *data;
unsigned long len;
	{
	register ULONG *p;
	int sw,sc;
	ULONG l;

	if (len == 0) return;

	l=(c->Nl+(len<<3))&0xffffffffL;
	/* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
	 * Wei Dai <weidai@eskimo.com> for pointing it out. */
	if (l < c->Nl) /* overflow */
		c->Nh++;
	c->Nh+=(len>>29);
	c->Nl=l;

	if (c->num != 0)
		{
		p=c->data;
		sw=c->num>>2;
		sc=c->num&0x03;

		if ((c->num+len) >= MD5_CBLOCK)
			{
			l= p[sw];
			p_c2l(data,l,sc);
			p[sw++]=l;
			for (; sw<MD5_LBLOCK; sw++)
				{
				c2l(data,l);
				p[sw]=l;
				}
			len-=(MD5_CBLOCK-c->num);

			md5_block(c,p);
			c->num=0;
			/* drop through and do the rest */
			}
		else
			{
			int ew,ec;

			c->num+=(int)len;
			if ((sc+len) < 4) /* ugly, add char's to a word */
				{
				l= p[sw];
				p_c2l_p(data,l,sc,len);
				p[sw]=l;
				}
			else
				{
				ew=(c->num>>2);
				ec=(c->num&0x03);
				l= p[sw];
				p_c2l(data,l,sc);
				p[sw++]=l;
				for (; sw < ew; sw++)
					{ c2l(data,l); p[sw]=l; }
				if (ec)
					{
					c2l_p(data,l,ec);
					p[sw]=l;
					}
				}
			return;
			}
		}
	/* we now can process the input data in blocks of MD5_CBLOCK
	 * chars and save the leftovers to c->data. */
	p=c->data;
	while (len >= MD5_CBLOCK)
		{
#if defined(L_ENDIAN) || defined(B_ENDIAN)
		memcpy(p,data,MD5_CBLOCK);
		data+=MD5_CBLOCK;
#ifdef B_ENDIAN
		for (sw=(MD5_LBLOCK/4); sw; sw--)
			{
			Endian_Reverse32(p[0]);
			Endian_Reverse32(p[1]);
			Endian_Reverse32(p[2]);
			Endian_Reverse32(p[3]);
			p+=4;
			}
#endif
#else
		for (sw=(MD5_LBLOCK/4); sw; sw--)
			{
			c2l(data,l); *(p++)=l;
			c2l(data,l); *(p++)=l;
			c2l(data,l); *(p++)=l;
			c2l(data,l); *(p++)=l; 
			} 
#endif
		p=c->data;
		md5_block(c,p);
		len-=MD5_CBLOCK;
		}
	sc=(int)len;
	c->num=sc;
	if (sc)
		{
		sw=sc>>2;	/* words to copy */
#ifdef L_ENDIAN
		p[sw]=0;
		memcpy(p,data,sc);
#else
		sc&=0x03;
		for ( ; sw; sw--)
			{ c2l(data,l); *(p++)=l; }
		c2l_p(data,l,sc);
		*p=l;
#endif
		}
	}

static void md5_block(c, X)
MD5_CTX *c;
register ULONG *X;
	{
	register ULONG A,B,C,D;

	A=c->A;
	B=c->B;
	C=c->C;
	D=c->D;

	/* Round 0 */
	LOCL_R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
	LOCL_R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
	LOCL_R0(C,D,A,B,X[ 2],17,0x242070dbL);
	LOCL_R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
	LOCL_R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
	LOCL_R0(D,A,B,C,X[ 5],12,0x4787c62aL);
	LOCL_R0(C,D,A,B,X[ 6],17,0xa8304613L);
	LOCL_R0(B,C,D,A,X[ 7],22,0xfd469501L);
	LOCL_R0(A,B,C,D,X[ 8], 7,0x698098d8L);
	LOCL_R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
	LOCL_R0(C,D,A,B,X[10],17,0xffff5bb1L);
	LOCL_R0(B,C,D,A,X[11],22,0x895cd7beL);
	LOCL_R0(A,B,C,D,X[12], 7,0x6b901122L);
	LOCL_R0(D,A,B,C,X[13],12,0xfd987193L);
	LOCL_R0(C,D,A,B,X[14],17,0xa679438eL);
	LOCL_R0(B,C,D,A,X[15],22,0x49b40821L);
	/* Round 1 */
	LOCL_R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
	LOCL_R1(D,A,B,C,X[ 6], 9,0xc040b340L);
	LOCL_R1(C,D,A,B,X[11],14,0x265e5a51L);
	LOCL_R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
	LOCL_R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
	LOCL_R1(D,A,B,C,X[10], 9,0x02441453L);
	LOCL_R1(C,D,A,B,X[15],14,0xd8a1e681L);
	LOCL_R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
	LOCL_R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
	LOCL_R1(D,A,B,C,X[14], 9,0xc33707d6L);
	LOCL_R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
	LOCL_R1(B,C,D,A,X[ 8],20,0x455a14edL);
	LOCL_R1(A,B,C,D,X[13], 5,0xa9e3e905L);
	LOCL_R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
	LOCL_R1(C,D,A,B,X[ 7],14,0x676f02d9L);
	LOCL_R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
	/* Round 2 */
	LOCL_R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
	LOCL_R2(D,A,B,C,X[ 8],11,0x8771f681L);
	LOCL_R2(C,D,A,B,X[11],16,0x6d9d6122L);
	LOCL_R2(B,C,D,A,X[14],23,0xfde5380cL);
	LOCL_R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
	LOCL_R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
	LOCL_R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
	LOCL_R2(B,C,D,A,X[10],23,0xbebfbc70L);
	LOCL_R2(A,B,C,D,X[13], 4,0x289b7ec6L);
	LOCL_R2(D,A,B,C,X[ 0],11,0xeaa127faL);
	LOCL_R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
	LOCL_R2(B,C,D,A,X[ 6],23,0x04881d05L);
	LOCL_R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
	LOCL_R2(D,A,B,C,X[12],11,0xe6db99e5L);
	LOCL_R2(C,D,A,B,X[15],16,0x1fa27cf8L);
	LOCL_R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
	/* Round 3 */
	LOCL_R3(A,B,C,D,X[ 0], 6,0xf4292244L);
	LOCL_R3(D,A,B,C,X[ 7],10,0x432aff97L);
	LOCL_R3(C,D,A,B,X[14],15,0xab9423a7L);
	LOCL_R3(B,C,D,A,X[ 5],21,0xfc93a039L);
	LOCL_R3(A,B,C,D,X[12], 6,0x655b59c3L);
	LOCL_R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
	LOCL_R3(C,D,A,B,X[10],15,0xffeff47dL);
	LOCL_R3(B,C,D,A,X[ 1],21,0x85845dd1L);
	LOCL_R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
	LOCL_R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
	LOCL_R3(C,D,A,B,X[ 6],15,0xa3014314L);
	LOCL_R3(B,C,D,A,X[13],21,0x4e0811a1L);
	LOCL_R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
	LOCL_R3(D,A,B,C,X[11],10,0xbd3af235L);
	LOCL_R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
	LOCL_R3(B,C,D,A,X[ 9],21,0xeb86d391L);

	c->A+=A&0xffffffffL;
	c->B+=B&0xffffffffL;
	c->C+=C&0xffffffffL;
	c->D+=D&0xffffffffL;
	}

void MD5_Final(md, c)
unsigned char *md;
MD5_CTX *c;
	{
	register int i,j;
	register ULONG l;
	register ULONG *p;
	static unsigned char end[4]={0x80,0x00,0x00,0x00};
	unsigned char *cp=end;

	/* c->num should definitely have room for at least one more byte. */
	p=c->data;
	j=c->num;
	i=j>>2;

	/* purify often complains about the following line as an
	 * Uninitialized Memory Read.  While this can be true, the
	 * following p_c2l macro will reset l when that case is true.
	 * This is because j&0x03 contains the number of 'valid' bytes
	 * already in p[i].  If and only if j&0x03 == 0, the UMR will
	 * occur but this is also the only time p_c2l will do
	 * l= *(cp++) instead of l|= *(cp++)
	 * Many thanks to Alex Tang <altitude@cic.net> for pickup this
	 * 'potential bug' */
#ifdef PURIFY
	if ((j&0x03) == 0) p[i]=0;
#endif
	l=p[i];
	p_c2l(cp,l,j&0x03);
	p[i]=l;
	i++;
	/* i is the next 'undefined word' */
	if (c->num >= MD5_LAST_BLOCK)
		{
		for (; i<MD5_LBLOCK; i++)
			p[i]=0;
		md5_block(c,p);
		i=0;
		}
	for (; i<(MD5_LBLOCK-2); i++)
		p[i]=0;
	p[MD5_LBLOCK-2]=c->Nl;
	p[MD5_LBLOCK-1]=c->Nh;
	md5_block(c,p);
	cp=md;
	l=c->A; l2c(l,cp);
	l=c->B; l2c(l,cp);
	l=c->C; l2c(l,cp);
	l=c->D; l2c(l,cp);

	/* clear stuff, md5_block may be leaving some stuff on the stack
	 * but I'm not worried :-) */
	c->num=0;
/*	memset((char *)&c,0,sizeof(c));*/
	}

#ifdef undef
int printit(l)
unsigned long *l;
	{
	int i,ii;

	for (i=0; i<2; i++)
		{
		for (ii=0; ii<8; ii++)
			{
			fprintf(stderr,"%08lx ",l[i*8+ii]);
			}
		fprintf(stderr,"\n");
		}
	}
#endif
#endif /* USE_MD5 */
Commit	Line	Data
246f7f72 TL	1	/* crypto/md/md5_dgst.c */
	2	/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
	3	* All rights reserved.
	4	*
	5	* This package is an SSL implementation written
	6	* by Eric Young (eay@cryptsoft.com).
	7	* The implementation was written so as to conform with Netscapes SSL.
	8	*
	9	* This library is free for commercial and non-commercial use as long as
	10	* the following conditions are aheared to. The following conditions
	11	* apply to all code found in this distribution, be it the RC4, RSA,
	12	* lhash, DES, etc., code; not just the SSL code. The SSL documentation
	13	* included with this distribution is covered by the same copyright terms
	14	* except that the holder is Tim Hudson (tjh@cryptsoft.com).
	15	*
	16	* Copyright remains Eric Young's, and as such any Copyright notices in
	17	* the code are not to be removed.
	18	* If this package is used in a product, Eric Young should be given attribution
	19	* as the author of the parts of the library used.
	20	* This can be in the form of a textual message at program startup or
	21	* in documentation (online or textual) provided with the package.
	22	*
	23	* Redistribution and use in source and binary forms, with or without
	24	* modification, are permitted provided that the following conditions
	25	* are met:
	26	* 1. Redistributions of source code must retain the copyright
	27	* notice, this list of conditions and the following disclaimer.
	28	* 2. Redistributions in binary form must reproduce the above copyright
	29	* notice, this list of conditions and the following disclaimer in the
	30	* documentation and/or other materials provided with the distribution.
	31	* 3. All advertising materials mentioning features or use of this software
	32	* must display the following acknowledgement:
	33	* "This product includes cryptographic software written by
	34	* Eric Young (eay@cryptsoft.com)"
	35	* The word 'cryptographic' can be left out if the rouines from the library
	36	* being used are not cryptographic related :-).
	37	* 4. If you include any Windows specific code (or a derivative thereof) from
	38	* the apps directory (application code) you must include an acknowledgement:
	39	* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
	40	*
	41	* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
	42	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	43	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	44	* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
	45	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	46	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	47	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	48	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	49	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	50	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	51	* SUCH DAMAGE.
	52	*
	53	* The licence and distribution terms for any publically available version or
	54	* derivative of this code cannot be changed. i.e. this code cannot simply be
	55	* copied and put under another distribution licence
	56	* [including the GNU Public Licence.]
	57	*/
	58
112e086c DH	59	/*
	60	* Portions Copyright (c) 2007 by Internet Systems Consortium, Inc. ("ISC")
	61	*
	62	* Permission to use, copy, modify, and distribute this software for any
	63	* purpose with or without fee is hereby granted, provided that the above
	64	* copyright notice and this permission notice appear in all copies.
	65	*
	66	* THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
	67	* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
	68	* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
	69	* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
	70	* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
	71	* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
	72	* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
	73	*
	74	* Internet Systems Consortium, Inc.
	75	* 950 Charter Street
	76	* Redwood City, CA 94063
	77	* <info@isc.org>
2c85ac9b	78	* https://www.isc.org/
112e086c DH	79	*/
112e086c DH	80
246f7f72 TL	81	#include <stdio.h>
	82	#include <sys/types.h>
	83	#include <sys/socket.h>
	84	#include <netinet/in.h>
	85	#include "md5_locl.h"
246f7f72 TL	86
	87	#ifdef USE_MD5 /* Added by ogud@tis.com 1998/1/26 */
	88
	89	const char *MD5_version="MD5 part of SSLeay 0.8.1 19-Jul-1997";
	90
	91	/* Implemented from RFC1321 The MD5 Message-Digest Algorithm
	92	*/
	93
	94	#define INIT_DATA_A (unsigned long)0x67452301L
	95	#define INIT_DATA_B (unsigned long)0xefcdab89L
	96	#define INIT_DATA_C (unsigned long)0x98badcfeL
	97	#define INIT_DATA_D (unsigned long)0x10325476L
	98
	99	#ifndef NOPROTO
	100	static void md5_block(MD5_CTX c, unsigned long p);
	101	#else
	102	static void md5_block();
	103	#endif
	104
	105	void MD5_Init(c)
	106	MD5_CTX *c;
	107	{
	108	c->A=INIT_DATA_A;
	109	c->B=INIT_DATA_B;
	110	c->C=INIT_DATA_C;
	111	c->D=INIT_DATA_D;
	112	c->Nl=0;
	113	c->Nh=0;
	114	c->num=0;
	115	}
	116
	117	void MD5_Update(c, data, len)
	118	MD5_CTX *c;
	119	const register unsigned char *data;
	120	unsigned long len;
	121	{
	122	register ULONG *p;
	123	int sw,sc;
	124	ULONG l;
	125
	126	if (len == 0) return;
	127
	128	l=(c->Nl+(len<<3))&0xffffffffL;
	129	/* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
	130	* Wei Dai <weidai@eskimo.com> for pointing it out. */
	131	if (l < c->Nl) /* overflow */
	132	c->Nh++;
	133	c->Nh+=(len>>29);
	134	c->Nl=l;
	135
	136	if (c->num != 0)
	137	{
	138	p=c->data;
	139	sw=c->num>>2;
	140	sc=c->num&0x03;
	141
	142	if ((c->num+len) >= MD5_CBLOCK)
	143	{
	144	l= p[sw];
	145	p_c2l(data,l,sc);
	146	p[sw++]=l;
	147	for (; sw<MD5_LBLOCK; sw++)
	148	{
	149	c2l(data,l);
150	p[sw]=l;
151	}
152	len-=(MD5_CBLOCK-c->num);
153
154	md5_block(c,p);
155	c->num=0;
156	/* drop through and do the rest */
157	}
158	else
159	{
160	int ew,ec;
161
162	c->num+=(int)len;
163	if ((sc+len) < 4) /* ugly, add char's to a word */
164	{
165	l= p[sw];
166	p_c2l_p(data,l,sc,len);
167	p[sw]=l;
168	}
169	else
170	{
171	ew=(c->num>>2);
172	ec=(c->num&0x03);
173	l= p[sw];
174	p_c2l(data,l,sc);
175	p[sw++]=l;
176	for (; sw < ew; sw++)
177	{ c2l(data,l); p[sw]=l; }
178	if (ec)
179	{
180	c2l_p(data,l,ec);
181	p[sw]=l;
182	}
183	}
184	return;
185	}
186	}
187	/* we now can process the input data in blocks of MD5_CBLOCK
188	* chars and save the leftovers to c->data. */
189	p=c->data;
190	while (len >= MD5_CBLOCK)
191	{
192	#if defined(L_ENDIAN) \|\| defined(B_ENDIAN)
193	memcpy(p,data,MD5_CBLOCK);
194	data+=MD5_CBLOCK;
195	#ifdef B_ENDIAN
196	for (sw=(MD5_LBLOCK/4); sw; sw--)
197	{
198	Endian_Reverse32(p[0]);
199	Endian_Reverse32(p[1]);
200	Endian_Reverse32(p[2]);
201	Endian_Reverse32(p[3]);
202	p+=4;
203	}
204	#endif
205	#else
206	for (sw=(MD5_LBLOCK/4); sw; sw--)
207	{
208	c2l(data,l); *(p++)=l;
209	c2l(data,l); *(p++)=l;
210	c2l(data,l); *(p++)=l;
211	c2l(data,l); *(p++)=l;
212	}
213	#endif
214	p=c->data;
215	md5_block(c,p);
216	len-=MD5_CBLOCK;
217	}
218	sc=(int)len;
219	c->num=sc;
220	if (sc)
221	{
222	sw=sc>>2; /* words to copy */
223	#ifdef L_ENDIAN
224	p[sw]=0;
225	memcpy(p,data,sc);
226	#else
227	sc&=0x03;
228	for ( ; sw; sw--)
229	{ c2l(data,l); *(p++)=l; }
230	c2l_p(data,l,sc);
231	*p=l;
232	#endif
233	}
234	}
235
236	static void md5_block(c, X)
237	MD5_CTX *c;
238	register ULONG *X;
239	{
240	register ULONG A,B,C,D;
241
242	A=c->A;
243	B=c->B;
244	C=c->C;
245	D=c->D;
246
247	/* Round 0 */
98311e4b DH	248	LOCL_R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
	249	LOCL_R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
	250	LOCL_R0(C,D,A,B,X[ 2],17,0x242070dbL);
	251	LOCL_R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
	252	LOCL_R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
	253	LOCL_R0(D,A,B,C,X[ 5],12,0x4787c62aL);
	254	LOCL_R0(C,D,A,B,X[ 6],17,0xa8304613L);
	255	LOCL_R0(B,C,D,A,X[ 7],22,0xfd469501L);
	256	LOCL_R0(A,B,C,D,X[ 8], 7,0x698098d8L);
	257	LOCL_R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
	258	LOCL_R0(C,D,A,B,X[10],17,0xffff5bb1L);
	259	LOCL_R0(B,C,D,A,X[11],22,0x895cd7beL);
	260	LOCL_R0(A,B,C,D,X[12], 7,0x6b901122L);
	261	LOCL_R0(D,A,B,C,X[13],12,0xfd987193L);
	262	LOCL_R0(C,D,A,B,X[14],17,0xa679438eL);
	263	LOCL_R0(B,C,D,A,X[15],22,0x49b40821L);
246f7f72	264	/* Round 1 */
98311e4b DH	265	LOCL_R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
	266	LOCL_R1(D,A,B,C,X[ 6], 9,0xc040b340L);
	267	LOCL_R1(C,D,A,B,X[11],14,0x265e5a51L);
	268	LOCL_R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
	269	LOCL_R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
	270	LOCL_R1(D,A,B,C,X[10], 9,0x02441453L);
	271	LOCL_R1(C,D,A,B,X[15],14,0xd8a1e681L);
	272	LOCL_R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
	273	LOCL_R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
	274	LOCL_R1(D,A,B,C,X[14], 9,0xc33707d6L);
	275	LOCL_R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
	276	LOCL_R1(B,C,D,A,X[ 8],20,0x455a14edL);
	277	LOCL_R1(A,B,C,D,X[13], 5,0xa9e3e905L);
	278	LOCL_R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
	279	LOCL_R1(C,D,A,B,X[ 7],14,0x676f02d9L);
	280	LOCL_R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
246f7f72	281	/* Round 2 */
98311e4b DH	282	LOCL_R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
	283	LOCL_R2(D,A,B,C,X[ 8],11,0x8771f681L);
	284	LOCL_R2(C,D,A,B,X[11],16,0x6d9d6122L);
	285	LOCL_R2(B,C,D,A,X[14],23,0xfde5380cL);
	286	LOCL_R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
	287	LOCL_R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
	288	LOCL_R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
	289	LOCL_R2(B,C,D,A,X[10],23,0xbebfbc70L);
	290	LOCL_R2(A,B,C,D,X[13], 4,0x289b7ec6L);
	291	LOCL_R2(D,A,B,C,X[ 0],11,0xeaa127faL);
	292	LOCL_R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
	293	LOCL_R2(B,C,D,A,X[ 6],23,0x04881d05L);
	294	LOCL_R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
	295	LOCL_R2(D,A,B,C,X[12],11,0xe6db99e5L);
	296	LOCL_R2(C,D,A,B,X[15],16,0x1fa27cf8L);
	297	LOCL_R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
246f7f72	298	/* Round 3 */
98311e4b DH	299	LOCL_R3(A,B,C,D,X[ 0], 6,0xf4292244L);
	300	LOCL_R3(D,A,B,C,X[ 7],10,0x432aff97L);
	301	LOCL_R3(C,D,A,B,X[14],15,0xab9423a7L);
	302	LOCL_R3(B,C,D,A,X[ 5],21,0xfc93a039L);
	303	LOCL_R3(A,B,C,D,X[12], 6,0x655b59c3L);
	304	LOCL_R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
	305	LOCL_R3(C,D,A,B,X[10],15,0xffeff47dL);
	306	LOCL_R3(B,C,D,A,X[ 1],21,0x85845dd1L);
	307	LOCL_R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
	308	LOCL_R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
	309	LOCL_R3(C,D,A,B,X[ 6],15,0xa3014314L);
	310	LOCL_R3(B,C,D,A,X[13],21,0x4e0811a1L);
	311	LOCL_R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
	312	LOCL_R3(D,A,B,C,X[11],10,0xbd3af235L);
	313	LOCL_R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
	314	LOCL_R3(B,C,D,A,X[ 9],21,0xeb86d391L);
246f7f72 TL	315
	316	c->A+=A&0xffffffffL;
	317	c->B+=B&0xffffffffL;
	318	c->C+=C&0xffffffffL;
	319	c->D+=D&0xffffffffL;
	320	}
	321
	322	void MD5_Final(md, c)
	323	unsigned char *md;
	324	MD5_CTX *c;
	325	{
	326	register int i,j;
	327	register ULONG l;
	328	register ULONG *p;
	329	static unsigned char end[4]={0x80,0x00,0x00,0x00};
	330	unsigned char *cp=end;
	331
20ae1aff	332	/* c->num should definitely have room for at least one more byte. */
246f7f72 TL	333	p=c->data;
	334	j=c->num;
	335	i=j>>2;
	336
	337	/* purify often complains about the following line as an
	338	* Uninitialized Memory Read. While this can be true, the
	339	* following p_c2l macro will reset l when that case is true.
	340	* This is because j&0x03 contains the number of 'valid' bytes
	341	* already in p[i]. If and only if j&0x03 == 0, the UMR will
	342	* occur but this is also the only time p_c2l will do
	343	* l= (cp++) instead of l\|= (cp++)
	344	* Many thanks to Alex Tang <altitude@cic.net> for pickup this
	345	* 'potential bug' */
	346	#ifdef PURIFY
	347	if ((j&0x03) == 0) p[i]=0;
	348	#endif
	349	l=p[i];
	350	p_c2l(cp,l,j&0x03);
	351	p[i]=l;
	352	i++;
	353	/* i is the next 'undefined word' */
	354	if (c->num >= MD5_LAST_BLOCK)
	355	{
	356	for (; i<MD5_LBLOCK; i++)
	357	p[i]=0;
	358	md5_block(c,p);
	359	i=0;
	360	}
	361	for (; i<(MD5_LBLOCK-2); i++)
	362	p[i]=0;
	363	p[MD5_LBLOCK-2]=c->Nl;
	364	p[MD5_LBLOCK-1]=c->Nh;
	365	md5_block(c,p);
	366	cp=md;
	367	l=c->A; l2c(l,cp);
	368	l=c->B; l2c(l,cp);
	369	l=c->C; l2c(l,cp);
	370	l=c->D; l2c(l,cp);
	371
	372	/* clear stuff, md5_block may be leaving some stuff on the stack
	373	* but I'm not worried :-) */
	374	c->num=0;
	375	/* memset((char )&c,0,sizeof(c));/
	376	}
	377
	378	#ifdef undef
	379	int printit(l)
	380	unsigned long *l;
	381	{
	382	int i,ii;
	383
	384	for (i=0; i<2; i++)
	385	{
	386	for (ii=0; ii<8; ii++)
	387	{
	388	fprintf(stderr,"%08lx ",l[i*8+ii]);
	389	}
	390	fprintf(stderr,"\n");
	391	}
	392	}
	393	#endif
	394	#endif /* USE_MD5 */