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