raft.go 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548
  1. // Copyright 2015 The etcd Authors
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. package etcdserver
  15. import (
  16. "encoding/json"
  17. "expvar"
  18. "sort"
  19. "sync"
  20. "sync/atomic"
  21. "time"
  22. pb "github.com/coreos/etcd/etcdserver/etcdserverpb"
  23. "github.com/coreos/etcd/etcdserver/membership"
  24. "github.com/coreos/etcd/pkg/contention"
  25. "github.com/coreos/etcd/pkg/pbutil"
  26. "github.com/coreos/etcd/pkg/types"
  27. "github.com/coreos/etcd/raft"
  28. "github.com/coreos/etcd/raft/raftpb"
  29. "github.com/coreos/etcd/rafthttp"
  30. "github.com/coreos/etcd/wal"
  31. "github.com/coreos/etcd/wal/walpb"
  32. "github.com/coreos/pkg/capnslog"
  33. )
  34. const (
  35. // Number of entries for slow follower to catch-up after compacting
  36. // the raft storage entries.
  37. // We expect the follower has a millisecond level latency with the leader.
  38. // The max throughput is around 10K. Keep a 5K entries is enough for helping
  39. // follower to catch up.
  40. numberOfCatchUpEntries = 5000
  41. // The max throughput of etcd will not exceed 100MB/s (100K * 1KB value).
  42. // Assuming the RTT is around 10ms, 1MB max size is large enough.
  43. maxSizePerMsg = 1 * 1024 * 1024
  44. // Never overflow the rafthttp buffer, which is 4096.
  45. // TODO: a better const?
  46. maxInflightMsgs = 4096 / 8
  47. )
  48. var (
  49. // protects raftStatus
  50. raftStatusMu sync.Mutex
  51. // indirection for expvar func interface
  52. // expvar panics when publishing duplicate name
  53. // expvar does not support remove a registered name
  54. // so only register a func that calls raftStatus
  55. // and change raftStatus as we need.
  56. raftStatus func() raft.Status
  57. )
  58. func init() {
  59. raft.SetLogger(capnslog.NewPackageLogger("github.com/coreos/etcd", "raft"))
  60. expvar.Publish("raft.status", expvar.Func(func() interface{} {
  61. raftStatusMu.Lock()
  62. defer raftStatusMu.Unlock()
  63. return raftStatus()
  64. }))
  65. }
  66. type RaftTimer interface {
  67. Index() uint64
  68. Term() uint64
  69. }
  70. // apply contains entries, snapshot to be applied. Once
  71. // an apply is consumed, the entries will be persisted to
  72. // to raft storage concurrently; the application must read
  73. // raftDone before assuming the raft messages are stable.
  74. type apply struct {
  75. entries []raftpb.Entry
  76. snapshot raftpb.Snapshot
  77. raftDone <-chan struct{} // rx {} after raft has persisted messages
  78. }
  79. type raftNode struct {
  80. // Cache of the latest raft index and raft term the server has seen.
  81. // These three unit64 fields must be the first elements to keep 64-bit
  82. // alignment for atomic access to the fields.
  83. index uint64
  84. term uint64
  85. lead uint64
  86. mu sync.Mutex
  87. // last lead elected time
  88. lt time.Time
  89. // to check if msg receiver is removed from cluster
  90. isIDRemoved func(id uint64) bool
  91. raft.Node
  92. // a chan to send/receive snapshot
  93. msgSnapC chan raftpb.Message
  94. // a chan to send out apply
  95. applyc chan apply
  96. // a chan to send out readState
  97. readStateC chan raft.ReadState
  98. // utility
  99. ticker *time.Ticker
  100. // contention detectors for raft heartbeat message
  101. td *contention.TimeoutDetector
  102. heartbeat time.Duration // for logging
  103. raftStorage *raft.MemoryStorage
  104. storage Storage
  105. // transport specifies the transport to send and receive msgs to members.
  106. // Sending messages MUST NOT block. It is okay to drop messages, since
  107. // clients should timeout and reissue their messages.
  108. // If transport is nil, server will panic.
  109. transport rafthttp.Transporter
  110. stopped chan struct{}
  111. done chan struct{}
  112. }
  113. // start prepares and starts raftNode in a new goroutine. It is no longer safe
  114. // to modify the fields after it has been started.
  115. func (r *raftNode) start(rh *raftReadyHandler) {
  116. r.applyc = make(chan apply)
  117. r.stopped = make(chan struct{})
  118. r.done = make(chan struct{})
  119. internalTimeout := time.Second
  120. go func() {
  121. defer r.onStop()
  122. islead := false
  123. for {
  124. select {
  125. case <-r.ticker.C:
  126. r.Tick()
  127. case rd := <-r.Ready():
  128. if rd.SoftState != nil {
  129. if lead := atomic.LoadUint64(&r.lead); rd.SoftState.Lead != raft.None && lead != rd.SoftState.Lead {
  130. r.mu.Lock()
  131. r.lt = time.Now()
  132. r.mu.Unlock()
  133. leaderChanges.Inc()
  134. }
  135. if rd.SoftState.Lead == raft.None {
  136. hasLeader.Set(0)
  137. } else {
  138. hasLeader.Set(1)
  139. }
  140. atomic.StoreUint64(&r.lead, rd.SoftState.Lead)
  141. islead = rd.RaftState == raft.StateLeader
  142. rh.updateLeadership()
  143. }
  144. if len(rd.ReadStates) != 0 {
  145. select {
  146. case r.readStateC <- rd.ReadStates[len(rd.ReadStates)-1]:
  147. case <-time.After(internalTimeout):
  148. plog.Warningf("timed out sending read state")
  149. case <-r.stopped:
  150. return
  151. }
  152. }
  153. raftDone := make(chan struct{}, 1)
  154. ap := apply{
  155. entries: rd.CommittedEntries,
  156. snapshot: rd.Snapshot,
  157. raftDone: raftDone,
  158. }
  159. updateCommittedIndex(&ap, rh)
  160. select {
  161. case r.applyc <- ap:
  162. case <-r.stopped:
  163. return
  164. }
  165. // the leader can write to its disk in parallel with replicating to the followers and them
  166. // writing to their disks.
  167. // For more details, check raft thesis 10.2.1
  168. if islead {
  169. // gofail: var raftBeforeLeaderSend struct{}
  170. r.sendMessages(rd.Messages)
  171. }
  172. // gofail: var raftBeforeSave struct{}
  173. if err := r.storage.Save(rd.HardState, rd.Entries); err != nil {
  174. plog.Fatalf("raft save state and entries error: %v", err)
  175. }
  176. if !raft.IsEmptyHardState(rd.HardState) {
  177. proposalsCommitted.Set(float64(rd.HardState.Commit))
  178. }
  179. // gofail: var raftAfterSave struct{}
  180. if !raft.IsEmptySnap(rd.Snapshot) {
  181. // gofail: var raftBeforeSaveSnap struct{}
  182. if err := r.storage.SaveSnap(rd.Snapshot); err != nil {
  183. plog.Fatalf("raft save snapshot error: %v", err)
  184. }
  185. // gofail: var raftAfterSaveSnap struct{}
  186. r.raftStorage.ApplySnapshot(rd.Snapshot)
  187. plog.Infof("raft applied incoming snapshot at index %d", rd.Snapshot.Metadata.Index)
  188. // gofail: var raftAfterApplySnap struct{}
  189. }
  190. r.raftStorage.Append(rd.Entries)
  191. if !islead {
  192. // gofail: var raftBeforeFollowerSend struct{}
  193. r.sendMessages(rd.Messages)
  194. }
  195. raftDone <- struct{}{}
  196. r.Advance()
  197. case <-r.stopped:
  198. return
  199. }
  200. }
  201. }()
  202. }
  203. func updateCommittedIndex(ap *apply, rh *raftReadyHandler) {
  204. var ci uint64
  205. if len(ap.entries) != 0 {
  206. ci = ap.entries[len(ap.entries)-1].Index
  207. }
  208. if ap.snapshot.Metadata.Index > ci {
  209. ci = ap.snapshot.Metadata.Index
  210. }
  211. if ci != 0 {
  212. rh.updateCommittedIndex(ci)
  213. }
  214. }
  215. func (r *raftNode) sendMessages(ms []raftpb.Message) {
  216. sentAppResp := false
  217. for i := len(ms) - 1; i >= 0; i-- {
  218. if r.isIDRemoved(ms[i].To) {
  219. ms[i].To = 0
  220. }
  221. if ms[i].Type == raftpb.MsgAppResp {
  222. if sentAppResp {
  223. ms[i].To = 0
  224. } else {
  225. sentAppResp = true
  226. }
  227. }
  228. if ms[i].Type == raftpb.MsgSnap {
  229. // There are two separate data store: the store for v2, and the KV for v3.
  230. // The msgSnap only contains the most recent snapshot of store without KV.
  231. // So we need to redirect the msgSnap to etcd server main loop for merging in the
  232. // current store snapshot and KV snapshot.
  233. select {
  234. case r.msgSnapC <- ms[i]:
  235. default:
  236. // drop msgSnap if the inflight chan if full.
  237. }
  238. ms[i].To = 0
  239. }
  240. if ms[i].Type == raftpb.MsgHeartbeat {
  241. ok, exceed := r.td.Observe(ms[i].To)
  242. if !ok {
  243. // TODO: limit request rate.
  244. plog.Warningf("failed to send out heartbeat on time (exceeded the %v timeout for %v)", r.heartbeat, exceed)
  245. plog.Warningf("server is likely overloaded")
  246. }
  247. }
  248. }
  249. r.transport.Send(ms)
  250. }
  251. func (r *raftNode) apply() chan apply {
  252. return r.applyc
  253. }
  254. func (r *raftNode) leadElectedTime() time.Time {
  255. r.mu.Lock()
  256. defer r.mu.Unlock()
  257. return r.lt
  258. }
  259. func (r *raftNode) stop() {
  260. r.stopped <- struct{}{}
  261. <-r.done
  262. }
  263. func (r *raftNode) onStop() {
  264. r.Stop()
  265. r.ticker.Stop()
  266. r.transport.Stop()
  267. if err := r.storage.Close(); err != nil {
  268. plog.Panicf("raft close storage error: %v", err)
  269. }
  270. close(r.done)
  271. }
  272. // for testing
  273. func (r *raftNode) pauseSending() {
  274. p := r.transport.(rafthttp.Pausable)
  275. p.Pause()
  276. }
  277. func (r *raftNode) resumeSending() {
  278. p := r.transport.(rafthttp.Pausable)
  279. p.Resume()
  280. }
  281. // advanceTicksForElection advances ticks to the node for fast election.
  282. // This reduces the time to wait for first leader election if bootstrapping the whole
  283. // cluster, while leaving at least 1 heartbeat for possible existing leader
  284. // to contact it.
  285. func advanceTicksForElection(n raft.Node, electionTicks int) {
  286. for i := 0; i < electionTicks-1; i++ {
  287. n.Tick()
  288. }
  289. }
  290. func startNode(cfg *ServerConfig, cl *membership.RaftCluster, ids []types.ID) (id types.ID, n raft.Node, s *raft.MemoryStorage, w *wal.WAL) {
  291. var err error
  292. member := cl.MemberByName(cfg.Name)
  293. metadata := pbutil.MustMarshal(
  294. &pb.Metadata{
  295. NodeID: uint64(member.ID),
  296. ClusterID: uint64(cl.ID()),
  297. },
  298. )
  299. if w, err = wal.Create(cfg.WALDir(), metadata); err != nil {
  300. plog.Fatalf("create wal error: %v", err)
  301. }
  302. peers := make([]raft.Peer, len(ids))
  303. for i, id := range ids {
  304. ctx, err := json.Marshal((*cl).Member(id))
  305. if err != nil {
  306. plog.Panicf("marshal member should never fail: %v", err)
  307. }
  308. peers[i] = raft.Peer{ID: uint64(id), Context: ctx}
  309. }
  310. id = member.ID
  311. plog.Infof("starting member %s in cluster %s", id, cl.ID())
  312. s = raft.NewMemoryStorage()
  313. c := &raft.Config{
  314. ID: uint64(id),
  315. ElectionTick: cfg.ElectionTicks,
  316. HeartbeatTick: 1,
  317. Storage: s,
  318. MaxSizePerMsg: maxSizePerMsg,
  319. MaxInflightMsgs: maxInflightMsgs,
  320. CheckQuorum: true,
  321. }
  322. n = raft.StartNode(c, peers)
  323. raftStatusMu.Lock()
  324. raftStatus = n.Status
  325. raftStatusMu.Unlock()
  326. advanceTicksForElection(n, c.ElectionTick)
  327. return
  328. }
  329. func restartNode(cfg *ServerConfig, snapshot *raftpb.Snapshot) (types.ID, *membership.RaftCluster, raft.Node, *raft.MemoryStorage, *wal.WAL) {
  330. var walsnap walpb.Snapshot
  331. if snapshot != nil {
  332. walsnap.Index, walsnap.Term = snapshot.Metadata.Index, snapshot.Metadata.Term
  333. }
  334. w, id, cid, st, ents := readWAL(cfg.WALDir(), walsnap)
  335. plog.Infof("restarting member %s in cluster %s at commit index %d", id, cid, st.Commit)
  336. cl := membership.NewCluster("")
  337. cl.SetID(cid)
  338. s := raft.NewMemoryStorage()
  339. if snapshot != nil {
  340. s.ApplySnapshot(*snapshot)
  341. }
  342. s.SetHardState(st)
  343. s.Append(ents)
  344. c := &raft.Config{
  345. ID: uint64(id),
  346. ElectionTick: cfg.ElectionTicks,
  347. HeartbeatTick: 1,
  348. Storage: s,
  349. MaxSizePerMsg: maxSizePerMsg,
  350. MaxInflightMsgs: maxInflightMsgs,
  351. CheckQuorum: true,
  352. }
  353. n := raft.RestartNode(c)
  354. raftStatusMu.Lock()
  355. raftStatus = n.Status
  356. raftStatusMu.Unlock()
  357. advanceTicksForElection(n, c.ElectionTick)
  358. return id, cl, n, s, w
  359. }
  360. func restartAsStandaloneNode(cfg *ServerConfig, snapshot *raftpb.Snapshot) (types.ID, *membership.RaftCluster, raft.Node, *raft.MemoryStorage, *wal.WAL) {
  361. var walsnap walpb.Snapshot
  362. if snapshot != nil {
  363. walsnap.Index, walsnap.Term = snapshot.Metadata.Index, snapshot.Metadata.Term
  364. }
  365. w, id, cid, st, ents := readWAL(cfg.WALDir(), walsnap)
  366. // discard the previously uncommitted entries
  367. for i, ent := range ents {
  368. if ent.Index > st.Commit {
  369. plog.Infof("discarding %d uncommitted WAL entries ", len(ents)-i)
  370. ents = ents[:i]
  371. break
  372. }
  373. }
  374. // force append the configuration change entries
  375. toAppEnts := createConfigChangeEnts(getIDs(snapshot, ents), uint64(id), st.Term, st.Commit)
  376. ents = append(ents, toAppEnts...)
  377. // force commit newly appended entries
  378. err := w.Save(raftpb.HardState{}, toAppEnts)
  379. if err != nil {
  380. plog.Fatalf("%v", err)
  381. }
  382. if len(ents) != 0 {
  383. st.Commit = ents[len(ents)-1].Index
  384. }
  385. plog.Printf("forcing restart of member %s in cluster %s at commit index %d", id, cid, st.Commit)
  386. cl := membership.NewCluster("")
  387. cl.SetID(cid)
  388. s := raft.NewMemoryStorage()
  389. if snapshot != nil {
  390. s.ApplySnapshot(*snapshot)
  391. }
  392. s.SetHardState(st)
  393. s.Append(ents)
  394. c := &raft.Config{
  395. ID: uint64(id),
  396. ElectionTick: cfg.ElectionTicks,
  397. HeartbeatTick: 1,
  398. Storage: s,
  399. MaxSizePerMsg: maxSizePerMsg,
  400. MaxInflightMsgs: maxInflightMsgs,
  401. }
  402. n := raft.RestartNode(c)
  403. raftStatus = n.Status
  404. return id, cl, n, s, w
  405. }
  406. // getIDs returns an ordered set of IDs included in the given snapshot and
  407. // the entries. The given snapshot/entries can contain two kinds of
  408. // ID-related entry:
  409. // - ConfChangeAddNode, in which case the contained ID will be added into the set.
  410. // - ConfChangeRemoveNode, in which case the contained ID will be removed from the set.
  411. func getIDs(snap *raftpb.Snapshot, ents []raftpb.Entry) []uint64 {
  412. ids := make(map[uint64]bool)
  413. if snap != nil {
  414. for _, id := range snap.Metadata.ConfState.Nodes {
  415. ids[id] = true
  416. }
  417. }
  418. for _, e := range ents {
  419. if e.Type != raftpb.EntryConfChange {
  420. continue
  421. }
  422. var cc raftpb.ConfChange
  423. pbutil.MustUnmarshal(&cc, e.Data)
  424. switch cc.Type {
  425. case raftpb.ConfChangeAddNode:
  426. ids[cc.NodeID] = true
  427. case raftpb.ConfChangeRemoveNode:
  428. delete(ids, cc.NodeID)
  429. case raftpb.ConfChangeUpdateNode:
  430. // do nothing
  431. default:
  432. plog.Panicf("ConfChange Type should be either ConfChangeAddNode or ConfChangeRemoveNode!")
  433. }
  434. }
  435. sids := make(types.Uint64Slice, 0, len(ids))
  436. for id := range ids {
  437. sids = append(sids, id)
  438. }
  439. sort.Sort(sids)
  440. return []uint64(sids)
  441. }
  442. // createConfigChangeEnts creates a series of Raft entries (i.e.
  443. // EntryConfChange) to remove the set of given IDs from the cluster. The ID
  444. // `self` is _not_ removed, even if present in the set.
  445. // If `self` is not inside the given ids, it creates a Raft entry to add a
  446. // default member with the given `self`.
  447. func createConfigChangeEnts(ids []uint64, self uint64, term, index uint64) []raftpb.Entry {
  448. ents := make([]raftpb.Entry, 0)
  449. next := index + 1
  450. found := false
  451. for _, id := range ids {
  452. if id == self {
  453. found = true
  454. continue
  455. }
  456. cc := &raftpb.ConfChange{
  457. Type: raftpb.ConfChangeRemoveNode,
  458. NodeID: id,
  459. }
  460. e := raftpb.Entry{
  461. Type: raftpb.EntryConfChange,
  462. Data: pbutil.MustMarshal(cc),
  463. Term: term,
  464. Index: next,
  465. }
  466. ents = append(ents, e)
  467. next++
  468. }
  469. if !found {
  470. m := membership.Member{
  471. ID: types.ID(self),
  472. RaftAttributes: membership.RaftAttributes{PeerURLs: []string{"http://localhost:2380"}},
  473. }
  474. ctx, err := json.Marshal(m)
  475. if err != nil {
  476. plog.Panicf("marshal member should never fail: %v", err)
  477. }
  478. cc := &raftpb.ConfChange{
  479. Type: raftpb.ConfChangeAddNode,
  480. NodeID: self,
  481. Context: ctx,
  482. }
  483. e := raftpb.Entry{
  484. Type: raftpb.EntryConfChange,
  485. Data: pbutil.MustMarshal(cc),
  486. Term: term,
  487. Index: next,
  488. }
  489. ents = append(ents, e)
  490. }
  491. return ents
  492. }