mirror of
https://github.com/gabime/spdlog.git
synced 2024-12-21 08:10:43 +08:00
88 lines
2.5 KiB
C++
88 lines
2.5 KiB
C++
//
|
|
// Copyright(c) 2018 Gabi Melman.
|
|
// Distributed under the MIT License (http://opensource.org/licenses/MIT)
|
|
//
|
|
|
|
#include "benchmark/benchmark.h"
|
|
|
|
#include "spdlog/spdlog.h"
|
|
#include "spdlog/details/pattern_formatter.h"
|
|
|
|
void bench_scoped_pad(benchmark::State &state, size_t wrapped_size, spdlog::details::padding_info padinfo)
|
|
{
|
|
fmt::memory_buffer dest;
|
|
for (auto _ : state)
|
|
{
|
|
{
|
|
spdlog::details::scoped_pad p(wrapped_size, padinfo, dest);
|
|
benchmark::DoNotOptimize(p);
|
|
dest.clear();
|
|
}
|
|
}
|
|
}
|
|
|
|
void bench_formatter(benchmark::State &state, std::string pattern)
|
|
{
|
|
auto formatter = spdlog::details::make_unique<spdlog::pattern_formatter>(pattern);
|
|
fmt::memory_buffer dest;
|
|
std::string logger_name = "logger-name";
|
|
const char *text = "Hello. This is some message with length of 80 ";
|
|
|
|
spdlog::details::log_msg msg(&logger_name, spdlog::level::info, text);
|
|
// formatter->format(msg, dest);
|
|
// printf("%s\n", fmt::to_string(dest).c_str());
|
|
|
|
for (auto _ : state)
|
|
{
|
|
dest.clear();
|
|
formatter->format(msg, dest);
|
|
benchmark::DoNotOptimize(dest);
|
|
}
|
|
}
|
|
|
|
void bench_formatters()
|
|
{
|
|
// basic patterns(single flag)
|
|
std::string all_flags = "+vtPnlLaAbBcCYDmdHIMSefFprRTXzEi%";
|
|
std::vector<std::string> basic_patterns;
|
|
for (auto &flag : all_flags)
|
|
{
|
|
auto pattern = std::string("%") + flag;
|
|
benchmark::RegisterBenchmark(pattern.c_str(), bench_formatter, pattern);
|
|
// bench left padding
|
|
pattern = std::string("%16") + flag;
|
|
benchmark::RegisterBenchmark(pattern.c_str(), bench_formatter, pattern);
|
|
|
|
// bench center padding
|
|
pattern = std::string("%=16") + flag;
|
|
benchmark::RegisterBenchmark(pattern.c_str(), bench_formatter, pattern);
|
|
}
|
|
|
|
// complex patterns
|
|
std::vector<std::string> patterns = {
|
|
"[%D %X] [%l] [%n] %v",
|
|
"[%Y-%m-%d %H:%M:%S.%e] [%l] [%n] %v",
|
|
"[%Y-%m-%d %H:%M:%S.%e] [%l] [%n] [%t] %v",
|
|
};
|
|
for (auto &pattern : patterns)
|
|
{
|
|
benchmark::RegisterBenchmark(pattern.c_str(), bench_formatter, pattern)->Iterations(2500000);
|
|
}
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
|
|
if (argc > 1) // bench given pattern
|
|
{
|
|
std::string pattern = argv[1];
|
|
benchmark::RegisterBenchmark(pattern.c_str(), bench_formatter, pattern);
|
|
}
|
|
else // bench all flags
|
|
{
|
|
bench_formatters();
|
|
}
|
|
benchmark::Initialize(&argc, argv);
|
|
benchmark::RunSpecifiedBenchmarks();
|
|
}
|