rdesktop/crypto/md5_locl.h

/* crypto/md5/md5_locl.h */
/* Copyright (C) 1995-1997 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.]
 */

/* On sparc, this actually slows things down :-( */
#if defined(sun)
#undef B_ENDIAN
#endif

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

#define ULONG   unsigned long
#define UCHAR   unsigned char
#define UINT    unsigned int

#if defined(NOCONST)
#define const
#endif

#undef c2l
#define c2l(c,l)        (l = ((unsigned long)(*((c)++)))     , \
                         l|=(((unsigned long)(*((c)++)))<< 8), \
                         l|=(((unsigned long)(*((c)++)))<<16), \
                         l|=(((unsigned long)(*((c)++)))<<24))

#undef p_c2l
#define p_c2l(c,l,n)    { \
                        switch (n) { \
                        case 0: l =((unsigned long)(*((c)++))); \
                        case 1: l|=((unsigned long)(*((c)++)))<< 8; \
                        case 2: l|=((unsigned long)(*((c)++)))<<16; \
                        case 3: l|=((unsigned long)(*((c)++)))<<24; \
                                } \
                        }

/* NOTE the pointer is not incremented at the end of this */
#undef c2l_p
#define c2l_p(c,l,n)    { \
                        l=0; \
                        (c)+=n; \
                        switch (n) { \
                        case 3: l =((unsigned long)(*(--(c))))<<16; \
                        case 2: l|=((unsigned long)(*(--(c))))<< 8; \
                        case 1: l|=((unsigned long)(*(--(c))))    ; \
                                } \
                        }

#undef p_c2l_p
#define p_c2l_p(c,l,sc,len) { \
                        switch (sc) \
                                { \
                        case 0: l =((unsigned long)(*((c)++))); \
                                if (--len == 0) break; \
                        case 1: l|=((unsigned long)(*((c)++)))<< 8; \
                                if (--len == 0) break; \
                        case 2: l|=((unsigned long)(*((c)++)))<<16; \
                                } \
                        }

#undef l2c
#define l2c(l,c)        (*((c)++)=(unsigned char)(((l)    )&0xff), \
                         *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
                         *((c)++)=(unsigned char)(((l)>>16)&0xff), \
                         *((c)++)=(unsigned char)(((l)>>24)&0xff))

/* NOTE - c is not incremented as per l2c */
#undef l2cn
#define l2cn(l1,l2,c,n) { \
                        c+=n; \
                        switch (n) { \
                        case 8: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
                        case 7: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
                        case 6: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
                        case 5: *(--(c))=(unsigned char)(((l2)    )&0xff); \
                        case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
                        case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
                        case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
                        case 1: *(--(c))=(unsigned char)(((l1)    )&0xff); \
                                } \
                        }

/* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
#if defined(WIN32)
/* 5 instructions with rotate instruction, else 9 */
#define Endian_Reverse32(a) \
        { \
        unsigned long l=(a); \
        (a)=((ROTATE(l,8)&0x00FF00FF)|(ROTATE(l,24)&0xFF00FF00)); \
        }
#else
/* 6 instructions with rotate instruction, else 8 */
#define Endian_Reverse32(a) \
        { \
        unsigned long l=(a); \
        l=(((l&0xFF00FF00)>>8L)|((l&0x00FF00FF)<<8L)); \
        (a)=ROTATE(l,16L); \
        }
#endif
/*
#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 optimisations
 * 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))

#undef ROTATE
#if defined(WIN32)
#define ROTATE(a,n)     _lrotl(a,n)
#else
#define ROTATE(a,n)     (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
#endif


#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	matty	11	/* crypto/md5/md5_locl.h */
2			/* Copyright (C) 1995-1997 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			/* On sparc, this actually slows things down :-( */
60			#if defined(sun)
61			#undef B_ENDIAN
62			#endif
63
64			#include <stdlib.h>
65			#include <string.h>
66			#include "md5.h"
67
68			#define ULONG unsigned long
69			#define UCHAR unsigned char
70			#define UINT unsigned int
71
72			#if defined(NOCONST)
73			#define const
74			#endif
75
76			#undef c2l
77			#define c2l(c,l) (l = ((unsigned long)(*((c)++))) , \
78			l\|=(((unsigned long)(*((c)++)))<< 8), \
79			l\|=(((unsigned long)(*((c)++)))<<16), \
80			l\|=(((unsigned long)(*((c)++)))<<24))
81
82			#undef p_c2l
83			#define p_c2l(c,l,n) { \
84			switch (n) { \
85			case 0: l =((unsigned long)(*((c)++))); \
86			case 1: l\|=((unsigned long)(*((c)++)))<< 8; \
87			case 2: l\|=((unsigned long)(*((c)++)))<<16; \
88			case 3: l\|=((unsigned long)(*((c)++)))<<24; \
89			} \
90			}
91
92			/* NOTE the pointer is not incremented at the end of this */
93			#undef c2l_p
94			#define c2l_p(c,l,n) { \
95			l=0; \
96			(c)+=n; \
97			switch (n) { \
98			case 3: l =((unsigned long)(*(--(c))))<<16; \
99			case 2: l\|=((unsigned long)(*(--(c))))<< 8; \
100			case 1: l\|=((unsigned long)(*(--(c)))) ; \
101			} \
102			}
103
104			#undef p_c2l_p
105			#define p_c2l_p(c,l,sc,len) { \
106			switch (sc) \
107			{ \
108			case 0: l =((unsigned long)(*((c)++))); \
109			if (--len == 0) break; \
110			case 1: l\|=((unsigned long)(*((c)++)))<< 8; \
111			if (--len == 0) break; \
112			case 2: l\|=((unsigned long)(*((c)++)))<<16; \
113			} \
114			}
115
116			#undef l2c
117			#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
118			*((c)++)=(unsigned char)(((l)>> 8)&0xff), \
119			*((c)++)=(unsigned char)(((l)>>16)&0xff), \
120			*((c)++)=(unsigned char)(((l)>>24)&0xff))
121
122			/* NOTE - c is not incremented as per l2c */
123			#undef l2cn
124			#define l2cn(l1,l2,c,n) { \
125			c+=n; \
126			switch (n) { \
127			case 8: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
128			case 7: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
129			case 6: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
130			case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
131			case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
132			case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
133			case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
134			case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
135			} \
136			}
137
138			/* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
139			#if defined(WIN32)
140			/* 5 instructions with rotate instruction, else 9 */
141			#define Endian_Reverse32(a) \
142			{ \
143			unsigned long l=(a); \
144			(a)=((ROTATE(l,8)&0x00FF00FF)\|(ROTATE(l,24)&0xFF00FF00)); \
145			}
146			#else
147			/* 6 instructions with rotate instruction, else 8 */
148			#define Endian_Reverse32(a) \
149			{ \
150			unsigned long l=(a); \
151			l=(((l&0xFF00FF00)>>8L)\|((l&0x00FF00FF)<<8L)); \
152			(a)=ROTATE(l,16L); \
153			}
154			#endif
155			/*
156			#define F(x,y,z) (((x) & (y)) \| ((~(x)) & (z)))
157			#define G(x,y,z) (((x) & (z)) \| ((y) & (~(z))))
158			*/
159
160			/* As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
161			* simplified to the code below. Wei attributes these optimisations
162			* to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
163			*/
164			#define F(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
165			#define G(b,c,d) ((((b) ^ (c)) & (d)) ^ (c))
166			#define H(b,c,d) ((b) ^ (c) ^ (d))
167			#define I(b,c,d) (((~(d)) \| (b)) ^ (c))
168
169			#undef ROTATE
170			#if defined(WIN32)
171			#define ROTATE(a,n) _lrotl(a,n)
172			#else
173			#define ROTATE(a,n) (((a)<<(n))\|(((a)&0xffffffff)>>(32-(n))))
174			#endif
175
176
177			#define R0(a,b,c,d,k,s,t) { \
178			a+=((k)+(t)+F((b),(c),(d))); \
179			a=ROTATE(a,s); \
180			a+=b; };\
181
182			#define R1(a,b,c,d,k,s,t) { \
183			a+=((k)+(t)+G((b),(c),(d))); \
184			a=ROTATE(a,s); \
185			a+=b; };
186
187			#define R2(a,b,c,d,k,s,t) { \
188			a+=((k)+(t)+H((b),(c),(d))); \
189			a=ROTATE(a,s); \
190			a+=b; };
191
192			#define R3(a,b,c,d,k,s,t) { \
193			a+=((k)+(t)+I((b),(c),(d))); \
194			a=ROTATE(a,s); \
195			a+=b; };