1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335
// Smoldot
// Copyright (C) 2019-2022 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 <http://www.gnu.org/licenses/>.
use super::{
BlockNotification, ConfigRelayChainRuntimeCodeHint, FinalizedBlockRuntime, Notification,
SubscribeAll, ToBackground,
};
use crate::{network_service, platform::PlatformRef, util};
use alloc::{
borrow::{Cow, ToOwned as _},
boxed::Box,
string::{String, ToString as _},
sync::Arc,
vec::Vec,
};
use core::{
cmp, iter,
num::{NonZeroU32, NonZeroU64},
pin::Pin,
time::Duration,
};
use futures_lite::FutureExt as _;
use futures_util::{future, stream, FutureExt as _, StreamExt as _};
use hashbrown::{HashMap, HashSet};
use smoldot::{
chain, header,
informant::HashDisplay,
libp2p,
network::{self, codec},
sync::all,
};
/// Starts a sync service background task to synchronize a standalone chain (relay chain or not).
pub(super) async fn start_standalone_chain<TPlat: PlatformRef>(
log_target: String,
platform: TPlat,
chain_information: chain::chain_information::ValidChainInformation,
block_number_bytes: usize,
runtime_code_hint: Option<ConfigRelayChainRuntimeCodeHint>,
mut from_foreground: Pin<Box<async_channel::Receiver<ToBackground>>>,
network_service: Arc<network_service::NetworkServiceChain<TPlat>>,
) {
let mut task = Task {
sync: all::AllSync::new(all::Config {
chain_information,
block_number_bytes,
// Since this module doesn't verify block bodies, any block (even invalid) is accepted
// as long as it comes from a legitimate validator. Consequently, validators could
// perform attacks by sending completely invalid blocks. Passing `false` to this
// option would tighten the definition of what a "legitimate" validator is, and thus
// reduce the feasibility of attacks, but not in a significant way. Passing `true`,
// on the other hand, allows supporting chains that use custom consensus engines,
// which is considered worth the trade-off.
allow_unknown_consensus_engines: true,
sources_capacity: 32,
blocks_capacity: {
// This is the maximum number of blocks between two consecutive justifications.
1024
},
max_disjoint_headers: 1024,
max_requests_per_block: NonZeroU32::new(3).unwrap(),
download_ahead_blocks: {
// Verifying a block mostly consists in:
//
// - Verifying a sr25519 signature for each block, plus a VRF output when the
// block is claiming a primary BABE slot.
// - Verifying one ed25519 signature per authority for every justification.
//
// At the time of writing, the speed of these operations hasn't been benchmarked.
// It is likely that it varies quite a bit between the various environments (the
// different browser engines, and NodeJS).
//
// Assuming a maximum verification speed of 5k blocks/sec and a 95% latency of one
// second, the number of blocks to download ahead of time in order to not block
// is 5k.
NonZeroU32::new(5000).unwrap()
},
full_mode: false,
code_trie_node_hint: runtime_code_hint.map(|hint| all::ConfigCodeTrieNodeHint {
merkle_value: hint.merkle_value,
storage_value: hint.storage_value,
closest_ancestor_excluding: hint.closest_ancestor_excluding,
}),
}),
network_up_to_date_best: true,
network_up_to_date_finalized: true,
known_finalized_runtime: None,
pending_requests: stream::FuturesUnordered::new(),
warp_sync_taking_long_time_warning: future::Either::Left(Box::pin(
platform.sleep(Duration::from_secs(10)),
))
.fuse(),
all_notifications: Vec::<async_channel::Sender<Notification>>::new(),
log_target,
from_network_service: None,
network_service,
peers_source_id_map: HashMap::with_capacity_and_hasher(
0,
util::SipHasherBuild::new({
let mut seed = [0; 16];
platform.fill_random_bytes(&mut seed);
seed
}),
),
platform,
};
// Main loop of the syncing logic.
//
// This loop contains some CPU-heavy operations (e.g. verifying finality proofs and warp sync
// proofs) but also responding to messages sent by the foreground sync service. In order to
// avoid long delays in responding to foreground messages, the CPU-heavy operations are split
// into small chunks, and each iteration of the loop processes at most one of these chunks and
// processes one foreground message.
loop {
// Try to perform some CPU-heavy operations.
// If any CPU-heavy verification was performed, then `queue_empty` will be `false`, in
// which case we will loop again as soon as possible.
// TODO: integrate this within WakeUpReason, see https://github.com/smol-dot/smoldot/issues/1382 this is however complicated because process_one() moves out from sync, and that sync doesn't impl Sync, a refactor of AllSync might be necessary
let queue_empty = {
let mut queue_empty = true;
// TODO: handle obsolete requests
// The sync state machine can be in a few various states. At the time of writing:
// idle, verifying header, verifying block, verifying grandpa warp sync proof,
// verifying storage proof.
// If the state is one of the "verifying" states, perform the actual verification
// and set ̀`queue_empty` to `false`.
let (task_update, has_done_verif) = task.process_one_verification_queue().await;
task = task_update;
if has_done_verif {
queue_empty = false;
// Yield after a CPU-intensive operation. This helps provide a better granularity.
futures_lite::future::yield_now().await;
}
queue_empty
};
// Now waiting for some event to happen: a network event, a request from the frontend
// of the sync service, or a request being finished.
enum WakeUpReason {
MustUpdateNetworkWithBestBlock,
MustUpdateNetworkWithFinalizedBlock,
MustSubscribeNetworkEvents,
NetworkEvent(network_service::Event),
ForegroundMessage(ToBackground),
ForegroundClosed,
StartRequest(all::SourceId, all::DesiredRequest),
RequestFinished(all::RequestId, Result<RequestOutcome, future::Aborted>),
WarpSyncTakingLongTimeWarning,
MustLoopAgain,
}
let wake_up_reason = {
async {
if let Some(from_network_service) = task.from_network_service.as_mut() {
match from_network_service.next().await {
Some(ev) => WakeUpReason::NetworkEvent(ev),
None => {
task.from_network_service = None;
WakeUpReason::MustSubscribeNetworkEvents
}
}
} else {
WakeUpReason::MustSubscribeNetworkEvents
}
}
.or(async {
from_foreground.next().await.map_or(
WakeUpReason::ForegroundClosed,
WakeUpReason::ForegroundMessage,
)
})
.or(async {
if task.pending_requests.is_empty() {
future::pending::<()>().await
}
let (request_id, result) = task.pending_requests.select_next_some().await;
WakeUpReason::RequestFinished(request_id, result)
})
.or(async {
if !task.network_up_to_date_finalized {
WakeUpReason::MustUpdateNetworkWithFinalizedBlock
} else {
future::pending().await
}
})
.or(async {
if !task.network_up_to_date_best {
WakeUpReason::MustUpdateNetworkWithBestBlock
} else {
future::pending().await
}
})
.or(async {
(&mut task.warp_sync_taking_long_time_warning).await;
task.warp_sync_taking_long_time_warning =
future::Either::Left(Box::pin(task.platform.sleep(Duration::from_secs(10))))
.fuse();
WakeUpReason::WarpSyncTakingLongTimeWarning
})
.or({
// `desired_requests()` returns, in decreasing order of priority, the requests
// that should be started in order for the syncing to proceed. The fact that
// multiple requests are returned could be used to filter out undesired one. We
// use this filtering to enforce a maximum of one ongoing request per source.
let desired_request = task
.sync
.desired_requests()
.find(|(source_id, _, _)| {
task.sync.source_num_ongoing_requests(*source_id) == 0
})
.map(|(source_id, _, request_detail)| (source_id, request_detail));
async move {
if let Some((source_id, request_detail)) = desired_request {
WakeUpReason::StartRequest(source_id, request_detail)
} else {
future::pending().await
}
}
})
.or(async {
// If the list of CPU-heavy operations to perform is potentially non-empty,
// then we wait for a future that is always instantly ready, in order to loop
// again and perform the next CPU-heavy operation.
// Note that if any of the other futures is ready, then that other ready
// future will take precedence.
if queue_empty {
future::pending::<()>().await;
}
WakeUpReason::MustLoopAgain
})
.await
};
match wake_up_reason {
WakeUpReason::NetworkEvent(network_service::Event::Connected {
peer_id,
role,
best_block_number,
best_block_hash,
}) => {
task.peers_source_id_map.insert(
peer_id.clone(),
task.sync
.add_source((peer_id, role), best_block_number, best_block_hash),
);
}
WakeUpReason::NetworkEvent(network_service::Event::Disconnected { peer_id }) => {
let sync_source_id = task.peers_source_id_map.remove(&peer_id).unwrap();
let (_, requests) = task.sync.remove_source(sync_source_id);
// The `Disconnect` network event indicates that the main notifications substream
// with that peer has been closed, not necessarily that the connection as a whole
// has been closed. As such, the in-progress network requests might continue if
// we don't abort them.
for (_, abort) in requests {
abort.abort();
}
}
WakeUpReason::NetworkEvent(network_service::Event::BlockAnnounce {
peer_id,
announce,
}) => {
let sync_source_id = *task.peers_source_id_map.get(&peer_id).unwrap();
let decoded = announce.decode();
match header::decode(decoded.scale_encoded_header, task.sync.block_number_bytes()) {
Ok(decoded_header) => {
log::debug!(
target: &task.log_target,
"Sync <= BlockAnnounce(sender={}, hash={}, is_best={}, parent_hash={})",
peer_id,
HashDisplay(&header::hash_from_scale_encoded_header(decoded.scale_encoded_header)),
decoded.is_best,
HashDisplay(decoded_header.parent_hash)
);
}
Err(error) => {
log::debug!(
target: &task.log_target,
"Sync <= BlockAnnounce(sender={}, hash={}, is_best={}, parent_hash=<unknown>)",
peer_id,
HashDisplay(&header::hash_from_scale_encoded_header(decoded.scale_encoded_header)),
decoded.is_best,
);
log::debug!(
target: &task.log_target,
"Sync => InvalidBlockHeader(error={})",
error
);
log::warn!(
target: &task.log_target,
"Failed to decode header in block announce received from {}. Error: {}",
peer_id, error,
)
}
}
match task.sync.block_announce(
sync_source_id,
decoded.scale_encoded_header.to_owned(),
decoded.is_best,
) {
all::BlockAnnounceOutcome::HeaderVerify
| all::BlockAnnounceOutcome::AlreadyInChain => {
log::debug!(
target: &task.log_target,
"Sync => Ok"
);
}
all::BlockAnnounceOutcome::Discarded => {
log::debug!(
target: &task.log_target,
"Sync => Discarded"
);
}
all::BlockAnnounceOutcome::StoredForLater {} => {
log::debug!(
target: &task.log_target,
"Sync => StoredForLater"
);
}
all::BlockAnnounceOutcome::TooOld {
announce_block_height,
..
} => {
log::debug!(
target: &task.log_target,
"Sync => TooOld"
);
log::warn!(
target: &task.log_target,
"Block announce header height (#{}) from {} is below finalized block",
announce_block_height,
peer_id
);
}
all::BlockAnnounceOutcome::NotFinalizedChain => {
log::debug!(
target: &task.log_target,
"Sync => NotFinalized"
);
log::warn!(
target: &task.log_target,
"Block announce from {} isn't part of finalized chain",
peer_id
);
}
all::BlockAnnounceOutcome::InvalidHeader(_) => {
// Log messages are already printed above.
}
}
}
WakeUpReason::NetworkEvent(network_service::Event::GrandpaNeighborPacket {
peer_id,
finalized_block_height,
}) => {
let sync_source_id = *task.peers_source_id_map.get(&peer_id).unwrap();
task.sync
.update_source_finality_state(sync_source_id, finalized_block_height);
}
WakeUpReason::NetworkEvent(network_service::Event::GrandpaCommitMessage {
peer_id,
message,
}) => {
let sync_source_id = *task.peers_source_id_map.get(&peer_id).unwrap();
match task
.sync
.grandpa_commit_message(sync_source_id, message.into_encoded())
{
all::GrandpaCommitMessageOutcome::Queued => {
// TODO: print more details?
log::debug!(
target: &task.log_target,
"Sync <= QueuedGrandpaCommit"
);
}
all::GrandpaCommitMessageOutcome::Discarded => {
log::debug!(
target: &task.log_target,
"Sync <= IgnoredGrandpaCommit"
);
}
}
}
WakeUpReason::MustSubscribeNetworkEvents => {
debug_assert!(task.from_network_service.is_none());
for (_, sync_source_id) in task.peers_source_id_map.drain() {
let (_, requests) = task.sync.remove_source(sync_source_id);
for (_, abort) in requests {
abort.abort();
}
}
task.from_network_service = Some(Box::pin(
// As documented, `subscribe().await` is expected to return quickly.
task.network_service.subscribe().await,
));
}
WakeUpReason::MustUpdateNetworkWithBestBlock => {
// The networking service needs to be kept up to date with what the local node
// considers as the best block.
// For some reason, first building the future then executing it solves a borrow
// checker error.
let fut = task.network_service.set_local_best_block(
task.sync.best_block_hash(),
task.sync.best_block_number(),
);
fut.await;
task.network_up_to_date_best = true;
}
WakeUpReason::MustUpdateNetworkWithFinalizedBlock => {
// If the chain uses GrandPa, the networking has to be kept up-to-date with the
// state of finalization for other peers to send back relevant gossip messages.
// (code style) `grandpa_set_id` is extracted first in order to avoid borrowing
// checker issues.
let grandpa_set_id =
if let chain::chain_information::ChainInformationFinalityRef::Grandpa {
after_finalized_block_authorities_set_id,
..
} = task.sync.as_chain_information().as_ref().finality
{
Some(after_finalized_block_authorities_set_id)
} else {
None
};
if let Some(set_id) = grandpa_set_id {
let commit_finalized_height = task.sync.finalized_block_header().number;
task.network_service
.set_local_grandpa_state(network::service::GrandpaState {
set_id,
round_number: 1, // TODO:
commit_finalized_height,
})
.await;
}
task.network_up_to_date_finalized = true;
}
WakeUpReason::ForegroundMessage(ToBackground::IsNearHeadOfChainHeuristic {
send_back,
}) => {
// Frontend is querying something.
let _ = send_back.send(task.sync.is_near_head_of_chain_heuristic());
}
WakeUpReason::ForegroundMessage(ToBackground::SubscribeAll {
send_back,
buffer_size,
runtime_interest,
}) => {
// Frontend would like to subscribe to events.
let (tx, new_blocks) = async_channel::bounded(buffer_size.saturating_sub(1));
task.all_notifications.push(tx);
let non_finalized_blocks_ancestry_order = {
let best_hash = task.sync.best_block_hash();
task.sync
.non_finalized_blocks_ancestry_order()
.map(|h| {
let scale_encoding =
h.scale_encoding_vec(task.sync.block_number_bytes());
BlockNotification {
is_new_best: header::hash_from_scale_encoded_header(
&scale_encoding,
) == best_hash,
scale_encoded_header: scale_encoding,
parent_hash: *h.parent_hash,
}
})
.collect()
};
let _ = send_back.send(SubscribeAll {
finalized_block_scale_encoded_header: task
.sync
.finalized_block_header()
.scale_encoding_vec(task.sync.block_number_bytes()),
finalized_block_runtime: if runtime_interest {
task.known_finalized_runtime.take()
} else {
None
},
non_finalized_blocks_ancestry_order,
new_blocks,
});
}
WakeUpReason::ForegroundMessage(ToBackground::PeersAssumedKnowBlock {
send_back,
block_number,
block_hash,
}) => {
// Frontend queries the list of peers which are expected to know about a certain
// block.
let finalized_num = task.sync.finalized_block_header().number;
let outcome = if block_number <= finalized_num {
task.sync
.sources()
.filter(|source_id| {
let source_best = task.sync.source_best_block(*source_id);
source_best.0 > block_number
|| (source_best.0 == block_number && *source_best.1 == block_hash)
})
.map(|id| task.sync[id].0.clone())
.collect()
} else {
// As documented, `knows_non_finalized_block` would panic if the
// block height was below the one of the known finalized block.
task.sync
.knows_non_finalized_block(block_number, &block_hash)
.map(|id| task.sync[id].0.clone())
.collect()
};
let _ = send_back.send(outcome);
}
WakeUpReason::ForegroundMessage(ToBackground::SyncingPeers { send_back }) => {
// Frontend is querying the list of peers.
let out = task
.sync
.sources()
.map(|src| {
let (peer_id, role) = task.sync[src].clone();
let (height, hash) = task.sync.source_best_block(src);
(peer_id, role, height, *hash)
})
.collect::<Vec<_>>();
let _ = send_back.send(out);
}
WakeUpReason::ForegroundMessage(ToBackground::SerializeChainInformation {
send_back,
}) => {
// Frontend is querying the chain information.
let _ = send_back.send(Some(task.sync.as_chain_information().into()));
}
WakeUpReason::ForegroundClosed => {
// The channel with the frontend sync service has been closed.
// Closing the sync background task as a result.
return;
}
WakeUpReason::RequestFinished(_, Err(_)) => {
// A request has been cancelled by the sync state machine. Nothing to do.
}
WakeUpReason::RequestFinished(request_id, Ok(RequestOutcome::Block(Ok(v)))) => {
// Successful block request.
task.sync.blocks_request_response(
request_id,
Ok(v.into_iter().filter_map(|block| {
Some(all::BlockRequestSuccessBlock {
scale_encoded_header: block.header?,
scale_encoded_justifications: block
.justifications
.unwrap_or(Vec::new())
.into_iter()
.map(|j| all::Justification {
engine_id: j.engine_id,
justification: j.justification,
})
.collect(),
scale_encoded_extrinsics: Vec::new(),
user_data: (),
})
})),
);
}
WakeUpReason::RequestFinished(request_id, Ok(RequestOutcome::Block(Err(_)))) => {
// Failed block request.
// TODO: should disconnect peer
task.sync
.blocks_request_response(request_id, Err::<iter::Empty<_>, _>(()));
}
WakeUpReason::RequestFinished(request_id, Ok(RequestOutcome::WarpSync(Ok(result)))) => {
// Successful warp sync request.
let decoded = result.decode();
let fragments = decoded
.fragments
.into_iter()
.map(|f| all::WarpSyncFragment {
scale_encoded_header: f.scale_encoded_header.to_vec(),
scale_encoded_justification: f.scale_encoded_justification.to_vec(),
})
.collect();
task.sync
.grandpa_warp_sync_response_ok(request_id, fragments, decoded.is_finished);
}
WakeUpReason::RequestFinished(request_id, Ok(RequestOutcome::WarpSync(Err(_)))) => {
// Failed warp sync request.
// TODO: should disconnect peer
task.sync.grandpa_warp_sync_response_err(request_id);
}
WakeUpReason::RequestFinished(request_id, Ok(RequestOutcome::Storage(r))) => {
// Storage proof request.
task.sync.storage_get_response(request_id, r);
}
WakeUpReason::RequestFinished(request_id, Ok(RequestOutcome::CallProof(Ok(r)))) => {
// Successful call proof request.
task.sync
.call_proof_response(request_id, Ok(r.decode().to_owned()));
// TODO: need help from networking service to avoid this to_owned
}
WakeUpReason::RequestFinished(request_id, Ok(RequestOutcome::CallProof(Err(err)))) => {
// Failed call proof request.
task.sync.call_proof_response(request_id, Err(err));
}
WakeUpReason::StartRequest(
source_id,
all::DesiredRequest::BlocksRequest {
first_block_hash,
first_block_height,
ascending,
num_blocks,
request_headers,
request_bodies,
request_justification,
},
) => {
// Before inserting the request back to the syncing state machine, clamp the number
// of blocks to the number of blocks we expect to receive.
// This constant corresponds to the maximum number of blocks that nodes will answer
// in one request. If this constant happens to be inaccurate, everything will still
// work but less efficiently.
let num_blocks = NonZeroU64::new(cmp::min(64, num_blocks.get())).unwrap();
let peer_id = task.sync[source_id].0.clone(); // TODO: why does this require cloning? weird borrow chk issue
let block_request = task.network_service.clone().blocks_request(
peer_id,
network::codec::BlocksRequestConfig {
start: if let Some(first_block_hash) = first_block_hash {
network::codec::BlocksRequestConfigStart::Hash(first_block_hash)
} else {
network::codec::BlocksRequestConfigStart::Number(first_block_height)
},
desired_count: NonZeroU32::new(
u32::try_from(num_blocks.get()).unwrap_or(u32::max_value()),
)
.unwrap(),
direction: if ascending {
network::codec::BlocksRequestDirection::Ascending
} else {
network::codec::BlocksRequestDirection::Descending
},
fields: network::codec::BlocksRequestFields {
header: request_headers,
body: request_bodies,
justifications: request_justification,
},
},
Duration::from_secs(10),
);
let (block_request, abort) = future::abortable(block_request);
let request_id = task.sync.add_request(
source_id,
all::RequestDetail::BlocksRequest {
first_block_hash,
first_block_height,
ascending,
num_blocks,
request_headers,
request_bodies,
request_justification,
},
abort,
);
task.pending_requests.push(Box::pin(async move {
(request_id, block_request.await.map(RequestOutcome::Block))
}));
}
WakeUpReason::StartRequest(
source_id,
all::DesiredRequest::WarpSync {
sync_start_block_hash,
},
) => {
let peer_id = task.sync[source_id].0.clone(); // TODO: why does this require cloning? weird borrow chk issue
let grandpa_request = task.network_service.clone().grandpa_warp_sync_request(
peer_id,
sync_start_block_hash,
// The timeout needs to be long enough to potentially download the maximum
// response size of 16 MiB. Assuming a 128 kiB/sec connection, that's
// 128 seconds. Unfortunately, 128 seconds is way too large, and for
// pragmatic reasons we use a lower value.
Duration::from_secs(24),
);
let (grandpa_request, abort) = future::abortable(grandpa_request);
let request_id = task.sync.add_request(
source_id,
all::RequestDetail::WarpSync {
sync_start_block_hash,
},
abort,
);
task.pending_requests.push(Box::pin(async move {
(
request_id,
grandpa_request.await.map(RequestOutcome::WarpSync),
)
}));
}
WakeUpReason::StartRequest(
source_id,
all::DesiredRequest::StorageGetMerkleProof {
block_hash, keys, ..
},
) => {
let peer_id = task.sync[source_id].0.clone(); // TODO: why does this require cloning? weird borrow chk issue
let storage_request = task.network_service.clone().storage_proof_request(
peer_id,
network::codec::StorageProofRequestConfig {
block_hash,
keys: keys.clone().into_iter(),
},
Duration::from_secs(16),
);
let storage_request = async move {
if let Ok(outcome) = storage_request.await {
// TODO: log what happens
Ok(outcome.decode().to_vec()) // TODO: no to_vec() here, needs some API change on the networking
} else {
Err(())
}
};
let (storage_request, abort) = future::abortable(storage_request);
let request_id = task.sync.add_request(
source_id,
all::RequestDetail::StorageGet { block_hash, keys },
abort,
);
task.pending_requests.push(Box::pin(async move {
(
request_id,
storage_request.await.map(RequestOutcome::Storage),
)
}));
}
WakeUpReason::StartRequest(
source_id,
all::DesiredRequest::RuntimeCallMerkleProof {
block_hash,
function_name,
parameter_vectored,
},
) => {
let peer_id = task.sync[source_id].0.clone(); // TODO: why does this require cloning? weird borrow chk issue
let call_proof_request = {
// TODO: all this copying is done because of lifetime requirements in NetworkService::call_proof_request; maybe check if it can be avoided
let network_service = task.network_service.clone();
let parameter_vectored = parameter_vectored.clone();
let function_name = function_name.clone();
async move {
let rq = network_service.call_proof_request(
peer_id,
network::codec::CallProofRequestConfig {
block_hash,
method: Cow::Borrowed(&*function_name),
parameter_vectored: iter::once(¶meter_vectored),
},
Duration::from_secs(16),
);
match rq.await {
Ok(p) => Ok(p),
Err(_) => Err(()),
}
}
};
let (call_proof_request, abort) = future::abortable(call_proof_request);
let request_id = task.sync.add_request(
source_id,
all::RequestDetail::RuntimeCallMerkleProof {
block_hash,
function_name,
parameter_vectored,
},
abort,
);
task.pending_requests.push(Box::pin(async move {
(
request_id,
call_proof_request.await.map(RequestOutcome::CallProof),
)
}));
}
WakeUpReason::WarpSyncTakingLongTimeWarning => {
match task.sync.status() {
all::Status::Sync => {}
all::Status::WarpSyncFragments {
source: None,
finalized_block_hash,
finalized_block_number,
} => {
log::warn!(
target: &task.log_target,
"GrandPa warp sync idle at block #{} (0x{})",
finalized_block_number,
HashDisplay(&finalized_block_hash),
);
}
all::Status::WarpSyncFragments {
finalized_block_hash,
finalized_block_number,
..
}
| all::Status::WarpSyncChainInformation {
finalized_block_hash,
finalized_block_number,
} => {
log::warn!(
target: &task.log_target,
"GrandPa warp sync in progress. Block: #{} (0x{}).",
finalized_block_number,
HashDisplay(&finalized_block_hash)
);
}
};
}
WakeUpReason::MustLoopAgain => {}
}
}
}
struct Task<TPlat: PlatformRef> {
/// Log target to use for all logs that are emitted.
log_target: String,
/// Access to the platform's capabilities.
platform: TPlat,
/// Main syncing state machine. Contains a list of peers, requests, and blocks, and manages
/// everything about the non-finalized chain.
///
/// For each request, we store a [`future::AbortHandle`] that can be used to abort the
/// request if desired.
sync: all::AllSync<future::AbortHandle, (libp2p::PeerId, codec::Role), ()>,
/// If `Some`, contains the runtime of the current finalized block.
known_finalized_runtime: Option<FinalizedBlockRuntime>,
/// For each networking peer, the index of the corresponding peer within the [`Task::sync`].
peers_source_id_map: HashMap<libp2p::PeerId, all::SourceId, util::SipHasherBuild>,
/// `false` after the best block in the [`Task::sync`] has changed. Set back to `true`
/// after the networking has been notified of this change.
network_up_to_date_best: bool,
/// `false` after the finalized block in the [`Task::sync`] has changed. Set back to `true`
/// after the networking has been notified of this change.
network_up_to_date_finalized: bool,
/// All event subscribers that are interested in events about the chain.
all_notifications: Vec<async_channel::Sender<Notification>>,
/// Contains a `Delay` after which we print a warning about GrandPa warp sync taking a long
/// time. Set to `Pending` after the warp sync has finished, so that future remains pending
/// forever.
warp_sync_taking_long_time_warning:
future::Fuse<future::Either<Pin<Box<TPlat::Delay>>, future::Pending<()>>>,
/// Chain of the network service. Used to send out requests to peers.
network_service: Arc<network_service::NetworkServiceChain<TPlat>>,
/// Events coming from the networking service. `None` if not subscribed yet.
from_network_service: Option<Pin<Box<async_channel::Receiver<network_service::Event>>>>,
/// List of requests currently in progress.
pending_requests: stream::FuturesUnordered<
future::BoxFuture<'static, (all::RequestId, Result<RequestOutcome, future::Aborted>)>,
>,
}
enum RequestOutcome {
Block(Result<Vec<codec::BlockData>, network_service::BlocksRequestError>),
WarpSync(
Result<
network::service::EncodedGrandpaWarpSyncResponse,
network_service::WarpSyncRequestError,
>,
),
Storage(Result<Vec<u8>, ()>),
CallProof(Result<network::service::EncodedMerkleProof, ()>),
}
impl<TPlat: PlatformRef> Task<TPlat> {
/// Verifies one block, or finality proof, or warp sync fragment, etc. that is queued for
/// verification.
///
/// Returns `self` and a boolean indicating whether something has been processed.
async fn process_one_verification_queue(mut self) -> (Self, bool) {
// Note that `process_one` moves out of `sync` and provides the value back in its
// return value.
match self.sync.process_one() {
all::ProcessOne::AllSync(sync) => {
// Nothing to do. Queue is empty.
self.sync = sync;
return (self, false);
}
all::ProcessOne::WarpSyncBuildRuntime(req) => {
// Warp syncing compiles the runtime. The compiled runtime will later be yielded
// in the `WarpSyncFinished` variant, which is then provided as an event.
let before_instant = self.platform.now();
let (new_sync, error) = req.build(all::ExecHint::CompileAheadOfTime, true);
let elapsed = self.platform.now() - before_instant;
match error {
Ok(()) => {
log::debug!(
target: &self.log_target,
"Sync => WarpSyncRuntimeBuild(success=true, duration={:?})",
elapsed
);
}
Err(err) => {
// TODO: should disconnect peer
log::debug!(target: &self.log_target, "Sync => WarpSyncRuntimeBuild(error={})", err);
if !matches!(err, all::WarpSyncBuildRuntimeError::SourceMisbehavior(_)) {
log::warn!(target: &self.log_target, "Failed to compile runtime during warp syncing process: {}", err);
}
}
};
self.sync = new_sync;
}
all::ProcessOne::WarpSyncBuildChainInformation(req) => {
let (new_sync, error) = req.build();
match error {
Ok(()) => {
log::debug!(target: &self.log_target, "Sync => WarpSyncBuildChainInformation(success=true)")
}
Err(err) => {
// TODO: should disconnect peer
log::debug!(target: &self.log_target, "Sync => WarpSyncBuildChainInformation(error={})", err);
if !matches!(
err,
all::WarpSyncBuildChainInformationError::SourceMisbehavior(_)
) {
log::warn!(target: &self.log_target, "Failed to build the chain information during warp syncing process: {}", err);
}
}
};
self.sync = new_sync;
}
all::ProcessOne::WarpSyncFinished {
sync,
finalized_block_runtime,
finalized_storage_code,
finalized_storage_code_closest_ancestor_excluding,
finalized_storage_heap_pages,
finalized_storage_code_merkle_value,
} => {
self.sync = sync;
let finalized_header = self.sync.finalized_block_header();
log::info!(
target: &self.log_target,
"GrandPa warp sync finished to #{} ({})",
finalized_header.number,
HashDisplay(&finalized_header.hash(self.sync.block_number_bytes()))
);
self.warp_sync_taking_long_time_warning =
future::Either::Right(future::pending()).fuse();
debug_assert!(self.known_finalized_runtime.is_none());
self.known_finalized_runtime = Some(FinalizedBlockRuntime {
virtual_machine: finalized_block_runtime,
storage_code: finalized_storage_code,
storage_heap_pages: finalized_storage_heap_pages,
code_merkle_value: finalized_storage_code_merkle_value,
closest_ancestor_excluding: finalized_storage_code_closest_ancestor_excluding,
});
self.network_up_to_date_finalized = false;
self.network_up_to_date_best = false;
// Since there is a gap in the blocks, all active notifications to all blocks
// must be cleared.
self.all_notifications.clear();
}
all::ProcessOne::VerifyWarpSyncFragment(verify) => {
// Grandpa warp sync fragment to verify.
let sender_peer_id = verify
.proof_sender()
.map(|(_, (peer_id, _))| Cow::Owned(peer_id.to_string())) // TODO: unnecessary cloning most of the time
.unwrap_or(Cow::Borrowed("<disconnected>"));
let (sync, result) = verify.perform({
let mut seed = [0; 32];
self.platform.fill_random_bytes(&mut seed);
seed
});
self.sync = sync;
match result {
Ok((fragment_hash, fragment_number)) => {
// TODO: must call `set_local_grandpa_state` and `set_local_best_block` so that other peers notify us of neighbor packets
log::debug!(
target: &self.log_target,
"Sync => WarpSyncFragmentVerified(sender={}, verified_hash={}, verified_height={fragment_number})",
sender_peer_id,
HashDisplay(&fragment_hash)
);
}
Err(err) => {
// TODO: should disconnect peer
let maybe_forced_change =
matches!(err, all::VerifyFragmentError::JustificationVerify(_));
log::warn!(
target: &self.log_target,
"Failed to verify warp sync fragment from {}: {}{}",
sender_peer_id,
err,
if maybe_forced_change {
". This might be caused by a forced GrandPa authorities change having \
been enacted on the chain. If this is the case, please update the \
chain specification with a checkpoint past this forced change."
} else { "" }
);
}
}
}
all::ProcessOne::VerifyBlock(verify) => {
// Header to verify.
let verified_hash = verify.hash();
match verify.verify_header(self.platform.now_from_unix_epoch()) {
all::HeaderVerifyOutcome::Success {
success,
is_new_best,
..
} => {
let verified_height = success.height();
self.sync = success.finish(());
log::debug!(
target: &self.log_target,
"Sync => HeaderVerified(hash={}, new_best={})",
HashDisplay(&verified_hash),
if is_new_best { "yes" } else { "no" }
);
if is_new_best {
self.network_up_to_date_best = false;
}
let (parent_hash, scale_encoded_header) = {
// TODO: the code below is `O(n)` complexity
let header = self
.sync
.non_finalized_blocks_unordered()
.find(|h| h.hash(self.sync.block_number_bytes()) == verified_hash)
.unwrap();
(
*header.parent_hash,
header.scale_encoding_vec(self.sync.block_number_bytes()),
)
};
// Announce the newly-verified block to all the light client sources that
// might not be aware of it. We can never be guaranteed that a certain
// source does *not* know about a block, however it is not a big problem
// to send a block announce to a source that already knows about that
// block. For this reason, the list of sources we send the block announce
// to is `all_sources - sources_that_know_it`.
//
// Note that not sending block announces to sources that already know that
// block means that these sources might also miss the fact that our local
// best block has been updated. This is in practice not a problem either.
//
// Block announces are intentionally sent only to light clients, and not
// to full nodes. Block announces coming from light clients are useless to
// full nodes, as they can't download the block body (which they need)
// from that light client.
//
// Announcing blocks to other light clients increases the likelihood that
// equivocations are detected by light clients. This is especially
// important for light clients, as they try to connect to as few full
// nodes as possible.
let sources_to_announce_to = {
let mut all_sources = self
.sync
.sources()
.filter(|s| matches!(self.sync[*s].1, codec::Role::Light))
.collect::<HashSet<_, fnv::FnvBuildHasher>>();
for knows in self
.sync
.knows_non_finalized_block(verified_height, &verified_hash)
{
all_sources.remove(&knows);
}
all_sources
};
for source_id in sources_to_announce_to {
// The `PeerId` needs to be cloned, otherwise `self` would have to
// stay borrowed accross an `await`, which isn't possible because it
// doesn't implement `Sync`.
let (source_peer_id, _source_role) = &self.sync[source_id].clone();
debug_assert!(matches!(_source_role, codec::Role::Light));
if self
.network_service
.clone()
.send_block_announce(
source_peer_id,
&scale_encoded_header,
is_new_best,
)
.await
.is_ok()
{
log::debug!(
target: &self.log_target,
"Network <= BlockAnnounce(peer_id={}, hash={})",
source_peer_id,
HashDisplay(&verified_hash)
);
// Update the sync state machine with the fact that the target of
// the block announce now knows this block.
//
// This code is never called for full nodes. When it comes to full
// nodes, we want track knowledge about block bodies and storage
// rather than just headers.
//
// Note that `try_add_known_block_to_source` might have
// no effect, which is not a problem considering that this
// block tracking is mostly about optimizations and
// politeness.
self.sync.try_add_known_block_to_source(
source_id,
verified_height,
verified_hash,
);
}
}
// Notify of the new block.
self.dispatch_all_subscribers({
Notification::Block(BlockNotification {
is_new_best,
scale_encoded_header,
parent_hash,
})
});
}
all::HeaderVerifyOutcome::Error { sync, error, .. } => {
self.sync = sync;
// TODO: print which peer sent the header
log::debug!(
target: &self.log_target,
"Sync => HeaderVerifyError(hash={}, error={:?})",
HashDisplay(&verified_hash),
error
);
log::warn!(
target: &self.log_target,
"Error while verifying header {}: {}",
HashDisplay(&verified_hash),
error
);
}
}
}
all::ProcessOne::VerifyFinalityProof(verify) => {
// Finality proof to verify.
match verify.perform({
let mut seed = [0; 32];
self.platform.fill_random_bytes(&mut seed);
seed
}) {
(
sync,
all::FinalityProofVerifyOutcome::NewFinalized {
updates_best_block,
finalized_blocks_newest_to_oldest,
..
},
) => {
self.sync = sync;
log::debug!(
target: &self.log_target,
"Sync => FinalityProofVerified(finalized_blocks={})",
finalized_blocks_newest_to_oldest.len(),
);
if updates_best_block {
self.network_up_to_date_best = false;
}
self.network_up_to_date_finalized = false;
// Invalidate the cache of the runtime of the finalized blocks if any
// of the finalized blocks indicates that a runtime update happened.
if finalized_blocks_newest_to_oldest
.iter()
.any(|b| b.header.digest.has_runtime_environment_updated())
{
self.known_finalized_runtime = None;
}
self.dispatch_all_subscribers(Notification::Finalized {
hash: self
.sync
.finalized_block_header()
.hash(self.sync.block_number_bytes()),
best_block_hash: self.sync.best_block_hash(),
});
}
(
sync,
all::FinalityProofVerifyOutcome::AlreadyFinalized
| all::FinalityProofVerifyOutcome::GrandpaCommitPending,
) => {
self.sync = sync;
}
(sync, all::FinalityProofVerifyOutcome::JustificationError(error)) => {
self.sync = sync;
// TODO: print which peer sent the proof
log::debug!(
target: &self.log_target,
"Sync => JustificationVerificationError(error={:?})",
error,
);
log::warn!(
target: &self.log_target,
"Error while verifying justification: {}",
error
);
}
(sync, all::FinalityProofVerifyOutcome::GrandpaCommitError(error)) => {
self.sync = sync;
// TODO: print which peer sent the proof
log::debug!(
target: &self.log_target,
"Sync => GrandpaCommitVerificationError(error={:?})",
error,
);
log::warn!(
target: &self.log_target,
"Error while verifying GrandPa commit: {}",
error
);
}
}
}
}
(self, true)
}
/// Sends a notification to all the notification receivers.
fn dispatch_all_subscribers(&mut self, notification: Notification) {
// Elements in `all_notifications` are removed one by one and inserted back if the
// channel is still open.
for index in (0..self.all_notifications.len()).rev() {
let subscription = self.all_notifications.swap_remove(index);
if subscription.try_send(notification.clone()).is_err() {
continue;
}
self.all_notifications.push(subscription);
}
}
}