Differential D2042 Diff 5831 src/test/avalanche_tests.cpp

Changeset View

Standalone View

src/test/avalanche_tests.cpp

// Copyright (c) 2010 The Bitcoin developers		// Copyright (c) 2010 The Bitcoin developers
// Distributed under the MIT software license, see the accompanying		// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.		// file COPYING or http://www.opensource.org/licenses/mit-license.php.

#include "avalanche_impl.h"		#include "avalanche.h"

#include "test/test_bitcoin.h"		#include "test/test_bitcoin.h"

#include <boost/test/unit_test.hpp>		#include <boost/test/unit_test.hpp>

BOOST_FIXTURE_TEST_SUITE(avalanche_tests, BasicTestingSetup)		BOOST_FIXTURE_TEST_SUITE(avalanche_tests, BasicTestingSetup)

#define REGISTER_VOTE_AND_CHECK(vr, vote, state, finalized, confidence) \		#define REGISTER_VOTE_AND_CHECK(vr, vote, state, finalized, confidence) \
▲ Show 20 Lines • Show All 47 Lines • ▼ Show 20 Lines	for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE; i++) {
REGISTER_VOTE_AND_CHECK(vr, false, false, false, i);		REGISTER_VOTE_AND_CHECK(vr, false, false, false, i);
}		}

// The next vote will finalize the decision.		// The next vote will finalize the decision.
REGISTER_VOTE_AND_CHECK(vr, true, false, true,		REGISTER_VOTE_AND_CHECK(vr, true, false, true,
AVALANCHE_FINALIZATION_SCORE);		AVALANCHE_FINALIZATION_SCORE);
}		}

		BOOST_AUTO_TEST_CASE(block_register) {
		AvalancheProcessor p;
		CBlockIndex index;

		// Make sure the block has a hash.
		const uint256 zeroHash;
		index.phashBlock = &zeroHash;

		// Querying for random block returns false.
		BOOST_CHECK(!p.isAccepted(&index));
		BOOST_CHECK(!p.hasFinalized(&index));

		// Newly added blocks are also considered rejected.
		BOOST_CHECK(p.addBlockToReconcile(&index));
		BOOST_CHECK(!p.isAccepted(&index));
		BOOST_CHECK(!p.hasFinalized(&index));

		// Let's vote for this block a few times.
		AvalancheResponse resp{{AvalancheVote(0, zeroHash)}};
		for (int i = 0; i < 5; i++) {
		p.registerVotes(resp);
		BOOST_CHECK(!p.isAccepted(&index));
		BOOST_CHECK(!p.hasFinalized(&index));
		}

		// Now it is accepted, but we can vote for it numerous times.
		for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE; i++) {
		p.registerVotes(resp);
		BOOST_CHECK(p.isAccepted(&index));
		BOOST_CHECK(!p.hasFinalized(&index));
		}

		// Now finalize the decision.
		resp = {{AvalancheVote(1, zeroHash)}};
		p.registerVotes(resp);
		BOOST_CHECK(p.isAccepted(&index));
		BOOST_CHECK(p.hasFinalized(&index));

		// Now let's undo this and finalize rejection.
		for (int i = 0; i < 5; i++) {
		p.registerVotes(resp);
		BOOST_CHECK(p.isAccepted(&index));
		BOOST_CHECK(p.hasFinalized(&index));
		}

		// Now it is rejected, but we can vote for it numerous times.
		for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE; i++) {
		p.registerVotes(resp);
		BOOST_CHECK(!p.isAccepted(&index));
		BOOST_CHECK(!p.hasFinalized(&index));
		}

		// Now finalize the decision.
		p.registerVotes(resp);
		BOOST_CHECK(!p.isAccepted(&index));
		BOOST_CHECK(p.hasFinalized(&index));

		// Adding the block twice does nothing.
		BOOST_CHECK(!p.addBlockToReconcile(&index));
		BOOST_CHECK(!p.isAccepted(&index));
		BOOST_CHECK(p.hasFinalized(&index));
		}

BOOST_AUTO_TEST_SUITE_END()		BOOST_AUTO_TEST_SUITE_END()