Support very-fast-running benchmarks

Avoid calling gettimeofday every time through the benchmarking loop, by keeping
track of how long each loop takes and doubling the number of iterations done
between time checks when they take less than 1/16'th of the total elapsed time.
This commit is contained in:
Gavin Andresen 2015-09-29 17:17:24 -04:00
parent 535ed9223d
commit 7072c544b5
No known key found for this signature in database
GPG key ID: 7588242FBE38D3A8
4 changed files with 32 additions and 4 deletions

View file

@ -7,7 +7,7 @@ bench_bench_bitcoin_SOURCES = \
bench/bench_bitcoin.cpp \ bench/bench_bitcoin.cpp \
bench/bench.cpp \ bench/bench.cpp \
bench/bench.h \ bench/bench.h \
bench/MilliSleep.cpp bench/Examples.cpp
bench_bench_bitcoin_CPPFLAGS = $(BITCOIN_INCLUDES) $(EVENT_CLFAGS) $(EVENT_PTHREADS_CFLAGS) -I$(builddir)/bench/ bench_bench_bitcoin_CPPFLAGS = $(BITCOIN_INCLUDES) $(EVENT_CLFAGS) $(EVENT_PTHREADS_CFLAGS) -I$(builddir)/bench/
bench_bench_bitcoin_LDADD = \ bench_bench_bitcoin_LDADD = \

View file

@ -6,6 +6,8 @@
#include "main.h" #include "main.h"
#include "utiltime.h" #include "utiltime.h"
// Sanity test: this should loop ten times, and
// min/max/average should be close to 100ms.
static void Sleep100ms(benchmark::State& state) static void Sleep100ms(benchmark::State& state)
{ {
while (state.KeepRunning()) { while (state.KeepRunning()) {
@ -14,3 +16,19 @@ static void Sleep100ms(benchmark::State& state)
} }
BENCHMARK(Sleep100ms); BENCHMARK(Sleep100ms);
// Extremely fast-running benchmark:
#include <math.h>
volatile double sum = 0.0; // volatile, global so not optimized away
static void Trig(benchmark::State& state)
{
double d = 0.01;
while (state.KeepRunning()) {
sum += sin(d);
d += 0.000001;
}
}
BENCHMARK(Trig);

View file

@ -36,14 +36,22 @@ BenchRunner::RunAll(double elapsedTimeForOne)
bool State::KeepRunning() bool State::KeepRunning()
{ {
double now = gettimedouble(); double now;
if (count == 0) { if (count == 0) {
beginTime = now; beginTime = now = gettimedouble();
} }
else { else {
double elapsedOne = now - lastTime; // timeCheckCount is used to avoid calling gettime most of the time,
// so benchmarks that run very quickly get consistent results.
if ((count+1)%timeCheckCount != 0) {
++count;
return true; // keep going
}
now = gettimedouble();
double elapsedOne = (now - lastTime)/timeCheckCount;
if (elapsedOne < minTime) minTime = elapsedOne; if (elapsedOne < minTime) minTime = elapsedOne;
if (elapsedOne > maxTime) maxTime = elapsedOne; if (elapsedOne > maxTime) maxTime = elapsedOne;
if (elapsedOne*timeCheckCount < maxElapsed/16) timeCheckCount *= 2;
} }
lastTime = now; lastTime = now;
++count; ++count;

View file

@ -41,10 +41,12 @@ namespace benchmark {
double beginTime; double beginTime;
double lastTime, minTime, maxTime; double lastTime, minTime, maxTime;
int64_t count; int64_t count;
int64_t timeCheckCount;
public: public:
State(std::string _name, double _maxElapsed) : name(_name), maxElapsed(_maxElapsed), count(0) { State(std::string _name, double _maxElapsed) : name(_name), maxElapsed(_maxElapsed), count(0) {
minTime = std::numeric_limits<double>::max(); minTime = std::numeric_limits<double>::max();
maxTime = std::numeric_limits<double>::min(); maxTime = std::numeric_limits<double>::min();
timeCheckCount = 1;
} }
bool KeepRunning(); bool KeepRunning();
}; };