// Copyright 2018 Hans Dembinski // // 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 #include #include struct static_tag {}; struct semi_dynamic_tag {}; struct full_dynamic_tag {}; auto make_histogram(static_tag) { using namespace boost::histogram; return make_histogram_with( std::vector(), axis::integer<>(0, 20), axis::integer<>(0, 20), axis::integer<>(0, 20) ); } auto make_histogram(semi_dynamic_tag) { using namespace boost::histogram; std::vector> axes = { axis::integer<>(0, 20), axis::integer<>(0, 20), axis::integer<>(0, 20) }; return make_histogram_with( std::vector(), axes ); } auto make_histogram(full_dynamic_tag) { using namespace boost::histogram; std::vector>> axes = { axis::integer<>(0, 20), axis::integer<>(0, 20), axis::integer<>(0, 20) }; return make_histogram_with( std::vector(), axes ); } template static void NaiveForLoop(benchmark::State& state) { auto h = make_histogram(Tag()); for (auto _ : state) { for (int i = 0 - include_extra_bins; i < h.axis(0).size() + include_extra_bins; ++i) for (int j = 0 - include_extra_bins; j < h.axis(1).size() + include_extra_bins; ++j) for (int k = 0 - include_extra_bins; k < h.axis(2).size() + include_extra_bins; ++k) benchmark::DoNotOptimize(h.at(i, j, k)); } } template static void LessNaiveForLoop(benchmark::State& state) { static_assert(!include_extra_bins, "cannot include extra bins here"); using namespace boost::histogram::literals; auto h = make_histogram(Tag()); for (auto _ : state) { for (auto i : h.axis(0_c)) for (auto j : h.axis(1_c)) for (auto k : h.axis(2_c)) benchmark::DoNotOptimize(h.at(i, j, k)); } } template static void InsiderForLoop(benchmark::State& state) { using namespace boost::histogram::literals; auto h = make_histogram(Tag()); for (auto _ : state) { for (int k = 0 - include_extra_bins, nk = h.axis(2_c).size() + include_extra_bins; k < nk; ++k) for (int j = 0 - include_extra_bins, nj = h.axis(1_c).size() + include_extra_bins; j < nj; ++j) for (int i = 0 - include_extra_bins, ni = h.axis(0_c).size() + include_extra_bins; i < ni; ++i) benchmark::DoNotOptimize(h.at(i, j, k)); } } template static void IndexedLoop(benchmark::State& state) { auto h = make_histogram(Tag()); for (auto _ : state) { for (auto x : boost::histogram::indexed(h, include_extra_bins)) { benchmark::DoNotOptimize(*x); benchmark::DoNotOptimize(x[0]); benchmark::DoNotOptimize(x[1]); benchmark::DoNotOptimize(x[2]); } } } BENCHMARK_TEMPLATE(NaiveForLoop, static_tag, false); BENCHMARK_TEMPLATE(NaiveForLoop, semi_dynamic_tag, false); BENCHMARK_TEMPLATE(NaiveForLoop, full_dynamic_tag, false); BENCHMARK_TEMPLATE(LessNaiveForLoop, static_tag, false); BENCHMARK_TEMPLATE(LessNaiveForLoop, semi_dynamic_tag, false); BENCHMARK_TEMPLATE(LessNaiveForLoop, full_dynamic_tag, false); BENCHMARK_TEMPLATE(InsiderForLoop, static_tag, false); BENCHMARK_TEMPLATE(InsiderForLoop, semi_dynamic_tag, false); BENCHMARK_TEMPLATE(InsiderForLoop, full_dynamic_tag, false); BENCHMARK_TEMPLATE(IndexedLoop, static_tag, false); BENCHMARK_TEMPLATE(IndexedLoop, semi_dynamic_tag, false); BENCHMARK_TEMPLATE(IndexedLoop, full_dynamic_tag, false); BENCHMARK_TEMPLATE(NaiveForLoop, static_tag, true); BENCHMARK_TEMPLATE(NaiveForLoop, semi_dynamic_tag, true); BENCHMARK_TEMPLATE(NaiveForLoop, full_dynamic_tag, true); BENCHMARK_TEMPLATE(InsiderForLoop, static_tag, true); BENCHMARK_TEMPLATE(InsiderForLoop, semi_dynamic_tag, true); BENCHMARK_TEMPLATE(InsiderForLoop, full_dynamic_tag, true); BENCHMARK_TEMPLATE(IndexedLoop, static_tag, true); BENCHMARK_TEMPLATE(IndexedLoop, semi_dynamic_tag, true); BENCHMARK_TEMPLATE(IndexedLoop, full_dynamic_tag, true);