wok view syslinux/stuff/extra/md5sum.c @ rev 12215
syslinux/md5sum.c32: add a status line
| author | Pascal Bellard <pascal.bellard@slitaz.org> |
|---|---|
| date | Tue Apr 03 13:12:44 2012 +0200 (2012-04-03) |
| parents | 880772e418b7 |
| children | af17de69f535 |
line source
1 /*
2 * Based on busybox code.
3 *
4 * Compute MD5 checksum of strings according to the
5 * definition of MD5 in RFC 1321 from April 1992.
6 *
7 * Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995.
8 *
9 * Copyright (C) 1995-1999 Free Software Foundation, Inc.
10 * Copyright (C) 2001 Manuel Novoa III
11 * Copyright (C) 2003 Glenn L. McGrath
12 * Copyright (C) 2003 Erik Andersen
13 * Copyright (C) 2010 Denys Vlasenko
14 * Copyright (C) 2012 Pascal Bellard
15 *
16 * Licensed under GPLv2 or later
17 */
19 #include <stdio.h>
20 #include <stdlib.h>
21 #include <string.h>
22 #include <unistd.h>
23 #include <fcntl.h>
24 #include <console.h>
25 #include <com32.h>
27 #define ALIGN1
29 static uint8_t wbuffer[64]; /* always correctly aligned for uint64_t */
30 static uint64_t total64; /* must be directly before hash[] */
31 static uint32_t hash[8]; /* 4 elements for md5, 5 for sha1, 8 for sha256 */
33 /* Emit a string of hex representation of bytes */
34 static char* bin2hex(char *p)
35 {
36 static const char bb_hexdigits_upcase[] ALIGN1 = "0123456789abcdef";
37 int count = 16;
38 const char *cp = (const char *) hash;
39 while (count) {
40 unsigned char c = *cp++;
41 /* put lowercase hex digits */
42 *p++ = bb_hexdigits_upcase[c >> 4];
43 *p++ = bb_hexdigits_upcase[c & 0xf];
44 count--;
45 }
46 return p;
47 }
49 //#define rotl32(x,n) (((x) << (n)) | ((x) >> (32 - (n))))
50 static uint32_t rotl32(uint32_t x, unsigned n)
51 {
52 return (x << n) | (x >> (32 - n));
53 }
55 static void md5_process_block64(void);
57 /* Feed data through a temporary buffer.
58 * The internal buffer remembers previous data until it has 64
59 * bytes worth to pass on.
60 */
61 static void common64_hash(const void *buffer, size_t len)
62 {
63 unsigned bufpos = total64 & 63;
65 total64 += len;
67 while (1) {
68 unsigned remaining = 64 - bufpos;
69 if (remaining > len)
70 remaining = len;
71 /* Copy data into aligned buffer */
72 memcpy(wbuffer + bufpos, buffer, remaining);
73 len -= remaining;
74 buffer = (const char *)buffer + remaining;
75 bufpos += remaining;
76 /* clever way to do "if (bufpos != 64) break; ... ; bufpos = 0;" */
77 bufpos -= 64;
78 if (bufpos != 0)
79 break;
80 /* Buffer is filled up, process it */
81 md5_process_block64();
82 /*bufpos = 0; - already is */
83 }
84 }
86 /* Process the remaining bytes in the buffer */
87 static void common64_end(void)
88 {
89 unsigned bufpos = total64 & 63;
90 /* Pad the buffer to the next 64-byte boundary with 0x80,0,0,0... */
91 wbuffer[bufpos++] = 0x80;
93 /* This loop iterates either once or twice, no more, no less */
94 while (1) {
95 unsigned remaining = 64 - bufpos;
96 memset(wbuffer + bufpos, 0, remaining);
97 /* Do we have enough space for the length count? */
98 if (remaining >= 8) {
99 /* Store the 64-bit counter of bits in the buffer */
100 uint64_t t = total64 << 3;
101 /* wbuffer is suitably aligned for this */
102 *(uint64_t *) (&wbuffer[64 - 8]) = t;
103 }
104 md5_process_block64();
105 if (remaining >= 8)
106 break;
107 bufpos = 0;
108 }
109 }
111 /* These are the four functions used in the four steps of the MD5 algorithm
112 * and defined in the RFC 1321. The first function is a little bit optimized
113 * (as found in Colin Plumbs public domain implementation).
114 * #define FF(b, c, d) ((b & c) | (~b & d))
115 */
116 #undef FF
117 #undef FG
118 #undef FH
119 #undef FI
120 #define FF(b, c, d) (d ^ (b & (c ^ d)))
121 #define FG(b, c, d) FF(d, b, c)
122 #define FH(b, c, d) (b ^ c ^ d)
123 #define FI(b, c, d) (c ^ (b | ~d))
125 /* Hash a single block, 64 bytes long and 4-byte aligned */
126 static void md5_process_block64(void)
127 {
128 /* Before we start, one word to the strange constants.
129 They are defined in RFC 1321 as
130 T[i] = (int)(4294967296.0 * fabs(sin(i))), i=1..64
131 */
132 static const uint32_t C_array[] = {
133 /* round 1 */
134 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
135 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
136 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
137 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
138 /* round 2 */
139 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
140 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
141 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
142 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
143 /* round 3 */
144 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
145 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
146 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
147 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
148 /* round 4 */
149 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
150 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
151 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
152 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
153 };
154 static const char P_array[] ALIGN1 = {
155 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, /* 1 */
156 1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12, /* 2 */
157 5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2, /* 3 */
158 0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9 /* 4 */
159 };
160 uint32_t *words = (void*) wbuffer;
161 uint32_t A = hash[0];
162 uint32_t B = hash[1];
163 uint32_t C = hash[2];
164 uint32_t D = hash[3];
166 static const char S_array[] ALIGN1 = {
167 7, 12, 17, 22,
168 5, 9, 14, 20,
169 4, 11, 16, 23,
170 6, 10, 15, 21
171 };
172 const uint32_t *pc;
173 const char *pp;
174 const char *ps;
175 int i;
176 uint32_t temp;
179 pc = C_array;
180 pp = P_array;
181 ps = S_array - 4;
183 for (i = 0; i < 64; i++) {
184 if ((i & 0x0f) == 0)
185 ps += 4;
186 temp = A;
187 switch (i >> 4) {
188 case 0:
189 temp += FF(B, C, D);
190 break;
191 case 1:
192 temp += FG(B, C, D);
193 break;
194 case 2:
195 temp += FH(B, C, D);
196 break;
197 case 3:
198 temp += FI(B, C, D);
199 }
200 temp += words[(int) (*pp++)] + *pc++;
201 temp = rotl32(temp, ps[i & 3]);
202 temp += B;
203 A = D;
204 D = C;
205 C = B;
206 B = temp;
207 }
208 /* Add checksum to the starting values */
209 hash[0] += A;
210 hash[1] += B;
211 hash[2] += C;
212 hash[3] += D;
214 }
215 #undef FF
216 #undef FG
217 #undef FH
218 #undef FI
220 /* Initialize structure containing state of computation.
221 * (RFC 1321, 3.3: Step 3)
222 */
223 static void md5_begin(void)
224 {
225 hash[0] = 0x67452301;
226 hash[1] = 0xefcdab89;
227 hash[2] = 0x98badcfe;
228 hash[3] = 0x10325476;
229 total64 = 0;
230 }
232 /* Used also for sha1 and sha256 */
233 #define md5_hash common64_hash
235 /* Process the remaining bytes in the buffer and put result from CTX
236 * in first 16 bytes following RESBUF. The result is always in little
237 * endian byte order, so that a byte-wise output yields to the wanted
238 * ASCII representation of the message digest.
239 */
240 #define md5_end common64_end
242 /*
243 * Copyright (C) 2003 Glenn L. McGrath
244 * Copyright (C) 2003-2004 Erik Andersen
245 *
246 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
247 */
249 static char *unrockridge(const char *name)
250 {
251 static char buffer[256];
252 int i = 0, j = 8;
253 while (*name && i < 255) {
254 char c = *name++;
255 //if (c == '\\') c = '/';
256 if (c == '.') {
257 for (j = i; --j >= 0 && buffer[j] != '/';)
258 if (buffer[j] == '.') buffer[j] = '_';
259 if (i - j > 9) i = j + 9;
260 j = i + 4;
261 }
262 else if (c == '/') j = i + 9;
263 else if (i >= j) continue;
264 else if (c >= 'a' && c <= 'z') c += 'A' - 'a';
265 else if ((c < 'A' || c > 'Z') && (c < '0' || c > '9')) c = '_';
266 buffer[i++] = c;
267 }
268 buffer[i] = 0;
269 return buffer;
270 }
272 static uint8_t *hash_file(const char *filename)
273 {
274 int src_fd, count;
275 uint8_t in_buf[4096];
276 static uint8_t hash_value[16*2+1];
278 src_fd = open(filename, O_RDONLY);
279 if (src_fd < 0) {
280 src_fd = open(unrockridge(filename), O_RDONLY);
281 }
282 if (src_fd < 0) {
283 return NULL;
284 }
286 md5_begin();
287 while ((count = read(src_fd, in_buf, 4096)) > 0) {
288 md5_hash(in_buf, count);
289 }
291 close(src_fd);
293 if (count)
294 return NULL;
296 md5_end();
297 bin2hex((char *)hash_value);
299 return hash_value;
300 }
302 int main(int argc, char **argv)
303 {
304 int files = 0, tested = 0, good = 0;
305 static char clear_eol[] = " ";
307 (void) argc;
308 /* -c implied */
309 openconsole(&dev_rawcon_r, &dev_stdcon_w);
311 do {
312 FILE *fp;
313 char eol, *line, buffer[256];
314 fp = fopen(*argv,"r");
315 if (fp == NULL)
316 fp = fopen(unrockridge(*argv),"r");
318 while ((line = fgets(buffer,256,fp)) != NULL) {
319 uint8_t *hash_value;
320 char *filename_ptr, *status;
321 int len = strlen(line);
323 if (line[0] < '0')
324 continue;
325 if (line[len-1] == '\n')
326 line[len-1] = 0;
327 filename_ptr = strstr(line, " ");
328 /* handle format for binary checksums */
329 if (filename_ptr == NULL) {
330 filename_ptr = strstr(line, " *");
331 }
332 if (filename_ptr == NULL) {
333 continue;
334 }
335 *filename_ptr = '\0';
336 *++filename_ptr = '/';
337 if (filename_ptr[1] == '/')
338 filename_ptr++;
340 files++;
341 status = "NOT CHECKED";
342 eol = '\n';
343 hash_value = hash_file(filename_ptr);
344 if (hash_value) {
345 tested++;
346 status = "BROKEN";
347 if (!strcmp((char*)hash_value, line)) {
348 good++;
349 status = "OK";
350 eol = ' ';
351 }
352 }
353 printf("\r%s: %s%s%c", filename_ptr, status, clear_eol, eol);
354 }
355 fclose(fp);
356 } while (*++argv);
357 printf("\r%d files OK, %d broken, %d not checked.%s\n",
358 good, tested - good, files - tested, clear_eol);
359 }