63 lines
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			63 lines
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C
		
	
	
	
/*
 | 
						|
 * Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
 | 
						|
 *
 | 
						|
 * This program is free software: you can use, redistribute, and/or modify
 | 
						|
 * it under the terms of the GNU Affero General Public License, version 3
 | 
						|
 * or later ("AGPL"), as published by the Free Software Foundation.
 | 
						|
 *
 | 
						|
 * This program is distributed in the hope that it will be useful, but WITHOUT
 | 
						|
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 | 
						|
 * FITNESS FOR A PARTICULAR PURPOSE.
 | 
						|
 *
 | 
						|
 * You should have received a copy of the GNU Affero General Public License
 | 
						|
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 | 
						|
 */
 | 
						|
 | 
						|
#ifndef _TD_LIBS_SYNC_COMMIT_H
 | 
						|
#define _TD_LIBS_SYNC_COMMIT_H
 | 
						|
 | 
						|
#ifdef __cplusplus
 | 
						|
extern "C" {
 | 
						|
#endif
 | 
						|
 | 
						|
#include "syncInt.h"
 | 
						|
 | 
						|
// \* Leader i advances its commitIndex.
 | 
						|
// \* This is done as a separate step from handling AppendEntries responses,
 | 
						|
// \* in part to minimize atomic regions, and in part so that leaders of
 | 
						|
// \* single-server clusters are able to mark entries committed.
 | 
						|
// AdvanceCommitIndex(i) ==
 | 
						|
//     /\ state[i] = Leader
 | 
						|
//     /\ LET \* The set of servers that agree up through index.
 | 
						|
//            Agree(index) == {i} \cup {k \in Server :
 | 
						|
//                                          matchIndex[i][k] >= index}
 | 
						|
//            \* The maximum indexes for which a quorum agrees
 | 
						|
//            agreeIndexes == {index \in 1..Len(log[i]) :
 | 
						|
//                                 Agree(index) \in Quorum}
 | 
						|
//            \* New value for commitIndex'[i]
 | 
						|
//            newCommitIndex ==
 | 
						|
//               IF /\ agreeIndexes /= {}
 | 
						|
//                  /\ log[i][Max(agreeIndexes)].term = currentTerm[i]
 | 
						|
//               THEN
 | 
						|
//                   Max(agreeIndexes)
 | 
						|
//               ELSE
 | 
						|
//                   commitIndex[i]
 | 
						|
//        IN commitIndex' = [commitIndex EXCEPT ![i] = newCommitIndex]
 | 
						|
//     /\ UNCHANGED <<messages, serverVars, candidateVars, leaderVars, log>>
 | 
						|
//
 | 
						|
void syncOneReplicaAdvance(SSyncNode* pSyncNode);
 | 
						|
void syncMaybeAdvanceCommitIndex(SSyncNode* pSyncNode);
 | 
						|
 | 
						|
bool syncNodeAgreedUpon(SSyncNode* pNode, SyncIndex index);
 | 
						|
 | 
						|
int64_t syncNodeUpdateCommitIndex(SSyncNode* ths, SyncIndex commitIndex);
 | 
						|
int64_t syncNodeCheckCommitIndex(SSyncNode* ths, SyncIndex indexLikely);
 | 
						|
 | 
						|
int64_t syncNodeUpdateAssignedCommitIndex(SSyncNode* ths, SyncIndex assignedCommitIndex);
 | 
						|
 | 
						|
#ifdef __cplusplus
 | 
						|
}
 | 
						|
#endif
 | 
						|
 | 
						|
#endif /*_TD_LIBS_SYNC_COMMIT_H*/
 |