kc3-lang/SDL/src/test/SDL_test_md5.c
-
Show log
Commit
-
Hash : 3dcb451f
Author :
Date : 2014-04-09T21:29:19
Added a README file regarding WinRT support To note, this file is currently formatted with CRLF line endings, rather than LF, to allow the file to be viewed with Notepad.
-
src/test/SDL_test_md5.c
-
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336
/* Simple DirectMedia Layer Copyright (C) 1997-2014 Sam Lantinga <slouken@libsdl.org> This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. */ /* *********************************************************************** ** RSA Data Security, Inc. MD5 Message-Digest Algorithm ** ** Created: 2/17/90 RLR ** ** Revised: 1/91 SRD,AJ,BSK,JT Reference C ver., 7/10 constant corr. ** *********************************************************************** */ /* *********************************************************************** ** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. ** ** ** ** License to copy and use this software is granted provided that ** ** it is identified as the "RSA Data Security, Inc. MD5 Message- ** ** Digest Algorithm" in all material mentioning or referencing this ** ** software or this function. ** ** ** ** License is also granted to make and use derivative works ** ** provided that such works are identified as "derived from the RSA ** ** Data Security, Inc. MD5 Message-Digest Algorithm" in all ** ** material mentioning or referencing the derived work. ** ** ** ** RSA Data Security, Inc. makes no representations concerning ** ** either the merchantability of this software or the suitability ** ** of this software for any particular purpose. It is provided "as ** ** is" without express or implied warranty of any kind. ** ** ** ** These notices must be retained in any copies of any part of this ** ** documentation and/or software. ** *********************************************************************** */ #include "SDL_config.h" #include "SDL_test.h" /* Forward declaration of static helper function */ static void SDLTest_Md5Transform(MD5UINT4 * buf, MD5UINT4 * in); static unsigned char MD5PADDING[64] = { 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; /* F, G, H and I are basic MD5 functions */ #define F(x, y, z) (((x) & (y)) | ((~x) & (z))) #define G(x, y, z) (((x) & (z)) | ((y) & (~z))) #define H(x, y, z) ((x) ^ (y) ^ (z)) #define I(x, y, z) ((y) ^ ((x) | (~z))) /* ROTATE_LEFT rotates x left n bits */ #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n)))) /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */ /* Rotation is separate from addition to prevent recomputation */ #define FF(a, b, c, d, x, s, ac) \ {(a) += F ((b), (c), (d)) + (x) + (MD5UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define GG(a, b, c, d, x, s, ac) \ {(a) += G ((b), (c), (d)) + (x) + (MD5UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define HH(a, b, c, d, x, s, ac) \ {(a) += H ((b), (c), (d)) + (x) + (MD5UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define II(a, b, c, d, x, s, ac) \ {(a) += I ((b), (c), (d)) + (x) + (MD5UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } /* The routine MD5Init initializes the message-digest context mdContext. All fields are set to zero. */ void SDLTest_Md5Init(SDLTest_Md5Context * mdContext) { if (mdContext==NULL) return; mdContext->i[0] = mdContext->i[1] = (MD5UINT4) 0; /* * Load magic initialization constants. */ mdContext->buf[0] = (MD5UINT4) 0x67452301; mdContext->buf[1] = (MD5UINT4) 0xefcdab89; mdContext->buf[2] = (MD5UINT4) 0x98badcfe; mdContext->buf[3] = (MD5UINT4) 0x10325476; } /* The routine MD5Update updates the message-digest context to account for the presence of each of the characters inBuf[0..inLen-1] in the message whose digest is being computed. */ void SDLTest_Md5Update(SDLTest_Md5Context * mdContext, unsigned char *inBuf, unsigned int inLen) { MD5UINT4 in[16]; int mdi; unsigned int i, ii; if (mdContext == NULL) return; if (inBuf == NULL || inLen < 1) return; /* * compute number of bytes mod 64 */ mdi = (int) ((mdContext->i[0] >> 3) & 0x3F); /* * update number of bits */ if ((mdContext->i[0] + ((MD5UINT4) inLen << 3)) < mdContext->i[0]) mdContext->i[1]++; mdContext->i[0] += ((MD5UINT4) inLen << 3); mdContext->i[1] += ((MD5UINT4) inLen >> 29); while (inLen--) { /* * add new character to buffer, increment mdi */ mdContext->in[mdi++] = *inBuf++; /* * transform if necessary */ if (mdi == 0x40) { for (i = 0, ii = 0; i < 16; i++, ii += 4) in[i] = (((MD5UINT4) mdContext->in[ii + 3]) << 24) | (((MD5UINT4) mdContext->in[ii + 2]) << 16) | (((MD5UINT4) mdContext->in[ii + 1]) << 8) | ((MD5UINT4) mdContext->in[ii]); SDLTest_Md5Transform(mdContext->buf, in); mdi = 0; } } } /* The routine MD5Final terminates the message-digest computation and ends with the desired message digest in mdContext->digest[0...15]. */ void SDLTest_Md5Final(SDLTest_Md5Context * mdContext) { MD5UINT4 in[16]; int mdi; unsigned int i, ii; unsigned int padLen; if (mdContext == NULL) return; /* * save number of bits */ in[14] = mdContext->i[0]; in[15] = mdContext->i[1]; /* * compute number of bytes mod 64 */ mdi = (int) ((mdContext->i[0] >> 3) & 0x3F); /* * pad out to 56 mod 64 */ padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi); SDLTest_Md5Update(mdContext, MD5PADDING, padLen); /* * append length in bits and transform */ for (i = 0, ii = 0; i < 14; i++, ii += 4) in[i] = (((MD5UINT4) mdContext->in[ii + 3]) << 24) | (((MD5UINT4) mdContext->in[ii + 2]) << 16) | (((MD5UINT4) mdContext->in[ii + 1]) << 8) | ((MD5UINT4) mdContext->in[ii]); SDLTest_Md5Transform(mdContext->buf, in); /* * store buffer in digest */ for (i = 0, ii = 0; i < 4; i++, ii += 4) { mdContext->digest[ii] = (unsigned char) (mdContext->buf[i] & 0xFF); mdContext->digest[ii + 1] = (unsigned char) ((mdContext->buf[i] >> 8) & 0xFF); mdContext->digest[ii + 2] = (unsigned char) ((mdContext->buf[i] >> 16) & 0xFF); mdContext->digest[ii + 3] = (unsigned char) ((mdContext->buf[i] >> 24) & 0xFF); } } /* Basic MD5 step. Transforms buf based on in. */ static void SDLTest_Md5Transform(MD5UINT4 * buf, MD5UINT4 * in) { MD5UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3]; /* * Round 1 */ #define S11 7 #define S12 12 #define S13 17 #define S14 22 FF(a, b, c, d, in[0], S11, 3614090360u); /* 1 */ FF(d, a, b, c, in[1], S12, 3905402710u); /* 2 */ FF(c, d, a, b, in[2], S13, 606105819u); /* 3 */ FF(b, c, d, a, in[3], S14, 3250441966u); /* 4 */ FF(a, b, c, d, in[4], S11, 4118548399u); /* 5 */ FF(d, a, b, c, in[5], S12, 1200080426u); /* 6 */ FF(c, d, a, b, in[6], S13, 2821735955u); /* 7 */ FF(b, c, d, a, in[7], S14, 4249261313u); /* 8 */ FF(a, b, c, d, in[8], S11, 1770035416u); /* 9 */ FF(d, a, b, c, in[9], S12, 2336552879u); /* 10 */ FF(c, d, a, b, in[10], S13, 4294925233u); /* 11 */ FF(b, c, d, a, in[11], S14, 2304563134u); /* 12 */ FF(a, b, c, d, in[12], S11, 1804603682u); /* 13 */ FF(d, a, b, c, in[13], S12, 4254626195u); /* 14 */ FF(c, d, a, b, in[14], S13, 2792965006u); /* 15 */ FF(b, c, d, a, in[15], S14, 1236535329u); /* 16 */ /* * Round 2 */ #define S21 5 #define S22 9 #define S23 14 #define S24 20 GG(a, b, c, d, in[1], S21, 4129170786u); /* 17 */ GG(d, a, b, c, in[6], S22, 3225465664u); /* 18 */ GG(c, d, a, b, in[11], S23, 643717713u); /* 19 */ GG(b, c, d, a, in[0], S24, 3921069994u); /* 20 */ GG(a, b, c, d, in[5], S21, 3593408605u); /* 21 */ GG(d, a, b, c, in[10], S22, 38016083u); /* 22 */ GG(c, d, a, b, in[15], S23, 3634488961u); /* 23 */ GG(b, c, d, a, in[4], S24, 3889429448u); /* 24 */ GG(a, b, c, d, in[9], S21, 568446438u); /* 25 */ GG(d, a, b, c, in[14], S22, 3275163606u); /* 26 */ GG(c, d, a, b, in[3], S23, 4107603335u); /* 27 */ GG(b, c, d, a, in[8], S24, 1163531501u); /* 28 */ GG(a, b, c, d, in[13], S21, 2850285829u); /* 29 */ GG(d, a, b, c, in[2], S22, 4243563512u); /* 30 */ GG(c, d, a, b, in[7], S23, 1735328473u); /* 31 */ GG(b, c, d, a, in[12], S24, 2368359562u); /* 32 */ /* * Round 3 */ #define S31 4 #define S32 11 #define S33 16 #define S34 23 HH(a, b, c, d, in[5], S31, 4294588738u); /* 33 */ HH(d, a, b, c, in[8], S32, 2272392833u); /* 34 */ HH(c, d, a, b, in[11], S33, 1839030562u); /* 35 */ HH(b, c, d, a, in[14], S34, 4259657740u); /* 36 */ HH(a, b, c, d, in[1], S31, 2763975236u); /* 37 */ HH(d, a, b, c, in[4], S32, 1272893353u); /* 38 */ HH(c, d, a, b, in[7], S33, 4139469664u); /* 39 */ HH(b, c, d, a, in[10], S34, 3200236656u); /* 40 */ HH(a, b, c, d, in[13], S31, 681279174u); /* 41 */ HH(d, a, b, c, in[0], S32, 3936430074u); /* 42 */ HH(c, d, a, b, in[3], S33, 3572445317u); /* 43 */ HH(b, c, d, a, in[6], S34, 76029189u); /* 44 */ HH(a, b, c, d, in[9], S31, 3654602809u); /* 45 */ HH(d, a, b, c, in[12], S32, 3873151461u); /* 46 */ HH(c, d, a, b, in[15], S33, 530742520u); /* 47 */ HH(b, c, d, a, in[2], S34, 3299628645u); /* 48 */ /* * Round 4 */ #define S41 6 #define S42 10 #define S43 15 #define S44 21 II(a, b, c, d, in[0], S41, 4096336452u); /* 49 */ II(d, a, b, c, in[7], S42, 1126891415u); /* 50 */ II(c, d, a, b, in[14], S43, 2878612391u); /* 51 */ II(b, c, d, a, in[5], S44, 4237533241u); /* 52 */ II(a, b, c, d, in[12], S41, 1700485571u); /* 53 */ II(d, a, b, c, in[3], S42, 2399980690u); /* 54 */ II(c, d, a, b, in[10], S43, 4293915773u); /* 55 */ II(b, c, d, a, in[1], S44, 2240044497u); /* 56 */ II(a, b, c, d, in[8], S41, 1873313359u); /* 57 */ II(d, a, b, c, in[15], S42, 4264355552u); /* 58 */ II(c, d, a, b, in[6], S43, 2734768916u); /* 59 */ II(b, c, d, a, in[13], S44, 1309151649u); /* 60 */ II(a, b, c, d, in[4], S41, 4149444226u); /* 61 */ II(d, a, b, c, in[11], S42, 3174756917u); /* 62 */ II(c, d, a, b, in[2], S43, 718787259u); /* 63 */ II(b, c, d, a, in[9], S44, 3951481745u); /* 64 */ buf[0] += a; buf[1] += b; buf[2] += c; buf[3] += d; }