rdesktop/crypto/md5_locl.h

/* crypto/md5/md5_locl.h */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 * 
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 * 
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from 
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 * 
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * 
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#include <stdlib.h>
#include <string.h>
#include "md5.h"

#ifndef MD5_LONG_LOG2
#define MD5_LONG_LOG2 2 /* default to 32 bits */
#endif

#ifdef MD5_ASM
# if defined(__i386) || defined(_M_IX86) || defined(__INTEL__)
#  define md5_block_host_order md5_block_asm_host_order
# elif defined(__sparc) && defined(ULTRASPARC)
   void md5_block_asm_data_order_aligned (MD5_CTX *c, const MD5_LONG *p,int num);
#  define HASH_BLOCK_DATA_ORDER_ALIGNED md5_block_asm_data_order_aligned
# endif
#endif

void md5_block_host_order (MD5_CTX *c, const void *p,int num);
void md5_block_data_order (MD5_CTX *c, const void *p,int num);

#if defined(__i386) || defined(_M_IX86) || defined(__INTEL__)
/*
 * *_block_host_order is expected to handle aligned data while
 * *_block_data_order - unaligned. As algorithm and host (x86)
 * are in this case of the same "endianness" these two are
 * otherwise indistinguishable. But normally you don't want to
 * call the same function because unaligned access in places
 * where alignment is expected is usually a "Bad Thing". Indeed,
 * on RISCs you get punished with BUS ERROR signal or *severe*
 * performance degradation. Intel CPUs are in turn perfectly
 * capable of loading unaligned data without such drastic side
 * effect. Yes, they say it's slower than aligned load, but no
 * exception is generated and therefore performance degradation
 * is *incomparable* with RISCs. What we should weight here is
 * costs of unaligned access against costs of aligning data.
 * According to my measurements allowing unaligned access results
 * in ~9% performance improvement on Pentium II operating at
 * 266MHz. I won't be surprised if the difference will be higher
 * on faster systems:-)
 *
 *                              <appro@fy.chalmers.se>
 */
#define md5_block_data_order md5_block_host_order
#endif

#define DATA_ORDER_IS_LITTLE_ENDIAN

#define HASH_LONG               MD5_LONG
#define HASH_LONG_LOG2          MD5_LONG_LOG2
#define HASH_CTX                MD5_CTX
#define HASH_CBLOCK             MD5_CBLOCK
#define HASH_LBLOCK             MD5_LBLOCK
#define HASH_UPDATE             MD5_Update
#define HASH_TRANSFORM          MD5_Transform
#define HASH_FINAL              MD5_Final
#define HASH_MAKE_STRING(c,s)   do {    \
        unsigned long ll;               \
        ll=(c)->A; HOST_l2c(ll,(s));    \
        ll=(c)->B; HOST_l2c(ll,(s));    \
        ll=(c)->C; HOST_l2c(ll,(s));    \
        ll=(c)->D; HOST_l2c(ll,(s));    \
        } while (0)
#define HASH_BLOCK_HOST_ORDER   md5_block_host_order
#if !defined(L_ENDIAN) || defined(md5_block_data_order)
#define HASH_BLOCK_DATA_ORDER   md5_block_data_order
/*
 * Little-endians (Intel and Alpha) feel better without this.
 * It looks like memcpy does better job than generic
 * md5_block_data_order on copying-n-aligning input data.
 * But frankly speaking I didn't expect such result on Alpha.
 * On the other hand I've got this with egcs-1.0.2 and if
 * program is compiled with another (better?) compiler it
 * might turn out other way around.
 *
 *                              <appro@fy.chalmers.se>
 */
#endif

#include "md32_common.h"

/*
#define F(x,y,z)        (((x) & (y))  |  ((~(x)) & (z)))
#define G(x,y,z)        (((x) & (z))  |  ((y) & (~(z))))
*/

/* As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
 * simplified to the code below.  Wei attributes these optimizations
 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
 */
#define F(b,c,d)        ((((c) ^ (d)) & (b)) ^ (d))
#define G(b,c,d)        ((((b) ^ (c)) & (d)) ^ (c))
#define H(b,c,d)        ((b) ^ (c) ^ (d))
#define I(b,c,d)        (((~(d)) | (b)) ^ (c))

#define R0(a,b,c,d,k,s,t) { \
        a+=((k)+(t)+F((b),(c),(d))); \
        a=ROTATE(a,s); \
        a+=b; };\

#define R1(a,b,c,d,k,s,t) { \
        a+=((k)+(t)+G((b),(c),(d))); \
        a=ROTATE(a,s); \
        a+=b; };

#define R2(a,b,c,d,k,s,t) { \
        a+=((k)+(t)+H((b),(c),(d))); \
        a=ROTATE(a,s); \
        a+=b; };

#define R3(a,b,c,d,k,s,t) { \
        a+=((k)+(t)+I((b),(c),(d))); \
        a=ROTATE(a,s); \
        a+=b; };
1	/* crypto/md5/md5_locl.h */
2	/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3	* All rights reserved.
4	*
5	* This package is an SSL implementation written
6	* by Eric Young (eay@cryptsoft.com).
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 (tjh@cryptsoft.com).
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 (eay@cryptsoft.com)"
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 (tjh@cryptsoft.com)"
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 "md5.h"
62
63	#ifndef MD5_LONG_LOG2
64	#define MD5_LONG_LOG2 2 /* default to 32 bits */
65	#endif
66
67	#ifdef MD5_ASM
68	# if defined(__i386) \|\| defined(_M_IX86) \|\| defined(__INTEL__)
69	# define md5_block_host_order md5_block_asm_host_order
70	# elif defined(__sparc) && defined(ULTRASPARC)
71	void md5_block_asm_data_order_aligned (MD5_CTX c, const MD5_LONG p,int num);
72	# define HASH_BLOCK_DATA_ORDER_ALIGNED md5_block_asm_data_order_aligned
73	# endif
74	#endif
75
76	void md5_block_host_order (MD5_CTX c, const void p,int num);
77	void md5_block_data_order (MD5_CTX c, const void p,int num);
78
79	#if defined(__i386) \|\| defined(_M_IX86) \|\| defined(__INTEL__)
80	/*
81	* *_block_host_order is expected to handle aligned data while
82	* *_block_data_order - unaligned. As algorithm and host (x86)
83	* are in this case of the same "endianness" these two are
84	* otherwise indistinguishable. But normally you don't want to
85	* call the same function because unaligned access in places
86	* where alignment is expected is usually a "Bad Thing". Indeed,
87	* on RISCs you get punished with BUS ERROR signal or severe
88	* performance degradation. Intel CPUs are in turn perfectly
89	* capable of loading unaligned data without such drastic side
90	* effect. Yes, they say it's slower than aligned load, but no
91	* exception is generated and therefore performance degradation
92	* is incomparable with RISCs. What we should weight here is
93	* costs of unaligned access against costs of aligning data.
94	* According to my measurements allowing unaligned access results
95	* in ~9% performance improvement on Pentium II operating at
96	* 266MHz. I won't be surprised if the difference will be higher
97	* on faster systems:-)
98	*
99	* <appro@fy.chalmers.se>
100	*/
101	#define md5_block_data_order md5_block_host_order
102	#endif
103
104	#define DATA_ORDER_IS_LITTLE_ENDIAN
105
106	#define HASH_LONG MD5_LONG
107	#define HASH_LONG_LOG2 MD5_LONG_LOG2
108	#define HASH_CTX MD5_CTX
109	#define HASH_CBLOCK MD5_CBLOCK
110	#define HASH_LBLOCK MD5_LBLOCK
111	#define HASH_UPDATE MD5_Update
112	#define HASH_TRANSFORM MD5_Transform
113	#define HASH_FINAL MD5_Final
114	#define HASH_MAKE_STRING(c,s) do { \
115	unsigned long ll; \
116	ll=(c)->A; HOST_l2c(ll,(s)); \
117	ll=(c)->B; HOST_l2c(ll,(s)); \
118	ll=(c)->C; HOST_l2c(ll,(s)); \
119	ll=(c)->D; HOST_l2c(ll,(s)); \
120	} while (0)
121	#define HASH_BLOCK_HOST_ORDER md5_block_host_order
122	#if !defined(L_ENDIAN) \|\| defined(md5_block_data_order)
123	#define HASH_BLOCK_DATA_ORDER md5_block_data_order
124	/*
125	* Little-endians (Intel and Alpha) feel better without this.
126	* It looks like memcpy does better job than generic
127	* md5_block_data_order on copying-n-aligning input data.
128	* But frankly speaking I didn't expect such result on Alpha.
129	* On the other hand I've got this with egcs-1.0.2 and if
130	* program is compiled with another (better?) compiler it
131	* might turn out other way around.
132	*
133	* <appro@fy.chalmers.se>
134	*/
135	#endif
136
137	#include "md32_common.h"
138
139	/*
140	#define F(x,y,z) (((x) & (y)) \| ((~(x)) & (z)))
141	#define G(x,y,z) (((x) & (z)) \| ((y) & (~(z))))
142	*/
143
144	/* As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
145	* simplified to the code below. Wei attributes these optimizations
146	* to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
147	*/
148	#define F(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
149	#define G(b,c,d) ((((b) ^ (c)) & (d)) ^ (c))
150	#define H(b,c,d) ((b) ^ (c) ^ (d))
151	#define I(b,c,d) (((~(d)) \| (b)) ^ (c))
152
153	#define R0(a,b,c,d,k,s,t) { \
154	a+=((k)+(t)+F((b),(c),(d))); \
155	a=ROTATE(a,s); \
156	a+=b; };\
157
158	#define R1(a,b,c,d,k,s,t) { \
159	a+=((k)+(t)+G((b),(c),(d))); \
160	a=ROTATE(a,s); \
161	a+=b; };
162
163	#define R2(a,b,c,d,k,s,t) { \
164	a+=((k)+(t)+H((b),(c),(d))); \
165	a=ROTATE(a,s); \
166	a+=b; };
167
168	#define R3(a,b,c,d,k,s,t) { \
169	a+=((k)+(t)+I((b),(c),(d))); \
170	a=ROTATE(a,s); \
171	a+=b; };