-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathmutexmap_test.go
More file actions
148 lines (126 loc) · 2.58 KB
/
mutexmap_test.go
File metadata and controls
148 lines (126 loc) · 2.58 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
package locker
import (
"math/rand"
"strconv"
"sync"
"testing"
"time"
)
func TestMutexMap_Lock(t *testing.T) {
var l MutexMap[string]
l.Lock("test")
ctr := l.locks["test"]
if w := ctr.waiters.Load(); w != 0 {
t.Fatalf("expected waiters to be 0, got %d", w)
}
chDone := make(chan struct{})
go func() {
l.Lock("test")
close(chDone)
}()
chWaiting := make(chan struct{})
go func() {
for range time.Tick(1 * time.Millisecond) {
if ctr.waiters.Load() == 1 {
close(chWaiting)
break
}
}
}()
select {
case <-chWaiting:
case <-time.After(3 * time.Second):
t.Fatal("timed out waiting for lock waiters to be incremented")
}
select {
case <-chDone:
t.Fatal("lock should not have returned while it was still held")
default:
}
l.Unlock("test")
select {
case <-chDone:
case <-time.After(3 * time.Second):
t.Fatalf("lock should have completed")
}
if w := ctr.waiters.Load(); w != 0 {
t.Fatalf("expected waiters to be 0, got %d", w)
}
}
func TestMutexMap_Unlock(t *testing.T) {
var l MutexMap[string]
l.Lock("test")
l.Unlock("test")
chDone := make(chan struct{})
go func() {
l.Lock("test")
close(chDone)
}()
select {
case <-chDone:
case <-time.After(3 * time.Second):
t.Fatalf("lock should not be blocked")
}
}
func TestMutexMap_Concurrency(t *testing.T) {
var l MutexMap[string]
var wg sync.WaitGroup
for i := 0; i <= 10000; i++ {
wg.Add(1)
go func() {
l.Lock("test")
// if there is a concurrency issue, will very likely panic here
l.Unlock("test")
wg.Done()
}()
}
chDone := make(chan struct{})
go func() {
wg.Wait()
close(chDone)
}()
select {
case <-chDone:
case <-time.After(10 * time.Second):
t.Fatal("timeout waiting for locks to complete")
}
// Since everything has unlocked this should not exist anymore
if ctr, exists := l.locks["test"]; exists {
t.Fatalf("lock should not exist: %v", ctr)
}
}
func BenchmarkMutexMap(b *testing.B) {
var l MutexMap[string]
b.ReportAllocs()
for i := 0; i < b.N; i++ {
l.Lock("test")
l.Lock(strconv.Itoa(i))
l.Unlock(strconv.Itoa(i))
l.Unlock("test")
}
}
func BenchmarkMutexMap_Parallel(b *testing.B) {
var l MutexMap[string]
b.SetParallelism(128)
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
l.Lock("test")
l.Unlock("test")
}
})
}
func BenchmarkMutexMap_MoreKeys(b *testing.B) {
var l MutexMap[string]
var keys []string
for i := 0; i < 64; i++ {
keys = append(keys, strconv.Itoa(i))
}
b.SetParallelism(128)
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
k := keys[rand.Intn(len(keys))]
l.Lock(k)
l.Unlock(k)
}
})
}