sl@0: /* crypto/md5/md5_locl.h */ sl@0: /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) sl@0: * All rights reserved. sl@0: * sl@0: * This package is an SSL implementation written sl@0: * by Eric Young (eay@cryptsoft.com). sl@0: * The implementation was written so as to conform with Netscapes SSL. sl@0: * sl@0: * This library is free for commercial and non-commercial use as long as sl@0: * the following conditions are aheared to. The following conditions sl@0: * apply to all code found in this distribution, be it the RC4, RSA, sl@0: * lhash, DES, etc., code; not just the SSL code. The SSL documentation sl@0: * included with this distribution is covered by the same copyright terms sl@0: * except that the holder is Tim Hudson (tjh@cryptsoft.com). sl@0: * sl@0: * Copyright remains Eric Young's, and as such any Copyright notices in sl@0: * the code are not to be removed. sl@0: * If this package is used in a product, Eric Young should be given attribution sl@0: * as the author of the parts of the library used. sl@0: * This can be in the form of a textual message at program startup or sl@0: * in documentation (online or textual) provided with the package. sl@0: * sl@0: * Redistribution and use in source and binary forms, with or without sl@0: * modification, are permitted provided that the following conditions sl@0: * are met: sl@0: * 1. Redistributions of source code must retain the copyright sl@0: * notice, this list of conditions and the following disclaimer. sl@0: * 2. Redistributions in binary form must reproduce the above copyright sl@0: * notice, this list of conditions and the following disclaimer in the sl@0: * documentation and/or other materials provided with the distribution. sl@0: * 3. All advertising materials mentioning features or use of this software sl@0: * must display the following acknowledgement: sl@0: * "This product includes cryptographic software written by sl@0: * Eric Young (eay@cryptsoft.com)" sl@0: * The word 'cryptographic' can be left out if the rouines from the library sl@0: * being used are not cryptographic related :-). sl@0: * 4. If you include any Windows specific code (or a derivative thereof) from sl@0: * the apps directory (application code) you must include an acknowledgement: sl@0: * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" sl@0: * sl@0: * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND sl@0: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE sl@0: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE sl@0: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE sl@0: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL sl@0: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS sl@0: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) sl@0: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT sl@0: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY sl@0: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF sl@0: * SUCH DAMAGE. sl@0: * sl@0: * The licence and distribution terms for any publically available version or sl@0: * derivative of this code cannot be changed. i.e. this code cannot simply be sl@0: * copied and put under another distribution licence sl@0: * [including the GNU Public Licence.] sl@0: */ sl@0: sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: sl@0: #ifndef MD5_LONG_LOG2 sl@0: #define MD5_LONG_LOG2 2 /* default to 32 bits */ sl@0: #endif sl@0: sl@0: #ifdef MD5_ASM sl@0: # if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__) || defined(__x86_64) || defined(__x86_64__) sl@0: # if !defined(B_ENDIAN) sl@0: # define md5_block_host_order md5_block_asm_host_order sl@0: # endif sl@0: # elif defined(__sparc) && defined(OPENSSL_SYS_ULTRASPARC) sl@0: void md5_block_asm_data_order_aligned (MD5_CTX *c, const MD5_LONG *p,size_t num); sl@0: # define HASH_BLOCK_DATA_ORDER_ALIGNED md5_block_asm_data_order_aligned sl@0: # endif sl@0: #endif sl@0: sl@0: void md5_block_host_order (MD5_CTX *c, const void *p,size_t num); sl@0: void md5_block_data_order (MD5_CTX *c, const void *p,size_t num); sl@0: sl@0: #if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__) || defined(__x86_64) || defined(__x86_64__) sl@0: # if !defined(B_ENDIAN) sl@0: /* sl@0: * *_block_host_order is expected to handle aligned data while sl@0: * *_block_data_order - unaligned. As algorithm and host (x86) sl@0: * are in this case of the same "endianness" these two are sl@0: * otherwise indistinguishable. But normally you don't want to sl@0: * call the same function because unaligned access in places sl@0: * where alignment is expected is usually a "Bad Thing". Indeed, sl@0: * on RISCs you get punished with BUS ERROR signal or *severe* sl@0: * performance degradation. Intel CPUs are in turn perfectly sl@0: * capable of loading unaligned data without such drastic side sl@0: * effect. Yes, they say it's slower than aligned load, but no sl@0: * exception is generated and therefore performance degradation sl@0: * is *incomparable* with RISCs. What we should weight here is sl@0: * costs of unaligned access against costs of aligning data. sl@0: * According to my measurements allowing unaligned access results sl@0: * in ~9% performance improvement on Pentium II operating at sl@0: * 266MHz. I won't be surprised if the difference will be higher sl@0: * on faster systems:-) sl@0: * sl@0: * sl@0: */ sl@0: # define md5_block_data_order md5_block_host_order sl@0: # endif sl@0: #endif sl@0: sl@0: #define DATA_ORDER_IS_LITTLE_ENDIAN sl@0: sl@0: #define HASH_LONG MD5_LONG sl@0: #define HASH_LONG_LOG2 MD5_LONG_LOG2 sl@0: #define HASH_CTX MD5_CTX sl@0: #define HASH_CBLOCK MD5_CBLOCK sl@0: #define HASH_LBLOCK MD5_LBLOCK sl@0: #define HASH_UPDATE MD5_Update sl@0: #define HASH_TRANSFORM MD5_Transform sl@0: #define HASH_FINAL MD5_Final sl@0: #define HASH_MAKE_STRING(c,s) do { \ sl@0: unsigned long ll; \ sl@0: ll=(c)->A; HOST_l2c(ll,(s)); \ sl@0: ll=(c)->B; HOST_l2c(ll,(s)); \ sl@0: ll=(c)->C; HOST_l2c(ll,(s)); \ sl@0: ll=(c)->D; HOST_l2c(ll,(s)); \ sl@0: } while (0) sl@0: #define HASH_BLOCK_HOST_ORDER md5_block_host_order sl@0: #if !defined(L_ENDIAN) || defined(md5_block_data_order) sl@0: #define HASH_BLOCK_DATA_ORDER md5_block_data_order sl@0: /* sl@0: * Little-endians (Intel and Alpha) feel better without this. sl@0: * It looks like memcpy does better job than generic sl@0: * md5_block_data_order on copying-n-aligning input data. sl@0: * But frankly speaking I didn't expect such result on Alpha. sl@0: * On the other hand I've got this with egcs-1.0.2 and if sl@0: * program is compiled with another (better?) compiler it sl@0: * might turn out other way around. sl@0: * sl@0: * sl@0: */ sl@0: #endif sl@0: sl@0: #include "md32_common.h" sl@0: sl@0: /* sl@0: #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) sl@0: #define G(x,y,z) (((x) & (z)) | ((y) & (~(z)))) sl@0: */ sl@0: sl@0: /* As pointed out by Wei Dai , the above can be sl@0: * simplified to the code below. Wei attributes these optimizations sl@0: * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. sl@0: */ sl@0: #define F(b,c,d) ((((c) ^ (d)) & (b)) ^ (d)) sl@0: #define G(b,c,d) ((((b) ^ (c)) & (d)) ^ (c)) sl@0: #define H(b,c,d) ((b) ^ (c) ^ (d)) sl@0: #define I(b,c,d) (((~(d)) | (b)) ^ (c)) sl@0: sl@0: #define R0(a,b,c,d,k,s,t) { \ sl@0: a+=((k)+(t)+F((b),(c),(d))); \ sl@0: a=ROTATE(a,s); \ sl@0: a+=b; };\ sl@0: sl@0: #define R1(a,b,c,d,k,s,t) { \ sl@0: a+=((k)+(t)+G((b),(c),(d))); \ sl@0: a=ROTATE(a,s); \ sl@0: a+=b; }; sl@0: sl@0: #define R2(a,b,c,d,k,s,t) { \ sl@0: a+=((k)+(t)+H((b),(c),(d))); \ sl@0: a=ROTATE(a,s); \ sl@0: a+=b; }; sl@0: sl@0: #define R3(a,b,c,d,k,s,t) { \ sl@0: a+=((k)+(t)+I((b),(c),(d))); \ sl@0: a=ROTATE(a,s); \ sl@0: a+=b; };