[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"

char *SHA_version="SHA part of OpenSSL 0.9.1c 23-Dec-1998";

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