-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathprotocol_benchmark.cc
More file actions
290 lines (233 loc) · 6.89 KB
/
protocol_benchmark.cc
File metadata and controls
290 lines (233 loc) · 6.89 KB
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
#include <benchmark/benchmark.h>
#include <string_view>
#include <utility>
#include "generated/protocol_A_manual.h"
#include "generated/protocol_A_virtual.h"
#include "interface_benchmark.h"
namespace {
struct ALike {
std::string_view name() const { return "ALike"; }
int count() { return 42; }
};
struct ALikeToo {
std::string_view name() const { return "ALikeToo"; }
int count() { return 99; }
};
// Member function call benchmarks
static void Direct_Call(benchmark::State& state) {
ALike a;
benchmark::DoNotOptimize(a);
for (auto _ : state) {
benchmark::DoNotOptimize(a.name());
benchmark::DoNotOptimize(a.count());
}
}
BENCHMARK(Direct_Call);
static void Protocol_Virtual_Call(benchmark::State& state) {
xyz::protocol<xyz::A_virtual> p(std::in_place_type<ALike>);
benchmark::DoNotOptimize(p);
for (auto _ : state) {
benchmark::DoNotOptimize(p.name());
benchmark::DoNotOptimize(p.count());
}
}
BENCHMARK(Protocol_Virtual_Call);
static void Protocol_Manual_Call(benchmark::State& state) {
xyz::protocol<xyz::A_manual> p(std::in_place_type<ALike>);
benchmark::DoNotOptimize(p);
for (auto _ : state) {
benchmark::DoNotOptimize(p.name());
benchmark::DoNotOptimize(p.count());
}
}
BENCHMARK(Protocol_Manual_Call);
// Copy construction benchmarks
static void Direct_Copy(benchmark::State& state) {
ALike a;
for (auto _ : state) {
ALike copy(a);
benchmark::DoNotOptimize(copy);
}
}
BENCHMARK(Direct_Copy);
static void Protocol_Virtual_Copy(benchmark::State& state) {
xyz::protocol<xyz::A_virtual> p(std::in_place_type<ALike>);
for (auto _ : state) {
xyz::protocol<xyz::A_virtual> copy(p);
benchmark::DoNotOptimize(copy);
}
}
BENCHMARK(Protocol_Virtual_Copy);
static void Protocol_Manual_Copy(benchmark::State& state) {
xyz::protocol<xyz::A_manual> p(std::in_place_type<ALike>);
for (auto _ : state) {
xyz::protocol<xyz::A_manual> copy(p);
benchmark::DoNotOptimize(copy);
}
}
BENCHMARK(Protocol_Manual_Copy);
// Move construction/assignment benchmarks
static void Direct_Move(benchmark::State& state) {
ALike a;
for (auto _ : state) {
ALike moved(std::move(a));
benchmark::DoNotOptimize(moved);
a = std::move(moved);
benchmark::DoNotOptimize(a);
}
}
BENCHMARK(Direct_Move);
static void Protocol_Virtual_Move(benchmark::State& state) {
xyz::protocol<xyz::A_virtual> p(std::in_place_type<ALike>);
for (auto _ : state) {
xyz::protocol<xyz::A_virtual> moved(std::move(p));
benchmark::DoNotOptimize(moved);
p = std::move(moved);
benchmark::DoNotOptimize(p);
}
}
BENCHMARK(Protocol_Virtual_Move);
static void Protocol_Manual_Move(benchmark::State& state) {
xyz::protocol<xyz::A_manual> p(std::in_place_type<ALike>);
for (auto _ : state) {
xyz::protocol<xyz::A_manual> moved(std::move(p));
benchmark::DoNotOptimize(moved);
p = std::move(moved);
benchmark::DoNotOptimize(p);
}
}
BENCHMARK(Protocol_Manual_Move);
// Swap benchmarks
static void Direct_Swap(benchmark::State& state) {
ALike a1;
ALike a2;
for (auto _ : state) {
std::swap(a1, a2);
benchmark::DoNotOptimize(a1);
benchmark::DoNotOptimize(a2);
}
}
BENCHMARK(Direct_Swap);
static void Protocol_Virtual_Swap(benchmark::State& state) {
xyz::protocol<xyz::A_virtual> p1(std::in_place_type<ALike>);
xyz::protocol<xyz::A_virtual> p2(std::in_place_type<ALike>);
for (auto _ : state) {
p1.swap(p2);
benchmark::DoNotOptimize(p1);
benchmark::DoNotOptimize(p2);
}
}
BENCHMARK(Protocol_Virtual_Swap);
static void Protocol_Manual_Swap(benchmark::State& state) {
xyz::protocol<xyz::A_manual> p1(std::in_place_type<ALike>);
xyz::protocol<xyz::A_manual> p2(std::in_place_type<ALike>);
for (auto _ : state) {
p1.swap(p2);
benchmark::DoNotOptimize(p1);
benchmark::DoNotOptimize(p2);
}
}
BENCHMARK(Protocol_Manual_Swap);
// Construction and Destruction benchmarks
static void Direct_CtorDtor(benchmark::State& state) {
for (auto _ : state) {
ALike a;
benchmark::DoNotOptimize(a);
}
}
BENCHMARK(Direct_CtorDtor);
static void Protocol_Virtual_CtorDtor(benchmark::State& state) {
for (auto _ : state) {
xyz::protocol<xyz::A_virtual> p(std::in_place_type<ALike>);
benchmark::DoNotOptimize(p);
}
}
BENCHMARK(Protocol_Virtual_CtorDtor);
static void Protocol_Manual_CtorDtor(benchmark::State& state) {
for (auto _ : state) {
xyz::protocol<xyz::A_manual> p(std::in_place_type<ALike>);
benchmark::DoNotOptimize(p);
}
}
BENCHMARK(Protocol_Manual_CtorDtor);
// View benchmarks
static void ProtocolView_Virtual_Call(benchmark::State& state) {
ALike alike;
xyz::protocol_view<xyz::A_virtual> view(alike);
benchmark::DoNotOptimize(view);
for (auto _ : state) {
benchmark::DoNotOptimize(view.name());
benchmark::DoNotOptimize(view.count());
}
}
BENCHMARK(ProtocolView_Virtual_Call);
static void ProtocolView_Manual_Call(benchmark::State& state) {
ALike alike;
xyz::protocol_view<xyz::A_manual> view(alike);
benchmark::DoNotOptimize(view);
for (auto _ : state) {
benchmark::DoNotOptimize(view.name());
benchmark::DoNotOptimize(view.count());
}
}
BENCHMARK(ProtocolView_Manual_Call);
static void RawPointer_Call(benchmark::State& state) {
ALike alike;
ALike* ptr = &alike;
benchmark::DoNotOptimize(ptr);
for (auto _ : state) {
benchmark::DoNotOptimize(ptr->name());
benchmark::DoNotOptimize(ptr->count());
}
}
BENCHMARK(RawPointer_Call);
// Jitter benchmarks to defeat branch prediction
static void ProtocolView_Virtual_Call_Jitter(benchmark::State& state) {
ALike a1;
ALikeToo a2;
xyz::protocol_view<xyz::A_virtual> views[2] = {
xyz::protocol_view<xyz::A_virtual>(a1),
xyz::protocol_view<xyz::A_virtual>(a2)};
benchmark::DoNotOptimize(views);
size_t i = 0;
for (auto _ : state) {
auto& view = views[i & 1];
benchmark::DoNotOptimize(view.name());
benchmark::DoNotOptimize(view.count());
++i;
}
}
BENCHMARK(ProtocolView_Virtual_Call_Jitter);
static void ProtocolView_Manual_Call_Jitter(benchmark::State& state) {
ALike a1;
ALikeToo a2;
xyz::protocol_view<xyz::A_manual> views[2] = {
xyz::protocol_view<xyz::A_manual>(a1),
xyz::protocol_view<xyz::A_manual>(a2)};
benchmark::DoNotOptimize(views);
size_t i = 0;
for (auto _ : state) {
auto& view = views[i & 1];
benchmark::DoNotOptimize(view.name());
benchmark::DoNotOptimize(view.count());
++i;
}
}
BENCHMARK(ProtocolView_Manual_Call_Jitter);
static void RawPointer_Call_Jitter(benchmark::State& state) {
ALike a1;
ALike a2; // Raw pointer array must be of the same type, so this is just to
// measure the array overhead
ALike* ptrs[2] = {&a1, &a2};
benchmark::DoNotOptimize(ptrs);
size_t i = 0;
for (auto _ : state) {
auto* ptr = ptrs[i & 1];
benchmark::DoNotOptimize(ptr->name());
benchmark::DoNotOptimize(ptr->count());
++i;
}
}
BENCHMARK(RawPointer_Call_Jitter);
} // namespace
BENCHMARK_MAIN();