blob: b504d1a57cf245584e0878a1343b425eb95fc943 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
// Copyright 2021 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 <limits>
#include "absl/synchronization/blocking_counter.h"
#include "absl/synchronization/internal/thread_pool.h"
#include "benchmark/benchmark.h"
namespace {
void BM_BlockingCounter_SingleThread(benchmark::State& state) {
for (auto _ : state) {
int iterations = state.range(0);
absl::BlockingCounter counter{iterations};
for (int i = 0; i < iterations; ++i) {
counter.DecrementCount();
}
counter.Wait();
}
}
BENCHMARK(BM_BlockingCounter_SingleThread)
->ArgName("iterations")
->Arg(2)
->Arg(4)
->Arg(16)
->Arg(64)
->Arg(256);
void BM_BlockingCounter_DecrementCount(benchmark::State& state) {
static absl::BlockingCounter* counter =
new absl::BlockingCounter{std::numeric_limits<int>::max()};
for (auto _ : state) {
counter->DecrementCount();
}
}
BENCHMARK(BM_BlockingCounter_DecrementCount)
->Threads(2)
->Threads(4)
->Threads(6)
->Threads(8)
->Threads(10)
->Threads(12)
->Threads(16)
->Threads(32)
->Threads(64)
->Threads(128);
void BM_BlockingCounter_Wait(benchmark::State& state) {
int num_threads = state.range(0);
absl::synchronization_internal::ThreadPool pool(num_threads);
for (auto _ : state) {
absl::BlockingCounter counter{num_threads};
pool.Schedule([num_threads, &counter, &pool]() {
for (int i = 0; i < num_threads; ++i) {
pool.Schedule([&counter]() { counter.DecrementCount(); });
}
});
counter.Wait();
}
}
BENCHMARK(BM_BlockingCounter_Wait)
->ArgName("threads")
->Arg(2)
->Arg(4)
->Arg(8)
->Arg(16)
->Arg(32)
->Arg(64)
->Arg(128);
} // namespace
|
