xref: /onnv-gate/usr/src/common/openssl/crypto/md5/md5_locl.h (revision 2139:6243c3338933)
10Sstevel@tonic-gate /* crypto/md5/md5_locl.h */
20Sstevel@tonic-gate /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
30Sstevel@tonic-gate  * All rights reserved.
40Sstevel@tonic-gate  *
50Sstevel@tonic-gate  * This package is an SSL implementation written
60Sstevel@tonic-gate  * by Eric Young (eay@cryptsoft.com).
70Sstevel@tonic-gate  * The implementation was written so as to conform with Netscapes SSL.
80Sstevel@tonic-gate  *
90Sstevel@tonic-gate  * This library is free for commercial and non-commercial use as long as
100Sstevel@tonic-gate  * the following conditions are aheared to.  The following conditions
110Sstevel@tonic-gate  * apply to all code found in this distribution, be it the RC4, RSA,
120Sstevel@tonic-gate  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
130Sstevel@tonic-gate  * included with this distribution is covered by the same copyright terms
140Sstevel@tonic-gate  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
150Sstevel@tonic-gate  *
160Sstevel@tonic-gate  * Copyright remains Eric Young's, and as such any Copyright notices in
170Sstevel@tonic-gate  * the code are not to be removed.
180Sstevel@tonic-gate  * If this package is used in a product, Eric Young should be given attribution
190Sstevel@tonic-gate  * as the author of the parts of the library used.
200Sstevel@tonic-gate  * This can be in the form of a textual message at program startup or
210Sstevel@tonic-gate  * in documentation (online or textual) provided with the package.
220Sstevel@tonic-gate  *
230Sstevel@tonic-gate  * Redistribution and use in source and binary forms, with or without
240Sstevel@tonic-gate  * modification, are permitted provided that the following conditions
250Sstevel@tonic-gate  * are met:
260Sstevel@tonic-gate  * 1. Redistributions of source code must retain the copyright
270Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer.
280Sstevel@tonic-gate  * 2. Redistributions in binary form must reproduce the above copyright
290Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer in the
300Sstevel@tonic-gate  *    documentation and/or other materials provided with the distribution.
310Sstevel@tonic-gate  * 3. All advertising materials mentioning features or use of this software
320Sstevel@tonic-gate  *    must display the following acknowledgement:
330Sstevel@tonic-gate  *    "This product includes cryptographic software written by
340Sstevel@tonic-gate  *     Eric Young (eay@cryptsoft.com)"
350Sstevel@tonic-gate  *    The word 'cryptographic' can be left out if the rouines from the library
360Sstevel@tonic-gate  *    being used are not cryptographic related :-).
370Sstevel@tonic-gate  * 4. If you include any Windows specific code (or a derivative thereof) from
380Sstevel@tonic-gate  *    the apps directory (application code) you must include an acknowledgement:
390Sstevel@tonic-gate  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
400Sstevel@tonic-gate  *
410Sstevel@tonic-gate  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
420Sstevel@tonic-gate  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
430Sstevel@tonic-gate  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
440Sstevel@tonic-gate  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
450Sstevel@tonic-gate  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
460Sstevel@tonic-gate  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
470Sstevel@tonic-gate  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
480Sstevel@tonic-gate  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
490Sstevel@tonic-gate  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
500Sstevel@tonic-gate  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
510Sstevel@tonic-gate  * SUCH DAMAGE.
520Sstevel@tonic-gate  *
530Sstevel@tonic-gate  * The licence and distribution terms for any publically available version or
540Sstevel@tonic-gate  * derivative of this code cannot be changed.  i.e. this code cannot simply be
550Sstevel@tonic-gate  * copied and put under another distribution licence
560Sstevel@tonic-gate  * [including the GNU Public Licence.]
570Sstevel@tonic-gate  */
580Sstevel@tonic-gate 
590Sstevel@tonic-gate #include <stdlib.h>
600Sstevel@tonic-gate #include <string.h>
610Sstevel@tonic-gate #include <openssl/e_os2.h>
620Sstevel@tonic-gate #include <openssl/md5.h>
630Sstevel@tonic-gate 
640Sstevel@tonic-gate #ifndef MD5_LONG_LOG2
650Sstevel@tonic-gate #define MD5_LONG_LOG2 2 /* default to 32 bits */
660Sstevel@tonic-gate #endif
670Sstevel@tonic-gate 
680Sstevel@tonic-gate #ifdef MD5_ASM
69*2139Sjp161948 # if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__) || defined(__x86_64) || defined(__x86_64__)
70*2139Sjp161948 #  if !defined(B_ENDIAN)
71*2139Sjp161948 #   define md5_block_host_order md5_block_asm_host_order
72*2139Sjp161948 #  endif
730Sstevel@tonic-gate # elif defined(__sparc) && defined(OPENSSL_SYS_ULTRASPARC)
74*2139Sjp161948    void md5_block_asm_data_order_aligned (MD5_CTX *c, const MD5_LONG *p,size_t num);
750Sstevel@tonic-gate #  define HASH_BLOCK_DATA_ORDER_ALIGNED md5_block_asm_data_order_aligned
760Sstevel@tonic-gate # endif
770Sstevel@tonic-gate #endif
780Sstevel@tonic-gate 
79*2139Sjp161948 void md5_block_host_order (MD5_CTX *c, const void *p,size_t num);
80*2139Sjp161948 void md5_block_data_order (MD5_CTX *c, const void *p,size_t num);
810Sstevel@tonic-gate 
82*2139Sjp161948 #if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__) || defined(__x86_64) || defined(__x86_64__)
83*2139Sjp161948 # if !defined(B_ENDIAN)
840Sstevel@tonic-gate /*
850Sstevel@tonic-gate  * *_block_host_order is expected to handle aligned data while
860Sstevel@tonic-gate  * *_block_data_order - unaligned. As algorithm and host (x86)
870Sstevel@tonic-gate  * are in this case of the same "endianness" these two are
880Sstevel@tonic-gate  * otherwise indistinguishable. But normally you don't want to
890Sstevel@tonic-gate  * call the same function because unaligned access in places
900Sstevel@tonic-gate  * where alignment is expected is usually a "Bad Thing". Indeed,
910Sstevel@tonic-gate  * on RISCs you get punished with BUS ERROR signal or *severe*
920Sstevel@tonic-gate  * performance degradation. Intel CPUs are in turn perfectly
930Sstevel@tonic-gate  * capable of loading unaligned data without such drastic side
940Sstevel@tonic-gate  * effect. Yes, they say it's slower than aligned load, but no
950Sstevel@tonic-gate  * exception is generated and therefore performance degradation
960Sstevel@tonic-gate  * is *incomparable* with RISCs. What we should weight here is
970Sstevel@tonic-gate  * costs of unaligned access against costs of aligning data.
980Sstevel@tonic-gate  * According to my measurements allowing unaligned access results
990Sstevel@tonic-gate  * in ~9% performance improvement on Pentium II operating at
1000Sstevel@tonic-gate  * 266MHz. I won't be surprised if the difference will be higher
1010Sstevel@tonic-gate  * on faster systems:-)
1020Sstevel@tonic-gate  *
1030Sstevel@tonic-gate  *				<appro@fy.chalmers.se>
1040Sstevel@tonic-gate  */
105*2139Sjp161948 # define md5_block_data_order md5_block_host_order
106*2139Sjp161948 # endif
1070Sstevel@tonic-gate #endif
1080Sstevel@tonic-gate 
1090Sstevel@tonic-gate #define DATA_ORDER_IS_LITTLE_ENDIAN
1100Sstevel@tonic-gate 
1110Sstevel@tonic-gate #define HASH_LONG		MD5_LONG
1120Sstevel@tonic-gate #define HASH_LONG_LOG2		MD5_LONG_LOG2
1130Sstevel@tonic-gate #define HASH_CTX		MD5_CTX
1140Sstevel@tonic-gate #define HASH_CBLOCK		MD5_CBLOCK
1150Sstevel@tonic-gate #define HASH_LBLOCK		MD5_LBLOCK
1160Sstevel@tonic-gate #define HASH_UPDATE		MD5_Update
1170Sstevel@tonic-gate #define HASH_TRANSFORM		MD5_Transform
1180Sstevel@tonic-gate #define HASH_FINAL		MD5_Final
1190Sstevel@tonic-gate #define	HASH_MAKE_STRING(c,s)	do {	\
1200Sstevel@tonic-gate 	unsigned long ll;		\
1210Sstevel@tonic-gate 	ll=(c)->A; HOST_l2c(ll,(s));	\
1220Sstevel@tonic-gate 	ll=(c)->B; HOST_l2c(ll,(s));	\
1230Sstevel@tonic-gate 	ll=(c)->C; HOST_l2c(ll,(s));	\
1240Sstevel@tonic-gate 	ll=(c)->D; HOST_l2c(ll,(s));	\
1250Sstevel@tonic-gate 	} while (0)
1260Sstevel@tonic-gate #define HASH_BLOCK_HOST_ORDER	md5_block_host_order
1270Sstevel@tonic-gate #if !defined(L_ENDIAN) || defined(md5_block_data_order)
1280Sstevel@tonic-gate #define	HASH_BLOCK_DATA_ORDER	md5_block_data_order
1290Sstevel@tonic-gate /*
1300Sstevel@tonic-gate  * Little-endians (Intel and Alpha) feel better without this.
1310Sstevel@tonic-gate  * It looks like memcpy does better job than generic
1320Sstevel@tonic-gate  * md5_block_data_order on copying-n-aligning input data.
1330Sstevel@tonic-gate  * But frankly speaking I didn't expect such result on Alpha.
1340Sstevel@tonic-gate  * On the other hand I've got this with egcs-1.0.2 and if
1350Sstevel@tonic-gate  * program is compiled with another (better?) compiler it
1360Sstevel@tonic-gate  * might turn out other way around.
1370Sstevel@tonic-gate  *
1380Sstevel@tonic-gate  *				<appro@fy.chalmers.se>
1390Sstevel@tonic-gate  */
1400Sstevel@tonic-gate #endif
1410Sstevel@tonic-gate 
1420Sstevel@tonic-gate #include "md32_common.h"
1430Sstevel@tonic-gate 
1440Sstevel@tonic-gate /*
1450Sstevel@tonic-gate #define	F(x,y,z)	(((x) & (y))  |  ((~(x)) & (z)))
1460Sstevel@tonic-gate #define	G(x,y,z)	(((x) & (z))  |  ((y) & (~(z))))
1470Sstevel@tonic-gate */
1480Sstevel@tonic-gate 
1490Sstevel@tonic-gate /* As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
1500Sstevel@tonic-gate  * simplified to the code below.  Wei attributes these optimizations
1510Sstevel@tonic-gate  * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
1520Sstevel@tonic-gate  */
1530Sstevel@tonic-gate #define	F(b,c,d)	((((c) ^ (d)) & (b)) ^ (d))
1540Sstevel@tonic-gate #define	G(b,c,d)	((((b) ^ (c)) & (d)) ^ (c))
1550Sstevel@tonic-gate #define	H(b,c,d)	((b) ^ (c) ^ (d))
1560Sstevel@tonic-gate #define	I(b,c,d)	(((~(d)) | (b)) ^ (c))
1570Sstevel@tonic-gate 
1580Sstevel@tonic-gate #define R0(a,b,c,d,k,s,t) { \
1590Sstevel@tonic-gate 	a+=((k)+(t)+F((b),(c),(d))); \
1600Sstevel@tonic-gate 	a=ROTATE(a,s); \
1610Sstevel@tonic-gate 	a+=b; };\
1620Sstevel@tonic-gate 
1630Sstevel@tonic-gate #define R1(a,b,c,d,k,s,t) { \
1640Sstevel@tonic-gate 	a+=((k)+(t)+G((b),(c),(d))); \
1650Sstevel@tonic-gate 	a=ROTATE(a,s); \
1660Sstevel@tonic-gate 	a+=b; };
1670Sstevel@tonic-gate 
1680Sstevel@tonic-gate #define R2(a,b,c,d,k,s,t) { \
1690Sstevel@tonic-gate 	a+=((k)+(t)+H((b),(c),(d))); \
1700Sstevel@tonic-gate 	a=ROTATE(a,s); \
1710Sstevel@tonic-gate 	a+=b; };
1720Sstevel@tonic-gate 
1730Sstevel@tonic-gate #define R3(a,b,c,d,k,s,t) { \
1740Sstevel@tonic-gate 	a+=((k)+(t)+I((b),(c),(d))); \
1750Sstevel@tonic-gate 	a=ROTATE(a,s); \
1760Sstevel@tonic-gate 	a+=b; };
177