-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlockable_map_benchmark_test.go
More file actions
274 lines (227 loc) · 4.86 KB
/
lockable_map_benchmark_test.go
File metadata and controls
274 lines (227 loc) · 4.86 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
package lockablemap
import (
"encoding/json"
"strconv"
"sync"
"sync/atomic"
"testing"
)
// Bench notes:
// - Run: go test -bench . -benchmem ./...
// - Add race if you want (slower): go test -race -bench . ./...
// - Most benches prefill the map so Get paths are realistic.
func BenchmarkLockableMap_Set(b *testing.B) {
lm := NewLockableMap[int, int]()
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
lm.Set(i, i)
}
}
func BenchmarkLockableMap_Get_Hit(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 16
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
_, err := lm.Get(i & (keys - 1))
if err != nil {
b.Fatalf("unexpected error: %v", err)
}
}
}
func BenchmarkLockableMap_Get_Miss(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 16
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
_, err := lm.Get((i & (keys - 1)) + keys) // guaranteed miss
if err == nil {
b.Fatalf("expected error, got nil")
}
}
}
func BenchmarkLockableMap_Remove(b *testing.B) {
lm := NewLockableMap[int, int]()
// Pre-populate with at least b.N keys so removes usually hit.
for i := 0; i < b.N; i++ {
lm.Set(i, i)
}
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
lm.Remove(i)
}
}
func BenchmarkLockableMap_GetAll_Snapshot(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 14
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
_ = lm.GetAll()
}
}
func BenchmarkLockableMap_GetAllSlice(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 14
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
_ = lm.GetAllSlice()
}
}
func BenchmarkLockableMap_MarshalJSON(b *testing.B) {
lm := NewLockableMap[string, int]()
const keys = 1 << 12
for i := 0; i < keys; i++ {
lm.Set("k"+strconv.Itoa(i), i)
}
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
_, err := json.Marshal(&lm)
if err != nil {
b.Fatalf("unexpected error: %v", err)
}
}
}
// Parallel benchmarks
func BenchmarkLockableMap_Set_Parallel(b *testing.B) {
lm := NewLockableMap[int, int]()
var ctr uint64
b.ReportAllocs()
b.ResetTimer()
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
i := int(atomic.AddUint64(&ctr, 1))
lm.Set(i, i)
}
})
}
func BenchmarkLockableMap_Get_Hit_Parallel(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 16
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
var ctr uint64
b.ReportAllocs()
b.ResetTimer()
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
i := int(atomic.AddUint64(&ctr, 1))
_, err := lm.Get(i & (keys - 1))
if err != nil {
b.Fatalf("unexpected error: %v", err)
}
}
})
}
func BenchmarkLockableMap_Mixed_Parallel_90Read10Write(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 16
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
var ctr uint64
b.ReportAllocs()
b.ResetTimer()
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
n := atomic.AddUint64(&ctr, 1)
i := int(n)
// ~10% writes, 90% reads
if n%10 == 0 {
lm.Set(i&(keys-1), i)
continue
}
_, err := lm.Get(i & (keys - 1))
if err != nil {
b.Fatalf("unexpected error: %v", err)
}
}
})
}
func BenchmarkLockableMap_GetAll_Parallel(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 14
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
b.ReportAllocs()
b.ResetTimer()
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
_ = lm.GetAll()
}
})
}
func BenchmarkLockableMap_MarshalJSON_Parallel(b *testing.B) {
lm := NewLockableMap[string, int]()
const keys = 1 << 12
for i := 0; i < keys; i++ {
lm.Set("k"+strconv.Itoa(i), i)
}
b.ReportAllocs()
b.ResetTimer()
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
_, err := json.Marshal(&lm)
if err != nil {
b.Fatalf("unexpected error: %v", err)
}
}
})
}
// Contended scenario: writers + readers in fixed goroutines.
// This can be useful alongside RunParallel to resemble real services.
func BenchmarkLockableMap_Contended_ReadMostly(b *testing.B) {
lm := NewLockableMap[int, int]()
const keys = 1 << 16
for i := 0; i < keys; i++ {
lm.Set(i, i)
}
b.ReportAllocs()
b.ResetTimer()
var wg sync.WaitGroup
stop := make(chan struct{})
// Writers
wg.Add(2)
for w := 0; w < 2; w++ {
go func(id int) {
defer wg.Done()
i := id
for {
select {
case <-stop:
return
default:
lm.Set(i&(keys-1), i)
i += 17
}
}
}(w)
}
// Readers: benchmark loop (single goroutine) to measure throughput while
// background writers contend.
b.ResetTimer()
for i := 0; i < b.N; i++ {
_, _ = lm.Get(i & (keys - 1))
}
close(stop)
wg.Wait()
}