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 #include <openssl/fips.h>
132 #include <openssl/err.h>
133 #include "../fips/fips_locl.h"
135 #if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)
136 #error "DATA_ORDER must be defined!"
140 #error "HASH_CBLOCK must be defined!"
143 #error "HASH_LONG must be defined!"
146 #error "HASH_CTX must be defined!"
150 #error "HASH_UPDATE must be defined!"
152 #ifndef HASH_TRANSFORM
153 #error "HASH_TRANSFORM must be defined!"
156 #error "HASH_FINAL must be defined!"
159 #ifndef HASH_BLOCK_HOST_ORDER
160 #error "HASH_BLOCK_HOST_ORDER must be defined!"
165 * Moved below as it's required only if HASH_BLOCK_DATA_ORDER_ALIGNED
168 #ifndef HASH_BLOCK_DATA_ORDER
169 #error "HASH_BLOCK_DATA_ORDER must be defined!"
174 #define HASH_LBLOCK (HASH_CBLOCK/4)
177 #ifndef HASH_LONG_LOG2
178 #define HASH_LONG_LOG2 2
182 * Engage compiler specific rotate intrinsic function if available.
186 # if 0 /* defined(_MSC_VER) */
187 # define ROTATE(a,n) _lrotl(a,n)
188 # elif defined(__MWERKS__)
189 # if defined(__POWERPC__)
190 # define ROTATE(a,n) __rlwinm(a,n,0,31)
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) )
195 # define ROTATE(a,n) __rol(a,n)
197 # elif defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
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...
203 * <appro@fy.chalmers.se>
205 # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
206 # define ROTATE(a,n) ({ register unsigned int ret; \
214 # elif defined(__powerpc) || defined(__ppc)
215 # define ROTATE(a,n) ({ register unsigned int ret; \
217 "rlwinm %0,%1,%2,0,31" \
226 * Engage compiler specific "fetch in reverse byte order"
227 * intrinsic function if available.
229 # if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
230 /* some GNU C inline assembler templates by <appro@fy.chalmers.se> */
231 # if (defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)) && !defined(I386_ONLY)
232 # define BE_FETCH32(a) ({ register unsigned int l=(a);\
235 : "=r"(l) : "0"(l)); \
238 # elif defined(__powerpc)
239 # define LE_FETCH32(a) ({ register unsigned int l; \
247 # elif defined(__sparc) && defined(OPENSSL_SYS_ULTRASPARC)
248 # define LE_FETCH32(a) ({ register unsigned int l; \
250 "lda [%1]#ASI_PRIMARY_LITTLE,%0"\
257 #endif /* PEDANTIC */
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> */
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))) \
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)), \
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...
286 * <appro@fy.chalmers.se>
292 #define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
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...
301 * <appro@fy.chalmers.se>
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
308 # elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
309 # ifndef HOST_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)
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
322 # elif defined(DATA_ORDER_IS_BIG_ENDIAN)
323 # ifndef HOST_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)
333 #if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
334 #ifndef HASH_BLOCK_DATA_ORDER
335 #error "HASH_BLOCK_DATA_ORDER must be defined!"
339 #if defined(DATA_ORDER_IS_BIG_ENDIAN)
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)++))) ), \
346 #define HOST_p_c2l(c,l,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)++))); \
353 #define HOST_p_c2l_p(c,l,sc,len) { \
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; \
361 /* NOTE the pointer is not incremented at the end of this */
362 #define HOST_c2l_p(c,l,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; \
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), \
375 #elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
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), \
382 #define HOST_p_c2l(c,l,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; \
389 #define HOST_p_c2l_p(c,l,sc,len) { \
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; \
397 /* NOTE the pointer is not incremented at the end of this */
398 #define HOST_c2l_p(c,l,n) { \
401 case 3: l =((unsigned long)(*(--(c))))<<16; \
402 case 2: l|=((unsigned long)(*(--(c))))<< 8; \
403 case 1: l|=((unsigned long)(*(--(c)))); \
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), \
414 * Time for some action:-)
417 int HASH_UPDATE (HASH_CTX *c, const void *data_, unsigned long len)
419 const unsigned char *data=data_;
420 register HASH_LONG * p;
421 register unsigned long l;
424 if (len==0) return 1;
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 */
440 if ((c->num+len) >= HASH_CBLOCK)
442 l=p[sw]; HOST_p_c2l(data,l,sc); p[sw++]=l;
443 for (; sw<HASH_LBLOCK; sw++)
445 HOST_c2l(data,l); p[sw]=l;
447 HASH_BLOCK_HOST_ORDER (c,p,1);
448 len-=(HASH_CBLOCK-c->num);
450 /* drop through and do the rest */
455 if ((sc+len) < 4) /* ugly, add char's to a word */
457 l=p[sw]; HOST_p_c2l_p(data,l,sc,len); p[sw]=l;
465 HOST_p_c2l(data,l,sc);
467 for (; sw < ew; sw++)
469 HOST_c2l(data,l); p[sw]=l;
473 HOST_c2l_p(data,l,ec); p[sw]=l;
483 #if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
485 * Note that HASH_BLOCK_DATA_ORDER_ALIGNED gets defined
486 * only if sizeof(HASH_LONG)==4.
488 if ((((unsigned long)data)%4) == 0)
490 /* data is properly aligned so that we can cast it: */
491 HASH_BLOCK_DATA_ORDER_ALIGNED (c,(HASH_LONG *)data,sw);
497 #if !defined(HASH_BLOCK_DATA_ORDER)
500 memcpy (p=c->data,data,HASH_CBLOCK);
501 HASH_BLOCK_DATA_ORDER_ALIGNED(c,p,1);
507 #if defined(HASH_BLOCK_DATA_ORDER)
509 HASH_BLOCK_DATA_ORDER(c,data,sw);
521 ew=len>>2; /* words to copy */
525 HOST_c2l(data,l); *p=l;
527 HOST_c2l_p(data,l,ec);
534 void HASH_TRANSFORM (HASH_CTX *c, const unsigned char *data)
536 #if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
537 if ((((unsigned long)data)%4) == 0)
538 /* data is properly aligned so that we can cast it: */
539 HASH_BLOCK_DATA_ORDER_ALIGNED (c,(HASH_LONG *)data,1);
541 #if !defined(HASH_BLOCK_DATA_ORDER)
543 memcpy (c->data,data,HASH_CBLOCK);
544 HASH_BLOCK_DATA_ORDER_ALIGNED (c,c->data,1);
548 #if defined(HASH_BLOCK_DATA_ORDER)
549 HASH_BLOCK_DATA_ORDER (c,data,1);
554 int HASH_FINAL (unsigned char *md, HASH_CTX *c)
556 register HASH_LONG *p;
557 register unsigned long l;
559 static const unsigned char end[4]={0x80,0x00,0x00,0x00};
560 const unsigned char *cp=end;
563 if(FIPS_mode && !FIPS_md5_allowed)
565 FIPSerr(FIPS_F_HASH_FINAL,FIPS_R_NON_FIPS_METHOD);
570 /* c->num should definitly have room for at least one more byte. */
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
586 if (j==0) p[i]=0; /* Yeah, but that's not the way to fix it:-) */
590 l = (j==0) ? 0 : p[i];
592 HOST_p_c2l(cp,l,j); p[i++]=l; /* i is the next 'undefined word' */
594 if (i>(HASH_LBLOCK-2)) /* save room for Nl and Nh */
596 if (i<HASH_LBLOCK) p[i]=0;
597 HASH_BLOCK_HOST_ORDER (c,p,1);
600 for (; i<(HASH_LBLOCK-2); i++)
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;
610 HASH_BLOCK_HOST_ORDER (c,p,1);
612 #ifndef HASH_MAKE_STRING
613 #error "HASH_MAKE_STRING must be defined!"
615 HASH_MAKE_STRING(c,md);
619 /* clear stuff, HASH_BLOCK may be leaving some stuff on the stack
620 * but I'm not worried :-)
621 OPENSSL_cleanse((void *)c,sizeof(HASH_CTX));
627 #define MD32_REG_T long
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.
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>