-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathatomic.go
More file actions
137 lines (110 loc) · 3.11 KB
/
atomic.go
File metadata and controls
137 lines (110 loc) · 3.11 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
package supervisor
import (
"bytes"
"errors"
"time"
"github.com/samuel/go-zookeeper/zk"
)
// MakeValue the function that tries to save data will call this to transform the value
type MakeValue func(preValue []byte) []byte
// MutableAtomicValue holds value before and after save
type MutableAtomicValue struct {
preValue []byte
postValue []byte
}
type atomicValue struct {
client *Client
path string
MaxRetries int
RetryDelay int
RetryDelayUnit time.Duration
}
func (av *atomicValue) getCurrentValue(result *MutableAtomicValue, _stat *zk.Stat) (bool, error) {
data, stat, err := av.client.checkAndGetNode(av.path)
if err != nil {
return false, err
}
if stat == nil {
return false, nil
}
*_stat = *stat
result.preValue = data
return true, nil
}
func (av *atomicValue) get() (*MutableAtomicValue, error) {
stat := new(zk.Stat)
result := &MutableAtomicValue{}
if _, err := av.getCurrentValue(result, stat); err != nil {
return nil, err
}
result.postValue = result.preValue
return result, nil
}
func (av *atomicValue) compareAndSet(expected, newValue []byte) error {
stat := new(zk.Stat)
result := new(MutableAtomicValue)
exists, err := av.getCurrentValue(result, stat)
if err != nil {
return err
}
if !exists {
return errors.New("Value does not exists")
}
if !bytes.Equal(result.preValue, expected) {
return errors.New("Wrong data version")
}
if _, err := av.client.setNodeData(av.path, newValue, stat.Version); err != nil {
return err
}
result.postValue = newValue
return nil
}
func (av *atomicValue) trySet(makeValue MakeValue) error {
return av.tryOptimistic(makeValue)
}
// tryOptimistic tries to set the value. In case of error it
// will try again X (RetryCount) times with delay (RetryDelay).
// Each time it receives an error, RetryDelay is increased with
// with the following: RetryDelay = RetryDelay * 3 / 2 + 1
func (av *atomicValue) tryOptimistic(makeValue MakeValue) error {
result := new(MutableAtomicValue)
retryCount := 0
retryDelay := av.RetryDelay
for retryCount < av.MaxRetries {
if err := av.tryOnce(result, makeValue); err == nil {
return nil
}
time.Sleep(time.Duration(retryDelay) * av.RetryDelayUnit)
retryDelay = retryDelay*3/2 + 1 // increase delay time
retryCount++
}
return nil
}
func (av *atomicValue) tryOnce(result *MutableAtomicValue, makeValue MakeValue) error {
stat := new(zk.Stat)
exists, err := av.getCurrentValue(result, stat)
if err != nil {
return err
}
newValue := makeValue(result.preValue)
if exists {
if _, err := av.client.setNodeData(av.path, newValue, stat.Version); err != nil {
return err
}
} else {
if _, err := av.client.createParentNodeIfNotExists(av.path, newValue); err != nil {
return err
}
}
result.postValue = newValue
return nil
}
func newAtomicValue(client *Client, path string) *atomicValue {
return &atomicValue{
client: client,
path: path,
MaxRetries: 3,
RetryDelay: 2,
RetryDelayUnit: time.Second,
}
}