Differential D10268 Diff 30365 src/avalanche/test/processor_tests.cpp

Changeset View

Standalone View

src/avalanche/test/processor_tests.cpp

Show First 20 Lines • Show All 702 Lines • ▼ Show 20 Lines	BOOST_AUTO_TEST_CASE(poll_and_response) {
BOOST_CHECK_EQUAL(getSuitableNodeToQuery(), avanodeid);		BOOST_CHECK_EQUAL(getSuitableNodeToQuery(), avanodeid);

// But they are accepted in order.		// But they are accepted in order.
resp = {getRound(), 0, {Vote(0, blockHash2), Vote(0, blockHash)}};		resp = {getRound(), 0, {Vote(0, blockHash2), Vote(0, blockHash)}};
runEventLoop();		runEventLoop();
BOOST_CHECK(registerVotes(avanodeid, resp, updates));		BOOST_CHECK(registerVotes(avanodeid, resp, updates));
BOOST_CHECK_EQUAL(updates.size(), 0);		BOOST_CHECK_EQUAL(updates.size(), 0);
BOOST_CHECK_EQUAL(getSuitableNodeToQuery(), avanodeid);		BOOST_CHECK_EQUAL(getSuitableNodeToQuery(), avanodeid);
		}

		BOOST_AUTO_TEST_CASE(dont_poll_invalid_block) {
		std::vector<BlockUpdate> updates;

		CBlock blockA = CreateAndProcessBlock({}, CScript());
		CBlock blockB = CreateAndProcessBlock({}, CScript());
		const BlockHash blockHashA = blockA.GetHash();
		const BlockHash blockHashB = blockB.GetHash();
		const CBlockIndex *pindexA;
		CBlockIndex *pindexB;
		{
		LOCK(cs_main);
		pindexA = LookupBlockIndex(blockHashA);
		pindexB = LookupBlockIndex(blockHashB);
		}

		auto avanodes = ConnectNodes();

		// Register the blocks and check they are added to the list of elements to
		// poll.
		BOOST_CHECK(m_processor->addBlockToReconcile(pindexA));
		BOOST_CHECK(m_processor->addBlockToReconcile(pindexB));
		auto invs = getInvsForNextPoll();
		BOOST_CHECK_EQUAL(invs.size(), 2);
		BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
		BOOST_CHECK(invs[0].hash == blockHashB);
		BOOST_CHECK_EQUAL(invs[1].type, MSG_BLOCK);
		BOOST_CHECK(invs[1].hash == blockHashA);

// When a block is marked invalid, stop polling.		// When a block is marked invalid, stop polling.
pindex2->nStatus = pindex2->nStatus.withFailed();		pindexB->nStatus = pindexB->nStatus.withFailed();
resp = {getRound(), 0, {Vote(0, blockHash)}};		Response resp{getRound(), 0, {Vote(0, blockHashA)}};
runEventLoop();		runEventLoop();
BOOST_CHECK(registerVotes(avanodeid, resp, updates));		BOOST_CHECK(registerVotes(avanodes[0]->GetId(), resp, updates));
BOOST_CHECK_EQUAL(updates.size(), 0);		BOOST_CHECK_EQUAL(updates.size(), 0);
BOOST_CHECK_EQUAL(getSuitableNodeToQuery(), avanodeid);
}		}

BOOST_AUTO_TEST_CASE(poll_inflight_timeout, *boost::unit_test::timeout(60)) {		BOOST_AUTO_TEST_CASE(poll_inflight_timeout, *boost::unit_test::timeout(60)) {
std::vector<BlockUpdate> updates;		std::vector<BlockUpdate> updates;

CBlock block = CreateAndProcessBlock({}, CScript());		CBlock block = CreateAndProcessBlock({}, CScript());
const BlockHash blockHash = block.GetHash();		const BlockHash blockHash = block.GetHash();
const CBlockIndex *pindex;		const CBlockIndex *pindex;
▲ Show 20 Lines • Show All 321 Lines • Show Last 20 Lines