1 files changed, 139 insertions, 0 deletions
diff --git a/benchmark.c b/benchmark.c
new file mode 100644
index 0000000..20344d9
--- /dev/null
+++ b/benchmark.c
@@ -0,0 +1,139 @@
+/* See LICENSE file for copyright and license details. */
+#include <libkeccak.h>
+
+#include <fcntl.h>
+#include <stdio.h>
+#include <string.h>
+#include <time.h>
+#include <unistd.h>
+
+
+#ifndef MESSAGE_FILE
+# define MESSAGE_FILE      "benchfile"
+#endif
+#ifndef MESSAGE_LEN
+# define MESSAGE_LEN       50000
+#endif
+
+
+#ifndef BITRATE
+# define BITRATE           1024
+#endif
+#ifndef CAPACITY
+# define CAPACITY          576
+#endif
+#ifndef OUTPUT
+# define OUTPUT            512
+#endif
+
+#ifndef UPDATE_RUNS
+# define UPDATE_RUNS       100
+#endif
+#ifndef FAST_SQUEEZE_RUNS
+# define FAST_SQUEEZE_RUNS 100
+#endif
+#ifndef SLOW_SQUEEZE_RUNS
+# define SLOW_SQUEEZE_RUNS 100
+#endif
+#ifndef RERUNS
+# define RERUNS            50
+#endif
+
+
+
+/**
+ * Benchmark, will print the number of nanoseconds
+ * spent with hashing algorithms and representation
+ * conversion from binary to hexadecimal. The latter
+ * can be compiled out by compiling with -DIGNORE_BEHEXING.
+ * 
+ * @return  Zero on success, 1 on error
+ */
+int
+main(void)
+{
+	char message[MESSAGE_LEN];
+	libkeccak_spec_t spec;
+	libkeccak_state_t state;
+	char hashsum[OUTPUT / 8];
+#ifndef IGNORE_BEHEXING
+	char hexsum[OUTPUT / 8 * 2 + 1];
+#endif
+	struct timespec start, end;
+	long i, r;
+
+	/* Fill message with content from the file. */
+	int fd;
+	ssize_t got;
+	size_t ptr;
+	if (fd = open(MESSAGE_FILE, O_RDONLY), fd < 0)
+		return perror("open"), 1;
+	for (ptr = 0; ptr < MESSAGE_LEN; ptr += (size_t)got)
+		if (got = read(fd, message, MESSAGE_LEN - ptr), got <= 0)
+			return perror("read"), close(fd), 1;
+	close(fd);
+
+	/* Initialise state. */
+	spec.bitrate = BITRATE;
+	spec.capacity = CAPACITY;
+	spec.output = OUTPUT;
+	if (libkeccak_state_initialise(&state, &spec))
+		return perror("libkeccak_state_initialise"), 1;
+
+	/* Get start-time. */
+	if (clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &start) < 0)
+		return perror("clock_gettime"), 1;
+
+	/* Run benchmarking loop. */
+	for (r = 0; r < RERUNS; r++) {
+		/* Updates. */
+#if UPDATE_RUNS > 0
+		for (i = 0; i < UPDATE_RUNS; i++)
+			if (libkeccak_fast_update(&state, message, MESSAGE_LEN) < 0)
+				return perror("libkeccak_update"), 1;
+#endif
+
+		/* Digest. */
+		if (libkeccak_fast_digest(&state, NULL, 0, 0, NULL, hashsum) < 0)
+			return perror("libkeccak_digest"), 1;
+#ifndef IGNORE_BEHEXING
+		libkeccak_behex_lower(hexsum, hashsum, OUTPUT / 8);
+#endif
+
+		/* Fast squeezes. */
+#if FAST_SQUEEZE_RUNS > 0
+		libkeccak_fast_squeeze(&state, FAST_SQUEEZE_RUNS);
+#endif
+
+		/* Slow squeezes. */
+#if SLOW_SQUEEZE_RUNS > 0
+		for (i = 0; i < SLOW_SQUEEZE_RUNS; i++) {
+			libkeccak_squeeze(&state, hashsum);
+# ifndef IGNORE_BEHEXING
+			libkeccak_behex_lower(hexsum, hashsum, OUTPUT / 8);
+# endif
+		}
+#endif
+	}
+
+	/* Get end-time. */
+	if (clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &end) < 0)
+		return perror("clock_gettime"), -1;
+
+	/* Print execution-time. */
+	end.tv_sec -= start.tv_sec;
+	end.tv_nsec -= start.tv_nsec;
+	if (end.tv_nsec < 0) {
+		end.tv_sec--;
+		end.tv_nsec += 1000000000L;
+	}
+	printf("%03li%09li\n", (long)(end.tv_sec), end.tv_nsec);
+
+	/* Release resources and exit. */
+	libkeccak_state_fast_destroy(&state);
+	return 0;
+
+#if (UPDATE_RUNS == 0) && (SLOW_SQUEEZE_RUNS == 0)
+	(void) i;
+#endif
+}