@@ -974,34 +974,34 @@ impl<B: BlockT> ChainSync<B> {
974
974
/// Updates our internal state for best queued block and then goes
975
975
/// through all peers to update our view of their state as well.
976
976
fn on_block_queued ( & mut self , hash : & B :: Hash , number : NumberFor < B > ) {
977
- if number > self . best_queued_number {
978
- self . best_queued_number = number;
979
- self . best_queued_hash = * hash;
980
- }
981
977
if let Some ( _) = self . fork_targets . remove ( & hash) {
982
978
trace ! ( target: "sync" , "Completed fork sync {:?}" , hash) ;
983
979
}
984
- // Update common blocks
985
- for ( n, peer) in self . peers . iter_mut ( ) {
986
- if let PeerSyncState :: AncestorSearch ( _, _) = peer. state {
987
- // Wait for ancestry search to complete first.
988
- continue ;
980
+ if number > self . best_queued_number {
981
+ self . best_queued_number = number;
982
+ self . best_queued_hash = * hash;
983
+ // Update common blocks
984
+ for ( n, peer) in self . peers . iter_mut ( ) {
985
+ if let PeerSyncState :: AncestorSearch ( _, _) = peer. state {
986
+ // Wait for ancestry search to complete first.
987
+ continue ;
988
+ }
989
+ let new_common_number = if peer. best_number >= number {
990
+ number
991
+ } else {
992
+ peer. best_number
993
+ } ;
994
+ trace ! (
995
+ target: "sync" ,
996
+ "Updating peer {} info, ours={}, common={}->{}, their best={}" ,
997
+ n,
998
+ number,
999
+ peer. common_number,
1000
+ new_common_number,
1001
+ peer. best_number,
1002
+ ) ;
1003
+ peer. common_number = new_common_number;
989
1004
}
990
- let new_common_number = if peer. best_number >= number {
991
- number
992
- } else {
993
- peer. best_number
994
- } ;
995
- trace ! (
996
- target: "sync" ,
997
- "Updating peer {} info, ours={}, common={}->{}, their best={}" ,
998
- n,
999
- number,
1000
- peer. common_number,
1001
- new_common_number,
1002
- peer. best_number,
1003
- ) ;
1004
- peer. common_number = new_common_number;
1005
1005
}
1006
1006
self . is_idle = false ;
1007
1007
}
0 commit comments