mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2024-12-01 01:31:26 +00:00
a55333003d
path uses string::append to construct, append, and concatenate paths. Unfortunatly string::append has a strong exception safety guaranteed and if it can't prove that the iterator operations don't throw then it will allocate a temporary string copy to append to. However this extra allocation and copy is very undesirable for path which doesn't have the same exception guarantees. To work around this this patch adds string::__append_forward_unsafe which exposes the std::string::append interface for forward iterators without enforcing that the iterator is noexcept. llvm-svn: 285532
139 lines
3.8 KiB
C++
139 lines
3.8 KiB
C++
#include <experimental/filesystem>
|
|
|
|
#include "benchmark/benchmark_api.h"
|
|
#include "GenerateInput.hpp"
|
|
#include "test_iterators.h"
|
|
|
|
namespace fs = std::experimental::filesystem;
|
|
|
|
static const size_t TestNumInputs = 1024;
|
|
|
|
|
|
template <class GenInputs>
|
|
void BM_PathConstructString(benchmark::State &st, GenInputs gen) {
|
|
using namespace fs;
|
|
const auto in = gen(st.range(0));
|
|
path PP;
|
|
for (auto& Part : in)
|
|
PP /= Part;
|
|
benchmark::DoNotOptimize(PP.native().data());
|
|
while (st.KeepRunning()) {
|
|
const path P(PP.native());
|
|
benchmark::DoNotOptimize(P.native().data());
|
|
}
|
|
}
|
|
BENCHMARK_CAPTURE(BM_PathConstructString, large_string,
|
|
getRandomStringInputs)->Arg(TestNumInputs);
|
|
|
|
|
|
template <class GenInputs>
|
|
void BM_PathConstructCStr(benchmark::State &st, GenInputs gen) {
|
|
using namespace fs;
|
|
const auto in = gen(st.range(0));
|
|
path PP;
|
|
for (auto& Part : in)
|
|
PP /= Part;
|
|
benchmark::DoNotOptimize(PP.native().data());
|
|
while (st.KeepRunning()) {
|
|
const path P(PP.native().c_str());
|
|
benchmark::DoNotOptimize(P.native().data());
|
|
}
|
|
}
|
|
BENCHMARK_CAPTURE(BM_PathConstructCStr, large_string,
|
|
getRandomStringInputs)->Arg(TestNumInputs);
|
|
|
|
|
|
template <template <class...> class ItType, class GenInputs>
|
|
void BM_PathConstructIter(benchmark::State &st, GenInputs gen) {
|
|
using namespace fs;
|
|
using Iter = ItType<std::string::const_iterator>;
|
|
const auto in = gen(st.range(0));
|
|
path PP;
|
|
for (auto& Part : in)
|
|
PP /= Part;
|
|
auto Start = Iter(PP.native().begin());
|
|
auto End = Iter(PP.native().end());
|
|
benchmark::DoNotOptimize(PP.native().data());
|
|
benchmark::DoNotOptimize(Start);
|
|
benchmark::DoNotOptimize(End);
|
|
while (st.KeepRunning()) {
|
|
const path P(Start, End);
|
|
benchmark::DoNotOptimize(P.native().data());
|
|
}
|
|
}
|
|
template <class GenInputs>
|
|
void BM_PathConstructInputIter(benchmark::State &st, GenInputs gen) {
|
|
BM_PathConstructIter<input_iterator>(st, gen);
|
|
}
|
|
template <class GenInputs>
|
|
void BM_PathConstructForwardIter(benchmark::State &st, GenInputs gen) {
|
|
BM_PathConstructIter<forward_iterator>(st, gen);
|
|
}
|
|
BENCHMARK_CAPTURE(BM_PathConstructInputIter, large_string,
|
|
getRandomStringInputs)->Arg(TestNumInputs);
|
|
BENCHMARK_CAPTURE(BM_PathConstructForwardIter, large_string,
|
|
getRandomStringInputs)->Arg(TestNumInputs);
|
|
|
|
|
|
template <class GenInputs>
|
|
void BM_PathIterateMultipleTimes(benchmark::State &st, GenInputs gen) {
|
|
using namespace fs;
|
|
const auto in = gen(st.range(0));
|
|
path PP;
|
|
for (auto& Part : in)
|
|
PP /= Part;
|
|
benchmark::DoNotOptimize(PP.native().data());
|
|
while (st.KeepRunning()) {
|
|
for (auto &E : PP) {
|
|
benchmark::DoNotOptimize(E.native().data());
|
|
}
|
|
benchmark::ClobberMemory();
|
|
}
|
|
}
|
|
BENCHMARK_CAPTURE(BM_PathIterateMultipleTimes, iterate_elements,
|
|
getRandomStringInputs)->Arg(TestNumInputs);
|
|
|
|
|
|
template <class GenInputs>
|
|
void BM_PathIterateOnce(benchmark::State &st, GenInputs gen) {
|
|
using namespace fs;
|
|
const auto in = gen(st.range(0));
|
|
path PP;
|
|
for (auto& Part : in)
|
|
PP /= Part;
|
|
benchmark::DoNotOptimize(PP.native().data());
|
|
while (st.KeepRunning()) {
|
|
const path P = PP.native();
|
|
for (auto &E : P) {
|
|
benchmark::DoNotOptimize(E.native().data());
|
|
}
|
|
benchmark::ClobberMemory();
|
|
}
|
|
}
|
|
BENCHMARK_CAPTURE(BM_PathIterateOnce, iterate_elements,
|
|
getRandomStringInputs)->Arg(TestNumInputs);
|
|
|
|
template <class GenInputs>
|
|
void BM_PathIterateOnceBackwards(benchmark::State &st, GenInputs gen) {
|
|
using namespace fs;
|
|
const auto in = gen(st.range(0));
|
|
path PP;
|
|
for (auto& Part : in)
|
|
PP /= Part;
|
|
benchmark::DoNotOptimize(PP.native().data());
|
|
while (st.KeepRunning()) {
|
|
const path P = PP.native();
|
|
const auto B = P.begin();
|
|
auto I = P.end();
|
|
while (I != B) {
|
|
--I;
|
|
benchmark::DoNotOptimize(*I);
|
|
}
|
|
benchmark::DoNotOptimize(*I);
|
|
}
|
|
}
|
|
BENCHMARK_CAPTURE(BM_PathIterateOnceBackwards, iterate_elements,
|
|
getRandomStringInputs)->Arg(TestNumInputs);
|
|
|
|
BENCHMARK_MAIN()
|