59 lines
1.8 KiB
JavaScript
59 lines
1.8 KiB
JavaScript
load("jstests/replsets/rslib.js");
|
|
|
|
(function() {
|
|
"use strict";
|
|
|
|
function getCurrentTerm(primary) {
|
|
var res = primary.adminCommand({replSetGetStatus: 1});
|
|
assert.commandWorked(res);
|
|
return res.term;
|
|
}
|
|
|
|
var name = "restore_term";
|
|
var rst = new ReplSetTest({name: name, nodes: 2});
|
|
|
|
rst.startSet();
|
|
// Initiate the replset in protocol version 1.
|
|
var conf = rst.getReplSetConfig();
|
|
conf.settings = conf.settings || { };
|
|
conf.settings.protocolVersion = 1;
|
|
rst.initiate(conf);
|
|
rst.awaitSecondaryNodes();
|
|
|
|
var primary = rst.getMaster();
|
|
var primaryColl = primary.getDB("test").coll;
|
|
|
|
// Current term may be greater than 1 if election race happens.
|
|
var firstSuccessfulTerm = getCurrentTerm(primary);
|
|
assert.gte(firstSuccessfulTerm, 1);
|
|
assert.writeOK(primaryColl.insert({x: 1}, {writeConcern: {w: "majority"}}));
|
|
assert.eq(getCurrentTerm(primary), firstSuccessfulTerm);
|
|
|
|
// Check that the insert op has the initial term.
|
|
var latestOp = getLatestOp(primary);
|
|
assert.eq(latestOp.op, "i");
|
|
assert.eq(latestOp.t, firstSuccessfulTerm);
|
|
|
|
// Step down to increase the term.
|
|
try {
|
|
var res = primary.adminCommand({replSetStepDown: 0});
|
|
} catch (err) {
|
|
print("caught: " + err + " on stepdown");
|
|
}
|
|
rst.awaitSecondaryNodes();
|
|
// The secondary became the new primary now with a higher term.
|
|
// Since there's only one secondary who may run for election, the new term is higher by 1.
|
|
assert.eq(getCurrentTerm(rst.getMaster()), firstSuccessfulTerm + 1);
|
|
|
|
// Restart the replset and verify the term is the same.
|
|
rst.stopSet(null /* signal */, true /* forRestart */);
|
|
rst.startSet({restart: true});
|
|
rst.awaitSecondaryNodes();
|
|
primary = rst.getMaster();
|
|
|
|
assert.eq(primary.getDB("test").coll.find().itcount(), 1);
|
|
// After restart, the new primary stands up with the newer term.
|
|
assert.gte(getCurrentTerm(primary), firstSuccessfulTerm + 1);
|
|
|
|
})();
|