Debian Codegraph @

Utilities/KWSys/MD5.c

raw
1 /* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
2 file Copyright.txt or https://cmake.org/licensing#kwsys for details. */
3 #include "kwsysPrivate.h"
4 #include KWSYS_HEADER(MD5.h)
5
6 /* Work-around CMake dependency scanning limitation. This must
7 duplicate the above list of headers. */
8 #if 0
9 # include "MD5.h.in"
10 #endif
11
12 #include <stddef.h> /* size_t */
13 #include <stdint.h> /* uintptr_t */
14 #include <stdlib.h> /* malloc, free */
15 #include <string.h> /* memcpy, strlen */
16
17 /* This MD5 implementation has been taken from a third party. Slight
18 modifications to the arrangement of the code have been made to put
19 it in a single source file instead of a separate header and
20 implementation file. */
21
22 #if defined(__clang__) && !defined(__INTEL_COMPILER)
23 # pragma clang diagnostic push
24 # pragma clang diagnostic ignored "-Wcast-align"
25 #endif
26
27 /*
28 Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
29
30 This software is provided 'as-is', without any express or implied
31 warranty. In no event will the authors be held liable for any damages
32 arising from the use of this software.
33
34 Permission is granted to anyone to use this software for any purpose,
35 including commercial applications, and to alter it and redistribute it
36 freely, subject to the following restrictions:
37
38 1. The origin of this software must not be misrepresented; you must not
39 claim that you wrote the original software. If you use this software
40 in a product, an acknowledgment in the product documentation would be
41 appreciated but is not required.
42 2. Altered source versions must be plainly marked as such, and must not be
43 misrepresented as being the original software.
44 3. This notice may not be removed or altered from any source distribution.
45
46 L. Peter Deutsch
47 [email protected]
48
49 */
50 /*
51 Independent implementation of MD5 (RFC 1321).
52
53 This code implements the MD5 Algorithm defined in RFC 1321, whose
54 text is available at
55 http://www.ietf.org/rfc/rfc1321.txt
56 The code is derived from the text of the RFC, including the test suite
57 (section A.5) but excluding the rest of Appendix A. It does not include
58 any code or documentation that is identified in the RFC as being
59 copyrighted.
60
61 The original and principal author of md5.c is L. Peter Deutsch
62 <[email protected]>. Other authors are noted in the change history
63 that follows (in reverse chronological order):
64
65 2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
66 either statically or dynamically; added missing #include <string.h>
67 in library.
68 2002-03-11 lpd Corrected argument list for main(), and added int return
69 type, in test program and T value program.
70 2002-02-21 lpd Added missing #include <stdio.h> in test program.
71 2000-07-03 lpd Patched to eliminate warnings about "constant is
72 unsigned in ANSI C, signed in traditional"; made test program
73 self-checking.
74 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
75 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
76 1999-05-03 lpd Original version.
77 */
78
79 /*
80 * This package supports both compile-time and run-time determination of CPU
81 * byte order. If ARCH_IS_BIG_ENDIAN is defined as 0, the code will be
82 * compiled to run only on little-endian CPUs; if ARCH_IS_BIG_ENDIAN is
83 * defined as non-zero, the code will be compiled to run only on big-endian
84 * CPUs; if ARCH_IS_BIG_ENDIAN is not defined, the code will be compiled to
85 * run on either big- or little-endian CPUs, but will run slightly less
86 * efficiently on either one than if ARCH_IS_BIG_ENDIAN is defined.
87 */
88
89 typedef unsigned char md5_byte_t; /* 8-bit byte */
90 typedef unsigned int md5_word_t; /* 32-bit word */
91
92 /* Define the state of the MD5 Algorithm. */
93 typedef struct md5_state_s
94 {
95 md5_word_t count[2]; /* message length in bits, lsw first */
96 md5_word_t abcd[4]; /* digest buffer */
97 md5_byte_t buf[64]; /* accumulate block */
98 } md5_state_t;
99
100 #undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
101 #ifdef ARCH_IS_BIG_ENDIAN
102 # define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
103 #else
104 # define BYTE_ORDER 0
105 #endif
106
107 #define T_MASK ((md5_word_t)~0)
108 #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
109 #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
110 #define T3 0x242070db
111 #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
112 #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
113 #define T6 0x4787c62a
114 #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
115 #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
116 #define T9 0x698098d8
117 #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
118 #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
119 #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
120 #define T13 0x6b901122
121 #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
122 #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
123 #define T16 0x49b40821
124 #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
125 #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
126 #define T19 0x265e5a51
127 #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
128 #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
129 #define T22 0x02441453
130 #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
131 #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
132 #define T25 0x21e1cde6
133 #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
134 #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
135 #define T28 0x455a14ed
136 #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
137 #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
138 #define T31 0x676f02d9
139 #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
140 #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
141 #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
142 #define T35 0x6d9d6122
143 #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
144 #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
145 #define T38 0x4bdecfa9
146 #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
147 #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
148 #define T41 0x289b7ec6
149 #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
150 #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
151 #define T44 0x04881d05
152 #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
153 #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
154 #define T47 0x1fa27cf8
155 #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
156 #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
157 #define T50 0x432aff97
158 #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
159 #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
160 #define T53 0x655b59c3
161 #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
162 #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
163 #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
164 #define T57 0x6fa87e4f
165 #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
166 #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
167 #define T60 0x4e0811a1
168 #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
169 #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
170 #define T63 0x2ad7d2bb
171 #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
172
173 static void md5_process(md5_state_t* pms, const md5_byte_t* data /*[64]*/)
174 {
175 md5_word_t a = pms->abcd[0];
176 md5_word_t b = pms->abcd[1];
177 md5_word_t c = pms->abcd[2];
178 md5_word_t d = pms->abcd[3];
179 md5_word_t t;
180 #if BYTE_ORDER > 0
181 /* Define storage only for big-endian CPUs. */
182 md5_word_t X[16];
183 #else
184 /* Define storage for little-endian or both types of CPUs. */
185 md5_word_t xbuf[16];
186 const md5_word_t* X;
187 #endif
188
189 {
190 #if BYTE_ORDER == 0
191 /*
192 * Determine dynamically whether this is a big-endian or
193 * little-endian machine, since we can use a more efficient
194 * algorithm on the latter.
195 */
196 static const int w = 1;
197
198 if (*((const md5_byte_t*)&w)) /* dynamic little-endian */
199 #endif
200 #if BYTE_ORDER <= 0 /* little-endian */
201 {
202 /*
203 * On little-endian machines, we can process properly aligned
204 * data without copying it.
205 */
206 if (!((uintptr_t)data & 3)) {
207 /* data are properly aligned */
208 X = (const md5_word_t*)data;
209 } else {
210 /* not aligned */
211 memcpy(xbuf, data, 64);
212 X = xbuf;
213 }
214 }
215 #endif
216 #if BYTE_ORDER == 0
217 else /* dynamic big-endian */
218 #endif
219 #if BYTE_ORDER >= 0 /* big-endian */
220 {
221 /*
222 * On big-endian machines, we must arrange the bytes in the
223 * right order.
224 */
225 const md5_byte_t* xp = data;
226 int i;
227
228 # if BYTE_ORDER == 0
229 X = xbuf; /* (dynamic only) */
230 # else
231 # define xbuf X /* (static only) */
232 # endif
233 for (i = 0; i < 16; ++i, xp += 4) {
234 xbuf[i] =
235 (md5_word_t)(xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24));
236 }
237 }
238 #endif
239 }
240
241 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
242
243 /* Round 1. */
244 /* Let [abcd k s i] denote the operation
245 a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
246 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
247 #define SET(a, b, c, d, k, s, Ti) \
248 t = a + F(b, c, d) + X[k] + (Ti); \
249 a = ROTATE_LEFT(t, s) + b
250 /* Do the following 16 operations. */
251 SET(a, b, c, d, 0, 7, T1);
252 SET(d, a, b, c, 1, 12, T2);
253 SET(c, d, a, b, 2, 17, T3);
254 SET(b, c, d, a, 3, 22, T4);
255 SET(a, b, c, d, 4, 7, T5);
256 SET(d, a, b, c, 5, 12, T6);
257 SET(c, d, a, b, 6, 17, T7);
258 SET(b, c, d, a, 7, 22, T8);
259 SET(a, b, c, d, 8, 7, T9);
260 SET(d, a, b, c, 9, 12, T10);
261 SET(c, d, a, b, 10, 17, T11);
262 SET(b, c, d, a, 11, 22, T12);
263 SET(a, b, c, d, 12, 7, T13);
264 SET(d, a, b, c, 13, 12, T14);
265 SET(c, d, a, b, 14, 17, T15);
266 SET(b, c, d, a, 15, 22, T16);
267 #undef SET
268
269 /* Round 2. */
270 /* Let [abcd k s i] denote the operation
271 a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
272 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
273 #define SET(a, b, c, d, k, s, Ti) \
274 t = a + G(b, c, d) + X[k] + (Ti); \
275 a = ROTATE_LEFT(t, s) + b
276 /* Do the following 16 operations. */
277 SET(a, b, c, d, 1, 5, T17);
278 SET(d, a, b, c, 6, 9, T18);
279 SET(c, d, a, b, 11, 14, T19);
280 SET(b, c, d, a, 0, 20, T20);
281 SET(a, b, c, d, 5, 5, T21);
282 SET(d, a, b, c, 10, 9, T22);
283 SET(c, d, a, b, 15, 14, T23);
284 SET(b, c, d, a, 4, 20, T24);
285 SET(a, b, c, d, 9, 5, T25);
286 SET(d, a, b, c, 14, 9, T26);
287 SET(c, d, a, b, 3, 14, T27);
288 SET(b, c, d, a, 8, 20, T28);
289 SET(a, b, c, d, 13, 5, T29);
290 SET(d, a, b, c, 2, 9, T30);
291 SET(c, d, a, b, 7, 14, T31);
292 SET(b, c, d, a, 12, 20, T32);
293 #undef SET
294
295 /* Round 3. */
296 /* Let [abcd k s t] denote the operation
297 a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
298 #define H(x, y, z) ((x) ^ (y) ^ (z))
299 #define SET(a, b, c, d, k, s, Ti) \
300 t = a + H(b, c, d) + X[k] + (Ti); \
301 a = ROTATE_LEFT(t, s) + b
302 /* Do the following 16 operations. */
303 SET(a, b, c, d, 5, 4, T33);
304 SET(d, a, b, c, 8, 11, T34);
305 SET(c, d, a, b, 11, 16, T35);
306 SET(b, c, d, a, 14, 23, T36);
307 SET(a, b, c, d, 1, 4, T37);
308 SET(d, a, b, c, 4, 11, T38);
309 SET(c, d, a, b, 7, 16, T39);
310 SET(b, c, d, a, 10, 23, T40);
311 SET(a, b, c, d, 13, 4, T41);
312 SET(d, a, b, c, 0, 11, T42);
313 SET(c, d, a, b, 3, 16, T43);
314 SET(b, c, d, a, 6, 23, T44);
315 SET(a, b, c, d, 9, 4, T45);
316 SET(d, a, b, c, 12, 11, T46);
317 SET(c, d, a, b, 15, 16, T47);
318 SET(b, c, d, a, 2, 23, T48);
319 #undef SET
320
321 /* Round 4. */
322 /* Let [abcd k s t] denote the operation
323 a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
324 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
325 #define SET(a, b, c, d, k, s, Ti) \
326 t = a + I(b, c, d) + X[k] + (Ti); \
327 a = ROTATE_LEFT(t, s) + b
328 /* Do the following 16 operations. */
329 SET(a, b, c, d, 0, 6, T49);
330 SET(d, a, b, c, 7, 10, T50);
331 SET(c, d, a, b, 14, 15, T51);
332 SET(b, c, d, a, 5, 21, T52);
333 SET(a, b, c, d, 12, 6, T53);
334 SET(d, a, b, c, 3, 10, T54);
335 SET(c, d, a, b, 10, 15, T55);
336 SET(b, c, d, a, 1, 21, T56);
337 SET(a, b, c, d, 8, 6, T57);
338 SET(d, a, b, c, 15, 10, T58);
339 SET(c, d, a, b, 6, 15, T59);
340 SET(b, c, d, a, 13, 21, T60);
341 SET(a, b, c, d, 4, 6, T61);
342 SET(d, a, b, c, 11, 10, T62);
343 SET(c, d, a, b, 2, 15, T63);
344 SET(b, c, d, a, 9, 21, T64);
345 #undef SET
346
347 /* Then perform the following additions. (That is increment each
348 of the four registers by the value it had before this block
349 was started.) */
350 pms->abcd[0] += a;
351 pms->abcd[1] += b;
352 pms->abcd[2] += c;
353 pms->abcd[3] += d;
354 }
355
356 /* Initialize the algorithm. */
357 static void md5_init(md5_state_t* pms)
358 {
359 pms->count[0] = pms->count[1] = 0;
360 pms->abcd[0] = 0x67452301;
361 pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
362 pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
363 pms->abcd[3] = 0x10325476;
364 }
365
366 /* Append a string to the message. */
367 static void md5_append(md5_state_t* pms, const md5_byte_t* data, size_t nbytes)
368 {
369 const md5_byte_t* p = data;
370 size_t left = nbytes;
371 size_t offset = (pms->count[0] >> 3) & 63;
372 md5_word_t nbits = (md5_word_t)(nbytes << 3);
373
374 if (nbytes <= 0) {
375 return;
376 }
377
378 /* Update the message length. */
379 pms->count[1] += (md5_word_t)(nbytes >> 29);
380 pms->count[0] += nbits;
381 if (pms->count[0] < nbits) {
382 pms->count[1]++;
383 }
384
385 /* Process an initial partial block. */
386 if (offset) {
387 size_t copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
388
389 memcpy(pms->buf + offset, p, copy);
390 if (offset + copy < 64) {
391 return;
392 }
393 p += copy;
394 left -= copy;
395 md5_process(pms, pms->buf);
396 }
397
398 /* Process full blocks. */
399 for (; left >= 64; p += 64, left -= 64) {
400 md5_process(pms, p);
401 }
402
403 /* Process a final partial block. */
404 if (left) {
405 memcpy(pms->buf, p, left);
406 }
407 }
408
409 /* Finish the message and return the digest. */
410 static void md5_finish(md5_state_t* pms, md5_byte_t digest[16])
411 {
412 static const md5_byte_t pad[64] = { 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
413 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
414 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
415 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
416 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
417 md5_byte_t data[8];
418 int i;
419
420 /* Save the length before padding. */
421 for (i = 0; i < 8; ++i) {
422 data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
423 }
424 /* Pad to 56 bytes mod 64. */
425 md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
426 /* Append the length. */
427 md5_append(pms, data, 8);
428 for (i = 0; i < 16; ++i) {
429 digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
430 }
431 }
432
433 #if defined(__clang__) && !defined(__INTEL_COMPILER)
434 # pragma clang diagnostic pop
435 #endif
436
437 /* Wrap up the MD5 state in our opaque structure. */
438 struct kwsysMD5_s
439 {
440 md5_state_t md5_state;
441 };
442
443 kwsysMD5* kwsysMD5_New(void)
444 {
445 /* Allocate a process control structure. */
446 kwsysMD5* md5 = (kwsysMD5*)malloc(sizeof(kwsysMD5));
447 if (!md5) {
448 return 0;
449 }
450 return md5;
451 }
452
453 void kwsysMD5_Delete(kwsysMD5* md5)
454 {
455 /* Make sure we have an instance. */
456 if (!md5) {
457 return;
458 }
459
460 /* Free memory. */
461 free(md5);
462 }
463
464 void kwsysMD5_Initialize(kwsysMD5* md5)
465 {
466 md5_init(&md5->md5_state);
467 }
468
469 void kwsysMD5_Append(kwsysMD5* md5, unsigned char const* data, int length)
470 {
471 size_t dlen;
472 if (length < 0) {
473 dlen = strlen((char const*)data);
474 } else {
475 dlen = (size_t)length;
476 }
477 md5_append(&md5->md5_state, (md5_byte_t const*)data, dlen);
478 }
479
480 void kwsysMD5_Finalize(kwsysMD5* md5, unsigned char digest[16])
481 {
482 md5_finish(&md5->md5_state, (md5_byte_t*)digest);
483 }
484
485 void kwsysMD5_FinalizeHex(kwsysMD5* md5, char buffer[32])
486 {
487 unsigned char digest[16];
488 kwsysMD5_Finalize(md5, digest);
489 kwsysMD5_DigestToHex(digest, buffer);
490 }
491
492 void kwsysMD5_DigestToHex(unsigned char const digest[16], char buffer[32])
493 {
494 /* Map from 4-bit index to hexadecimal representation. */
495 static char const hex[16] = { '0', '1', '2', '3', '4', '5', '6', '7',
496 '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };
497
498 /* Map each 4-bit block separately. */
499 char* out = buffer;
500 int i;
501 for (i = 0; i < 16; ++i) {
502 *out++ = hex[digest[i] >> 4];
503 *out++ = hex[digest[i] & 0xF];
504 }
505 }