Changeset View
Changeset View
Standalone View
Standalone View
src/avalanche/test/peermanager_tests.cpp
Show First 20 Lines • Show All 158 Lines • ▼ Show 20 Lines | BOOST_AUTO_TEST_CASE(peer_probabilities) { | ||||
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; | ||||
// One peer, we always return it. | // One peer, we always return it. | ||||
Proof proof0 = buildRandomProof(MIN_VALID_PROOF_SCORE); | Proof proof0 = buildRandomProof(MIN_VALID_PROOF_SCORE); | ||||
Delegation dg0 = DelegationBuilder(proof0).build(); | Delegation dg0 = DelegationBuilder(proof0).build(); | ||||
pm.addNode(node0, proof0, dg0); | pm.addNode(node0, std::move(proof0), dg0); | ||||
BOOST_CHECK_EQUAL(pm.selectNode(), node0); | BOOST_CHECK_EQUAL(pm.selectNode(), node0); | ||||
// Two peers, verify ratio. | // Two peers, verify ratio. | ||||
Proof proof1 = buildRandomProof(2 * MIN_VALID_PROOF_SCORE); | Proof proof1 = buildRandomProof(2 * MIN_VALID_PROOF_SCORE); | ||||
Delegation dg1 = DelegationBuilder(proof1).build(); | Delegation dg1 = DelegationBuilder(proof1).build(); | ||||
pm.addNode(node1, proof1, dg1); | pm.addNode(node1, std::move(proof1), dg1); | ||||
std::unordered_map<PeerId, int> results = {}; | std::unordered_map<PeerId, int> results = {}; | ||||
for (int i = 0; i < 10000; i++) { | for (int i = 0; i < 10000; i++) { | ||||
size_t n = pm.selectNode(); | size_t n = pm.selectNode(); | ||||
BOOST_CHECK(n == node0 || n == node1); | BOOST_CHECK(n == node0 || n == node1); | ||||
results[n]++; | results[n]++; | ||||
} | } | ||||
BOOST_CHECK(abs(2 * results[0] - results[1]) < 500); | BOOST_CHECK(abs(2 * results[0] - results[1]) < 500); | ||||
// Three peers, verify ratio. | // Three peers, verify ratio. | ||||
Proof proof2 = buildRandomProof(MIN_VALID_PROOF_SCORE); | Proof proof2 = buildRandomProof(MIN_VALID_PROOF_SCORE); | ||||
Delegation dg2 = DelegationBuilder(proof2).build(); | Delegation dg2 = DelegationBuilder(proof2).build(); | ||||
pm.addNode(node2, proof2, dg2); | pm.addNode(node2, std::move(proof2), dg2); | ||||
results.clear(); | results.clear(); | ||||
for (int i = 0; i < 10000; i++) { | for (int i = 0; i < 10000; i++) { | ||||
size_t n = pm.selectNode(); | size_t n = pm.selectNode(); | ||||
BOOST_CHECK(n == node0 || n == node1 || n == node2); | BOOST_CHECK(n == node0 || n == node1 || n == node2); | ||||
results[n]++; | results[n]++; | ||||
} | } | ||||
BOOST_CHECK(abs(results[0] - results[1] + results[2]) < 500); | BOOST_CHECK(abs(results[0] - results[1] + results[2]) < 500); | ||||
} | } | ||||
BOOST_AUTO_TEST_CASE(remove_peer) { | BOOST_AUTO_TEST_CASE(remove_peer) { | ||||
// No peers. | // No peers. | ||||
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++) { | ||||
Proof p = buildRandomProof(100); | Proof p = buildRandomProof(100); | ||||
peerids[i] = pm.getPeerId(p); | peerids[i] = pm.getPeerId(p); | ||||
BOOST_CHECK( | BOOST_CHECK(pm.addNode(InsecureRand32(), std::move(p), | ||||
pm.addNode(InsecureRand32(), p, DelegationBuilder(p).build())); | 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++) { | ||||
Proof p = buildRandomProof(100); | Proof p = buildRandomProof(100); | ||||
peerids[i + 4] = pm.getPeerId(p); | peerids[i + 4] = pm.getPeerId(p); | ||||
BOOST_CHECK( | BOOST_CHECK(pm.addNode(InsecureRand32(), std::move(p), | ||||
pm.addNode(InsecureRand32(), p, DelegationBuilder(p).build())); | 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++) { | ||||
Proof p = buildRandomProof(100); | Proof p = buildRandomProof(100); | ||||
peerids[i] = pm.getPeerId(p); | peerids[i] = pm.getPeerId(p); | ||||
BOOST_CHECK( | BOOST_CHECK(pm.addNode(InsecureRand32(), std::move(p), | ||||
pm.addNode(InsecureRand32(), p, DelegationBuilder(p).build())); | 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 14 Lines | BOOST_AUTO_TEST_CASE(node_crud) { | ||||
// Create one peer. | // Create one peer. | ||||
Proof proof = buildRandomProof(10000000 * MIN_VALID_PROOF_SCORE); | Proof proof = buildRandomProof(10000000 * MIN_VALID_PROOF_SCORE); | ||||
Delegation dg = DelegationBuilder(proof).build(); | 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. | ||||
for (int i = 0; i < 4; i++) { | for (int i = 0; i < 4; i++) { | ||||
BOOST_CHECK(pm.addNode(i, proof, dg)); | BOOST_CHECK(pm.addNode(i, std::move(proof), dg)); | ||||
} | } | ||||
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 All 18 Lines | for (int i = 0; i < 100; i++) { | ||||
BOOST_CHECK( | BOOST_CHECK( | ||||
pm.updateNextRequestTime(n, std::chrono::steady_clock::now())); | pm.updateNextRequestTime(n, std::chrono::steady_clock::now())); | ||||
} | } | ||||
// Move a node from a peer to another. This peer has a very low score such | // Move a node from a peer to another. This peer has a very low score such | ||||
// as chances of being picked are 1 in 10 million. | // as chances of being picked are 1 in 10 million. | ||||
Proof altproof = buildRandomProof(MIN_VALID_PROOF_SCORE); | Proof altproof = buildRandomProof(MIN_VALID_PROOF_SCORE); | ||||
Delegation altdg = DelegationBuilder(altproof).build(); | Delegation altdg = DelegationBuilder(altproof).build(); | ||||
BOOST_CHECK(pm.addNode(3, altproof, altdg)); | BOOST_CHECK(pm.addNode(3, std::move(altproof), altdg)); | ||||
int node3selected = 0; | int node3selected = 0; | ||||
for (int i = 0; i < 100; i++) { | for (int i = 0; i < 100; i++) { | ||||
NodeId n = pm.selectNode(); | NodeId n = pm.selectNode(); | ||||
if (n == 3) { | if (n == 3) { | ||||
// Selecting this node should be exceedingly unlikely. | // Selecting this node should be exceedingly unlikely. | ||||
BOOST_CHECK(node3selected++ < 1); | BOOST_CHECK(node3selected++ < 1); | ||||
} else { | } else { | ||||
▲ Show 20 Lines • Show All 81 Lines • Show Last 20 Lines |