mirror of
https://github.com/catchorg/Catch2.git
synced 2025-05-02 05:13:51 +00:00
e1e6872c4c
This is both a really big and a really small commit. It is small in
that it only contains renaming, moving and modification of include
directives caused by this.
It is really big in the obvious way of touching something like 200
files.
The new rules for naming files is simple: headers use the `.hpp`
extension. The rules for physical file layout is still kinda in
progress, but the basics are also simple:
* Significant parts of functionality get their own subfolder
* Benchmarking is in `catch2/benchmark`
* Matchers are in `catch2/matchers`
* Generators are in `catch2/generators`
* Reporters are in `catch2/reporters`
* Baseline testing facilities are in `catch2/`
* Various top level folders also contain `internal` subfolder,
with files that users probably do not want to include directly,
at least not until they have to write something like their own
reporter.
* The exact files in these subfolders is likely to change later
on
Note that while some includes were cleaned up in this commit, it
is only the low hanging fruit and further cleanup using automatic
tooling will happen later.
Also note that various include guards, copyright notices and file
headers will also be standardized later, rather than in this commit.
75 lines
2.5 KiB
C++
75 lines
2.5 KiB
C++
/*
|
|
* Created by Phil on 05/08/2013.
|
|
* Copyright 2013 Two Blue Cubes Ltd. All rights reserved.
|
|
*
|
|
* Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
* file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
*/
|
|
|
|
#include <catch2/catch_timer.hpp>
|
|
|
|
#include <chrono>
|
|
|
|
static const uint64_t nanosecondsInSecond = 1000000000;
|
|
|
|
namespace Catch {
|
|
|
|
auto getCurrentNanosecondsSinceEpoch() -> uint64_t {
|
|
return std::chrono::duration_cast<std::chrono::nanoseconds>( std::chrono::high_resolution_clock::now().time_since_epoch() ).count();
|
|
}
|
|
|
|
namespace {
|
|
auto estimateClockResolution() -> uint64_t {
|
|
uint64_t sum = 0;
|
|
static const uint64_t iterations = 1000000;
|
|
|
|
auto startTime = getCurrentNanosecondsSinceEpoch();
|
|
|
|
for( std::size_t i = 0; i < iterations; ++i ) {
|
|
|
|
uint64_t ticks;
|
|
uint64_t baseTicks = getCurrentNanosecondsSinceEpoch();
|
|
do {
|
|
ticks = getCurrentNanosecondsSinceEpoch();
|
|
} while( ticks == baseTicks );
|
|
|
|
auto delta = ticks - baseTicks;
|
|
sum += delta;
|
|
|
|
// If we have been calibrating for over 3 seconds -- the clock
|
|
// is terrible and we should move on.
|
|
// TBD: How to signal that the measured resolution is probably wrong?
|
|
if (ticks > startTime + 3 * nanosecondsInSecond) {
|
|
return sum / ( i + 1u );
|
|
}
|
|
}
|
|
|
|
// We're just taking the mean, here. To do better we could take the std. dev and exclude outliers
|
|
// - and potentially do more iterations if there's a high variance.
|
|
return sum/iterations;
|
|
}
|
|
}
|
|
auto getEstimatedClockResolution() -> uint64_t {
|
|
static auto s_resolution = estimateClockResolution();
|
|
return s_resolution;
|
|
}
|
|
|
|
void Timer::start() {
|
|
m_nanoseconds = getCurrentNanosecondsSinceEpoch();
|
|
}
|
|
auto Timer::getElapsedNanoseconds() const -> uint64_t {
|
|
return getCurrentNanosecondsSinceEpoch() - m_nanoseconds;
|
|
}
|
|
auto Timer::getElapsedMicroseconds() const -> uint64_t {
|
|
return getElapsedNanoseconds()/1000;
|
|
}
|
|
auto Timer::getElapsedMilliseconds() const -> unsigned int {
|
|
return static_cast<unsigned int>(getElapsedMicroseconds()/1000);
|
|
}
|
|
auto Timer::getElapsedSeconds() const -> double {
|
|
return getElapsedMicroseconds()/1000000.0;
|
|
}
|
|
|
|
|
|
} // namespace Catch
|