Method commitDone

consensus/vbft/block_pool.go:502–556

check if has reached consensus on block-commit return @ consensused proposer @ for empty commit @ consensused Note: Attentions on lock contention. Only shared-lock for this function, because this function will also acquires shared-lock on peer-pool.

(blkNum uint32, C uint32, N uint32)

// Only shared-lock for this function, because this function will also acquires shared-lock on peer-pool.
//
func (pool *BlockPool) commitDone(blkNum uint32, C uint32, N uint32) (uint32, bool, bool) {
	pool.lock.RLock()
	defer pool.lock.RUnlock()
	candidate := pool.candidateBlocks[blkNum]
	if candidate == nil {
		return math.MaxUint32, false, false
	}

	// check consensus with commit msgs
	proposer, forEmpty := getCommitConsensus(candidate.CommitMsgs, int(C), int(N))

	// enforce signature quorum if checking commit-consensus base on signature count
	// if C <= (N-1)/3, N-1-C >= 2*C
	C = N - 1 - C
	if proposer == math.MaxUint32 {
		// check consensus with endorse sigs
		var emptyCnt uint32
		endorseCnt := make(map[uint32]uint32) // proposer -> endorsed-cnt
		for endorser, eSigs := range candidate.EndorseSigs {
			// check if from endorser
			if !pool.server.isEndorser(blkNum, endorser) {
				for _, sig := range eSigs {
					if sig.ForEmpty {
						emptyCnt++
					}
				}
			}

			for _, sig := range eSigs {
				if sig.ForEmpty {
					emptyCnt++
				} else {
					endorseCnt[sig.EndorsedProposer] += 1
					if endorseCnt[sig.EndorsedProposer] > C {
						proposer = sig.EndorsedProposer
						if !forEmpty {
							forEmpty = emptyCnt > C
						}
						break
					}
				}
			}

			if proposer != math.MaxUint32 {
				break
			}
		}
	}

	if proposer != math.MaxUint32 {
		return proposer, forEmpty, true
	}

	return math.MaxUint32, false, false
}

//
// @ set BlockPool as committed for given BlockNum