LCOV - code coverage report
Current view: top level - src - net_processing.cpp (source / functions) Hit Total Coverage
Test: fuzz_coverage.info Lines: 37 2844 1.3 %
Date: 2023-11-12 01:39:15 Functions: 4 134 3.0 %
Branches: 16 5857 0.3 %

           Branch data     Line data    Source code
       1                 :            : // Copyright (c) 2009-2010 Satoshi Nakamoto
       2                 :            : // Copyright (c) 2009-2022 The Bitcoin Core developers
       3                 :            : // Distributed under the MIT software license, see the accompanying
       4                 :            : // file COPYING or http://www.opensource.org/licenses/mit-license.php.
       5                 :            : 
       6                 :            : #include <net_processing.h>
       7                 :            : 
       8                 :            : #include <addrman.h>
       9                 :            : #include <banman.h>
      10                 :            : #include <blockencodings.h>
      11                 :            : #include <blockfilter.h>
      12                 :            : #include <chainparams.h>
      13                 :            : #include <consensus/amount.h>
      14                 :            : #include <consensus/validation.h>
      15                 :            : #include <deploymentstatus.h>
      16                 :            : #include <hash.h>
      17         [ +  - ]:          2 : #include <headerssync.h>
      18         [ +  - ]:          2 : #include <index/blockfilterindex.h>
      19                 :            : #include <kernel/mempool_entry.h>
      20                 :            : #include <logging.h>
      21                 :            : #include <kernel/chain.h>
      22                 :            : #include <merkleblock.h>
      23                 :            : #include <netbase.h>
      24                 :            : #include <netmessagemaker.h>
      25                 :            : #include <node/blockstorage.h>
      26                 :            : #include <node/txreconciliation.h>
      27                 :            : #include <policy/fees.h>
      28                 :            : #include <policy/policy.h>
      29                 :            : #include <policy/settings.h>
      30                 :            : #include <primitives/block.h>
      31                 :            : #include <primitives/transaction.h>
      32                 :            : #include <random.h>
      33                 :            : #include <reverse_iterator.h>
      34                 :            : #include <scheduler.h>
      35                 :            : #include <streams.h>
      36                 :            : #include <sync.h>
      37                 :            : #include <timedata.h>
      38                 :            : #include <tinyformat.h>
      39                 :            : #include <txmempool.h>
      40                 :            : #include <txorphanage.h>
      41                 :            : #include <txrequest.h>
      42                 :            : #include <util/check.h> // For NDEBUG compile time check
      43                 :            : #include <util/strencodings.h>
      44                 :            : #include <util/trace.h>
      45                 :            : #include <validation.h>
      46                 :            : 
      47                 :            : #include <algorithm>
      48                 :            : #include <atomic>
      49                 :            : #include <chrono>
      50                 :            : #include <future>
      51                 :            : #include <memory>
      52                 :            : #include <optional>
      53                 :            : #include <typeinfo>
      54                 :            : 
      55                 :            : /** Headers download timeout.
      56                 :            :  *  Timeout = base + per_header * (expected number of headers) */
      57                 :            : static constexpr auto HEADERS_DOWNLOAD_TIMEOUT_BASE = 15min;
      58                 :            : static constexpr auto HEADERS_DOWNLOAD_TIMEOUT_PER_HEADER = 1ms;
      59                 :            : /** How long to wait for a peer to respond to a getheaders request */
      60                 :            : static constexpr auto HEADERS_RESPONSE_TIME{2min};
      61                 :            : /** Protect at least this many outbound peers from disconnection due to slow/
      62                 :            :  * behind headers chain.
      63                 :            :  */
      64                 :            : static constexpr int32_t MAX_OUTBOUND_PEERS_TO_PROTECT_FROM_DISCONNECT = 4;
      65                 :            : /** Timeout for (unprotected) outbound peers to sync to our chainwork */
      66                 :            : static constexpr auto CHAIN_SYNC_TIMEOUT{20min};
      67                 :            : /** How frequently to check for stale tips */
      68                 :            : static constexpr auto STALE_CHECK_INTERVAL{10min};
      69                 :            : /** How frequently to check for extra outbound peers and disconnect */
      70                 :            : static constexpr auto EXTRA_PEER_CHECK_INTERVAL{45s};
      71                 :            : /** Minimum time an outbound-peer-eviction candidate must be connected for, in order to evict */
      72                 :            : static constexpr auto MINIMUM_CONNECT_TIME{30s};
      73                 :            : /** SHA256("main address relay")[0:8] */
      74                 :            : static constexpr uint64_t RANDOMIZER_ID_ADDRESS_RELAY = 0x3cac0035b5866b90ULL;
      75                 :            : /// Age after which a stale block will no longer be served if requested as
      76                 :            : /// protection against fingerprinting. Set to one month, denominated in seconds.
      77                 :            : static constexpr int STALE_RELAY_AGE_LIMIT = 30 * 24 * 60 * 60;
      78                 :            : /// Age after which a block is considered historical for purposes of rate
      79                 :            : /// limiting block relay. Set to one week, denominated in seconds.
      80                 :            : static constexpr int HISTORICAL_BLOCK_AGE = 7 * 24 * 60 * 60;
      81                 :            : /** Time between pings automatically sent out for latency probing and keepalive */
      82                 :            : static constexpr auto PING_INTERVAL{2min};
      83         [ +  - ]:          2 : /** The maximum number of entries in a locator */
      84                 :            : static const unsigned int MAX_LOCATOR_SZ = 101;
      85                 :            : /** The maximum number of entries in an 'inv' protocol message */
      86                 :            : static const unsigned int MAX_INV_SZ = 50000;
      87                 :            : /** Maximum number of in-flight transaction requests from a peer. It is not a hard limit, but the threshold at which
      88                 :            :  *  point the OVERLOADED_PEER_TX_DELAY kicks in. */
      89                 :            : static constexpr int32_t MAX_PEER_TX_REQUEST_IN_FLIGHT = 100;
      90                 :            : /** Maximum number of transactions to consider for requesting, per peer. It provides a reasonable DoS limit to
      91                 :            :  *  per-peer memory usage spent on announcements, while covering peers continuously sending INVs at the maximum
      92                 :            :  *  rate (by our own policy, see INVENTORY_BROADCAST_PER_SECOND) for several minutes, while not receiving
      93                 :            :  *  the actual transaction (from any peer) in response to requests for them. */
      94                 :            : static constexpr int32_t MAX_PEER_TX_ANNOUNCEMENTS = 5000;
      95                 :            : /** How long to delay requesting transactions via txids, if we have wtxid-relaying peers */
      96                 :            : static constexpr auto TXID_RELAY_DELAY{2s};
      97                 :            : /** How long to delay requesting transactions from non-preferred peers */
      98                 :            : static constexpr auto NONPREF_PEER_TX_DELAY{2s};
      99                 :            : /** How long to delay requesting transactions from overloaded peers (see MAX_PEER_TX_REQUEST_IN_FLIGHT). */
     100                 :            : static constexpr auto OVERLOADED_PEER_TX_DELAY{2s};
     101                 :            : /** How long to wait before downloading a transaction from an additional peer */
     102                 :            : static constexpr auto GETDATA_TX_INTERVAL{60s};
     103                 :            : /** Limit to avoid sending big packets. Not used in processing incoming GETDATA for compatibility */
     104                 :            : static const unsigned int MAX_GETDATA_SZ = 1000;
     105                 :            : /** Number of blocks that can be requested at any given time from a single peer. */
     106                 :            : static const int MAX_BLOCKS_IN_TRANSIT_PER_PEER = 16;
     107                 :            : /** Default time during which a peer must stall block download progress before being disconnected.
     108                 :            :  * the actual timeout is increased temporarily if peers are disconnected for hitting the timeout */
     109                 :            : static constexpr auto BLOCK_STALLING_TIMEOUT_DEFAULT{2s};
     110                 :            : /** Maximum timeout for stalling block download. */
     111                 :            : static constexpr auto BLOCK_STALLING_TIMEOUT_MAX{64s};
     112                 :            : /** Number of headers sent in one getheaders result. We rely on the assumption that if a peer sends
     113                 :            :  *  less than this number, we reached its tip. Changing this value is a protocol upgrade. */
     114                 :            : static const unsigned int MAX_HEADERS_RESULTS = 2000;
     115                 :            : /** Maximum depth of blocks we're willing to serve as compact blocks to peers
     116                 :            :  *  when requested. For older blocks, a regular BLOCK response will be sent. */
     117                 :            : static const int MAX_CMPCTBLOCK_DEPTH = 5;
     118                 :            : /** Maximum depth of blocks we're willing to respond to GETBLOCKTXN requests for. */
     119                 :            : static const int MAX_BLOCKTXN_DEPTH = 10;
     120                 :            : /** Size of the "block download window": how far ahead of our current height do we fetch?
     121                 :            :  *  Larger windows tolerate larger download speed differences between peer, but increase the potential
     122                 :            :  *  degree of disordering of blocks on disk (which make reindexing and pruning harder). We'll probably
     123                 :            :  *  want to make this a per-peer adaptive value at some point. */
     124                 :            : static const unsigned int BLOCK_DOWNLOAD_WINDOW = 1024;
     125                 :            : /** Block download timeout base, expressed in multiples of the block interval (i.e. 10 min) */
     126                 :            : static constexpr double BLOCK_DOWNLOAD_TIMEOUT_BASE = 1;
     127                 :            : /** Additional block download timeout per parallel downloading peer (i.e. 5 min) */
     128                 :            : static constexpr double BLOCK_DOWNLOAD_TIMEOUT_PER_PEER = 0.5;
     129                 :            : /** Maximum number of headers to announce when relaying blocks with headers message.*/
     130                 :            : static const unsigned int MAX_BLOCKS_TO_ANNOUNCE = 8;
     131                 :            : /** Maximum number of unconnecting headers announcements before DoS score */
     132                 :            : static const int MAX_NUM_UNCONNECTING_HEADERS_MSGS = 10;
     133                 :            : /** Minimum blocks required to signal NODE_NETWORK_LIMITED */
     134                 :            : static const unsigned int NODE_NETWORK_LIMITED_MIN_BLOCKS = 288;
     135                 :            : /** Average delay between local address broadcasts */
     136                 :            : static constexpr auto AVG_LOCAL_ADDRESS_BROADCAST_INTERVAL{24h};
     137                 :            : /** Average delay between peer address broadcasts */
     138                 :            : static constexpr auto AVG_ADDRESS_BROADCAST_INTERVAL{30s};
     139                 :            : /** Delay between rotating the peers we relay a particular address to */
     140                 :            : static constexpr auto ROTATE_ADDR_RELAY_DEST_INTERVAL{24h};
     141                 :            : /** Average delay between trickled inventory transmissions for inbound peers.
     142                 :            :  *  Blocks and peers with NetPermissionFlags::NoBan permission bypass this. */
     143                 :            : static constexpr auto INBOUND_INVENTORY_BROADCAST_INTERVAL{5s};
     144                 :            : /** Average delay between trickled inventory transmissions for outbound peers.
     145                 :            :  *  Use a smaller delay as there is less privacy concern for them.
     146                 :            :  *  Blocks and peers with NetPermissionFlags::NoBan permission bypass this. */
     147                 :            : static constexpr auto OUTBOUND_INVENTORY_BROADCAST_INTERVAL{2s};
     148                 :            : /** Maximum rate of inventory items to send per second.
     149                 :            :  *  Limits the impact of low-fee transaction floods. */
     150                 :            : static constexpr unsigned int INVENTORY_BROADCAST_PER_SECOND = 7;
     151                 :            : /** Target number of tx inventory items to send per transmission. */
     152                 :            : static constexpr unsigned int INVENTORY_BROADCAST_TARGET = INVENTORY_BROADCAST_PER_SECOND * count_seconds(INBOUND_INVENTORY_BROADCAST_INTERVAL);
     153                 :            : /** Maximum number of inventory items to send per transmission. */
     154                 :            : static constexpr unsigned int INVENTORY_BROADCAST_MAX = 1000;
     155                 :            : static_assert(INVENTORY_BROADCAST_MAX >= INVENTORY_BROADCAST_TARGET, "INVENTORY_BROADCAST_MAX too low");
     156                 :            : static_assert(INVENTORY_BROADCAST_MAX <= MAX_PEER_TX_ANNOUNCEMENTS, "INVENTORY_BROADCAST_MAX too high");
     157                 :            : /** Average delay between feefilter broadcasts in seconds. */
     158                 :            : static constexpr auto AVG_FEEFILTER_BROADCAST_INTERVAL{10min};
     159                 :            : /** Maximum feefilter broadcast delay after significant change. */
     160                 :            : static constexpr auto MAX_FEEFILTER_CHANGE_DELAY{5min};
     161                 :            : /** Maximum number of compact filters that may be requested with one getcfilters. See BIP 157. */
     162                 :            : static constexpr uint32_t MAX_GETCFILTERS_SIZE = 1000;
     163                 :            : /** Maximum number of cf hashes that may be requested with one getcfheaders. See BIP 157. */
     164                 :            : static constexpr uint32_t MAX_GETCFHEADERS_SIZE = 2000;
     165                 :            : /** the maximum percentage of addresses from our addrman to return in response to a getaddr message. */
     166                 :            : static constexpr size_t MAX_PCT_ADDR_TO_SEND = 23;
     167                 :            : /** The maximum number of address records permitted in an ADDR message. */
     168                 :            : static constexpr size_t MAX_ADDR_TO_SEND{1000};
     169                 :            : /** The maximum rate of address records we're willing to process on average. Can be bypassed using
     170                 :            :  *  the NetPermissionFlags::Addr permission. */
     171                 :            : static constexpr double MAX_ADDR_RATE_PER_SECOND{0.1};
     172                 :            : /** The soft limit of the address processing token bucket (the regular MAX_ADDR_RATE_PER_SECOND
     173                 :            :  *  based increments won't go above this, but the MAX_ADDR_TO_SEND increment following GETADDR
     174                 :            :  *  is exempt from this limit). */
     175                 :            : static constexpr size_t MAX_ADDR_PROCESSING_TOKEN_BUCKET{MAX_ADDR_TO_SEND};
     176                 :            : /** The compactblocks version we support. See BIP 152. */
     177                 :            : static constexpr uint64_t CMPCTBLOCKS_VERSION{2};
     178                 :            : 
     179                 :            : // Internal stuff
     180                 :            : namespace {
     181                 :            : /** Blocks that are in flight, and that are in the queue to be downloaded. */
     182                 :          0 : struct QueuedBlock {
     183                 :            :     /** BlockIndex. We must have this since we only request blocks when we've already validated the header. */
     184                 :            :     const CBlockIndex* pindex;
     185                 :            :     /** Optional, used for CMPCTBLOCK downloads */
     186                 :            :     std::unique_ptr<PartiallyDownloadedBlock> partialBlock;
     187                 :            : };
     188                 :            : 
     189                 :            : /**
     190                 :            :  * Data structure for an individual peer. This struct is not protected by
     191                 :            :  * cs_main since it does not contain validation-critical data.
     192                 :            :  *
     193                 :            :  * Memory is owned by shared pointers and this object is destructed when
     194                 :            :  * the refcount drops to zero.
     195                 :            :  *
     196                 :            :  * Mutexes inside this struct must not be held when locking m_peer_mutex.
     197                 :            :  *
     198                 :            :  * TODO: move most members from CNodeState to this structure.
     199                 :            :  * TODO: move remaining application-layer data members from CNode to this structure.
     200                 :            :  */
     201                 :          0 : struct Peer {
     202                 :            :     /** Same id as the CNode object for this peer */
     203                 :            :     const NodeId m_id{0};
     204                 :            : 
     205                 :            :     /** Services we offered to this peer.
     206                 :            :      *
     207                 :            :      *  This is supplied by CConnman during peer initialization. It's const
     208                 :            :      *  because there is no protocol defined for renegotiating services
     209                 :            :      *  initially offered to a peer. The set of local services we offer should
     210                 :            :      *  not change after initialization.
     211                 :            :      *
     212                 :            :      *  An interesting example of this is NODE_NETWORK and initial block
     213                 :            :      *  download: a node which starts up from scratch doesn't have any blocks
     214                 :            :      *  to serve, but still advertises NODE_NETWORK because it will eventually
     215                 :            :      *  fulfill this role after IBD completes. P2P code is written in such a
     216                 :            :      *  way that it can gracefully handle peers who don't make good on their
     217                 :            :      *  service advertisements. */
     218                 :            :     const ServiceFlags m_our_services;
     219                 :            :     /** Services this peer offered to us. */
     220                 :          0 :     std::atomic<ServiceFlags> m_their_services{NODE_NONE};
     221                 :            : 
     222                 :            :     /** Protects misbehavior data members */
     223                 :            :     Mutex m_misbehavior_mutex;
     224                 :            :     /** Accumulated misbehavior score for this peer */
     225                 :          0 :     int m_misbehavior_score GUARDED_BY(m_misbehavior_mutex){0};
     226                 :            :     /** Whether this peer should be disconnected and marked as discouraged (unless it has NetPermissionFlags::NoBan permission). */
     227                 :          0 :     bool m_should_discourage GUARDED_BY(m_misbehavior_mutex){false};
     228                 :            : 
     229                 :            :     /** Protects block inventory data members */
     230                 :            :     Mutex m_block_inv_mutex;
     231                 :            :     /** List of blocks that we'll announce via an `inv` message.
     232                 :            :      * There is no final sorting before sending, as they are always sent
     233                 :            :      * immediately and in the order requested. */
     234                 :            :     std::vector<uint256> m_blocks_for_inv_relay GUARDED_BY(m_block_inv_mutex);
     235                 :            :     /** Unfiltered list of blocks that we'd like to announce via a `headers`
     236                 :            :      * message. If we can't announce via a `headers` message, we'll fall back to
     237                 :            :      * announcing via `inv`. */
     238                 :            :     std::vector<uint256> m_blocks_for_headers_relay GUARDED_BY(m_block_inv_mutex);
     239                 :            :     /** The final block hash that we sent in an `inv` message to this peer.
     240                 :            :      * When the peer requests this block, we send an `inv` message to trigger
     241                 :            :      * the peer to request the next sequence of block hashes.
     242                 :            :      * Most peers use headers-first syncing, which doesn't use this mechanism */
     243         [ #  # ]:          0 :     uint256 m_continuation_block GUARDED_BY(m_block_inv_mutex) {};
     244                 :            : 
     245                 :            :     /** This peer's reported block height when we connected */
     246                 :          0 :     std::atomic<int> m_starting_height{-1};
     247                 :            : 
     248                 :            :     /** The pong reply we're expecting, or 0 if no pong expected. */
     249                 :          0 :     std::atomic<uint64_t> m_ping_nonce_sent{0};
     250                 :            :     /** When the last ping was sent, or 0 if no ping was ever sent */
     251         [ #  # ]:          0 :     std::atomic<std::chrono::microseconds> m_ping_start{0us};
     252                 :            :     /** Whether a ping has been requested by the user */
     253                 :          0 :     std::atomic<bool> m_ping_queued{false};
     254                 :            : 
     255                 :            :     /** Whether this peer relays txs via wtxid */
     256                 :          0 :     std::atomic<bool> m_wtxid_relay{false};
     257                 :            :     /** The feerate in the most recent BIP133 `feefilter` message sent to the peer.
     258                 :            :      *  It is *not* a p2p protocol violation for the peer to send us
     259                 :            :      *  transactions with a lower fee rate than this. See BIP133. */
     260                 :          0 :     CAmount m_fee_filter_sent GUARDED_BY(NetEventsInterface::g_msgproc_mutex){0};
     261                 :            :     /** Timestamp after which we will send the next BIP133 `feefilter` message
     262                 :            :       * to the peer. */
     263         [ #  # ]:          0 :     std::chrono::microseconds m_next_send_feefilter GUARDED_BY(NetEventsInterface::g_msgproc_mutex){0};
     264                 :            : 
     265                 :          0 :     struct TxRelay {
     266                 :            :         mutable RecursiveMutex m_bloom_filter_mutex;
     267                 :            :         /** Whether we relay transactions to this peer. */
     268                 :          0 :         bool m_relay_txs GUARDED_BY(m_bloom_filter_mutex){false};
     269                 :            :         /** A bloom filter for which transactions to announce to the peer. See BIP37. */
     270                 :          0 :         std::unique_ptr<CBloomFilter> m_bloom_filter PT_GUARDED_BY(m_bloom_filter_mutex) GUARDED_BY(m_bloom_filter_mutex){nullptr};
     271                 :            : 
     272                 :            :         mutable RecursiveMutex m_tx_inventory_mutex;
     273                 :            :         /** A filter of all the (w)txids that the peer has announced to
     274                 :            :          *  us or we have announced to the peer. We use this to avoid announcing
     275                 :            :          *  the same (w)txid to a peer that already has the transaction. */
     276         [ #  # ]:          0 :         CRollingBloomFilter m_tx_inventory_known_filter GUARDED_BY(m_tx_inventory_mutex){50000, 0.000001};
     277                 :            :         /** Set of transaction ids we still have to announce (txid for
     278                 :            :          *  non-wtxid-relay peers, wtxid for wtxid-relay peers). We use the
     279                 :            :          *  mempool to sort transactions in dependency order before relay, so
     280                 :            :          *  this does not have to be sorted. */
     281                 :            :         std::set<uint256> m_tx_inventory_to_send GUARDED_BY(m_tx_inventory_mutex);
     282                 :            :         /** Whether the peer has requested us to send our complete mempool. Only
     283                 :            :          *  permitted if the peer has NetPermissionFlags::Mempool or we advertise
     284                 :            :          *  NODE_BLOOM. See BIP35. */
     285                 :          0 :         bool m_send_mempool GUARDED_BY(m_tx_inventory_mutex){false};
     286                 :            :         /** The next time after which we will send an `inv` message containing
     287                 :            :          *  transaction announcements to this peer. */
     288         [ #  # ]:          0 :         std::chrono::microseconds m_next_inv_send_time GUARDED_BY(m_tx_inventory_mutex){0};
     289                 :            :         /** The mempool sequence num at which we sent the last `inv` message to this peer.
     290                 :            :          *  Can relay txs with lower sequence numbers than this (see CTxMempool::info_for_relay). */
     291                 :          0 :         uint64_t m_last_inv_sequence GUARDED_BY(NetEventsInterface::g_msgproc_mutex){1};
     292                 :            : 
     293                 :            :         /** Minimum fee rate with which to filter transaction announcements to this node. See BIP133. */
     294                 :          0 :         std::atomic<CAmount> m_fee_filter_received{0};
     295                 :            :     };
     296                 :            : 
     297                 :            :     /* Initializes a TxRelay struct for this peer. Can be called at most once for a peer. */
     298                 :          0 :     TxRelay* SetTxRelay() EXCLUSIVE_LOCKS_REQUIRED(!m_tx_relay_mutex)
     299                 :            :     {
     300                 :          0 :         LOCK(m_tx_relay_mutex);
     301         [ #  # ]:          0 :         Assume(!m_tx_relay);
     302         [ #  # ]:          0 :         m_tx_relay = std::make_unique<Peer::TxRelay>();
     303                 :          0 :         return m_tx_relay.get();
     304                 :          0 :     };
     305                 :            : 
     306                 :          0 :     TxRelay* GetTxRelay() EXCLUSIVE_LOCKS_REQUIRED(!m_tx_relay_mutex)
     307                 :            :     {
     308                 :          0 :         return WITH_LOCK(m_tx_relay_mutex, return m_tx_relay.get());
     309                 :            :     };
     310                 :            : 
     311                 :            :     /** A vector of addresses to send to the peer, limited to MAX_ADDR_TO_SEND. */
     312                 :            :     std::vector<CAddress> m_addrs_to_send GUARDED_BY(NetEventsInterface::g_msgproc_mutex);
     313                 :            :     /** Probabilistic filter to track recent addr messages relayed with this
     314                 :            :      *  peer. Used to avoid relaying redundant addresses to this peer.
     315                 :            :      *
     316                 :            :      *  We initialize this filter for outbound peers (other than
     317                 :            :      *  block-relay-only connections) or when an inbound peer sends us an
     318                 :            :      *  address related message (ADDR, ADDRV2, GETADDR).
     319                 :            :      *
     320                 :            :      *  Presence of this filter must correlate with m_addr_relay_enabled.
     321                 :            :      **/
     322                 :            :     std::unique_ptr<CRollingBloomFilter> m_addr_known GUARDED_BY(NetEventsInterface::g_msgproc_mutex);
     323                 :            :     /** Whether we are participating in address relay with this connection.
     324                 :            :      *
     325                 :            :      *  We set this bool to true for outbound peers (other than
     326                 :            :      *  block-relay-only connections), or when an inbound peer sends us an
     327                 :            :      *  address related message (ADDR, ADDRV2, GETADDR).
     328                 :            :      *
     329                 :            :      *  We use this bool to decide whether a peer is eligible for gossiping
     330                 :            :      *  addr messages. This avoids relaying to peers that are unlikely to
     331                 :            :      *  forward them, effectively blackholing self announcements. Reasons
     332                 :            :      *  peers might support addr relay on the link include that they connected
     333                 :            :      *  to us as a block-relay-only peer or they are a light client.
     334                 :            :      *
     335                 :            :      *  This field must correlate with whether m_addr_known has been
     336                 :            :      *  initialized.*/
     337                 :          0 :     std::atomic_bool m_addr_relay_enabled{false};
     338                 :            :     /** Whether a getaddr request to this peer is outstanding. */
     339                 :          0 :     bool m_getaddr_sent GUARDED_BY(NetEventsInterface::g_msgproc_mutex){false};
     340                 :            :     /** Guards address sending timers. */
     341                 :            :     mutable Mutex m_addr_send_times_mutex;
     342                 :            :     /** Time point to send the next ADDR message to this peer. */
     343         [ #  # ]:          0 :     std::chrono::microseconds m_next_addr_send GUARDED_BY(m_addr_send_times_mutex){0};
     344                 :            :     /** Time point to possibly re-announce our local address to this peer. */
     345         [ #  # ]:          0 :     std::chrono::microseconds m_next_local_addr_send GUARDED_BY(m_addr_send_times_mutex){0};
     346                 :            :     /** Whether the peer has signaled support for receiving ADDRv2 (BIP155)
     347                 :            :      *  messages, indicating a preference to receive ADDRv2 instead of ADDR ones. */
     348                 :          0 :     std::atomic_bool m_wants_addrv2{false};
     349                 :            :     /** Whether this peer has already sent us a getaddr message. */
     350                 :          0 :     bool m_getaddr_recvd GUARDED_BY(NetEventsInterface::g_msgproc_mutex){false};
     351                 :            :     /** Number of addresses that can be processed from this peer. Start at 1 to
     352                 :            :      *  permit self-announcement. */
     353                 :          0 :     double m_addr_token_bucket GUARDED_BY(NetEventsInterface::g_msgproc_mutex){1.0};
     354                 :            :     /** When m_addr_token_bucket was last updated */
     355         [ #  # ]:          0 :     std::chrono::microseconds m_addr_token_timestamp GUARDED_BY(NetEventsInterface::g_msgproc_mutex){GetTime<std::chrono::microseconds>()};
     356                 :            :     /** Total number of addresses that were dropped due to rate limiting. */
     357                 :          0 :     std::atomic<uint64_t> m_addr_rate_limited{0};
     358                 :            :     /** Total number of addresses that were processed (excludes rate-limited ones). */
     359                 :          0 :     std::atomic<uint64_t> m_addr_processed{0};
     360                 :            : 
     361                 :            :     /** Whether we've sent this peer a getheaders in response to an inv prior to initial-headers-sync completing */
     362                 :          0 :     bool m_inv_triggered_getheaders_before_sync GUARDED_BY(NetEventsInterface::g_msgproc_mutex){false};
     363                 :            : 
     364                 :            :     /** Protects m_getdata_requests **/
     365                 :            :     Mutex m_getdata_requests_mutex;
     366                 :            :     /** Work queue of items requested by this peer **/
     367                 :            :     std::deque<CInv> m_getdata_requests GUARDED_BY(m_getdata_requests_mutex);
     368                 :            : 
     369                 :            :     /** Time of the last getheaders message to this peer */
     370         [ #  # ]:          0 :     NodeClock::time_point m_last_getheaders_timestamp GUARDED_BY(NetEventsInterface::g_msgproc_mutex){};
     371                 :            : 
     372                 :            :     /** Protects m_headers_sync **/
     373                 :            :     Mutex m_headers_sync_mutex;
     374                 :            :     /** Headers-sync state for this peer (eg for initial sync, or syncing large
     375                 :            :      * reorgs) **/
     376                 :          0 :     std::unique_ptr<HeadersSyncState> m_headers_sync PT_GUARDED_BY(m_headers_sync_mutex) GUARDED_BY(m_headers_sync_mutex) {};
     377                 :            : 
     378                 :            :     /** Whether we've sent our peer a sendheaders message. **/
     379                 :          0 :     std::atomic<bool> m_sent_sendheaders{false};
     380                 :            : 
     381                 :            :     /** Length of current-streak of unconnecting headers announcements */
     382                 :          0 :     int m_num_unconnecting_headers_msgs GUARDED_BY(NetEventsInterface::g_msgproc_mutex){0};
     383                 :            : 
     384                 :            :     /** When to potentially disconnect peer for stalling headers download */
     385         [ #  # ]:          0 :     std::chrono::microseconds m_headers_sync_timeout GUARDED_BY(NetEventsInterface::g_msgproc_mutex){0us};
     386                 :            : 
     387                 :            :     /** Whether this peer wants invs or headers (when possible) for block announcements */
     388                 :          0 :     bool m_prefers_headers GUARDED_BY(NetEventsInterface::g_msgproc_mutex){false};
     389                 :            : 
     390         [ #  # ]:          0 :     explicit Peer(NodeId id, ServiceFlags our_services)
     391                 :          0 :         : m_id{id}
     392                 :          0 :         , m_our_services{our_services}
     393                 :          0 :     {}
     394                 :            : 
     395                 :            : private:
     396                 :            :     mutable Mutex m_tx_relay_mutex;
     397                 :            : 
     398                 :            :     /** Transaction relay data. May be a nullptr. */
     399                 :            :     std::unique_ptr<TxRelay> m_tx_relay GUARDED_BY(m_tx_relay_mutex);
     400                 :            : };
     401                 :            : 
     402                 :            : using PeerRef = std::shared_ptr<Peer>;
     403                 :            : 
     404                 :            : /**
     405                 :            :  * Maintain validation-specific state about nodes, protected by cs_main, instead
     406                 :            :  * by CNode's own locks. This simplifies asynchronous operation, where
     407                 :            :  * processing of incoming data is done after the ProcessMessage call returns,
     408                 :            :  * and we're no longer holding the node's locks.
     409                 :            :  */
     410                 :          0 : struct CNodeState {
     411                 :            :     //! The best known block we know this peer has announced.
     412                 :          0 :     const CBlockIndex* pindexBestKnownBlock{nullptr};
     413                 :            :     //! The hash of the last unknown block this peer has announced.
     414                 :          0 :     uint256 hashLastUnknownBlock{};
     415                 :            :     //! The last full block we both have.
     416                 :          0 :     const CBlockIndex* pindexLastCommonBlock{nullptr};
     417                 :            :     //! The best header we have sent our peer.
     418                 :          0 :     const CBlockIndex* pindexBestHeaderSent{nullptr};
     419                 :            :     //! Whether we've started headers synchronization with this peer.
     420                 :          0 :     bool fSyncStarted{false};
     421                 :            :     //! Since when we're stalling block download progress (in microseconds), or 0.
     422                 :          0 :     std::chrono::microseconds m_stalling_since{0us};
     423                 :            :     std::list<QueuedBlock> vBlocksInFlight;
     424                 :            :     //! When the first entry in vBlocksInFlight started downloading. Don't care when vBlocksInFlight is empty.
     425         [ #  # ]:          0 :     std::chrono::microseconds m_downloading_since{0us};
     426                 :            :     //! Whether we consider this a preferred download peer.
     427                 :          0 :     bool fPreferredDownload{false};
     428                 :            :     /** Whether this peer wants invs or cmpctblocks (when possible) for block announcements. */
     429                 :          0 :     bool m_requested_hb_cmpctblocks{false};
     430                 :            :     /** Whether this peer will send us cmpctblocks if we request them. */
     431                 :          0 :     bool m_provides_cmpctblocks{false};
     432                 :            : 
     433                 :            :     /** State used to enforce CHAIN_SYNC_TIMEOUT and EXTRA_PEER_CHECK_INTERVAL logic.
     434                 :            :       *
     435                 :            :       * Both are only in effect for outbound, non-manual, non-protected connections.
     436                 :            :       * Any peer protected (m_protect = true) is not chosen for eviction. A peer is
     437                 :            :       * marked as protected if all of these are true:
     438                 :            :       *   - its connection type is IsBlockOnlyConn() == false
     439                 :            :       *   - it gave us a valid connecting header
     440                 :            :       *   - we haven't reached MAX_OUTBOUND_PEERS_TO_PROTECT_FROM_DISCONNECT yet
     441                 :            :       *   - its chain tip has at least as much work as ours
     442                 :            :       *
     443                 :            :       * CHAIN_SYNC_TIMEOUT: if a peer's best known block has less work than our tip,
     444                 :            :       * set a timeout CHAIN_SYNC_TIMEOUT in the future:
     445                 :            :       *   - If at timeout their best known block now has more work than our tip
     446                 :            :       *     when the timeout was set, then either reset the timeout or clear it
     447                 :            :       *     (after comparing against our current tip's work)
     448                 :            :       *   - If at timeout their best known block still has less work than our
     449                 :            :       *     tip did when the timeout was set, then send a getheaders message,
     450                 :            :       *     and set a shorter timeout, HEADERS_RESPONSE_TIME seconds in future.
     451                 :            :       *     If their best known block is still behind when that new timeout is
     452                 :            :       *     reached, disconnect.
     453                 :            :       *
     454                 :            :       * EXTRA_PEER_CHECK_INTERVAL: after each interval, if we have too many outbound peers,
     455                 :            :       * drop the outbound one that least recently announced us a new block.
     456                 :            :       */
     457                 :          0 :     struct ChainSyncTimeoutState {
     458                 :            :         //! A timeout used for checking whether our peer has sufficiently synced
     459                 :          0 :         std::chrono::seconds m_timeout{0s};
     460                 :            :         //! A header with the work we require on our peer's chain
     461                 :          0 :         const CBlockIndex* m_work_header{nullptr};
     462                 :            :         //! After timeout is reached, set to true after sending getheaders
     463                 :          0 :         bool m_sent_getheaders{false};
     464                 :            :         //! Whether this peer is protected from disconnection due to a bad/slow chain
     465                 :          0 :         bool m_protect{false};
     466                 :            :     };
     467                 :            : 
     468                 :            :     ChainSyncTimeoutState m_chain_sync;
     469                 :            : 
     470                 :            :     //! Time of last new block announcement
     471                 :          0 :     int64_t m_last_block_announcement{0};
     472                 :            : 
     473                 :            :     //! Whether this peer is an inbound connection
     474                 :            :     const bool m_is_inbound;
     475                 :            : 
     476         [ #  # ]:          0 :     CNodeState(bool is_inbound) : m_is_inbound(is_inbound) {}
     477                 :            : };
     478                 :            : 
     479                 :          0 : class PeerManagerImpl final : public PeerManager
     480                 :            : {
     481                 :            : public:
     482                 :            :     PeerManagerImpl(CConnman& connman, AddrMan& addrman,
     483                 :            :                     BanMan* banman, ChainstateManager& chainman,
     484                 :            :                     CTxMemPool& pool, Options opts);
     485                 :            : 
     486                 :            :     /** Overridden from CValidationInterface. */
     487                 :            :     void BlockConnected(ChainstateRole role, const std::shared_ptr<const CBlock>& pblock, const CBlockIndex* pindexConnected) override
     488                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_recent_confirmed_transactions_mutex);
     489                 :            :     void BlockDisconnected(const std::shared_ptr<const CBlock> &block, const CBlockIndex* pindex) override
     490                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_recent_confirmed_transactions_mutex);
     491                 :            :     void UpdatedBlockTip(const CBlockIndex *pindexNew, const CBlockIndex *pindexFork, bool fInitialDownload) override
     492                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     493                 :            :     void BlockChecked(const CBlock& block, const BlockValidationState& state) override
     494                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     495                 :            :     void NewPoWValidBlock(const CBlockIndex *pindex, const std::shared_ptr<const CBlock>& pblock) override
     496                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_most_recent_block_mutex);
     497                 :            : 
     498                 :            :     /** Implement NetEventsInterface */
     499                 :            :     void InitializeNode(CNode& node, ServiceFlags our_services) override EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     500                 :            :     void FinalizeNode(const CNode& node) override EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex, !m_headers_presync_mutex);
     501                 :            :     bool ProcessMessages(CNode* pfrom, std::atomic<bool>& interrupt) override
     502                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex, !m_recent_confirmed_transactions_mutex, !m_most_recent_block_mutex, !m_headers_presync_mutex, g_msgproc_mutex);
     503                 :            :     bool SendMessages(CNode* pto) override
     504                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex, !m_recent_confirmed_transactions_mutex, !m_most_recent_block_mutex, g_msgproc_mutex);
     505                 :            : 
     506                 :            :     /** Implement PeerManager */
     507                 :            :     void StartScheduledTasks(CScheduler& scheduler) override;
     508                 :            :     void CheckForStaleTipAndEvictPeers() override;
     509                 :            :     std::optional<std::string> FetchBlock(NodeId peer_id, const CBlockIndex& block_index) override
     510                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     511                 :            :     bool GetNodeStateStats(NodeId nodeid, CNodeStateStats& stats) const override EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     512                 :          0 :     bool IgnoresIncomingTxs() override { return m_opts.ignore_incoming_txs; }
     513                 :            :     void SendPings() override EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     514                 :            :     void RelayTransaction(const uint256& txid, const uint256& wtxid) override EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     515                 :          0 :     void SetBestHeight(int height) override { m_best_height = height; };
     516 [ #  # ][ #  # ]:          0 :     void UnitTestMisbehaving(NodeId peer_id, int howmuch) override EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex) { Misbehaving(*Assert(GetPeerRef(peer_id)), howmuch, ""); };
                 [ #  # ]
     517                 :            :     void ProcessMessage(CNode& pfrom, const std::string& msg_type, CDataStream& vRecv,
     518                 :            :                         const std::chrono::microseconds time_received, const std::atomic<bool>& interruptMsgProc) override
     519                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex, !m_recent_confirmed_transactions_mutex, !m_most_recent_block_mutex, !m_headers_presync_mutex, g_msgproc_mutex);
     520                 :            :     void UpdateLastBlockAnnounceTime(NodeId node, int64_t time_in_seconds) override;
     521                 :            : 
     522                 :            : private:
     523                 :            :     /** Consider evicting an outbound peer based on the amount of time they've been behind our tip */
     524                 :            :     void ConsiderEviction(CNode& pto, Peer& peer, std::chrono::seconds time_in_seconds) EXCLUSIVE_LOCKS_REQUIRED(cs_main, g_msgproc_mutex);
     525                 :            : 
     526                 :            :     /** If we have extra outbound peers, try to disconnect the one with the oldest block announcement */
     527                 :            :     void EvictExtraOutboundPeers(std::chrono::seconds now) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     528                 :            : 
     529                 :            :     /** Retrieve unbroadcast transactions from the mempool and reattempt sending to peers */
     530                 :            :     void ReattemptInitialBroadcast(CScheduler& scheduler) EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     531                 :            : 
     532                 :            :     /** Get a shared pointer to the Peer object.
     533                 :            :      *  May return an empty shared_ptr if the Peer object can't be found. */
     534                 :            :     PeerRef GetPeerRef(NodeId id) const EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     535                 :            : 
     536                 :            :     /** Get a shared pointer to the Peer object and remove it from m_peer_map.
     537                 :            :      *  May return an empty shared_ptr if the Peer object can't be found. */
     538                 :            :     PeerRef RemovePeer(NodeId id) EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     539                 :            : 
     540                 :            :     /**
     541                 :            :      * Increment peer's misbehavior score. If the new value >= DISCOURAGEMENT_THRESHOLD, mark the node
     542                 :            :      * to be discouraged, meaning the peer might be disconnected and added to the discouragement filter.
     543                 :            :      */
     544                 :            :     void Misbehaving(Peer& peer, int howmuch, const std::string& message);
     545                 :            : 
     546                 :            :     /**
     547                 :            :      * Potentially mark a node discouraged based on the contents of a BlockValidationState object
     548                 :            :      *
     549                 :            :      * @param[in] via_compact_block this bool is passed in because net_processing should
     550                 :            :      * punish peers differently depending on whether the data was provided in a compact
     551                 :            :      * block message or not. If the compact block had a valid header, but contained invalid
     552                 :            :      * txs, the peer should not be punished. See BIP 152.
     553                 :            :      *
     554                 :            :      * @return Returns true if the peer was punished (probably disconnected)
     555                 :            :      */
     556                 :            :     bool MaybePunishNodeForBlock(NodeId nodeid, const BlockValidationState& state,
     557                 :            :                                  bool via_compact_block, const std::string& message = "")
     558                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     559                 :            : 
     560                 :            :     /**
     561                 :            :      * Potentially disconnect and discourage a node based on the contents of a TxValidationState object
     562                 :            :      *
     563                 :            :      * @return Returns true if the peer was punished (probably disconnected)
     564                 :            :      */
     565                 :            :     bool MaybePunishNodeForTx(NodeId nodeid, const TxValidationState& state)
     566                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex);
     567                 :            : 
     568                 :            :     /** Maybe disconnect a peer and discourage future connections from its address.
     569                 :            :      *
     570                 :            :      * @param[in]   pnode     The node to check.
     571                 :            :      * @param[in]   peer      The peer object to check.
     572                 :            :      * @return                True if the peer was marked for disconnection in this function
     573                 :            :      */
     574                 :            :     bool MaybeDiscourageAndDisconnect(CNode& pnode, Peer& peer);
     575                 :            : 
     576                 :            :     /**
     577                 :            :      * Reconsider orphan transactions after a parent has been accepted to the mempool.
     578                 :            :      *
     579                 :            :      * @peer[in]  peer     The peer whose orphan transactions we will reconsider. Generally only
     580                 :            :      *                     one orphan will be reconsidered on each call of this function. If an
     581                 :            :      *                     accepted orphan has orphaned children, those will need to be
     582                 :            :      *                     reconsidered, creating more work, possibly for other peers.
     583                 :            :      * @return             True if meaningful work was done (an orphan was accepted/rejected).
     584                 :            :      *                     If no meaningful work was done, then the work set for this peer
     585                 :            :      *                     will be empty.
     586                 :            :      */
     587                 :            :     bool ProcessOrphanTx(Peer& peer)
     588                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex, g_msgproc_mutex);
     589                 :            : 
     590                 :            :     /** Process a single headers message from a peer.
     591                 :            :      *
     592                 :            :      * @param[in]   pfrom     CNode of the peer
     593                 :            :      * @param[in]   peer      The peer sending us the headers
     594                 :            :      * @param[in]   headers   The headers received. Note that this may be modified within ProcessHeadersMessage.
     595                 :            :      * @param[in]   via_compact_block   Whether this header came in via compact block handling.
     596                 :            :     */
     597                 :            :     void ProcessHeadersMessage(CNode& pfrom, Peer& peer,
     598                 :            :                                std::vector<CBlockHeader>&& headers,
     599                 :            :                                bool via_compact_block)
     600                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex, !m_headers_presync_mutex, g_msgproc_mutex);
     601                 :            :     /** Various helpers for headers processing, invoked by ProcessHeadersMessage() */
     602                 :            :     /** Return true if headers are continuous and have valid proof-of-work (DoS points assigned on failure) */
     603                 :            :     bool CheckHeadersPoW(const std::vector<CBlockHeader>& headers, const Consensus::Params& consensusParams, Peer& peer);
     604                 :            :     /** Calculate an anti-DoS work threshold for headers chains */
     605                 :            :     arith_uint256 GetAntiDoSWorkThreshold();
     606                 :            :     /** Deal with state tracking and headers sync for peers that send the
     607                 :            :      * occasional non-connecting header (this can happen due to BIP 130 headers
     608                 :            :      * announcements for blocks interacting with the 2hr (MAX_FUTURE_BLOCK_TIME) rule). */
     609                 :            :     void HandleFewUnconnectingHeaders(CNode& pfrom, Peer& peer, const std::vector<CBlockHeader>& headers) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
     610                 :            :     /** Return true if the headers connect to each other, false otherwise */
     611                 :            :     bool CheckHeadersAreContinuous(const std::vector<CBlockHeader>& headers) const;
     612                 :            :     /** Try to continue a low-work headers sync that has already begun.
     613                 :            :      * Assumes the caller has already verified the headers connect, and has
     614                 :            :      * checked that each header satisfies the proof-of-work target included in
     615                 :            :      * the header.
     616                 :            :      *  @param[in]  peer                            The peer we're syncing with.
     617                 :            :      *  @param[in]  pfrom                           CNode of the peer
     618                 :            :      *  @param[in,out] headers                      The headers to be processed.
     619                 :            :      *  @return     True if the passed in headers were successfully processed
     620                 :            :      *              as the continuation of a low-work headers sync in progress;
     621                 :            :      *              false otherwise.
     622                 :            :      *              If false, the passed in headers will be returned back to
     623                 :            :      *              the caller.
     624                 :            :      *              If true, the returned headers may be empty, indicating
     625                 :            :      *              there is no more work for the caller to do; or the headers
     626                 :            :      *              may be populated with entries that have passed anti-DoS
     627                 :            :      *              checks (and therefore may be validated for block index
     628                 :            :      *              acceptance by the caller).
     629                 :            :      */
     630                 :            :     bool IsContinuationOfLowWorkHeadersSync(Peer& peer, CNode& pfrom,
     631                 :            :             std::vector<CBlockHeader>& headers)
     632                 :            :         EXCLUSIVE_LOCKS_REQUIRED(peer.m_headers_sync_mutex, !m_headers_presync_mutex, g_msgproc_mutex);
     633                 :            :     /** Check work on a headers chain to be processed, and if insufficient,
     634                 :            :      * initiate our anti-DoS headers sync mechanism.
     635                 :            :      *
     636                 :            :      * @param[in]   peer                The peer whose headers we're processing.
     637                 :            :      * @param[in]   pfrom               CNode of the peer
     638                 :            :      * @param[in]   chain_start_header  Where these headers connect in our index.
     639                 :            :      * @param[in,out]   headers             The headers to be processed.
     640                 :            :      *
     641                 :            :      * @return      True if chain was low work (headers will be empty after
     642                 :            :      *              calling); false otherwise.
     643                 :            :      */
     644                 :            :     bool TryLowWorkHeadersSync(Peer& peer, CNode& pfrom,
     645                 :            :                                   const CBlockIndex* chain_start_header,
     646                 :            :                                   std::vector<CBlockHeader>& headers)
     647                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!peer.m_headers_sync_mutex, !m_peer_mutex, !m_headers_presync_mutex, g_msgproc_mutex);
     648                 :            : 
     649                 :            :     /** Return true if the given header is an ancestor of
     650                 :            :      *  m_chainman.m_best_header or our current tip */
     651                 :            :     bool IsAncestorOfBestHeaderOrTip(const CBlockIndex* header) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     652                 :            : 
     653                 :            :     /** Request further headers from this peer with a given locator.
     654                 :            :      * We don't issue a getheaders message if we have a recent one outstanding.
     655                 :            :      * This returns true if a getheaders is actually sent, and false otherwise.
     656                 :            :      */
     657                 :            :     bool MaybeSendGetHeaders(CNode& pfrom, const CBlockLocator& locator, Peer& peer) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
     658                 :            :     /** Potentially fetch blocks from this peer upon receipt of a new headers tip */
     659                 :            :     void HeadersDirectFetchBlocks(CNode& pfrom, const Peer& peer, const CBlockIndex& last_header);
     660                 :            :     /** Update peer state based on received headers message */
     661                 :            :     void UpdatePeerStateForReceivedHeaders(CNode& pfrom, Peer& peer, const CBlockIndex& last_header, bool received_new_header, bool may_have_more_headers)
     662                 :            :         EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
     663                 :            : 
     664                 :            :     void SendBlockTransactions(CNode& pfrom, Peer& peer, const CBlock& block, const BlockTransactionsRequest& req);
     665                 :            : 
     666                 :            :     /** Register with TxRequestTracker that an INV has been received from a
     667                 :            :      *  peer. The announcement parameters are decided in PeerManager and then
     668                 :            :      *  passed to TxRequestTracker. */
     669                 :            :     void AddTxAnnouncement(const CNode& node, const GenTxid& gtxid, std::chrono::microseconds current_time)
     670                 :            :         EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
     671                 :            : 
     672                 :            :     /** Send a version message to a peer */
     673                 :            :     void PushNodeVersion(CNode& pnode, const Peer& peer);
     674                 :            : 
     675                 :            :     /** Send a ping message every PING_INTERVAL or if requested via RPC. May
     676                 :            :      *  mark the peer to be disconnected if a ping has timed out.
     677                 :            :      *  We use mockable time for ping timeouts, so setmocktime may cause pings
     678                 :            :      *  to time out. */
     679                 :            :     void MaybeSendPing(CNode& node_to, Peer& peer, std::chrono::microseconds now);
     680                 :            : 
     681                 :            :     /** Send `addr` messages on a regular schedule. */
     682                 :            :     void MaybeSendAddr(CNode& node, Peer& peer, std::chrono::microseconds current_time) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
     683                 :            : 
     684                 :            :     /** Send a single `sendheaders` message, after we have completed headers sync with a peer. */
     685                 :            :     void MaybeSendSendHeaders(CNode& node, Peer& peer) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
     686                 :            : 
     687                 :            :     /** Relay (gossip) an address to a few randomly chosen nodes.
     688                 :            :      *
     689                 :            :      * @param[in] originator   The id of the peer that sent us the address. We don't want to relay it back.
     690                 :            :      * @param[in] addr         Address to relay.
     691                 :            :      * @param[in] fReachable   Whether the address' network is reachable. We relay unreachable
     692                 :            :      *                         addresses less.
     693                 :            :      */
     694                 :            :     void RelayAddress(NodeId originator, const CAddress& addr, bool fReachable) EXCLUSIVE_LOCKS_REQUIRED(!m_peer_mutex, g_msgproc_mutex);
     695                 :            : 
     696                 :            :     /** Send `feefilter` message. */
     697                 :            :     void MaybeSendFeefilter(CNode& node, Peer& peer, std::chrono::microseconds current_time) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
     698                 :            : 
     699                 :            :     FastRandomContext m_rng GUARDED_BY(NetEventsInterface::g_msgproc_mutex);
     700                 :            : 
     701                 :            :     FeeFilterRounder m_fee_filter_rounder GUARDED_BY(NetEventsInterface::g_msgproc_mutex);
     702                 :            : 
     703                 :            :     const CChainParams& m_chainparams;
     704                 :            :     CConnman& m_connman;
     705                 :            :     AddrMan& m_addrman;
     706                 :            :     /** Pointer to this node's banman. May be nullptr - check existence before dereferencing. */
     707                 :            :     BanMan* const m_banman;
     708                 :            :     ChainstateManager& m_chainman;
     709                 :            :     CTxMemPool& m_mempool;
     710                 :            :     TxRequestTracker m_txrequest GUARDED_BY(::cs_main);
     711                 :            :     std::unique_ptr<TxReconciliationTracker> m_txreconciliation;
     712                 :            : 
     713                 :            :     /** The height of the best chain */
     714                 :          1 :     std::atomic<int> m_best_height{-1};
     715                 :            : 
     716                 :            :     /** Next time to check for stale tip */
     717         [ +  - ]:          1 :     std::chrono::seconds m_stale_tip_check_time GUARDED_BY(cs_main){0s};
     718                 :            : 
     719                 :            :     const Options m_opts;
     720                 :            : 
     721                 :            :     bool RejectIncomingTxs(const CNode& peer) const;
     722                 :            : 
     723                 :            :     /** Whether we've completed initial sync yet, for determining when to turn
     724                 :            :       * on extra block-relay-only peers. */
     725                 :          1 :     bool m_initial_sync_finished GUARDED_BY(cs_main){false};
     726                 :            : 
     727                 :            :     /** Protects m_peer_map. This mutex must not be locked while holding a lock
     728                 :            :      *  on any of the mutexes inside a Peer object. */
     729                 :            :     mutable Mutex m_peer_mutex;
     730                 :            :     /**
     731                 :            :      * Map of all Peer objects, keyed by peer id. This map is protected
     732                 :            :      * by the m_peer_mutex. Once a shared pointer reference is
     733                 :            :      * taken, the lock may be released. Individual fields are protected by
     734                 :            :      * their own locks.
     735                 :            :      */
     736                 :            :     std::map<NodeId, PeerRef> m_peer_map GUARDED_BY(m_peer_mutex);
     737                 :            : 
     738                 :            :     /** Map maintaining per-node state. */
     739                 :            :     std::map<NodeId, CNodeState> m_node_states GUARDED_BY(cs_main);
     740                 :            : 
     741                 :            :     /** Get a pointer to a const CNodeState, used when not mutating the CNodeState object. */
     742                 :            :     const CNodeState* State(NodeId pnode) const EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     743                 :            :     /** Get a pointer to a mutable CNodeState. */
     744                 :            :     CNodeState* State(NodeId pnode) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     745                 :            : 
     746                 :            :     uint32_t GetFetchFlags(const Peer& peer) const;
     747                 :            : 
     748         [ +  - ]:          1 :     std::atomic<std::chrono::microseconds> m_next_inv_to_inbounds{0us};
     749                 :            : 
     750                 :            :     /** Number of nodes with fSyncStarted. */
     751                 :          1 :     int nSyncStarted GUARDED_BY(cs_main) = 0;
     752                 :            : 
     753                 :            :     /** Hash of the last block we received via INV */
     754         [ +  - ]:          1 :     uint256 m_last_block_inv_triggering_headers_sync GUARDED_BY(g_msgproc_mutex){};
     755                 :            : 
     756                 :            :     /**
     757                 :            :      * Sources of received blocks, saved to be able punish them when processing
     758                 :            :      * happens afterwards.
     759                 :            :      * Set mapBlockSource[hash].second to false if the node should not be
     760                 :            :      * punished if the block is invalid.
     761                 :            :      */
     762                 :            :     std::map<uint256, std::pair<NodeId, bool>> mapBlockSource GUARDED_BY(cs_main);
     763                 :            : 
     764                 :            :     /** Number of peers with wtxid relay. */
     765                 :          1 :     std::atomic<int> m_wtxid_relay_peers{0};
     766                 :            : 
     767                 :            :     /** Number of outbound peers with m_chain_sync.m_protect. */
     768                 :          1 :     int m_outbound_peers_with_protect_from_disconnect GUARDED_BY(cs_main) = 0;
     769                 :            : 
     770                 :            :     /** Number of preferable block download peers. */
     771                 :          1 :     int m_num_preferred_download_peers GUARDED_BY(cs_main){0};
     772                 :            : 
     773                 :            :     /** Stalling timeout for blocks in IBD */
     774                 :          1 :     std::atomic<std::chrono::seconds> m_block_stalling_timeout{BLOCK_STALLING_TIMEOUT_DEFAULT};
     775                 :            : 
     776                 :            :     bool AlreadyHaveTx(const GenTxid& gtxid)
     777                 :            :         EXCLUSIVE_LOCKS_REQUIRED(cs_main, !m_recent_confirmed_transactions_mutex);
     778                 :            : 
     779                 :            :     /**
     780                 :            :      * Filter for transactions that were recently rejected by the mempool.
     781                 :            :      * These are not rerequested until the chain tip changes, at which point
     782                 :            :      * the entire filter is reset.
     783                 :            :      *
     784                 :            :      * Without this filter we'd be re-requesting txs from each of our peers,
     785                 :            :      * increasing bandwidth consumption considerably. For instance, with 100
     786                 :            :      * peers, half of which relay a tx we don't accept, that might be a 50x
     787                 :            :      * bandwidth increase. A flooding attacker attempting to roll-over the
     788                 :            :      * filter using minimum-sized, 60byte, transactions might manage to send
     789                 :            :      * 1000/sec if we have fast peers, so we pick 120,000 to give our peers a
     790                 :            :      * two minute window to send invs to us.
     791                 :            :      *
     792                 :            :      * Decreasing the false positive rate is fairly cheap, so we pick one in a
     793                 :            :      * million to make it highly unlikely for users to have issues with this
     794                 :            :      * filter.
     795                 :            :      *
     796                 :            :      * We typically only add wtxids to this filter. For non-segwit
     797                 :            :      * transactions, the txid == wtxid, so this only prevents us from
     798                 :            :      * re-downloading non-segwit transactions when communicating with
     799                 :            :      * non-wtxidrelay peers -- which is important for avoiding malleation
     800                 :            :      * attacks that could otherwise interfere with transaction relay from
     801                 :            :      * non-wtxidrelay peers. For communicating with wtxidrelay peers, having
     802                 :            :      * the reject filter store wtxids is exactly what we want to avoid
     803                 :            :      * redownload of a rejected transaction.
     804                 :            :      *
     805                 :            :      * In cases where we can tell that a segwit transaction will fail
     806                 :            :      * validation no matter the witness, we may add the txid of such
     807                 :            :      * transaction to the filter as well. This can be helpful when
     808                 :            :      * communicating with txid-relay peers or if we were to otherwise fetch a
     809                 :            :      * transaction via txid (eg in our orphan handling).
     810                 :            :      *
     811                 :            :      * Memory used: 1.3 MB
     812                 :            :      */
     813         [ +  - ]:          1 :     CRollingBloomFilter m_recent_rejects GUARDED_BY(::cs_main){120'000, 0.000'001};
     814                 :            :     uint256 hashRecentRejectsChainTip GUARDED_BY(cs_main);
     815                 :            : 
     816                 :            :     /*
     817                 :            :      * Filter for transactions that have been recently confirmed.
     818                 :            :      * We use this to avoid requesting transactions that have already been
     819                 :            :      * confirnmed.
     820                 :            :      *
     821                 :            :      * Blocks don't typically have more than 4000 transactions, so this should
     822                 :            :      * be at least six blocks (~1 hr) worth of transactions that we can store,
     823                 :            :      * inserting both a txid and wtxid for every observed transaction.
     824                 :            :      * If the number of transactions appearing in a block goes up, or if we are
     825                 :            :      * seeing getdata requests more than an hour after initial announcement, we
     826                 :            :      * can increase this number.
     827                 :            :      * The false positive rate of 1/1M should come out to less than 1
     828                 :            :      * transaction per day that would be inadvertently ignored (which is the
     829                 :            :      * same probability that we have in the reject filter).
     830                 :            :      */
     831                 :            :     Mutex m_recent_confirmed_transactions_mutex;
     832         [ +  - ]:          1 :     CRollingBloomFilter m_recent_confirmed_transactions GUARDED_BY(m_recent_confirmed_transactions_mutex){48'000, 0.000'001};
     833                 :            : 
     834                 :            :     /**
     835                 :            :      * For sending `inv`s to inbound peers, we use a single (exponentially
     836                 :            :      * distributed) timer for all peers. If we used a separate timer for each
     837                 :            :      * peer, a spy node could make multiple inbound connections to us to
     838                 :            :      * accurately determine when we received the transaction (and potentially
     839                 :            :      * determine the transaction's origin). */
     840                 :            :     std::chrono::microseconds NextInvToInbounds(std::chrono::microseconds now,
     841                 :            :                                                 std::chrono::seconds average_interval);
     842                 :            : 
     843                 :            : 
     844                 :            :     // All of the following cache a recent block, and are protected by m_most_recent_block_mutex
     845                 :            :     Mutex m_most_recent_block_mutex;
     846                 :            :     std::shared_ptr<const CBlock> m_most_recent_block GUARDED_BY(m_most_recent_block_mutex);
     847                 :            :     std::shared_ptr<const CBlockHeaderAndShortTxIDs> m_most_recent_compact_block GUARDED_BY(m_most_recent_block_mutex);
     848                 :            :     uint256 m_most_recent_block_hash GUARDED_BY(m_most_recent_block_mutex);
     849                 :            :     std::unique_ptr<const std::map<uint256, CTransactionRef>> m_most_recent_block_txs GUARDED_BY(m_most_recent_block_mutex);
     850                 :            : 
     851                 :            :     // Data about the low-work headers synchronization, aggregated from all peers' HeadersSyncStates.
     852                 :            :     /** Mutex guarding the other m_headers_presync_* variables. */
     853                 :            :     Mutex m_headers_presync_mutex;
     854                 :            :     /** A type to represent statistics about a peer's low-work headers sync.
     855                 :            :      *
     856                 :            :      * - The first field is the total verified amount of work in that synchronization.
     857                 :            :      * - The second is:
     858                 :            :      *   - nullopt: the sync is in REDOWNLOAD phase (phase 2).
     859                 :            :      *   - {height, timestamp}: the sync has the specified tip height and block timestamp (phase 1).
     860                 :            :      */
     861                 :            :     using HeadersPresyncStats = std::pair<arith_uint256, std::optional<std::pair<int64_t, uint32_t>>>;
     862                 :            :     /** Statistics for all peers in low-work headers sync. */
     863                 :          1 :     std::map<NodeId, HeadersPresyncStats> m_headers_presync_stats GUARDED_BY(m_headers_presync_mutex) {};
     864                 :            :     /** The peer with the most-work entry in m_headers_presync_stats. */
     865                 :          1 :     NodeId m_headers_presync_bestpeer GUARDED_BY(m_headers_presync_mutex) {-1};
     866                 :            :     /** The m_headers_presync_stats improved, and needs signalling. */
     867                 :          1 :     std::atomic_bool m_headers_presync_should_signal{false};
     868                 :            : 
     869                 :            :     /** Height of the highest block announced using BIP 152 high-bandwidth mode. */
     870                 :          1 :     int m_highest_fast_announce GUARDED_BY(::cs_main){0};
     871                 :            : 
     872                 :            :     /** Have we requested this block from a peer */
     873                 :            :     bool IsBlockRequested(const uint256& hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     874                 :            : 
     875                 :            :     /** Have we requested this block from an outbound peer */
     876                 :            :     bool IsBlockRequestedFromOutbound(const uint256& hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     877                 :            : 
     878                 :            :     /** Remove this block from our tracked requested blocks. Called if:
     879                 :            :      *  - the block has been received from a peer
     880                 :            :      *  - the request for the block has timed out
     881                 :            :      * If "from_peer" is specified, then only remove the block if it is in
     882                 :            :      * flight from that peer (to avoid one peer's network traffic from
     883                 :            :      * affecting another's state).
     884                 :            :      */
     885                 :            :     void RemoveBlockRequest(const uint256& hash, std::optional<NodeId> from_peer) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     886                 :            : 
     887                 :            :     /* Mark a block as in flight
     888                 :            :      * Returns false, still setting pit, if the block was already in flight from the same peer
     889                 :            :      * pit will only be valid as long as the same cs_main lock is being held
     890                 :            :      */
     891                 :            :     bool BlockRequested(NodeId nodeid, const CBlockIndex& block, std::list<QueuedBlock>::iterator** pit = nullptr) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     892                 :            : 
     893                 :            :     bool TipMayBeStale() EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     894                 :            : 
     895                 :            :     /** Update pindexLastCommonBlock and add not-in-flight missing successors to vBlocks, until it has
     896                 :            :      *  at most count entries.
     897                 :            :      */
     898                 :            :     void FindNextBlocksToDownload(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, NodeId& nodeStaller) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     899                 :            : 
     900                 :            :     /** Request blocks for the background chainstate, if one is in use. */
     901                 :            :     void TryDownloadingHistoricalBlocks(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, const CBlockIndex* from_tip, const CBlockIndex* target_block) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     902                 :            : 
     903                 :            :     /**
     904                 :            :     * \brief Find next blocks to download from a peer after a starting block.
     905                 :            :     *
     906                 :            :     * \param vBlocks      Vector of blocks to download which will be appended to.
     907                 :            :     * \param peer         Peer which blocks will be downloaded from.
     908                 :            :     * \param state        Pointer to the state of the peer.
     909                 :            :     * \param pindexWalk   Pointer to the starting block to add to vBlocks.
     910                 :            :     * \param count        Maximum number of blocks to allow in vBlocks. No more
     911                 :            :     *                     blocks will be added if it reaches this size.
     912                 :            :     * \param nWindowEnd   Maximum height of blocks to allow in vBlocks. No
     913                 :            :     *                     blocks will be added above this height.
     914                 :            :     * \param activeChain  Optional pointer to a chain to compare against. If
     915                 :            :     *                     provided, any next blocks which are already contained
     916                 :            :     *                     in this chain will not be appended to vBlocks, but
     917                 :            :     *                     instead will be used to update the
     918                 :            :     *                     state->pindexLastCommonBlock pointer.
     919                 :            :     * \param nodeStaller  Optional pointer to a NodeId variable that will receive
     920                 :            :     *                     the ID of another peer that might be causing this peer
     921                 :            :     *                     to stall. This is set to the ID of the peer which
     922                 :            :     *                     first requested the first in-flight block in the
     923                 :            :     *                     download window. It is only set if vBlocks is empty at
     924                 :            :     *                     the end of this function call and if increasing
     925                 :            :     *                     nWindowEnd by 1 would cause it to be non-empty (which
     926                 :            :     *                     indicates the download might be stalled because every
     927                 :            :     *                     block in the window is in flight and no other peer is
     928                 :            :     *                     trying to download the next block).
     929                 :            :     */
     930                 :            :     void FindNextBlocks(std::vector<const CBlockIndex*>& vBlocks, const Peer& peer, CNodeState *state, const CBlockIndex *pindexWalk, unsigned int count, int nWindowEnd, const CChain* activeChain=nullptr, NodeId* nodeStaller=nullptr) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     931                 :            : 
     932                 :            :     /* Multimap used to preserve insertion order */
     933                 :            :     typedef std::multimap<uint256, std::pair<NodeId, std::list<QueuedBlock>::iterator>> BlockDownloadMap;
     934                 :            :     BlockDownloadMap mapBlocksInFlight GUARDED_BY(cs_main);
     935                 :            : 
     936                 :            :     /** When our tip was last updated. */
     937         [ +  - ]:          1 :     std::atomic<std::chrono::seconds> m_last_tip_update{0s};
     938                 :            : 
     939                 :            :     /** Determine whether or not a peer can request a transaction, and return it (or nullptr if not found or not allowed). */
     940                 :            :     CTransactionRef FindTxForGetData(const Peer::TxRelay& tx_relay, const GenTxid& gtxid)
     941                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_most_recent_block_mutex, NetEventsInterface::g_msgproc_mutex);
     942                 :            : 
     943                 :            :     void ProcessGetData(CNode& pfrom, Peer& peer, const std::atomic<bool>& interruptMsgProc)
     944                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_most_recent_block_mutex, peer.m_getdata_requests_mutex, NetEventsInterface::g_msgproc_mutex)
     945                 :            :         LOCKS_EXCLUDED(::cs_main);
     946                 :            : 
     947                 :            :     /** Process a new block. Perform any post-processing housekeeping */
     948                 :            :     void ProcessBlock(CNode& node, const std::shared_ptr<const CBlock>& block, bool force_processing, bool min_pow_checked);
     949                 :            : 
     950                 :            :     /** Process compact block txns  */
     951                 :            :     void ProcessCompactBlockTxns(CNode& pfrom, Peer& peer, const BlockTransactions& block_transactions)
     952                 :            :         EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex, !m_most_recent_block_mutex);
     953                 :            : 
     954                 :            :     /**
     955                 :            :      * When a peer sends us a valid block, instruct it to announce blocks to us
     956                 :            :      * using CMPCTBLOCK if possible by adding its nodeid to the end of
     957                 :            :      * lNodesAnnouncingHeaderAndIDs, and keeping that list under a certain size by
     958                 :            :      * removing the first element if necessary.
     959                 :            :      */
     960                 :            :     void MaybeSetPeerAsAnnouncingHeaderAndIDs(NodeId nodeid) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     961                 :            : 
     962                 :            :     /** Stack of nodes which we have set to announce using compact blocks */
     963                 :            :     std::list<NodeId> lNodesAnnouncingHeaderAndIDs GUARDED_BY(cs_main);
     964                 :            : 
     965                 :            :     /** Number of peers from which we're downloading blocks. */
     966                 :          1 :     int m_peers_downloading_from GUARDED_BY(cs_main) = 0;
     967                 :            : 
     968                 :            :     /** Storage for orphan information */
     969                 :            :     TxOrphanage m_orphanage;
     970                 :            : 
     971                 :            :     void AddToCompactExtraTransactions(const CTransactionRef& tx) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
     972                 :            : 
     973                 :            :     /** Orphan/conflicted/etc transactions that are kept for compact block reconstruction.
     974                 :            :      *  The last -blockreconstructionextratxn/DEFAULT_BLOCK_RECONSTRUCTION_EXTRA_TXN of
     975                 :            :      *  these are kept in a ring buffer */
     976                 :            :     std::vector<std::pair<uint256, CTransactionRef>> vExtraTxnForCompact GUARDED_BY(g_msgproc_mutex);
     977                 :            :     /** Offset into vExtraTxnForCompact to insert the next tx */
     978                 :          1 :     size_t vExtraTxnForCompactIt GUARDED_BY(g_msgproc_mutex) = 0;
     979                 :            : 
     980                 :            :     /** Check whether the last unknown block a peer advertised is not yet known. */
     981                 :            :     void ProcessBlockAvailability(NodeId nodeid) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     982                 :            :     /** Update tracking information about which blocks a peer is assumed to have. */
     983                 :            :     void UpdateBlockAvailability(NodeId nodeid, const uint256& hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     984                 :            :     bool CanDirectFetch() EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     985                 :            : 
     986                 :            :     /**
     987                 :            :      * To prevent fingerprinting attacks, only send blocks/headers outside of
     988                 :            :      * the active chain if they are no more than a month older (both in time,
     989                 :            :      * and in best equivalent proof of work) than the best header chain we know
     990                 :            :      * about and we fully-validated them at some point.
     991                 :            :      */
     992                 :            :     bool BlockRequestAllowed(const CBlockIndex* pindex) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     993                 :            :     bool AlreadyHaveBlock(const uint256& block_hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
     994                 :            :     void ProcessGetBlockData(CNode& pfrom, Peer& peer, const CInv& inv)
     995                 :            :         EXCLUSIVE_LOCKS_REQUIRED(!m_most_recent_block_mutex);
     996                 :            : 
     997                 :            :     /**
     998                 :            :      * Validation logic for compact filters request handling.
     999                 :            :      *
    1000                 :            :      * May disconnect from the peer in the case of a bad request.
    1001                 :            :      *
    1002                 :            :      * @param[in]   node            The node that we received the request from
    1003                 :            :      * @param[in]   peer            The peer that we received the request from
    1004                 :            :      * @param[in]   filter_type     The filter type the request is for. Must be basic filters.
    1005                 :            :      * @param[in]   start_height    The start height for the request
    1006                 :            :      * @param[in]   stop_hash       The stop_hash for the request
    1007                 :            :      * @param[in]   max_height_diff The maximum number of items permitted to request, as specified in BIP 157
    1008                 :            :      * @param[out]  stop_index      The CBlockIndex for the stop_hash block, if the request can be serviced.
    1009                 :            :      * @param[out]  filter_index    The filter index, if the request can be serviced.
    1010                 :            :      * @return                      True if the request can be serviced.
    1011                 :            :      */
    1012                 :            :     bool PrepareBlockFilterRequest(CNode& node, Peer& peer,
    1013                 :            :                                    BlockFilterType filter_type, uint32_t start_height,
    1014                 :            :                                    const uint256& stop_hash, uint32_t max_height_diff,
    1015                 :            :                                    const CBlockIndex*& stop_index,
    1016                 :            :                                    BlockFilterIndex*& filter_index);
    1017                 :            : 
    1018                 :            :     /**
    1019                 :            :      * Handle a cfilters request.
    1020                 :            :      *
    1021                 :            :      * May disconnect from the peer in the case of a bad request.
    1022                 :            :      *
    1023                 :            :      * @param[in]   node            The node that we received the request from
    1024                 :            :      * @param[in]   peer            The peer that we received the request from
    1025                 :            :      * @param[in]   vRecv           The raw message received
    1026                 :            :      */
    1027                 :            :     void ProcessGetCFilters(CNode& node, Peer& peer, CDataStream& vRecv);
    1028                 :            : 
    1029                 :            :     /**
    1030                 :            :      * Handle a cfheaders request.
    1031                 :            :      *
    1032                 :            :      * May disconnect from the peer in the case of a bad request.
    1033                 :            :      *
    1034                 :            :      * @param[in]   node            The node that we received the request from
    1035                 :            :      * @param[in]   peer            The peer that we received the request from
    1036                 :            :      * @param[in]   vRecv           The raw message received
    1037                 :            :      */
    1038                 :            :     void ProcessGetCFHeaders(CNode& node, Peer& peer, CDataStream& vRecv);
    1039                 :            : 
    1040                 :            :     /**
    1041                 :            :      * Handle a getcfcheckpt request.
    1042                 :            :      *
    1043                 :            :      * May disconnect from the peer in the case of a bad request.
    1044                 :            :      *
    1045                 :            :      * @param[in]   node            The node that we received the request from
    1046                 :            :      * @param[in]   peer            The peer that we received the request from
    1047                 :            :      * @param[in]   vRecv           The raw message received
    1048                 :            :      */
    1049                 :            :     void ProcessGetCFCheckPt(CNode& node, Peer& peer, CDataStream& vRecv);
    1050                 :            : 
    1051                 :            :     /** Checks if address relay is permitted with peer. If needed, initializes
    1052                 :            :      * the m_addr_known bloom filter and sets m_addr_relay_enabled to true.
    1053                 :            :      *
    1054                 :            :      *  @return   True if address relay is enabled with peer
    1055                 :            :      *            False if address relay is disallowed
    1056                 :            :      */
    1057                 :            :     bool SetupAddressRelay(const CNode& node, Peer& peer) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
    1058                 :            : 
    1059                 :            :     void AddAddressKnown(Peer& peer, const CAddress& addr) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
    1060                 :            :     void PushAddress(Peer& peer, const CAddress& addr) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex);
    1061                 :            : };
    1062                 :            : 
    1063                 :          0 : const CNodeState* PeerManagerImpl::State(NodeId pnode) const EXCLUSIVE_LOCKS_REQUIRED(cs_main)
    1064                 :            : {
    1065                 :          0 :     std::map<NodeId, CNodeState>::const_iterator it = m_node_states.find(pnode);
    1066         [ #  # ]:          0 :     if (it == m_node_states.end())
    1067                 :          0 :         return nullptr;
    1068                 :          0 :     return &it->second;
    1069                 :          0 : }
    1070                 :            : 
    1071                 :          0 : CNodeState* PeerManagerImpl::State(NodeId pnode) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
    1072                 :            : {
    1073                 :          0 :     return const_cast<CNodeState*>(std::as_const(*this).State(pnode));
    1074                 :            : }
    1075                 :            : 
    1076                 :            : /**
    1077                 :            :  * Whether the peer supports the address. For example, a peer that does not
    1078                 :            :  * implement BIP155 cannot receive Tor v3 addresses because it requires
    1079                 :            :  * ADDRv2 (BIP155) encoding.
    1080                 :            :  */
    1081                 :          0 : static bool IsAddrCompatible(const Peer& peer, const CAddress& addr)
    1082                 :            : {
    1083         [ #  # ]:          0 :     return peer.m_wants_addrv2 || addr.IsAddrV1Compatible();
    1084                 :            : }
    1085                 :            : 
    1086                 :          0 : void PeerManagerImpl::AddAddressKnown(Peer& peer, const CAddress& addr)
    1087                 :            : {
    1088         [ #  # ]:          0 :     assert(peer.m_addr_known);
    1089 [ #  # ][ #  # ]:          0 :     peer.m_addr_known->insert(addr.GetKey());
    1090                 :          0 : }
    1091                 :            : 
    1092                 :          0 : void PeerManagerImpl::PushAddress(Peer& peer, const CAddress& addr)
    1093                 :            : {
    1094                 :            :     // Known checking here is only to save space from duplicates.
    1095                 :            :     // Before sending, we'll filter it again for known addresses that were
    1096                 :            :     // added after addresses were pushed.
    1097         [ #  # ]:          0 :     assert(peer.m_addr_known);
    1098 [ #  # ][ #  # ]:          0 :     if (addr.IsValid() && !peer.m_addr_known->contains(addr.GetKey()) && IsAddrCompatible(peer, addr)) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    1099         [ #  # ]:          0 :         if (peer.m_addrs_to_send.size() >= MAX_ADDR_TO_SEND) {
    1100                 :          0 :             peer.m_addrs_to_send[m_rng.randrange(peer.m_addrs_to_send.size())] = addr;
    1101                 :          0 :         } else {
    1102                 :          0 :             peer.m_addrs_to_send.push_back(addr);
    1103                 :            :         }
    1104                 :          0 :     }
    1105                 :          0 : }
    1106                 :            : 
    1107                 :          0 : static void AddKnownTx(Peer& peer, const uint256& hash)
    1108                 :            : {
    1109                 :          0 :     auto tx_relay = peer.GetTxRelay();
    1110         [ #  # ]:          0 :     if (!tx_relay) return;
    1111                 :            : 
    1112                 :          0 :     LOCK(tx_relay->m_tx_inventory_mutex);
    1113 [ #  # ][ #  # ]:          0 :     tx_relay->m_tx_inventory_known_filter.insert(hash);
    1114                 :          0 : }
    1115                 :            : 
    1116                 :            : /** Whether this peer can serve us blocks. */
    1117                 :          0 : static bool CanServeBlocks(const Peer& peer)
    1118                 :            : {
    1119                 :          0 :     return peer.m_their_services & (NODE_NETWORK|NODE_NETWORK_LIMITED);
    1120                 :            : }
    1121                 :            : 
    1122                 :            : /** Whether this peer can only serve limited recent blocks (e.g. because
    1123                 :            :  *  it prunes old blocks) */
    1124                 :          0 : static bool IsLimitedPeer(const Peer& peer)
    1125                 :            : {
    1126         [ #  # ]:          0 :     return (!(peer.m_their_services & NODE_NETWORK) &&
    1127                 :          0 :              (peer.m_their_services & NODE_NETWORK_LIMITED));
    1128                 :            : }
    1129                 :            : 
    1130                 :            : /** Whether this peer can serve us witness data */
    1131                 :          0 : static bool CanServeWitnesses(const Peer& peer)
    1132                 :            : {
    1133                 :          0 :     return peer.m_their_services & NODE_WITNESS;
    1134                 :            : }
    1135                 :            : 
    1136                 :          0 : std::chrono::microseconds PeerManagerImpl::NextInvToInbounds(std::chrono::microseconds now,
    1137                 :            :                                                              std::chrono::seconds average_interval)
    1138                 :            : {
    1139         [ #  # ]:          0 :     if (m_next_inv_to_inbounds.load() < now) {
    1140                 :            :         // If this function were called from multiple threads simultaneously
    1141                 :            :         // it would possible that both update the next send variable, and return a different result to their caller.
    1142                 :            :         // This is not possible in practice as only the net processing thread invokes this function.
    1143                 :          0 :         m_next_inv_to_inbounds = GetExponentialRand(now, average_interval);
    1144                 :          0 :     }
    1145                 :          0 :     return m_next_inv_to_inbounds;
    1146                 :            : }
    1147                 :            : 
    1148                 :          0 : bool PeerManagerImpl::IsBlockRequested(const uint256& hash)
    1149                 :            : {
    1150                 :          0 :     return mapBlocksInFlight.count(hash);
    1151                 :            : }
    1152                 :            : 
    1153                 :          0 : bool PeerManagerImpl::IsBlockRequestedFromOutbound(const uint256& hash)
    1154                 :            : {
    1155         [ #  # ]:          0 :     for (auto range = mapBlocksInFlight.equal_range(hash); range.first != range.second; range.first++) {
    1156                 :          0 :         auto [nodeid, block_it] = range.first->second;
    1157                 :          0 :         CNodeState& nodestate = *Assert(State(nodeid));
    1158         [ #  # ]:          0 :         if (!nodestate.m_is_inbound) return true;
    1159                 :          0 :     }
    1160                 :            : 
    1161                 :          0 :     return false;
    1162                 :          0 : }
    1163                 :            : 
    1164                 :          0 : void PeerManagerImpl::RemoveBlockRequest(const uint256& hash, std::optional<NodeId> from_peer)
    1165                 :            : {
    1166                 :          0 :     auto range = mapBlocksInFlight.equal_range(hash);
    1167         [ #  # ]:          0 :     if (range.first == range.second) {
    1168                 :            :         // Block was not requested from any peer
    1169                 :          0 :         return;
    1170                 :            :     }
    1171                 :            : 
    1172                 :            :     // We should not have requested too many of this block
    1173                 :          0 :     Assume(mapBlocksInFlight.count(hash) <= MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK);
    1174                 :            : 
    1175         [ #  # ]:          0 :     while (range.first != range.second) {
    1176                 :          0 :         auto [node_id, list_it] = range.first->second;
    1177                 :            : 
    1178 [ #  # ][ #  # ]:          0 :         if (from_peer && *from_peer != node_id) {
                 [ #  # ]
    1179                 :          0 :             range.first++;
    1180                 :          0 :             continue;
    1181                 :            :         }
    1182                 :            : 
    1183                 :          0 :         CNodeState& state = *Assert(State(node_id));
    1184                 :            : 
    1185 [ #  # ][ #  # ]:          0 :         if (state.vBlocksInFlight.begin() == list_it) {
    1186                 :            :             // First block on the queue was received, update the start download time for the next one
    1187                 :          0 :             state.m_downloading_since = std::max(state.m_downloading_since, GetTime<std::chrono::microseconds>());
    1188                 :          0 :         }
    1189                 :          0 :         state.vBlocksInFlight.erase(list_it);
    1190                 :            : 
    1191         [ #  # ]:          0 :         if (state.vBlocksInFlight.empty()) {
    1192                 :            :             // Last validated block on the queue for this peer was received.
    1193                 :          0 :             m_peers_downloading_from--;
    1194                 :          0 :         }
    1195                 :          0 :         state.m_stalling_since = 0us;
    1196                 :            : 
    1197                 :          0 :         range.first = mapBlocksInFlight.erase(range.first);
    1198                 :            :     }
    1199                 :          0 : }
    1200                 :            : 
    1201                 :          0 : bool PeerManagerImpl::BlockRequested(NodeId nodeid, const CBlockIndex& block, std::list<QueuedBlock>::iterator** pit)
    1202                 :            : {
    1203                 :          0 :     const uint256& hash{block.GetBlockHash()};
    1204                 :            : 
    1205                 :          0 :     CNodeState *state = State(nodeid);
    1206         [ #  # ]:          0 :     assert(state != nullptr);
    1207                 :            : 
    1208                 :          0 :     Assume(mapBlocksInFlight.count(hash) <= MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK);
    1209                 :            : 
    1210                 :            :     // Short-circuit most stuff in case it is from the same node
    1211         [ #  # ]:          0 :     for (auto range = mapBlocksInFlight.equal_range(hash); range.first != range.second; range.first++) {
    1212         [ #  # ]:          0 :         if (range.first->second.first == nodeid) {
    1213         [ #  # ]:          0 :             if (pit) {
    1214                 :          0 :                 *pit = &range.first->second.second;
    1215                 :          0 :             }
    1216                 :          0 :             return false;
    1217                 :            :         }
    1218                 :          0 :     }
    1219                 :            : 
    1220                 :            :     // Make sure it's not being fetched already from same peer.
    1221                 :          0 :     RemoveBlockRequest(hash, nodeid);
    1222                 :            : 
    1223         [ #  # ]:          0 :     std::list<QueuedBlock>::iterator it = state->vBlocksInFlight.insert(state->vBlocksInFlight.end(),
    1224 [ #  # ][ #  # ]:          0 :             {&block, std::unique_ptr<PartiallyDownloadedBlock>(pit ? new PartiallyDownloadedBlock(&m_mempool) : nullptr)});
                 [ #  # ]
    1225         [ #  # ]:          0 :     if (state->vBlocksInFlight.size() == 1) {
    1226                 :            :         // We're starting a block download (batch) from this peer.
    1227                 :          0 :         state->m_downloading_since = GetTime<std::chrono::microseconds>();
    1228                 :          0 :         m_peers_downloading_from++;
    1229                 :          0 :     }
    1230                 :          0 :     auto itInFlight = mapBlocksInFlight.insert(std::make_pair(hash, std::make_pair(nodeid, it)));
    1231         [ #  # ]:          0 :     if (pit) {
    1232                 :          0 :         *pit = &itInFlight->second.second;
    1233                 :          0 :     }
    1234                 :          0 :     return true;
    1235                 :          0 : }
    1236                 :            : 
    1237                 :          0 : void PeerManagerImpl::MaybeSetPeerAsAnnouncingHeaderAndIDs(NodeId nodeid)
    1238                 :            : {
    1239                 :          0 :     AssertLockHeld(cs_main);
    1240                 :            : 
    1241                 :            :     // When in -blocksonly mode, never request high-bandwidth mode from peers. Our
    1242                 :            :     // mempool will not contain the transactions necessary to reconstruct the
    1243                 :            :     // compact block.
    1244         [ #  # ]:          0 :     if (m_opts.ignore_incoming_txs) return;
    1245                 :            : 
    1246                 :          0 :     CNodeState* nodestate = State(nodeid);
    1247 [ #  # ][ #  # ]:          0 :     if (!nodestate || !nodestate->m_provides_cmpctblocks) {
    1248                 :            :         // Don't request compact blocks if the peer has not signalled support
    1249                 :          0 :         return;
    1250                 :            :     }
    1251                 :            : 
    1252                 :          0 :     int num_outbound_hb_peers = 0;
    1253         [ #  # ]:          0 :     for (std::list<NodeId>::iterator it = lNodesAnnouncingHeaderAndIDs.begin(); it != lNodesAnnouncingHeaderAndIDs.end(); it++) {
    1254         [ #  # ]:          0 :         if (*it == nodeid) {
    1255                 :          0 :             lNodesAnnouncingHeaderAndIDs.erase(it);
    1256                 :          0 :             lNodesAnnouncingHeaderAndIDs.push_back(nodeid);
    1257                 :          0 :             return;
    1258                 :            :         }
    1259                 :          0 :         CNodeState *state = State(*it);
    1260 [ #  # ][ #  # ]:          0 :         if (state != nullptr && !state->m_is_inbound) ++num_outbound_hb_peers;
    1261                 :          0 :     }
    1262         [ #  # ]:          0 :     if (nodestate->m_is_inbound) {
    1263                 :            :         // If we're adding an inbound HB peer, make sure we're not removing
    1264                 :            :         // our last outbound HB peer in the process.
    1265 [ #  # ][ #  # ]:          0 :         if (lNodesAnnouncingHeaderAndIDs.size() >= 3 && num_outbound_hb_peers == 1) {
    1266                 :          0 :             CNodeState *remove_node = State(lNodesAnnouncingHeaderAndIDs.front());
    1267 [ #  # ][ #  # ]:          0 :             if (remove_node != nullptr && !remove_node->m_is_inbound) {
    1268                 :            :                 // Put the HB outbound peer in the second slot, so that it
    1269                 :            :                 // doesn't get removed.
    1270                 :          0 :                 std::swap(lNodesAnnouncingHeaderAndIDs.front(), *std::next(lNodesAnnouncingHeaderAndIDs.begin()));
    1271                 :          0 :             }
    1272                 :          0 :         }
    1273                 :          0 :     }
    1274         [ #  # ]:          0 :     m_connman.ForNode(nodeid, [this](CNode* pfrom) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
    1275                 :          0 :         AssertLockHeld(::cs_main);
    1276         [ #  # ]:          0 :         if (lNodesAnnouncingHeaderAndIDs.size() >= 3) {
    1277                 :            :             // As per BIP152, we only get 3 of our peers to announce
    1278                 :            :             // blocks using compact encodings.
    1279         [ #  # ]:          0 :             m_connman.ForNode(lNodesAnnouncingHeaderAndIDs.front(), [this](CNode* pnodeStop){
    1280 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(pnodeStop, CNetMsgMaker(pnodeStop->GetCommonVersion()).Make(NetMsgType::SENDCMPCT, /*high_bandwidth=*/false, /*version=*/CMPCTBLOCKS_VERSION));
                 [ #  # ]
    1281                 :            :                 // save BIP152 bandwidth state: we select peer to be low-bandwidth
    1282                 :          0 :                 pnodeStop->m_bip152_highbandwidth_to = false;
    1283                 :          0 :                 return true;
    1284                 :          0 :             });
    1285                 :          0 :             lNodesAnnouncingHeaderAndIDs.pop_front();
    1286                 :          0 :         }
    1287 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(pfrom, CNetMsgMaker(pfrom->GetCommonVersion()).Make(NetMsgType::SENDCMPCT, /*high_bandwidth=*/true, /*version=*/CMPCTBLOCKS_VERSION));
                 [ #  # ]
    1288                 :            :         // save BIP152 bandwidth state: we select peer to be high-bandwidth
    1289                 :          0 :         pfrom->m_bip152_highbandwidth_to = true;
    1290                 :          0 :         lNodesAnnouncingHeaderAndIDs.push_back(pfrom->GetId());
    1291                 :          0 :         return true;
    1292                 :          0 :     });
    1293                 :          0 : }
    1294                 :            : 
    1295                 :          0 : bool PeerManagerImpl::TipMayBeStale()
    1296                 :            : {
    1297                 :          0 :     AssertLockHeld(cs_main);
    1298                 :          0 :     const Consensus::Params& consensusParams = m_chainparams.GetConsensus();
    1299         [ #  # ]:          0 :     if (m_last_tip_update.load() == 0s) {
    1300                 :          0 :         m_last_tip_update = GetTime<std::chrono::seconds>();
    1301                 :          0 :     }
    1302         [ #  # ]:          0 :     return m_last_tip_update.load() < GetTime<std::chrono::seconds>() - std::chrono::seconds{consensusParams.nPowTargetSpacing * 3} && mapBlocksInFlight.empty();
    1303                 :            : }
    1304                 :            : 
    1305                 :          0 : bool PeerManagerImpl::CanDirectFetch()
    1306                 :            : {
    1307                 :          0 :     return m_chainman.ActiveChain().Tip()->Time() > GetAdjustedTime() - m_chainparams.GetConsensus().PowTargetSpacing() * 20;
    1308                 :            : }
    1309                 :            : 
    1310                 :          0 : static bool PeerHasHeader(CNodeState *state, const CBlockIndex *pindex) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
    1311                 :            : {
    1312 [ #  # ][ #  # ]:          0 :     if (state->pindexBestKnownBlock && pindex == state->pindexBestKnownBlock->GetAncestor(pindex->nHeight))
    1313                 :          0 :         return true;
    1314 [ #  # ][ #  # ]:          0 :     if (state->pindexBestHeaderSent && pindex == state->pindexBestHeaderSent->GetAncestor(pindex->nHeight))
    1315                 :          0 :         return true;
    1316                 :          0 :     return false;
    1317                 :          0 : }
    1318                 :            : 
    1319                 :          0 : void PeerManagerImpl::ProcessBlockAvailability(NodeId nodeid) {
    1320                 :          0 :     CNodeState *state = State(nodeid);
    1321         [ #  # ]:          0 :     assert(state != nullptr);
    1322                 :            : 
    1323         [ #  # ]:          0 :     if (!state->hashLastUnknownBlock.IsNull()) {
    1324                 :          0 :         const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(state->hashLastUnknownBlock);
    1325 [ #  # ][ #  # ]:          0 :         if (pindex && pindex->nChainWork > 0) {
    1326 [ #  # ][ #  # ]:          0 :             if (state->pindexBestKnownBlock == nullptr || pindex->nChainWork >= state->pindexBestKnownBlock->nChainWork) {
    1327                 :          0 :                 state->pindexBestKnownBlock = pindex;
    1328                 :          0 :             }
    1329                 :          0 :             state->hashLastUnknownBlock.SetNull();
    1330                 :          0 :         }
    1331                 :          0 :     }
    1332                 :          0 : }
    1333                 :            : 
    1334                 :          0 : void PeerManagerImpl::UpdateBlockAvailability(NodeId nodeid, const uint256 &hash) {
    1335                 :          0 :     CNodeState *state = State(nodeid);
    1336         [ #  # ]:          0 :     assert(state != nullptr);
    1337                 :            : 
    1338                 :          0 :     ProcessBlockAvailability(nodeid);
    1339                 :            : 
    1340                 :          0 :     const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hash);
    1341 [ #  # ][ #  # ]:          0 :     if (pindex && pindex->nChainWork > 0) {
    1342                 :            :         // An actually better block was announced.
    1343 [ #  # ][ #  # ]:          0 :         if (state->pindexBestKnownBlock == nullptr || pindex->nChainWork >= state->pindexBestKnownBlock->nChainWork) {
    1344                 :          0 :             state->pindexBestKnownBlock = pindex;
    1345                 :          0 :         }
    1346                 :          0 :     } else {
    1347                 :            :         // An unknown block was announced; just assume that the latest one is the best one.
    1348                 :          0 :         state->hashLastUnknownBlock = hash;
    1349                 :            :     }
    1350                 :          0 : }
    1351                 :            : 
    1352                 :            : // Logic for calculating which blocks to download from a given peer, given our current tip.
    1353                 :          0 : void PeerManagerImpl::FindNextBlocksToDownload(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, NodeId& nodeStaller)
    1354                 :            : {
    1355         [ #  # ]:          0 :     if (count == 0)
    1356                 :          0 :         return;
    1357                 :            : 
    1358                 :          0 :     vBlocks.reserve(vBlocks.size() + count);
    1359                 :          0 :     CNodeState *state = State(peer.m_id);
    1360         [ #  # ]:          0 :     assert(state != nullptr);
    1361                 :            : 
    1362                 :            :     // Make sure pindexBestKnownBlock is up to date, we'll need it.
    1363                 :          0 :     ProcessBlockAvailability(peer.m_id);
    1364                 :            : 
    1365 [ #  # ][ #  # ]:          0 :     if (state->pindexBestKnownBlock == nullptr || state->pindexBestKnownBlock->nChainWork < m_chainman.ActiveChain().Tip()->nChainWork || state->pindexBestKnownBlock->nChainWork < m_chainman.MinimumChainWork()) {
                 [ #  # ]
    1366                 :            :         // This peer has nothing interesting.
    1367                 :          0 :         return;
    1368                 :            :     }
    1369                 :            : 
    1370         [ #  # ]:          0 :     if (state->pindexLastCommonBlock == nullptr) {
    1371                 :            :         // Bootstrap quickly by guessing a parent of our best tip is the forking point.
    1372                 :            :         // Guessing wrong in either direction is not a problem.
    1373                 :          0 :         state->pindexLastCommonBlock = m_chainman.ActiveChain()[std::min(state->pindexBestKnownBlock->nHeight, m_chainman.ActiveChain().Height())];
    1374                 :          0 :     }
    1375                 :            : 
    1376                 :            :     // If the peer reorganized, our previous pindexLastCommonBlock may not be an ancestor
    1377                 :            :     // of its current tip anymore. Go back enough to fix that.
    1378                 :          0 :     state->pindexLastCommonBlock = LastCommonAncestor(state->pindexLastCommonBlock, state->pindexBestKnownBlock);
    1379         [ #  # ]:          0 :     if (state->pindexLastCommonBlock == state->pindexBestKnownBlock)
    1380                 :          0 :         return;
    1381                 :            : 
    1382                 :          0 :     const CBlockIndex *pindexWalk = state->pindexLastCommonBlock;
    1383                 :            :     // Never fetch further than the best block we know the peer has, or more than BLOCK_DOWNLOAD_WINDOW + 1 beyond the last
    1384                 :            :     // linked block we have in common with this peer. The +1 is so we can detect stalling, namely if we would be able to
    1385                 :            :     // download that next block if the window were 1 larger.
    1386                 :          0 :     int nWindowEnd = state->pindexLastCommonBlock->nHeight + BLOCK_DOWNLOAD_WINDOW;
    1387                 :            : 
    1388                 :          0 :     FindNextBlocks(vBlocks, peer, state, pindexWalk, count, nWindowEnd, &m_chainman.ActiveChain(), &nodeStaller);
    1389                 :          0 : }
    1390                 :            : 
    1391                 :          0 : void PeerManagerImpl::TryDownloadingHistoricalBlocks(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, const CBlockIndex *from_tip, const CBlockIndex* target_block)
    1392                 :            : {
    1393                 :          0 :     Assert(from_tip);
    1394                 :          0 :     Assert(target_block);
    1395                 :            : 
    1396         [ #  # ]:          0 :     if (vBlocks.size() >= count) {
    1397                 :          0 :         return;
    1398                 :            :     }
    1399                 :            : 
    1400                 :          0 :     vBlocks.reserve(count);
    1401                 :          0 :     CNodeState *state = Assert(State(peer.m_id));
    1402                 :            : 
    1403 [ #  # ][ #  # ]:          0 :     if (state->pindexBestKnownBlock == nullptr || state->pindexBestKnownBlock->GetAncestor(target_block->nHeight) != target_block) {
    1404                 :            :         // This peer can't provide us the complete series of blocks leading up to the
    1405                 :            :         // assumeutxo snapshot base.
    1406                 :            :         //
    1407                 :            :         // Presumably this peer's chain has less work than our ActiveChain()'s tip, or else we
    1408                 :            :         // will eventually crash when we try to reorg to it. Let other logic
    1409                 :            :         // deal with whether we disconnect this peer.
    1410                 :            :         //
    1411                 :            :         // TODO at some point in the future, we might choose to request what blocks
    1412                 :            :         // this peer does have from the historical chain, despite it not having a
    1413                 :            :         // complete history beneath the snapshot base.
    1414                 :          0 :         return;
    1415                 :            :     }
    1416                 :            : 
    1417                 :          0 :     FindNextBlocks(vBlocks, peer, state, from_tip, count, std::min<int>(from_tip->nHeight + BLOCK_DOWNLOAD_WINDOW, target_block->nHeight));
    1418                 :          0 : }
    1419                 :            : 
    1420                 :          0 : void PeerManagerImpl::FindNextBlocks(std::vector<const CBlockIndex*>& vBlocks, const Peer& peer, CNodeState *state, const CBlockIndex *pindexWalk, unsigned int count, int nWindowEnd, const CChain* activeChain, NodeId* nodeStaller)
    1421                 :            : {
    1422                 :          0 :     std::vector<const CBlockIndex*> vToFetch;
    1423                 :          0 :     int nMaxHeight = std::min<int>(state->pindexBestKnownBlock->nHeight, nWindowEnd + 1);
    1424                 :          0 :     NodeId waitingfor = -1;
    1425         [ #  # ]:          0 :     while (pindexWalk->nHeight < nMaxHeight) {
    1426                 :            :         // Read up to 128 (or more, if more blocks than that are needed) successors of pindexWalk (towards
    1427                 :            :         // pindexBestKnownBlock) into vToFetch. We fetch 128, because CBlockIndex::GetAncestor may be as expensive
    1428                 :            :         // as iterating over ~100 CBlockIndex* entries anyway.
    1429         [ #  # ]:          0 :         int nToFetch = std::min(nMaxHeight - pindexWalk->nHeight, std::max<int>(count - vBlocks.size(), 128));
    1430         [ #  # ]:          0 :         vToFetch.resize(nToFetch);
    1431         [ #  # ]:          0 :         pindexWalk = state->pindexBestKnownBlock->GetAncestor(pindexWalk->nHeight + nToFetch);
    1432                 :          0 :         vToFetch[nToFetch - 1] = pindexWalk;
    1433         [ #  # ]:          0 :         for (unsigned int i = nToFetch - 1; i > 0; i--) {
    1434                 :          0 :             vToFetch[i - 1] = vToFetch[i]->pprev;
    1435                 :          0 :         }
    1436                 :            : 
    1437                 :            :         // Iterate over those blocks in vToFetch (in forward direction), adding the ones that
    1438                 :            :         // are not yet downloaded and not in flight to vBlocks. In the meantime, update
    1439                 :            :         // pindexLastCommonBlock as long as all ancestors are already downloaded, or if it's
    1440                 :            :         // already part of our chain (and therefore don't need it even if pruned).
    1441         [ #  # ]:          0 :         for (const CBlockIndex* pindex : vToFetch) {
    1442         [ #  # ]:          0 :             if (!pindex->IsValid(BLOCK_VALID_TREE)) {
    1443                 :            :                 // We consider the chain that this peer is on invalid.
    1444                 :          0 :                 return;
    1445                 :            :             }
    1446 [ #  # ][ #  # ]:          0 :             if (!CanServeWitnesses(peer) && DeploymentActiveAt(*pindex, m_chainman, Consensus::DEPLOYMENT_SEGWIT)) {
                 [ #  # ]
    1447                 :            :                 // We wouldn't download this block or its descendants from this peer.
    1448                 :          0 :                 return;
    1449                 :            :             }
    1450 [ #  # ][ #  # ]:          0 :             if (pindex->nStatus & BLOCK_HAVE_DATA || (activeChain && activeChain->Contains(pindex))) {
         [ #  # ][ #  # ]
    1451 [ #  # ][ #  # ]:          0 :                 if (activeChain && pindex->HaveNumChainTxs())
    1452                 :          0 :                     state->pindexLastCommonBlock = pindex;
    1453 [ #  # ][ #  # ]:          0 :             } else if (!IsBlockRequested(pindex->GetBlockHash())) {
    1454                 :            :                 // The block is not already downloaded, and not yet in flight.
    1455         [ #  # ]:          0 :                 if (pindex->nHeight > nWindowEnd) {
    1456                 :            :                     // We reached the end of the window.
    1457 [ #  # ][ #  # ]:          0 :                     if (vBlocks.size() == 0 && waitingfor != peer.m_id) {
    1458                 :            :                         // We aren't able to fetch anything, but we would be if the download window was one larger.
    1459         [ #  # ]:          0 :                         if (nodeStaller) *nodeStaller = waitingfor;
    1460                 :          0 :                     }
    1461                 :          0 :                     return;
    1462                 :            :                 }
    1463         [ #  # ]:          0 :                 vBlocks.push_back(pindex);
    1464         [ #  # ]:          0 :                 if (vBlocks.size() == count) {
    1465                 :          0 :                     return;
    1466                 :            :                 }
    1467         [ #  # ]:          0 :             } else if (waitingfor == -1) {
    1468                 :            :                 // This is the first already-in-flight block.
    1469         [ #  # ]:          0 :                 waitingfor = mapBlocksInFlight.lower_bound(pindex->GetBlockHash())->second.first;
    1470                 :          0 :             }
    1471                 :            :         }
    1472                 :            :     }
    1473         [ #  # ]:          0 : }
    1474                 :            : 
    1475                 :            : } // namespace
    1476                 :            : 
    1477                 :          0 : void PeerManagerImpl::PushNodeVersion(CNode& pnode, const Peer& peer)
    1478                 :            : {
    1479                 :          0 :     uint64_t my_services{peer.m_our_services};
    1480                 :          0 :     const int64_t nTime{count_seconds(GetTime<std::chrono::seconds>())};
    1481                 :          0 :     uint64_t nonce = pnode.GetLocalNonce();
    1482                 :          0 :     const int nNodeStartingHeight{m_best_height};
    1483                 :          0 :     NodeId nodeid = pnode.GetId();
    1484                 :          0 :     CAddress addr = pnode.addr;
    1485                 :            : 
    1486 [ #  # ][ #  # ]:          0 :     CService addr_you = addr.IsRoutable() && !IsProxy(addr) && addr.IsAddrV1Compatible() ? addr : CService();
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    1487                 :          0 :     uint64_t your_services{addr.nServices};
    1488                 :            : 
    1489         [ #  # ]:          0 :     const bool tx_relay{!RejectIncomingTxs(pnode)};
    1490 [ #  # ][ #  # ]:          0 :     m_connman.PushMessage(&pnode, CNetMsgMaker(INIT_PROTO_VERSION).Make(NetMsgType::VERSION, PROTOCOL_VERSION, my_services, nTime,
         [ #  # ][ #  # ]
    1491         [ #  # ]:          0 :             your_services, CNetAddr::V1(addr_you), // Together the pre-version-31402 serialization of CAddress "addrYou" (without nTime)
    1492 [ #  # ][ #  # ]:          0 :             my_services, CNetAddr::V1(CService{}), // Together the pre-version-31402 serialization of CAddress "addrMe" (without nTime)
    1493                 :            :             nonce, strSubVersion, nNodeStartingHeight, tx_relay));
    1494                 :            : 
    1495         [ #  # ]:          0 :     if (fLogIPs) {
    1496 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "send version message: version %d, blocks=%d, them=%s, txrelay=%d, peer=%d\n", PROTOCOL_VERSION, nNodeStartingHeight, addr_you.ToStringAddrPort(), tx_relay, nodeid);
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    1497                 :          0 :     } else {
    1498 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "send version message: version %d, blocks=%d, txrelay=%d, peer=%d\n", PROTOCOL_VERSION, nNodeStartingHeight, tx_relay, nodeid);
         [ #  # ][ #  # ]
                 [ #  # ]
    1499                 :            :     }
    1500                 :          0 : }
    1501                 :            : 
    1502                 :          0 : void PeerManagerImpl::AddTxAnnouncement(const CNode& node, const GenTxid& gtxid, std::chrono::microseconds current_time)
    1503                 :            : {
    1504                 :          0 :     AssertLockHeld(::cs_main); // For m_txrequest
    1505                 :          0 :     NodeId nodeid = node.GetId();
    1506 [ #  # ][ #  # ]:          0 :     if (!node.HasPermission(NetPermissionFlags::Relay) && m_txrequest.Count(nodeid) >= MAX_PEER_TX_ANNOUNCEMENTS) {
    1507                 :            :         // Too many queued announcements from this peer
    1508                 :          0 :         return;
    1509                 :            :     }
    1510                 :          0 :     const CNodeState* state = State(nodeid);
    1511                 :            : 
    1512                 :            :     // Decide the TxRequestTracker parameters for this announcement:
    1513                 :            :     // - "preferred": if fPreferredDownload is set (= outbound, or NetPermissionFlags::NoBan permission)
    1514                 :            :     // - "reqtime": current time plus delays for:
    1515                 :            :     //   - NONPREF_PEER_TX_DELAY for announcements from non-preferred connections
    1516                 :            :     //   - TXID_RELAY_DELAY for txid announcements while wtxid peers are available
    1517                 :            :     //   - OVERLOADED_PEER_TX_DELAY for announcements from peers which have at least
    1518                 :            :     //     MAX_PEER_TX_REQUEST_IN_FLIGHT requests in flight (and don't have NetPermissionFlags::Relay).
    1519                 :          0 :     auto delay{0us};
    1520                 :          0 :     const bool preferred = state->fPreferredDownload;
    1521         [ #  # ]:          0 :     if (!preferred) delay += NONPREF_PEER_TX_DELAY;
    1522 [ #  # ][ #  # ]:          0 :     if (!gtxid.IsWtxid() && m_wtxid_relay_peers > 0) delay += TXID_RELAY_DELAY;
    1523         [ #  # ]:          0 :     const bool overloaded = !node.HasPermission(NetPermissionFlags::Relay) &&
    1524                 :          0 :         m_txrequest.CountInFlight(nodeid) >= MAX_PEER_TX_REQUEST_IN_FLIGHT;
    1525         [ #  # ]:          0 :     if (overloaded) delay += OVERLOADED_PEER_TX_DELAY;
    1526                 :          0 :     m_txrequest.ReceivedInv(nodeid, gtxid, preferred, current_time + delay);
    1527                 :          0 : }
    1528                 :            : 
    1529                 :          0 : void PeerManagerImpl::UpdateLastBlockAnnounceTime(NodeId node, int64_t time_in_seconds)
    1530                 :            : {
    1531                 :          0 :     LOCK(cs_main);
    1532         [ #  # ]:          0 :     CNodeState *state = State(node);
    1533         [ #  # ]:          0 :     if (state) state->m_last_block_announcement = time_in_seconds;
    1534                 :          0 : }
    1535                 :            : 
    1536                 :          0 : void PeerManagerImpl::InitializeNode(CNode& node, ServiceFlags our_services)
    1537                 :            : {
    1538                 :          0 :     NodeId nodeid = node.GetId();
    1539                 :            :     {
    1540                 :          0 :         LOCK(cs_main);
    1541         [ #  # ]:          0 :         m_node_states.emplace_hint(m_node_states.end(), std::piecewise_construct, std::forward_as_tuple(nodeid), std::forward_as_tuple(node.IsInboundConn()));
    1542 [ #  # ][ #  # ]:          0 :         assert(m_txrequest.Count(nodeid) == 0);
    1543                 :          0 :     }
    1544                 :          0 :     PeerRef peer = std::make_shared<Peer>(nodeid, our_services);
    1545                 :            :     {
    1546         [ #  # ]:          0 :         LOCK(m_peer_mutex);
    1547         [ #  # ]:          0 :         m_peer_map.emplace_hint(m_peer_map.end(), nodeid, peer);
    1548                 :          0 :     }
    1549         [ #  # ]:          0 :     if (!node.IsInboundConn()) {
    1550         [ #  # ]:          0 :         PushNodeVersion(node, *peer);
    1551                 :          0 :     }
    1552                 :          0 : }
    1553                 :            : 
    1554                 :          0 : void PeerManagerImpl::ReattemptInitialBroadcast(CScheduler& scheduler)
    1555                 :            : {
    1556                 :          0 :     std::set<uint256> unbroadcast_txids = m_mempool.GetUnbroadcastTxs();
    1557                 :            : 
    1558         [ #  # ]:          0 :     for (const auto& txid : unbroadcast_txids) {
    1559         [ #  # ]:          0 :         CTransactionRef tx = m_mempool.get(txid);
    1560                 :            : 
    1561         [ #  # ]:          0 :         if (tx != nullptr) {
    1562         [ #  # ]:          0 :             RelayTransaction(txid, tx->GetWitnessHash());
    1563                 :          0 :         } else {
    1564         [ #  # ]:          0 :             m_mempool.RemoveUnbroadcastTx(txid, true);
    1565                 :            :         }
    1566                 :          0 :     }
    1567                 :            : 
    1568                 :            :     // Schedule next run for 10-15 minutes in the future.
    1569                 :            :     // We add randomness on every cycle to avoid the possibility of P2P fingerprinting.
    1570 [ #  # ][ #  # ]:          0 :     const std::chrono::milliseconds delta = 10min + GetRandMillis(5min);
         [ #  # ][ #  # ]
    1571         [ #  # ]:          0 :     scheduler.scheduleFromNow([&] { ReattemptInitialBroadcast(scheduler); }, delta);
    1572                 :          0 : }
    1573                 :            : 
    1574                 :          0 : void PeerManagerImpl::FinalizeNode(const CNode& node)
    1575                 :            : {
    1576                 :          0 :     NodeId nodeid = node.GetId();
    1577                 :          0 :     int misbehavior{0};
    1578                 :            :     {
    1579                 :          0 :     LOCK(cs_main);
    1580                 :            :     {
    1581                 :            :         // We remove the PeerRef from g_peer_map here, but we don't always
    1582                 :            :         // destruct the Peer. Sometimes another thread is still holding a
    1583                 :            :         // PeerRef, so the refcount is >= 1. Be careful not to do any
    1584                 :            :         // processing here that assumes Peer won't be changed before it's
    1585                 :            :         // destructed.
    1586         [ #  # ]:          0 :         PeerRef peer = RemovePeer(nodeid);
    1587         [ #  # ]:          0 :         assert(peer != nullptr);
    1588         [ #  # ]:          0 :         misbehavior = WITH_LOCK(peer->m_misbehavior_mutex, return peer->m_misbehavior_score);
    1589                 :          0 :         m_wtxid_relay_peers -= peer->m_wtxid_relay;
    1590         [ #  # ]:          0 :         assert(m_wtxid_relay_peers >= 0);
    1591                 :          0 :     }
    1592         [ #  # ]:          0 :     CNodeState *state = State(nodeid);
    1593         [ #  # ]:          0 :     assert(state != nullptr);
    1594                 :            : 
    1595         [ #  # ]:          0 :     if (state->fSyncStarted)
    1596                 :          0 :         nSyncStarted--;
    1597                 :            : 
    1598         [ #  # ]:          0 :     for (const QueuedBlock& entry : state->vBlocksInFlight) {
    1599         [ #  # ]:          0 :         auto range = mapBlocksInFlight.equal_range(entry.pindex->GetBlockHash());
    1600         [ #  # ]:          0 :         while (range.first != range.second) {
    1601                 :          0 :             auto [node_id, list_it] = range.first->second;
    1602         [ #  # ]:          0 :             if (node_id != nodeid) {
    1603                 :          0 :                 range.first++;
    1604                 :          0 :             } else {
    1605         [ #  # ]:          0 :                 range.first = mapBlocksInFlight.erase(range.first);
    1606                 :            :             }
    1607                 :            :         }
    1608                 :            :     }
    1609         [ #  # ]:          0 :     m_orphanage.EraseForPeer(nodeid);
    1610         [ #  # ]:          0 :     m_txrequest.DisconnectedPeer(nodeid);
    1611 [ #  # ][ #  # ]:          0 :     if (m_txreconciliation) m_txreconciliation->ForgetPeer(nodeid);
    1612                 :          0 :     m_num_preferred_download_peers -= state->fPreferredDownload;
    1613                 :          0 :     m_peers_downloading_from -= (!state->vBlocksInFlight.empty());
    1614         [ #  # ]:          0 :     assert(m_peers_downloading_from >= 0);
    1615                 :          0 :     m_outbound_peers_with_protect_from_disconnect -= state->m_chain_sync.m_protect;
    1616         [ #  # ]:          0 :     assert(m_outbound_peers_with_protect_from_disconnect >= 0);
    1617                 :            : 
    1618         [ #  # ]:          0 :     m_node_states.erase(nodeid);
    1619                 :            : 
    1620         [ #  # ]:          0 :     if (m_node_states.empty()) {
    1621                 :            :         // Do a consistency check after the last peer is removed.
    1622         [ #  # ]:          0 :         assert(mapBlocksInFlight.empty());
    1623         [ #  # ]:          0 :         assert(m_num_preferred_download_peers == 0);
    1624         [ #  # ]:          0 :         assert(m_peers_downloading_from == 0);
    1625         [ #  # ]:          0 :         assert(m_outbound_peers_with_protect_from_disconnect == 0);
    1626         [ #  # ]:          0 :         assert(m_wtxid_relay_peers == 0);
    1627 [ #  # ][ #  # ]:          0 :         assert(m_txrequest.Size() == 0);
    1628 [ #  # ][ #  # ]:          0 :         assert(m_orphanage.Size() == 0);
    1629                 :          0 :     }
    1630                 :          0 :     } // cs_main
    1631 [ #  # ][ #  # ]:          0 :     if (node.fSuccessfullyConnected && misbehavior == 0 &&
                 [ #  # ]
    1632         [ #  # ]:          0 :         !node.IsBlockOnlyConn() && !node.IsInboundConn()) {
    1633                 :            :         // Only change visible addrman state for full outbound peers.  We don't
    1634                 :            :         // call Connected() for feeler connections since they don't have
    1635                 :            :         // fSuccessfullyConnected set.
    1636                 :          0 :         m_addrman.Connected(node.addr);
    1637                 :          0 :     }
    1638                 :            :     {
    1639                 :          0 :         LOCK(m_headers_presync_mutex);
    1640         [ #  # ]:          0 :         m_headers_presync_stats.erase(nodeid);
    1641                 :          0 :     }
    1642 [ #  # ][ #  # ]:          0 :     LogPrint(BCLog::NET, "Cleared nodestate for peer=%d\n", nodeid);
         [ #  # ][ #  # ]
    1643                 :          0 : }
    1644                 :            : 
    1645                 :          0 : PeerRef PeerManagerImpl::GetPeerRef(NodeId id) const
    1646                 :            : {
    1647                 :          0 :     LOCK(m_peer_mutex);
    1648         [ #  # ]:          0 :     auto it = m_peer_map.find(id);
    1649         [ #  # ]:          0 :     return it != m_peer_map.end() ? it->second : nullptr;
    1650                 :          0 : }
    1651                 :            : 
    1652                 :          0 : PeerRef PeerManagerImpl::RemovePeer(NodeId id)
    1653                 :            : {
    1654                 :          0 :     PeerRef ret;
    1655         [ #  # ]:          0 :     LOCK(m_peer_mutex);
    1656         [ #  # ]:          0 :     auto it = m_peer_map.find(id);
    1657         [ #  # ]:          0 :     if (it != m_peer_map.end()) {
    1658                 :          0 :         ret = std::move(it->second);
    1659         [ #  # ]:          0 :         m_peer_map.erase(it);
    1660                 :          0 :     }
    1661                 :          0 :     return ret;
    1662         [ #  # ]:          0 : }
    1663                 :            : 
    1664                 :          0 : bool PeerManagerImpl::GetNodeStateStats(NodeId nodeid, CNodeStateStats& stats) const
    1665                 :            : {
    1666                 :            :     {
    1667                 :          0 :         LOCK(cs_main);
    1668         [ #  # ]:          0 :         const CNodeState* state = State(nodeid);
    1669         [ #  # ]:          0 :         if (state == nullptr)
    1670                 :          0 :             return false;
    1671         [ #  # ]:          0 :         stats.nSyncHeight = state->pindexBestKnownBlock ? state->pindexBestKnownBlock->nHeight : -1;
    1672         [ #  # ]:          0 :         stats.nCommonHeight = state->pindexLastCommonBlock ? state->pindexLastCommonBlock->nHeight : -1;
    1673         [ #  # ]:          0 :         for (const QueuedBlock& queue : state->vBlocksInFlight) {
    1674         [ #  # ]:          0 :             if (queue.pindex)
    1675         [ #  # ]:          0 :                 stats.vHeightInFlight.push_back(queue.pindex->nHeight);
    1676                 :            :         }
    1677      [ #  #  # ]:          0 :     }
    1678                 :            : 
    1679                 :          0 :     PeerRef peer = GetPeerRef(nodeid);
    1680         [ #  # ]:          0 :     if (peer == nullptr) return false;
    1681                 :          0 :     stats.their_services = peer->m_their_services;
    1682                 :          0 :     stats.m_starting_height = peer->m_starting_height;
    1683                 :            :     // It is common for nodes with good ping times to suddenly become lagged,
    1684                 :            :     // due to a new block arriving or other large transfer.
    1685                 :            :     // Merely reporting pingtime might fool the caller into thinking the node was still responsive,
    1686                 :            :     // since pingtime does not update until the ping is complete, which might take a while.
    1687                 :            :     // So, if a ping is taking an unusually long time in flight,
    1688                 :            :     // the caller can immediately detect that this is happening.
    1689                 :          0 :     auto ping_wait{0us};
    1690 [ #  # ][ #  # ]:          0 :     if ((0 != peer->m_ping_nonce_sent) && (0 != peer->m_ping_start.load().count())) {
    1691 [ #  # ][ #  # ]:          0 :         ping_wait = GetTime<std::chrono::microseconds>() - peer->m_ping_start.load();
    1692                 :          0 :     }
    1693                 :            : 
    1694 [ #  # ][ #  # ]:          0 :     if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
    1695         [ #  # ]:          0 :         stats.m_relay_txs = WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs);
    1696                 :          0 :         stats.m_fee_filter_received = tx_relay->m_fee_filter_received.load();
    1697                 :          0 :     } else {
    1698                 :          0 :         stats.m_relay_txs = false;
    1699                 :          0 :         stats.m_fee_filter_received = 0;
    1700                 :            :     }
    1701                 :            : 
    1702                 :          0 :     stats.m_ping_wait = ping_wait;
    1703                 :          0 :     stats.m_addr_processed = peer->m_addr_processed.load();
    1704                 :          0 :     stats.m_addr_rate_limited = peer->m_addr_rate_limited.load();
    1705                 :          0 :     stats.m_addr_relay_enabled = peer->m_addr_relay_enabled.load();
    1706                 :            :     {
    1707         [ #  # ]:          0 :         LOCK(peer->m_headers_sync_mutex);
    1708         [ #  # ]:          0 :         if (peer->m_headers_sync) {
    1709         [ #  # ]:          0 :             stats.presync_height = peer->m_headers_sync->GetPresyncHeight();
    1710                 :          0 :         }
    1711                 :          0 :     }
    1712                 :            : 
    1713                 :          0 :     return true;
    1714                 :          0 : }
    1715                 :            : 
    1716                 :          0 : void PeerManagerImpl::AddToCompactExtraTransactions(const CTransactionRef& tx)
    1717                 :            : {
    1718         [ #  # ]:          0 :     if (m_opts.max_extra_txs <= 0)
    1719                 :          0 :         return;
    1720         [ #  # ]:          0 :     if (!vExtraTxnForCompact.size())
    1721                 :          0 :         vExtraTxnForCompact.resize(m_opts.max_extra_txs);
    1722         [ #  # ]:          0 :     vExtraTxnForCompact[vExtraTxnForCompactIt] = std::make_pair(tx->GetWitnessHash(), tx);
    1723                 :          0 :     vExtraTxnForCompactIt = (vExtraTxnForCompactIt + 1) % m_opts.max_extra_txs;
    1724                 :          0 : }
    1725                 :            : 
    1726                 :          0 : void PeerManagerImpl::Misbehaving(Peer& peer, int howmuch, const std::string& message)
    1727                 :            : {
    1728         [ #  # ]:          0 :     assert(howmuch > 0);
    1729                 :            : 
    1730                 :          0 :     LOCK(peer.m_misbehavior_mutex);
    1731                 :          0 :     const int score_before{peer.m_misbehavior_score};
    1732                 :          0 :     peer.m_misbehavior_score += howmuch;
    1733                 :          0 :     const int score_now{peer.m_misbehavior_score};
    1734                 :            : 
    1735 [ #  # ][ #  # ]:          0 :     const std::string message_prefixed = message.empty() ? "" : (": " + message);
         [ #  # ][ #  # ]
                 [ #  # ]
    1736                 :          0 :     std::string warning;
    1737                 :            : 
    1738 [ #  # ][ #  # ]:          0 :     if (score_now >= DISCOURAGEMENT_THRESHOLD && score_before < DISCOURAGEMENT_THRESHOLD) {
    1739         [ #  # ]:          0 :         warning = " DISCOURAGE THRESHOLD EXCEEDED";
    1740                 :          0 :         peer.m_should_discourage = true;
    1741                 :          0 :     }
    1742                 :            : 
    1743 [ #  # ][ #  # ]:          0 :     LogPrint(BCLog::NET, "Misbehaving: peer=%d (%d -> %d)%s%s\n",
         [ #  # ][ #  # ]
                 [ #  # ]
    1744                 :            :              peer.m_id, score_before, score_now, warning, message_prefixed);
    1745                 :          0 : }
    1746                 :            : 
    1747                 :          0 : bool PeerManagerImpl::MaybePunishNodeForBlock(NodeId nodeid, const BlockValidationState& state,
    1748                 :            :                                               bool via_compact_block, const std::string& message)
    1749                 :            : {
    1750                 :          0 :     PeerRef peer{GetPeerRef(nodeid)};
    1751 [ #  # ][ #  #  :          0 :     switch (state.GetResult()) {
          #  #  #  #  #  
                      # ]
    1752                 :            :     case BlockValidationResult::BLOCK_RESULT_UNSET:
    1753                 :          0 :         break;
    1754                 :            :     case BlockValidationResult::BLOCK_HEADER_LOW_WORK:
    1755                 :            :         // We didn't try to process the block because the header chain may have
    1756                 :            :         // too little work.
    1757                 :          0 :         break;
    1758                 :            :     // The node is providing invalid data:
    1759                 :            :     case BlockValidationResult::BLOCK_CONSENSUS:
    1760                 :            :     case BlockValidationResult::BLOCK_MUTATED:
    1761         [ #  # ]:          0 :         if (!via_compact_block) {
    1762 [ #  # ][ #  # ]:          0 :             if (peer) Misbehaving(*peer, 100, message);
    1763                 :          0 :             return true;
    1764                 :            :         }
    1765                 :          0 :         break;
    1766                 :            :     case BlockValidationResult::BLOCK_CACHED_INVALID:
    1767                 :            :         {
    1768         [ #  # ]:          0 :             LOCK(cs_main);
    1769         [ #  # ]:          0 :             CNodeState *node_state = State(nodeid);
    1770         [ #  # ]:          0 :             if (node_state == nullptr) {
    1771                 :          0 :                 break;
    1772                 :            :             }
    1773                 :            : 
    1774                 :            :             // Discourage outbound (but not inbound) peers if on an invalid chain.
    1775                 :            :             // Exempt HB compact block peers. Manual connections are always protected from discouragement.
    1776 [ #  # ][ #  # ]:          0 :             if (!via_compact_block && !node_state->m_is_inbound) {
    1777 [ #  # ][ #  # ]:          0 :                 if (peer) Misbehaving(*peer, 100, message);
    1778                 :          0 :                 return true;
    1779                 :            :             }
    1780                 :          0 :             break;
    1781         [ #  # ]:          0 :         }
    1782                 :            :     case BlockValidationResult::BLOCK_INVALID_HEADER:
    1783                 :            :     case BlockValidationResult::BLOCK_CHECKPOINT:
    1784                 :            :     case BlockValidationResult::BLOCK_INVALID_PREV:
    1785 [ #  # ][ #  # ]:          0 :         if (peer) Misbehaving(*peer, 100, message);
    1786                 :          0 :         return true;
    1787                 :            :     // Conflicting (but not necessarily invalid) data or different policy:
    1788                 :            :     case BlockValidationResult::BLOCK_MISSING_PREV:
    1789                 :            :         // TODO: Handle this much more gracefully (10 DoS points is super arbitrary)
    1790 [ #  # ][ #  # ]:          0 :         if (peer) Misbehaving(*peer, 10, message);
    1791                 :          0 :         return true;
    1792                 :            :     case BlockValidationResult::BLOCK_RECENT_CONSENSUS_CHANGE:
    1793                 :            :     case BlockValidationResult::BLOCK_TIME_FUTURE:
    1794                 :          0 :         break;
    1795                 :            :     }
    1796 [ #  # ][ #  # ]:          0 :     if (message != "") {
    1797 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "peer=%d: %s\n", nodeid, message);
         [ #  # ][ #  # ]
                 [ #  # ]
    1798                 :          0 :     }
    1799                 :          0 :     return false;
    1800                 :          0 : }
    1801                 :            : 
    1802                 :          0 : bool PeerManagerImpl::MaybePunishNodeForTx(NodeId nodeid, const TxValidationState& state)
    1803                 :            : {
    1804                 :          0 :     PeerRef peer{GetPeerRef(nodeid)};
    1805   [ #  #  #  # ]:          0 :     switch (state.GetResult()) {
    1806                 :            :     case TxValidationResult::TX_RESULT_UNSET:
    1807                 :          0 :         break;
    1808                 :            :     // The node is providing invalid data:
    1809                 :            :     case TxValidationResult::TX_CONSENSUS:
    1810 [ #  # ][ #  # ]:          0 :         if (peer) Misbehaving(*peer, 100, "");
                 [ #  # ]
    1811                 :          0 :         return true;
    1812                 :            :     // Conflicting (but not necessarily invalid) data or different policy:
    1813                 :            :     case TxValidationResult::TX_RECENT_CONSENSUS_CHANGE:
    1814                 :            :     case TxValidationResult::TX_INPUTS_NOT_STANDARD:
    1815                 :            :     case TxValidationResult::TX_NOT_STANDARD:
    1816                 :            :     case TxValidationResult::TX_MISSING_INPUTS:
    1817                 :            :     case TxValidationResult::TX_PREMATURE_SPEND:
    1818                 :            :     case TxValidationResult::TX_WITNESS_MUTATED:
    1819                 :            :     case TxValidationResult::TX_WITNESS_STRIPPED:
    1820                 :            :     case TxValidationResult::TX_CONFLICT:
    1821                 :            :     case TxValidationResult::TX_MEMPOOL_POLICY:
    1822                 :            :     case TxValidationResult::TX_NO_MEMPOOL:
    1823                 :          0 :         break;
    1824                 :            :     }
    1825                 :          0 :     return false;
    1826                 :          0 : }
    1827                 :            : 
    1828                 :          0 : bool PeerManagerImpl::BlockRequestAllowed(const CBlockIndex* pindex)
    1829                 :            : {
    1830                 :          0 :     AssertLockHeld(cs_main);
    1831         [ #  # ]:          0 :     if (m_chainman.ActiveChain().Contains(pindex)) return true;
    1832 [ #  # ][ #  # ]:          0 :     return pindex->IsValid(BLOCK_VALID_SCRIPTS) && (m_chainman.m_best_header != nullptr) &&
    1833         [ #  # ]:          0 :            (m_chainman.m_best_header->GetBlockTime() - pindex->GetBlockTime() < STALE_RELAY_AGE_LIMIT) &&
    1834                 :          0 :            (GetBlockProofEquivalentTime(*m_chainman.m_best_header, *pindex, *m_chainman.m_best_header, m_chainparams.GetConsensus()) < STALE_RELAY_AGE_LIMIT);
    1835                 :          0 : }
    1836                 :            : 
    1837                 :          0 : std::optional<std::string> PeerManagerImpl::FetchBlock(NodeId peer_id, const CBlockIndex& block_index)
    1838                 :            : {
    1839         [ #  # ]:          0 :     if (m_chainman.m_blockman.LoadingBlocks()) return "Loading blocks ...";
    1840                 :            : 
    1841                 :            :     // Ensure this peer exists and hasn't been disconnected
    1842                 :          0 :     PeerRef peer = GetPeerRef(peer_id);
    1843 [ #  # ][ #  # ]:          0 :     if (peer == nullptr) return "Peer does not exist";
    1844                 :            : 
    1845                 :            :     // Ignore pre-segwit peers
    1846 [ #  # ][ #  # ]:          0 :     if (!CanServeWitnesses(*peer)) return "Pre-SegWit peer";
                 [ #  # ]
    1847                 :            : 
    1848         [ #  # ]:          0 :     LOCK(cs_main);
    1849                 :            : 
    1850                 :            :     // Forget about all prior requests
    1851         [ #  # ]:          0 :     RemoveBlockRequest(block_index.GetBlockHash(), std::nullopt);
    1852                 :            : 
    1853                 :            :     // Mark block as in-flight
    1854 [ #  # ][ #  # ]:          0 :     if (!BlockRequested(peer_id, block_index)) return "Already requested from this peer";
                 [ #  # ]
    1855                 :            : 
    1856                 :            :     // Construct message to request the block
    1857                 :          0 :     const uint256& hash{block_index.GetBlockHash()};
    1858 [ #  # ][ #  # ]:          0 :     std::vector<CInv> invs{CInv(MSG_BLOCK | MSG_WITNESS_FLAG, hash)};
    1859                 :            : 
    1860                 :            :     // Send block request message to the peer
    1861         [ #  # ]:          0 :     bool success = m_connman.ForNode(peer_id, [this, &invs](CNode* node) {
    1862                 :          0 :         const CNetMsgMaker msgMaker(node->GetCommonVersion());
    1863 [ #  # ][ #  # ]:          0 :         this->m_connman.PushMessage(node, msgMaker.Make(NetMsgType::GETDATA, invs));
                 [ #  # ]
    1864                 :          0 :         return true;
    1865                 :          0 :     });
    1866                 :            : 
    1867 [ #  # ][ #  # ]:          0 :     if (!success) return "Peer not fully connected";
    1868                 :            : 
    1869 [ #  # ][ #  # ]:          0 :     LogPrint(BCLog::NET, "Requesting block %s from peer=%d\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    1870                 :            :                  hash.ToString(), peer_id);
    1871                 :          0 :     return std::nullopt;
    1872                 :          0 : }
    1873                 :            : 
    1874                 :          1 : std::unique_ptr<PeerManager> PeerManager::make(CConnman& connman, AddrMan& addrman,
    1875                 :            :                                                BanMan* banman, ChainstateManager& chainman,
    1876                 :            :                                                CTxMemPool& pool, Options opts)
    1877                 :            : {
    1878                 :          1 :     return std::make_unique<PeerManagerImpl>(connman, addrman, banman, chainman, pool, opts);
    1879                 :            : }
    1880                 :            : 
    1881 [ +  - ][ +  - ]:          3 : PeerManagerImpl::PeerManagerImpl(CConnman& connman, AddrMan& addrman,
                 [ +  - ]
    1882                 :            :                                  BanMan* banman, ChainstateManager& chainman,
    1883                 :            :                                  CTxMemPool& pool, Options opts)
    1884                 :          1 :     : m_rng{opts.deterministic_rng},
    1885 [ +  - ][ +  - ]:          1 :       m_fee_filter_rounder{CFeeRate{DEFAULT_MIN_RELAY_TX_FEE}, m_rng},
    1886         [ +  - ]:          1 :       m_chainparams(chainman.GetParams()),
    1887                 :          1 :       m_connman(connman),
    1888                 :          1 :       m_addrman(addrman),
    1889                 :          1 :       m_banman(banman),
    1890                 :          1 :       m_chainman(chainman),
    1891                 :          1 :       m_mempool(pool),
    1892                 :          1 :       m_opts{opts}
    1893                 :          1 : {
    1894                 :            :     // While Erlay support is incomplete, it must be enabled explicitly via -txreconciliation.
    1895                 :            :     // This argument can go away after Erlay support is complete.
    1896         [ +  - ]:          1 :     if (opts.reconcile_txs) {
    1897         [ #  # ]:          0 :         m_txreconciliation = std::make_unique<TxReconciliationTracker>(TXRECONCILIATION_VERSION);
    1898                 :          0 :     }
    1899                 :          1 : }
    1900                 :            : 
    1901                 :          0 : void PeerManagerImpl::StartScheduledTasks(CScheduler& scheduler)
    1902                 :            : {
    1903                 :            :     // Stale tip checking and peer eviction are on two different timers, but we
    1904                 :            :     // don't want them to get out of sync due to drift in the scheduler, so we
    1905                 :            :     // combine them in one function and schedule at the quicker (peer-eviction)
    1906                 :            :     // timer.
    1907                 :            :     static_assert(EXTRA_PEER_CHECK_INTERVAL < STALE_CHECK_INTERVAL, "peer eviction timer should be less than stale tip check timer");
    1908 [ #  # ][ #  # ]:          0 :     scheduler.scheduleEvery([this] { this->CheckForStaleTipAndEvictPeers(); }, std::chrono::seconds{EXTRA_PEER_CHECK_INTERVAL});
    1909                 :            : 
    1910                 :            :     // schedule next run for 10-15 minutes in the future
    1911                 :          0 :     const std::chrono::milliseconds delta = 10min + GetRandMillis(5min);
    1912         [ #  # ]:          0 :     scheduler.scheduleFromNow([&] { ReattemptInitialBroadcast(scheduler); }, delta);
    1913                 :          0 : }
    1914                 :            : 
    1915                 :            : /**
    1916                 :            :  * Evict orphan txn pool entries based on a newly connected
    1917                 :            :  * block, remember the recently confirmed transactions, and delete tracked
    1918                 :            :  * announcements for them. Also save the time of the last tip update and
    1919                 :            :  * possibly reduce dynamic block stalling timeout.
    1920                 :            :  */
    1921                 :          0 : void PeerManagerImpl::BlockConnected(
    1922                 :            :     ChainstateRole role,
    1923                 :            :     const std::shared_ptr<const CBlock>& pblock,
    1924                 :            :     const CBlockIndex* pindex)
    1925                 :            : {
    1926                 :            :     // Update this for all chainstate roles so that we don't mistakenly see peers
    1927                 :            :     // helping us do background IBD as having a stale tip.
    1928                 :          0 :     m_last_tip_update = GetTime<std::chrono::seconds>();
    1929                 :            : 
    1930                 :            :     // In case the dynamic timeout was doubled once or more, reduce it slowly back to its default value
    1931                 :          0 :     auto stalling_timeout = m_block_stalling_timeout.load();
    1932                 :          0 :     Assume(stalling_timeout >= BLOCK_STALLING_TIMEOUT_DEFAULT);
    1933         [ #  # ]:          0 :     if (stalling_timeout != BLOCK_STALLING_TIMEOUT_DEFAULT) {
    1934                 :          0 :         const auto new_timeout = std::max(std::chrono::duration_cast<std::chrono::seconds>(stalling_timeout * 0.85), BLOCK_STALLING_TIMEOUT_DEFAULT);
    1935         [ #  # ]:          0 :         if (m_block_stalling_timeout.compare_exchange_strong(stalling_timeout, new_timeout)) {
    1936 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Decreased stalling timeout to %d seconds\n", count_seconds(new_timeout));
         [ #  # ][ #  # ]
                 [ #  # ]
    1937                 :          0 :         }
    1938                 :          0 :     }
    1939                 :            : 
    1940                 :            :     // The following task can be skipped since we don't maintain a mempool for
    1941                 :            :     // the ibd/background chainstate.
    1942         [ #  # ]:          0 :     if (role == ChainstateRole::BACKGROUND) {
    1943                 :          0 :         return;
    1944                 :            :     }
    1945                 :          0 :     m_orphanage.EraseForBlock(*pblock);
    1946                 :            : 
    1947                 :            :     {
    1948                 :          0 :         LOCK(m_recent_confirmed_transactions_mutex);
    1949         [ #  # ]:          0 :         for (const auto& ptx : pblock->vtx) {
    1950 [ #  # ][ #  # ]:          0 :             m_recent_confirmed_transactions.insert(ptx->GetHash().ToUint256());
         [ #  # ][ #  # ]
    1951 [ #  # ][ #  # ]:          0 :             if (ptx->HasWitness()) {
    1952 [ #  # ][ #  # ]:          0 :                 m_recent_confirmed_transactions.insert(ptx->GetWitnessHash().ToUint256());
         [ #  # ][ #  # ]
    1953                 :          0 :             }
    1954                 :            :         }
    1955                 :          0 :     }
    1956                 :            :     {
    1957                 :          0 :         LOCK(cs_main);
    1958         [ #  # ]:          0 :         for (const auto& ptx : pblock->vtx) {
    1959 [ #  # ][ #  # ]:          0 :             m_txrequest.ForgetTxHash(ptx->GetHash());
                 [ #  # ]
    1960 [ #  # ][ #  # ]:          0 :             m_txrequest.ForgetTxHash(ptx->GetWitnessHash());
                 [ #  # ]
    1961                 :            :         }
    1962                 :          0 :     }
    1963                 :          0 : }
    1964                 :            : 
    1965                 :          0 : void PeerManagerImpl::BlockDisconnected(const std::shared_ptr<const CBlock> &block, const CBlockIndex* pindex)
    1966                 :            : {
    1967                 :            :     // To avoid relay problems with transactions that were previously
    1968                 :            :     // confirmed, clear our filter of recently confirmed transactions whenever
    1969                 :            :     // there's a reorg.
    1970                 :            :     // This means that in a 1-block reorg (where 1 block is disconnected and
    1971                 :            :     // then another block reconnected), our filter will drop to having only one
    1972                 :            :     // block's worth of transactions in it, but that should be fine, since
    1973                 :            :     // presumably the most common case of relaying a confirmed transaction
    1974                 :            :     // should be just after a new block containing it is found.
    1975                 :          0 :     LOCK(m_recent_confirmed_transactions_mutex);
    1976         [ #  # ]:          0 :     m_recent_confirmed_transactions.reset();
    1977                 :          0 : }
    1978                 :            : 
    1979                 :            : /**
    1980                 :            :  * Maintain state about the best-seen block and fast-announce a compact block
    1981                 :            :  * to compatible peers.
    1982                 :            :  */
    1983                 :          0 : void PeerManagerImpl::NewPoWValidBlock(const CBlockIndex *pindex, const std::shared_ptr<const CBlock>& pblock)
    1984                 :            : {
    1985                 :          0 :     auto pcmpctblock = std::make_shared<const CBlockHeaderAndShortTxIDs>(*pblock);
    1986         [ #  # ]:          0 :     const CNetMsgMaker msgMaker(PROTOCOL_VERSION);
    1987                 :            : 
    1988         [ #  # ]:          0 :     LOCK(cs_main);
    1989                 :            : 
    1990         [ #  # ]:          0 :     if (pindex->nHeight <= m_highest_fast_announce)
    1991                 :          0 :         return;
    1992                 :          0 :     m_highest_fast_announce = pindex->nHeight;
    1993                 :            : 
    1994 [ #  # ][ #  # ]:          0 :     if (!DeploymentActiveAt(*pindex, m_chainman, Consensus::DEPLOYMENT_SEGWIT)) return;
    1995                 :            : 
    1996         [ #  # ]:          0 :     uint256 hashBlock(pblock->GetHash());
    1997                 :          0 :     const std::shared_future<CSerializedNetMsg> lazy_ser{
    1998 [ #  # ][ #  # ]:          0 :         std::async(std::launch::deferred, [&] { return msgMaker.Make(NetMsgType::CMPCTBLOCK, *pcmpctblock); })};
                 [ #  # ]
    1999                 :            : 
    2000                 :            :     {
    2001         [ #  # ]:          0 :         auto most_recent_block_txs = std::make_unique<std::map<uint256, CTransactionRef>>();
    2002         [ #  # ]:          0 :         for (const auto& tx : pblock->vtx) {
    2003         [ #  # ]:          0 :             most_recent_block_txs->emplace(tx->GetHash(), tx);
    2004         [ #  # ]:          0 :             most_recent_block_txs->emplace(tx->GetWitnessHash(), tx);
    2005                 :            :         }
    2006                 :            : 
    2007         [ #  # ]:          0 :         LOCK(m_most_recent_block_mutex);
    2008                 :          0 :         m_most_recent_block_hash = hashBlock;
    2009                 :          0 :         m_most_recent_block = pblock;
    2010                 :          0 :         m_most_recent_compact_block = pcmpctblock;
    2011                 :          0 :         m_most_recent_block_txs = std::move(most_recent_block_txs);
    2012                 :          0 :     }
    2013                 :            : 
    2014 [ #  # ][ #  # ]:          0 :     m_connman.ForEachNode([this, pindex, &lazy_ser, &hashBlock](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
    2015                 :          0 :         AssertLockHeld(::cs_main);
    2016                 :            : 
    2017 [ #  # ][ #  # ]:          0 :         if (pnode->GetCommonVersion() < INVALID_CB_NO_BAN_VERSION || pnode->fDisconnect)
    2018                 :          0 :             return;
    2019                 :          0 :         ProcessBlockAvailability(pnode->GetId());
    2020                 :          0 :         CNodeState &state = *State(pnode->GetId());
    2021                 :            :         // If the peer has, or we announced to them the previous block already,
    2022                 :            :         // but we don't think they have this one, go ahead and announce it
    2023 [ #  # ][ #  # ]:          0 :         if (state.m_requested_hb_cmpctblocks && !PeerHasHeader(&state, pindex) && PeerHasHeader(&state, pindex->pprev)) {
                 [ #  # ]
    2024                 :            : 
    2025 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "%s sending header-and-ids %s to peer=%d\n", "PeerManager::NewPoWValidBlock",
         [ #  # ][ #  # ]
                 [ #  # ]
    2026                 :            :                     hashBlock.ToString(), pnode->GetId());
    2027                 :            : 
    2028                 :          0 :             const CSerializedNetMsg& ser_cmpctblock{lazy_ser.get()};
    2029         [ #  # ]:          0 :             m_connman.PushMessage(pnode, ser_cmpctblock.Copy());
    2030                 :          0 :             state.pindexBestHeaderSent = pindex;
    2031                 :          0 :         }
    2032                 :          0 :     });
    2033         [ #  # ]:          0 : }
    2034                 :            : 
    2035                 :            : /**
    2036                 :            :  * Update our best height and announce any block hashes which weren't previously
    2037                 :            :  * in m_chainman.ActiveChain() to our peers.
    2038                 :            :  */
    2039                 :          0 : void PeerManagerImpl::UpdatedBlockTip(const CBlockIndex *pindexNew, const CBlockIndex *pindexFork, bool fInitialDownload)
    2040                 :            : {
    2041                 :          0 :     SetBestHeight(pindexNew->nHeight);
    2042                 :          0 :     SetServiceFlagsIBDCache(!fInitialDownload);
    2043                 :            : 
    2044                 :            :     // Don't relay inventory during initial block download.
    2045         [ #  # ]:          0 :     if (fInitialDownload) return;
    2046                 :            : 
    2047                 :            :     // Find the hashes of all blocks that weren't previously in the best chain.
    2048                 :          0 :     std::vector<uint256> vHashes;
    2049                 :          0 :     const CBlockIndex *pindexToAnnounce = pindexNew;
    2050         [ #  # ]:          0 :     while (pindexToAnnounce != pindexFork) {
    2051 [ #  # ][ #  # ]:          0 :         vHashes.push_back(pindexToAnnounce->GetBlockHash());
    2052                 :          0 :         pindexToAnnounce = pindexToAnnounce->pprev;
    2053         [ #  # ]:          0 :         if (vHashes.size() == MAX_BLOCKS_TO_ANNOUNCE) {
    2054                 :            :             // Limit announcements in case of a huge reorganization.
    2055                 :            :             // Rely on the peer's synchronization mechanism in that case.
    2056                 :          0 :             break;
    2057                 :            :         }
    2058                 :            :     }
    2059                 :            : 
    2060                 :            :     {
    2061 [ #  # ][ #  # ]:          0 :         LOCK(m_peer_mutex);
    2062         [ #  # ]:          0 :         for (auto& it : m_peer_map) {
    2063                 :          0 :             Peer& peer = *it.second;
    2064 [ #  # ][ #  # ]:          0 :             LOCK(peer.m_block_inv_mutex);
    2065 [ #  # ][ #  # ]:          0 :             for (const uint256& hash : reverse_iterate(vHashes)) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    2066         [ #  # ]:          0 :                 peer.m_blocks_for_headers_relay.push_back(hash);
    2067                 :            :             }
    2068                 :          0 :         }
    2069                 :          0 :     }
    2070                 :            : 
    2071         [ #  # ]:          0 :     m_connman.WakeMessageHandler();
    2072                 :          0 : }
    2073                 :            : 
    2074                 :            : /**
    2075                 :            :  * Handle invalid block rejection and consequent peer discouragement, maintain which
    2076                 :            :  * peers announce compact blocks.
    2077                 :            :  */
    2078                 :          0 : void PeerManagerImpl::BlockChecked(const CBlock& block, const BlockValidationState& state)
    2079                 :            : {
    2080                 :          0 :     LOCK(cs_main);
    2081                 :            : 
    2082         [ #  # ]:          0 :     const uint256 hash(block.GetHash());
    2083         [ #  # ]:          0 :     std::map<uint256, std::pair<NodeId, bool>>::iterator it = mapBlockSource.find(hash);
    2084                 :            : 
    2085                 :            :     // If the block failed validation, we know where it came from and we're still connected
    2086                 :            :     // to that peer, maybe punish.
    2087 [ #  # ][ #  # ]:          0 :     if (state.IsInvalid() &&
                 [ #  # ]
    2088         [ #  # ]:          0 :         it != mapBlockSource.end() &&
    2089         [ #  # ]:          0 :         State(it->second.first)) {
    2090 [ #  # ][ #  # ]:          0 :             MaybePunishNodeForBlock(/*nodeid=*/ it->second.first, state, /*via_compact_block=*/ !it->second.second);
    2091                 :          0 :     }
    2092                 :            :     // Check that:
    2093                 :            :     // 1. The block is valid
    2094                 :            :     // 2. We're not in initial block download
    2095                 :            :     // 3. This is currently the best block we're aware of. We haven't updated
    2096                 :            :     //    the tip yet so we have no way to check this directly here. Instead we
    2097                 :            :     //    just check that there are currently no other blocks in flight.
    2098 [ #  # ][ #  # ]:          0 :     else if (state.IsValid() &&
                 [ #  # ]
    2099 [ #  # ][ #  # ]:          0 :              !m_chainman.IsInitialBlockDownload() &&
    2100         [ #  # ]:          0 :              mapBlocksInFlight.count(hash) == mapBlocksInFlight.size()) {
    2101         [ #  # ]:          0 :         if (it != mapBlockSource.end()) {
    2102         [ #  # ]:          0 :             MaybeSetPeerAsAnnouncingHeaderAndIDs(it->second.first);
    2103                 :          0 :         }
    2104                 :          0 :     }
    2105         [ #  # ]:          0 :     if (it != mapBlockSource.end())
    2106         [ #  # ]:          0 :         mapBlockSource.erase(it);
    2107                 :          0 : }
    2108                 :            : 
    2109                 :            : //////////////////////////////////////////////////////////////////////////////
    2110                 :            : //
    2111                 :            : // Messages
    2112                 :            : //
    2113                 :            : 
    2114                 :            : 
    2115                 :          0 : bool PeerManagerImpl::AlreadyHaveTx(const GenTxid& gtxid)
    2116                 :            : {
    2117         [ #  # ]:          0 :     if (m_chainman.ActiveChain().Tip()->GetBlockHash() != hashRecentRejectsChainTip) {
    2118                 :            :         // If the chain tip has changed previously rejected transactions
    2119                 :            :         // might be now valid, e.g. due to a nLockTime'd tx becoming valid,
    2120                 :            :         // or a double-spend. Reset the rejects filter and give those
    2121                 :            :         // txs a second chance.
    2122                 :          0 :         hashRecentRejectsChainTip = m_chainman.ActiveChain().Tip()->GetBlockHash();
    2123                 :          0 :         m_recent_rejects.reset();
    2124                 :          0 :     }
    2125                 :            : 
    2126                 :          0 :     const uint256& hash = gtxid.GetHash();
    2127                 :            : 
    2128         [ #  # ]:          0 :     if (m_orphanage.HaveTx(gtxid)) return true;
    2129                 :            : 
    2130                 :            :     {
    2131                 :          0 :         LOCK(m_recent_confirmed_transactions_mutex);
    2132 [ #  # ][ #  # ]:          0 :         if (m_recent_confirmed_transactions.contains(hash)) return true;
                 [ #  # ]
    2133      [ #  #  # ]:          0 :     }
    2134                 :            : 
    2135         [ #  # ]:          0 :     return m_recent_rejects.contains(hash) || m_mempool.exists(gtxid);
    2136                 :          0 : }
    2137                 :            : 
    2138                 :          0 : bool PeerManagerImpl::AlreadyHaveBlock(const uint256& block_hash)
    2139                 :            : {
    2140                 :          0 :     return m_chainman.m_blockman.LookupBlockIndex(block_hash) != nullptr;
    2141                 :            : }
    2142                 :            : 
    2143                 :          0 : void PeerManagerImpl::SendPings()
    2144                 :            : {
    2145                 :          0 :     LOCK(m_peer_mutex);
    2146         [ #  # ]:          0 :     for(auto& it : m_peer_map) it.second->m_ping_queued = true;
    2147                 :          0 : }
    2148                 :            : 
    2149                 :          0 : void PeerManagerImpl::RelayTransaction(const uint256& txid, const uint256& wtxid)
    2150                 :            : {
    2151                 :          0 :     LOCK(m_peer_mutex);
    2152         [ #  # ]:          0 :     for(auto& it : m_peer_map) {
    2153                 :          0 :         Peer& peer = *it.second;
    2154         [ #  # ]:          0 :         auto tx_relay = peer.GetTxRelay();
    2155         [ #  # ]:          0 :         if (!tx_relay) continue;
    2156                 :            : 
    2157         [ #  # ]:          0 :         LOCK(tx_relay->m_tx_inventory_mutex);
    2158                 :            :         // Only queue transactions for announcement once the version handshake
    2159                 :            :         // is completed. The time of arrival for these transactions is
    2160                 :            :         // otherwise at risk of leaking to a spy, if the spy is able to
    2161                 :            :         // distinguish transactions received during the handshake from the rest
    2162                 :            :         // in the announcement.
    2163 [ #  # ][ #  # ]:          0 :         if (tx_relay->m_next_inv_send_time == 0s) continue;
                 [ #  # ]
    2164                 :            : 
    2165         [ #  # ]:          0 :         const uint256& hash{peer.m_wtxid_relay ? wtxid : txid};
    2166 [ #  # ][ #  # ]:          0 :         if (!tx_relay->m_tx_inventory_known_filter.contains(hash)) {
                 [ #  # ]
    2167         [ #  # ]:          0 :             tx_relay->m_tx_inventory_to_send.insert(hash);
    2168                 :          0 :         }
    2169      [ #  #  # ]:          0 :     };
    2170                 :          0 : }
    2171                 :            : 
    2172                 :          0 : void PeerManagerImpl::RelayAddress(NodeId originator,
    2173                 :            :                                    const CAddress& addr,
    2174                 :            :                                    bool fReachable)
    2175                 :            : {
    2176                 :            :     // We choose the same nodes within a given 24h window (if the list of connected
    2177                 :            :     // nodes does not change) and we don't relay to nodes that already know an
    2178                 :            :     // address. So within 24h we will likely relay a given address once. This is to
    2179                 :            :     // prevent a peer from unjustly giving their address better propagation by sending
    2180                 :            :     // it to us repeatedly.
    2181                 :            : 
    2182 [ #  # ][ #  # ]:          0 :     if (!fReachable && !addr.IsRelayable()) return;
    2183                 :            : 
    2184                 :            :     // Relay to a limited number of other nodes
    2185                 :            :     // Use deterministic randomness to send to the same nodes for 24 hours
    2186                 :            :     // at a time so the m_addr_knowns of the chosen nodes prevent repeats
    2187                 :          0 :     const uint64_t hash_addr{CServiceHash(0, 0)(addr)};
    2188                 :          0 :     const auto current_time{GetTime<std::chrono::seconds>()};
    2189                 :            :     // Adding address hash makes exact rotation time different per address, while preserving periodicity.
    2190                 :          0 :     const uint64_t time_addr{(static_cast<uint64_t>(count_seconds(current_time)) + hash_addr) / count_seconds(ROTATE_ADDR_RELAY_DEST_INTERVAL)};
    2191                 :          0 :     const CSipHasher hasher{m_connman.GetDeterministicRandomizer(RANDOMIZER_ID_ADDRESS_RELAY)
    2192                 :          0 :                                 .Write(hash_addr)
    2193                 :          0 :                                 .Write(time_addr)};
    2194                 :            : 
    2195                 :            :     // Relay reachable addresses to 2 peers. Unreachable addresses are relayed randomly to 1 or 2 peers.
    2196         [ #  # ]:          0 :     unsigned int nRelayNodes = (fReachable || (hasher.Finalize() & 1)) ? 2 : 1;
    2197                 :            : 
    2198                 :          0 :     std::array<std::pair<uint64_t, Peer*>, 2> best{{{0, nullptr}, {0, nullptr}}};
    2199         [ #  # ]:          0 :     assert(nRelayNodes <= best.size());
    2200                 :            : 
    2201                 :          0 :     LOCK(m_peer_mutex);
    2202                 :            : 
    2203         [ #  # ]:          0 :     for (auto& [id, peer] : m_peer_map) {
    2204 [ #  # ][ #  # ]:          0 :         if (peer->m_addr_relay_enabled && id != originator && IsAddrCompatible(*peer, addr)) {
         [ #  # ][ #  # ]
    2205 [ #  # ][ #  # ]:          0 :             uint64_t hashKey = CSipHasher(hasher).Write(id).Finalize();
                 [ #  # ]
    2206         [ #  # ]:          0 :             for (unsigned int i = 0; i < nRelayNodes; i++) {
    2207         [ #  # ]:          0 :                  if (hashKey > best[i].first) {
    2208         [ #  # ]:          0 :                      std::copy(best.begin() + i, best.begin() + nRelayNodes - 1, best.begin() + i + 1);
    2209         [ #  # ]:          0 :                      best[i] = std::make_pair(hashKey, peer.get());
    2210                 :          0 :                      break;
    2211                 :            :                  }
    2212                 :          0 :             }
    2213                 :          0 :         }
    2214                 :            :     };
    2215                 :            : 
    2216 [ #  # ][ #  # ]:          0 :     for (unsigned int i = 0; i < nRelayNodes && best[i].first != 0; i++) {
    2217         [ #  # ]:          0 :         PushAddress(*best[i].second, addr);
    2218                 :          0 :     }
    2219                 :          0 : }
    2220                 :            : 
    2221                 :          0 : void PeerManagerImpl::ProcessGetBlockData(CNode& pfrom, Peer& peer, const CInv& inv)
    2222                 :            : {
    2223                 :          0 :     std::shared_ptr<const CBlock> a_recent_block;
    2224                 :          0 :     std::shared_ptr<const CBlockHeaderAndShortTxIDs> a_recent_compact_block;
    2225                 :            :     {
    2226         [ #  # ]:          0 :         LOCK(m_most_recent_block_mutex);
    2227                 :          0 :         a_recent_block = m_most_recent_block;
    2228                 :          0 :         a_recent_compact_block = m_most_recent_compact_block;
    2229                 :          0 :     }
    2230                 :            : 
    2231                 :          0 :     bool need_activate_chain = false;
    2232                 :            :     {
    2233         [ #  # ]:          0 :         LOCK(cs_main);
    2234         [ #  # ]:          0 :         const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(inv.hash);
    2235         [ #  # ]:          0 :         if (pindex) {
    2236 [ #  # ][ #  # ]:          0 :             if (pindex->HaveNumChainTxs() && !pindex->IsValid(BLOCK_VALID_SCRIPTS) &&
         [ #  # ][ #  # ]
                 [ #  # ]
    2237         [ #  # ]:          0 :                     pindex->IsValid(BLOCK_VALID_TREE)) {
    2238                 :            :                 // If we have the block and all of its parents, but have not yet validated it,
    2239                 :            :                 // we might be in the middle of connecting it (ie in the unlock of cs_main
    2240                 :            :                 // before ActivateBestChain but after AcceptBlock).
    2241                 :            :                 // In this case, we need to run ActivateBestChain prior to checking the relay
    2242                 :            :                 // conditions below.
    2243                 :          0 :                 need_activate_chain = true;
    2244                 :          0 :             }
    2245                 :          0 :         }
    2246                 :          0 :     } // release cs_main before calling ActivateBestChain
    2247         [ #  # ]:          0 :     if (need_activate_chain) {
    2248                 :          0 :         BlockValidationState state;
    2249 [ #  # ][ #  # ]:          0 :         if (!m_chainman.ActiveChainstate().ActivateBestChain(state, a_recent_block)) {
                 [ #  # ]
    2250 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "failed to activate chain (%s)\n", state.ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    2251                 :          0 :         }
    2252                 :          0 :     }
    2253                 :            : 
    2254         [ #  # ]:          0 :     LOCK(cs_main);
    2255         [ #  # ]:          0 :     const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(inv.hash);
    2256         [ #  # ]:          0 :     if (!pindex) {
    2257                 :          0 :         return;
    2258                 :            :     }
    2259 [ #  # ][ #  # ]:          0 :     if (!BlockRequestAllowed(pindex)) {
    2260 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "%s: ignoring request from peer=%i for old block that isn't in the main chain\n", __func__, pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    2261                 :          0 :         return;
    2262                 :            :     }
    2263         [ #  # ]:          0 :     const CNetMsgMaker msgMaker(pfrom.GetCommonVersion());
    2264                 :            :     // disconnect node in case we have reached the outbound limit for serving historical blocks
    2265 [ #  # ][ #  # ]:          0 :     if (m_connman.OutboundTargetReached(true) &&
                 [ #  # ]
    2266 [ #  # ][ #  # ]:          0 :         (((m_chainman.m_best_header != nullptr) && (m_chainman.m_best_header->GetBlockTime() - pindex->GetBlockTime() > HISTORICAL_BLOCK_AGE)) || inv.IsMsgFilteredBlk()) &&
         [ #  # ][ #  # ]
    2267         [ #  # ]:          0 :         !pfrom.HasPermission(NetPermissionFlags::Download) // nodes with the download permission may exceed target
    2268                 :            :     ) {
    2269 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "historical block serving limit reached, disconnect peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    2270                 :          0 :         pfrom.fDisconnect = true;
    2271                 :          0 :         return;
    2272                 :            :     }
    2273                 :            :     // Avoid leaking prune-height by never sending blocks below the NODE_NETWORK_LIMITED threshold
    2274 [ #  # ][ #  # ]:          0 :     if (!pfrom.HasPermission(NetPermissionFlags::NoBan) && (
                 [ #  # ]
    2275 [ #  # ][ #  # ]:          0 :             (((peer.m_our_services & NODE_NETWORK_LIMITED) == NODE_NETWORK_LIMITED) && ((peer.m_our_services & NODE_NETWORK) != NODE_NETWORK) && (m_chainman.ActiveChain().Tip()->nHeight - pindex->nHeight > (int)NODE_NETWORK_LIMITED_MIN_BLOCKS + 2 /* add two blocks buffer extension for possible races */) )
                 [ #  # ]
    2276                 :            :        )) {
    2277 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Ignore block request below NODE_NETWORK_LIMITED threshold, disconnect peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    2278                 :            :         //disconnect node and prevent it from stalling (would otherwise wait for the missing block)
    2279                 :          0 :         pfrom.fDisconnect = true;
    2280                 :          0 :         return;
    2281                 :            :     }
    2282                 :            :     // Pruned nodes may have deleted the block, so check whether
    2283                 :            :     // it's available before trying to send.
    2284         [ #  # ]:          0 :     if (!(pindex->nStatus & BLOCK_HAVE_DATA)) {
    2285                 :          0 :         return;
    2286                 :            :     }
    2287                 :          0 :     std::shared_ptr<const CBlock> pblock;
    2288 [ #  # ][ #  # ]:          0 :     if (a_recent_block && a_recent_block->GetHash() == pindex->GetBlockHash()) {
         [ #  # ][ #  # ]
    2289                 :          0 :         pblock = a_recent_block;
    2290 [ #  # ][ #  # ]:          0 :     } else if (inv.IsMsgWitnessBlk()) {
    2291                 :            :         // Fast-path: in this case it is possible to serve the block directly from disk,
    2292                 :            :         // as the network format matches the format on disk
    2293                 :          0 :         std::vector<uint8_t> block_data;
    2294 [ #  # ][ #  # ]:          0 :         if (!m_chainman.m_blockman.ReadRawBlockFromDisk(block_data, pindex->GetBlockPos())) {
                 [ #  # ]
    2295                 :          0 :             assert(!"cannot load block from disk");
    2296                 :            :         }
    2297 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::BLOCK, Span{block_data}));
         [ #  # ][ #  # ]
    2298                 :            :         // Don't set pblock as we've sent the block
    2299                 :          0 :     } else {
    2300                 :            :         // Send block from disk
    2301         [ #  # ]:          0 :         std::shared_ptr<CBlock> pblockRead = std::make_shared<CBlock>();
    2302 [ #  # ][ #  # ]:          0 :         if (!m_chainman.m_blockman.ReadBlockFromDisk(*pblockRead, *pindex)) {
    2303                 :          0 :             assert(!"cannot load block from disk");
    2304                 :            :         }
    2305                 :          0 :         pblock = pblockRead;
    2306                 :          0 :     }
    2307         [ #  # ]:          0 :     if (pblock) {
    2308         [ #  # ]:          0 :         if (inv.IsMsgBlk()) {
    2309 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msgMaker.Make(SERIALIZE_TRANSACTION_NO_WITNESS, NetMsgType::BLOCK, *pblock));
                 [ #  # ]
    2310 [ #  # ][ #  # ]:          0 :         } else if (inv.IsMsgWitnessBlk()) {
    2311 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::BLOCK, *pblock));
                 [ #  # ]
    2312 [ #  # ][ #  # ]:          0 :         } else if (inv.IsMsgFilteredBlk()) {
    2313                 :          0 :             bool sendMerkleBlock = false;
    2314         [ #  # ]:          0 :             CMerkleBlock merkleBlock;
    2315 [ #  # ][ #  # ]:          0 :             if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
    2316         [ #  # ]:          0 :                 LOCK(tx_relay->m_bloom_filter_mutex);
    2317         [ #  # ]:          0 :                 if (tx_relay->m_bloom_filter) {
    2318                 :          0 :                     sendMerkleBlock = true;
    2319         [ #  # ]:          0 :                     merkleBlock = CMerkleBlock(*pblock, *tx_relay->m_bloom_filter);
    2320                 :          0 :                 }
    2321                 :          0 :             }
    2322         [ #  # ]:          0 :             if (sendMerkleBlock) {
    2323 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::MERKLEBLOCK, merkleBlock));
                 [ #  # ]
    2324                 :            :                 // CMerkleBlock just contains hashes, so also push any transactions in the block the client did not see
    2325                 :            :                 // This avoids hurting performance by pointlessly requiring a round-trip
    2326                 :            :                 // Note that there is currently no way for a node to request any single transactions we didn't send here -
    2327                 :            :                 // they must either disconnect and retry or request the full block.
    2328                 :            :                 // Thus, the protocol spec specified allows for us to provide duplicate txn here,
    2329                 :            :                 // however we MUST always provide at least what the remote peer needs
    2330                 :            :                 typedef std::pair<unsigned int, uint256> PairType;
    2331         [ #  # ]:          0 :                 for (PairType& pair : merkleBlock.vMatchedTxn)
    2332 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(&pfrom, msgMaker.Make(SERIALIZE_TRANSACTION_NO_WITNESS, NetMsgType::TX, *pblock->vtx[pair.first]));
                 [ #  # ]
    2333                 :          0 :             }
    2334                 :            :             // else
    2335                 :            :             // no response
    2336 [ #  # ][ #  # ]:          0 :         } else if (inv.IsMsgCmpctBlk()) {
    2337                 :            :             // If a peer is asking for old blocks, we're almost guaranteed
    2338                 :            :             // they won't have a useful mempool to match against a compact block,
    2339                 :            :             // and we don't feel like constructing the object for them, so
    2340                 :            :             // instead we respond with the full, non-compact block.
    2341 [ #  # ][ #  # ]:          0 :             if (CanDirectFetch() && pindex->nHeight >= m_chainman.ActiveChain().Height() - MAX_CMPCTBLOCK_DEPTH) {
         [ #  # ][ #  # ]
                 [ #  # ]
    2342 [ #  # ][ #  # ]:          0 :                 if (a_recent_compact_block && a_recent_compact_block->header.GetHash() == pindex->GetBlockHash()) {
         [ #  # ][ #  # ]
    2343 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::CMPCTBLOCK, *a_recent_compact_block));
                 [ #  # ]
    2344                 :          0 :                 } else {
    2345         [ #  # ]:          0 :                     CBlockHeaderAndShortTxIDs cmpctblock{*pblock};
    2346 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::CMPCTBLOCK, cmpctblock));
                 [ #  # ]
    2347                 :          0 :                 }
    2348                 :          0 :             } else {
    2349 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::BLOCK, *pblock));
                 [ #  # ]
    2350                 :            :             }
    2351                 :          0 :         }
    2352                 :          0 :     }
    2353                 :            : 
    2354                 :            :     {
    2355         [ #  # ]:          0 :         LOCK(peer.m_block_inv_mutex);
    2356                 :            :         // Trigger the peer node to send a getblocks request for the next batch of inventory
    2357 [ #  # ][ #  # ]:          0 :         if (inv.hash == peer.m_continuation_block) {
    2358                 :            :             // Send immediately. This must send even if redundant,
    2359                 :            :             // and we want it right after the last block so they don't
    2360                 :            :             // wait for other stuff first.
    2361                 :          0 :             std::vector<CInv> vInv;
    2362 [ #  # ][ #  # ]:          0 :             vInv.emplace_back(MSG_BLOCK, m_chainman.ActiveChain().Tip()->GetBlockHash());
    2363 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::INV, vInv));
                 [ #  # ]
    2364         [ #  # ]:          0 :             peer.m_continuation_block.SetNull();
    2365                 :          0 :         }
    2366                 :          0 :     }
    2367         [ #  # ]:          0 : }
    2368                 :            : 
    2369                 :          0 : CTransactionRef PeerManagerImpl::FindTxForGetData(const Peer::TxRelay& tx_relay, const GenTxid& gtxid)
    2370                 :            : {
    2371                 :            :     // If a tx was in the mempool prior to the last INV for this peer, permit the request.
    2372                 :          0 :     auto txinfo = m_mempool.info_for_relay(gtxid, tx_relay.m_last_inv_sequence);
    2373         [ #  # ]:          0 :     if (txinfo.tx) {
    2374                 :          0 :         return std::move(txinfo.tx);
    2375                 :            :     }
    2376                 :            : 
    2377                 :            :     // Or it might be from the most recent block
    2378                 :            :     {
    2379         [ #  # ]:          0 :         LOCK(m_most_recent_block_mutex);
    2380         [ #  # ]:          0 :         if (m_most_recent_block_txs != nullptr) {
    2381         [ #  # ]:          0 :             auto it = m_most_recent_block_txs->find(gtxid.GetHash());
    2382         [ #  # ]:          0 :             if (it != m_most_recent_block_txs->end()) return it->second;
    2383                 :          0 :         }
    2384         [ #  # ]:          0 :     }
    2385                 :            : 
    2386                 :          0 :     return {};
    2387                 :          0 : }
    2388                 :            : 
    2389                 :          0 : void PeerManagerImpl::ProcessGetData(CNode& pfrom, Peer& peer, const std::atomic<bool>& interruptMsgProc)
    2390                 :            : {
    2391                 :          0 :     AssertLockNotHeld(cs_main);
    2392                 :            : 
    2393                 :          0 :     auto tx_relay = peer.GetTxRelay();
    2394                 :            : 
    2395                 :          0 :     std::deque<CInv>::iterator it = peer.m_getdata_requests.begin();
    2396                 :          0 :     std::vector<CInv> vNotFound;
    2397         [ #  # ]:          0 :     const CNetMsgMaker msgMaker(pfrom.GetCommonVersion());
    2398                 :            : 
    2399                 :            :     // Process as many TX items from the front of the getdata queue as
    2400                 :            :     // possible, since they're common and it's efficient to batch process
    2401                 :            :     // them.
    2402 [ #  # ][ #  # ]:          0 :     while (it != peer.m_getdata_requests.end() && it->IsGenTxMsg()) {
    2403         [ #  # ]:          0 :         if (interruptMsgProc) return;
    2404                 :            :         // The send buffer provides backpressure. If there's no space in
    2405                 :            :         // the buffer, pause processing until the next call.
    2406         [ #  # ]:          0 :         if (pfrom.fPauseSend) break;
    2407                 :            : 
    2408                 :          0 :         const CInv &inv = *it++;
    2409                 :            : 
    2410         [ #  # ]:          0 :         if (tx_relay == nullptr) {
    2411                 :            :             // Ignore GETDATA requests for transactions from block-relay-only
    2412                 :            :             // peers and peers that asked us not to announce transactions.
    2413                 :          0 :             continue;
    2414                 :            :         }
    2415                 :            : 
    2416 [ #  # ][ #  # ]:          0 :         CTransactionRef tx = FindTxForGetData(*tx_relay, ToGenTxid(inv));
    2417         [ #  # ]:          0 :         if (tx) {
    2418                 :            :             // WTX and WITNESS_TX imply we serialize with witness
    2419                 :          0 :             int nSendFlags = (inv.IsMsgTx() ? SERIALIZE_TRANSACTION_NO_WITNESS : 0);
    2420 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msgMaker.Make(nSendFlags, NetMsgType::TX, *tx));
                 [ #  # ]
    2421         [ #  # ]:          0 :             m_mempool.RemoveUnbroadcastTx(tx->GetHash());
    2422                 :          0 :         } else {
    2423         [ #  # ]:          0 :             vNotFound.push_back(inv);
    2424                 :            :         }
    2425                 :          0 :     }
    2426                 :            : 
    2427                 :            :     // Only process one BLOCK item per call, since they're uncommon and can be
    2428                 :            :     // expensive to process.
    2429 [ #  # ][ #  # ]:          0 :     if (it != peer.m_getdata_requests.end() && !pfrom.fPauseSend) {
    2430                 :          0 :         const CInv &inv = *it++;
    2431 [ #  # ][ #  # ]:          0 :         if (inv.IsGenBlkMsg()) {
    2432         [ #  # ]:          0 :             ProcessGetBlockData(pfrom, peer, inv);
    2433                 :          0 :         }
    2434                 :            :         // else: If the first item on the queue is an unknown type, we erase it
    2435                 :            :         // and continue processing the queue on the next call.
    2436                 :          0 :     }
    2437                 :            : 
    2438         [ #  # ]:          0 :     peer.m_getdata_requests.erase(peer.m_getdata_requests.begin(), it);
    2439                 :            : 
    2440         [ #  # ]:          0 :     if (!vNotFound.empty()) {
    2441                 :            :         // Let the peer know that we didn't find what it asked for, so it doesn't
    2442                 :            :         // have to wait around forever.
    2443                 :            :         // SPV clients care about this message: it's needed when they are
    2444                 :            :         // recursively walking the dependencies of relevant unconfirmed
    2445                 :            :         // transactions. SPV clients want to do that because they want to know
    2446                 :            :         // about (and store and rebroadcast and risk analyze) the dependencies
    2447                 :            :         // of transactions relevant to them, without having to download the
    2448                 :            :         // entire memory pool.
    2449                 :            :         // Also, other nodes can use these messages to automatically request a
    2450                 :            :         // transaction from some other peer that annnounced it, and stop
    2451                 :            :         // waiting for us to respond.
    2452                 :            :         // In normal operation, we often send NOTFOUND messages for parents of
    2453                 :            :         // transactions that we relay; if a peer is missing a parent, they may
    2454                 :            :         // assume we have them and request the parents from us.
    2455 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::NOTFOUND, vNotFound));
                 [ #  # ]
    2456                 :          0 :     }
    2457         [ #  # ]:          0 : }
    2458                 :            : 
    2459                 :          0 : uint32_t PeerManagerImpl::GetFetchFlags(const Peer& peer) const
    2460                 :            : {
    2461                 :          0 :     uint32_t nFetchFlags = 0;
    2462         [ #  # ]:          0 :     if (CanServeWitnesses(peer)) {
    2463                 :          0 :         nFetchFlags |= MSG_WITNESS_FLAG;
    2464                 :          0 :     }
    2465                 :          0 :     return nFetchFlags;
    2466                 :            : }
    2467                 :            : 
    2468                 :          0 : void PeerManagerImpl::SendBlockTransactions(CNode& pfrom, Peer& peer, const CBlock& block, const BlockTransactionsRequest& req)
    2469                 :            : {
    2470                 :          0 :     BlockTransactions resp(req);
    2471         [ #  # ]:          0 :     for (size_t i = 0; i < req.indexes.size(); i++) {
    2472         [ #  # ]:          0 :         if (req.indexes[i] >= block.vtx.size()) {
    2473 [ #  # ][ #  # ]:          0 :             Misbehaving(peer, 100, "getblocktxn with out-of-bounds tx indices");
    2474                 :          0 :             return;
    2475                 :            :         }
    2476                 :          0 :         resp.txn[i] = block.vtx[req.indexes[i]];
    2477                 :          0 :     }
    2478                 :            : 
    2479         [ #  # ]:          0 :     const CNetMsgMaker msgMaker(pfrom.GetCommonVersion());
    2480 [ #  # ][ #  # ]:          0 :     m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::BLOCKTXN, resp));
                 [ #  # ]
    2481         [ #  # ]:          0 : }
    2482                 :            : 
    2483                 :          0 : bool PeerManagerImpl::CheckHeadersPoW(const std::vector<CBlockHeader>& headers, const Consensus::Params& consensusParams, Peer& peer)
    2484                 :            : {
    2485                 :            :     // Do these headers have proof-of-work matching what's claimed?
    2486         [ #  # ]:          0 :     if (!HasValidProofOfWork(headers, consensusParams)) {
    2487 [ #  # ][ #  # ]:          0 :         Misbehaving(peer, 100, "header with invalid proof of work");
    2488                 :          0 :         return false;
    2489                 :            :     }
    2490                 :            : 
    2491                 :            :     // Are these headers connected to each other?
    2492         [ #  # ]:          0 :     if (!CheckHeadersAreContinuous(headers)) {
    2493 [ #  # ][ #  # ]:          0 :         Misbehaving(peer, 20, "non-continuous headers sequence");
    2494                 :          0 :         return false;
    2495                 :            :     }
    2496                 :          0 :     return true;
    2497                 :          0 : }
    2498                 :            : 
    2499                 :          0 : arith_uint256 PeerManagerImpl::GetAntiDoSWorkThreshold()
    2500                 :            : {
    2501                 :          0 :     arith_uint256 near_chaintip_work = 0;
    2502                 :          0 :     LOCK(cs_main);
    2503 [ #  # ][ #  # ]:          0 :     if (m_chainman.ActiveChain().Tip() != nullptr) {
    2504         [ #  # ]:          0 :         const CBlockIndex *tip = m_chainman.ActiveChain().Tip();
    2505                 :            :         // Use a 144 block buffer, so that we'll accept headers that fork from
    2506                 :            :         // near our tip.
    2507 [ #  # ][ #  # ]:          0 :         near_chaintip_work = tip->nChainWork - std::min<arith_uint256>(144*GetBlockProof(*tip), tip->nChainWork);
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    2508                 :          0 :     }
    2509 [ #  # ][ #  # ]:          0 :     return std::max(near_chaintip_work, m_chainman.MinimumChainWork());
                 [ #  # ]
    2510                 :          0 : }
    2511                 :            : 
    2512                 :            : /**
    2513                 :            :  * Special handling for unconnecting headers that might be part of a block
    2514                 :            :  * announcement.
    2515                 :            :  *
    2516                 :            :  * We'll send a getheaders message in response to try to connect the chain.
    2517                 :            :  *
    2518                 :            :  * The peer can send up to MAX_NUM_UNCONNECTING_HEADERS_MSGS in a row that
    2519                 :            :  * don't connect before given DoS points.
    2520                 :            :  *
    2521                 :            :  * Once a headers message is received that is valid and does connect,
    2522                 :            :  * m_num_unconnecting_headers_msgs gets reset back to 0.
    2523                 :            :  */
    2524                 :          0 : void PeerManagerImpl::HandleFewUnconnectingHeaders(CNode& pfrom, Peer& peer,
    2525                 :            :         const std::vector<CBlockHeader>& headers)
    2526                 :            : {
    2527                 :          0 :     peer.m_num_unconnecting_headers_msgs++;
    2528                 :            :     // Try to fill in the missing headers.
    2529                 :          0 :     const CBlockIndex* best_header{WITH_LOCK(cs_main, return m_chainman.m_best_header)};
    2530 [ #  # ][ #  # ]:          0 :     if (MaybeSendGetHeaders(pfrom, GetLocator(best_header), peer)) {
    2531 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "received header %s: missing prev block %s, sending getheaders (%d) to end (peer=%d, m_num_unconnecting_headers_msgs=%d)\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    2532                 :            :             headers[0].GetHash().ToString(),
    2533                 :            :             headers[0].hashPrevBlock.ToString(),
    2534                 :            :             best_header->nHeight,
    2535                 :            :             pfrom.GetId(), peer.m_num_unconnecting_headers_msgs);
    2536                 :          0 :     }
    2537                 :            : 
    2538                 :            :     // Set hashLastUnknownBlock for this peer, so that if we
    2539                 :            :     // eventually get the headers - even from a different peer -
    2540                 :            :     // we can use this peer to download.
    2541 [ #  # ][ #  # ]:          0 :     WITH_LOCK(cs_main, UpdateBlockAvailability(pfrom.GetId(), headers.back().GetHash()));
    2542                 :            : 
    2543                 :            :     // The peer may just be broken, so periodically assign DoS points if this
    2544                 :            :     // condition persists.
    2545         [ #  # ]:          0 :     if (peer.m_num_unconnecting_headers_msgs % MAX_NUM_UNCONNECTING_HEADERS_MSGS == 0) {
    2546         [ #  # ]:          0 :         Misbehaving(peer, 20, strprintf("%d non-connecting headers", peer.m_num_unconnecting_headers_msgs));
    2547                 :          0 :     }
    2548                 :          0 : }
    2549                 :            : 
    2550                 :          0 : bool PeerManagerImpl::CheckHeadersAreContinuous(const std::vector<CBlockHeader>& headers) const
    2551                 :            : {
    2552                 :          0 :     uint256 hashLastBlock;
    2553         [ #  # ]:          0 :     for (const CBlockHeader& header : headers) {
    2554 [ #  # ][ #  # ]:          0 :         if (!hashLastBlock.IsNull() && header.hashPrevBlock != hashLastBlock) {
    2555                 :          0 :             return false;
    2556                 :            :         }
    2557                 :          0 :         hashLastBlock = header.GetHash();
    2558                 :            :     }
    2559                 :          0 :     return true;
    2560                 :          0 : }
    2561                 :            : 
    2562                 :          0 : bool PeerManagerImpl::IsContinuationOfLowWorkHeadersSync(Peer& peer, CNode& pfrom, std::vector<CBlockHeader>& headers)
    2563                 :            : {
    2564         [ #  # ]:          0 :     if (peer.m_headers_sync) {
    2565                 :          0 :         auto result = peer.m_headers_sync->ProcessNextHeaders(headers, headers.size() == MAX_HEADERS_RESULTS);
    2566         [ #  # ]:          0 :         if (result.request_more) {
    2567         [ #  # ]:          0 :             auto locator = peer.m_headers_sync->NextHeadersRequestLocator();
    2568                 :            :             // If we were instructed to ask for a locator, it should not be empty.
    2569         [ #  # ]:          0 :             Assume(!locator.vHave.empty());
    2570         [ #  # ]:          0 :             if (!locator.vHave.empty()) {
    2571                 :            :                 // It should be impossible for the getheaders request to fail,
    2572                 :            :                 // because we should have cleared the last getheaders timestamp
    2573                 :            :                 // when processing the headers that triggered this call. But
    2574                 :            :                 // it may be possible to bypass this via compactblock
    2575                 :            :                 // processing, so check the result before logging just to be
    2576                 :            :                 // safe.
    2577         [ #  # ]:          0 :                 bool sent_getheaders = MaybeSendGetHeaders(pfrom, locator, peer);
    2578         [ #  # ]:          0 :                 if (sent_getheaders) {
    2579 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "more getheaders (from %s) to peer=%d\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    2580                 :            :                             locator.vHave.front().ToString(), pfrom.GetId());
    2581                 :          0 :                 } else {
    2582 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "error sending next getheaders (from %s) to continue sync with peer=%d\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    2583                 :            :                             locator.vHave.front().ToString(), pfrom.GetId());
    2584                 :            :                 }
    2585                 :          0 :             }
    2586                 :          0 :         }
    2587                 :            : 
    2588 [ #  # ][ #  # ]:          0 :         if (peer.m_headers_sync->GetState() == HeadersSyncState::State::FINAL) {
    2589                 :          0 :             peer.m_headers_sync.reset(nullptr);
    2590                 :            : 
    2591                 :            :             // Delete this peer's entry in m_headers_presync_stats.
    2592                 :            :             // If this is m_headers_presync_bestpeer, it will be replaced later
    2593                 :            :             // by the next peer that triggers the else{} branch below.
    2594         [ #  # ]:          0 :             LOCK(m_headers_presync_mutex);
    2595         [ #  # ]:          0 :             m_headers_presync_stats.erase(pfrom.GetId());
    2596                 :          0 :         } else {
    2597                 :            :             // Build statistics for this peer's sync.
    2598         [ #  # ]:          0 :             HeadersPresyncStats stats;
    2599 [ #  # ][ #  # ]:          0 :             stats.first = peer.m_headers_sync->GetPresyncWork();
    2600 [ #  # ][ #  # ]:          0 :             if (peer.m_headers_sync->GetState() == HeadersSyncState::State::PRESYNC) {
    2601         [ #  # ]:          0 :                 stats.second = {peer.m_headers_sync->GetPresyncHeight(),
    2602         [ #  # ]:          0 :                                 peer.m_headers_sync->GetPresyncTime()};
    2603                 :          0 :             }
    2604                 :            : 
    2605                 :            :             // Update statistics in stats.
    2606         [ #  # ]:          0 :             LOCK(m_headers_presync_mutex);
    2607 [ #  # ][ #  # ]:          0 :             m_headers_presync_stats[pfrom.GetId()] = stats;
    2608         [ #  # ]:          0 :             auto best_it = m_headers_presync_stats.find(m_headers_presync_bestpeer);
    2609                 :          0 :             bool best_updated = false;
    2610         [ #  # ]:          0 :             if (best_it == m_headers_presync_stats.end()) {
    2611                 :            :                 // If the cached best peer is outdated, iterate over all remaining ones (including
    2612                 :            :                 // newly updated one) to find the best one.
    2613                 :          0 :                 NodeId peer_best{-1};
    2614                 :          0 :                 const HeadersPresyncStats* stat_best{nullptr};
    2615         [ #  # ]:          0 :                 for (const auto& [peer, stat] : m_headers_presync_stats) {
    2616 [ #  # ][ #  # ]:          0 :                     if (!stat_best || stat > *stat_best) {
                 [ #  # ]
    2617                 :          0 :                         peer_best = peer;
    2618                 :          0 :                         stat_best = &stat;
    2619                 :          0 :                     }
    2620                 :            :                 }
    2621                 :          0 :                 m_headers_presync_bestpeer = peer_best;
    2622                 :          0 :                 best_updated = (peer_best == pfrom.GetId());
    2623 [ #  # ][ #  # ]:          0 :             } else if (best_it->first == pfrom.GetId() || stats > best_it->second) {
                 [ #  # ]
    2624                 :            :                 // pfrom was and remains the best peer, or pfrom just became best.
    2625                 :          0 :                 m_headers_presync_bestpeer = pfrom.GetId();
    2626                 :          0 :                 best_updated = true;
    2627                 :          0 :             }
    2628 [ #  # ][ #  # ]:          0 :             if (best_updated && stats.second.has_value()) {
    2629                 :            :                 // If the best peer updated, and it is in its first phase, signal.
    2630                 :          0 :                 m_headers_presync_should_signal = true;
    2631                 :          0 :             }
    2632                 :          0 :         }
    2633                 :            : 
    2634         [ #  # ]:          0 :         if (result.success) {
    2635                 :            :             // We only overwrite the headers passed in if processing was
    2636                 :            :             // successful.
    2637                 :          0 :             headers.swap(result.pow_validated_headers);
    2638                 :          0 :         }
    2639                 :            : 
    2640                 :          0 :         return result.success;
    2641                 :          0 :     }
    2642                 :            :     // Either we didn't have a sync in progress, or something went wrong
    2643                 :            :     // processing these headers, or we are returning headers to the caller to
    2644                 :            :     // process.
    2645                 :          0 :     return false;
    2646                 :          0 : }
    2647                 :            : 
    2648                 :          0 : bool PeerManagerImpl::TryLowWorkHeadersSync(Peer& peer, CNode& pfrom, const CBlockIndex* chain_start_header, std::vector<CBlockHeader>& headers)
    2649                 :            : {
    2650                 :            :     // Calculate the total work on this chain.
    2651                 :          0 :     arith_uint256 total_work = chain_start_header->nChainWork + CalculateHeadersWork(headers);
    2652                 :            : 
    2653                 :            :     // Our dynamic anti-DoS threshold (minimum work required on a headers chain
    2654                 :            :     // before we'll store it)
    2655                 :          0 :     arith_uint256 minimum_chain_work = GetAntiDoSWorkThreshold();
    2656                 :            : 
    2657                 :            :     // Avoid DoS via low-difficulty-headers by only processing if the headers
    2658                 :            :     // are part of a chain with sufficient work.
    2659         [ #  # ]:          0 :     if (total_work < minimum_chain_work) {
    2660                 :            :         // Only try to sync with this peer if their headers message was full;
    2661                 :            :         // otherwise they don't have more headers after this so no point in
    2662                 :            :         // trying to sync their too-little-work chain.
    2663         [ #  # ]:          0 :         if (headers.size() == MAX_HEADERS_RESULTS) {
    2664                 :            :             // Note: we could advance to the last header in this set that is
    2665                 :            :             // known to us, rather than starting at the first header (which we
    2666                 :            :             // may already have); however this is unlikely to matter much since
    2667                 :            :             // ProcessHeadersMessage() already handles the case where all
    2668                 :            :             // headers in a received message are already known and are
    2669                 :            :             // ancestors of m_best_header or chainActive.Tip(), by skipping
    2670                 :            :             // this logic in that case. So even if the first header in this set
    2671                 :            :             // of headers is known, some header in this set must be new, so
    2672                 :            :             // advancing to the first unknown header would be a small effect.
    2673                 :          0 :             LOCK(peer.m_headers_sync_mutex);
    2674 [ #  # ][ #  # ]:          0 :             peer.m_headers_sync.reset(new HeadersSyncState(peer.m_id, m_chainparams.GetConsensus(),
                 [ #  # ]
    2675                 :          0 :                 chain_start_header, minimum_chain_work));
    2676                 :            : 
    2677                 :            :             // Now a HeadersSyncState object for tracking this synchronization
    2678                 :            :             // is created, process the headers using it as normal. Failures are
    2679                 :            :             // handled inside of IsContinuationOfLowWorkHeadersSync.
    2680         [ #  # ]:          0 :             (void)IsContinuationOfLowWorkHeadersSync(peer, pfrom, headers);
    2681                 :          0 :         } else {
    2682 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Ignoring low-work chain (height=%u) from peer=%d\n", chain_start_header->nHeight + headers.size(), pfrom.GetId());
         [ #  # ][ #  # ]
    2683                 :            :         }
    2684                 :            : 
    2685                 :            :         // The peer has not yet given us a chain that meets our work threshold,
    2686                 :            :         // so we want to prevent further processing of the headers in any case.
    2687                 :          0 :         headers = {};
    2688                 :          0 :         return true;
    2689                 :            :     }
    2690                 :            : 
    2691                 :          0 :     return false;
    2692                 :          0 : }
    2693                 :            : 
    2694                 :          0 : bool PeerManagerImpl::IsAncestorOfBestHeaderOrTip(const CBlockIndex* header)
    2695                 :            : {
    2696         [ #  # ]:          0 :     if (header == nullptr) {
    2697                 :          0 :         return false;
    2698 [ #  # ][ #  # ]:          0 :     } else if (m_chainman.m_best_header != nullptr && header == m_chainman.m_best_header->GetAncestor(header->nHeight)) {
    2699                 :          0 :         return true;
    2700         [ #  # ]:          0 :     } else if (m_chainman.ActiveChain().Contains(header)) {
    2701                 :          0 :         return true;
    2702                 :            :     }
    2703                 :          0 :     return false;
    2704                 :          0 : }
    2705                 :            : 
    2706                 :          0 : bool PeerManagerImpl::MaybeSendGetHeaders(CNode& pfrom, const CBlockLocator& locator, Peer& peer)
    2707                 :            : {
    2708                 :          0 :     const CNetMsgMaker msgMaker(pfrom.GetCommonVersion());
    2709                 :            : 
    2710                 :          0 :     const auto current_time = NodeClock::now();
    2711                 :            : 
    2712                 :            :     // Only allow a new getheaders message to go out if we don't have a recent
    2713                 :            :     // one already in-flight
    2714         [ #  # ]:          0 :     if (current_time - peer.m_last_getheaders_timestamp > HEADERS_RESPONSE_TIME) {
    2715 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETHEADERS, locator, uint256()));
         [ #  # ][ #  # ]
    2716                 :          0 :         peer.m_last_getheaders_timestamp = current_time;
    2717                 :          0 :         return true;
    2718                 :            :     }
    2719                 :          0 :     return false;
    2720                 :          0 : }
    2721                 :            : 
    2722                 :            : /*
    2723                 :            :  * Given a new headers tip ending in last_header, potentially request blocks towards that tip.
    2724                 :            :  * We require that the given tip have at least as much work as our tip, and for
    2725                 :            :  * our current tip to be "close to synced" (see CanDirectFetch()).
    2726                 :            :  */
    2727                 :          0 : void PeerManagerImpl::HeadersDirectFetchBlocks(CNode& pfrom, const Peer& peer, const CBlockIndex& last_header)
    2728                 :            : {
    2729                 :          0 :     const CNetMsgMaker msgMaker(pfrom.GetCommonVersion());
    2730                 :            : 
    2731                 :          0 :     LOCK(cs_main);
    2732         [ #  # ]:          0 :     CNodeState *nodestate = State(pfrom.GetId());
    2733                 :            : 
    2734 [ #  # ][ #  # ]:          0 :     if (CanDirectFetch() && last_header.IsValid(BLOCK_VALID_TREE) && m_chainman.ActiveChain().Tip()->nChainWork <= last_header.nChainWork) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    2735                 :          0 :         std::vector<const CBlockIndex*> vToFetch;
    2736                 :          0 :         const CBlockIndex* pindexWalk{&last_header};
    2737                 :            :         // Calculate all the blocks we'd need to switch to last_header, up to a limit.
    2738 [ #  # ][ #  # ]:          0 :         while (pindexWalk && !m_chainman.ActiveChain().Contains(pindexWalk) && vToFetch.size() <= MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
         [ #  # ][ #  # ]
                 [ #  # ]
    2739 [ #  # ][ #  # ]:          0 :             if (!(pindexWalk->nStatus & BLOCK_HAVE_DATA) &&
    2740 [ #  # ][ #  # ]:          0 :                     !IsBlockRequested(pindexWalk->GetBlockHash()) &&
    2741 [ #  # ][ #  # ]:          0 :                     (!DeploymentActiveAt(*pindexWalk, m_chainman, Consensus::DEPLOYMENT_SEGWIT) || CanServeWitnesses(peer))) {
    2742                 :            :                 // We don't have this block, and it's not yet in flight.
    2743         [ #  # ]:          0 :                 vToFetch.push_back(pindexWalk);
    2744                 :          0 :             }
    2745                 :          0 :             pindexWalk = pindexWalk->pprev;
    2746                 :            :         }
    2747                 :            :         // If pindexWalk still isn't on our main chain, we're looking at a
    2748                 :            :         // very large reorg at a time we think we're close to caught up to
    2749                 :            :         // the main chain -- this shouldn't really happen.  Bail out on the
    2750                 :            :         // direct fetch and rely on parallel download instead.
    2751 [ #  # ][ #  # ]:          0 :         if (!m_chainman.ActiveChain().Contains(pindexWalk)) {
                 [ #  # ]
    2752 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Large reorg, won't direct fetch to %s (%d)\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    2753                 :            :                      last_header.GetBlockHash().ToString(),
    2754                 :            :                      last_header.nHeight);
    2755                 :          0 :         } else {
    2756                 :          0 :             std::vector<CInv> vGetData;
    2757                 :            :             // Download as much as possible, from earliest to latest.
    2758 [ #  # ][ #  # ]:          0 :             for (const CBlockIndex *pindex : reverse_iterate(vToFetch)) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    2759         [ #  # ]:          0 :                 if (nodestate->vBlocksInFlight.size() >= MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
    2760                 :            :                     // Can't download any more from this peer
    2761                 :          0 :                     break;
    2762                 :            :                 }
    2763                 :          0 :                 uint32_t nFetchFlags = GetFetchFlags(peer);
    2764         [ #  # ]:          0 :                 vGetData.emplace_back(MSG_BLOCK | nFetchFlags, pindex->GetBlockHash());
    2765         [ #  # ]:          0 :                 BlockRequested(pfrom.GetId(), *pindex);
    2766 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Requesting block %s from  peer=%d\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    2767                 :            :                         pindex->GetBlockHash().ToString(), pfrom.GetId());
    2768                 :            :             }
    2769         [ #  # ]:          0 :             if (vGetData.size() > 1) {
    2770 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Downloading blocks toward %s (%d) via headers direct fetch\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    2771                 :            :                          last_header.GetBlockHash().ToString(),
    2772                 :            :                          last_header.nHeight);
    2773                 :          0 :             }
    2774         [ #  # ]:          0 :             if (vGetData.size() > 0) {
    2775 [ #  # ][ #  # ]:          0 :                 if (!m_opts.ignore_incoming_txs &&
    2776         [ #  # ]:          0 :                         nodestate->m_provides_cmpctblocks &&
    2777         [ #  # ]:          0 :                         vGetData.size() == 1 &&
    2778         [ #  # ]:          0 :                         mapBlocksInFlight.size() == 1 &&
    2779         [ #  # ]:          0 :                         last_header.pprev->IsValid(BLOCK_VALID_CHAIN)) {
    2780                 :            :                     // In any case, we want to download using a compact block, not a regular one
    2781         [ #  # ]:          0 :                     vGetData[0] = CInv(MSG_CMPCT_BLOCK, vGetData[0].hash);
    2782                 :          0 :                 }
    2783 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETDATA, vGetData));
                 [ #  # ]
    2784                 :          0 :             }
    2785                 :          0 :         }
    2786                 :          0 :     }
    2787                 :          0 : }
    2788                 :            : 
    2789                 :            : /**
    2790                 :            :  * Given receipt of headers from a peer ending in last_header, along with
    2791                 :            :  * whether that header was new and whether the headers message was full,
    2792                 :            :  * update the state we keep for the peer.
    2793                 :            :  */
    2794                 :          0 : void PeerManagerImpl::UpdatePeerStateForReceivedHeaders(CNode& pfrom, Peer& peer,
    2795                 :            :         const CBlockIndex& last_header, bool received_new_header, bool may_have_more_headers)
    2796                 :            : {
    2797         [ #  # ]:          0 :     if (peer.m_num_unconnecting_headers_msgs > 0) {
    2798 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "peer=%d: resetting m_num_unconnecting_headers_msgs (%d -> 0)\n", pfrom.GetId(), peer.m_num_unconnecting_headers_msgs);
         [ #  # ][ #  # ]
    2799                 :          0 :     }
    2800                 :          0 :     peer.m_num_unconnecting_headers_msgs = 0;
    2801                 :            : 
    2802                 :          0 :     LOCK(cs_main);
    2803         [ #  # ]:          0 :     CNodeState *nodestate = State(pfrom.GetId());
    2804                 :            : 
    2805         [ #  # ]:          0 :     UpdateBlockAvailability(pfrom.GetId(), last_header.GetBlockHash());
    2806                 :            : 
    2807                 :            :     // From here, pindexBestKnownBlock should be guaranteed to be non-null,
    2808                 :            :     // because it is set in UpdateBlockAvailability. Some nullptr checks
    2809                 :            :     // are still present, however, as belt-and-suspenders.
    2810                 :            : 
    2811 [ #  # ][ #  # ]:          0 :     if (received_new_header && last_header.nChainWork > m_chainman.ActiveChain().Tip()->nChainWork) {
         [ #  # ][ #  # ]
    2812         [ #  # ]:          0 :         nodestate->m_last_block_announcement = GetTime();
    2813                 :          0 :     }
    2814                 :            : 
    2815                 :            :     // If we're in IBD, we want outbound peers that will serve us a useful
    2816                 :            :     // chain. Disconnect peers that are on chains with insufficient work.
    2817 [ #  # ][ #  # ]:          0 :     if (m_chainman.IsInitialBlockDownload() && !may_have_more_headers) {
                 [ #  # ]
    2818                 :            :         // If the peer has no more headers to give us, then we know we have
    2819                 :            :         // their tip.
    2820 [ #  # ][ #  # ]:          0 :         if (nodestate->pindexBestKnownBlock && nodestate->pindexBestKnownBlock->nChainWork < m_chainman.MinimumChainWork()) {
         [ #  # ][ #  # ]
    2821                 :            :             // This peer has too little work on their headers chain to help
    2822                 :            :             // us sync -- disconnect if it is an outbound disconnection
    2823                 :            :             // candidate.
    2824                 :            :             // Note: We compare their tip to the minimum chain work (rather than
    2825                 :            :             // m_chainman.ActiveChain().Tip()) because we won't start block download
    2826                 :            :             // until we have a headers chain that has at least
    2827                 :            :             // the minimum chain work, even if a peer has a chain past our tip,
    2828                 :            :             // as an anti-DoS measure.
    2829 [ #  # ][ #  # ]:          0 :             if (pfrom.IsOutboundOrBlockRelayConn()) {
    2830 [ #  # ][ #  # ]:          0 :                 LogPrintf("Disconnecting outbound peer %d -- headers chain has insufficient work\n", pfrom.GetId());
                 [ #  # ]
    2831                 :          0 :                 pfrom.fDisconnect = true;
    2832                 :          0 :             }
    2833                 :          0 :         }
    2834                 :          0 :     }
    2835                 :            : 
    2836                 :            :     // If this is an outbound full-relay peer, check to see if we should protect
    2837                 :            :     // it from the bad/lagging chain logic.
    2838                 :            :     // Note that outbound block-relay peers are excluded from this protection, and
    2839                 :            :     // thus always subject to eviction under the bad/lagging chain logic.
    2840                 :            :     // See ChainSyncTimeoutState.
    2841 [ #  # ][ #  # ]:          0 :     if (!pfrom.fDisconnect && pfrom.IsFullOutboundConn() && nodestate->pindexBestKnownBlock != nullptr) {
                 [ #  # ]
    2842 [ #  # ][ #  # ]:          0 :         if (m_outbound_peers_with_protect_from_disconnect < MAX_OUTBOUND_PEERS_TO_PROTECT_FROM_DISCONNECT && nodestate->pindexBestKnownBlock->nChainWork >= m_chainman.ActiveChain().Tip()->nChainWork && !nodestate->m_chain_sync.m_protect) {
         [ #  # ][ #  # ]
                 [ #  # ]
    2843 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Protecting outbound peer=%d from eviction\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    2844                 :          0 :             nodestate->m_chain_sync.m_protect = true;
    2845                 :          0 :             ++m_outbound_peers_with_protect_from_disconnect;
    2846                 :          0 :         }
    2847                 :          0 :     }
    2848                 :          0 : }
    2849                 :            : 
    2850                 :          0 : void PeerManagerImpl::ProcessHeadersMessage(CNode& pfrom, Peer& peer,
    2851                 :            :                                             std::vector<CBlockHeader>&& headers,
    2852                 :            :                                             bool via_compact_block)
    2853                 :            : {
    2854                 :          0 :     size_t nCount = headers.size();
    2855                 :            : 
    2856         [ #  # ]:          0 :     if (nCount == 0) {
    2857                 :            :         // Nothing interesting. Stop asking this peers for more headers.
    2858                 :            :         // If we were in the middle of headers sync, receiving an empty headers
    2859                 :            :         // message suggests that the peer suddenly has nothing to give us
    2860                 :            :         // (perhaps it reorged to our chain). Clear download state for this peer.
    2861                 :          0 :         LOCK(peer.m_headers_sync_mutex);
    2862         [ #  # ]:          0 :         if (peer.m_headers_sync) {
    2863                 :          0 :             peer.m_headers_sync.reset(nullptr);
    2864         [ #  # ]:          0 :             LOCK(m_headers_presync_mutex);
    2865         [ #  # ]:          0 :             m_headers_presync_stats.erase(pfrom.GetId());
    2866                 :          0 :         }
    2867                 :            :         return;
    2868                 :          0 :     }
    2869                 :            : 
    2870                 :            :     // Before we do any processing, make sure these pass basic sanity checks.
    2871                 :            :     // We'll rely on headers having valid proof-of-work further down, as an
    2872                 :            :     // anti-DoS criteria (note: this check is required before passing any
    2873                 :            :     // headers into HeadersSyncState).
    2874         [ #  # ]:          0 :     if (!CheckHeadersPoW(headers, m_chainparams.GetConsensus(), peer)) {
    2875                 :            :         // Misbehaving() calls are handled within CheckHeadersPoW(), so we can
    2876                 :            :         // just return. (Note that even if a header is announced via compact
    2877                 :            :         // block, the header itself should be valid, so this type of error can
    2878                 :            :         // always be punished.)
    2879                 :          0 :         return;
    2880                 :            :     }
    2881                 :            : 
    2882                 :          0 :     const CBlockIndex *pindexLast = nullptr;
    2883                 :            : 
    2884                 :            :     // We'll set already_validated_work to true if these headers are
    2885                 :            :     // successfully processed as part of a low-work headers sync in progress
    2886                 :            :     // (either in PRESYNC or REDOWNLOAD phase).
    2887                 :            :     // If true, this will mean that any headers returned to us (ie during
    2888                 :            :     // REDOWNLOAD) can be validated without further anti-DoS checks.
    2889                 :          0 :     bool already_validated_work = false;
    2890                 :            : 
    2891                 :            :     // If we're in the middle of headers sync, let it do its magic.
    2892                 :          0 :     bool have_headers_sync = false;
    2893                 :            :     {
    2894                 :          0 :         LOCK(peer.m_headers_sync_mutex);
    2895                 :            : 
    2896         [ #  # ]:          0 :         already_validated_work = IsContinuationOfLowWorkHeadersSync(peer, pfrom, headers);
    2897                 :            : 
    2898                 :            :         // The headers we passed in may have been:
    2899                 :            :         // - untouched, perhaps if no headers-sync was in progress, or some
    2900                 :            :         //   failure occurred
    2901                 :            :         // - erased, such as if the headers were successfully processed and no
    2902                 :            :         //   additional headers processing needs to take place (such as if we
    2903                 :            :         //   are still in PRESYNC)
    2904                 :            :         // - replaced with headers that are now ready for validation, such as
    2905                 :            :         //   during the REDOWNLOAD phase of a low-work headers sync.
    2906                 :            :         // So just check whether we still have headers that we need to process,
    2907                 :            :         // or not.
    2908         [ #  # ]:          0 :         if (headers.empty()) {
    2909                 :          0 :             return;
    2910                 :            :         }
    2911                 :            : 
    2912                 :          0 :         have_headers_sync = !!peer.m_headers_sync;
    2913      [ #  #  # ]:          0 :     }
    2914                 :            : 
    2915                 :            :     // Do these headers connect to something in our block index?
    2916         [ #  # ]:          0 :     const CBlockIndex *chain_start_header{WITH_LOCK(::cs_main, return m_chainman.m_blockman.LookupBlockIndex(headers[0].hashPrevBlock))};
    2917                 :          0 :     bool headers_connect_blockindex{chain_start_header != nullptr};
    2918                 :            : 
    2919         [ #  # ]:          0 :     if (!headers_connect_blockindex) {
    2920         [ #  # ]:          0 :         if (nCount <= MAX_BLOCKS_TO_ANNOUNCE) {
    2921                 :            :             // If this looks like it could be a BIP 130 block announcement, use
    2922                 :            :             // special logic for handling headers that don't connect, as this
    2923                 :            :             // could be benign.
    2924                 :          0 :             HandleFewUnconnectingHeaders(pfrom, peer, headers);
    2925                 :          0 :         } else {
    2926 [ #  # ][ #  # ]:          0 :             Misbehaving(peer, 10, "invalid header received");
    2927                 :            :         }
    2928                 :          0 :         return;
    2929                 :            :     }
    2930                 :            : 
    2931                 :            :     // If the headers we received are already in memory and an ancestor of
    2932                 :            :     // m_best_header or our tip, skip anti-DoS checks. These headers will not
    2933                 :            :     // use any more memory (and we are not leaking information that could be
    2934                 :            :     // used to fingerprint us).
    2935                 :          0 :     const CBlockIndex *last_received_header{nullptr};
    2936                 :            :     {
    2937                 :          0 :         LOCK(cs_main);
    2938 [ #  # ][ #  # ]:          0 :         last_received_header = m_chainman.m_blockman.LookupBlockIndex(headers.back().GetHash());
    2939 [ #  # ][ #  # ]:          0 :         if (IsAncestorOfBestHeaderOrTip(last_received_header)) {
    2940                 :          0 :             already_validated_work = true;
    2941                 :          0 :         }
    2942                 :          0 :     }
    2943                 :            : 
    2944                 :            :     // If our peer has NetPermissionFlags::NoBan privileges, then bypass our
    2945                 :            :     // anti-DoS logic (this saves bandwidth when we connect to a trusted peer
    2946                 :            :     // on startup).
    2947         [ #  # ]:          0 :     if (pfrom.HasPermission(NetPermissionFlags::NoBan)) {
    2948                 :          0 :         already_validated_work = true;
    2949                 :          0 :     }
    2950                 :            : 
    2951                 :            :     // At this point, the headers connect to something in our block index.
    2952                 :            :     // Do anti-DoS checks to determine if we should process or store for later
    2953                 :            :     // processing.
    2954 [ #  # ][ #  # ]:          0 :     if (!already_validated_work && TryLowWorkHeadersSync(peer, pfrom,
                 [ #  # ]
    2955                 :          0 :                 chain_start_header, headers)) {
    2956                 :            :         // If we successfully started a low-work headers sync, then there
    2957                 :            :         // should be no headers to process any further.
    2958                 :          0 :         Assume(headers.empty());
    2959                 :          0 :         return;
    2960                 :            :     }
    2961                 :            : 
    2962                 :            :     // At this point, we have a set of headers with sufficient work on them
    2963                 :            :     // which can be processed.
    2964                 :            : 
    2965                 :            :     // If we don't have the last header, then this peer will have given us
    2966                 :            :     // something new (if these headers are valid).
    2967                 :          0 :     bool received_new_header{last_received_header == nullptr};
    2968                 :            : 
    2969                 :            :     // Now process all the headers.
    2970                 :          0 :     BlockValidationState state;
    2971 [ #  # ][ #  # ]:          0 :     if (!m_chainman.ProcessNewBlockHeaders(headers, /*min_pow_checked=*/true, state, &pindexLast)) {
    2972         [ #  # ]:          0 :         if (state.IsInvalid()) {
    2973 [ #  # ][ #  # ]:          0 :             MaybePunishNodeForBlock(pfrom.GetId(), state, via_compact_block, "invalid header received");
    2974                 :          0 :             return;
    2975                 :            :         }
    2976                 :          0 :     }
    2977         [ #  # ]:          0 :     assert(pindexLast);
    2978                 :            : 
    2979                 :            :     // Consider fetching more headers if we are not using our headers-sync mechanism.
    2980 [ #  # ][ #  # ]:          0 :     if (nCount == MAX_HEADERS_RESULTS && !have_headers_sync) {
    2981                 :            :         // Headers message had its maximum size; the peer may have more headers.
    2982 [ #  # ][ #  # ]:          0 :         if (MaybeSendGetHeaders(pfrom, GetLocator(pindexLast), peer)) {
                 [ #  # ]
    2983 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "more getheaders (%d) to end to peer=%d (startheight:%d)\n",
         [ #  # ][ #  # ]
                 [ #  # ]
    2984                 :            :                     pindexLast->nHeight, pfrom.GetId(), peer.m_starting_height);
    2985                 :          0 :         }
    2986                 :          0 :     }
    2987                 :            : 
    2988         [ #  # ]:          0 :     UpdatePeerStateForReceivedHeaders(pfrom, peer, *pindexLast, received_new_header, nCount == MAX_HEADERS_RESULTS);
    2989                 :            : 
    2990                 :            :     // Consider immediately downloading blocks.
    2991         [ #  # ]:          0 :     HeadersDirectFetchBlocks(pfrom, peer, *pindexLast);
    2992                 :            : 
    2993                 :          0 :     return;
    2994                 :          0 : }
    2995                 :            : 
    2996                 :          0 : bool PeerManagerImpl::ProcessOrphanTx(Peer& peer)
    2997                 :            : {
    2998                 :          0 :     AssertLockHeld(g_msgproc_mutex);
    2999                 :          0 :     LOCK(cs_main);
    3000                 :            : 
    3001                 :          0 :     CTransactionRef porphanTx = nullptr;
    3002                 :            : 
    3003 [ #  # ][ #  # ]:          0 :     while (CTransactionRef porphanTx = m_orphanage.GetTxToReconsider(peer.m_id)) {
    3004         [ #  # ]:          0 :         const MempoolAcceptResult result = m_chainman.ProcessTransaction(porphanTx);
    3005                 :          0 :         const TxValidationState& state = result.m_state;
    3006                 :          0 :         const Txid& orphanHash = porphanTx->GetHash();
    3007                 :          0 :         const Wtxid& orphan_wtxid = porphanTx->GetWitnessHash();
    3008                 :            : 
    3009         [ #  # ]:          0 :         if (result.m_result_type == MempoolAcceptResult::ResultType::VALID) {
    3010 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::TXPACKAGES, "   accepted orphan tx %s (wtxid=%s)\n", orphanHash.ToString(), orphan_wtxid.ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3011 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::MEMPOOL, "AcceptToMemoryPool: peer=%d: accepted %s (wtxid=%s) (poolsz %u txn, %u kB)\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3012                 :            :                 peer.m_id,
    3013                 :            :                 orphanHash.ToString(),
    3014                 :            :                 orphan_wtxid.ToString(),
    3015                 :            :                 m_mempool.size(), m_mempool.DynamicMemoryUsage() / 1000);
    3016         [ #  # ]:          0 :             RelayTransaction(orphanHash, porphanTx->GetWitnessHash());
    3017         [ #  # ]:          0 :             m_orphanage.AddChildrenToWorkSet(*porphanTx);
    3018         [ #  # ]:          0 :             m_orphanage.EraseTx(orphanHash);
    3019 [ #  # ][ #  # ]:          0 :             for (const CTransactionRef& removedTx : result.m_replaced_transactions.value()) {
    3020         [ #  # ]:          0 :                 AddToCompactExtraTransactions(removedTx);
    3021                 :            :             }
    3022                 :          0 :             return true;
    3023         [ #  # ]:          0 :         } else if (state.GetResult() != TxValidationResult::TX_MISSING_INPUTS) {
    3024         [ #  # ]:          0 :             if (state.IsInvalid()) {
    3025 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::TXPACKAGES, "   invalid orphan tx %s (wtxid=%s) from peer=%d. %s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3026                 :            :                     orphanHash.ToString(),
    3027                 :            :                     orphan_wtxid.ToString(),
    3028                 :            :                     peer.m_id,
    3029                 :            :                     state.ToString());
    3030 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::MEMPOOLREJ, "%s (wtxid=%s) from peer=%d was not accepted: %s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3031                 :            :                     orphanHash.ToString(),
    3032                 :            :                     orphan_wtxid.ToString(),
    3033                 :            :                     peer.m_id,
    3034                 :            :                     state.ToString());
    3035                 :            :                 // Maybe punish peer that gave us an invalid orphan tx
    3036         [ #  # ]:          0 :                 MaybePunishNodeForTx(peer.m_id, state);
    3037                 :          0 :             }
    3038                 :            :             // Has inputs but not accepted to mempool
    3039                 :            :             // Probably non-standard or insufficient fee
    3040 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::TXPACKAGES, "   removed orphan tx %s (wtxid=%s)\n", orphanHash.ToString(), orphan_wtxid.ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3041         [ #  # ]:          0 :             if (state.GetResult() != TxValidationResult::TX_WITNESS_STRIPPED) {
    3042                 :            :                 // We can add the wtxid of this transaction to our reject filter.
    3043                 :            :                 // Do not add txids of witness transactions or witness-stripped
    3044                 :            :                 // transactions to the filter, as they can have been malleated;
    3045                 :            :                 // adding such txids to the reject filter would potentially
    3046                 :            :                 // interfere with relay of valid transactions from peers that
    3047                 :            :                 // do not support wtxid-based relay. See
    3048                 :            :                 // https://github.com/bitcoin/bitcoin/issues/8279 for details.
    3049                 :            :                 // We can remove this restriction (and always add wtxids to
    3050                 :            :                 // the filter even for witness stripped transactions) once
    3051                 :            :                 // wtxid-based relay is broadly deployed.
    3052                 :            :                 // See also comments in https://github.com/bitcoin/bitcoin/pull/18044#discussion_r443419034
    3053                 :            :                 // for concerns around weakening security of unupgraded nodes
    3054                 :            :                 // if we start doing this too early.
    3055 [ #  # ][ #  # ]:          0 :                 m_recent_rejects.insert(porphanTx->GetWitnessHash().ToUint256());
    3056                 :            :                 // If the transaction failed for TX_INPUTS_NOT_STANDARD,
    3057                 :            :                 // then we know that the witness was irrelevant to the policy
    3058                 :            :                 // failure, since this check depends only on the txid
    3059                 :            :                 // (the scriptPubKey being spent is covered by the txid).
    3060                 :            :                 // Add the txid to the reject filter to prevent repeated
    3061                 :            :                 // processing of this transaction in the event that child
    3062                 :            :                 // transactions are later received (resulting in
    3063                 :            :                 // parent-fetching by txid via the orphan-handling logic).
    3064 [ #  # ][ #  # ]:          0 :                 if (state.GetResult() == TxValidationResult::TX_INPUTS_NOT_STANDARD && porphanTx->HasWitness()) {
                 [ #  # ]
    3065                 :            :                     // We only add the txid if it differs from the wtxid, to
    3066                 :            :                     // avoid wasting entries in the rolling bloom filter.
    3067 [ #  # ][ #  # ]:          0 :                     m_recent_rejects.insert(porphanTx->GetHash().ToUint256());
    3068                 :          0 :                 }
    3069                 :          0 :             }
    3070         [ #  # ]:          0 :             m_orphanage.EraseTx(orphanHash);
    3071                 :          0 :             return true;
    3072                 :            :         }
    3073         [ #  # ]:          0 :     }
              [ #  #  # ]
    3074                 :            : 
    3075                 :          0 :     return false;
    3076                 :          0 : }
    3077                 :            : 
    3078                 :          0 : bool PeerManagerImpl::PrepareBlockFilterRequest(CNode& node, Peer& peer,
    3079                 :            :                                                 BlockFilterType filter_type, uint32_t start_height,
    3080                 :            :                                                 const uint256& stop_hash, uint32_t max_height_diff,
    3081                 :            :                                                 const CBlockIndex*& stop_index,
    3082                 :            :                                                 BlockFilterIndex*& filter_index)
    3083                 :            : {
    3084                 :          0 :     const bool supported_filter_type =
    3085         [ #  # ]:          0 :         (filter_type == BlockFilterType::BASIC &&
    3086                 :          0 :          (peer.m_our_services & NODE_COMPACT_FILTERS));
    3087         [ #  # ]:          0 :     if (!supported_filter_type) {
    3088 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "peer %d requested unsupported block filter type: %d\n",
         [ #  # ][ #  # ]
    3089                 :            :                  node.GetId(), static_cast<uint8_t>(filter_type));
    3090                 :          0 :         node.fDisconnect = true;
    3091                 :          0 :         return false;
    3092                 :            :     }
    3093                 :            : 
    3094                 :            :     {
    3095                 :          0 :         LOCK(cs_main);
    3096         [ #  # ]:          0 :         stop_index = m_chainman.m_blockman.LookupBlockIndex(stop_hash);
    3097                 :            : 
    3098                 :            :         // Check that the stop block exists and the peer would be allowed to fetch it.
    3099 [ #  # ][ #  # ]:          0 :         if (!stop_index || !BlockRequestAllowed(stop_index)) {
                 [ #  # ]
    3100 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "peer %d requested invalid block hash: %s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3101                 :            :                      node.GetId(), stop_hash.ToString());
    3102                 :          0 :             node.fDisconnect = true;
    3103                 :          0 :             return false;
    3104                 :            :         }
    3105      [ #  #  # ]:          0 :     }
    3106                 :            : 
    3107                 :          0 :     uint32_t stop_height = stop_index->nHeight;
    3108         [ #  # ]:          0 :     if (start_height > stop_height) {
    3109 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "peer %d sent invalid getcfilters/getcfheaders with "
         [ #  # ][ #  # ]
    3110                 :            :                  "start height %d and stop height %d\n",
    3111                 :            :                  node.GetId(), start_height, stop_height);
    3112                 :          0 :         node.fDisconnect = true;
    3113                 :          0 :         return false;
    3114                 :            :     }
    3115         [ #  # ]:          0 :     if (stop_height - start_height >= max_height_diff) {
    3116 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "peer %d requested too many cfilters/cfheaders: %d / %d\n",
         [ #  # ][ #  # ]
    3117                 :            :                  node.GetId(), stop_height - start_height + 1, max_height_diff);
    3118                 :          0 :         node.fDisconnect = true;
    3119                 :          0 :         return false;
    3120                 :            :     }
    3121                 :            : 
    3122                 :          0 :     filter_index = GetBlockFilterIndex(filter_type);
    3123         [ #  # ]:          0 :     if (!filter_index) {
    3124 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Filter index for supported type %s not found\n", BlockFilterTypeName(filter_type));
         [ #  # ][ #  # ]
                 [ #  # ]
    3125                 :          0 :         return false;
    3126                 :            :     }
    3127                 :            : 
    3128                 :          0 :     return true;
    3129                 :          0 : }
    3130                 :            : 
    3131                 :          0 : void PeerManagerImpl::ProcessGetCFilters(CNode& node,Peer& peer, CDataStream& vRecv)
    3132                 :            : {
    3133                 :            :     uint8_t filter_type_ser;
    3134                 :            :     uint32_t start_height;
    3135                 :          0 :     uint256 stop_hash;
    3136                 :            : 
    3137                 :          0 :     vRecv >> filter_type_ser >> start_height >> stop_hash;
    3138                 :            : 
    3139                 :          0 :     const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
    3140                 :            : 
    3141                 :            :     const CBlockIndex* stop_index;
    3142                 :            :     BlockFilterIndex* filter_index;
    3143         [ #  # ]:          0 :     if (!PrepareBlockFilterRequest(node, peer, filter_type, start_height, stop_hash,
    3144                 :            :                                    MAX_GETCFILTERS_SIZE, stop_index, filter_index)) {
    3145                 :          0 :         return;
    3146                 :            :     }
    3147                 :            : 
    3148                 :          0 :     std::vector<BlockFilter> filters;
    3149 [ #  # ][ #  # ]:          0 :     if (!filter_index->LookupFilterRange(start_height, stop_index, filters)) {
    3150 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Failed to find block filter in index: filter_type=%s, start_height=%d, stop_hash=%s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3151                 :            :                      BlockFilterTypeName(filter_type), start_height, stop_hash.ToString());
    3152                 :          0 :         return;
    3153                 :            :     }
    3154                 :            : 
    3155         [ #  # ]:          0 :     for (const auto& filter : filters) {
    3156         [ #  # ]:          0 :         CSerializedNetMsg msg = CNetMsgMaker(node.GetCommonVersion())
    3157 [ #  # ][ #  # ]:          0 :             .Make(NetMsgType::CFILTER, filter);
    3158         [ #  # ]:          0 :         m_connman.PushMessage(&node, std::move(msg));
    3159                 :          0 :     }
    3160         [ #  # ]:          0 : }
    3161                 :            : 
    3162                 :          0 : void PeerManagerImpl::ProcessGetCFHeaders(CNode& node, Peer& peer, CDataStream& vRecv)
    3163                 :            : {
    3164                 :            :     uint8_t filter_type_ser;
    3165                 :            :     uint32_t start_height;
    3166                 :          0 :     uint256 stop_hash;
    3167                 :            : 
    3168                 :          0 :     vRecv >> filter_type_ser >> start_height >> stop_hash;
    3169                 :            : 
    3170                 :          0 :     const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
    3171                 :            : 
    3172                 :            :     const CBlockIndex* stop_index;
    3173                 :            :     BlockFilterIndex* filter_index;
    3174         [ #  # ]:          0 :     if (!PrepareBlockFilterRequest(node, peer, filter_type, start_height, stop_hash,
    3175                 :            :                                    MAX_GETCFHEADERS_SIZE, stop_index, filter_index)) {
    3176                 :          0 :         return;
    3177                 :            :     }
    3178                 :            : 
    3179                 :          0 :     uint256 prev_header;
    3180         [ #  # ]:          0 :     if (start_height > 0) {
    3181                 :          0 :         const CBlockIndex* const prev_block =
    3182                 :          0 :             stop_index->GetAncestor(static_cast<int>(start_height - 1));
    3183         [ #  # ]:          0 :         if (!filter_index->LookupFilterHeader(prev_block, prev_header)) {
    3184 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Failed to find block filter header in index: filter_type=%s, block_hash=%s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3185                 :            :                          BlockFilterTypeName(filter_type), prev_block->GetBlockHash().ToString());
    3186                 :          0 :             return;
    3187                 :            :         }
    3188                 :          0 :     }
    3189                 :            : 
    3190                 :          0 :     std::vector<uint256> filter_hashes;
    3191 [ #  # ][ #  # ]:          0 :     if (!filter_index->LookupFilterHashRange(start_height, stop_index, filter_hashes)) {
    3192 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Failed to find block filter hashes in index: filter_type=%s, start_height=%d, stop_hash=%s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3193                 :            :                      BlockFilterTypeName(filter_type), start_height, stop_hash.ToString());
    3194                 :          0 :         return;
    3195                 :            :     }
    3196                 :            : 
    3197         [ #  # ]:          0 :     CSerializedNetMsg msg = CNetMsgMaker(node.GetCommonVersion())
    3198 [ #  # ][ #  # ]:          0 :         .Make(NetMsgType::CFHEADERS,
    3199                 :            :               filter_type_ser,
    3200                 :          0 :               stop_index->GetBlockHash(),
    3201                 :            :               prev_header,
    3202                 :            :               filter_hashes);
    3203         [ #  # ]:          0 :     m_connman.PushMessage(&node, std::move(msg));
    3204         [ #  # ]:          0 : }
    3205                 :            : 
    3206                 :          0 : void PeerManagerImpl::ProcessGetCFCheckPt(CNode& node, Peer& peer, CDataStream& vRecv)
    3207                 :            : {
    3208                 :            :     uint8_t filter_type_ser;
    3209                 :          0 :     uint256 stop_hash;
    3210                 :            : 
    3211                 :          0 :     vRecv >> filter_type_ser >> stop_hash;
    3212                 :            : 
    3213                 :          0 :     const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
    3214                 :            : 
    3215                 :            :     const CBlockIndex* stop_index;
    3216                 :            :     BlockFilterIndex* filter_index;
    3217 [ #  # ][ #  # ]:          0 :     if (!PrepareBlockFilterRequest(node, peer, filter_type, /*start_height=*/0, stop_hash,
    3218                 :          0 :                                    /*max_height_diff=*/std::numeric_limits<uint32_t>::max(),
    3219                 :            :                                    stop_index, filter_index)) {
    3220                 :          0 :         return;
    3221                 :            :     }
    3222                 :            : 
    3223         [ #  # ]:          0 :     std::vector<uint256> headers(stop_index->nHeight / CFCHECKPT_INTERVAL);
    3224                 :            : 
    3225                 :            :     // Populate headers.
    3226                 :          0 :     const CBlockIndex* block_index = stop_index;
    3227         [ #  # ]:          0 :     for (int i = headers.size() - 1; i >= 0; i--) {
    3228                 :          0 :         int height = (i + 1) * CFCHECKPT_INTERVAL;
    3229         [ #  # ]:          0 :         block_index = block_index->GetAncestor(height);
    3230                 :            : 
    3231 [ #  # ][ #  # ]:          0 :         if (!filter_index->LookupFilterHeader(block_index, headers[i])) {
    3232 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Failed to find block filter header in index: filter_type=%s, block_hash=%s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3233                 :            :                          BlockFilterTypeName(filter_type), block_index->GetBlockHash().ToString());
    3234                 :          0 :             return;
    3235                 :            :         }
    3236                 :          0 :     }
    3237                 :            : 
    3238         [ #  # ]:          0 :     CSerializedNetMsg msg = CNetMsgMaker(node.GetCommonVersion())
    3239 [ #  # ][ #  # ]:          0 :         .Make(NetMsgType::CFCHECKPT,
    3240                 :            :               filter_type_ser,
    3241                 :          0 :               stop_index->GetBlockHash(),
    3242                 :            :               headers);
    3243         [ #  # ]:          0 :     m_connman.PushMessage(&node, std::move(msg));
    3244         [ #  # ]:          0 : }
    3245                 :            : 
    3246                 :          0 : void PeerManagerImpl::ProcessBlock(CNode& node, const std::shared_ptr<const CBlock>& block, bool force_processing, bool min_pow_checked)
    3247                 :            : {
    3248                 :          0 :     bool new_block{false};
    3249                 :          0 :     m_chainman.ProcessNewBlock(block, force_processing, min_pow_checked, &new_block);
    3250         [ #  # ]:          0 :     if (new_block) {
    3251                 :          0 :         node.m_last_block_time = GetTime<std::chrono::seconds>();
    3252                 :            :         // In case this block came from a different peer than we requested
    3253                 :            :         // from, we can erase the block request now anyway (as we just stored
    3254                 :            :         // this block to disk).
    3255                 :          0 :         LOCK(cs_main);
    3256 [ #  # ][ #  # ]:          0 :         RemoveBlockRequest(block->GetHash(), std::nullopt);
    3257                 :          0 :     } else {
    3258                 :          0 :         LOCK(cs_main);
    3259 [ #  # ][ #  # ]:          0 :         mapBlockSource.erase(block->GetHash());
    3260                 :          0 :     }
    3261                 :          0 : }
    3262                 :            : 
    3263                 :          0 : void PeerManagerImpl::ProcessCompactBlockTxns(CNode& pfrom, Peer& peer, const BlockTransactions& block_transactions)
    3264                 :            : {
    3265                 :          0 :     std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
    3266                 :          0 :     bool fBlockRead{false};
    3267         [ #  # ]:          0 :     const CNetMsgMaker msgMaker(pfrom.GetCommonVersion());
    3268                 :            :     {
    3269         [ #  # ]:          0 :         LOCK(cs_main);
    3270                 :            : 
    3271         [ #  # ]:          0 :         auto range_flight = mapBlocksInFlight.equal_range(block_transactions.blockhash);
    3272         [ #  # ]:          0 :         size_t already_in_flight = std::distance(range_flight.first, range_flight.second);
    3273                 :          0 :         bool requested_block_from_this_peer{false};
    3274                 :            : 
    3275                 :            :         // Multimap ensures ordering of outstanding requests. It's either empty or first in line.
    3276         [ #  # ]:          0 :         bool first_in_flight = already_in_flight == 0 || (range_flight.first->second.first == pfrom.GetId());
    3277                 :            : 
    3278         [ #  # ]:          0 :         while (range_flight.first != range_flight.second) {
    3279                 :          0 :             auto [node_id, block_it] = range_flight.first->second;
    3280 [ #  # ][ #  # ]:          0 :             if (node_id == pfrom.GetId() && block_it->partialBlock) {
    3281                 :          0 :                 requested_block_from_this_peer = true;
    3282                 :          0 :                 break;
    3283                 :            :             }
    3284                 :          0 :             range_flight.first++;
    3285                 :            :         }
    3286                 :            : 
    3287         [ #  # ]:          0 :         if (!requested_block_from_this_peer) {
    3288 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Peer %d sent us block transactions for block we weren't expecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3289                 :          0 :             return;
    3290                 :            :         }
    3291                 :            : 
    3292                 :          0 :         PartiallyDownloadedBlock& partialBlock = *range_flight.first->second.second->partialBlock;
    3293         [ #  # ]:          0 :         ReadStatus status = partialBlock.FillBlock(*pblock, block_transactions.txn);
    3294         [ #  # ]:          0 :         if (status == READ_STATUS_INVALID) {
    3295         [ #  # ]:          0 :             RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId()); // Reset in-flight state in case Misbehaving does not result in a disconnect
    3296 [ #  # ][ #  # ]:          0 :             Misbehaving(peer, 100, "invalid compact block/non-matching block transactions");
    3297                 :          0 :             return;
    3298         [ #  # ]:          0 :         } else if (status == READ_STATUS_FAILED) {
    3299         [ #  # ]:          0 :             if (first_in_flight) {
    3300                 :            :                 // Might have collided, fall back to getdata now :(
    3301                 :          0 :                 std::vector<CInv> invs;
    3302         [ #  # ]:          0 :                 invs.emplace_back(MSG_BLOCK | GetFetchFlags(peer), block_transactions.blockhash);
    3303 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETDATA, invs));
                 [ #  # ]
    3304                 :          0 :             } else {
    3305         [ #  # ]:          0 :                 RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId());
    3306 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Peer %d sent us a compact block but it failed to reconstruct, waiting on first download to complete\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3307                 :          0 :                 return;
    3308                 :            :             }
    3309                 :          0 :         } else {
    3310                 :            :             // Block is either okay, or possibly we received
    3311                 :            :             // READ_STATUS_CHECKBLOCK_FAILED.
    3312                 :            :             // Note that CheckBlock can only fail for one of a few reasons:
    3313                 :            :             // 1. bad-proof-of-work (impossible here, because we've already
    3314                 :            :             //    accepted the header)
    3315                 :            :             // 2. merkleroot doesn't match the transactions given (already
    3316                 :            :             //    caught in FillBlock with READ_STATUS_FAILED, so
    3317                 :            :             //    impossible here)
    3318                 :            :             // 3. the block is otherwise invalid (eg invalid coinbase,
    3319                 :            :             //    block is too big, too many legacy sigops, etc).
    3320                 :            :             // So if CheckBlock failed, #3 is the only possibility.
    3321                 :            :             // Under BIP 152, we don't discourage the peer unless proof of work is
    3322                 :            :             // invalid (we don't require all the stateless checks to have
    3323                 :            :             // been run).  This is handled below, so just treat this as
    3324                 :            :             // though the block was successfully read, and rely on the
    3325                 :            :             // handling in ProcessNewBlock to ensure the block index is
    3326                 :            :             // updated, etc.
    3327         [ #  # ]:          0 :             RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId()); // it is now an empty pointer
    3328                 :          0 :             fBlockRead = true;
    3329                 :            :             // mapBlockSource is used for potentially punishing peers and
    3330                 :            :             // updating which peers send us compact blocks, so the race
    3331                 :            :             // between here and cs_main in ProcessNewBlock is fine.
    3332                 :            :             // BIP 152 permits peers to relay compact blocks after validating
    3333                 :            :             // the header only; we should not punish peers if the block turns
    3334                 :            :             // out to be invalid.
    3335 [ #  # ][ #  # ]:          0 :             mapBlockSource.emplace(block_transactions.blockhash, std::make_pair(pfrom.GetId(), false));
    3336                 :            :         }
    3337         [ #  # ]:          0 :     } // Don't hold cs_main when we call into ProcessNewBlock
    3338         [ #  # ]:          0 :     if (fBlockRead) {
    3339                 :            :         // Since we requested this block (it was in mapBlocksInFlight), force it to be processed,
    3340                 :            :         // even if it would not be a candidate for new tip (missing previous block, chain not long enough, etc)
    3341                 :            :         // This bypasses some anti-DoS logic in AcceptBlock (eg to prevent
    3342                 :            :         // disk-space attacks), but this should be safe due to the
    3343                 :            :         // protections in the compact block handler -- see related comment
    3344                 :            :         // in compact block optimistic reconstruction handling.
    3345         [ #  # ]:          0 :         ProcessBlock(pfrom, pblock, /*force_processing=*/true, /*min_pow_checked=*/true);
    3346                 :          0 :     }
    3347                 :          0 :     return;
    3348                 :          0 : }
    3349                 :            : 
    3350                 :          0 : void PeerManagerImpl::ProcessMessage(CNode& pfrom, const std::string& msg_type, CDataStream& vRecv,
    3351                 :            :                                      const std::chrono::microseconds time_received,
    3352                 :            :                                      const std::atomic<bool>& interruptMsgProc)
    3353                 :            : {
    3354                 :          0 :     AssertLockHeld(g_msgproc_mutex);
    3355                 :            : 
    3356 [ #  # ][ #  # ]:          0 :     LogPrint(BCLog::NET, "received: %s (%u bytes) peer=%d\n", SanitizeString(msg_type), vRecv.size(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3357                 :            : 
    3358                 :          0 :     PeerRef peer = GetPeerRef(pfrom.GetId());
    3359         [ #  # ]:          0 :     if (peer == nullptr) return;
    3360                 :            : 
    3361 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::VERSION) {
    3362         [ #  # ]:          0 :         if (pfrom.nVersion != 0) {
    3363 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "redundant version message from peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3364                 :          0 :             return;
    3365                 :            :         }
    3366                 :            : 
    3367                 :            :         int64_t nTime;
    3368         [ #  # ]:          0 :         CService addrMe;
    3369                 :          0 :         uint64_t nNonce = 1;
    3370                 :            :         ServiceFlags nServices;
    3371                 :            :         int nVersion;
    3372                 :          0 :         std::string cleanSubVer;
    3373                 :          0 :         int starting_height = -1;
    3374                 :          0 :         bool fRelay = true;
    3375                 :            : 
    3376 [ #  # ][ #  # ]:          0 :         vRecv >> nVersion >> Using<CustomUintFormatter<8>>(nServices) >> nTime;
         [ #  # ][ #  # ]
    3377         [ #  # ]:          0 :         if (nTime < 0) {
    3378                 :          0 :             nTime = 0;
    3379                 :          0 :         }
    3380         [ #  # ]:          0 :         vRecv.ignore(8); // Ignore the addrMe service bits sent by the peer
    3381 [ #  # ][ #  # ]:          0 :         vRecv >> CNetAddr::V1(addrMe);
    3382 [ #  # ][ #  # ]:          0 :         if (!pfrom.IsInboundConn())
    3383                 :            :         {
    3384         [ #  # ]:          0 :             m_addrman.SetServices(pfrom.addr, nServices);
    3385                 :          0 :         }
    3386 [ #  # ][ #  # ]:          0 :         if (pfrom.ExpectServicesFromConn() && !HasAllDesirableServiceFlags(nServices))
         [ #  # ][ #  # ]
    3387                 :            :         {
    3388 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "peer=%d does not offer the expected services (%08x offered, %08x expected); disconnecting\n", pfrom.GetId(), nServices, GetDesirableServiceFlags(nServices));
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3389                 :          0 :             pfrom.fDisconnect = true;
    3390                 :          0 :             return;
    3391                 :            :         }
    3392                 :            : 
    3393         [ #  # ]:          0 :         if (nVersion < MIN_PEER_PROTO_VERSION) {
    3394                 :            :             // disconnect from peers older than this proto version
    3395 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "peer=%d using obsolete version %i; disconnecting\n", pfrom.GetId(), nVersion);
         [ #  # ][ #  # ]
                 [ #  # ]
    3396                 :          0 :             pfrom.fDisconnect = true;
    3397                 :          0 :             return;
    3398                 :            :         }
    3399                 :            : 
    3400 [ #  # ][ #  # ]:          0 :         if (!vRecv.empty()) {
    3401                 :            :             // The version message includes information about the sending node which we don't use:
    3402                 :            :             //   - 8 bytes (service bits)
    3403                 :            :             //   - 16 bytes (ipv6 address)
    3404                 :            :             //   - 2 bytes (port)
    3405         [ #  # ]:          0 :             vRecv.ignore(26);
    3406         [ #  # ]:          0 :             vRecv >> nNonce;
    3407                 :          0 :         }
    3408 [ #  # ][ #  # ]:          0 :         if (!vRecv.empty()) {
    3409                 :          0 :             std::string strSubVer;
    3410 [ #  # ][ #  # ]:          0 :             vRecv >> LIMITED_STRING(strSubVer, MAX_SUBVERSION_LENGTH);
    3411         [ #  # ]:          0 :             cleanSubVer = SanitizeString(strSubVer);
    3412                 :          0 :         }
    3413 [ #  # ][ #  # ]:          0 :         if (!vRecv.empty()) {
    3414         [ #  # ]:          0 :             vRecv >> starting_height;
    3415                 :          0 :         }
    3416 [ #  # ][ #  # ]:          0 :         if (!vRecv.empty())
    3417         [ #  # ]:          0 :             vRecv >> fRelay;
    3418                 :            :         // Disconnect if we connected to ourself
    3419 [ #  # ][ #  # ]:          0 :         if (pfrom.IsInboundConn() && !m_connman.CheckIncomingNonce(nNonce))
         [ #  # ][ #  # ]
    3420                 :            :         {
    3421 [ #  # ][ #  # ]:          0 :             LogPrintf("connected to self at %s, disconnecting\n", pfrom.addr.ToStringAddrPort());
         [ #  # ][ #  # ]
    3422                 :          0 :             pfrom.fDisconnect = true;
    3423                 :          0 :             return;
    3424                 :            :         }
    3425                 :            : 
    3426 [ #  # ][ #  # ]:          0 :         if (pfrom.IsInboundConn() && addrMe.IsRoutable())
         [ #  # ][ #  # ]
    3427                 :            :         {
    3428         [ #  # ]:          0 :             SeenLocal(addrMe);
    3429                 :          0 :         }
    3430                 :            : 
    3431                 :            :         // Inbound peers send us their version message when they connect.
    3432                 :            :         // We send our version message in response.
    3433 [ #  # ][ #  # ]:          0 :         if (pfrom.IsInboundConn()) {
    3434         [ #  # ]:          0 :             PushNodeVersion(pfrom, *peer);
    3435                 :          0 :         }
    3436                 :            : 
    3437                 :            :         // Change version
    3438                 :          0 :         const int greatest_common_version = std::min(nVersion, PROTOCOL_VERSION);
    3439         [ #  # ]:          0 :         pfrom.SetCommonVersion(greatest_common_version);
    3440                 :          0 :         pfrom.nVersion = nVersion;
    3441                 :            : 
    3442         [ #  # ]:          0 :         const CNetMsgMaker msg_maker(greatest_common_version);
    3443                 :            : 
    3444         [ #  # ]:          0 :         if (greatest_common_version >= WTXID_RELAY_VERSION) {
    3445 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msg_maker.Make(NetMsgType::WTXIDRELAY));
                 [ #  # ]
    3446                 :          0 :         }
    3447                 :            : 
    3448                 :            :         // Signal ADDRv2 support (BIP155).
    3449         [ #  # ]:          0 :         if (greatest_common_version >= 70016) {
    3450                 :            :             // BIP155 defines addrv2 and sendaddrv2 for all protocol versions, but some
    3451                 :            :             // implementations reject messages they don't know. As a courtesy, don't send
    3452                 :            :             // it to nodes with a version before 70016, as no software is known to support
    3453                 :            :             // BIP155 that doesn't announce at least that protocol version number.
    3454 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msg_maker.Make(NetMsgType::SENDADDRV2));
                 [ #  # ]
    3455                 :          0 :         }
    3456                 :            : 
    3457         [ #  # ]:          0 :         pfrom.m_has_all_wanted_services = HasAllDesirableServiceFlags(nServices);
    3458                 :          0 :         peer->m_their_services = nServices;
    3459         [ #  # ]:          0 :         pfrom.SetAddrLocal(addrMe);
    3460                 :            :         {
    3461         [ #  # ]:          0 :             LOCK(pfrom.m_subver_mutex);
    3462         [ #  # ]:          0 :             pfrom.cleanSubVer = cleanSubVer;
    3463                 :          0 :         }
    3464                 :          0 :         peer->m_starting_height = starting_height;
    3465                 :            : 
    3466                 :            :         // Only initialize the Peer::TxRelay m_relay_txs data structure if:
    3467                 :            :         // - this isn't an outbound block-relay-only connection, and
    3468                 :            :         // - this isn't an outbound feeler connection, and
    3469                 :            :         // - fRelay=true (the peer wishes to receive transaction announcements)
    3470                 :            :         //   or we're offering NODE_BLOOM to this peer. NODE_BLOOM means that
    3471                 :            :         //   the peer may turn on transaction relay later.
    3472 [ #  # ][ #  # ]:          0 :         if (!pfrom.IsBlockOnlyConn() &&
    3473 [ #  # ][ #  # ]:          0 :             !pfrom.IsFeelerConn() &&
    3474         [ #  # ]:          0 :             (fRelay || (peer->m_our_services & NODE_BLOOM))) {
    3475         [ #  # ]:          0 :             auto* const tx_relay = peer->SetTxRelay();
    3476                 :            :             {
    3477         [ #  # ]:          0 :                 LOCK(tx_relay->m_bloom_filter_mutex);
    3478                 :          0 :                 tx_relay->m_relay_txs = fRelay; // set to true after we get the first filter* message
    3479                 :          0 :             }
    3480         [ #  # ]:          0 :             if (fRelay) pfrom.m_relays_txs = true;
    3481                 :          0 :         }
    3482                 :            : 
    3483 [ #  # ][ #  # ]:          0 :         if (greatest_common_version >= WTXID_RELAY_VERSION && m_txreconciliation) {
    3484                 :            :             // Per BIP-330, we announce txreconciliation support if:
    3485                 :            :             // - protocol version per the peer's VERSION message supports WTXID_RELAY;
    3486                 :            :             // - transaction relay is supported per the peer's VERSION message
    3487                 :            :             // - this is not a block-relay-only connection and not a feeler
    3488                 :            :             // - this is not an addr fetch connection;
    3489                 :            :             // - we are not in -blocksonly mode.
    3490         [ #  # ]:          0 :             const auto* tx_relay = peer->GetTxRelay();
    3491 [ #  # ][ #  # ]:          0 :             if (tx_relay && WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs) &&
         [ #  # ][ #  # ]
    3492 [ #  # ][ #  # ]:          0 :                 !pfrom.IsAddrFetchConn() && !m_opts.ignore_incoming_txs) {
    3493         [ #  # ]:          0 :                 const uint64_t recon_salt = m_txreconciliation->PreRegisterPeer(pfrom.GetId());
    3494 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(&pfrom, msg_maker.Make(NetMsgType::SENDTXRCNCL,
                 [ #  # ]
    3495                 :            :                                                              TXRECONCILIATION_VERSION, recon_salt));
    3496                 :          0 :             }
    3497                 :          0 :         }
    3498                 :            : 
    3499 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(&pfrom, msg_maker.Make(NetMsgType::VERACK));
                 [ #  # ]
    3500                 :            : 
    3501                 :            :         // Potentially mark this peer as a preferred download peer.
    3502                 :            :         {
    3503         [ #  # ]:          0 :             LOCK(cs_main);
    3504         [ #  # ]:          0 :             CNodeState* state = State(pfrom.GetId());
    3505 [ #  # ][ #  # ]:          0 :             state->fPreferredDownload = (!pfrom.IsInboundConn() || pfrom.HasPermission(NetPermissionFlags::NoBan)) && !pfrom.IsAddrFetchConn() && CanServeBlocks(*peer);
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3506                 :          0 :             m_num_preferred_download_peers += state->fPreferredDownload;
    3507                 :          0 :         }
    3508                 :            : 
    3509                 :            :         // Attempt to initialize address relay for outbound peers and use result
    3510                 :            :         // to decide whether to send GETADDR, so that we don't send it to
    3511                 :            :         // inbound or outbound block-relay-only peers.
    3512                 :          0 :         bool send_getaddr{false};
    3513 [ #  # ][ #  # ]:          0 :         if (!pfrom.IsInboundConn()) {
    3514         [ #  # ]:          0 :             send_getaddr = SetupAddressRelay(pfrom, *peer);
    3515                 :          0 :         }
    3516         [ #  # ]:          0 :         if (send_getaddr) {
    3517                 :            :             // Do a one-time address fetch to help populate/update our addrman.
    3518                 :            :             // If we're starting up for the first time, our addrman may be pretty
    3519                 :            :             // empty, so this mechanism is important to help us connect to the network.
    3520                 :            :             // We skip this for block-relay-only peers. We want to avoid
    3521                 :            :             // potentially leaking addr information and we do not want to
    3522                 :            :             // indicate to the peer that we will participate in addr relay.
    3523 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, CNetMsgMaker(greatest_common_version).Make(NetMsgType::GETADDR));
         [ #  # ][ #  # ]
    3524                 :          0 :             peer->m_getaddr_sent = true;
    3525                 :            :             // When requesting a getaddr, accept an additional MAX_ADDR_TO_SEND addresses in response
    3526                 :            :             // (bypassing the MAX_ADDR_PROCESSING_TOKEN_BUCKET limit).
    3527                 :          0 :             peer->m_addr_token_bucket += MAX_ADDR_TO_SEND;
    3528                 :          0 :         }
    3529                 :            : 
    3530 [ #  # ][ #  # ]:          0 :         if (!pfrom.IsInboundConn()) {
    3531                 :            :             // For non-inbound connections, we update the addrman to record
    3532                 :            :             // connection success so that addrman will have an up-to-date
    3533                 :            :             // notion of which peers are online and available.
    3534                 :            :             //
    3535                 :            :             // While we strive to not leak information about block-relay-only
    3536                 :            :             // connections via the addrman, not moving an address to the tried
    3537                 :            :             // table is also potentially detrimental because new-table entries
    3538                 :            :             // are subject to eviction in the event of addrman collisions.  We
    3539                 :            :             // mitigate the information-leak by never calling
    3540                 :            :             // AddrMan::Connected() on block-relay-only peers; see
    3541                 :            :             // FinalizeNode().
    3542                 :            :             //
    3543                 :            :             // This moves an address from New to Tried table in Addrman,
    3544                 :            :             // resolves tried-table collisions, etc.
    3545 [ #  # ][ #  # ]:          0 :             m_addrman.Good(pfrom.addr);
    3546                 :          0 :         }
    3547                 :            : 
    3548                 :          0 :         std::string remoteAddr;
    3549         [ #  # ]:          0 :         if (fLogIPs)
    3550 [ #  # ][ #  # ]:          0 :             remoteAddr = ", peeraddr=" + pfrom.addr.ToStringAddrPort();
    3551                 :            : 
    3552         [ #  # ]:          0 :         const auto mapped_as{m_connman.GetMappedAS(pfrom.addr)};
    3553 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "receive version message: %s: version %d, blocks=%d, us=%s, txrelay=%d, peer=%d%s%s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    3554                 :            :                   cleanSubVer, pfrom.nVersion,
    3555                 :            :                   peer->m_starting_height, addrMe.ToStringAddrPort(), fRelay, pfrom.GetId(),
    3556                 :            :                   remoteAddr, (mapped_as ? strprintf(", mapped_as=%d", mapped_as) : ""));
    3557                 :            : 
    3558         [ #  # ]:          0 :         int64_t nTimeOffset = nTime - GetTime();
    3559                 :          0 :         pfrom.nTimeOffset = nTimeOffset;
    3560 [ #  # ][ #  # ]:          0 :         if (!pfrom.IsInboundConn()) {
    3561                 :            :             // Don't use timedata samples from inbound peers to make it
    3562                 :            :             // harder for others to tamper with our adjusted time.
    3563         [ #  # ]:          0 :             AddTimeData(pfrom.addr, nTimeOffset);
    3564                 :          0 :         }
    3565                 :            : 
    3566                 :            :         // If the peer is old enough to have the old alert system, send it the final alert.
    3567         [ #  # ]:          0 :         if (greatest_common_version <= 70012) {
    3568         [ #  # ]:          0 :             const auto finalAlert{ParseHex("60010000000000000000000000ffffff7f00000000ffffff7ffeffff7f01ffffff7f00000000ffffff7f00ffffff7f002f555247454e543a20416c657274206b657920636f6d70726f6d697365642c2075706772616465207265717569726564004630440220653febd6410f470f6bae11cad19c48413becb1ac2c17f908fd0fd53bdc3abd5202206d0e9c96fe88d4a0f01ed9dedae2b6f9e00da94cad0fecaae66ecf689bf71b50")};
    3569 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, CNetMsgMaker(greatest_common_version).Make("alert", Span{finalAlert}));
         [ #  # ][ #  # ]
                 [ #  # ]
    3570                 :          0 :         }
    3571                 :            : 
    3572                 :            :         // Feeler connections exist only to verify if address is online.
    3573 [ #  # ][ #  # ]:          0 :         if (pfrom.IsFeelerConn()) {
    3574 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "feeler connection completed peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3575                 :          0 :             pfrom.fDisconnect = true;
    3576                 :          0 :         }
    3577                 :            :         return;
    3578                 :          0 :     }
    3579                 :            : 
    3580         [ #  # ]:          0 :     if (pfrom.nVersion == 0) {
    3581                 :            :         // Must have a version message before anything else
    3582 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "non-version message before version handshake. Message \"%s\" from peer=%d\n", SanitizeString(msg_type), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3583                 :          0 :         return;
    3584                 :            :     }
    3585                 :            : 
    3586                 :            :     // At this point, the outgoing message serialization version can't change.
    3587         [ #  # ]:          0 :     const CNetMsgMaker msgMaker(pfrom.GetCommonVersion());
    3588                 :            : 
    3589 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::VERACK) {
    3590         [ #  # ]:          0 :         if (pfrom.fSuccessfullyConnected) {
    3591 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "ignoring redundant verack message from peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3592                 :          0 :             return;
    3593                 :            :         }
    3594                 :            : 
    3595                 :            :         // Log succesful connections unconditionally for outbound, but not for inbound as those
    3596                 :            :         // can be triggered by an attacker at high rate.
    3597 [ #  # ][ #  # ]:          0 :         if (!pfrom.IsInboundConn() || LogAcceptCategory(BCLog::NET, BCLog::Level::Debug)) {
                 [ #  # ]
    3598         [ #  # ]:          0 :             const auto mapped_as{m_connman.GetMappedAS(pfrom.addr)};
    3599 [ #  # ][ #  # ]:          0 :             LogPrintf("New %s %s peer connected: version: %d, blocks=%d, peer=%d%s%s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3600                 :            :                       pfrom.ConnectionTypeAsString(),
    3601                 :            :                       TransportTypeAsString(pfrom.m_transport->GetInfo().transport_type),
    3602                 :            :                       pfrom.nVersion.load(), peer->m_starting_height,
    3603                 :            :                       pfrom.GetId(), (fLogIPs ? strprintf(", peeraddr=%s", pfrom.addr.ToStringAddrPort()) : ""),
    3604                 :            :                       (mapped_as ? strprintf(", mapped_as=%d", mapped_as) : ""));
    3605                 :          0 :         }
    3606                 :            : 
    3607         [ #  # ]:          0 :         if (pfrom.GetCommonVersion() >= SHORT_IDS_BLOCKS_VERSION) {
    3608                 :            :             // Tell our peer we are willing to provide version 2 cmpctblocks.
    3609                 :            :             // However, we do not request new block announcements using
    3610                 :            :             // cmpctblock messages.
    3611                 :            :             // We send this to non-NODE NETWORK peers as well, because
    3612                 :            :             // they may wish to request compact blocks from us
    3613 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::SENDCMPCT, /*high_bandwidth=*/false, /*version=*/CMPCTBLOCKS_VERSION));
                 [ #  # ]
    3614                 :          0 :         }
    3615                 :            : 
    3616         [ #  # ]:          0 :         if (m_txreconciliation) {
    3617 [ #  # ][ #  # ]:          0 :             if (!peer->m_wtxid_relay || !m_txreconciliation->IsPeerRegistered(pfrom.GetId())) {
                 [ #  # ]
    3618                 :            :                 // We could have optimistically pre-registered/registered the peer. In that case,
    3619                 :            :                 // we should forget about the reconciliation state here if this wasn't followed
    3620                 :            :                 // by WTXIDRELAY (since WTXIDRELAY can't be announced later).
    3621         [ #  # ]:          0 :                 m_txreconciliation->ForgetPeer(pfrom.GetId());
    3622                 :          0 :             }
    3623                 :          0 :         }
    3624                 :            : 
    3625 [ #  # ][ #  # ]:          0 :         if (auto tx_relay = peer->GetTxRelay()) {
    3626                 :            :             // `TxRelay::m_tx_inventory_to_send` must be empty before the
    3627                 :            :             // version handshake is completed as
    3628                 :            :             // `TxRelay::m_next_inv_send_time` is first initialised in
    3629                 :            :             // `SendMessages` after the verack is received. Any transactions
    3630                 :            :             // received during the version handshake would otherwise
    3631                 :            :             // immediately be advertised without random delay, potentially
    3632                 :            :             // leaking the time of arrival to a spy.
    3633 [ #  # ][ #  # ]:          0 :             Assume(WITH_LOCK(
         [ #  # ][ #  # ]
                 [ #  # ]
    3634                 :            :                 tx_relay->m_tx_inventory_mutex,
    3635                 :            :                 return tx_relay->m_tx_inventory_to_send.empty() &&
    3636                 :            :                        tx_relay->m_next_inv_send_time == 0s));
    3637                 :          0 :         }
    3638                 :            : 
    3639                 :          0 :         pfrom.fSuccessfullyConnected = true;
    3640                 :          0 :         return;
    3641                 :            :     }
    3642                 :            : 
    3643 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::SENDHEADERS) {
    3644                 :          0 :         peer->m_prefers_headers = true;
    3645                 :          0 :         return;
    3646                 :            :     }
    3647                 :            : 
    3648 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::SENDCMPCT) {
    3649                 :          0 :         bool sendcmpct_hb{false};
    3650                 :          0 :         uint64_t sendcmpct_version{0};
    3651 [ #  # ][ #  # ]:          0 :         vRecv >> sendcmpct_hb >> sendcmpct_version;
    3652                 :            : 
    3653                 :            :         // Only support compact block relay with witnesses
    3654         [ #  # ]:          0 :         if (sendcmpct_version != CMPCTBLOCKS_VERSION) return;
    3655                 :            : 
    3656         [ #  # ]:          0 :         LOCK(cs_main);
    3657         [ #  # ]:          0 :         CNodeState* nodestate = State(pfrom.GetId());
    3658                 :          0 :         nodestate->m_provides_cmpctblocks = true;
    3659                 :          0 :         nodestate->m_requested_hb_cmpctblocks = sendcmpct_hb;
    3660                 :            :         // save whether peer selects us as BIP152 high-bandwidth peer
    3661                 :            :         // (receiving sendcmpct(1) signals high-bandwidth, sendcmpct(0) low-bandwidth)
    3662                 :          0 :         pfrom.m_bip152_highbandwidth_from = sendcmpct_hb;
    3663                 :            :         return;
    3664                 :          0 :     }
    3665                 :            : 
    3666                 :            :     // BIP339 defines feature negotiation of wtxidrelay, which must happen between
    3667                 :            :     // VERSION and VERACK to avoid relay problems from switching after a connection is up.
    3668 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::WTXIDRELAY) {
    3669         [ #  # ]:          0 :         if (pfrom.fSuccessfullyConnected) {
    3670                 :            :             // Disconnect peers that send a wtxidrelay message after VERACK.
    3671 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "wtxidrelay received after verack from peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3672                 :          0 :             pfrom.fDisconnect = true;
    3673                 :          0 :             return;
    3674                 :            :         }
    3675         [ #  # ]:          0 :         if (pfrom.GetCommonVersion() >= WTXID_RELAY_VERSION) {
    3676         [ #  # ]:          0 :             if (!peer->m_wtxid_relay) {
    3677                 :          0 :                 peer->m_wtxid_relay = true;
    3678                 :          0 :                 m_wtxid_relay_peers++;
    3679                 :          0 :             } else {
    3680 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "ignoring duplicate wtxidrelay from peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3681                 :            :             }
    3682                 :          0 :         } else {
    3683 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "ignoring wtxidrelay due to old common version=%d from peer=%d\n", pfrom.GetCommonVersion(), pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3684                 :            :         }
    3685                 :          0 :         return;
    3686                 :            :     }
    3687                 :            : 
    3688                 :            :     // BIP155 defines feature negotiation of addrv2 and sendaddrv2, which must happen
    3689                 :            :     // between VERSION and VERACK.
    3690 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::SENDADDRV2) {
    3691         [ #  # ]:          0 :         if (pfrom.fSuccessfullyConnected) {
    3692                 :            :             // Disconnect peers that send a SENDADDRV2 message after VERACK.
    3693 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "sendaddrv2 received after verack from peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3694                 :          0 :             pfrom.fDisconnect = true;
    3695                 :          0 :             return;
    3696                 :            :         }
    3697                 :          0 :         peer->m_wants_addrv2 = true;
    3698                 :          0 :         return;
    3699                 :            :     }
    3700                 :            : 
    3701                 :            :     // Received from a peer demonstrating readiness to announce transactions via reconciliations.
    3702                 :            :     // This feature negotiation must happen between VERSION and VERACK to avoid relay problems
    3703                 :            :     // from switching announcement protocols after the connection is up.
    3704 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::SENDTXRCNCL) {
    3705         [ #  # ]:          0 :         if (!m_txreconciliation) {
    3706 [ #  # ][ #  # ]:          0 :             LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "sendtxrcncl from peer=%d ignored, as our node does not have txreconciliation enabled\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3707                 :          0 :             return;
    3708                 :            :         }
    3709                 :            : 
    3710         [ #  # ]:          0 :         if (pfrom.fSuccessfullyConnected) {
    3711 [ #  # ][ #  # ]:          0 :             LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "sendtxrcncl received after verack from peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3712                 :          0 :             pfrom.fDisconnect = true;
    3713                 :          0 :             return;
    3714                 :            :         }
    3715                 :            : 
    3716                 :            :         // Peer must not offer us reconciliations if we specified no tx relay support in VERSION.
    3717 [ #  # ][ #  # ]:          0 :         if (RejectIncomingTxs(pfrom)) {
    3718 [ #  # ][ #  # ]:          0 :             LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "sendtxrcncl received from peer=%d to which we indicated no tx relay; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3719                 :          0 :             pfrom.fDisconnect = true;
    3720                 :          0 :             return;
    3721                 :            :         }
    3722                 :            : 
    3723                 :            :         // Peer must not offer us reconciliations if they specified no tx relay support in VERSION.
    3724                 :            :         // This flag might also be false in other cases, but the RejectIncomingTxs check above
    3725                 :            :         // eliminates them, so that this flag fully represents what we are looking for.
    3726         [ #  # ]:          0 :         const auto* tx_relay = peer->GetTxRelay();
    3727 [ #  # ][ #  # ]:          0 :         if (!tx_relay || !WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs)) {
                 [ #  # ]
    3728 [ #  # ][ #  # ]:          0 :             LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "sendtxrcncl received from peer=%d which indicated no tx relay to us; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3729                 :          0 :             pfrom.fDisconnect = true;
    3730                 :          0 :             return;
    3731                 :            :         }
    3732                 :            : 
    3733                 :            :         uint32_t peer_txreconcl_version;
    3734                 :            :         uint64_t remote_salt;
    3735 [ #  # ][ #  # ]:          0 :         vRecv >> peer_txreconcl_version >> remote_salt;
    3736                 :            : 
    3737 [ #  # ][ #  # ]:          0 :         const ReconciliationRegisterResult result = m_txreconciliation->RegisterPeer(pfrom.GetId(), pfrom.IsInboundConn(),
    3738                 :          0 :                                                                                      peer_txreconcl_version, remote_salt);
    3739   [ #  #  #  #  :          0 :         switch (result) {
                      # ]
    3740                 :            :         case ReconciliationRegisterResult::NOT_FOUND:
    3741 [ #  # ][ #  # ]:          0 :             LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "Ignore unexpected txreconciliation signal from peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3742                 :          0 :             break;
    3743                 :            :         case ReconciliationRegisterResult::SUCCESS:
    3744                 :          0 :             break;
    3745                 :            :         case ReconciliationRegisterResult::ALREADY_REGISTERED:
    3746 [ #  # ][ #  # ]:          0 :             LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "txreconciliation protocol violation from peer=%d (sendtxrcncl received from already registered peer); disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3747                 :          0 :             pfrom.fDisconnect = true;
    3748                 :          0 :             return;
    3749                 :            :         case ReconciliationRegisterResult::PROTOCOL_VIOLATION:
    3750 [ #  # ][ #  # ]:          0 :             LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "txreconciliation protocol violation from peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3751                 :          0 :             pfrom.fDisconnect = true;
    3752                 :          0 :             return;
    3753                 :            :         }
    3754                 :          0 :         return;
    3755                 :            :     }
    3756                 :            : 
    3757         [ #  # ]:          0 :     if (!pfrom.fSuccessfullyConnected) {
    3758 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Unsupported message \"%s\" prior to verack from peer=%d\n", SanitizeString(msg_type), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3759                 :          0 :         return;
    3760                 :            :     }
    3761                 :            : 
    3762 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::ADDR || msg_type == NetMsgType::ADDRV2) {
         [ #  # ][ #  # ]
    3763                 :          0 :         const auto ser_params{
    3764 [ #  # ][ #  # ]:          0 :             msg_type == NetMsgType::ADDRV2 ?
    3765                 :            :             // Set V2 param so that the CNetAddr and CAddress
    3766                 :            :             // unserialize methods know that an address in v2 format is coming.
    3767                 :            :             CAddress::V2_NETWORK :
    3768                 :            :             CAddress::V1_NETWORK,
    3769                 :            :         };
    3770                 :            : 
    3771                 :          0 :         std::vector<CAddress> vAddr;
    3772                 :            : 
    3773 [ #  # ][ #  # ]:          0 :         vRecv >> ser_params(vAddr);
    3774                 :            : 
    3775 [ #  # ][ #  # ]:          0 :         if (!SetupAddressRelay(pfrom, *peer)) {
    3776 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "ignoring %s message from %s peer=%d\n", msg_type, pfrom.ConnectionTypeAsString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3777                 :          0 :             return;
    3778                 :            :         }
    3779                 :            : 
    3780         [ #  # ]:          0 :         if (vAddr.size() > MAX_ADDR_TO_SEND)
    3781                 :            :         {
    3782 [ #  # ][ #  # ]:          0 :             Misbehaving(*peer, 20, strprintf("%s message size = %u", msg_type, vAddr.size()));
    3783                 :          0 :             return;
    3784                 :            :         }
    3785                 :            : 
    3786                 :            :         // Store the new addresses
    3787                 :          0 :         std::vector<CAddress> vAddrOk;
    3788         [ #  # ]:          0 :         const auto current_a_time{Now<NodeSeconds>()};
    3789                 :            : 
    3790                 :            :         // Update/increment addr rate limiting bucket.
    3791         [ #  # ]:          0 :         const auto current_time{GetTime<std::chrono::microseconds>()};
    3792         [ #  # ]:          0 :         if (peer->m_addr_token_bucket < MAX_ADDR_PROCESSING_TOKEN_BUCKET) {
    3793                 :            :             // Don't increment bucket if it's already full
    3794 [ #  # ][ #  # ]:          0 :             const auto time_diff = std::max(current_time - peer->m_addr_token_timestamp, 0us);
                 [ #  # ]
    3795         [ #  # ]:          0 :             const double increment = Ticks<SecondsDouble>(time_diff) * MAX_ADDR_RATE_PER_SECOND;
    3796         [ #  # ]:          0 :             peer->m_addr_token_bucket = std::min<double>(peer->m_addr_token_bucket + increment, MAX_ADDR_PROCESSING_TOKEN_BUCKET);
    3797                 :          0 :         }
    3798                 :          0 :         peer->m_addr_token_timestamp = current_time;
    3799                 :            : 
    3800         [ #  # ]:          0 :         const bool rate_limited = !pfrom.HasPermission(NetPermissionFlags::Addr);
    3801                 :          0 :         uint64_t num_proc = 0;
    3802                 :          0 :         uint64_t num_rate_limit = 0;
    3803         [ #  # ]:          0 :         Shuffle(vAddr.begin(), vAddr.end(), m_rng);
    3804         [ #  # ]:          0 :         for (CAddress& addr : vAddr)
    3805                 :            :         {
    3806         [ #  # ]:          0 :             if (interruptMsgProc)
    3807                 :          0 :                 return;
    3808                 :            : 
    3809                 :            :             // Apply rate limiting.
    3810         [ #  # ]:          0 :             if (peer->m_addr_token_bucket < 1.0) {
    3811         [ #  # ]:          0 :                 if (rate_limited) {
    3812                 :          0 :                     ++num_rate_limit;
    3813                 :          0 :                     continue;
    3814                 :            :                 }
    3815                 :          0 :             } else {
    3816                 :          0 :                 peer->m_addr_token_bucket -= 1.0;
    3817                 :            :             }
    3818                 :            :             // We only bother storing full nodes, though this may include
    3819                 :            :             // things which we would not make an outbound connection to, in
    3820                 :            :             // part because we may make feeler connections to them.
    3821 [ #  # ][ #  # ]:          0 :             if (!MayHaveUsefulAddressDB(addr.nServices) && !HasAllDesirableServiceFlags(addr.nServices))
         [ #  # ][ #  # ]
    3822                 :          0 :                 continue;
    3823                 :            : 
    3824 [ #  # ][ #  # ]:          0 :             if (addr.nTime <= NodeSeconds{100000000s} || addr.nTime > current_a_time + 10min) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3825 [ #  # ][ #  # ]:          0 :                 addr.nTime = current_a_time - 5 * 24h;
                 [ #  # ]
    3826                 :          0 :             }
    3827         [ #  # ]:          0 :             AddAddressKnown(*peer, addr);
    3828 [ #  # ][ #  # ]:          0 :             if (m_banman && (m_banman->IsDiscouraged(addr) || m_banman->IsBanned(addr))) {
         [ #  # ][ #  # ]
                 [ #  # ]
    3829                 :            :                 // Do not process banned/discouraged addresses beyond remembering we received them
    3830                 :          0 :                 continue;
    3831                 :            :             }
    3832                 :          0 :             ++num_proc;
    3833         [ #  # ]:          0 :             const bool reachable{g_reachable_nets.Contains(addr)};
    3834 [ #  # ][ #  # ]:          0 :             if (addr.nTime > current_a_time - 10min && !peer->m_getaddr_sent && vAddr.size() <= 10 && addr.IsRoutable()) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3835                 :            :                 // Relay to a limited number of other nodes
    3836         [ #  # ]:          0 :                 RelayAddress(pfrom.GetId(), addr, reachable);
    3837                 :          0 :             }
    3838                 :            :             // Do not store addresses outside our network
    3839         [ #  # ]:          0 :             if (reachable) {
    3840         [ #  # ]:          0 :                 vAddrOk.push_back(addr);
    3841                 :          0 :             }
    3842                 :            :         }
    3843                 :          0 :         peer->m_addr_processed += num_proc;
    3844                 :          0 :         peer->m_addr_rate_limited += num_rate_limit;
    3845 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Received addr: %u addresses (%u processed, %u rate-limited) from peer=%d\n",
         [ #  # ][ #  # ]
                 [ #  # ]
    3846                 :            :                  vAddr.size(), num_proc, num_rate_limit, pfrom.GetId());
    3847                 :            : 
    3848 [ #  # ][ #  # ]:          0 :         m_addrman.Add(vAddrOk, pfrom.addr, 2h);
                 [ #  # ]
    3849         [ #  # ]:          0 :         if (vAddr.size() < 1000) peer->m_getaddr_sent = false;
    3850                 :            : 
    3851                 :            :         // AddrFetch: Require multiple addresses to avoid disconnecting on self-announcements
    3852 [ #  # ][ #  # ]:          0 :         if (pfrom.IsAddrFetchConn() && vAddr.size() > 1) {
                 [ #  # ]
    3853 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "addrfetch connection completed peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3854                 :          0 :             pfrom.fDisconnect = true;
    3855                 :          0 :         }
    3856                 :          0 :         return;
    3857                 :          0 :     }
    3858                 :            : 
    3859 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::INV) {
    3860                 :          0 :         std::vector<CInv> vInv;
    3861         [ #  # ]:          0 :         vRecv >> vInv;
    3862         [ #  # ]:          0 :         if (vInv.size() > MAX_INV_SZ)
    3863                 :            :         {
    3864 [ #  # ][ #  # ]:          0 :             Misbehaving(*peer, 20, strprintf("inv message size = %u", vInv.size()));
    3865                 :          0 :             return;
    3866                 :            :         }
    3867                 :            : 
    3868         [ #  # ]:          0 :         const bool reject_tx_invs{RejectIncomingTxs(pfrom)};
    3869                 :            : 
    3870         [ #  # ]:          0 :         LOCK(cs_main);
    3871                 :            : 
    3872         [ #  # ]:          0 :         const auto current_time{GetTime<std::chrono::microseconds>()};
    3873                 :          0 :         uint256* best_block{nullptr};
    3874                 :            : 
    3875         [ #  # ]:          0 :         for (CInv& inv : vInv) {
    3876         [ #  # ]:          0 :             if (interruptMsgProc) return;
    3877                 :            : 
    3878                 :            :             // Ignore INVs that don't match wtxidrelay setting.
    3879                 :            :             // Note that orphan parent fetching always uses MSG_TX GETDATAs regardless of the wtxidrelay setting.
    3880                 :            :             // This is fine as no INV messages are involved in that process.
    3881         [ #  # ]:          0 :             if (peer->m_wtxid_relay) {
    3882 [ #  # ][ #  # ]:          0 :                 if (inv.IsMsgTx()) continue;
    3883                 :          0 :             } else {
    3884 [ #  # ][ #  # ]:          0 :                 if (inv.IsMsgWtx()) continue;
    3885                 :            :             }
    3886                 :            : 
    3887 [ #  # ][ #  # ]:          0 :             if (inv.IsMsgBlk()) {
    3888         [ #  # ]:          0 :                 const bool fAlreadyHave = AlreadyHaveBlock(inv.hash);
    3889 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "got inv: %s  %s peer=%d\n", inv.ToString(), fAlreadyHave ? "have" : "new", pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3890                 :            : 
    3891         [ #  # ]:          0 :                 UpdateBlockAvailability(pfrom.GetId(), inv.hash);
    3892 [ #  # ][ #  # ]:          0 :                 if (!fAlreadyHave && !m_chainman.m_blockman.LoadingBlocks() && !IsBlockRequested(inv.hash)) {
         [ #  # ][ #  # ]
    3893                 :            :                     // Headers-first is the primary method of announcement on
    3894                 :            :                     // the network. If a node fell back to sending blocks by
    3895                 :            :                     // inv, it may be for a re-org, or because we haven't
    3896                 :            :                     // completed initial headers sync. The final block hash
    3897                 :            :                     // provided should be the highest, so send a getheaders and
    3898                 :            :                     // then fetch the blocks we need to catch up.
    3899                 :          0 :                     best_block = &inv.hash;
    3900                 :          0 :                 }
    3901 [ #  # ][ #  # ]:          0 :             } else if (inv.IsGenTxMsg()) {
    3902         [ #  # ]:          0 :                 if (reject_tx_invs) {
    3903 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "transaction (%s) inv sent in violation of protocol, disconnecting peer=%d\n", inv.hash.ToString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3904                 :          0 :                     pfrom.fDisconnect = true;
    3905                 :          0 :                     return;
    3906                 :            :                 }
    3907         [ #  # ]:          0 :                 const GenTxid gtxid = ToGenTxid(inv);
    3908         [ #  # ]:          0 :                 const bool fAlreadyHave = AlreadyHaveTx(gtxid);
    3909 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "got inv: %s  %s peer=%d\n", inv.ToString(), fAlreadyHave ? "have" : "new", pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3910                 :            : 
    3911         [ #  # ]:          0 :                 AddKnownTx(*peer, inv.hash);
    3912 [ #  # ][ #  # ]:          0 :                 if (!fAlreadyHave && !m_chainman.IsInitialBlockDownload()) {
                 [ #  # ]
    3913         [ #  # ]:          0 :                     AddTxAnnouncement(pfrom, gtxid, current_time);
    3914                 :          0 :                 }
    3915                 :          0 :             } else {
    3916 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Unknown inv type \"%s\" received from peer=%d\n", inv.ToString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3917                 :            :             }
    3918                 :            :         }
    3919                 :            : 
    3920         [ #  # ]:          0 :         if (best_block != nullptr) {
    3921                 :            :             // If we haven't started initial headers-sync with this peer, then
    3922                 :            :             // consider sending a getheaders now. On initial startup, there's a
    3923                 :            :             // reliability vs bandwidth tradeoff, where we are only trying to do
    3924                 :            :             // initial headers sync with one peer at a time, with a long
    3925                 :            :             // timeout (at which point, if the sync hasn't completed, we will
    3926                 :            :             // disconnect the peer and then choose another). In the meantime,
    3927                 :            :             // as new blocks are found, we are willing to add one new peer per
    3928                 :            :             // block to sync with as well, to sync quicker in the case where
    3929                 :            :             // our initial peer is unresponsive (but less bandwidth than we'd
    3930                 :            :             // use if we turned on sync with all peers).
    3931 [ #  # ][ #  # ]:          0 :             CNodeState& state{*Assert(State(pfrom.GetId()))};
    3932 [ #  # ][ #  # ]:          0 :             if (state.fSyncStarted || (!peer->m_inv_triggered_getheaders_before_sync && *best_block != m_last_block_inv_triggering_headers_sync)) {
         [ #  # ][ #  # ]
    3933 [ #  # ][ #  # ]:          0 :                 if (MaybeSendGetHeaders(pfrom, GetLocator(m_chainman.m_best_header), *peer)) {
                 [ #  # ]
    3934 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "getheaders (%d) %s to peer=%d\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3935                 :            :                             m_chainman.m_best_header->nHeight, best_block->ToString(),
    3936                 :            :                             pfrom.GetId());
    3937                 :          0 :                 }
    3938         [ #  # ]:          0 :                 if (!state.fSyncStarted) {
    3939                 :          0 :                     peer->m_inv_triggered_getheaders_before_sync = true;
    3940                 :            :                     // Update the last block hash that triggered a new headers
    3941                 :            :                     // sync, so that we don't turn on headers sync with more
    3942                 :            :                     // than 1 new peer every new block.
    3943                 :          0 :                     m_last_block_inv_triggering_headers_sync = *best_block;
    3944                 :          0 :                 }
    3945                 :          0 :             }
    3946                 :          0 :         }
    3947                 :            : 
    3948                 :          0 :         return;
    3949                 :          0 :     }
    3950                 :            : 
    3951 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETDATA) {
    3952                 :          0 :         std::vector<CInv> vInv;
    3953         [ #  # ]:          0 :         vRecv >> vInv;
    3954         [ #  # ]:          0 :         if (vInv.size() > MAX_INV_SZ)
    3955                 :            :         {
    3956 [ #  # ][ #  # ]:          0 :             Misbehaving(*peer, 20, strprintf("getdata message size = %u", vInv.size()));
    3957                 :          0 :             return;
    3958                 :            :         }
    3959                 :            : 
    3960 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "received getdata (%u invsz) peer=%d\n", vInv.size(), pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3961                 :            : 
    3962         [ #  # ]:          0 :         if (vInv.size() > 0) {
    3963 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "received getdata for: %s peer=%d\n", vInv[0].ToString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    3964                 :          0 :         }
    3965                 :            : 
    3966                 :            :         {
    3967         [ #  # ]:          0 :             LOCK(peer->m_getdata_requests_mutex);
    3968         [ #  # ]:          0 :             peer->m_getdata_requests.insert(peer->m_getdata_requests.end(), vInv.begin(), vInv.end());
    3969         [ #  # ]:          0 :             ProcessGetData(pfrom, *peer, interruptMsgProc);
    3970                 :          0 :         }
    3971                 :            : 
    3972                 :          0 :         return;
    3973                 :          0 :     }
    3974                 :            : 
    3975 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETBLOCKS) {
    3976         [ #  # ]:          0 :         CBlockLocator locator;
    3977         [ #  # ]:          0 :         uint256 hashStop;
    3978 [ #  # ][ #  # ]:          0 :         vRecv >> locator >> hashStop;
    3979                 :            : 
    3980         [ #  # ]:          0 :         if (locator.vHave.size() > MAX_LOCATOR_SZ) {
    3981 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "getblocks locator size %lld > %d, disconnect peer=%d\n", locator.vHave.size(), MAX_LOCATOR_SZ, pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    3982                 :          0 :             pfrom.fDisconnect = true;
    3983                 :          0 :             return;
    3984                 :            :         }
    3985                 :            : 
    3986                 :            :         // We might have announced the currently-being-connected tip using a
    3987                 :            :         // compact block, which resulted in the peer sending a getblocks
    3988                 :            :         // request, which we would otherwise respond to without the new block.
    3989                 :            :         // To avoid this situation we simply verify that we are on our best
    3990                 :            :         // known chain now. This is super overkill, but we handle it better
    3991                 :            :         // for getheaders requests, and there are no known nodes which support
    3992                 :            :         // compact blocks but still use getblocks to request blocks.
    3993                 :            :         {
    3994                 :          0 :             std::shared_ptr<const CBlock> a_recent_block;
    3995                 :            :             {
    3996         [ #  # ]:          0 :                 LOCK(m_most_recent_block_mutex);
    3997                 :          0 :                 a_recent_block = m_most_recent_block;
    3998                 :          0 :             }
    3999                 :          0 :             BlockValidationState state;
    4000 [ #  # ][ #  # ]:          0 :             if (!m_chainman.ActiveChainstate().ActivateBestChain(state, a_recent_block)) {
                 [ #  # ]
    4001 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "failed to activate chain (%s)\n", state.ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4002                 :          0 :             }
    4003                 :          0 :         }
    4004                 :            : 
    4005         [ #  # ]:          0 :         LOCK(cs_main);
    4006                 :            : 
    4007                 :            :         // Find the last block the caller has in the main chain
    4008 [ #  # ][ #  # ]:          0 :         const CBlockIndex* pindex = m_chainman.ActiveChainstate().FindForkInGlobalIndex(locator);
    4009                 :            : 
    4010                 :            :         // Send the rest of the chain
    4011         [ #  # ]:          0 :         if (pindex)
    4012 [ #  # ][ #  # ]:          0 :             pindex = m_chainman.ActiveChain().Next(pindex);
    4013                 :          0 :         int nLimit = 500;
    4014 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "getblocks %d to %s limit %d from peer=%d\n", (pindex ? pindex->nHeight : -1), hashStop.IsNull() ? "end" : hashStop.ToString(), nLimit, pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4015 [ #  # ][ #  # ]:          0 :         for (; pindex; pindex = m_chainman.ActiveChain().Next(pindex))
                 [ #  # ]
    4016                 :            :         {
    4017 [ #  # ][ #  # ]:          0 :             if (pindex->GetBlockHash() == hashStop)
    4018                 :            :             {
    4019 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "  getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4020                 :          0 :                 break;
    4021                 :            :             }
    4022                 :            :             // If pruning, don't inv blocks unless we have on disk and are likely to still have
    4023                 :            :             // for some reasonable time window (1 hour) that block relay might require.
    4024                 :          0 :             const int nPrunedBlocksLikelyToHave = MIN_BLOCKS_TO_KEEP - 3600 / m_chainparams.GetConsensus().nPowTargetSpacing;
    4025 [ #  # ][ #  # ]:          0 :             if (m_chainman.m_blockman.IsPruneMode() && (!(pindex->nStatus & BLOCK_HAVE_DATA) || pindex->nHeight <= m_chainman.ActiveChain().Tip()->nHeight - nPrunedBlocksLikelyToHave)) {
         [ #  # ][ #  # ]
                 [ #  # ]
    4026 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, " getblocks stopping, pruned or too old block at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4027                 :          0 :                 break;
    4028                 :            :             }
    4029 [ #  # ][ #  # ]:          0 :             WITH_LOCK(peer->m_block_inv_mutex, peer->m_blocks_for_inv_relay.push_back(pindex->GetBlockHash()));
    4030         [ #  # ]:          0 :             if (--nLimit <= 0) {
    4031                 :            :                 // When this block is requested, we'll send an inv that'll
    4032                 :            :                 // trigger the peer to getblocks the next batch of inventory.
    4033 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "  getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4034         [ #  # ]:          0 :                 WITH_LOCK(peer->m_block_inv_mutex, {peer->m_continuation_block = pindex->GetBlockHash();});
    4035                 :          0 :                 break;
    4036                 :            :             }
    4037                 :          0 :         }
    4038                 :            :         return;
    4039                 :          0 :     }
    4040                 :            : 
    4041 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETBLOCKTXN) {
    4042         [ #  # ]:          0 :         BlockTransactionsRequest req;
    4043         [ #  # ]:          0 :         vRecv >> req;
    4044                 :            : 
    4045                 :          0 :         std::shared_ptr<const CBlock> recent_block;
    4046                 :            :         {
    4047         [ #  # ]:          0 :             LOCK(m_most_recent_block_mutex);
    4048 [ #  # ][ #  # ]:          0 :             if (m_most_recent_block_hash == req.blockhash)
    4049                 :          0 :                 recent_block = m_most_recent_block;
    4050                 :            :             // Unlock m_most_recent_block_mutex to avoid cs_main lock inversion
    4051                 :          0 :         }
    4052         [ #  # ]:          0 :         if (recent_block) {
    4053         [ #  # ]:          0 :             SendBlockTransactions(pfrom, *peer, *recent_block, req);
    4054                 :          0 :             return;
    4055                 :            :         }
    4056                 :            : 
    4057                 :            :         {
    4058         [ #  # ]:          0 :             LOCK(cs_main);
    4059                 :            : 
    4060         [ #  # ]:          0 :             const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(req.blockhash);
    4061 [ #  # ][ #  # ]:          0 :             if (!pindex || !(pindex->nStatus & BLOCK_HAVE_DATA)) {
    4062 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Peer %d sent us a getblocktxn for a block we don't have\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4063                 :          0 :                 return;
    4064                 :            :             }
    4065                 :            : 
    4066 [ #  # ][ #  # ]:          0 :             if (pindex->nHeight >= m_chainman.ActiveChain().Height() - MAX_BLOCKTXN_DEPTH) {
                 [ #  # ]
    4067         [ #  # ]:          0 :                 CBlock block;
    4068         [ #  # ]:          0 :                 const bool ret{m_chainman.m_blockman.ReadBlockFromDisk(block, *pindex)};
    4069         [ #  # ]:          0 :                 assert(ret);
    4070                 :            : 
    4071         [ #  # ]:          0 :                 SendBlockTransactions(pfrom, *peer, block, req);
    4072                 :            :                 return;
    4073                 :          0 :             }
    4074         [ #  # ]:          0 :         }
    4075                 :            : 
    4076                 :            :         // If an older block is requested (should never happen in practice,
    4077                 :            :         // but can happen in tests) send a block response instead of a
    4078                 :            :         // blocktxn response. Sending a full block response instead of a
    4079                 :            :         // small blocktxn response is preferable in the case where a peer
    4080                 :            :         // might maliciously send lots of getblocktxn requests to trigger
    4081                 :            :         // expensive disk reads, because it will require the peer to
    4082                 :            :         // actually receive all the data read from disk over the network.
    4083 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Peer %d sent us a getblocktxn for a block > %i deep\n", pfrom.GetId(), MAX_BLOCKTXN_DEPTH);
         [ #  # ][ #  # ]
                 [ #  # ]
    4084         [ #  # ]:          0 :         CInv inv{MSG_WITNESS_BLOCK, req.blockhash};
    4085 [ #  # ][ #  # ]:          0 :         WITH_LOCK(peer->m_getdata_requests_mutex, peer->m_getdata_requests.push_back(inv));
    4086                 :            :         // The message processing loop will go around again (without pausing) and we'll respond then
    4087                 :          0 :         return;
    4088                 :          0 :     }
    4089                 :            : 
    4090 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETHEADERS) {
    4091         [ #  # ]:          0 :         CBlockLocator locator;
    4092         [ #  # ]:          0 :         uint256 hashStop;
    4093 [ #  # ][ #  # ]:          0 :         vRecv >> locator >> hashStop;
    4094                 :            : 
    4095         [ #  # ]:          0 :         if (locator.vHave.size() > MAX_LOCATOR_SZ) {
    4096 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "getheaders locator size %lld > %d, disconnect peer=%d\n", locator.vHave.size(), MAX_LOCATOR_SZ, pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4097                 :          0 :             pfrom.fDisconnect = true;
    4098                 :          0 :             return;
    4099                 :            :         }
    4100                 :            : 
    4101         [ #  # ]:          0 :         if (m_chainman.m_blockman.LoadingBlocks()) {
    4102 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Ignoring getheaders from peer=%d while importing/reindexing\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4103                 :          0 :             return;
    4104                 :            :         }
    4105                 :            : 
    4106         [ #  # ]:          0 :         LOCK(cs_main);
    4107                 :            : 
    4108                 :            :         // Note that if we were to be on a chain that forks from the checkpointed
    4109                 :            :         // chain, then serving those headers to a peer that has seen the
    4110                 :            :         // checkpointed chain would cause that peer to disconnect us. Requiring
    4111                 :            :         // that our chainwork exceed the minimum chain work is a protection against
    4112                 :            :         // being fed a bogus chain when we started up for the first time and
    4113                 :            :         // getting partitioned off the honest network for serving that chain to
    4114                 :            :         // others.
    4115 [ #  # ][ #  # ]:          0 :         if (m_chainman.ActiveTip() == nullptr ||
                 [ #  # ]
    4116 [ #  # ][ #  # ]:          0 :                 (m_chainman.ActiveTip()->nChainWork < m_chainman.MinimumChainWork() && !pfrom.HasPermission(NetPermissionFlags::Download))) {
         [ #  # ][ #  # ]
                 [ #  # ]
    4117 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Ignoring getheaders from peer=%d because active chain has too little work; sending empty response\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4118                 :            :             // Just respond with an empty headers message, to tell the peer to
    4119                 :            :             // go away but not treat us as unresponsive.
    4120 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::HEADERS, std::vector<CBlock>()));
                 [ #  # ]
    4121                 :          0 :             return;
    4122                 :            :         }
    4123                 :            : 
    4124         [ #  # ]:          0 :         CNodeState *nodestate = State(pfrom.GetId());
    4125                 :          0 :         const CBlockIndex* pindex = nullptr;
    4126 [ #  # ][ #  # ]:          0 :         if (locator.IsNull())
    4127                 :            :         {
    4128                 :            :             // If locator is null, return the hashStop block
    4129         [ #  # ]:          0 :             pindex = m_chainman.m_blockman.LookupBlockIndex(hashStop);
    4130         [ #  # ]:          0 :             if (!pindex) {
    4131                 :          0 :                 return;
    4132                 :            :             }
    4133                 :            : 
    4134 [ #  # ][ #  # ]:          0 :             if (!BlockRequestAllowed(pindex)) {
    4135 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "%s: ignoring request from peer=%i for old block header that isn't in the main chain\n", __func__, pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4136                 :          0 :                 return;
    4137                 :            :             }
    4138                 :          0 :         }
    4139                 :            :         else
    4140                 :            :         {
    4141                 :            :             // Find the last block the caller has in the main chain
    4142 [ #  # ][ #  # ]:          0 :             pindex = m_chainman.ActiveChainstate().FindForkInGlobalIndex(locator);
    4143         [ #  # ]:          0 :             if (pindex)
    4144 [ #  # ][ #  # ]:          0 :                 pindex = m_chainman.ActiveChain().Next(pindex);
    4145                 :            :         }
    4146                 :            : 
    4147                 :            :         // we must use CBlocks, as CBlockHeaders won't include the 0x00 nTx count at the end
    4148                 :          0 :         std::vector<CBlock> vHeaders;
    4149                 :          0 :         int nLimit = MAX_HEADERS_RESULTS;
    4150 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "getheaders %d to %s from peer=%d\n", (pindex ? pindex->nHeight : -1), hashStop.IsNull() ? "end" : hashStop.ToString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4151 [ #  # ][ #  # ]:          0 :         for (; pindex; pindex = m_chainman.ActiveChain().Next(pindex))
                 [ #  # ]
    4152                 :            :         {
    4153 [ #  # ][ #  # ]:          0 :             vHeaders.emplace_back(pindex->GetBlockHeader());
    4154 [ #  # ][ #  # ]:          0 :             if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
                 [ #  # ]
    4155                 :          0 :                 break;
    4156                 :          0 :         }
    4157                 :            :         // pindex can be nullptr either if we sent m_chainman.ActiveChain().Tip() OR
    4158                 :            :         // if our peer has m_chainman.ActiveChain().Tip() (and thus we are sending an empty
    4159                 :            :         // headers message). In both cases it's safe to update
    4160                 :            :         // pindexBestHeaderSent to be our tip.
    4161                 :            :         //
    4162                 :            :         // It is important that we simply reset the BestHeaderSent value here,
    4163                 :            :         // and not max(BestHeaderSent, newHeaderSent). We might have announced
    4164                 :            :         // the currently-being-connected tip using a compact block, which
    4165                 :            :         // resulted in the peer sending a headers request, which we respond to
    4166                 :            :         // without the new block. By resetting the BestHeaderSent, we ensure we
    4167                 :            :         // will re-announce the new block via headers (or compact blocks again)
    4168                 :            :         // in the SendMessages logic.
    4169 [ #  # ][ #  # ]:          0 :         nodestate->pindexBestHeaderSent = pindex ? pindex : m_chainman.ActiveChain().Tip();
    4170 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::HEADERS, vHeaders));
                 [ #  # ]
    4171                 :            :         return;
    4172                 :          0 :     }
    4173                 :            : 
    4174 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::TX) {
    4175 [ #  # ][ #  # ]:          0 :         if (RejectIncomingTxs(pfrom)) {
    4176 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "transaction sent in violation of protocol peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4177                 :          0 :             pfrom.fDisconnect = true;
    4178                 :          0 :             return;
    4179                 :            :         }
    4180                 :            : 
    4181                 :            :         // Stop processing the transaction early if we are still in IBD since we don't
    4182                 :            :         // have enough information to validate it yet. Sending unsolicited transactions
    4183                 :            :         // is not considered a protocol violation, so don't punish the peer.
    4184 [ #  # ][ #  # ]:          0 :         if (m_chainman.IsInitialBlockDownload()) return;
    4185                 :            : 
    4186                 :          0 :         CTransactionRef ptx;
    4187         [ #  # ]:          0 :         vRecv >> ptx;
    4188                 :          0 :         const CTransaction& tx = *ptx;
    4189                 :            : 
    4190                 :          0 :         const uint256& txid = ptx->GetHash();
    4191                 :          0 :         const uint256& wtxid = ptx->GetWitnessHash();
    4192                 :            : 
    4193         [ #  # ]:          0 :         const uint256& hash = peer->m_wtxid_relay ? wtxid : txid;
    4194         [ #  # ]:          0 :         AddKnownTx(*peer, hash);
    4195                 :            : 
    4196         [ #  # ]:          0 :         LOCK(cs_main);
    4197                 :            : 
    4198         [ #  # ]:          0 :         m_txrequest.ReceivedResponse(pfrom.GetId(), txid);
    4199 [ #  # ][ #  # ]:          0 :         if (tx.HasWitness()) m_txrequest.ReceivedResponse(pfrom.GetId(), wtxid);
                 [ #  # ]
    4200                 :            : 
    4201                 :            :         // We do the AlreadyHaveTx() check using wtxid, rather than txid - in the
    4202                 :            :         // absence of witness malleation, this is strictly better, because the
    4203                 :            :         // recent rejects filter may contain the wtxid but rarely contains
    4204                 :            :         // the txid of a segwit transaction that has been rejected.
    4205                 :            :         // In the presence of witness malleation, it's possible that by only
    4206                 :            :         // doing the check with wtxid, we could overlook a transaction which
    4207                 :            :         // was confirmed with a different witness, or exists in our mempool
    4208                 :            :         // with a different witness, but this has limited downside:
    4209                 :            :         // mempool validation does its own lookup of whether we have the txid
    4210                 :            :         // already; and an adversary can already relay us old transactions
    4211                 :            :         // (older than our recency filter) if trying to DoS us, without any need
    4212                 :            :         // for witness malleation.
    4213 [ #  # ][ #  # ]:          0 :         if (AlreadyHaveTx(GenTxid::Wtxid(wtxid))) {
                 [ #  # ]
    4214 [ #  # ][ #  # ]:          0 :             if (pfrom.HasPermission(NetPermissionFlags::ForceRelay)) {
    4215                 :            :                 // Always relay transactions received from peers with forcerelay
    4216                 :            :                 // permission, even if they were already in the mempool, allowing
    4217                 :            :                 // the node to function as a gateway for nodes hidden behind it.
    4218 [ #  # ][ #  # ]:          0 :                 if (!m_mempool.exists(GenTxid::Txid(tx.GetHash()))) {
                 [ #  # ]
    4219 [ #  # ][ #  # ]:          0 :                     LogPrintf("Not relaying non-mempool transaction %s (wtxid=%s) from forcerelay peer=%d\n",
         [ #  # ][ #  # ]
                 [ #  # ]
    4220                 :            :                               tx.GetHash().ToString(), tx.GetWitnessHash().ToString(), pfrom.GetId());
    4221                 :          0 :                 } else {
    4222 [ #  # ][ #  # ]:          0 :                     LogPrintf("Force relaying tx %s (wtxid=%s) from peer=%d\n",
         [ #  # ][ #  # ]
                 [ #  # ]
    4223                 :            :                               tx.GetHash().ToString(), tx.GetWitnessHash().ToString(), pfrom.GetId());
    4224         [ #  # ]:          0 :                     RelayTransaction(tx.GetHash(), tx.GetWitnessHash());
    4225                 :            :                 }
    4226                 :          0 :             }
    4227                 :            :             // If a tx is detected by m_recent_rejects it is ignored. Because we haven't
    4228                 :            :             // submitted the tx to our mempool, we won't have computed a DoS
    4229                 :            :             // score for it or determined exactly why we consider it invalid.
    4230                 :            :             //
    4231                 :            :             // This means we won't penalize any peer subsequently relaying a DoSy
    4232                 :            :             // tx (even if we penalized the first peer who gave it to us) because
    4233                 :            :             // we have to account for m_recent_rejects showing false positives. In
    4234                 :            :             // other words, we shouldn't penalize a peer if we aren't *sure* they
    4235                 :            :             // submitted a DoSy tx.
    4236                 :            :             //
    4237                 :            :             // Note that m_recent_rejects doesn't just record DoSy or invalid
    4238                 :            :             // transactions, but any tx not accepted by the mempool, which may be
    4239                 :            :             // due to node policy (vs. consensus). So we can't blanket penalize a
    4240                 :            :             // peer simply for relaying a tx that our m_recent_rejects has caught,
    4241                 :            :             // regardless of false positives.
    4242                 :          0 :             return;
    4243                 :            :         }
    4244                 :            : 
    4245         [ #  # ]:          0 :         const MempoolAcceptResult result = m_chainman.ProcessTransaction(ptx);
    4246                 :          0 :         const TxValidationState& state = result.m_state;
    4247                 :            : 
    4248         [ #  # ]:          0 :         if (result.m_result_type == MempoolAcceptResult::ResultType::VALID) {
    4249                 :            :             // As this version of the transaction was acceptable, we can forget about any
    4250                 :            :             // requests for it.
    4251         [ #  # ]:          0 :             m_txrequest.ForgetTxHash(tx.GetHash());
    4252         [ #  # ]:          0 :             m_txrequest.ForgetTxHash(tx.GetWitnessHash());
    4253         [ #  # ]:          0 :             RelayTransaction(tx.GetHash(), tx.GetWitnessHash());
    4254         [ #  # ]:          0 :             m_orphanage.AddChildrenToWorkSet(tx);
    4255                 :            : 
    4256         [ #  # ]:          0 :             pfrom.m_last_tx_time = GetTime<std::chrono::seconds>();
    4257                 :            : 
    4258 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::MEMPOOL, "AcceptToMemoryPool: peer=%d: accepted %s (wtxid=%s) (poolsz %u txn, %u kB)\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    4259                 :            :                 pfrom.GetId(),
    4260                 :            :                 tx.GetHash().ToString(),
    4261                 :            :                 tx.GetWitnessHash().ToString(),
    4262                 :            :                 m_mempool.size(), m_mempool.DynamicMemoryUsage() / 1000);
    4263                 :            : 
    4264 [ #  # ][ #  # ]:          0 :             for (const CTransactionRef& removedTx : result.m_replaced_transactions.value()) {
    4265         [ #  # ]:          0 :                 AddToCompactExtraTransactions(removedTx);
    4266                 :            :             }
    4267                 :          0 :         }
    4268 [ #  # ][ #  # ]:          0 :         else if (state.GetResult() == TxValidationResult::TX_MISSING_INPUTS)
    4269                 :            :         {
    4270                 :          0 :             bool fRejectedParents = false; // It may be the case that the orphans parents have all been rejected
    4271                 :            : 
    4272                 :            :             // Deduplicate parent txids, so that we don't have to loop over
    4273                 :            :             // the same parent txid more than once down below.
    4274                 :          0 :             std::vector<uint256> unique_parents;
    4275         [ #  # ]:          0 :             unique_parents.reserve(tx.vin.size());
    4276         [ #  # ]:          0 :             for (const CTxIn& txin : tx.vin) {
    4277                 :            :                 // We start with all parents, and then remove duplicates below.
    4278         [ #  # ]:          0 :                 unique_parents.push_back(txin.prevout.hash);
    4279                 :            :             }
    4280         [ #  # ]:          0 :             std::sort(unique_parents.begin(), unique_parents.end());
    4281 [ #  # ][ #  # ]:          0 :             unique_parents.erase(std::unique(unique_parents.begin(), unique_parents.end()), unique_parents.end());
    4282         [ #  # ]:          0 :             for (const uint256& parent_txid : unique_parents) {
    4283 [ #  # ][ #  # ]:          0 :                 if (m_recent_rejects.contains(parent_txid)) {
                 [ #  # ]
    4284                 :          0 :                     fRejectedParents = true;
    4285                 :          0 :                     break;
    4286                 :            :                 }
    4287                 :            :             }
    4288         [ #  # ]:          0 :             if (!fRejectedParents) {
    4289         [ #  # ]:          0 :                 const auto current_time{GetTime<std::chrono::microseconds>()};
    4290                 :            : 
    4291         [ #  # ]:          0 :                 for (const uint256& parent_txid : unique_parents) {
    4292                 :            :                     // Here, we only have the txid (and not wtxid) of the
    4293                 :            :                     // inputs, so we only request in txid mode, even for
    4294                 :            :                     // wtxidrelay peers.
    4295                 :            :                     // Eventually we should replace this with an improved
    4296                 :            :                     // protocol for getting all unconfirmed parents.
    4297         [ #  # ]:          0 :                     const auto gtxid{GenTxid::Txid(parent_txid)};
    4298         [ #  # ]:          0 :                     AddKnownTx(*peer, parent_txid);
    4299 [ #  # ][ #  # ]:          0 :                     if (!AlreadyHaveTx(gtxid)) AddTxAnnouncement(pfrom, gtxid, current_time);
                 [ #  # ]
    4300                 :            :                 }
    4301                 :            : 
    4302 [ #  # ][ #  # ]:          0 :                 if (m_orphanage.AddTx(ptx, pfrom.GetId())) {
    4303         [ #  # ]:          0 :                     AddToCompactExtraTransactions(ptx);
    4304                 :          0 :                 }
    4305                 :            : 
    4306                 :            :                 // Once added to the orphan pool, a tx is considered AlreadyHave, and we shouldn't request it anymore.
    4307         [ #  # ]:          0 :                 m_txrequest.ForgetTxHash(tx.GetHash());
    4308         [ #  # ]:          0 :                 m_txrequest.ForgetTxHash(tx.GetWitnessHash());
    4309                 :            : 
    4310                 :            :                 // DoS prevention: do not allow m_orphanage to grow unbounded (see CVE-2012-3789)
    4311         [ #  # ]:          0 :                 m_orphanage.LimitOrphans(m_opts.max_orphan_txs);
    4312                 :          0 :             } else {
    4313 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::MEMPOOL, "not keeping orphan with rejected parents %s (wtxid=%s)\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    4314                 :            :                          tx.GetHash().ToString(),
    4315                 :            :                          tx.GetWitnessHash().ToString());
    4316                 :            :                 // We will continue to reject this tx since it has rejected
    4317                 :            :                 // parents so avoid re-requesting it from other peers.
    4318                 :            :                 // Here we add both the txid and the wtxid, as we know that
    4319                 :            :                 // regardless of what witness is provided, we will not accept
    4320                 :            :                 // this, so we don't need to allow for redownload of this txid
    4321                 :            :                 // from any of our non-wtxidrelay peers.
    4322 [ #  # ][ #  # ]:          0 :                 m_recent_rejects.insert(tx.GetHash().ToUint256());
    4323 [ #  # ][ #  # ]:          0 :                 m_recent_rejects.insert(tx.GetWitnessHash().ToUint256());
    4324         [ #  # ]:          0 :                 m_txrequest.ForgetTxHash(tx.GetHash());
    4325         [ #  # ]:          0 :                 m_txrequest.ForgetTxHash(tx.GetWitnessHash());
    4326                 :            :             }
    4327                 :          0 :         } else {
    4328 [ #  # ][ #  # ]:          0 :             if (state.GetResult() != TxValidationResult::TX_WITNESS_STRIPPED) {
    4329                 :            :                 // We can add the wtxid of this transaction to our reject filter.
    4330                 :            :                 // Do not add txids of witness transactions or witness-stripped
    4331                 :            :                 // transactions to the filter, as they can have been malleated;
    4332                 :            :                 // adding such txids to the reject filter would potentially
    4333                 :            :                 // interfere with relay of valid transactions from peers that
    4334                 :            :                 // do not support wtxid-based relay. See
    4335                 :            :                 // https://github.com/bitcoin/bitcoin/issues/8279 for details.
    4336                 :            :                 // We can remove this restriction (and always add wtxids to
    4337                 :            :                 // the filter even for witness stripped transactions) once
    4338                 :            :                 // wtxid-based relay is broadly deployed.
    4339                 :            :                 // See also comments in https://github.com/bitcoin/bitcoin/pull/18044#discussion_r443419034
    4340                 :            :                 // for concerns around weakening security of unupgraded nodes
    4341                 :            :                 // if we start doing this too early.
    4342 [ #  # ][ #  # ]:          0 :                 m_recent_rejects.insert(tx.GetWitnessHash().ToUint256());
    4343         [ #  # ]:          0 :                 m_txrequest.ForgetTxHash(tx.GetWitnessHash());
    4344                 :            :                 // If the transaction failed for TX_INPUTS_NOT_STANDARD,
    4345                 :            :                 // then we know that the witness was irrelevant to the policy
    4346                 :            :                 // failure, since this check depends only on the txid
    4347                 :            :                 // (the scriptPubKey being spent is covered by the txid).
    4348                 :            :                 // Add the txid to the reject filter to prevent repeated
    4349                 :            :                 // processing of this transaction in the event that child
    4350                 :            :                 // transactions are later received (resulting in
    4351                 :            :                 // parent-fetching by txid via the orphan-handling logic).
    4352 [ #  # ][ #  # ]:          0 :                 if (state.GetResult() == TxValidationResult::TX_INPUTS_NOT_STANDARD && tx.HasWitness()) {
         [ #  # ][ #  # ]
    4353 [ #  # ][ #  # ]:          0 :                     m_recent_rejects.insert(tx.GetHash().ToUint256());
    4354         [ #  # ]:          0 :                     m_txrequest.ForgetTxHash(tx.GetHash());
    4355                 :          0 :                 }
    4356 [ #  # ][ #  # ]:          0 :                 if (RecursiveDynamicUsage(*ptx) < 100000) {
    4357         [ #  # ]:          0 :                     AddToCompactExtraTransactions(ptx);
    4358                 :          0 :                 }
    4359                 :          0 :             }
    4360                 :            :         }
    4361                 :            : 
    4362 [ #  # ][ #  # ]:          0 :         if (state.IsInvalid()) {
    4363 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::MEMPOOLREJ, "%s (wtxid=%s) from peer=%d was not accepted: %s\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4364                 :            :                 tx.GetHash().ToString(),
    4365                 :            :                 tx.GetWitnessHash().ToString(),
    4366                 :            :                 pfrom.GetId(),
    4367                 :            :                 state.ToString());
    4368         [ #  # ]:          0 :             MaybePunishNodeForTx(pfrom.GetId(), state);
    4369                 :          0 :         }
    4370                 :            :         return;
    4371                 :          0 :     }
    4372                 :            : 
    4373 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::CMPCTBLOCK)
    4374                 :            :     {
    4375                 :            :         // Ignore cmpctblock received while importing
    4376         [ #  # ]:          0 :         if (m_chainman.m_blockman.LoadingBlocks()) {
    4377 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Unexpected cmpctblock message received from peer %d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4378                 :          0 :             return;
    4379                 :            :         }
    4380                 :            : 
    4381         [ #  # ]:          0 :         CBlockHeaderAndShortTxIDs cmpctblock;
    4382         [ #  # ]:          0 :         vRecv >> cmpctblock;
    4383                 :            : 
    4384                 :          0 :         bool received_new_header = false;
    4385         [ #  # ]:          0 :         const auto blockhash = cmpctblock.header.GetHash();
    4386                 :            : 
    4387                 :            :         {
    4388         [ #  # ]:          0 :         LOCK(cs_main);
    4389                 :            : 
    4390         [ #  # ]:          0 :         const CBlockIndex* prev_block = m_chainman.m_blockman.LookupBlockIndex(cmpctblock.header.hashPrevBlock);
    4391         [ #  # ]:          0 :         if (!prev_block) {
    4392                 :            :             // Doesn't connect (or is genesis), instead of DoSing in AcceptBlockHeader, request deeper headers
    4393 [ #  # ][ #  # ]:          0 :             if (!m_chainman.IsInitialBlockDownload()) {
    4394 [ #  # ][ #  # ]:          0 :                 MaybeSendGetHeaders(pfrom, GetLocator(m_chainman.m_best_header), *peer);
    4395                 :          0 :             }
    4396                 :          0 :             return;
    4397 [ #  # ][ #  # ]:          0 :         } else if (prev_block->nChainWork + CalculateHeadersWork({cmpctblock.header}) < GetAntiDoSWorkThreshold()) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4398                 :            :             // If we get a low-work header in a compact block, we can ignore it.
    4399 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Ignoring low-work compact block from peer %d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4400                 :          0 :             return;
    4401                 :            :         }
    4402                 :            : 
    4403 [ #  # ][ #  # ]:          0 :         if (!m_chainman.m_blockman.LookupBlockIndex(blockhash)) {
    4404                 :          0 :             received_new_header = true;
    4405                 :          0 :         }
    4406         [ #  # ]:          0 :         }
    4407                 :            : 
    4408                 :          0 :         const CBlockIndex *pindex = nullptr;
    4409                 :          0 :         BlockValidationState state;
    4410 [ #  # ][ #  # ]:          0 :         if (!m_chainman.ProcessNewBlockHeaders({cmpctblock.header}, /*min_pow_checked=*/true, state, &pindex)) {
                 [ #  # ]
    4411         [ #  # ]:          0 :             if (state.IsInvalid()) {
    4412 [ #  # ][ #  # ]:          0 :                 MaybePunishNodeForBlock(pfrom.GetId(), state, /*via_compact_block=*/true, "invalid header via cmpctblock");
    4413                 :          0 :                 return;
    4414                 :            :             }
    4415                 :          0 :         }
    4416                 :            : 
    4417         [ #  # ]:          0 :         if (received_new_header) {
    4418 [ #  # ][ #  # ]:          0 :             LogPrintfCategory(BCLog::NET, "Saw new cmpctblock header hash=%s peer=%d\n",
         [ #  # ][ #  # ]
    4419                 :            :                 blockhash.ToString(), pfrom.GetId());
    4420                 :          0 :         }
    4421                 :            : 
    4422                 :          0 :         bool fProcessBLOCKTXN = false;
    4423                 :            : 
    4424                 :            :         // If we end up treating this as a plain headers message, call that as well
    4425                 :            :         // without cs_main.
    4426                 :          0 :         bool fRevertToHeaderProcessing = false;
    4427                 :            : 
    4428                 :            :         // Keep a CBlock for "optimistic" compactblock reconstructions (see
    4429                 :            :         // below)
    4430         [ #  # ]:          0 :         std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
    4431                 :          0 :         bool fBlockReconstructed = false;
    4432                 :            : 
    4433                 :            :         {
    4434         [ #  # ]:          0 :         LOCK(cs_main);
    4435                 :            :         // If AcceptBlockHeader returned true, it set pindex
    4436         [ #  # ]:          0 :         assert(pindex);
    4437         [ #  # ]:          0 :         UpdateBlockAvailability(pfrom.GetId(), pindex->GetBlockHash());
    4438                 :            : 
    4439         [ #  # ]:          0 :         CNodeState *nodestate = State(pfrom.GetId());
    4440                 :            : 
    4441                 :            :         // If this was a new header with more work than our tip, update the
    4442                 :            :         // peer's last block announcement time
    4443 [ #  # ][ #  # ]:          0 :         if (received_new_header && pindex->nChainWork > m_chainman.ActiveChain().Tip()->nChainWork) {
         [ #  # ][ #  # ]
    4444         [ #  # ]:          0 :             nodestate->m_last_block_announcement = GetTime();
    4445                 :          0 :         }
    4446                 :            : 
    4447         [ #  # ]:          0 :         if (pindex->nStatus & BLOCK_HAVE_DATA) // Nothing to do here
    4448                 :          0 :             return;
    4449                 :            : 
    4450         [ #  # ]:          0 :         auto range_flight = mapBlocksInFlight.equal_range(pindex->GetBlockHash());
    4451         [ #  # ]:          0 :         size_t already_in_flight = std::distance(range_flight.first, range_flight.second);
    4452                 :          0 :         bool requested_block_from_this_peer{false};
    4453                 :            : 
    4454                 :            :         // Multimap ensures ordering of outstanding requests. It's either empty or first in line.
    4455         [ #  # ]:          0 :         bool first_in_flight = already_in_flight == 0 || (range_flight.first->second.first == pfrom.GetId());
    4456                 :            : 
    4457         [ #  # ]:          0 :         while (range_flight.first != range_flight.second) {
    4458         [ #  # ]:          0 :             if (range_flight.first->second.first == pfrom.GetId()) {
    4459                 :          0 :                 requested_block_from_this_peer = true;
    4460                 :          0 :                 break;
    4461                 :            :             }
    4462                 :          0 :             range_flight.first++;
    4463                 :            :         }
    4464                 :            : 
    4465 [ #  # ][ #  # ]:          0 :         if (pindex->nChainWork <= m_chainman.ActiveChain().Tip()->nChainWork || // We know something better
         [ #  # ][ #  # ]
    4466                 :          0 :                 pindex->nTx != 0) { // We had this block at some point, but pruned it
    4467         [ #  # ]:          0 :             if (requested_block_from_this_peer) {
    4468                 :            :                 // We requested this block for some reason, but our mempool will probably be useless
    4469                 :            :                 // so we just grab the block via normal getdata
    4470         [ #  # ]:          0 :                 std::vector<CInv> vInv(1);
    4471 [ #  # ][ #  # ]:          0 :                 vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(*peer), blockhash);
    4472 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETDATA, vInv));
                 [ #  # ]
    4473                 :          0 :             }
    4474                 :          0 :             return;
    4475                 :            :         }
    4476                 :            : 
    4477                 :            :         // If we're not close to tip yet, give up and let parallel block fetch work its magic
    4478 [ #  # ][ #  # ]:          0 :         if (!already_in_flight && !CanDirectFetch()) {
                 [ #  # ]
    4479                 :          0 :             return;
    4480                 :            :         }
    4481                 :            : 
    4482                 :            :         // We want to be a bit conservative just to be extra careful about DoS
    4483                 :            :         // possibilities in compact block processing...
    4484 [ #  # ][ #  # ]:          0 :         if (pindex->nHeight <= m_chainman.ActiveChain().Height() + 2) {
                 [ #  # ]
    4485 [ #  # ][ #  # ]:          0 :             if ((already_in_flight < MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK && nodestate->vBlocksInFlight.size() < MAX_BLOCKS_IN_TRANSIT_PER_PEER) ||
    4486                 :          0 :                  requested_block_from_this_peer) {
    4487                 :          0 :                 std::list<QueuedBlock>::iterator* queuedBlockIt = nullptr;
    4488 [ #  # ][ #  # ]:          0 :                 if (!BlockRequested(pfrom.GetId(), *pindex, &queuedBlockIt)) {
    4489         [ #  # ]:          0 :                     if (!(*queuedBlockIt)->partialBlock)
    4490 [ #  # ][ #  # ]:          0 :                         (*queuedBlockIt)->partialBlock.reset(new PartiallyDownloadedBlock(&m_mempool));
    4491                 :            :                     else {
    4492                 :            :                         // The block was already in flight using compact blocks from the same peer
    4493 [ #  # ][ #  # ]:          0 :                         LogPrint(BCLog::NET, "Peer sent us compact block we were already syncing!\n");
         [ #  # ][ #  # ]
                 [ #  # ]
    4494                 :          0 :                         return;
    4495                 :            :                     }
    4496                 :          0 :                 }
    4497                 :            : 
    4498                 :          0 :                 PartiallyDownloadedBlock& partialBlock = *(*queuedBlockIt)->partialBlock;
    4499         [ #  # ]:          0 :                 ReadStatus status = partialBlock.InitData(cmpctblock, vExtraTxnForCompact);
    4500         [ #  # ]:          0 :                 if (status == READ_STATUS_INVALID) {
    4501         [ #  # ]:          0 :                     RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId()); // Reset in-flight state in case Misbehaving does not result in a disconnect
    4502 [ #  # ][ #  # ]:          0 :                     Misbehaving(*peer, 100, "invalid compact block");
    4503                 :          0 :                     return;
    4504         [ #  # ]:          0 :                 } else if (status == READ_STATUS_FAILED) {
    4505         [ #  # ]:          0 :                     if (first_in_flight)  {
    4506                 :            :                         // Duplicate txindexes, the block is now in-flight, so just request it
    4507         [ #  # ]:          0 :                         std::vector<CInv> vInv(1);
    4508 [ #  # ][ #  # ]:          0 :                         vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(*peer), blockhash);
    4509 [ #  # ][ #  # ]:          0 :                         m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETDATA, vInv));
                 [ #  # ]
    4510                 :          0 :                     } else {
    4511                 :            :                         // Give up for this peer and wait for other peer(s)
    4512         [ #  # ]:          0 :                         RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId());
    4513                 :            :                     }
    4514                 :          0 :                     return;
    4515                 :            :                 }
    4516                 :            : 
    4517         [ #  # ]:          0 :                 BlockTransactionsRequest req;
    4518 [ #  # ][ #  # ]:          0 :                 for (size_t i = 0; i < cmpctblock.BlockTxCount(); i++) {
    4519 [ #  # ][ #  # ]:          0 :                     if (!partialBlock.IsTxAvailable(i))
    4520         [ #  # ]:          0 :                         req.indexes.push_back(i);
    4521                 :          0 :                 }
    4522         [ #  # ]:          0 :                 if (req.indexes.empty()) {
    4523                 :          0 :                     fProcessBLOCKTXN = true;
    4524         [ #  # ]:          0 :                 } else if (first_in_flight) {
    4525                 :            :                     // We will try to round-trip any compact blocks we get on failure,
    4526                 :            :                     // as long as it's first...
    4527                 :          0 :                     req.blockhash = pindex->GetBlockHash();
    4528 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETBLOCKTXN, req));
                 [ #  # ]
    4529 [ #  # ][ #  # ]:          0 :                 } else if (pfrom.m_bip152_highbandwidth_to &&
    4530 [ #  # ][ #  # ]:          0 :                     (!pfrom.IsInboundConn() ||
    4531 [ #  # ][ #  # ]:          0 :                     IsBlockRequestedFromOutbound(blockhash) ||
    4532                 :          0 :                     already_in_flight < MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK - 1)) {
    4533                 :            :                     // ... or it's a hb relay peer and:
    4534                 :            :                     // - peer is outbound, or
    4535                 :            :                     // - we already have an outbound attempt in flight(so we'll take what we can get), or
    4536                 :            :                     // - it's not the final parallel download slot (which we may reserve for first outbound)
    4537                 :          0 :                     req.blockhash = pindex->GetBlockHash();
    4538 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETBLOCKTXN, req));
                 [ #  # ]
    4539                 :          0 :                 } else {
    4540                 :            :                     // Give up for this peer and wait for other peer(s)
    4541         [ #  # ]:          0 :                     RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId());
    4542                 :            :                 }
    4543                 :          0 :             } else {
    4544                 :            :                 // This block is either already in flight from a different
    4545                 :            :                 // peer, or this peer has too many blocks outstanding to
    4546                 :            :                 // download from.
    4547                 :            :                 // Optimistically try to reconstruct anyway since we might be
    4548                 :            :                 // able to without any round trips.
    4549         [ #  # ]:          0 :                 PartiallyDownloadedBlock tempBlock(&m_mempool);
    4550         [ #  # ]:          0 :                 ReadStatus status = tempBlock.InitData(cmpctblock, vExtraTxnForCompact);
    4551         [ #  # ]:          0 :                 if (status != READ_STATUS_OK) {
    4552                 :            :                     // TODO: don't ignore failures
    4553                 :          0 :                     return;
    4554                 :            :                 }
    4555                 :          0 :                 std::vector<CTransactionRef> dummy;
    4556         [ #  # ]:          0 :                 status = tempBlock.FillBlock(*pblock, dummy);
    4557         [ #  # ]:          0 :                 if (status == READ_STATUS_OK) {
    4558                 :          0 :                     fBlockReconstructed = true;
    4559                 :          0 :                 }
    4560         [ #  # ]:          0 :             }
    4561                 :          0 :         } else {
    4562         [ #  # ]:          0 :             if (requested_block_from_this_peer) {
    4563                 :            :                 // We requested this block, but its far into the future, so our
    4564                 :            :                 // mempool will probably be useless - request the block normally
    4565         [ #  # ]:          0 :                 std::vector<CInv> vInv(1);
    4566 [ #  # ][ #  # ]:          0 :                 vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(*peer), blockhash);
    4567 [ #  # ][ #  # ]:          0 :                 m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::GETDATA, vInv));
                 [ #  # ]
    4568                 :            :                 return;
    4569                 :          0 :             } else {
    4570                 :            :                 // If this was an announce-cmpctblock, we want the same treatment as a header message
    4571                 :          0 :                 fRevertToHeaderProcessing = true;
    4572                 :            :             }
    4573                 :            :         }
    4574         [ #  # ]:          0 :         } // cs_main
    4575                 :            : 
    4576         [ #  # ]:          0 :         if (fProcessBLOCKTXN) {
    4577         [ #  # ]:          0 :             BlockTransactions txn;
    4578                 :          0 :             txn.blockhash = blockhash;
    4579         [ #  # ]:          0 :             return ProcessCompactBlockTxns(pfrom, *peer, txn);
    4580                 :          0 :         }
    4581                 :            : 
    4582         [ #  # ]:          0 :         if (fRevertToHeaderProcessing) {
    4583                 :            :             // Headers received from HB compact block peers are permitted to be
    4584                 :            :             // relayed before full validation (see BIP 152), so we don't want to disconnect
    4585                 :            :             // the peer if the header turns out to be for an invalid block.
    4586                 :            :             // Note that if a peer tries to build on an invalid chain, that
    4587                 :            :             // will be detected and the peer will be disconnected/discouraged.
    4588 [ #  # ][ #  # ]:          0 :             return ProcessHeadersMessage(pfrom, *peer, {cmpctblock.header}, /*via_compact_block=*/true);
    4589                 :            :         }
    4590                 :            : 
    4591         [ #  # ]:          0 :         if (fBlockReconstructed) {
    4592                 :            :             // If we got here, we were able to optimistically reconstruct a
    4593                 :            :             // block that is in flight from some other peer.
    4594                 :            :             {
    4595         [ #  # ]:          0 :                 LOCK(cs_main);
    4596 [ #  # ][ #  # ]:          0 :                 mapBlockSource.emplace(pblock->GetHash(), std::make_pair(pfrom.GetId(), false));
                 [ #  # ]
    4597                 :          0 :             }
    4598                 :            :             // Setting force_processing to true means that we bypass some of
    4599                 :            :             // our anti-DoS protections in AcceptBlock, which filters
    4600                 :            :             // unrequested blocks that might be trying to waste our resources
    4601                 :            :             // (eg disk space). Because we only try to reconstruct blocks when
    4602                 :            :             // we're close to caught up (via the CanDirectFetch() requirement
    4603                 :            :             // above, combined with the behavior of not requesting blocks until
    4604                 :            :             // we have a chain with at least the minimum chain work), and we ignore
    4605                 :            :             // compact blocks with less work than our tip, it is safe to treat
    4606                 :            :             // reconstructed compact blocks as having been requested.
    4607         [ #  # ]:          0 :             ProcessBlock(pfrom, pblock, /*force_processing=*/true, /*min_pow_checked=*/true);
    4608         [ #  # ]:          0 :             LOCK(cs_main); // hold cs_main for CBlockIndex::IsValid()
    4609 [ #  # ][ #  # ]:          0 :             if (pindex->IsValid(BLOCK_VALID_TRANSACTIONS)) {
    4610                 :            :                 // Clear download state for this block, which is in
    4611                 :            :                 // process from some other peer.  We do this after calling
    4612                 :            :                 // ProcessNewBlock so that a malleated cmpctblock announcement
    4613                 :            :                 // can't be used to interfere with block relay.
    4614 [ #  # ][ #  # ]:          0 :                 RemoveBlockRequest(pblock->GetHash(), std::nullopt);
    4615                 :          0 :             }
    4616                 :          0 :         }
    4617                 :          0 :         return;
    4618                 :          0 :     }
    4619                 :            : 
    4620 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::BLOCKTXN)
    4621                 :            :     {
    4622                 :            :         // Ignore blocktxn received while importing
    4623         [ #  # ]:          0 :         if (m_chainman.m_blockman.LoadingBlocks()) {
    4624 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Unexpected blocktxn message received from peer %d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4625                 :          0 :             return;
    4626                 :            :         }
    4627                 :            : 
    4628         [ #  # ]:          0 :         BlockTransactions resp;
    4629         [ #  # ]:          0 :         vRecv >> resp;
    4630                 :            : 
    4631         [ #  # ]:          0 :         return ProcessCompactBlockTxns(pfrom, *peer, resp);
    4632                 :          0 :     }
    4633                 :            : 
    4634 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::HEADERS)
    4635                 :            :     {
    4636                 :            :         // Ignore headers received while importing
    4637         [ #  # ]:          0 :         if (m_chainman.m_blockman.LoadingBlocks()) {
    4638 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Unexpected headers message received from peer %d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4639                 :          0 :             return;
    4640                 :            :         }
    4641                 :            : 
    4642                 :            :         // Assume that this is in response to any outstanding getheaders
    4643                 :            :         // request we may have sent, and clear out the time of our last request
    4644         [ #  # ]:          0 :         peer->m_last_getheaders_timestamp = {};
    4645                 :            : 
    4646                 :          0 :         std::vector<CBlockHeader> headers;
    4647                 :            : 
    4648                 :            :         // Bypass the normal CBlock deserialization, as we don't want to risk deserializing 2000 full blocks.
    4649         [ #  # ]:          0 :         unsigned int nCount = ReadCompactSize(vRecv);
    4650         [ #  # ]:          0 :         if (nCount > MAX_HEADERS_RESULTS) {
    4651 [ #  # ][ #  # ]:          0 :             Misbehaving(*peer, 20, strprintf("headers message size = %u", nCount));
    4652                 :          0 :             return;
    4653                 :            :         }
    4654         [ #  # ]:          0 :         headers.resize(nCount);
    4655         [ #  # ]:          0 :         for (unsigned int n = 0; n < nCount; n++) {
    4656         [ #  # ]:          0 :             vRecv >> headers[n];
    4657         [ #  # ]:          0 :             ReadCompactSize(vRecv); // ignore tx count; assume it is 0.
    4658                 :          0 :         }
    4659                 :            : 
    4660         [ #  # ]:          0 :         ProcessHeadersMessage(pfrom, *peer, std::move(headers), /*via_compact_block=*/false);
    4661                 :            : 
    4662                 :            :         // Check if the headers presync progress needs to be reported to validation.
    4663                 :            :         // This needs to be done without holding the m_headers_presync_mutex lock.
    4664         [ #  # ]:          0 :         if (m_headers_presync_should_signal.exchange(false)) {
    4665         [ #  # ]:          0 :             HeadersPresyncStats stats;
    4666                 :            :             {
    4667         [ #  # ]:          0 :                 LOCK(m_headers_presync_mutex);
    4668         [ #  # ]:          0 :                 auto it = m_headers_presync_stats.find(m_headers_presync_bestpeer);
    4669 [ #  # ][ #  # ]:          0 :                 if (it != m_headers_presync_stats.end()) stats = it->second;
    4670                 :          0 :             }
    4671         [ #  # ]:          0 :             if (stats.second) {
    4672         [ #  # ]:          0 :                 m_chainman.ReportHeadersPresync(stats.first, stats.second->first, stats.second->second);
    4673                 :          0 :             }
    4674                 :          0 :         }
    4675                 :            : 
    4676                 :          0 :         return;
    4677                 :          0 :     }
    4678                 :            : 
    4679 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::BLOCK)
    4680                 :            :     {
    4681                 :            :         // Ignore block received while importing
    4682         [ #  # ]:          0 :         if (m_chainman.m_blockman.LoadingBlocks()) {
    4683 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Unexpected block message received from peer %d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4684                 :          0 :             return;
    4685                 :            :         }
    4686                 :            : 
    4687         [ #  # ]:          0 :         std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
    4688         [ #  # ]:          0 :         vRecv >> *pblock;
    4689                 :            : 
    4690 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "received block %s peer=%d\n", pblock->GetHash().ToString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    4691                 :            : 
    4692                 :          0 :         bool forceProcessing = false;
    4693         [ #  # ]:          0 :         const uint256 hash(pblock->GetHash());
    4694                 :          0 :         bool min_pow_checked = false;
    4695                 :            :         {
    4696         [ #  # ]:          0 :             LOCK(cs_main);
    4697                 :            :             // Always process the block if we requested it, since we may
    4698                 :            :             // need it even when it's not a candidate for a new best tip.
    4699         [ #  # ]:          0 :             forceProcessing = IsBlockRequested(hash);
    4700         [ #  # ]:          0 :             RemoveBlockRequest(hash, pfrom.GetId());
    4701                 :            :             // mapBlockSource is only used for punishing peers and setting
    4702                 :            :             // which peers send us compact blocks, so the race between here and
    4703                 :            :             // cs_main in ProcessNewBlock is fine.
    4704 [ #  # ][ #  # ]:          0 :             mapBlockSource.emplace(hash, std::make_pair(pfrom.GetId(), true));
    4705                 :            : 
    4706                 :            :             // Check work on this block against our anti-dos thresholds.
    4707         [ #  # ]:          0 :             const CBlockIndex* prev_block = m_chainman.m_blockman.LookupBlockIndex(pblock->hashPrevBlock);
    4708 [ #  # ][ #  # ]:          0 :             if (prev_block && prev_block->nChainWork + CalculateHeadersWork({pblock->GetBlockHeader()}) >= GetAntiDoSWorkThreshold()) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4709                 :          0 :                 min_pow_checked = true;
    4710                 :          0 :             }
    4711                 :          0 :         }
    4712         [ #  # ]:          0 :         ProcessBlock(pfrom, pblock, forceProcessing, min_pow_checked);
    4713                 :            :         return;
    4714                 :          0 :     }
    4715                 :            : 
    4716 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETADDR) {
    4717                 :            :         // This asymmetric behavior for inbound and outbound connections was introduced
    4718                 :            :         // to prevent a fingerprinting attack: an attacker can send specific fake addresses
    4719                 :            :         // to users' AddrMan and later request them by sending getaddr messages.
    4720                 :            :         // Making nodes which are behind NAT and can only make outgoing connections ignore
    4721                 :            :         // the getaddr message mitigates the attack.
    4722 [ #  # ][ #  # ]:          0 :         if (!pfrom.IsInboundConn()) {
    4723 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Ignoring \"getaddr\" from %s connection. peer=%d\n", pfrom.ConnectionTypeAsString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4724                 :          0 :             return;
    4725                 :            :         }
    4726                 :            : 
    4727                 :            :         // Since this must be an inbound connection, SetupAddressRelay will
    4728                 :            :         // never fail.
    4729 [ #  # ][ #  # ]:          0 :         Assume(SetupAddressRelay(pfrom, *peer));
    4730                 :            : 
    4731                 :            :         // Only send one GetAddr response per connection to reduce resource waste
    4732                 :            :         // and discourage addr stamping of INV announcements.
    4733         [ #  # ]:          0 :         if (peer->m_getaddr_recvd) {
    4734 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "Ignoring repeated \"getaddr\". peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4735                 :          0 :             return;
    4736                 :            :         }
    4737                 :          0 :         peer->m_getaddr_recvd = true;
    4738                 :            : 
    4739                 :          0 :         peer->m_addrs_to_send.clear();
    4740                 :          0 :         std::vector<CAddress> vAddr;
    4741 [ #  # ][ #  # ]:          0 :         if (pfrom.HasPermission(NetPermissionFlags::Addr)) {
    4742         [ #  # ]:          0 :             vAddr = m_connman.GetAddresses(MAX_ADDR_TO_SEND, MAX_PCT_ADDR_TO_SEND, /*network=*/std::nullopt);
    4743                 :          0 :         } else {
    4744         [ #  # ]:          0 :             vAddr = m_connman.GetAddresses(pfrom, MAX_ADDR_TO_SEND, MAX_PCT_ADDR_TO_SEND);
    4745                 :            :         }
    4746         [ #  # ]:          0 :         for (const CAddress &addr : vAddr) {
    4747         [ #  # ]:          0 :             PushAddress(*peer, addr);
    4748                 :            :         }
    4749                 :            :         return;
    4750                 :          0 :     }
    4751                 :            : 
    4752 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::MEMPOOL) {
    4753                 :            :         // Only process received mempool messages if we advertise NODE_BLOOM
    4754                 :            :         // or if the peer has mempool permissions.
    4755 [ #  # ][ #  # ]:          0 :         if (!(peer->m_our_services & NODE_BLOOM) && !pfrom.HasPermission(NetPermissionFlags::Mempool))
                 [ #  # ]
    4756                 :            :         {
    4757 [ #  # ][ #  # ]:          0 :             if (!pfrom.HasPermission(NetPermissionFlags::NoBan))
    4758                 :            :             {
    4759 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "mempool request with bloom filters disabled, disconnect peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4760                 :          0 :                 pfrom.fDisconnect = true;
    4761                 :          0 :             }
    4762                 :          0 :             return;
    4763                 :            :         }
    4764                 :            : 
    4765 [ #  # ][ #  # ]:          0 :         if (m_connman.OutboundTargetReached(false) && !pfrom.HasPermission(NetPermissionFlags::Mempool))
         [ #  # ][ #  # ]
    4766                 :            :         {
    4767 [ #  # ][ #  # ]:          0 :             if (!pfrom.HasPermission(NetPermissionFlags::NoBan))
    4768                 :            :             {
    4769 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "mempool request with bandwidth limit reached, disconnect peer=%d\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4770                 :          0 :                 pfrom.fDisconnect = true;
    4771                 :          0 :             }
    4772                 :          0 :             return;
    4773                 :            :         }
    4774                 :            : 
    4775 [ #  # ][ #  # ]:          0 :         if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
    4776         [ #  # ]:          0 :             LOCK(tx_relay->m_tx_inventory_mutex);
    4777                 :          0 :             tx_relay->m_send_mempool = true;
    4778                 :          0 :         }
    4779                 :          0 :         return;
    4780                 :            :     }
    4781                 :            : 
    4782 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::PING) {
    4783         [ #  # ]:          0 :         if (pfrom.GetCommonVersion() > BIP0031_VERSION) {
    4784                 :          0 :             uint64_t nonce = 0;
    4785         [ #  # ]:          0 :             vRecv >> nonce;
    4786                 :            :             // Echo the message back with the nonce. This allows for two useful features:
    4787                 :            :             //
    4788                 :            :             // 1) A remote node can quickly check if the connection is operational
    4789                 :            :             // 2) Remote nodes can measure the latency of the network thread. If this node
    4790                 :            :             //    is overloaded it won't respond to pings quickly and the remote node can
    4791                 :            :             //    avoid sending us more work, like chain download requests.
    4792                 :            :             //
    4793                 :            :             // The nonce stops the remote getting confused between different pings: without
    4794                 :            :             // it, if the remote node sends a ping once per second and this node takes 5
    4795                 :            :             // seconds to respond to each, the 5th ping the remote sends would appear to
    4796                 :            :             // return very quickly.
    4797 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pfrom, msgMaker.Make(NetMsgType::PONG, nonce));
                 [ #  # ]
    4798                 :          0 :         }
    4799                 :          0 :         return;
    4800                 :            :     }
    4801                 :            : 
    4802 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::PONG) {
    4803                 :          0 :         const auto ping_end = time_received;
    4804                 :          0 :         uint64_t nonce = 0;
    4805         [ #  # ]:          0 :         size_t nAvail = vRecv.in_avail();
    4806                 :          0 :         bool bPingFinished = false;
    4807                 :          0 :         std::string sProblem;
    4808                 :            : 
    4809         [ #  # ]:          0 :         if (nAvail >= sizeof(nonce)) {
    4810         [ #  # ]:          0 :             vRecv >> nonce;
    4811                 :            : 
    4812                 :            :             // Only process pong message if there is an outstanding ping (old ping without nonce should never pong)
    4813         [ #  # ]:          0 :             if (peer->m_ping_nonce_sent != 0) {
    4814         [ #  # ]:          0 :                 if (nonce == peer->m_ping_nonce_sent) {
    4815                 :            :                     // Matching pong received, this ping is no longer outstanding
    4816                 :          0 :                     bPingFinished = true;
    4817         [ #  # ]:          0 :                     const auto ping_time = ping_end - peer->m_ping_start.load();
    4818         [ #  # ]:          0 :                     if (ping_time.count() >= 0) {
    4819                 :            :                         // Let connman know about this successful ping-pong
    4820         [ #  # ]:          0 :                         pfrom.PongReceived(ping_time);
    4821                 :          0 :                     } else {
    4822                 :            :                         // This should never happen
    4823         [ #  # ]:          0 :                         sProblem = "Timing mishap";
    4824                 :            :                     }
    4825                 :          0 :                 } else {
    4826                 :            :                     // Nonce mismatches are normal when pings are overlapping
    4827         [ #  # ]:          0 :                     sProblem = "Nonce mismatch";
    4828         [ #  # ]:          0 :                     if (nonce == 0) {
    4829                 :            :                         // This is most likely a bug in another implementation somewhere; cancel this ping
    4830                 :          0 :                         bPingFinished = true;
    4831         [ #  # ]:          0 :                         sProblem = "Nonce zero";
    4832                 :          0 :                     }
    4833                 :            :                 }
    4834                 :          0 :             } else {
    4835         [ #  # ]:          0 :                 sProblem = "Unsolicited pong without ping";
    4836                 :            :             }
    4837                 :          0 :         } else {
    4838                 :            :             // This is most likely a bug in another implementation somewhere; cancel this ping
    4839                 :          0 :             bPingFinished = true;
    4840         [ #  # ]:          0 :             sProblem = "Short payload";
    4841                 :            :         }
    4842                 :            : 
    4843         [ #  # ]:          0 :         if (!(sProblem.empty())) {
    4844 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "pong peer=%d: %s, %x expected, %x received, %u bytes\n",
         [ #  # ][ #  # ]
                 [ #  # ]
    4845                 :            :                 pfrom.GetId(),
    4846                 :            :                 sProblem,
    4847                 :            :                 peer->m_ping_nonce_sent,
    4848                 :            :                 nonce,
    4849                 :            :                 nAvail);
    4850                 :          0 :         }
    4851         [ #  # ]:          0 :         if (bPingFinished) {
    4852                 :          0 :             peer->m_ping_nonce_sent = 0;
    4853                 :          0 :         }
    4854                 :            :         return;
    4855                 :          0 :     }
    4856                 :            : 
    4857 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::FILTERLOAD) {
    4858         [ #  # ]:          0 :         if (!(peer->m_our_services & NODE_BLOOM)) {
    4859 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "filterload received despite not offering bloom services from peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4860                 :          0 :             pfrom.fDisconnect = true;
    4861                 :          0 :             return;
    4862                 :            :         }
    4863         [ #  # ]:          0 :         CBloomFilter filter;
    4864         [ #  # ]:          0 :         vRecv >> filter;
    4865                 :            : 
    4866 [ #  # ][ #  # ]:          0 :         if (!filter.IsWithinSizeConstraints())
    4867                 :            :         {
    4868                 :            :             // There is no excuse for sending a too-large filter
    4869 [ #  # ][ #  # ]:          0 :             Misbehaving(*peer, 100, "too-large bloom filter");
    4870 [ #  # ][ #  # ]:          0 :         } else if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
    4871                 :            :             {
    4872         [ #  # ]:          0 :                 LOCK(tx_relay->m_bloom_filter_mutex);
    4873 [ #  # ][ #  # ]:          0 :                 tx_relay->m_bloom_filter.reset(new CBloomFilter(filter));
    4874                 :          0 :                 tx_relay->m_relay_txs = true;
    4875                 :          0 :             }
    4876                 :          0 :             pfrom.m_bloom_filter_loaded = true;
    4877                 :          0 :             pfrom.m_relays_txs = true;
    4878                 :          0 :         }
    4879                 :            :         return;
    4880                 :          0 :     }
    4881                 :            : 
    4882 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::FILTERADD) {
    4883         [ #  # ]:          0 :         if (!(peer->m_our_services & NODE_BLOOM)) {
    4884 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "filteradd received despite not offering bloom services from peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4885                 :          0 :             pfrom.fDisconnect = true;
    4886                 :          0 :             return;
    4887                 :            :         }
    4888                 :          0 :         std::vector<unsigned char> vData;
    4889         [ #  # ]:          0 :         vRecv >> vData;
    4890                 :            : 
    4891                 :            :         // Nodes must NEVER send a data item > 520 bytes (the max size for a script data object,
    4892                 :            :         // and thus, the maximum size any matched object can have) in a filteradd message
    4893                 :          0 :         bool bad = false;
    4894         [ #  # ]:          0 :         if (vData.size() > MAX_SCRIPT_ELEMENT_SIZE) {
    4895                 :          0 :             bad = true;
    4896 [ #  # ][ #  # ]:          0 :         } else if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
    4897         [ #  # ]:          0 :             LOCK(tx_relay->m_bloom_filter_mutex);
    4898         [ #  # ]:          0 :             if (tx_relay->m_bloom_filter) {
    4899 [ #  # ][ #  # ]:          0 :                 tx_relay->m_bloom_filter->insert(vData);
    4900                 :          0 :             } else {
    4901                 :          0 :                 bad = true;
    4902                 :            :             }
    4903                 :          0 :         }
    4904         [ #  # ]:          0 :         if (bad) {
    4905 [ #  # ][ #  # ]:          0 :             Misbehaving(*peer, 100, "bad filteradd message");
    4906                 :          0 :         }
    4907                 :            :         return;
    4908                 :          0 :     }
    4909                 :            : 
    4910 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::FILTERCLEAR) {
    4911         [ #  # ]:          0 :         if (!(peer->m_our_services & NODE_BLOOM)) {
    4912 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "filterclear received despite not offering bloom services from peer=%d; disconnecting\n", pfrom.GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    4913                 :          0 :             pfrom.fDisconnect = true;
    4914                 :          0 :             return;
    4915                 :            :         }
    4916         [ #  # ]:          0 :         auto tx_relay = peer->GetTxRelay();
    4917         [ #  # ]:          0 :         if (!tx_relay) return;
    4918                 :            : 
    4919                 :            :         {
    4920         [ #  # ]:          0 :             LOCK(tx_relay->m_bloom_filter_mutex);
    4921                 :          0 :             tx_relay->m_bloom_filter = nullptr;
    4922                 :          0 :             tx_relay->m_relay_txs = true;
    4923                 :          0 :         }
    4924                 :          0 :         pfrom.m_bloom_filter_loaded = false;
    4925                 :          0 :         pfrom.m_relays_txs = true;
    4926                 :          0 :         return;
    4927                 :            :     }
    4928                 :            : 
    4929 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::FEEFILTER) {
    4930                 :          0 :         CAmount newFeeFilter = 0;
    4931         [ #  # ]:          0 :         vRecv >> newFeeFilter;
    4932 [ #  # ][ #  # ]:          0 :         if (MoneyRange(newFeeFilter)) {
    4933 [ #  # ][ #  # ]:          0 :             if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
    4934                 :          0 :                 tx_relay->m_fee_filter_received = newFeeFilter;
    4935                 :          0 :             }
    4936 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "received: feefilter of %s from peer=%d\n", CFeeRate(newFeeFilter).ToString(), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    4937                 :          0 :         }
    4938                 :          0 :         return;
    4939                 :            :     }
    4940                 :            : 
    4941 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETCFILTERS) {
    4942         [ #  # ]:          0 :         ProcessGetCFilters(pfrom, *peer, vRecv);
    4943                 :          0 :         return;
    4944                 :            :     }
    4945                 :            : 
    4946 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETCFHEADERS) {
    4947         [ #  # ]:          0 :         ProcessGetCFHeaders(pfrom, *peer, vRecv);
    4948                 :          0 :         return;
    4949                 :            :     }
    4950                 :            : 
    4951 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::GETCFCHECKPT) {
    4952         [ #  # ]:          0 :         ProcessGetCFCheckPt(pfrom, *peer, vRecv);
    4953                 :          0 :         return;
    4954                 :            :     }
    4955                 :            : 
    4956 [ #  # ][ #  # ]:          0 :     if (msg_type == NetMsgType::NOTFOUND) {
    4957                 :          0 :         std::vector<CInv> vInv;
    4958         [ #  # ]:          0 :         vRecv >> vInv;
    4959         [ #  # ]:          0 :         if (vInv.size() <= MAX_PEER_TX_ANNOUNCEMENTS + MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
    4960         [ #  # ]:          0 :             LOCK(::cs_main);
    4961         [ #  # ]:          0 :             for (CInv &inv : vInv) {
    4962 [ #  # ][ #  # ]:          0 :                 if (inv.IsGenTxMsg()) {
    4963                 :            :                     // If we receive a NOTFOUND message for a tx we requested, mark the announcement for it as
    4964                 :            :                     // completed in TxRequestTracker.
    4965         [ #  # ]:          0 :                     m_txrequest.ReceivedResponse(pfrom.GetId(), inv.hash);
    4966                 :          0 :                 }
    4967                 :            :             }
    4968                 :          0 :         }
    4969                 :            :         return;
    4970                 :          0 :     }
    4971                 :            : 
    4972                 :            :     // Ignore unknown commands for extensibility
    4973 [ #  # ][ #  # ]:          0 :     LogPrint(BCLog::NET, "Unknown command \"%s\" from peer=%d\n", SanitizeString(msg_type), pfrom.GetId());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    4974                 :          0 :     return;
    4975                 :          0 : }
    4976                 :            : 
    4977                 :          0 : bool PeerManagerImpl::MaybeDiscourageAndDisconnect(CNode& pnode, Peer& peer)
    4978                 :            : {
    4979                 :            :     {
    4980                 :          0 :         LOCK(peer.m_misbehavior_mutex);
    4981                 :            : 
    4982                 :            :         // There's nothing to do if the m_should_discourage flag isn't set
    4983         [ #  # ]:          0 :         if (!peer.m_should_discourage) return false;
    4984                 :            : 
    4985                 :          0 :         peer.m_should_discourage = false;
    4986      [ #  #  # ]:          0 :     } // peer.m_misbehavior_mutex
    4987                 :            : 
    4988         [ #  # ]:          0 :     if (pnode.HasPermission(NetPermissionFlags::NoBan)) {
    4989                 :            :         // We never disconnect or discourage peers for bad behavior if they have NetPermissionFlags::NoBan permission
    4990 [ #  # ][ #  # ]:          0 :         LogPrintf("Warning: not punishing noban peer %d!\n", peer.m_id);
                 [ #  # ]
    4991                 :          0 :         return false;
    4992                 :            :     }
    4993                 :            : 
    4994         [ #  # ]:          0 :     if (pnode.IsManualConn()) {
    4995                 :            :         // We never disconnect or discourage manual peers for bad behavior
    4996 [ #  # ][ #  # ]:          0 :         LogPrintf("Warning: not punishing manually connected peer %d!\n", peer.m_id);
                 [ #  # ]
    4997                 :          0 :         return false;
    4998                 :            :     }
    4999                 :            : 
    5000         [ #  # ]:          0 :     if (pnode.addr.IsLocal()) {
    5001                 :            :         // We disconnect local peers for bad behavior but don't discourage (since that would discourage
    5002                 :            :         // all peers on the same local address)
    5003 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "Warning: disconnecting but not discouraging %s peer %d!\n",
         [ #  # ][ #  # ]
    5004                 :            :                  pnode.m_inbound_onion ? "inbound onion" : "local", peer.m_id);
    5005                 :          0 :         pnode.fDisconnect = true;
    5006                 :          0 :         return true;
    5007                 :            :     }
    5008                 :            : 
    5009                 :            :     // Normal case: Disconnect the peer and discourage all nodes sharing the address
    5010 [ #  # ][ #  # ]:          0 :     LogPrint(BCLog::NET, "Disconnecting and discouraging peer %d!\n", peer.m_id);
         [ #  # ][ #  # ]
    5011         [ #  # ]:          0 :     if (m_banman) m_banman->Discourage(pnode.addr);
    5012                 :          0 :     m_connman.DisconnectNode(pnode.addr);
    5013                 :          0 :     return true;
    5014                 :          0 : }
    5015                 :            : 
    5016                 :          0 : bool PeerManagerImpl::ProcessMessages(CNode* pfrom, std::atomic<bool>& interruptMsgProc)
    5017                 :            : {
    5018                 :          0 :     AssertLockHeld(g_msgproc_mutex);
    5019                 :            : 
    5020                 :          0 :     PeerRef peer = GetPeerRef(pfrom->GetId());
    5021         [ #  # ]:          0 :     if (peer == nullptr) return false;
    5022                 :            : 
    5023                 :            :     {
    5024         [ #  # ]:          0 :         LOCK(peer->m_getdata_requests_mutex);
    5025         [ #  # ]:          0 :         if (!peer->m_getdata_requests.empty()) {
    5026         [ #  # ]:          0 :             ProcessGetData(*pfrom, *peer, interruptMsgProc);
    5027                 :          0 :         }
    5028                 :          0 :     }
    5029                 :            : 
    5030         [ #  # ]:          0 :     const bool processed_orphan = ProcessOrphanTx(*peer);
    5031                 :            : 
    5032         [ #  # ]:          0 :     if (pfrom->fDisconnect)
    5033                 :          0 :         return false;
    5034                 :            : 
    5035         [ #  # ]:          0 :     if (processed_orphan) return true;
    5036                 :            : 
    5037                 :            :     // this maintains the order of responses
    5038                 :            :     // and prevents m_getdata_requests to grow unbounded
    5039                 :            :     {
    5040         [ #  # ]:          0 :         LOCK(peer->m_getdata_requests_mutex);
    5041         [ #  # ]:          0 :         if (!peer->m_getdata_requests.empty()) return true;
    5042         [ #  # ]:          0 :     }
    5043                 :            : 
    5044                 :            :     // Don't bother if send buffer is too full to respond anyway
    5045         [ #  # ]:          0 :     if (pfrom->fPauseSend) return false;
    5046                 :            : 
    5047         [ #  # ]:          0 :     auto poll_result{pfrom->PollMessage()};
    5048         [ #  # ]:          0 :     if (!poll_result) {
    5049                 :            :         // No message to process
    5050                 :          0 :         return false;
    5051                 :            :     }
    5052                 :            : 
    5053                 :          0 :     CNetMessage& msg{poll_result->first};
    5054                 :          0 :     bool fMoreWork = poll_result->second;
    5055                 :            : 
    5056                 :            :     TRACE6(net, inbound_message,
    5057                 :            :         pfrom->GetId(),
    5058                 :            :         pfrom->m_addr_name.c_str(),
    5059                 :            :         pfrom->ConnectionTypeAsString().c_str(),
    5060                 :            :         msg.m_type.c_str(),
    5061                 :            :         msg.m_recv.size(),
    5062                 :            :         msg.m_recv.data()
    5063                 :            :     );
    5064                 :            : 
    5065         [ #  # ]:          0 :     if (m_opts.capture_messages) {
    5066 [ #  # ][ #  # ]:          0 :         CaptureMessage(pfrom->addr, msg.m_type, MakeUCharSpan(msg.m_recv), /*is_incoming=*/true);
    5067                 :          0 :     }
    5068                 :            : 
    5069         [ #  # ]:          0 :     msg.SetVersion(pfrom->GetCommonVersion());
    5070                 :            : 
    5071                 :            :     try {
    5072         [ #  # ]:          0 :         ProcessMessage(*pfrom, msg.m_type, msg.m_recv, msg.m_time, interruptMsgProc);
    5073         [ #  # ]:          0 :         if (interruptMsgProc) return false;
    5074                 :            :         {
    5075         [ #  # ]:          0 :             LOCK(peer->m_getdata_requests_mutex);
    5076         [ #  # ]:          0 :             if (!peer->m_getdata_requests.empty()) fMoreWork = true;
    5077                 :          0 :         }
    5078                 :            :         // Does this peer has an orphan ready to reconsider?
    5079                 :            :         // (Note: we may have provided a parent for an orphan provided
    5080                 :            :         //  by another peer that was already processed; in that case,
    5081                 :            :         //  the extra work may not be noticed, possibly resulting in an
    5082                 :            :         //  unnecessary 100ms delay)
    5083 [ #  # ][ #  # ]:          0 :         if (m_orphanage.HaveTxToReconsider(peer->m_id)) fMoreWork = true;
    5084         [ #  # ]:          0 :     } catch (const std::exception& e) {
    5085 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "%s(%s, %u bytes): Exception '%s' (%s) caught\n", __func__, SanitizeString(msg.m_type), msg.m_message_size, e.what(), typeid(e).name());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5086 [ #  # ][ #  # ]:          0 :     } catch (...) {
    5087 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "%s(%s, %u bytes): Unknown exception caught\n", __func__, SanitizeString(msg.m_type), msg.m_message_size);
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5088 [ #  # ][ #  # ]:          0 :     }
    5089                 :            : 
    5090                 :          0 :     return fMoreWork;
    5091                 :          0 : }
    5092                 :            : 
    5093                 :          0 : void PeerManagerImpl::ConsiderEviction(CNode& pto, Peer& peer, std::chrono::seconds time_in_seconds)
    5094                 :            : {
    5095                 :          0 :     AssertLockHeld(cs_main);
    5096                 :            : 
    5097                 :          0 :     CNodeState &state = *State(pto.GetId());
    5098                 :            : 
    5099 [ #  # ][ #  # ]:          0 :     if (!state.m_chain_sync.m_protect && pto.IsOutboundOrBlockRelayConn() && state.fSyncStarted) {
                 [ #  # ]
    5100                 :            :         // This is an outbound peer subject to disconnection if they don't
    5101                 :            :         // announce a block with as much work as the current tip within
    5102                 :            :         // CHAIN_SYNC_TIMEOUT + HEADERS_RESPONSE_TIME seconds (note: if
    5103                 :            :         // their chain has more work than ours, we should sync to it,
    5104                 :            :         // unless it's invalid, in which case we should find that out and
    5105                 :            :         // disconnect from them elsewhere).
    5106 [ #  # ][ #  # ]:          0 :         if (state.pindexBestKnownBlock != nullptr && state.pindexBestKnownBlock->nChainWork >= m_chainman.ActiveChain().Tip()->nChainWork) {
    5107         [ #  # ]:          0 :             if (state.m_chain_sync.m_timeout != 0s) {
    5108                 :          0 :                 state.m_chain_sync.m_timeout = 0s;
    5109                 :          0 :                 state.m_chain_sync.m_work_header = nullptr;
    5110                 :          0 :                 state.m_chain_sync.m_sent_getheaders = false;
    5111                 :          0 :             }
    5112 [ #  # ][ #  # ]:          0 :         } else if (state.m_chain_sync.m_timeout == 0s || (state.m_chain_sync.m_work_header != nullptr && state.pindexBestKnownBlock != nullptr && state.pindexBestKnownBlock->nChainWork >= state.m_chain_sync.m_work_header->nChainWork)) {
         [ #  # ][ #  # ]
    5113                 :            :             // Our best block known by this peer is behind our tip, and we're either noticing
    5114                 :            :             // that for the first time, OR this peer was able to catch up to some earlier point
    5115                 :            :             // where we checked against our tip.
    5116                 :            :             // Either way, set a new timeout based on current tip.
    5117                 :          0 :             state.m_chain_sync.m_timeout = time_in_seconds + CHAIN_SYNC_TIMEOUT;
    5118                 :          0 :             state.m_chain_sync.m_work_header = m_chainman.ActiveChain().Tip();
    5119                 :          0 :             state.m_chain_sync.m_sent_getheaders = false;
    5120 [ #  # ][ #  # ]:          0 :         } else if (state.m_chain_sync.m_timeout > 0s && time_in_seconds > state.m_chain_sync.m_timeout) {
    5121                 :            :             // No evidence yet that our peer has synced to a chain with work equal to that
    5122                 :            :             // of our tip, when we first detected it was behind. Send a single getheaders
    5123                 :            :             // message to give the peer a chance to update us.
    5124         [ #  # ]:          0 :             if (state.m_chain_sync.m_sent_getheaders) {
    5125                 :            :                 // They've run out of time to catch up!
    5126 [ #  # ][ #  # ]:          0 :                 LogPrintf("Disconnecting outbound peer %d for old chain, best known block = %s\n", pto.GetId(), state.pindexBestKnownBlock != nullptr ? state.pindexBestKnownBlock->GetBlockHash().ToString() : "<none>");
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5127                 :          0 :                 pto.fDisconnect = true;
    5128                 :          0 :             } else {
    5129         [ #  # ]:          0 :                 assert(state.m_chain_sync.m_work_header);
    5130                 :            :                 // Here, we assume that the getheaders message goes out,
    5131                 :            :                 // because it'll either go out or be skipped because of a
    5132                 :            :                 // getheaders in-flight already, in which case the peer should
    5133                 :            :                 // still respond to us with a sufficiently high work chain tip.
    5134 [ #  # ][ #  # ]:          0 :                 MaybeSendGetHeaders(pto,
    5135                 :          0 :                         GetLocator(state.m_chain_sync.m_work_header->pprev),
    5136                 :          0 :                         peer);
    5137 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "sending getheaders to outbound peer=%d to verify chain work (current best known block:%s, benchmark blockhash: %s)\n", pto.GetId(), state.pindexBestKnownBlock != nullptr ? state.pindexBestKnownBlock->GetBlockHash().ToString() : "<none>", state.m_chain_sync.m_work_header->GetBlockHash().ToString());
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5138                 :          0 :                 state.m_chain_sync.m_sent_getheaders = true;
    5139                 :            :                 // Bump the timeout to allow a response, which could clear the timeout
    5140                 :            :                 // (if the response shows the peer has synced), reset the timeout (if
    5141                 :            :                 // the peer syncs to the required work but not to our tip), or result
    5142                 :            :                 // in disconnect (if we advance to the timeout and pindexBestKnownBlock
    5143                 :            :                 // has not sufficiently progressed)
    5144                 :          0 :                 state.m_chain_sync.m_timeout = time_in_seconds + HEADERS_RESPONSE_TIME;
    5145                 :            :             }
    5146                 :          0 :         }
    5147                 :          0 :     }
    5148                 :          0 : }
    5149                 :            : 
    5150                 :          0 : void PeerManagerImpl::EvictExtraOutboundPeers(std::chrono::seconds now)
    5151                 :            : {
    5152                 :            :     // If we have any extra block-relay-only peers, disconnect the youngest unless
    5153                 :            :     // it's given us a block -- in which case, compare with the second-youngest, and
    5154                 :            :     // out of those two, disconnect the peer who least recently gave us a block.
    5155                 :            :     // The youngest block-relay-only peer would be the extra peer we connected
    5156                 :            :     // to temporarily in order to sync our tip; see net.cpp.
    5157                 :            :     // Note that we use higher nodeid as a measure for most recent connection.
    5158         [ #  # ]:          0 :     if (m_connman.GetExtraBlockRelayCount() > 0) {
    5159                 :          0 :         std::pair<NodeId, std::chrono::seconds> youngest_peer{-1, 0}, next_youngest_peer{-1, 0};
    5160                 :            : 
    5161         [ #  # ]:          0 :         m_connman.ForEachNode([&](CNode* pnode) {
    5162 [ #  # ][ #  # ]:          0 :             if (!pnode->IsBlockOnlyConn() || pnode->fDisconnect) return;
    5163         [ #  # ]:          0 :             if (pnode->GetId() > youngest_peer.first) {
    5164                 :          0 :                 next_youngest_peer = youngest_peer;
    5165                 :          0 :                 youngest_peer.first = pnode->GetId();
    5166                 :          0 :                 youngest_peer.second = pnode->m_last_block_time;
    5167                 :          0 :             }
    5168                 :          0 :         });
    5169                 :          0 :         NodeId to_disconnect = youngest_peer.first;
    5170         [ #  # ]:          0 :         if (youngest_peer.second > next_youngest_peer.second) {
    5171                 :            :             // Our newest block-relay-only peer gave us a block more recently;
    5172                 :            :             // disconnect our second youngest.
    5173                 :          0 :             to_disconnect = next_youngest_peer.first;
    5174                 :          0 :         }
    5175         [ #  # ]:          0 :         m_connman.ForNode(to_disconnect, [&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
    5176                 :          0 :             AssertLockHeld(::cs_main);
    5177                 :            :             // Make sure we're not getting a block right now, and that
    5178                 :            :             // we've been connected long enough for this eviction to happen
    5179                 :            :             // at all.
    5180                 :            :             // Note that we only request blocks from a peer if we learn of a
    5181                 :            :             // valid headers chain with at least as much work as our tip.
    5182                 :          0 :             CNodeState *node_state = State(pnode->GetId());
    5183 [ #  # ][ #  # ]:          0 :             if (node_state == nullptr ||
    5184         [ #  # ]:          0 :                 (now - pnode->m_connected >= MINIMUM_CONNECT_TIME && node_state->vBlocksInFlight.empty())) {
    5185                 :          0 :                 pnode->fDisconnect = true;
    5186 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "disconnecting extra block-relay-only peer=%d (last block received at time %d)\n",
         [ #  # ][ #  # ]
    5187                 :            :                          pnode->GetId(), count_seconds(pnode->m_last_block_time));
    5188                 :          0 :                 return true;
    5189                 :            :             } else {
    5190 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "keeping block-relay-only peer=%d chosen for eviction (connect time: %d, blocks_in_flight: %d)\n",
         [ #  # ][ #  # ]
    5191                 :            :                          pnode->GetId(), count_seconds(pnode->m_connected), node_state->vBlocksInFlight.size());
    5192                 :            :             }
    5193                 :          0 :             return false;
    5194                 :          0 :         });
    5195                 :          0 :     }
    5196                 :            : 
    5197                 :            :     // Check whether we have too many outbound-full-relay peers
    5198         [ #  # ]:          0 :     if (m_connman.GetExtraFullOutboundCount() > 0) {
    5199                 :            :         // If we have more outbound-full-relay peers than we target, disconnect one.
    5200                 :            :         // Pick the outbound-full-relay peer that least recently announced
    5201                 :            :         // us a new block, with ties broken by choosing the more recent
    5202                 :            :         // connection (higher node id)
    5203                 :            :         // Protect peers from eviction if we don't have another connection
    5204                 :            :         // to their network, counting both outbound-full-relay and manual peers.
    5205                 :          0 :         NodeId worst_peer = -1;
    5206                 :          0 :         int64_t oldest_block_announcement = std::numeric_limits<int64_t>::max();
    5207                 :            : 
    5208         [ #  # ]:          0 :         m_connman.ForEachNode([&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main, m_connman.GetNodesMutex()) {
    5209                 :          0 :             AssertLockHeld(::cs_main);
    5210                 :            : 
    5211                 :            :             // Only consider outbound-full-relay peers that are not already
    5212                 :            :             // marked for disconnection
    5213 [ #  # ][ #  # ]:          0 :             if (!pnode->IsFullOutboundConn() || pnode->fDisconnect) return;
    5214                 :          0 :             CNodeState *state = State(pnode->GetId());
    5215         [ #  # ]:          0 :             if (state == nullptr) return; // shouldn't be possible, but just in case
    5216                 :            :             // Don't evict our protected peers
    5217         [ #  # ]:          0 :             if (state->m_chain_sync.m_protect) return;
    5218                 :            :             // If this is the only connection on a particular network that is
    5219                 :            :             // OUTBOUND_FULL_RELAY or MANUAL, protect it.
    5220         [ #  # ]:          0 :             if (!m_connman.MultipleManualOrFullOutboundConns(pnode->addr.GetNetwork())) return;
    5221 [ #  # ][ #  # ]:          0 :             if (state->m_last_block_announcement < oldest_block_announcement || (state->m_last_block_announcement == oldest_block_announcement && pnode->GetId() > worst_peer)) {
                 [ #  # ]
    5222                 :          0 :                 worst_peer = pnode->GetId();
    5223                 :          0 :                 oldest_block_announcement = state->m_last_block_announcement;
    5224                 :          0 :             }
    5225                 :          0 :         });
    5226         [ #  # ]:          0 :         if (worst_peer != -1) {
    5227         [ #  # ]:          0 :             bool disconnected = m_connman.ForNode(worst_peer, [&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
    5228                 :          0 :                 AssertLockHeld(::cs_main);
    5229                 :            : 
    5230                 :            :                 // Only disconnect a peer that has been connected to us for
    5231                 :            :                 // some reasonable fraction of our check-frequency, to give
    5232                 :            :                 // it time for new information to have arrived.
    5233                 :            :                 // Also don't disconnect any peer we're trying to download a
    5234                 :            :                 // block from.
    5235                 :          0 :                 CNodeState &state = *State(pnode->GetId());
    5236 [ #  # ][ #  # ]:          0 :                 if (now - pnode->m_connected > MINIMUM_CONNECT_TIME && state.vBlocksInFlight.empty()) {
    5237 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "disconnecting extra outbound peer=%d (last block announcement received at time %d)\n", pnode->GetId(), oldest_block_announcement);
         [ #  # ][ #  # ]
    5238                 :          0 :                     pnode->fDisconnect = true;
    5239                 :          0 :                     return true;
    5240                 :            :                 } else {
    5241 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "keeping outbound peer=%d chosen for eviction (connect time: %d, blocks_in_flight: %d)\n",
         [ #  # ][ #  # ]
    5242                 :            :                              pnode->GetId(), count_seconds(pnode->m_connected), state.vBlocksInFlight.size());
    5243                 :          0 :                     return false;
    5244                 :            :                 }
    5245                 :          0 :             });
    5246         [ #  # ]:          0 :             if (disconnected) {
    5247                 :            :                 // If we disconnected an extra peer, that means we successfully
    5248                 :            :                 // connected to at least one peer after the last time we
    5249                 :            :                 // detected a stale tip. Don't try any more extra peers until
    5250                 :            :                 // we next detect a stale tip, to limit the load we put on the
    5251                 :            :                 // network from these extra connections.
    5252                 :          0 :                 m_connman.SetTryNewOutboundPeer(false);
    5253                 :          0 :             }
    5254                 :          0 :         }
    5255                 :          0 :     }
    5256                 :          0 : }
    5257                 :            : 
    5258                 :          0 : void PeerManagerImpl::CheckForStaleTipAndEvictPeers()
    5259                 :            : {
    5260                 :          0 :     LOCK(cs_main);
    5261                 :            : 
    5262         [ #  # ]:          0 :     auto now{GetTime<std::chrono::seconds>()};
    5263                 :            : 
    5264         [ #  # ]:          0 :     EvictExtraOutboundPeers(now);
    5265                 :            : 
    5266 [ #  # ][ #  # ]:          0 :     if (now > m_stale_tip_check_time) {
    5267                 :            :         // Check whether our tip is stale, and if so, allow using an extra
    5268                 :            :         // outbound peer
    5269 [ #  # ][ #  # ]:          0 :         if (!m_chainman.m_blockman.LoadingBlocks() && m_connman.GetNetworkActive() && m_connman.GetUseAddrmanOutgoing() && TipMayBeStale()) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    5270 [ #  # ][ #  # ]:          0 :             LogPrintf("Potential stale tip detected, will try using extra outbound peer (last tip update: %d seconds ago)\n",
         [ #  # ][ #  # ]
    5271                 :            :                       count_seconds(now - m_last_tip_update.load()));
    5272         [ #  # ]:          0 :             m_connman.SetTryNewOutboundPeer(true);
    5273 [ #  # ][ #  # ]:          0 :         } else if (m_connman.GetTryNewOutboundPeer()) {
    5274         [ #  # ]:          0 :             m_connman.SetTryNewOutboundPeer(false);
    5275                 :          0 :         }
    5276         [ #  # ]:          0 :         m_stale_tip_check_time = now + STALE_CHECK_INTERVAL;
    5277                 :          0 :     }
    5278                 :            : 
    5279 [ #  # ][ #  # ]:          0 :     if (!m_initial_sync_finished && CanDirectFetch()) {
                 [ #  # ]
    5280         [ #  # ]:          0 :         m_connman.StartExtraBlockRelayPeers();
    5281                 :          0 :         m_initial_sync_finished = true;
    5282                 :          0 :     }
    5283                 :          0 : }
    5284                 :            : 
    5285                 :          0 : void PeerManagerImpl::MaybeSendPing(CNode& node_to, Peer& peer, std::chrono::microseconds now)
    5286                 :            : {
    5287 [ #  # ][ #  # ]:          0 :     if (m_connman.ShouldRunInactivityChecks(node_to, std::chrono::duration_cast<std::chrono::seconds>(now)) &&
    5288         [ #  # ]:          0 :         peer.m_ping_nonce_sent &&
    5289                 :          0 :         now > peer.m_ping_start.load() + TIMEOUT_INTERVAL)
    5290                 :            :     {
    5291                 :            :         // The ping timeout is using mocktime. To disable the check during
    5292                 :            :         // testing, increase -peertimeout.
    5293 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "ping timeout: %fs peer=%d\n", 0.000001 * count_microseconds(now - peer.m_ping_start.load()), peer.m_id);
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5294                 :          0 :         node_to.fDisconnect = true;
    5295                 :          0 :         return;
    5296                 :            :     }
    5297                 :            : 
    5298                 :          0 :     const CNetMsgMaker msgMaker(node_to.GetCommonVersion());
    5299                 :          0 :     bool pingSend = false;
    5300                 :            : 
    5301         [ #  # ]:          0 :     if (peer.m_ping_queued) {
    5302                 :            :         // RPC ping request by user
    5303                 :          0 :         pingSend = true;
    5304                 :          0 :     }
    5305                 :            : 
    5306 [ #  # ][ #  # ]:          0 :     if (peer.m_ping_nonce_sent == 0 && now > peer.m_ping_start.load() + PING_INTERVAL) {
    5307                 :            :         // Ping automatically sent as a latency probe & keepalive.
    5308                 :          0 :         pingSend = true;
    5309                 :          0 :     }
    5310                 :            : 
    5311         [ #  # ]:          0 :     if (pingSend) {
    5312                 :            :         uint64_t nonce;
    5313                 :          0 :         do {
    5314                 :          0 :             nonce = GetRand<uint64_t>();
    5315         [ #  # ]:          0 :         } while (nonce == 0);
    5316                 :          0 :         peer.m_ping_queued = false;
    5317                 :          0 :         peer.m_ping_start = now;
    5318         [ #  # ]:          0 :         if (node_to.GetCommonVersion() > BIP0031_VERSION) {
    5319                 :          0 :             peer.m_ping_nonce_sent = nonce;
    5320 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&node_to, msgMaker.Make(NetMsgType::PING, nonce));
                 [ #  # ]
    5321                 :          0 :         } else {
    5322                 :            :             // Peer is too old to support ping command with nonce, pong will never arrive.
    5323                 :          0 :             peer.m_ping_nonce_sent = 0;
    5324 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&node_to, msgMaker.Make(NetMsgType::PING));
                 [ #  # ]
    5325                 :            :         }
    5326                 :          0 :     }
    5327                 :          0 : }
    5328                 :            : 
    5329                 :          0 : void PeerManagerImpl::MaybeSendAddr(CNode& node, Peer& peer, std::chrono::microseconds current_time)
    5330                 :            : {
    5331                 :            :     // Nothing to do for non-address-relay peers
    5332         [ #  # ]:          0 :     if (!peer.m_addr_relay_enabled) return;
    5333                 :            : 
    5334                 :          0 :     LOCK(peer.m_addr_send_times_mutex);
    5335                 :            :     // Periodically advertise our local address to the peer.
    5336 [ #  # ][ #  # ]:          0 :     if (fListen && !m_chainman.IsInitialBlockDownload() &&
         [ #  # ][ #  # ]
    5337         [ #  # ]:          0 :         peer.m_next_local_addr_send < current_time) {
    5338                 :            :         // If we've sent before, clear the bloom filter for the peer, so that our
    5339                 :            :         // self-announcement will actually go out.
    5340                 :            :         // This might be unnecessary if the bloom filter has already rolled
    5341                 :            :         // over since our last self-announcement, but there is only a small
    5342                 :            :         // bandwidth cost that we can incur by doing this (which happens
    5343                 :            :         // once a day on average).
    5344 [ #  # ][ #  # ]:          0 :         if (peer.m_next_local_addr_send != 0us) {
                 [ #  # ]
    5345         [ #  # ]:          0 :             peer.m_addr_known->reset();
    5346                 :          0 :         }
    5347 [ #  # ][ #  # ]:          0 :         if (std::optional<CService> local_service = GetLocalAddrForPeer(node)) {
    5348 [ #  # ][ #  # ]:          0 :             CAddress local_addr{*local_service, peer.m_our_services, Now<NodeSeconds>()};
                 [ #  # ]
    5349         [ #  # ]:          0 :             PushAddress(peer, local_addr);
    5350                 :          0 :         }
    5351 [ #  # ][ #  # ]:          0 :         peer.m_next_local_addr_send = GetExponentialRand(current_time, AVG_LOCAL_ADDRESS_BROADCAST_INTERVAL);
    5352                 :          0 :     }
    5353                 :            : 
    5354                 :            :     // We sent an `addr` message to this peer recently. Nothing more to do.
    5355 [ #  # ][ #  # ]:          0 :     if (current_time <= peer.m_next_addr_send) return;
    5356                 :            : 
    5357         [ #  # ]:          0 :     peer.m_next_addr_send = GetExponentialRand(current_time, AVG_ADDRESS_BROADCAST_INTERVAL);
    5358                 :            : 
    5359 [ #  # ][ #  # ]:          0 :     if (!Assume(peer.m_addrs_to_send.size() <= MAX_ADDR_TO_SEND)) {
    5360                 :            :         // Should be impossible since we always check size before adding to
    5361                 :            :         // m_addrs_to_send. Recover by trimming the vector.
    5362         [ #  # ]:          0 :         peer.m_addrs_to_send.resize(MAX_ADDR_TO_SEND);
    5363                 :          0 :     }
    5364                 :            : 
    5365                 :            :     // Remove addr records that the peer already knows about, and add new
    5366                 :            :     // addrs to the m_addr_known filter on the same pass.
    5367                 :          0 :     auto addr_already_known = [&peer](const CAddress& addr) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex) {
    5368 [ #  # ][ #  # ]:          0 :         bool ret = peer.m_addr_known->contains(addr.GetKey());
    5369 [ #  # ][ #  # ]:          0 :         if (!ret) peer.m_addr_known->insert(addr.GetKey());
                 [ #  # ]
    5370                 :          0 :         return ret;
    5371                 :          0 :     };
    5372 [ #  # ][ #  # ]:          0 :     peer.m_addrs_to_send.erase(std::remove_if(peer.m_addrs_to_send.begin(), peer.m_addrs_to_send.end(), addr_already_known),
                 [ #  # ]
    5373                 :          0 :                            peer.m_addrs_to_send.end());
    5374                 :            : 
    5375                 :            :     // No addr messages to send
    5376         [ #  # ]:          0 :     if (peer.m_addrs_to_send.empty()) return;
    5377                 :            : 
    5378         [ #  # ]:          0 :     CNetMsgMaker mm(node.GetCommonVersion());
    5379         [ #  # ]:          0 :     if (peer.m_wants_addrv2) {
    5380 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(&node, mm.Make(NetMsgType::ADDRV2, CAddress::V2_NETWORK(peer.m_addrs_to_send)));
         [ #  # ][ #  # ]
    5381                 :          0 :     } else {
    5382 [ #  # ][ #  # ]:          0 :         m_connman.PushMessage(&node, mm.Make(NetMsgType::ADDR, CAddress::V1_NETWORK(peer.m_addrs_to_send)));
         [ #  # ][ #  # ]
    5383                 :            :     }
    5384                 :          0 :     peer.m_addrs_to_send.clear();
    5385                 :            : 
    5386                 :            :     // we only send the big addr message once
    5387         [ #  # ]:          0 :     if (peer.m_addrs_to_send.capacity() > 40) {
    5388         [ #  # ]:          0 :         peer.m_addrs_to_send.shrink_to_fit();
    5389                 :          0 :     }
    5390         [ #  # ]:          0 : }
    5391                 :            : 
    5392                 :          0 : void PeerManagerImpl::MaybeSendSendHeaders(CNode& node, Peer& peer)
    5393                 :            : {
    5394                 :            :     // Delay sending SENDHEADERS (BIP 130) until we're done with an
    5395                 :            :     // initial-headers-sync with this peer. Receiving headers announcements for
    5396                 :            :     // new blocks while trying to sync their headers chain is problematic,
    5397                 :            :     // because of the state tracking done.
    5398 [ #  # ][ #  # ]:          0 :     if (!peer.m_sent_sendheaders && node.GetCommonVersion() >= SENDHEADERS_VERSION) {
    5399                 :          0 :         LOCK(cs_main);
    5400         [ #  # ]:          0 :         CNodeState &state = *State(node.GetId());
    5401 [ #  # ][ #  # ]:          0 :         if (state.pindexBestKnownBlock != nullptr &&
    5402 [ #  # ][ #  # ]:          0 :                 state.pindexBestKnownBlock->nChainWork > m_chainman.MinimumChainWork()) {
    5403                 :            :             // Tell our peer we prefer to receive headers rather than inv's
    5404                 :            :             // We send this to non-NODE NETWORK peers as well, because even
    5405                 :            :             // non-NODE NETWORK peers can announce blocks (such as pruning
    5406                 :            :             // nodes)
    5407 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&node, CNetMsgMaker(node.GetCommonVersion()).Make(NetMsgType::SENDHEADERS));
         [ #  # ][ #  # ]
    5408                 :          0 :             peer.m_sent_sendheaders = true;
    5409                 :          0 :         }
    5410                 :          0 :     }
    5411                 :          0 : }
    5412                 :            : 
    5413                 :          0 : void PeerManagerImpl::MaybeSendFeefilter(CNode& pto, Peer& peer, std::chrono::microseconds current_time)
    5414                 :            : {
    5415         [ #  # ]:          0 :     if (m_opts.ignore_incoming_txs) return;
    5416         [ #  # ]:          0 :     if (pto.GetCommonVersion() < FEEFILTER_VERSION) return;
    5417                 :            :     // peers with the forcerelay permission should not filter txs to us
    5418         [ #  # ]:          0 :     if (pto.HasPermission(NetPermissionFlags::ForceRelay)) return;
    5419                 :            :     // Don't send feefilter messages to outbound block-relay-only peers since they should never announce
    5420                 :            :     // transactions to us, regardless of feefilter state.
    5421         [ #  # ]:          0 :     if (pto.IsBlockOnlyConn()) return;
    5422                 :            : 
    5423                 :          0 :     CAmount currentFilter = m_mempool.GetMinFee().GetFeePerK();
    5424                 :            : 
    5425         [ #  # ]:          0 :     if (m_chainman.IsInitialBlockDownload()) {
    5426                 :            :         // Received tx-inv messages are discarded when the active
    5427                 :            :         // chainstate is in IBD, so tell the peer to not send them.
    5428                 :          0 :         currentFilter = MAX_MONEY;
    5429                 :          0 :     } else {
    5430 [ #  # ][ #  # ]:          0 :         static const CAmount MAX_FILTER{m_fee_filter_rounder.round(MAX_MONEY)};
                 [ #  # ]
    5431         [ #  # ]:          0 :         if (peer.m_fee_filter_sent == MAX_FILTER) {
    5432                 :            :             // Send the current filter if we sent MAX_FILTER previously
    5433                 :            :             // and made it out of IBD.
    5434                 :          0 :             peer.m_next_send_feefilter = 0us;
    5435                 :          0 :         }
    5436                 :            :     }
    5437         [ #  # ]:          0 :     if (current_time > peer.m_next_send_feefilter) {
    5438                 :          0 :         CAmount filterToSend = m_fee_filter_rounder.round(currentFilter);
    5439                 :            :         // We always have a fee filter of at least the min relay fee
    5440                 :          0 :         filterToSend = std::max(filterToSend, m_mempool.m_min_relay_feerate.GetFeePerK());
    5441         [ #  # ]:          0 :         if (filterToSend != peer.m_fee_filter_sent) {
    5442 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(&pto, CNetMsgMaker(pto.GetCommonVersion()).Make(NetMsgType::FEEFILTER, filterToSend));
                 [ #  # ]
    5443                 :          0 :             peer.m_fee_filter_sent = filterToSend;
    5444                 :          0 :         }
    5445                 :          0 :         peer.m_next_send_feefilter = GetExponentialRand(current_time, AVG_FEEFILTER_BROADCAST_INTERVAL);
    5446                 :          0 :     }
    5447                 :            :     // If the fee filter has changed substantially and it's still more than MAX_FEEFILTER_CHANGE_DELAY
    5448                 :            :     // until scheduled broadcast, then move the broadcast to within MAX_FEEFILTER_CHANGE_DELAY.
    5449 [ #  # ][ #  # ]:          0 :     else if (current_time + MAX_FEEFILTER_CHANGE_DELAY < peer.m_next_send_feefilter &&
    5450         [ #  # ]:          0 :                 (currentFilter < 3 * peer.m_fee_filter_sent / 4 || currentFilter > 4 * peer.m_fee_filter_sent / 3)) {
    5451                 :          0 :         peer.m_next_send_feefilter = current_time + GetRandomDuration<std::chrono::microseconds>(MAX_FEEFILTER_CHANGE_DELAY);
    5452                 :          0 :     }
    5453                 :          0 : }
    5454                 :            : 
    5455                 :            : namespace {
    5456                 :            : class CompareInvMempoolOrder
    5457                 :            : {
    5458                 :            :     CTxMemPool* mp;
    5459                 :            :     bool m_wtxid_relay;
    5460                 :            : public:
    5461                 :          0 :     explicit CompareInvMempoolOrder(CTxMemPool *_mempool, bool use_wtxid)
    5462                 :            :     {
    5463                 :          0 :         mp = _mempool;
    5464                 :          0 :         m_wtxid_relay = use_wtxid;
    5465                 :          0 :     }
    5466                 :            : 
    5467                 :          0 :     bool operator()(std::set<uint256>::iterator a, std::set<uint256>::iterator b)
    5468                 :            :     {
    5469                 :            :         /* As std::make_heap produces a max-heap, we want the entries with the
    5470                 :            :          * fewest ancestors/highest fee to sort later. */
    5471                 :          0 :         return mp->CompareDepthAndScore(*b, *a, m_wtxid_relay);
    5472                 :            :     }
    5473                 :            : };
    5474                 :            : } // namespace
    5475                 :            : 
    5476                 :          0 : bool PeerManagerImpl::RejectIncomingTxs(const CNode& peer) const
    5477                 :            : {
    5478                 :            :     // block-relay-only peers may never send txs to us
    5479         [ #  # ]:          0 :     if (peer.IsBlockOnlyConn()) return true;
    5480         [ #  # ]:          0 :     if (peer.IsFeelerConn()) return true;
    5481                 :            :     // In -blocksonly mode, peers need the 'relay' permission to send txs to us
    5482 [ #  # ][ #  # ]:          0 :     if (m_opts.ignore_incoming_txs && !peer.HasPermission(NetPermissionFlags::Relay)) return true;
    5483                 :          0 :     return false;
    5484                 :          0 : }
    5485                 :            : 
    5486                 :          0 : bool PeerManagerImpl::SetupAddressRelay(const CNode& node, Peer& peer)
    5487                 :            : {
    5488                 :            :     // We don't participate in addr relay with outbound block-relay-only
    5489                 :            :     // connections to prevent providing adversaries with the additional
    5490                 :            :     // information of addr traffic to infer the link.
    5491         [ #  # ]:          0 :     if (node.IsBlockOnlyConn()) return false;
    5492                 :            : 
    5493         [ #  # ]:          0 :     if (!peer.m_addr_relay_enabled.exchange(true)) {
    5494                 :            :         // During version message processing (non-block-relay-only outbound peers)
    5495                 :            :         // or on first addr-related message we have received (inbound peers), initialize
    5496                 :            :         // m_addr_known.
    5497                 :          0 :         peer.m_addr_known = std::make_unique<CRollingBloomFilter>(5000, 0.001);
    5498                 :          0 :     }
    5499                 :            : 
    5500                 :          0 :     return true;
    5501                 :          0 : }
    5502                 :            : 
    5503                 :          0 : bool PeerManagerImpl::SendMessages(CNode* pto)
    5504                 :            : {
    5505                 :          0 :     AssertLockHeld(g_msgproc_mutex);
    5506                 :            : 
    5507                 :          0 :     PeerRef peer = GetPeerRef(pto->GetId());
    5508         [ #  # ]:          0 :     if (!peer) return false;
    5509                 :          0 :     const Consensus::Params& consensusParams = m_chainparams.GetConsensus();
    5510                 :            : 
    5511                 :            :     // We must call MaybeDiscourageAndDisconnect first, to ensure that we'll
    5512                 :            :     // disconnect misbehaving peers even before the version handshake is complete.
    5513 [ #  # ][ #  # ]:          0 :     if (MaybeDiscourageAndDisconnect(*pto, *peer)) return true;
    5514                 :            : 
    5515                 :            :     // Don't send anything until the version handshake is complete
    5516 [ #  # ][ #  # ]:          0 :     if (!pto->fSuccessfullyConnected || pto->fDisconnect)
    5517                 :          0 :         return true;
    5518                 :            : 
    5519                 :            :     // If we get here, the outgoing message serialization version is set and can't change.
    5520         [ #  # ]:          0 :     const CNetMsgMaker msgMaker(pto->GetCommonVersion());
    5521                 :            : 
    5522         [ #  # ]:          0 :     const auto current_time{GetTime<std::chrono::microseconds>()};
    5523                 :            : 
    5524 [ #  # ][ #  # ]:          0 :     if (pto->IsAddrFetchConn() && current_time - pto->m_connected > 10 * AVG_ADDRESS_BROADCAST_INTERVAL) {
         [ #  # ][ #  # ]
                 [ #  # ]
    5525 [ #  # ][ #  # ]:          0 :         LogPrint(BCLog::NET, "addrfetch connection timeout; disconnecting peer=%d\n", pto->GetId());
         [ #  # ][ #  # ]
                 [ #  # ]
    5526                 :          0 :         pto->fDisconnect = true;
    5527                 :          0 :         return true;
    5528                 :            :     }
    5529                 :            : 
    5530         [ #  # ]:          0 :     MaybeSendPing(*pto, *peer, current_time);
    5531                 :            : 
    5532                 :            :     // MaybeSendPing may have marked peer for disconnection
    5533         [ #  # ]:          0 :     if (pto->fDisconnect) return true;
    5534                 :            : 
    5535         [ #  # ]:          0 :     MaybeSendAddr(*pto, *peer, current_time);
    5536                 :            : 
    5537         [ #  # ]:          0 :     MaybeSendSendHeaders(*pto, *peer);
    5538                 :            : 
    5539                 :            :     {
    5540         [ #  # ]:          0 :         LOCK(cs_main);
    5541                 :            : 
    5542         [ #  # ]:          0 :         CNodeState &state = *State(pto->GetId());
    5543                 :            : 
    5544                 :            :         // Start block sync
    5545         [ #  # ]:          0 :         if (m_chainman.m_best_header == nullptr) {
    5546         [ #  # ]:          0 :             m_chainman.m_best_header = m_chainman.ActiveChain().Tip();
    5547                 :          0 :         }
    5548                 :            : 
    5549                 :            :         // Determine whether we might try initial headers sync or parallel
    5550                 :            :         // block download from this peer -- this mostly affects behavior while
    5551                 :            :         // in IBD (once out of IBD, we sync from all peers).
    5552                 :          0 :         bool sync_blocks_and_headers_from_peer = false;
    5553         [ #  # ]:          0 :         if (state.fPreferredDownload) {
    5554                 :          0 :             sync_blocks_and_headers_from_peer = true;
    5555 [ #  # ][ #  # ]:          0 :         } else if (CanServeBlocks(*peer) && !pto->IsAddrFetchConn()) {
    5556                 :            :             // Typically this is an inbound peer. If we don't have any outbound
    5557                 :            :             // peers, or if we aren't downloading any blocks from such peers,
    5558                 :            :             // then allow block downloads from this peer, too.
    5559                 :            :             // We prefer downloading blocks from outbound peers to avoid
    5560                 :            :             // putting undue load on (say) some home user who is just making
    5561                 :            :             // outbound connections to the network, but if our only source of
    5562                 :            :             // the latest blocks is from an inbound peer, we have to be sure to
    5563                 :            :             // eventually download it (and not just wait indefinitely for an
    5564                 :            :             // outbound peer to have it).
    5565 [ #  # ][ #  # ]:          0 :             if (m_num_preferred_download_peers == 0 || mapBlocksInFlight.empty()) {
    5566                 :          0 :                 sync_blocks_and_headers_from_peer = true;
    5567                 :          0 :             }
    5568                 :          0 :         }
    5569                 :            : 
    5570 [ #  # ][ #  # ]:          0 :         if (!state.fSyncStarted && CanServeBlocks(*peer) && !m_chainman.m_blockman.LoadingBlocks()) {
                 [ #  # ]
    5571                 :            :             // Only actively request headers from a single peer, unless we're close to today.
    5572 [ #  # ][ #  # ]:          0 :             if ((nSyncStarted == 0 && sync_blocks_and_headers_from_peer) || m_chainman.m_best_header->Time() > GetAdjustedTime() - 24h) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5573                 :          0 :                 const CBlockIndex* pindexStart = m_chainman.m_best_header;
    5574                 :            :                 /* If possible, start at the block preceding the currently
    5575                 :            :                    best known header.  This ensures that we always get a
    5576                 :            :                    non-empty list of headers back as long as the peer
    5577                 :            :                    is up-to-date.  With a non-empty response, we can initialise
    5578                 :            :                    the peer's known best block.  This wouldn't be possible
    5579                 :            :                    if we requested starting at m_chainman.m_best_header and
    5580                 :            :                    got back an empty response.  */
    5581         [ #  # ]:          0 :                 if (pindexStart->pprev)
    5582                 :          0 :                     pindexStart = pindexStart->pprev;
    5583 [ #  # ][ #  # ]:          0 :                 if (MaybeSendGetHeaders(*pto, GetLocator(pindexStart), *peer)) {
                 [ #  # ]
    5584 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "initial getheaders (%d) to peer=%d (startheight:%d)\n", pindexStart->nHeight, pto->GetId(), peer->m_starting_height);
         [ #  # ][ #  # ]
                 [ #  # ]
    5585                 :            : 
    5586                 :          0 :                     state.fSyncStarted = true;
    5587 [ #  # ][ #  # ]:          0 :                     peer->m_headers_sync_timeout = current_time + HEADERS_DOWNLOAD_TIMEOUT_BASE +
    5588                 :            :                         (
    5589                 :            :                          // Convert HEADERS_DOWNLOAD_TIMEOUT_PER_HEADER to microseconds before scaling
    5590                 :            :                          // to maintain precision
    5591 [ #  # ][ #  # ]:          0 :                          std::chrono::microseconds{HEADERS_DOWNLOAD_TIMEOUT_PER_HEADER} *
    5592 [ #  # ][ #  # ]:          0 :                          Ticks<std::chrono::seconds>(GetAdjustedTime() - m_chainman.m_best_header->Time()) / consensusParams.nPowTargetSpacing
         [ #  # ][ #  # ]
                 [ #  # ]
    5593                 :            :                         );
    5594                 :          0 :                     nSyncStarted++;
    5595                 :          0 :                 }
    5596                 :          0 :             }
    5597                 :          0 :         }
    5598                 :            : 
    5599                 :            :         //
    5600                 :            :         // Try sending block announcements via headers
    5601                 :            :         //
    5602                 :            :         {
    5603                 :            :             // If we have no more than MAX_BLOCKS_TO_ANNOUNCE in our
    5604                 :            :             // list of block hashes we're relaying, and our peer wants
    5605                 :            :             // headers announcements, then find the first header
    5606                 :            :             // not yet known to our peer but would connect, and send.
    5607                 :            :             // If no header would connect, or if we have too many
    5608                 :            :             // blocks, or if the peer doesn't want headers, just
    5609                 :            :             // add all to the inv queue.
    5610         [ #  # ]:          0 :             LOCK(peer->m_block_inv_mutex);
    5611                 :          0 :             std::vector<CBlock> vHeaders;
    5612         [ #  # ]:          0 :             bool fRevertToInv = ((!peer->m_prefers_headers &&
    5613 [ #  # ][ #  # ]:          0 :                                  (!state.m_requested_hb_cmpctblocks || peer->m_blocks_for_headers_relay.size() > 1)) ||
    5614                 :          0 :                                  peer->m_blocks_for_headers_relay.size() > MAX_BLOCKS_TO_ANNOUNCE);
    5615                 :          0 :             const CBlockIndex *pBestIndex = nullptr; // last header queued for delivery
    5616         [ #  # ]:          0 :             ProcessBlockAvailability(pto->GetId()); // ensure pindexBestKnownBlock is up-to-date
    5617                 :            : 
    5618         [ #  # ]:          0 :             if (!fRevertToInv) {
    5619                 :          0 :                 bool fFoundStartingHeader = false;
    5620                 :            :                 // Try to find first header that our peer doesn't have, and
    5621                 :            :                 // then send all headers past that one.  If we come across any
    5622                 :            :                 // headers that aren't on m_chainman.ActiveChain(), give up.
    5623         [ #  # ]:          0 :                 for (const uint256& hash : peer->m_blocks_for_headers_relay) {
    5624         [ #  # ]:          0 :                     const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hash);
    5625         [ #  # ]:          0 :                     assert(pindex);
    5626 [ #  # ][ #  # ]:          0 :                     if (m_chainman.ActiveChain()[pindex->nHeight] != pindex) {
    5627                 :            :                         // Bail out if we reorged away from this block
    5628                 :          0 :                         fRevertToInv = true;
    5629                 :          0 :                         break;
    5630                 :            :                     }
    5631 [ #  # ][ #  # ]:          0 :                     if (pBestIndex != nullptr && pindex->pprev != pBestIndex) {
    5632                 :            :                         // This means that the list of blocks to announce don't
    5633                 :            :                         // connect to each other.
    5634                 :            :                         // This shouldn't really be possible to hit during
    5635                 :            :                         // regular operation (because reorgs should take us to
    5636                 :            :                         // a chain that has some block not on the prior chain,
    5637                 :            :                         // which should be caught by the prior check), but one
    5638                 :            :                         // way this could happen is by using invalidateblock /
    5639                 :            :                         // reconsiderblock repeatedly on the tip, causing it to
    5640                 :            :                         // be added multiple times to m_blocks_for_headers_relay.
    5641                 :            :                         // Robustly deal with this rare situation by reverting
    5642                 :            :                         // to an inv.
    5643                 :          0 :                         fRevertToInv = true;
    5644                 :          0 :                         break;
    5645                 :            :                     }
    5646                 :          0 :                     pBestIndex = pindex;
    5647         [ #  # ]:          0 :                     if (fFoundStartingHeader) {
    5648                 :            :                         // add this to the headers message
    5649 [ #  # ][ #  # ]:          0 :                         vHeaders.emplace_back(pindex->GetBlockHeader());
    5650 [ #  # ][ #  # ]:          0 :                     } else if (PeerHasHeader(&state, pindex)) {
    5651                 :          0 :                         continue; // keep looking for the first new block
    5652 [ #  # ][ #  # ]:          0 :                     } else if (pindex->pprev == nullptr || PeerHasHeader(&state, pindex->pprev)) {
                 [ #  # ]
    5653                 :            :                         // Peer doesn't have this header but they do have the prior one.
    5654                 :            :                         // Start sending headers.
    5655                 :          0 :                         fFoundStartingHeader = true;
    5656 [ #  # ][ #  # ]:          0 :                         vHeaders.emplace_back(pindex->GetBlockHeader());
    5657                 :          0 :                     } else {
    5658                 :            :                         // Peer doesn't have this header or the prior one -- nothing will
    5659                 :            :                         // connect, so bail out.
    5660                 :          0 :                         fRevertToInv = true;
    5661                 :          0 :                         break;
    5662                 :            :                     }
    5663                 :            :                 }
    5664                 :          0 :             }
    5665 [ #  # ][ #  # ]:          0 :             if (!fRevertToInv && !vHeaders.empty()) {
    5666 [ #  # ][ #  # ]:          0 :                 if (vHeaders.size() == 1 && state.m_requested_hb_cmpctblocks) {
    5667                 :            :                     // We only send up to 1 block as header-and-ids, as otherwise
    5668                 :            :                     // probably means we're doing an initial-ish-sync or they're slow
    5669 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "%s sending header-and-ids %s to peer=%d\n", __func__,
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    5670                 :            :                             vHeaders.front().GetHash().ToString(), pto->GetId());
    5671                 :            : 
    5672                 :          0 :                     std::optional<CSerializedNetMsg> cached_cmpctblock_msg;
    5673                 :            :                     {
    5674         [ #  # ]:          0 :                         LOCK(m_most_recent_block_mutex);
    5675         [ #  # ]:          0 :                         if (m_most_recent_block_hash == pBestIndex->GetBlockHash()) {
    5676 [ #  # ][ #  # ]:          0 :                             cached_cmpctblock_msg = msgMaker.Make(NetMsgType::CMPCTBLOCK, *m_most_recent_compact_block);
    5677                 :          0 :                         }
    5678                 :          0 :                     }
    5679         [ #  # ]:          0 :                     if (cached_cmpctblock_msg.has_value()) {
    5680 [ #  # ][ #  # ]:          0 :                         m_connman.PushMessage(pto, std::move(cached_cmpctblock_msg.value()));
    5681                 :          0 :                     } else {
    5682         [ #  # ]:          0 :                         CBlock block;
    5683         [ #  # ]:          0 :                         const bool ret{m_chainman.m_blockman.ReadBlockFromDisk(block, *pBestIndex)};
    5684         [ #  # ]:          0 :                         assert(ret);
    5685         [ #  # ]:          0 :                         CBlockHeaderAndShortTxIDs cmpctblock{block};
    5686 [ #  # ][ #  # ]:          0 :                         m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::CMPCTBLOCK, cmpctblock));
                 [ #  # ]
    5687                 :          0 :                     }
    5688                 :          0 :                     state.pindexBestHeaderSent = pBestIndex;
    5689         [ #  # ]:          0 :                 } else if (peer->m_prefers_headers) {
    5690         [ #  # ]:          0 :                     if (vHeaders.size() > 1) {
    5691 [ #  # ][ #  # ]:          0 :                         LogPrint(BCLog::NET, "%s: %u headers, range (%s, %s), to peer=%d\n", __func__,
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    5692                 :            :                                 vHeaders.size(),
    5693                 :            :                                 vHeaders.front().GetHash().ToString(),
    5694                 :            :                                 vHeaders.back().GetHash().ToString(), pto->GetId());
    5695                 :          0 :                     } else {
    5696 [ #  # ][ #  # ]:          0 :                         LogPrint(BCLog::NET, "%s: sending header %s to peer=%d\n", __func__,
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    5697                 :            :                                 vHeaders.front().GetHash().ToString(), pto->GetId());
    5698                 :            :                     }
    5699 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::HEADERS, vHeaders));
                 [ #  # ]
    5700                 :          0 :                     state.pindexBestHeaderSent = pBestIndex;
    5701                 :          0 :                 } else
    5702                 :          0 :                     fRevertToInv = true;
    5703                 :          0 :             }
    5704         [ #  # ]:          0 :             if (fRevertToInv) {
    5705                 :            :                 // If falling back to using an inv, just try to inv the tip.
    5706                 :            :                 // The last entry in m_blocks_for_headers_relay was our tip at some point
    5707                 :            :                 // in the past.
    5708         [ #  # ]:          0 :                 if (!peer->m_blocks_for_headers_relay.empty()) {
    5709                 :          0 :                     const uint256& hashToAnnounce = peer->m_blocks_for_headers_relay.back();
    5710         [ #  # ]:          0 :                     const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hashToAnnounce);
    5711         [ #  # ]:          0 :                     assert(pindex);
    5712                 :            : 
    5713                 :            :                     // Warn if we're announcing a block that is not on the main chain.
    5714                 :            :                     // This should be very rare and could be optimized out.
    5715                 :            :                     // Just log for now.
    5716 [ #  # ][ #  # ]:          0 :                     if (m_chainman.ActiveChain()[pindex->nHeight] != pindex) {
    5717 [ #  # ][ #  # ]:          0 :                         LogPrint(BCLog::NET, "Announcing block %s not on main chain (tip=%s)\n",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5718                 :            :                             hashToAnnounce.ToString(), m_chainman.ActiveChain().Tip()->GetBlockHash().ToString());
    5719                 :          0 :                     }
    5720                 :            : 
    5721                 :            :                     // If the peer's chain has this block, don't inv it back.
    5722 [ #  # ][ #  # ]:          0 :                     if (!PeerHasHeader(&state, pindex)) {
    5723         [ #  # ]:          0 :                         peer->m_blocks_for_inv_relay.push_back(hashToAnnounce);
    5724 [ #  # ][ #  # ]:          0 :                         LogPrint(BCLog::NET, "%s: sending inv peer=%d hash=%s\n", __func__,
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5725                 :            :                             pto->GetId(), hashToAnnounce.ToString());
    5726                 :          0 :                     }
    5727                 :          0 :                 }
    5728                 :          0 :             }
    5729                 :          0 :             peer->m_blocks_for_headers_relay.clear();
    5730                 :          0 :         }
    5731                 :            : 
    5732                 :            :         //
    5733                 :            :         // Message: inventory
    5734                 :            :         //
    5735                 :          0 :         std::vector<CInv> vInv;
    5736                 :            :         {
    5737         [ #  # ]:          0 :             LOCK(peer->m_block_inv_mutex);
    5738         [ #  # ]:          0 :             vInv.reserve(std::max<size_t>(peer->m_blocks_for_inv_relay.size(), INVENTORY_BROADCAST_TARGET));
    5739                 :            : 
    5740                 :            :             // Add blocks
    5741         [ #  # ]:          0 :             for (const uint256& hash : peer->m_blocks_for_inv_relay) {
    5742         [ #  # ]:          0 :                 vInv.emplace_back(MSG_BLOCK, hash);
    5743         [ #  # ]:          0 :                 if (vInv.size() == MAX_INV_SZ) {
    5744 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::INV, vInv));
                 [ #  # ]
    5745                 :          0 :                     vInv.clear();
    5746                 :          0 :                 }
    5747                 :            :             }
    5748                 :          0 :             peer->m_blocks_for_inv_relay.clear();
    5749                 :          0 :         }
    5750                 :            : 
    5751 [ #  # ][ #  # ]:          0 :         if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
    5752         [ #  # ]:          0 :                 LOCK(tx_relay->m_tx_inventory_mutex);
    5753                 :            :                 // Check whether periodic sends should happen
    5754         [ #  # ]:          0 :                 bool fSendTrickle = pto->HasPermission(NetPermissionFlags::NoBan);
    5755 [ #  # ][ #  # ]:          0 :                 if (tx_relay->m_next_inv_send_time < current_time) {
    5756                 :          0 :                     fSendTrickle = true;
    5757         [ #  # ]:          0 :                     if (pto->IsInboundConn()) {
    5758         [ #  # ]:          0 :                         tx_relay->m_next_inv_send_time = NextInvToInbounds(current_time, INBOUND_INVENTORY_BROADCAST_INTERVAL);
    5759                 :          0 :                     } else {
    5760         [ #  # ]:          0 :                         tx_relay->m_next_inv_send_time = GetExponentialRand(current_time, OUTBOUND_INVENTORY_BROADCAST_INTERVAL);
    5761                 :            :                     }
    5762                 :          0 :                 }
    5763                 :            : 
    5764                 :            :                 // Time to send but the peer has requested we not relay transactions.
    5765         [ #  # ]:          0 :                 if (fSendTrickle) {
    5766         [ #  # ]:          0 :                     LOCK(tx_relay->m_bloom_filter_mutex);
    5767         [ #  # ]:          0 :                     if (!tx_relay->m_relay_txs) tx_relay->m_tx_inventory_to_send.clear();
    5768                 :          0 :                 }
    5769                 :            : 
    5770                 :            :                 // Respond to BIP35 mempool requests
    5771 [ #  # ][ #  # ]:          0 :                 if (fSendTrickle && tx_relay->m_send_mempool) {
    5772         [ #  # ]:          0 :                     auto vtxinfo = m_mempool.infoAll();
    5773                 :          0 :                     tx_relay->m_send_mempool = false;
    5774         [ #  # ]:          0 :                     const CFeeRate filterrate{tx_relay->m_fee_filter_received.load()};
    5775                 :            : 
    5776         [ #  # ]:          0 :                     LOCK(tx_relay->m_bloom_filter_mutex);
    5777                 :            : 
    5778         [ #  # ]:          0 :                     for (const auto& txinfo : vtxinfo) {
    5779         [ #  # ]:          0 :                         CInv inv{
    5780                 :          0 :                             peer->m_wtxid_relay ? MSG_WTX : MSG_TX,
    5781         [ #  # ]:          0 :                             peer->m_wtxid_relay ?
    5782                 :          0 :                                 txinfo.tx->GetWitnessHash().ToUint256() :
    5783                 :          0 :                                 txinfo.tx->GetHash().ToUint256(),
    5784                 :            :                         };
    5785         [ #  # ]:          0 :                         tx_relay->m_tx_inventory_to_send.erase(inv.hash);
    5786                 :            : 
    5787                 :            :                         // Don't send transactions that peers will not put into their mempool
    5788 [ #  # ][ #  # ]:          0 :                         if (txinfo.fee < filterrate.GetFee(txinfo.vsize)) {
    5789                 :          0 :                             continue;
    5790                 :            :                         }
    5791         [ #  # ]:          0 :                         if (tx_relay->m_bloom_filter) {
    5792 [ #  # ][ #  # ]:          0 :                             if (!tx_relay->m_bloom_filter->IsRelevantAndUpdate(*txinfo.tx)) continue;
    5793                 :          0 :                         }
    5794 [ #  # ][ #  # ]:          0 :                         tx_relay->m_tx_inventory_known_filter.insert(inv.hash);
    5795         [ #  # ]:          0 :                         vInv.push_back(inv);
    5796         [ #  # ]:          0 :                         if (vInv.size() == MAX_INV_SZ) {
    5797 [ #  # ][ #  # ]:          0 :                             m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::INV, vInv));
                 [ #  # ]
    5798                 :          0 :                             vInv.clear();
    5799                 :          0 :                         }
    5800                 :            :                     }
    5801                 :          0 :                 }
    5802                 :            : 
    5803                 :            :                 // Determine transactions to relay
    5804         [ #  # ]:          0 :                 if (fSendTrickle) {
    5805                 :            :                     // Produce a vector with all candidates for sending
    5806                 :          0 :                     std::vector<std::set<uint256>::iterator> vInvTx;
    5807         [ #  # ]:          0 :                     vInvTx.reserve(tx_relay->m_tx_inventory_to_send.size());
    5808         [ #  # ]:          0 :                     for (std::set<uint256>::iterator it = tx_relay->m_tx_inventory_to_send.begin(); it != tx_relay->m_tx_inventory_to_send.end(); it++) {
    5809         [ #  # ]:          0 :                         vInvTx.push_back(it);
    5810                 :          0 :                     }
    5811         [ #  # ]:          0 :                     const CFeeRate filterrate{tx_relay->m_fee_filter_received.load()};
    5812                 :            :                     // Topologically and fee-rate sort the inventory we send for privacy and priority reasons.
    5813                 :            :                     // A heap is used so that not all items need sorting if only a few are being sent.
    5814         [ #  # ]:          0 :                     CompareInvMempoolOrder compareInvMempoolOrder(&m_mempool, peer->m_wtxid_relay);
    5815         [ #  # ]:          0 :                     std::make_heap(vInvTx.begin(), vInvTx.end(), compareInvMempoolOrder);
    5816                 :            :                     // No reason to drain out at many times the network's capacity,
    5817                 :            :                     // especially since we have many peers and some will draw much shorter delays.
    5818                 :          0 :                     unsigned int nRelayedTransactions = 0;
    5819         [ #  # ]:          0 :                     LOCK(tx_relay->m_bloom_filter_mutex);
    5820                 :          0 :                     size_t broadcast_max{INVENTORY_BROADCAST_TARGET + (tx_relay->m_tx_inventory_to_send.size()/1000)*5};
    5821                 :          0 :                     broadcast_max = std::min<size_t>(INVENTORY_BROADCAST_MAX, broadcast_max);
    5822 [ #  # ][ #  # ]:          0 :                     while (!vInvTx.empty() && nRelayedTransactions < broadcast_max) {
    5823                 :            :                         // Fetch the top element from the heap
    5824         [ #  # ]:          0 :                         std::pop_heap(vInvTx.begin(), vInvTx.end(), compareInvMempoolOrder);
    5825                 :          0 :                         std::set<uint256>::iterator it = vInvTx.back();
    5826                 :          0 :                         vInvTx.pop_back();
    5827                 :          0 :                         uint256 hash = *it;
    5828         [ #  # ]:          0 :                         CInv inv(peer->m_wtxid_relay ? MSG_WTX : MSG_TX, hash);
    5829                 :            :                         // Remove it from the to-be-sent set
    5830         [ #  # ]:          0 :                         tx_relay->m_tx_inventory_to_send.erase(it);
    5831                 :            :                         // Check if not in the filter already
    5832 [ #  # ][ #  # ]:          0 :                         if (tx_relay->m_tx_inventory_known_filter.contains(hash)) {
                 [ #  # ]
    5833                 :          0 :                             continue;
    5834                 :            :                         }
    5835                 :            :                         // Not in the mempool anymore? don't bother sending it.
    5836 [ #  # ][ #  # ]:          0 :                         auto txinfo = m_mempool.info(ToGenTxid(inv));
    5837         [ #  # ]:          0 :                         if (!txinfo.tx) {
    5838                 :          0 :                             continue;
    5839                 :            :                         }
    5840                 :            :                         // Peer told you to not send transactions at that feerate? Don't bother sending it.
    5841 [ #  # ][ #  # ]:          0 :                         if (txinfo.fee < filterrate.GetFee(txinfo.vsize)) {
    5842                 :          0 :                             continue;
    5843                 :            :                         }
    5844 [ #  # ][ #  # ]:          0 :                         if (tx_relay->m_bloom_filter && !tx_relay->m_bloom_filter->IsRelevantAndUpdate(*txinfo.tx)) continue;
                 [ #  # ]
    5845                 :            :                         // Send
    5846         [ #  # ]:          0 :                         vInv.push_back(inv);
    5847                 :          0 :                         nRelayedTransactions++;
    5848         [ #  # ]:          0 :                         if (vInv.size() == MAX_INV_SZ) {
    5849 [ #  # ][ #  # ]:          0 :                             m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::INV, vInv));
                 [ #  # ]
    5850                 :          0 :                             vInv.clear();
    5851                 :          0 :                         }
    5852 [ #  # ][ #  # ]:          0 :                         tx_relay->m_tx_inventory_known_filter.insert(hash);
    5853      [ #  #  # ]:          0 :                     }
    5854                 :            : 
    5855                 :            :                     // Ensure we'll respond to GETDATA requests for anything we've just announced
    5856         [ #  # ]:          0 :                     LOCK(m_mempool.cs);
    5857         [ #  # ]:          0 :                     tx_relay->m_last_inv_sequence = m_mempool.GetSequence();
    5858                 :          0 :                 }
    5859                 :          0 :         }
    5860         [ #  # ]:          0 :         if (!vInv.empty())
    5861 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::INV, vInv));
                 [ #  # ]
    5862                 :            : 
    5863                 :            :         // Detect whether we're stalling
    5864                 :          0 :         auto stalling_timeout = m_block_stalling_timeout.load();
    5865 [ #  # ][ #  # ]:          0 :         if (state.m_stalling_since.count() && state.m_stalling_since < current_time - stalling_timeout) {
         [ #  # ][ #  # ]
    5866                 :            :             // Stalling only triggers when the block download window cannot move. During normal steady state,
    5867                 :            :             // the download window should be much larger than the to-be-downloaded set of blocks, so disconnection
    5868                 :            :             // should only happen during initial block download.
    5869 [ #  # ][ #  # ]:          0 :             LogPrintf("Peer=%d%s is stalling block download, disconnecting\n", pto->GetId(), fLogIPs ? strprintf(" peeraddr=%s", pto->addr.ToStringAddrPort()) : "");
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    5870                 :          0 :             pto->fDisconnect = true;
    5871                 :            :             // Increase timeout for the next peer so that we don't disconnect multiple peers if our own
    5872                 :            :             // bandwidth is insufficient.
    5873 [ #  # ][ #  # ]:          0 :             const auto new_timeout = std::min(2 * stalling_timeout, BLOCK_STALLING_TIMEOUT_MAX);
    5874 [ #  # ][ #  # ]:          0 :             if (stalling_timeout != new_timeout && m_block_stalling_timeout.compare_exchange_strong(stalling_timeout, new_timeout)) {
                 [ #  # ]
    5875 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Increased stalling timeout temporarily to %d seconds\n", count_seconds(new_timeout));
         [ #  # ][ #  # ]
                 [ #  # ]
    5876                 :          0 :             }
    5877                 :          0 :             return true;
    5878                 :            :         }
    5879                 :            :         // In case there is a block that has been in flight from this peer for block_interval * (1 + 0.5 * N)
    5880                 :            :         // (with N the number of peers from which we're downloading validated blocks), disconnect due to timeout.
    5881                 :            :         // We compensate for other peers to prevent killing off peers due to our own downstream link
    5882                 :            :         // being saturated. We only count validated in-flight blocks so peers can't advertise non-existing block hashes
    5883                 :            :         // to unreasonably increase our timeout.
    5884         [ #  # ]:          0 :         if (state.vBlocksInFlight.size() > 0) {
    5885                 :          0 :             QueuedBlock &queuedBlock = state.vBlocksInFlight.front();
    5886                 :          0 :             int nOtherPeersWithValidatedDownloads = m_peers_downloading_from - 1;
    5887 [ #  # ][ #  # ]:          0 :             if (current_time > state.m_downloading_since + std::chrono::seconds{consensusParams.nPowTargetSpacing} * (BLOCK_DOWNLOAD_TIMEOUT_BASE + BLOCK_DOWNLOAD_TIMEOUT_PER_PEER * nOtherPeersWithValidatedDownloads)) {
         [ #  # ][ #  # ]
                 [ #  # ]
    5888 [ #  # ][ #  # ]:          0 :                 LogPrintf("Timeout downloading block %s from peer=%d%s, disconnecting\n", queuedBlock.pindex->GetBlockHash().ToString(), pto->GetId(), fLogIPs ? strprintf(" peeraddr=%s", pto->addr.ToStringAddrPort()) : "");
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5889                 :          0 :                 pto->fDisconnect = true;
    5890                 :          0 :                 return true;
    5891                 :            :             }
    5892                 :          0 :         }
    5893                 :            :         // Check for headers sync timeouts
    5894 [ #  # ][ #  # ]:          0 :         if (state.fSyncStarted && peer->m_headers_sync_timeout < std::chrono::microseconds::max()) {
                 [ #  # ]
    5895                 :            :             // Detect whether this is a stalling initial-headers-sync peer
    5896 [ #  # ][ #  # ]:          0 :             if (m_chainman.m_best_header->Time() <= GetAdjustedTime() - 24h) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5897 [ #  # ][ #  # ]:          0 :                 if (current_time > peer->m_headers_sync_timeout && nSyncStarted == 1 && (m_num_preferred_download_peers - state.fPreferredDownload >= 1)) {
         [ #  # ][ #  # ]
    5898                 :            :                     // Disconnect a peer (without NetPermissionFlags::NoBan permission) if it is our only sync peer,
    5899                 :            :                     // and we have others we could be using instead.
    5900                 :            :                     // Note: If all our peers are inbound, then we won't
    5901                 :            :                     // disconnect our sync peer for stalling; we have bigger
    5902                 :            :                     // problems if we can't get any outbound peers.
    5903 [ #  # ][ #  # ]:          0 :                     if (!pto->HasPermission(NetPermissionFlags::NoBan)) {
    5904 [ #  # ][ #  # ]:          0 :                         LogPrintf("Timeout downloading headers from peer=%d%s, disconnecting\n", pto->GetId(), fLogIPs ? strprintf(" peeraddr=%s", pto->addr.ToStringAddrPort()) : "");
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    5905                 :          0 :                         pto->fDisconnect = true;
    5906                 :          0 :                         return true;
    5907                 :            :                     } else {
    5908 [ #  # ][ #  # ]:          0 :                         LogPrintf("Timeout downloading headers from noban peer=%d%s, not disconnecting\n", pto->GetId(), fLogIPs ? strprintf(" peeraddr=%s", pto->addr.ToStringAddrPort()) : "");
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
                 [ #  # ]
    5909                 :            :                         // Reset the headers sync state so that we have a
    5910                 :            :                         // chance to try downloading from a different peer.
    5911                 :            :                         // Note: this will also result in at least one more
    5912                 :            :                         // getheaders message to be sent to
    5913                 :            :                         // this peer (eventually).
    5914                 :          0 :                         state.fSyncStarted = false;
    5915                 :          0 :                         nSyncStarted--;
    5916         [ #  # ]:          0 :                         peer->m_headers_sync_timeout = 0us;
    5917                 :            :                     }
    5918                 :          0 :                 }
    5919                 :          0 :             } else {
    5920                 :            :                 // After we've caught up once, reset the timeout so we can't trigger
    5921                 :            :                 // disconnect later.
    5922                 :          0 :                 peer->m_headers_sync_timeout = std::chrono::microseconds::max();
    5923                 :            :             }
    5924                 :          0 :         }
    5925                 :            : 
    5926                 :            :         // Check that outbound peers have reasonable chains
    5927                 :            :         // GetTime() is used by this anti-DoS logic so we can test this using mocktime
    5928 [ #  # ][ #  # ]:          0 :         ConsiderEviction(*pto, *peer, GetTime<std::chrono::seconds>());
    5929                 :            : 
    5930                 :            :         //
    5931                 :            :         // Message: getdata (blocks)
    5932                 :            :         //
    5933                 :          0 :         std::vector<CInv> vGetData;
    5934 [ #  # ][ #  # ]:          0 :         if (CanServeBlocks(*peer) && ((sync_blocks_and_headers_from_peer && !IsLimitedPeer(*peer)) || !m_chainman.IsInitialBlockDownload()) && state.vBlocksInFlight.size() < MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5935                 :          0 :             std::vector<const CBlockIndex*> vToDownload;
    5936                 :          0 :             NodeId staller = -1;
    5937                 :          0 :             auto get_inflight_budget = [&state]() {
    5938                 :          0 :                 return std::max(0, MAX_BLOCKS_IN_TRANSIT_PER_PEER - static_cast<int>(state.vBlocksInFlight.size()));
    5939                 :            :             };
    5940                 :            : 
    5941                 :            :             // If a snapshot chainstate is in use, we want to find its next blocks
    5942                 :            :             // before the background chainstate to prioritize getting to network tip.
    5943 [ #  # ][ #  # ]:          0 :             FindNextBlocksToDownload(*peer, get_inflight_budget(), vToDownload, staller);
    5944 [ #  # ][ #  # ]:          0 :             if (m_chainman.BackgroundSyncInProgress() && !IsLimitedPeer(*peer)) {
         [ #  # ][ #  # ]
    5945         [ #  # ]:          0 :                 TryDownloadingHistoricalBlocks(
    5946                 :          0 :                     *peer,
    5947         [ #  # ]:          0 :                     get_inflight_budget(),
    5948         [ #  # ]:          0 :                     vToDownload, m_chainman.GetBackgroundSyncTip(),
    5949 [ #  # ][ #  # ]:          0 :                     Assert(m_chainman.GetSnapshotBaseBlock()));
    5950                 :          0 :             }
    5951         [ #  # ]:          0 :             for (const CBlockIndex *pindex : vToDownload) {
    5952                 :          0 :                 uint32_t nFetchFlags = GetFetchFlags(*peer);
    5953         [ #  # ]:          0 :                 vGetData.emplace_back(MSG_BLOCK | nFetchFlags, pindex->GetBlockHash());
    5954         [ #  # ]:          0 :                 BlockRequested(pto->GetId(), *pindex);
    5955 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Requesting block %s (%d) peer=%d\n", pindex->GetBlockHash().ToString(),
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5956                 :            :                     pindex->nHeight, pto->GetId());
    5957                 :            :             }
    5958 [ #  # ][ #  # ]:          0 :             if (state.vBlocksInFlight.empty() && staller != -1) {
    5959 [ #  # ][ #  # ]:          0 :                 if (State(staller)->m_stalling_since == 0us) {
         [ #  # ][ #  # ]
    5960         [ #  # ]:          0 :                     State(staller)->m_stalling_since = current_time;
    5961 [ #  # ][ #  # ]:          0 :                     LogPrint(BCLog::NET, "Stall started peer=%d\n", staller);
         [ #  # ][ #  # ]
                 [ #  # ]
    5962                 :          0 :                 }
    5963                 :          0 :             }
    5964                 :          0 :         }
    5965                 :            : 
    5966                 :            :         //
    5967                 :            :         // Message: getdata (transactions)
    5968                 :            :         //
    5969                 :          0 :         std::vector<std::pair<NodeId, GenTxid>> expired;
    5970         [ #  # ]:          0 :         auto requestable = m_txrequest.GetRequestable(pto->GetId(), current_time, &expired);
    5971         [ #  # ]:          0 :         for (const auto& entry : expired) {
    5972 [ #  # ][ #  # ]:          0 :             LogPrint(BCLog::NET, "timeout of inflight %s %s from peer=%d\n", entry.second.IsWtxid() ? "wtx" : "tx",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5973                 :            :                 entry.second.GetHash().ToString(), entry.first);
    5974                 :            :         }
    5975         [ #  # ]:          0 :         for (const GenTxid& gtxid : requestable) {
    5976 [ #  # ][ #  # ]:          0 :             if (!AlreadyHaveTx(gtxid)) {
    5977 [ #  # ][ #  # ]:          0 :                 LogPrint(BCLog::NET, "Requesting %s %s peer=%d\n", gtxid.IsWtxid() ? "wtx" : "tx",
         [ #  # ][ #  # ]
         [ #  # ][ #  # ]
    5978                 :            :                     gtxid.GetHash().ToString(), pto->GetId());
    5979 [ #  # ][ #  # ]:          0 :                 vGetData.emplace_back(gtxid.IsWtxid() ? MSG_WTX : (MSG_TX | GetFetchFlags(*peer)), gtxid.GetHash());
    5980         [ #  # ]:          0 :                 if (vGetData.size() >= MAX_GETDATA_SZ) {
    5981 [ #  # ][ #  # ]:          0 :                     m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::GETDATA, vGetData));
                 [ #  # ]
    5982                 :          0 :                     vGetData.clear();
    5983                 :          0 :                 }
    5984 [ #  # ][ #  # ]:          0 :                 m_txrequest.RequestedTx(pto->GetId(), gtxid.GetHash(), current_time + GETDATA_TX_INTERVAL);
    5985                 :          0 :             } else {
    5986                 :            :                 // We have already seen this transaction, no need to download. This is just a belt-and-suspenders, as
    5987                 :            :                 // this should already be called whenever a transaction becomes AlreadyHaveTx().
    5988         [ #  # ]:          0 :                 m_txrequest.ForgetTxHash(gtxid.GetHash());
    5989                 :            :             }
    5990                 :            :         }
    5991                 :            : 
    5992                 :            : 
    5993         [ #  # ]:          0 :         if (!vGetData.empty())
    5994 [ #  # ][ #  # ]:          0 :             m_connman.PushMessage(pto, msgMaker.Make(NetMsgType::GETDATA, vGetData));
                 [ #  # ]
    5995         [ #  # ]:          0 :     } // release cs_main
    5996         [ #  # ]:          0 :     MaybeSendFeefilter(*pto, *peer, current_time);
    5997                 :          0 :     return true;
    5998                 :          0 : }

Generated by: LCOV version 1.14