_ Git - rust-lightning/blob - lightning/src/routing/network_graph.rs

   1 // This file is Copyright its original authors, visible in version control
   2 // history.
   3 //
   4 // This file is licensed under the Apache License, Version 2.0 <LICENSE-APACHE
   5 // or http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
   6 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your option.
   7 // You may not use this file except in accordance with one or both of these
   8 // licenses.
   9
  10 //! The top-level network map tracking logic lives here.
  11
  12 use bitcoin::secp256k1::constants::PUBLIC_KEY_SIZE;
  13 use bitcoin::secp256k1::key::PublicKey;
  14 use bitcoin::secp256k1::Secp256k1;
  15 use bitcoin::secp256k1;
  16
  17 use bitcoin::hashes::sha256d::Hash as Sha256dHash;
  18 use bitcoin::hashes::Hash;
  19 use bitcoin::blockdata::script::Builder;
  20 use bitcoin::blockdata::transaction::TxOut;
  21 use bitcoin::blockdata::opcodes;
  22 use bitcoin::hash_types::BlockHash;
  23
  24 use chain;
  25 use chain::Access;
  26 use ln::features::{ChannelFeatures, NodeFeatures};
  27 use ln::msgs::{DecodeError, ErrorAction, Init, LightningError, RoutingMessageHandler, NetAddress, MAX_VALUE_MSAT};
  28 use ln::msgs::{ChannelAnnouncement, ChannelUpdate, NodeAnnouncement, OptionalField, GossipTimestampFilter};
  29 use ln::msgs::{QueryChannelRange, ReplyChannelRange, QueryShortChannelIds, ReplyShortChannelIdsEnd};
  30 use ln::msgs;
  31 use util::ser::{Writeable, Readable, Writer};
  32 use util::logger::{Logger, Level};
  33 use util::events::{Event, EventHandler, MessageSendEvent, MessageSendEventsProvider};
  34 use util::scid_utils::{block_from_scid, scid_from_parts, MAX_SCID_BLOCK};
  35
  36 use io;
  37 use prelude::*;
  38 use alloc::collections::{BTreeMap, btree_map::Entry as BtreeEntry};
  39 use core::{cmp, fmt};
  40 use sync::{RwLock, RwLockReadGuard};
  41 use core::sync::atomic::{AtomicUsize, Ordering};
  42 use sync::Mutex;
  43 use core::ops::Deref;
  44 use bitcoin::hashes::hex::ToHex;
  45
  46 #[cfg(feature = "std")]
  47 use std::time::{SystemTime, UNIX_EPOCH};
  48
  49 /// We remove stale channel directional info two weeks after the last update, per BOLT 7's
  50 /// suggestion.
  51 const STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS: u64 = 60 * 60 * 24 * 14;
  52
  53 /// The maximum number of extra bytes which we do not understand in a gossip message before we will
  54 /// refuse to relay the message.
  55 const MAX_EXCESS_BYTES_FOR_RELAY: usize = 1024;
  56
  57 /// Maximum number of short_channel_ids that will be encoded in one gossip reply message.
  58 /// This value ensures a reply fits within the 65k payload limit and is consistent with other implementations.
  59 const MAX_SCIDS_PER_REPLY: usize = 8000;
  60
  61 /// Represents the compressed public key of a node
  62 #[derive(Clone, Copy)]
  63 pub struct NodeId([u8; PUBLIC_KEY_SIZE]);
  64
  65 impl NodeId {
  66         /// Create a new NodeId from a public key
  67         pub fn from_pubkey(pubkey: &PublicKey) -> Self {
  68                 NodeId(pubkey.serialize())
  69         }
  70
  71         /// Get the public key slice from this NodeId
  72         pub fn as_slice(&self) -> &[u8] {
  73                 &self.0
  74         }
  75 }
  76
  77 impl fmt::Debug for NodeId {
  78         fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
  79                 write!(f, "NodeId({})", log_bytes!(self.0))
  80         }
  81 }
  82
  83 impl core::hash::Hash for NodeId {
  84         fn hash<H: core::hash::Hasher>(&self, hasher: &mut H) {
  85                 self.0.hash(hasher);
  86         }
  87 }
  88
  89 impl Eq for NodeId {}
  90
  91 impl PartialEq for NodeId {
  92         fn eq(&self, other: &Self) -> bool {
  93                 self.0[..] == other.0[..]
  94         }
  95 }
  96
  97 impl cmp::PartialOrd for NodeId {
  98         fn partial_cmp(&self, other: &Self) -> Option<cmp::Ordering> {
  99                 Some(self.cmp(other))
 100         }
 101 }
 102
 103 impl Ord for NodeId {
 104         fn cmp(&self, other: &Self) -> cmp::Ordering {
 105                 self.0[..].cmp(&other.0[..])
 106         }
 107 }
 108
 109 impl Writeable for NodeId {
 110         fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
 111                 writer.write_all(&self.0)?;
 112                 Ok(())
 113         }
 114 }
 115
 116 impl Readable for NodeId {
 117         fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
 118                 let mut buf = [0; PUBLIC_KEY_SIZE];
 119                 reader.read_exact(&mut buf)?;
 120                 Ok(Self(buf))
 121         }
 122 }
 123
 124 /// Represents the network as nodes and channels between them
 125 pub struct NetworkGraph {
 126         genesis_hash: BlockHash,
 127         // Lock order: channels -> nodes
 128         channels: RwLock<BTreeMap<u64, ChannelInfo>>,
 129         nodes: RwLock<BTreeMap<NodeId, NodeInfo>>,
 130 }
 131
 132 impl Clone for NetworkGraph {
 133         fn clone(&self) -> Self {
 134                 let channels = self.channels.read().unwrap();
 135                 let nodes = self.nodes.read().unwrap();
 136                 Self {
 137                         genesis_hash: self.genesis_hash.clone(),
 138                         channels: RwLock::new(channels.clone()),
 139                         nodes: RwLock::new(nodes.clone()),
 140                 }
 141         }
 142 }
 143
 144 /// A read-only view of [`NetworkGraph`].
 145 pub struct ReadOnlyNetworkGraph<'a> {
 146         channels: RwLockReadGuard<'a, BTreeMap<u64, ChannelInfo>>,
 147         nodes: RwLockReadGuard<'a, BTreeMap<NodeId, NodeInfo>>,
 148 }
 149
 150 /// Update to the [`NetworkGraph`] based on payment failure information conveyed via the Onion
 151 /// return packet by a node along the route. See [BOLT #4] for details.
 152 ///
 153 /// [BOLT #4]: https://github.com/lightningnetwork/lightning-rfc/blob/master/04-onion-routing.md
 154 #[derive(Clone, Debug, PartialEq)]
 155 pub enum NetworkUpdate {
 156         /// An error indicating a `channel_update` messages should be applied via
 157         /// [`NetworkGraph::update_channel`].
 158         ChannelUpdateMessage {
 159                 /// The update to apply via [`NetworkGraph::update_channel`].
 160                 msg: ChannelUpdate,
 161         },
 162         /// An error indicating only that a channel has been closed, which should be applied via
 163         /// [`NetworkGraph::close_channel_from_update`].
 164         ChannelClosed {
 165                 /// The short channel id of the closed channel.
 166                 short_channel_id: u64,
 167                 /// Whether the channel should be permanently removed or temporarily disabled until a new
 168                 /// `channel_update` message is received.
 169                 is_permanent: bool,
 170         },
 171         /// An error indicating only that a node has failed, which should be applied via
 172         /// [`NetworkGraph::fail_node`].
 173         NodeFailure {
 174                 /// The node id of the failed node.
 175                 node_id: PublicKey,
 176                 /// Whether the node should be permanently removed from consideration or can be restored
 177                 /// when a new `channel_update` message is received.
 178                 is_permanent: bool,
 179         }
 180 }
 181
 182 impl_writeable_tlv_based_enum_upgradable!(NetworkUpdate,
 183         (0, ChannelUpdateMessage) => {
 184                 (0, msg, required),
 185         },
 186         (2, ChannelClosed) => {
 187                 (0, short_channel_id, required),
 188                 (2, is_permanent, required),
 189         },
 190         (4, NodeFailure) => {
 191                 (0, node_id, required),
 192                 (2, is_permanent, required),
 193         },
 194 );
 195
 196 impl<G: Deref<Target=NetworkGraph>, C: Deref, L: Deref> EventHandler for NetGraphMsgHandler<G, C, L>
 197 where C::Target: chain::Access, L::Target: Logger {
 198         fn handle_event(&self, event: &Event) {
 199                 if let Event::PaymentPathFailed { payment_hash: _, rejected_by_dest: _, network_update, .. } = event {
 200                         if let Some(network_update) = network_update {
 201                                 self.handle_network_update(network_update);
 202                         }
 203                 }
 204         }
 205 }
 206
 207 /// Receives and validates network updates from peers,
 208 /// stores authentic and relevant data as a network graph.
 209 /// This network graph is then used for routing payments.
 210 /// Provides interface to help with initial routing sync by
 211 /// serving historical announcements.
 212 ///
 213 /// Serves as an [`EventHandler`] for applying updates from [`Event::PaymentPathFailed`] to the
 214 /// [`NetworkGraph`].
 215 pub struct NetGraphMsgHandler<G: Deref<Target=NetworkGraph>, C: Deref, L: Deref>
 216 where C::Target: chain::Access, L::Target: Logger
 217 {
 218         secp_ctx: Secp256k1<secp256k1::VerifyOnly>,
 219         network_graph: G,
 220         chain_access: Option<C>,
 221         full_syncs_requested: AtomicUsize,
 222         pending_events: Mutex<Vec<MessageSendEvent>>,
 223         logger: L,
 224 }
 225
 226 impl<G: Deref<Target=NetworkGraph>, C: Deref, L: Deref> NetGraphMsgHandler<G, C, L>
 227 where C::Target: chain::Access, L::Target: Logger
 228 {
 229         /// Creates a new tracker of the actual state of the network of channels and nodes,
 230         /// assuming an existing Network Graph.
 231         /// Chain monitor is used to make sure announced channels exist on-chain,
 232         /// channel data is correct, and that the announcement is signed with
 233         /// channel owners' keys.
 234         pub fn new(network_graph: G, chain_access: Option<C>, logger: L) -> Self {
 235                 NetGraphMsgHandler {
 236                         secp_ctx: Secp256k1::verification_only(),
 237                         network_graph,
 238                         full_syncs_requested: AtomicUsize::new(0),
 239                         chain_access,
 240                         pending_events: Mutex::new(vec![]),
 241                         logger,
 242                 }
 243         }
 244
 245         /// Adds a provider used to check new announcements. Does not affect
 246         /// existing announcements unless they are updated.
 247         /// Add, update or remove the provider would replace the current one.
 248         pub fn add_chain_access(&mut self, chain_access: Option<C>) {
 249                 self.chain_access = chain_access;
 250         }
 251
 252         /// Gets a reference to the underlying [`NetworkGraph`] which was provided in
 253         /// [`NetGraphMsgHandler::new`].
 254         ///
 255         /// (C-not exported) as bindings don't support a reference-to-a-reference yet
 256         pub fn network_graph(&self) -> &G {
 257                 &self.network_graph
 258         }
 259
 260         /// Returns true when a full routing table sync should be performed with a peer.
 261         fn should_request_full_sync(&self, _node_id: &PublicKey) -> bool {
 262                 //TODO: Determine whether to request a full sync based on the network map.
 263                 const FULL_SYNCS_TO_REQUEST: usize = 5;
 264                 if self.full_syncs_requested.load(Ordering::Acquire) < FULL_SYNCS_TO_REQUEST {
 265                         self.full_syncs_requested.fetch_add(1, Ordering::AcqRel);
 266                         true
 267                 } else {
 268                         false
 269                 }
 270         }
 271
 272         /// Applies changes to the [`NetworkGraph`] from the given update.
 273         fn handle_network_update(&self, update: &NetworkUpdate) {
 274                 match *update {
 275                         NetworkUpdate::ChannelUpdateMessage { ref msg } => {
 276                                 let short_channel_id = msg.contents.short_channel_id;
 277                                 let is_enabled = msg.contents.flags & (1 << 1) != (1 << 1);
 278                                 let status = if is_enabled { "enabled" } else { "disabled" };
 279                                 log_debug!(self.logger, "Updating channel with channel_update from a payment failure. Channel {} is {}.", short_channel_id, status);
 280                                 let _ = self.network_graph.update_channel(msg, &self.secp_ctx);
 281                         },
 282                         NetworkUpdate::ChannelClosed { short_channel_id, is_permanent } => {
 283                                 let action = if is_permanent { "Removing" } else { "Disabling" };
 284                                 log_debug!(self.logger, "{} channel graph entry for {} due to a payment failure.", action, short_channel_id);
 285                                 self.network_graph.close_channel_from_update(short_channel_id, is_permanent);
 286                         },
 287                         NetworkUpdate::NodeFailure { ref node_id, is_permanent } => {
 288                                 let action = if is_permanent { "Removing" } else { "Disabling" };
 289                                 log_debug!(self.logger, "{} node graph entry for {} due to a payment failure.", action, node_id);
 290                                 self.network_graph.fail_node(node_id, is_permanent);
 291                         },
 292                 }
 293         }
 294 }
 295
 296 macro_rules! secp_verify_sig {
 297         ( $secp_ctx: expr, $msg: expr, $sig: expr, $pubkey: expr, $msg_type: expr ) => {
 298                 match $secp_ctx.verify($msg, $sig, $pubkey) {
 299                         Ok(_) => {},
 300                         Err(_) => {
 301                                 return Err(LightningError {
 302                                         err: format!("Invalid signature on {} message", $msg_type),
 303                                         action: ErrorAction::SendWarningMessage {
 304                                                 msg: msgs::WarningMessage {
 305                                                         channel_id: [0; 32],
 306                                                         data: format!("Invalid signature on {} message", $msg_type),
 307                                                 },
 308                                                 log_level: Level::Trace,
 309                                         },
 310                                 });
 311                         },
 312                 }
 313         };
 314 }
 315
 316 impl<G: Deref<Target=NetworkGraph>, C: Deref, L: Deref> RoutingMessageHandler for NetGraphMsgHandler<G, C, L>
 317 where C::Target: chain::Access, L::Target: Logger
 318 {
 319         fn handle_node_announcement(&self, msg: &msgs::NodeAnnouncement) -> Result<bool, LightningError> {
 320                 self.network_graph.update_node_from_announcement(msg, &self.secp_ctx)?;
 321                 Ok(msg.contents.excess_data.len() <=  MAX_EXCESS_BYTES_FOR_RELAY &&
 322                    msg.contents.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
 323                    msg.contents.excess_data.len() + msg.contents.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
 324         }
 325
 326         fn handle_channel_announcement(&self, msg: &msgs::ChannelAnnouncement) -> Result<bool, LightningError> {
 327                 self.network_graph.update_channel_from_announcement(msg, &self.chain_access, &self.secp_ctx)?;
 328                 log_gossip!(self.logger, "Added channel_announcement for {}{}", msg.contents.short_channel_id, if !msg.contents.excess_data.is_empty() { " with excess uninterpreted data!" } else { "" });
 329                 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
 330         }
 331
 332         fn handle_channel_update(&self, msg: &msgs::ChannelUpdate) -> Result<bool, LightningError> {
 333                 self.network_graph.update_channel(msg, &self.secp_ctx)?;
 334                 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
 335         }
 336
 337         fn get_next_channel_announcements(&self, starting_point: u64, batch_amount: u8) -> Vec<(ChannelAnnouncement, Option<ChannelUpdate>, Option<ChannelUpdate>)> {
 338                 let mut result = Vec::with_capacity(batch_amount as usize);
 339                 let channels = self.network_graph.channels.read().unwrap();
 340                 let mut iter = channels.range(starting_point..);
 341                 while result.len() < batch_amount as usize {
 342                         if let Some((_, ref chan)) = iter.next() {
 343                                 if chan.announcement_message.is_some() {
 344                                         let chan_announcement = chan.announcement_message.clone().unwrap();
 345                                         let mut one_to_two_announcement: Option<msgs::ChannelUpdate> = None;
 346                                         let mut two_to_one_announcement: Option<msgs::ChannelUpdate> = None;
 347                                         if let Some(one_to_two) = chan.one_to_two.as_ref() {
 348                                                 one_to_two_announcement = one_to_two.last_update_message.clone();
 349                                         }
 350                                         if let Some(two_to_one) = chan.two_to_one.as_ref() {
 351                                                 two_to_one_announcement = two_to_one.last_update_message.clone();
 352                                         }
 353                                         result.push((chan_announcement, one_to_two_announcement, two_to_one_announcement));
 354                                 } else {
 355                                         // TODO: We may end up sending un-announced channel_updates if we are sending
 356                                         // initial sync data while receiving announce/updates for this channel.
 357                                 }
 358                         } else {
 359                                 return result;
 360                         }
 361                 }
 362                 result
 363         }
 364
 365         fn get_next_node_announcements(&self, starting_point: Option<&PublicKey>, batch_amount: u8) -> Vec<NodeAnnouncement> {
 366                 let mut result = Vec::with_capacity(batch_amount as usize);
 367                 let nodes = self.network_graph.nodes.read().unwrap();
 368                 let mut iter = if let Some(pubkey) = starting_point {
 369                                 let mut iter = nodes.range(NodeId::from_pubkey(pubkey)..);
 370                                 iter.next();
 371                                 iter
 372                         } else {
 373                                 nodes.range::<NodeId, _>(..)
 374                         };
 375                 while result.len() < batch_amount as usize {
 376                         if let Some((_, ref node)) = iter.next() {
 377                                 if let Some(node_info) = node.announcement_info.as_ref() {
 378                                         if node_info.announcement_message.is_some() {
 379                                                 result.push(node_info.announcement_message.clone().unwrap());
 380                                         }
 381                                 }
 382                         } else {
 383                                 return result;
 384                         }
 385                 }
 386                 result
 387         }
 388
 389         /// Initiates a stateless sync of routing gossip information with a peer
 390         /// using gossip_queries. The default strategy used by this implementation
 391         /// is to sync the full block range with several peers.
 392         ///
 393         /// We should expect one or more reply_channel_range messages in response
 394         /// to our query_channel_range. Each reply will enqueue a query_scid message
 395         /// to request gossip messages for each channel. The sync is considered complete
 396         /// when the final reply_scids_end message is received, though we are not
 397         /// tracking this directly.
 398         fn peer_connected(&self, their_node_id: &PublicKey, init_msg: &Init) {
 399                 // We will only perform a sync with peers that support gossip_queries.
 400                 if !init_msg.features.supports_gossip_queries() {
 401                         return ();
 402                 }
 403
 404                 // Send a gossip_timestamp_filter to enable gossip message receipt. Note that we have to
 405                 // use a "all timestamps" filter as sending the current timestamp would result in missing
 406                 // gossip messages that are simply sent late. We could calculate the intended filter time
 407                 // by looking at the current time and subtracting two weeks (before which we'll reject
 408                 // messages), but there's not a lot of reason to bother - our peers should be discarding
 409                 // the same messages.
 410                 let mut pending_events = self.pending_events.lock().unwrap();
 411                 pending_events.push(MessageSendEvent::SendGossipTimestampFilter {
 412                         node_id: their_node_id.clone(),
 413                         msg: GossipTimestampFilter {
 414                                 chain_hash: self.network_graph.genesis_hash,
 415                                 first_timestamp: 0,
 416                                 timestamp_range: u32::max_value(),
 417                         },
 418                 });
 419
 420                 // Check if we need to perform a full synchronization with this peer
 421                 if !self.should_request_full_sync(&their_node_id) {
 422                         return ();
 423                 }
 424
 425                 let first_blocknum = 0;
 426                 let number_of_blocks = 0xffffffff;
 427                 log_debug!(self.logger, "Sending query_channel_range peer={}, first_blocknum={}, number_of_blocks={}", log_pubkey!(their_node_id), first_blocknum, number_of_blocks);
 428                 pending_events.push(MessageSendEvent::SendChannelRangeQuery {
 429                         node_id: their_node_id.clone(),
 430                         msg: QueryChannelRange {
 431                                 chain_hash: self.network_graph.genesis_hash,
 432                                 first_blocknum,
 433                                 number_of_blocks,
 434                         },
 435                 });
 436         }
 437
 438         /// Statelessly processes a reply to a channel range query by immediately
 439         /// sending an SCID query with SCIDs in the reply. To keep this handler
 440         /// stateless, it does not validate the sequencing of replies for multi-
 441         /// reply ranges. It does not validate whether the reply(ies) cover the
 442         /// queried range. It also does not filter SCIDs to only those in the
 443         /// original query range. We also do not validate that the chain_hash
 444         /// matches the chain_hash of the NetworkGraph. Any chan_ann message that
 445         /// does not match our chain_hash will be rejected when the announcement is
 446         /// processed.
 447         fn handle_reply_channel_range(&self, their_node_id: &PublicKey, msg: ReplyChannelRange) -> Result<(), LightningError> {
 448                 log_debug!(self.logger, "Handling reply_channel_range peer={}, first_blocknum={}, number_of_blocks={}, sync_complete={}, scids={}", log_pubkey!(their_node_id), msg.first_blocknum, msg.number_of_blocks, msg.sync_complete, msg.short_channel_ids.len(),);
 449
 450                 log_debug!(self.logger, "Sending query_short_channel_ids peer={}, batch_size={}", log_pubkey!(their_node_id), msg.short_channel_ids.len());
 451                 let mut pending_events = self.pending_events.lock().unwrap();
 452                 pending_events.push(MessageSendEvent::SendShortIdsQuery {
 453                         node_id: their_node_id.clone(),
 454                         msg: QueryShortChannelIds {
 455                                 chain_hash: msg.chain_hash,
 456                                 short_channel_ids: msg.short_channel_ids,
 457                         }
 458                 });
 459
 460                 Ok(())
 461         }
 462
 463         /// When an SCID query is initiated the remote peer will begin streaming
 464         /// gossip messages. In the event of a failure, we may have received
 465         /// some channel information. Before trying with another peer, the
 466         /// caller should update its set of SCIDs that need to be queried.
 467         fn handle_reply_short_channel_ids_end(&self, their_node_id: &PublicKey, msg: ReplyShortChannelIdsEnd) -> Result<(), LightningError> {
 468                 log_debug!(self.logger, "Handling reply_short_channel_ids_end peer={}, full_information={}", log_pubkey!(their_node_id), msg.full_information);
 469
 470                 // If the remote node does not have up-to-date information for the
 471                 // chain_hash they will set full_information=false. We can fail
 472                 // the result and try again with a different peer.
 473                 if !msg.full_information {
 474                         return Err(LightningError {
 475                                 err: String::from("Received reply_short_channel_ids_end with no information"),
 476                                 action: ErrorAction::IgnoreError
 477                         });
 478                 }
 479
 480                 Ok(())
 481         }
 482
 483         /// Processes a query from a peer by finding announced/public channels whose funding UTXOs
 484         /// are in the specified block range. Due to message size limits, large range
 485         /// queries may result in several reply messages. This implementation enqueues
 486         /// all reply messages into pending events. Each message will allocate just under 65KiB. A full
 487         /// sync of the public routing table with 128k channels will generated 16 messages and allocate ~1MB.
 488         /// Logic can be changed to reduce allocation if/when a full sync of the routing table impacts
 489         /// memory constrained systems.
 490         fn handle_query_channel_range(&self, their_node_id: &PublicKey, msg: QueryChannelRange) -> Result<(), LightningError> {
 491                 log_debug!(self.logger, "Handling query_channel_range peer={}, first_blocknum={}, number_of_blocks={}", log_pubkey!(their_node_id), msg.first_blocknum, msg.number_of_blocks);
 492
 493                 let inclusive_start_scid = scid_from_parts(msg.first_blocknum as u64, 0, 0);
 494
 495                 // We might receive valid queries with end_blocknum that would overflow SCID conversion.
 496                 // If so, we manually cap the ending block to avoid this overflow.
 497                 let exclusive_end_scid = scid_from_parts(cmp::min(msg.end_blocknum() as u64, MAX_SCID_BLOCK), 0, 0);
 498
 499                 // Per spec, we must reply to a query. Send an empty message when things are invalid.
 500                 if msg.chain_hash != self.network_graph.genesis_hash || inclusive_start_scid.is_err() || exclusive_end_scid.is_err() || msg.number_of_blocks == 0 {
 501                         let mut pending_events = self.pending_events.lock().unwrap();
 502                         pending_events.push(MessageSendEvent::SendReplyChannelRange {
 503                                 node_id: their_node_id.clone(),
 504                                 msg: ReplyChannelRange {
 505                                         chain_hash: msg.chain_hash.clone(),
 506                                         first_blocknum: msg.first_blocknum,
 507                                         number_of_blocks: msg.number_of_blocks,
 508                                         sync_complete: true,
 509                                         short_channel_ids: vec![],
 510                                 }
 511                         });
 512                         return Err(LightningError {
 513                                 err: String::from("query_channel_range could not be processed"),
 514                                 action: ErrorAction::IgnoreError,
 515                         });
 516                 }
 517
 518                 // Creates channel batches. We are not checking if the channel is routable
 519                 // (has at least one update). A peer may still want to know the channel
 520                 // exists even if its not yet routable.
 521                 let mut batches: Vec<Vec<u64>> = vec![Vec::with_capacity(MAX_SCIDS_PER_REPLY)];
 522                 let channels = self.network_graph.channels.read().unwrap();
 523                 for (_, ref chan) in channels.range(inclusive_start_scid.unwrap()..exclusive_end_scid.unwrap()) {
 524                         if let Some(chan_announcement) = &chan.announcement_message {
 525                                 // Construct a new batch if last one is full
 526                                 if batches.last().unwrap().len() == batches.last().unwrap().capacity() {
 527                                         batches.push(Vec::with_capacity(MAX_SCIDS_PER_REPLY));
 528                                 }
 529
 530                                 let batch = batches.last_mut().unwrap();
 531                                 batch.push(chan_announcement.contents.short_channel_id);
 532                         }
 533                 }
 534                 drop(channels);
 535
 536                 let mut pending_events = self.pending_events.lock().unwrap();
 537                 let batch_count = batches.len();
 538                 let mut prev_batch_endblock = msg.first_blocknum;
 539                 for (batch_index, batch) in batches.into_iter().enumerate() {
 540                         // Per spec, the initial `first_blocknum` needs to be <= the query's `first_blocknum`
 541                         // and subsequent `first_blocknum`s must be >= the prior reply's `first_blocknum`.
 542                         //
 543                         // Additionally, c-lightning versions < 0.10 require that the `first_blocknum` of each
 544                         // reply is >= the previous reply's `first_blocknum` and either exactly the previous
 545                         // reply's `first_blocknum + number_of_blocks` or exactly one greater. This is a
 546                         // significant diversion from the requirements set by the spec, and, in case of blocks
 547                         // with no channel opens (e.g. empty blocks), requires that we use the previous value
 548                         // and *not* derive the first_blocknum from the actual first block of the reply.
 549                         let first_blocknum = prev_batch_endblock;
 550
 551                         // Each message carries the number of blocks (from the `first_blocknum`) its contents
 552                         // fit in. Though there is no requirement that we use exactly the number of blocks its
 553                         // contents are from, except for the bogus requirements c-lightning enforces, above.
 554                         //
 555                         // Per spec, the last end block (ie `first_blocknum + number_of_blocks`) needs to be
 556                         // >= the query's end block. Thus, for the last reply, we calculate the difference
 557                         // between the query's end block and the start of the reply.
 558                         //
 559                         // Overflow safe since end_blocknum=msg.first_block_num+msg.number_of_blocks and
 560                         // first_blocknum will be either msg.first_blocknum or a higher block height.
 561                         let (sync_complete, number_of_blocks) = if batch_index == batch_count-1 {
 562                                 (true, msg.end_blocknum() - first_blocknum)
 563                         }
 564                         // Prior replies should use the number of blocks that fit into the reply. Overflow
 565                         // safe since first_blocknum is always <= last SCID's block.
 566                         else {
 567                                 (false, block_from_scid(batch.last().unwrap()) - first_blocknum)
 568                         };
 569
 570                         prev_batch_endblock = first_blocknum + number_of_blocks;
 571
 572                         pending_events.push(MessageSendEvent::SendReplyChannelRange {
 573                                 node_id: their_node_id.clone(),
 574                                 msg: ReplyChannelRange {
 575                                         chain_hash: msg.chain_hash.clone(),
 576                                         first_blocknum,
 577                                         number_of_blocks,
 578                                         sync_complete,
 579                                         short_channel_ids: batch,
 580                                 }
 581                         });
 582                 }
 583
 584                 Ok(())
 585         }
 586
 587         fn handle_query_short_channel_ids(&self, _their_node_id: &PublicKey, _msg: QueryShortChannelIds) -> Result<(), LightningError> {
 588                 // TODO
 589                 Err(LightningError {
 590                         err: String::from("Not implemented"),
 591                         action: ErrorAction::IgnoreError,
 592                 })
 593         }
 594 }
 595
 596 impl<G: Deref<Target=NetworkGraph>, C: Deref, L: Deref> MessageSendEventsProvider for NetGraphMsgHandler<G, C, L>
 597 where
 598         C::Target: chain::Access,
 599         L::Target: Logger,
 600 {
 601         fn get_and_clear_pending_msg_events(&self) -> Vec<MessageSendEvent> {
 602                 let mut ret = Vec::new();
 603                 let mut pending_events = self.pending_events.lock().unwrap();
 604                 core::mem::swap(&mut ret, &mut pending_events);
 605                 ret
 606         }
 607 }
 608
 609 #[derive(Clone, Debug, PartialEq)]
 610 /// Details about one direction of a channel as received within a [`ChannelUpdate`].
 611 pub struct ChannelUpdateInfo {
 612         /// When the last update to the channel direction was issued.
 613         /// Value is opaque, as set in the announcement.
 614         pub last_update: u32,
 615         /// Whether the channel can be currently used for payments (in this one direction).
 616         pub enabled: bool,
 617         /// The difference in CLTV values that you must have when routing through this channel.
 618         pub cltv_expiry_delta: u16,
 619         /// The minimum value, which must be relayed to the next hop via the channel
 620         pub htlc_minimum_msat: u64,
 621         /// The maximum value which may be relayed to the next hop via the channel.
 622         pub htlc_maximum_msat: Option<u64>,
 623         /// Fees charged when the channel is used for routing
 624         pub fees: RoutingFees,
 625         /// Most recent update for the channel received from the network
 626         /// Mostly redundant with the data we store in fields explicitly.
 627         /// Everything else is useful only for sending out for initial routing sync.
 628         /// Not stored if contains excess data to prevent DoS.
 629         pub last_update_message: Option<ChannelUpdate>,
 630 }
 631
 632 impl fmt::Display for ChannelUpdateInfo {
 633         fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
 634                 write!(f, "last_update {}, enabled {}, cltv_expiry_delta {}, htlc_minimum_msat {}, fees {:?}", self.last_update, self.enabled, self.cltv_expiry_delta, self.htlc_minimum_msat, self.fees)?;
 635                 Ok(())
 636         }
 637 }
 638
 639 impl_writeable_tlv_based!(ChannelUpdateInfo, {
 640         (0, last_update, required),
 641         (2, enabled, required),
 642         (4, cltv_expiry_delta, required),
 643         (6, htlc_minimum_msat, required),
 644         (8, htlc_maximum_msat, required),
 645         (10, fees, required),
 646         (12, last_update_message, required),
 647 });
 648
 649 #[derive(Clone, Debug, PartialEq)]
 650 /// Details about a channel (both directions).
 651 /// Received within a channel announcement.
 652 pub struct ChannelInfo {
 653         /// Protocol features of a channel communicated during its announcement
 654         pub features: ChannelFeatures,
 655         /// Source node of the first direction of a channel
 656         pub node_one: NodeId,
 657         /// Details about the first direction of a channel
 658         pub one_to_two: Option<ChannelUpdateInfo>,
 659         /// Source node of the second direction of a channel
 660         pub node_two: NodeId,
 661         /// Details about the second direction of a channel
 662         pub two_to_one: Option<ChannelUpdateInfo>,
 663         /// The channel capacity as seen on-chain, if chain lookup is available.
 664         pub capacity_sats: Option<u64>,
 665         /// An initial announcement of the channel
 666         /// Mostly redundant with the data we store in fields explicitly.
 667         /// Everything else is useful only for sending out for initial routing sync.
 668         /// Not stored if contains excess data to prevent DoS.
 669         pub announcement_message: Option<ChannelAnnouncement>,
 670         /// The timestamp when we received the announcement, if we are running with feature = "std"
 671         /// (which we can probably assume we are - no-std environments probably won't have a full
 672         /// network graph in memory!).
 673         announcement_received_time: u64,
 674 }
 675
 676 impl ChannelInfo {
 677         /// Returns a [`DirectedChannelInfo`] for the channel directed to the given `target` from a
 678         /// returned `source`, or `None` if `target` is not one of the channel's counterparties.
 679         pub fn as_directed_to(&self, target: &NodeId) -> Option<(DirectedChannelInfo, &NodeId)> {
 680                 let (direction, source) = {
 681                         if target == &self.node_one {
 682                                 (self.two_to_one.as_ref(), &self.node_two)
 683                         } else if target == &self.node_two {
 684                                 (self.one_to_two.as_ref(), &self.node_one)
 685                         } else {
 686                                 return None;
 687                         }
 688                 };
 689                 Some((DirectedChannelInfo { channel: self, direction }, source))
 690         }
 691
 692         /// Returns a [`DirectedChannelInfo`] for the channel directed from the given `source` to a
 693         /// returned `target`, or `None` if `source` is not one of the channel's counterparties.
 694         pub fn as_directed_from(&self, source: &NodeId) -> Option<(DirectedChannelInfo, &NodeId)> {
 695                 let (direction, target) = {
 696                         if source == &self.node_one {
 697                                 (self.one_to_two.as_ref(), &self.node_two)
 698                         } else if source == &self.node_two {
 699                                 (self.two_to_one.as_ref(), &self.node_one)
 700                         } else {
 701                                 return None;
 702                         }
 703                 };
 704                 Some((DirectedChannelInfo { channel: self, direction }, target))
 705         }
 706 }
 707
 708 impl fmt::Display for ChannelInfo {
 709         fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
 710                 write!(f, "features: {}, node_one: {}, one_to_two: {:?}, node_two: {}, two_to_one: {:?}",
 711                    log_bytes!(self.features.encode()), log_bytes!(self.node_one.as_slice()), self.one_to_two, log_bytes!(self.node_two.as_slice()), self.two_to_one)?;
 712                 Ok(())
 713         }
 714 }
 715
 716 impl_writeable_tlv_based!(ChannelInfo, {
 717         (0, features, required),
 718         (1, announcement_received_time, (default_value, 0)),
 719         (2, node_one, required),
 720         (4, one_to_two, required),
 721         (6, node_two, required),
 722         (8, two_to_one, required),
 723         (10, capacity_sats, required),
 724         (12, announcement_message, required),
 725 });
 726
 727 /// A wrapper around [`ChannelInfo`] representing information about the channel as directed from a
 728 /// source node to a target node.
 729 #[derive(Clone)]
 730 pub struct DirectedChannelInfo<'a> {
 731         channel: &'a ChannelInfo,
 732         direction: Option<&'a ChannelUpdateInfo>,
 733 }
 734
 735 impl<'a> DirectedChannelInfo<'a> {
 736         /// Returns information for the channel.
 737         pub fn channel(&self) -> &'a ChannelInfo { self.channel }
 738
 739         /// Returns information for the direction.
 740         pub fn direction(&self) -> Option<&'a ChannelUpdateInfo> { self.direction }
 741
 742         /// Returns the [`EffectiveCapacity`] of the channel in the direction.
 743         ///
 744         /// This is either the total capacity from the funding transaction, if known, or the
 745         /// `htlc_maximum_msat` for the direction as advertised by the gossip network, if known,
 746         /// whichever is smaller.
 747         pub fn effective_capacity(&self) -> EffectiveCapacity {
 748                 let capacity_msat = self.channel.capacity_sats.map(|capacity_sats| capacity_sats * 1000);
 749                 self.direction
 750                         .and_then(|direction| direction.htlc_maximum_msat)
 751                         .map(|max_htlc_msat| {
 752                                 let capacity_msat = capacity_msat.unwrap_or(u64::max_value());
 753                                 if max_htlc_msat < capacity_msat {
 754                                         EffectiveCapacity::MaximumHTLC { amount_msat: max_htlc_msat }
 755                                 } else {
 756                                         EffectiveCapacity::Total { capacity_msat }
 757                                 }
 758                         })
 759                         .or_else(|| capacity_msat.map(|capacity_msat|
 760                                         EffectiveCapacity::Total { capacity_msat }))
 761                         .unwrap_or(EffectiveCapacity::Unknown)
 762         }
 763
 764         /// Returns `Some` if [`ChannelUpdateInfo`] is available in the direction.
 765         pub(super) fn with_update(self) -> Option<DirectedChannelInfoWithUpdate<'a>> {
 766                 match self.direction {
 767                         Some(_) => Some(DirectedChannelInfoWithUpdate { inner: self }),
 768                         None => None,
 769                 }
 770         }
 771 }
 772
 773 impl<'a> fmt::Debug for DirectedChannelInfo<'a> {
 774         fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
 775                 f.debug_struct("DirectedChannelInfo")
 776                         .field("channel", &self.channel)
 777                         .finish()
 778         }
 779 }
 780
 781 /// A [`DirectedChannelInfo`] with [`ChannelUpdateInfo`] available in its direction.
 782 #[derive(Clone)]
 783 pub(super) struct DirectedChannelInfoWithUpdate<'a> {
 784         inner: DirectedChannelInfo<'a>,
 785 }
 786
 787 impl<'a> DirectedChannelInfoWithUpdate<'a> {
 788         /// Returns information for the channel.
 789         #[inline]
 790         pub(super) fn channel(&self) -> &'a ChannelInfo { &self.inner.channel }
 791
 792         /// Returns information for the direction.
 793         #[inline]
 794         pub(super) fn direction(&self) -> &'a ChannelUpdateInfo { self.inner.direction.unwrap() }
 795
 796         /// Returns the [`EffectiveCapacity`] of the channel in the direction.
 797         #[inline]
 798         pub(super) fn effective_capacity(&self) -> EffectiveCapacity { self.inner.effective_capacity() }
 799 }
 800
 801 impl<'a> fmt::Debug for DirectedChannelInfoWithUpdate<'a> {
 802         fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
 803                 self.inner.fmt(f)
 804         }
 805 }
 806
 807 /// The effective capacity of a channel for routing purposes.
 808 ///
 809 /// While this may be smaller than the actual channel capacity, amounts greater than
 810 /// [`Self::as_msat`] should not be routed through the channel.
 811 pub enum EffectiveCapacity {
 812         /// The available liquidity in the channel known from being a channel counterparty, and thus a
 813         /// direct hop.
 814         ExactLiquidity {
 815                 /// Either the inbound or outbound liquidity depending on the direction, denominated in
 816                 /// millisatoshi.
 817                 liquidity_msat: u64,
 818         },
 819         /// The maximum HTLC amount in one direction as advertised on the gossip network.
 820         MaximumHTLC {
 821                 /// The maximum HTLC amount denominated in millisatoshi.
 822                 amount_msat: u64,
 823         },
 824         /// The total capacity of the channel as determined by the funding transaction.
 825         Total {
 826                 /// The funding amount denominated in millisatoshi.
 827                 capacity_msat: u64,
 828         },
 829         /// A capacity sufficient to route any payment, typically used for private channels provided by
 830         /// an invoice.
 831         Infinite,
 832         /// A capacity that is unknown possibly because either the chain state is unavailable to know
 833         /// the total capacity or the `htlc_maximum_msat` was not advertised on the gossip network.
 834         Unknown,
 835 }
 836
 837 /// The presumed channel capacity denominated in millisatoshi for [`EffectiveCapacity::Unknown`] to
 838 /// use when making routing decisions.
 839 pub const UNKNOWN_CHANNEL_CAPACITY_MSAT: u64 = 250_000 * 1000;
 840
 841 impl EffectiveCapacity {
 842         /// Returns the effective capacity denominated in millisatoshi.
 843         pub fn as_msat(&self) -> u64 {
 844                 match self {
 845                         EffectiveCapacity::ExactLiquidity { liquidity_msat } => *liquidity_msat,
 846                         EffectiveCapacity::MaximumHTLC { amount_msat } => *amount_msat,
 847                         EffectiveCapacity::Total { capacity_msat } => *capacity_msat,
 848                         EffectiveCapacity::Infinite => u64::max_value(),
 849                         EffectiveCapacity::Unknown => UNKNOWN_CHANNEL_CAPACITY_MSAT,
 850                 }
 851         }
 852 }
 853
 854 /// Fees for routing via a given channel or a node
 855 #[derive(Eq, PartialEq, Copy, Clone, Debug, Hash)]
 856 pub struct RoutingFees {
 857         /// Flat routing fee in satoshis
 858         pub base_msat: u32,
 859         /// Liquidity-based routing fee in millionths of a routed amount.
 860         /// In other words, 10000 is 1%.
 861         pub proportional_millionths: u32,
 862 }
 863
 864 impl_writeable_tlv_based!(RoutingFees, {
 865         (0, base_msat, required),
 866         (2, proportional_millionths, required)
 867 });
 868
 869 #[derive(Clone, Debug, PartialEq)]
 870 /// Information received in the latest node_announcement from this node.
 871 pub struct NodeAnnouncementInfo {
 872         /// Protocol features the node announced support for
 873         pub features: NodeFeatures,
 874         /// When the last known update to the node state was issued.
 875         /// Value is opaque, as set in the announcement.
 876         pub last_update: u32,
 877         /// Color assigned to the node
 878         pub rgb: [u8; 3],
 879         /// Moniker assigned to the node.
 880         /// May be invalid or malicious (eg control chars),
 881         /// should not be exposed to the user.
 882         pub alias: [u8; 32],
 883         /// Internet-level addresses via which one can connect to the node
 884         pub addresses: Vec<NetAddress>,
 885         /// An initial announcement of the node
 886         /// Mostly redundant with the data we store in fields explicitly.
 887         /// Everything else is useful only for sending out for initial routing sync.
 888         /// Not stored if contains excess data to prevent DoS.
 889         pub announcement_message: Option<NodeAnnouncement>
 890 }
 891
 892 impl_writeable_tlv_based!(NodeAnnouncementInfo, {
 893         (0, features, required),
 894         (2, last_update, required),
 895         (4, rgb, required),
 896         (6, alias, required),
 897         (8, announcement_message, option),
 898         (10, addresses, vec_type),
 899 });
 900
 901 #[derive(Clone, Debug, PartialEq)]
 902 /// Details about a node in the network, known from the network announcement.
 903 pub struct NodeInfo {
 904         /// All valid channels a node has announced
 905         pub channels: Vec<u64>,
 906         /// Lowest fees enabling routing via any of the enabled, known channels to a node.
 907         /// The two fields (flat and proportional fee) are independent,
 908         /// meaning they don't have to refer to the same channel.
 909         pub lowest_inbound_channel_fees: Option<RoutingFees>,
 910         /// More information about a node from node_announcement.
 911         /// Optional because we store a Node entry after learning about it from
 912         /// a channel announcement, but before receiving a node announcement.
 913         pub announcement_info: Option<NodeAnnouncementInfo>
 914 }
 915
 916 impl fmt::Display for NodeInfo {
 917         fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
 918                 write!(f, "lowest_inbound_channel_fees: {:?}, channels: {:?}, announcement_info: {:?}",
 919                    self.lowest_inbound_channel_fees, &self.channels[..], self.announcement_info)?;
 920                 Ok(())
 921         }
 922 }
 923
 924 impl_writeable_tlv_based!(NodeInfo, {
 925         (0, lowest_inbound_channel_fees, option),
 926         (2, announcement_info, option),
 927         (4, channels, vec_type),
 928 });
 929
 930 const SERIALIZATION_VERSION: u8 = 1;
 931 const MIN_SERIALIZATION_VERSION: u8 = 1;
 932
 933 impl Writeable for NetworkGraph {
 934         fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
 935                 write_ver_prefix!(writer, SERIALIZATION_VERSION, MIN_SERIALIZATION_VERSION);
 936
 937                 self.genesis_hash.write(writer)?;
 938                 let channels = self.channels.read().unwrap();
 939                 (channels.len() as u64).write(writer)?;
 940                 for (ref chan_id, ref chan_info) in channels.iter() {
 941                         (*chan_id).write(writer)?;
 942                         chan_info.write(writer)?;
 943                 }
 944                 let nodes = self.nodes.read().unwrap();
 945                 (nodes.len() as u64).write(writer)?;
 946                 for (ref node_id, ref node_info) in nodes.iter() {
 947                         node_id.write(writer)?;
 948                         node_info.write(writer)?;
 949                 }
 950
 951                 write_tlv_fields!(writer, {});
 952                 Ok(())
 953         }
 954 }
 955
 956 impl Readable for NetworkGraph {
 957         fn read<R: io::Read>(reader: &mut R) -> Result<NetworkGraph, DecodeError> {
 958                 let _ver = read_ver_prefix!(reader, SERIALIZATION_VERSION);
 959
 960                 let genesis_hash: BlockHash = Readable::read(reader)?;
 961                 let channels_count: u64 = Readable::read(reader)?;
 962                 let mut channels = BTreeMap::new();
 963                 for _ in 0..channels_count {
 964                         let chan_id: u64 = Readable::read(reader)?;
 965                         let chan_info = Readable::read(reader)?;
 966                         channels.insert(chan_id, chan_info);
 967                 }
 968                 let nodes_count: u64 = Readable::read(reader)?;
 969                 let mut nodes = BTreeMap::new();
 970                 for _ in 0..nodes_count {
 971                         let node_id = Readable::read(reader)?;
 972                         let node_info = Readable::read(reader)?;
 973                         nodes.insert(node_id, node_info);
 974                 }
 975                 read_tlv_fields!(reader, {});
 976
 977                 Ok(NetworkGraph {
 978                         genesis_hash,
 979                         channels: RwLock::new(channels),
 980                         nodes: RwLock::new(nodes),
 981                 })
 982         }
 983 }
 984
 985 impl fmt::Display for NetworkGraph {
 986         fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
 987                 writeln!(f, "Network map\n[Channels]")?;
 988                 for (key, val) in self.channels.read().unwrap().iter() {
 989                         writeln!(f, " {}: {}", key, val)?;
 990                 }
 991                 writeln!(f, "[Nodes]")?;
 992                 for (&node_id, val) in self.nodes.read().unwrap().iter() {
 993                         writeln!(f, " {}: {}", log_bytes!(node_id.as_slice()), val)?;
 994                 }
 995                 Ok(())
 996         }
 997 }
 998
 999 impl PartialEq for NetworkGraph {
1000         fn eq(&self, other: &Self) -> bool {
1001                 self.genesis_hash == other.genesis_hash &&
1002                         *self.channels.read().unwrap() == *other.channels.read().unwrap() &&
1003                         *self.nodes.read().unwrap() == *other.nodes.read().unwrap()
1004         }
1005 }
1006
1007 impl NetworkGraph {
1008         /// Creates a new, empty, network graph.
1009         pub fn new(genesis_hash: BlockHash) -> NetworkGraph {
1010                 Self {
1011                         genesis_hash,
1012                         channels: RwLock::new(BTreeMap::new()),
1013                         nodes: RwLock::new(BTreeMap::new()),
1014                 }
1015         }
1016
1017         /// Returns a read-only view of the network graph.
1018         pub fn read_only(&'_ self) -> ReadOnlyNetworkGraph<'_> {
1019                 let channels = self.channels.read().unwrap();
1020                 let nodes = self.nodes.read().unwrap();
1021                 ReadOnlyNetworkGraph {
1022                         channels,
1023                         nodes,
1024                 }
1025         }
1026
1027         /// For an already known node (from channel announcements), update its stored properties from a
1028         /// given node announcement.
1029         ///
1030         /// You probably don't want to call this directly, instead relying on a NetGraphMsgHandler's
1031         /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1032         /// routing messages from a source using a protocol other than the lightning P2P protocol.
1033         pub fn update_node_from_announcement<T: secp256k1::Verification>(&self, msg: &msgs::NodeAnnouncement, secp_ctx: &Secp256k1<T>) -> Result<(), LightningError> {
1034                 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.contents.encode()[..])[..]);
1035                 secp_verify_sig!(secp_ctx, &msg_hash, &msg.signature, &msg.contents.node_id, "node_announcement");
1036                 self.update_node_from_announcement_intern(&msg.contents, Some(&msg))
1037         }
1038
1039         /// For an already known node (from channel announcements), update its stored properties from a
1040         /// given node announcement without verifying the associated signatures. Because we aren't
1041         /// given the associated signatures here we cannot relay the node announcement to any of our
1042         /// peers.
1043         pub fn update_node_from_unsigned_announcement(&self, msg: &msgs::UnsignedNodeAnnouncement) -> Result<(), LightningError> {
1044                 self.update_node_from_announcement_intern(msg, None)
1045         }
1046
1047         fn update_node_from_announcement_intern(&self, msg: &msgs::UnsignedNodeAnnouncement, full_msg: Option<&msgs::NodeAnnouncement>) -> Result<(), LightningError> {
1048                 match self.nodes.write().unwrap().get_mut(&NodeId::from_pubkey(&msg.node_id)) {
1049                         None => Err(LightningError{err: "No existing channels for node_announcement".to_owned(), action: ErrorAction::IgnoreError}),
1050                         Some(node) => {
1051                                 if let Some(node_info) = node.announcement_info.as_ref() {
1052                                         // The timestamp field is somewhat of a misnomer - the BOLTs use it to order
1053                                         // updates to ensure you always have the latest one, only vaguely suggesting
1054                                         // that it be at least the current time.
1055                                         if node_info.last_update  > msg.timestamp {
1056                                                 return Err(LightningError{err: "Update older than last processed update".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1057                                         } else if node_info.last_update  == msg.timestamp {
1058                                                 return Err(LightningError{err: "Update had the same timestamp as last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1059                                         }
1060                                 }
1061
1062                                 let should_relay =
1063                                         msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
1064                                         msg.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
1065                                         msg.excess_data.len() + msg.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY;
1066                                 node.announcement_info = Some(NodeAnnouncementInfo {
1067                                         features: msg.features.clone(),
1068                                         last_update: msg.timestamp,
1069                                         rgb: msg.rgb,
1070                                         alias: msg.alias,
1071                                         addresses: msg.addresses.clone(),
1072                                         announcement_message: if should_relay { full_msg.cloned() } else { None },
1073                                 });
1074
1075                                 Ok(())
1076                         }
1077                 }
1078         }
1079
1080         /// Store or update channel info from a channel announcement.
1081         ///
1082         /// You probably don't want to call this directly, instead relying on a NetGraphMsgHandler's
1083         /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1084         /// routing messages from a source using a protocol other than the lightning P2P protocol.
1085         ///
1086         /// If a `chain::Access` object is provided via `chain_access`, it will be called to verify
1087         /// the corresponding UTXO exists on chain and is correctly-formatted.
1088         pub fn update_channel_from_announcement<T: secp256k1::Verification, C: Deref>(
1089                 &self, msg: &msgs::ChannelAnnouncement, chain_access: &Option<C>, secp_ctx: &Secp256k1<T>
1090         ) -> Result<(), LightningError>
1091         where
1092                 C::Target: chain::Access,
1093         {
1094                 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.contents.encode()[..])[..]);
1095                 secp_verify_sig!(secp_ctx, &msg_hash, &msg.node_signature_1, &msg.contents.node_id_1, "channel_announcement");
1096                 secp_verify_sig!(secp_ctx, &msg_hash, &msg.node_signature_2, &msg.contents.node_id_2, "channel_announcement");
1097                 secp_verify_sig!(secp_ctx, &msg_hash, &msg.bitcoin_signature_1, &msg.contents.bitcoin_key_1, "channel_announcement");
1098                 secp_verify_sig!(secp_ctx, &msg_hash, &msg.bitcoin_signature_2, &msg.contents.bitcoin_key_2, "channel_announcement");
1099                 self.update_channel_from_unsigned_announcement_intern(&msg.contents, Some(msg), chain_access)
1100         }
1101
1102         /// Store or update channel info from a channel announcement without verifying the associated
1103         /// signatures. Because we aren't given the associated signatures here we cannot relay the
1104         /// channel announcement to any of our peers.
1105         ///
1106         /// If a `chain::Access` object is provided via `chain_access`, it will be called to verify
1107         /// the corresponding UTXO exists on chain and is correctly-formatted.
1108         pub fn update_channel_from_unsigned_announcement<C: Deref>(
1109                 &self, msg: &msgs::UnsignedChannelAnnouncement, chain_access: &Option<C>
1110         ) -> Result<(), LightningError>
1111         where
1112                 C::Target: chain::Access,
1113         {
1114                 self.update_channel_from_unsigned_announcement_intern(msg, None, chain_access)
1115         }
1116
1117         fn update_channel_from_unsigned_announcement_intern<C: Deref>(
1118                 &self, msg: &msgs::UnsignedChannelAnnouncement, full_msg: Option<&msgs::ChannelAnnouncement>, chain_access: &Option<C>
1119         ) -> Result<(), LightningError>
1120         where
1121                 C::Target: chain::Access,
1122         {
1123                 if msg.node_id_1 == msg.node_id_2 || msg.bitcoin_key_1 == msg.bitcoin_key_2 {
1124                         return Err(LightningError{err: "Channel announcement node had a channel with itself".to_owned(), action: ErrorAction::IgnoreError});
1125                 }
1126
1127                 let utxo_value = match &chain_access {
1128                         &None => {
1129                                 // Tentatively accept, potentially exposing us to DoS attacks
1130                                 None
1131                         },
1132                         &Some(ref chain_access) => {
1133                                 match chain_access.get_utxo(&msg.chain_hash, msg.short_channel_id) {
1134                                         Ok(TxOut { value, script_pubkey }) => {
1135                                                 let expected_script = Builder::new().push_opcode(opcodes::all::OP_PUSHNUM_2)
1136                                                                                     .push_slice(&msg.bitcoin_key_1.serialize())
1137                                                                                     .push_slice(&msg.bitcoin_key_2.serialize())
1138                                                                                     .push_opcode(opcodes::all::OP_PUSHNUM_2)
1139                                                                                     .push_opcode(opcodes::all::OP_CHECKMULTISIG).into_script().to_v0_p2wsh();
1140                                                 if script_pubkey != expected_script {
1141                                                         return Err(LightningError{err: format!("Channel announcement key ({}) didn't match on-chain script ({})", script_pubkey.to_hex(), expected_script.to_hex()), action: ErrorAction::IgnoreError});
1142                                                 }
1143                                                 //TODO: Check if value is worth storing, use it to inform routing, and compare it
1144                                                 //to the new HTLC max field in channel_update
1145                                                 Some(value)
1146                                         },
1147                                         Err(chain::AccessError::UnknownChain) => {
1148                                                 return Err(LightningError{err: format!("Channel announced on an unknown chain ({})", msg.chain_hash.encode().to_hex()), action: ErrorAction::IgnoreError});
1149                                         },
1150                                         Err(chain::AccessError::UnknownTx) => {
1151                                                 return Err(LightningError{err: "Channel announced without corresponding UTXO entry".to_owned(), action: ErrorAction::IgnoreError});
1152                                         },
1153                                 }
1154                         },
1155                 };
1156
1157                 #[allow(unused_mut, unused_assignments)]
1158                 let mut announcement_received_time = 0;
1159                 #[cfg(feature = "std")]
1160                 {
1161                         announcement_received_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1162                 }
1163
1164                 let chan_info = ChannelInfo {
1165                                 features: msg.features.clone(),
1166                                 node_one: NodeId::from_pubkey(&msg.node_id_1),
1167                                 one_to_two: None,
1168                                 node_two: NodeId::from_pubkey(&msg.node_id_2),
1169                                 two_to_one: None,
1170                                 capacity_sats: utxo_value,
1171                                 announcement_message: if msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY
1172                                         { full_msg.cloned() } else { None },
1173                                 announcement_received_time,
1174                         };
1175
1176                 let mut channels = self.channels.write().unwrap();
1177                 let mut nodes = self.nodes.write().unwrap();
1178                 match channels.entry(msg.short_channel_id) {
1179                         BtreeEntry::Occupied(mut entry) => {
1180                                 //TODO: because asking the blockchain if short_channel_id is valid is only optional
1181                                 //in the blockchain API, we need to handle it smartly here, though it's unclear
1182                                 //exactly how...
1183                                 if utxo_value.is_some() {
1184                                         // Either our UTXO provider is busted, there was a reorg, or the UTXO provider
1185                                         // only sometimes returns results. In any case remove the previous entry. Note
1186                                         // that the spec expects us to "blacklist" the node_ids involved, but we can't
1187                                         // do that because
1188                                         // a) we don't *require* a UTXO provider that always returns results.
1189                                         // b) we don't track UTXOs of channels we know about and remove them if they
1190                                         //    get reorg'd out.
1191                                         // c) it's unclear how to do so without exposing ourselves to massive DoS risk.
1192                                         Self::remove_channel_in_nodes(&mut nodes, &entry.get(), msg.short_channel_id);
1193                                         *entry.get_mut() = chan_info;
1194                                 } else {
1195                                         return Err(LightningError{err: "Already have knowledge of channel".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1196                                 }
1197                         },
1198                         BtreeEntry::Vacant(entry) => {
1199                                 entry.insert(chan_info);
1200                         }
1201                 };
1202
1203                 macro_rules! add_channel_to_node {
1204                         ( $node_id: expr ) => {
1205                                 match nodes.entry($node_id) {
1206                                         BtreeEntry::Occupied(node_entry) => {
1207                                                 node_entry.into_mut().channels.push(msg.short_channel_id);
1208                                         },
1209                                         BtreeEntry::Vacant(node_entry) => {
1210                                                 node_entry.insert(NodeInfo {
1211                                                         channels: vec!(msg.short_channel_id),
1212                                                         lowest_inbound_channel_fees: None,
1213                                                         announcement_info: None,
1214                                                 });
1215                                         }
1216                                 }
1217                         };
1218                 }
1219
1220                 add_channel_to_node!(NodeId::from_pubkey(&msg.node_id_1));
1221                 add_channel_to_node!(NodeId::from_pubkey(&msg.node_id_2));
1222
1223                 Ok(())
1224         }
1225
1226         /// Close a channel if a corresponding HTLC fail was sent.
1227         /// If permanent, removes a channel from the local storage.
1228         /// May cause the removal of nodes too, if this was their last channel.
1229         /// If not permanent, makes channels unavailable for routing.
1230         pub fn close_channel_from_update(&self, short_channel_id: u64, is_permanent: bool) {
1231                 let mut channels = self.channels.write().unwrap();
1232                 if is_permanent {
1233                         if let Some(chan) = channels.remove(&short_channel_id) {
1234                                 let mut nodes = self.nodes.write().unwrap();
1235                                 Self::remove_channel_in_nodes(&mut nodes, &chan, short_channel_id);
1236                         }
1237                 } else {
1238                         if let Some(chan) = channels.get_mut(&short_channel_id) {
1239                                 if let Some(one_to_two) = chan.one_to_two.as_mut() {
1240                                         one_to_two.enabled = false;
1241                                 }
1242                                 if let Some(two_to_one) = chan.two_to_one.as_mut() {
1243                                         two_to_one.enabled = false;
1244                                 }
1245                         }
1246                 }
1247         }
1248
1249         /// Marks a node in the graph as failed.
1250         pub fn fail_node(&self, _node_id: &PublicKey, is_permanent: bool) {
1251                 if is_permanent {
1252                         // TODO: Wholly remove the node
1253                 } else {
1254                         // TODO: downgrade the node
1255                 }
1256         }
1257
1258         #[cfg(feature = "std")]
1259         /// Removes information about channels that we haven't heard any updates about in some time.
1260         /// This can be used regularly to prune the network graph of channels that likely no longer
1261         /// exist.
1262         ///
1263         /// While there is no formal requirement that nodes regularly re-broadcast their channel
1264         /// updates every two weeks, the non-normative section of BOLT 7 currently suggests that
1265         /// pruning occur for updates which are at least two weeks old, which we implement here.
1266         ///
1267         /// Note that for users of the `lightning-background-processor` crate this method may be
1268         /// automatically called regularly for you.
1269         ///
1270         /// This method is only available with the `std` feature. See
1271         /// [`NetworkGraph::remove_stale_channels_with_time`] for `no-std` use.
1272         pub fn remove_stale_channels(&self) {
1273                 let time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1274                 self.remove_stale_channels_with_time(time);
1275         }
1276
1277         /// Removes information about channels that we haven't heard any updates about in some time.
1278         /// This can be used regularly to prune the network graph of channels that likely no longer
1279         /// exist.
1280         ///
1281         /// While there is no formal requirement that nodes regularly re-broadcast their channel
1282         /// updates every two weeks, the non-normative section of BOLT 7 currently suggests that
1283         /// pruning occur for updates which are at least two weeks old, which we implement here.
1284         ///
1285         /// This function takes the current unix time as an argument. For users with the `std` feature
1286         /// enabled, [`NetworkGraph::remove_stale_channels`] may be preferable.
1287         pub fn remove_stale_channels_with_time(&self, current_time_unix: u64) {
1288                 let mut channels = self.channels.write().unwrap();
1289                 // Time out if we haven't received an update in at least 14 days.
1290                 if current_time_unix > u32::max_value() as u64 { return; } // Remove by 2106
1291                 if current_time_unix < STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS { return; }
1292                 let min_time_unix: u32 = (current_time_unix - STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS) as u32;
1293                 // Sadly BTreeMap::retain was only stabilized in 1.53 so we can't switch to it for some
1294                 // time.
1295                 let mut scids_to_remove = Vec::new();
1296                 for (scid, info) in channels.iter_mut() {
1297                         if info.one_to_two.is_some() && info.one_to_two.as_ref().unwrap().last_update < min_time_unix {
1298                                 info.one_to_two = None;
1299                         }
1300                         if info.two_to_one.is_some() && info.two_to_one.as_ref().unwrap().last_update < min_time_unix {
1301                                 info.two_to_one = None;
1302                         }
1303                         if info.one_to_two.is_none() && info.two_to_one.is_none() {
1304                                 // We check the announcement_received_time here to ensure we don't drop
1305                                 // announcements that we just received and are just waiting for our peer to send a
1306                                 // channel_update for.
1307                                 if info.announcement_received_time < min_time_unix as u64 {
1308                                         scids_to_remove.push(*scid);
1309                                 }
1310                         }
1311                 }
1312                 if !scids_to_remove.is_empty() {
1313                         let mut nodes = self.nodes.write().unwrap();
1314                         for scid in scids_to_remove {
1315                                 let info = channels.remove(&scid).expect("We just accessed this scid, it should be present");
1316                                 Self::remove_channel_in_nodes(&mut nodes, &info, scid);
1317                         }
1318                 }
1319         }
1320
1321         /// For an already known (from announcement) channel, update info about one of the directions
1322         /// of the channel.
1323         ///
1324         /// You probably don't want to call this directly, instead relying on a NetGraphMsgHandler's
1325         /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1326         /// routing messages from a source using a protocol other than the lightning P2P protocol.
1327         ///
1328         /// If built with `no-std`, any updates with a timestamp more than two weeks in the past or
1329         /// materially in the future will be rejected.
1330         pub fn update_channel<T: secp256k1::Verification>(&self, msg: &msgs::ChannelUpdate, secp_ctx: &Secp256k1<T>) -> Result<(), LightningError> {
1331                 self.update_channel_intern(&msg.contents, Some(&msg), Some((&msg.signature, secp_ctx)))
1332         }
1333
1334         /// For an already known (from announcement) channel, update info about one of the directions
1335         /// of the channel without verifying the associated signatures. Because we aren't given the
1336         /// associated signatures here we cannot relay the channel update to any of our peers.
1337         ///
1338         /// If built with `no-std`, any updates with a timestamp more than two weeks in the past or
1339         /// materially in the future will be rejected.
1340         pub fn update_channel_unsigned(&self, msg: &msgs::UnsignedChannelUpdate) -> Result<(), LightningError> {
1341                 self.update_channel_intern(msg, None, None::<(&secp256k1::Signature, &Secp256k1<secp256k1::VerifyOnly>)>)
1342         }
1343
1344         fn update_channel_intern<T: secp256k1::Verification>(&self, msg: &msgs::UnsignedChannelUpdate, full_msg: Option<&msgs::ChannelUpdate>, sig_info: Option<(&secp256k1::Signature, &Secp256k1<T>)>) -> Result<(), LightningError> {
1345                 let dest_node_id;
1346                 let chan_enabled = msg.flags & (1 << 1) != (1 << 1);
1347                 let chan_was_enabled;
1348
1349                 #[cfg(all(feature = "std", not(test), not(feature = "_test_utils")))]
1350                 {
1351                         // Note that many tests rely on being able to set arbitrarily old timestamps, thus we
1352                         // disable this check during tests!
1353                         let time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1354                         if (msg.timestamp as u64) < time - STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS {
1355                                 return Err(LightningError{err: "channel_update is older than two weeks old".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1356                         }
1357                         if msg.timestamp as u64 > time + 60 * 60 * 24 {
1358                                 return Err(LightningError{err: "channel_update has a timestamp more than a day in the future".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1359                         }
1360                 }
1361
1362                 let mut channels = self.channels.write().unwrap();
1363                 match channels.get_mut(&msg.short_channel_id) {
1364                         None => return Err(LightningError{err: "Couldn't find channel for update".to_owned(), action: ErrorAction::IgnoreError}),
1365                         Some(channel) => {
1366                                 if let OptionalField::Present(htlc_maximum_msat) = msg.htlc_maximum_msat {
1367                                         if htlc_maximum_msat > MAX_VALUE_MSAT {
1368                                                 return Err(LightningError{err: "htlc_maximum_msat is larger than maximum possible msats".to_owned(), action: ErrorAction::IgnoreError});
1369                                         }
1370
1371                                         if let Some(capacity_sats) = channel.capacity_sats {
1372                                                 // It's possible channel capacity is available now, although it wasn't available at announcement (so the field is None).
1373                                                 // Don't query UTXO set here to reduce DoS risks.
1374                                                 if capacity_sats > MAX_VALUE_MSAT / 1000 || htlc_maximum_msat > capacity_sats * 1000 {
1375                                                         return Err(LightningError{err: "htlc_maximum_msat is larger than channel capacity or capacity is bogus".to_owned(), action: ErrorAction::IgnoreError});
1376                                                 }
1377                                         }
1378                                 }
1379                                 macro_rules! maybe_update_channel_info {
1380                                         ( $target: expr, $src_node: expr) => {
1381                                                 if let Some(existing_chan_info) = $target.as_ref() {
1382                                                         // The timestamp field is somewhat of a misnomer - the BOLTs use it to
1383                                                         // order updates to ensure you always have the latest one, only
1384                                                         // suggesting  that it be at least the current time. For
1385                                                         // channel_updates specifically, the BOLTs discuss the possibility of
1386                                                         // pruning based on the timestamp field being more than two weeks old,
1387                                                         // but only in the non-normative section.
1388                                                         if existing_chan_info.last_update > msg.timestamp {
1389                                                                 return Err(LightningError{err: "Update older than last processed update".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1390                                                         } else if existing_chan_info.last_update == msg.timestamp {
1391                                                                 return Err(LightningError{err: "Update had same timestamp as last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1392                                                         }
1393                                                         chan_was_enabled = existing_chan_info.enabled;
1394                                                 } else {
1395                                                         chan_was_enabled = false;
1396                                                 }
1397
1398                                                 let last_update_message = if msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY
1399                                                         { full_msg.cloned() } else { None };
1400
1401                                                 let updated_channel_update_info = ChannelUpdateInfo {
1402                                                         enabled: chan_enabled,
1403                                                         last_update: msg.timestamp,
1404                                                         cltv_expiry_delta: msg.cltv_expiry_delta,
1405                                                         htlc_minimum_msat: msg.htlc_minimum_msat,
1406                                                         htlc_maximum_msat: if let OptionalField::Present(max_value) = msg.htlc_maximum_msat { Some(max_value) } else { None },
1407                                                         fees: RoutingFees {
1408                                                                 base_msat: msg.fee_base_msat,
1409                                                                 proportional_millionths: msg.fee_proportional_millionths,
1410                                                         },
1411                                                         last_update_message
1412                                                 };
1413                                                 $target = Some(updated_channel_update_info);
1414                                         }
1415                                 }
1416
1417                                 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.encode()[..])[..]);
1418                                 if msg.flags & 1 == 1 {
1419                                         dest_node_id = channel.node_one.clone();
1420                                         if let Some((sig, ctx)) = sig_info {
1421                                                 secp_verify_sig!(ctx, &msg_hash, &sig, &PublicKey::from_slice(channel.node_two.as_slice()).map_err(|_| LightningError{
1422                                                         err: "Couldn't parse source node pubkey".to_owned(),
1423                                                         action: ErrorAction::IgnoreAndLog(Level::Debug)
1424                                                 })?, "channel_update");
1425                                         }
1426                                         maybe_update_channel_info!(channel.two_to_one, channel.node_two);
1427                                 } else {
1428                                         dest_node_id = channel.node_two.clone();
1429                                         if let Some((sig, ctx)) = sig_info {
1430                                                 secp_verify_sig!(ctx, &msg_hash, &sig, &PublicKey::from_slice(channel.node_one.as_slice()).map_err(|_| LightningError{
1431                                                         err: "Couldn't parse destination node pubkey".to_owned(),
1432                                                         action: ErrorAction::IgnoreAndLog(Level::Debug)
1433                                                 })?, "channel_update");
1434                                         }
1435                                         maybe_update_channel_info!(channel.one_to_two, channel.node_one);
1436                                 }
1437                         }
1438                 }
1439
1440                 let mut nodes = self.nodes.write().unwrap();
1441                 if chan_enabled {
1442                         let node = nodes.get_mut(&dest_node_id).unwrap();
1443                         let mut base_msat = msg.fee_base_msat;
1444                         let mut proportional_millionths = msg.fee_proportional_millionths;
1445                         if let Some(fees) = node.lowest_inbound_channel_fees {
1446                                 base_msat = cmp::min(base_msat, fees.base_msat);
1447                                 proportional_millionths = cmp::min(proportional_millionths, fees.proportional_millionths);
1448                         }
1449                         node.lowest_inbound_channel_fees = Some(RoutingFees {
1450                                 base_msat,
1451                                 proportional_millionths
1452                         });
1453                 } else if chan_was_enabled {
1454                         let node = nodes.get_mut(&dest_node_id).unwrap();
1455                         let mut lowest_inbound_channel_fees = None;
1456
1457                         for chan_id in node.channels.iter() {
1458                                 let chan = channels.get(chan_id).unwrap();
1459                                 let chan_info_opt;
1460                                 if chan.node_one == dest_node_id {
1461                                         chan_info_opt = chan.two_to_one.as_ref();
1462                                 } else {
1463                                         chan_info_opt = chan.one_to_two.as_ref();
1464                                 }
1465                                 if let Some(chan_info) = chan_info_opt {
1466                                         if chan_info.enabled {
1467                                                 let fees = lowest_inbound_channel_fees.get_or_insert(RoutingFees {
1468                                                         base_msat: u32::max_value(), proportional_millionths: u32::max_value() });
1469                                                 fees.base_msat = cmp::min(fees.base_msat, chan_info.fees.base_msat);
1470                                                 fees.proportional_millionths = cmp::min(fees.proportional_millionths, chan_info.fees.proportional_millionths);
1471                                         }
1472                                 }
1473                         }
1474
1475                         node.lowest_inbound_channel_fees = lowest_inbound_channel_fees;
1476                 }
1477
1478                 Ok(())
1479         }
1480
1481         fn remove_channel_in_nodes(nodes: &mut BTreeMap<NodeId, NodeInfo>, chan: &ChannelInfo, short_channel_id: u64) {
1482                 macro_rules! remove_from_node {
1483                         ($node_id: expr) => {
1484                                 if let BtreeEntry::Occupied(mut entry) = nodes.entry($node_id) {
1485                                         entry.get_mut().channels.retain(|chan_id| {
1486                                                 short_channel_id != *chan_id
1487                                         });
1488                                         if entry.get().channels.is_empty() {
1489                                                 entry.remove_entry();
1490                                         }
1491                                 } else {
1492                                         panic!("Had channel that pointed to unknown node (ie inconsistent network map)!");
1493                                 }
1494                         }
1495                 }
1496
1497                 remove_from_node!(chan.node_one);
1498                 remove_from_node!(chan.node_two);
1499         }
1500 }
1501
1502 impl ReadOnlyNetworkGraph<'_> {
1503         /// Returns all known valid channels' short ids along with announced channel info.
1504         ///
1505         /// (C-not exported) because we have no mapping for `BTreeMap`s
1506         pub fn channels(&self) -> &BTreeMap<u64, ChannelInfo> {
1507                 &*self.channels
1508         }
1509
1510         /// Returns all known nodes' public keys along with announced node info.
1511         ///
1512         /// (C-not exported) because we have no mapping for `BTreeMap`s
1513         pub fn nodes(&self) -> &BTreeMap<NodeId, NodeInfo> {
1514                 &*self.nodes
1515         }
1516
1517         /// Get network addresses by node id.
1518         /// Returns None if the requested node is completely unknown,
1519         /// or if node announcement for the node was never received.
1520         pub fn get_addresses(&self, pubkey: &PublicKey) -> Option<Vec<NetAddress>> {
1521                 if let Some(node) = self.nodes.get(&NodeId::from_pubkey(&pubkey)) {
1522                         if let Some(node_info) = node.announcement_info.as_ref() {
1523                                 return Some(node_info.addresses.clone())
1524                         }
1525                 }
1526                 None
1527         }
1528 }
1529
1530 #[cfg(test)]
1531 mod tests {
1532         use chain;
1533         use ln::PaymentHash;
1534         use ln::features::{ChannelFeatures, InitFeatures, NodeFeatures};
1535         use routing::network_graph::{NetGraphMsgHandler, NetworkGraph, NetworkUpdate, MAX_EXCESS_BYTES_FOR_RELAY};
1536         use ln::msgs::{Init, OptionalField, RoutingMessageHandler, UnsignedNodeAnnouncement, NodeAnnouncement,
1537                 UnsignedChannelAnnouncement, ChannelAnnouncement, UnsignedChannelUpdate, ChannelUpdate,
1538                 ReplyChannelRange, ReplyShortChannelIdsEnd, QueryChannelRange, QueryShortChannelIds, MAX_VALUE_MSAT};
1539         use util::test_utils;
1540         use util::logger::Logger;
1541         use util::ser::{Readable, Writeable};
1542         use util::events::{Event, EventHandler, MessageSendEvent, MessageSendEventsProvider};
1543         use util::scid_utils::scid_from_parts;
1544
1545         use super::STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS;
1546
1547         use bitcoin::hashes::sha256d::Hash as Sha256dHash;
1548         use bitcoin::hashes::Hash;
1549         use bitcoin::network::constants::Network;
1550         use bitcoin::blockdata::constants::genesis_block;
1551         use bitcoin::blockdata::script::{Builder, Script};
1552         use bitcoin::blockdata::transaction::TxOut;
1553         use bitcoin::blockdata::opcodes;
1554
1555         use hex;
1556
1557         use bitcoin::secp256k1::key::{PublicKey, SecretKey};
1558         use bitcoin::secp256k1::{All, Secp256k1};
1559
1560         use io;
1561         use prelude::*;
1562         use sync::Arc;
1563
1564         fn create_network_graph() -> NetworkGraph {
1565                 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
1566                 NetworkGraph::new(genesis_hash)
1567         }
1568
1569         fn create_net_graph_msg_handler(network_graph: &NetworkGraph) -> (
1570                 Secp256k1<All>, NetGraphMsgHandler<&NetworkGraph, Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>
1571         ) {
1572                 let secp_ctx = Secp256k1::new();
1573                 let logger = Arc::new(test_utils::TestLogger::new());
1574                 let net_graph_msg_handler = NetGraphMsgHandler::new(network_graph, None, Arc::clone(&logger));
1575                 (secp_ctx, net_graph_msg_handler)
1576         }
1577
1578         #[test]
1579         fn request_full_sync_finite_times() {
1580                 let network_graph = create_network_graph();
1581                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
1582                 let node_id = PublicKey::from_secret_key(&secp_ctx, &SecretKey::from_slice(&hex::decode("0202020202020202020202020202020202020202020202020202020202020202").unwrap()[..]).unwrap());
1583
1584                 assert!(net_graph_msg_handler.should_request_full_sync(&node_id));
1585                 assert!(net_graph_msg_handler.should_request_full_sync(&node_id));
1586                 assert!(net_graph_msg_handler.should_request_full_sync(&node_id));
1587                 assert!(net_graph_msg_handler.should_request_full_sync(&node_id));
1588                 assert!(net_graph_msg_handler.should_request_full_sync(&node_id));
1589                 assert!(!net_graph_msg_handler.should_request_full_sync(&node_id));
1590         }
1591
1592         fn get_signed_node_announcement<F: Fn(&mut UnsignedNodeAnnouncement)>(f: F, node_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> NodeAnnouncement {
1593                 let node_id = PublicKey::from_secret_key(&secp_ctx, node_key);
1594                 let mut unsigned_announcement = UnsignedNodeAnnouncement {
1595                         features: NodeFeatures::known(),
1596                         timestamp: 100,
1597                         node_id: node_id,
1598                         rgb: [0; 3],
1599                         alias: [0; 32],
1600                         addresses: Vec::new(),
1601                         excess_address_data: Vec::new(),
1602                         excess_data: Vec::new(),
1603                 };
1604                 f(&mut unsigned_announcement);
1605                 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
1606                 NodeAnnouncement {
1607                         signature: secp_ctx.sign(&msghash, node_key),
1608                         contents: unsigned_announcement
1609                 }
1610         }
1611
1612         fn get_signed_channel_announcement<F: Fn(&mut UnsignedChannelAnnouncement)>(f: F, node_1_key: &SecretKey, node_2_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> ChannelAnnouncement {
1613                 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_1_key);
1614                 let node_id_2 = PublicKey::from_secret_key(&secp_ctx, node_2_key);
1615                 let node_1_btckey = &SecretKey::from_slice(&[40; 32]).unwrap();
1616                 let node_2_btckey = &SecretKey::from_slice(&[39; 32]).unwrap();
1617
1618                 let mut unsigned_announcement = UnsignedChannelAnnouncement {
1619                         features: ChannelFeatures::known(),
1620                         chain_hash: genesis_block(Network::Testnet).header.block_hash(),
1621                         short_channel_id: 0,
1622                         node_id_1,
1623                         node_id_2,
1624                         bitcoin_key_1: PublicKey::from_secret_key(&secp_ctx, node_1_btckey),
1625                         bitcoin_key_2: PublicKey::from_secret_key(&secp_ctx, node_2_btckey),
1626                         excess_data: Vec::new(),
1627                 };
1628                 f(&mut unsigned_announcement);
1629                 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
1630                 ChannelAnnouncement {
1631                         node_signature_1: secp_ctx.sign(&msghash, node_1_key),
1632                         node_signature_2: secp_ctx.sign(&msghash, node_2_key),
1633                         bitcoin_signature_1: secp_ctx.sign(&msghash, node_1_btckey),
1634                         bitcoin_signature_2: secp_ctx.sign(&msghash, node_2_btckey),
1635                         contents: unsigned_announcement,
1636                 }
1637         }
1638
1639         fn get_channel_script(secp_ctx: &Secp256k1<secp256k1::All>) -> Script {
1640                 let node_1_btckey = &SecretKey::from_slice(&[40; 32]).unwrap();
1641                 let node_2_btckey = &SecretKey::from_slice(&[39; 32]).unwrap();
1642                 Builder::new().push_opcode(opcodes::all::OP_PUSHNUM_2)
1643                               .push_slice(&PublicKey::from_secret_key(&secp_ctx, node_1_btckey).serialize())
1644                               .push_slice(&PublicKey::from_secret_key(&secp_ctx, node_2_btckey).serialize())
1645                               .push_opcode(opcodes::all::OP_PUSHNUM_2)
1646                               .push_opcode(opcodes::all::OP_CHECKMULTISIG).into_script()
1647                               .to_v0_p2wsh()
1648         }
1649
1650         fn get_signed_channel_update<F: Fn(&mut UnsignedChannelUpdate)>(f: F, node_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> ChannelUpdate {
1651                 let mut unsigned_channel_update = UnsignedChannelUpdate {
1652                         chain_hash: genesis_block(Network::Testnet).header.block_hash(),
1653                         short_channel_id: 0,
1654                         timestamp: 100,
1655                         flags: 0,
1656                         cltv_expiry_delta: 144,
1657                         htlc_minimum_msat: 1_000_000,
1658                         htlc_maximum_msat: OptionalField::Absent,
1659                         fee_base_msat: 10_000,
1660                         fee_proportional_millionths: 20,
1661                         excess_data: Vec::new()
1662                 };
1663                 f(&mut unsigned_channel_update);
1664                 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_channel_update.encode()[..])[..]);
1665                 ChannelUpdate {
1666                         signature: secp_ctx.sign(&msghash, node_key),
1667                         contents: unsigned_channel_update
1668                 }
1669         }
1670
1671         #[test]
1672         fn handling_node_announcements() {
1673                 let network_graph = create_network_graph();
1674                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
1675
1676                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
1677                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
1678                 let zero_hash = Sha256dHash::hash(&[0; 32]);
1679
1680                 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
1681                 match net_graph_msg_handler.handle_node_announcement(&valid_announcement) {
1682                         Ok(_) => panic!(),
1683                         Err(e) => assert_eq!("No existing channels for node_announcement", e.err)
1684                 };
1685
1686                 {
1687                         // Announce a channel to add a corresponding node.
1688                         let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
1689                         match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1690                                 Ok(res) => assert!(res),
1691                                 _ => panic!()
1692                         };
1693                 }
1694
1695                 match net_graph_msg_handler.handle_node_announcement(&valid_announcement) {
1696                         Ok(res) => assert!(res),
1697                         Err(_) => panic!()
1698                 };
1699
1700                 let fake_msghash = hash_to_message!(&zero_hash);
1701                 match net_graph_msg_handler.handle_node_announcement(
1702                         &NodeAnnouncement {
1703                                 signature: secp_ctx.sign(&fake_msghash, node_1_privkey),
1704                                 contents: valid_announcement.contents.clone()
1705                 }) {
1706                         Ok(_) => panic!(),
1707                         Err(e) => assert_eq!(e.err, "Invalid signature on node_announcement message")
1708                 };
1709
1710                 let announcement_with_data = get_signed_node_announcement(|unsigned_announcement| {
1711                         unsigned_announcement.timestamp += 1000;
1712                         unsigned_announcement.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
1713                 }, node_1_privkey, &secp_ctx);
1714                 // Return false because contains excess data.
1715                 match net_graph_msg_handler.handle_node_announcement(&announcement_with_data) {
1716                         Ok(res) => assert!(!res),
1717                         Err(_) => panic!()
1718                 };
1719
1720                 // Even though previous announcement was not relayed further, we still accepted it,
1721                 // so we now won't accept announcements before the previous one.
1722                 let outdated_announcement = get_signed_node_announcement(|unsigned_announcement| {
1723                         unsigned_announcement.timestamp += 1000 - 10;
1724                 }, node_1_privkey, &secp_ctx);
1725                 match net_graph_msg_handler.handle_node_announcement(&outdated_announcement) {
1726                         Ok(_) => panic!(),
1727                         Err(e) => assert_eq!(e.err, "Update older than last processed update")
1728                 };
1729         }
1730
1731         #[test]
1732         fn handling_channel_announcements() {
1733                 let secp_ctx = Secp256k1::new();
1734                 let logger: Arc<Logger> = Arc::new(test_utils::TestLogger::new());
1735
1736                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
1737                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
1738
1739                 let good_script = get_channel_script(&secp_ctx);
1740                 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
1741
1742                 // Test if the UTXO lookups were not supported
1743                 let network_graph = NetworkGraph::new(genesis_block(Network::Testnet).header.block_hash());
1744                 let mut net_graph_msg_handler = NetGraphMsgHandler::new(&network_graph, None, Arc::clone(&logger));
1745                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1746                         Ok(res) => assert!(res),
1747                         _ => panic!()
1748                 };
1749
1750                 {
1751                         match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
1752                                 None => panic!(),
1753                                 Some(_) => ()
1754                         };
1755                 }
1756
1757                 // If we receive announcement for the same channel (with UTXO lookups disabled),
1758                 // drop new one on the floor, since we can't see any changes.
1759                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1760                         Ok(_) => panic!(),
1761                         Err(e) => assert_eq!(e.err, "Already have knowledge of channel")
1762                 };
1763
1764                 // Test if an associated transaction were not on-chain (or not confirmed).
1765                 let chain_source = Arc::new(test_utils::TestChainSource::new(Network::Testnet));
1766                 *chain_source.utxo_ret.lock().unwrap() = Err(chain::AccessError::UnknownTx);
1767                 let network_graph = NetworkGraph::new(genesis_block(Network::Testnet).header.block_hash());
1768                 net_graph_msg_handler = NetGraphMsgHandler::new(&network_graph, Some(chain_source.clone()), Arc::clone(&logger));
1769
1770                 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1771                         unsigned_announcement.short_channel_id += 1;
1772                 }, node_1_privkey, node_2_privkey, &secp_ctx);
1773                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1774                         Ok(_) => panic!(),
1775                         Err(e) => assert_eq!(e.err, "Channel announced without corresponding UTXO entry")
1776                 };
1777
1778                 // Now test if the transaction is found in the UTXO set and the script is correct.
1779                 *chain_source.utxo_ret.lock().unwrap() = Ok(TxOut { value: 0, script_pubkey: good_script.clone() });
1780                 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1781                         unsigned_announcement.short_channel_id += 2;
1782                 }, node_1_privkey, node_2_privkey, &secp_ctx);
1783                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1784                         Ok(res) => assert!(res),
1785                         _ => panic!()
1786                 };
1787
1788                 {
1789                         match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
1790                                 None => panic!(),
1791                                 Some(_) => ()
1792                         };
1793                 }
1794
1795                 // If we receive announcement for the same channel (but TX is not confirmed),
1796                 // drop new one on the floor, since we can't see any changes.
1797                 *chain_source.utxo_ret.lock().unwrap() = Err(chain::AccessError::UnknownTx);
1798                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1799                         Ok(_) => panic!(),
1800                         Err(e) => assert_eq!(e.err, "Channel announced without corresponding UTXO entry")
1801                 };
1802
1803                 // But if it is confirmed, replace the channel
1804                 *chain_source.utxo_ret.lock().unwrap() = Ok(TxOut { value: 0, script_pubkey: good_script });
1805                 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1806                         unsigned_announcement.features = ChannelFeatures::empty();
1807                         unsigned_announcement.short_channel_id += 2;
1808                 }, node_1_privkey, node_2_privkey, &secp_ctx);
1809                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1810                         Ok(res) => assert!(res),
1811                         _ => panic!()
1812                 };
1813                 {
1814                         match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
1815                                 Some(channel_entry) => {
1816                                         assert_eq!(channel_entry.features, ChannelFeatures::empty());
1817                                 },
1818                                 _ => panic!()
1819                         };
1820                 }
1821
1822                 // Don't relay valid channels with excess data
1823                 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1824                         unsigned_announcement.short_channel_id += 3;
1825                         unsigned_announcement.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
1826                 }, node_1_privkey, node_2_privkey, &secp_ctx);
1827                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
1828                         Ok(res) => assert!(!res),
1829                         _ => panic!()
1830                 };
1831
1832                 let mut invalid_sig_announcement = valid_announcement.clone();
1833                 invalid_sig_announcement.contents.excess_data = Vec::new();
1834                 match net_graph_msg_handler.handle_channel_announcement(&invalid_sig_announcement) {
1835                         Ok(_) => panic!(),
1836                         Err(e) => assert_eq!(e.err, "Invalid signature on channel_announcement message")
1837                 };
1838
1839                 let channel_to_itself_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_1_privkey, &secp_ctx);
1840                 match net_graph_msg_handler.handle_channel_announcement(&channel_to_itself_announcement) {
1841                         Ok(_) => panic!(),
1842                         Err(e) => assert_eq!(e.err, "Channel announcement node had a channel with itself")
1843                 };
1844         }
1845
1846         #[test]
1847         fn handling_channel_update() {
1848                 let secp_ctx = Secp256k1::new();
1849                 let logger: Arc<Logger> = Arc::new(test_utils::TestLogger::new());
1850                 let chain_source = Arc::new(test_utils::TestChainSource::new(Network::Testnet));
1851                 let network_graph = NetworkGraph::new(genesis_block(Network::Testnet).header.block_hash());
1852                 let net_graph_msg_handler = NetGraphMsgHandler::new(&network_graph, Some(chain_source.clone()), Arc::clone(&logger));
1853
1854                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
1855                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
1856
1857                 let amount_sats = 1000_000;
1858                 let short_channel_id;
1859
1860                 {
1861                         // Announce a channel we will update
1862                         let good_script = get_channel_script(&secp_ctx);
1863                         *chain_source.utxo_ret.lock().unwrap() = Ok(TxOut { value: amount_sats, script_pubkey: good_script.clone() });
1864
1865                         let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
1866                         short_channel_id = valid_channel_announcement.contents.short_channel_id;
1867                         match net_graph_msg_handler.handle_channel_announcement(&valid_channel_announcement) {
1868                                 Ok(_) => (),
1869                                 Err(_) => panic!()
1870                         };
1871
1872                 }
1873
1874                 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
1875                 match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
1876                         Ok(res) => assert!(res),
1877                         _ => panic!()
1878                 };
1879
1880                 {
1881                         match network_graph.read_only().channels().get(&short_channel_id) {
1882                                 None => panic!(),
1883                                 Some(channel_info) => {
1884                                         assert_eq!(channel_info.one_to_two.as_ref().unwrap().cltv_expiry_delta, 144);
1885                                         assert!(channel_info.two_to_one.is_none());
1886                                 }
1887                         };
1888                 }
1889
1890                 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
1891                         unsigned_channel_update.timestamp += 100;
1892                         unsigned_channel_update.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
1893                 }, node_1_privkey, &secp_ctx);
1894                 // Return false because contains excess data
1895                 match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
1896                         Ok(res) => assert!(!res),
1897                         _ => panic!()
1898                 };
1899
1900                 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
1901                         unsigned_channel_update.timestamp += 110;
1902                         unsigned_channel_update.short_channel_id += 1;
1903                 }, node_1_privkey, &secp_ctx);
1904                 match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
1905                         Ok(_) => panic!(),
1906                         Err(e) => assert_eq!(e.err, "Couldn't find channel for update")
1907                 };
1908
1909                 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
1910                         unsigned_channel_update.htlc_maximum_msat = OptionalField::Present(MAX_VALUE_MSAT + 1);
1911                         unsigned_channel_update.timestamp += 110;
1912                 }, node_1_privkey, &secp_ctx);
1913                 match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
1914                         Ok(_) => panic!(),
1915                         Err(e) => assert_eq!(e.err, "htlc_maximum_msat is larger than maximum possible msats")
1916                 };
1917
1918                 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
1919                         unsigned_channel_update.htlc_maximum_msat = OptionalField::Present(amount_sats * 1000 + 1);
1920                         unsigned_channel_update.timestamp += 110;
1921                 }, node_1_privkey, &secp_ctx);
1922                 match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
1923                         Ok(_) => panic!(),
1924                         Err(e) => assert_eq!(e.err, "htlc_maximum_msat is larger than channel capacity or capacity is bogus")
1925                 };
1926
1927                 // Even though previous update was not relayed further, we still accepted it,
1928                 // so we now won't accept update before the previous one.
1929                 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
1930                         unsigned_channel_update.timestamp += 100;
1931                 }, node_1_privkey, &secp_ctx);
1932                 match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
1933                         Ok(_) => panic!(),
1934                         Err(e) => assert_eq!(e.err, "Update had same timestamp as last processed update")
1935                 };
1936
1937                 let mut invalid_sig_channel_update = get_signed_channel_update(|unsigned_channel_update| {
1938                         unsigned_channel_update.timestamp += 500;
1939                 }, node_1_privkey, &secp_ctx);
1940                 let zero_hash = Sha256dHash::hash(&[0; 32]);
1941                 let fake_msghash = hash_to_message!(&zero_hash);
1942                 invalid_sig_channel_update.signature = secp_ctx.sign(&fake_msghash, node_1_privkey);
1943                 match net_graph_msg_handler.handle_channel_update(&invalid_sig_channel_update) {
1944                         Ok(_) => panic!(),
1945                         Err(e) => assert_eq!(e.err, "Invalid signature on channel_update message")
1946                 };
1947         }
1948
1949         #[test]
1950         fn handling_network_update() {
1951                 let logger = test_utils::TestLogger::new();
1952                 let chain_source = Arc::new(test_utils::TestChainSource::new(Network::Testnet));
1953                 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
1954                 let network_graph = NetworkGraph::new(genesis_hash);
1955                 let net_graph_msg_handler = NetGraphMsgHandler::new(&network_graph, Some(chain_source.clone()), &logger);
1956                 let secp_ctx = Secp256k1::new();
1957
1958                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
1959                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
1960
1961                 {
1962                         // There is no nodes in the table at the beginning.
1963                         assert_eq!(network_graph.read_only().nodes().len(), 0);
1964                 }
1965
1966                 let short_channel_id;
1967                 {
1968                         // Announce a channel we will update
1969                         let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
1970                         short_channel_id = valid_channel_announcement.contents.short_channel_id;
1971                         let chain_source: Option<&test_utils::TestChainSource> = None;
1972                         assert!(network_graph.update_channel_from_announcement(&valid_channel_announcement, &chain_source, &secp_ctx).is_ok());
1973                         assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
1974
1975                         let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
1976                         assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_none());
1977
1978                         net_graph_msg_handler.handle_event(&Event::PaymentPathFailed {
1979                                 payment_id: None,
1980                                 payment_hash: PaymentHash([0; 32]),
1981                                 rejected_by_dest: false,
1982                                 all_paths_failed: true,
1983                                 path: vec![],
1984                                 network_update: Some(NetworkUpdate::ChannelUpdateMessage {
1985                                         msg: valid_channel_update,
1986                                 }),
1987                                 short_channel_id: None,
1988                                 retry: None,
1989                                 error_code: None,
1990                                 error_data: None,
1991                         });
1992
1993                         assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_some());
1994                 }
1995
1996                 // Non-permanent closing just disables a channel
1997                 {
1998                         match network_graph.read_only().channels().get(&short_channel_id) {
1999                                 None => panic!(),
2000                                 Some(channel_info) => {
2001                                         assert!(channel_info.one_to_two.as_ref().unwrap().enabled);
2002                                 }
2003                         };
2004
2005                         net_graph_msg_handler.handle_event(&Event::PaymentPathFailed {
2006                                 payment_id: None,
2007                                 payment_hash: PaymentHash([0; 32]),
2008                                 rejected_by_dest: false,
2009                                 all_paths_failed: true,
2010                                 path: vec![],
2011                                 network_update: Some(NetworkUpdate::ChannelClosed {
2012                                         short_channel_id,
2013                                         is_permanent: false,
2014                                 }),
2015                                 short_channel_id: None,
2016                                 retry: None,
2017                                 error_code: None,
2018                                 error_data: None,
2019                         });
2020
2021                         match network_graph.read_only().channels().get(&short_channel_id) {
2022                                 None => panic!(),
2023                                 Some(channel_info) => {
2024                                         assert!(!channel_info.one_to_two.as_ref().unwrap().enabled);
2025                                 }
2026                         };
2027                 }
2028
2029                 // Permanent closing deletes a channel
2030                 net_graph_msg_handler.handle_event(&Event::PaymentPathFailed {
2031                         payment_id: None,
2032                         payment_hash: PaymentHash([0; 32]),
2033                         rejected_by_dest: false,
2034                         all_paths_failed: true,
2035                         path: vec![],
2036                         network_update: Some(NetworkUpdate::ChannelClosed {
2037                                 short_channel_id,
2038                                 is_permanent: true,
2039                         }),
2040                         short_channel_id: None,
2041                         retry: None,
2042                         error_code: None,
2043                         error_data: None,
2044                 });
2045
2046                 assert_eq!(network_graph.read_only().channels().len(), 0);
2047                 // Nodes are also deleted because there are no associated channels anymore
2048                 assert_eq!(network_graph.read_only().nodes().len(), 0);
2049                 // TODO: Test NetworkUpdate::NodeFailure, which is not implemented yet.
2050         }
2051
2052         #[test]
2053         fn test_channel_timeouts() {
2054                 // Test the removal of channels with `remove_stale_channels`.
2055                 let logger = test_utils::TestLogger::new();
2056                 let chain_source = Arc::new(test_utils::TestChainSource::new(Network::Testnet));
2057                 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
2058                 let network_graph = NetworkGraph::new(genesis_hash);
2059                 let net_graph_msg_handler = NetGraphMsgHandler::new(&network_graph, Some(chain_source.clone()), &logger);
2060                 let secp_ctx = Secp256k1::new();
2061
2062                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2063                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2064
2065                 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2066                 let short_channel_id = valid_channel_announcement.contents.short_channel_id;
2067                 let chain_source: Option<&test_utils::TestChainSource> = None;
2068                 assert!(network_graph.update_channel_from_announcement(&valid_channel_announcement, &chain_source, &secp_ctx).is_ok());
2069                 assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
2070
2071                 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
2072                 assert!(net_graph_msg_handler.handle_channel_update(&valid_channel_update).is_ok());
2073                 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_some());
2074
2075                 network_graph.remove_stale_channels_with_time(100 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2076                 assert_eq!(network_graph.read_only().channels().len(), 1);
2077                 assert_eq!(network_graph.read_only().nodes().len(), 2);
2078
2079                 network_graph.remove_stale_channels_with_time(101 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2080                 #[cfg(feature = "std")]
2081                 {
2082                         // In std mode, a further check is performed before fully removing the channel -
2083                         // the channel_announcement must have been received at least two weeks ago. We
2084                         // fudge that here by indicating the time has jumped two weeks. Note that the
2085                         // directional channel information will have been removed already..
2086                         assert_eq!(network_graph.read_only().channels().len(), 1);
2087                         assert_eq!(network_graph.read_only().nodes().len(), 2);
2088                         assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_none());
2089
2090                         use std::time::{SystemTime, UNIX_EPOCH};
2091                         let announcement_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
2092                         network_graph.remove_stale_channels_with_time(announcement_time + 1 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2093                 }
2094
2095                 assert_eq!(network_graph.read_only().channels().len(), 0);
2096                 assert_eq!(network_graph.read_only().nodes().len(), 0);
2097         }
2098
2099         #[test]
2100         fn getting_next_channel_announcements() {
2101                 let network_graph = create_network_graph();
2102                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2103                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2104                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2105
2106                 // Channels were not announced yet.
2107                 let channels_with_announcements = net_graph_msg_handler.get_next_channel_announcements(0, 1);
2108                 assert_eq!(channels_with_announcements.len(), 0);
2109
2110                 let short_channel_id;
2111                 {
2112                         // Announce a channel we will update
2113                         let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2114                         short_channel_id = valid_channel_announcement.contents.short_channel_id;
2115                         match net_graph_msg_handler.handle_channel_announcement(&valid_channel_announcement) {
2116                                 Ok(_) => (),
2117                                 Err(_) => panic!()
2118                         };
2119                 }
2120
2121                 // Contains initial channel announcement now.
2122                 let channels_with_announcements = net_graph_msg_handler.get_next_channel_announcements(short_channel_id, 1);
2123                 assert_eq!(channels_with_announcements.len(), 1);
2124                 if let Some(channel_announcements) = channels_with_announcements.first() {
2125                         let &(_, ref update_1, ref update_2) = channel_announcements;
2126                         assert_eq!(update_1, &None);
2127                         assert_eq!(update_2, &None);
2128                 } else {
2129                         panic!();
2130                 }
2131
2132
2133                 {
2134                         // Valid channel update
2135                         let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2136                                 unsigned_channel_update.timestamp = 101;
2137                         }, node_1_privkey, &secp_ctx);
2138                         match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
2139                                 Ok(_) => (),
2140                                 Err(_) => panic!()
2141                         };
2142                 }
2143
2144                 // Now contains an initial announcement and an update.
2145                 let channels_with_announcements = net_graph_msg_handler.get_next_channel_announcements(short_channel_id, 1);
2146                 assert_eq!(channels_with_announcements.len(), 1);
2147                 if let Some(channel_announcements) = channels_with_announcements.first() {
2148                         let &(_, ref update_1, ref update_2) = channel_announcements;
2149                         assert_ne!(update_1, &None);
2150                         assert_eq!(update_2, &None);
2151                 } else {
2152                         panic!();
2153                 }
2154
2155                 {
2156                         // Channel update with excess data.
2157                         let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2158                                 unsigned_channel_update.timestamp = 102;
2159                                 unsigned_channel_update.excess_data = [1; MAX_EXCESS_BYTES_FOR_RELAY + 1].to_vec();
2160                         }, node_1_privkey, &secp_ctx);
2161                         match net_graph_msg_handler.handle_channel_update(&valid_channel_update) {
2162                                 Ok(_) => (),
2163                                 Err(_) => panic!()
2164                         };
2165                 }
2166
2167                 // Test that announcements with excess data won't be returned
2168                 let channels_with_announcements = net_graph_msg_handler.get_next_channel_announcements(short_channel_id, 1);
2169                 assert_eq!(channels_with_announcements.len(), 1);
2170                 if let Some(channel_announcements) = channels_with_announcements.first() {
2171                         let &(_, ref update_1, ref update_2) = channel_announcements;
2172                         assert_eq!(update_1, &None);
2173                         assert_eq!(update_2, &None);
2174                 } else {
2175                         panic!();
2176                 }
2177
2178                 // Further starting point have no channels after it
2179                 let channels_with_announcements = net_graph_msg_handler.get_next_channel_announcements(short_channel_id + 1000, 1);
2180                 assert_eq!(channels_with_announcements.len(), 0);
2181         }
2182
2183         #[test]
2184         fn getting_next_node_announcements() {
2185                 let network_graph = create_network_graph();
2186                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2187                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2188                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2189                 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_1_privkey);
2190
2191                 // No nodes yet.
2192                 let next_announcements = net_graph_msg_handler.get_next_node_announcements(None, 10);
2193                 assert_eq!(next_announcements.len(), 0);
2194
2195                 {
2196                         // Announce a channel to add 2 nodes
2197                         let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2198                         match net_graph_msg_handler.handle_channel_announcement(&valid_channel_announcement) {
2199                                 Ok(_) => (),
2200                                 Err(_) => panic!()
2201                         };
2202                 }
2203
2204
2205                 // Nodes were never announced
2206                 let next_announcements = net_graph_msg_handler.get_next_node_announcements(None, 3);
2207                 assert_eq!(next_announcements.len(), 0);
2208
2209                 {
2210                         let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
2211                         match net_graph_msg_handler.handle_node_announcement(&valid_announcement) {
2212                                 Ok(_) => (),
2213                                 Err(_) => panic!()
2214                         };
2215
2216                         let valid_announcement = get_signed_node_announcement(|_| {}, node_2_privkey, &secp_ctx);
2217                         match net_graph_msg_handler.handle_node_announcement(&valid_announcement) {
2218                                 Ok(_) => (),
2219                                 Err(_) => panic!()
2220                         };
2221                 }
2222
2223                 let next_announcements = net_graph_msg_handler.get_next_node_announcements(None, 3);
2224                 assert_eq!(next_announcements.len(), 2);
2225
2226                 // Skip the first node.
2227                 let next_announcements = net_graph_msg_handler.get_next_node_announcements(Some(&node_id_1), 2);
2228                 assert_eq!(next_announcements.len(), 1);
2229
2230                 {
2231                         // Later announcement which should not be relayed (excess data) prevent us from sharing a node
2232                         let valid_announcement = get_signed_node_announcement(|unsigned_announcement| {
2233                                 unsigned_announcement.timestamp += 10;
2234                                 unsigned_announcement.excess_data = [1; MAX_EXCESS_BYTES_FOR_RELAY + 1].to_vec();
2235                         }, node_2_privkey, &secp_ctx);
2236                         match net_graph_msg_handler.handle_node_announcement(&valid_announcement) {
2237                                 Ok(res) => assert!(!res),
2238                                 Err(_) => panic!()
2239                         };
2240                 }
2241
2242                 let next_announcements = net_graph_msg_handler.get_next_node_announcements(Some(&node_id_1), 2);
2243                 assert_eq!(next_announcements.len(), 0);
2244         }
2245
2246         #[test]
2247         fn network_graph_serialization() {
2248                 let network_graph = create_network_graph();
2249                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2250
2251                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2252                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2253
2254                 // Announce a channel to add a corresponding node.
2255                 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2256                 match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
2257                         Ok(res) => assert!(res),
2258                         _ => panic!()
2259                 };
2260
2261                 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
2262                 match net_graph_msg_handler.handle_node_announcement(&valid_announcement) {
2263                         Ok(_) => (),
2264                         Err(_) => panic!()
2265                 };
2266
2267                 let mut w = test_utils::TestVecWriter(Vec::new());
2268                 assert!(!network_graph.read_only().nodes().is_empty());
2269                 assert!(!network_graph.read_only().channels().is_empty());
2270                 network_graph.write(&mut w).unwrap();
2271                 assert!(<NetworkGraph>::read(&mut io::Cursor::new(&w.0)).unwrap() == network_graph);
2272         }
2273
2274         #[test]
2275         fn calling_sync_routing_table() {
2276                 let network_graph = create_network_graph();
2277                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2278                 let node_privkey_1 = &SecretKey::from_slice(&[42; 32]).unwrap();
2279                 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_privkey_1);
2280
2281                 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2282                 let first_blocknum = 0;
2283                 let number_of_blocks = 0xffff_ffff;
2284
2285                 // It should ignore if gossip_queries feature is not enabled
2286                 {
2287                         let init_msg = Init { features: InitFeatures::known().clear_gossip_queries() };
2288                         net_graph_msg_handler.peer_connected(&node_id_1, &init_msg);
2289                         let events = net_graph_msg_handler.get_and_clear_pending_msg_events();
2290                         assert_eq!(events.len(), 0);
2291                 }
2292
2293                 // It should send a query_channel_message with the correct information
2294                 {
2295                         let init_msg = Init { features: InitFeatures::known() };
2296                         net_graph_msg_handler.peer_connected(&node_id_1, &init_msg);
2297                         let events = net_graph_msg_handler.get_and_clear_pending_msg_events();
2298                         assert_eq!(events.len(), 2);
2299                         match &events[0] {
2300                                 MessageSendEvent::SendGossipTimestampFilter{ node_id, msg } => {
2301                                         assert_eq!(node_id, &node_id_1);
2302                                         assert_eq!(msg.chain_hash, chain_hash);
2303                                         assert_eq!(msg.first_timestamp, 0);
2304                                         assert_eq!(msg.timestamp_range, u32::max_value());
2305                                 },
2306                                 _ => panic!("Expected MessageSendEvent::SendChannelRangeQuery")
2307                         };
2308                         match &events[1] {
2309                                 MessageSendEvent::SendChannelRangeQuery{ node_id, msg } => {
2310                                         assert_eq!(node_id, &node_id_1);
2311                                         assert_eq!(msg.chain_hash, chain_hash);
2312                                         assert_eq!(msg.first_blocknum, first_blocknum);
2313                                         assert_eq!(msg.number_of_blocks, number_of_blocks);
2314                                 },
2315                                 _ => panic!("Expected MessageSendEvent::SendChannelRangeQuery")
2316                         };
2317                 }
2318
2319                 // It should not enqueue a query when should_request_full_sync return false.
2320                 // The initial implementation allows syncing with the first 5 peers after
2321                 // which should_request_full_sync will return false
2322                 {
2323                         let network_graph = create_network_graph();
2324                         let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2325                         let init_msg = Init { features: InitFeatures::known() };
2326                         for n in 1..7 {
2327                                 let node_privkey = &SecretKey::from_slice(&[n; 32]).unwrap();
2328                                 let node_id = PublicKey::from_secret_key(&secp_ctx, node_privkey);
2329                                 net_graph_msg_handler.peer_connected(&node_id, &init_msg);
2330                                 let events = net_graph_msg_handler.get_and_clear_pending_msg_events();
2331                                 if n <= 5 {
2332                                         assert_eq!(events.len(), 2);
2333                                 } else {
2334                                         // Even after the we stop sending the explicit query, we should still send a
2335                                         // gossip_timestamp_filter on each new connection.
2336                                         assert_eq!(events.len(), 1);
2337                                 }
2338
2339                         }
2340                 }
2341         }
2342
2343         #[test]
2344         fn handling_reply_channel_range() {
2345                 let network_graph = create_network_graph();
2346                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2347                 let node_privkey_1 = &SecretKey::from_slice(&[42; 32]).unwrap();
2348                 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_privkey_1);
2349
2350                 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2351
2352                 // Test receipt of a single reply that should enqueue an SCID query
2353                 // matching the SCIDs in the reply
2354                 {
2355                         let result = net_graph_msg_handler.handle_reply_channel_range(&node_id_1, ReplyChannelRange {
2356                                 chain_hash,
2357                                 sync_complete: true,
2358                                 first_blocknum: 0,
2359                                 number_of_blocks: 2000,
2360                                 short_channel_ids: vec![
2361                                         0x0003e0_000000_0000, // 992x0x0
2362                                         0x0003e8_000000_0000, // 1000x0x0
2363                                         0x0003e9_000000_0000, // 1001x0x0
2364                                         0x0003f0_000000_0000, // 1008x0x0
2365                                         0x00044c_000000_0000, // 1100x0x0
2366                                         0x0006e0_000000_0000, // 1760x0x0
2367                                 ],
2368                         });
2369                         assert!(result.is_ok());
2370
2371                         // We expect to emit a query_short_channel_ids message with the received scids
2372                         let events = net_graph_msg_handler.get_and_clear_pending_msg_events();
2373                         assert_eq!(events.len(), 1);
2374                         match &events[0] {
2375                                 MessageSendEvent::SendShortIdsQuery { node_id, msg } => {
2376                                         assert_eq!(node_id, &node_id_1);
2377                                         assert_eq!(msg.chain_hash, chain_hash);
2378                                         assert_eq!(msg.short_channel_ids, vec![
2379                                                 0x0003e0_000000_0000, // 992x0x0
2380                                                 0x0003e8_000000_0000, // 1000x0x0
2381                                                 0x0003e9_000000_0000, // 1001x0x0
2382                                                 0x0003f0_000000_0000, // 1008x0x0
2383                                                 0x00044c_000000_0000, // 1100x0x0
2384                                                 0x0006e0_000000_0000, // 1760x0x0
2385                                         ]);
2386                                 },
2387                                 _ => panic!("expected MessageSendEvent::SendShortIdsQuery"),
2388                         }
2389                 }
2390         }
2391
2392         #[test]
2393         fn handling_reply_short_channel_ids() {
2394                 let network_graph = create_network_graph();
2395                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2396                 let node_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2397                 let node_id = PublicKey::from_secret_key(&secp_ctx, node_privkey);
2398
2399                 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2400
2401                 // Test receipt of a successful reply
2402                 {
2403                         let result = net_graph_msg_handler.handle_reply_short_channel_ids_end(&node_id, ReplyShortChannelIdsEnd {
2404                                 chain_hash,
2405                                 full_information: true,
2406                         });
2407                         assert!(result.is_ok());
2408                 }
2409
2410                 // Test receipt of a reply that indicates the peer does not maintain up-to-date information
2411                 // for the chain_hash requested in the query.
2412                 {
2413                         let result = net_graph_msg_handler.handle_reply_short_channel_ids_end(&node_id, ReplyShortChannelIdsEnd {
2414                                 chain_hash,
2415                                 full_information: false,
2416                         });
2417                         assert!(result.is_err());
2418                         assert_eq!(result.err().unwrap().err, "Received reply_short_channel_ids_end with no information");
2419                 }
2420         }
2421
2422         #[test]
2423         fn handling_query_channel_range() {
2424                 let network_graph = create_network_graph();
2425                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2426
2427                 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2428                 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2429                 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2430                 let node_id_2 = PublicKey::from_secret_key(&secp_ctx, node_2_privkey);
2431
2432                 let mut scids: Vec<u64> = vec![
2433                         scid_from_parts(0xfffffe, 0xffffff, 0xffff).unwrap(), // max
2434                         scid_from_parts(0xffffff, 0xffffff, 0xffff).unwrap(), // never
2435                 ];
2436
2437                 // used for testing multipart reply across blocks
2438                 for block in 100000..=108001 {
2439                         scids.push(scid_from_parts(block, 0, 0).unwrap());
2440                 }
2441
2442                 // used for testing resumption on same block
2443                 scids.push(scid_from_parts(108001, 1, 0).unwrap());
2444
2445                 for scid in scids {
2446                         let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2447                                 unsigned_announcement.short_channel_id = scid;
2448                         }, node_1_privkey, node_2_privkey, &secp_ctx);
2449                         match net_graph_msg_handler.handle_channel_announcement(&valid_announcement) {
2450                                 Ok(_) => (),
2451                                 _ => panic!()
2452                         };
2453                 }
2454
2455                 // Error when number_of_blocks=0
2456                 do_handling_query_channel_range(
2457                         &net_graph_msg_handler,
2458                         &node_id_2,
2459                         QueryChannelRange {
2460                                 chain_hash: chain_hash.clone(),
2461                                 first_blocknum: 0,
2462                                 number_of_blocks: 0,
2463                         },
2464                         false,
2465                         vec![ReplyChannelRange {
2466                                 chain_hash: chain_hash.clone(),
2467                                 first_blocknum: 0,
2468                                 number_of_blocks: 0,
2469                                 sync_complete: true,
2470                                 short_channel_ids: vec![]
2471                         }]
2472                 );
2473
2474                 // Error when wrong chain
2475                 do_handling_query_channel_range(
2476                         &net_graph_msg_handler,
2477                         &node_id_2,
2478                         QueryChannelRange {
2479                                 chain_hash: genesis_block(Network::Bitcoin).header.block_hash(),
2480                                 first_blocknum: 0,
2481                                 number_of_blocks: 0xffff_ffff,
2482                         },
2483                         false,
2484                         vec![ReplyChannelRange {
2485                                 chain_hash: genesis_block(Network::Bitcoin).header.block_hash(),
2486                                 first_blocknum: 0,
2487                                 number_of_blocks: 0xffff_ffff,
2488                                 sync_complete: true,
2489                                 short_channel_ids: vec![],
2490                         }]
2491                 );
2492
2493                 // Error when first_blocknum > 0xffffff
2494                 do_handling_query_channel_range(
2495                         &net_graph_msg_handler,
2496                         &node_id_2,
2497                         QueryChannelRange {
2498                                 chain_hash: chain_hash.clone(),
2499                                 first_blocknum: 0x01000000,
2500                                 number_of_blocks: 0xffff_ffff,
2501                         },
2502                         false,
2503                         vec![ReplyChannelRange {
2504                                 chain_hash: chain_hash.clone(),
2505                                 first_blocknum: 0x01000000,
2506                                 number_of_blocks: 0xffff_ffff,
2507                                 sync_complete: true,
2508                                 short_channel_ids: vec![]
2509                         }]
2510                 );
2511
2512                 // Empty reply when max valid SCID block num
2513                 do_handling_query_channel_range(
2514                         &net_graph_msg_handler,
2515                         &node_id_2,
2516                         QueryChannelRange {
2517                                 chain_hash: chain_hash.clone(),
2518                                 first_blocknum: 0xffffff,
2519                                 number_of_blocks: 1,
2520                         },
2521                         true,
2522                         vec![
2523                                 ReplyChannelRange {
2524                                         chain_hash: chain_hash.clone(),
2525                                         first_blocknum: 0xffffff,
2526                                         number_of_blocks: 1,
2527                                         sync_complete: true,
2528                                         short_channel_ids: vec![]
2529                                 },
2530                         ]
2531                 );
2532
2533                 // No results in valid query range
2534                 do_handling_query_channel_range(
2535                         &net_graph_msg_handler,
2536                         &node_id_2,
2537                         QueryChannelRange {
2538                                 chain_hash: chain_hash.clone(),
2539                                 first_blocknum: 1000,
2540                                 number_of_blocks: 1000,
2541                         },
2542                         true,
2543                         vec![
2544                                 ReplyChannelRange {
2545                                         chain_hash: chain_hash.clone(),
2546                                         first_blocknum: 1000,
2547                                         number_of_blocks: 1000,
2548                                         sync_complete: true,
2549                                         short_channel_ids: vec![],
2550                                 }
2551                         ]
2552                 );
2553
2554                 // Overflow first_blocknum + number_of_blocks
2555                 do_handling_query_channel_range(
2556                         &net_graph_msg_handler,
2557                         &node_id_2,
2558                         QueryChannelRange {
2559                                 chain_hash: chain_hash.clone(),
2560                                 first_blocknum: 0xfe0000,
2561                                 number_of_blocks: 0xffffffff,
2562                         },
2563                         true,
2564                         vec![
2565                                 ReplyChannelRange {
2566                                         chain_hash: chain_hash.clone(),
2567                                         first_blocknum: 0xfe0000,
2568                                         number_of_blocks: 0xffffffff - 0xfe0000,
2569                                         sync_complete: true,
2570                                         short_channel_ids: vec![
2571                                                 0xfffffe_ffffff_ffff, // max
2572                                         ]
2573                                 }
2574                         ]
2575                 );
2576
2577                 // Single block exactly full
2578                 do_handling_query_channel_range(
2579                         &net_graph_msg_handler,
2580                         &node_id_2,
2581                         QueryChannelRange {
2582                                 chain_hash: chain_hash.clone(),
2583                                 first_blocknum: 100000,
2584                                 number_of_blocks: 8000,
2585                         },
2586                         true,
2587                         vec![
2588                                 ReplyChannelRange {
2589                                         chain_hash: chain_hash.clone(),
2590                                         first_blocknum: 100000,
2591                                         number_of_blocks: 8000,
2592                                         sync_complete: true,
2593                                         short_channel_ids: (100000..=107999)
2594                                                 .map(|block| scid_from_parts(block, 0, 0).unwrap())
2595                                                 .collect(),
2596                                 },
2597                         ]
2598                 );
2599
2600                 // Multiple split on new block
2601                 do_handling_query_channel_range(
2602                         &net_graph_msg_handler,
2603                         &node_id_2,
2604                         QueryChannelRange {
2605                                 chain_hash: chain_hash.clone(),
2606                                 first_blocknum: 100000,
2607                                 number_of_blocks: 8001,
2608                         },
2609                         true,
2610                         vec![
2611                                 ReplyChannelRange {
2612                                         chain_hash: chain_hash.clone(),
2613                                         first_blocknum: 100000,
2614                                         number_of_blocks: 7999,
2615                                         sync_complete: false,
2616                                         short_channel_ids: (100000..=107999)
2617                                                 .map(|block| scid_from_parts(block, 0, 0).unwrap())
2618                                                 .collect(),
2619                                 },
2620                                 ReplyChannelRange {
2621                                         chain_hash: chain_hash.clone(),
2622                                         first_blocknum: 107999,
2623                                         number_of_blocks: 2,
2624                                         sync_complete: true,
2625                                         short_channel_ids: vec![
2626                                                 scid_from_parts(108000, 0, 0).unwrap(),
2627                                         ],
2628                                 }
2629                         ]
2630                 );
2631
2632                 // Multiple split on same block
2633                 do_handling_query_channel_range(
2634                         &net_graph_msg_handler,
2635                         &node_id_2,
2636                         QueryChannelRange {
2637                                 chain_hash: chain_hash.clone(),
2638                                 first_blocknum: 100002,
2639                                 number_of_blocks: 8000,
2640                         },
2641                         true,
2642                         vec![
2643                                 ReplyChannelRange {
2644                                         chain_hash: chain_hash.clone(),
2645                                         first_blocknum: 100002,
2646                                         number_of_blocks: 7999,
2647                                         sync_complete: false,
2648                                         short_channel_ids: (100002..=108001)
2649                                                 .map(|block| scid_from_parts(block, 0, 0).unwrap())
2650                                                 .collect(),
2651                                 },
2652                                 ReplyChannelRange {
2653                                         chain_hash: chain_hash.clone(),
2654                                         first_blocknum: 108001,
2655                                         number_of_blocks: 1,
2656                                         sync_complete: true,
2657                                         short_channel_ids: vec![
2658                                                 scid_from_parts(108001, 1, 0).unwrap(),
2659                                         ],
2660                                 }
2661                         ]
2662                 );
2663         }
2664
2665         fn do_handling_query_channel_range(
2666                 net_graph_msg_handler: &NetGraphMsgHandler<&NetworkGraph, Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>,
2667                 test_node_id: &PublicKey,
2668                 msg: QueryChannelRange,
2669                 expected_ok: bool,
2670                 expected_replies: Vec<ReplyChannelRange>
2671         ) {
2672                 let mut max_firstblocknum = msg.first_blocknum.saturating_sub(1);
2673                 let mut c_lightning_0_9_prev_end_blocknum = max_firstblocknum;
2674                 let query_end_blocknum = msg.end_blocknum();
2675                 let result = net_graph_msg_handler.handle_query_channel_range(test_node_id, msg);
2676
2677                 if expected_ok {
2678                         assert!(result.is_ok());
2679                 } else {
2680                         assert!(result.is_err());
2681                 }
2682
2683                 let events = net_graph_msg_handler.get_and_clear_pending_msg_events();
2684                 assert_eq!(events.len(), expected_replies.len());
2685
2686                 for i in 0..events.len() {
2687                         let expected_reply = &expected_replies[i];
2688                         match &events[i] {
2689                                 MessageSendEvent::SendReplyChannelRange { node_id, msg } => {
2690                                         assert_eq!(node_id, test_node_id);
2691                                         assert_eq!(msg.chain_hash, expected_reply.chain_hash);
2692                                         assert_eq!(msg.first_blocknum, expected_reply.first_blocknum);
2693                                         assert_eq!(msg.number_of_blocks, expected_reply.number_of_blocks);
2694                                         assert_eq!(msg.sync_complete, expected_reply.sync_complete);
2695                                         assert_eq!(msg.short_channel_ids, expected_reply.short_channel_ids);
2696
2697                                         // Enforce exactly the sequencing requirements present on c-lightning v0.9.3
2698                                         assert!(msg.first_blocknum == c_lightning_0_9_prev_end_blocknum || msg.first_blocknum == c_lightning_0_9_prev_end_blocknum.saturating_add(1));
2699                                         assert!(msg.first_blocknum >= max_firstblocknum);
2700                                         max_firstblocknum = msg.first_blocknum;
2701                                         c_lightning_0_9_prev_end_blocknum = msg.first_blocknum.saturating_add(msg.number_of_blocks);
2702
2703                                         // Check that the last block count is >= the query's end_blocknum
2704                                         if i == events.len() - 1 {
2705                                                 assert!(msg.first_blocknum.saturating_add(msg.number_of_blocks) >= query_end_blocknum);
2706                                         }
2707                                 },
2708                                 _ => panic!("expected MessageSendEvent::SendReplyChannelRange"),
2709                         }
2710                 }
2711         }
2712
2713         #[test]
2714         fn handling_query_short_channel_ids() {
2715                 let network_graph = create_network_graph();
2716                 let (secp_ctx, net_graph_msg_handler) = create_net_graph_msg_handler(&network_graph);
2717                 let node_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2718                 let node_id = PublicKey::from_secret_key(&secp_ctx, node_privkey);
2719
2720                 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2721
2722                 let result = net_graph_msg_handler.handle_query_short_channel_ids(&node_id, QueryShortChannelIds {
2723                         chain_hash,
2724                         short_channel_ids: vec![0x0003e8_000000_0000],
2725                 });
2726                 assert!(result.is_err());
2727         }
2728 }
2729
2730 #[cfg(all(test, feature = "_bench_unstable"))]
2731 mod benches {
2732         use super::*;
2733
2734         use test::Bencher;
2735         use std::io::Read;
2736
2737         #[bench]
2738         fn read_network_graph(bench: &mut Bencher) {
2739                 let mut d = ::routing::router::test_utils::get_route_file().unwrap();
2740                 let mut v = Vec::new();
2741                 d.read_to_end(&mut v).unwrap();
2742                 bench.iter(|| {
2743                         let _ = NetworkGraph::read(&mut std::io::Cursor::new(&v)).unwrap();
2744                 });
2745         }
2746
2747         #[bench]
2748         fn write_network_graph(bench: &mut Bencher) {
2749                 let mut d = ::routing::router::test_utils::get_route_file().unwrap();
2750                 let net_graph = NetworkGraph::read(&mut d).unwrap();
2751                 bench.iter(|| {
2752                         let _ = net_graph.encode();
2753                 });
2754         }
2755 }