535ed9223d
Benchmarking framework, loosely based on google's micro-benchmarking library (https://github.com/google/benchmark) Wny not use the Google Benchmark framework? Because adding Even More Dependencies isn't worth it. If we get a dozen or three benchmarks and need nanosecond-accurate timings of threaded code then switching to the full-blown Google Benchmark library should be considered. The benchmark framework is hard-coded to run each benchmark for one wall-clock second, and then spits out .csv-format timing information to stdout. It is left as an exercise for later (or maybe never) to add command-line arguments to specify which benchmark(s) to run, how long to run them for, how to format results, etc etc etc. Again, see the Google Benchmark framework for where that might end up. See src/bench/MilliSleep.cpp for a sanity-test benchmark that just benchmarks 'sleep 100 milliseconds.' To compile and run benchmarks: cd src; make bench Sample output: Benchmark,count,min,max,average Sleep100ms,10,0.101854,0.105059,0.103881
61 lines
1.6 KiB
C++
61 lines
1.6 KiB
C++
// Copyright (c) 2015 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
#include "bench.h"
|
|
#include <iostream>
|
|
#include <sys/time.h>
|
|
|
|
using namespace benchmark;
|
|
|
|
std::map<std::string, BenchFunction> BenchRunner::benchmarks;
|
|
|
|
static double gettimedouble(void) {
|
|
struct timeval tv;
|
|
gettimeofday(&tv, NULL);
|
|
return tv.tv_usec * 0.000001 + tv.tv_sec;
|
|
}
|
|
|
|
BenchRunner::BenchRunner(std::string name, BenchFunction func)
|
|
{
|
|
benchmarks.insert(std::make_pair(name, func));
|
|
}
|
|
|
|
void
|
|
BenchRunner::RunAll(double elapsedTimeForOne)
|
|
{
|
|
std::cout << "Benchmark" << "," << "count" << "," << "min" << "," << "max" << "," << "average" << "\n";
|
|
|
|
for (std::map<std::string,BenchFunction>::iterator it = benchmarks.begin();
|
|
it != benchmarks.end(); ++it) {
|
|
|
|
State state(it->first, elapsedTimeForOne);
|
|
BenchFunction& func = it->second;
|
|
func(state);
|
|
}
|
|
}
|
|
|
|
bool State::KeepRunning()
|
|
{
|
|
double now = gettimedouble();
|
|
if (count == 0) {
|
|
beginTime = now;
|
|
}
|
|
else {
|
|
double elapsedOne = now - lastTime;
|
|
if (elapsedOne < minTime) minTime = elapsedOne;
|
|
if (elapsedOne > maxTime) maxTime = elapsedOne;
|
|
}
|
|
lastTime = now;
|
|
++count;
|
|
|
|
if (now - beginTime < maxElapsed) return true; // Keep going
|
|
|
|
--count;
|
|
|
|
// Output results
|
|
double average = (now-beginTime)/count;
|
|
std::cout << name << "," << count << "," << minTime << "," << maxTime << "," << average << "\n";
|
|
|
|
return false;
|
|
}
|