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