From f7407411a1dafb9464738d10cc9b64af04a21a8c Mon Sep 17 00:00:00 2001 From: Nikolas Klauser Date: Fri, 15 Dec 2023 17:10:16 +0100 Subject: [libc++] Optimize std::find for segmented iterators (#67224) ``` -------------------------------------------------------------------------- Benchmark old new -------------------------------------------------------------------------- bm_find>/1 6.06 ns 10.6 ns bm_find>/2 15.5 ns 10.6 ns bm_find>/3 19.0 ns 10.6 ns bm_find>/4 20.8 ns 10.6 ns bm_find>/5 22.0 ns 10.6 ns bm_find>/6 23.0 ns 10.5 ns bm_find>/7 24.8 ns 10.7 ns bm_find>/8 25.7 ns 10.6 ns bm_find>/16 28.3 ns 10.6 ns bm_find>/64 44.2 ns 27.0 ns bm_find>/512 133 ns 37.6 ns bm_find>/4096 867 ns 53.1 ns bm_find>/32768 6838 ns 160 ns bm_find>/262144 52897 ns 1495 ns bm_find>/1048576 215621 ns 6077 ns bm_find>/1 6.03 ns 6.28 ns bm_find>/2 15.8 ns 15.8 ns bm_find>/3 20.5 ns 20.3 ns bm_find>/4 21.0 ns 21.0 ns bm_find>/5 23.0 ns 22.1 ns bm_find>/6 22.6 ns 23.0 ns bm_find>/7 23.4 ns 23.7 ns bm_find>/8 24.4 ns 24.9 ns bm_find>/16 26.6 ns 27.2 ns bm_find>/64 43.2 ns 40.9 ns bm_find>/512 124 ns 90.7 ns bm_find>/4096 845 ns 525 ns bm_find>/32768 7273 ns 3194 ns bm_find>/262144 53710 ns 24385 ns bm_find>/1048576 216086 ns 96195 ns bm_find>/1 6.03 ns 10.3 ns bm_find>/2 15.6 ns 10.3 ns bm_find>/3 19.1 ns 10.3 ns bm_find>/4 22.3 ns 10.3 ns bm_find>/5 23.5 ns 10.4 ns bm_find>/6 23.1 ns 10.3 ns bm_find>/7 23.7 ns 10.2 ns bm_find>/8 24.5 ns 10.2 ns bm_find>/16 27.9 ns 26.6 ns bm_find>/64 42.6 ns 32.2 ns bm_find>/512 123 ns 43.0 ns bm_find>/4096 874 ns 93.5 ns bm_find>/32768 7031 ns 751 ns bm_find>/262144 57723 ns 6169 ns bm_find>/1048576 230867 ns 35851 ns bm_ranges_find>/1 5.97 ns 10.6 ns bm_ranges_find>/2 16.0 ns 10.5 ns bm_ranges_find>/3 19.5 ns 10.5 ns bm_ranges_find>/4 21.1 ns 10.6 ns bm_ranges_find>/5 22.8 ns 10.5 ns bm_ranges_find>/6 22.8 ns 10.6 ns bm_ranges_find>/7 23.4 ns 10.8 ns bm_ranges_find>/8 24.1 ns 10.5 ns bm_ranges_find>/16 26.9 ns 10.6 ns bm_ranges_find>/64 50.2 ns 27.2 ns bm_ranges_find>/512 126 ns 38.3 ns bm_ranges_find>/4096 868 ns 53.8 ns bm_ranges_find>/32768 6695 ns 161 ns bm_ranges_find>/262144 54411 ns 1497 ns bm_ranges_find>/1048576 241699 ns 6042 ns bm_ranges_find>/1 6.39 ns 6.31 ns bm_ranges_find>/2 15.8 ns 15.9 ns bm_ranges_find>/3 19.0 ns 19.8 ns bm_ranges_find>/4 20.8 ns 20.9 ns bm_ranges_find>/5 21.8 ns 22.1 ns bm_ranges_find>/6 23.0 ns 23.0 ns bm_ranges_find>/7 23.2 ns 23.9 ns bm_ranges_find>/8 23.7 ns 24.4 ns bm_ranges_find>/16 26.6 ns 26.8 ns bm_ranges_find>/64 43.4 ns 39.7 ns bm_ranges_find>/512 131 ns 90.5 ns bm_ranges_find>/4096 851 ns 523 ns bm_ranges_find>/32768 7370 ns 3166 ns bm_ranges_find>/262144 60778 ns 24814 ns bm_ranges_find>/1048576 229288 ns 99273 ns bm_ranges_find>/1 6.43 ns 10.2 ns bm_ranges_find>/2 16.6 ns 10.2 ns bm_ranges_find>/3 19.6 ns 10.2 ns bm_ranges_find>/4 21.0 ns 10.2 ns bm_ranges_find>/5 21.9 ns 10.4 ns bm_ranges_find>/6 22.7 ns 10.2 ns bm_ranges_find>/7 23.9 ns 10.2 ns bm_ranges_find>/8 23.8 ns 10.2 ns bm_ranges_find>/16 27.2 ns 27.1 ns bm_ranges_find>/64 42.4 ns 32.4 ns bm_ranges_find>/512 122 ns 43.0 ns bm_ranges_find>/4096 895 ns 93.7 ns bm_ranges_find>/32768 6890 ns 756 ns bm_ranges_find>/262144 54025 ns 6102 ns bm_ranges_find>/1048576 221558 ns 32783 ns ``` --- libcxx/benchmarks/algorithms/find.bench.cpp | 31 +++++++++++++++++++---------- 1 file changed, 21 insertions(+), 10 deletions(-) (limited to 'libcxx/benchmarks') diff --git a/libcxx/benchmarks/algorithms/find.bench.cpp b/libcxx/benchmarks/algorithms/find.bench.cpp index b87c575..6ff2d95 100644 --- a/libcxx/benchmarks/algorithms/find.bench.cpp +++ b/libcxx/benchmarks/algorithms/find.bench.cpp @@ -9,12 +9,15 @@ #include #include #include +#include #include #include -template +template static void bm_find(benchmark::State& state) { - std::vector vec1(state.range(), '1'); + using T = Container::value_type; + + Container vec1(state.range(), '1'); std::mt19937_64 rng(std::random_device{}()); for (auto _ : state) { @@ -25,13 +28,18 @@ static void bm_find(benchmark::State& state) { vec1[idx] = '1'; } } -BENCHMARK(bm_find)->DenseRange(1, 8)->Range(16, 1 << 20); -BENCHMARK(bm_find)->DenseRange(1, 8)->Range(16, 1 << 20); -BENCHMARK(bm_find)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_find>)->DenseRange(1, 8)->Range(16, 1 << 20); -template +template static void bm_ranges_find(benchmark::State& state) { - std::vector vec1(state.range(), '1'); + using T = Container::value_type; + + Container vec1(state.range(), '1'); std::mt19937_64 rng(std::random_device{}()); for (auto _ : state) { @@ -42,9 +50,12 @@ static void bm_ranges_find(benchmark::State& state) { vec1[idx] = '1'; } } -BENCHMARK(bm_ranges_find)->DenseRange(1, 8)->Range(16, 1 << 20); -BENCHMARK(bm_ranges_find)->DenseRange(1, 8)->Range(16, 1 << 20); -BENCHMARK(bm_ranges_find)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_ranges_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_ranges_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_ranges_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_ranges_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_ranges_find>)->DenseRange(1, 8)->Range(16, 1 << 20); +BENCHMARK(bm_ranges_find>)->DenseRange(1, 8)->Range(16, 1 << 20); static void bm_vector_bool_find(benchmark::State& state) { std::vector vec1(state.range(), false); -- cgit v1.1