2014-05-27 23:24:49 +04:00
|
|
|
package raft
|
|
|
|
|
|
|
|
type Entry struct {
|
|
|
|
Term int
|
|
|
|
Data []byte
|
|
|
|
}
|
|
|
|
|
|
|
|
type log struct {
|
|
|
|
ents []Entry
|
|
|
|
commit int
|
|
|
|
applied int
|
|
|
|
}
|
|
|
|
|
|
|
|
func newLog() *log {
|
|
|
|
return &log{
|
|
|
|
ents: make([]Entry, 1, 1024),
|
|
|
|
commit: 0,
|
|
|
|
applied: 0,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (l *log) maybeAppend(index, logTerm int, ents ...Entry) bool {
|
2014-05-28 09:47:13 +04:00
|
|
|
if l.matchTerm(index, logTerm) {
|
2014-05-27 23:24:49 +04:00
|
|
|
l.append(index, ents...)
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
func (l *log) append(after int, ents ...Entry) int {
|
|
|
|
l.ents = append(l.ents[:after+1], ents...)
|
|
|
|
return len(l.ents) - 1
|
|
|
|
}
|
|
|
|
|
2014-05-28 09:50:47 +04:00
|
|
|
func (l *log) lastIndex() int {
|
2014-05-27 23:24:49 +04:00
|
|
|
return len(l.ents) - 1
|
|
|
|
}
|
|
|
|
|
|
|
|
func (l *log) term(i int) int {
|
2014-05-28 09:50:47 +04:00
|
|
|
if i > l.lastIndex() {
|
2014-05-27 23:24:49 +04:00
|
|
|
return -1
|
|
|
|
}
|
|
|
|
return l.ents[i].Term
|
|
|
|
}
|
|
|
|
|
|
|
|
func (l *log) entries(i int) []Entry {
|
2014-05-28 09:50:47 +04:00
|
|
|
if i > l.lastIndex() {
|
2014-05-27 23:24:49 +04:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return l.ents[i:]
|
|
|
|
}
|
|
|
|
|
|
|
|
func (l *log) isUpToDate(i, term int) bool {
|
|
|
|
// LET upToDate == \/ m.mlastLogTerm > LastTerm(log[i])
|
|
|
|
// \/ /\ m.mlastLogTerm = LastTerm(log[i])
|
|
|
|
// /\ m.mlastLogIndex >= Len(log[i])
|
2014-05-28 09:50:47 +04:00
|
|
|
e := l.ents[l.lastIndex()]
|
|
|
|
return term > e.Term || (term == e.Term && i >= l.lastIndex())
|
2014-05-27 23:24:49 +04:00
|
|
|
}
|
|
|
|
|
2014-05-28 09:47:13 +04:00
|
|
|
func (l *log) matchTerm(i, term int) bool {
|
2014-05-28 09:50:47 +04:00
|
|
|
if i > l.lastIndex() {
|
2014-05-27 23:24:49 +04:00
|
|
|
return false
|
|
|
|
}
|
|
|
|
return l.ents[i].Term == term
|
|
|
|
}
|
|
|
|
|
|
|
|
func (l *log) nextEnts() (ents []Entry) {
|
|
|
|
if l.commit > l.applied {
|
|
|
|
ents = l.ents[l.applied+1 : l.commit+1]
|
|
|
|
l.applied = l.commit
|
|
|
|
}
|
|
|
|
return ents
|
|
|
|
}
|