spdlog/bench/spdlog-bench-mt.cpp

52 lines
1.1 KiB
C++
Raw Normal View History

2015-11-29 00:24:20 +08:00
//
// Copyright(c) 2015 Gabi Melman.
// Distributed under the MIT License (http://opensource.org/licenses/MIT)
//
2018-03-09 21:26:33 +08:00
#include "spdlog/spdlog.h"
2014-11-04 06:47:16 +08:00
#include <atomic>
2015-12-13 18:51:49 +08:00
#include <cstdlib>
2018-03-09 21:26:33 +08:00
#include <thread>
#include <vector>
2014-12-21 00:59:37 +08:00
2014-11-04 06:47:16 +08:00
using namespace std;
2014-11-05 08:36:50 +08:00
2018-03-09 21:26:33 +08:00
int main(int argc, char *argv[])
2014-11-04 06:47:16 +08:00
{
2014-12-21 08:47:04 +08:00
int thread_count = 10;
2018-03-09 21:26:33 +08:00
if (argc > 1)
2015-12-13 18:51:49 +08:00
thread_count = std::atoi(argv[1]);
2014-11-05 08:36:50 +08:00
2014-12-21 08:47:04 +08:00
int howmany = 1000000;
2014-11-04 06:47:16 +08:00
2014-12-21 08:47:04 +08:00
namespace spd = spdlog;
2014-12-21 00:59:37 +08:00
2014-12-21 08:47:04 +08:00
auto logger = spdlog::create<spd::sinks::simple_file_sink_mt>("file_logger", "logs/spd-bench-mt.txt", false);
2014-11-04 06:47:16 +08:00
2014-12-21 08:47:04 +08:00
logger->set_pattern("[%Y-%b-%d %T.%e]: %v");
2014-11-05 08:36:50 +08:00
2018-03-09 21:26:33 +08:00
std::atomic<int> msg_counter{0};
2016-09-02 22:24:40 +08:00
std::vector<thread> threads;
2014-11-05 08:36:50 +08:00
2014-12-21 08:47:04 +08:00
for (int t = 0; t < thread_count; ++t)
{
2018-03-09 21:26:33 +08:00
threads.push_back(std::thread([&]() {
2014-12-21 08:47:04 +08:00
while (true)
{
int counter = ++msg_counter;
2018-03-09 21:26:33 +08:00
if (counter > howmany)
break;
2016-07-03 08:43:55 +08:00
logger->info("spdlog message #{}: This is some text for your pleasure", counter);
2014-12-21 08:47:04 +08:00
}
}));
}
2014-11-04 06:47:16 +08:00
2018-03-09 21:26:33 +08:00
for (auto &t : threads)
2014-12-21 08:47:04 +08:00
{
t.join();
};
2014-11-05 08:36:50 +08:00
2014-12-21 08:47:04 +08:00
return 0;
2014-11-04 06:47:16 +08:00
}