/* crypto/sha/sha_locl.h *//* 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 <stdlib.h>#include <string.h>#include <openssl/opensslconf.h>#include <openssl/sha.h>#ifndef SHA_LONG_LOG2#define SHA_LONG_LOG2	2	/* default to 32 bits */#endif#define DATA_ORDER_IS_BIG_ENDIAN#define HASH_LONG               SHA_LONG#define HASH_LONG_LOG2          SHA_LONG_LOG2#define HASH_CTX                SHA_CTX#define HASH_CBLOCK             SHA_CBLOCK#define HASH_LBLOCK             SHA_LBLOCK#define HASH_MAKE_STRING(c,s)   do {	\	unsigned long ll;		\	ll=(c)->h0; HOST_l2c(ll,(s));	\	ll=(c)->h1; HOST_l2c(ll,(s));	\	ll=(c)->h2; HOST_l2c(ll,(s));	\	ll=(c)->h3; HOST_l2c(ll,(s));	\	ll=(c)->h4; HOST_l2c(ll,(s));	\	} while (0)#if defined(SHA_0)# define HASH_UPDATE             	SHA_Update# define HASH_TRANSFORM          	SHA_Transform# define HASH_FINAL              	SHA_Final# define HASH_INIT			SHA_Init# define HASH_BLOCK_HOST_ORDER   	sha_block_host_order# define HASH_BLOCK_DATA_ORDER   	sha_block_data_order# define Xupdate(a,ix,ia,ib,ic,id)	(ix=(a)=(ia^ib^ic^id))  void sha_block_host_order (SHA_CTX *c, const void *p,int num);  void sha_block_data_order (SHA_CTX *c, const void *p,int num);#elif defined(SHA_1)# define HASH_UPDATE             	SHA1_Update# define HASH_TRANSFORM          	SHA1_Transform# define HASH_FINAL              	SHA1_Final# define HASH_INIT			SHA1_Init# define HASH_BLOCK_HOST_ORDER   	sha1_block_host_order# define HASH_BLOCK_DATA_ORDER   	sha1_block_data_order# if defined(__MWERKS__) && defined(__MC68K__)   /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */#  define Xupdate(a,ix,ia,ib,ic,id)	do { (a)=(ia^ib^ic^id);		\					     ix=(a)=ROTATE((a),1);	\					} while (0)# else#  define Xupdate(a,ix,ia,ib,ic,id)	( (a)=(ia^ib^ic^id),	\					  ix=(a)=ROTATE((a),1)	\					)# endif# ifdef SHA1_ASM#  if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__)#   define sha1_block_host_order		sha1_block_asm_host_order#   define DONT_IMPLEMENT_BLOCK_HOST_ORDER#   define sha1_block_data_order		sha1_block_asm_data_order#   define DONT_IMPLEMENT_BLOCK_DATA_ORDER#   define HASH_BLOCK_DATA_ORDER_ALIGNED	sha1_block_asm_data_order#  endif# endif  void sha1_block_host_order (SHA_CTX *c, const void *p,int num);  void sha1_block_data_order (SHA_CTX *c, const void *p,int num);#else# error "Either SHA_0 or SHA_1 must be defined."#endif#include "md32_common.h"#define INIT_DATA_h0 0x67452301UL#define INIT_DATA_h1 0xefcdab89UL#define INIT_DATA_h2 0x98badcfeUL#define INIT_DATA_h3 0x10325476UL#define INIT_DATA_h4 0xc3d2e1f0ULvoid HASH_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;	}#define K_00_19	0x5a827999UL#define K_20_39 0x6ed9eba1UL#define K_40_59 0x8f1bbcdcUL#define K_60_79 0xca62c1d6UL/* As  pointed out by Wei Dai <weidai@eskimo.com>, F() below can be * simplified to the code in F_00_19.  Wei attributes these optimisations * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. * #define F(x,y,z) (((x) & (y))  |  ((~(x)) & (z))) * I've just become aware of another tweak to be made, again from Wei Dai, * in F_40_59, (x&a)|(y&a) -> (x|y)&a */#define	F_00_19(b,c,d)	((((c) ^ (d)) & (b)) ^ (d)) #define	F_20_39(b,c,d)	((b) ^ (c) ^ (d))#define F_40_59(b,c,d)	(((b) & (c)) | (((b)|(c)) & (d))) #define	F_60_79(b,c,d)	F_20_39(b,c,d)#define BODY_00_15(i,a,b,c,d,e,f,xi) \	(f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \	(b)=ROTATE((b),30);#define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \	Xupdate(f,xi,xa,xb,xc,xd); \	(f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \	(b)=ROTATE((b),30);#define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \	Xupdate(f,xi,xa,xb,xc,xd); \	(f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \	(b)=ROTATE((b),30);#define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \	Xupdate(f,xa,xa,xb,xc,xd); \	(f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \	(b)=ROTATE((b),30);#define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \	Xupdate(f,xa,xa,xb,xc,xd); \	(f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \	(b)=ROTATE((b),30);#define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \	Xupdate(f,xa,xa,xb,xc,xd); \	(f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \	(b)=ROTATE((b),30);#ifdef X#undef X#endif#ifndef MD32_XARRAY  /*   * Originally X was an array. As it's automatic it's natural   * to expect RISC compiler to accomodate at least part of it in   * the register bank, isn't it? Unfortunately not all compilers   * "find" this expectation reasonable:-( On order to make such   * compilers generate better code I replace X[] with a bunch of   * X0, X1, etc. See the function body below...   *					<appro@fy.chalmers.se>   */# define X(i)	XX##i#else  /*   * However! Some compilers (most notably HP C) get overwhelmed by   * that many local variables so that we have to have the way to   * fall down to the original behavior.   */# define X(i)	XX[i]#endif#ifndef DONT_IMPLEMENT_BLOCK_HOST_ORDERvoid HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num)	{	const SHA_LONG *W=d;	register unsigned long A,B,C,D,E,T;#ifndef MD32_XARRAY	unsigned long	XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,			XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;#else	SHA_LONG	XX[16];#endif	A=c->h0;	B=c->h1;	C=c->h2;