md5_locl.h revision 296341
1115170Speter/* crypto/md5/md5_locl.h */ 299127Sobrien/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 399127Sobrien * All rights reserved. 499127Sobrien * 599127Sobrien * This package is an SSL implementation written 699127Sobrien * by Eric Young (eay@cryptsoft.com). 799127Sobrien * The implementation was written so as to conform with Netscapes SSL. 899127Sobrien * 999127Sobrien * This library is free for commercial and non-commercial use as long as 1099127Sobrien * the following conditions are aheared to. The following conditions 1199127Sobrien * apply to all code found in this distribution, be it the RC4, RSA, 12115170Speter * lhash, DES, etc., code; not just the SSL code. The SSL documentation 1399127Sobrien * included with this distribution is covered by the same copyright terms 1499127Sobrien * except that the holder is Tim Hudson (tjh@cryptsoft.com). 1599127Sobrien * 16115170Speter * Copyright remains Eric Young's, and as such any Copyright notices in 1799127Sobrien * the code are not to be removed. 1899127Sobrien * If this package is used in a product, Eric Young should be given attribution 1999127Sobrien * as the author of the parts of the library used. 2099127Sobrien * This can be in the form of a textual message at program startup or 21169612Swkoszek * in documentation (online or textual) provided with the package. 2299127Sobrien * 2399127Sobrien * Redistribution and use in source and binary forms, with or without 2499127Sobrien * modification, are permitted provided that the following conditions 2599127Sobrien * are met: 2699127Sobrien * 1. Redistributions of source code must retain the copyright 2799127Sobrien * notice, this list of conditions and the following disclaimer. 2899127Sobrien * 2. Redistributions in binary form must reproduce the above copyright 2999127Sobrien * notice, this list of conditions and the following disclaimer in the 3099127Sobrien * documentation and/or other materials provided with the distribution. 3199127Sobrien * 3. All advertising materials mentioning features or use of this software 3299127Sobrien * must display the following acknowledgement: 3399127Sobrien * "This product includes cryptographic software written by 34120589Speter * Eric Young (eay@cryptsoft.com)" 35179225Sjb * The word 'cryptographic' can be left out if the rouines from the library 36174395Sjkoshy * being used are not cryptographic related :-). 37179225Sjb * 4. If you include any Windows specific code (or a derivative thereof) from 38254041Savg * the apps directory (application code) you must include an acknowledgement: 39115405Speter * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 40115405Speter * 41114370Speter * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 4299127Sobrien * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 43218893Sdim * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 44232930Sdim * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 45232930Sdim * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 46232930Sdim * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 47232930Sdim * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 48232930Sdim * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 49218893Sdim * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 5099127Sobrien * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 5199127Sobrien * SUCH DAMAGE. 5299127Sobrien * 5399127Sobrien * The licence and distribution terms for any publically available version or 5499127Sobrien * derivative of this code cannot be changed. i.e. this code cannot simply be 5599127Sobrien * copied and put under another distribution licence 5699127Sobrien * [including the GNU Public Licence.] 5799127Sobrien */ 5899127Sobrien 5999127Sobrien#include <stdlib.h> 6099127Sobrien#include <string.h> 6199127Sobrien#include <openssl/e_os2.h> 6299127Sobrien#include <openssl/md5.h> 6399127Sobrien 6499127Sobrien#ifndef MD5_LONG_LOG2 65# define MD5_LONG_LOG2 2 /* default to 32 bits */ 66#endif 67 68#ifdef MD5_ASM 69# if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__) || \ 70 defined(__x86_64) || defined(__x86_64__) || defined(_M_AMD64) || defined(_M_X64) 71# define md5_block_data_order md5_block_asm_data_order 72# elif defined(__ia64) || defined(__ia64__) || defined(_M_IA64) 73# define md5_block_data_order md5_block_asm_data_order 74# endif 75#endif 76 77void md5_block_data_order(MD5_CTX *c, const void *p, size_t num); 78 79#define DATA_ORDER_IS_LITTLE_ENDIAN 80 81#define HASH_LONG MD5_LONG 82#define HASH_CTX MD5_CTX 83#define HASH_CBLOCK MD5_CBLOCK 84#define HASH_UPDATE MD5_Update 85#define HASH_TRANSFORM MD5_Transform 86#define HASH_FINAL MD5_Final 87#define HASH_MAKE_STRING(c,s) do { \ 88 unsigned long ll; \ 89 ll=(c)->A; (void)HOST_l2c(ll,(s)); \ 90 ll=(c)->B; (void)HOST_l2c(ll,(s)); \ 91 ll=(c)->C; (void)HOST_l2c(ll,(s)); \ 92 ll=(c)->D; (void)HOST_l2c(ll,(s)); \ 93 } while (0) 94#define HASH_BLOCK_DATA_ORDER md5_block_data_order 95 96#include "md32_common.h" 97 98/*- 99#define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) 100#define G(x,y,z) (((x) & (z)) | ((y) & (~(z)))) 101*/ 102 103/* 104 * As pointed out by Wei Dai <weidai@eskimo.com>, the above can be simplified 105 * to the code below. Wei attributes these optimizations to Peter Gutmann's 106 * SHS code, and he attributes it to Rich Schroeppel. 107 */ 108#define F(b,c,d) ((((c) ^ (d)) & (b)) ^ (d)) 109#define G(b,c,d) ((((b) ^ (c)) & (d)) ^ (c)) 110#define H(b,c,d) ((b) ^ (c) ^ (d)) 111#define I(b,c,d) (((~(d)) | (b)) ^ (c)) 112 113#define R0(a,b,c,d,k,s,t) { \ 114 a+=((k)+(t)+F((b),(c),(d))); \ 115 a=ROTATE(a,s); \ 116 a+=b; };\ 117 118#define R1(a,b,c,d,k,s,t) { \ 119 a+=((k)+(t)+G((b),(c),(d))); \ 120 a=ROTATE(a,s); \ 121 a+=b; }; 122 123#define R2(a,b,c,d,k,s,t) { \ 124 a+=((k)+(t)+H((b),(c),(d))); \ 125 a=ROTATE(a,s); \ 126 a+=b; }; 127 128#define R3(a,b,c,d,k,s,t) { \ 129 a+=((k)+(t)+I((b),(c),(d))); \ 130 a=ROTATE(a,s); \ 131 a+=b; }; 132