mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-26 22:47:56 +00:00
Pierre Krieger
713 lines
20 KiB
Rust
713 lines
20 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) 2017-2020 Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0
|
|
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
use sp_consensus::BlockOrigin;
|
|
use std::time::Duration;
|
|
use futures::executor::block_on;
|
|
use super::*;
|
|
|
|
fn test_ancestor_search_when_common_is(n: usize) {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
|
|
net.peer(0).push_blocks(n, false);
|
|
net.peer(1).push_blocks(n, false);
|
|
net.peer(2).push_blocks(n, false);
|
|
|
|
net.peer(0).push_blocks(10, true);
|
|
net.peer(1).push_blocks(100, false);
|
|
net.peer(2).push_blocks(100, false);
|
|
|
|
net.block_until_sync();
|
|
let peer1 = &net.peers()[1];
|
|
assert!(net.peers()[0].blockchain_canon_equals(peer1));
|
|
}
|
|
|
|
#[test]
|
|
fn sync_peers_works() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
for peer in 0..3 {
|
|
if net.peer(peer).num_peers() != 2 {
|
|
return Poll::Pending
|
|
}
|
|
}
|
|
Poll::Ready(())
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn sync_cycle_from_offline_to_syncing_to_offline() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
for peer in 0..3 {
|
|
// Offline, and not major syncing.
|
|
assert!(net.peer(peer).is_offline());
|
|
assert!(!net.peer(peer).is_major_syncing());
|
|
}
|
|
|
|
// Generate blocks.
|
|
net.peer(2).push_blocks(100, false);
|
|
|
|
// Block until all nodes are online and nodes 0 and 1 and major syncing.
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
for peer in 0..3 {
|
|
// Online
|
|
if net.peer(peer).is_offline() {
|
|
return Poll::Pending
|
|
}
|
|
if peer < 2 {
|
|
// Major syncing.
|
|
if net.peer(peer).blocks_count() < 100 && !net.peer(peer).is_major_syncing() {
|
|
return Poll::Pending
|
|
}
|
|
}
|
|
}
|
|
Poll::Ready(())
|
|
}));
|
|
|
|
// Block until all nodes are done syncing.
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
for peer in 0..3 {
|
|
if net.peer(peer).is_major_syncing() {
|
|
return Poll::Pending
|
|
}
|
|
}
|
|
Poll::Ready(())
|
|
}));
|
|
|
|
// Now drop nodes 1 and 2, and check that node 0 is offline.
|
|
net.peers.remove(2);
|
|
net.peers.remove(1);
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if !net.peer(0).is_offline() {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn syncing_node_not_major_syncing_when_disconnected() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
|
|
// Generate blocks.
|
|
net.peer(2).push_blocks(100, false);
|
|
|
|
// Check that we're not major syncing when disconnected.
|
|
assert!(!net.peer(1).is_major_syncing());
|
|
|
|
// Check that we switch to major syncing.
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if !net.peer(1).is_major_syncing() {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
|
|
// Destroy two nodes, and check that we switch to non-major syncing.
|
|
net.peers.remove(2);
|
|
net.peers.remove(0);
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(0).is_major_syncing() {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn sync_from_two_peers_works() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
net.peer(1).push_blocks(100, false);
|
|
net.peer(2).push_blocks(100, false);
|
|
net.block_until_sync();
|
|
let peer1 = &net.peers()[1];
|
|
assert!(net.peers()[0].blockchain_canon_equals(peer1));
|
|
assert!(!net.peer(0).is_major_syncing());
|
|
}
|
|
|
|
#[test]
|
|
fn sync_from_two_peers_with_ancestry_search_works() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
net.peer(0).push_blocks(10, true);
|
|
net.peer(1).push_blocks(100, false);
|
|
net.peer(2).push_blocks(100, false);
|
|
net.block_until_sync();
|
|
let peer1 = &net.peers()[1];
|
|
assert!(net.peers()[0].blockchain_canon_equals(peer1));
|
|
}
|
|
|
|
#[test]
|
|
fn ancestry_search_works_when_backoff_is_one() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
|
|
net.peer(0).push_blocks(1, false);
|
|
net.peer(1).push_blocks(2, false);
|
|
net.peer(2).push_blocks(2, false);
|
|
|
|
net.block_until_sync();
|
|
let peer1 = &net.peers()[1];
|
|
assert!(net.peers()[0].blockchain_canon_equals(peer1));
|
|
}
|
|
|
|
#[test]
|
|
fn ancestry_search_works_when_ancestor_is_genesis() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
|
|
net.peer(0).push_blocks(13, true);
|
|
net.peer(1).push_blocks(100, false);
|
|
net.peer(2).push_blocks(100, false);
|
|
|
|
net.block_until_sync();
|
|
let peer1 = &net.peers()[1];
|
|
assert!(net.peers()[0].blockchain_canon_equals(peer1));
|
|
}
|
|
|
|
#[test]
|
|
fn ancestry_search_works_when_common_is_one() {
|
|
test_ancestor_search_when_common_is(1);
|
|
}
|
|
|
|
#[test]
|
|
fn ancestry_search_works_when_common_is_two() {
|
|
test_ancestor_search_when_common_is(2);
|
|
}
|
|
|
|
#[test]
|
|
fn ancestry_search_works_when_common_is_hundred() {
|
|
test_ancestor_search_when_common_is(100);
|
|
}
|
|
|
|
#[test]
|
|
fn sync_long_chain_works() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(2);
|
|
net.peer(1).push_blocks(500, false);
|
|
net.block_until_sync();
|
|
let peer1 = &net.peers()[1];
|
|
assert!(net.peers()[0].blockchain_canon_equals(peer1));
|
|
}
|
|
|
|
#[test]
|
|
fn sync_no_common_longer_chain_fails() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
net.peer(0).push_blocks(20, true);
|
|
net.peer(1).push_blocks(20, false);
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(0).is_major_syncing() {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
let peer1 = &net.peers()[1];
|
|
assert!(!net.peers()[0].blockchain_canon_equals(peer1));
|
|
}
|
|
|
|
#[test]
|
|
fn sync_justifications() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = JustificationTestNet::new(3);
|
|
net.peer(0).push_blocks(20, false);
|
|
net.block_until_sync();
|
|
|
|
// there's currently no justification for block #10
|
|
assert_eq!(net.peer(0).client().justification(&BlockId::Number(10)).unwrap(), None);
|
|
assert_eq!(net.peer(1).client().justification(&BlockId::Number(10)).unwrap(), None);
|
|
|
|
// we finalize block #10, #15 and #20 for peer 0 with a justification
|
|
net.peer(0).client().finalize_block(BlockId::Number(10), Some(Vec::new()), true).unwrap();
|
|
net.peer(0).client().finalize_block(BlockId::Number(15), Some(Vec::new()), true).unwrap();
|
|
net.peer(0).client().finalize_block(BlockId::Number(20), Some(Vec::new()), true).unwrap();
|
|
|
|
let h1 = net.peer(1).client().header(&BlockId::Number(10)).unwrap().unwrap();
|
|
let h2 = net.peer(1).client().header(&BlockId::Number(15)).unwrap().unwrap();
|
|
let h3 = net.peer(1).client().header(&BlockId::Number(20)).unwrap().unwrap();
|
|
|
|
// peer 1 should get the justifications from the network
|
|
net.peer(1).request_justification(&h1.hash().into(), 10);
|
|
net.peer(1).request_justification(&h2.hash().into(), 15);
|
|
net.peer(1).request_justification(&h3.hash().into(), 20);
|
|
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
|
|
for height in (10..21).step_by(5) {
|
|
if net.peer(0).client().justification(&BlockId::Number(height)).unwrap() != Some(Vec::new()) {
|
|
return Poll::Pending;
|
|
}
|
|
if net.peer(1).client().justification(&BlockId::Number(height)).unwrap() != Some(Vec::new()) {
|
|
return Poll::Pending;
|
|
}
|
|
}
|
|
|
|
Poll::Ready(())
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn sync_justifications_across_forks() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = JustificationTestNet::new(3);
|
|
// we push 5 blocks
|
|
net.peer(0).push_blocks(5, false);
|
|
// and then two forks 5 and 6 blocks long
|
|
let f1_best = net.peer(0).push_blocks_at(BlockId::Number(5), 5, false);
|
|
let f2_best = net.peer(0).push_blocks_at(BlockId::Number(5), 6, false);
|
|
|
|
// peer 1 will only see the longer fork. but we'll request justifications
|
|
// for both and finalize the small fork instead.
|
|
net.block_until_sync();
|
|
|
|
net.peer(0).client().finalize_block(BlockId::Hash(f1_best), Some(Vec::new()), true).unwrap();
|
|
|
|
net.peer(1).request_justification(&f1_best, 10);
|
|
net.peer(1).request_justification(&f2_best, 11);
|
|
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
|
|
if net.peer(0).client().justification(&BlockId::Number(10)).unwrap() == Some(Vec::new()) &&
|
|
net.peer(1).client().justification(&BlockId::Number(10)).unwrap() == Some(Vec::new())
|
|
{
|
|
Poll::Ready(())
|
|
} else {
|
|
Poll::Pending
|
|
}
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn sync_after_fork_works() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
net.peer(0).push_blocks(30, false);
|
|
net.peer(1).push_blocks(30, false);
|
|
net.peer(2).push_blocks(30, false);
|
|
|
|
net.peer(0).push_blocks(10, true);
|
|
net.peer(1).push_blocks(20, false);
|
|
net.peer(2).push_blocks(20, false);
|
|
|
|
net.peer(1).push_blocks(10, true);
|
|
net.peer(2).push_blocks(1, false);
|
|
|
|
// peer 1 has the best chain
|
|
net.block_until_sync();
|
|
let peer1 = &net.peers()[1];
|
|
assert!(net.peers()[0].blockchain_canon_equals(peer1));
|
|
(net.peers()[1].blockchain_canon_equals(peer1));
|
|
(net.peers()[2].blockchain_canon_equals(peer1));
|
|
}
|
|
|
|
#[test]
|
|
fn syncs_all_forks() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(4);
|
|
net.peer(0).push_blocks(2, false);
|
|
net.peer(1).push_blocks(2, false);
|
|
|
|
let b1 = net.peer(0).push_blocks(2, true);
|
|
let b2 = net.peer(1).push_blocks(4, false);
|
|
|
|
net.block_until_sync();
|
|
// Check that all peers have all of the branches.
|
|
assert!(net.peer(0).has_block(&b1));
|
|
assert!(net.peer(0).has_block(&b2));
|
|
assert!(net.peer(1).has_block(&b1));
|
|
assert!(net.peer(1).has_block(&b2));
|
|
}
|
|
|
|
#[test]
|
|
fn own_blocks_are_announced() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
net.block_until_sync(); // connect'em
|
|
net.peer(0).generate_blocks(1, BlockOrigin::Own, |builder| builder.build().unwrap().block);
|
|
|
|
net.block_until_sync();
|
|
|
|
assert_eq!(net.peer(0).client.info().best_number, 1);
|
|
assert_eq!(net.peer(1).client.info().best_number, 1);
|
|
let peer0 = &net.peers()[0];
|
|
assert!(net.peers()[1].blockchain_canon_equals(peer0));
|
|
(net.peers()[2].blockchain_canon_equals(peer0));
|
|
}
|
|
|
|
#[test]
|
|
fn blocks_are_not_announced_by_light_nodes() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(0);
|
|
|
|
// full peer0 is connected to light peer
|
|
// light peer1 is connected to full peer2
|
|
net.add_full_peer();
|
|
net.add_light_peer();
|
|
|
|
// Sync between 0 and 1.
|
|
net.peer(0).push_blocks(1, false);
|
|
assert_eq!(net.peer(0).client.info().best_number, 1);
|
|
net.block_until_sync();
|
|
assert_eq!(net.peer(1).client.info().best_number, 1);
|
|
|
|
// Add another node and remove node 0.
|
|
net.add_full_peer();
|
|
net.peers.remove(0);
|
|
|
|
// Poll for a few seconds and make sure 1 and 2 (now 0 and 1) don't sync together.
|
|
let mut delay = futures_timer::Delay::new(Duration::from_secs(5));
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
Pin::new(&mut delay).poll(cx)
|
|
}));
|
|
assert_eq!(net.peer(1).client.info().best_number, 0);
|
|
}
|
|
|
|
#[test]
|
|
fn can_sync_small_non_best_forks() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(2);
|
|
net.peer(0).push_blocks(30, false);
|
|
net.peer(1).push_blocks(30, false);
|
|
|
|
// small fork + reorg on peer 1.
|
|
net.peer(0).push_blocks_at(BlockId::Number(30), 2, true);
|
|
let small_hash = net.peer(0).client().info().best_hash;
|
|
net.peer(0).push_blocks_at(BlockId::Number(30), 10, false);
|
|
assert_eq!(net.peer(0).client().info().best_number, 40);
|
|
|
|
// peer 1 only ever had the long fork.
|
|
net.peer(1).push_blocks(10, false);
|
|
assert_eq!(net.peer(1).client().info().best_number, 40);
|
|
|
|
assert!(net.peer(0).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
assert!(net.peer(1).client().header(&BlockId::Hash(small_hash)).unwrap().is_none());
|
|
|
|
// poll until the two nodes connect, otherwise announcing the block will not work
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(0).num_peers() == 0 {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
|
|
// synchronization: 0 synced to longer chain and 1 didn't sync to small chain.
|
|
|
|
assert_eq!(net.peer(0).client().info().best_number, 40);
|
|
|
|
assert!(net.peer(0).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
assert!(!net.peer(1).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
|
|
net.peer(0).announce_block(small_hash, Vec::new());
|
|
|
|
// after announcing, peer 1 downloads the block.
|
|
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
|
|
assert!(net.peer(0).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
if net.peer(1).client().header(&BlockId::Hash(small_hash)).unwrap().is_none() {
|
|
return Poll::Pending
|
|
}
|
|
Poll::Ready(())
|
|
}));
|
|
net.block_until_sync();
|
|
|
|
let another_fork = net.peer(0).push_blocks_at(BlockId::Number(35), 2, true);
|
|
net.peer(0).announce_block(another_fork, Vec::new());
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(1).client().header(&BlockId::Hash(another_fork)).unwrap().is_none() {
|
|
return Poll::Pending
|
|
}
|
|
Poll::Ready(())
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn can_not_sync_from_light_peer() {
|
|
let _ = ::env_logger::try_init();
|
|
|
|
// given the network with 1 full nodes (#0) and 1 light node (#1)
|
|
let mut net = TestNet::new(1);
|
|
net.add_light_peer();
|
|
|
|
// generate some blocks on #0
|
|
net.peer(0).push_blocks(1, false);
|
|
|
|
// and let the light client sync from this node
|
|
net.block_until_sync();
|
|
|
|
// ensure #0 && #1 have the same best block
|
|
let full0_info = net.peer(0).client.info();
|
|
let light_info = net.peer(1).client.info();
|
|
assert_eq!(full0_info.best_number, 1);
|
|
assert_eq!(light_info.best_number, 1);
|
|
assert_eq!(light_info.best_hash, full0_info.best_hash);
|
|
|
|
// add new full client (#2) && remove #0
|
|
net.add_full_peer();
|
|
net.peers.remove(0);
|
|
|
|
// ensure that the #2 (now #1) fails to sync block #1 even after 5 seconds
|
|
let mut test_finished = futures_timer::Delay::new(Duration::from_secs(5));
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
Pin::new(&mut test_finished).poll(cx)
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn light_peer_imports_header_from_announce() {
|
|
let _ = ::env_logger::try_init();
|
|
|
|
fn import_with_announce(net: &mut TestNet, hash: H256) {
|
|
net.peer(0).announce_block(hash, Vec::new());
|
|
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(1).client().header(&BlockId::Hash(hash)).unwrap().is_some() {
|
|
Poll::Ready(())
|
|
} else {
|
|
Poll::Pending
|
|
}
|
|
}));
|
|
}
|
|
|
|
// given the network with 1 full nodes (#0) and 1 light node (#1)
|
|
let mut net = TestNet::new(1);
|
|
net.add_light_peer();
|
|
|
|
// let them connect to each other
|
|
net.block_until_sync();
|
|
|
|
// check that NEW block is imported from announce message
|
|
let new_hash = net.peer(0).push_blocks(1, false);
|
|
import_with_announce(&mut net, new_hash);
|
|
|
|
// check that KNOWN STALE block is imported from announce message
|
|
let known_stale_hash = net.peer(0).push_blocks_at(BlockId::Number(0), 1, true);
|
|
import_with_announce(&mut net, known_stale_hash);
|
|
}
|
|
|
|
#[test]
|
|
fn can_sync_explicit_forks() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(2);
|
|
net.peer(0).push_blocks(30, false);
|
|
net.peer(1).push_blocks(30, false);
|
|
|
|
// small fork + reorg on peer 1.
|
|
net.peer(0).push_blocks_at(BlockId::Number(30), 2, true);
|
|
let small_hash = net.peer(0).client().info().best_hash;
|
|
let small_number = net.peer(0).client().info().best_number;
|
|
net.peer(0).push_blocks_at(BlockId::Number(30), 10, false);
|
|
assert_eq!(net.peer(0).client().info().best_number, 40);
|
|
|
|
// peer 1 only ever had the long fork.
|
|
net.peer(1).push_blocks(10, false);
|
|
assert_eq!(net.peer(1).client().info().best_number, 40);
|
|
|
|
assert!(net.peer(0).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
assert!(net.peer(1).client().header(&BlockId::Hash(small_hash)).unwrap().is_none());
|
|
|
|
// poll until the two nodes connect, otherwise announcing the block will not work
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(0).num_peers() == 0 || net.peer(1).num_peers() == 0 {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
|
|
// synchronization: 0 synced to longer chain and 1 didn't sync to small chain.
|
|
|
|
assert_eq!(net.peer(0).client().info().best_number, 40);
|
|
|
|
assert!(net.peer(0).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
assert!(!net.peer(1).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
|
|
// request explicit sync
|
|
let first_peer_id = net.peer(0).id();
|
|
net.peer(1).set_sync_fork_request(vec![first_peer_id], small_hash, small_number);
|
|
|
|
// peer 1 downloads the block.
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
|
|
assert!(net.peer(0).client().header(&BlockId::Hash(small_hash)).unwrap().is_some());
|
|
if net.peer(1).client().header(&BlockId::Hash(small_hash)).unwrap().is_none() {
|
|
return Poll::Pending
|
|
}
|
|
Poll::Ready(())
|
|
}));
|
|
}
|
|
|
|
#[test]
|
|
fn syncs_header_only_forks() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(0);
|
|
net.add_full_peer_with_states(None);
|
|
net.add_full_peer_with_states(Some(3));
|
|
net.peer(0).push_blocks(2, false);
|
|
net.peer(1).push_blocks(2, false);
|
|
|
|
net.peer(0).push_blocks(2, true);
|
|
let small_hash = net.peer(0).client().info().best_hash;
|
|
net.peer(1).push_blocks(4, false);
|
|
|
|
net.block_until_sync();
|
|
// Peer 1 will sync the small fork even though common block state is missing
|
|
assert!(net.peer(1).has_block(&small_hash));
|
|
}
|
|
|
|
#[test]
|
|
fn does_not_sync_announced_old_best_block() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(3);
|
|
|
|
let old_hash = net.peer(0).push_blocks(1, false);
|
|
let old_hash_with_parent = net.peer(0).push_blocks(1, false);
|
|
net.peer(0).push_blocks(18, true);
|
|
net.peer(1).push_blocks(20, true);
|
|
|
|
net.peer(0).announce_block(old_hash, Vec::new());
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
// poll once to import announcement
|
|
net.poll(cx);
|
|
Poll::Ready(())
|
|
}));
|
|
assert!(!net.peer(1).is_major_syncing());
|
|
|
|
net.peer(0).announce_block(old_hash_with_parent, Vec::new());
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
// poll once to import announcement
|
|
net.poll(cx);
|
|
Poll::Ready(())
|
|
}));
|
|
assert!(!net.peer(1).is_major_syncing());
|
|
}
|
|
|
|
#[test]
|
|
fn full_sync_requires_block_body() {
|
|
// Check that we don't sync headers-only in full mode.
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(2);
|
|
|
|
net.peer(0).push_headers(1);
|
|
// Wait for nodes to connect
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(0).num_peers() == 0 || net.peer(1).num_peers() == 0 {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
net.block_until_idle();
|
|
assert_eq!(net.peer(1).client.info().best_number, 0);
|
|
}
|
|
|
|
#[test]
|
|
fn imports_stale_once() {
|
|
let _ = ::env_logger::try_init();
|
|
|
|
fn import_with_announce(net: &mut TestNet, hash: H256) {
|
|
// Announce twice
|
|
net.peer(0).announce_block(hash, Vec::new());
|
|
net.peer(0).announce_block(hash, Vec::new());
|
|
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(1).client().header(&BlockId::Hash(hash)).unwrap().is_some() {
|
|
Poll::Ready(())
|
|
} else {
|
|
Poll::Pending
|
|
}
|
|
}));
|
|
}
|
|
|
|
// given the network with 2 full nodes
|
|
let mut net = TestNet::new(2);
|
|
|
|
// let them connect to each other
|
|
net.block_until_sync();
|
|
|
|
// check that NEW block is imported from announce message
|
|
let new_hash = net.peer(0).push_blocks(1, false);
|
|
import_with_announce(&mut net, new_hash);
|
|
assert_eq!(net.peer(1).num_processed_blocks(), 1);
|
|
|
|
// check that KNOWN STALE block is imported from announce message
|
|
let known_stale_hash = net.peer(0).push_blocks_at(BlockId::Number(0), 1, true);
|
|
import_with_announce(&mut net, known_stale_hash);
|
|
assert_eq!(net.peer(1).num_processed_blocks(), 2);
|
|
}
|
|
|
|
#[test]
|
|
fn can_sync_to_peers_with_wrong_common_block() {
|
|
let _ = ::env_logger::try_init();
|
|
let mut net = TestNet::new(2);
|
|
|
|
net.peer(0).push_blocks(2, true);
|
|
net.peer(1).push_blocks(2, true);
|
|
let fork_hash = net.peer(0).push_blocks_at(BlockId::Number(0), 2, false);
|
|
net.peer(1).push_blocks_at(BlockId::Number(0), 2, false);
|
|
// wait for connection
|
|
block_on(futures::future::poll_fn::<(), _>(|cx| {
|
|
net.poll(cx);
|
|
if net.peer(0).num_peers() == 0 || net.peer(1).num_peers() == 0 {
|
|
Poll::Pending
|
|
} else {
|
|
Poll::Ready(())
|
|
}
|
|
}));
|
|
|
|
// both peers re-org to the same fork without notifying each other
|
|
net.peer(0).client().finalize_block(BlockId::Hash(fork_hash), Some(Vec::new()), true).unwrap();
|
|
net.peer(1).client().finalize_block(BlockId::Hash(fork_hash), Some(Vec::new()), true).unwrap();
|
|
let final_hash = net.peer(0).push_blocks(1, false);
|
|
|
|
net.block_until_sync();
|
|
|
|
assert!(net.peer(1).client().header(&BlockId::Hash(final_hash)).unwrap().is_some());
|
|
}
|
|
|