| 1 |
/* crypto/md5/md5_locl.h */ |
| 2 |
/* Copyright (C) 1995-1998 Eric Young ([email protected]) |
| 3 |
* All rights reserved. |
| 4 |
* |
| 5 |
* This package is an SSL implementation written |
| 6 |
* by Eric Young ([email protected]). |
| 7 |
* The implementation was written so as to conform with Netscapes SSL. |
| 8 |
* |
| 9 |
* This library is free for commercial and non-commercial use as long as |
| 10 |
* the following conditions are aheared to. The following conditions |
| 11 |
* apply to all code found in this distribution, be it the RC4, RSA, |
| 12 |
* lhash, DES, etc., code; not just the SSL code. The SSL documentation |
| 13 |
* included with this distribution is covered by the same copyright terms |
| 14 |
* except that the holder is Tim Hudson ([email protected]). |
| 15 |
* |
| 16 |
* Copyright remains Eric Young's, and as such any Copyright notices in |
| 17 |
* the code are not to be removed. |
| 18 |
* If this package is used in a product, Eric Young should be given attribution |
| 19 |
* as the author of the parts of the library used. |
| 20 |
* This can be in the form of a textual message at program startup or |
| 21 |
* in documentation (online or textual) provided with the package. |
| 22 |
* |
| 23 |
* Redistribution and use in source and binary forms, with or without |
| 24 |
* modification, are permitted provided that the following conditions |
| 25 |
* are met: |
| 26 |
* 1. Redistributions of source code must retain the copyright |
| 27 |
* notice, this list of conditions and the following disclaimer. |
| 28 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 29 |
* notice, this list of conditions and the following disclaimer in the |
| 30 |
* documentation and/or other materials provided with the distribution. |
| 31 |
* 3. All advertising materials mentioning features or use of this software |
| 32 |
* must display the following acknowledgement: |
| 33 |
* "This product includes cryptographic software written by |
| 34 |
* Eric Young ([email protected])" |
| 35 |
* The word 'cryptographic' can be left out if the rouines from the library |
| 36 |
* being used are not cryptographic related :-). |
| 37 |
* 4. If you include any Windows specific code (or a derivative thereof) from |
| 38 |
* the apps directory (application code) you must include an acknowledgement: |
| 39 |
* "This product includes software written by Tim Hudson ([email protected])" |
| 40 |
* |
| 41 |
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
| 42 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 43 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 44 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 45 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 46 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 47 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 48 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 49 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 50 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 51 |
* SUCH DAMAGE. |
| 52 |
* |
| 53 |
* The licence and distribution terms for any publically available version or |
| 54 |
* derivative of this code cannot be changed. i.e. this code cannot simply be |
| 55 |
* copied and put under another distribution licence |
| 56 |
* [including the GNU Public Licence.] |
| 57 |
*/ |
| 58 |
|
| 59 |
#include <stdlib.h> |
| 60 |
#include <string.h> |
| 61 |
#include <openssl/e_os2.h> |
| 62 |
#include <openssl/md5.h> |
| 63 |
|
| 64 |
#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 |
# elif defined(__sparc) || defined(__sparc__) |
| 75 |
# define md5_block_data_order md5_block_asm_data_order |
| 76 |
# endif |
| 77 |
#endif |
| 78 |
|
| 79 |
void md5_block_data_order(MD5_CTX *c, const void *p, size_t num); |
| 80 |
|
| 81 |
#define DATA_ORDER_IS_LITTLE_ENDIAN |
| 82 |
|
| 83 |
#define HASH_LONG MD5_LONG |
| 84 |
#define HASH_CTX MD5_CTX |
| 85 |
#define HASH_CBLOCK MD5_CBLOCK |
| 86 |
#define HASH_UPDATE MD5_Update |
| 87 |
#define HASH_TRANSFORM MD5_Transform |
| 88 |
#define HASH_FINAL MD5_Final |
| 89 |
#define HASH_MAKE_STRING(c,s) do { \ |
| 90 |
unsigned long ll; \ |
| 91 |
ll=(c)->A; (void)HOST_l2c(ll,(s)); \ |
| 92 |
ll=(c)->B; (void)HOST_l2c(ll,(s)); \ |
| 93 |
ll=(c)->C; (void)HOST_l2c(ll,(s)); \ |
| 94 |
ll=(c)->D; (void)HOST_l2c(ll,(s)); \ |
| 95 |
} while (0) |
| 96 |
#define HASH_BLOCK_DATA_ORDER md5_block_data_order |
| 97 |
|
| 98 |
#include "md32_common.h" |
| 99 |
|
| 100 |
/*- |
| 101 |
#define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) |
| 102 |
#define G(x,y,z) (((x) & (z)) | ((y) & (~(z)))) |
| 103 |
*/ |
| 104 |
|
| 105 |
/* |
| 106 |
* As pointed out by Wei Dai <[email protected]>, the above can be simplified |
| 107 |
* to the code below. Wei attributes these optimizations to Peter Gutmann's |
| 108 |
* SHS code, and he attributes it to Rich Schroeppel. |
| 109 |
*/ |
| 110 |
#define F(b,c,d) ((((c) ^ (d)) & (b)) ^ (d)) |
| 111 |
#define G(b,c,d) ((((b) ^ (c)) & (d)) ^ (c)) |
| 112 |
#define H(b,c,d) ((b) ^ (c) ^ (d)) |
| 113 |
#define I(b,c,d) (((~(d)) | (b)) ^ (c)) |
| 114 |
|
| 115 |
#define R0(a,b,c,d,k,s,t) { \ |
| 116 |
a+=((k)+(t)+F((b),(c),(d))); \ |
| 117 |
a=ROTATE(a,s); \ |
| 118 |
a+=b; };\ |
| 119 |
|
| 120 |
#define R1(a,b,c,d,k,s,t) { \ |
| 121 |
a+=((k)+(t)+G((b),(c),(d))); \ |
| 122 |
a=ROTATE(a,s); \ |
| 123 |
a+=b; }; |
| 124 |
|
| 125 |
#define R2(a,b,c,d,k,s,t) { \ |
| 126 |
a+=((k)+(t)+H((b),(c),(d))); \ |
| 127 |
a=ROTATE(a,s); \ |
| 128 |
a+=b; }; |
| 129 |
|
| 130 |
#define R3(a,b,c,d,k,s,t) { \ |
| 131 |
a+=((k)+(t)+I((b),(c),(d))); \ |
| 132 |
a=ROTATE(a,s); \ |
| 133 |
a+=b; }; |