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
|
package stm
import (
"sync"
"testing"
"time"
)
func TestDecrement(t *testing.T) {
x := NewVar(1000)
for i := 0; i < 500; i++ {
go Atomically(func(tx *Tx) {
cur := tx.Get(x).(int)
tx.Set(x, cur-1)
})
}
done := make(chan struct{})
go func() {
for {
if AtomicGet(x).(int) == 500 {
break
}
}
done <- struct{}{}
}()
select {
case <-done:
case <-time.After(time.Second):
t.Fatal("decrement did not complete in time")
}
}
// read-only transaction aren't exempt from calling tx.verify
func TestReadVerify(t *testing.T) {
read := make(chan struct{})
x, y := NewVar(1), NewVar(2)
// spawn a transaction that writes to x
go func() {
Atomically(func(tx *Tx) {
<-read
tx.Set(x, 3)
})
read <- struct{}{}
// other tx should retry, so we need to read/send again
read <- <-read
}()
// spawn a transaction that reads x, then y. The other tx will modify x in
// between the reads, causing this tx to retry.
var x2, y2 int
Atomically(func(tx *Tx) {
x2 = tx.Get(x).(int)
read <- struct{}{}
<-read // wait for other tx to complete
y2 = tx.Get(y).(int)
})
if x2 == 1 && y2 == 2 {
t.Fatal("read was not verified")
}
}
func TestRetry(t *testing.T) {
x := NewVar(10)
// spawn 10 transactions, one every 10 milliseconds. This will decrement x
// to 0 over the course of 100 milliseconds.
go func() {
for i := 0; i < 10; i++ {
time.Sleep(10 * time.Millisecond)
Atomically(func(tx *Tx) {
cur := tx.Get(x).(int)
tx.Set(x, cur-1)
})
}
}()
// Each time we read x before the above loop has finished, we need to
// retry. This should result in no more than 1 retry per transaction.
retry := 0
Atomically(func(tx *Tx) {
cur := tx.Get(x).(int)
if cur != 0 {
retry++
tx.Retry()
}
})
if retry > 10 {
t.Fatal("should have retried at most 10 times, got", retry)
}
}
func TestVerify(t *testing.T) {
// tx.verify should check more than pointer equality
type foo struct {
i int
}
x := NewVar(&foo{3})
read := make(chan struct{})
// spawn a transaction that modifies x
go func() {
Atomically(func(tx *Tx) {
<-read
rx := tx.Get(x).(*foo)
rx.i = 7
tx.Set(x, rx)
})
read <- struct{}{}
// other tx should retry, so we need to read/send again
read <- <-read
}()
// spawn a transaction that reads x, then y. The other tx will modify x in
// between the reads, causing this tx to retry.
var i int
Atomically(func(tx *Tx) {
f := tx.Get(x).(*foo)
i = f.i
read <- struct{}{}
<-read // wait for other tx to complete
})
if i == 3 {
t.Fatal("verify did not retry despite modified Var", i)
}
}
func BenchmarkAtomicGet(b *testing.B) {
x := NewVar(0)
for i := 0; i < b.N; i++ {
AtomicGet(x)
}
}
func BenchmarkAtomicSet(b *testing.B) {
x := NewVar(0)
for i := 0; i < b.N; i++ {
AtomicSet(x, 0)
}
}
func BenchmarkIncrementSTM(b *testing.B) {
for i := 0; i < b.N; i++ {
// spawn 1000 goroutines that each increment x by 1
x := NewVar(0)
for i := 0; i < 1000; i++ {
go Atomically(func(tx *Tx) {
cur := tx.Get(x).(int)
tx.Set(x, cur+1)
})
}
// wait for x to reach 1000
Atomically(func(tx *Tx) {
tx.Assert(tx.Get(x).(int) == 1000)
})
}
}
func BenchmarkIncrementMutex(b *testing.B) {
for i := 0; i < b.N; i++ {
var mu sync.Mutex
x := 0
for i := 0; i < 1000; i++ {
go func() {
mu.Lock()
x++
mu.Unlock()
}()
}
for {
mu.Lock()
read := x
mu.Unlock()
if read == 1000 {
break
}
}
}
}
func BenchmarkIncrementChannel(b *testing.B) {
for i := 0; i < b.N; i++ {
c := make(chan int, 1)
c <- 0
for i := 0; i < 1000; i++ {
go func() {
c <- 1 + <-c
}()
}
for {
read := <-c
if read == 1000 {
break
}
c <- read
}
}
}
func BenchmarkReadVarSTM(b *testing.B) {
for i := 0; i < b.N; i++ {
var wg sync.WaitGroup
wg.Add(1000)
x := NewVar(0)
for i := 0; i < 1000; i++ {
go func() {
AtomicGet(x)
wg.Done()
}()
}
wg.Wait()
}
}
func BenchmarkReadVarMutex(b *testing.B) {
for i := 0; i < b.N; i++ {
var mu sync.Mutex
var wg sync.WaitGroup
wg.Add(1000)
x := 0
for i := 0; i < 1000; i++ {
go func() {
mu.Lock()
_ = x
mu.Unlock()
wg.Done()
}()
}
wg.Wait()
}
}
func BenchmarkReadVarChannel(b *testing.B) {
for i := 0; i < b.N; i++ {
var wg sync.WaitGroup
wg.Add(1000)
c := make(chan int)
close(c)
for i := 0; i < 1000; i++ {
go func() {
<-c
wg.Done()
}()
}
wg.Wait()
}
}
|
