123 lines
3.3 KiB
C++
123 lines
3.3 KiB
C++
#include <benchmark/benchmark.h>
|
|
#include <cstring>
|
|
|
|
#include "Mac/Hmac.hpp"
|
|
#include "Hash/Md4.hpp"
|
|
#include "Hash/Md5.hpp"
|
|
|
|
using namespace Chaos::Mac::Hmac;
|
|
using namespace Chaos::Hash::Md4;
|
|
using namespace Chaos::Hash::Md5;
|
|
|
|
static const char * KEY_BEGIN = "Niccolo01234567";
|
|
static const size_t KEY_LEN = strlen(KEY_BEGIN);
|
|
static const char * KEY_END = KEY_BEGIN + KEY_LEN;
|
|
|
|
static const char * DATA_BEGIN
|
|
= "All states, all powers, that have held and hold rule over men have been and are either republics or principalities.\n"
|
|
"Principalities are either hereditary, in which the family has been long established; or they are new.\n"
|
|
"The new are either entirely new, as was Milan to Francesco Sforza, or they are, as it were, members annexed to the hereditary state of the "
|
|
"prince who has acquired them, as was the kingdom of Naples to that of the King of Spain.\n"
|
|
"Such dominions thus acquired are either accustomed to live under a prince, or to live in freedom; and are acquired either by the arms of the "
|
|
"prince himself, or of others, or else by fortune or by ability.";
|
|
static const size_t DATA_LEN = strlen(DATA_BEGIN);
|
|
static const char * DATA_END = DATA_BEGIN + DATA_LEN;
|
|
|
|
static void HmacMd4_CreateComputeDeleteBench(benchmark::State & state)
|
|
{
|
|
for (auto _ : state)
|
|
{
|
|
Hmac<Md4Hasher> hmac(KEY_BEGIN, KEY_END);
|
|
hmac.Update(DATA_BEGIN, DATA_END);
|
|
Md4Hash result = hmac.Finish();
|
|
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(HmacMd4_CreateComputeDeleteBench);
|
|
|
|
static void HmacMd4_ReuseBench(benchmark::State & state)
|
|
{
|
|
Hmac<Md4Hasher> hmac;
|
|
|
|
for (auto _ : state)
|
|
{
|
|
hmac.Rekey(KEY_BEGIN, KEY_END);
|
|
hmac.Update(DATA_BEGIN, DATA_END);
|
|
Md4Hash result = hmac.Finish();
|
|
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(HmacMd4_ReuseBench);
|
|
|
|
static void HmacMd4_PartialUpdate100Bench(benchmark::State & state)
|
|
{
|
|
for (auto _ : state)
|
|
{
|
|
Hmac<Md4Hasher> hmac(KEY_BEGIN, KEY_END);
|
|
|
|
for (int i = 0; i < 100; ++i)
|
|
{
|
|
hmac.Update(DATA_BEGIN, DATA_END);
|
|
}
|
|
|
|
Md4Hash result = hmac.Finish();
|
|
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(HmacMd4_PartialUpdate100Bench);
|
|
|
|
static void HmacMd5_CreateComputeDeleteBench(benchmark::State & state)
|
|
{
|
|
for (auto _ : state)
|
|
{
|
|
Hmac<Md5Hasher> hmac(KEY_BEGIN, KEY_END);
|
|
hmac.Update(DATA_BEGIN, DATA_END);
|
|
Md5Hash result = hmac.Finish();
|
|
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(HmacMd5_CreateComputeDeleteBench);
|
|
|
|
static void HmacMd5_ReuseBench(benchmark::State & state)
|
|
{
|
|
Hmac<Md5Hasher> hmac;
|
|
|
|
for (auto _ : state)
|
|
{
|
|
hmac.Rekey(KEY_BEGIN, KEY_END);
|
|
hmac.Update(DATA_BEGIN, DATA_END);
|
|
Md5Hash result = hmac.Finish();
|
|
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(HmacMd5_ReuseBench);
|
|
|
|
static void HmacMd5_PartialUpdate100Bench(benchmark::State & state)
|
|
{
|
|
for (auto _ : state)
|
|
{
|
|
Hmac<Md5Hasher> hmac(KEY_BEGIN, KEY_END);
|
|
|
|
for (int i = 0; i < 100; ++i)
|
|
{
|
|
hmac.Update(DATA_BEGIN, DATA_END);
|
|
}
|
|
|
|
Md5Hash result = hmac.Finish();
|
|
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(HmacMd5_PartialUpdate100Bench);
|