1 /* crypto/md32_common.h */
2 /* ====================================================================
3 * Copyright (c) 1999-2002 The OpenSSL Project. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
31 * 6. Redistributions of any form whatsoever must retain the following
33 * "This product includes software developed by the OpenSSL Project
34 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
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 * ====================================================================
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).
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
66 * DATA_ORDER_IS_BIG_ENDIAN or DATA_ORDER_IS_LITTLE_ENDIAN
67 * this macro defines byte order of input stream.
69 * size of a unit chunk HASH_BLOCK operates on.
71 * has to be at lest 32 bit wide, if it's wider, then
72 * HASH_LONG_LOG2 *has to* be defined along
74 * context structure that at least contains following
79 * HASH_LONG data[HASH_LBLOCK];
84 * name of "Update" function, implemented here.
86 * name of "Transform" function, implemented here.
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
98 * macro convering context variables to an ASCII hash string.
102 * B_ENDIAN or L_ENDIAN
103 * defines host byte-order.
105 * defaults to 2 if not states otherwise.
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.
115 * #define DATA_ORDER_IS_LITTLE_ENDIAN
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
128 * <appro@fy.chalmers.se>
131 #if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)
132 #error "DATA_ORDER must be defined!"
136 #error "HASH_CBLOCK must be defined!"
139 #error "HASH_LONG must be defined!"
142 #error "HASH_CTX must be defined!"
146 #error "HASH_UPDATE must be defined!"
148 #ifndef HASH_TRANSFORM
149 #error "HASH_TRANSFORM must be defined!"
152 #error "HASH_FINAL must be defined!"
155 #ifndef HASH_BLOCK_HOST_ORDER
156 #error "HASH_BLOCK_HOST_ORDER must be defined!"
161 * Moved below as it's required only if HASH_BLOCK_DATA_ORDER_ALIGNED
164 #ifndef HASH_BLOCK_DATA_ORDER
165 #error "HASH_BLOCK_DATA_ORDER must be defined!"
170 #define HASH_LBLOCK (HASH_CBLOCK/4)
173 #ifndef HASH_LONG_LOG2
174 #define HASH_LONG_LOG2 2
178 * Engage compiler specific rotate intrinsic function if available.
182 # if defined(_MSC_VER) || defined(__ICC)
183 # define ROTATE(a,n) _lrotl(a,n)
184 # elif defined(__MWERKS__)
185 # if defined(__POWERPC__)
186 # define ROTATE(a,n) __rlwinm(a,n,0,31)
187 # elif defined(__MC68K__)
188 /* Motorola specific tweak. <appro@fy.chalmers.se> */
189 # define ROTATE(a,n) ( n<24 ? __rol(a,n) : __ror(a,32-n) )
191 # define ROTATE(a,n) __rol(a,n)
193 # elif defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
195 * Some GNU C inline assembler templates. Note that these are
196 * rotates by *constant* number of bits! But that's exactly
197 * what we need here...
198 * <appro@fy.chalmers.se>
200 # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
201 # define ROTATE(a,n) ({ register unsigned int ret; \
209 # elif defined(__powerpc) || defined(__ppc)
210 # define ROTATE(a,n) ({ register unsigned int ret; \
212 "rlwinm %0,%1,%2,0,31" \
219 #endif /* PEDANTIC */
221 #if HASH_LONG_LOG2==2 /* Engage only if sizeof(HASH_LONG)== 4 */
222 /* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
224 /* 5 instructions with rotate instruction, else 9 */
225 #define REVERSE_FETCH32(a,l) ( \
226 l=*(const HASH_LONG *)(a), \
227 ((ROTATE(l,8)&0x00FF00FF)|(ROTATE((l&0x00FF00FF),24))) \
230 /* 6 instructions with rotate instruction, else 8 */
231 #define REVERSE_FETCH32(a,l) ( \
232 l=*(const HASH_LONG *)(a), \
233 l=(((l>>8)&0x00FF00FF)|((l&0x00FF00FF)<<8)), \
237 * Originally the middle line started with l=(((l&0xFF00FF00)>>8)|...
238 * It's rewritten as above for two reasons:
239 * - RISCs aren't good at long constants and have to explicitely
240 * compose 'em with several (well, usually 2) instructions in a
241 * register before performing the actual operation and (as you
242 * already realized:-) having same constant should inspire the
243 * compiler to permanently allocate the only register for it;
244 * - most modern CPUs have two ALUs, but usually only one has
245 * circuitry for shifts:-( this minor tweak inspires compiler
246 * to schedule shift instructions in a better way...
248 * <appro@fy.chalmers.se>
254 #define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
258 * Make some obvious choices. E.g., HASH_BLOCK_DATA_ORDER_ALIGNED
259 * and HASH_BLOCK_HOST_ORDER ought to be the same if input data
260 * and host are of the same "endianess". It's possible to mask
261 * this with blank #define HASH_BLOCK_DATA_ORDER though...
263 * <appro@fy.chalmers.se>
265 #if defined(B_ENDIAN)
266 # if defined(DATA_ORDER_IS_BIG_ENDIAN)
267 # if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
268 # define HASH_BLOCK_DATA_ORDER_ALIGNED HASH_BLOCK_HOST_ORDER
271 #elif defined(L_ENDIAN)
272 # if defined(DATA_ORDER_IS_LITTLE_ENDIAN)
273 # if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
274 # define HASH_BLOCK_DATA_ORDER_ALIGNED HASH_BLOCK_HOST_ORDER
279 #if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
280 #ifndef HASH_BLOCK_DATA_ORDER
281 #error "HASH_BLOCK_DATA_ORDER must be defined!"
285 #if defined(DATA_ORDER_IS_BIG_ENDIAN)
288 # if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
289 # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
291 * This gives ~30-40% performance improvement in SHA-256 compiled
292 * with gcc [on P4]. Well, first macro to be frank. We can pull
293 * this trick on x86* platforms only, because these CPUs can fetch
294 * unaligned data without raising an exception.
296 # define HOST_c2l(c,l) ({ unsigned int r=*((const unsigned int *)(c)); \
297 asm ("bswapl %0":"=r"(r):"0"(r)); \
299 # define HOST_l2c(l,c) ({ unsigned int r=(l); \
300 asm ("bswapl %0":"=r"(r):"0"(r)); \
301 *((unsigned int *)(c))=r; (c)+=4; r; })
307 #define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++)))<<24), \
308 l|=(((unsigned long)(*((c)++)))<<16), \
309 l|=(((unsigned long)(*((c)++)))<< 8), \
310 l|=(((unsigned long)(*((c)++))) ), \
313 #define HOST_p_c2l(c,l,n) { \
315 case 0: l =((unsigned long)(*((c)++)))<<24; \
316 case 1: l|=((unsigned long)(*((c)++)))<<16; \
317 case 2: l|=((unsigned long)(*((c)++)))<< 8; \
318 case 3: l|=((unsigned long)(*((c)++))); \
320 #define HOST_p_c2l_p(c,l,sc,len) { \
322 case 0: l =((unsigned long)(*((c)++)))<<24; \
323 if (--len == 0) break; \
324 case 1: l|=((unsigned long)(*((c)++)))<<16; \
325 if (--len == 0) break; \
326 case 2: l|=((unsigned long)(*((c)++)))<< 8; \
328 /* NOTE the pointer is not incremented at the end of this */
329 #define HOST_c2l_p(c,l,n) { \
332 case 3: l =((unsigned long)(*(--(c))))<< 8; \
333 case 2: l|=((unsigned long)(*(--(c))))<<16; \
334 case 1: l|=((unsigned long)(*(--(c))))<<24; \
337 #define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \
338 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
339 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
340 *((c)++)=(unsigned char)(((l) )&0xff), \
344 #elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
346 #if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
347 /* See comment in DATA_ORDER_IS_BIG_ENDIAN section. */
348 # define HOST_c2l(c,l) ((l)=*((const unsigned int *)(c)), (c)+=4, l)
349 # define HOST_l2c(l,c) (*((unsigned int *)(c))=(l), (c)+=4, l)
353 #define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++))) ), \
354 l|=(((unsigned long)(*((c)++)))<< 8), \
355 l|=(((unsigned long)(*((c)++)))<<16), \
356 l|=(((unsigned long)(*((c)++)))<<24), \
359 #define HOST_p_c2l(c,l,n) { \
361 case 0: l =((unsigned long)(*((c)++))); \
362 case 1: l|=((unsigned long)(*((c)++)))<< 8; \
363 case 2: l|=((unsigned long)(*((c)++)))<<16; \
364 case 3: l|=((unsigned long)(*((c)++)))<<24; \
366 #define HOST_p_c2l_p(c,l,sc,len) { \
368 case 0: l =((unsigned long)(*((c)++))); \
369 if (--len == 0) break; \
370 case 1: l|=((unsigned long)(*((c)++)))<< 8; \
371 if (--len == 0) break; \
372 case 2: l|=((unsigned long)(*((c)++)))<<16; \
374 /* NOTE the pointer is not incremented at the end of this */
375 #define HOST_c2l_p(c,l,n) { \
378 case 3: l =((unsigned long)(*(--(c))))<<16; \
379 case 2: l|=((unsigned long)(*(--(c))))<< 8; \
380 case 1: l|=((unsigned long)(*(--(c)))); \
383 #define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
384 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
385 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
386 *((c)++)=(unsigned char)(((l)>>24)&0xff), \
393 * Time for some action:-)
396 int HASH_UPDATE (HASH_CTX *c, const void *data_, size_t len)
398 const unsigned char *data=data_;
399 register HASH_LONG * p;
400 register HASH_LONG l;
403 if (len==0) return 1;
405 l=(c->Nl+(((HASH_LONG)len)<<3))&0xffffffffUL;
406 /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
407 * Wei Dai <weidai@eskimo.com> for pointing it out. */
408 if (l < c->Nl) /* overflow */
410 c->Nh+=(len>>29); /* might cause compiler warning on 16-bit */
419 if ((c->num+len) >= HASH_CBLOCK)
421 l=p[sw]; HOST_p_c2l(data,l,sc); p[sw++]=l;
422 for (; sw<HASH_LBLOCK; sw++)
424 HOST_c2l(data,l); p[sw]=l;
426 HASH_BLOCK_HOST_ORDER (c,p,1);
427 len-=(HASH_CBLOCK-c->num);
429 /* drop through and do the rest */
433 c->num+=(unsigned int)len;
434 if ((sc+len) < 4) /* ugly, add char's to a word */
436 l=p[sw]; HOST_p_c2l_p(data,l,sc,len); p[sw]=l;
444 HOST_p_c2l(data,l,sc);
446 for (; sw < ew; sw++)
448 HOST_c2l(data,l); p[sw]=l;
452 HOST_c2l_p(data,l,ec); p[sw]=l;
462 #if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
464 * Note that HASH_BLOCK_DATA_ORDER_ALIGNED gets defined
465 * only if sizeof(HASH_LONG)==4.
467 if ((((size_t)data)%4) == 0)
469 /* data is properly aligned so that we can cast it: */
470 HASH_BLOCK_DATA_ORDER_ALIGNED (c,(const HASH_LONG *)data,sw);
476 #if !defined(HASH_BLOCK_DATA_ORDER)
479 memcpy (p=c->data,data,HASH_CBLOCK);
480 HASH_BLOCK_DATA_ORDER_ALIGNED(c,p,1);
486 #if defined(HASH_BLOCK_DATA_ORDER)
488 HASH_BLOCK_DATA_ORDER(c,data,sw);
500 ew=len>>2; /* words to copy */
504 HOST_c2l(data,l); *p=l;
506 HOST_c2l_p(data,l,ec);
513 void HASH_TRANSFORM (HASH_CTX *c, const unsigned char *data)
515 #if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
516 if ((((size_t)data)%4) == 0)
517 /* data is properly aligned so that we can cast it: */
518 HASH_BLOCK_DATA_ORDER_ALIGNED (c,(const HASH_LONG *)data,1);
520 #if !defined(HASH_BLOCK_DATA_ORDER)
522 memcpy (c->data,data,HASH_CBLOCK);
523 HASH_BLOCK_DATA_ORDER_ALIGNED (c,c->data,1);
527 #if defined(HASH_BLOCK_DATA_ORDER)
528 HASH_BLOCK_DATA_ORDER (c,data,1);
533 int HASH_FINAL (unsigned char *md, HASH_CTX *c)
535 register HASH_LONG *p;
536 register unsigned long l;
538 static const unsigned char end[4]={0x80,0x00,0x00,0x00};
539 const unsigned char *cp=end;
541 /* c->num should definitly have room for at least one more byte. */
547 /* purify often complains about the following line as an
548 * Uninitialized Memory Read. While this can be true, the
549 * following p_c2l macro will reset l when that case is true.
550 * This is because j&0x03 contains the number of 'valid' bytes
551 * already in p[i]. If and only if j&0x03 == 0, the UMR will
552 * occur but this is also the only time p_c2l will do
553 * l= *(cp++) instead of l|= *(cp++)
554 * Many thanks to Alex Tang <altitude@cic.net> for pickup this
557 if (j==0) p[i]=0; /* Yeah, but that's not the way to fix it:-) */
561 l = (j==0) ? 0 : p[i];
563 HOST_p_c2l(cp,l,j); p[i++]=l; /* i is the next 'undefined word' */
565 if (i>(HASH_LBLOCK-2)) /* save room for Nl and Nh */
567 if (i<HASH_LBLOCK) p[i]=0;
568 HASH_BLOCK_HOST_ORDER (c,p,1);
571 for (; i<(HASH_LBLOCK-2); i++)
574 #if defined(DATA_ORDER_IS_BIG_ENDIAN)
575 p[HASH_LBLOCK-2]=c->Nh;
576 p[HASH_LBLOCK-1]=c->Nl;
577 #elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
578 p[HASH_LBLOCK-2]=c->Nl;
579 p[HASH_LBLOCK-1]=c->Nh;
581 HASH_BLOCK_HOST_ORDER (c,p,1);
583 #ifndef HASH_MAKE_STRING
584 #error "HASH_MAKE_STRING must be defined!"
586 HASH_MAKE_STRING(c,md);
590 /* clear stuff, HASH_BLOCK may be leaving some stuff on the stack
591 * but I'm not worried :-)
592 OPENSSL_cleanse((void *)c,sizeof(HASH_CTX));
598 #define MD32_REG_T long
600 * This comment was originaly written for MD5, which is why it
601 * discusses A-D. But it basically applies to all 32-bit digests,
602 * which is why it was moved to common header file.
604 * In case you wonder why A-D are declared as long and not
605 * as MD5_LONG. Doing so results in slight performance
606 * boost on LP64 architectures. The catch is we don't
607 * really care if 32 MSBs of a 64-bit register get polluted
608 * with eventual overflows as we *save* only 32 LSBs in
609 * *either* case. Now declaring 'em long excuses the compiler
610 * from keeping 32 MSBs zeroed resulting in 13% performance
611 * improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
612 * Well, to be honest it should say that this *prevents*
613 * performance degradation.
614 * <appro@fy.chalmers.se>
615 * Apparently there're LP64 compilers that generate better
616 * code if A-D are declared int. Most notably GCC-x86_64
617 * generates better code.
618 * <appro@fy.chalmers.se>