git-subtree-dir: third_party/abseil_cpp git-subtree-mainline:ffb2ae54begit-subtree-split:768eb2ca28
		
			
				
	
	
		
			142 lines
		
	
	
	
		
			4.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			142 lines
		
	
	
	
		
			4.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| // Copyright 2019 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 "absl/functional/function_ref.h"
 | |
| 
 | |
| #include <memory>
 | |
| 
 | |
| #include "benchmark/benchmark.h"
 | |
| #include "absl/base/attributes.h"
 | |
| 
 | |
| namespace absl {
 | |
| ABSL_NAMESPACE_BEGIN
 | |
| namespace {
 | |
| 
 | |
| int dummy = 0;
 | |
| 
 | |
| void FreeFunction() { benchmark::DoNotOptimize(dummy); }
 | |
| 
 | |
| struct TrivialFunctor {
 | |
|   void operator()() const { benchmark::DoNotOptimize(dummy); }
 | |
| };
 | |
| 
 | |
| struct LargeFunctor {
 | |
|   void operator()() const { benchmark::DoNotOptimize(this); }
 | |
|   std::string a, b, c;
 | |
| };
 | |
| 
 | |
| template <typename Function, typename... Args>
 | |
| void ABSL_ATTRIBUTE_NOINLINE CallFunction(Function f, Args&&... args) {
 | |
|   f(std::forward<Args>(args)...);
 | |
| }
 | |
| 
 | |
| template <typename Function, typename Callable, typename... Args>
 | |
| void ConstructAndCallFunctionBenchmark(benchmark::State& state,
 | |
|                                        const Callable& c, Args&&... args) {
 | |
|   for (auto _ : state) {
 | |
|     CallFunction<Function>(c, std::forward<Args>(args)...);
 | |
|   }
 | |
| }
 | |
| 
 | |
| void BM_TrivialStdFunction(benchmark::State& state) {
 | |
|   ConstructAndCallFunctionBenchmark<std::function<void()>>(state,
 | |
|                                                            TrivialFunctor{});
 | |
| }
 | |
| BENCHMARK(BM_TrivialStdFunction);
 | |
| 
 | |
| void BM_TrivialFunctionRef(benchmark::State& state) {
 | |
|   ConstructAndCallFunctionBenchmark<FunctionRef<void()>>(state,
 | |
|                                                          TrivialFunctor{});
 | |
| }
 | |
| BENCHMARK(BM_TrivialFunctionRef);
 | |
| 
 | |
| void BM_LargeStdFunction(benchmark::State& state) {
 | |
|   ConstructAndCallFunctionBenchmark<std::function<void()>>(state,
 | |
|                                                            LargeFunctor{});
 | |
| }
 | |
| BENCHMARK(BM_LargeStdFunction);
 | |
| 
 | |
| void BM_LargeFunctionRef(benchmark::State& state) {
 | |
|   ConstructAndCallFunctionBenchmark<FunctionRef<void()>>(state, LargeFunctor{});
 | |
| }
 | |
| BENCHMARK(BM_LargeFunctionRef);
 | |
| 
 | |
| void BM_FunPtrStdFunction(benchmark::State& state) {
 | |
|   ConstructAndCallFunctionBenchmark<std::function<void()>>(state, FreeFunction);
 | |
| }
 | |
| BENCHMARK(BM_FunPtrStdFunction);
 | |
| 
 | |
| void BM_FunPtrFunctionRef(benchmark::State& state) {
 | |
|   ConstructAndCallFunctionBenchmark<FunctionRef<void()>>(state, FreeFunction);
 | |
| }
 | |
| BENCHMARK(BM_FunPtrFunctionRef);
 | |
| 
 | |
| // Doesn't include construction or copy overhead in the loop.
 | |
| template <typename Function, typename Callable, typename... Args>
 | |
| void CallFunctionBenchmark(benchmark::State& state, const Callable& c,
 | |
|                            Args... args) {
 | |
|   Function f = c;
 | |
|   for (auto _ : state) {
 | |
|     benchmark::DoNotOptimize(&f);
 | |
|     f(args...);
 | |
|   }
 | |
| }
 | |
| 
 | |
| struct FunctorWithTrivialArgs {
 | |
|   void operator()(int a, int b, int c) const {
 | |
|     benchmark::DoNotOptimize(a);
 | |
|     benchmark::DoNotOptimize(b);
 | |
|     benchmark::DoNotOptimize(c);
 | |
|   }
 | |
| };
 | |
| 
 | |
| void BM_TrivialArgsStdFunction(benchmark::State& state) {
 | |
|   CallFunctionBenchmark<std::function<void(int, int, int)>>(
 | |
|       state, FunctorWithTrivialArgs{}, 1, 2, 3);
 | |
| }
 | |
| BENCHMARK(BM_TrivialArgsStdFunction);
 | |
| 
 | |
| void BM_TrivialArgsFunctionRef(benchmark::State& state) {
 | |
|   CallFunctionBenchmark<FunctionRef<void(int, int, int)>>(
 | |
|       state, FunctorWithTrivialArgs{}, 1, 2, 3);
 | |
| }
 | |
| BENCHMARK(BM_TrivialArgsFunctionRef);
 | |
| 
 | |
| struct FunctorWithNonTrivialArgs {
 | |
|   void operator()(std::string a, std::string b, std::string c) const {
 | |
|     benchmark::DoNotOptimize(&a);
 | |
|     benchmark::DoNotOptimize(&b);
 | |
|     benchmark::DoNotOptimize(&c);
 | |
|   }
 | |
| };
 | |
| 
 | |
| void BM_NonTrivialArgsStdFunction(benchmark::State& state) {
 | |
|   std::string a, b, c;
 | |
|   CallFunctionBenchmark<
 | |
|       std::function<void(std::string, std::string, std::string)>>(
 | |
|       state, FunctorWithNonTrivialArgs{}, a, b, c);
 | |
| }
 | |
| BENCHMARK(BM_NonTrivialArgsStdFunction);
 | |
| 
 | |
| void BM_NonTrivialArgsFunctionRef(benchmark::State& state) {
 | |
|   std::string a, b, c;
 | |
|   CallFunctionBenchmark<
 | |
|       FunctionRef<void(std::string, std::string, std::string)>>(
 | |
|       state, FunctorWithNonTrivialArgs{}, a, b, c);
 | |
| }
 | |
| BENCHMARK(BM_NonTrivialArgsFunctionRef);
 | |
| 
 | |
| }  // namespace
 | |
| ABSL_NAMESPACE_END
 | |
| }  // namespace absl
 |