// Copyright 2025 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #include #include #include #include #include "absl/container/linked_hash_map.h" #include "absl/functional/function_ref.h" #include "absl/strings/str_format.h" #include "absl/strings/string_view.h" #include "benchmark/benchmark.h" namespace { struct BenchmarkData { std::vector sample; size_t str_bytes = 0; explicit BenchmarkData(int size, absl::FunctionRef factory) { sample.reserve(size); for (int i = 0; i < size; ++i) { sample.push_back(factory(i)); str_bytes += sample.back().size(); } } }; void BenchmarkTryEmplaceStrings(benchmark::State& state, absl::FunctionRef factory) { BenchmarkData data(state.range(0), factory); // Make a batch around 1Mi bytes. const size_t batch_size = std::max(size_t{1}, size_t{1000000} / data.str_bytes); std::vector> sets(batch_size); while (state.KeepRunningBatch(batch_size)) { state.PauseTiming(); for (auto& set : sets) set.clear(); state.ResumeTiming(); for (auto& set : sets) { for (const auto& str : data.sample) { benchmark::DoNotOptimize(set.try_emplace(str)); } } } state.SetItemsProcessed(state.iterations() * state.range(0)); state.SetBytesProcessed(state.iterations() * data.str_bytes); } void BenchmarkInsertOrAssignStrings( benchmark::State& state, absl::FunctionRef factory) { BenchmarkData data(state.range(0), factory); // Make a batch around 1Mi bytes. const size_t batch_size = std::max(size_t{1}, 1000000 / data.str_bytes); std::vector> sets(batch_size); while (state.KeepRunningBatch(batch_size)) { state.PauseTiming(); for (auto& set : sets) set.clear(); state.ResumeTiming(); for (auto& set : sets) { for (const auto& str : data.sample) { benchmark::DoNotOptimize(set.insert_or_assign(str, 0)); } } } state.SetItemsProcessed(state.iterations() * state.range(0)); state.SetBytesProcessed(state.iterations() * data.str_bytes); } constexpr absl::string_view kFormatShort = "%10d"; constexpr absl::string_view kFormatLong = "a longer string that exceeds the SSO %10d"; void BM_TryEmplaceShortStrings_Hit(benchmark::State& state) { BenchmarkTryEmplaceStrings( state, [](int i) { return absl::StrFormat(kFormatShort, i); }); } BENCHMARK(BM_TryEmplaceShortStrings_Hit)->Range(1, 1 << 16); void BM_TryEmplaceLongStrings_Hit(benchmark::State& state) { BenchmarkTryEmplaceStrings( state, [](int i) { return absl::StrFormat(kFormatLong, i); }); } BENCHMARK(BM_TryEmplaceLongStrings_Hit)->Range(1, 1 << 16); void BM_TryEmplaceShortStrings_Miss(benchmark::State& state) { BenchmarkTryEmplaceStrings( state, [](int i) { return absl::StrFormat(kFormatShort, i % 20); }); } BENCHMARK(BM_TryEmplaceShortStrings_Miss)->Range(1, 1 << 16); void BM_TryEmplaceLongStrings_Miss(benchmark::State& state) { BenchmarkTryEmplaceStrings( state, [](int i) { return absl::StrFormat(kFormatLong, i % 20); }); } BENCHMARK(BM_TryEmplaceLongStrings_Miss)->Range(1, 1 << 16); void BM_InsertOrAssignShortStrings_Hit(benchmark::State& state) { BenchmarkInsertOrAssignStrings( state, [](int i) { return absl::StrFormat(kFormatShort, i); }); } BENCHMARK(BM_InsertOrAssignShortStrings_Hit)->Range(1, 1 << 16); void BM_InsertOrAssignLongStrings_Hit(benchmark::State& state) { BenchmarkInsertOrAssignStrings( state, [](int i) { return absl::StrFormat(kFormatLong, i); }); } BENCHMARK(BM_InsertOrAssignLongStrings_Hit)->Range(1, 1 << 16); void BM_InsertOrAssignShortStrings_Miss(benchmark::State& state) { BenchmarkInsertOrAssignStrings( state, [](int i) { return absl::StrFormat(kFormatShort, i % 20); }); } BENCHMARK(BM_InsertOrAssignShortStrings_Miss)->Range(1, 1 << 16); void BM_InsertOrAssignLongStrings_Miss(benchmark::State& state) { BenchmarkInsertOrAssignStrings( state, [](int i) { return absl::StrFormat(kFormatLong, i % 20); }); } BENCHMARK(BM_InsertOrAssignLongStrings_Miss)->Range(1, 1 << 16); } // namespace