md5 - Add subrange options
[dragonfly.git] / sbin / md5 / md5.c
blob4c44f2b0667ae25615e54717e6a95579f9d88fc6
1 /*
2 * Derived from:
4 * MDDRIVER.C - test driver for MD2, MD4 and MD5
6 * $FreeBSD: src/sbin/md5/md5.c,v 1.35 2006/01/17 15:35:57 phk Exp $
7 * $DragonFly: src/sbin/md5/md5.c,v 1.4 2008/01/16 14:18:57 matthias Exp $
8 */
11 * Copyright (C) 1990-2, RSA Data Security, Inc. Created 1990. All
12 * rights reserved.
14 * RSA Data Security, Inc. makes no representations concerning either
15 * the merchantability of this software or the suitability of this
16 * software for any particular purpose. It is provided "as is"
17 * without express or implied warranty of any kind.
19 * These notices must be retained in any copies of any part of this
20 * documentation and/or software.
23 #include <sys/cdefs.h>
25 #include <fcntl.h>
26 #include <sys/types.h>
27 #include <sys/stat.h>
28 #include <sys/time.h>
29 #include <sys/resource.h>
30 #include <err.h>
31 #include <sys/mman.h>
32 #include <md5.h>
33 #include <ripemd.h>
34 #include <sha.h>
35 #include <sha256.h>
36 #include <stdio.h>
37 #include <stdlib.h>
38 #include <string.h>
39 #include <time.h>
40 #include <unistd.h>
41 #include <sysexits.h>
44 * Length of test block, number of test blocks.
46 #define TEST_BLOCK_LEN 10000
47 #define TEST_BLOCK_COUNT 100000
48 #define MDTESTCOUNT 8
50 int qflag;
51 int rflag;
52 int sflag;
54 typedef void (DIGEST_Init)(void *);
55 typedef void (DIGEST_Update)(void *, const unsigned char *, size_t);
56 typedef char *(DIGEST_End)(void *, char *);
58 extern const char *MD5TestOutput[MDTESTCOUNT];
59 extern const char *SHA1_TestOutput[MDTESTCOUNT];
60 extern const char *SHA256_TestOutput[MDTESTCOUNT];
61 extern const char *RIPEMD160_TestOutput[MDTESTCOUNT];
63 typedef struct Algorithm_t {
64 const char *progname;
65 const char *name;
66 const char *(*TestOutput)[MDTESTCOUNT];
67 DIGEST_Init *Init;
68 DIGEST_Update *Update;
69 DIGEST_End *End;
70 char *(*Data)(const void *, unsigned int, char *);
71 char *(*File)(const char *, char *);
72 } Algorithm_t;
74 static void MD5_Update(MD5_CTX *, const unsigned char *, size_t);
75 static void MDString(Algorithm_t *, const char *);
76 static void MDTimeTrial(Algorithm_t *);
77 static void MDTestSuite(Algorithm_t *);
78 static void MDFilter(Algorithm_t *, int);
79 static void usage(int excode);
81 typedef union {
82 MD5_CTX md5;
83 SHA1_CTX sha1;
84 SHA256_CTX sha256;
85 RIPEMD160_CTX ripemd160;
86 } DIGEST_CTX;
88 /* max(MD5_DIGEST_LENGTH, SHA_DIGEST_LENGTH,
89 SHA256_DIGEST_LENGTH, RIPEMD160_DIGEST_LENGTH)*2+1 */
90 #define HEX_DIGEST_LENGTH 65
92 /* algorithm function table */
94 struct Algorithm_t Algorithm[] = {
95 { "md5", "MD5", &MD5TestOutput, (DIGEST_Init*)&MD5Init,
96 (DIGEST_Update*)&MD5_Update, (DIGEST_End*)&MD5End,
97 &MD5Data, &MD5File },
98 { "sha1", "SHA1", &SHA1_TestOutput, (DIGEST_Init*)&SHA1_Init,
99 (DIGEST_Update*)&SHA1_Update, (DIGEST_End*)&SHA1_End,
100 &SHA1_Data, &SHA1_File },
101 { "sha256", "SHA256", &SHA256_TestOutput, (DIGEST_Init*)&SHA256_Init,
102 (DIGEST_Update*)&SHA256_Update, (DIGEST_End*)&SHA256_End,
103 &SHA256_Data, &SHA256_File },
104 { "rmd160", "RMD160", &RIPEMD160_TestOutput,
105 (DIGEST_Init*)&RIPEMD160_Init, (DIGEST_Update*)&RIPEMD160_Update,
106 (DIGEST_End*)&RIPEMD160_End, &RIPEMD160_Data, &RIPEMD160_File }
109 static void
110 MD5_Update(MD5_CTX *c, const unsigned char *data, size_t len)
112 MD5Update(c, data, len);
116 * There is no need to use a huge mmap, just pick something
117 * reasonable.
119 #define MAXMMAP (32*1024*1024)
121 static char *
122 digestfile(const char *fname, char *buf, const Algorithm_t *alg,
123 off_t *beginp, off_t *endp)
125 int fd;
126 struct stat st;
127 size_t size;
128 char *result = NULL;
129 void *map;
130 DIGEST_CTX context;
131 off_t end = *endp, begin = *beginp;
132 size_t pagesize;
134 fd = open(fname, O_RDONLY);
135 if (fd == -1) {
136 warn("can't open %s", fname);
137 return NULL;
140 if (fstat(fd, &st) == -1) {
141 warn("can't fstat %s after opening", fname);
142 goto cleanup;
145 /* Non-positive end means, it has to be counted from the back: */
146 if (end <= 0)
147 end += st.st_size;
148 /* Negative begin means, it has to be counted from the back: */
149 if (begin < 0)
150 begin += st.st_size;
152 if (begin < 0 || end < 0 || begin > st.st_size || end > st.st_size) {
153 warnx("%s is %jd bytes long, not large enough for the "
154 "specified offsets [%jd-%jd]", fname,
155 (intmax_t)st.st_size,
156 (intmax_t)*beginp, (intmax_t)*endp);
157 goto cleanup;
159 if (begin > end) {
160 warnx("%s is %jd bytes long. Begin-offset %jd (%jd) is "
161 "larger than end-offet %jd (%jd)",
162 fname, (intmax_t)st.st_size,
163 (intmax_t)begin, (intmax_t)*beginp,
164 (intmax_t)end, (intmax_t)*endp);
165 goto cleanup;
168 if (*endp <= 0)
169 *endp = end;
170 if (*beginp < 0)
171 *beginp = begin;
173 pagesize = getpagesize();
175 alg->Init(&context);
177 do {
178 if (end - begin > MAXMMAP)
179 size = MAXMMAP;
180 else
181 size = end - begin;
183 map = mmap(NULL, size, PROT_READ, MAP_NOCORE, fd, begin);
184 if (map == MAP_FAILED) {
185 warn("mmaping of %s between %jd and %jd ",
186 fname, (intmax_t)begin, (intmax_t)begin + size);
187 goto cleanup;
190 * Try to give kernel a hint. Not that it
191 * cares at the time of this writing :-(
193 if (size > pagesize)
194 madvise(map, size, MADV_SEQUENTIAL);
195 alg->Update(&context, map, size);
196 munmap(map, size);
197 begin += size;
198 } while (begin < end);
200 result = alg->End(&context, buf);
202 cleanup:
203 close(fd);
204 return result;
207 static off_t
208 parseint(const char *arg)
210 double result; /* Use double to allow things like 0.5Kb */
211 char *endp;
213 result = strtod(arg, &endp);
214 switch (endp[0]) {
215 case 'T':
216 case 't':
217 result *= 1024; /* FALLTHROUGH */
218 case 'M':
219 case 'm':
220 result *= 1024; /* FALLTHROUGH */
221 case 'K':
222 case 'k':
223 endp++;
224 if (endp[1] == 'b' || endp[1] == 'B')
225 endp++;
226 result *= 1024; /* FALLTHROUGH */
227 case '\0':
228 break;
229 default:
230 warnx("%c (%d): unrecognized suffix", endp[0], (int)endp[0]);
231 goto badnumber;
234 if (endp[0] == '\0')
235 return result;
237 badnumber:
238 errx(EX_USAGE, "`%s' is not a valid offset.", arg);
241 /* Main driver.
243 Arguments (may be any combination):
244 -sstring - digests string
245 -t - runs time trial
246 -x - runs test script
247 filename - digests file
248 (none) - digests standard input
251 main(int argc, char *argv[])
253 int ch;
254 char *p;
255 char buf[HEX_DIGEST_LENGTH];
256 int failed, useoffsets = 0;
257 off_t begin = 0, end = 0; /* To shut compiler warning */
258 unsigned digest;
259 const char* progname;
261 if ((progname = strrchr(argv[0], '/')) == NULL)
262 progname = argv[0];
263 else
264 progname++;
266 for (digest = 0; digest < sizeof(Algorithm)/sizeof(*Algorithm); digest++)
267 if (strcasecmp(Algorithm[digest].progname, progname) == 0)
268 break;
270 if (digest == sizeof(Algorithm)/sizeof(*Algorithm))
271 digest = 0;
273 failed = 0;
274 while ((ch = getopt(argc, argv, "hb:e:pqrs:tx")) != -1) {
275 switch (ch) {
276 case 'b':
277 begin = parseint(optarg);
278 useoffsets = 1;
279 break;
280 case 'e':
281 end = parseint(optarg);
282 useoffsets = 1;
283 break;
284 case 'p':
285 MDFilter(&Algorithm[digest], 1);
286 break;
287 case 'q':
288 qflag = 1;
289 break;
290 case 'r':
291 rflag = 1;
292 break;
293 case 's':
294 sflag = 1;
295 MDString(&Algorithm[digest], optarg);
296 break;
297 case 't':
298 MDTimeTrial(&Algorithm[digest]);
299 break;
300 case 'x':
301 MDTestSuite(&Algorithm[digest]);
302 break;
303 case 'h':
304 usage(EX_OK);
305 default:
306 usage(EX_USAGE);
309 argc -= optind;
310 argv += optind;
312 if (*argv) {
313 do {
314 if (useoffsets)
315 p = digestfile(*argv, buf, Algorithm + digest,
316 &begin, &end);
317 else
318 p = Algorithm[digest].File(*argv, buf);
319 if (!p) {
320 /* digestfile() outputs its own diagnostics */
321 if (!useoffsets)
322 warn("%s", *argv);
323 failed++;
324 } else {
325 if (qflag) {
326 printf("%s\n", p);
327 } else if (rflag) {
328 if (useoffsets)
329 printf("%s %s[%jd-%jd]\n",
330 p, *argv,
331 (intmax_t)begin,
332 (intmax_t)end);
333 else
334 printf("%s %s\n",
335 p, *argv);
336 } else if (useoffsets) {
337 printf("%s (%s[%jd-%jd]) = %s\n",
338 Algorithm[digest].name, *argv,
339 (intmax_t)begin,
340 (intmax_t)end,
342 } else {
343 printf("%s (%s) = %s\n",
344 Algorithm[digest].name,
345 *argv, p);
348 } while (*++argv);
349 } else if (!sflag && (optind == 1 || qflag || rflag))
350 MDFilter(&Algorithm[digest], 0);
352 if (failed != 0)
353 return (EX_NOINPUT);
355 return (0);
358 * Digests a string and prints the result.
360 static void
361 MDString(Algorithm_t *alg, const char *string)
363 size_t len = strlen(string);
364 char buf[HEX_DIGEST_LENGTH];
366 if (qflag)
367 printf("%s\n", alg->Data(string, len, buf));
368 else if (rflag)
369 printf("%s \"%s\"\n", alg->Data(string, len, buf), string);
370 else
371 printf("%s (\"%s\") = %s\n", alg->name, string, alg->Data(string, len, buf));
374 * Measures the time to digest TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte blocks.
376 static void
377 MDTimeTrial(Algorithm_t *alg)
379 DIGEST_CTX context;
380 struct rusage before, after;
381 struct timeval total;
382 float seconds;
383 unsigned char block[TEST_BLOCK_LEN];
384 unsigned int i;
385 char *p, buf[HEX_DIGEST_LENGTH];
387 printf
388 ("%s time trial. Digesting %d %d-byte blocks ...",
389 alg->name, TEST_BLOCK_COUNT, TEST_BLOCK_LEN);
390 fflush(stdout);
392 /* Initialize block */
393 for (i = 0; i < TEST_BLOCK_LEN; i++)
394 block[i] = (unsigned char) (i & 0xff);
396 /* Start timer */
397 getrusage(0, &before);
399 /* Digest blocks */
400 alg->Init(&context);
401 for (i = 0; i < TEST_BLOCK_COUNT; i++)
402 alg->Update(&context, block, TEST_BLOCK_LEN);
403 p = alg->End(&context, buf);
405 /* Stop timer */
406 getrusage(0, &after);
407 timersub(&after.ru_utime, &before.ru_utime, &total);
408 seconds = total.tv_sec + (float) total.tv_usec / 1000000;
410 printf(" done\n");
411 printf("Digest = %s", p);
412 printf("\nTime = %f seconds\n", seconds);
413 printf
414 ("Speed = %f bytes/second\n",
415 (float) TEST_BLOCK_LEN * (float) TEST_BLOCK_COUNT / seconds);
418 * Digests a reference suite of strings and prints the results.
421 const char *MDTestInput[MDTESTCOUNT] = {
422 "",
423 "a",
424 "abc",
425 "message digest",
426 "abcdefghijklmnopqrstuvwxyz",
427 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
428 "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
429 "MD5 has not yet (2001-09-03) been broken, but sufficient attacks have been made \
430 that its security is in some doubt"
433 const char *MD5TestOutput[MDTESTCOUNT] = {
434 "d41d8cd98f00b204e9800998ecf8427e",
435 "0cc175b9c0f1b6a831c399e269772661",
436 "900150983cd24fb0d6963f7d28e17f72",
437 "f96b697d7cb7938d525a2f31aaf161d0",
438 "c3fcd3d76192e4007dfb496cca67e13b",
439 "d174ab98d277d9f5a5611c2c9f419d9f",
440 "57edf4a22be3c955ac49da2e2107b67a",
441 "b50663f41d44d92171cb9976bc118538"
444 const char *SHA1_TestOutput[MDTESTCOUNT] = {
445 "da39a3ee5e6b4b0d3255bfef95601890afd80709",
446 "86f7e437faa5a7fce15d1ddcb9eaeaea377667b8",
447 "a9993e364706816aba3e25717850c26c9cd0d89d",
448 "c12252ceda8be8994d5fa0290a47231c1d16aae3",
449 "32d10c7b8cf96570ca04ce37f2a19d84240d3a89",
450 "761c457bf73b14d27e9e9265c46f4b4dda11f940",
451 "50abf5706a150990a08b2c5ea40fa0e585554732",
452 "18eca4333979c4181199b7b4fab8786d16cf2846"
455 const char *SHA256_TestOutput[MDTESTCOUNT] = {
456 "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
457 "ca978112ca1bbdcafac231b39a23dc4da786eff8147c4e72b9807785afee48bb",
458 "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad",
459 "f7846f55cf23e14eebeab5b4e1550cad5b509e3348fbc4efa3a1413d393cb650",
460 "71c480df93d6ae2f1efad1447c66c9525e316218cf51fc8d9ed832f2daf18b73",
461 "db4bfcbd4da0cd85a60c3c37d3fbd8805c77f15fc6b1fdfe614ee0a7c8fdb4c0",
462 "f371bc4a311f2b009eef952dd83ca80e2b60026c8e935592d0f9c308453c813e",
463 "e6eae09f10ad4122a0e2a4075761d185a272ebd9f5aa489e998ff2f09cbfdd9f"
466 const char *RIPEMD160_TestOutput[MDTESTCOUNT] = {
467 "9c1185a5c5e9fc54612808977ee8f548b2258d31",
468 "0bdc9d2d256b3ee9daae347be6f4dc835a467ffe",
469 "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc",
470 "5d0689ef49d2fae572b881b123a85ffa21595f36",
471 "f71c27109c692c1b56bbdceb5b9d2865b3708dbc",
472 "b0e20b6e3116640286ed3a87a5713079b21f5189",
473 "9b752e45573d4b39f4dbd3323cab82bf63326bfb",
474 "5feb69c6bf7c29d95715ad55f57d8ac5b2b7dd32"
477 static void
478 MDTestSuite(Algorithm_t *alg)
480 int i;
481 char buffer[HEX_DIGEST_LENGTH];
483 printf("%s test suite:\n", alg->name);
484 for (i = 0; i < MDTESTCOUNT; i++) {
485 (*alg->Data)(MDTestInput[i], strlen(MDTestInput[i]), buffer);
486 printf("%s (\"%s\") = %s", alg->name, MDTestInput[i], buffer);
487 if (strcmp(buffer, (*alg->TestOutput)[i]) == 0)
488 printf(" - verified correct\n");
489 else
490 printf(" - INCORRECT RESULT!\n");
495 * Digests the standard input and prints the result.
497 static void
498 MDFilter(Algorithm_t *alg, int tee)
500 DIGEST_CTX context;
501 unsigned int len;
502 unsigned char buffer[BUFSIZ];
503 char buf[HEX_DIGEST_LENGTH];
505 alg->Init(&context);
506 while ((len = fread(buffer, 1, BUFSIZ, stdin))) {
507 if (tee && len != fwrite(buffer, 1, len, stdout))
508 err(1, "stdout");
509 alg->Update(&context, buffer, len);
511 printf("%s\n", alg->End(&context, buf));
514 static void
515 usage(int excode)
517 fprintf(stderr, "usage:\n\t%s [-pqrtx] [-b offset] [-e offset] "
518 "[-s string] [files ...]\n", getprogname());
519 exit(excode);