2 * Copyright 1999-2016 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
11 * This is a generic 32 bit "collector" for message digest algorithms.
12 * Whenever needed it collects input character stream into chunks of
13 * 32 bit values and invokes a block function that performs actual hash
20 * DATA_ORDER_IS_BIG_ENDIAN or DATA_ORDER_IS_LITTLE_ENDIAN
21 * this macro defines byte order of input stream.
23 * size of a unit chunk HASH_BLOCK operates on.
25 * has to be at lest 32 bit wide.
27 * context structure that at least contains following
33 * HASH_LONG data[HASH_LBLOCK];
34 * unsigned char data[HASH_CBLOCK];
39 * data[] vector is expected to be zeroed upon first call to
42 * name of "Update" function, implemented here.
44 * name of "Transform" function, implemented here.
46 * name of "Final" function, implemented here.
47 * HASH_BLOCK_DATA_ORDER
48 * name of "block" function capable of treating *unaligned* input
49 * message in original (data) byte order, implemented externally.
51 * macro convering context variables to an ASCII hash string.
55 * #define DATA_ORDER_IS_LITTLE_ENDIAN
57 * #define HASH_LONG MD5_LONG
58 * #define HASH_CTX MD5_CTX
59 * #define HASH_CBLOCK MD5_CBLOCK
60 * #define HASH_UPDATE MD5_Update
61 * #define HASH_TRANSFORM MD5_Transform
62 * #define HASH_FINAL MD5_Final
63 * #define HASH_BLOCK_DATA_ORDER md5_block_data_order
65 * <appro@fy.chalmers.se>
68 #if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)
69 # error "DATA_ORDER must be defined!"
73 # error "HASH_CBLOCK must be defined!"
76 # error "HASH_LONG must be defined!"
79 # error "HASH_CTX must be defined!"
83 # error "HASH_UPDATE must be defined!"
85 #ifndef HASH_TRANSFORM
86 # error "HASH_TRANSFORM must be defined!"
89 # error "HASH_FINAL must be defined!"
92 #ifndef HASH_BLOCK_DATA_ORDER
93 # error "HASH_BLOCK_DATA_ORDER must be defined!"
97 * Engage compiler specific rotate intrinsic function if available.
101 # if defined(_MSC_VER)
102 # define ROTATE(a,n) _lrotl(a,n)
103 # elif defined(__ICC)
104 # define ROTATE(a,n) _rotl(a,n)
105 # elif defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
107 * Some GNU C inline assembler templates. Note that these are
108 * rotates by *constant* number of bits! But that's exactly
109 * what we need here...
110 * <appro@fy.chalmers.se>
112 # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
113 # define ROTATE(a,n) ({ register unsigned int ret; \
117 : "I"(n), "0"((unsigned int)(a)) \
121 # elif defined(_ARCH_PPC) || defined(_ARCH_PPC64) || \
122 defined(__powerpc) || defined(__ppc__) || defined(__powerpc64__)
123 # define ROTATE(a,n) ({ register unsigned int ret; \
125 "rlwinm %0,%1,%2,0,31" \
130 # elif defined(__s390x__)
131 # define ROTATE(a,n) ({ register unsigned int ret; \
132 asm ("rll %0,%1,%2" \
139 #endif /* PEDANTIC */
142 # define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
145 #if defined(DATA_ORDER_IS_BIG_ENDIAN)
148 # if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
149 # if ((defined(__i386) || defined(__i386__)) && !defined(I386_ONLY)) || \
150 (defined(__x86_64) || defined(__x86_64__))
151 # if !defined(B_ENDIAN)
153 * This gives ~30-40% performance improvement in SHA-256 compiled
154 * with gcc [on P4]. Well, first macro to be frank. We can pull
155 * this trick on x86* platforms only, because these CPUs can fetch
156 * unaligned data without raising an exception.
158 # define HOST_c2l(c,l) ({ unsigned int r=*((const unsigned int *)(c)); \
159 asm ("bswapl %0":"=r"(r):"0"(r)); \
161 # define HOST_l2c(l,c) ({ unsigned int r=(l); \
162 asm ("bswapl %0":"=r"(r):"0"(r)); \
163 *((unsigned int *)(c))=r; (c)+=4; r; })
165 # elif defined(__aarch64__)
166 # if defined(__BYTE_ORDER__)
167 # if defined(__ORDER_LITTLE_ENDIAN__) && __BYTE_ORDER__==__ORDER_LITTLE_ENDIAN__
168 # define HOST_c2l(c,l) ({ unsigned int r; \
171 :"r"(*((const unsigned int *)(c))));\
173 # define HOST_l2c(l,c) ({ unsigned int r; \
176 :"r"((unsigned int)(l)));\
177 *((unsigned int *)(c))=r; (c)+=4; r; })
178 # elif defined(__ORDER_BIG_ENDIAN__) && __BYTE_ORDER__==__ORDER_BIG_ENDIAN__
179 # define HOST_c2l(c,l) ((l)=*((const unsigned int *)(c)), (c)+=4, (l))
180 # define HOST_l2c(l,c) (*((unsigned int *)(c))=(l), (c)+=4, (l))
185 # if defined(__s390__) || defined(__s390x__)
186 # define HOST_c2l(c,l) ((l)=*((const unsigned int *)(c)), (c)+=4, (l))
187 # define HOST_l2c(l,c) (*((unsigned int *)(c))=(l), (c)+=4, (l))
192 # define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++)))<<24), \
193 l|=(((unsigned long)(*((c)++)))<<16), \
194 l|=(((unsigned long)(*((c)++)))<< 8), \
195 l|=(((unsigned long)(*((c)++))) ) )
198 # define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \
199 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
200 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
201 *((c)++)=(unsigned char)(((l) )&0xff), \
205 #elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
208 # if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
209 # if defined(__s390x__)
210 # define HOST_c2l(c,l) ({ asm ("lrv %0,%1" \
211 :"=d"(l) :"m"(*(const unsigned int *)(c)));\
213 # define HOST_l2c(l,c) ({ asm ("strv %1,%0" \
214 :"=m"(*(unsigned int *)(c)) :"d"(l));\
218 # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
220 /* See comment in DATA_ORDER_IS_BIG_ENDIAN section. */
221 # define HOST_c2l(c,l) ((l)=*((const unsigned int *)(c)), (c)+=4, l)
222 # define HOST_l2c(l,c) (*((unsigned int *)(c))=(l), (c)+=4, l)
228 # define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++))) ), \
229 l|=(((unsigned long)(*((c)++)))<< 8), \
230 l|=(((unsigned long)(*((c)++)))<<16), \
231 l|=(((unsigned long)(*((c)++)))<<24) )
234 # define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
235 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
236 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
237 *((c)++)=(unsigned char)(((l)>>24)&0xff), \
244 * Time for some action:-)
247 int HASH_UPDATE(HASH_CTX *c, const void *data_, size_t len)
249 const unsigned char *data = data_;
257 l = (c->Nl + (((HASH_LONG) len) << 3)) & 0xffffffffUL;
259 * 95-05-24 eay Fixed a bug with the overflow handling, thanks to Wei Dai
260 * <weidai@eskimo.com> for pointing it out.
262 if (l < c->Nl) /* overflow */
264 c->Nh += (HASH_LONG) (len >> 29); /* might cause compiler warning on
270 p = (unsigned char *)c->data;
272 if (len >= HASH_CBLOCK || len + n >= HASH_CBLOCK) {
273 memcpy(p + n, data, HASH_CBLOCK - n);
274 HASH_BLOCK_DATA_ORDER(c, p, 1);
279 memset(p, 0, HASH_CBLOCK); /* keep it zeroed */
281 memcpy(p + n, data, len);
282 c->num += (unsigned int)len;
287 n = len / HASH_CBLOCK;
289 HASH_BLOCK_DATA_ORDER(c, data, n);
296 p = (unsigned char *)c->data;
297 c->num = (unsigned int)len;
298 memcpy(p, data, len);
303 void HASH_TRANSFORM(HASH_CTX *c, const unsigned char *data)
305 HASH_BLOCK_DATA_ORDER(c, data, 1);
308 int HASH_FINAL(unsigned char *md, HASH_CTX *c)
310 unsigned char *p = (unsigned char *)c->data;
313 p[n] = 0x80; /* there is always room for one */
316 if (n > (HASH_CBLOCK - 8)) {
317 memset(p + n, 0, HASH_CBLOCK - n);
319 HASH_BLOCK_DATA_ORDER(c, p, 1);
321 memset(p + n, 0, HASH_CBLOCK - 8 - n);
323 p += HASH_CBLOCK - 8;
324 #if defined(DATA_ORDER_IS_BIG_ENDIAN)
325 (void)HOST_l2c(c->Nh, p);
326 (void)HOST_l2c(c->Nl, p);
327 #elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
328 (void)HOST_l2c(c->Nl, p);
329 (void)HOST_l2c(c->Nh, p);
332 HASH_BLOCK_DATA_ORDER(c, p, 1);
334 memset(p, 0, HASH_CBLOCK);
336 #ifndef HASH_MAKE_STRING
337 # error "HASH_MAKE_STRING must be defined!"
339 HASH_MAKE_STRING(c, md);
346 # if defined(__alpha) || defined(__sparcv9) || defined(__mips)
347 # define MD32_REG_T long
349 * This comment was originally written for MD5, which is why it
350 * discusses A-D. But it basically applies to all 32-bit digests,
351 * which is why it was moved to common header file.
353 * In case you wonder why A-D are declared as long and not
354 * as MD5_LONG. Doing so results in slight performance
355 * boost on LP64 architectures. The catch is we don't
356 * really care if 32 MSBs of a 64-bit register get polluted
357 * with eventual overflows as we *save* only 32 LSBs in
358 * *either* case. Now declaring 'em long excuses the compiler
359 * from keeping 32 MSBs zeroed resulting in 13% performance
360 * improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
361 * Well, to be honest it should say that this *prevents*
362 * performance degradation.
363 * <appro@fy.chalmers.se>
367 * Above is not absolute and there are LP64 compilers that
368 * generate better code if MD32_REG_T is defined int. The above
369 * pre-processor condition reflects the circumstances under which
370 * the conclusion was made and is subject to further extension.
371 * <appro@fy.chalmers.se>
373 # define MD32_REG_T int