-
-
Notifications
You must be signed in to change notification settings - Fork 2
/
tx.go
231 lines (201 loc) · 4.45 KB
/
tx.go
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
package stm
import (
"fmt"
"sort"
"sync"
"unsafe"
"github.com/alecthomas/atomic"
)
type txVar interface {
getValue() *atomic.Value[VarValue]
changeValue(any)
getWatchers() *sync.Map
getLock() *sync.Mutex
}
// A Tx represents an atomic transaction.
type Tx struct {
reads map[txVar]VarValue
writes map[txVar]any
watching map[txVar]struct{}
locks txLocks
mu sync.Mutex
cond sync.Cond
waiting bool
completed bool
tries int
numRetryValues int
}
// Check that none of the logged values have changed since the transaction began.
func (tx *Tx) inputsChanged() bool {
for v, read := range tx.reads {
if read.Changed(v.getValue().Load()) {
return true
}
}
return false
}
// Writes the values in the transaction log to their respective Vars.
func (tx *Tx) commit() {
for v, val := range tx.writes {
v.changeValue(val)
}
}
func (tx *Tx) updateWatchers() {
for v := range tx.watching {
if _, ok := tx.reads[v]; !ok {
delete(tx.watching, v)
v.getWatchers().Delete(tx)
}
}
for v := range tx.reads {
if _, ok := tx.watching[v]; !ok {
v.getWatchers().Store(tx, nil)
tx.watching[v] = struct{}{}
}
}
}
// wait blocks until another transaction modifies any of the Vars read by tx.
func (tx *Tx) wait() {
if len(tx.reads) == 0 {
panic("not waiting on anything")
}
tx.updateWatchers()
tx.mu.Lock()
firstWait := true
for !tx.inputsChanged() {
if !firstWait {
expvars.Add("wakes for unchanged versions", 1)
}
expvars.Add("waits", 1)
tx.waiting = true
tx.cond.Broadcast()
tx.cond.Wait()
tx.waiting = false
firstWait = false
}
tx.mu.Unlock()
}
// Get returns the value of v as of the start of the transaction.
func (v *Var[T]) Get(tx *Tx) T {
// If we previously wrote to v, it will be in the write log.
if val, ok := tx.writes[v]; ok {
return val.(T)
}
// If we haven't previously read v, record its version
vv, ok := tx.reads[v]
if !ok {
vv = v.getValue().Load()
tx.reads[v] = vv
}
return vv.Get().(T)
}
// Set sets the value of a Var for the lifetime of the transaction.
func (v *Var[T]) Set(tx *Tx, val T) {
if v == nil {
panic("nil Var")
}
tx.writes[v] = val
}
type txProfileValue struct {
*Tx
int
}
// Retry aborts the transaction and retries it when a Var changes. You can return from this method
// to satisfy return values, but it should never actually return anything as it panics internally.
func (tx *Tx) Retry() struct{} {
retries.Add(txProfileValue{tx, tx.numRetryValues}, 1)
tx.numRetryValues++
panic(retry)
}
// Assert is a helper function that retries a transaction if the condition is
// not satisfied.
func (tx *Tx) Assert(p bool) {
if !p {
tx.Retry()
}
}
func (tx *Tx) reset() {
tx.mu.Lock()
for k := range tx.reads {
delete(tx.reads, k)
}
for k := range tx.writes {
delete(tx.writes, k)
}
tx.mu.Unlock()
tx.removeRetryProfiles()
tx.resetLocks()
}
func (tx *Tx) removeRetryProfiles() {
for tx.numRetryValues > 0 {
tx.numRetryValues--
retries.Remove(txProfileValue{tx, tx.numRetryValues})
}
}
func (tx *Tx) recycle() {
for v := range tx.watching {
delete(tx.watching, v)
v.getWatchers().Delete(tx)
}
tx.removeRetryProfiles()
// I don't think we can reuse Txs, because the "completed" field should/needs to be set
// indefinitely after use.
//txPool.Put(tx)
}
func (tx *Tx) lockAllVars() {
tx.resetLocks()
tx.collectAllLocks()
tx.sortLocks()
tx.lock()
}
func (tx *Tx) resetLocks() {
tx.locks.clear()
}
func (tx *Tx) collectReadLocks() {
for v := range tx.reads {
tx.locks.append(v.getLock())
}
}
func (tx *Tx) collectAllLocks() {
tx.collectReadLocks()
for v := range tx.writes {
if _, ok := tx.reads[v]; !ok {
tx.locks.append(v.getLock())
}
}
}
func (tx *Tx) sortLocks() {
sort.Sort(&tx.locks)
}
func (tx *Tx) lock() {
for _, l := range tx.locks.mus {
l.Lock()
}
}
func (tx *Tx) unlock() {
for _, l := range tx.locks.mus {
l.Unlock()
}
}
func (tx *Tx) String() string {
return fmt.Sprintf("%[1]T %[1]p", tx)
}
// Dedicated type avoids reflection in sort.Slice.
type txLocks struct {
mus []*sync.Mutex
}
func (me txLocks) Len() int {
return len(me.mus)
}
func (me txLocks) Less(i, j int) bool {
return uintptr(unsafe.Pointer(me.mus[i])) < uintptr(unsafe.Pointer(me.mus[j]))
}
func (me txLocks) Swap(i, j int) {
me.mus[i], me.mus[j] = me.mus[j], me.mus[i]
}
func (me *txLocks) clear() {
me.mus = me.mus[:0]
}
func (me *txLocks) append(mu *sync.Mutex) {
me.mus = append(me.mus, mu)
}