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

/* crypto/sha/sha1dgst.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>
#undef  SHA_0
#define SHA_1
#include <openssl/sha.h>
#include "sha_locl.h"
#include <openssl/opensslv.h>

char *SHA1_version="SHA1" OPENSSL_VERSION_PTEXT;

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

#define INIT_DATA_h0 0x67452301UL
#define INIT_DATA_h1 0xefcdab89UL
#define INIT_DATA_h2 0x98badcfeUL
#define INIT_DATA_h3 0x10325476UL
#define INIT_DATA_h4 0xc3d2e1f0UL

#define K_00_19	0x5a827999UL
#define K_20_39 0x6ed9eba1UL
#define K_40_59 0x8f1bbcdcUL
#define K_60_79 0xca62c1d6UL

#ifndef NOPROTO
#  ifdef SHA1_ASM
     void sha1_block_x86(SHA_CTX *c, register SHA_LONG *p, int num);
#    define sha1_block sha1_block_x86
#  else
     void sha1_block(SHA_CTX *c, register SHA_LONG *p, int num);
#  endif
#else
#  ifdef SHA1_ASM
     void sha1_block_x86();
#    define sha1_block sha1_block_x86
#  else
     void sha1_block();
#  endif
#endif


#if defined(L_ENDIAN) && defined(SHA1_ASM)
#  define	M_c2nl 		c2l
#  define	M_p_c2nl 	p_c2l
#  define	M_c2nl_p	c2l_p
#  define	M_p_c2nl_p	p_c2l_p
#  define	M_nl2c		l2c
#else
#  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
#endif

void SHA1_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 SHA1_Update(SHA_CTX *c, register unsigned char *data,
	     unsigned long len)
	{
	register SHA_LONG *p;
	int ew,ec,sw,sc;
	SHA_LONG 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);

			sha1_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 sha1_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(SHA1_ASM)
	if ((((unsigned long)data)%sizeof(SHA_LONG)) == 0)
		{
		sw=len/SHA_CBLOCK;
		if (sw)
			{
			sw*=SHA_CBLOCK;
			sha1_block(c,(SHA_LONG *)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 != (SHA_LONG *)data)
			memcpy(p,data,SHA_CBLOCK);
		data+=SHA_CBLOCK;
#  ifdef L_ENDIAN
#    ifndef SHA1_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
		sha1_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 SHA1_Transform(SHA_CTX *c, unsigned char *b)
	{
	SHA_LONG p[16];
#ifndef B_ENDIAN
	SHA_LONG *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--)
		{
		SHA_LONG l;
		c2nl(b,l); *(q++)=l;
		c2nl(b,l); *(q++)=l;
		c2nl(b,l); *(q++)=l;
		c2nl(b,l); *(q++)=l; 
		} 
#endif
	sha1_block(c,p,64);
	}

#ifndef SHA1_ASM

void sha1_block(SHA_CTX *c, register SHA_LONG *W, int num)
	{
	register SHA_LONG A,B,C,D,E,T;
	SHA_LONG 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;
		}
	}
#endif

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