-
Notifications
You must be signed in to change notification settings - Fork 536
/
cache.go
135 lines (122 loc) · 3.59 KB
/
cache.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
// Copyright 2017-2019 Lei Ni (nilei81@gmail.com) and other contributors.
//
// 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 logdb
import (
"sync"
"github.com/lni/dragonboat/v4/raftio"
pb "github.com/lni/dragonboat/v4/raftpb"
)
type cache struct {
nodeInfo map[raftio.NodeInfo]struct{}
ps map[raftio.NodeInfo]pb.State
lastEntryBatch map[raftio.NodeInfo]pb.EntryBatch
maxIndex map[raftio.NodeInfo]uint64
snapshotIndex map[raftio.NodeInfo]uint64
mu sync.Mutex
}
func newCache() *cache {
return &cache{
nodeInfo: make(map[raftio.NodeInfo]struct{}),
ps: make(map[raftio.NodeInfo]pb.State),
lastEntryBatch: make(map[raftio.NodeInfo]pb.EntryBatch),
maxIndex: make(map[raftio.NodeInfo]uint64),
snapshotIndex: make(map[raftio.NodeInfo]uint64),
}
}
func (r *cache) setNodeInfo(shardID uint64, replicaID uint64) bool {
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
r.mu.Lock()
defer r.mu.Unlock()
_, ok := r.nodeInfo[key]
if !ok {
r.nodeInfo[key] = struct{}{}
}
return !ok
}
func (r *cache) setState(shardID uint64, replicaID uint64, st pb.State) bool {
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
r.mu.Lock()
defer r.mu.Unlock()
v, ok := r.ps[key]
if !ok {
r.ps[key] = st
return true
}
if pb.IsStateEqual(v, st) {
return false
}
r.ps[key] = st
return true
}
func (r *cache) setSnapshotIndex(shardID uint64, replicaID uint64, index uint64) {
r.mu.Lock()
defer r.mu.Unlock()
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
r.snapshotIndex[key] = index
}
func (r *cache) trySaveSnapshot(shardID uint64,
replicaID uint64, index uint64) bool {
r.mu.Lock()
defer r.mu.Unlock()
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
v, ok := r.snapshotIndex[key]
if !ok {
r.snapshotIndex[key] = index
return true
}
return index > v
}
func (r *cache) setMaxIndex(shardID uint64, replicaID uint64, maxIndex uint64) {
r.mu.Lock()
defer r.mu.Unlock()
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
r.maxIndex[key] = maxIndex
}
func (r *cache) getMaxIndex(shardID uint64, replicaID uint64) (uint64, bool) {
r.mu.Lock()
defer r.mu.Unlock()
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
v, ok := r.maxIndex[key]
if !ok {
return 0, false
}
return v, true
}
func (r *cache) setLastBatch(shardID uint64,
replicaID uint64, eb pb.EntryBatch) {
r.mu.Lock()
defer r.mu.Unlock()
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
oeb, ok := r.lastEntryBatch[key]
if !ok {
oeb = pb.EntryBatch{Entries: make([]pb.Entry, 0, len(eb.Entries))}
} else {
oeb.Entries = oeb.Entries[:0]
}
oeb.Entries = append(oeb.Entries, eb.Entries...)
r.lastEntryBatch[key] = oeb
}
func (r *cache) getLastBatch(shardID uint64,
replicaID uint64, lb pb.EntryBatch) (pb.EntryBatch, bool) {
r.mu.Lock()
defer r.mu.Unlock()
key := raftio.NodeInfo{ShardID: shardID, ReplicaID: replicaID}
v, ok := r.lastEntryBatch[key]
if !ok {
return v, false
}
lb.Entries = lb.Entries[:0]
lb.Entries = append(lb.Entries, v.Entries...)
return lb, true
}