Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/md32_common.h	Lines:	58	59	98.3 %
Date:	2017-11-13	Branches:	22	29	75.9 %


/* $OpenBSD: md32_common.h,v 1.22 2016/11/04 13:56:04 miod Exp $ */
/* ====================================================================
 * Copyright (c) 1999-2007 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 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 least 32 bit wide.
 * HASH_CTX
 *	context structure that at least contains following
 *	members:
 *		typedef struct {
 *			...
 *			HASH_LONG	Nl,Nh;
 *			either {
 *			HASH_LONG	data[HASH_LBLOCK];
 *			unsigned char	data[HASH_CBLOCK];
 *			};
 *			unsigned int	num;
 *			...
 *			} HASH_CTX;
 *	data[] vector is expected to be zeroed upon first call to
 *	HASH_UPDATE.
 * 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_DATA_ORDER
 *	name of "block" function capable of treating *unaligned* input
 *	message in original (data) byte order, implemented externally.
 * HASH_MAKE_STRING
 *	macro convering context variables to an ASCII hash string.
 *
 * MD5 example:
 *
 *	#define DATA_ORDER_IS_LITTLE_ENDIAN
 *
 *	#define HASH_LONG		MD5_LONG
 *	#define HASH_CTX		MD5_CTX
 *	#define HASH_CBLOCK		MD5_CBLOCK
 *	#define HASH_UPDATE		MD5_Update
 *	#define HASH_TRANSFORM		MD5_Transform
 *	#define HASH_FINAL		MD5_Final
 *	#define HASH_BLOCK_DATA_ORDER	md5_block_data_order
 *
 *					<appro@fy.chalmers.se>
 */

#include <stdint.h>

#include <openssl/opensslconf.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
#if !defined(HASH_FINAL) && !defined(HASH_NO_FINAL)
#error "HASH_FINAL or HASH_NO_FINAL must be defined!"
#endif

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

/*
 * This common idiom is recognized by the compiler and turned into a
 * CPU-specific intrinsic as appropriate.
 * e.g. GCC optimizes to roll on amd64 at -O0
 */
static inline uint32_t ROTATE(uint32_t a, uint32_t n)
{
	return (a<<n)|(a>>(32-n));
}

#if defined(DATA_ORDER_IS_BIG_ENDIAN)

#if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
# if (defined(__i386) || defined(__i386__) || \
      defined(__x86_64) || defined(__x86_64__))
    /*
     * This gives ~30-40% performance improvement in SHA-256 compiled
     * with gcc [on P4]. Well, first macro to be frank. We can pull
     * this trick on x86* platforms only, because these CPUs can fetch
     * unaligned data without raising an exception.
     */
#  define HOST_c2l(c,l)	({ unsigned int r=*((const unsigned int *)(c));	\
				   asm ("bswapl %0":"=r"(r):"0"(r));	\
				   (c)+=4; (l)=r;			})
#  define HOST_l2c(l,c)	({ unsigned int r=(l);			\
				   asm ("bswapl %0":"=r"(r):"0"(r));	\
				   *((unsigned int *)(c))=r; (c)+=4;	})
# endif
#endif

#ifndef HOST_c2l
#define HOST_c2l(c,l) do {l =(((unsigned long)(*((c)++)))<<24);	\
			  l|=(((unsigned long)(*((c)++)))<<16);	\
			  l|=(((unsigned long)(*((c)++)))<< 8);	\
			  l|=(((unsigned long)(*((c)++)))    );	\
		      } while (0)
#endif
#ifndef HOST_l2c
#define HOST_l2c(l,c) do {*((c)++)=(unsigned char)(((l)>>24)&0xff);	\
			  *((c)++)=(unsigned char)(((l)>>16)&0xff);	\
			  *((c)++)=(unsigned char)(((l)>> 8)&0xff);	\
			  *((c)++)=(unsigned char)(((l)    )&0xff);	\
		      } while (0)
#endif

#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)

#if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
#  define HOST_c2l(c,l)	((l)=*((const unsigned int *)(c)), (c)+=4)
#  define HOST_l2c(l,c)	(*((unsigned int *)(c))=(l), (c)+=4)
#endif

#ifndef HOST_c2l
#define HOST_c2l(c,l) do {l =(((unsigned long)(*((c)++)))    );	\
			  l|=(((unsigned long)(*((c)++)))<< 8);	\
			  l|=(((unsigned long)(*((c)++)))<<16);	\
			  l|=(((unsigned long)(*((c)++)))<<24);	\
		      } while (0)
#endif
#ifndef HOST_l2c
#define HOST_l2c(l,c) do {*((c)++)=(unsigned char)(((l)    )&0xff);	\
			  *((c)++)=(unsigned char)(((l)>> 8)&0xff);	\
			  *((c)++)=(unsigned char)(((l)>>16)&0xff);	\
			  *((c)++)=(unsigned char)(((l)>>24)&0xff);	\
		      } while (0)
#endif

#endif

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

int
HASH_UPDATE(HASH_CTX *c, const void *data_, size_t len)
{
	const unsigned char *data = data_;
	unsigned char *p;
	HASH_LONG l;
	size_t n;

	if (len == 0)
		return 1;

	l = (c->Nl + (((HASH_LONG)len) << 3))&0xffffffffUL;
	/* 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+=(HASH_LONG)(len>>29);	/* might cause compiler warning on 16-bit */
	c->Nl = l;

	n = c->num;
	if (n != 0) {
		p = (unsigned char *)c->data;

		if (len >= HASH_CBLOCK || len + n >= HASH_CBLOCK) {
			memcpy (p + n, data, HASH_CBLOCK - n);
			HASH_BLOCK_DATA_ORDER (c, p, 1);
			n = HASH_CBLOCK - n;
			data += n;
			len -= n;
			c->num = 0;
			memset (p,0,HASH_CBLOCK);	/* keep it zeroed */
		} else {
			memcpy (p + n, data, len);
			c->num += (unsigned int)len;
			return 1;
		}
	}

	n = len/HASH_CBLOCK;
	if (n > 0) {
		HASH_BLOCK_DATA_ORDER (c, data, n);
		n    *= HASH_CBLOCK;
		data += n;
		len -= n;
	}

	if (len != 0) {
		p = (unsigned char *)c->data;
		c->num = (unsigned int)len;
		memcpy (p, data, len);
	}
	return 1;
}


void HASH_TRANSFORM (HASH_CTX *c, const unsigned char *data)
{
	HASH_BLOCK_DATA_ORDER (c, data, 1);
}


#ifndef HASH_NO_FINAL
int HASH_FINAL (unsigned char *md, HASH_CTX *c)
{
	unsigned char *p = (unsigned char *)c->data;
	size_t n = c->num;

	p[n] = 0x80; /* there is always room for one */
	n++;

	if (n > (HASH_CBLOCK - 8)) {
		memset (p + n, 0, HASH_CBLOCK - n);
		n = 0;
		HASH_BLOCK_DATA_ORDER (c, p, 1);
	}
	memset (p + n, 0, HASH_CBLOCK - 8 - n);

	p += HASH_CBLOCK - 8;
#if   defined(DATA_ORDER_IS_BIG_ENDIAN)
	HOST_l2c(c->Nh, p);
	HOST_l2c(c->Nl, p);
#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
	HOST_l2c(c->Nl, p);
	HOST_l2c(c->Nh, p);
#endif
	p -= HASH_CBLOCK;
	HASH_BLOCK_DATA_ORDER (c, p, 1);
	c->num = 0;
	memset (p, 0, HASH_CBLOCK);

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

	return 1;
}
#endif

#ifndef MD32_REG_T
#if defined(__alpha) || defined(__sparcv9) || defined(__mips)
#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>
 */
#else
/*
 * Above is not absolute and there are LP64 compilers that
 * generate better code if MD32_REG_T is defined int. The above
 * pre-processor condition reflects the circumstances under which
 * the conclusion was made and is subject to further extension.
 *				<appro@fy.chalmers.se>
 */
#define MD32_REG_T int
#endif
#endif


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: md32_common.h,v 1.22 2016/11/04 13:56:04 miod Exp $ */
2			/* ====================================================================
3			* Copyright (c) 1999-2007 The OpenSSL Project. All rights reserved.
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			*/
51
52			/*
53			* This is a generic 32 bit "collector" for message digest algorithms.
54			* Whenever needed it collects input character stream into chunks of
55			* 32 bit values and invokes a block function that performs actual hash
56			* calculations.
57			*
58			* Porting guide.
59			*
60			* Obligatory macros:
61			*
62			* DATA_ORDER_IS_BIG_ENDIAN or DATA_ORDER_IS_LITTLE_ENDIAN
63			* this macro defines byte order of input stream.
64			* HASH_CBLOCK
65			* size of a unit chunk HASH_BLOCK operates on.
66			* HASH_LONG
67			* has to be at least 32 bit wide.
68			* HASH_CTX
69			* context structure that at least contains following
70			* members:
71			* typedef struct {
72			* ...
73			* HASH_LONG Nl,Nh;
74			* either {
75			* HASH_LONG data[HASH_LBLOCK];
76			* unsigned char data[HASH_CBLOCK];
77			* };
78			* unsigned int num;
79			* ...
80			* } HASH_CTX;
81			* data[] vector is expected to be zeroed upon first call to
82			* HASH_UPDATE.
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_DATA_ORDER
90			* name of "block" function capable of treating unaligned input
91			* message in original (data) byte order, implemented externally.
92			* HASH_MAKE_STRING
93			* macro convering context variables to an ASCII hash string.
94			*
95			* MD5 example:
96			*
97			* #define DATA_ORDER_IS_LITTLE_ENDIAN
98			*
99			* #define HASH_LONG MD5_LONG
100			* #define HASH_CTX MD5_CTX
101			* #define HASH_CBLOCK MD5_CBLOCK
102			* #define HASH_UPDATE MD5_Update
103			* #define HASH_TRANSFORM MD5_Transform
104			* #define HASH_FINAL MD5_Final
105			* #define HASH_BLOCK_DATA_ORDER md5_block_data_order
106			*
107			* <appro@fy.chalmers.se>
108			*/
109
110			#include <stdint.h>
111
112			#include <openssl/opensslconf.h>
113
114			#if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)
115			#error "DATA_ORDER must be defined!"
116			#endif
117
118			#ifndef HASH_CBLOCK
119			#error "HASH_CBLOCK must be defined!"
120			#endif
121			#ifndef HASH_LONG
122			#error "HASH_LONG must be defined!"
123			#endif
124			#ifndef HASH_CTX
125			#error "HASH_CTX must be defined!"
126			#endif
127
128			#ifndef HASH_UPDATE
129			#error "HASH_UPDATE must be defined!"
130			#endif
131			#ifndef HASH_TRANSFORM
132			#error "HASH_TRANSFORM must be defined!"
133			#endif
134			#if !defined(HASH_FINAL) && !defined(HASH_NO_FINAL)
135			#error "HASH_FINAL or HASH_NO_FINAL must be defined!"
136			#endif
137
138			#ifndef HASH_BLOCK_DATA_ORDER
139			#error "HASH_BLOCK_DATA_ORDER must be defined!"
140			#endif
141
142			/*
143			* This common idiom is recognized by the compiler and turned into a
144			* CPU-specific intrinsic as appropriate.
145			* e.g. GCC optimizes to roll on amd64 at -O0
146			*/
147			static inline uint32_t ROTATE(uint32_t a, uint32_t n)
148			{
149		34016	return (a<<n)\|(a>>(32-n));
150			}
151
152			#if defined(DATA_ORDER_IS_BIG_ENDIAN)
153
154			#if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
155			# if (defined(__i386) \|\| defined(__i386__) \|\| \
156			defined(__x86_64) \|\| defined(__x86_64__))
157			/*
158			* This gives ~30-40% performance improvement in SHA-256 compiled
159			* with gcc [on P4]. Well, first macro to be frank. We can pull
160			* this trick on x86* platforms only, because these CPUs can fetch
161			* unaligned data without raising an exception.
162			*/
163			# define HOST_c2l(c,l) ({ unsigned int r=((const unsigned int )(c)); \
164			asm ("bswapl %0":"=r"(r):"0"(r)); \
165			(c)+=4; (l)=r; })
166			# define HOST_l2c(l,c) ({ unsigned int r=(l); \
167			asm ("bswapl %0":"=r"(r):"0"(r)); \
168			((unsigned int )(c))=r; (c)+=4; })
169			# endif
170			#endif
171
172			#ifndef HOST_c2l
173			#define HOST_c2l(c,l) do {l =(((unsigned long)(*((c)++)))<<24); \
174			l\|=(((unsigned long)(*((c)++)))<<16); \
175			l\|=(((unsigned long)(*((c)++)))<< 8); \
176			l\|=(((unsigned long)(*((c)++))) ); \
177			} while (0)
178			#endif
179			#ifndef HOST_l2c
180			#define HOST_l2c(l,c) do {*((c)++)=(unsigned char)(((l)>>24)&0xff); \
181			*((c)++)=(unsigned char)(((l)>>16)&0xff); \
182			*((c)++)=(unsigned char)(((l)>> 8)&0xff); \
183			*((c)++)=(unsigned char)(((l) )&0xff); \
184			} while (0)
185			#endif
186
187			#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
188
189			#if defined(__i386) \|\| defined(__i386__) \|\| defined(__x86_64) \|\| defined(__x86_64__)
190			# define HOST_c2l(c,l) ((l)=((const unsigned int )(c)), (c)+=4)
191			# define HOST_l2c(l,c) (((unsigned int )(c))=(l), (c)+=4)
192			#endif
193
194			#ifndef HOST_c2l
195			#define HOST_c2l(c,l) do {l =(((unsigned long)(*((c)++))) ); \
196			l\|=(((unsigned long)(*((c)++)))<< 8); \
197			l\|=(((unsigned long)(*((c)++)))<<16); \
198			l\|=(((unsigned long)(*((c)++)))<<24); \
199			} while (0)
200			#endif
201			#ifndef HOST_l2c
202			#define HOST_l2c(l,c) do {*((c)++)=(unsigned char)(((l) )&0xff); \
203			*((c)++)=(unsigned char)(((l)>> 8)&0xff); \
204			*((c)++)=(unsigned char)(((l)>>16)&0xff); \
205			*((c)++)=(unsigned char)(((l)>>24)&0xff); \
206			} while (0)
207			#endif
208
209			#endif
210
211			/*
212			* Time for some action:-)
213			*/
214
215			int
216			HASH_UPDATE(HASH_CTX c, const void data_, size_t len)
217			{
218			const unsigned char *data = data_;
219			unsigned char *p;
220			HASH_LONG l;
221			size_t n;
222
223	✓✓	1962570	if (len == 0)
224		3132	return 1;
225
226		978153	l = (c->Nl + (((HASH_LONG)len) << 3))&0xffffffffUL;
227			/* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
228			* Wei Dai <weidai@eskimo.com> for pointing it out. */
229	✗✓	978153	if (l < c->Nl) /* overflow */
230			c->Nh++;
231		978153	c->Nh+=(HASH_LONG)(len>>29); /* might cause compiler warning on 16-bit */
232		978153	c->Nl = l;
233
234		978153	n = c->num;
235	✓✓	978153	if (n != 0) {
236		100588	p = (unsigned char *)c->data;
237
238	✓✓✓✓	179714	if (len >= HASH_CBLOCK \|\| len + n >= HASH_CBLOCK) {
239		36366	memcpy (p + n, data, HASH_CBLOCK - n);
240		36366	HASH_BLOCK_DATA_ORDER (c, p, 1);
241			n = HASH_CBLOCK - n;
242		36366	data += n;
243		36366	len -= n;
244		36366	c->num = 0;
245		36366	memset (p,0,HASH_CBLOCK); /* keep it zeroed */
246			} else {
247		64222	memcpy (p + n, data, len);
248		64222	c->num += (unsigned int)len;
249		64222	return 1;
250			}
251		36366	}
252
253		913931	n = len/HASH_CBLOCK;
254	✓✓	913931	if (n > 0) {
255		231717	HASH_BLOCK_DATA_ORDER (c, data, n);
256		231717	n *= HASH_CBLOCK;
257		231717	data += n;
258		231717	len -= n;
259		231717	}
260
261	✓✓	913931	if (len != 0) {
262		711028	p = (unsigned char *)c->data;
263		711028	c->num = (unsigned int)len;
264		711028	memcpy (p, data, len);
265		711028	}
266		913931	return 1;
267		981285	}
268
269
270			void HASH_TRANSFORM (HASH_CTX c, const unsigned char data)
271			{
272		3648	HASH_BLOCK_DATA_ORDER (c, data, 1);
273		1824	}
274
275
276			#ifndef HASH_NO_FINAL
277			int HASH_FINAL (unsigned char md, HASH_CTX c)
278			{
279		1354284	unsigned char p = (unsigned char )c->data;
280		677142	size_t n = c->num;
281
282		677142	p[n] = 0x80; /* there is always room for one */
283		677142	n++;
284
285	✓✓	677142	if (n > (HASH_CBLOCK - 8)) {
286		185	memset (p + n, 0, HASH_CBLOCK - n);
287			n = 0;
288		185	HASH_BLOCK_DATA_ORDER (c, p, 1);
289		185	}
290		677142	memset (p + n, 0, HASH_CBLOCK - 8 - n);
291
292		677142	p += HASH_CBLOCK - 8;
293			#if defined(DATA_ORDER_IS_BIG_ENDIAN)
294		654060	HOST_l2c(c->Nh, p);
295		654060	HOST_l2c(c->Nl, p);
296			#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
297		23082	HOST_l2c(c->Nl, p);
298		23082	HOST_l2c(c->Nh, p);
299			#endif
300		677142	p -= HASH_CBLOCK;
301		677142	HASH_BLOCK_DATA_ORDER (c, p, 1);
302		677142	c->num = 0;
303		677142	memset (p, 0, HASH_CBLOCK);
304
305			#ifndef HASH_MAKE_STRING
306			#error "HASH_MAKE_STRING must be defined!"
307			#else
308	✓✓✗✓ ✓✓✓✗ ✗✗✗✓ ✗	2729974	HASH_MAKE_STRING(c, md);
309			#endif
310
311		677142	return 1;
312		108046	}
313			#endif
314
315			#ifndef MD32_REG_T
316			#if defined(__alpha) \|\| defined(__sparcv9) \|\| defined(__mips)
317			#define MD32_REG_T long
318			/*
319			* This comment was originaly written for MD5, which is why it
320			* discusses A-D. But it basically applies to all 32-bit digests,
321			* which is why it was moved to common header file.
322			*
323			* In case you wonder why A-D are declared as long and not
324			* as MD5_LONG. Doing so results in slight performance
325			* boost on LP64 architectures. The catch is we don't
326			* really care if 32 MSBs of a 64-bit register get polluted
327			* with eventual overflows as we save only 32 LSBs in
328			* either case. Now declaring 'em long excuses the compiler
329			* from keeping 32 MSBs zeroed resulting in 13% performance
330			* improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
331			* Well, to be honest it should say that this prevents
332			* performance degradation.
333			* <appro@fy.chalmers.se>
334			*/
335			#else
336			/*
337			* Above is not absolute and there are LP64 compilers that
338			* generate better code if MD32_REG_T is defined int. The above
339			* pre-processor condition reflects the circumstances under which
340			* the conclusion was made and is subject to further extension.
341			* <appro@fy.chalmers.se>
342			*/
343			#define MD32_REG_T int
344			#endif
345			#endif