GUI: Fix Tomato RAF theme for all builds. Compilation typo.
[tomato.git] / release / src-rt-6.x.4708 / bcmcrypto / md5.c
blob1d5ad9e119f7919ad3c5a05b58835196900252b2
1 /*
2 * md5.c, copied from src/router/ppp/pppd to src/bcmcrypto for general use,
3 * with a few casts added to make it usable with a fussy compiler.
5 * md5.c -- the source code for MD5 routines
6 * RSA Data Security, Inc. MD5 Message-Digest Algorithm
7 * Created: 2/17/90 RLR
8 * Revised: 1/91 SRD,AJ,BSK,JT Reference C ver., 7/10 constant corr.
9 */
12 * Copyright (C) 1990, RSA Data Security, Inc. All rights reserved.
14 * License to copy and use this software is granted provided that
15 * it is identified as the "RSA Data Security, Inc. MD5 Message-
16 * Digest Algorithm" in all material mentioning or referencing this
17 * software or this function.
19 * License is also granted to make and use derivative works
20 * provided that such works are identified as "derived from the RSA
21 * Data Security, Inc. MD5 Message-Digest Algorithm" in all
22 * material mentioning or referencing the derived work.
24 * RSA Data Security, Inc. makes no representations concerning
25 * either the merchantability of this software or the suitability
26 * of this software for any particular purpose. It is provided "as
27 * is" without express or implied warranty of any kind.
29 * These notices must be retained in any copies of any part of this
30 * documentation and/or software.
32 * Copyright (C) 2012, Broadcom Corporation
33 * All Rights Reserved.
35 * This is UNPUBLISHED PROPRIETARY SOURCE CODE of Broadcom Corporation;
36 * the contents of this file may not be disclosed to third parties, copied
37 * or duplicated in any form, in whole or in part, without the prior
38 * written permission of Broadcom Corporation.
40 * $Id: md5.c 241182 2011-02-17 21:50:03Z $
43 #ifdef BCMDRIVER
44 #include <typedefs.h>
45 #include <osl.h>
46 #else
47 #include <string.h>
48 #endif /* BCMDRIVER */
50 #include <bcmcrypto/md5.h>
52 typedef uint32 UINT4;
55 * Message-digest routines:
56 * To form the message digest for a message M
57 * (1) Initialize a context buffer mdContext using MD5Init
58 * (2) Call MD5Update on mdContext and M
59 * (3) Call MD5Final on mdContext
60 * The message digest is now in mdContext->digest[0...15]
64 /* forward declaration */
65 static void Transform(UINT4 *buf, UINT4 *in);
67 static const unsigned char PADDING[64] = {
68 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
69 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
70 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
71 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
72 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
73 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
74 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
75 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
78 /* F, G, H and I are basic MD5 functions */
79 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
80 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
81 #define H(x, y, z) ((x) ^ (y) ^ (z))
82 #define I(x, y, z) ((y) ^ ((x) | (~z)))
84 /* ROTATE_LEFT rotates x left n bits */
85 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
87 /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
88 /* Rotation is separate from addition to prevent recomputation */
89 #define FF(a, b, c, d, x, s, ac) \
90 { \
91 (a) += F((b), (c), (d)) + (x) + (UINT4)(ac); \
92 (a) = ROTATE_LEFT((a), (s)); \
93 (a) += (b); \
95 #define GG(a, b, c, d, x, s, ac) \
96 { \
97 (a) += G((b), (c), (d)) + (x) + (UINT4)(ac); \
98 (a) = ROTATE_LEFT((a), (s)); \
99 (a) += (b); \
101 #define HH(a, b, c, d, x, s, ac) \
103 (a) += H((b), (c), (d)) + (x) + (UINT4)(ac); \
104 (a) = ROTATE_LEFT((a), (s)); \
105 (a) += (b); \
107 #define II(a, b, c, d, x, s, ac) \
109 (a) += I((b), (c), (d)) + (x) + (UINT4)(ac); \
110 (a) = ROTATE_LEFT((a), (s)); \
111 (a) += (b); \
114 #ifndef UL
115 #ifdef __STDC__
116 #define UL(x) x##U
117 #else
118 #define UL(x) x
119 #endif
120 #endif /* !UL */
122 /* The routine MD5Init initializes the message-digest context
123 * mdContext. All fields are set to zero.
125 void
126 BCMROMFN(MD5Init)(MD5_CTX *mdContext)
128 mdContext->i[0] = mdContext->i[1] = (UINT4)0;
130 /* Load magic initialization constants.
132 mdContext->buf[0] = (UINT4)0x67452301;
133 mdContext->buf[1] = (UINT4)0xefcdab89;
134 mdContext->buf[2] = (UINT4)0x98badcfe;
135 mdContext->buf[3] = (UINT4)0x10325476;
138 /* The routine MD5Update updates the message-digest context to
139 * account for the presence of each of the characters inBuf[0..inLen-1]
140 * in the message whose digest is being computed.
142 void
143 BCMROMFN(MD5Update)(MD5_CTX *mdContext, const unsigned char *inBuf, unsigned int inLen)
145 UINT4 in[16];
146 int mdi;
147 unsigned int i, ii;
149 /* compute number of bytes mod 64 */
150 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
152 /* update number of bits */
153 if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
154 mdContext->i[1]++;
155 mdContext->i[0] += ((UINT4)inLen << 3);
156 mdContext->i[1] += ((UINT4)inLen >> 29);
158 while (inLen--) {
159 /* add new character to buffer, increment mdi */
160 mdContext->in[mdi++] = *inBuf++;
162 /* transform if necessary */
163 if (mdi == 0x40) {
164 for (i = 0, ii = 0; i < 16; i++, ii += 4)
165 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
166 (((UINT4)mdContext->in[ii+2]) << 16) |
167 (((UINT4)mdContext->in[ii+1]) << 8) |
168 ((UINT4)mdContext->in[ii]);
169 Transform(mdContext->buf, in);
170 mdi = 0;
175 /* The routine MD5Final terminates the message-digest computation and
176 * ends with the desired message digest in mdContext->digest[0...15].
178 void
179 BCMROMFN(MD5Final)(unsigned char *hash, MD5_CTX *mdContext)
181 UINT4 in[16];
182 int mdi;
183 unsigned int i, ii;
184 unsigned int padLen;
186 /* save number of bits */
187 in[14] = mdContext->i[0];
188 in[15] = mdContext->i[1];
190 /* compute number of bytes mod 64 */
191 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
193 /* pad out to 56 mod 64 */
194 padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
195 MD5Update(mdContext, PADDING, padLen);
197 /* append length in bits and transform */
198 for (i = 0, ii = 0; i < 14; i++, ii += 4)
199 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
200 (((UINT4)mdContext->in[ii+2]) << 16) |
201 (((UINT4)mdContext->in[ii+1]) << 8) |
202 ((UINT4)mdContext->in[ii]);
203 Transform(mdContext->buf, in);
205 /* store buffer in digest */
206 for (i = 0, ii = 0; i < 4; i++, ii += 4) {
207 mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);
208 mdContext->digest[ii+1] =
209 (unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
210 mdContext->digest[ii+2] =
211 (unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
212 mdContext->digest[ii+3] =
213 (unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
215 memcpy((void *)hash, mdContext->digest, 16);
218 /* Basic MD5 step. Transforms buf based on in.
220 static void
221 Transform(UINT4 *buf, UINT4 *in)
223 UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
225 /* Round 1 */
226 #define S11 7
227 #define S12 12
228 #define S13 17
229 #define S14 22
230 FF(a, b, c, d, in[ 0], S11, UL(3614090360)); /* 1 */
231 FF(d, a, b, c, in[ 1], S12, UL(3905402710)); /* 2 */
232 FF(c, d, a, b, in[ 2], S13, UL(606105819)); /* 3 */
233 FF(b, c, d, a, in[ 3], S14, UL(3250441966)); /* 4 */
234 FF(a, b, c, d, in[ 4], S11, UL(4118548399)); /* 5 */
235 FF(d, a, b, c, in[ 5], S12, UL(1200080426)); /* 6 */
236 FF(c, d, a, b, in[ 6], S13, UL(2821735955)); /* 7 */
237 FF(b, c, d, a, in[ 7], S14, UL(4249261313)); /* 8 */
238 FF(a, b, c, d, in[ 8], S11, UL(1770035416)); /* 9 */
239 FF(d, a, b, c, in[ 9], S12, UL(2336552879)); /* 10 */
240 FF(c, d, a, b, in[10], S13, UL(4294925233)); /* 11 */
241 FF(b, c, d, a, in[11], S14, UL(2304563134)); /* 12 */
242 FF(a, b, c, d, in[12], S11, UL(1804603682)); /* 13 */
243 FF(d, a, b, c, in[13], S12, UL(4254626195)); /* 14 */
244 FF(c, d, a, b, in[14], S13, UL(2792965006)); /* 15 */
245 FF(b, c, d, a, in[15], S14, UL(1236535329)); /* 16 */
247 /* Round 2 */
248 #define S21 5
249 #define S22 9
250 #define S23 14
251 #define S24 20
252 GG(a, b, c, d, in[ 1], S21, UL(4129170786)); /* 17 */
253 GG(d, a, b, c, in[ 6], S22, UL(3225465664)); /* 18 */
254 GG(c, d, a, b, in[11], S23, UL(643717713)); /* 19 */
255 GG(b, c, d, a, in[ 0], S24, UL(3921069994)); /* 20 */
256 GG(a, b, c, d, in[ 5], S21, UL(3593408605)); /* 21 */
257 GG(d, a, b, c, in[10], S22, UL( 38016083)); /* 22 */
258 GG(c, d, a, b, in[15], S23, UL(3634488961)); /* 23 */
259 GG(b, c, d, a, in[ 4], S24, UL(3889429448)); /* 24 */
260 GG(a, b, c, d, in[ 9], S21, UL(568446438)); /* 25 */
261 GG(d, a, b, c, in[14], S22, UL(3275163606)); /* 26 */
262 GG(c, d, a, b, in[ 3], S23, UL(4107603335)); /* 27 */
263 GG(b, c, d, a, in[ 8], S24, UL(1163531501)); /* 28 */
264 GG(a, b, c, d, in[13], S21, UL(2850285829)); /* 29 */
265 GG(d, a, b, c, in[ 2], S22, UL(4243563512)); /* 30 */
266 GG(c, d, a, b, in[ 7], S23, UL(1735328473)); /* 31 */
267 GG(b, c, d, a, in[12], S24, UL(2368359562)); /* 32 */
269 /* Round 3 */
270 #define S31 4
271 #define S32 11
272 #define S33 16
273 #define S34 23
274 HH(a, b, c, d, in[ 5], S31, UL(4294588738)); /* 33 */
275 HH(d, a, b, c, in[ 8], S32, UL(2272392833)); /* 34 */
276 HH(c, d, a, b, in[11], S33, UL(1839030562)); /* 35 */
277 HH(b, c, d, a, in[14], S34, UL(4259657740)); /* 36 */
278 HH(a, b, c, d, in[ 1], S31, UL(2763975236)); /* 37 */
279 HH(d, a, b, c, in[ 4], S32, UL(1272893353)); /* 38 */
280 HH(c, d, a, b, in[ 7], S33, UL(4139469664)); /* 39 */
281 HH(b, c, d, a, in[10], S34, UL(3200236656)); /* 40 */
282 HH(a, b, c, d, in[13], S31, UL(681279174)); /* 41 */
283 HH(d, a, b, c, in[ 0], S32, UL(3936430074)); /* 42 */
284 HH(c, d, a, b, in[ 3], S33, UL(3572445317)); /* 43 */
285 HH(b, c, d, a, in[ 6], S34, UL( 76029189)); /* 44 */
286 HH(a, b, c, d, in[ 9], S31, UL(3654602809)); /* 45 */
287 HH(d, a, b, c, in[12], S32, UL(3873151461)); /* 46 */
288 HH(c, d, a, b, in[15], S33, UL(530742520)); /* 47 */
289 HH(b, c, d, a, in[ 2], S34, UL(3299628645)); /* 48 */
291 /* Round 4 */
292 #define S41 6
293 #define S42 10
294 #define S43 15
295 #define S44 21
296 II(a, b, c, d, in[ 0], S41, UL(4096336452)); /* 49 */
297 II(d, a, b, c, in[ 7], S42, UL(1126891415)); /* 50 */
298 II(c, d, a, b, in[14], S43, UL(2878612391)); /* 51 */
299 II(b, c, d, a, in[ 5], S44, UL(4237533241)); /* 52 */
300 II(a, b, c, d, in[12], S41, UL(1700485571)); /* 53 */
301 II(d, a, b, c, in[ 3], S42, UL(2399980690)); /* 54 */
302 II(c, d, a, b, in[10], S43, UL(4293915773)); /* 55 */
303 II(b, c, d, a, in[ 1], S44, UL(2240044497)); /* 56 */
304 II(a, b, c, d, in[ 8], S41, UL(1873313359)); /* 57 */
305 II(d, a, b, c, in[15], S42, UL(4264355552)); /* 58 */
306 II(c, d, a, b, in[ 6], S43, UL(2734768916)); /* 59 */
307 II(b, c, d, a, in[13], S44, UL(1309151649)); /* 60 */
308 II(a, b, c, d, in[ 4], S41, UL(4149444226)); /* 61 */
309 II(d, a, b, c, in[11], S42, UL(3174756917)); /* 62 */
310 II(c, d, a, b, in[ 2], S43, UL(718787259)); /* 63 */
311 II(b, c, d, a, in[ 9], S44, UL(3951481745)); /* 64 */
313 buf[0] += a;
314 buf[1] += b;
315 buf[2] += c;
316 buf[3] += d;
320 * End of md5.c