/*
 * Derived from:
 *
 * MDDRIVER.C - test driver for MD2, MD4 and MD5
 *
 * $FreeBSD: src/sbin/md5/md5.c,v 1.35 2006/01/17 15:35:57 phk Exp $
 */

/*
 *  Copyright (C) 1990-2, RSA Data Security, Inc. Created 1990. All
 *  rights reserved.
 *
 *  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 <sys/types.h>
#include <sys/mman.h>
#include <sys/resource.h>
#include <sys/stat.h>
#include <sys/time.h>

#include <err.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sysexits.h>
#include <time.h>
#include <unistd.h>

#include <openssl/md5.h>
#include <openssl/ripemd.h>
#include <openssl/sha.h>

/*
 * Length of test block, number of test blocks.
 */
#define TEST_BLOCK_LEN		10000
#define TEST_BLOCK_COUNT	100000
#define MDTESTCOUNT		8

static int qflag;
static int rflag;
static int sflag;

typedef int (DIGEST_Init)(void *);
typedef int (DIGEST_Update)(void *, const unsigned char *, size_t);
typedef int (DIGEST_Final)(unsigned char *, void *);

extern const char *MD5_TestOutput[MDTESTCOUNT];
extern const char *SHA1_TestOutput[MDTESTCOUNT];
extern const char *SHA256_TestOutput[MDTESTCOUNT];
extern const char *SHA512_TestOutput[MDTESTCOUNT];
extern const char *RIPEMD160_TestOutput[MDTESTCOUNT];

typedef struct Algorithm_t {
	const char *progname;
	const char *name;
	const char *(*TestOutput)[MDTESTCOUNT];
	DIGEST_Init *Init;
	DIGEST_Update *Update;
	DIGEST_Final *Final;
	int Digest_length;
} Algorithm_t;

static void MDString(const Algorithm_t *, const char *);
static void MDTimeTrial(const Algorithm_t *);
static void MDTestSuite(const Algorithm_t *);
static void MDFilter(const Algorithm_t *, int);
static void usage(int excode) __dead2;

typedef union {
	MD5_CTX md5;
	SHA_CTX sha1;
	SHA256_CTX sha256;
	SHA512_CTX sha512;
	RIPEMD160_CTX ripemd160;
} DIGEST_CTX;

/* max(MD5_DIGEST_LENGTH, SHA_DIGEST_LENGTH,
	SHA256_DIGEST_LENGTH, SHA512_DIGEST_LENGTH,
	RIPEMD160_DIGEST_LENGTH)*2+1 */
#define HEX_DIGEST_LENGTH 129

/* algorithm function table */

static const struct Algorithm_t Algorithm[] = {
	{ "md5", "MD5",
	  &MD5_TestOutput,
	  (DIGEST_Init *)MD5_Init,
	  (DIGEST_Update *)MD5_Update,
	  (DIGEST_Final *)MD5_Final,
	  MD5_DIGEST_LENGTH },
	{ "sha1", "SHA1",
	  &SHA1_TestOutput,
	  (DIGEST_Init *)SHA1_Init,
	  (DIGEST_Update *)SHA1_Update,
	  (DIGEST_Final *)SHA1_Final,
	  SHA_DIGEST_LENGTH },
	{ "sha256", "SHA256",
	  &SHA256_TestOutput,
	  (DIGEST_Init *)SHA256_Init,
	  (DIGEST_Update *)SHA256_Update,
	  (DIGEST_Final *)SHA256_Final,
	  SHA256_DIGEST_LENGTH },
	{ "sha512", "SHA512",
	  &SHA512_TestOutput,
	  (DIGEST_Init *)SHA512_Init,
	  (DIGEST_Update *)SHA512_Update,
	  (DIGEST_Final *)SHA512_Final,
	  SHA512_DIGEST_LENGTH },
	{ "rmd160", "RMD160",
	  &RIPEMD160_TestOutput,
	  (DIGEST_Init *)RIPEMD160_Init,
	  (DIGEST_Update *)RIPEMD160_Update,
	  (DIGEST_Final *)RIPEMD160_Final,
	  RIPEMD160_DIGEST_LENGTH },
	{ 0 },
};

/*
 * There is no need to use a huge mmap, just pick something
 * reasonable.
 */
#define MAXMMAP	(32*1024*1024)

static char *
digestend(const Algorithm_t *alg, DIGEST_CTX *context, char * const buf)
{
	static const char hex[] = "0123456789abcdef";
	unsigned char digest[HEX_DIGEST_LENGTH];
	int i;

	alg->Final(digest, context);
	for (i = 0; i < alg->Digest_length; i++) {
		buf[2*i] = hex[digest[i] >> 4];
		buf[2*i+1] = hex[digest[i] & 0x0f];
	}
	buf[2*i] = '\0';

	return buf;
}

static char *
digestdata(const Algorithm_t *alg, const void *data, unsigned int len,
	   char * const buf)
{
	DIGEST_CTX context;

	alg->Init(&context);
	alg->Update(&context, data, len);
	return (digestend(alg, &context, buf));
}

/*
 * Digest the whole file.  Don't rely on the file size (st_size), which may
 * be zero and meaningless for files on pseudo filesystems (e.g., /proc).
 * Instead, read the file until EOF to get the whole contents.
 */
static char *
digestbig(const char *fname, char * const buf, const Algorithm_t *alg)
{
	int		 fd;
	char		*result;
	unsigned char	 buffer[4096];
	DIGEST_CTX	 context;
	ssize_t		 bytes;

	fd = open(fname, O_RDONLY);
	if (fd == -1) {
		warn("can't open %s", fname);
		return NULL;
	}

	alg->Init(&context);

	while ((bytes = read(fd, buffer, sizeof(buffer))) > 0)
		alg->Update(&context, buffer, (size_t)bytes);
	if (bytes == 0) /* EOF */
		result = digestend(alg, &context, buf);
	else
		result = NULL;

	close(fd);
	return result;
}

static char *
digestfile(const char *fname, char *buf, const Algorithm_t *alg,
	   off_t *beginp, off_t *endp)
{
	int		 fd;
	struct stat	 st;
	size_t		 size, pagesize;
	char		*result = NULL;
	void		*map;
	DIGEST_CTX	 context;
	off_t		 end = *endp, begin = *beginp;

	fd = open(fname, O_RDONLY);
	if (fd == -1) {
		warn("can't open %s", fname);
		return NULL;
	}

	if (fstat(fd, &st) == -1) {
		warn("can't fstat %s after opening", fname);
		goto cleanup;
	}

	/* Non-positive end means, it has to be counted from the back:	*/
	if (end <= 0)
		end += st.st_size;
	/* Negative begin means, it has to be counted from the back:	*/
	if (begin < 0)
		begin += st.st_size;

	if (begin < 0 || end < 0 || begin > st.st_size || end > st.st_size) {
		warnx("%s is %jd bytes long, not large enough for the "
		      "specified offsets [%jd-%jd]",
		      fname, (intmax_t)st.st_size,
		      (intmax_t)*beginp, (intmax_t)*endp);
		goto cleanup;
	}
	if (begin > end) {
		warnx("%s is %jd bytes long. Begin-offset %jd (%jd) is "
		      "larger than end-offset %jd (%jd)",
		      fname, (intmax_t)st.st_size, (intmax_t)begin,
		      (intmax_t)*beginp, (intmax_t)end, (intmax_t)*endp);
		goto cleanup;
	}

	if (*endp <= 0)
		*endp = end;
	if (*beginp < 0)
		*beginp = begin;

	pagesize = getpagesize();

	alg->Init(&context);

	do {
		if (end - begin > MAXMMAP)
			size = MAXMMAP;
		else
			size = end - begin;

		map = mmap(NULL, size, PROT_READ, MAP_NOCORE, fd, begin);
		if (map == MAP_FAILED) {
			warn("mmaping of %s between %jd and %jd ",
			     fname, (intmax_t)begin, (intmax_t)begin + size);
			goto cleanup;
		}
		/*
		 * Try to give kernel a hint. Not that it
		 * cares at the time of this writing :-(
		 */
		if (size > pagesize)
			madvise(map, size, MADV_SEQUENTIAL);
		alg->Update(&context, map, size);
		munmap(map, size);
		begin += size;
	} while (begin < end);

	result = digestend(alg, &context, buf);

cleanup:
	close(fd);
	return result;
}

static off_t
parseint(const char *arg)
{
	double	 result; /* Use double to allow things like 0.5Kb */
	char	*endp;

	result = strtod(arg, &endp);
	switch (endp[0]) {
	case 'T':
	case 't':
		result *= 1024;
		/* FALLTHROUGH */
	case 'M':
	case 'm':
		result *= 1024;
		/* FALLTHROUGH */
	case 'K':
	case 'k':
		endp++;
		if (endp[1] == 'b' || endp[1] == 'B')
			endp++;
		result *= 1024;
		/* FALLTHROUGH */
	case '\0':
		break;
	default:
		warnx("%c (%d): unrecognized suffix", endp[0], (int)endp[0]);
		goto badnumber;
	}

	if (endp[0] == '\0')
		return result;

badnumber:
	errx(EX_USAGE, "`%s' is not a valid offset.", arg);
}

/*
 * Main driver.
 *
 * Arguments (may be any combination):
 *   -sstring - digests string
 *   -t       - runs time trial
 *   -x       - runs test script
 *   filename - digests file
 *   (none)   - digests standard input
 */
int
main(int argc, char *argv[])
{
	char			*p, buf[HEX_DIGEST_LENGTH];
	int			 ch, failed, useoffsets = 0;
	off_t			 begin = 0, end = 0;
	const char		*progname;
	const Algorithm_t	*alg;

	if ((progname = strrchr(argv[0], '/')) == NULL)
		progname = argv[0];
	else
		progname++;

	for (alg = Algorithm; alg->progname != NULL; alg++)
		if (strcasecmp(alg->progname, progname) == 0)
			break;
	if (alg->progname == NULL)
		alg = Algorithm;

	failed = 0;
	while ((ch = getopt(argc, argv, "hb:e:pqrs:tx")) != -1) {
		switch (ch) {
		case 'b':
			begin = parseint(optarg);
			useoffsets = 1;
			break;
		case 'e':
			end = parseint(optarg);
			useoffsets = 1;
			break;
		case 'p':
			MDFilter(alg, 1);
			break;
		case 'q':
			qflag = 1;
			break;
		case 'r':
			rflag = 1;
			break;
		case 's':
			sflag = 1;
			MDString(alg, optarg);
			break;
		case 't':
			MDTimeTrial(alg);
			break;
		case 'x':
			MDTestSuite(alg);
			break;
		case 'h':
			usage(EX_OK);
		default:
			usage(EX_USAGE);
		}
	}
	argc -= optind;
	argv += optind;

	if (*argv) {
		do {
			if (useoffsets)
				p = digestfile(*argv, buf, alg, &begin, &end);
			else
				p = digestbig(*argv, buf, alg);
			if (!p) {
				/* digestfile() outputs its own diagnostics */
#if 0
				if (!useoffsets)
					warn("%s", *argv);
#endif
				failed++;
			} else {
				if (qflag) {
					printf("%s\n", p);
				} else if (rflag) {
					if (useoffsets)
						printf("%s %s[%jd-%jd]\n",
						       p, *argv,
						       (intmax_t)begin,
						       (intmax_t)end);
					else
						printf("%s %s\n", p, *argv);
				} else if (useoffsets) {
					printf("%s (%s[%jd-%jd]) = %s\n",
					       alg->name, *argv,
					       (intmax_t)begin,
					       (intmax_t)end,
					       p);
				} else {
					printf("%s (%s) = %s\n",
					       alg->name, *argv, p);
				}
			}
		} while (*++argv);
	} else if (!sflag && (optind == 1 || qflag || rflag))
		MDFilter(alg, 0);

	if (failed != 0)
		return (EX_NOINPUT);

	return (0);
}

/*
 * Digests a string and prints the result.
 */
static void
MDString(const Algorithm_t *alg, const char *string)
{
	size_t len = strlen(string);
	char buf[HEX_DIGEST_LENGTH];

	if (qflag)
		printf("%s\n", digestdata(alg, string, len, buf));
	else if (rflag)
		printf("%s \"%s\"\n",
		       digestdata(alg, string, len, buf), string);
	else
		printf("%s (\"%s\") = %s\n", alg->name, string,
		       digestdata(alg, string, len, buf));
}

/*
 * Measures the time to digest TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte blocks.
 */
static void
MDTimeTrial(const Algorithm_t *alg)
{
	DIGEST_CTX context;
	struct rusage before, after;
	struct timeval total;
	float seconds;
	unsigned char block[TEST_BLOCK_LEN];
	unsigned int i;
	char *p, buf[HEX_DIGEST_LENGTH];

	printf("%s time trial. Digesting %d %d-byte blocks ...",
	       alg->name, TEST_BLOCK_COUNT, TEST_BLOCK_LEN);
	fflush(stdout);

	/* Initialize block */
	for (i = 0; i < TEST_BLOCK_LEN; i++)
		block[i] = (unsigned char) (i & 0xff);

	/* Start timer */
	getrusage(RUSAGE_SELF, &before);

	/* Digest blocks */
	alg->Init(&context);
	for (i = 0; i < TEST_BLOCK_COUNT; i++)
		alg->Update(&context, block, TEST_BLOCK_LEN);
	p = digestend(alg, &context, buf);

	/* Stop timer */
	getrusage(RUSAGE_SELF, &after);
	timersub(&after.ru_utime, &before.ru_utime, &total);
	seconds = total.tv_sec + (float) total.tv_usec / 1000000;

	printf(" done\n");
	printf("Digest = %s\n", p);
	printf("Time = %.3f seconds\n", seconds);
	printf("Speed = %.3f MiB/second\n",
	       (float) TEST_BLOCK_LEN * TEST_BLOCK_COUNT / seconds / (1 << 20));
}

/*
 * Digests a reference suite of strings and prints the results.
 */
static const char *MDTestInput[MDTESTCOUNT] = {
	"",
	"a",
	"abc",
	"message digest",
	"abcdefghijklmnopqrstuvwxyz",
	"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
	"12345678901234567890123456789012345678901234567890123456789012345678901234567890",
	("MD5 has not yet (2001-09-03) been broken, but sufficient attacks have been made "
	 "that its security is in some doubt")
};

const char *MD5_TestOutput[MDTESTCOUNT] = {
	"d41d8cd98f00b204e9800998ecf8427e",
	"0cc175b9c0f1b6a831c399e269772661",
	"900150983cd24fb0d6963f7d28e17f72",
	"f96b697d7cb7938d525a2f31aaf161d0",
	"c3fcd3d76192e4007dfb496cca67e13b",
	"d174ab98d277d9f5a5611c2c9f419d9f",
	"57edf4a22be3c955ac49da2e2107b67a",
	"b50663f41d44d92171cb9976bc118538"
};

const char *SHA1_TestOutput[MDTESTCOUNT] = {
	"da39a3ee5e6b4b0d3255bfef95601890afd80709",
	"86f7e437faa5a7fce15d1ddcb9eaeaea377667b8",
	"a9993e364706816aba3e25717850c26c9cd0d89d",
	"c12252ceda8be8994d5fa0290a47231c1d16aae3",
	"32d10c7b8cf96570ca04ce37f2a19d84240d3a89",
	"761c457bf73b14d27e9e9265c46f4b4dda11f940",
	"50abf5706a150990a08b2c5ea40fa0e585554732",
	"18eca4333979c4181199b7b4fab8786d16cf2846"
};

const char *SHA256_TestOutput[MDTESTCOUNT] = {
	"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
	"ca978112ca1bbdcafac231b39a23dc4da786eff8147c4e72b9807785afee48bb",
	"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad",
	"f7846f55cf23e14eebeab5b4e1550cad5b509e3348fbc4efa3a1413d393cb650",
	"71c480df93d6ae2f1efad1447c66c9525e316218cf51fc8d9ed832f2daf18b73",
	"db4bfcbd4da0cd85a60c3c37d3fbd8805c77f15fc6b1fdfe614ee0a7c8fdb4c0",
	"f371bc4a311f2b009eef952dd83ca80e2b60026c8e935592d0f9c308453c813e",
	"e6eae09f10ad4122a0e2a4075761d185a272ebd9f5aa489e998ff2f09cbfdd9f"
};

const char *SHA512_TestOutput[MDTESTCOUNT] = {
	"cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e",
	"1f40fc92da241694750979ee6cf582f2d5d7d28e18335de05abc54d0560e0f5302860c652bf08d560252aa5e74210546f369fbbbce8c12cfc7957b2652fe9a75",
	"ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f",
	"107dbf389d9e9f71a3a95f6c055b9251bc5268c2be16d6c13492ea45b0199f3309e16455ab1e96118e8a905d5597b72038ddb372a89826046de66687bb420e7c",
	"4dbff86cc2ca1bae1e16468a05cb9881c97f1753bce3619034898faa1aabe429955a1bf8ec483d7421fe3c1646613a59ed5441fb0f321389f77f48a879c7b1f1",
	"1e07be23c26a86ea37ea810c8ec7809352515a970e9253c26f536cfc7a9996c45c8370583e0a78fa4a90041d71a4ceab7423f19c71b9d5a3e01249f0bebd5894",
	"72ec1ef1124a45b047e8b7c75a932195135bb61de24ec0d1914042246e0aec3a2354e093d76f3048b456764346900cb130d2a4fd5dd16abb5e30bcb850dee843",
	"e8a835195e039708b13d9131e025f4441dbdc521ce625f245a436dcd762f54bf5cb298d96235e6c6a304e087ec8189b9512cbdf6427737ea82793460c367b9c3"
};

const char *RIPEMD160_TestOutput[MDTESTCOUNT] = {
	"9c1185a5c5e9fc54612808977ee8f548b2258d31",
	"0bdc9d2d256b3ee9daae347be6f4dc835a467ffe",
	"8eb208f7e05d987a9b044a8e98c6b087f15a0bfc",
	"5d0689ef49d2fae572b881b123a85ffa21595f36",
	"f71c27109c692c1b56bbdceb5b9d2865b3708dbc",
	"b0e20b6e3116640286ed3a87a5713079b21f5189",
	"9b752e45573d4b39f4dbd3323cab82bf63326bfb",
	"5feb69c6bf7c29d95715ad55f57d8ac5b2b7dd32"
};

static void
MDTestSuite(const Algorithm_t *alg)
{
	int i;
	char buffer[HEX_DIGEST_LENGTH];

	printf("%s test suite:\n", alg->name);
	for (i = 0; i < MDTESTCOUNT; i++) {
		digestdata(alg, MDTestInput[i], strlen(MDTestInput[i]), buffer);
		printf("%s (\"%s\") = %s", alg->name, MDTestInput[i], buffer);
		if (strcmp(buffer, (*alg->TestOutput)[i]) == 0)
			printf(" - verified correct\n");
		else
			printf(" - INCORRECT RESULT!\n");
	}
}

/*
 * Digests the standard input and prints the result.
 */
static void
MDFilter(const Algorithm_t *alg, int tee)
{
	DIGEST_CTX context;
	unsigned int len;
	unsigned char buffer[BUFSIZ];
	char buf[HEX_DIGEST_LENGTH];

	alg->Init(&context);
	while ((len = fread(buffer, 1, BUFSIZ, stdin))) {
		if (tee && len != fwrite(buffer, 1, len, stdout))
			err(1, "stdout");
		alg->Update(&context, buffer, len);
	}
	printf("%s\n", digestend(alg, &context, buf));
}

static void
usage(int excode)
{
	fprintf(stderr, "usage:\n\t%s [-pqrtx] [-b offset] [-e offset] "
	    "[-s string] [files ...]\n", getprogname());
	exit(excode);
}