raft/raft.go
func (r *raft) reduceUncommittedSize(ents []pb.Entry) {
	if r.uncommittedSize == 0 {
		// Fast-path for followers, who do not track or enforce the limit.
		return
	}

	var s uint64
	for _, e := range ents {
		s += uint64(PayloadSize(e))
	}
	if s > r.uncommittedSize {
		// uncommittedSize may underestimate the size of the uncommitted Raft
		// log tail but will never overestimate it. Saturate at 0 instead of
		// allowing overflow.
		r.uncommittedSize = 0
	} else {
		r.uncommittedSize -= s
	}
}
func (r *raft) reduceUncommittedSize(ents []pb.Entry) {
	if r.uncommittedSize == 0 {
		// Fast-path for followers, who do not track or enforce the limit.
		return
	}

	var s uint64
	for _, e := range ents {
		s += uint64(PayloadSize(e))
	}
	if s > r.uncommittedSize {
		// uncommittedSize may underestimate the size of the uncommitted Raft
		// log tail but will never overestimate it. Saturate at 0 instead of
		// allowing overflow.
		r.uncommittedSize = 0
	} else {
		r.uncommittedSize -= s
	}
}
func ( r * raft ) reduceUncommittedSize ( ents [ ] pb . Entry ) { if r . uncommittedSize == 0 { // Fast-path for followers, who do not track or enforce the limit. return } var s uint64 for _ , e := range ents { s += uint64 ( PayloadSize ( e ) ) } if s > r . uncommittedSize { // uncommittedSize may underestimate the size of the uncommitted Raft // log tail but will never overestimate it. Saturate at 0 instead of // allowing overflow. r . uncommittedSize = 0 } else { r . uncommittedSize -= s } }
// reduceUncommittedSize accounts for the newly committed entries by decreasing
// the uncommitted entry size limit.
reduceUncommittedSize accounts for the newly committed entries by decreasing the uncommitted entry size limit .