Page MenuHomePhabricator
Differential D9720 Diff 29081 src/avalanche/test/peermanager_tests.cpp

Changeset View

Standalone View

View Options

src/avalanche/test/peermanager_tests.cpp

Show First 20 Lines • Show All 156 Lines • ▼ Show 20 Lines
static std::shared_ptr<Proof> getRandomProofPtr(uint32_t score) { static std::shared_ptr<Proof> getRandomProofPtr(uint32_t score) {
return std::make_shared<Proof>(buildRandomProof(score)); return std::make_shared<Proof>(buildRandomProof(score));
} }
static void addNodeWithScore(avalanche::PeerManager &pm, NodeId node, static void addNodeWithScore(avalanche::PeerManager &pm, NodeId node,
uint32_t score) { uint32_t score) {
auto proof = getRandomProofPtr(score); auto proof = getRandomProofPtr(score);
BOOST_CHECK_NE(pm.getPeerId(proof), NO_PEER); BOOST_CHECK_NE(pm.getPeerId(proof), NO_PEER);
Delegation dg = DelegationBuilder(*proof).build(); BOOST_CHECK(pm.addNode(node, proof->getId()));
BOOST_CHECK(pm.addNode(node, dg));
}; };
BOOST_AUTO_TEST_CASE(peer_probabilities) { BOOST_AUTO_TEST_CASE(peer_probabilities) {
// No peers. // No peers.
avalanche::PeerManager pm; avalanche::PeerManager pm;
BOOST_CHECK_EQUAL(pm.selectNode(), NO_NODE); BOOST_CHECK_EQUAL(pm.selectNode(), NO_NODE);
const NodeId node0 = 42, node1 = 69, node2 = 37; const NodeId node0 = 42, node1 = 69, node2 = 37;
Show All 32 LinesBOOST_AUTO_TEST_CASE(remove_peer) {
avalanche::PeerManager pm; avalanche::PeerManager pm;
BOOST_CHECK_EQUAL(pm.selectPeer(), NO_PEER); BOOST_CHECK_EQUAL(pm.selectPeer(), NO_PEER);
// Add 4 peers. // Add 4 peers.
std::array<PeerId, 8> peerids; std::array<PeerId, 8> peerids;
for (int i = 0; i < 4; i++) { for (int i = 0; i < 4; i++) {
auto p = getRandomProofPtr(100); auto p = getRandomProofPtr(100);
peerids[i] = pm.getPeerId(p); peerids[i] = pm.getPeerId(p);
BOOST_CHECK( BOOST_CHECK(pm.addNode(InsecureRand32(), p->getId()));
pm.addNode(InsecureRand32(), DelegationBuilder(*p).build()));
} }
BOOST_CHECK_EQUAL(pm.getSlotCount(), 400); BOOST_CHECK_EQUAL(pm.getSlotCount(), 400);
BOOST_CHECK_EQUAL(pm.getFragmentation(), 0); BOOST_CHECK_EQUAL(pm.getFragmentation(), 0);
for (int i = 0; i < 100; i++) { for (int i = 0; i < 100; i++) {
PeerId p = pm.selectPeer(); PeerId p = pm.selectPeer();
BOOST_CHECK(p == peerids[0] || p == peerids[1] || p == peerids[2] || BOOST_CHECK(p == peerids[0] || p == peerids[1] || p == peerids[2] ||
Show All 15 Lines for (int i = 0; i < 100; i++) {
PeerId p = pm.selectPeer(); PeerId p = pm.selectPeer();
BOOST_CHECK(p == peerids[0] || p == peerids[1] || p == peerids[3]); BOOST_CHECK(p == peerids[0] || p == peerids[1] || p == peerids[3]);
} }
// Add 4 more peers. // Add 4 more peers.
for (int i = 0; i < 4; i++) { for (int i = 0; i < 4; i++) {
auto p = getRandomProofPtr(100); auto p = getRandomProofPtr(100);
peerids[i + 4] = pm.getPeerId(p); peerids[i + 4] = pm.getPeerId(p);
BOOST_CHECK( BOOST_CHECK(pm.addNode(InsecureRand32(), p->getId()));
pm.addNode(InsecureRand32(), DelegationBuilder(*p).build()));
} }
BOOST_CHECK_EQUAL(pm.getSlotCount(), 700); BOOST_CHECK_EQUAL(pm.getSlotCount(), 700);
BOOST_CHECK_EQUAL(pm.getFragmentation(), 0); BOOST_CHECK_EQUAL(pm.getFragmentation(), 0);
BOOST_CHECK(pm.removePeer(peerids[0])); BOOST_CHECK(pm.removePeer(peerids[0]));
BOOST_CHECK_EQUAL(pm.getSlotCount(), 700); BOOST_CHECK_EQUAL(pm.getSlotCount(), 700);
BOOST_CHECK_EQUAL(pm.getFragmentation(), 100); BOOST_CHECK_EQUAL(pm.getFragmentation(), 100);
Show All 25 Lines
BOOST_AUTO_TEST_CASE(compact_slots) { BOOST_AUTO_TEST_CASE(compact_slots) {
avalanche::PeerManager pm; avalanche::PeerManager pm;
// Add 4 peers. // Add 4 peers.
std::array<PeerId, 4> peerids; std::array<PeerId, 4> peerids;
for (int i = 0; i < 4; i++) { for (int i = 0; i < 4; i++) {
auto p = getRandomProofPtr(100); auto p = getRandomProofPtr(100);
peerids[i] = pm.getPeerId(p); peerids[i] = pm.getPeerId(p);
BOOST_CHECK( BOOST_CHECK(pm.addNode(InsecureRand32(), p->getId()));
pm.addNode(InsecureRand32(), DelegationBuilder(*p).build()));
} }
// Remove all peers. // Remove all peers.
for (auto p : peerids) { for (auto p : peerids) {
pm.removePeer(p); pm.removePeer(p);
} }
BOOST_CHECK_EQUAL(pm.getSlotCount(), 300); BOOST_CHECK_EQUAL(pm.getSlotCount(), 300);
Show All 10 Lines
} }
BOOST_AUTO_TEST_CASE(node_crud) { BOOST_AUTO_TEST_CASE(node_crud) {
avalanche::PeerManager pm; avalanche::PeerManager pm;
// Create one peer. // Create one peer.
auto proof = getRandomProofPtr(10000000 * MIN_VALID_PROOF_SCORE); auto proof = getRandomProofPtr(10000000 * MIN_VALID_PROOF_SCORE);
BOOST_CHECK_NE(pm.getPeerId(proof), NO_PEER); BOOST_CHECK_NE(pm.getPeerId(proof), NO_PEER);
Delegation dg = DelegationBuilder(*proof).build();
BOOST_CHECK_EQUAL(pm.selectNode(), NO_NODE); BOOST_CHECK_EQUAL(pm.selectNode(), NO_NODE);
// Add 4 nodes. // Add 4 nodes.
const ProofId &proofid = proof->getId();
for (int i = 0; i < 4; i++) { for (int i = 0; i < 4; i++) {
BOOST_CHECK(pm.addNode(i, dg)); BOOST_CHECK(pm.addNode(i, proofid));
} }
for (int i = 0; i < 100; i++) { for (int i = 0; i < 100; i++) {
NodeId n = pm.selectNode(); NodeId n = pm.selectNode();
BOOST_CHECK(n >= 0 && n < 4); BOOST_CHECK(n >= 0 && n < 4);
BOOST_CHECK( BOOST_CHECK(
pm.updateNextRequestTime(n, std::chrono::steady_clock::now())); pm.updateNextRequestTime(n, std::chrono::steady_clock::now()));
} }
▲ Show 20 Lines • Show All 228 Lines • Show Last 20 Lines