2018-01-17 06:25:00 +00:00
|
|
|
// Modify the HashFunction variable to the one wanted to test.
|
|
|
|
//
|
|
|
|
// NOTE: The throughput measurement may be slightly lower than other measurements since we run
|
|
|
|
// through our block alignment functions as well. Be aware when comparing against other tests.
|
|
|
|
//
|
|
|
|
// ```
|
|
|
|
// zig build-exe --release-fast --library c throughput_test.zig
|
|
|
|
// ./throughput_test
|
|
|
|
// ```
|
|
|
|
|
|
|
|
const std = @import("std");
|
|
|
|
const c = @cImport({
|
|
|
|
@cInclude("time.h");
|
|
|
|
});
|
2018-04-20 07:42:52 +01:00
|
|
|
const HashFunction = @import("md5.zig").Md5;
|
2018-01-17 06:25:00 +00:00
|
|
|
|
2018-04-20 07:54:18 +01:00
|
|
|
const MiB = 1024 * 1024;
|
|
|
|
const BytesToHash = 1024 * MiB;
|
2018-01-17 06:25:00 +00:00
|
|
|
|
2018-02-01 03:48:40 +00:00
|
|
|
pub fn main() !void {
|
2018-01-17 06:25:00 +00:00
|
|
|
var stdout_file = try std.io.getStdOut();
|
|
|
|
var stdout_out_stream = std.io.FileOutStream.init(&stdout_file);
|
|
|
|
const stdout = &stdout_out_stream.stream;
|
|
|
|
|
|
|
|
var block: [HashFunction.block_size]u8 = undefined;
|
|
|
|
std.mem.set(u8, block[0..], 0);
|
|
|
|
|
|
|
|
var h = HashFunction.init();
|
|
|
|
var offset: usize = 0;
|
|
|
|
|
|
|
|
const start = c.clock();
|
|
|
|
while (offset < BytesToHash) : (offset += block.len) {
|
|
|
|
h.update(block[0..]);
|
|
|
|
}
|
|
|
|
const end = c.clock();
|
|
|
|
|
2018-04-20 07:42:52 +01:00
|
|
|
const elapsed_s = f64(end - start) / f64(c.CLOCKS_PER_SEC);
|
2018-01-17 06:25:00 +00:00
|
|
|
const throughput = u64(BytesToHash / elapsed_s);
|
|
|
|
|
2018-04-20 07:54:18 +01:00
|
|
|
try stdout.print("{}: {} MiB/s\n", @typeName(HashFunction), throughput / (1 * MiB));
|
2018-01-17 06:25:00 +00:00
|
|
|
}
|