[thirdparty/openssl.git] / crypto / md32_common.h

/* crypto/md32_common.h */
/* ====================================================================
 * Copyright (c) 1999-2002 The OpenSSL Project.  All rights reserved.
 *
 * 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 above 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 acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
 *
 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
 *    endorse or promote products derived from this software without
 *    prior written permission. For written permission, please contact
 *    licensing@OpenSSL.org.
 *
 * 5. Products derived from this software may not be called "OpenSSL"
 *    nor may "OpenSSL" appear in their names without prior written
 *    permission of the OpenSSL Project.
 *
 * 6. Redistributions of any form whatsoever must retain the following
 *    acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
 *
 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
 * EXPRESSED 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 OpenSSL PROJECT OR
 * ITS 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.
 * ====================================================================
 *
 * This product includes cryptographic software written by Eric Young
 * (eay@cryptsoft.com).  This product includes software written by Tim
 * Hudson (tjh@cryptsoft.com).
 *
 */

/*
 * This is a generic 32 bit "collector" for message digest algorithms.
 * Whenever needed it collects input character stream into chunks of
 * 32 bit values and invokes a block function that performs actual hash
 * calculations.
 *
 * Porting guide.
 *
 * Obligatory macros:
 *
 * DATA_ORDER_IS_BIG_ENDIAN or DATA_ORDER_IS_LITTLE_ENDIAN
 *	this macro defines byte order of input stream.
 * HASH_CBLOCK
 *	size of a unit chunk HASH_BLOCK operates on.
 * HASH_LONG
 *	has to be at lest 32 bit wide, if it's wider, then
 *	HASH_LONG_LOG2 *has to* be defined along
 * HASH_CTX
 *	context structure that at least contains following
 *	members:
 *		typedef struct {
 *			...
 *			HASH_LONG	Nl,Nh;
 *			HASH_LONG	data[HASH_LBLOCK];
 *			int		num;
 *			...
 *			} HASH_CTX;
 * HASH_UPDATE
 *	name of "Update" function, implemented here.
 * HASH_TRANSFORM
 *	name of "Transform" function, implemented here.
 * HASH_FINAL
 *	name of "Final" function, implemented here.
 * HASH_BLOCK_HOST_ORDER
 *	name of "block" function treating *aligned* input message
 *	in host byte order, implemented externally.
 * HASH_BLOCK_DATA_ORDER
 *	name of "block" function treating *unaligned* input message
 *	in original (data) byte order, implemented externally (it
 *	actually is optional if data and host are of the same
 *	"endianess").
 * HASH_MAKE_STRING
 *	macro convering context variables to an ASCII hash string.
 *
 * Optional macros:
 *
 * B_ENDIAN or L_ENDIAN
 *	defines host byte-order.
 * HASH_LONG_LOG2
 *	defaults to 2 if not states otherwise.
 * HASH_LBLOCK
 *	assumed to be HASH_CBLOCK/4 if not stated otherwise.
 * HASH_BLOCK_DATA_ORDER_ALIGNED
 *	alternative "block" function capable of treating
 *	aligned input message in original (data) order,
 *	implemented externally.
 *
 * MD5 example:
 *
 *	#define DATA_ORDER_IS_LITTLE_ENDIAN
 *
 *	#define HASH_LONG		MD5_LONG
 *	#define HASH_LONG_LOG2		MD5_LONG_LOG2
 *	#define HASH_CTX		MD5_CTX
 *	#define HASH_CBLOCK		MD5_CBLOCK
 *	#define HASH_LBLOCK		MD5_LBLOCK
 *	#define HASH_UPDATE		MD5_Update
 *	#define HASH_TRANSFORM		MD5_Transform
 *	#define HASH_FINAL		MD5_Final
 *	#define HASH_BLOCK_HOST_ORDER	md5_block_host_order
 *	#define HASH_BLOCK_DATA_ORDER	md5_block_data_order
 *
 *					<appro@fy.chalmers.se>
 */

#include <openssl/crypto.h>
#include <openssl/fips.h>
#include <openssl/err.h>

#if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)
#error "DATA_ORDER must be defined!"
#endif

#ifndef HASH_CBLOCK
#error "HASH_CBLOCK must be defined!"
#endif
#ifndef HASH_LONG
#error "HASH_LONG must be defined!"
#endif
#ifndef HASH_CTX
#error "HASH_CTX must be defined!"
#endif

#ifndef HASH_UPDATE
#error "HASH_UPDATE must be defined!"
#endif
#ifndef HASH_TRANSFORM
#error "HASH_TRANSFORM must be defined!"
#endif
#ifndef HASH_FINAL
#error "HASH_FINAL must be defined!"
#endif

#ifndef HASH_BLOCK_HOST_ORDER
#error "HASH_BLOCK_HOST_ORDER must be defined!"
#endif

#if 0
/*
 * Moved below as it's required only if HASH_BLOCK_DATA_ORDER_ALIGNED
 * isn't defined.
 */
#ifndef HASH_BLOCK_DATA_ORDER
#error "HASH_BLOCK_DATA_ORDER must be defined!"
#endif
#endif

#ifndef HASH_LBLOCK
#define HASH_LBLOCK	(HASH_CBLOCK/4)
#endif

#ifndef HASH_LONG_LOG2
#define HASH_LONG_LOG2	2
#endif

/*
 * Engage compiler specific rotate intrinsic function if available.
 */
#undef ROTATE
#ifndef PEDANTIC
# if 0 /* defined(_MSC_VER) */
#  define ROTATE(a,n)	_lrotl(a,n)
# elif defined(__MWERKS__)
#  if defined(__POWERPC__)
#   define ROTATE(a,n)	__rlwinm(a,n,0,31)
#  elif defined(__MC68K__)
    /* Motorola specific tweak. <appro@fy.chalmers.se> */
#   define ROTATE(a,n)	( n<24 ? __rol(a,n) : __ror(a,32-n) )
#  else
#   define ROTATE(a,n)	__rol(a,n)
#  endif
# elif defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
  /*
   * Some GNU C inline assembler templates. Note that these are
   * rotates by *constant* number of bits! But that's exactly
   * what we need here...
   *
   * 					<appro@fy.chalmers.se>
   */
#  if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
#   define ROTATE(a,n)	({ register unsigned int ret;	\
				asm (			\
				"roll %1,%0"		\
				: "=r"(ret)		\
				: "I"(n), "0"(a)	\
				: "cc");		\
			   ret;				\
			})
#  elif defined(__powerpc) || defined(__ppc__) || defined(__powerpc64__)
#   define ROTATE(a,n)	({ register unsigned int ret;	\
				asm (			\
				"rlwinm %0,%1,%2,0,31"	\
				: "=r"(ret)		\
				: "r"(a), "I"(n));	\
			   ret;				\
			})
#  endif
# endif

/*
 * Engage compiler specific "fetch in reverse byte order"
 * intrinsic function if available.
 */
# if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
  /* some GNU C inline assembler templates by <appro@fy.chalmers.se> */
#  if (defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)) && !defined(I386_ONLY)
#   define BE_FETCH32(a)	({ register unsigned int l=(a);\
				asm (			\
				"bswapl %0"		\
				: "=r"(l) : "0"(l));	\
			  l;				\
			})
#  elif defined(__powerpc)
#   define LE_FETCH32(a)	({ register unsigned int l;	\
				asm (			\
				"lwbrx %0,0,%1"		\
				: "=r"(l)		\
				: "r"(a));		\
			   l;				\
			})

#  elif defined(__sparc) && defined(OPENSSL_SYS_ULTRASPARC)
#  define LE_FETCH32(a)	({ register unsigned int l;		\
				asm (				\
				"lda [%1]#ASI_PRIMARY_LITTLE,%0"\
				: "=r"(l)			\
				: "r"(a));			\
			   l;					\
			})
#  endif
# endif
#endif /* PEDANTIC */

#if HASH_LONG_LOG2==2	/* Engage only if sizeof(HASH_LONG)== 4 */
/* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
#ifdef ROTATE
/* 5 instructions with rotate instruction, else 9 */
#define REVERSE_FETCH32(a,l)	(					\
		l=*(const HASH_LONG *)(a),				\
		((ROTATE(l,8)&0x00FF00FF)|(ROTATE((l&0x00FF00FF),24)))	\
				)
#else
/* 6 instructions with rotate instruction, else 8 */
#define REVERSE_FETCH32(a,l)	(				\
		l=*(const HASH_LONG *)(a),			\
		l=(((l>>8)&0x00FF00FF)|((l&0x00FF00FF)<<8)),	\
		ROTATE(l,16)					\
				)
/*
 * Originally the middle line started with l=(((l&0xFF00FF00)>>8)|...
 * It's rewritten as above for two reasons:
 *	- RISCs aren't good at long constants and have to explicitely
 *	  compose 'em with several (well, usually 2) instructions in a
 *	  register before performing the actual operation and (as you
 *	  already realized:-) having same constant should inspire the
 *	  compiler to permanently allocate the only register for it;
 *	- most modern CPUs have two ALUs, but usually only one has
 *	  circuitry for shifts:-( this minor tweak inspires compiler
 *	  to schedule shift instructions in a better way...
 *
 *				<appro@fy.chalmers.se>
 */
#endif
#endif

#ifndef ROTATE
#define ROTATE(a,n)     (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
#endif

/*
 * Make some obvious choices. E.g., HASH_BLOCK_DATA_ORDER_ALIGNED
 * and HASH_BLOCK_HOST_ORDER ought to be the same if input data
 * and host are of the same "endianess". It's possible to mask
 * this with blank #define HASH_BLOCK_DATA_ORDER though...
 *
 *				<appro@fy.chalmers.se>
 */
#if defined(B_ENDIAN)
#  if defined(DATA_ORDER_IS_BIG_ENDIAN)
#    if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
#      define HASH_BLOCK_DATA_ORDER_ALIGNED	HASH_BLOCK_HOST_ORDER
#    endif
#  elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
#    ifndef HOST_FETCH32
#      ifdef LE_FETCH32
#        define HOST_FETCH32(p,l)	LE_FETCH32(p)
#      elif defined(REVERSE_FETCH32)
#        define HOST_FETCH32(p,l)	REVERSE_FETCH32(p,l)
#      endif
#    endif
#  endif
#elif defined(L_ENDIAN)
#  if defined(DATA_ORDER_IS_LITTLE_ENDIAN)
#    if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
#      define HASH_BLOCK_DATA_ORDER_ALIGNED	HASH_BLOCK_HOST_ORDER
#    endif
#  elif defined(DATA_ORDER_IS_BIG_ENDIAN)
#    ifndef HOST_FETCH32
#      ifdef BE_FETCH32
#        define HOST_FETCH32(p,l)	BE_FETCH32(p)
#      elif defined(REVERSE_FETCH32)
#        define HOST_FETCH32(p,l)	REVERSE_FETCH32(p,l)
#      endif
#    endif
#  endif
#endif

#if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
#ifndef HASH_BLOCK_DATA_ORDER
#error "HASH_BLOCK_DATA_ORDER must be defined!"
#endif
#endif

#if defined(DATA_ORDER_IS_BIG_ENDIAN)

#define HOST_c2l(c,l)	(l =(((unsigned long)(*((c)++)))<<24),		\
			 l|=(((unsigned long)(*((c)++)))<<16),		\
			 l|=(((unsigned long)(*((c)++)))<< 8),		\
			 l|=(((unsigned long)(*((c)++)))    ),		\
			 l)
#define HOST_p_c2l(c,l,n)	{					\
			switch (n) {					\
			case 0: l =((unsigned long)(*((c)++)))<<24;	\
			case 1: l|=((unsigned long)(*((c)++)))<<16;	\
			case 2: l|=((unsigned long)(*((c)++)))<< 8;	\
			case 3: l|=((unsigned long)(*((c)++)));		\
				} }
#define HOST_p_c2l_p(c,l,sc,len) {					\
			switch (sc) {					\
			case 0: l =((unsigned long)(*((c)++)))<<24;	\
				if (--len == 0) break;			\
			case 1: l|=((unsigned long)(*((c)++)))<<16;	\
				if (--len == 0) break;			\
			case 2: l|=((unsigned long)(*((c)++)))<< 8;	\
				} }
/* NOTE the pointer is not incremented at the end of this */
#define HOST_c2l_p(c,l,n)	{					\
			l=0; (c)+=n;					\
			switch (n) {					\
			case 3: l =((unsigned long)(*(--(c))))<< 8;	\
			case 2: l|=((unsigned long)(*(--(c))))<<16;	\
			case 1: l|=((unsigned long)(*(--(c))))<<24;	\
				} }
#define HOST_l2c(l,c)	(*((c)++)=(unsigned char)(((l)>>24)&0xff),	\
			 *((c)++)=(unsigned char)(((l)>>16)&0xff),	\
			 *((c)++)=(unsigned char)(((l)>> 8)&0xff),	\
			 *((c)++)=(unsigned char)(((l)    )&0xff),	\
			 l)

#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)

#define HOST_c2l(c,l)	(l =(((unsigned long)(*((c)++)))    ),		\
			 l|=(((unsigned long)(*((c)++)))<< 8),		\
			 l|=(((unsigned long)(*((c)++)))<<16),		\
			 l|=(((unsigned long)(*((c)++)))<<24),		\
			 l)
#define HOST_p_c2l(c,l,n)	{					\
			switch (n) {					\
			case 0: l =((unsigned long)(*((c)++)));		\
			case 1: l|=((unsigned long)(*((c)++)))<< 8;	\
			case 2: l|=((unsigned long)(*((c)++)))<<16;	\
			case 3: l|=((unsigned long)(*((c)++)))<<24;	\
				} }
#define HOST_p_c2l_p(c,l,sc,len) {					\
			switch (sc) {					\
			case 0: l =((unsigned long)(*((c)++)));		\
				if (--len == 0) break;			\
			case 1: l|=((unsigned long)(*((c)++)))<< 8;	\
				if (--len == 0) break;			\
			case 2: l|=((unsigned long)(*((c)++)))<<16;	\
				} }
/* NOTE the pointer is not incremented at the end of this */
#define HOST_c2l_p(c,l,n)	{					\
			l=0; (c)+=n;					\
			switch (n) {					\
			case 3: l =((unsigned long)(*(--(c))))<<16;	\
			case 2: l|=((unsigned long)(*(--(c))))<< 8;	\
			case 1: l|=((unsigned long)(*(--(c))));		\
				} }
#define HOST_l2c(l,c)	(*((c)++)=(unsigned char)(((l)    )&0xff),	\
			 *((c)++)=(unsigned char)(((l)>> 8)&0xff),	\
			 *((c)++)=(unsigned char)(((l)>>16)&0xff),	\
			 *((c)++)=(unsigned char)(((l)>>24)&0xff),	\
			 l)

#endif

/*
 * Time for some action:-)
 */

int HASH_UPDATE (HASH_CTX *c, const void *data_, unsigned long len)
	{
	const unsigned char *data=data_;
	register HASH_LONG * p;
	register unsigned long l;
	int sw,sc,ew,ec;

	if (len==0) return 1;

	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) >= HASH_CBLOCK)
			{
			l=p[sw]; HOST_p_c2l(data,l,sc); p[sw++]=l;
			for (; sw<HASH_LBLOCK; sw++)
				{
				HOST_c2l(data,l); p[sw]=l;
				}
			HASH_BLOCK_HOST_ORDER (c,p,1);
			len-=(HASH_CBLOCK-c->num);
			c->num=0;
			/* drop through and do the rest */
			}
		else
			{
			c->num+=len;
			if ((sc+len) < 4) /* ugly, add char's to a word */
				{
				l=p[sw]; HOST_p_c2l_p(data,l,sc,len); p[sw]=l;
				}
			else
				{
				ew=(c->num>>2);
				ec=(c->num&0x03);
				if (sc)
					l=p[sw];
				HOST_p_c2l(data,l,sc);
				p[sw++]=l;
				for (; sw < ew; sw++)
					{
					HOST_c2l(data,l); p[sw]=l;
					}
				if (ec)
					{
					HOST_c2l_p(data,l,ec); p[sw]=l;
					}
				}
			return 1;
			}
		}

	sw=len/HASH_CBLOCK;
	if (sw > 0)
		{
#if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
		/*
		 * Note that HASH_BLOCK_DATA_ORDER_ALIGNED gets defined
		 * only if sizeof(HASH_LONG)==4.
		 */
		if ((((unsigned long)data)%4) == 0)
			{
			/* data is properly aligned so that we can cast it: */
			HASH_BLOCK_DATA_ORDER_ALIGNED (c,(HASH_LONG *)data,sw);
			sw*=HASH_CBLOCK;
			data+=sw;
			len-=sw;
			}
		else
#if !defined(HASH_BLOCK_DATA_ORDER)
			while (sw--)
				{
				memcpy (p=c->data,data,HASH_CBLOCK);
				HASH_BLOCK_DATA_ORDER_ALIGNED(c,p,1);
				data+=HASH_CBLOCK;
				len-=HASH_CBLOCK;
				}
#endif
#endif
#if defined(HASH_BLOCK_DATA_ORDER)
			{
			HASH_BLOCK_DATA_ORDER(c,data,sw);
			sw*=HASH_CBLOCK;
			data+=sw;
			len-=sw;
			}
#endif
		}

	if (len!=0)
		{
		p = c->data;
		c->num = len;
		ew=len>>2;	/* words to copy */
		ec=len&0x03;
		for (; ew; ew--,p++)
			{
			HOST_c2l(data,l); *p=l;
			}
		HOST_c2l_p(data,l,ec);
		*p=l;
		}
	return 1;
	}


void HASH_TRANSFORM (HASH_CTX *c, const unsigned char *data)
	{
#if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
	if ((((unsigned long)data)%4) == 0)
		/* data is properly aligned so that we can cast it: */
		HASH_BLOCK_DATA_ORDER_ALIGNED (c,(HASH_LONG *)data,1);
	else
#if !defined(HASH_BLOCK_DATA_ORDER)
		{
		memcpy (c->data,data,HASH_CBLOCK);
		HASH_BLOCK_DATA_ORDER_ALIGNED (c,c->data,1);
		}
#endif
#endif
#if defined(HASH_BLOCK_DATA_ORDER)
	HASH_BLOCK_DATA_ORDER (c,data,1);
#endif
	}


int HASH_FINAL (unsigned char *md, HASH_CTX *c)
	{
	register HASH_LONG *p;
	register unsigned long l;
	register int i,j;
	static const unsigned char end[4]={0x80,0x00,0x00,0x00};
	const unsigned char *cp=end;

#if 0
	if(FIPS_mode() && !FIPS_md5_allowed())
	    {
	    FIPSerr(FIPS_F_HASH_FINAL,FIPS_R_NON_FIPS_METHOD);
	    return 0;
	    }
#endif

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

#if 0
	/* 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==0) p[i]=0; /* Yeah, but that's not the way to fix it:-) */
#endif
	l=p[i];
#else
	l = (j==0) ? 0 : p[i];
#endif
	HOST_p_c2l(cp,l,j); p[i++]=l; /* i is the next 'undefined word' */

	if (i>(HASH_LBLOCK-2)) /* save room for Nl and Nh */
		{
		if (i<HASH_LBLOCK) p[i]=0;
		HASH_BLOCK_HOST_ORDER (c,p,1);
		i=0;
		}
	for (; i<(HASH_LBLOCK-2); i++)
		p[i]=0;

#if   defined(DATA_ORDER_IS_BIG_ENDIAN)
	p[HASH_LBLOCK-2]=c->Nh;
	p[HASH_LBLOCK-1]=c->Nl;
#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
	p[HASH_LBLOCK-2]=c->Nl;
	p[HASH_LBLOCK-1]=c->Nh;
#endif
	HASH_BLOCK_HOST_ORDER (c,p,1);

#ifndef HASH_MAKE_STRING
#error "HASH_MAKE_STRING must be defined!"
#else
	HASH_MAKE_STRING(c,md);
#endif

	c->num=0;
	/* clear stuff, HASH_BLOCK may be leaving some stuff on the stack
	 * but I'm not worried :-)
	OPENSSL_cleanse((void *)c,sizeof(HASH_CTX));
	 */
	return 1;
	}

#ifndef MD32_REG_T
#define MD32_REG_T long
/*
 * This comment was originaly written for MD5, which is why it
 * discusses A-D. But it basically applies to all 32-bit digests,
 * which is why it was moved to common header file.
 *
 * In case you wonder why A-D are declared as long and not
 * as MD5_LONG. Doing so results in slight performance
 * boost on LP64 architectures. The catch is we don't
 * really care if 32 MSBs of a 64-bit register get polluted
 * with eventual overflows as we *save* only 32 LSBs in
 * *either* case. Now declaring 'em long excuses the compiler
 * from keeping 32 MSBs zeroed resulting in 13% performance
 * improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
 * Well, to be honest it should say that this *prevents* 
 * performance degradation.
 *				<appro@fy.chalmers.se>
 * Apparently there're LP64 compilers that generate better
 * code if A-D are declared int. Most notably GCC-x86_64
 * generates better code.
 *				<appro@fy.chalmers.se>
 */
#endif
Commit	Line	Data
bd3576d2 UM	1	/* crypto/md32_common.h */
bd3576d2 UM	2	/* ====================================================================
134fea9d	3	* Copyright (c) 1999-2002 The OpenSSL Project. All rights reserved.
bd3576d2 UM	4	*
	5	* Redistribution and use in source and binary forms, with or without
	6	* modification, are permitted provided that the following conditions
	7	* are met:
	8	*
	9	* 1. Redistributions of source code must retain the above copyright
	10	* notice, this list of conditions and the following disclaimer.
	11	*
	12	* 2. Redistributions in binary form must reproduce the above copyright
	13	* notice, this list of conditions and the following disclaimer in
	14	* the documentation and/or other materials provided with the
	15	* distribution.
	16	*
	17	* 3. All advertising materials mentioning features or use of this
	18	* software must display the following acknowledgment:
	19	* "This product includes software developed by the OpenSSL Project
	20	* for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
	21	*
	22	* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
	23	* endorse or promote products derived from this software without
	24	* prior written permission. For written permission, please contact
	25	* licensing@OpenSSL.org.
	26	*
	27	* 5. Products derived from this software may not be called "OpenSSL"
	28	* nor may "OpenSSL" appear in their names without prior written
	29	* permission of the OpenSSL Project.
	30	*
	31	* 6. Redistributions of any form whatsoever must retain the following
	32	* acknowledgment:
	33	* "This product includes software developed by the OpenSSL Project
	34	* for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
	35	*
	36	* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
	37	* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	38	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
	39	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
	40	* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
	41	* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	42	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
	43	* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	44	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
	45	* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
	46	* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
	47	* OF THE POSSIBILITY OF SUCH DAMAGE.
	48	* ====================================================================
	49	*
	50	* This product includes cryptographic software written by Eric Young
	51	* (eay@cryptsoft.com). This product includes software written by Tim
	52	* Hudson (tjh@cryptsoft.com).
	53	*
	54	*/
	55
	56	/*
	57	* This is a generic 32 bit "collector" for message digest algorithms.
	58	* Whenever needed it collects input character stream into chunks of
	59	* 32 bit values and invokes a block function that performs actual hash
	60	* calculations.
	61	*
	62	* Porting guide.
	63	*
	64	* Obligatory macros:
	65	*
	66	* DATA_ORDER_IS_BIG_ENDIAN or DATA_ORDER_IS_LITTLE_ENDIAN
	67	* this macro defines byte order of input stream.
68	* HASH_CBLOCK
69	* size of a unit chunk HASH_BLOCK operates on.
70	* HASH_LONG
71	* has to be at lest 32 bit wide, if it's wider, then
72	* HASH_LONG_LOG2 has to be defined along
73	* HASH_CTX
74	* context structure that at least contains following
75	* members:
76	* typedef struct {
77	* ...
78	* HASH_LONG Nl,Nh;
79	* HASH_LONG data[HASH_LBLOCK];
80	* int num;
81	* ...
82	* } HASH_CTX;
83	* HASH_UPDATE
84	* name of "Update" function, implemented here.
85	* HASH_TRANSFORM
86	* name of "Transform" function, implemented here.
87	* HASH_FINAL
88	* name of "Final" function, implemented here.
89	* HASH_BLOCK_HOST_ORDER
90	* name of "block" function treating aligned input message
91	* in host byte order, implemented externally.
92	* HASH_BLOCK_DATA_ORDER
93	* name of "block" function treating unaligned input message
94	* in original (data) byte order, implemented externally (it
95	* actually is optional if data and host are of the same
96	* "endianess").
1cbde6e4 AP	97	* HASH_MAKE_STRING
1cbde6e4 AP	98	* macro convering context variables to an ASCII hash string.
bd3576d2 UM	99	*
	100	* Optional macros:
	101	*
	102	* B_ENDIAN or L_ENDIAN
	103	* defines host byte-order.
	104	* HASH_LONG_LOG2
	105	* defaults to 2 if not states otherwise.
	106	* HASH_LBLOCK
	107	* assumed to be HASH_CBLOCK/4 if not stated otherwise.
	108	* HASH_BLOCK_DATA_ORDER_ALIGNED
	109	* alternative "block" function capable of treating
	110	* aligned input message in original (data) order,
	111	* implemented externally.
	112	*
	113	* MD5 example:
	114	*
	115	* #define DATA_ORDER_IS_LITTLE_ENDIAN
	116	*
	117	* #define HASH_LONG MD5_LONG
	118	* #define HASH_LONG_LOG2 MD5_LONG_LOG2
	119	* #define HASH_CTX MD5_CTX
	120	* #define HASH_CBLOCK MD5_CBLOCK
	121	* #define HASH_LBLOCK MD5_LBLOCK
	122	* #define HASH_UPDATE MD5_Update
	123	* #define HASH_TRANSFORM MD5_Transform
	124	* #define HASH_FINAL MD5_Final
	125	* #define HASH_BLOCK_HOST_ORDER md5_block_host_order
	126	* #define HASH_BLOCK_DATA_ORDER md5_block_data_order
	127	*
	128	* <appro@fy.chalmers.se>
	129	*/
	130
7f9c3745	131	#include <openssl/crypto.h>
3642f632 BL	132	#include <openssl/fips.h>
3642f632 BL	133	#include <openssl/err.h>
3642f632	134
bd3576d2 UM	135	#if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)
	136	#error "DATA_ORDER must be defined!"
	137	#endif
	138
	139	#ifndef HASH_CBLOCK
	140	#error "HASH_CBLOCK must be defined!"
	141	#endif
	142	#ifndef HASH_LONG
	143	#error "HASH_LONG must be defined!"
	144	#endif
	145	#ifndef HASH_CTX
	146	#error "HASH_CTX must be defined!"
	147	#endif
	148
	149	#ifndef HASH_UPDATE
	150	#error "HASH_UPDATE must be defined!"
	151	#endif
	152	#ifndef HASH_TRANSFORM
	153	#error "HASH_TRANSFORM must be defined!"
	154	#endif
	155	#ifndef HASH_FINAL
	156	#error "HASH_FINAL must be defined!"
	157	#endif
	158
	159	#ifndef HASH_BLOCK_HOST_ORDER
	160	#error "HASH_BLOCK_HOST_ORDER must be defined!"
	161	#endif
	162
	163	#if 0
	164	/*
	165	* Moved below as it's required only if HASH_BLOCK_DATA_ORDER_ALIGNED
	166	* isn't defined.
	167	*/
	168	#ifndef HASH_BLOCK_DATA_ORDER
	169	#error "HASH_BLOCK_DATA_ORDER must be defined!"
	170	#endif
	171	#endif
	172
	173	#ifndef HASH_LBLOCK
	174	#define HASH_LBLOCK (HASH_CBLOCK/4)
	175	#endif
	176
	177	#ifndef HASH_LONG_LOG2
	178	#define HASH_LONG_LOG2 2
	179	#endif
	180
	181	/*
	182	* Engage compiler specific rotate intrinsic function if available.
	183	*/
	184	#undef ROTATE
	185	#ifndef PEDANTIC
7db2fcaa	186	# if 0 /* defined(_MSC_VER) */
1cbde6e4 AP	187	# define ROTATE(a,n) _lrotl(a,n)
1cbde6e4 AP	188	# elif defined(__MWERKS__)
1eab9a1f	189	# if defined(__POWERPC__)
a7c5241f	190	# define ROTATE(a,n) __rlwinm(a,n,0,31)
1eab9a1f AP	191	# elif defined(__MC68K__)
	192	/* Motorola specific tweak. <appro@fy.chalmers.se> */
	193	# define ROTATE(a,n) ( n<24 ? __rol(a,n) : __ror(a,32-n) )
9a1e34e5 AP	194	# else
	195	# define ROTATE(a,n) __rol(a,n)
	196	# endif
cf1b7d96	197	# elif defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
bd3576d2 UM	198	/*
	199	* Some GNU C inline assembler templates. Note that these are
	200	* rotates by constant number of bits! But that's exactly
	201	* what we need here...
	202	*
	203	* <appro@fy.chalmers.se>
	204	*/
1cbdbcd5	205	# if defined(__i386) \|\| defined(__i386__) \|\| defined(__x86_64) \|\| defined(__x86_64__)
bd3576d2	206	# define ROTATE(a,n) ({ register unsigned int ret; \
0fad6cb7	207	asm ( \
bd3576d2 UM	208	"roll %1,%0" \
	209	: "=r"(ret) \
	210	: "I"(n), "0"(a) \
	211	: "cc"); \
	212	ret; \
	213	})
fb39cd85	214	# elif defined(__powerpc) \|\| defined(__ppc__) \|\| defined(__powerpc64__)
bd3576d2	215	# define ROTATE(a,n) ({ register unsigned int ret; \
0fad6cb7	216	asm ( \
bd3576d2 UM	217	"rlwinm %0,%1,%2,0,31" \
	218	: "=r"(ret) \
	219	: "r"(a), "I"(n)); \
	220	ret; \
	221	})
	222	# endif
	223	# endif
	224
	225	/*
	226	* Engage compiler specific "fetch in reverse byte order"
	227	* intrinsic function if available.
	228	*/
cf1b7d96	229	# if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
bd3576d2	230	/* some GNU C inline assembler templates by <appro@fy.chalmers.se> */
1cbdbcd5	231	# if (defined(__i386) \|\| defined(__i386__) \|\| defined(__x86_64) \|\| defined(__x86_64__)) && !defined(I386_ONLY)
bd3576d2	232	# define BE_FETCH32(a) ({ register unsigned int l=(a);\
0fad6cb7	233	asm ( \
bd3576d2 UM	234	"bswapl %0" \
	235	: "=r"(l) : "0"(l)); \
	236	l; \
	237	})
	238	# elif defined(__powerpc)
	239	# define LE_FETCH32(a) ({ register unsigned int l; \
0fad6cb7	240	asm ( \
bd3576d2 UM	241	"lwbrx %0,0,%1" \
	242	: "=r"(l) \
	243	: "r"(a)); \
	244	l; \
	245	})
	246
cf1b7d96	247	# elif defined(__sparc) && defined(OPENSSL_SYS_ULTRASPARC)
bd3576d2	248	# define LE_FETCH32(a) ({ register unsigned int l; \
0fad6cb7	249	asm ( \
bd3576d2 UM	250	"lda [%1]#ASI_PRIMARY_LITTLE,%0"\
	251	: "=r"(l) \
	252	: "r"(a)); \
	253	l; \
	254	})
	255	# endif
	256	# endif
	257	#endif /* PEDANTIC */
	258
	259	#if HASH_LONG_LOG2==2 /* Engage only if sizeof(HASH_LONG)== 4 */
	260	/* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
	261	#ifdef ROTATE
	262	/* 5 instructions with rotate instruction, else 9 */
	263	#define REVERSE_FETCH32(a,l) ( \
	264	l=(const HASH_LONG )(a), \
	265	((ROTATE(l,8)&0x00FF00FF)\|(ROTATE((l&0x00FF00FF),24))) \
	266	)
	267	#else
	268	/* 6 instructions with rotate instruction, else 8 */
	269	#define REVERSE_FETCH32(a,l) ( \
	270	l=(const HASH_LONG )(a), \
	271	l=(((l>>8)&0x00FF00FF)\|((l&0x00FF00FF)<<8)), \
	272	ROTATE(l,16) \
	273	)
	274	/*
	275	* Originally the middle line started with l=(((l&0xFF00FF00)>>8)\|...
	276	* It's rewritten as above for two reasons:
	277	* - RISCs aren't good at long constants and have to explicitely
	278	* compose 'em with several (well, usually 2) instructions in a
	279	* register before performing the actual operation and (as you
	280	* already realized:-) having same constant should inspire the
	281	* compiler to permanently allocate the only register for it;
	282	* - most modern CPUs have two ALUs, but usually only one has
	283	* circuitry for shifts:-( this minor tweak inspires compiler
	284	* to schedule shift instructions in a better way...
	285	*
	286	* <appro@fy.chalmers.se>
	287	*/
	288	#endif
	289	#endif
	290
	291	#ifndef ROTATE
	292	#define ROTATE(a,n) (((a)<<(n))\|(((a)&0xffffffff)>>(32-(n))))
	293	#endif
	294
	295	/*
	296	* Make some obvious choices. E.g., HASH_BLOCK_DATA_ORDER_ALIGNED
	297	* and HASH_BLOCK_HOST_ORDER ought to be the same if input data
	298	* and host are of the same "endianess". It's possible to mask
	299	* this with blank #define HASH_BLOCK_DATA_ORDER though...
	300	*
	301	* <appro@fy.chalmers.se>
	302	*/
	303	#if defined(B_ENDIAN)
	304	# if defined(DATA_ORDER_IS_BIG_ENDIAN)
	305	# if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
	306	# define HASH_BLOCK_DATA_ORDER_ALIGNED HASH_BLOCK_HOST_ORDER
	307	# endif
	308	# elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
	309	# ifndef HOST_FETCH32
	310	# ifdef LE_FETCH32
	311	# define HOST_FETCH32(p,l) LE_FETCH32(p)
	312	# elif defined(REVERSE_FETCH32)
	313	# define HOST_FETCH32(p,l) REVERSE_FETCH32(p,l)
314	# endif
315	# endif
316	# endif
317	#elif defined(L_ENDIAN)
318	# if defined(DATA_ORDER_IS_LITTLE_ENDIAN)
319	# if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
320	# define HASH_BLOCK_DATA_ORDER_ALIGNED HASH_BLOCK_HOST_ORDER
321	# endif
322	# elif defined(DATA_ORDER_IS_BIG_ENDIAN)
323	# ifndef HOST_FETCH32
324	# ifdef BE_FETCH32
325	# define HOST_FETCH32(p,l) BE_FETCH32(p)
326	# elif defined(REVERSE_FETCH32)
327	# define HOST_FETCH32(p,l) REVERSE_FETCH32(p,l)
328	# endif
329	# endif
330	# endif
331	#endif
332
0a78c297	333	#if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
bd3576d2 UM	334	#ifndef HASH_BLOCK_DATA_ORDER
	335	#error "HASH_BLOCK_DATA_ORDER must be defined!"
	336	#endif
	337	#endif
	338
	339	#if defined(DATA_ORDER_IS_BIG_ENDIAN)
	340
	341	#define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++)))<<24), \
	342	l\|=(((unsigned long)(*((c)++)))<<16), \
	343	l\|=(((unsigned long)(*((c)++)))<< 8), \
	344	l\|=(((unsigned long)(*((c)++))) ), \
	345	l)
	346	#define HOST_p_c2l(c,l,n) { \
	347	switch (n) { \
	348	case 0: l =((unsigned long)(*((c)++)))<<24; \
	349	case 1: l\|=((unsigned long)(*((c)++)))<<16; \
	350	case 2: l\|=((unsigned long)(*((c)++)))<< 8; \
	351	case 3: l\|=((unsigned long)(*((c)++))); \
	352	} }
	353	#define HOST_p_c2l_p(c,l,sc,len) { \
	354	switch (sc) { \
	355	case 0: l =((unsigned long)(*((c)++)))<<24; \
	356	if (--len == 0) break; \
	357	case 1: l\|=((unsigned long)(*((c)++)))<<16; \
	358	if (--len == 0) break; \
	359	case 2: l\|=((unsigned long)(*((c)++)))<< 8; \
	360	} }
	361	/* NOTE the pointer is not incremented at the end of this */
	362	#define HOST_c2l_p(c,l,n) { \
	363	l=0; (c)+=n; \
	364	switch (n) { \
	365	case 3: l =((unsigned long)(*(--(c))))<< 8; \
	366	case 2: l\|=((unsigned long)(*(--(c))))<<16; \
	367	case 1: l\|=((unsigned long)(*(--(c))))<<24; \
	368	} }
	369	#define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \
	370	*((c)++)=(unsigned char)(((l)>>16)&0xff), \
	371	*((c)++)=(unsigned char)(((l)>> 8)&0xff), \
	372	*((c)++)=(unsigned char)(((l) )&0xff), \
	373	l)
	374
	375	#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
	376
	377	#define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++))) ), \
	378	l\|=(((unsigned long)(*((c)++)))<< 8), \
	379	l\|=(((unsigned long)(*((c)++)))<<16), \
	380	l\|=(((unsigned long)(*((c)++)))<<24), \
	381	l)
	382	#define HOST_p_c2l(c,l,n) { \
	383	switch (n) { \
	384	case 0: l =((unsigned long)(*((c)++))); \
	385	case 1: l\|=((unsigned long)(*((c)++)))<< 8; \
	386	case 2: l\|=((unsigned long)(*((c)++)))<<16; \
	387	case 3: l\|=((unsigned long)(*((c)++)))<<24; \
	388	} }
	389	#define HOST_p_c2l_p(c,l,sc,len) { \
	390	switch (sc) { \
	391	case 0: l =((unsigned long)(*((c)++))); \
	392	if (--len == 0) break; \
	393	case 1: l\|=((unsigned long)(*((c)++)))<< 8; \
	394	if (--len == 0) break; \
	395	case 2: l\|=((unsigned long)(*((c)++)))<<16; \
	396	} }
	397	/* NOTE the pointer is not incremented at the end of this */
398	#define HOST_c2l_p(c,l,n) { \
399	l=0; (c)+=n; \
400	switch (n) { \
401	case 3: l =((unsigned long)(*(--(c))))<<16; \
402	case 2: l\|=((unsigned long)(*(--(c))))<< 8; \
403	case 1: l\|=((unsigned long)(*(--(c)))); \
404	} }
405	#define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
406	*((c)++)=(unsigned char)(((l)>> 8)&0xff), \
407	*((c)++)=(unsigned char)(((l)>>16)&0xff), \
408	*((c)++)=(unsigned char)(((l)>>24)&0xff), \
409	l)
410
411	#endif
412
413	/*
414	* Time for some action:-)
415	*/
416
2dc769a1	417	int HASH_UPDATE (HASH_CTX c, const void data_, unsigned long len)
bd3576d2	418	{
bd445703	419	const unsigned char *data=data_;
bd3576d2 UM	420	register HASH_LONG * p;
	421	register unsigned long l;
	422	int sw,sc,ew,ec;
	423
2dc769a1	424	if (len==0) return 1;
bd3576d2 UM	425
	426	l=(c->Nl+(len<<3))&0xffffffffL;
	427	/* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
	428	* Wei Dai <weidai@eskimo.com> for pointing it out. */
	429	if (l < c->Nl) /* overflow */
	430	c->Nh++;
	431	c->Nh+=(len>>29);
	432	c->Nl=l;
	433
	434	if (c->num != 0)
	435	{
	436	p=c->data;
	437	sw=c->num>>2;
	438	sc=c->num&0x03;
	439
	440	if ((c->num+len) >= HASH_CBLOCK)
	441	{
	442	l=p[sw]; HOST_p_c2l(data,l,sc); p[sw++]=l;
	443	for (; sw<HASH_LBLOCK; sw++)
	444	{
	445	HOST_c2l(data,l); p[sw]=l;
	446	}
	447	HASH_BLOCK_HOST_ORDER (c,p,1);
	448	len-=(HASH_CBLOCK-c->num);
	449	c->num=0;
	450	/* drop through and do the rest */
	451	}
	452	else
	453	{
	454	c->num+=len;
	455	if ((sc+len) < 4) /* ugly, add char's to a word */
	456	{
	457	l=p[sw]; HOST_p_c2l_p(data,l,sc,len); p[sw]=l;
	458	}
	459	else
	460	{
	461	ew=(c->num>>2);
	462	ec=(c->num&0x03);
134fea9d BM	463	if (sc)
	464	l=p[sw];
	465	HOST_p_c2l(data,l,sc);
	466	p[sw++]=l;
bd3576d2 UM	467	for (; sw < ew; sw++)
	468	{
	469	HOST_c2l(data,l); p[sw]=l;
	470	}
	471	if (ec)
	472	{
	473	HOST_c2l_p(data,l,ec); p[sw]=l;
	474	}
	475	}
2dc769a1	476	return 1;
bd3576d2 UM	477	}
	478	}
	479
	480	sw=len/HASH_CBLOCK;
	481	if (sw > 0)
	482	{
0a78c297	483	#if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
bd3576d2 UM	484	/*
	485	* Note that HASH_BLOCK_DATA_ORDER_ALIGNED gets defined
	486	* only if sizeof(HASH_LONG)==4.
	487	*/
	488	if ((((unsigned long)data)%4) == 0)
	489	{
4d5d543e BM	490	/* data is properly aligned so that we can cast it: */
4d5d543e BM	491	HASH_BLOCK_DATA_ORDER_ALIGNED (c,(HASH_LONG *)data,sw);
bd3576d2 UM	492	sw*=HASH_CBLOCK;
	493	data+=sw;
	494	len-=sw;
	495	}
	496	else
	497	#if !defined(HASH_BLOCK_DATA_ORDER)
	498	while (sw--)
	499	{
	500	memcpy (p=c->data,data,HASH_CBLOCK);
	501	HASH_BLOCK_DATA_ORDER_ALIGNED(c,p,1);
	502	data+=HASH_CBLOCK;
	503	len-=HASH_CBLOCK;
	504	}
	505	#endif
	506	#endif
	507	#if defined(HASH_BLOCK_DATA_ORDER)
	508	{
531b2cf7	509	HASH_BLOCK_DATA_ORDER(c,data,sw);
bd3576d2 UM	510	sw*=HASH_CBLOCK;
	511	data+=sw;
	512	len-=sw;
	513	}
	514	#endif
	515	}
	516
	517	if (len!=0)
	518	{
	519	p = c->data;
	520	c->num = len;
	521	ew=len>>2; /* words to copy */
	522	ec=len&0x03;
	523	for (; ew; ew--,p++)
	524	{
	525	HOST_c2l(data,l); *p=l;
	526	}
	527	HOST_c2l_p(data,l,ec);
	528	*p=l;
	529	}
2dc769a1	530	return 1;
bd3576d2 UM	531	}
	532
	533
ac7d0785	534	void HASH_TRANSFORM (HASH_CTX c, const unsigned char data)
bd3576d2	535	{
0a78c297	536	#if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
bd3576d2	537	if ((((unsigned long)data)%4) == 0)
4d5d543e BM	538	/* data is properly aligned so that we can cast it: */
4d5d543e BM	539	HASH_BLOCK_DATA_ORDER_ALIGNED (c,(HASH_LONG *)data,1);
bd3576d2 UM	540	else
	541	#if !defined(HASH_BLOCK_DATA_ORDER)
	542	{
	543	memcpy (c->data,data,HASH_CBLOCK);
	544	HASH_BLOCK_DATA_ORDER_ALIGNED (c,c->data,1);
	545	}
	546	#endif
	547	#endif
	548	#if defined(HASH_BLOCK_DATA_ORDER)
cdfb093f	549	HASH_BLOCK_DATA_ORDER (c,data,1);
bd3576d2 UM	550	#endif
	551	}
	552
	553
2dc769a1	554	int HASH_FINAL (unsigned char md, HASH_CTX c)
bd3576d2 UM	555	{
	556	register HASH_LONG *p;
	557	register unsigned long l;
	558	register int i,j;
	559	static const unsigned char end[4]={0x80,0x00,0x00,0x00};
	560	const unsigned char *cp=end;
	561
d0edffc7	562	#if 0
7f9c3745	563	if(FIPS_mode() && !FIPS_md5_allowed())
3642f632 BL	564	{
	565	FIPSerr(FIPS_F_HASH_FINAL,FIPS_R_NON_FIPS_METHOD);
	566	return 0;
	567	}
	568	#endif
	569
bd3576d2 UM	570	/* c->num should definitly have room for at least one more byte. */
	571	p=c->data;
	572	i=c->num>>2;
	573	j=c->num&0x03;
	574
	575	#if 0
	576	/* purify often complains about the following line as an
	577	* Uninitialized Memory Read. While this can be true, the
	578	* following p_c2l macro will reset l when that case is true.
	579	* This is because j&0x03 contains the number of 'valid' bytes
	580	* already in p[i]. If and only if j&0x03 == 0, the UMR will
	581	* occur but this is also the only time p_c2l will do
	582	* l= (cp++) instead of l\|= (cp++)
	583	* Many thanks to Alex Tang <altitude@cic.net> for pickup this
	584	* 'potential bug' */
	585	#ifdef PURIFY
	586	if (j==0) p[i]=0; /* Yeah, but that's not the way to fix it:-) */
	587	#endif
	588	l=p[i];
	589	#else
	590	l = (j==0) ? 0 : p[i];
	591	#endif
	592	HOST_p_c2l(cp,l,j); p[i++]=l; /* i is the next 'undefined word' */
	593
	594	if (i>(HASH_LBLOCK-2)) /* save room for Nl and Nh */
	595	{
	596	if (i<HASH_LBLOCK) p[i]=0;
	597	HASH_BLOCK_HOST_ORDER (c,p,1);
	598	i=0;
	599	}
	600	for (; i<(HASH_LBLOCK-2); i++)
	601	p[i]=0;
	602
	603	#if defined(DATA_ORDER_IS_BIG_ENDIAN)
	604	p[HASH_LBLOCK-2]=c->Nh;
	605	p[HASH_LBLOCK-1]=c->Nl;
	606	#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
	607	p[HASH_LBLOCK-2]=c->Nl;
	608	p[HASH_LBLOCK-1]=c->Nh;
	609	#endif
	610	HASH_BLOCK_HOST_ORDER (c,p,1);
	611
1cbde6e4 AP	612	#ifndef HASH_MAKE_STRING
	613	#error "HASH_MAKE_STRING must be defined!"
	614	#else
	615	HASH_MAKE_STRING(c,md);
	616	#endif
bd3576d2 UM	617
	618	c->num=0;
	619	/* clear stuff, HASH_BLOCK may be leaving some stuff on the stack
	620	* but I'm not worried :-)
75e3026a	621	OPENSSL_cleanse((void *)c,sizeof(HASH_CTX));
bd3576d2	622	*/
2dc769a1	623	return 1;
bd3576d2	624	}
1cbdbcd5 AP	625
	626	#ifndef MD32_REG_T
	627	#define MD32_REG_T long
	628	/*
	629	* This comment was originaly written for MD5, which is why it
	630	* discusses A-D. But it basically applies to all 32-bit digests,
	631	* which is why it was moved to common header file.
	632	*
	633	* In case you wonder why A-D are declared as long and not
	634	* as MD5_LONG. Doing so results in slight performance
	635	* boost on LP64 architectures. The catch is we don't
	636	* really care if 32 MSBs of a 64-bit register get polluted
	637	* with eventual overflows as we save only 32 LSBs in
	638	* either case. Now declaring 'em long excuses the compiler
	639	* from keeping 32 MSBs zeroed resulting in 13% performance
	640	* improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
	641	* Well, to be honest it should say that this prevents
	642	* performance degradation.
	643	* <appro@fy.chalmers.se>
	644	* Apparently there're LP64 compilers that generate better
	645	* code if A-D are declared int. Most notably GCC-x86_64
	646	* generates better code.
	647	* <appro@fy.chalmers.se>
	648	*/
	649	#endif