[thirdparty/openssl.git] / crypto / sha / sha_dgst.c

/* crypto/sha/sha_dgst.c */
/* Copyright (C) 1995-1998 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.]
 */

#include <stdio.h>
#include <string.h>
#define  SHA_0
#undef SHA_1
#include "sha.h"
#include "sha_locl.h"
#include "opensslv.h"

char *SHA_version="SHA" OPENSSL_VERSION_PTEXT;

/* Implemented from SHA-0 document - The Secure Hash Algorithm
 */

#define INIT_DATA_h0 (unsigned long)0x67452301L
#define INIT_DATA_h1 (unsigned long)0xefcdab89L
#define INIT_DATA_h2 (unsigned long)0x98badcfeL
#define INIT_DATA_h3 (unsigned long)0x10325476L
#define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L

#define K_00_19	0x5a827999L
#define K_20_39 0x6ed9eba1L
#define K_40_59 0x8f1bbcdcL
#define K_60_79 0xca62c1d6L

#ifndef NOPROTO
   void sha_block(SHA_CTX *c, register unsigned long *p, int num);
#else
   void sha_block();
#endif

#define	M_c2nl 		c2nl
#define	M_p_c2nl	p_c2nl
#define	M_c2nl_p	c2nl_p
#define	M_p_c2nl_p	p_c2nl_p
#define	M_nl2c		nl2c

void SHA_Init(SHA_CTX *c)
	{
	c->h0=INIT_DATA_h0;
	c->h1=INIT_DATA_h1;
	c->h2=INIT_DATA_h2;
	c->h3=INIT_DATA_h3;
	c->h4=INIT_DATA_h4;
	c->Nl=0;
	c->Nh=0;
	c->num=0;
	}

void SHA_Update(SHA_CTX *c, register unsigned char *data, unsigned long len)
	{
	register ULONG *p;
	int ew,ec,sw,sc;
	ULONG l;

	if (len == 0) return;

	l=(c->Nl+(len<<3))&0xffffffffL;
	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) >= SHA_CBLOCK)
			{
			l= p[sw];
			M_p_c2nl(data,l,sc);
			p[sw++]=l;
			for (; sw<SHA_LBLOCK; sw++)
				{
				M_c2nl(data,l);
				p[sw]=l;
				}
			len-=(SHA_CBLOCK-c->num);

			sha_block(c,p,64);
			c->num=0;
			/* drop through and do the rest */
			}
		else
			{
			c->num+=(int)len;
			if ((sc+len) < 4) /* ugly, add char's to a word */
				{
				l= p[sw];
				M_p_c2nl_p(data,l,sc,len);
				p[sw]=l;
				}
			else
				{
				ew=(c->num>>2);
				ec=(c->num&0x03);
				l= p[sw];
				M_p_c2nl(data,l,sc);
				p[sw++]=l;
				for (; sw < ew; sw++)
					{ M_c2nl(data,l); p[sw]=l; }
				if (ec)
					{
					M_c2nl_p(data,l,ec);
					p[sw]=l;
					}
				}
			return;
			}
		}
	/* We can only do the following code for assember, the reason
	 * being that the sha_block 'C' version changes the values
	 * in the 'data' array.  The assember code avoids this and
	 * copies it to a local array.  I should be able to do this for
	 * the C version as well....
	 */
#if 1
#if defined(B_ENDIAN) || defined(SHA_ASM)
	if ((((unsigned long)data)%sizeof(ULONG)) == 0)
		{
		sw=len/SHA_CBLOCK;
		if (sw)
			{
			sw*=SHA_CBLOCK;
			sha_block(c,(ULONG *)data,sw);
			data+=sw;
			len-=sw;
			}
		}
#endif
#endif
	/* we now can process the input data in blocks of SHA_CBLOCK
	 * chars and save the leftovers to c->data. */
	p=c->data;
	while (len >= SHA_CBLOCK)
		{
#if defined(B_ENDIAN) || defined(L_ENDIAN)
		if (p != (unsigned long *)data)
			memcpy(p,data,SHA_CBLOCK);
		data+=SHA_CBLOCK;
#  ifdef L_ENDIAN
#    ifndef SHA_ASM /* Will not happen */
		for (sw=(SHA_LBLOCK/4); sw; sw--)
			{
			Endian_Reverse32(p[0]);
			Endian_Reverse32(p[1]);
			Endian_Reverse32(p[2]);
			Endian_Reverse32(p[3]);
			p+=4;
			}
		p=c->data;
#    endif
#  endif
#else
		for (sw=(SHA_BLOCK/4); sw; sw--)
			{
			M_c2nl(data,l); *(p++)=l;
			M_c2nl(data,l); *(p++)=l;
			M_c2nl(data,l); *(p++)=l;
			M_c2nl(data,l); *(p++)=l;
			}
		p=c->data;
#endif
		sha_block(c,p,64);
		len-=SHA_CBLOCK;
		}
	ec=(int)len;
	c->num=ec;
	ew=(ec>>2);
	ec&=0x03;

	for (sw=0; sw < ew; sw++)
		{ M_c2nl(data,l); p[sw]=l; }
	M_c2nl_p(data,l,ec);
	p[sw]=l;
	}

void SHA_Transform(SHA_CTX *c, unsigned char *b)
	{
	ULONG p[16];
#if !defined(B_ENDIAN)
	ULONG *q;
	int i;
#endif

#if defined(B_ENDIAN) || defined(L_ENDIAN)
	memcpy(p,b,64);
#ifdef L_ENDIAN
	q=p;
	for (i=(SHA_LBLOCK/4); i; i--)
		{
		Endian_Reverse32(q[0]);
		Endian_Reverse32(q[1]);
		Endian_Reverse32(q[2]);
		Endian_Reverse32(q[3]);
		q+=4;
		}
#endif
#else
	q=p;
	for (i=(SHA_LBLOCK/4); i; i--)
		{
		ULONG l;
		c2nl(b,l); *(q++)=l;
		c2nl(b,l); *(q++)=l;
		c2nl(b,l); *(q++)=l;
		c2nl(b,l); *(q++)=l; 
		} 
#endif
	sha_block(c,p,64);
	}

void sha_block(SHA_CTX *c, register unsigned long *W, int num)
	{
	register ULONG A,B,C,D,E,T;
	ULONG X[16];

	A=c->h0;
	B=c->h1;
	C=c->h2;
	D=c->h3;
	E=c->h4;

	for (;;)
		{
	BODY_00_15( 0,A,B,C,D,E,T,W);
	BODY_00_15( 1,T,A,B,C,D,E,W);
	BODY_00_15( 2,E,T,A,B,C,D,W);
	BODY_00_15( 3,D,E,T,A,B,C,W);
	BODY_00_15( 4,C,D,E,T,A,B,W);
	BODY_00_15( 5,B,C,D,E,T,A,W);
	BODY_00_15( 6,A,B,C,D,E,T,W);
	BODY_00_15( 7,T,A,B,C,D,E,W);
	BODY_00_15( 8,E,T,A,B,C,D,W);
	BODY_00_15( 9,D,E,T,A,B,C,W);
	BODY_00_15(10,C,D,E,T,A,B,W);
	BODY_00_15(11,B,C,D,E,T,A,W);
	BODY_00_15(12,A,B,C,D,E,T,W);
	BODY_00_15(13,T,A,B,C,D,E,W);
	BODY_00_15(14,E,T,A,B,C,D,W);
	BODY_00_15(15,D,E,T,A,B,C,W);
	BODY_16_19(16,C,D,E,T,A,B,W,W,W,W);
	BODY_16_19(17,B,C,D,E,T,A,W,W,W,W);
	BODY_16_19(18,A,B,C,D,E,T,W,W,W,W);
	BODY_16_19(19,T,A,B,C,D,E,W,W,W,X);

	BODY_20_31(20,E,T,A,B,C,D,W,W,W,X);
	BODY_20_31(21,D,E,T,A,B,C,W,W,W,X);
	BODY_20_31(22,C,D,E,T,A,B,W,W,W,X);
	BODY_20_31(23,B,C,D,E,T,A,W,W,W,X);
	BODY_20_31(24,A,B,C,D,E,T,W,W,X,X);
	BODY_20_31(25,T,A,B,C,D,E,W,W,X,X);
	BODY_20_31(26,E,T,A,B,C,D,W,W,X,X);
	BODY_20_31(27,D,E,T,A,B,C,W,W,X,X);
	BODY_20_31(28,C,D,E,T,A,B,W,W,X,X);
	BODY_20_31(29,B,C,D,E,T,A,W,W,X,X);
	BODY_20_31(30,A,B,C,D,E,T,W,X,X,X);
	BODY_20_31(31,T,A,B,C,D,E,W,X,X,X);
	BODY_32_39(32,E,T,A,B,C,D,X);
	BODY_32_39(33,D,E,T,A,B,C,X);
	BODY_32_39(34,C,D,E,T,A,B,X);
	BODY_32_39(35,B,C,D,E,T,A,X);
	BODY_32_39(36,A,B,C,D,E,T,X);
	BODY_32_39(37,T,A,B,C,D,E,X);
	BODY_32_39(38,E,T,A,B,C,D,X);
	BODY_32_39(39,D,E,T,A,B,C,X);

	BODY_40_59(40,C,D,E,T,A,B,X);
	BODY_40_59(41,B,C,D,E,T,A,X);
	BODY_40_59(42,A,B,C,D,E,T,X);
	BODY_40_59(43,T,A,B,C,D,E,X);
	BODY_40_59(44,E,T,A,B,C,D,X);
	BODY_40_59(45,D,E,T,A,B,C,X);
	BODY_40_59(46,C,D,E,T,A,B,X);
	BODY_40_59(47,B,C,D,E,T,A,X);
	BODY_40_59(48,A,B,C,D,E,T,X);
	BODY_40_59(49,T,A,B,C,D,E,X);
	BODY_40_59(50,E,T,A,B,C,D,X);
	BODY_40_59(51,D,E,T,A,B,C,X);
	BODY_40_59(52,C,D,E,T,A,B,X);
	BODY_40_59(53,B,C,D,E,T,A,X);
	BODY_40_59(54,A,B,C,D,E,T,X);
	BODY_40_59(55,T,A,B,C,D,E,X);
	BODY_40_59(56,E,T,A,B,C,D,X);
	BODY_40_59(57,D,E,T,A,B,C,X);
	BODY_40_59(58,C,D,E,T,A,B,X);
	BODY_40_59(59,B,C,D,E,T,A,X);

	BODY_60_79(60,A,B,C,D,E,T,X);
	BODY_60_79(61,T,A,B,C,D,E,X);
	BODY_60_79(62,E,T,A,B,C,D,X);
	BODY_60_79(63,D,E,T,A,B,C,X);
	BODY_60_79(64,C,D,E,T,A,B,X);
	BODY_60_79(65,B,C,D,E,T,A,X);
	BODY_60_79(66,A,B,C,D,E,T,X);
	BODY_60_79(67,T,A,B,C,D,E,X);
	BODY_60_79(68,E,T,A,B,C,D,X);
	BODY_60_79(69,D,E,T,A,B,C,X);
	BODY_60_79(70,C,D,E,T,A,B,X);
	BODY_60_79(71,B,C,D,E,T,A,X);
	BODY_60_79(72,A,B,C,D,E,T,X);
	BODY_60_79(73,T,A,B,C,D,E,X);
	BODY_60_79(74,E,T,A,B,C,D,X);
	BODY_60_79(75,D,E,T,A,B,C,X);
	BODY_60_79(76,C,D,E,T,A,B,X);
	BODY_60_79(77,B,C,D,E,T,A,X);
	BODY_60_79(78,A,B,C,D,E,T,X);
	BODY_60_79(79,T,A,B,C,D,E,X);
	
	c->h0=(c->h0+E)&0xffffffffL; 
	c->h1=(c->h1+T)&0xffffffffL;
	c->h2=(c->h2+A)&0xffffffffL;
	c->h3=(c->h3+B)&0xffffffffL;
	c->h4=(c->h4+C)&0xffffffffL;

	num-=64;
	if (num <= 0) break;

	A=c->h0;
	B=c->h1;
	C=c->h2;
	D=c->h3;
	E=c->h4;

	W+=16;
		}
	}

void SHA_Final(unsigned char *md, SHA_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 definitly have room for at least one more byte. */
	p=c->data;
	j=c->num;
	i=j>>2;
#ifdef PURIFY
	if ((j&0x03) == 0) p[i]=0;
#endif
	l=p[i];
	M_p_c2nl(cp,l,j&0x03);
	p[i]=l;
	i++;
	/* i is the next 'undefined word' */
	if (c->num >= SHA_LAST_BLOCK)
		{
		for (; i<SHA_LBLOCK; i++)
			p[i]=0;
		sha_block(c,p,64);
		i=0;
		}
	for (; i<(SHA_LBLOCK-2); i++)
		p[i]=0;
	p[SHA_LBLOCK-2]=c->Nh;
	p[SHA_LBLOCK-1]=c->Nl;
	sha_block(c,p,64);
	cp=md;
	l=c->h0; nl2c(l,cp);
	l=c->h1; nl2c(l,cp);
	l=c->h2; nl2c(l,cp);
	l=c->h3; nl2c(l,cp);
	l=c->h4; nl2c(l,cp);

	/* clear stuff, sha_block may be leaving some stuff on the stack
	 * but I'm not worried :-) */
	c->num=0;
/*	memset((char *)&c,0,sizeof(c));*/
	}
Commit	Line	Data
d02b48c6	1	/* crypto/sha/sha_dgst.c */
58964a49	2	/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
d02b48c6 RE	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
	59	#include <stdio.h>
58964a49 RE	60	#include <string.h>
	61	#define SHA_0
	62	#undef SHA_1
d02b48c6 RE	63	#include "sha.h"
d02b48c6 RE	64	#include "sha_locl.h"
b4cadc6e	65	#include "opensslv.h"
d02b48c6	66
b4cadc6e	67	char *SHA_version="SHA" OPENSSL_VERSION_PTEXT;
d02b48c6	68
58964a49	69	/* Implemented from SHA-0 document - The Secure Hash Algorithm
d02b48c6 RE	70	*/
	71
	72	#define INIT_DATA_h0 (unsigned long)0x67452301L
	73	#define INIT_DATA_h1 (unsigned long)0xefcdab89L
	74	#define INIT_DATA_h2 (unsigned long)0x98badcfeL
	75	#define INIT_DATA_h3 (unsigned long)0x10325476L
	76	#define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L
	77
	78	#define K_00_19 0x5a827999L
	79	#define K_20_39 0x6ed9eba1L
	80	#define K_40_59 0x8f1bbcdcL
	81	#define K_60_79 0xca62c1d6L
	82
	83	#ifndef NOPROTO
58964a49	84	void sha_block(SHA_CTX c, register unsigned long p, int num);
d02b48c6	85	#else
58964a49	86	void sha_block();
d02b48c6 RE	87	#endif
d02b48c6 RE	88
58964a49 RE	89	#define M_c2nl c2nl
	90	#define M_p_c2nl p_c2nl
	91	#define M_c2nl_p c2nl_p
	92	#define M_p_c2nl_p p_c2nl_p
	93	#define M_nl2c nl2c
	94
6b691a5c	95	void SHA_Init(SHA_CTX *c)
d02b48c6 RE	96	{
	97	c->h0=INIT_DATA_h0;
	98	c->h1=INIT_DATA_h1;
	99	c->h2=INIT_DATA_h2;
	100	c->h3=INIT_DATA_h3;
	101	c->h4=INIT_DATA_h4;
	102	c->Nl=0;
	103	c->Nh=0;
	104	c->num=0;
	105	}
	106
6b691a5c	107	void SHA_Update(SHA_CTX c, register unsigned char data, unsigned long len)
d02b48c6 RE	108	{
d02b48c6 RE	109	register ULONG *p;
58964a49	110	int ew,ec,sw,sc;
d02b48c6 RE	111	ULONG l;
	112
	113	if (len == 0) return;
	114
58964a49	115	l=(c->Nl+(len<<3))&0xffffffffL;
d02b48c6 RE	116	if (l < c->Nl) /* overflow */
	117	c->Nh++;
	118	c->Nh+=(len>>29);
	119	c->Nl=l;
	120
	121	if (c->num != 0)
	122	{
	123	p=c->data;
	124	sw=c->num>>2;
	125	sc=c->num&0x03;
	126
	127	if ((c->num+len) >= SHA_CBLOCK)
	128	{
	129	l= p[sw];
58964a49	130	M_p_c2nl(data,l,sc);
d02b48c6 RE	131	p[sw++]=l;
	132	for (; sw<SHA_LBLOCK; sw++)
	133	{
58964a49	134	M_c2nl(data,l);
d02b48c6 RE	135	p[sw]=l;
	136	}
	137	len-=(SHA_CBLOCK-c->num);
	138
58964a49	139	sha_block(c,p,64);
d02b48c6 RE	140	c->num=0;
	141	/* drop through and do the rest */
	142	}
	143	else
	144	{
	145	c->num+=(int)len;
	146	if ((sc+len) < 4) /* ugly, add char's to a word */
	147	{
	148	l= p[sw];
58964a49	149	M_p_c2nl_p(data,l,sc,len);
d02b48c6 RE	150	p[sw]=l;
	151	}
	152	else
	153	{
	154	ew=(c->num>>2);
	155	ec=(c->num&0x03);
	156	l= p[sw];
58964a49	157	M_p_c2nl(data,l,sc);
d02b48c6 RE	158	p[sw++]=l;
d02b48c6 RE	159	for (; sw < ew; sw++)
58964a49	160	{ M_c2nl(data,l); p[sw]=l; }
d02b48c6 RE	161	if (ec)
d02b48c6 RE	162	{
58964a49	163	M_c2nl_p(data,l,ec);
d02b48c6 RE	164	p[sw]=l;
	165	}
	166	}
	167	return;
	168	}
	169	}
58964a49 RE	170	/* We can only do the following code for assember, the reason
	171	* being that the sha_block 'C' version changes the values
	172	* in the 'data' array. The assember code avoids this and
	173	* copies it to a local array. I should be able to do this for
	174	* the C version as well....
	175	*/
	176	#if 1
	177	#if defined(B_ENDIAN) \|\| defined(SHA_ASM)
dfeab068	178	if ((((unsigned long)data)%sizeof(ULONG)) == 0)
58964a49 RE	179	{
	180	sw=len/SHA_CBLOCK;
	181	if (sw)
	182	{
	183	sw*=SHA_CBLOCK;
	184	sha_block(c,(ULONG *)data,sw);
	185	data+=sw;
	186	len-=sw;
	187	}
	188	}
	189	#endif
	190	#endif
d02b48c6 RE	191	/* we now can process the input data in blocks of SHA_CBLOCK
	192	* chars and save the leftovers to c->data. */
	193	p=c->data;
	194	while (len >= SHA_CBLOCK)
	195	{
	196	#if defined(B_ENDIAN) \|\| defined(L_ENDIAN)
58964a49 RE	197	if (p != (unsigned long *)data)
58964a49 RE	198	memcpy(p,data,SHA_CBLOCK);
d02b48c6	199	data+=SHA_CBLOCK;
58964a49 RE	200	# ifdef L_ENDIAN
58964a49 RE	201	# ifndef SHA_ASM /* Will not happen */
d02b48c6 RE	202	for (sw=(SHA_LBLOCK/4); sw; sw--)
	203	{
	204	Endian_Reverse32(p[0]);
	205	Endian_Reverse32(p[1]);
	206	Endian_Reverse32(p[2]);
	207	Endian_Reverse32(p[3]);
	208	p+=4;
	209	}
58964a49 RE	210	p=c->data;
	211	# endif
	212	# endif
d02b48c6	213	#else
58964a49	214	for (sw=(SHA_BLOCK/4); sw; sw--)
d02b48c6	215	{
58964a49 RE	216	M_c2nl(data,l); *(p++)=l;
	217	M_c2nl(data,l); *(p++)=l;
	218	M_c2nl(data,l); *(p++)=l;
	219	M_c2nl(data,l); *(p++)=l;
d02b48c6	220	}
d02b48c6	221	p=c->data;
58964a49 RE	222	#endif
58964a49 RE	223	sha_block(c,p,64);
d02b48c6 RE	224	len-=SHA_CBLOCK;
	225	}
	226	ec=(int)len;
	227	c->num=ec;
	228	ew=(ec>>2);
	229	ec&=0x03;
	230
	231	for (sw=0; sw < ew; sw++)
58964a49 RE	232	{ M_c2nl(data,l); p[sw]=l; }
58964a49 RE	233	M_c2nl_p(data,l,ec);
d02b48c6 RE	234	p[sw]=l;
	235	}
	236
6b691a5c	237	void SHA_Transform(SHA_CTX c, unsigned char b)
58964a49 RE	238	{
	239	ULONG p[16];
	240	#if !defined(B_ENDIAN)
	241	ULONG *q;
	242	int i;
	243	#endif
	244
	245	#if defined(B_ENDIAN) \|\| defined(L_ENDIAN)
	246	memcpy(p,b,64);
	247	#ifdef L_ENDIAN
	248	q=p;
	249	for (i=(SHA_LBLOCK/4); i; i--)
	250	{
	251	Endian_Reverse32(q[0]);
	252	Endian_Reverse32(q[1]);
	253	Endian_Reverse32(q[2]);
	254	Endian_Reverse32(q[3]);
	255	q+=4;
	256	}
	257	#endif
	258	#else
	259	q=p;
	260	for (i=(SHA_LBLOCK/4); i; i--)
	261	{
	262	ULONG l;
	263	c2nl(b,l); *(q++)=l;
	264	c2nl(b,l); *(q++)=l;
	265	c2nl(b,l); *(q++)=l;
	266	c2nl(b,l); *(q++)=l;
	267	}
	268	#endif
	269	sha_block(c,p,64);
	270	}
	271
6b691a5c	272	void sha_block(SHA_CTX c, register unsigned long W, int num)
d02b48c6 RE	273	{
d02b48c6 RE	274	register ULONG A,B,C,D,E,T;
58964a49	275	ULONG X[16];
d02b48c6 RE	276
	277	A=c->h0;
	278	B=c->h1;
	279	C=c->h2;
	280	D=c->h3;
	281	E=c->h4;
	282
58964a49 RE	283	for (;;)
	284	{
	285	BODY_00_15( 0,A,B,C,D,E,T,W);
	286	BODY_00_15( 1,T,A,B,C,D,E,W);
	287	BODY_00_15( 2,E,T,A,B,C,D,W);
	288	BODY_00_15( 3,D,E,T,A,B,C,W);
	289	BODY_00_15( 4,C,D,E,T,A,B,W);
	290	BODY_00_15( 5,B,C,D,E,T,A,W);
	291	BODY_00_15( 6,A,B,C,D,E,T,W);
	292	BODY_00_15( 7,T,A,B,C,D,E,W);
	293	BODY_00_15( 8,E,T,A,B,C,D,W);
	294	BODY_00_15( 9,D,E,T,A,B,C,W);
	295	BODY_00_15(10,C,D,E,T,A,B,W);
	296	BODY_00_15(11,B,C,D,E,T,A,W);
	297	BODY_00_15(12,A,B,C,D,E,T,W);
	298	BODY_00_15(13,T,A,B,C,D,E,W);
	299	BODY_00_15(14,E,T,A,B,C,D,W);
	300	BODY_00_15(15,D,E,T,A,B,C,W);
	301	BODY_16_19(16,C,D,E,T,A,B,W,W,W,W);
	302	BODY_16_19(17,B,C,D,E,T,A,W,W,W,W);
	303	BODY_16_19(18,A,B,C,D,E,T,W,W,W,W);
	304	BODY_16_19(19,T,A,B,C,D,E,W,W,W,X);
	305
	306	BODY_20_31(20,E,T,A,B,C,D,W,W,W,X);
	307	BODY_20_31(21,D,E,T,A,B,C,W,W,W,X);
	308	BODY_20_31(22,C,D,E,T,A,B,W,W,W,X);
	309	BODY_20_31(23,B,C,D,E,T,A,W,W,W,X);
	310	BODY_20_31(24,A,B,C,D,E,T,W,W,X,X);
	311	BODY_20_31(25,T,A,B,C,D,E,W,W,X,X);
	312	BODY_20_31(26,E,T,A,B,C,D,W,W,X,X);
	313	BODY_20_31(27,D,E,T,A,B,C,W,W,X,X);
	314	BODY_20_31(28,C,D,E,T,A,B,W,W,X,X);
	315	BODY_20_31(29,B,C,D,E,T,A,W,W,X,X);
	316	BODY_20_31(30,A,B,C,D,E,T,W,X,X,X);
	317	BODY_20_31(31,T,A,B,C,D,E,W,X,X,X);
	318	BODY_32_39(32,E,T,A,B,C,D,X);
	319	BODY_32_39(33,D,E,T,A,B,C,X);
	320	BODY_32_39(34,C,D,E,T,A,B,X);
	321	BODY_32_39(35,B,C,D,E,T,A,X);
	322	BODY_32_39(36,A,B,C,D,E,T,X);
	323	BODY_32_39(37,T,A,B,C,D,E,X);
	324	BODY_32_39(38,E,T,A,B,C,D,X);
	325	BODY_32_39(39,D,E,T,A,B,C,X);
	326
	327	BODY_40_59(40,C,D,E,T,A,B,X);
	328	BODY_40_59(41,B,C,D,E,T,A,X);
	329	BODY_40_59(42,A,B,C,D,E,T,X);
	330	BODY_40_59(43,T,A,B,C,D,E,X);
	331	BODY_40_59(44,E,T,A,B,C,D,X);
	332	BODY_40_59(45,D,E,T,A,B,C,X);
	333	BODY_40_59(46,C,D,E,T,A,B,X);
	334	BODY_40_59(47,B,C,D,E,T,A,X);
	335	BODY_40_59(48,A,B,C,D,E,T,X);
	336	BODY_40_59(49,T,A,B,C,D,E,X);
	337	BODY_40_59(50,E,T,A,B,C,D,X);
	338	BODY_40_59(51,D,E,T,A,B,C,X);
	339	BODY_40_59(52,C,D,E,T,A,B,X);
	340	BODY_40_59(53,B,C,D,E,T,A,X);
	341	BODY_40_59(54,A,B,C,D,E,T,X);
	342	BODY_40_59(55,T,A,B,C,D,E,X);
	343	BODY_40_59(56,E,T,A,B,C,D,X);
	344	BODY_40_59(57,D,E,T,A,B,C,X);
	345	BODY_40_59(58,C,D,E,T,A,B,X);
	346	BODY_40_59(59,B,C,D,E,T,A,X);
d02b48c6	347
58964a49 RE	348	BODY_60_79(60,A,B,C,D,E,T,X);
	349	BODY_60_79(61,T,A,B,C,D,E,X);
	350	BODY_60_79(62,E,T,A,B,C,D,X);
	351	BODY_60_79(63,D,E,T,A,B,C,X);
	352	BODY_60_79(64,C,D,E,T,A,B,X);
	353	BODY_60_79(65,B,C,D,E,T,A,X);
	354	BODY_60_79(66,A,B,C,D,E,T,X);
	355	BODY_60_79(67,T,A,B,C,D,E,X);
	356	BODY_60_79(68,E,T,A,B,C,D,X);
	357	BODY_60_79(69,D,E,T,A,B,C,X);
	358	BODY_60_79(70,C,D,E,T,A,B,X);
	359	BODY_60_79(71,B,C,D,E,T,A,X);
	360	BODY_60_79(72,A,B,C,D,E,T,X);
	361	BODY_60_79(73,T,A,B,C,D,E,X);
	362	BODY_60_79(74,E,T,A,B,C,D,X);
	363	BODY_60_79(75,D,E,T,A,B,C,X);
	364	BODY_60_79(76,C,D,E,T,A,B,X);
	365	BODY_60_79(77,B,C,D,E,T,A,X);
	366	BODY_60_79(78,A,B,C,D,E,T,X);
	367	BODY_60_79(79,T,A,B,C,D,E,X);
	368
	369	c->h0=(c->h0+E)&0xffffffffL;
	370	c->h1=(c->h1+T)&0xffffffffL;
	371	c->h2=(c->h2+A)&0xffffffffL;
	372	c->h3=(c->h3+B)&0xffffffffL;
	373	c->h4=(c->h4+C)&0xffffffffL;
d02b48c6	374
58964a49 RE	375	num-=64;
58964a49 RE	376	if (num <= 0) break;
d02b48c6	377
58964a49 RE	378	A=c->h0;
	379	B=c->h1;
	380	C=c->h2;
	381	D=c->h3;
	382	E=c->h4;
d02b48c6	383
58964a49 RE	384	W+=16;
58964a49 RE	385	}
d02b48c6 RE	386	}
d02b48c6 RE	387
6b691a5c	388	void SHA_Final(unsigned char md, SHA_CTX c)
d02b48c6 RE	389	{
	390	register int i,j;
	391	register ULONG l;
	392	register ULONG *p;
	393	static unsigned char end[4]={0x80,0x00,0x00,0x00};
	394	unsigned char *cp=end;
	395
	396	/* c->num should definitly have room for at least one more byte. */
	397	p=c->data;
	398	j=c->num;
	399	i=j>>2;
	400	#ifdef PURIFY
	401	if ((j&0x03) == 0) p[i]=0;
	402	#endif
	403	l=p[i];
58964a49	404	M_p_c2nl(cp,l,j&0x03);
d02b48c6 RE	405	p[i]=l;
	406	i++;
	407	/* i is the next 'undefined word' */
	408	if (c->num >= SHA_LAST_BLOCK)
	409	{
	410	for (; i<SHA_LBLOCK; i++)
	411	p[i]=0;
58964a49	412	sha_block(c,p,64);
d02b48c6 RE	413	i=0;
	414	}
	415	for (; i<(SHA_LBLOCK-2); i++)
	416	p[i]=0;
	417	p[SHA_LBLOCK-2]=c->Nh;
	418	p[SHA_LBLOCK-1]=c->Nl;
58964a49	419	sha_block(c,p,64);
d02b48c6 RE	420	cp=md;
	421	l=c->h0; nl2c(l,cp);
	422	l=c->h1; nl2c(l,cp);
	423	l=c->h2; nl2c(l,cp);
	424	l=c->h3; nl2c(l,cp);
	425	l=c->h4; nl2c(l,cp);
58964a49	426
d02b48c6 RE	427	/* clear stuff, sha_block may be leaving some stuff on the stack
	428	* but I'm not worried :-) */
	429	c->num=0;
	430	/* memset((char )&c,0,sizeof(c));/
	431	}
	432