Page MenuHomePhabricator
Differential D9765 Diff 29135 src/avalanche/test/processor_tests.cpp

Changeset View

Standalone View

View Options

src/avalanche/test/processor_tests.cpp

Show First 20 Lines • Show All 755 Lines • ▼ Show 20 LinesBOOST_AUTO_TEST_CASE(poll_inflight_count) {
} }
BOOST_CHECK(m_processor->addBlockToReconcile(pindex)); BOOST_CHECK(m_processor->addBlockToReconcile(pindex));
// Ensure there are enough requests in flight. // Ensure there are enough requests in flight.
std::map<NodeId, uint64_t> node_round_map; std::map<NodeId, uint64_t> node_round_map;
for (int i = 0; i < AVALANCHE_MAX_INFLIGHT_POLL; i++) { for (int i = 0; i < AVALANCHE_MAX_INFLIGHT_POLL; i++) {
NodeId nodeid = getSuitableNodeToQuery(); NodeId nodeid = getSuitableNodeToQuery();
BOOST_CHECK(node_round_map.find(nodeid) == node_round_map.end()); BOOST_CHECK(node_round_map.find(nodeid) == node_round_map.end());
node_round_map[nodeid] = getRound(); node_round_map.insert(std::pair<NodeId, uint64_t>(nodeid, getRound()));
auto invs = getInvsForNextPoll(); auto invs = getInvsForNextPoll();
BOOST_CHECK_EQUAL(invs.size(), 1); BOOST_CHECK_EQUAL(invs.size(), 1);
BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHash); BOOST_CHECK(invs[0].hash == blockHash);
runEventLoop(); runEventLoop();
} }
// Now that we have enough in flight requests, we shouldn't poll. // Now that we have enough in flight requests, we shouldn't poll.
▲ Show 20 Lines • Show All 231 Lines • Show Last 20 Lines