Pre-2.0 release, MFC firewire disk changes to properly detach SIMs.
[dragonfly.git] / contrib / dhcp-3.0 / dst / md5_locl.h
blobc52d73377def220befef2f3da8145a362e684e79
1 /* crypto/md/md5_locl.h */
2 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
3 * All rights reserved.
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).
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.
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)"
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.
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.]
59 #include <stdlib.h>
60 #include <string.h>
61 #include "md5.h"
63 #define ULONG unsigned long
64 #define UCHAR unsigned char
65 #define UINT unsigned int
67 #if defined(NOCONST)
68 #define const
69 #endif
71 #undef c2l
72 #define c2l(c,l) (l = ((unsigned long)(*((c)++))) , \
73 l|=(((unsigned long)(*((c)++)))<< 8), \
74 l|=(((unsigned long)(*((c)++)))<<16), \
75 l|=(((unsigned long)(*((c)++)))<<24))
77 #undef p_c2l
78 #define p_c2l(c,l,n) { \
79 switch (n) { \
80 case 0: l =((unsigned long)(*((c)++))); \
81 case 1: l|=((unsigned long)(*((c)++)))<< 8; \
82 case 2: l|=((unsigned long)(*((c)++)))<<16; \
83 case 3: l|=((unsigned long)(*((c)++)))<<24; \
84 } \
87 /* NOTE the pointer is not incremented at the end of this */
88 #undef c2l_p
89 #define c2l_p(c,l,n) { \
90 l=0; \
91 (c)+=n; \
92 switch (n) { \
93 case 3: l =((unsigned long)(*(--(c))))<<16; \
94 case 2: l|=((unsigned long)(*(--(c))))<< 8; \
95 case 1: l|=((unsigned long)(*(--(c)))) ; \
96 } \
99 #undef p_c2l_p
100 #define p_c2l_p(c,l,sc,len) { \
101 switch (sc) \
103 case 0: l =((unsigned long)(*((c)++))); \
104 if (--len == 0) break; \
105 case 1: l|=((unsigned long)(*((c)++)))<< 8; \
106 if (--len == 0) break; \
107 case 2: l|=((unsigned long)(*((c)++)))<<16; \
111 #undef l2c
112 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
113 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
114 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
115 *((c)++)=(unsigned char)(((l)>>24)&0xff))
117 /* NOTE - c is not incremented as per l2c */
118 #undef l2cn
119 #define l2cn(l1,l2,c,n) { \
120 c+=n; \
121 switch (n) { \
122 case 8: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
123 case 7: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
124 case 6: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
125 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
126 case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
127 case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
128 case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
129 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
133 /* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
134 #if defined(WIN32)
135 /* 5 instructions with rotate instruction, else 9 */
136 #define Endian_Reverse32(a) \
138 unsigned long l=(a); \
139 (a)=((ROTATE(l,8)&0x00FF00FF)|(ROTATE(l,24)&0xFF00FF00)); \
141 #else
142 /* 6 instructions with rotate instruction, else 8 */
143 #define Endian_Reverse32(a) \
145 unsigned long l=(a); \
146 l=(((l&0xFF00FF00)>>8L)|((l&0x00FF00FF)<<8L)); \
147 (a)=ROTATE(l,16L); \
149 #endif
151 #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
152 #define G(x,y,z) (((x) & (z)) | ((y) & (~(z))))
155 /* As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
156 * simplified to the code below. Wei attributes these optimisations
157 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
159 #define F(x,y,z) ((((y) ^ (z)) & (x)) ^ (z))
160 #define G(x,y,z) ((((x) ^ (y)) & (z)) ^ (y))
161 #define H(x,y,z) ((x) ^ (y) ^ (z))
162 #define I(x,y,z) (((x) | (~(z))) ^ (y))
164 #undef ROTATE
165 #if defined(WIN32)
166 #define ROTATE(a,n) _lrotl(a,n)
167 #else
168 #define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
169 #endif
171 #define LOCL_R0(a,b,c,d,k,s,t) { \
172 a+=((k)+(t)+F((b),(c),(d))); \
173 a=ROTATE(a,s); \
174 a+=b; };\
176 #define LOCL_R1(a,b,c,d,k,s,t) { \
177 a+=((k)+(t)+G((b),(c),(d))); \
178 a=ROTATE(a,s); \
179 a+=b; };
181 #define LOCL_R2(a,b,c,d,k,s,t) { \
182 a+=((k)+(t)+H((b),(c),(d))); \
183 a=ROTATE(a,s); \
184 a+=b; };
186 #define LOCL_R3(a,b,c,d,k,s,t) { \
187 a+=((k)+(t)+I((b),(c),(d))); \
188 a=ROTATE(a,s); \
189 a+=b; };