forked from etcd-io/etcd
-
Notifications
You must be signed in to change notification settings - Fork 0
/
rwmutex.go
95 lines (84 loc) · 2.42 KB
/
rwmutex.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
// Copyright 2016 CoreOS, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package recipe
import (
"github.com/coreos/etcd/clientv3"
"github.com/coreos/etcd/storage/storagepb"
)
type RWMutex struct {
client *clientv3.Client
key string
myKey *RemoteKV
}
func NewRWMutex(client *clientv3.Client, key string) *RWMutex {
return &RWMutex{client, key, nil}
}
func (rwm *RWMutex) RLock() error {
// XXX: make reads ephemeral locks?
rk, err := NewUniqueKey(rwm.client, rwm.key+"/read")
if err != nil {
return err
}
rwm.myKey = rk
// if there are nodes with "write-" and a lower
// revision number than us we must wait
resp, err := NewRange(rwm.client, rwm.key+"/write").FirstRev()
if err != nil {
return err
}
if len(resp.Kvs) == 0 || resp.Kvs[0].ModRevision > rk.Revision() {
// no blocking since no write key
return nil
}
return rwm.waitOnLowest()
}
func (rwm *RWMutex) Lock() error {
rk, err := NewUniqueKey(rwm.client, rwm.key+"/write")
if err != nil {
return err
}
rwm.myKey = rk
for {
// any key of lower rev number blocks the write lock
resp, err := NewRangeRev(rwm.client, rwm.key, rk.Revision()-1).LastRev()
if err != nil {
return err
}
if len(resp.Kvs) == 0 {
// no matching for revision before myKey; acquired
return nil
}
if err := rwm.waitOnLowest(); err != nil {
return err
}
// get the new lowest, etc until this is the only one left
}
return nil
}
func (rwm *RWMutex) waitOnLowest() error {
// must block; get key before ek for waiting
lastKey, err := NewRangeRev(rwm.client, rwm.key, rwm.myKey.Revision()-1).LastRev()
if err != nil {
return err
}
// wait for release on prior key
_, err = WaitEvents(
rwm.client,
string(lastKey.Kvs[0].Key),
rwm.myKey.Revision(),
[]storagepb.Event_EventType{storagepb.DELETE})
return err
}
func (rwm *RWMutex) RUnlock() error { return rwm.myKey.Delete() }
func (rwm *RWMutex) Unlock() error { return rwm.myKey.Delete() }