xref: /dragonfly/sbin/md5/md5.c (revision e5a92d33) 
1 /*
2  * Derived from:
3  *
4  * MDDRIVER.C - test driver for MD2, MD4 and MD5
5  *
6  * $FreeBSD: src/sbin/md5/md5.c,v 1.35 2006/01/17 15:35:57 phk Exp $
7  */
8 
9 /*
10  *  Copyright (C) 1990-2, RSA Data Security, Inc. Created 1990. All
11  *  rights reserved.
12  *
13  *  RSA Data Security, Inc. makes no representations concerning either
14  *  the merchantability of this software or the suitability of this
15  *  software for any particular purpose. It is provided "as is"
16  *  without express or implied warranty of any kind.
17  *
18  *  These notices must be retained in any copies of any part of this
19  *  documentation and/or software.
20  */
21 
22 #include <fcntl.h>
23 #include <sys/types.h>
24 #include <sys/stat.h>
25 #include <sys/time.h>
26 #include <sys/resource.h>
27 #include <err.h>
28 #include <sys/mman.h>
29 #include <stdio.h>
30 #include <stdlib.h>
31 #include <string.h>
32 #include <time.h>
33 #include <unistd.h>
34 #include <sysexits.h>
35 #include <openssl/md5.h>
36 #include <openssl/ripemd.h>
37 #include <openssl/sha.h>
38 
39 /*
40  * Length of test block, number of test blocks.
41  */
42 #define TEST_BLOCK_LEN 10000
43 #define TEST_BLOCK_COUNT 100000
44 #define MDTESTCOUNT 8
45 
46 static int qflag;
47 static int rflag;
48 static int sflag;
49 
50 typedef int (DIGEST_Init)(void *);
51 typedef int (DIGEST_Update)(void *, const unsigned char *, size_t);
52 typedef int (DIGEST_Final)(unsigned char *, void *);
53 
54 extern const char *MD5_TestOutput[MDTESTCOUNT];
55 extern const char *SHA1_TestOutput[MDTESTCOUNT];
56 extern const char *SHA256_TestOutput[MDTESTCOUNT];
57 extern const char *SHA512_TestOutput[MDTESTCOUNT];
58 extern const char *RIPEMD160_TestOutput[MDTESTCOUNT];
59 
60 typedef struct Algorithm_t {
61 	const char *progname;
62 	const char *name;
63 	const char *(*TestOutput)[MDTESTCOUNT];
64 	DIGEST_Init *Init;
65 	DIGEST_Update *Update;
66 	DIGEST_Final *Final;
67 	int Digest_length;
68 } Algorithm_t;
69 
70 static void MDString(const Algorithm_t *, const char *);
71 static void MDTimeTrial(const Algorithm_t *);
72 static void MDTestSuite(const Algorithm_t *);
73 static void MDFilter(const Algorithm_t *, int);
74 static void usage(int excode) __dead2;
75 
76 typedef union {
77 	MD5_CTX md5;
78 	SHA_CTX sha1;
79 	SHA256_CTX sha256;
80 	SHA512_CTX sha512;
81 	RIPEMD160_CTX ripemd160;
82 } DIGEST_CTX;
83 
84 /* max(MD5_DIGEST_LENGTH, SHA_DIGEST_LENGTH,
85 	SHA256_DIGEST_LENGTH, SHA512_DIGEST_LENGTH,
86 	RIPEMD160_DIGEST_LENGTH)*2+1 */
87 #define HEX_DIGEST_LENGTH 129
88 
89 /* algorithm function table */
90 
91 static const struct Algorithm_t Algorithm[] = {
92 	{ "md5", "MD5", &MD5_TestOutput, (DIGEST_Init*)&MD5_Init,
93 		(DIGEST_Update*)&MD5_Update, (DIGEST_Final*)&MD5_Final,
94 		MD5_DIGEST_LENGTH},
95 	{ "sha1", "SHA1", &SHA1_TestOutput, (DIGEST_Init*)&SHA1_Init,
96 		(DIGEST_Update*)&SHA1_Update, (DIGEST_Final*)&SHA1_Final,
97 		SHA_DIGEST_LENGTH},
98 	{ "sha256", "SHA256", &SHA256_TestOutput, (DIGEST_Init*)&SHA256_Init,
99 		(DIGEST_Update*)&SHA256_Update, (DIGEST_Final*)&SHA256_Final,
100 		SHA256_DIGEST_LENGTH},
101 	{ "sha512", "SHA512", &SHA512_TestOutput, (DIGEST_Init*)&SHA512_Init,
102 		(DIGEST_Update*)&SHA512_Update, (DIGEST_Final*)&SHA512_Final,
103 		SHA512_DIGEST_LENGTH},
104 	{ "rmd160", "RMD160", &RIPEMD160_TestOutput,
105 		(DIGEST_Init*)&RIPEMD160_Init, (DIGEST_Update*)&RIPEMD160_Update,
106 		(DIGEST_Final*)&RIPEMD160_Final, RIPEMD160_DIGEST_LENGTH}
107 };
108 
109 /*
110  * There is no need to use a huge mmap, just pick something
111  * reasonable.
112  */
113 #define MAXMMAP	(32*1024*1024)
114 
115 static char *
116 digestend(const Algorithm_t *alg, DIGEST_CTX *context, char * const buf)
117 {
118 	unsigned char digest[HEX_DIGEST_LENGTH];
119 	static const char hex[]="0123456789abcdef";
120 	int i;
121 
122 	alg->Final(digest, context);
123 	for (i = 0; i < alg->Digest_length; i++) {
124 		buf[2*i] = hex[digest[i] >> 4];
125 		buf[2*i+1] = hex[digest[i] & 0x0f];
126 	}
127 	buf[2*i] = '\0';
128 
129 	return buf;
130 }
131 
132 static char *
133 digestdata(const Algorithm_t *alg, const void *data, unsigned int len,
134 	   char * const buf)
135 {
136 	DIGEST_CTX	context;
137 
138 	alg->Init(&context);
139 	alg->Update(&context, data, len);
140 	return (digestend(alg, &context, buf));
141 }
142 
143 static char *
144 digestbig(const char *fname, char * const buf, const Algorithm_t *alg)
145 {
146 	int		 fd;
147 	struct stat	 st;
148 	char		*result = NULL;
149 	unsigned char	 buffer[4096];
150 	DIGEST_CTX	 context;
151 	off_t		 size;
152 	int		 bytes;
153 
154 	fd = open(fname, O_RDONLY);
155 	if (fd == -1) {
156 		warn("can't open %s", fname);
157 		return NULL;
158         }
159 
160 	if (fstat(fd, &st) == -1) {
161 		warn("can't fstat %s after opening", fname);
162 		goto cleanup;
163 	}
164 
165 	alg->Init(&context);
166 
167 	size = st.st_size;
168 	bytes = 0;
169 
170         while (size > 0) {
171 		if ((size_t)size > sizeof(buffer))
172 			bytes = read(fd, buffer, sizeof(buffer));
173 		else
174 			bytes = read(fd, buffer, size);
175 		if (bytes < 0)
176 			break;
177 		alg->Update(&context, buffer, bytes);
178 		size -= bytes;
179 	}
180 
181 	result = digestend(alg, &context, buf);
182 
183 cleanup:
184 	close(fd);
185 	return result;
186 }
187 
188 static char *
189 digestfile(const char *fname, char *buf, const Algorithm_t *alg,
190     off_t *beginp, off_t *endp)
191 {
192 	int		 fd;
193 	struct stat	 st;
194 	size_t		 size;
195 	char		*result = NULL;
196 	void		*map;
197 	DIGEST_CTX	 context;
198 	off_t		 end = *endp, begin = *beginp;
199 	size_t		 pagesize;
200 
201 	fd = open(fname, O_RDONLY);
202 	if (fd == -1) {
203 		warn("can't open %s", fname);
204 		return NULL;
205 	}
206 
207 	if (fstat(fd, &st) == -1) {
208 		warn("can't fstat %s after opening", fname);
209 		goto cleanup;
210 	}
211 
212 	/* Non-positive end means, it has to be counted from the back:	*/
213 	if (end <= 0)
214 		end += st.st_size;
215 	/* Negative begin means, it has to be counted from the back:	*/
216 	if (begin < 0)
217 		begin += st.st_size;
218 
219 	if (begin < 0 || end < 0 || begin > st.st_size || end > st.st_size) {
220 		warnx("%s is %jd bytes long, not large enough for the "
221 		    "specified offsets [%jd-%jd]", fname,
222 		    (intmax_t)st.st_size,
223 		    (intmax_t)*beginp, (intmax_t)*endp);
224 		goto cleanup;
225 	}
226 	if (begin > end) {
227 		warnx("%s is %jd bytes long. Begin-offset %jd (%jd) is "
228 		    "larger than end-offset %jd (%jd)",
229 		    fname, (intmax_t)st.st_size,
230 		    (intmax_t)begin, (intmax_t)*beginp,
231 		    (intmax_t)end, (intmax_t)*endp);
232 		goto cleanup;
233 	}
234 
235 	if (*endp <= 0)
236 		*endp = end;
237 	if (*beginp < 0)
238 		*beginp = begin;
239 
240 	pagesize = getpagesize();
241 
242 	alg->Init(&context);
243 
244 	do {
245 		if (end - begin > MAXMMAP)
246 			size = MAXMMAP;
247 		else
248 			size = end - begin;
249 
250 		map = mmap(NULL, size, PROT_READ, MAP_NOCORE, fd, begin);
251 		if (map == MAP_FAILED) {
252 			warn("mmaping of %s between %jd and %jd ",
253 			    fname, (intmax_t)begin, (intmax_t)begin + size);
254 			goto cleanup;
255 		}
256 		/*
257 		 * Try to give kernel a hint. Not that it
258 		 * cares at the time of this writing :-(
259 		 */
260 		if (size > pagesize)
261 			madvise(map, size, MADV_SEQUENTIAL);
262 		alg->Update(&context, map, size);
263 		munmap(map, size);
264 		begin += size;
265 	} while (begin < end);
266 
267 	result = digestend(alg, &context, buf);
268 
269 cleanup:
270 	close(fd);
271 	return result;
272 }
273 
274 static off_t
275 parseint(const char *arg)
276 {
277 	double	 result; /* Use double to allow things like 0.5Kb */
278 	char	*endp;
279 
280 	result = strtod(arg, &endp);
281 	switch (endp[0]) {
282 	case 'T':
283 	case 't':
284 		result *= 1024;	/* FALLTHROUGH */
285 	case 'M':
286 	case 'm':
287 		result *= 1024;	/* FALLTHROUGH */
288 	case 'K':
289 	case 'k':
290 		endp++;
291 		if (endp[1] == 'b' || endp[1] == 'B')
292 			endp++;
293 		result *= 1024;	/* FALLTHROUGH */
294 	case '\0':
295 		break;
296 	default:
297 		warnx("%c (%d): unrecognized suffix", endp[0], (int)endp[0]);
298 		goto badnumber;
299 	}
300 
301 	if (endp[0] == '\0')
302 		return result;
303 
304 badnumber:
305 	errx(EX_USAGE, "`%s' is not a valid offset.", arg);
306 }
307 
308 /* Main driver.
309 
310 Arguments (may be any combination):
311   -sstring - digests string
312   -t       - runs time trial
313   -x       - runs test script
314   filename - digests file
315   (none)   - digests standard input
316  */
317 int
318 main(int argc, char *argv[])
319 {
320 	int     ch;
321 	char   *p;
322 	char	buf[HEX_DIGEST_LENGTH];
323 	int     failed, useoffsets = 0;
324 	off_t   begin = 0, end = 0; /* To shut compiler warning */
325 	unsigned	digest;
326 	const char*	progname;
327 
328 	if ((progname = strrchr(argv[0], '/')) == NULL)
329 		progname = argv[0];
330 	else
331 		progname++;
332 
333 	for (digest = 0; digest < sizeof(Algorithm)/sizeof(*Algorithm); digest++)
334 		if (strcasecmp(Algorithm[digest].progname, progname) == 0)
335 			break;
336 
337 	if (digest == sizeof(Algorithm)/sizeof(*Algorithm))
338 		digest = 0;
339 
340 	failed = 0;
341 	while ((ch = getopt(argc, argv, "hb:e:pqrs:tx")) != -1) {
342 		switch (ch) {
343 		case 'b':
344 			begin = parseint(optarg);
345 			useoffsets = 1;
346 			break;
347 		case 'e':
348 			end = parseint(optarg);
349 			useoffsets = 1;
350 			break;
351 		case 'p':
352 			MDFilter(&Algorithm[digest], 1);
353 			break;
354 		case 'q':
355 			qflag = 1;
356 			break;
357 		case 'r':
358 			rflag = 1;
359 			break;
360 		case 's':
361 			sflag = 1;
362 			MDString(&Algorithm[digest], optarg);
363 			break;
364 		case 't':
365 			MDTimeTrial(&Algorithm[digest]);
366 			break;
367 		case 'x':
368 			MDTestSuite(&Algorithm[digest]);
369 			break;
370 		case 'h':
371 			usage(EX_OK);
372 		default:
373 			usage(EX_USAGE);
374 		}
375 	}
376 	argc -= optind;
377 	argv += optind;
378 
379 	if (*argv) {
380 		do {
381 			if (useoffsets)
382 				p = digestfile(*argv, buf, Algorithm + digest,
383 				    &begin, &end);
384 			else
385 				p = digestbig(*argv, buf, Algorithm + digest);
386 			if (!p) {
387 				/* digestfile() outputs its own diagnostics */
388 #if 0
389 				if (!useoffsets)
390 					warn("%s", *argv);
391 #endif
392 				failed++;
393 			} else {
394 				if (qflag) {
395 					printf("%s\n", p);
396 				} else if (rflag) {
397 					if (useoffsets)
398 						printf("%s %s[%jd-%jd]\n",
399 						       p, *argv,
400 						       (intmax_t)begin,
401 						       (intmax_t)end);
402 					else
403 						printf("%s %s\n",
404 							p, *argv);
405 				} else if (useoffsets) {
406 					printf("%s (%s[%jd-%jd]) = %s\n",
407 					       Algorithm[digest].name, *argv,
408 					       (intmax_t)begin,
409 					       (intmax_t)end,
410 					       p);
411 				} else {
412 					printf("%s (%s) = %s\n",
413 					       Algorithm[digest].name,
414 					       *argv, p);
415 				}
416 			}
417 		} while (*++argv);
418 	} else if (!sflag && (optind == 1 || qflag || rflag))
419 		MDFilter(&Algorithm[digest], 0);
420 
421 	if (failed != 0)
422 		return (EX_NOINPUT);
423 
424 	return (0);
425 }
426 
427 /*
428  * Digests a string and prints the result.
429  */
430 static void
431 MDString(const Algorithm_t *alg, const char *string)
432 {
433 	size_t len = strlen(string);
434 	char buf[HEX_DIGEST_LENGTH];
435 
436 	if (qflag)
437 		printf("%s\n", digestdata(alg, string, len, buf));
438 	else if (rflag)
439 		printf("%s \"%s\"\n",
440 			digestdata(alg, string, len, buf), string);
441 	else
442 		printf("%s (\"%s\") = %s\n", alg->name, string,
443 			digestdata(alg, string, len, buf));
444 }
445 
446 /*
447  * Measures the time to digest TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte blocks.
448  */
449 static void
450 MDTimeTrial(const Algorithm_t *alg)
451 {
452 	DIGEST_CTX context;
453 	struct rusage before, after;
454 	struct timeval total;
455 	float seconds;
456 	unsigned char block[TEST_BLOCK_LEN];
457 	unsigned int i;
458 	char *p, buf[HEX_DIGEST_LENGTH];
459 
460 	printf("%s time trial. Digesting %d %d-byte blocks ...",
461 	    alg->name, TEST_BLOCK_COUNT, TEST_BLOCK_LEN);
462 	fflush(stdout);
463 
464 	/* Initialize block */
465 	for (i = 0; i < TEST_BLOCK_LEN; i++)
466 		block[i] = (unsigned char) (i & 0xff);
467 
468 	/* Start timer */
469 	getrusage(RUSAGE_SELF, &before);
470 
471 	/* Digest blocks */
472 	alg->Init(&context);
473 	for (i = 0; i < TEST_BLOCK_COUNT; i++)
474 		alg->Update(&context, block, TEST_BLOCK_LEN);
475 	p = digestend(alg, &context, buf);
476 
477 	/* Stop timer */
478 	getrusage(RUSAGE_SELF, &after);
479 	timersub(&after.ru_utime, &before.ru_utime, &total);
480 	seconds = total.tv_sec + (float) total.tv_usec / 1000000;
481 
482 	printf(" done\n");
483 	printf("Digest = %s", p);
484 	printf("\nTime = %f seconds\n", seconds);
485 	printf("Speed = %f MiB/second\n", (float) TEST_BLOCK_LEN *
486 		(float) TEST_BLOCK_COUNT / seconds / (1 << 20));
487 }
488 
489 /*
490  * Digests a reference suite of strings and prints the results.
491  */
492 static const char *MDTestInput[MDTESTCOUNT] = {
493 	"",
494 	"a",
495 	"abc",
496 	"message digest",
497 	"abcdefghijklmnopqrstuvwxyz",
498 	"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
499 	"12345678901234567890123456789012345678901234567890123456789012345678901234567890",
500 	"MD5 has not yet (2001-09-03) been broken, but sufficient attacks have been made \
501 that its security is in some doubt"
502 };
503 
504 const char *MD5_TestOutput[MDTESTCOUNT] = {
505 	"d41d8cd98f00b204e9800998ecf8427e",
506 	"0cc175b9c0f1b6a831c399e269772661",
507 	"900150983cd24fb0d6963f7d28e17f72",
508 	"f96b697d7cb7938d525a2f31aaf161d0",
509 	"c3fcd3d76192e4007dfb496cca67e13b",
510 	"d174ab98d277d9f5a5611c2c9f419d9f",
511 	"57edf4a22be3c955ac49da2e2107b67a",
512 	"b50663f41d44d92171cb9976bc118538"
513 };
514 
515 const char *SHA1_TestOutput[MDTESTCOUNT] = {
516 	"da39a3ee5e6b4b0d3255bfef95601890afd80709",
517 	"86f7e437faa5a7fce15d1ddcb9eaeaea377667b8",
518 	"a9993e364706816aba3e25717850c26c9cd0d89d",
519 	"c12252ceda8be8994d5fa0290a47231c1d16aae3",
520 	"32d10c7b8cf96570ca04ce37f2a19d84240d3a89",
521 	"761c457bf73b14d27e9e9265c46f4b4dda11f940",
522 	"50abf5706a150990a08b2c5ea40fa0e585554732",
523 	"18eca4333979c4181199b7b4fab8786d16cf2846"
524 };
525 
526 const char *SHA256_TestOutput[MDTESTCOUNT] = {
527 	"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
528 	"ca978112ca1bbdcafac231b39a23dc4da786eff8147c4e72b9807785afee48bb",
529 	"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad",
530 	"f7846f55cf23e14eebeab5b4e1550cad5b509e3348fbc4efa3a1413d393cb650",
531 	"71c480df93d6ae2f1efad1447c66c9525e316218cf51fc8d9ed832f2daf18b73",
532 	"db4bfcbd4da0cd85a60c3c37d3fbd8805c77f15fc6b1fdfe614ee0a7c8fdb4c0",
533 	"f371bc4a311f2b009eef952dd83ca80e2b60026c8e935592d0f9c308453c813e",
534 	"e6eae09f10ad4122a0e2a4075761d185a272ebd9f5aa489e998ff2f09cbfdd9f"
535 };
536 
537 const char *SHA512_TestOutput[MDTESTCOUNT] = {
538 	"cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e",
539 	"1f40fc92da241694750979ee6cf582f2d5d7d28e18335de05abc54d0560e0f5302860c652bf08d560252aa5e74210546f369fbbbce8c12cfc7957b2652fe9a75",
540 	"ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f",
541 	"107dbf389d9e9f71a3a95f6c055b9251bc5268c2be16d6c13492ea45b0199f3309e16455ab1e96118e8a905d5597b72038ddb372a89826046de66687bb420e7c",
542 	"4dbff86cc2ca1bae1e16468a05cb9881c97f1753bce3619034898faa1aabe429955a1bf8ec483d7421fe3c1646613a59ed5441fb0f321389f77f48a879c7b1f1",
543 	"1e07be23c26a86ea37ea810c8ec7809352515a970e9253c26f536cfc7a9996c45c8370583e0a78fa4a90041d71a4ceab7423f19c71b9d5a3e01249f0bebd5894",
544 	"72ec1ef1124a45b047e8b7c75a932195135bb61de24ec0d1914042246e0aec3a2354e093d76f3048b456764346900cb130d2a4fd5dd16abb5e30bcb850dee843",
545 	"e8a835195e039708b13d9131e025f4441dbdc521ce625f245a436dcd762f54bf5cb298d96235e6c6a304e087ec8189b9512cbdf6427737ea82793460c367b9c3"
546 };
547 
548 const char *RIPEMD160_TestOutput[MDTESTCOUNT] = {
549 	"9c1185a5c5e9fc54612808977ee8f548b2258d31",
550 	"0bdc9d2d256b3ee9daae347be6f4dc835a467ffe",
551 	"8eb208f7e05d987a9b044a8e98c6b087f15a0bfc",
552 	"5d0689ef49d2fae572b881b123a85ffa21595f36",
553 	"f71c27109c692c1b56bbdceb5b9d2865b3708dbc",
554 	"b0e20b6e3116640286ed3a87a5713079b21f5189",
555 	"9b752e45573d4b39f4dbd3323cab82bf63326bfb",
556 	"5feb69c6bf7c29d95715ad55f57d8ac5b2b7dd32"
557 };
558 
559 static void
560 MDTestSuite(const Algorithm_t *alg)
561 {
562 	int i;
563 	char buffer[HEX_DIGEST_LENGTH];
564 
565 	printf("%s test suite:\n", alg->name);
566 	for (i = 0; i < MDTESTCOUNT; i++) {
567 		digestdata(alg, MDTestInput[i], strlen(MDTestInput[i]), buffer);
568 		printf("%s (\"%s\") = %s", alg->name, MDTestInput[i], buffer);
569 		if (strcmp(buffer, (*alg->TestOutput)[i]) == 0)
570 			printf(" - verified correct\n");
571 		else
572 			printf(" - INCORRECT RESULT!\n");
573 	}
574 }
575 
576 /*
577  * Digests the standard input and prints the result.
578  */
579 static void
580 MDFilter(const Algorithm_t *alg, int tee)
581 {
582 	DIGEST_CTX context;
583 	unsigned int len;
584 	unsigned char buffer[BUFSIZ];
585 	char buf[HEX_DIGEST_LENGTH];
586 
587 	alg->Init(&context);
588 	while ((len = fread(buffer, 1, BUFSIZ, stdin))) {
589 		if (tee && len != fwrite(buffer, 1, len, stdout))
590 			err(1, "stdout");
591 		alg->Update(&context, buffer, len);
592 	}
593 	printf("%s\n", digestend(alg, &context, buf));
594 }
595 
596 static void
597 usage(int excode)
598 {
599 	fprintf(stderr, "usage:\n\t%s [-pqrtx] [-b offset] [-e offset] "
600 	    "[-s string] [files ...]\n", getprogname());
601 	exit(excode);
602 }
603