-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.go
271 lines (222 loc) · 7.4 KB
/
node.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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
/*
Copyright IBM Corp. All Rights Reserved.
SPDX-License-Identifier: Apache-2.0
*/
package etcdraft
import (
"context"
"crypto/sha256"
"sync"
"sync/atomic"
"time"
"code.cloudfoundry.org/clock"
"github.com/gogo/protobuf/proto"
"github.com/hyperledger/fabric/common/flogging"
"github.com/hyperledger/fabric/protos/orderer"
"github.com/hyperledger/fabric/protos/orderer/etcdraft"
"github.com/hyperledger/fabric/protos/utils"
"go.etcd.io/etcd/raft"
"go.etcd.io/etcd/raft/raftpb"
)
type node struct {
chainID string
logger *flogging.FabricLogger
metrics *Metrics
unreachableLock sync.RWMutex
unreachable map[uint64]struct{}
storage *RaftStorage
config *raft.Config
rpc RPC
chain *Chain
tickInterval time.Duration
clock clock.Clock
metadata *etcdraft.BlockMetadata
raft.Node
}
func (n *node) start(fresh, join bool) {
raftPeers := RaftPeers(n.metadata.ConsenterIds)
n.logger.Debugf("Starting raft node: #peers: %v", len(raftPeers))
var campaign bool
if fresh {
if join {
raftPeers = nil
n.logger.Info("Starting raft node to join an existing channel")
} else {
n.logger.Info("Starting raft node as part of a new channel")
// determine the node to start campaign by selecting the node with ID equals to:
// hash(channelID) % cluster_size + 1
sha := sha256.Sum256([]byte(n.chainID))
number, _ := proto.DecodeVarint(sha[24:])
if n.config.ID == number%uint64(len(raftPeers))+1 {
campaign = true
}
}
n.Node = raft.StartNode(n.config, raftPeers)
} else {
n.logger.Info("Restarting raft node")
n.Node = raft.RestartNode(n.config)
}
go n.run(campaign)
}
func (n *node) run(campaign bool) {
electionTimeout := n.tickInterval.Seconds() * float64(n.config.ElectionTick)
halfElectionTimeout := electionTimeout / 2
raftTicker := n.clock.NewTicker(n.tickInterval)
if s := n.storage.Snapshot(); !raft.IsEmptySnap(s) {
n.chain.snapC <- &s
}
elected := make(chan struct{})
if campaign {
n.logger.Infof("This node is picked to start campaign")
go func() {
// Attempt campaign every two HeartbeatTimeout elapses, until leader is present - either this
// node successfully claims leadership, or another leader already existed when this node starts.
// We could do this more lazily and exit proactive campaign once transitioned to Candidate state
// (not PreCandidate because other nodes might not have started yet, in which case PreVote
// messages are dropped at recipients). But there is no obvious reason (for now) to be lazy.
//
// 2*HeartbeatTick is used to avoid excessive campaign when network latency is significant and
// Raft term keeps advancing in this extreme case.
campaignTicker := n.clock.NewTicker(n.tickInterval * time.Duration(n.config.HeartbeatTick) * 2)
defer campaignTicker.Stop()
for {
select {
case <-campaignTicker.C():
n.Campaign(context.TODO())
case <-elected:
return
case <-n.chain.doneC:
return
}
}
}()
}
for {
select {
case <-raftTicker.C():
n.Tick()
case rd := <-n.Ready():
startStoring := n.clock.Now()
if err := n.storage.Store(rd.Entries, rd.HardState, rd.Snapshot); err != nil {
n.logger.Panicf("Failed to persist etcd/raft data: %s", err)
}
duration := n.clock.Since(startStoring).Seconds()
n.metrics.DataPersistDuration.Observe(float64(duration))
if duration > halfElectionTimeout {
n.logger.Warningf("WAL sync took %v seconds and the network is configured to start elections after %v seconds. Your disk is too slow and may cause loss of quorum and trigger leadership election.", duration, electionTimeout)
}
if !raft.IsEmptySnap(rd.Snapshot) {
n.chain.snapC <- &rd.Snapshot
}
// skip empty apply
if len(rd.CommittedEntries) != 0 || rd.SoftState != nil {
n.chain.applyC <- apply{rd.CommittedEntries, rd.SoftState}
}
if campaign && rd.SoftState != nil {
leader := atomic.LoadUint64(&rd.SoftState.Lead) // etcdraft requires atomic access to this var
if leader != raft.None {
n.logger.Infof("Leader %d is present, quit campaign", leader)
campaign = false
close(elected)
}
}
n.Advance()
// TODO(jay_guo) leader can write to disk in parallel with replicating
// to the followers and them writing to their disks. Check 10.2.1 in thesis
n.send(rd.Messages)
case <-n.chain.haltC:
raftTicker.Stop()
n.Stop()
n.storage.Close()
n.logger.Infof("Raft node stopped")
close(n.chain.doneC) // close after all the artifacts are closed
return
}
}
}
func (n *node) send(msgs []raftpb.Message) {
n.unreachableLock.RLock()
defer n.unreachableLock.RUnlock()
for _, msg := range msgs {
if msg.To == 0 {
continue
}
status := raft.SnapshotFinish
msgBytes := utils.MarshalOrPanic(&msg)
err := n.rpc.SendConsensus(msg.To, &orderer.ConsensusRequest{Channel: n.chainID, Payload: msgBytes})
if err != nil {
n.ReportUnreachable(msg.To)
n.logSendFailure(msg.To, err)
status = raft.SnapshotFailure
} else if _, ok := n.unreachable[msg.To]; ok {
n.logger.Infof("Successfully sent StepRequest to %d after failed attempt(s)", msg.To)
delete(n.unreachable, msg.To)
}
if msg.Type == raftpb.MsgSnap {
n.ReportSnapshot(msg.To, status)
}
}
}
// If this is called on leader, it picks a node that is
// recently active, and attempt to transfer leadership to it.
// If this is called on follower, it simply waits for a
// leader change till timeout (ElectionTimeout).
func (n *node) abdicateLeader(currentLead uint64) {
status := n.Status()
if status.Lead != raft.None && status.Lead != currentLead {
n.logger.Warn("Leader has changed since asked to transfer leadership")
return
}
ctx, cancel := context.WithTimeout(context.TODO(), time.Duration(n.config.ElectionTick)*n.tickInterval)
defer cancel()
// Leader initiates leader transfer
if status.RaftState == raft.StateLeader {
var transferee uint64
for id, pr := range status.Progress {
if id == status.ID {
continue // skip self
}
if pr.RecentActive && !pr.Paused {
transferee = id
break
}
n.logger.Debugf("Node %d is not qualified as transferee because it's either paused or not active", id)
}
if transferee == raft.None {
n.logger.Errorf("No follower is qualified as transferee, abort leader transfer")
return
}
n.logger.Infof("Transferring leadership to %d", transferee)
n.TransferLeadership(ctx, status.ID, transferee)
}
// Periodically check leader has changed till ElectionTimeout elapsed
var newLeader uint64
for newLeader = n.Status().Lead; newLeader == status.Lead || newLeader == raft.None; newLeader = n.Status().Lead {
select {
case <-ctx.Done():
n.logger.Warn("Leader transfer timeout")
return
case <-time.After(n.tickInterval):
case <-n.chain.doneC:
return
}
}
n.logger.Infof("Leader has been transferred from %d to %d", currentLead, newLeader)
}
func (n *node) logSendFailure(dest uint64, err error) {
if _, ok := n.unreachable[dest]; ok {
n.logger.Debugf("Failed to send StepRequest to %d, because: %s", dest, err)
return
}
n.logger.Errorf("Failed to send StepRequest to %d, because: %s", dest, err)
n.unreachable[dest] = struct{}{}
}
func (n *node) takeSnapshot(index uint64, cs raftpb.ConfState, data []byte) {
if err := n.storage.TakeSnapshot(index, cs, data); err != nil {
n.logger.Errorf("Failed to create snapshot at index %d: %s", index, err)
}
}
func (n *node) lastIndex() uint64 {
i, _ := n.storage.ram.LastIndex()
return i
}