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 : 117470 : 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 : 1560 : TxRelay* SetTxRelay() EXCLUSIVE_LOCKS_REQUIRED(!m_tx_relay_mutex)
330 : : {
331 : 1560 : LOCK(m_tx_relay_mutex);
332 [ + - ]: 1560 : Assume(!m_tx_relay);
333 [ + - ]: 1560 : m_tx_relay = std::make_unique<Peer::TxRelay>();
334 [ + - ]: 1560 : return m_tx_relay.get();
335 : 1560 : };
336 : :
337 : 586882 : TxRelay* GetTxRelay() EXCLUSIVE_LOCKS_REQUIRED(!m_tx_relay_mutex)
338 : : {
339 [ + - + - : 1033380 : 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 : 1687 : explicit Peer(NodeId id, ServiceFlags our_services, bool is_inbound)
423 : 1687 : : m_id{id}
424 : 1687 : , m_our_services{our_services}
425 [ + - ]: 1687 : , m_is_inbound{is_inbound}
426 : 1687 : {}
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 : 1687 : 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 : 114463 : void SetBestBlock(int height, std::chrono::seconds time) override
549 : : {
550 : 114463 : m_best_height = height;
551 : 114463 : m_best_block_time = time;
552 : 114463 : };
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 : 324 : 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 [ + - ]: 67 : void PushMessage(CNode& node, CSerializedNetMsg&& msg) const { m_connman.PushMessage(&node, std::move(msg)); }
723 : : template <typename... Args>
724 : 150336 : void MakeAndPushMessage(CNode& node, std::string msg_type, Args&&... args) const
725 : : {
726 [ + - + - ]: 300672 : m_connman.PushMessage(&node, NetMsg::Make(std::move(msg_type), std::forward<Args>(args)...));
727 : 150336 : }
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 : 2742505 : const CNodeState* PeerManagerImpl::State(NodeId pnode) const
1097 : : {
1098 : 2742505 : std::map<NodeId, CNodeState>::const_iterator it = m_node_states.find(pnode);
1099 [ + + ]: 2742505 : if (it == m_node_states.end())
1100 : : return nullptr;
1101 : 2742204 : return &it->second;
1102 : : }
1103 : :
1104 : 2729712 : CNodeState* PeerManagerImpl::State(NodeId pnode)
1105 : : {
1106 : 2729712 : 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 : 19523 : static bool IsAddrCompatible(const Peer& peer, const CAddress& addr)
1115 : : {
1116 [ + + + - ]: 19523 : 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 : 19028 : 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 [ - + ]: 19028 : assert(peer.m_addr_known);
1131 [ + - - + : 38056 : if (addr.IsValid() && !peer.m_addr_known->contains(addr.GetKey()) && IsAddrCompatible(peer, addr)) {
+ - + + +
- + - +
+ ]
1132 [ - + - + ]: 19011 : 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 : 19011 : peer.m_addrs_to_send.push_back(addr);
1136 : : }
1137 : : }
1138 : 19028 : }
1139 : :
1140 : 42421 : static void AddKnownTx(Peer& peer, const uint256& hash)
1141 : : {
1142 : 42421 : auto tx_relay = peer.GetTxRelay();
1143 [ + + ]: 42421 : if (!tx_relay) return;
1144 : :
1145 : 42419 : LOCK(tx_relay->m_tx_inventory_mutex);
1146 [ + - ]: 42419 : tx_relay->m_tx_inventory_known_filter.insert(hash);
1147 : 42419 : }
1148 : :
1149 : : /** Whether this peer can serve us blocks. */
1150 : 626683 : static bool CanServeBlocks(const Peer& peer)
1151 : : {
1152 : 626683 : 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 : 471926 : static bool IsLimitedPeer(const Peer& peer)
1158 : : {
1159 [ + + - + ]: 471926 : return (!(peer.m_their_services & NODE_NETWORK) &&
1160 [ - + ]: 34121 : (peer.m_their_services & NODE_NETWORK_LIMITED));
1161 : : }
1162 : :
1163 : : /** Whether this peer can serve us witness data */
1164 : 2601369 : static bool CanServeWitnesses(const Peer& peer)
1165 : : {
1166 : 2601369 : return peer.m_their_services & NODE_WITNESS;
1167 : : }
1168 : :
1169 : 3604 : std::chrono::microseconds PeerManagerImpl::NextInvToInbounds(std::chrono::microseconds now,
1170 : : std::chrono::seconds average_interval,
1171 : : uint64_t network_key)
1172 : : {
1173 [ + + ]: 3604 : auto [it, inserted] = m_next_inv_to_inbounds_per_network_key.try_emplace(network_key, 0us);
1174 [ + + ]: 3604 : auto& timer{it->second};
1175 [ + + ]: 3604 : if (timer < now) {
1176 : 1694 : timer = now + m_rng.rand_exp_duration(average_interval);
1177 : : }
1178 : 3604 : return timer;
1179 : : }
1180 : :
1181 : 743898 : bool PeerManagerImpl::IsBlockRequested(const uint256& hash)
1182 : : {
1183 : 743898 : return mapBlocksInFlight.contains(hash);
1184 : : }
1185 : :
1186 : 7 : bool PeerManagerImpl::IsBlockRequestedFromOutbound(const uint256& hash)
1187 : : {
1188 [ + + ]: 22 : for (auto range = mapBlocksInFlight.equal_range(hash); range.first != range.second; range.first++) {
1189 : 16 : auto [nodeid, block_it] = range.first->second;
1190 : 16 : PeerRef peer{GetPeerRef(nodeid)};
1191 [ + - + + : 16 : if (peer && !peer->m_is_inbound) return true;
+ - ]
1192 : 16 : }
1193 : :
1194 : : return false;
1195 : : }
1196 : :
1197 : 176777 : void PeerManagerImpl::RemoveBlockRequest(const uint256& hash, std::optional<NodeId> from_peer)
1198 : : {
1199 : 176777 : auto range = mapBlocksInFlight.equal_range(hash);
1200 [ + + ]: 176777 : 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 : 58695 : Assume(mapBlocksInFlight.count(hash) <= MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK);
1207 : :
1208 [ + + ]: 117529 : while (range.first != range.second) {
1209 [ + + ]: 58834 : const auto& [node_id, list_it]{range.first->second};
1210 : :
1211 [ + + + + ]: 58834 : if (from_peer && *from_peer != node_id) {
1212 : 264 : range.first++;
1213 : 264 : continue;
1214 : : }
1215 : :
1216 [ - + ]: 58570 : CNodeState& state = *Assert(State(node_id));
1217 : :
1218 [ + + ]: 58570 : if (state.vBlocksInFlight.begin() == list_it) {
1219 : : // First block on the queue was received, update the start download time for the next one
1220 : 57192 : state.m_downloading_since = std::max(state.m_downloading_since, GetTime<std::chrono::microseconds>());
1221 : : }
1222 : 58570 : state.vBlocksInFlight.erase(list_it);
1223 : :
1224 [ + + ]: 58570 : if (state.vBlocksInFlight.empty()) {
1225 : : // Last validated block on the queue for this peer was received.
1226 : 19124 : m_peers_downloading_from--;
1227 : : }
1228 : 58570 : state.m_stalling_since = 0us;
1229 : :
1230 : 58570 : range.first = mapBlocksInFlight.erase(range.first);
1231 : : }
1232 : : }
1233 : :
1234 : 58980 : bool PeerManagerImpl::BlockRequested(NodeId nodeid, const CBlockIndex& block, std::list<QueuedBlock>::iterator** pit)
1235 : : {
1236 : 58980 : const uint256& hash{block.GetBlockHash()};
1237 : :
1238 : 58980 : CNodeState *state = State(nodeid);
1239 [ - + ]: 58980 : assert(state != nullptr);
1240 : :
1241 : 58980 : Assume(mapBlocksInFlight.count(hash) <= MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK);
1242 : :
1243 : : // Short-circuit most stuff in case it is from the same node
1244 [ + + ]: 59113 : for (auto range = mapBlocksInFlight.equal_range(hash); range.first != range.second; range.first++) {
1245 [ + + ]: 378 : if (range.first->second.first == nodeid) {
1246 [ + - ]: 245 : if (pit) {
1247 : 245 : *pit = &range.first->second.second;
1248 : : }
1249 : 245 : return false;
1250 : : }
1251 : : }
1252 : :
1253 : : // Make sure it's not being fetched already from same peer.
1254 : 58735 : RemoveBlockRequest(hash, nodeid);
1255 : :
1256 : 58735 : std::list<QueuedBlock>::iterator it = state->vBlocksInFlight.insert(state->vBlocksInFlight.end(),
1257 : 17665 : {&block, std::unique_ptr<PartiallyDownloadedBlock>(pit ? new PartiallyDownloadedBlock(&m_mempool) : nullptr)});
1258 [ + + ]: 58735 : if (state->vBlocksInFlight.size() == 1) {
1259 : : // We're starting a block download (batch) from this peer.
1260 : 19155 : state->m_downloading_since = GetTime<std::chrono::microseconds>();
1261 : 19155 : m_peers_downloading_from++;
1262 : : }
1263 : 58735 : auto itInFlight = mapBlocksInFlight.insert(std::make_pair(hash, std::make_pair(nodeid, it)));
1264 [ + + ]: 58735 : if (pit) {
1265 : 17665 : *pit = &itInFlight->second.second;
1266 : : }
1267 : : return true;
1268 [ + + + - ]: 76400 : }
1269 : :
1270 : 21351 : void PeerManagerImpl::MaybeSetPeerAsAnnouncingHeaderAndIDs(NodeId nodeid)
1271 : : {
1272 : 21351 : 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 [ + + ]: 21351 : if (m_opts.ignore_incoming_txs) return;
1278 : :
1279 : 21350 : CNodeState* nodestate = State(nodeid);
1280 : 21350 : PeerRef peer{GetPeerRef(nodeid)};
1281 [ + + + + ]: 21350 : if (!nodestate || !nodestate->m_provides_cmpctblocks) {
1282 : : // Don't request compact blocks if the peer has not signalled support
1283 : : return;
1284 : : }
1285 : :
1286 : 19480 : int num_outbound_hb_peers = 0;
1287 [ + + ]: 26442 : for (std::list<NodeId>::iterator it = lNodesAnnouncingHeaderAndIDs.begin(); it != lNodesAnnouncingHeaderAndIDs.end(); it++) {
1288 [ + + ]: 26093 : if (*it == nodeid) {
1289 : 19131 : lNodesAnnouncingHeaderAndIDs.erase(it);
1290 [ + - ]: 19131 : lNodesAnnouncingHeaderAndIDs.push_back(nodeid);
1291 : : return;
1292 : : }
1293 [ + - ]: 6962 : PeerRef peer_ref{GetPeerRef(*it)};
1294 [ + + + + ]: 6962 : if (peer_ref && !peer_ref->m_is_inbound) ++num_outbound_hb_peers;
1295 : 6962 : }
1296 [ + - + + ]: 349 : 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 [ + + + + ]: 177 : 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 [ + - + - ]: 698 : m_connman.ForNode(nodeid, [this](CNode* pfrom) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
1309 : 349 : AssertLockHeld(::cs_main);
1310 [ + + ]: 349 : if (lNodesAnnouncingHeaderAndIDs.size() >= 3) {
1311 : : // As per BIP152, we only get 3 of our peers to announce
1312 : : // blocks using compact encodings.
1313 [ + - ]: 66 : 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 : 66 : lNodesAnnouncingHeaderAndIDs.pop_front();
1320 : : }
1321 [ + - ]: 349 : MakeAndPushMessage(*pfrom, NetMsgType::SENDCMPCT, /*high_bandwidth=*/true, /*version=*/CMPCTBLOCKS_VERSION);
1322 : : // save BIP152 bandwidth state: we select peer to be high-bandwidth
1323 : 349 : pfrom->m_bip152_highbandwidth_to = true;
1324 : 349 : lNodesAnnouncingHeaderAndIDs.push_back(pfrom->GetId());
1325 : 349 : return true;
1326 : : });
1327 : 21350 : }
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 : 65113 : bool PeerManagerImpl::CanDirectFetch()
1345 : : {
1346 [ - + ]: 130226 : return m_chainman.ActiveChain().Tip()->Time() > NodeClock::now() - m_chainparams.GetConsensus().PowTargetSpacing() * 20;
1347 : : }
1348 : :
1349 : 130804 : static bool PeerHasHeader(CNodeState *state, const CBlockIndex *pindex) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
1350 : : {
1351 [ + + + + ]: 130804 : if (state->pindexBestKnownBlock && pindex == state->pindexBestKnownBlock->GetAncestor(pindex->nHeight))
1352 : : return true;
1353 [ + + + + ]: 83791 : if (state->pindexBestHeaderSent && pindex == state->pindexBestHeaderSent->GetAncestor(pindex->nHeight))
1354 : 40149 : return true;
1355 : : return false;
1356 : : }
1357 : :
1358 : 970918 : void PeerManagerImpl::ProcessBlockAvailability(NodeId nodeid) {
1359 : 970918 : CNodeState *state = State(nodeid);
1360 [ - + ]: 970918 : assert(state != nullptr);
1361 : :
1362 [ + + ]: 1941836 : if (!state->hashLastUnknownBlock.IsNull()) {
1363 : 9843 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(state->hashLastUnknownBlock);
1364 [ + + + - ]: 9843 : if (pindex && pindex->nChainWork > 0) {
1365 [ + + + + ]: 341 : if (state->pindexBestKnownBlock == nullptr || pindex->nChainWork >= state->pindexBestKnownBlock->nChainWork) {
1366 : 340 : state->pindexBestKnownBlock = pindex;
1367 : : }
1368 : 341 : state->hashLastUnknownBlock.SetNull();
1369 : : }
1370 : : }
1371 : 970918 : }
1372 : :
1373 : 29669 : void PeerManagerImpl::UpdateBlockAvailability(NodeId nodeid, const uint256 &hash) {
1374 : 29669 : CNodeState *state = State(nodeid);
1375 [ - + ]: 29669 : assert(state != nullptr);
1376 : :
1377 : 29669 : ProcessBlockAvailability(nodeid);
1378 : :
1379 : 29669 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hash);
1380 [ + + + - ]: 29669 : if (pindex && pindex->nChainWork > 0) {
1381 : : // An actually better block was announced.
1382 [ + + + + ]: 28961 : if (state->pindexBestKnownBlock == nullptr || pindex->nChainWork >= state->pindexBestKnownBlock->nChainWork) {
1383 : 28124 : state->pindexBestKnownBlock = pindex;
1384 : : }
1385 : : } else {
1386 : : // An unknown block was announced; just assume that the latest one is the best one.
1387 : 708 : state->hashLastUnknownBlock = hash;
1388 : : }
1389 : 29669 : }
1390 : :
1391 : : // Logic for calculating which blocks to download from a given peer, given our current tip.
1392 : 425653 : void PeerManagerImpl::FindNextBlocksToDownload(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, NodeId& nodeStaller)
1393 : : {
1394 [ + - ]: 425653 : if (count == 0)
1395 : : return;
1396 : :
1397 [ - + ]: 425653 : vBlocks.reserve(vBlocks.size() + count);
1398 : 425653 : CNodeState *state = State(peer.m_id);
1399 [ - + ]: 425653 : assert(state != nullptr);
1400 : :
1401 : : // Make sure pindexBestKnownBlock is up to date, we'll need it.
1402 : 425653 : ProcessBlockAvailability(peer.m_id);
1403 : :
1404 [ + + - + : 684837 : 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 : 272618 : return;
1407 : : }
1408 : :
1409 : : // When we sync with AssumeUtxo and discover the snapshot is not in the peer's best chain, abort:
1410 : : // We can't reorg to this chain due to missing undo data until the background sync has finished,
1411 : : // so downloading blocks from it would be futile.
1412 : 153035 : const CBlockIndex* snap_base{m_chainman.CurrentChainstate().SnapshotBase()};
1413 [ + + + - ]: 153035 : if (snap_base && state->pindexBestKnownBlock->GetAncestor(snap_base->nHeight) != snap_base) {
1414 [ # # ]: 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);
1415 : 0 : return;
1416 : : }
1417 : :
1418 : : // Determine the forking point between the peer's chain and our chain:
1419 : : // pindexLastCommonBlock is required to be an ancestor of pindexBestKnownBlock, and will be used as a starting point.
1420 : : // 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
1421 : : // an ancestor with more work than the fork point.
1422 : 153035 : auto fork_point = LastCommonAncestor(state->pindexBestKnownBlock, m_chainman.ActiveTip());
1423 [ + + ]: 152257 : if (state->pindexLastCommonBlock == nullptr ||
1424 [ + + ]: 153035 : fork_point->nChainWork > state->pindexLastCommonBlock->nChainWork ||
1425 [ + + ]: 103081 : state->pindexBestKnownBlock->GetAncestor(state->pindexLastCommonBlock->nHeight) != state->pindexLastCommonBlock) {
1426 : 50005 : state->pindexLastCommonBlock = fork_point;
1427 : : }
1428 [ + + ]: 153035 : if (state->pindexLastCommonBlock == state->pindexBestKnownBlock)
1429 : : return;
1430 : :
1431 : 44877 : const CBlockIndex *pindexWalk = state->pindexLastCommonBlock;
1432 : : // Never fetch further than the best block we know the peer has, or more than BLOCK_DOWNLOAD_WINDOW + 1 beyond the last
1433 : : // linked block we have in common with this peer. The +1 is so we can detect stalling, namely if we would be able to
1434 : : // download that next block if the window were 1 larger.
1435 : 44877 : int nWindowEnd = state->pindexLastCommonBlock->nHeight + BLOCK_DOWNLOAD_WINDOW;
1436 : :
1437 : 44877 : FindNextBlocks(vBlocks, peer, state, pindexWalk, count, nWindowEnd, &m_chainman.ActiveChain(), &nodeStaller);
1438 : : }
1439 : :
1440 : 1698 : void PeerManagerImpl::TryDownloadingHistoricalBlocks(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, const CBlockIndex *from_tip, const CBlockIndex* target_block)
1441 : : {
1442 [ - + ]: 1698 : Assert(from_tip);
1443 [ - + ]: 1698 : Assert(target_block);
1444 : :
1445 [ - + + + ]: 1698 : if (vBlocks.size() >= count) {
1446 : : return;
1447 : : }
1448 : :
1449 : 1103 : vBlocks.reserve(count);
1450 [ - + ]: 1103 : CNodeState *state = Assert(State(peer.m_id));
1451 : :
1452 [ + + - + ]: 1103 : if (state->pindexBestKnownBlock == nullptr || state->pindexBestKnownBlock->GetAncestor(target_block->nHeight) != target_block) {
1453 : : // This peer can't provide us the complete series of blocks leading up to the
1454 : : // assumeutxo snapshot base.
1455 : : //
1456 : : // Presumably this peer's chain has less work than our ActiveChain()'s tip, or else we
1457 : : // will eventually crash when we try to reorg to it. Let other logic
1458 : : // deal with whether we disconnect this peer.
1459 : : //
1460 : : // TODO at some point in the future, we might choose to request what blocks
1461 : : // this peer does have from the historical chain, despite it not having a
1462 : : // complete history beneath the snapshot base.
1463 : 100 : return;
1464 : : }
1465 : :
1466 [ - + ]: 1003 : FindNextBlocks(vBlocks, peer, state, from_tip, count, std::min<int>(from_tip->nHeight + BLOCK_DOWNLOAD_WINDOW, target_block->nHeight));
1467 : : }
1468 : :
1469 : 45880 : 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)
1470 : : {
1471 : 45880 : std::vector<const CBlockIndex*> vToFetch;
1472 [ + + ]: 45880 : int nMaxHeight = std::min<int>(state->pindexBestKnownBlock->nHeight, nWindowEnd + 1);
1473 : 45880 : bool is_limited_peer = IsLimitedPeer(peer);
1474 : 45880 : NodeId waitingfor = -1;
1475 [ + + ]: 114738 : while (pindexWalk->nHeight < nMaxHeight) {
1476 : : // Read up to 128 (or more, if more blocks than that are needed) successors of pindexWalk (towards
1477 : : // pindexBestKnownBlock) into vToFetch. We fetch 128, because CBlockIndex::GetAncestor may be as expensive
1478 : : // as iterating over ~100 CBlockIndex* entries anyway.
1479 [ - + + - : 118958 : int nToFetch = std::min(nMaxHeight - pindexWalk->nHeight, std::max<int>(count - vBlocks.size(), 128));
+ + ]
1480 [ + - ]: 59479 : vToFetch.resize(nToFetch);
1481 [ + - ]: 59479 : pindexWalk = state->pindexBestKnownBlock->GetAncestor(pindexWalk->nHeight + nToFetch);
1482 : 59479 : vToFetch[nToFetch - 1] = pindexWalk;
1483 [ + + ]: 6046396 : for (unsigned int i = nToFetch - 1; i > 0; i--) {
1484 : 5986917 : vToFetch[i - 1] = vToFetch[i]->pprev;
1485 : : }
1486 : :
1487 : : // Iterate over those blocks in vToFetch (in forward direction), adding the ones that
1488 : : // are not yet downloaded and not in flight to vBlocks. In the meantime, update
1489 : : // pindexLastCommonBlock as long as all ancestors are already downloaded, or if it's
1490 : : // already part of our chain (and therefore don't need it even if pruned).
1491 [ + + ]: 2571945 : for (const CBlockIndex* pindex : vToFetch) {
1492 [ + + + - ]: 2585098 : if (!pindex->IsValid(BLOCK_VALID_TREE)) {
1493 : : // We consider the chain that this peer is on invalid.
1494 : : return;
1495 : : }
1496 : :
1497 [ + + - + ]: 2548597 : if (!CanServeWitnesses(peer) && DeploymentActiveAt(*pindex, m_chainman, Consensus::DEPLOYMENT_SEGWIT)) {
1498 : : // We wouldn't download this block or its descendants from this peer.
1499 : : return;
1500 : : }
1501 : :
1502 [ + + + + : 2548434 : if (pindex->nStatus & BLOCK_HAVE_DATA || (activeChain && activeChain->Contains(pindex))) {
- + ]
1503 [ + + + + ]: 1865002 : if (activeChain && pindex->HaveNumChainTxs()) {
1504 : 9633 : state->pindexLastCommonBlock = pindex;
1505 : : }
1506 : 1865002 : continue;
1507 : : }
1508 : :
1509 : : // Is block in-flight?
1510 [ + + ]: 683432 : if (IsBlockRequested(pindex->GetBlockHash())) {
1511 [ + + ]: 636326 : if (waitingfor == -1) {
1512 : : // This is the first already-in-flight block.
1513 : 44392 : waitingfor = mapBlocksInFlight.lower_bound(pindex->GetBlockHash())->second.first;
1514 : : }
1515 : 636326 : continue;
1516 : : }
1517 : :
1518 : : // The block is not already downloaded, and not yet in flight.
1519 [ + + ]: 47106 : if (pindex->nHeight > nWindowEnd) {
1520 : : // We reached the end of the window.
1521 [ - + + + : 358 : if (vBlocks.size() == 0 && waitingfor != peer.m_id) {
+ + ]
1522 : : // We aren't able to fetch anything, but we would be if the download window was one larger.
1523 [ + - ]: 266 : if (nodeStaller) *nodeStaller = waitingfor;
1524 : : }
1525 : 358 : return;
1526 : : }
1527 : :
1528 : : // Don't request blocks that go further than what limited peers can provide
1529 [ + + + + ]: 46748 : if (is_limited_peer && (state->pindexBestKnownBlock->nHeight - pindex->nHeight >= static_cast<int>(NODE_NETWORK_LIMITED_MIN_BLOCKS) - 2 /* two blocks buffer for possible races */)) {
1530 : 8484 : continue;
1531 : : }
1532 : :
1533 [ + - ]: 38264 : vBlocks.push_back(pindex);
1534 [ - + + + ]: 38264 : if (vBlocks.size() == count) {
1535 : : return;
1536 : : }
1537 : : }
1538 : : }
1539 : 45880 : }
1540 : :
1541 : : } // namespace
1542 : :
1543 : 1638 : void PeerManagerImpl::PushNodeVersion(CNode& pnode, const Peer& peer)
1544 : : {
1545 : 1638 : uint64_t my_services;
1546 : 1638 : int64_t my_time;
1547 : 1638 : uint64_t your_services;
1548 : 1638 : CService your_addr;
1549 [ + + ]: 1638 : std::string my_user_agent;
1550 : 1638 : int my_height;
1551 : 1638 : bool my_tx_relay;
1552 [ + + ]: 1638 : if (pnode.IsPrivateBroadcastConn()) {
1553 : 10 : my_services = NODE_NONE;
1554 : 10 : my_time = 0;
1555 : 10 : your_services = NODE_NONE;
1556 [ + - ]: 20 : your_addr = CService{};
1557 [ + - ]: 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
1558 : 10 : my_height = 0;
1559 : 10 : my_tx_relay = false;
1560 : : } else {
1561 : 1628 : const CAddress& addr{pnode.addr};
1562 : 1628 : my_services = peer.m_our_services;
1563 : 1628 : my_time = count_seconds(GetTime<std::chrono::seconds>());
1564 : 1628 : your_services = addr.nServices;
1565 [ + - + + : 3256 : your_addr = addr.IsRoutable() && !IsProxy(addr) && addr.IsAddrV1Compatible() ? CService{addr} : CService{};
+ - + - +
- + + +
- ]
1566 [ + - ]: 1628 : my_user_agent = strSubVersion;
1567 : 1628 : my_height = m_best_height;
1568 : 1628 : my_tx_relay = !RejectIncomingTxs(pnode);
1569 : : }
1570 : :
1571 [ + - + - ]: 3276 : MakeAndPushMessage(
1572 : : pnode,
1573 : 1638 : NetMsgType::VERSION,
1574 : : PROTOCOL_VERSION,
1575 : : my_services,
1576 : : my_time,
1577 : : // your_services + CNetAddr::V1(your_addr) is the pre-version-31402 serialization of your_addr (without nTime)
1578 : 1638 : your_services, CNetAddr::V1(your_addr),
1579 : : // same, for a dummy address
1580 [ + - ]: 1638 : my_services, CNetAddr::V1(CService{}),
1581 [ + - ]: 1638 : pnode.GetLocalNonce(),
1582 : : my_user_agent,
1583 : : my_height,
1584 : : my_tx_relay);
1585 : :
1586 [ + - + - : 3278 : LogDebug(
+ + + - +
- + - + -
+ + - - ]
1587 : : BCLog::NET, "send version message: version=%d, blocks=%d%s, txrelay=%d, peer=%d\n",
1588 : : PROTOCOL_VERSION, my_height,
1589 : : fLogIPs ? strprintf(", them=%s", your_addr.ToStringAddrPort()) : "",
1590 : : my_tx_relay, pnode.GetId());
1591 : 1638 : }
1592 : :
1593 : 1 : void PeerManagerImpl::UpdateLastBlockAnnounceTime(NodeId node, int64_t time_in_seconds)
1594 : : {
1595 : 1 : LOCK(cs_main);
1596 : 1 : CNodeState *state = State(node);
1597 [ + - ]: 1 : if (state) state->m_last_block_announcement = time_in_seconds;
1598 : 1 : }
1599 : :
1600 : 1687 : void PeerManagerImpl::InitializeNode(const CNode& node, ServiceFlags our_services)
1601 : : {
1602 : 1687 : NodeId nodeid = node.GetId();
1603 : 1687 : {
1604 : 1687 : LOCK(cs_main); // For m_node_states
1605 [ + - ]: 1687 : m_node_states.try_emplace(m_node_states.end(), nodeid);
1606 : 0 : }
1607 [ + - ]: 5061 : WITH_LOCK(m_tx_download_mutex, m_txdownloadman.CheckIsEmpty(nodeid));
1608 : :
1609 [ + + ]: 1687 : if (NetPermissions::HasFlag(node.m_permission_flags, NetPermissionFlags::BloomFilter)) {
1610 : 4 : our_services = static_cast<ServiceFlags>(our_services | NODE_BLOOM);
1611 : : }
1612 : :
1613 : 1687 : PeerRef peer = std::make_shared<Peer>(nodeid, our_services, node.IsInboundConn());
1614 : 1687 : {
1615 [ + - ]: 1687 : LOCK(m_peer_mutex);
1616 [ + - + - ]: 1687 : m_peer_map.emplace_hint(m_peer_map.end(), nodeid, peer);
1617 [ + - ]: 1687 : }
1618 : 1687 : }
1619 : :
1620 : 13 : void PeerManagerImpl::ReattemptInitialBroadcast(CScheduler& scheduler)
1621 : : {
1622 : 13 : std::set<Txid> unbroadcast_txids = m_mempool.GetUnbroadcastTxs();
1623 : :
1624 [ + + ]: 18 : for (const auto& txid : unbroadcast_txids) {
1625 [ + - ]: 5 : CTransactionRef tx = m_mempool.get(txid);
1626 : :
1627 [ + - ]: 5 : if (tx != nullptr) {
1628 [ + - ]: 5 : InitiateTxBroadcastToAll(txid, tx->GetWitnessHash());
1629 : : } else {
1630 [ # # ]: 0 : m_mempool.RemoveUnbroadcastTx(txid, true);
1631 : : }
1632 : 5 : }
1633 : :
1634 : : // Schedule next run for 10-15 minutes in the future.
1635 : : // We add randomness on every cycle to avoid the possibility of P2P fingerprinting.
1636 : 13 : const auto delta = 10min + FastRandomContext().randrange<std::chrono::milliseconds>(5min);
1637 [ + - ]: 30 : scheduler.scheduleFromNow([&] { ReattemptInitialBroadcast(scheduler); }, delta);
1638 : 13 : }
1639 : :
1640 : 4 : void PeerManagerImpl::ReattemptPrivateBroadcast(CScheduler& scheduler)
1641 : : {
1642 : : // Remove stale transactions that are no longer relevant (e.g. already in
1643 : : // the mempool or mined) and count the remaining ones.
1644 : 4 : size_t num_for_rebroadcast{0};
1645 : 4 : const auto stale_txs = m_tx_for_private_broadcast.GetStale();
1646 [ + + ]: 4 : if (!stale_txs.empty()) {
1647 [ + - ]: 1 : LOCK(cs_main);
1648 [ + + ]: 3 : for (const auto& stale_tx : stale_txs) {
1649 [ + - ]: 2 : auto mempool_acceptable = m_chainman.ProcessTransaction(stale_tx, /*test_accept=*/true);
1650 [ + + ]: 2 : if (mempool_acceptable.m_result_type == MempoolAcceptResult::ResultType::VALID) {
1651 [ + - + - : 2 : LogDebug(BCLog::PRIVBROADCAST,
+ - + - +
- ]
1652 : : "Reattempting broadcast of stale txid=%s wtxid=%s",
1653 : : stale_tx->GetHash().ToString(), stale_tx->GetWitnessHash().ToString());
1654 : 1 : ++num_for_rebroadcast;
1655 : : } else {
1656 [ + - + - : 2 : LogInfo("[privatebroadcast] Giving up broadcast attempts for txid=%s wtxid=%s: %s",
+ - + - ]
1657 : : stale_tx->GetHash().ToString(), stale_tx->GetWitnessHash().ToString(),
1658 : : mempool_acceptable.m_state.ToString());
1659 [ + - ]: 1 : m_tx_for_private_broadcast.Remove(stale_tx);
1660 : : }
1661 : 2 : }
1662 : :
1663 : : // This could overshoot, but that is ok - we will open some private connections in vain.
1664 [ + - ]: 1 : m_connman.m_private_broadcast.NumToOpenAdd(num_for_rebroadcast);
1665 : 1 : }
1666 : :
1667 : 4 : const auto delta{2min + FastRandomContext().randrange<std::chrono::milliseconds>(1min)};
1668 [ + - ]: 5 : scheduler.scheduleFromNow([&] { ReattemptPrivateBroadcast(scheduler); }, delta);
1669 : 4 : }
1670 : :
1671 : 1686 : void PeerManagerImpl::FinalizeNode(const CNode& node)
1672 : : {
1673 : 1686 : NodeId nodeid = node.GetId();
1674 : 1686 : {
1675 : 1686 : LOCK(cs_main);
1676 : 1686 : {
1677 : : // We remove the PeerRef from g_peer_map here, but we don't always
1678 : : // destruct the Peer. Sometimes another thread is still holding a
1679 : : // PeerRef, so the refcount is >= 1. Be careful not to do any
1680 : : // processing here that assumes Peer won't be changed before it's
1681 : : // destructed.
1682 [ + - ]: 1686 : PeerRef peer = RemovePeer(nodeid);
1683 [ - + ]: 1686 : assert(peer != nullptr);
1684 [ - + ]: 1686 : m_wtxid_relay_peers -= peer->m_wtxid_relay;
1685 [ - + ]: 1686 : assert(m_wtxid_relay_peers >= 0);
1686 : 1686 : }
1687 : 1686 : CNodeState *state = State(nodeid);
1688 [ - + ]: 1686 : assert(state != nullptr);
1689 : :
1690 [ + + ]: 1686 : if (state->fSyncStarted)
1691 : 1539 : nSyncStarted--;
1692 : :
1693 [ + + ]: 1851 : for (const QueuedBlock& entry : state->vBlocksInFlight) {
1694 : 165 : auto range = mapBlocksInFlight.equal_range(entry.pindex->GetBlockHash());
1695 [ + + ]: 330 : while (range.first != range.second) {
1696 [ - + ]: 165 : auto [node_id, list_it] = range.first->second;
1697 [ - + ]: 165 : if (node_id != nodeid) {
1698 : 0 : range.first++;
1699 : : } else {
1700 : 165 : range.first = mapBlocksInFlight.erase(range.first);
1701 : : }
1702 : : }
1703 : : }
1704 : 1686 : {
1705 [ + - ]: 1686 : LOCK(m_tx_download_mutex);
1706 [ + - ]: 1686 : m_txdownloadman.DisconnectedPeer(nodeid);
1707 : 0 : }
1708 [ + + + - ]: 1686 : if (m_txreconciliation) m_txreconciliation->ForgetPeer(nodeid);
1709 : 1686 : m_num_preferred_download_peers -= state->fPreferredDownload;
1710 [ - + ]: 1686 : m_peers_downloading_from -= (!state->vBlocksInFlight.empty());
1711 [ - + ]: 1686 : assert(m_peers_downloading_from >= 0);
1712 : 1686 : m_outbound_peers_with_protect_from_disconnect -= state->m_chain_sync.m_protect;
1713 [ - + ]: 1686 : assert(m_outbound_peers_with_protect_from_disconnect >= 0);
1714 : :
1715 : 1686 : m_node_states.erase(nodeid);
1716 : :
1717 [ + + ]: 1686 : if (m_node_states.empty()) {
1718 : : // Do a consistency check after the last peer is removed.
1719 [ - + ]: 871 : assert(mapBlocksInFlight.empty());
1720 [ - + ]: 871 : assert(m_num_preferred_download_peers == 0);
1721 [ - + ]: 871 : assert(m_peers_downloading_from == 0);
1722 [ - + ]: 871 : assert(m_outbound_peers_with_protect_from_disconnect == 0);
1723 [ - + ]: 871 : assert(m_wtxid_relay_peers == 0);
1724 [ + - + - ]: 2613 : WITH_LOCK(m_tx_download_mutex, m_txdownloadman.CheckIsEmpty());
1725 : : }
1726 : 1686 : } // cs_main
1727 [ + + ]: 1686 : if (node.fSuccessfullyConnected &&
1728 [ + + + + : 1686 : !node.IsBlockOnlyConn() && !node.IsPrivateBroadcastConn() && !node.IsInboundConn()) {
+ + + + ]
1729 : : // Only change visible addrman state for full outbound peers. We don't
1730 : : // call Connected() for feeler connections since they don't have
1731 : : // fSuccessfullyConnected set. Also don't call Connected() for private broadcast
1732 : : // connections since they could leak information in addrman.
1733 : 544 : m_addrman.Connected(node.addr);
1734 : : }
1735 : 1686 : {
1736 : 1686 : LOCK(m_headers_presync_mutex);
1737 [ + - ]: 1686 : m_headers_presync_stats.erase(nodeid);
1738 : 1686 : }
1739 [ + + + + ]: 1697 : if (node.IsPrivateBroadcastConn() &&
1740 [ + + + - ]: 1687 : !m_tx_for_private_broadcast.DidNodeConfirmReception(nodeid) &&
1741 : 1 : m_tx_for_private_broadcast.HavePendingTransactions()) {
1742 : :
1743 : 1 : m_connman.m_private_broadcast.NumToOpenAdd(1);
1744 : : }
1745 [ + - ]: 1686 : LogDebug(BCLog::NET, "Cleared nodestate for peer=%d\n", nodeid);
1746 : 1686 : }
1747 : :
1748 : 1775 : bool PeerManagerImpl::HasAllDesirableServiceFlags(ServiceFlags services) const
1749 : : {
1750 : : // Shortcut for (services & GetDesirableServiceFlags(services)) == GetDesirableServiceFlags(services)
1751 : 1775 : return !(GetDesirableServiceFlags(services) & (~services));
1752 : : }
1753 : :
1754 : 1806 : ServiceFlags PeerManagerImpl::GetDesirableServiceFlags(ServiceFlags services) const
1755 : : {
1756 [ + + ]: 1806 : if (services & NODE_NETWORK_LIMITED) {
1757 : : // Limited peers are desirable when we are close to the tip.
1758 [ + + ]: 890 : if (ApproximateBestBlockDepth() < NODE_NETWORK_LIMITED_ALLOW_CONN_BLOCKS) {
1759 : 601 : return ServiceFlags(NODE_NETWORK_LIMITED | NODE_WITNESS);
1760 : : }
1761 : : }
1762 : : return ServiceFlags(NODE_NETWORK | NODE_WITNESS);
1763 : : }
1764 : :
1765 : 1077370 : PeerRef PeerManagerImpl::GetPeerRef(NodeId id) const
1766 : : {
1767 : 1077370 : LOCK(m_peer_mutex);
1768 : 1077370 : auto it = m_peer_map.find(id);
1769 [ + + + - : 2150503 : return it != m_peer_map.end() ? it->second : nullptr;
+ - ]
1770 : 1077370 : }
1771 : :
1772 : 1686 : PeerRef PeerManagerImpl::RemovePeer(NodeId id)
1773 : : {
1774 : 1686 : PeerRef ret;
1775 [ + - ]: 1686 : LOCK(m_peer_mutex);
1776 : 1686 : auto it = m_peer_map.find(id);
1777 [ + - ]: 1686 : if (it != m_peer_map.end()) {
1778 : 1686 : ret = std::move(it->second);
1779 : 1686 : m_peer_map.erase(it);
1780 : : }
1781 [ + - ]: 1686 : return ret;
1782 : 1686 : }
1783 : :
1784 : 12793 : bool PeerManagerImpl::GetNodeStateStats(NodeId nodeid, CNodeStateStats& stats) const
1785 : : {
1786 : 12793 : {
1787 : 12793 : LOCK(cs_main);
1788 : 12793 : const CNodeState* state = State(nodeid);
1789 [ + + ]: 12793 : if (state == nullptr)
1790 [ + - ]: 12 : return false;
1791 [ + + ]: 12781 : stats.nSyncHeight = state->pindexBestKnownBlock ? state->pindexBestKnownBlock->nHeight : -1;
1792 [ + + ]: 12781 : stats.nCommonHeight = state->pindexLastCommonBlock ? state->pindexLastCommonBlock->nHeight : -1;
1793 [ + + ]: 17294 : for (const QueuedBlock& queue : state->vBlocksInFlight) {
1794 [ + - ]: 4513 : if (queue.pindex)
1795 [ + - ]: 4513 : stats.vHeightInFlight.push_back(queue.pindex->nHeight);
1796 : : }
1797 : 12 : }
1798 : :
1799 : 12781 : PeerRef peer = GetPeerRef(nodeid);
1800 [ + - ]: 12781 : if (peer == nullptr) return false;
1801 [ + + ]: 12781 : stats.their_services = peer->m_their_services;
1802 [ + + ]: 12781 : stats.m_starting_height = peer->m_starting_height;
1803 : : // It is common for nodes with good ping times to suddenly become lagged,
1804 : : // due to a new block arriving or other large transfer.
1805 : : // Merely reporting pingtime might fool the caller into thinking the node was still responsive,
1806 : : // since pingtime does not update until the ping is complete, which might take a while.
1807 : : // So, if a ping is taking an unusually long time in flight,
1808 : : // the caller can immediately detect that this is happening.
1809 : 12781 : auto ping_wait{0us};
1810 [ + + + - ]: 12781 : if ((0 != peer->m_ping_nonce_sent) && (0 != peer->m_ping_start.load().count())) {
1811 : 79 : ping_wait = GetTime<std::chrono::microseconds>() - peer->m_ping_start.load();
1812 : : }
1813 : :
1814 [ + - + + ]: 12781 : if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
1815 [ + - + - ]: 24198 : stats.m_relay_txs = WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs);
1816 [ + - ]: 12099 : stats.m_fee_filter_received = tx_relay->m_fee_filter_received.load();
1817 [ + - ]: 12099 : LOCK(tx_relay->m_tx_inventory_mutex);
1818 : 12099 : stats.m_last_inv_seq = tx_relay->m_last_inv_sequence;
1819 [ + - ]: 12099 : stats.m_inv_to_send = tx_relay->m_tx_inventory_to_send.size();
1820 : 12099 : } else {
1821 : 682 : stats.m_relay_txs = false;
1822 : 682 : stats.m_fee_filter_received = 0;
1823 : 682 : stats.m_inv_to_send = 0;
1824 : : }
1825 : :
1826 : 12781 : stats.m_ping_wait = ping_wait;
1827 [ + - ]: 12781 : stats.m_addr_processed = peer->m_addr_processed.load();
1828 : 12781 : stats.m_addr_rate_limited = peer->m_addr_rate_limited.load();
1829 [ + - ]: 12781 : stats.m_addr_relay_enabled = peer->m_addr_relay_enabled.load();
1830 : 12781 : {
1831 [ + - ]: 12781 : LOCK(peer->m_headers_sync_mutex);
1832 [ + + ]: 12781 : if (peer->m_headers_sync) {
1833 : 5 : stats.presync_height = peer->m_headers_sync->GetPresyncHeight();
1834 : : }
1835 : 12781 : }
1836 : 12781 : stats.time_offset = peer->m_time_offset;
1837 : :
1838 : 12781 : return true;
1839 : 12781 : }
1840 : :
1841 : 226 : std::vector<node::TxOrphanage::OrphanInfo> PeerManagerImpl::GetOrphanTransactions()
1842 : : {
1843 : 226 : LOCK(m_tx_download_mutex);
1844 [ + - ]: 226 : return m_txdownloadman.GetOrphanTransactions();
1845 : 226 : }
1846 : :
1847 : 977 : PeerManagerInfo PeerManagerImpl::GetInfo() const
1848 : : {
1849 : 977 : return PeerManagerInfo{
1850 : 977 : .median_outbound_time_offset = m_outbound_time_offsets.Median(),
1851 : 977 : .ignores_incoming_txs = m_opts.ignore_incoming_txs,
1852 : 977 : };
1853 : : }
1854 : :
1855 : 1197 : void PeerManagerImpl::AddToCompactExtraTransactions(const CTransactionRef& tx)
1856 : : {
1857 [ + - ]: 1197 : if (m_opts.max_extra_txs <= 0)
1858 : : return;
1859 [ - + + + ]: 1197 : if (!vExtraTxnForCompact.size())
1860 : 40 : vExtraTxnForCompact.resize(m_opts.max_extra_txs);
1861 [ - + ]: 1197 : vExtraTxnForCompact[vExtraTxnForCompactIt] = std::make_pair(tx->GetWitnessHash(), tx);
1862 : 1197 : vExtraTxnForCompactIt = (vExtraTxnForCompactIt + 1) % m_opts.max_extra_txs;
1863 : : }
1864 : :
1865 : 424 : void PeerManagerImpl::Misbehaving(Peer& peer, const std::string& message)
1866 : : {
1867 : 424 : LOCK(peer.m_misbehavior_mutex);
1868 : :
1869 [ + + + - : 424 : const std::string message_prefixed = message.empty() ? "" : (": " + message);
+ - ]
1870 : 424 : peer.m_should_discourage = true;
1871 [ + - + - : 424 : LogDebug(BCLog::NET, "Misbehaving: peer=%d%s\n", peer.m_id, message_prefixed);
+ - ]
1872 : : TRACEPOINT(net, misbehaving_connection,
1873 : : peer.m_id,
1874 : : message.c_str()
1875 : 424 : );
1876 [ + - ]: 848 : }
1877 : :
1878 : 415 : void PeerManagerImpl::MaybePunishNodeForBlock(NodeId nodeid, const BlockValidationState& state,
1879 : : bool via_compact_block, const std::string& message)
1880 : : {
1881 : 415 : PeerRef peer{GetPeerRef(nodeid)};
1882 [ + + + + : 415 : switch (state.GetResult()) {
+ ]
1883 : : case BlockValidationResult::BLOCK_RESULT_UNSET:
1884 : : break;
1885 : : case BlockValidationResult::BLOCK_HEADER_LOW_WORK:
1886 : : // We didn't try to process the block because the header chain may have
1887 : : // too little work.
1888 : : break;
1889 : : // The node is providing invalid data:
1890 : 312 : case BlockValidationResult::BLOCK_CONSENSUS:
1891 : 312 : case BlockValidationResult::BLOCK_MUTATED:
1892 [ + + ]: 312 : if (!via_compact_block) {
1893 [ + - + - ]: 296 : if (peer) Misbehaving(*peer, message);
1894 : 296 : return;
1895 : : }
1896 : : break;
1897 : 76 : case BlockValidationResult::BLOCK_CACHED_INVALID:
1898 : 76 : {
1899 : : // Discourage outbound (but not inbound) peers if on an invalid chain.
1900 : : // Exempt HB compact block peers. Manual connections are always protected from discouragement.
1901 [ + - + + : 76 : if (peer && !via_compact_block && !peer->m_is_inbound) {
+ + ]
1902 [ + - ]: 46 : if (peer) Misbehaving(*peer, message);
1903 : : return;
1904 : : }
1905 : : break;
1906 : : }
1907 : 9 : case BlockValidationResult::BLOCK_INVALID_HEADER:
1908 : 9 : case BlockValidationResult::BLOCK_INVALID_PREV:
1909 [ + - + - ]: 9 : if (peer) Misbehaving(*peer, message);
1910 : : return;
1911 : : // Conflicting (but not necessarily invalid) data or different policy:
1912 : 2 : case BlockValidationResult::BLOCK_MISSING_PREV:
1913 [ + - + - ]: 2 : if (peer) Misbehaving(*peer, message);
1914 : : return;
1915 : : case BlockValidationResult::BLOCK_TIME_FUTURE:
1916 : : break;
1917 : : }
1918 [ + + ]: 62 : if (message != "") {
1919 [ + - + - : 42 : LogDebug(BCLog::NET, "peer=%d: %s\n", nodeid, message);
+ - ]
1920 : : }
1921 : 415 : }
1922 : :
1923 : 39604 : bool PeerManagerImpl::BlockRequestAllowed(const CBlockIndex* pindex)
1924 : : {
1925 : 39604 : AssertLockHeld(cs_main);
1926 [ + + ]: 39604 : if (m_chainman.ActiveChain().Contains(pindex)) return true;
1927 [ + + + - : 346 : return pindex->IsValid(BLOCK_VALID_SCRIPTS) && (m_chainman.m_best_header != nullptr) &&
+ + ]
1928 [ + + + + : 512 : (m_chainman.m_best_header->GetBlockTime() - pindex->GetBlockTime() < STALE_RELAY_AGE_LIMIT) &&
- + ]
1929 : 169 : (GetBlockProofEquivalentTime(*m_chainman.m_best_header, *pindex, *m_chainman.m_best_header, m_chainparams.GetConsensus()) < STALE_RELAY_AGE_LIMIT);
1930 : : }
1931 : :
1932 : 6 : util::Expected<void, std::string> PeerManagerImpl::FetchBlock(NodeId peer_id, const CBlockIndex& block_index)
1933 : : {
1934 [ - + ]: 6 : if (m_chainman.m_blockman.LoadingBlocks()) return util::Unexpected{"Loading blocks ..."};
1935 : :
1936 : : // Ensure this peer exists and hasn't been disconnected
1937 : 6 : PeerRef peer = GetPeerRef(peer_id);
1938 [ + + + - ]: 6 : if (peer == nullptr) return util::Unexpected{"Peer does not exist"};
1939 : :
1940 : : // Ignore pre-segwit peers
1941 [ + + + - ]: 4 : if (!CanServeWitnesses(*peer)) return util::Unexpected{"Pre-SegWit peer"};
1942 : :
1943 [ + - ]: 3 : LOCK(cs_main);
1944 : :
1945 : : // Forget about all prior requests
1946 [ + - ]: 3 : RemoveBlockRequest(block_index.GetBlockHash(), std::nullopt);
1947 : :
1948 : : // Mark block as in-flight
1949 [ + - - + : 3 : if (!BlockRequested(peer_id, block_index)) return util::Unexpected{"Already requested from this peer"};
- - ]
1950 : :
1951 : : // Construct message to request the block
1952 : 3 : const uint256& hash{block_index.GetBlockHash()};
1953 [ + - + - ]: 3 : std::vector<CInv> invs{CInv(MSG_BLOCK | MSG_WITNESS_FLAG, hash)};
1954 : :
1955 : : // Send block request message to the peer
1956 [ + - ]: 3 : bool success = m_connman.ForNode(peer_id, [this, &invs](CNode* node) {
1957 [ + - ]: 3 : this->MakeAndPushMessage(*node, NetMsgType::GETDATA, invs);
1958 : 3 : return true;
1959 : : });
1960 : :
1961 [ - + - - ]: 3 : if (!success) return util::Unexpected{"Peer not fully connected"};
1962 : :
1963 [ + - + - : 6 : LogDebug(BCLog::NET, "Requesting block %s from peer=%d\n",
+ - + - ]
1964 : : hash.ToString(), peer_id);
1965 : 3 : return {};
1966 : 12 : }
1967 : :
1968 : 1223 : std::unique_ptr<PeerManager> PeerManager::make(CConnman& connman, AddrMan& addrman,
1969 : : BanMan* banman, ChainstateManager& chainman,
1970 : : CTxMemPool& pool, node::Warnings& warnings, Options opts)
1971 : : {
1972 [ - + ]: 1223 : return std::make_unique<PeerManagerImpl>(connman, addrman, banman, chainman, pool, warnings, opts);
1973 : : }
1974 : :
1975 : 1223 : PeerManagerImpl::PeerManagerImpl(CConnman& connman, AddrMan& addrman,
1976 : : BanMan* banman, ChainstateManager& chainman,
1977 : 1223 : CTxMemPool& pool, node::Warnings& warnings, Options opts)
1978 : 1223 : : m_rng{opts.deterministic_rng},
1979 [ + - ]: 1223 : m_fee_filter_rounder{CFeeRate{DEFAULT_MIN_RELAY_TX_FEE}, m_rng},
1980 : 1223 : m_chainparams(chainman.GetParams()),
1981 : 1223 : m_connman(connman),
1982 : 1223 : m_addrman(addrman),
1983 : 1223 : m_banman(banman),
1984 : 1223 : m_chainman(chainman),
1985 : 1223 : m_mempool(pool),
1986 [ + - ]: 1223 : m_txdownloadman(node::TxDownloadOptions{pool, m_rng, opts.deterministic_rng}),
1987 [ + - ]: 1223 : m_warnings{warnings},
1988 [ + - + - : 2446 : m_opts{opts}
+ + ]
1989 : : {
1990 : : // While Erlay support is incomplete, it must be enabled explicitly via -txreconciliation.
1991 : : // This argument can go away after Erlay support is complete.
1992 [ + + ]: 1223 : if (opts.reconcile_txs) {
1993 [ + - ]: 5 : m_txreconciliation = std::make_unique<TxReconciliationTracker>(TXRECONCILIATION_VERSION);
1994 : : }
1995 [ - - - - ]: 1223 : }
1996 : :
1997 : 1021 : void PeerManagerImpl::StartScheduledTasks(CScheduler& scheduler)
1998 : : {
1999 : : // Stale tip checking and peer eviction are on two different timers, but we
2000 : : // don't want them to get out of sync due to drift in the scheduler, so we
2001 : : // combine them in one function and schedule at the quicker (peer-eviction)
2002 : : // timer.
2003 : 1021 : static_assert(EXTRA_PEER_CHECK_INTERVAL < STALE_CHECK_INTERVAL, "peer eviction timer should be less than stale tip check timer");
2004 [ + - ]: 1236 : scheduler.scheduleEvery([this] { this->CheckForStaleTipAndEvictPeers(); }, std::chrono::seconds{EXTRA_PEER_CHECK_INTERVAL});
2005 : :
2006 : : // schedule next run for 10-15 minutes in the future
2007 : 1021 : const auto delta = 10min + FastRandomContext().randrange<std::chrono::milliseconds>(5min);
2008 [ + - ]: 1030 : scheduler.scheduleFromNow([&] { ReattemptInitialBroadcast(scheduler); }, delta);
2009 : :
2010 [ + + ]: 1021 : if (m_opts.private_broadcast) {
2011 [ + - ]: 9 : scheduler.scheduleFromNow([&] { ReattemptPrivateBroadcast(scheduler); }, 0min);
2012 : : }
2013 : 1021 : }
2014 : :
2015 : 116276 : void PeerManagerImpl::ActiveTipChange(const CBlockIndex& new_tip, bool is_ibd)
2016 : : {
2017 : : // Ensure mempool mutex was released, otherwise deadlock may occur if another thread holding
2018 : : // m_tx_download_mutex waits on the mempool mutex.
2019 : 116276 : AssertLockNotHeld(m_mempool.cs);
2020 : 116276 : AssertLockNotHeld(m_tx_download_mutex);
2021 : :
2022 [ + + ]: 116276 : if (!is_ibd) {
2023 : 100800 : LOCK(m_tx_download_mutex);
2024 : : // If the chain tip has changed, previously rejected transactions might now be valid, e.g. due
2025 : : // to a timelock. Reset the rejection filters to give those transactions another chance if we
2026 : : // see them again.
2027 [ + - ]: 100800 : m_txdownloadman.ActiveTipChange();
2028 : 100800 : }
2029 : 116276 : }
2030 : :
2031 : : /**
2032 : : * Evict orphan txn pool entries based on a newly connected
2033 : : * block, remember the recently confirmed transactions, and delete tracked
2034 : : * announcements for them. Also save the time of the last tip update and
2035 : : * possibly reduce dynamic block stalling timeout.
2036 : : */
2037 : 124883 : void PeerManagerImpl::BlockConnected(
2038 : : const ChainstateRole& role,
2039 : : const std::shared_ptr<const CBlock>& pblock,
2040 : : const CBlockIndex* pindex)
2041 : : {
2042 : : // Update this for all chainstate roles so that we don't mistakenly see peers
2043 : : // helping us do background IBD as having a stale tip.
2044 : 124883 : m_last_tip_update = GetTime<std::chrono::seconds>();
2045 : :
2046 : : // In case the dynamic timeout was doubled once or more, reduce it slowly back to its default value
2047 [ + + ]: 124883 : auto stalling_timeout = m_block_stalling_timeout.load();
2048 [ + + ]: 124883 : Assume(stalling_timeout >= BLOCK_STALLING_TIMEOUT_DEFAULT);
2049 [ + + ]: 124883 : if (stalling_timeout != BLOCK_STALLING_TIMEOUT_DEFAULT) {
2050 : 16 : const auto new_timeout = std::max(std::chrono::duration_cast<std::chrono::seconds>(stalling_timeout * 0.85), BLOCK_STALLING_TIMEOUT_DEFAULT);
2051 [ + - ]: 16 : if (m_block_stalling_timeout.compare_exchange_strong(stalling_timeout, new_timeout)) {
2052 [ + - ]: 16 : LogDebug(BCLog::NET, "Decreased stalling timeout to %d seconds\n", count_seconds(new_timeout));
2053 : : }
2054 : : }
2055 : :
2056 : : // The following task can be skipped since we don't maintain a mempool for
2057 : : // the historical chainstate.
2058 [ + + ]: 124883 : if (role.historical) {
2059 : : return;
2060 : : }
2061 : 123984 : LOCK(m_tx_download_mutex);
2062 [ + - ]: 123984 : m_txdownloadman.BlockConnected(pblock);
2063 : 123984 : }
2064 : :
2065 : 13694 : void PeerManagerImpl::BlockDisconnected(const std::shared_ptr<const CBlock> &block, const CBlockIndex* pindex)
2066 : : {
2067 : 13694 : LOCK(m_tx_download_mutex);
2068 [ + - ]: 13694 : m_txdownloadman.BlockDisconnected();
2069 : 13694 : }
2070 : :
2071 : : /**
2072 : : * Maintain state about the best-seen block and fast-announce a compact block
2073 : : * to compatible peers.
2074 : : */
2075 : 97901 : void PeerManagerImpl::NewPoWValidBlock(const CBlockIndex *pindex, const std::shared_ptr<const CBlock>& pblock)
2076 : : {
2077 [ + - ]: 97901 : auto pcmpctblock = std::make_shared<const CBlockHeaderAndShortTxIDs>(*pblock, FastRandomContext().rand64());
2078 : :
2079 [ + - ]: 97901 : LOCK(cs_main);
2080 : :
2081 [ + + ]: 97901 : if (pindex->nHeight <= m_highest_fast_announce)
2082 : : return;
2083 : 94222 : m_highest_fast_announce = pindex->nHeight;
2084 : :
2085 [ + + ]: 94222 : if (!DeploymentActiveAt(*pindex, m_chainman, Consensus::DEPLOYMENT_SEGWIT)) return;
2086 : :
2087 [ + - ]: 92902 : uint256 hashBlock(pblock->GetHash());
2088 : 92902 : const std::shared_future<CSerializedNetMsg> lazy_ser{
2089 [ + - + - : 119188 : std::async(std::launch::deferred, [&] { return NetMsg::Make(NetMsgType::CMPCTBLOCK, *pcmpctblock); })};
+ - ]
2090 : :
2091 : 92902 : {
2092 [ + - ]: 92902 : auto most_recent_block_txs = std::make_unique<std::map<GenTxid, CTransactionRef>>();
2093 [ + + ]: 215731 : for (const auto& tx : pblock->vtx) {
2094 [ + - ]: 122829 : most_recent_block_txs->emplace(tx->GetHash(), tx);
2095 [ + - ]: 122829 : most_recent_block_txs->emplace(tx->GetWitnessHash(), tx);
2096 : : }
2097 : :
2098 [ + - ]: 92902 : LOCK(m_most_recent_block_mutex);
2099 : 92902 : m_most_recent_block_hash = hashBlock;
2100 : 92902 : m_most_recent_block = pblock;
2101 : 92902 : m_most_recent_compact_block = pcmpctblock;
2102 [ + - ]: 92902 : m_most_recent_block_txs = std::move(most_recent_block_txs);
2103 : 92902 : }
2104 : :
2105 [ + - + - : 185804 : m_connman.ForEachNode([this, pindex, &lazy_ser, &hashBlock](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
+ - ]
2106 : 84552 : AssertLockHeld(::cs_main);
2107 : :
2108 [ + - - + ]: 84552 : if (pnode->GetCommonVersion() < INVALID_CB_NO_BAN_VERSION || pnode->fDisconnect)
2109 : 0 : return;
2110 : 84552 : ProcessBlockAvailability(pnode->GetId());
2111 : 84552 : CNodeState &state = *State(pnode->GetId());
2112 : : // If the peer has, or we announced to them the previous block already,
2113 : : // but we don't think they have this one, go ahead and announce it
2114 [ + + + + : 84552 : if (state.m_requested_hb_cmpctblocks && !PeerHasHeader(&state, pindex) && PeerHasHeader(&state, pindex->pprev)) {
+ + ]
2115 : :
2116 [ + - + - ]: 34146 : LogDebug(BCLog::NET, "%s sending header-and-ids %s to peer=%d\n", "PeerManager::NewPoWValidBlock",
2117 : : hashBlock.ToString(), pnode->GetId());
2118 : :
2119 : 17073 : const CSerializedNetMsg& ser_cmpctblock{lazy_ser.get()};
2120 [ + - ]: 17073 : PushMessage(*pnode, ser_cmpctblock.Copy());
2121 : 17073 : state.pindexBestHeaderSent = pindex;
2122 : : }
2123 : : });
2124 [ + - + - : 288704 : }
+ - ]
2125 : :
2126 : : /**
2127 : : * Update our best height and announce any block hashes which weren't previously
2128 : : * in m_chainman.ActiveChain() to our peers.
2129 : : */
2130 : 113427 : void PeerManagerImpl::UpdatedBlockTip(const CBlockIndex *pindexNew, const CBlockIndex *pindexFork, bool fInitialDownload)
2131 : : {
2132 : 113427 : SetBestBlock(pindexNew->nHeight, std::chrono::seconds{pindexNew->GetBlockTime()});
2133 : :
2134 : : // Don't relay inventory during initial block download.
2135 [ + + ]: 113427 : if (fInitialDownload) return;
2136 : :
2137 : : // Find the hashes of all blocks that weren't previously in the best chain.
2138 : 97957 : std::vector<uint256> vHashes;
2139 : 97957 : const CBlockIndex *pindexToAnnounce = pindexNew;
2140 [ + + ]: 196758 : while (pindexToAnnounce != pindexFork) {
2141 [ + - ]: 98902 : vHashes.push_back(pindexToAnnounce->GetBlockHash());
2142 : 98902 : pindexToAnnounce = pindexToAnnounce->pprev;
2143 [ - + + + ]: 98902 : if (vHashes.size() == MAX_BLOCKS_TO_ANNOUNCE) {
2144 : : // Limit announcements in case of a huge reorganization.
2145 : : // Rely on the peer's synchronization mechanism in that case.
2146 : : break;
2147 : : }
2148 : : }
2149 : :
2150 : 97957 : {
2151 [ + - ]: 97957 : LOCK(m_peer_mutex);
2152 [ + + ]: 189018 : for (auto& it : m_peer_map) {
2153 [ + - ]: 91061 : Peer& peer = *it.second;
2154 [ + - ]: 91061 : LOCK(peer.m_block_inv_mutex);
2155 [ + + ]: 183218 : for (const uint256& hash : vHashes | std::views::reverse) {
2156 [ + - ]: 92157 : peer.m_blocks_for_headers_relay.push_back(hash);
2157 : : }
2158 : 91061 : }
2159 : 0 : }
2160 : :
2161 [ + - ]: 97957 : m_connman.WakeMessageHandler();
2162 : 97957 : }
2163 : :
2164 : : /**
2165 : : * Handle invalid block rejection and consequent peer discouragement, maintain which
2166 : : * peers announce compact blocks.
2167 : : */
2168 : 127723 : void PeerManagerImpl::BlockChecked(const std::shared_ptr<const CBlock>& block, const BlockValidationState& state)
2169 : : {
2170 : 127723 : LOCK(cs_main);
2171 : :
2172 [ + - ]: 127723 : const uint256 hash(block->GetHash());
2173 : 127723 : std::map<uint256, std::pair<NodeId, bool>>::iterator it = mapBlockSource.find(hash);
2174 : :
2175 : : // If the block failed validation, we know where it came from and we're still connected
2176 : : // to that peer, maybe punish.
2177 [ + + + + ]: 127723 : if (state.IsInvalid() &&
2178 [ + + + + : 128047 : it != mapBlockSource.end() &&
+ - ]
2179 : 324 : State(it->second.first)) {
2180 [ + - + - ]: 324 : MaybePunishNodeForBlock(/*nodeid=*/ it->second.first, state, /*via_compact_block=*/ !it->second.second);
2181 : : }
2182 : : // Check that:
2183 : : // 1. The block is valid
2184 : : // 2. We're not in initial block download
2185 : : // 3. This is currently the best block we're aware of. We haven't updated
2186 : : // the tip yet so we have no way to check this directly here. Instead we
2187 : : // just check that there are currently no other blocks in flight.
2188 [ + + ]: 124883 : else if (state.IsValid() &&
2189 [ + + + - : 235806 : !m_chainman.IsInitialBlockDownload() &&
+ + ]
2190 [ + + ]: 108407 : mapBlocksInFlight.count(hash) == mapBlocksInFlight.size()) {
2191 [ + + ]: 82059 : if (it != mapBlockSource.end()) {
2192 [ + - ]: 21351 : MaybeSetPeerAsAnnouncingHeaderAndIDs(it->second.first);
2193 : : }
2194 : : }
2195 [ + + ]: 127723 : if (it != mapBlockSource.end())
2196 : 57926 : mapBlockSource.erase(it);
2197 : 127723 : }
2198 : :
2199 : : //////////////////////////////////////////////////////////////////////////////
2200 : : //
2201 : : // Messages
2202 : : //
2203 : :
2204 : 721 : bool PeerManagerImpl::AlreadyHaveBlock(const uint256& block_hash)
2205 : : {
2206 : 721 : return m_chainman.m_blockman.LookupBlockIndex(block_hash) != nullptr;
2207 : : }
2208 : :
2209 : 3 : void PeerManagerImpl::SendPings()
2210 : : {
2211 : 3 : LOCK(m_peer_mutex);
2212 [ + + ]: 8 : for(auto& it : m_peer_map) it.second->m_ping_queued = true;
2213 : 3 : }
2214 : :
2215 : 32226 : void PeerManagerImpl::InitiateTxBroadcastToAll(const Txid& txid, const Wtxid& wtxid)
2216 : : {
2217 : 32226 : LOCK(m_peer_mutex);
2218 [ + + ]: 84665 : for(auto& it : m_peer_map) {
2219 [ + - ]: 52439 : Peer& peer = *it.second;
2220 [ + - ]: 52439 : auto tx_relay = peer.GetTxRelay();
2221 [ + + ]: 52439 : if (!tx_relay) continue;
2222 : :
2223 [ + - ]: 52432 : LOCK(tx_relay->m_tx_inventory_mutex);
2224 : : // Only queue transactions for announcement once the version handshake
2225 : : // is completed. The time of arrival for these transactions is
2226 : : // otherwise at risk of leaking to a spy, if the spy is able to
2227 : : // distinguish transactions received during the handshake from the rest
2228 : : // in the announcement.
2229 [ + + + - ]: 52432 : if (tx_relay->m_next_inv_send_time == 0s) continue;
2230 : :
2231 [ + + ]: 52431 : const uint256& hash{peer.m_wtxid_relay ? wtxid.ToUint256() : txid.ToUint256()};
2232 [ + - + + ]: 52431 : if (!tx_relay->m_tx_inventory_known_filter.contains(hash)) {
2233 [ + - ]: 21521 : tx_relay->m_tx_inventory_to_send.insert(wtxid);
2234 : : }
2235 : 52432 : }
2236 : 32226 : }
2237 : :
2238 : 6 : void PeerManagerImpl::InitiateTxBroadcastPrivate(const CTransactionRef& tx)
2239 : : {
2240 [ + - + - ]: 12 : const auto txstr{strprintf("txid=%s, wtxid=%s", tx->GetHash().ToString(), tx->GetWitnessHash().ToString())};
2241 [ + - + + ]: 6 : if (m_tx_for_private_broadcast.Add(tx)) {
2242 [ + - + - : 5 : LogDebug(BCLog::PRIVBROADCAST, "Requesting %d new connections due to %s", NUM_PRIVATE_BROADCAST_PER_TX, txstr);
+ - ]
2243 [ + - ]: 5 : m_connman.m_private_broadcast.NumToOpenAdd(NUM_PRIVATE_BROADCAST_PER_TX);
2244 : : } else {
2245 [ + - + - : 6 : LogDebug(BCLog::PRIVBROADCAST, "Ignoring unnecessary request to schedule an already scheduled transaction: %s", txstr);
+ - ]
2246 : : }
2247 : 6 : }
2248 : :
2249 : 53 : void PeerManagerImpl::RelayAddress(NodeId originator,
2250 : : const CAddress& addr,
2251 : : bool fReachable)
2252 : : {
2253 : : // We choose the same nodes within a given 24h window (if the list of connected
2254 : : // nodes does not change) and we don't relay to nodes that already know an
2255 : : // address. So within 24h we will likely relay a given address once. This is to
2256 : : // prevent a peer from unjustly giving their address better propagation by sending
2257 : : // it to us repeatedly.
2258 : :
2259 [ + + + - ]: 53 : if (!fReachable && !addr.IsRelayable()) return;
2260 : :
2261 : : // Relay to a limited number of other nodes
2262 : : // Use deterministic randomness to send to the same nodes for 24 hours
2263 : : // at a time so the m_addr_knowns of the chosen nodes prevent repeats
2264 : 53 : const uint64_t hash_addr{CServiceHash(0, 0)(addr)};
2265 : 53 : const auto current_time{GetTime<std::chrono::seconds>()};
2266 : : // Adding address hash makes exact rotation time different per address, while preserving periodicity.
2267 : 53 : const uint64_t time_addr{(static_cast<uint64_t>(count_seconds(current_time)) + hash_addr) / count_seconds(ROTATE_ADDR_RELAY_DEST_INTERVAL)};
2268 : 53 : const CSipHasher hasher{m_connman.GetDeterministicRandomizer(RANDOMIZER_ID_ADDRESS_RELAY)
2269 : 53 : .Write(hash_addr)
2270 : 53 : .Write(time_addr)};
2271 : :
2272 : : // Relay reachable addresses to 2 peers. Unreachable addresses are relayed randomly to 1 or 2 peers.
2273 [ + + + - ]: 53 : unsigned int nRelayNodes = (fReachable || (hasher.Finalize() & 1)) ? 2 : 1;
2274 : :
2275 : 53 : std::array<std::pair<uint64_t, Peer*>, 2> best{{{0, nullptr}, {0, nullptr}}};
2276 [ - + ]: 53 : assert(nRelayNodes <= best.size());
2277 : :
2278 : 53 : LOCK(m_peer_mutex);
2279 : :
2280 [ + + + + ]: 622 : for (auto& [id, peer] : m_peer_map) {
2281 [ + + + + : 569 : if (peer->m_addr_relay_enabled && id != originator && IsAddrCompatible(*peer, addr)) {
+ - + - ]
2282 [ + - + - ]: 512 : uint64_t hashKey = CSipHasher(hasher).Write(id).Finalize();
2283 [ + + ]: 1210 : for (unsigned int i = 0; i < nRelayNodes; i++) {
2284 [ + + ]: 909 : if (hashKey > best[i].first) {
2285 : 211 : std::copy(best.begin() + i, best.begin() + nRelayNodes - 1, best.begin() + i + 1);
2286 : 211 : best[i] = std::make_pair(hashKey, peer.get());
2287 : 211 : break;
2288 : : }
2289 : : }
2290 : : }
2291 : : };
2292 : :
2293 [ + + + + ]: 135 : for (unsigned int i = 0; i < nRelayNodes && best[i].first != 0; i++) {
2294 [ + - ]: 82 : PushAddress(*best[i].second, addr);
2295 : : }
2296 : 53 : }
2297 : :
2298 : 39588 : void PeerManagerImpl::ProcessGetBlockData(CNode& pfrom, Peer& peer, const CInv& inv)
2299 : : {
2300 : 39588 : std::shared_ptr<const CBlock> a_recent_block;
2301 : 39588 : std::shared_ptr<const CBlockHeaderAndShortTxIDs> a_recent_compact_block;
2302 : 39588 : {
2303 [ + - ]: 39588 : LOCK(m_most_recent_block_mutex);
2304 : 39588 : a_recent_block = m_most_recent_block;
2305 [ + - ]: 39588 : a_recent_compact_block = m_most_recent_compact_block;
2306 : 39588 : }
2307 : :
2308 : 39588 : bool need_activate_chain = false;
2309 : 39588 : {
2310 [ + - ]: 39588 : LOCK(cs_main);
2311 [ + - ]: 39588 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(inv.hash);
2312 [ + - ]: 39588 : if (pindex) {
2313 [ + - + + : 79176 : if (pindex->HaveNumChainTxs() && !pindex->IsValid(BLOCK_VALID_SCRIPTS) &&
+ + ]
2314 [ - + + - ]: 39588 : pindex->IsValid(BLOCK_VALID_TREE)) {
2315 : : // If we have the block and all of its parents, but have not yet validated it,
2316 : : // we might be in the middle of connecting it (ie in the unlock of cs_main
2317 : : // before ActivateBestChain but after AcceptBlock).
2318 : : // In this case, we need to run ActivateBestChain prior to checking the relay
2319 : : // conditions below.
2320 : : need_activate_chain = true;
2321 : : }
2322 : : }
2323 : 0 : } // release cs_main before calling ActivateBestChain
2324 [ + + ]: 39588 : if (need_activate_chain) {
2325 [ + - ]: 22 : BlockValidationState state;
2326 [ + - + - : 66 : if (!m_chainman.ActiveChainstate().ActivateBestChain(state, a_recent_block)) {
+ - + - -
+ ]
2327 [ # # # # : 0 : LogDebug(BCLog::NET, "failed to activate chain (%s)\n", state.ToString());
# # # # ]
2328 : : }
2329 : 22 : }
2330 : :
2331 : 39588 : const CBlockIndex* pindex{nullptr};
2332 : 39588 : const CBlockIndex* tip{nullptr};
2333 : 39588 : bool can_direct_fetch{false};
2334 : 39588 : FlatFilePos block_pos{};
2335 : 39588 : {
2336 [ + - ]: 39588 : LOCK(cs_main);
2337 [ + - ]: 39588 : pindex = m_chainman.m_blockman.LookupBlockIndex(inv.hash);
2338 [ + - ]: 39588 : if (!pindex) {
2339 : : return;
2340 : : }
2341 [ + - + + ]: 39588 : if (!BlockRequestAllowed(pindex)) {
2342 [ + - + - : 4 : LogDebug(BCLog::NET, "%s: ignoring request from peer=%i for old block that isn't in the main chain\n", __func__, pfrom.GetId());
+ - ]
2343 : 4 : return;
2344 : : }
2345 : : // disconnect node in case we have reached the outbound limit for serving historical blocks
2346 [ + - ]: 39584 : if (m_connman.OutboundTargetReached(true) &&
2347 [ + + + - : 39584 : (((m_chainman.m_best_header != nullptr) && (m_chainman.m_best_header->GetBlockTime() - pindex->GetBlockTime() > HISTORICAL_BLOCK_AGE)) || inv.IsMsgFilteredBlk()) &&
+ + - + ]
2348 [ + + ]: 3 : !pfrom.HasPermission(NetPermissionFlags::Download) // nodes with the download permission may exceed target
2349 : : ) {
2350 [ + - + - : 4 : LogDebug(BCLog::NET, "historical block serving limit reached, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
2351 : 2 : pfrom.fDisconnect = true;
2352 : 2 : return;
2353 : : }
2354 [ + - - + ]: 39582 : tip = m_chainman.ActiveChain().Tip();
2355 : : // Avoid leaking prune-height by never sending blocks below the NODE_NETWORK_LIMITED threshold
2356 [ + + ]: 39582 : if (!pfrom.HasPermission(NetPermissionFlags::NoBan) && (
2357 [ + - + + : 38118 : (((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 */) )
+ + ]
2358 : : )) {
2359 [ + - + - : 8 : LogDebug(BCLog::NET, "Ignore block request below NODE_NETWORK_LIMITED threshold, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
2360 : : //disconnect node and prevent it from stalling (would otherwise wait for the missing block)
2361 : 4 : pfrom.fDisconnect = true;
2362 : 4 : return;
2363 : : }
2364 : : // Pruned nodes may have deleted the block, so check whether
2365 : : // it's available before trying to send.
2366 [ + - ]: 39578 : if (!(pindex->nStatus & BLOCK_HAVE_DATA)) {
2367 : : return;
2368 : : }
2369 [ + - ]: 39578 : can_direct_fetch = CanDirectFetch();
2370 [ + - ]: 39578 : block_pos = pindex->GetBlockPos();
2371 : 10 : }
2372 : :
2373 : 39578 : std::shared_ptr<const CBlock> pblock;
2374 [ + + + - : 39578 : if (a_recent_block && a_recent_block->GetHash() == inv.hash) {
+ + ]
2375 : 2010 : pblock = a_recent_block;
2376 [ + + ]: 37568 : } else if (inv.IsMsgWitnessBlk()) {
2377 : : // Fast-path: in this case it is possible to serve the block directly from disk,
2378 : : // as the network format matches the format on disk
2379 [ + - + - ]: 32258 : if (const auto block_data{m_chainman.m_blockman.ReadRawBlock(block_pos)}) {
2380 [ - + + - : 64516 : MakeAndPushMessage(pfrom, NetMsgType::BLOCK, std::span{*block_data});
+ - ]
2381 : : } else {
2382 [ # # # # : 0 : if (WITH_LOCK(m_chainman.GetMutex(), return m_chainman.m_blockman.IsBlockPruned(*pindex))) {
# # # # ]
2383 [ # # # # : 0 : LogDebug(BCLog::NET, "Block was pruned before it could be read, %s\n", pfrom.DisconnectMsg(fLogIPs));
# # # # ]
2384 : : } else {
2385 [ # # # # ]: 0 : LogError("Cannot load block from disk, %s\n", pfrom.DisconnectMsg(fLogIPs));
2386 : : }
2387 : 0 : pfrom.fDisconnect = true;
2388 : 0 : return;
2389 : 32258 : }
2390 : : // Don't set pblock as we've sent the block
2391 : : } else {
2392 : : // Send block from disk
2393 [ + - ]: 5310 : std::shared_ptr<CBlock> pblockRead = std::make_shared<CBlock>();
2394 [ + - - + ]: 5310 : if (!m_chainman.m_blockman.ReadBlock(*pblockRead, block_pos, inv.hash)) {
2395 [ # # # # : 0 : if (WITH_LOCK(m_chainman.GetMutex(), return m_chainman.m_blockman.IsBlockPruned(*pindex))) {
# # # # ]
2396 [ # # # # : 0 : LogDebug(BCLog::NET, "Block was pruned before it could be read, %s\n", pfrom.DisconnectMsg(fLogIPs));
# # # # ]
2397 : : } else {
2398 [ # # # # ]: 0 : LogError("Cannot load block from disk, %s\n", pfrom.DisconnectMsg(fLogIPs));
2399 : : }
2400 [ # # ]: 0 : pfrom.fDisconnect = true;
2401 [ # # ]: 0 : return;
2402 : : }
2403 [ + - ]: 5310 : pblock = pblockRead;
2404 : 5310 : }
2405 [ + + ]: 39578 : if (pblock) {
2406 [ + + ]: 7320 : if (inv.IsMsgBlk()) {
2407 [ + - + - ]: 13088 : MakeAndPushMessage(pfrom, NetMsgType::BLOCK, TX_NO_WITNESS(*pblock));
2408 [ + + ]: 776 : } else if (inv.IsMsgWitnessBlk()) {
2409 [ + - + - ]: 902 : MakeAndPushMessage(pfrom, NetMsgType::BLOCK, TX_WITH_WITNESS(*pblock));
2410 [ + + ]: 325 : } else if (inv.IsMsgFilteredBlk()) {
2411 : 7 : bool sendMerkleBlock = false;
2412 [ + - ]: 7 : CMerkleBlock merkleBlock;
2413 [ + - + - ]: 7 : if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
2414 [ + - ]: 7 : LOCK(tx_relay->m_bloom_filter_mutex);
2415 [ + + ]: 7 : if (tx_relay->m_bloom_filter) {
2416 : 4 : sendMerkleBlock = true;
2417 [ + - ]: 4 : merkleBlock = CMerkleBlock(*pblock, *tx_relay->m_bloom_filter);
2418 : : }
2419 : 0 : }
2420 [ + + ]: 7 : if (sendMerkleBlock) {
2421 [ + - + - ]: 4 : MakeAndPushMessage(pfrom, NetMsgType::MERKLEBLOCK, merkleBlock);
2422 : : // CMerkleBlock just contains hashes, so also push any transactions in the block the client did not see
2423 : : // This avoids hurting performance by pointlessly requiring a round-trip
2424 : : // Note that there is currently no way for a node to request any single transactions we didn't send here -
2425 : : // they must either disconnect and retry or request the full block.
2426 : : // Thus, the protocol spec specified allows for us to provide duplicate txn here,
2427 : : // however we MUST always provide at least what the remote peer needs
2428 [ + - + + ]: 6 : for (const auto& [tx_idx, _] : merkleBlock.vMatchedTxn)
2429 [ + - + - ]: 4 : MakeAndPushMessage(pfrom, NetMsgType::TX, TX_NO_WITNESS(*pblock->vtx[tx_idx]));
2430 : : }
2431 : : // else
2432 : : // no response
2433 [ + - ]: 325 : } else if (inv.IsMsgCmpctBlk()) {
2434 : : // If a peer is asking for old blocks, we're almost guaranteed
2435 : : // they won't have a useful mempool to match against a compact block,
2436 : : // and we don't feel like constructing the object for them, so
2437 : : // instead we respond with the full, non-compact block.
2438 [ + - + + ]: 318 : if (can_direct_fetch && pindex->nHeight >= tip->nHeight - MAX_CMPCTBLOCK_DEPTH) {
2439 [ + + + - : 300 : if (a_recent_compact_block && a_recent_compact_block->header.GetHash() == inv.hash) {
+ + ]
2440 [ + - + - ]: 400 : MakeAndPushMessage(pfrom, NetMsgType::CMPCTBLOCK, *a_recent_compact_block);
2441 : : } else {
2442 [ + - ]: 100 : CBlockHeaderAndShortTxIDs cmpctblock{*pblock, m_rng.rand64()};
2443 [ + - + - ]: 200 : MakeAndPushMessage(pfrom, NetMsgType::CMPCTBLOCK, cmpctblock);
2444 : 100 : }
2445 : : } else {
2446 [ + - + - ]: 36 : MakeAndPushMessage(pfrom, NetMsgType::BLOCK, TX_WITH_WITNESS(*pblock));
2447 : : }
2448 : : }
2449 : : }
2450 : :
2451 : 39578 : {
2452 [ + - ]: 39578 : LOCK(peer.m_block_inv_mutex);
2453 : : // Trigger the peer node to send a getblocks request for the next batch of inventory
2454 [ - + ]: 39578 : if (inv.hash == peer.m_continuation_block) {
2455 : : // Send immediately. This must send even if redundant,
2456 : : // and we want it right after the last block so they don't
2457 : : // wait for other stuff first.
2458 : 0 : std::vector<CInv> vInv;
2459 [ # # ]: 0 : vInv.emplace_back(MSG_BLOCK, tip->GetBlockHash());
2460 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::INV, vInv);
2461 : 0 : peer.m_continuation_block.SetNull();
2462 : 0 : }
2463 [ + + ]: 39578 : }
2464 [ + + + + : 114942 : }
+ - ]
2465 : :
2466 : 12393 : CTransactionRef PeerManagerImpl::FindTxForGetData(const Peer::TxRelay& tx_relay, const GenTxid& gtxid)
2467 : : {
2468 : : // If a tx was in the mempool prior to the last INV for this peer, permit the request.
2469 : 12393 : auto txinfo{std::visit(
2470 : 24786 : [&](const auto& id) {
2471 [ + - ]: 24786 : return m_mempool.info_for_relay(id, WITH_LOCK(tx_relay.m_tx_inventory_mutex, return tx_relay.m_last_inv_sequence));
2472 : : },
2473 : 12393 : gtxid)};
2474 [ + + ]: 12393 : if (txinfo.tx) {
2475 : 12374 : return std::move(txinfo.tx);
2476 : : }
2477 : :
2478 : : // Or it might be from the most recent block
2479 : 19 : {
2480 [ + - ]: 19 : LOCK(m_most_recent_block_mutex);
2481 [ + - ]: 19 : if (m_most_recent_block_txs != nullptr) {
2482 : 19 : auto it = m_most_recent_block_txs->find(gtxid);
2483 [ + + + - : 22 : if (it != m_most_recent_block_txs->end()) return it->second;
+ - ]
2484 : : }
2485 : 3 : }
2486 : :
2487 : 16 : return {};
2488 : 12393 : }
2489 : :
2490 : 45517 : void PeerManagerImpl::ProcessGetData(CNode& pfrom, Peer& peer, const std::atomic<bool>& interruptMsgProc)
2491 : : {
2492 : 45517 : AssertLockNotHeld(cs_main);
2493 : :
2494 : 45517 : auto tx_relay = peer.GetTxRelay();
2495 : :
2496 : 45517 : std::deque<CInv>::iterator it = peer.m_getdata_requests.begin();
2497 : 45517 : std::vector<CInv> vNotFound;
2498 : :
2499 : : // Process as many TX items from the front of the getdata queue as
2500 : : // possible, since they're common and it's efficient to batch process
2501 : : // them.
2502 [ + + + + ]: 57910 : while (it != peer.m_getdata_requests.end() && it->IsGenTxMsg()) {
2503 [ - + ]: 12393 : if (interruptMsgProc) return;
2504 : : // The send buffer provides backpressure. If there's no space in
2505 : : // the buffer, pause processing until the next call.
2506 [ + - ]: 12393 : if (pfrom.fPauseSend) break;
2507 : :
2508 : 12393 : const CInv &inv = *it++;
2509 : :
2510 [ - + ]: 12393 : if (tx_relay == nullptr) {
2511 : : // Ignore GETDATA requests for transactions from block-relay-only
2512 : : // peers and peers that asked us not to announce transactions.
2513 : 0 : continue;
2514 : : }
2515 : :
2516 [ + - + - : 12393 : if (auto tx{FindTxForGetData(*tx_relay, ToGenTxid(inv))}) {
+ + ]
2517 : : // WTX and WITNESS_TX imply we serialize with witness
2518 [ - + ]: 12377 : const auto maybe_with_witness = (inv.IsMsgTx() ? TX_NO_WITNESS : TX_WITH_WITNESS);
2519 [ + - + - ]: 12377 : MakeAndPushMessage(pfrom, NetMsgType::TX, maybe_with_witness(*tx));
2520 [ + - ]: 12377 : m_mempool.RemoveUnbroadcastTx(tx->GetHash());
2521 : : } else {
2522 [ + - ]: 16 : vNotFound.push_back(inv);
2523 : 12393 : }
2524 : : }
2525 : :
2526 : : // Only process one BLOCK item per call, since they're uncommon and can be
2527 : : // expensive to process.
2528 [ + + + + ]: 45517 : if (it != peer.m_getdata_requests.end() && !pfrom.fPauseSend) {
2529 : 39589 : const CInv &inv = *it++;
2530 [ + + ]: 39589 : if (inv.IsGenBlkMsg()) {
2531 [ + - ]: 39588 : ProcessGetBlockData(pfrom, peer, inv);
2532 : : }
2533 : : // else: If the first item on the queue is an unknown type, we erase it
2534 : : // and continue processing the queue on the next call.
2535 : : // NOTE: previously we wouldn't do so and the peer sending us a malformed GETDATA could
2536 : : // result in never making progress and this thread using 100% allocated CPU. See
2537 : : // https://bitcoincore.org/en/2024/07/03/disclose-getdata-cpu.
2538 : : }
2539 : :
2540 : 45517 : peer.m_getdata_requests.erase(peer.m_getdata_requests.begin(), it);
2541 : :
2542 [ + + ]: 45517 : if (!vNotFound.empty()) {
2543 : : // Let the peer know that we didn't find what it asked for, so it doesn't
2544 : : // have to wait around forever.
2545 : : // SPV clients care about this message: it's needed when they are
2546 : : // recursively walking the dependencies of relevant unconfirmed
2547 : : // transactions. SPV clients want to do that because they want to know
2548 : : // about (and store and rebroadcast and risk analyze) the dependencies
2549 : : // of transactions relevant to them, without having to download the
2550 : : // entire memory pool.
2551 : : // Also, other nodes can use these messages to automatically request a
2552 : : // transaction from some other peer that announced it, and stop
2553 : : // waiting for us to respond.
2554 : : // In normal operation, we often send NOTFOUND messages for parents of
2555 : : // transactions that we relay; if a peer is missing a parent, they may
2556 : : // assume we have them and request the parents from us.
2557 [ + - + - ]: 26 : MakeAndPushMessage(pfrom, NetMsgType::NOTFOUND, vNotFound);
2558 : : }
2559 : 45517 : }
2560 : :
2561 : 41303 : uint32_t PeerManagerImpl::GetFetchFlags(const Peer& peer) const
2562 : : {
2563 : 41303 : uint32_t nFetchFlags = 0;
2564 [ + + ]: 41303 : if (CanServeWitnesses(peer)) {
2565 : 41300 : nFetchFlags |= MSG_WITNESS_FLAG;
2566 : : }
2567 : 41303 : return nFetchFlags;
2568 : : }
2569 : :
2570 : 587 : void PeerManagerImpl::SendBlockTransactions(CNode& pfrom, Peer& peer, const CBlock& block, const BlockTransactionsRequest& req)
2571 : : {
2572 : 587 : BlockTransactions resp(req);
2573 [ - + + + ]: 2246 : for (size_t i = 0; i < req.indexes.size(); i++) {
2574 [ - + + + ]: 1660 : if (req.indexes[i] >= block.vtx.size()) {
2575 [ + - + - ]: 1 : Misbehaving(peer, "getblocktxn with out-of-bounds tx indices");
2576 : 1 : return;
2577 : : }
2578 : 1659 : resp.txn[i] = block.vtx[req.indexes[i]];
2579 : : }
2580 : :
2581 [ + - + - ]: 586 : if (LogAcceptCategory(BCLog::CMPCTBLOCK, BCLog::Level::Debug)) {
2582 : 586 : uint32_t tx_requested_size{0};
2583 [ + - + + ]: 2245 : for (const auto& tx : resp.txn) tx_requested_size += tx->ComputeTotalSize();
2584 [ + - + - : 1172 : 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);
- + + - +
- + - ]
2585 : : }
2586 [ + - + - ]: 1172 : MakeAndPushMessage(pfrom, NetMsgType::BLOCKTXN, resp);
2587 : 587 : }
2588 : :
2589 : 6794 : bool PeerManagerImpl::CheckHeadersPoW(const std::vector<CBlockHeader>& headers, Peer& peer)
2590 : : {
2591 : : // Do these headers have proof-of-work matching what's claimed?
2592 [ - + + + ]: 6794 : if (!HasValidProofOfWork(headers, m_chainparams.GetConsensus())) {
2593 [ + - ]: 1 : Misbehaving(peer, "header with invalid proof of work");
2594 : 1 : return false;
2595 : : }
2596 : :
2597 : : // Are these headers connected to each other?
2598 [ + + ]: 6793 : if (!CheckHeadersAreContinuous(headers)) {
2599 [ + - ]: 1 : Misbehaving(peer, "non-continuous headers sequence");
2600 : 1 : return false;
2601 : : }
2602 : : return true;
2603 : : }
2604 : :
2605 : 65497 : arith_uint256 PeerManagerImpl::GetAntiDoSWorkThreshold()
2606 : : {
2607 : 65497 : arith_uint256 near_chaintip_work = 0;
2608 : 65497 : LOCK(cs_main);
2609 [ + - - + : 130994 : if (m_chainman.ActiveChain().Tip() != nullptr) {
+ - ]
2610 [ + - - + ]: 65497 : const CBlockIndex *tip = m_chainman.ActiveChain().Tip();
2611 : : // Use a 144 block buffer, so that we'll accept headers that fork from
2612 : : // near our tip.
2613 [ + - + - : 65497 : near_chaintip_work = tip->nChainWork - std::min<arith_uint256>(144*GetBlockProof(*tip), tip->nChainWork);
+ - ]
2614 : : }
2615 [ + - + - : 65497 : return std::max(near_chaintip_work, m_chainman.MinimumChainWork());
+ - ]
2616 : 65497 : }
2617 : :
2618 : : /**
2619 : : * Special handling for unconnecting headers that might be part of a block
2620 : : * announcement.
2621 : : *
2622 : : * We'll send a getheaders message in response to try to connect the chain.
2623 : : */
2624 : 199 : void PeerManagerImpl::HandleUnconnectingHeaders(CNode& pfrom, Peer& peer,
2625 : : const std::vector<CBlockHeader>& headers)
2626 : : {
2627 : : // Try to fill in the missing headers.
2628 [ + - ]: 398 : const CBlockIndex* best_header{WITH_LOCK(cs_main, return m_chainman.m_best_header)};
2629 [ + - + - ]: 199 : if (MaybeSendGetHeaders(pfrom, GetLocator(best_header), peer)) {
2630 [ + - + - : 398 : LogDebug(BCLog::NET, "received header %s: missing prev block %s, sending getheaders (%d) to end (peer=%d)\n",
+ - + - ]
2631 : : headers[0].GetHash().ToString(),
2632 : : headers[0].hashPrevBlock.ToString(),
2633 : : best_header->nHeight,
2634 : : pfrom.GetId());
2635 : : }
2636 : :
2637 : : // Set hashLastUnknownBlock for this peer, so that if we
2638 : : // eventually get the headers - even from a different peer -
2639 : : // we can use this peer to download.
2640 [ + - + - ]: 597 : WITH_LOCK(cs_main, UpdateBlockAvailability(pfrom.GetId(), headers.back().GetHash()));
2641 : 199 : }
2642 : :
2643 : 6793 : bool PeerManagerImpl::CheckHeadersAreContinuous(const std::vector<CBlockHeader>& headers) const
2644 : : {
2645 : 6793 : uint256 hashLastBlock;
2646 [ + + ]: 181223 : for (const CBlockHeader& header : headers) {
2647 [ + + + + ]: 174431 : if (!hashLastBlock.IsNull() && header.hashPrevBlock != hashLastBlock) {
2648 : : return false;
2649 : : }
2650 : 174430 : hashLastBlock = header.GetHash();
2651 : : }
2652 : : return true;
2653 : : }
2654 : :
2655 : 6796 : bool PeerManagerImpl::IsContinuationOfLowWorkHeadersSync(Peer& peer, CNode& pfrom, std::vector<CBlockHeader>& headers)
2656 : : {
2657 [ + + ]: 6796 : if (peer.m_headers_sync) {
2658 [ - + ]: 17 : auto result = peer.m_headers_sync->ProcessNextHeaders(headers, headers.size() == m_opts.max_headers_result);
2659 : : // If it is a valid continuation, we should treat the existing getheaders request as responded to.
2660 [ + - ]: 17 : if (result.success) peer.m_last_getheaders_timestamp = {};
2661 [ + + ]: 17 : if (result.request_more) {
2662 [ + - ]: 14 : auto locator = peer.m_headers_sync->NextHeadersRequestLocator();
2663 : : // If we were instructed to ask for a locator, it should not be empty.
2664 [ + - ]: 14 : Assume(!locator.vHave.empty());
2665 : : // We can only be instructed to request more if processing was successful.
2666 : 14 : Assume(result.success);
2667 [ + - ]: 14 : if (!locator.vHave.empty()) {
2668 : : // It should be impossible for the getheaders request to fail,
2669 : : // because we just cleared the last getheaders timestamp.
2670 [ + - ]: 14 : bool sent_getheaders = MaybeSendGetHeaders(pfrom, locator, peer);
2671 [ + - ]: 14 : Assume(sent_getheaders);
2672 [ + - + - : 28 : LogDebug(BCLog::NET, "more getheaders (from %s) to peer=%d\n",
+ - + - ]
2673 : : locator.vHave.front().ToString(), pfrom.GetId());
2674 : : }
2675 : 14 : }
2676 : :
2677 [ + + ]: 17 : if (peer.m_headers_sync->GetState() == HeadersSyncState::State::FINAL) {
2678 [ + - ]: 3 : peer.m_headers_sync.reset(nullptr);
2679 : :
2680 : : // Delete this peer's entry in m_headers_presync_stats.
2681 : : // If this is m_headers_presync_bestpeer, it will be replaced later
2682 : : // by the next peer that triggers the else{} branch below.
2683 [ + - ]: 3 : LOCK(m_headers_presync_mutex);
2684 [ + - ]: 3 : m_headers_presync_stats.erase(pfrom.GetId());
2685 : 3 : } else {
2686 : : // Build statistics for this peer's sync.
2687 : 14 : HeadersPresyncStats stats;
2688 [ + + ]: 14 : stats.first = peer.m_headers_sync->GetPresyncWork();
2689 [ + + ]: 14 : if (peer.m_headers_sync->GetState() == HeadersSyncState::State::PRESYNC) {
2690 : 6 : stats.second = {peer.m_headers_sync->GetPresyncHeight(),
2691 : 6 : peer.m_headers_sync->GetPresyncTime()};
2692 : : }
2693 : :
2694 : : // Update statistics in stats.
2695 [ + - ]: 14 : LOCK(m_headers_presync_mutex);
2696 [ + - ]: 14 : m_headers_presync_stats[pfrom.GetId()] = stats;
2697 : 14 : auto best_it = m_headers_presync_stats.find(m_headers_presync_bestpeer);
2698 : 14 : bool best_updated = false;
2699 [ + + ]: 14 : if (best_it == m_headers_presync_stats.end()) {
2700 : : // If the cached best peer is outdated, iterate over all remaining ones (including
2701 : : // newly updated one) to find the best one.
2702 : 4 : NodeId peer_best{-1};
2703 : 4 : const HeadersPresyncStats* stat_best{nullptr};
2704 [ - + + + ]: 8 : for (const auto& [peer, stat] : m_headers_presync_stats) {
2705 [ - + - - : 4 : if (!stat_best || stat > *stat_best) {
- - ]
2706 : 4 : peer_best = peer;
2707 : 4 : stat_best = &stat;
2708 : : }
2709 : : }
2710 : 4 : m_headers_presync_bestpeer = peer_best;
2711 [ + - ]: 4 : best_updated = (peer_best == pfrom.GetId());
2712 [ - + - - : 10 : } else if (best_it->first == pfrom.GetId() || stats > best_it->second) {
- - ]
2713 : : // pfrom was and remains the best peer, or pfrom just became best.
2714 : 10 : m_headers_presync_bestpeer = pfrom.GetId();
2715 : 10 : best_updated = true;
2716 : : }
2717 [ + - + + ]: 14 : if (best_updated && stats.second.has_value()) {
2718 : : // If the best peer updated, and it is in its first phase, signal.
2719 : 6 : m_headers_presync_should_signal = true;
2720 : : }
2721 : 14 : }
2722 : :
2723 [ + - ]: 17 : if (result.success) {
2724 : : // We only overwrite the headers passed in if processing was
2725 : : // successful.
2726 : 17 : headers.swap(result.pow_validated_headers);
2727 : : }
2728 : :
2729 : 17 : return result.success;
2730 : 17 : }
2731 : : // Either we didn't have a sync in progress, or something went wrong
2732 : : // processing these headers, or we are returning headers to the caller to
2733 : : // process.
2734 : : return false;
2735 : : }
2736 : :
2737 : 1727 : bool PeerManagerImpl::TryLowWorkHeadersSync(Peer& peer, CNode& pfrom, const CBlockIndex& chain_start_header, std::vector<CBlockHeader>& headers)
2738 : : {
2739 : : // Calculate the claimed total work on this chain.
2740 [ - + ]: 1727 : arith_uint256 total_work = chain_start_header.nChainWork + CalculateClaimedHeadersWork(headers);
2741 : :
2742 : : // Our dynamic anti-DoS threshold (minimum work required on a headers chain
2743 : : // before we'll store it)
2744 : 1727 : arith_uint256 minimum_chain_work = GetAntiDoSWorkThreshold();
2745 : :
2746 : : // Avoid DoS via low-difficulty-headers by only processing if the headers
2747 : : // are part of a chain with sufficient work.
2748 [ + + ]: 1727 : if (total_work < minimum_chain_work) {
2749 : : // Only try to sync with this peer if their headers message was full;
2750 : : // otherwise they don't have more headers after this so no point in
2751 : : // trying to sync their too-little-work chain.
2752 [ - + + + ]: 83 : if (headers.size() == m_opts.max_headers_result) {
2753 : : // Note: we could advance to the last header in this set that is
2754 : : // known to us, rather than starting at the first header (which we
2755 : : // may already have); however this is unlikely to matter much since
2756 : : // ProcessHeadersMessage() already handles the case where all
2757 : : // headers in a received message are already known and are
2758 : : // ancestors of m_best_header or chainActive.Tip(), by skipping
2759 : : // this logic in that case. So even if the first header in this set
2760 : : // of headers is known, some header in this set must be new, so
2761 : : // advancing to the first unknown header would be a small effect.
2762 : 4 : LOCK(peer.m_headers_sync_mutex);
2763 [ + - - + ]: 4 : peer.m_headers_sync.reset(new HeadersSyncState(peer.m_id, m_chainparams.GetConsensus(),
2764 [ + - + - ]: 4 : m_chainparams.HeadersSync(), chain_start_header, minimum_chain_work));
2765 : :
2766 : : // Now a HeadersSyncState object for tracking this synchronization
2767 : : // is created, process the headers using it as normal. Failures are
2768 : : // handled inside of IsContinuationOfLowWorkHeadersSync.
2769 [ + - ]: 4 : (void)IsContinuationOfLowWorkHeadersSync(peer, pfrom, headers);
2770 : 4 : } else {
2771 [ + - - + ]: 79 : LogDebug(BCLog::NET, "Ignoring low-work chain (height=%u) from peer=%d\n", chain_start_header.nHeight + headers.size(), pfrom.GetId());
2772 : : }
2773 : :
2774 : : // The peer has not yet given us a chain that meets our work threshold,
2775 : : // so we want to prevent further processing of the headers in any case.
2776 : 83 : headers = {};
2777 : 83 : return true;
2778 : : }
2779 : :
2780 : : return false;
2781 : : }
2782 : :
2783 : 6580 : bool PeerManagerImpl::IsAncestorOfBestHeaderOrTip(const CBlockIndex* header)
2784 : : {
2785 [ + + ]: 6580 : if (header == nullptr) {
2786 : : return false;
2787 [ + - + + ]: 4358 : } else if (m_chainman.m_best_header != nullptr && header == m_chainman.m_best_header->GetAncestor(header->nHeight)) {
2788 : : return true;
2789 [ + + ]: 27 : } else if (m_chainman.ActiveChain().Contains(header)) {
2790 : 1 : return true;
2791 : : }
2792 : : return false;
2793 : : }
2794 : :
2795 : 2359 : bool PeerManagerImpl::MaybeSendGetHeaders(CNode& pfrom, const CBlockLocator& locator, Peer& peer)
2796 : : {
2797 : 2359 : const auto current_time = NodeClock::now();
2798 : :
2799 : : // Only allow a new getheaders message to go out if we don't have a recent
2800 : : // one already in-flight
2801 [ + + ]: 2359 : if (current_time - peer.m_last_getheaders_timestamp > HEADERS_RESPONSE_TIME) {
2802 [ + - ]: 2152 : MakeAndPushMessage(pfrom, NetMsgType::GETHEADERS, locator, uint256());
2803 : 2152 : peer.m_last_getheaders_timestamp = current_time;
2804 : 2152 : return true;
2805 : : }
2806 : : return false;
2807 : : }
2808 : :
2809 : : /*
2810 : : * Given a new headers tip ending in last_header, potentially request blocks towards that tip.
2811 : : * We require that the given tip have at least as much work as our tip, and for
2812 : : * our current tip to be "close to synced" (see CanDirectFetch()).
2813 : : */
2814 : 6415 : void PeerManagerImpl::HeadersDirectFetchBlocks(CNode& pfrom, const Peer& peer, const CBlockIndex& last_header)
2815 : : {
2816 : 6415 : LOCK(cs_main);
2817 : 6415 : CNodeState *nodestate = State(pfrom.GetId());
2818 : :
2819 [ + - + + : 21354 : if (CanDirectFetch() && last_header.IsValid(BLOCK_VALID_TREE) && m_chainman.ActiveChain().Tip()->nChainWork <= last_header.nChainWork) {
+ - + - -
+ + - + +
+ - ]
2820 : 3991 : std::vector<const CBlockIndex*> vToFetch;
2821 : 3991 : const CBlockIndex* pindexWalk{&last_header};
2822 : : // Calculate all the blocks we'd need to switch to last_header, up to a limit.
2823 [ + - + - : 51700 : while (pindexWalk && !m_chainman.ActiveChain().Contains(pindexWalk) && vToFetch.size() <= MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
+ + + + ]
2824 [ + + ]: 18759 : if (!(pindexWalk->nStatus & BLOCK_HAVE_DATA) &&
2825 [ + + + + ]: 35131 : !IsBlockRequested(pindexWalk->GetBlockHash()) &&
2826 [ + + ]: 22990 : (!DeploymentActiveAt(*pindexWalk, m_chainman, Consensus::DEPLOYMENT_SEGWIT) || CanServeWitnesses(peer))) {
2827 : : // We don't have this block, and it's not yet in flight.
2828 [ + - ]: 11524 : vToFetch.push_back(pindexWalk);
2829 : : }
2830 : 23606 : pindexWalk = pindexWalk->pprev;
2831 : : }
2832 : : // If pindexWalk still isn't on our main chain, we're looking at a
2833 : : // very large reorg at a time we think we're close to caught up to
2834 : : // the main chain -- this shouldn't really happen. Bail out on the
2835 : : // direct fetch and rely on parallel download instead.
2836 [ + - + + ]: 3991 : if (!m_chainman.ActiveChain().Contains(pindexWalk)) {
2837 [ + - + - : 994 : LogDebug(BCLog::NET, "Large reorg, won't direct fetch to %s (%d)\n",
+ - + - ]
2838 : : last_header.GetBlockHash().ToString(),
2839 : : last_header.nHeight);
2840 : : } else {
2841 : 3494 : std::vector<CInv> vGetData;
2842 : : // Download as much as possible, from earliest to latest.
2843 [ + + ]: 6297 : for (const CBlockIndex* pindex : vToFetch | std::views::reverse) {
2844 [ + + ]: 2860 : if (nodestate->vBlocksInFlight.size() >= MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
2845 : : // Can't download any more from this peer
2846 : : break;
2847 : : }
2848 : 2803 : uint32_t nFetchFlags = GetFetchFlags(peer);
2849 [ + - ]: 2803 : vGetData.emplace_back(MSG_BLOCK | nFetchFlags, pindex->GetBlockHash());
2850 [ + - ]: 2803 : BlockRequested(pfrom.GetId(), *pindex);
2851 [ + - + - : 5606 : LogDebug(BCLog::NET, "Requesting block %s from peer=%d\n",
+ - + - ]
2852 : : pindex->GetBlockHash().ToString(), pfrom.GetId());
2853 : : }
2854 [ - + + + ]: 3494 : if (vGetData.size() > 1) {
2855 [ + - + - : 678 : LogDebug(BCLog::NET, "Downloading blocks toward %s (%d) via headers direct fetch\n",
+ - + - ]
2856 : : last_header.GetBlockHash().ToString(),
2857 : : last_header.nHeight);
2858 : : }
2859 [ - + + + ]: 3494 : if (vGetData.size() > 0) {
2860 : 4041 : if (!m_opts.ignore_incoming_txs &&
2861 [ + + ]: 2020 : nodestate->m_provides_cmpctblocks &&
2862 [ + + + + ]: 1743 : vGetData.size() == 1 &&
2863 [ + + + + ]: 3560 : mapBlocksInFlight.size() == 1 &&
2864 [ + - + + ]: 322 : last_header.pprev->IsValid(BLOCK_VALID_CHAIN)) {
2865 : : // In any case, we want to download using a compact block, not a regular one
2866 [ + - ]: 318 : vGetData[0] = CInv(MSG_CMPCT_BLOCK, vGetData[0].hash);
2867 : : }
2868 [ + - + - ]: 4042 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vGetData);
2869 : : }
2870 : 3494 : }
2871 : 3991 : }
2872 : 6415 : }
2873 : :
2874 : : /**
2875 : : * Given receipt of headers from a peer ending in last_header, along with
2876 : : * whether that header was new and whether the headers message was full,
2877 : : * update the state we keep for the peer.
2878 : : */
2879 : 6415 : void PeerManagerImpl::UpdatePeerStateForReceivedHeaders(CNode& pfrom, Peer& peer,
2880 : : const CBlockIndex& last_header, bool received_new_header, bool may_have_more_headers)
2881 : : {
2882 : 6415 : LOCK(cs_main);
2883 : 6415 : CNodeState *nodestate = State(pfrom.GetId());
2884 : :
2885 [ + - ]: 6415 : UpdateBlockAvailability(pfrom.GetId(), last_header.GetBlockHash());
2886 : :
2887 : : // From here, pindexBestKnownBlock should be guaranteed to be non-null,
2888 : : // because it is set in UpdateBlockAvailability. Some nullptr checks
2889 : : // are still present, however, as belt-and-suspenders.
2890 : :
2891 [ + + + - : 8475 : if (received_new_header && last_header.nChainWork > m_chainman.ActiveChain().Tip()->nChainWork) {
- + + - +
+ ]
2892 [ + - ]: 1993 : nodestate->m_last_block_announcement = GetTime();
2893 : : }
2894 : :
2895 : : // If we're in IBD, we want outbound peers that will serve us a useful
2896 : : // chain. Disconnect peers that are on chains with insufficient work.
2897 [ + - + + : 6415 : if (m_chainman.IsInitialBlockDownload() && !may_have_more_headers) {
+ + ]
2898 : : // If the peer has no more headers to give us, then we know we have
2899 : : // their tip.
2900 [ + - + - : 821 : if (nodestate->pindexBestKnownBlock && nodestate->pindexBestKnownBlock->nChainWork < m_chainman.MinimumChainWork()) {
+ - + + ]
2901 : : // This peer has too little work on their headers chain to help
2902 : : // us sync -- disconnect if it is an outbound disconnection
2903 : : // candidate.
2904 : : // Note: We compare their tip to the minimum chain work (rather than
2905 : : // m_chainman.ActiveChain().Tip()) because we won't start block download
2906 : : // until we have a headers chain that has at least
2907 : : // the minimum chain work, even if a peer has a chain past our tip,
2908 : : // as an anti-DoS measure.
2909 [ - + ]: 31 : if (pfrom.IsOutboundOrBlockRelayConn()) {
2910 [ # # # # ]: 0 : LogInfo("outbound peer headers chain has insufficient work, %s\n", pfrom.DisconnectMsg(fLogIPs));
2911 : 0 : pfrom.fDisconnect = true;
2912 : : }
2913 : : }
2914 : : }
2915 : :
2916 : : // If this is an outbound full-relay peer, check to see if we should protect
2917 : : // it from the bad/lagging chain logic.
2918 : : // Note that outbound block-relay peers are excluded from this protection, and
2919 : : // thus always subject to eviction under the bad/lagging chain logic.
2920 : : // See ChainSyncTimeoutState.
2921 [ + - + + : 6415 : if (!pfrom.fDisconnect && pfrom.IsFullOutboundConn() && nodestate->pindexBestKnownBlock != nullptr) {
+ - ]
2922 [ + + + - : 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) {
- + + - +
+ + - ]
2923 [ + - + - : 16 : LogDebug(BCLog::NET, "Protecting outbound peer=%d from eviction\n", pfrom.GetId());
+ - ]
2924 : 16 : nodestate->m_chain_sync.m_protect = true;
2925 : 16 : ++m_outbound_peers_with_protect_from_disconnect;
2926 : : }
2927 : : }
2928 : 6415 : }
2929 : :
2930 : 7157 : void PeerManagerImpl::ProcessHeadersMessage(CNode& pfrom, Peer& peer,
2931 : : std::vector<CBlockHeader>&& headers,
2932 : : bool via_compact_block)
2933 : : {
2934 [ - + ]: 7157 : size_t nCount = headers.size();
2935 : :
2936 [ + + ]: 7157 : if (nCount == 0) {
2937 : : // Nothing interesting. Stop asking this peers for more headers.
2938 : : // If we were in the middle of headers sync, receiving an empty headers
2939 : : // message suggests that the peer suddenly has nothing to give us
2940 : : // (perhaps it reorged to our chain). Clear download state for this peer.
2941 : 363 : LOCK(peer.m_headers_sync_mutex);
2942 [ - + ]: 363 : if (peer.m_headers_sync) {
2943 : 0 : peer.m_headers_sync.reset(nullptr);
2944 [ # # ]: 0 : LOCK(m_headers_presync_mutex);
2945 [ # # ]: 0 : m_headers_presync_stats.erase(pfrom.GetId());
2946 : 0 : }
2947 : : // A headers message with no headers cannot be an announcement, so assume
2948 : : // it is a response to our last getheaders request, if there is one.
2949 : 363 : peer.m_last_getheaders_timestamp = {};
2950 [ + - ]: 363 : return;
2951 : 363 : }
2952 : :
2953 : : // Before we do any processing, make sure these pass basic sanity checks.
2954 : : // We'll rely on headers having valid proof-of-work further down, as an
2955 : : // anti-DoS criteria (note: this check is required before passing any
2956 : : // headers into HeadersSyncState).
2957 [ + + ]: 6794 : if (!CheckHeadersPoW(headers, peer)) {
2958 : : // Misbehaving() calls are handled within CheckHeadersPoW(), so we can
2959 : : // just return. (Note that even if a header is announced via compact
2960 : : // block, the header itself should be valid, so this type of error can
2961 : : // always be punished.)
2962 : : return;
2963 : : }
2964 : :
2965 : 6792 : const CBlockIndex *pindexLast = nullptr;
2966 : :
2967 : : // We'll set already_validated_work to true if these headers are
2968 : : // successfully processed as part of a low-work headers sync in progress
2969 : : // (either in PRESYNC or REDOWNLOAD phase).
2970 : : // If true, this will mean that any headers returned to us (ie during
2971 : : // REDOWNLOAD) can be validated without further anti-DoS checks.
2972 : 6792 : bool already_validated_work = false;
2973 : :
2974 : : // If we're in the middle of headers sync, let it do its magic.
2975 : 6792 : bool have_headers_sync = false;
2976 : 6792 : {
2977 : 6792 : LOCK(peer.m_headers_sync_mutex);
2978 : :
2979 [ + - ]: 6792 : already_validated_work = IsContinuationOfLowWorkHeadersSync(peer, pfrom, headers);
2980 : :
2981 : : // The headers we passed in may have been:
2982 : : // - untouched, perhaps if no headers-sync was in progress, or some
2983 : : // failure occurred
2984 : : // - erased, such as if the headers were successfully processed and no
2985 : : // additional headers processing needs to take place (such as if we
2986 : : // are still in PRESYNC)
2987 : : // - replaced with headers that are now ready for validation, such as
2988 : : // during the REDOWNLOAD phase of a low-work headers sync.
2989 : : // So just check whether we still have headers that we need to process,
2990 : : // or not.
2991 [ + + ]: 6792 : if (headers.empty()) {
2992 [ + - ]: 10 : return;
2993 : : }
2994 : :
2995 [ + - ]: 6782 : have_headers_sync = !!peer.m_headers_sync;
2996 : 10 : }
2997 : :
2998 : : // Do these headers connect to something in our block index?
2999 [ + - + - ]: 20346 : const CBlockIndex *chain_start_header{WITH_LOCK(::cs_main, return m_chainman.m_blockman.LookupBlockIndex(headers[0].hashPrevBlock))};
3000 : 6782 : bool headers_connect_blockindex{chain_start_header != nullptr};
3001 : :
3002 [ + + ]: 6782 : if (!headers_connect_blockindex) {
3003 : : // This could be a BIP 130 block announcement, use
3004 : : // special logic for handling headers that don't connect, as this
3005 : : // could be benign.
3006 : 199 : HandleUnconnectingHeaders(pfrom, peer, headers);
3007 : 199 : return;
3008 : : }
3009 : :
3010 : : // If headers connect, assume that this is in response to any outstanding getheaders
3011 : : // request we may have sent, and clear out the time of our last request. Non-connecting
3012 : : // headers cannot be a response to a getheaders request.
3013 : 6583 : peer.m_last_getheaders_timestamp = {};
3014 : :
3015 : : // If the headers we received are already in memory and an ancestor of
3016 : : // m_best_header or our tip, skip anti-DoS checks. These headers will not
3017 : : // use any more memory (and we are not leaking information that could be
3018 : : // used to fingerprint us).
3019 : 6583 : const CBlockIndex *last_received_header{nullptr};
3020 : 6583 : {
3021 : 6583 : LOCK(cs_main);
3022 [ + - + - ]: 6583 : last_received_header = m_chainman.m_blockman.LookupBlockIndex(headers.back().GetHash());
3023 [ + + + - : 10915 : already_validated_work = already_validated_work || IsAncestorOfBestHeaderOrTip(last_received_header);
+ + + - ]
3024 : 0 : }
3025 : :
3026 : : // If our peer has NetPermissionFlags::NoBan privileges, then bypass our
3027 : : // anti-DoS logic (this saves bandwidth when we connect to a trusted peer
3028 : : // on startup).
3029 [ + + ]: 6583 : if (pfrom.HasPermission(NetPermissionFlags::NoBan)) {
3030 : : already_validated_work = true;
3031 : : }
3032 : :
3033 : : // At this point, the headers connect to something in our block index.
3034 : : // Do anti-DoS checks to determine if we should process or store for later
3035 : : // processing.
3036 [ + + + + ]: 4188 : if (!already_validated_work && TryLowWorkHeadersSync(peer, pfrom,
3037 : : *chain_start_header, headers)) {
3038 : : // If we successfully started a low-work headers sync, then there
3039 : : // should be no headers to process any further.
3040 : 83 : Assume(headers.empty());
3041 : 83 : return;
3042 : : }
3043 : :
3044 : : // At this point, we have a set of headers with sufficient work on them
3045 : : // which can be processed.
3046 : :
3047 : : // If we don't have the last header, then this peer will have given us
3048 : : // something new (if these headers are valid).
3049 : 6500 : bool received_new_header{last_received_header == nullptr};
3050 : :
3051 : : // Now process all the headers.
3052 [ - + ]: 6500 : BlockValidationState state;
3053 [ - + + - ]: 6500 : const bool processed{m_chainman.ProcessNewBlockHeaders(headers,
3054 : : /*min_pow_checked=*/true,
3055 : : state, &pindexLast)};
3056 [ + + ]: 6500 : if (!processed) {
3057 [ + - ]: 85 : if (state.IsInvalid()) {
3058 [ + + + + ]: 85 : if (!pfrom.IsInboundConn() && state.GetResult() == BlockValidationResult::BLOCK_CACHED_INVALID) {
3059 : : // Warn user if outgoing peers send us headers of blocks that we previously marked as invalid.
3060 [ - + + - ]: 138 : LogWarning("%s (received from peer=%i). "
3061 : : "If this happens with all peers, consider database corruption (that -reindex may fix) "
3062 : : "or a potential consensus incompatibility.",
3063 : : state.GetDebugMessage(), pfrom.GetId());
3064 : : }
3065 [ + - + - ]: 85 : MaybePunishNodeForBlock(pfrom.GetId(), state, via_compact_block, "invalid header received");
3066 : 85 : return;
3067 : : }
3068 : : }
3069 [ - + ]: 6415 : assert(pindexLast);
3070 : :
3071 [ + + ]: 6415 : if (processed && received_new_header) {
3072 [ + - ]: 2060 : LogBlockHeader(*pindexLast, pfrom, /*via_compact_block=*/false);
3073 : : }
3074 : :
3075 : : // Consider fetching more headers if we are not using our headers-sync mechanism.
3076 [ + + + - ]: 6415 : if (nCount == m_opts.max_headers_result && !have_headers_sync) {
3077 : : // Headers message had its maximum size; the peer may have more headers.
3078 [ + - + - : 16 : if (MaybeSendGetHeaders(pfrom, GetLocator(pindexLast), peer)) {
+ - ]
3079 [ + - + - : 16 : LogDebug(BCLog::NET, "more getheaders (%d) to end to peer=%d (startheight:%d)\n",
+ - ]
3080 : : pindexLast->nHeight, pfrom.GetId(), peer.m_starting_height);
3081 : : }
3082 : : }
3083 : :
3084 [ + - ]: 6415 : UpdatePeerStateForReceivedHeaders(pfrom, peer, *pindexLast, received_new_header, nCount == m_opts.max_headers_result);
3085 : :
3086 : : // Consider immediately downloading blocks.
3087 [ + - ]: 6415 : HeadersDirectFetchBlocks(pfrom, peer, *pindexLast);
3088 : :
3089 : : return;
3090 : 6500 : }
3091 : :
3092 : 842 : std::optional<node::PackageToValidate> PeerManagerImpl::ProcessInvalidTx(NodeId nodeid, const CTransactionRef& ptx, const TxValidationState& state,
3093 : : bool first_time_failure)
3094 : : {
3095 : 842 : AssertLockNotHeld(m_peer_mutex);
3096 : 842 : AssertLockHeld(g_msgproc_mutex);
3097 : 842 : AssertLockHeld(m_tx_download_mutex);
3098 : :
3099 : 842 : PeerRef peer{GetPeerRef(nodeid)};
3100 : :
3101 [ + - + - : 1684 : LogDebug(BCLog::MEMPOOLREJ, "%s (wtxid=%s) from peer=%d was not accepted: %s\n",
+ - + - +
- + - ]
3102 : : ptx->GetHash().ToString(),
3103 : : ptx->GetWitnessHash().ToString(),
3104 : : nodeid,
3105 : : state.ToString());
3106 : :
3107 [ + - ]: 842 : const auto& [add_extra_compact_tx, unique_parents, package_to_validate] = m_txdownloadman.MempoolRejectedTx(ptx, state, nodeid, first_time_failure);
3108 : :
3109 [ + + + + ]: 842 : if (add_extra_compact_tx && RecursiveDynamicUsage(*ptx) < 100000) {
3110 [ + - ]: 710 : AddToCompactExtraTransactions(ptx);
3111 : : }
3112 [ + + ]: 1456 : for (const Txid& parent_txid : unique_parents) {
3113 [ + - + - ]: 614 : if (peer) AddKnownTx(*peer, parent_txid.ToUint256());
3114 : : }
3115 : :
3116 [ + - ]: 842 : return package_to_validate;
3117 [ + - ]: 1684 : }
3118 : :
3119 : 11522 : void PeerManagerImpl::ProcessValidTx(NodeId nodeid, const CTransactionRef& tx, const std::list<CTransactionRef>& replaced_transactions)
3120 : : {
3121 : 11522 : AssertLockNotHeld(m_peer_mutex);
3122 : 11522 : AssertLockHeld(g_msgproc_mutex);
3123 : 11522 : AssertLockHeld(m_tx_download_mutex);
3124 : :
3125 : 11522 : m_txdownloadman.MempoolAcceptedTx(tx);
3126 : :
3127 [ + - + - : 23044 : LogDebug(BCLog::MEMPOOL, "AcceptToMemoryPool: peer=%d: accepted %s (wtxid=%s) (poolsz %u txn, %u kB)\n",
+ - ]
3128 : : nodeid,
3129 : : tx->GetHash().ToString(),
3130 : : tx->GetWitnessHash().ToString(),
3131 : : m_mempool.size(), m_mempool.DynamicMemoryUsage() / 1000);
3132 : :
3133 : 11522 : InitiateTxBroadcastToAll(tx->GetHash(), tx->GetWitnessHash());
3134 : :
3135 [ + + ]: 12009 : for (const CTransactionRef& removedTx : replaced_transactions) {
3136 : 487 : AddToCompactExtraTransactions(removedTx);
3137 : : }
3138 : 11522 : }
3139 : :
3140 : 30 : void PeerManagerImpl::ProcessPackageResult(const node::PackageToValidate& package_to_validate, const PackageMempoolAcceptResult& package_result)
3141 : : {
3142 : 30 : AssertLockNotHeld(m_peer_mutex);
3143 : 30 : AssertLockHeld(g_msgproc_mutex);
3144 : 30 : AssertLockHeld(m_tx_download_mutex);
3145 : :
3146 : 30 : const auto& package = package_to_validate.m_txns;
3147 : 30 : const auto& senders = package_to_validate.m_senders;
3148 : :
3149 [ + + ]: 30 : if (package_result.m_state.IsInvalid()) {
3150 : 3 : m_txdownloadman.MempoolRejectedPackage(package);
3151 : : }
3152 : : // We currently only expect to process 1-parent-1-child packages. Remove if this changes.
3153 [ - + + - ]: 30 : if (!Assume(package.size() == 2)) return;
3154 : :
3155 : : // Iterate backwards to erase in-package descendants from the orphanage before they become
3156 : : // relevant in AddChildrenToWorkSet.
3157 : 30 : auto package_iter = package.rbegin();
3158 : 30 : auto senders_iter = senders.rbegin();
3159 [ + + ]: 90 : while (package_iter != package.rend()) {
3160 : 60 : const auto& tx = *package_iter;
3161 : 60 : const NodeId nodeid = *senders_iter;
3162 : 60 : const auto it_result{package_result.m_tx_results.find(tx->GetWitnessHash())};
3163 : :
3164 : : // It is not guaranteed that a result exists for every transaction.
3165 [ + - ]: 60 : if (it_result != package_result.m_tx_results.end()) {
3166 [ + + - - ]: 60 : const auto& tx_result = it_result->second;
3167 [ + + - - ]: 60 : switch (tx_result.m_result_type) {
3168 : 54 : case MempoolAcceptResult::ResultType::VALID:
3169 : 54 : {
3170 : 54 : ProcessValidTx(nodeid, tx, tx_result.m_replaced_transactions);
3171 : 54 : break;
3172 : : }
3173 : 6 : case MempoolAcceptResult::ResultType::INVALID:
3174 : 6 : case MempoolAcceptResult::ResultType::DIFFERENT_WITNESS:
3175 : 6 : {
3176 : : // Don't add to vExtraTxnForCompact, as these transactions should have already been
3177 : : // added there when added to the orphanage or rejected for TX_RECONSIDERABLE.
3178 : : // This should be updated if package submission is ever used for transactions
3179 : : // that haven't already been validated before.
3180 [ - + ]: 6 : ProcessInvalidTx(nodeid, tx, tx_result.m_state, /*first_time_failure=*/false);
3181 : 6 : break;
3182 : : }
3183 : 0 : case MempoolAcceptResult::ResultType::MEMPOOL_ENTRY:
3184 : 0 : {
3185 : : // AlreadyHaveTx() should be catching transactions that are already in mempool.
3186 : 0 : Assume(false);
3187 : 0 : break;
3188 : : }
3189 : : }
3190 : : }
3191 : 60 : package_iter++;
3192 : 60 : senders_iter++;
3193 : : }
3194 : : }
3195 : :
3196 : : // NOTE: the orphan processing used to be uninterruptible and quadratic, which could allow a peer to stall the node for
3197 : : // hours with specially crafted transactions. See https://bitcoincore.org/en/2024/07/03/disclose-orphan-dos.
3198 : 435953 : bool PeerManagerImpl::ProcessOrphanTx(Peer& peer)
3199 : : {
3200 : 435953 : AssertLockHeld(g_msgproc_mutex);
3201 [ + - ]: 435953 : LOCK2(::cs_main, m_tx_download_mutex);
3202 : :
3203 : 435953 : CTransactionRef porphanTx = nullptr;
3204 : :
3205 [ + - + + : 435955 : while (CTransactionRef porphanTx = m_txdownloadman.GetTxToReconsider(peer.m_id)) {
+ - ]
3206 [ + - ]: 47 : const MempoolAcceptResult result = m_chainman.ProcessTransaction(porphanTx);
3207 : 47 : const TxValidationState& state = result.m_state;
3208 [ + + ]: 47 : const Txid& orphanHash = porphanTx->GetHash();
3209 [ + + ]: 47 : const Wtxid& orphan_wtxid = porphanTx->GetWitnessHash();
3210 : :
3211 [ + + ]: 47 : if (result.m_result_type == MempoolAcceptResult::ResultType::VALID) {
3212 [ + - + - : 78 : LogDebug(BCLog::TXPACKAGES, " accepted orphan tx %s (wtxid=%s)\n", orphanHash.ToString(), orphan_wtxid.ToString());
+ - + - +
- ]
3213 [ + - ]: 39 : ProcessValidTx(peer.m_id, porphanTx, result.m_replaced_transactions);
3214 : : return true;
3215 [ + + ]: 8 : } else if (state.GetResult() != TxValidationResult::TX_MISSING_INPUTS) {
3216 [ + - + - : 14 : LogDebug(BCLog::TXPACKAGES, " invalid orphan tx %s (wtxid=%s) from peer=%d. %s\n",
+ - + - +
- + - ]
3217 : : orphanHash.ToString(),
3218 : : orphan_wtxid.ToString(),
3219 : : peer.m_id,
3220 : : state.ToString());
3221 : :
3222 [ + - + - : 7 : if (Assume(state.IsInvalid() &&
+ - - + +
- ]
3223 : : state.GetResult() != TxValidationResult::TX_UNKNOWN &&
3224 : : state.GetResult() != TxValidationResult::TX_NO_MEMPOOL &&
3225 : : state.GetResult() != TxValidationResult::TX_RESULT_UNSET)) {
3226 [ + - ]: 14 : ProcessInvalidTx(peer.m_id, porphanTx, state, /*first_time_failure=*/false);
3227 : : }
3228 : 7 : return true;
3229 : : }
3230 [ + - ]: 94 : }
3231 : :
3232 : 435907 : return false;
3233 [ + - + - : 1307859 : }
- - ]
3234 : :
3235 : 15 : bool PeerManagerImpl::PrepareBlockFilterRequest(CNode& node, Peer& peer,
3236 : : BlockFilterType filter_type, uint32_t start_height,
3237 : : const uint256& stop_hash, uint32_t max_height_diff,
3238 : : const CBlockIndex*& stop_index,
3239 : : BlockFilterIndex*& filter_index)
3240 : : {
3241 : 30 : const bool supported_filter_type =
3242 [ + + ]: 15 : (filter_type == BlockFilterType::BASIC &&
3243 [ + + ]: 14 : (peer.m_our_services & NODE_COMPACT_FILTERS));
3244 : 15 : if (!supported_filter_type) {
3245 [ + - + - ]: 8 : LogDebug(BCLog::NET, "peer requested unsupported block filter type: %d, %s\n",
3246 : : static_cast<uint8_t>(filter_type), node.DisconnectMsg(fLogIPs));
3247 : 4 : node.fDisconnect = true;
3248 : 4 : return false;
3249 : : }
3250 : :
3251 : 11 : {
3252 : 11 : LOCK(cs_main);
3253 [ + - ]: 11 : stop_index = m_chainman.m_blockman.LookupBlockIndex(stop_hash);
3254 : :
3255 : : // Check that the stop block exists and the peer would be allowed to fetch it.
3256 [ + + + - : 11 : if (!stop_index || !BlockRequestAllowed(stop_index)) {
+ - ]
3257 [ + - + - : 2 : LogDebug(BCLog::NET, "peer requested invalid block hash: %s, %s\n",
+ - + - +
- ]
3258 : : stop_hash.ToString(), node.DisconnectMsg(fLogIPs));
3259 [ + - ]: 1 : node.fDisconnect = true;
3260 [ + - ]: 1 : return false;
3261 : : }
3262 : 1 : }
3263 : :
3264 : 10 : uint32_t stop_height = stop_index->nHeight;
3265 [ + + ]: 10 : if (start_height > stop_height) {
3266 [ + - + - ]: 2 : LogDebug(BCLog::NET, "peer sent invalid getcfilters/getcfheaders with "
3267 : : "start height %d and stop height %d, %s\n",
3268 : : start_height, stop_height, node.DisconnectMsg(fLogIPs));
3269 : 1 : node.fDisconnect = true;
3270 : 1 : return false;
3271 : : }
3272 [ + + ]: 9 : if (stop_height - start_height >= max_height_diff) {
3273 [ + - + - ]: 4 : LogDebug(BCLog::NET, "peer requested too many cfilters/cfheaders: %d / %d, %s\n",
3274 : : stop_height - start_height + 1, max_height_diff, node.DisconnectMsg(fLogIPs));
3275 : 2 : node.fDisconnect = true;
3276 : 2 : return false;
3277 : : }
3278 : :
3279 : 7 : filter_index = GetBlockFilterIndex(filter_type);
3280 [ - + ]: 7 : if (!filter_index) {
3281 [ # # ]: 0 : LogDebug(BCLog::NET, "Filter index for supported type %s not found\n", BlockFilterTypeName(filter_type));
3282 : 0 : return false;
3283 : : }
3284 : :
3285 : : return true;
3286 : : }
3287 : :
3288 : 4 : void PeerManagerImpl::ProcessGetCFilters(CNode& node, Peer& peer, DataStream& vRecv)
3289 : : {
3290 : 4 : uint8_t filter_type_ser;
3291 : 4 : uint32_t start_height;
3292 : 4 : uint256 stop_hash;
3293 : :
3294 : 4 : vRecv >> filter_type_ser >> start_height >> stop_hash;
3295 : :
3296 : 4 : const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
3297 : :
3298 : 4 : const CBlockIndex* stop_index;
3299 : 4 : BlockFilterIndex* filter_index;
3300 [ + + ]: 4 : if (!PrepareBlockFilterRequest(node, peer, filter_type, start_height, stop_hash,
3301 : : MAX_GETCFILTERS_SIZE, stop_index, filter_index)) {
3302 : : return;
3303 : : }
3304 : :
3305 : 2 : std::vector<BlockFilter> filters;
3306 [ + - - + ]: 2 : if (!filter_index->LookupFilterRange(start_height, stop_index, filters)) {
3307 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter in index: filter_type=%s, start_height=%d, stop_hash=%s\n",
# # # # #
# ]
3308 : : BlockFilterTypeName(filter_type), start_height, stop_hash.ToString());
3309 : 0 : return;
3310 : : }
3311 : :
3312 [ + + ]: 13 : for (const auto& filter : filters) {
3313 [ + - + - ]: 22 : MakeAndPushMessage(node, NetMsgType::CFILTER, filter);
3314 : : }
3315 : 2 : }
3316 : :
3317 : 5 : void PeerManagerImpl::ProcessGetCFHeaders(CNode& node, Peer& peer, DataStream& vRecv)
3318 : : {
3319 : 5 : uint8_t filter_type_ser;
3320 : 5 : uint32_t start_height;
3321 : 5 : uint256 stop_hash;
3322 : :
3323 : 5 : vRecv >> filter_type_ser >> start_height >> stop_hash;
3324 : :
3325 : 5 : const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
3326 : :
3327 : 5 : const CBlockIndex* stop_index;
3328 : 5 : BlockFilterIndex* filter_index;
3329 [ + + ]: 5 : if (!PrepareBlockFilterRequest(node, peer, filter_type, start_height, stop_hash,
3330 : : MAX_GETCFHEADERS_SIZE, stop_index, filter_index)) {
3331 : : return;
3332 : : }
3333 : :
3334 : 2 : uint256 prev_header;
3335 [ + - ]: 2 : if (start_height > 0) {
3336 : 2 : const CBlockIndex* const prev_block =
3337 : 2 : stop_index->GetAncestor(static_cast<int>(start_height - 1));
3338 [ - + ]: 2 : if (!filter_index->LookupFilterHeader(prev_block, prev_header)) {
3339 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter header in index: filter_type=%s, block_hash=%s\n",
# # ]
3340 : : BlockFilterTypeName(filter_type), prev_block->GetBlockHash().ToString());
3341 : 0 : return;
3342 : : }
3343 : : }
3344 : :
3345 : 2 : std::vector<uint256> filter_hashes;
3346 [ + - - + ]: 2 : if (!filter_index->LookupFilterHashRange(start_height, stop_index, filter_hashes)) {
3347 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter hashes in index: filter_type=%s, start_height=%d, stop_hash=%s\n",
# # # # #
# ]
3348 : : BlockFilterTypeName(filter_type), start_height, stop_hash.ToString());
3349 : 0 : return;
3350 : : }
3351 : :
3352 [ + - + - ]: 4 : MakeAndPushMessage(node, NetMsgType::CFHEADERS,
3353 : : filter_type_ser,
3354 : 2 : stop_index->GetBlockHash(),
3355 : : prev_header,
3356 : : filter_hashes);
3357 : 2 : }
3358 : :
3359 : 6 : void PeerManagerImpl::ProcessGetCFCheckPt(CNode& node, Peer& peer, DataStream& vRecv)
3360 : : {
3361 : 6 : uint8_t filter_type_ser;
3362 : 6 : uint256 stop_hash;
3363 : :
3364 : 6 : vRecv >> filter_type_ser >> stop_hash;
3365 : :
3366 : 6 : const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
3367 : :
3368 : 6 : const CBlockIndex* stop_index;
3369 : 6 : BlockFilterIndex* filter_index;
3370 [ + + ]: 6 : if (!PrepareBlockFilterRequest(node, peer, filter_type, /*start_height=*/0, stop_hash,
3371 : : /*max_height_diff=*/std::numeric_limits<uint32_t>::max(),
3372 : : stop_index, filter_index)) {
3373 : : return;
3374 : : }
3375 : :
3376 : 3 : std::vector<uint256> headers(stop_index->nHeight / CFCHECKPT_INTERVAL);
3377 : :
3378 : : // Populate headers.
3379 : 3 : const CBlockIndex* block_index = stop_index;
3380 [ - + + + ]: 7 : for (int i = headers.size() - 1; i >= 0; i--) {
3381 : 4 : int height = (i + 1) * CFCHECKPT_INTERVAL;
3382 [ + - ]: 4 : block_index = block_index->GetAncestor(height);
3383 : :
3384 [ + - - + ]: 4 : if (!filter_index->LookupFilterHeader(block_index, headers[i])) {
3385 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter header in index: filter_type=%s, block_hash=%s\n",
# # # # #
# ]
3386 : : BlockFilterTypeName(filter_type), block_index->GetBlockHash().ToString());
3387 : 0 : return;
3388 : : }
3389 : : }
3390 : :
3391 [ + - + - ]: 6 : MakeAndPushMessage(node, NetMsgType::CFCHECKPT,
3392 : : filter_type_ser,
3393 : 3 : stop_index->GetBlockHash(),
3394 : : headers);
3395 : 3 : }
3396 : :
3397 : 59093 : void PeerManagerImpl::ProcessBlock(CNode& node, const std::shared_ptr<const CBlock>& block, bool force_processing, bool min_pow_checked)
3398 : : {
3399 : 59093 : bool new_block{false};
3400 : 59093 : m_chainman.ProcessNewBlock(block, force_processing, min_pow_checked, &new_block);
3401 [ + + ]: 59093 : if (new_block) {
3402 : 58888 : node.m_last_block_time = GetTime<std::chrono::seconds>();
3403 : : // In case this block came from a different peer than we requested
3404 : : // from, we can erase the block request now anyway (as we just stored
3405 : : // this block to disk).
3406 : 58888 : LOCK(cs_main);
3407 [ + - + - ]: 58888 : RemoveBlockRequest(block->GetHash(), std::nullopt);
3408 : 58888 : } else {
3409 : 205 : LOCK(cs_main);
3410 [ + - + - ]: 410 : mapBlockSource.erase(block->GetHash());
3411 : 205 : }
3412 : 59093 : }
3413 : :
3414 : 17903 : void PeerManagerImpl::ProcessCompactBlockTxns(CNode& pfrom, Peer& peer, const BlockTransactions& block_transactions)
3415 : : {
3416 : 17903 : std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
3417 : 17903 : bool fBlockRead{false};
3418 : 17903 : {
3419 [ + - ]: 17903 : LOCK(cs_main);
3420 : :
3421 : 17903 : auto range_flight = mapBlocksInFlight.equal_range(block_transactions.blockhash);
3422 : 17903 : size_t already_in_flight = std::distance(range_flight.first, range_flight.second);
3423 : 17903 : bool requested_block_from_this_peer{false};
3424 : :
3425 : : // Multimap ensures ordering of outstanding requests. It's either empty or first in line.
3426 [ + + + + ]: 17903 : bool first_in_flight = already_in_flight == 0 || (range_flight.first->second.first == pfrom.GetId());
3427 : :
3428 [ + + ]: 18023 : while (range_flight.first != range_flight.second) {
3429 [ + + ]: 18019 : auto [node_id, block_it] = range_flight.first->second;
3430 [ + + - + ]: 18019 : if (node_id == pfrom.GetId() && block_it->partialBlock) {
3431 : : requested_block_from_this_peer = true;
3432 : : break;
3433 : : }
3434 : 120 : range_flight.first++;
3435 : : }
3436 : :
3437 [ + + ]: 17903 : if (!requested_block_from_this_peer) {
3438 [ + - + - : 4 : LogDebug(BCLog::NET, "Peer %d sent us block transactions for block we weren't expecting\n", pfrom.GetId());
+ - ]
3439 : 4 : return;
3440 : : }
3441 : :
3442 [ + + ]: 17899 : PartiallyDownloadedBlock& partialBlock = *range_flight.first->second.second->partialBlock;
3443 : :
3444 [ + + ]: 17899 : if (partialBlock.header.IsNull()) {
3445 : : // It is possible for the header to be empty if a previous call to FillBlock wiped the header, but left
3446 : : // the PartiallyDownloadedBlock pointer around (i.e. did not call RemoveBlockRequest). In this case, we
3447 : : // should not call LookupBlockIndex below.
3448 [ + - ]: 1 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId());
3449 [ + - + - ]: 1 : Misbehaving(peer, "previous compact block reconstruction attempt failed");
3450 [ + - + - : 1 : LogDebug(BCLog::NET, "Peer %d sent compact block transactions multiple times", pfrom.GetId());
+ - ]
3451 : 1 : return;
3452 : : }
3453 : :
3454 : : // We should not have gotten this far in compact block processing unless it's attached to a known header
3455 [ + - ]: 17898 : const CBlockIndex* prev_block{Assume(m_chainman.m_blockman.LookupBlockIndex(partialBlock.header.hashPrevBlock))};
3456 [ + - ]: 17898 : ReadStatus status = partialBlock.FillBlock(*pblock, block_transactions.txn,
3457 : 17898 : /*segwit_active=*/DeploymentActiveAfter(prev_block, m_chainman, Consensus::DEPLOYMENT_SEGWIT));
3458 [ - + ]: 17898 : if (status == READ_STATUS_INVALID) {
3459 [ # # ]: 0 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId()); // Reset in-flight state in case Misbehaving does not result in a disconnect
3460 [ # # # # ]: 0 : Misbehaving(peer, "invalid compact block/non-matching block transactions");
3461 : 0 : return;
3462 [ + + ]: 17898 : } else if (status == READ_STATUS_FAILED) {
3463 [ + + ]: 4 : if (first_in_flight) {
3464 : : // Might have collided, fall back to getdata now :(
3465 : : // We keep the failed partialBlock to disallow processing another compact block announcement from the same
3466 : : // peer for the same block. We let the full block download below continue under the same m_downloading_since
3467 : : // timer.
3468 : 3 : std::vector<CInv> invs;
3469 [ + - ]: 3 : invs.emplace_back(MSG_BLOCK | GetFetchFlags(peer), block_transactions.blockhash);
3470 [ + - + - ]: 6 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, invs);
3471 : 3 : } else {
3472 [ + - ]: 1 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId());
3473 [ + - + - : 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());
+ - ]
3474 : 1 : return;
3475 : : }
3476 : : } else {
3477 : : // Block is okay for further processing
3478 [ + - ]: 17894 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId()); // it is now an empty pointer
3479 : 17894 : fBlockRead = true;
3480 : : // mapBlockSource is used for potentially punishing peers and
3481 : : // updating which peers send us compact blocks, so the race
3482 : : // between here and cs_main in ProcessNewBlock is fine.
3483 : : // BIP 152 permits peers to relay compact blocks after validating
3484 : : // the header only; we should not punish peers if the block turns
3485 : : // out to be invalid.
3486 [ + - ]: 17894 : mapBlockSource.emplace(block_transactions.blockhash, std::make_pair(pfrom.GetId(), false));
3487 : : }
3488 : 6 : } // Don't hold cs_main when we call into ProcessNewBlock
3489 [ + + ]: 17897 : if (fBlockRead) {
3490 : : // Since we requested this block (it was in mapBlocksInFlight), force it to be processed,
3491 : : // even if it would not be a candidate for new tip (missing previous block, chain not long enough, etc)
3492 : : // This bypasses some anti-DoS logic in AcceptBlock (eg to prevent
3493 : : // disk-space attacks), but this should be safe due to the
3494 : : // protections in the compact block handler -- see related comment
3495 : : // in compact block optimistic reconstruction handling.
3496 [ + - + - ]: 53682 : ProcessBlock(pfrom, pblock, /*force_processing=*/true, /*min_pow_checked=*/true);
3497 : : }
3498 : : return;
3499 : 17903 : }
3500 : :
3501 : 21197 : void PeerManagerImpl::LogBlockHeader(const CBlockIndex& index, const CNode& peer, bool via_compact_block) {
3502 : : // To prevent log spam, this function should only be called after it was determined that a
3503 : : // header is both new and valid.
3504 : : //
3505 : : // These messages are valuable for detecting potential selfish mining behavior;
3506 : : // if multiple displacing headers are seen near simultaneously across many
3507 : : // nodes in the network, this might be an indication of selfish mining.
3508 : : // In addition it can be used to identify peers which send us a header, but
3509 : : // don't followup with a complete and valid (compact) block.
3510 : : // Having this log by default when not in IBD ensures broad availability of
3511 : : // this data in case investigation is merited.
3512 : 21197 : const auto msg = strprintf(
3513 : : "Saw new %sheader hash=%s height=%d peer=%d%s",
3514 [ + + ]: 21197 : via_compact_block ? "cmpctblock " : "",
3515 [ + - ]: 42394 : index.GetBlockHash().ToString(),
3516 : 21197 : index.nHeight,
3517 : 21197 : peer.GetId(),
3518 : 21197 : peer.LogIP(fLogIPs)
3519 [ + - ]: 21197 : );
3520 [ + - + + ]: 21197 : if (m_chainman.IsInitialBlockDownload()) {
3521 [ + - + - : 780 : LogDebug(BCLog::VALIDATION, "%s", msg);
+ - ]
3522 : : } else {
3523 [ + - ]: 20417 : LogInfo("%s", msg);
3524 : : }
3525 : 21197 : }
3526 : :
3527 : 10 : void PeerManagerImpl::PushPrivateBroadcastTx(CNode& node)
3528 : : {
3529 : 10 : Assume(node.IsPrivateBroadcastConn());
3530 : :
3531 : 10 : const auto opt_tx{m_tx_for_private_broadcast.PickTxForSend(node.GetId())};
3532 [ - + ]: 10 : if (!opt_tx) {
3533 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Disconnecting: no more transactions for private broadcast (connected in vain), peer=%d%s", node.GetId(), node.LogIP(fLogIPs));
# # # # ]
3534 : 0 : node.fDisconnect = true;
3535 : 0 : return;
3536 : : }
3537 [ + - ]: 10 : const CTransactionRef& tx{*opt_tx};
3538 : :
3539 [ + - + - : 30 : LogInfo("[privatebroadcast] P2P handshake completed, sending INV for txid=%s%s, peer=%d%s",
+ - + - -
- + - + -
+ - - - ]
3540 : : tx->GetHash().ToString(), tx->HasWitness() ? strprintf(", wtxid=%s", tx->GetWitnessHash().ToString()) : "",
3541 : : node.GetId(), node.LogIP(fLogIPs));
3542 : :
3543 [ + - + - : 20 : MakeAndPushMessage(node, NetMsgType::INV, std::vector<CInv>{{CInv{MSG_TX, tx->GetHash().ToUint256()}}});
+ - + - ]
3544 : 10 : }
3545 : :
3546 : 161848 : void PeerManagerImpl::ProcessMessage(CNode& pfrom, const std::string& msg_type, DataStream& vRecv,
3547 : : const std::chrono::microseconds time_received,
3548 : : const std::atomic<bool>& interruptMsgProc)
3549 : : {
3550 : 161848 : AssertLockHeld(g_msgproc_mutex);
3551 : :
3552 [ + - - + : 323696 : LogDebug(BCLog::NET, "received: %s (%u bytes) peer=%d\n", SanitizeString(msg_type), vRecv.size(), pfrom.GetId());
- + + - ]
3553 : :
3554 : 161848 : PeerRef peer = GetPeerRef(pfrom.GetId());
3555 [ + - ]: 161848 : if (peer == nullptr) return;
3556 : :
3557 [ + + ]: 161848 : if (msg_type == NetMsgType::VERSION) {
3558 [ + + ]: 1623 : if (pfrom.nVersion != 0) {
3559 [ + - + - : 1 : LogDebug(BCLog::NET, "redundant version message from peer=%d\n", pfrom.GetId());
+ - ]
3560 : 1 : return;
3561 : : }
3562 : :
3563 : 1622 : int64_t nTime;
3564 [ + - ]: 1622 : CService addrMe;
3565 : 1622 : uint64_t nNonce = 1;
3566 : 1622 : ServiceFlags nServices;
3567 : 1622 : int nVersion;
3568 [ + - ]: 1622 : std::string cleanSubVer;
3569 : 1622 : int starting_height = -1;
3570 : 1622 : bool fRelay = true;
3571 : :
3572 [ + - + - : 1622 : vRecv >> nVersion >> Using<CustomUintFormatter<8>>(nServices) >> nTime;
+ - ]
3573 [ - + ]: 1622 : if (nTime < 0) {
3574 : 0 : nTime = 0;
3575 : : }
3576 [ + - ]: 1622 : vRecv.ignore(8); // Ignore the addrMe service bits sent by the peer
3577 [ + - ]: 1622 : vRecv >> CNetAddr::V1(addrMe);
3578 [ + + ]: 1622 : if (!pfrom.IsInboundConn())
3579 : : {
3580 : : // Overwrites potentially existing services. In contrast to this,
3581 : : // unvalidated services received via gossip relay in ADDR/ADDRV2
3582 : : // messages are only ever added but cannot replace existing ones.
3583 [ + - ]: 597 : m_addrman.SetServices(pfrom.addr, nServices);
3584 : : }
3585 [ + + + + ]: 1622 : if (pfrom.ExpectServicesFromConn() && !HasAllDesirableServiceFlags(nServices))
3586 : : {
3587 [ + - + - : 48 : LogDebug(BCLog::NET, "peer does not offer the expected services (%08x offered, %08x expected), %s\n",
+ - + - ]
3588 : : nServices,
3589 : : GetDesirableServiceFlags(nServices),
3590 : : pfrom.DisconnectMsg(fLogIPs));
3591 : 24 : pfrom.fDisconnect = true;
3592 : 24 : return;
3593 : : }
3594 : :
3595 [ + + ]: 1598 : if (nVersion < MIN_PEER_PROTO_VERSION) {
3596 : : // disconnect from peers older than this proto version
3597 [ + - + - : 2 : LogDebug(BCLog::NET, "peer using obsolete version %i, %s\n", nVersion, pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
3598 : 1 : pfrom.fDisconnect = true;
3599 : 1 : return;
3600 : : }
3601 : :
3602 [ - + + + ]: 1597 : if (!vRecv.empty()) {
3603 : : // The version message includes information about the sending node which we don't use:
3604 : : // - 8 bytes (service bits)
3605 : : // - 16 bytes (ipv6 address)
3606 : : // - 2 bytes (port)
3607 [ + - ]: 1596 : vRecv.ignore(26);
3608 [ + - ]: 1596 : vRecv >> nNonce;
3609 : : }
3610 [ - + + + ]: 1597 : if (!vRecv.empty()) {
3611 [ + - ]: 1596 : std::string strSubVer;
3612 [ + - ]: 1596 : vRecv >> LIMITED_STRING(strSubVer, MAX_SUBVERSION_LENGTH);
3613 [ - + + - ]: 1596 : cleanSubVer = SanitizeString(strSubVer);
3614 : 1596 : }
3615 [ - + + + ]: 1597 : if (!vRecv.empty()) {
3616 [ + - ]: 1596 : vRecv >> starting_height;
3617 : : }
3618 [ - + + + ]: 1597 : if (!vRecv.empty())
3619 [ + - ]: 1596 : vRecv >> fRelay;
3620 : : // Disconnect if we connected to ourself
3621 [ + + + - : 1597 : if (pfrom.IsInboundConn() && !m_connman.CheckIncomingNonce(nNonce))
+ + ]
3622 : : {
3623 [ + - + - ]: 2 : LogInfo("connected to self at %s, disconnecting\n", pfrom.addr.ToStringAddrPort());
3624 : 2 : pfrom.fDisconnect = true;
3625 : 2 : return;
3626 : : }
3627 : :
3628 [ + + + - : 1595 : if (pfrom.IsInboundConn() && addrMe.IsRoutable())
- + ]
3629 : : {
3630 [ # # ]: 0 : SeenLocal(addrMe);
3631 : : }
3632 : :
3633 : : // Inbound peers send us their version message when they connect.
3634 : : // We send our version message in response.
3635 [ + + ]: 1595 : if (pfrom.IsInboundConn()) {
3636 [ + - ]: 1022 : PushNodeVersion(pfrom, *peer);
3637 : : }
3638 : :
3639 : : // Change version
3640 [ + - ]: 1595 : const int greatest_common_version = std::min(nVersion, PROTOCOL_VERSION);
3641 : 1595 : pfrom.SetCommonVersion(greatest_common_version);
3642 : 1595 : pfrom.nVersion = nVersion;
3643 : :
3644 [ + - ]: 1595 : pfrom.m_has_all_wanted_services = HasAllDesirableServiceFlags(nServices);
3645 [ + - ]: 1595 : peer->m_their_services = nServices;
3646 [ + - ]: 1595 : pfrom.SetAddrLocal(addrMe);
3647 : 1595 : {
3648 [ + - ]: 1595 : LOCK(pfrom.m_subver_mutex);
3649 [ + - + - ]: 3190 : pfrom.cleanSubVer = cleanSubVer;
3650 : 0 : }
3651 [ + + ]: 1595 : peer->m_starting_height = starting_height;
3652 : :
3653 : : // Only initialize the Peer::TxRelay m_relay_txs data structure if:
3654 : : // - this isn't an outbound block-relay-only connection, and
3655 : : // - this isn't an outbound feeler connection, and
3656 : : // - fRelay=true (the peer wishes to receive transaction announcements)
3657 : : // or we're offering NODE_BLOOM to this peer. NODE_BLOOM means that
3658 : : // the peer may turn on transaction relay later.
3659 [ + + ]: 1595 : if (!pfrom.IsBlockOnlyConn() &&
3660 [ + + + + : 1595 : !pfrom.IsFeelerConn() &&
+ + ]
3661 [ + + ]: 4 : (fRelay || (peer->m_our_services & NODE_BLOOM))) {
3662 [ + - ]: 1560 : auto* const tx_relay = peer->SetTxRelay();
3663 : 1560 : {
3664 [ + - ]: 1560 : LOCK(tx_relay->m_bloom_filter_mutex);
3665 [ + - ]: 1560 : tx_relay->m_relay_txs = fRelay; // set to true after we get the first filter* message
3666 : 1560 : }
3667 [ + + ]: 1560 : if (fRelay) pfrom.m_relays_txs = true;
3668 : : }
3669 : :
3670 [ + - ]: 1595 : const auto mapped_as{m_connman.GetMappedAS(pfrom.addr)};
3671 [ + - + - : 3190 : LogDebug(BCLog::NET, "receive version message: %s: version %d, blocks=%d, us=%s, txrelay=%d, peer=%d%s%s\n",
- + - - +
- + - + -
+ - ]
3672 : : cleanSubVer, pfrom.nVersion,
3673 : : peer->m_starting_height, addrMe.ToStringAddrPort(), fRelay, pfrom.GetId(),
3674 : : pfrom.LogIP(fLogIPs), (mapped_as ? strprintf(", mapped_as=%d", mapped_as) : ""));
3675 : :
3676 [ + + ]: 1595 : if (pfrom.IsPrivateBroadcastConn()) {
3677 [ + - ]: 10 : if (fRelay) {
3678 [ + - + - ]: 20 : MakeAndPushMessage(pfrom, NetMsgType::VERACK);
3679 : : } else {
3680 [ # # # # ]: 0 : LogInfo("[privatebroadcast] Disconnecting: does not support transactions relay (connected in vain), peer=%d%s",
3681 : : pfrom.GetId(), pfrom.LogIP(fLogIPs));
3682 : 0 : pfrom.fDisconnect = true;
3683 : : }
3684 : 10 : return;
3685 : : }
3686 : :
3687 [ + + ]: 1585 : if (greatest_common_version >= WTXID_RELAY_VERSION) {
3688 [ + - + - ]: 1581 : MakeAndPushMessage(pfrom, NetMsgType::WTXIDRELAY);
3689 : : }
3690 : :
3691 : : // Signal ADDRv2 support (BIP155).
3692 : 1581 : if (greatest_common_version >= 70016) {
3693 : : // BIP155 defines addrv2 and sendaddrv2 for all protocol versions, but some
3694 : : // implementations reject messages they don't know. As a courtesy, don't send
3695 : : // it to nodes with a version before 70016, as no software is known to support
3696 : : // BIP155 that doesn't announce at least that protocol version number.
3697 [ + - + - ]: 1581 : MakeAndPushMessage(pfrom, NetMsgType::SENDADDRV2);
3698 : : }
3699 : :
3700 [ + + ]: 1581 : if (greatest_common_version >= WTXID_RELAY_VERSION && m_txreconciliation) {
3701 : : // Per BIP-330, we announce txreconciliation support if:
3702 : : // - protocol version per the peer's VERSION message supports WTXID_RELAY;
3703 : : // - transaction relay is supported per the peer's VERSION message
3704 : : // - this is not a block-relay-only connection and not a feeler
3705 : : // - this is not an addr fetch connection;
3706 : : // - we are not in -blocksonly mode.
3707 [ + - ]: 15 : const auto* tx_relay = peer->GetTxRelay();
3708 [ + - + + : 22 : if (tx_relay && WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs) &&
+ - ]
3709 [ + + + + : 25 : !pfrom.IsAddrFetchConn() && !m_opts.ignore_incoming_txs) {
+ + ]
3710 [ + - ]: 8 : const uint64_t recon_salt = m_txreconciliation->PreRegisterPeer(pfrom.GetId());
3711 [ + - + - ]: 16 : MakeAndPushMessage(pfrom, NetMsgType::SENDTXRCNCL,
3712 : : TXRECONCILIATION_VERSION, recon_salt);
3713 : : }
3714 : : }
3715 : :
3716 [ + - + - ]: 1585 : MakeAndPushMessage(pfrom, NetMsgType::VERACK);
3717 : :
3718 : : // Potentially mark this peer as a preferred download peer.
3719 : 1585 : {
3720 [ + - ]: 1585 : LOCK(cs_main);
3721 : 1585 : CNodeState* state = State(pfrom.GetId());
3722 [ + + + + : 1585 : state->fPreferredDownload = (!pfrom.IsInboundConn() || pfrom.HasPermission(NetPermissionFlags::NoBan)) && !pfrom.IsAddrFetchConn() && CanServeBlocks(*peer);
+ + + + ]
3723 [ + - ]: 1585 : m_num_preferred_download_peers += state->fPreferredDownload;
3724 : 1585 : }
3725 : :
3726 : : // Attempt to initialize address relay for outbound peers and use result
3727 : : // to decide whether to send GETADDR, so that we don't send it to
3728 : : // inbound or outbound block-relay-only peers.
3729 : 1585 : bool send_getaddr{false};
3730 [ + + ]: 1585 : if (!pfrom.IsInboundConn()) {
3731 [ + - ]: 563 : send_getaddr = SetupAddressRelay(pfrom, *peer);
3732 : : }
3733 [ + + ]: 563 : if (send_getaddr) {
3734 : : // Do a one-time address fetch to help populate/update our addrman.
3735 : : // If we're starting up for the first time, our addrman may be pretty
3736 : : // empty, so this mechanism is important to help us connect to the network.
3737 : : // We skip this for block-relay-only peers. We want to avoid
3738 : : // potentially leaking addr information and we do not want to
3739 : : // indicate to the peer that we will participate in addr relay.
3740 [ + - + - ]: 534 : MakeAndPushMessage(pfrom, NetMsgType::GETADDR);
3741 : 534 : peer->m_getaddr_sent = true;
3742 : : // When requesting a getaddr, accept an additional MAX_ADDR_TO_SEND addresses in response
3743 : : // (bypassing the MAX_ADDR_PROCESSING_TOKEN_BUCKET limit).
3744 : 534 : peer->m_addr_token_bucket += MAX_ADDR_TO_SEND;
3745 : : }
3746 : :
3747 [ + + ]: 1585 : if (!pfrom.IsInboundConn()) {
3748 : : // For non-inbound connections, we update the addrman to record
3749 : : // connection success so that addrman will have an up-to-date
3750 : : // notion of which peers are online and available.
3751 : : //
3752 : : // While we strive to not leak information about block-relay-only
3753 : : // connections via the addrman, not moving an address to the tried
3754 : : // table is also potentially detrimental because new-table entries
3755 : : // are subject to eviction in the event of addrman collisions. We
3756 : : // mitigate the information-leak by never calling
3757 : : // AddrMan::Connected() on block-relay-only peers; see
3758 : : // FinalizeNode().
3759 : : //
3760 : : // This moves an address from New to Tried table in Addrman,
3761 : : // resolves tried-table collisions, etc.
3762 [ + - ]: 563 : m_addrman.Good(pfrom.addr);
3763 : : }
3764 : :
3765 : 1585 : peer->m_time_offset = NodeSeconds{std::chrono::seconds{nTime}} - Now<NodeSeconds>();
3766 [ + + ]: 1585 : if (!pfrom.IsInboundConn()) {
3767 : : // Don't use timedata samples from inbound peers to make it
3768 : : // harder for others to create false warnings about our clock being out of sync.
3769 [ + - ]: 563 : m_outbound_time_offsets.Add(peer->m_time_offset);
3770 [ + - ]: 563 : m_outbound_time_offsets.WarnIfOutOfSync();
3771 : : }
3772 : :
3773 : : // If the peer is old enough to have the old alert system, send it the final alert.
3774 [ - + ]: 1585 : if (greatest_common_version <= 70012) {
3775 : 0 : constexpr auto finalAlert{"60010000000000000000000000ffffff7f00000000ffffff7ffeffff7f01ffffff7f00000000ffffff7f00ffffff7f002f555247454e543a20416c657274206b657920636f6d70726f6d697365642c2075706772616465207265717569726564004630440220653febd6410f470f6bae11cad19c48413becb1ac2c17f908fd0fd53bdc3abd5202206d0e9c96fe88d4a0f01ed9dedae2b6f9e00da94cad0fecaae66ecf689bf71b50"_hex};
3776 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, "alert", finalAlert);
3777 : : }
3778 : :
3779 : : // Feeler connections exist only to verify if address is online.
3780 [ + + ]: 1585 : if (pfrom.IsFeelerConn()) {
3781 [ + - + - : 8 : LogDebug(BCLog::NET, "feeler connection completed, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
3782 : 4 : pfrom.fDisconnect = true;
3783 : : }
3784 : 1585 : return;
3785 : 1622 : }
3786 : :
3787 [ + + ]: 160225 : if (pfrom.nVersion == 0) {
3788 : : // Must have a version message before anything else
3789 [ + - + - : 8 : LogDebug(BCLog::NET, "non-version message before version handshake. Message \"%s\" from peer=%d\n", SanitizeString(msg_type), pfrom.GetId());
- + + - +
- ]
3790 : 4 : return;
3791 : : }
3792 : :
3793 [ + + ]: 160221 : if (msg_type == NetMsgType::VERACK) {
3794 [ - + ]: 1581 : if (pfrom.fSuccessfullyConnected) {
3795 [ # # # # : 0 : LogDebug(BCLog::NET, "ignoring redundant verack message from peer=%d\n", pfrom.GetId());
# # ]
3796 : 0 : return;
3797 : : }
3798 : :
3799 : 3162 : auto new_peer_msg = [&]() {
3800 : 1581 : const auto mapped_as{m_connman.GetMappedAS(pfrom.addr)};
3801 : 1581 : return strprintf("New %s peer connected: transport: %s, version: %d, blocks=%d peer=%d%s%s\n",
3802 [ + - ]: 3162 : pfrom.ConnectionTypeAsString(),
3803 [ + - ]: 3162 : TransportTypeAsString(pfrom.m_transport->GetInfo().transport_type),
3804 : 1581 : pfrom.nVersion.load(), peer->m_starting_height,
3805 [ + - ]: 3162 : pfrom.GetId(), pfrom.LogIP(fLogIPs),
3806 [ - + + - ]: 4743 : (mapped_as ? strprintf(", mapped_as=%d", mapped_as) : ""));
3807 : 1581 : };
3808 : :
3809 : : // Log successful connections unconditionally for outbound, but not for inbound as those
3810 : : // can be triggered by an attacker at high rate.
3811 [ + + ]: 1581 : if (pfrom.IsInboundConn()) {
3812 [ + - + - : 2026 : LogDebug(BCLog::NET, "%s", new_peer_msg());
+ - + - ]
3813 : : } else {
3814 [ + - + - ]: 1136 : LogInfo("%s", new_peer_msg());
3815 : : }
3816 : :
3817 [ + - + + ]: 1581 : if (auto tx_relay = peer->GetTxRelay()) {
3818 : : // `TxRelay::m_tx_inventory_to_send` must be empty before the
3819 : : // version handshake is completed as
3820 : : // `TxRelay::m_next_inv_send_time` is first initialised in
3821 : : // `SendMessages` after the verack is received. Any transactions
3822 : : // received during the version handshake would otherwise
3823 : : // immediately be advertised without random delay, potentially
3824 : : // leaking the time of arrival to a spy.
3825 [ + - + - : 3102 : Assume(WITH_LOCK(
- + + - ]
3826 : : tx_relay->m_tx_inventory_mutex,
3827 : : return tx_relay->m_tx_inventory_to_send.empty() &&
3828 : : tx_relay->m_next_inv_send_time == 0s));
3829 : : }
3830 : :
3831 [ + + ]: 1581 : if (pfrom.IsPrivateBroadcastConn()) {
3832 [ + - ]: 10 : pfrom.fSuccessfullyConnected = true;
3833 : : // The peer may intend to later send us NetMsgType::FEEFILTER limiting
3834 : : // cheap transactions, but we don't wait for that and thus we may send
3835 : : // them a transaction below their threshold. This is ok because this
3836 : : // relay logic is designed to work even in cases when the peer drops
3837 : : // the transaction (due to it being too cheap, or for other reasons).
3838 [ + - ]: 10 : PushPrivateBroadcastTx(pfrom);
3839 : : return;
3840 : : }
3841 : :
3842 [ + - ]: 1571 : if (pfrom.GetCommonVersion() >= SHORT_IDS_BLOCKS_VERSION) {
3843 : : // Tell our peer we are willing to provide version 2 cmpctblocks.
3844 : : // However, we do not request new block announcements using
3845 : : // cmpctblock messages.
3846 : : // We send this to non-NODE NETWORK peers as well, because
3847 : : // they may wish to request compact blocks from us
3848 [ + - + - ]: 3142 : MakeAndPushMessage(pfrom, NetMsgType::SENDCMPCT, /*high_bandwidth=*/false, /*version=*/CMPCTBLOCKS_VERSION);
3849 : : }
3850 : :
3851 [ + + ]: 1571 : if (m_txreconciliation) {
3852 [ + + + - : 11 : if (!peer->m_wtxid_relay || !m_txreconciliation->IsPeerRegistered(pfrom.GetId())) {
+ - ]
3853 : : // We could have optimistically pre-registered/registered the peer. In that case,
3854 : : // we should forget about the reconciliation state here if this wasn't followed
3855 : : // by WTXIDRELAY (since WTXIDRELAY can't be announced later).
3856 [ + - ]: 11 : m_txreconciliation->ForgetPeer(pfrom.GetId());
3857 : : }
3858 : : }
3859 : :
3860 : 1571 : {
3861 [ + - + - ]: 1571 : LOCK2(::cs_main, m_tx_download_mutex);
3862 : 1571 : const CNodeState* state = State(pfrom.GetId());
3863 : 1571 : m_txdownloadman.ConnectedPeer(pfrom.GetId(), node::TxDownloadConnectionInfo {
3864 [ + - ]: 1571 : .m_preferred = state->fPreferredDownload,
3865 [ + - ]: 1571 : .m_relay_permissions = pfrom.HasPermission(NetPermissionFlags::Relay),
3866 [ + - ]: 1571 : .m_wtxid_relay = peer->m_wtxid_relay,
3867 : : });
3868 [ + - ]: 1571 : }
3869 : :
3870 : 1571 : pfrom.fSuccessfullyConnected = true;
3871 : 1571 : return;
3872 : : }
3873 : :
3874 [ + + ]: 158640 : if (msg_type == NetMsgType::SENDHEADERS) {
3875 : 702 : peer->m_prefers_headers = true;
3876 : 702 : return;
3877 : : }
3878 : :
3879 [ + + ]: 157938 : if (msg_type == NetMsgType::SENDCMPCT) {
3880 : 1246 : bool sendcmpct_hb{false};
3881 : 1246 : uint64_t sendcmpct_version{0};
3882 [ + - + - ]: 1246 : vRecv >> sendcmpct_hb >> sendcmpct_version;
3883 : :
3884 : : // Only support compact block relay with witnesses
3885 [ + + ]: 1246 : if (sendcmpct_version != CMPCTBLOCKS_VERSION) return;
3886 : :
3887 [ + - ]: 1233 : LOCK(cs_main);
3888 : 1233 : CNodeState* nodestate = State(pfrom.GetId());
3889 : 1233 : nodestate->m_provides_cmpctblocks = true;
3890 : 1233 : nodestate->m_requested_hb_cmpctblocks = sendcmpct_hb;
3891 : : // save whether peer selects us as BIP152 high-bandwidth peer
3892 : : // (receiving sendcmpct(1) signals high-bandwidth, sendcmpct(0) low-bandwidth)
3893 [ + - ]: 1233 : pfrom.m_bip152_highbandwidth_from = sendcmpct_hb;
3894 [ + - ]: 1233 : return;
3895 : 1233 : }
3896 : :
3897 : : // BIP339 defines feature negotiation of wtxidrelay, which must happen between
3898 : : // VERSION and VERACK to avoid relay problems from switching after a connection is up.
3899 [ + + ]: 156692 : if (msg_type == NetMsgType::WTXIDRELAY) {
3900 [ - + ]: 1512 : if (pfrom.fSuccessfullyConnected) {
3901 : : // Disconnect peers that send a wtxidrelay message after VERACK.
3902 [ # # # # : 0 : LogDebug(BCLog::NET, "wtxidrelay received after verack, %s\n", pfrom.DisconnectMsg(fLogIPs));
# # # # ]
3903 : 0 : pfrom.fDisconnect = true;
3904 : 0 : return;
3905 : : }
3906 [ + + ]: 1512 : if (pfrom.GetCommonVersion() >= WTXID_RELAY_VERSION) {
3907 [ + - ]: 1510 : if (!peer->m_wtxid_relay) {
3908 : 1510 : peer->m_wtxid_relay = true;
3909 : 1510 : m_wtxid_relay_peers++;
3910 : : } else {
3911 [ # # # # : 0 : LogDebug(BCLog::NET, "ignoring duplicate wtxidrelay from peer=%d\n", pfrom.GetId());
# # ]
3912 : : }
3913 : : } else {
3914 [ + - + - : 2 : LogDebug(BCLog::NET, "ignoring wtxidrelay due to old common version=%d from peer=%d\n", pfrom.GetCommonVersion(), pfrom.GetId());
+ - ]
3915 : : }
3916 : 1512 : return;
3917 : : }
3918 : :
3919 : : // BIP155 defines feature negotiation of addrv2 and sendaddrv2, which must happen
3920 : : // between VERSION and VERACK.
3921 [ + + ]: 155180 : if (msg_type == NetMsgType::SENDADDRV2) {
3922 [ + + ]: 861 : if (pfrom.fSuccessfullyConnected) {
3923 : : // Disconnect peers that send a SENDADDRV2 message after VERACK.
3924 [ + - + - : 2 : LogDebug(BCLog::NET, "sendaddrv2 received after verack, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
3925 : 1 : pfrom.fDisconnect = true;
3926 : 1 : return;
3927 : : }
3928 : 860 : peer->m_wants_addrv2 = true;
3929 : 860 : return;
3930 : : }
3931 : :
3932 : : // Received from a peer demonstrating readiness to announce transactions via reconciliations.
3933 : : // This feature negotiation must happen between VERSION and VERACK to avoid relay problems
3934 : : // from switching announcement protocols after the connection is up.
3935 [ + + ]: 154319 : if (msg_type == NetMsgType::SENDTXRCNCL) {
3936 [ + + ]: 9 : if (!m_txreconciliation) {
3937 [ + - + - : 1 : LogDebug(BCLog::NET, "sendtxrcncl from peer=%d ignored, as our node does not have txreconciliation enabled\n", pfrom.GetId());
+ - ]
3938 : 1 : return;
3939 : : }
3940 : :
3941 [ + + ]: 8 : if (pfrom.fSuccessfullyConnected) {
3942 [ + - + - : 2 : LogDebug(BCLog::NET, "sendtxrcncl received after verack, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
3943 : 1 : pfrom.fDisconnect = true;
3944 : 1 : return;
3945 : : }
3946 : :
3947 : : // Peer must not offer us reconciliations if we specified no tx relay support in VERSION.
3948 [ + + ]: 7 : if (RejectIncomingTxs(pfrom)) {
3949 [ + - + - : 2 : LogDebug(BCLog::NET, "sendtxrcncl received to which we indicated no tx relay, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
3950 : 1 : pfrom.fDisconnect = true;
3951 : 1 : return;
3952 : : }
3953 : :
3954 : : // Peer must not offer us reconciliations if they specified no tx relay support in VERSION.
3955 : : // This flag might also be false in other cases, but the RejectIncomingTxs check above
3956 : : // eliminates them, so that this flag fully represents what we are looking for.
3957 [ + - ]: 6 : const auto* tx_relay = peer->GetTxRelay();
3958 [ + - + - : 12 : if (!tx_relay || !WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs)) {
+ - + - ]
3959 [ # # # # : 0 : LogDebug(BCLog::NET, "sendtxrcncl received which indicated no tx relay to us, %s\n", pfrom.DisconnectMsg(fLogIPs));
# # # # ]
3960 : 0 : pfrom.fDisconnect = true;
3961 : 0 : return;
3962 : : }
3963 : :
3964 : 6 : uint32_t peer_txreconcl_version;
3965 : 6 : uint64_t remote_salt;
3966 [ + - + - ]: 6 : vRecv >> peer_txreconcl_version >> remote_salt;
3967 : :
3968 [ + - ]: 6 : const ReconciliationRegisterResult result = m_txreconciliation->RegisterPeer(pfrom.GetId(), pfrom.IsInboundConn(),
3969 : : peer_txreconcl_version, remote_salt);
3970 [ + + + + ]: 6 : switch (result) {
3971 : 1 : case ReconciliationRegisterResult::NOT_FOUND:
3972 [ + - + - : 1 : LogDebug(BCLog::NET, "Ignore unexpected txreconciliation signal from peer=%d\n", pfrom.GetId());
+ - ]
3973 : : break;
3974 : : case ReconciliationRegisterResult::SUCCESS:
3975 : : break;
3976 : 1 : case ReconciliationRegisterResult::ALREADY_REGISTERED:
3977 [ + - + - : 2 : LogDebug(BCLog::NET, "txreconciliation protocol violation (sendtxrcncl received from already registered peer), %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
3978 : 1 : pfrom.fDisconnect = true;
3979 : 1 : return;
3980 : 1 : case ReconciliationRegisterResult::PROTOCOL_VIOLATION:
3981 [ + - + - : 2 : LogDebug(BCLog::NET, "txreconciliation protocol violation, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
3982 : 1 : pfrom.fDisconnect = true;
3983 : 1 : return;
3984 : : }
3985 : 4 : return;
3986 : : }
3987 : :
3988 [ + + ]: 154310 : if (!pfrom.fSuccessfullyConnected) {
3989 [ + - + - : 16 : LogDebug(BCLog::NET, "Unsupported message \"%s\" prior to verack from peer=%d\n", SanitizeString(msg_type), pfrom.GetId());
- + + - +
- ]
3990 : 8 : return;
3991 : : }
3992 : :
3993 [ + + ]: 154302 : if (pfrom.IsPrivateBroadcastConn()) {
3994 [ + + + + ]: 22 : if (msg_type != NetMsgType::PONG && msg_type != NetMsgType::GETDATA) {
3995 [ + - + - : 4 : LogDebug(BCLog::PRIVBROADCAST, "Ignoring incoming message '%s', peer=%d%s", msg_type, pfrom.GetId(), pfrom.LogIP(fLogIPs));
+ - + - ]
3996 : 2 : return;
3997 : : }
3998 : : }
3999 : :
4000 [ + + + + ]: 154300 : if (msg_type == NetMsgType::ADDR || msg_type == NetMsgType::ADDRV2) {
4001 : 59 : const auto ser_params{
4002 [ + + ]: 59 : msg_type == NetMsgType::ADDRV2 ?
4003 : : // Set V2 param so that the CNetAddr and CAddress
4004 : : // unserialize methods know that an address in v2 format is coming.
4005 : : CAddress::V2_NETWORK :
4006 : : CAddress::V1_NETWORK,
4007 : : };
4008 : :
4009 : 59 : std::vector<CAddress> vAddr;
4010 : :
4011 [ + + ]: 59 : vRecv >> ser_params(vAddr);
4012 : :
4013 [ + - + + ]: 51 : if (!SetupAddressRelay(pfrom, *peer)) {
4014 [ + - + - : 10 : LogDebug(BCLog::NET, "ignoring %s message from %s peer=%d\n", msg_type, pfrom.ConnectionTypeAsString(), pfrom.GetId());
+ - + - ]
4015 : 5 : return;
4016 : : }
4017 : :
4018 [ - + + + ]: 46 : if (vAddr.size() > MAX_ADDR_TO_SEND)
4019 : : {
4020 [ + - + - ]: 2 : Misbehaving(*peer, strprintf("%s message size = %u", msg_type, vAddr.size()));
4021 : 2 : return;
4022 : : }
4023 : :
4024 : : // Store the new addresses
4025 : 44 : std::vector<CAddress> vAddrOk;
4026 : 44 : const auto current_a_time{Now<NodeSeconds>()};
4027 : :
4028 : : // Update/increment addr rate limiting bucket.
4029 : 44 : const auto current_time{GetTime<std::chrono::microseconds>()};
4030 [ + + ]: 44 : if (peer->m_addr_token_bucket < MAX_ADDR_PROCESSING_TOKEN_BUCKET) {
4031 : : // Don't increment bucket if it's already full
4032 [ + + ]: 40 : const auto time_diff = std::max(current_time - peer->m_addr_token_timestamp, 0us);
4033 : 40 : const double increment = Ticks<SecondsDouble>(time_diff) * MAX_ADDR_RATE_PER_SECOND;
4034 [ + + ]: 61 : peer->m_addr_token_bucket = std::min<double>(peer->m_addr_token_bucket + increment, MAX_ADDR_PROCESSING_TOKEN_BUCKET);
4035 : : }
4036 : 44 : peer->m_addr_token_timestamp = current_time;
4037 : :
4038 : 44 : const bool rate_limited = !pfrom.HasPermission(NetPermissionFlags::Addr);
4039 : 44 : uint64_t num_proc = 0;
4040 : 44 : uint64_t num_rate_limit = 0;
4041 : 44 : std::shuffle(vAddr.begin(), vAddr.end(), m_rng);
4042 [ + + ]: 3321 : for (CAddress& addr : vAddr)
4043 : : {
4044 [ + - ]: 3277 : if (interruptMsgProc)
4045 : : return;
4046 : :
4047 : : // Apply rate limiting.
4048 [ + + ]: 3277 : if (peer->m_addr_token_bucket < 1.0) {
4049 [ + + ]: 2019 : if (rate_limited) {
4050 : 1998 : ++num_rate_limit;
4051 : 1998 : continue;
4052 : : }
4053 : : } else {
4054 : 1258 : peer->m_addr_token_bucket -= 1.0;
4055 : : }
4056 : : // We only bother storing full nodes, though this may include
4057 : : // things which we would not make an outbound connection to, in
4058 : : // part because we may make feeler connections to them.
4059 [ - + - - ]: 1279 : if (!MayHaveUsefulAddressDB(addr.nServices) && !HasAllDesirableServiceFlags(addr.nServices))
4060 : 0 : continue;
4061 : :
4062 [ + - - + ]: 1279 : if (addr.nTime <= NodeSeconds{100000000s} || addr.nTime > current_a_time + 10min) {
4063 : 0 : addr.nTime = current_a_time - 5 * 24h;
4064 : : }
4065 [ + - ]: 1279 : AddAddressKnown(*peer, addr);
4066 [ + - + - : 1279 : if (m_banman && (m_banman->IsDiscouraged(addr) || m_banman->IsBanned(addr))) {
+ - + - -
+ ]
4067 : : // Do not process banned/discouraged addresses beyond remembering we received them
4068 : 0 : continue;
4069 : : }
4070 : 1279 : ++num_proc;
4071 [ + - ]: 1279 : const bool reachable{g_reachable_nets.Contains(addr)};
4072 [ + - + + : 1955 : if (addr.nTime > current_a_time - 10min && !peer->m_getaddr_sent && vAddr.size() <= 10 && addr.IsRoutable()) {
+ + + - +
+ ]
4073 : : // Relay to a limited number of other nodes
4074 [ + - ]: 53 : RelayAddress(pfrom.GetId(), addr, reachable);
4075 : : }
4076 : : // Do not store addresses outside our network
4077 [ + + ]: 1279 : if (reachable) {
4078 [ + - ]: 1277 : vAddrOk.push_back(addr);
4079 : : }
4080 : : }
4081 [ + - ]: 44 : peer->m_addr_processed += num_proc;
4082 : 44 : peer->m_addr_rate_limited += num_rate_limit;
4083 [ + - + - : 44 : LogDebug(BCLog::NET, "Received addr: %u addresses (%u processed, %u rate-limited) from peer=%d\n",
- + + - ]
4084 : : vAddr.size(), num_proc, num_rate_limit, pfrom.GetId());
4085 : :
4086 [ + - ]: 44 : m_addrman.Add(vAddrOk, pfrom.addr, 2h);
4087 [ - + + - ]: 44 : if (vAddr.size() < 1000) peer->m_getaddr_sent = false;
4088 : :
4089 : : // AddrFetch: Require multiple addresses to avoid disconnecting on self-announcements
4090 [ + + + + ]: 44 : if (pfrom.IsAddrFetchConn() && vAddr.size() > 1) {
4091 [ + - + - : 2 : LogDebug(BCLog::NET, "addrfetch connection completed, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
4092 : 1 : pfrom.fDisconnect = true;
4093 : : }
4094 : 44 : return;
4095 : 59 : }
4096 : :
4097 [ + + ]: 154241 : if (msg_type == NetMsgType::INV) {
4098 : 10842 : std::vector<CInv> vInv;
4099 [ + - ]: 10842 : vRecv >> vInv;
4100 [ - + + + ]: 10842 : if (vInv.size() > MAX_INV_SZ)
4101 : : {
4102 [ + - + - ]: 1 : Misbehaving(*peer, strprintf("inv message size = %u", vInv.size()));
4103 : 1 : return;
4104 : : }
4105 : :
4106 : 10841 : const bool reject_tx_invs{RejectIncomingTxs(pfrom)};
4107 : :
4108 [ + - + - ]: 10841 : LOCK2(cs_main, m_tx_download_mutex);
4109 : :
4110 : 10841 : const auto current_time{GetTime<std::chrono::microseconds>()};
4111 : 10841 : uint256* best_block{nullptr};
4112 : :
4113 [ + + ]: 38025 : for (CInv& inv : vInv) {
4114 [ + - ]: 27186 : if (interruptMsgProc) return;
4115 : :
4116 : : // Ignore INVs that don't match wtxidrelay setting.
4117 : : // Note that orphan parent fetching always uses MSG_TX GETDATAs regardless of the wtxidrelay setting.
4118 : : // This is fine as no INV messages are involved in that process.
4119 [ + + ]: 27186 : if (peer->m_wtxid_relay) {
4120 [ + + ]: 27168 : if (inv.IsMsgTx()) continue;
4121 : : } else {
4122 [ + + ]: 18 : if (inv.IsMsgWtx()) continue;
4123 : : }
4124 : :
4125 [ + + ]: 27184 : if (inv.IsMsgBlk()) {
4126 [ + - ]: 721 : const bool fAlreadyHave = AlreadyHaveBlock(inv.hash);
4127 [ + - + - : 1951 : LogDebug(BCLog::NET, "got inv: %s %s peer=%d\n", inv.ToString(), fAlreadyHave ? "have" : "new", pfrom.GetId());
+ + + - +
- ]
4128 : :
4129 [ + - ]: 721 : UpdateBlockAvailability(pfrom.GetId(), inv.hash);
4130 [ + + + - : 721 : if (!fAlreadyHave && !m_chainman.m_blockman.LoadingBlocks() && !IsBlockRequested(inv.hash)) {
- + ]
4131 : : // Headers-first is the primary method of announcement on
4132 : : // the network. If a node fell back to sending blocks by
4133 : : // inv, it may be for a re-org, or because we haven't
4134 : : // completed initial headers sync. The final block hash
4135 : : // provided should be the highest, so send a getheaders and
4136 : : // then fetch the blocks we need to catch up.
4137 : : best_block = &inv.hash;
4138 : : }
4139 [ - + ]: 26463 : } else if (inv.IsGenTxMsg()) {
4140 [ + + ]: 26463 : if (reject_tx_invs) {
4141 [ + - + - : 4 : LogDebug(BCLog::NET, "transaction (%s) inv sent in violation of protocol, %s\n", inv.hash.ToString(), pfrom.DisconnectMsg(fLogIPs));
+ - + - +
- ]
4142 : 2 : pfrom.fDisconnect = true;
4143 : 2 : return;
4144 : : }
4145 [ + - ]: 26461 : const GenTxid gtxid = ToGenTxid(inv);
4146 [ + - ]: 26461 : AddKnownTx(*peer, inv.hash);
4147 : :
4148 [ + - + + ]: 26461 : if (!m_chainman.IsInitialBlockDownload()) {
4149 [ + - ]: 26460 : const bool fAlreadyHave{m_txdownloadman.AddTxAnnouncement(pfrom.GetId(), gtxid, current_time)};
4150 [ + - + - : 76965 : LogDebug(BCLog::NET, "got inv: %s %s peer=%d\n", inv.ToString(), fAlreadyHave ? "have" : "new", pfrom.GetId());
+ + + - +
- ]
4151 : : }
4152 : : } else {
4153 [ - - - - : 27184 : LogDebug(BCLog::NET, "Unknown inv type \"%s\" received from peer=%d\n", inv.ToString(), pfrom.GetId());
- - - - ]
4154 : : }
4155 : : }
4156 : :
4157 [ + + ]: 10839 : if (best_block != nullptr) {
4158 : : // If we haven't started initial headers-sync with this peer, then
4159 : : // consider sending a getheaders now. On initial startup, there's a
4160 : : // reliability vs bandwidth tradeoff, where we are only trying to do
4161 : : // initial headers sync with one peer at a time, with a long
4162 : : // timeout (at which point, if the sync hasn't completed, we will
4163 : : // disconnect the peer and then choose another). In the meantime,
4164 : : // as new blocks are found, we are willing to add one new peer per
4165 : : // block to sync with as well, to sync quicker in the case where
4166 : : // our initial peer is unresponsive (but less bandwidth than we'd
4167 : : // use if we turned on sync with all peers).
4168 [ - + ]: 509 : CNodeState& state{*Assert(State(pfrom.GetId()))};
4169 [ + + + + : 509 : if (state.fSyncStarted || (!peer->m_inv_triggered_getheaders_before_sync && *best_block != m_last_block_inv_triggering_headers_sync)) {
+ + ]
4170 [ + - + - : 496 : if (MaybeSendGetHeaders(pfrom, GetLocator(m_chainman.m_best_header), *peer)) {
+ + ]
4171 [ + - + - : 596 : LogDebug(BCLog::NET, "getheaders (%d) %s to peer=%d\n",
+ - + - ]
4172 : : m_chainman.m_best_header->nHeight, best_block->ToString(),
4173 : : pfrom.GetId());
4174 : : }
4175 [ + + ]: 496 : if (!state.fSyncStarted) {
4176 : 15 : peer->m_inv_triggered_getheaders_before_sync = true;
4177 : : // Update the last block hash that triggered a new headers
4178 : : // sync, so that we don't turn on headers sync with more
4179 : : // than 1 new peer every new block.
4180 : 15 : m_last_block_inv_triggering_headers_sync = *best_block;
4181 : : }
4182 : : }
4183 : : }
4184 : :
4185 : 10839 : return;
4186 [ + - ]: 32524 : }
4187 : :
4188 [ + + ]: 143399 : if (msg_type == NetMsgType::GETDATA) {
4189 : 43516 : std::vector<CInv> vInv;
4190 [ + - ]: 43516 : vRecv >> vInv;
4191 [ - + + + ]: 43516 : if (vInv.size() > MAX_INV_SZ)
4192 : : {
4193 [ + - + - ]: 1 : Misbehaving(*peer, strprintf("getdata message size = %u", vInv.size()));
4194 : 1 : return;
4195 : : }
4196 : :
4197 [ + - + - : 43515 : LogDebug(BCLog::NET, "received getdata (%u invsz) peer=%d\n", vInv.size(), pfrom.GetId());
- + + - ]
4198 : :
4199 [ - + + - ]: 43515 : if (vInv.size() > 0) {
4200 [ + - + - : 87030 : LogDebug(BCLog::NET, "received getdata for: %s peer=%d\n", vInv[0].ToString(), pfrom.GetId());
+ - + - ]
4201 : : }
4202 : :
4203 [ + + ]: 43515 : if (pfrom.IsPrivateBroadcastConn()) {
4204 [ + - ]: 10 : const auto pushed_tx_opt{m_tx_for_private_broadcast.GetTxForNode(pfrom.GetId())};
4205 [ - + ]: 10 : if (!pushed_tx_opt) {
4206 [ # # # # : 0 : LogInfo("[privatebroadcast] Disconnecting: got GETDATA without sending an INV, peer=%d%s",
# # # # #
# # # #
# ]
4207 : : pfrom.GetId(), fLogIPs ? strprintf(", peeraddr=%s", pfrom.addr.ToStringAddrPort()) : "");
4208 : 0 : pfrom.fDisconnect = true;
4209 : 0 : return;
4210 : : }
4211 : :
4212 [ - + ]: 10 : const CTransactionRef& pushed_tx{*pushed_tx_opt};
4213 : :
4214 : : // The GETDATA request must contain exactly one inv and it must be for the transaction
4215 : : // that we INVed to the peer earlier.
4216 [ - + + - : 10 : if (vInv.size() == 1 && vInv[0].IsMsgTx() && vInv[0].hash == pushed_tx->GetHash().ToUint256()) {
+ - - + ]
4217 : :
4218 [ + - + - ]: 10 : MakeAndPushMessage(pfrom, NetMsgType::TX, TX_WITH_WITNESS(*pushed_tx));
4219 : :
4220 : 10 : peer->m_ping_queued = true; // Ensure a ping will be sent: mimic a request via RPC.
4221 [ + - ]: 10 : MaybeSendPing(pfrom, *peer, GetTime<std::chrono::microseconds>());
4222 : : } else {
4223 [ # # # # : 0 : LogInfo("[privatebroadcast] Disconnecting: got an unexpected GETDATA message, peer=%d%s",
# # # # #
# # # #
# ]
4224 : : pfrom.GetId(), fLogIPs ? strprintf(", peeraddr=%s", pfrom.addr.ToStringAddrPort()) : "");
4225 : 0 : pfrom.fDisconnect = true;
4226 : : }
4227 : 10 : return;
4228 : 10 : }
4229 : :
4230 : 43505 : {
4231 [ + - ]: 43505 : LOCK(peer->m_getdata_requests_mutex);
4232 [ + - ]: 43505 : peer->m_getdata_requests.insert(peer->m_getdata_requests.end(), vInv.begin(), vInv.end());
4233 [ + - ]: 43505 : ProcessGetData(pfrom, *peer, interruptMsgProc);
4234 : 0 : }
4235 : :
4236 : 43505 : return;
4237 : 43516 : }
4238 : :
4239 [ + + ]: 99883 : if (msg_type == NetMsgType::GETBLOCKS) {
4240 : 4 : CBlockLocator locator;
4241 : 4 : uint256 hashStop;
4242 [ + - + - ]: 4 : vRecv >> locator >> hashStop;
4243 : :
4244 [ - + + + ]: 4 : if (locator.vHave.size() > MAX_LOCATOR_SZ) {
4245 [ + - + - : 3 : LogDebug(BCLog::NET, "getblocks locator size %lld > %d, %s\n", locator.vHave.size(), MAX_LOCATOR_SZ, pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
4246 : 1 : pfrom.fDisconnect = true;
4247 : 1 : return;
4248 : : }
4249 : :
4250 : : // We might have announced the currently-being-connected tip using a
4251 : : // compact block, which resulted in the peer sending a getblocks
4252 : : // request, which we would otherwise respond to without the new block.
4253 : : // To avoid this situation we simply verify that we are on our best
4254 : : // known chain now. This is super overkill, but we handle it better
4255 : : // for getheaders requests, and there are no known nodes which support
4256 : : // compact blocks but still use getblocks to request blocks.
4257 : 3 : {
4258 : 3 : std::shared_ptr<const CBlock> a_recent_block;
4259 : 3 : {
4260 [ + - ]: 3 : LOCK(m_most_recent_block_mutex);
4261 [ + - ]: 3 : a_recent_block = m_most_recent_block;
4262 : 3 : }
4263 [ + - ]: 3 : BlockValidationState state;
4264 [ + - + - : 9 : if (!m_chainman.ActiveChainstate().ActivateBestChain(state, a_recent_block)) {
+ - + - -
+ ]
4265 [ # # # # : 0 : LogDebug(BCLog::NET, "failed to activate chain (%s)\n", state.ToString());
# # # # ]
4266 : : }
4267 [ + - ]: 3 : }
4268 : :
4269 [ + - ]: 3 : LOCK(cs_main);
4270 : :
4271 : : // Find the last block the caller has in the main chain
4272 [ + - + - ]: 3 : const CBlockIndex* pindex = m_chainman.ActiveChainstate().FindForkInGlobalIndex(locator);
4273 : :
4274 : : // Send the rest of the chain
4275 [ + - ]: 3 : if (pindex)
4276 [ + - ]: 3 : pindex = m_chainman.ActiveChain().Next(pindex);
4277 : 3 : int nLimit = 500;
4278 [ + - + - : 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());
+ - + - -
- + - +
- ]
4279 [ + - + + ]: 22 : for (; pindex; pindex = m_chainman.ActiveChain().Next(pindex))
4280 : : {
4281 [ - + ]: 19 : if (pindex->GetBlockHash() == hashStop)
4282 : : {
4283 [ # # # # : 0 : LogDebug(BCLog::NET, " getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
# # # # ]
4284 : : break;
4285 : : }
4286 : : // If pruning, don't inv blocks unless we have on disk and are likely to still have
4287 : : // for some reasonable time window (1 hour) that block relay might require.
4288 : 19 : const int nPrunedBlocksLikelyToHave = MIN_BLOCKS_TO_KEEP - 3600 / m_chainparams.GetConsensus().nPowTargetSpacing;
4289 [ - + - - : 19 : if (m_chainman.m_blockman.IsPruneMode() && (!(pindex->nStatus & BLOCK_HAVE_DATA) || pindex->nHeight <= m_chainman.ActiveChain().Tip()->nHeight - nPrunedBlocksLikelyToHave)) {
- - - - -
- ]
4290 [ # # # # : 0 : LogDebug(BCLog::NET, " getblocks stopping, pruned or too old block at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
# # # # ]
4291 : : break;
4292 : : }
4293 [ + - + - : 57 : WITH_LOCK(peer->m_block_inv_mutex, peer->m_blocks_for_inv_relay.push_back(pindex->GetBlockHash()));
+ - ]
4294 [ - + ]: 19 : if (--nLimit <= 0) {
4295 : : // When this block is requested, we'll send an inv that'll
4296 : : // trigger the peer to getblocks the next batch of inventory.
4297 [ # # # # : 0 : LogDebug(BCLog::NET, " getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
# # # # ]
4298 [ # # # # ]: 0 : WITH_LOCK(peer->m_block_inv_mutex, {peer->m_continuation_block = pindex->GetBlockHash();});
4299 : : break;
4300 : : }
4301 : : }
4302 [ + - ]: 3 : return;
4303 : 7 : }
4304 : :
4305 [ + + ]: 99879 : if (msg_type == NetMsgType::GETBLOCKTXN) {
4306 : 589 : BlockTransactionsRequest req;
4307 [ + - ]: 589 : vRecv >> req;
4308 : : // Verify differential encoding invariant: indexes must be strictly increasing
4309 : : // DifferenceFormatter should guarantee this property during deserialization
4310 [ - + + + ]: 1662 : for (size_t i = 1; i < req.indexes.size(); ++i) {
4311 : 1073 : Assume(req.indexes[i] > req.indexes[i-1]);
4312 : : }
4313 : :
4314 : 589 : std::shared_ptr<const CBlock> recent_block;
4315 : 589 : {
4316 [ + - ]: 589 : LOCK(m_most_recent_block_mutex);
4317 [ + + ]: 589 : if (m_most_recent_block_hash == req.blockhash)
4318 : 516 : recent_block = m_most_recent_block;
4319 : : // Unlock m_most_recent_block_mutex to avoid cs_main lock inversion
4320 : 589 : }
4321 [ + + ]: 589 : if (recent_block) {
4322 [ + - ]: 516 : SendBlockTransactions(pfrom, *peer, *recent_block, req);
4323 : : return;
4324 : : }
4325 : :
4326 : 73 : FlatFilePos block_pos{};
4327 : 73 : {
4328 [ + - ]: 73 : LOCK(cs_main);
4329 : :
4330 [ + - ]: 73 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(req.blockhash);
4331 [ + - + + ]: 73 : if (!pindex || !(pindex->nStatus & BLOCK_HAVE_DATA)) {
4332 [ + - + - : 1 : LogDebug(BCLog::NET, "Peer %d sent us a getblocktxn for a block we don't have\n", pfrom.GetId());
+ - ]
4333 [ + - ]: 1 : return;
4334 : : }
4335 : :
4336 [ + - - + : 72 : if (pindex->nHeight >= m_chainman.ActiveChain().Height() - MAX_BLOCKTXN_DEPTH) {
+ + ]
4337 : 71 : block_pos = pindex->GetBlockPos();
4338 : : }
4339 : 1 : }
4340 : :
4341 [ + + ]: 72 : if (!block_pos.IsNull()) {
4342 : 71 : CBlock block;
4343 [ + - ]: 71 : const bool ret{m_chainman.m_blockman.ReadBlock(block, block_pos, req.blockhash)};
4344 : : // If height is above MAX_BLOCKTXN_DEPTH then this block cannot get
4345 : : // pruned after we release cs_main above, so this read should never fail.
4346 [ - + ]: 71 : assert(ret);
4347 : :
4348 [ + - ]: 71 : SendBlockTransactions(pfrom, *peer, block, req);
4349 : 71 : return;
4350 : 71 : }
4351 : :
4352 : : // If an older block is requested (should never happen in practice,
4353 : : // but can happen in tests) send a block response instead of a
4354 : : // blocktxn response. Sending a full block response instead of a
4355 : : // small blocktxn response is preferable in the case where a peer
4356 : : // might maliciously send lots of getblocktxn requests to trigger
4357 : : // expensive disk reads, because it will require the peer to
4358 : : // actually receive all the data read from disk over the network.
4359 [ + - + - : 1 : LogDebug(BCLog::NET, "Peer %d sent us a getblocktxn for a block > %i deep\n", pfrom.GetId(), MAX_BLOCKTXN_DEPTH);
+ - ]
4360 [ + - ]: 1 : CInv inv{MSG_WITNESS_BLOCK, req.blockhash};
4361 [ + - + - ]: 3 : WITH_LOCK(peer->m_getdata_requests_mutex, peer->m_getdata_requests.push_back(inv));
4362 : : // The message processing loop will go around again (without pausing) and we'll respond then
4363 : : return;
4364 : 589 : }
4365 : :
4366 [ + + ]: 99290 : if (msg_type == NetMsgType::GETHEADERS) {
4367 : 1255 : CBlockLocator locator;
4368 : 1255 : uint256 hashStop;
4369 [ + - + - ]: 1255 : vRecv >> locator >> hashStop;
4370 : :
4371 [ - + + + ]: 1255 : if (locator.vHave.size() > MAX_LOCATOR_SZ) {
4372 [ + - + - : 3 : LogDebug(BCLog::NET, "getheaders locator size %lld > %d, %s\n", locator.vHave.size(), MAX_LOCATOR_SZ, pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
4373 : 1 : pfrom.fDisconnect = true;
4374 : 1 : return;
4375 : : }
4376 : :
4377 [ - + ]: 1254 : if (m_chainman.m_blockman.LoadingBlocks()) {
4378 [ # # # # : 0 : LogDebug(BCLog::NET, "Ignoring getheaders from peer=%d while importing/reindexing\n", pfrom.GetId());
# # ]
4379 : 0 : return;
4380 : : }
4381 : :
4382 [ + - ]: 1254 : LOCK(cs_main);
4383 : :
4384 : : // Don't serve headers from our active chain until our chainwork is at least
4385 : : // the minimum chain work. This prevents us from starting a low-work headers
4386 : : // sync that will inevitably be aborted by our peer.
4387 [ + - + - : 2508 : if (m_chainman.ActiveTip() == nullptr ||
+ + ]
4388 [ + - + - : 1264 : (m_chainman.ActiveTip()->nChainWork < m_chainman.MinimumChainWork() && !pfrom.HasPermission(NetPermissionFlags::Download))) {
+ - + + ]
4389 [ + - + - : 9 : LogDebug(BCLog::NET, "Ignoring getheaders from peer=%d because active chain has too little work; sending empty response\n", pfrom.GetId());
+ - ]
4390 : : // Just respond with an empty headers message, to tell the peer to
4391 : : // go away but not treat us as unresponsive.
4392 [ + - + - ]: 18 : MakeAndPushMessage(pfrom, NetMsgType::HEADERS, std::vector<CBlockHeader>());
4393 : 9 : return;
4394 : : }
4395 : :
4396 : 1245 : CNodeState *nodestate = State(pfrom.GetId());
4397 : 1245 : const CBlockIndex* pindex = nullptr;
4398 [ + + ]: 1245 : if (locator.IsNull())
4399 : : {
4400 : : // If locator is null, return the hashStop block
4401 [ + - ]: 6 : pindex = m_chainman.m_blockman.LookupBlockIndex(hashStop);
4402 [ + - ]: 6 : if (!pindex) {
4403 : : return;
4404 : : }
4405 : :
4406 [ + - + + ]: 6 : if (!BlockRequestAllowed(pindex)) {
4407 [ + - + - : 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());
+ - ]
4408 : 2 : return;
4409 : : }
4410 : : }
4411 : : else
4412 : : {
4413 : : // Find the last block the caller has in the main chain
4414 [ + - + - ]: 1239 : pindex = m_chainman.ActiveChainstate().FindForkInGlobalIndex(locator);
4415 [ + - ]: 1239 : if (pindex)
4416 [ + - ]: 1239 : pindex = m_chainman.ActiveChain().Next(pindex);
4417 : : }
4418 : :
4419 : : // we must use CBlocks, as CBlockHeaders won't include the 0x00 nTx count at the end
4420 : 1243 : std::vector<CBlock> vHeaders;
4421 : 1243 : int nLimit = m_opts.max_headers_result;
4422 [ + - + - : 3729 : LogDebug(BCLog::NET, "getheaders %d to %s from peer=%d\n", (pindex ? pindex->nHeight : -1), hashStop.IsNull() ? "end" : hashStop.ToString(), pfrom.GetId());
+ + + - +
- + + +
- ]
4423 [ + - + + ]: 138011 : for (; pindex; pindex = m_chainman.ActiveChain().Next(pindex))
4424 : : {
4425 [ + - ]: 136799 : vHeaders.emplace_back(pindex->GetBlockHeader());
4426 [ + + + + ]: 136799 : if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
4427 : : break;
4428 : : }
4429 : : // pindex can be nullptr either if we sent m_chainman.ActiveChain().Tip() OR
4430 : : // if our peer has m_chainman.ActiveChain().Tip() (and thus we are sending an empty
4431 : : // headers message). In both cases it's safe to update
4432 : : // pindexBestHeaderSent to be our tip.
4433 : : //
4434 : : // It is important that we simply reset the BestHeaderSent value here,
4435 : : // and not max(BestHeaderSent, newHeaderSent). We might have announced
4436 : : // the currently-being-connected tip using a compact block, which
4437 : : // resulted in the peer sending a headers request, which we respond to
4438 : : // without the new block. By resetting the BestHeaderSent, we ensure we
4439 : : // will re-announce the new block via headers (or compact blocks again)
4440 : : // in the SendMessages logic.
4441 [ + + + - : 1243 : nodestate->pindexBestHeaderSent = pindex ? pindex : m_chainman.ActiveChain().Tip();
- + ]
4442 [ + - + - ]: 1243 : MakeAndPushMessage(pfrom, NetMsgType::HEADERS, TX_WITH_WITNESS(vHeaders));
4443 : 1243 : return;
4444 : 3752 : }
4445 : :
4446 [ + + ]: 98035 : if (msg_type == NetMsgType::TX) {
4447 [ + + ]: 15351 : if (RejectIncomingTxs(pfrom)) {
4448 [ + - + - : 4 : LogDebug(BCLog::NET, "transaction sent in violation of protocol, %s", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
4449 : 2 : pfrom.fDisconnect = true;
4450 : 2 : return;
4451 : : }
4452 : :
4453 : : // Stop processing the transaction early if we are still in IBD since we don't
4454 : : // have enough information to validate it yet. Sending unsolicited transactions
4455 : : // is not considered a protocol violation, so don't punish the peer.
4456 [ + - + + ]: 15349 : if (m_chainman.IsInitialBlockDownload()) return;
4457 : :
4458 : 15348 : CTransactionRef ptx;
4459 [ + + ]: 15348 : vRecv >> TX_WITH_WITNESS(ptx);
4460 : :
4461 [ + + ]: 15346 : const Txid& txid = ptx->GetHash();
4462 [ + + ]: 15346 : const Wtxid& wtxid = ptx->GetWitnessHash();
4463 : :
4464 [ + + ]: 15346 : const uint256& hash = peer->m_wtxid_relay ? wtxid.ToUint256() : txid.ToUint256();
4465 [ + - ]: 15346 : AddKnownTx(*peer, hash);
4466 : :
4467 [ + - + + ]: 15346 : if (const auto num_broadcasted{m_tx_for_private_broadcast.Remove(ptx)}) {
4468 [ + - + - : 2 : LogInfo("[privatebroadcast] Received our privately broadcast transaction (txid=%s) from the "
+ - ]
4469 : : "network from peer=%d%s; stopping private broadcast attempts",
4470 : : txid.ToString(), pfrom.GetId(), pfrom.LogIP(fLogIPs));
4471 [ - + ]: 1 : if (NUM_PRIVATE_BROADCAST_PER_TX > num_broadcasted.value()) {
4472 : : // Not all of the initial NUM_PRIVATE_BROADCAST_PER_TX connections were needed.
4473 : : // Tell CConnman it does not need to start the remaining ones.
4474 [ # # ]: 0 : m_connman.m_private_broadcast.NumToOpenSub(NUM_PRIVATE_BROADCAST_PER_TX - num_broadcasted.value());
4475 : : }
4476 : : }
4477 : :
4478 [ + - + - ]: 15346 : LOCK2(cs_main, m_tx_download_mutex);
4479 : :
4480 [ + - + + ]: 15346 : const auto& [should_validate, package_to_validate] = m_txdownloadman.ReceivedTx(pfrom.GetId(), ptx);
4481 [ + + ]: 15346 : if (!should_validate) {
4482 [ + + ]: 3088 : if (pfrom.HasPermission(NetPermissionFlags::ForceRelay)) {
4483 : : // Always relay transactions received from peers with forcerelay
4484 : : // permission, even if they were already in the mempool, allowing
4485 : : // the node to function as a gateway for nodes hidden behind it.
4486 [ + - + + ]: 2 : if (!m_mempool.exists(txid)) {
4487 [ + - + - : 2 : LogInfo("Not relaying non-mempool transaction %s (wtxid=%s) from forcerelay peer=%d\n",
+ - ]
4488 : : txid.ToString(), wtxid.ToString(), pfrom.GetId());
4489 : : } else {
4490 [ + - + - : 2 : LogInfo("Force relaying tx %s (wtxid=%s) from peer=%d\n",
+ - ]
4491 : : txid.ToString(), wtxid.ToString(), pfrom.GetId());
4492 [ + - ]: 1 : InitiateTxBroadcastToAll(txid, wtxid);
4493 : : }
4494 : : }
4495 : :
4496 [ + + ]: 3088 : if (package_to_validate) {
4497 [ + - + - ]: 11 : const auto package_result{ProcessNewPackage(m_chainman.ActiveChainstate(), m_mempool, package_to_validate->m_txns, /*test_accept=*/false, /*client_maxfeerate=*/std::nullopt)};
4498 [ + - + - : 25 : LogDebug(BCLog::TXPACKAGES, "package evaluation for %s: %s\n", package_to_validate->ToString(),
+ + + - +
- ]
4499 : : package_result.m_state.IsValid() ? "package accepted" : "package rejected");
4500 [ + - + - ]: 11 : ProcessPackageResult(package_to_validate.value(), package_result);
4501 : 11 : }
4502 : 3088 : return;
4503 : : }
4504 : :
4505 : : // ReceivedTx should not be telling us to validate the tx and a package.
4506 [ + - ]: 12258 : Assume(!package_to_validate.has_value());
4507 : :
4508 [ + - ]: 12258 : const MempoolAcceptResult result = m_chainman.ProcessTransaction(ptx);
4509 : 12258 : const TxValidationState& state = result.m_state;
4510 : :
4511 [ + + ]: 12258 : if (result.m_result_type == MempoolAcceptResult::ResultType::VALID) {
4512 [ + - ]: 11429 : ProcessValidTx(pfrom.GetId(), ptx, result.m_replaced_transactions);
4513 : 11429 : pfrom.m_last_tx_time = GetTime<std::chrono::seconds>();
4514 : : }
4515 [ + + ]: 12258 : if (state.IsInvalid()) {
4516 [ + - + + ]: 829 : if (auto package_to_validate{ProcessInvalidTx(pfrom.GetId(), ptx, state, /*first_time_failure=*/true)}) {
4517 [ + - + - ]: 19 : const auto package_result{ProcessNewPackage(m_chainman.ActiveChainstate(), m_mempool, package_to_validate->m_txns, /*test_accept=*/false, /*client_maxfeerate=*/std::nullopt)};
4518 [ + - + - : 38 : LogDebug(BCLog::TXPACKAGES, "package evaluation for %s: %s\n", package_to_validate->ToString(),
- + + - +
- ]
4519 : : package_result.m_state.IsValid() ? "package accepted" : "package rejected");
4520 [ + - + - ]: 19 : ProcessPackageResult(package_to_validate.value(), package_result);
4521 : 848 : }
4522 : : }
4523 : :
4524 : 12258 : return;
4525 [ + - + - : 73644 : }
+ - ]
4526 : :
4527 [ + + ]: 82684 : if (msg_type == NetMsgType::CMPCTBLOCK)
4528 : : {
4529 : : // Ignore cmpctblock received while importing
4530 [ - + ]: 22636 : if (m_chainman.m_blockman.LoadingBlocks()) {
4531 [ # # # # : 0 : LogDebug(BCLog::NET, "Unexpected cmpctblock message received from peer %d\n", pfrom.GetId());
# # ]
4532 : 0 : return;
4533 : : }
4534 : :
4535 : 22636 : CBlockHeaderAndShortTxIDs cmpctblock;
4536 [ + - ]: 22636 : vRecv >> cmpctblock;
4537 : :
4538 : 22636 : bool received_new_header = false;
4539 [ + - ]: 22636 : const auto blockhash = cmpctblock.header.GetHash();
4540 : :
4541 : 22636 : {
4542 [ + - ]: 22636 : LOCK(cs_main);
4543 : :
4544 [ + - ]: 22636 : const CBlockIndex* prev_block = m_chainman.m_blockman.LookupBlockIndex(cmpctblock.header.hashPrevBlock);
4545 [ + + ]: 22636 : if (!prev_block) {
4546 : : // Doesn't connect (or is genesis), instead of DoSing in AcceptBlockHeader, request deeper headers
4547 [ + - + - ]: 62 : if (!m_chainman.IsInitialBlockDownload()) {
4548 [ + - + - ]: 124 : MaybeSendGetHeaders(pfrom, GetLocator(m_chainman.m_best_header), *peer);
4549 : : }
4550 : 62 : return;
4551 [ + - + - : 45148 : } else if (prev_block->nChainWork + GetBlockProof(cmpctblock.header) < GetAntiDoSWorkThreshold()) {
+ + ]
4552 : : // If we get a low-work header in a compact block, we can ignore it.
4553 [ + - + - : 234 : LogDebug(BCLog::NET, "Ignoring low-work compact block from peer %d\n", pfrom.GetId());
+ - ]
4554 : 234 : return;
4555 : : }
4556 : :
4557 [ + - + + ]: 22340 : if (!m_chainman.m_blockman.LookupBlockIndex(blockhash)) {
4558 : 19142 : received_new_header = true;
4559 : : }
4560 : 296 : }
4561 : :
4562 : 22340 : const CBlockIndex *pindex = nullptr;
4563 [ + - ]: 22340 : BlockValidationState state;
4564 [ + - + + ]: 22340 : if (!m_chainman.ProcessNewBlockHeaders({{cmpctblock.header}}, /*min_pow_checked=*/true, state, &pindex)) {
4565 [ + - ]: 6 : if (state.IsInvalid()) {
4566 [ + - + - ]: 6 : MaybePunishNodeForBlock(pfrom.GetId(), state, /*via_compact_block=*/true, "invalid header via cmpctblock");
4567 : 6 : return;
4568 : : }
4569 : : }
4570 : :
4571 : : // If AcceptBlockHeader returned true, it set pindex
4572 [ - + ]: 22334 : Assert(pindex);
4573 [ + + ]: 22334 : if (received_new_header) {
4574 [ + - ]: 19137 : LogBlockHeader(*pindex, pfrom, /*via_compact_block=*/true);
4575 : : }
4576 : :
4577 : 22334 : bool fProcessBLOCKTXN = false;
4578 : :
4579 : : // If we end up treating this as a plain headers message, call that as well
4580 : : // without cs_main.
4581 : 22334 : bool fRevertToHeaderProcessing = false;
4582 : :
4583 : : // Keep a CBlock for "optimistic" compactblock reconstructions (see
4584 : : // below)
4585 [ + - ]: 22334 : std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
4586 : 22334 : bool fBlockReconstructed = false;
4587 : :
4588 : 22334 : {
4589 [ + - ]: 22334 : LOCK(cs_main);
4590 [ + - ]: 22334 : UpdateBlockAvailability(pfrom.GetId(), pindex->GetBlockHash());
4591 : :
4592 : 22334 : CNodeState *nodestate = State(pfrom.GetId());
4593 : :
4594 : : // If this was a new header with more work than our tip, update the
4595 : : // peer's last block announcement time
4596 [ + + + - : 41471 : if (received_new_header && pindex->nChainWork > m_chainman.ActiveChain().Tip()->nChainWork) {
- + + - +
+ ]
4597 [ + - ]: 18985 : nodestate->m_last_block_announcement = GetTime();
4598 : : }
4599 : :
4600 [ + + ]: 22334 : if (pindex->nStatus & BLOCK_HAVE_DATA) // Nothing to do here
4601 : : return;
4602 : :
4603 : 19514 : auto range_flight = mapBlocksInFlight.equal_range(pindex->GetBlockHash());
4604 : 19514 : size_t already_in_flight = std::distance(range_flight.first, range_flight.second);
4605 : 19514 : bool requested_block_from_this_peer{false};
4606 : :
4607 : : // Multimap ensures ordering of outstanding requests. It's either empty or first in line.
4608 [ + + + + ]: 19514 : bool first_in_flight = already_in_flight == 0 || (range_flight.first->second.first == pfrom.GetId());
4609 : :
4610 [ + + ]: 19648 : while (range_flight.first != range_flight.second) {
4611 [ + + ]: 383 : if (range_flight.first->second.first == pfrom.GetId()) {
4612 : : requested_block_from_this_peer = true;
4613 : : break;
4614 : : }
4615 : 134 : range_flight.first++;
4616 : : }
4617 : :
4618 [ + - - + : 39028 : if (pindex->nChainWork <= m_chainman.ActiveChain().Tip()->nChainWork || // We know something better
+ - + + ]
4619 [ + - ]: 19358 : pindex->nTx != 0) { // We had this block at some point, but pruned it
4620 [ + + ]: 156 : if (requested_block_from_this_peer) {
4621 : : // We requested this block for some reason, but our mempool will probably be useless
4622 : : // so we just grab the block via normal getdata
4623 [ + - ]: 4 : std::vector<CInv> vInv(1);
4624 [ + - ]: 4 : vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(*peer), blockhash);
4625 [ + - + - ]: 8 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vInv);
4626 : 4 : }
4627 : 156 : return;
4628 : : }
4629 : :
4630 : : // If we're not close to tip yet, give up and let parallel block fetch work its magic
4631 [ + + + - : 19358 : if (!already_in_flight && !CanDirectFetch()) {
+ + ]
4632 : : return;
4633 : : }
4634 : :
4635 : : // We want to be a bit conservative just to be extra careful about DoS
4636 : : // possibilities in compact block processing...
4637 [ + - - + : 19342 : if (pindex->nHeight <= m_chainman.ActiveChain().Height() + 2) {
+ + ]
4638 [ + - + + : 17911 : if ((already_in_flight < MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK && nodestate->vBlocksInFlight.size() < MAX_BLOCKS_IN_TRANSIT_PER_PEER) ||
+ - ]
4639 : : requested_block_from_this_peer) {
4640 : 17910 : std::list<QueuedBlock>::iterator* queuedBlockIt = nullptr;
4641 [ + - + + ]: 17910 : if (!BlockRequested(pfrom.GetId(), *pindex, &queuedBlockIt)) {
4642 [ + - ]: 245 : if (!(*queuedBlockIt)->partialBlock)
4643 [ + - - + ]: 245 : (*queuedBlockIt)->partialBlock.reset(new PartiallyDownloadedBlock(&m_mempool));
4644 : : else {
4645 : : // The block was already in flight using compact blocks from the same peer
4646 [ # # # # : 0 : LogDebug(BCLog::NET, "Peer sent us compact block we were already syncing!\n");
# # ]
4647 : 0 : return;
4648 : : }
4649 : : }
4650 : :
4651 [ + - ]: 17910 : PartiallyDownloadedBlock& partialBlock = *(*queuedBlockIt)->partialBlock;
4652 [ + - ]: 17910 : ReadStatus status = partialBlock.InitData(cmpctblock, vExtraTxnForCompact);
4653 [ + + ]: 17910 : if (status == READ_STATUS_INVALID) {
4654 [ + - ]: 1 : RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId()); // Reset in-flight state in case Misbehaving does not result in a disconnect
4655 [ + - + - ]: 1 : Misbehaving(*peer, "invalid compact block");
4656 : 1 : return;
4657 [ - + ]: 17909 : } else if (status == READ_STATUS_FAILED) {
4658 [ # # ]: 0 : if (first_in_flight) {
4659 : : // Duplicate txindexes, the block is now in-flight, so just request it
4660 [ # # ]: 0 : std::vector<CInv> vInv(1);
4661 [ # # ]: 0 : vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(*peer), blockhash);
4662 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vInv);
4663 : 0 : } else {
4664 : : // Give up for this peer and wait for other peer(s)
4665 [ # # ]: 0 : RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId());
4666 : : }
4667 : 0 : return;
4668 : : }
4669 : :
4670 : 17909 : BlockTransactionsRequest req;
4671 [ - + + + ]: 96870 : for (size_t i = 0; i < cmpctblock.BlockTxCount(); i++) {
4672 [ + - + + ]: 30526 : if (!partialBlock.IsTxAvailable(i))
4673 [ + - ]: 30526 : req.indexes.push_back(i);
4674 : : }
4675 [ + + ]: 17909 : if (req.indexes.empty()) {
4676 : : fProcessBLOCKTXN = true;
4677 [ + + ]: 576 : } else if (first_in_flight) {
4678 : : // We will try to round-trip any compact blocks we get on failure,
4679 : : // as long as it's first...
4680 : 566 : req.blockhash = pindex->GetBlockHash();
4681 [ + - + - ]: 1132 : MakeAndPushMessage(pfrom, NetMsgType::GETBLOCKTXN, req);
4682 [ + - ]: 10 : } else if (pfrom.m_bip152_highbandwidth_to &&
4683 [ + + + + ]: 17 : (!pfrom.IsInboundConn() ||
4684 [ + - + + ]: 13 : IsBlockRequestedFromOutbound(blockhash) ||
4685 : : already_in_flight < MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK - 1)) {
4686 : : // ... or it's a hb relay peer and:
4687 : : // - peer is outbound, or
4688 : : // - we already have an outbound attempt in flight(so we'll take what we can get), or
4689 : : // - it's not the final parallel download slot (which we may reserve for first outbound)
4690 : 7 : req.blockhash = pindex->GetBlockHash();
4691 [ + - + - ]: 14 : MakeAndPushMessage(pfrom, NetMsgType::GETBLOCKTXN, req);
4692 : : } else {
4693 : : // Give up for this peer and wait for other peer(s)
4694 [ + - ]: 3 : RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId());
4695 : : }
4696 : 17909 : } else {
4697 : : // This block is either already in flight from a different
4698 : : // peer, or this peer has too many blocks outstanding to
4699 : : // download from.
4700 : : // Optimistically try to reconstruct anyway since we might be
4701 : : // able to without any round trips.
4702 : 1 : PartiallyDownloadedBlock tempBlock(&m_mempool);
4703 [ + - ]: 1 : ReadStatus status = tempBlock.InitData(cmpctblock, vExtraTxnForCompact);
4704 [ - + ]: 1 : if (status != READ_STATUS_OK) {
4705 : : // TODO: don't ignore failures
4706 : 0 : return;
4707 : : }
4708 : 1 : std::vector<CTransactionRef> dummy;
4709 [ + - ]: 1 : const CBlockIndex* prev_block{Assume(m_chainman.m_blockman.LookupBlockIndex(cmpctblock.header.hashPrevBlock))};
4710 [ + - ]: 1 : status = tempBlock.FillBlock(*pblock, dummy,
4711 : 1 : /*segwit_active=*/DeploymentActiveAfter(prev_block, m_chainman, Consensus::DEPLOYMENT_SEGWIT));
4712 [ + - ]: 1 : if (status == READ_STATUS_OK) {
4713 : 1 : fBlockReconstructed = true;
4714 : : }
4715 : 2 : }
4716 : : } else {
4717 [ - + ]: 1431 : if (requested_block_from_this_peer) {
4718 : : // We requested this block, but its far into the future, so our
4719 : : // mempool will probably be useless - request the block normally
4720 [ # # ]: 0 : std::vector<CInv> vInv(1);
4721 [ # # ]: 0 : vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(*peer), blockhash);
4722 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vInv);
4723 : 0 : return;
4724 : 0 : } else {
4725 : : // If this was an announce-cmpctblock, we want the same treatment as a header message
4726 : : fRevertToHeaderProcessing = true;
4727 : : }
4728 : : }
4729 : 2993 : } // cs_main
4730 : :
4731 [ + + ]: 19341 : if (fProcessBLOCKTXN) {
4732 : 17333 : BlockTransactions txn;
4733 : 17333 : txn.blockhash = blockhash;
4734 [ + - ]: 17333 : return ProcessCompactBlockTxns(pfrom, *peer, txn);
4735 : 17333 : }
4736 : :
4737 [ + + ]: 2008 : if (fRevertToHeaderProcessing) {
4738 : : // Headers received from HB compact block peers are permitted to be
4739 : : // relayed before full validation (see BIP 152), so we don't want to disconnect
4740 : : // the peer if the header turns out to be for an invalid block.
4741 : : // Note that if a peer tries to build on an invalid chain, that
4742 : : // will be detected and the peer will be disconnected/discouraged.
4743 [ + - + - ]: 2862 : return ProcessHeadersMessage(pfrom, *peer, {cmpctblock.header}, /*via_compact_block=*/true);
4744 : : }
4745 : :
4746 [ + + ]: 577 : if (fBlockReconstructed) {
4747 : : // If we got here, we were able to optimistically reconstruct a
4748 : : // block that is in flight from some other peer.
4749 : 1 : {
4750 [ + - ]: 1 : LOCK(cs_main);
4751 [ + - + - ]: 1 : mapBlockSource.emplace(pblock->GetHash(), std::make_pair(pfrom.GetId(), false));
4752 : 0 : }
4753 : : // Setting force_processing to true means that we bypass some of
4754 : : // our anti-DoS protections in AcceptBlock, which filters
4755 : : // unrequested blocks that might be trying to waste our resources
4756 : : // (eg disk space). Because we only try to reconstruct blocks when
4757 : : // we're close to caught up (via the CanDirectFetch() requirement
4758 : : // above, combined with the behavior of not requesting blocks until
4759 : : // we have a chain with at least the minimum chain work), and we ignore
4760 : : // compact blocks with less work than our tip, it is safe to treat
4761 : : // reconstructed compact blocks as having been requested.
4762 [ + - + - ]: 2 : ProcessBlock(pfrom, pblock, /*force_processing=*/true, /*min_pow_checked=*/true);
4763 [ + - ]: 1 : LOCK(cs_main); // hold cs_main for CBlockIndex::IsValid()
4764 [ + - + - : 2 : if (pindex->IsValid(BLOCK_VALID_TRANSACTIONS)) {
+ - ]
4765 : : // Clear download state for this block, which is in
4766 : : // process from some other peer. We do this after calling
4767 : : // ProcessNewBlock so that a malleated cmpctblock announcement
4768 : : // can't be used to interfere with block relay.
4769 [ + - + - ]: 1 : RemoveBlockRequest(pblock->GetHash(), std::nullopt);
4770 : : }
4771 : 1 : }
4772 : 577 : return;
4773 : 67310 : }
4774 : :
4775 [ + + ]: 60048 : if (msg_type == NetMsgType::BLOCKTXN)
4776 : : {
4777 : : // Ignore blocktxn received while importing
4778 [ - + ]: 570 : if (m_chainman.m_blockman.LoadingBlocks()) {
4779 [ # # # # : 0 : LogDebug(BCLog::NET, "Unexpected blocktxn message received from peer %d\n", pfrom.GetId());
# # ]
4780 : 0 : return;
4781 : : }
4782 : :
4783 : 570 : BlockTransactions resp;
4784 [ + - ]: 570 : vRecv >> resp;
4785 : :
4786 [ + - ]: 570 : return ProcessCompactBlockTxns(pfrom, *peer, resp);
4787 : 570 : }
4788 : :
4789 [ + + ]: 59478 : if (msg_type == NetMsgType::HEADERS)
4790 : : {
4791 : : // Ignore headers received while importing
4792 [ - + ]: 5727 : if (m_chainman.m_blockman.LoadingBlocks()) {
4793 [ # # # # : 0 : LogDebug(BCLog::NET, "Unexpected headers message received from peer %d\n", pfrom.GetId());
# # ]
4794 : 0 : return;
4795 : : }
4796 : :
4797 : 5727 : std::vector<CBlockHeader> headers;
4798 : :
4799 : : // Bypass the normal CBlock deserialization, as we don't want to risk deserializing 2000 full blocks.
4800 [ + - ]: 5727 : unsigned int nCount = ReadCompactSize(vRecv);
4801 [ + + ]: 5727 : if (nCount > m_opts.max_headers_result) {
4802 [ + - + - ]: 1 : Misbehaving(*peer, strprintf("headers message size = %u", nCount));
4803 : 1 : return;
4804 : : }
4805 [ + - ]: 5726 : headers.resize(nCount);
4806 [ + + ]: 178733 : for (unsigned int n = 0; n < nCount; n++) {
4807 [ + - ]: 173007 : vRecv >> headers[n];
4808 [ + - ]: 173007 : ReadCompactSize(vRecv); // ignore tx count; assume it is 0.
4809 : : }
4810 : :
4811 [ + - ]: 5726 : ProcessHeadersMessage(pfrom, *peer, std::move(headers), /*via_compact_block=*/false);
4812 : :
4813 : : // Check if the headers presync progress needs to be reported to validation.
4814 : : // This needs to be done without holding the m_headers_presync_mutex lock.
4815 [ + + ]: 5726 : if (m_headers_presync_should_signal.exchange(false)) {
4816 : 6 : HeadersPresyncStats stats;
4817 : 6 : {
4818 [ + - ]: 6 : LOCK(m_headers_presync_mutex);
4819 : 6 : auto it = m_headers_presync_stats.find(m_headers_presync_bestpeer);
4820 [ + - ]: 6 : if (it != m_headers_presync_stats.end()) stats = it->second;
4821 : 6 : }
4822 [ + - ]: 6 : if (stats.second) {
4823 [ + - ]: 6 : m_chainman.ReportHeadersPresync(stats.second->first, stats.second->second);
4824 : : }
4825 : : }
4826 : :
4827 : 5726 : return;
4828 : 5727 : }
4829 : :
4830 [ + + ]: 53751 : if (msg_type == NetMsgType::BLOCK)
4831 : : {
4832 : : // Ignore block received while importing
4833 [ - + ]: 41252 : if (m_chainman.m_blockman.LoadingBlocks()) {
4834 [ # # # # : 0 : LogDebug(BCLog::NET, "Unexpected block message received from peer %d\n", pfrom.GetId());
# # ]
4835 : 0 : return;
4836 : : }
4837 : :
4838 [ + - ]: 41252 : std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
4839 [ + + ]: 41252 : vRecv >> TX_WITH_WITNESS(*pblock);
4840 : :
4841 [ + - + - : 82500 : LogDebug(BCLog::NET, "received block %s peer=%d\n", pblock->GetHash().ToString(), pfrom.GetId());
+ - + - +
- ]
4842 : :
4843 [ + - + - : 123750 : const CBlockIndex* prev_block{WITH_LOCK(m_chainman.GetMutex(), return m_chainman.m_blockman.LookupBlockIndex(pblock->hashPrevBlock))};
+ - ]
4844 : :
4845 : : // Check for possible mutation if it connects to something we know so we can check for DEPLOYMENT_SEGWIT being active
4846 [ + + + - : 82498 : if (prev_block && IsBlockMutated(/*block=*/*pblock,
+ + ]
4847 : 41248 : /*check_witness_root=*/DeploymentActiveAfter(prev_block, m_chainman, Consensus::DEPLOYMENT_SEGWIT))) {
4848 [ + - + - : 52 : LogDebug(BCLog::NET, "Received mutated block from peer=%d\n", peer->m_id);
+ - ]
4849 [ + - + - ]: 52 : Misbehaving(*peer, "mutated block");
4850 [ + - + - : 156 : WITH_LOCK(cs_main, RemoveBlockRequest(pblock->GetHash(), peer->m_id));
+ - ]
4851 : : return;
4852 : : }
4853 : :
4854 : 41198 : bool forceProcessing = false;
4855 [ + - ]: 41198 : const uint256 hash(pblock->GetHash());
4856 : 41198 : bool min_pow_checked = false;
4857 : 41198 : {
4858 [ + - ]: 41198 : LOCK(cs_main);
4859 : : // Always process the block if we requested it, since we may
4860 : : // need it even when it's not a candidate for a new best tip.
4861 : 41198 : forceProcessing = IsBlockRequested(hash);
4862 [ + - ]: 41198 : RemoveBlockRequest(hash, pfrom.GetId());
4863 : : // mapBlockSource is only used for punishing peers and setting
4864 : : // which peers send us compact blocks, so the race between here and
4865 : : // cs_main in ProcessNewBlock is fine.
4866 [ + - ]: 41198 : mapBlockSource.emplace(hash, std::make_pair(pfrom.GetId(), true));
4867 : :
4868 : : // Check claimed work on this block against our anti-dos thresholds.
4869 [ + + + - : 41198 : if (prev_block && prev_block->nChainWork + GetBlockProof(*pblock) >= GetAntiDoSWorkThreshold()) {
+ - + - +
+ ]
4870 : : min_pow_checked = true;
4871 : : }
4872 : 0 : }
4873 [ + - + - ]: 82396 : ProcessBlock(pfrom, pblock, forceProcessing, min_pow_checked);
4874 : 41198 : return;
4875 : 41252 : }
4876 : :
4877 [ + + ]: 12499 : if (msg_type == NetMsgType::GETADDR) {
4878 : : // This asymmetric behavior for inbound and outbound connections was introduced
4879 : : // to prevent a fingerprinting attack: an attacker can send specific fake addresses
4880 : : // to users' AddrMan and later request them by sending getaddr messages.
4881 : : // Making nodes which are behind NAT and can only make outgoing connections ignore
4882 : : // the getaddr message mitigates the attack.
4883 [ + + ]: 1018 : if (!pfrom.IsInboundConn()) {
4884 [ + - + - : 18 : LogDebug(BCLog::NET, "Ignoring \"getaddr\" from %s connection. peer=%d\n", pfrom.ConnectionTypeAsString(), pfrom.GetId());
+ - + - ]
4885 : 9 : return;
4886 : : }
4887 : :
4888 : : // Since this must be an inbound connection, SetupAddressRelay will
4889 : : // never fail.
4890 [ + - + + ]: 1009 : Assume(SetupAddressRelay(pfrom, *peer));
4891 : :
4892 : : // Only send one GetAddr response per connection to reduce resource waste
4893 : : // and discourage addr stamping of INV announcements.
4894 [ + + ]: 1009 : if (peer->m_getaddr_recvd) {
4895 [ + - + - : 1 : LogDebug(BCLog::NET, "Ignoring repeated \"getaddr\". peer=%d\n", pfrom.GetId());
+ - ]
4896 : 1 : return;
4897 : : }
4898 : 1008 : peer->m_getaddr_recvd = true;
4899 : :
4900 : 1008 : peer->m_addrs_to_send.clear();
4901 : 1008 : std::vector<CAddress> vAddr;
4902 [ + + ]: 1008 : if (pfrom.HasPermission(NetPermissionFlags::Addr)) {
4903 [ + - ]: 72 : vAddr = m_connman.GetAddressesUnsafe(MAX_ADDR_TO_SEND, MAX_PCT_ADDR_TO_SEND, /*network=*/std::nullopt);
4904 : : } else {
4905 [ + - ]: 1944 : vAddr = m_connman.GetAddresses(pfrom, MAX_ADDR_TO_SEND, MAX_PCT_ADDR_TO_SEND);
4906 : : }
4907 [ + + ]: 19934 : for (const CAddress &addr : vAddr) {
4908 [ + - ]: 18926 : PushAddress(*peer, addr);
4909 : : }
4910 : 1008 : return;
4911 : 1008 : }
4912 : :
4913 [ + + ]: 11481 : if (msg_type == NetMsgType::MEMPOOL) {
4914 : : // Only process received mempool messages if we advertise NODE_BLOOM
4915 : : // or if the peer has mempool permissions.
4916 [ + + - + ]: 4 : if (!(peer->m_our_services & NODE_BLOOM) && !pfrom.HasPermission(NetPermissionFlags::Mempool))
4917 : : {
4918 [ + - ]: 1 : if (!pfrom.HasPermission(NetPermissionFlags::NoBan))
4919 : : {
4920 [ + - + - : 2 : LogDebug(BCLog::NET, "mempool request with bloom filters disabled, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
4921 : 1 : pfrom.fDisconnect = true;
4922 : : }
4923 : 1 : return;
4924 : : }
4925 : :
4926 [ + - + + : 3 : if (m_connman.OutboundTargetReached(false) && !pfrom.HasPermission(NetPermissionFlags::Mempool))
- + ]
4927 : : {
4928 [ + - ]: 1 : if (!pfrom.HasPermission(NetPermissionFlags::NoBan))
4929 : : {
4930 [ + - + - : 2 : LogDebug(BCLog::NET, "mempool request with bandwidth limit reached, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
4931 : 1 : pfrom.fDisconnect = true;
4932 : : }
4933 : 1 : return;
4934 : : }
4935 : :
4936 [ + - + - ]: 2 : if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
4937 [ + - ]: 2 : LOCK(tx_relay->m_tx_inventory_mutex);
4938 [ + - ]: 2 : tx_relay->m_send_mempool = true;
4939 : 2 : }
4940 : 2 : return;
4941 : : }
4942 : :
4943 [ + + ]: 11477 : if (msg_type == NetMsgType::PING) {
4944 [ + - ]: 7817 : if (pfrom.GetCommonVersion() > BIP0031_VERSION) {
4945 : 7817 : uint64_t nonce = 0;
4946 [ + - ]: 7817 : vRecv >> nonce;
4947 : : // Echo the message back with the nonce. This allows for two useful features:
4948 : : //
4949 : : // 1) A remote node can quickly check if the connection is operational
4950 : : // 2) Remote nodes can measure the latency of the network thread. If this node
4951 : : // is overloaded it won't respond to pings quickly and the remote node can
4952 : : // avoid sending us more work, like chain download requests.
4953 : : //
4954 : : // The nonce stops the remote getting confused between different pings: without
4955 : : // it, if the remote node sends a ping once per second and this node takes 5
4956 : : // seconds to respond to each, the 5th ping the remote sends would appear to
4957 : : // return very quickly.
4958 [ + - + - ]: 15634 : MakeAndPushMessage(pfrom, NetMsgType::PONG, nonce);
4959 : : }
4960 : 7817 : return;
4961 : : }
4962 : :
4963 [ + + ]: 3660 : if (msg_type == NetMsgType::PONG) {
4964 : 2555 : const auto ping_end = time_received;
4965 : 2555 : uint64_t nonce = 0;
4966 [ - + ]: 2555 : size_t nAvail = vRecv.in_avail();
4967 : 2555 : bool bPingFinished = false;
4968 [ + + ]: 2555 : std::string sProblem;
4969 : :
4970 [ + + ]: 2555 : if (nAvail >= sizeof(nonce)) {
4971 [ + - ]: 2554 : vRecv >> nonce;
4972 : :
4973 : : // Only process pong message if there is an outstanding ping (old ping without nonce should never pong)
4974 [ + + ]: 2554 : if (peer->m_ping_nonce_sent != 0) {
4975 [ + + ]: 2553 : if (nonce == peer->m_ping_nonce_sent) {
4976 : : // Matching pong received, this ping is no longer outstanding
4977 : 2551 : bPingFinished = true;
4978 [ + - ]: 2551 : const auto ping_time = ping_end - peer->m_ping_start.load();
4979 [ + - ]: 2551 : if (ping_time.count() >= 0) {
4980 : : // Let connman know about this successful ping-pong
4981 : 2551 : pfrom.PongReceived(ping_time);
4982 [ + + ]: 2551 : if (pfrom.IsPrivateBroadcastConn()) {
4983 [ + - ]: 10 : m_tx_for_private_broadcast.NodeConfirmedReception(pfrom.GetId());
4984 [ + - + - ]: 10 : LogInfo("[privatebroadcast] Got a PONG (the transaction will probably reach the network), marking for disconnect, peer=%d%s",
4985 : : pfrom.GetId(), pfrom.LogIP(fLogIPs));
4986 : 10 : pfrom.fDisconnect = true;
4987 : : }
4988 : : } else {
4989 : : // This should never happen
4990 [ # # ]: 0 : sProblem = "Timing mishap";
4991 : : }
4992 : : } else {
4993 : : // Nonce mismatches are normal when pings are overlapping
4994 [ + - ]: 2 : sProblem = "Nonce mismatch";
4995 [ + + ]: 2 : if (nonce == 0) {
4996 : : // This is most likely a bug in another implementation somewhere; cancel this ping
4997 : 1 : bPingFinished = true;
4998 [ + - ]: 1 : sProblem = "Nonce zero";
4999 : : }
5000 : : }
5001 : : } else {
5002 [ + - ]: 1 : sProblem = "Unsolicited pong without ping";
5003 : : }
5004 : : } else {
5005 : : // This is most likely a bug in another implementation somewhere; cancel this ping
5006 : 1 : bPingFinished = true;
5007 [ + - ]: 1 : sProblem = "Short payload";
5008 : : }
5009 : :
5010 [ + + ]: 2555 : if (!(sProblem.empty())) {
5011 [ + - + - : 4 : LogDebug(BCLog::NET, "pong peer=%d: %s, %x expected, %x received, %u bytes\n",
+ - ]
5012 : : pfrom.GetId(),
5013 : : sProblem,
5014 : : peer->m_ping_nonce_sent,
5015 : : nonce,
5016 : : nAvail);
5017 : : }
5018 [ + + ]: 2555 : if (bPingFinished) {
5019 : 2553 : peer->m_ping_nonce_sent = 0;
5020 : : }
5021 : 2555 : return;
5022 : 2555 : }
5023 : :
5024 [ + + ]: 1105 : if (msg_type == NetMsgType::FILTERLOAD) {
5025 [ + + ]: 10 : if (!(peer->m_our_services & NODE_BLOOM)) {
5026 [ + - + - : 2 : LogDebug(BCLog::NET, "filterload received despite not offering bloom services, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
5027 : 1 : pfrom.fDisconnect = true;
5028 : 1 : return;
5029 : : }
5030 [ + - ]: 9 : CBloomFilter filter;
5031 [ + - ]: 9 : vRecv >> filter;
5032 : :
5033 [ + - + + ]: 9 : if (!filter.IsWithinSizeConstraints())
5034 : : {
5035 : : // There is no excuse for sending a too-large filter
5036 [ + - + - ]: 4 : Misbehaving(*peer, "too-large bloom filter");
5037 [ + - + - ]: 7 : } else if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
5038 : 7 : {
5039 [ + - ]: 7 : LOCK(tx_relay->m_bloom_filter_mutex);
5040 [ + - + - : 7 : tx_relay->m_bloom_filter.reset(new CBloomFilter(filter));
- + ]
5041 [ + - ]: 7 : tx_relay->m_relay_txs = true;
5042 : 0 : }
5043 : 7 : pfrom.m_bloom_filter_loaded = true;
5044 : 7 : pfrom.m_relays_txs = true;
5045 : : }
5046 : 9 : return;
5047 : 9 : }
5048 : :
5049 [ + + ]: 1095 : if (msg_type == NetMsgType::FILTERADD) {
5050 [ + + ]: 7 : if (!(peer->m_our_services & NODE_BLOOM)) {
5051 [ + - + - : 2 : LogDebug(BCLog::NET, "filteradd received despite not offering bloom services, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
5052 : 1 : pfrom.fDisconnect = true;
5053 : 1 : return;
5054 : : }
5055 : 6 : std::vector<unsigned char> vData;
5056 [ + - ]: 6 : vRecv >> vData;
5057 : :
5058 : : // Nodes must NEVER send a data item > MAX_SCRIPT_ELEMENT_SIZE bytes (the max size for a script data object,
5059 : : // and thus, the maximum size any matched object can have) in a filteradd message
5060 : 6 : bool bad = false;
5061 [ - + + + ]: 6 : if (vData.size() > MAX_SCRIPT_ELEMENT_SIZE) {
5062 : : bad = true;
5063 [ + - + - ]: 5 : } else if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
5064 [ + - ]: 5 : LOCK(tx_relay->m_bloom_filter_mutex);
5065 [ + + ]: 5 : if (tx_relay->m_bloom_filter) {
5066 [ - + + - ]: 3 : tx_relay->m_bloom_filter->insert(vData);
5067 : : } else {
5068 : : bad = true;
5069 : : }
5070 : 0 : }
5071 [ + + ]: 5 : if (bad) {
5072 [ + - + - ]: 6 : Misbehaving(*peer, "bad filteradd message");
5073 : : }
5074 : 6 : return;
5075 : 6 : }
5076 : :
5077 [ + + ]: 1088 : if (msg_type == NetMsgType::FILTERCLEAR) {
5078 [ + + ]: 5 : if (!(peer->m_our_services & NODE_BLOOM)) {
5079 [ + - + - : 2 : LogDebug(BCLog::NET, "filterclear received despite not offering bloom services, %s\n", pfrom.DisconnectMsg(fLogIPs));
+ - + - ]
5080 : 1 : pfrom.fDisconnect = true;
5081 : 1 : return;
5082 : : }
5083 [ + - ]: 4 : auto tx_relay = peer->GetTxRelay();
5084 [ + - ]: 4 : if (!tx_relay) return;
5085 : :
5086 : 4 : {
5087 [ + - ]: 4 : LOCK(tx_relay->m_bloom_filter_mutex);
5088 [ + - ]: 4 : tx_relay->m_bloom_filter = nullptr;
5089 [ + - ]: 4 : tx_relay->m_relay_txs = true;
5090 : 4 : }
5091 : 4 : pfrom.m_bloom_filter_loaded = false;
5092 : 4 : pfrom.m_relays_txs = true;
5093 : 4 : return;
5094 : : }
5095 : :
5096 [ + + ]: 1083 : if (msg_type == NetMsgType::FEEFILTER) {
5097 : 1053 : CAmount newFeeFilter = 0;
5098 [ + - ]: 1053 : vRecv >> newFeeFilter;
5099 [ + - ]: 1053 : if (MoneyRange(newFeeFilter)) {
5100 [ + - + - ]: 1053 : if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
5101 : 1053 : tx_relay->m_fee_filter_received = newFeeFilter;
5102 : : }
5103 [ + - + - : 2106 : LogDebug(BCLog::NET, "received: feefilter of %s from peer=%d\n", CFeeRate(newFeeFilter).ToString(), pfrom.GetId());
+ - + - ]
5104 : : }
5105 : 1053 : return;
5106 : : }
5107 : :
5108 [ + + ]: 30 : if (msg_type == NetMsgType::GETCFILTERS) {
5109 [ + - ]: 4 : ProcessGetCFilters(pfrom, *peer, vRecv);
5110 : : return;
5111 : : }
5112 : :
5113 [ + + ]: 26 : if (msg_type == NetMsgType::GETCFHEADERS) {
5114 [ + - ]: 5 : ProcessGetCFHeaders(pfrom, *peer, vRecv);
5115 : : return;
5116 : : }
5117 : :
5118 [ + + ]: 21 : if (msg_type == NetMsgType::GETCFCHECKPT) {
5119 [ + - ]: 6 : ProcessGetCFCheckPt(pfrom, *peer, vRecv);
5120 : : return;
5121 : : }
5122 : :
5123 [ + + ]: 15 : if (msg_type == NetMsgType::NOTFOUND) {
5124 : 9 : std::vector<CInv> vInv;
5125 [ + - ]: 9 : vRecv >> vInv;
5126 : 9 : std::vector<GenTxid> tx_invs;
5127 [ - + + - ]: 9 : if (vInv.size() <= node::MAX_PEER_TX_ANNOUNCEMENTS + MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
5128 [ + + ]: 18 : for (CInv &inv : vInv) {
5129 [ + + ]: 18 : if (inv.IsGenTxMsg()) {
5130 [ + - + - ]: 9 : tx_invs.emplace_back(ToGenTxid(inv));
5131 : : }
5132 : : }
5133 : : }
5134 [ + - ]: 9 : LOCK(m_tx_download_mutex);
5135 [ + - ]: 9 : m_txdownloadman.ReceivedNotFound(pfrom.GetId(), tx_invs);
5136 [ + - ]: 9 : return;
5137 : 9 : }
5138 : :
5139 : : // Ignore unknown message types for extensibility
5140 [ + - + - : 12 : LogDebug(BCLog::NET, "Unknown message type \"%s\" from peer=%d", SanitizeString(msg_type), pfrom.GetId());
- + + - +
- ]
5141 : : return;
5142 : 161836 : }
5143 : :
5144 : 436572 : bool PeerManagerImpl::MaybeDiscourageAndDisconnect(CNode& pnode, Peer& peer)
5145 : : {
5146 : 436572 : {
5147 : 436572 : LOCK(peer.m_misbehavior_mutex);
5148 : :
5149 : : // There's nothing to do if the m_should_discourage flag isn't set
5150 [ + + + - ]: 436572 : if (!peer.m_should_discourage) return false;
5151 : :
5152 [ + - ]: 424 : peer.m_should_discourage = false;
5153 : 436148 : } // peer.m_misbehavior_mutex
5154 : :
5155 [ + + ]: 424 : if (pnode.HasPermission(NetPermissionFlags::NoBan)) {
5156 : : // We never disconnect or discourage peers for bad behavior if they have NetPermissionFlags::NoBan permission
5157 : 283 : LogWarning("Not punishing noban peer %d!", peer.m_id);
5158 : 283 : return false;
5159 : : }
5160 : :
5161 [ + + ]: 141 : if (pnode.IsManualConn()) {
5162 : : // We never disconnect or discourage manual peers for bad behavior
5163 : 46 : LogWarning("Not punishing manually connected peer %d!", peer.m_id);
5164 : 46 : return false;
5165 : : }
5166 : :
5167 [ + + ]: 95 : if (pnode.addr.IsLocal()) {
5168 : : // We disconnect local peers for bad behavior but don't discourage (since that would discourage
5169 : : // all peers on the same local address)
5170 [ + - + - ]: 182 : LogDebug(BCLog::NET, "Warning: disconnecting but not discouraging %s peer %d!\n",
5171 : : pnode.m_inbound_onion ? "inbound onion" : "local", peer.m_id);
5172 : 91 : pnode.fDisconnect = true;
5173 : 91 : return true;
5174 : : }
5175 : :
5176 : : // Normal case: Disconnect the peer and discourage all nodes sharing the address
5177 [ + - ]: 4 : LogDebug(BCLog::NET, "Disconnecting and discouraging peer %d!\n", peer.m_id);
5178 [ + - ]: 4 : if (m_banman) m_banman->Discourage(pnode.addr);
5179 : 4 : m_connman.DisconnectNode(pnode.addr);
5180 : 4 : return true;
5181 : : }
5182 : :
5183 : 436567 : bool PeerManagerImpl::ProcessMessages(CNode* pfrom, std::atomic<bool>& interruptMsgProc)
5184 : : {
5185 : 436567 : AssertLockNotHeld(m_tx_download_mutex);
5186 : 436567 : AssertLockHeld(g_msgproc_mutex);
5187 : :
5188 : 436567 : PeerRef peer = GetPeerRef(pfrom->GetId());
5189 [ + - ]: 436567 : if (peer == nullptr) return false;
5190 : :
5191 : : // For outbound connections, ensure that the initial VERSION message
5192 : : // has been sent first before processing any incoming messages
5193 [ + + + + ]: 436567 : if (!pfrom->IsInboundConn() && !peer->m_outbound_version_message_sent) return false;
5194 : :
5195 : 435953 : {
5196 [ + - ]: 435953 : LOCK(peer->m_getdata_requests_mutex);
5197 [ + + ]: 435953 : if (!peer->m_getdata_requests.empty()) {
5198 [ + - ]: 2012 : ProcessGetData(*pfrom, *peer, interruptMsgProc);
5199 : : }
5200 : 0 : }
5201 : :
5202 [ + - ]: 435953 : const bool processed_orphan = ProcessOrphanTx(*peer);
5203 : :
5204 [ + + ]: 435953 : if (pfrom->fDisconnect)
5205 : : return false;
5206 : :
5207 [ + + ]: 435950 : if (processed_orphan) return true;
5208 : :
5209 : : // this maintains the order of responses
5210 : : // and prevents m_getdata_requests to grow unbounded
5211 : 435904 : {
5212 [ + - ]: 435904 : LOCK(peer->m_getdata_requests_mutex);
5213 [ + + + - ]: 435904 : if (!peer->m_getdata_requests.empty()) return true;
5214 : 1544 : }
5215 : :
5216 : : // Don't bother if send buffer is too full to respond anyway
5217 [ + + ]: 434360 : if (pfrom->fPauseSend) return false;
5218 : :
5219 [ + - ]: 434045 : auto poll_result{pfrom->PollMessage()};
5220 [ + + ]: 434045 : if (!poll_result) {
5221 : : // No message to process
5222 : : return false;
5223 : : }
5224 : :
5225 [ + + ]: 161846 : CNetMessage& msg{poll_result->first};
5226 : 161846 : bool fMoreWork = poll_result->second;
5227 : :
5228 : : TRACEPOINT(net, inbound_message,
5229 : : pfrom->GetId(),
5230 : : pfrom->m_addr_name.c_str(),
5231 : : pfrom->ConnectionTypeAsString().c_str(),
5232 : : msg.m_type.c_str(),
5233 : : msg.m_recv.size(),
5234 : : msg.m_recv.data()
5235 : 161846 : );
5236 : :
5237 [ + + ]: 161846 : if (m_opts.capture_messages) {
5238 [ + - ]: 7 : CaptureMessage(pfrom->addr, msg.m_type, MakeUCharSpan(msg.m_recv), /*is_incoming=*/true);
5239 : : }
5240 : :
5241 : 161846 : try {
5242 [ + + ]: 161846 : ProcessMessage(*pfrom, msg.m_type, msg.m_recv, msg.m_time, interruptMsgProc);
5243 [ + + ]: 161834 : if (interruptMsgProc) return false;
5244 : 161830 : {
5245 [ + - ]: 161830 : LOCK(peer->m_getdata_requests_mutex);
5246 [ + + ]: 161830 : if (!peer->m_getdata_requests.empty()) fMoreWork = true;
5247 : 161830 : }
5248 : : // Does this peer has an orphan ready to reconsider?
5249 : : // (Note: we may have provided a parent for an orphan provided
5250 : : // by another peer that was already processed; in that case,
5251 : : // the extra work may not be noticed, possibly resulting in an
5252 : : // unnecessary 100ms delay)
5253 [ + - ]: 161830 : LOCK(m_tx_download_mutex);
5254 [ + - + + ]: 161830 : if (m_txdownloadman.HaveMoreWork(peer->m_id)) fMoreWork = true;
5255 [ + - ]: 161842 : } catch (const std::exception& e) {
5256 [ + - + - : 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());
- + - + +
- + - ]
5257 : 12 : } catch (...) {
5258 [ - - - - : 0 : LogDebug(BCLog::NET, "%s(%s, %u bytes): Unknown exception caught\n", __func__, SanitizeString(msg.m_type), msg.m_message_size);
- - - - -
- ]
5259 [ - - ]: 0 : }
5260 : :
5261 : : return fMoreWork;
5262 : 870612 : }
5263 : :
5264 : 431037 : void PeerManagerImpl::ConsiderEviction(CNode& pto, Peer& peer, std::chrono::seconds time_in_seconds)
5265 : : {
5266 : 431037 : AssertLockHeld(cs_main);
5267 : :
5268 : 431037 : CNodeState &state = *State(pto.GetId());
5269 : :
5270 [ + + + + : 431037 : if (!state.m_chain_sync.m_protect && pto.IsOutboundOrBlockRelayConn() && state.fSyncStarted) {
+ + ]
5271 : : // This is an outbound peer subject to disconnection if they don't
5272 : : // announce a block with as much work as the current tip within
5273 : : // CHAIN_SYNC_TIMEOUT + HEADERS_RESPONSE_TIME seconds (note: if
5274 : : // their chain has more work than ours, we should sync to it,
5275 : : // unless it's invalid, in which case we should find that out and
5276 : : // disconnect from them elsewhere).
5277 [ + + - + : 8729 : if (state.pindexBestKnownBlock != nullptr && state.pindexBestKnownBlock->nChainWork >= m_chainman.ActiveChain().Tip()->nChainWork) {
+ + ]
5278 : : // 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
5279 [ + + ]: 144 : if (state.m_chain_sync.m_timeout != 0s) {
5280 : 5 : state.m_chain_sync.m_timeout = 0s;
5281 : 5 : state.m_chain_sync.m_work_header = nullptr;
5282 : 5 : state.m_chain_sync.m_sent_getheaders = false;
5283 : : }
5284 [ + + + - : 8128 : } 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)) {
+ + + + ]
5285 : : // 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
5286 : : // AND
5287 : : // we are noticing this for the first time (m_timeout is 0)
5288 : : // OR we noticed this at some point within the last CHAIN_SYNC_TIMEOUT + HEADERS_RESPONSE_TIME seconds and set a timeout
5289 : : // 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).
5290 : : // Either way, set a new timeout based on our current tip.
5291 : 125 : state.m_chain_sync.m_timeout = time_in_seconds + CHAIN_SYNC_TIMEOUT;
5292 [ - + ]: 125 : state.m_chain_sync.m_work_header = m_chainman.ActiveChain().Tip();
5293 : 125 : state.m_chain_sync.m_sent_getheaders = false;
5294 [ + - + + ]: 8003 : } else if (state.m_chain_sync.m_timeout > 0s && time_in_seconds > state.m_chain_sync.m_timeout) {
5295 : : // No evidence yet that our peer has synced to a chain with work equal to that
5296 : : // of our tip, when we first detected it was behind. Send a single getheaders
5297 : : // message to give the peer a chance to update us.
5298 [ + + ]: 39 : if (state.m_chain_sync.m_sent_getheaders) {
5299 : : // They've run out of time to catch up!
5300 [ + + + - : 16 : LogInfo("Outbound peer has old chain, best known block = %s, %s\n", state.pindexBestKnownBlock != nullptr ? state.pindexBestKnownBlock->GetBlockHash().ToString() : "<none>", pto.DisconnectMsg(fLogIPs));
+ - + - ]
5301 : 8 : pto.fDisconnect = true;
5302 : : } else {
5303 [ - + ]: 31 : assert(state.m_chain_sync.m_work_header);
5304 : : // Here, we assume that the getheaders message goes out,
5305 : : // because it'll either go out or be skipped because of a
5306 : : // getheaders in-flight already, in which case the peer should
5307 : : // still respond to us with a sufficiently high work chain tip.
5308 [ + - ]: 31 : MaybeSendGetHeaders(pto,
5309 : 31 : GetLocator(state.m_chain_sync.m_work_header->pprev),
5310 : : peer);
5311 [ + - + + : 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());
+ - + - +
- ]
5312 : 31 : state.m_chain_sync.m_sent_getheaders = true;
5313 : : // Bump the timeout to allow a response, which could clear the timeout
5314 : : // (if the response shows the peer has synced), reset the timeout (if
5315 : : // the peer syncs to the required work but not to our tip), or result
5316 : : // in disconnect (if we advance to the timeout and pindexBestKnownBlock
5317 : : // has not sufficiently progressed)
5318 : 31 : state.m_chain_sync.m_timeout = time_in_seconds + HEADERS_RESPONSE_TIME;
5319 : : }
5320 : : }
5321 : : }
5322 : 431037 : }
5323 : :
5324 : 225 : void PeerManagerImpl::EvictExtraOutboundPeers(std::chrono::seconds now)
5325 : : {
5326 : : // If we have any extra block-relay-only peers, disconnect the youngest unless
5327 : : // it's given us a block -- in which case, compare with the second-youngest, and
5328 : : // out of those two, disconnect the peer who least recently gave us a block.
5329 : : // The youngest block-relay-only peer would be the extra peer we connected
5330 : : // to temporarily in order to sync our tip; see net.cpp.
5331 : : // Note that we use higher nodeid as a measure for most recent connection.
5332 [ + + ]: 225 : if (m_connman.GetExtraBlockRelayCount() > 0) {
5333 : 3 : std::pair<NodeId, std::chrono::seconds> youngest_peer{-1, 0}, next_youngest_peer{-1, 0};
5334 : :
5335 [ + - ]: 3 : m_connman.ForEachNode([&](CNode* pnode) {
5336 [ + - - + ]: 9 : if (!pnode->IsBlockOnlyConn() || pnode->fDisconnect) return;
5337 [ + - ]: 9 : if (pnode->GetId() > youngest_peer.first) {
5338 : 9 : next_youngest_peer = youngest_peer;
5339 : 9 : youngest_peer.first = pnode->GetId();
5340 : 9 : youngest_peer.second = pnode->m_last_block_time;
5341 : : }
5342 : : });
5343 : 3 : NodeId to_disconnect = youngest_peer.first;
5344 [ + + ]: 3 : if (youngest_peer.second > next_youngest_peer.second) {
5345 : : // Our newest block-relay-only peer gave us a block more recently;
5346 : : // disconnect our second youngest.
5347 : 1 : to_disconnect = next_youngest_peer.first;
5348 : : }
5349 [ + - ]: 6 : m_connman.ForNode(to_disconnect, [&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
5350 : 3 : AssertLockHeld(::cs_main);
5351 : : // Make sure we're not getting a block right now, and that
5352 : : // we've been connected long enough for this eviction to happen
5353 : : // at all.
5354 : : // Note that we only request blocks from a peer if we learn of a
5355 : : // valid headers chain with at least as much work as our tip.
5356 : 3 : CNodeState *node_state = State(pnode->GetId());
5357 [ + - + + ]: 3 : if (node_state == nullptr ||
5358 [ + + + - ]: 3 : (now - pnode->m_connected >= MINIMUM_CONNECT_TIME && node_state->vBlocksInFlight.empty())) {
5359 : 2 : pnode->fDisconnect = true;
5360 [ + - ]: 2 : LogDebug(BCLog::NET, "disconnecting extra block-relay-only peer=%d (last block received at time %d)\n",
5361 : : pnode->GetId(), count_seconds(pnode->m_last_block_time));
5362 : 2 : return true;
5363 : : } else {
5364 [ + - ]: 1 : LogDebug(BCLog::NET, "keeping block-relay-only peer=%d chosen for eviction (connect time: %d, blocks_in_flight: %d)\n",
5365 : : pnode->GetId(), count_seconds(pnode->m_connected), node_state->vBlocksInFlight.size());
5366 : : }
5367 : : return false;
5368 : : });
5369 : : }
5370 : :
5371 : : // Check whether we have too many outbound-full-relay peers
5372 [ + + ]: 225 : if (m_connman.GetExtraFullOutboundCount() > 0) {
5373 : : // If we have more outbound-full-relay peers than we target, disconnect one.
5374 : : // Pick the outbound-full-relay peer that least recently announced
5375 : : // us a new block, with ties broken by choosing the more recent
5376 : : // connection (higher node id)
5377 : : // Protect peers from eviction if we don't have another connection
5378 : : // to their network, counting both outbound-full-relay and manual peers.
5379 : 4 : NodeId worst_peer = -1;
5380 : 4 : int64_t oldest_block_announcement = std::numeric_limits<int64_t>::max();
5381 : :
5382 [ + - ]: 4 : m_connman.ForEachNode([&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main, m_connman.GetNodesMutex()) {
5383 : 38 : AssertLockHeld(::cs_main);
5384 : :
5385 : : // Only consider outbound-full-relay peers that are not already
5386 : : // marked for disconnection
5387 [ + - - + ]: 38 : if (!pnode->IsFullOutboundConn() || pnode->fDisconnect) return;
5388 : 38 : CNodeState *state = State(pnode->GetId());
5389 [ + - ]: 38 : if (state == nullptr) return; // shouldn't be possible, but just in case
5390 : : // Don't evict our protected peers
5391 [ + - ]: 38 : if (state->m_chain_sync.m_protect) return;
5392 : : // If this is the only connection on a particular network that is
5393 : : // OUTBOUND_FULL_RELAY or MANUAL, protect it.
5394 [ + + ]: 38 : if (!m_connman.MultipleManualOrFullOutboundConns(pnode->addr.GetNetwork())) return;
5395 [ + + + + : 37 : if (state->m_last_block_announcement < oldest_block_announcement || (state->m_last_block_announcement == oldest_block_announcement && pnode->GetId() > worst_peer)) {
+ - ]
5396 : 34 : worst_peer = pnode->GetId();
5397 : 34 : oldest_block_announcement = state->m_last_block_announcement;
5398 : : }
5399 : : });
5400 [ + - ]: 4 : if (worst_peer != -1) {
5401 [ + - ]: 4 : bool disconnected = m_connman.ForNode(worst_peer, [&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
5402 : 4 : AssertLockHeld(::cs_main);
5403 : :
5404 : : // Only disconnect a peer that has been connected to us for
5405 : : // some reasonable fraction of our check-frequency, to give
5406 : : // it time for new information to have arrived.
5407 : : // Also don't disconnect any peer we're trying to download a
5408 : : // block from.
5409 : 4 : CNodeState &state = *State(pnode->GetId());
5410 [ + - + - ]: 4 : if (now - pnode->m_connected > MINIMUM_CONNECT_TIME && state.vBlocksInFlight.empty()) {
5411 [ + - ]: 4 : LogDebug(BCLog::NET, "disconnecting extra outbound peer=%d (last block announcement received at time %d)\n", pnode->GetId(), oldest_block_announcement);
5412 : 4 : pnode->fDisconnect = true;
5413 : 4 : return true;
5414 : : } else {
5415 [ # # ]: 0 : LogDebug(BCLog::NET, "keeping outbound peer=%d chosen for eviction (connect time: %d, blocks_in_flight: %d)\n",
5416 : : pnode->GetId(), count_seconds(pnode->m_connected), state.vBlocksInFlight.size());
5417 : 0 : return false;
5418 : : }
5419 : : });
5420 [ + - ]: 4 : if (disconnected) {
5421 : : // If we disconnected an extra peer, that means we successfully
5422 : : // connected to at least one peer after the last time we
5423 : : // detected a stale tip. Don't try any more extra peers until
5424 : : // we next detect a stale tip, to limit the load we put on the
5425 : : // network from these extra connections.
5426 : 4 : m_connman.SetTryNewOutboundPeer(false);
5427 : : }
5428 : : }
5429 : : }
5430 : 225 : }
5431 : :
5432 : 225 : void PeerManagerImpl::CheckForStaleTipAndEvictPeers()
5433 : : {
5434 : 225 : LOCK(cs_main);
5435 : :
5436 : 225 : auto now{GetTime<std::chrono::seconds>()};
5437 : :
5438 [ + - ]: 225 : EvictExtraOutboundPeers(now);
5439 : :
5440 [ + + ]: 225 : if (now > m_stale_tip_check_time) {
5441 : : // Check whether our tip is stale, and if so, allow using an extra
5442 : : // outbound peer
5443 [ + - + - : 74 : if (!m_chainman.m_blockman.LoadingBlocks() && m_connman.GetNetworkActive() && m_connman.GetUseAddrmanOutgoing() && TipMayBeStale()) {
+ + + + ]
5444 [ + - ]: 1 : LogInfo("Potential stale tip detected, will try using extra outbound peer (last tip update: %d seconds ago)\n",
5445 : : count_seconds(now - m_last_tip_update.load()));
5446 [ + - ]: 1 : m_connman.SetTryNewOutboundPeer(true);
5447 [ + - - + ]: 73 : } else if (m_connman.GetTryNewOutboundPeer()) {
5448 [ # # ]: 0 : m_connman.SetTryNewOutboundPeer(false);
5449 : : }
5450 : 74 : m_stale_tip_check_time = now + STALE_CHECK_INTERVAL;
5451 : : }
5452 : :
5453 [ + + + - : 225 : if (!m_initial_sync_finished && CanDirectFetch()) {
+ + ]
5454 [ + - ]: 56 : m_connman.StartExtraBlockRelayPeers();
5455 : 56 : m_initial_sync_finished = true;
5456 : : }
5457 : 225 : }
5458 : :
5459 : 431055 : void PeerManagerImpl::MaybeSendPing(CNode& node_to, Peer& peer, std::chrono::microseconds now)
5460 : : {
5461 [ + + ]: 431128 : if (m_connman.ShouldRunInactivityChecks(node_to, std::chrono::duration_cast<std::chrono::seconds>(now)) &&
5462 [ + + + + : 431061 : peer.m_ping_nonce_sent &&
+ + ]
5463 [ + + ]: 6 : now > peer.m_ping_start.load() + TIMEOUT_INTERVAL)
5464 : : {
5465 : : // The ping timeout is using mocktime. To disable the check during
5466 : : // testing, increase -peertimeout.
5467 [ + - + - ]: 2 : LogDebug(BCLog::NET, "ping timeout: %fs, %s", 0.000001 * count_microseconds(now - peer.m_ping_start.load()), node_to.DisconnectMsg(fLogIPs));
5468 : 1 : node_to.fDisconnect = true;
5469 : 1 : return;
5470 : : }
5471 : :
5472 : 431054 : bool pingSend = false;
5473 : :
5474 [ + + ]: 431054 : if (peer.m_ping_queued) {
5475 : : // RPC ping request by user
5476 : 15 : pingSend = true;
5477 : : }
5478 : :
5479 [ + + + + ]: 431054 : if (peer.m_ping_nonce_sent == 0 && now > peer.m_ping_start.load() + PING_INTERVAL) {
5480 : : // Ping automatically sent as a latency probe & keepalive.
5481 : : pingSend = true;
5482 : : }
5483 : :
5484 [ + + ]: 431054 : if (pingSend) {
5485 : 2587 : uint64_t nonce;
5486 : 2587 : do {
5487 : 2587 : nonce = FastRandomContext().rand64();
5488 [ - + ]: 2587 : } while (nonce == 0);
5489 : 2587 : peer.m_ping_queued = false;
5490 : 2587 : peer.m_ping_start = now;
5491 [ + - ]: 2587 : if (node_to.GetCommonVersion() > BIP0031_VERSION) {
5492 : 2587 : peer.m_ping_nonce_sent = nonce;
5493 [ + - ]: 5174 : MakeAndPushMessage(node_to, NetMsgType::PING, nonce);
5494 : : } else {
5495 : : // Peer is too old to support ping message type with nonce, pong will never arrive.
5496 : 0 : peer.m_ping_nonce_sent = 0;
5497 [ # # ]: 0 : MakeAndPushMessage(node_to, NetMsgType::PING);
5498 : : }
5499 : : }
5500 : : }
5501 : :
5502 : 431044 : void PeerManagerImpl::MaybeSendAddr(CNode& node, Peer& peer, std::chrono::microseconds current_time)
5503 : : {
5504 : : // Nothing to do for non-address-relay peers
5505 [ + + ]: 431044 : if (!peer.m_addr_relay_enabled) return;
5506 : :
5507 : 428598 : LOCK(peer.m_addr_send_times_mutex);
5508 : : // Periodically advertise our local address to the peer.
5509 [ + - + - : 428598 : if (fListen && !m_chainman.IsInitialBlockDownload() &&
+ + + + ]
5510 [ + + ]: 402947 : peer.m_next_local_addr_send < current_time) {
5511 : : // If we've sent before, clear the bloom filter for the peer, so that our
5512 : : // self-announcement will actually go out.
5513 : : // This might be unnecessary if the bloom filter has already rolled
5514 : : // over since our last self-announcement, but there is only a small
5515 : : // bandwidth cost that we can incur by doing this (which happens
5516 : : // once a day on average).
5517 [ + + ]: 1658 : if (peer.m_next_local_addr_send != 0us) {
5518 [ + - ]: 248 : peer.m_addr_known->reset();
5519 : : }
5520 [ + - + + ]: 1658 : if (std::optional<CService> local_service = GetLocalAddrForPeer(node)) {
5521 : 25 : CAddress local_addr{*local_service, peer.m_our_services, Now<NodeSeconds>()};
5522 [ + + ]: 25 : if (peer.m_next_local_addr_send == 0us) {
5523 : : // Send the initial self-announcement in its own message. This makes sure
5524 : : // rate-limiting with limited start-tokens doesn't ignore it if the first
5525 : : // message ends up containing multiple addresses.
5526 [ - + + + : 10 : std::vector<CAddress> self_announcement {local_addr};
- - ]
5527 [ + + ]: 5 : if (peer.m_wants_addrv2) {
5528 [ + - + - ]: 4 : MakeAndPushMessage(node, NetMsgType::ADDRV2, CAddress::V2_NETWORK(self_announcement));
5529 : : } else {
5530 [ + - + - ]: 6 : MakeAndPushMessage(node, NetMsgType::ADDR, CAddress::V1_NETWORK(self_announcement));
5531 : : }
5532 : 5 : } else {
5533 : : // All later self-announcements are sent together with the other addresses.
5534 [ + - ]: 20 : PushAddress(peer, local_addr);
5535 : : }
5536 : 25 : }
5537 : 1658 : peer.m_next_local_addr_send = current_time + m_rng.rand_exp_duration(AVG_LOCAL_ADDRESS_BROADCAST_INTERVAL);
5538 : : }
5539 : :
5540 : : // We sent an `addr` message to this peer recently. Nothing more to do.
5541 [ + + ]: 428598 : if (current_time <= peer.m_next_addr_send) return;
5542 : :
5543 [ - + ]: 3138 : peer.m_next_addr_send = current_time + m_rng.rand_exp_duration(AVG_ADDRESS_BROADCAST_INTERVAL);
5544 : :
5545 [ - + - + ]: 3138 : if (!Assume(peer.m_addrs_to_send.size() <= MAX_ADDR_TO_SEND)) {
5546 : : // Should be impossible since we always check size before adding to
5547 : : // m_addrs_to_send. Recover by trimming the vector.
5548 [ # # ]: 0 : peer.m_addrs_to_send.resize(MAX_ADDR_TO_SEND);
5549 : : }
5550 : :
5551 : : // Remove addr records that the peer already knows about, and add new
5552 : : // addrs to the m_addr_known filter on the same pass.
5553 : 22149 : auto addr_already_known = [&peer](const CAddress& addr) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex) {
5554 [ - + + - ]: 19011 : bool ret = peer.m_addr_known->contains(addr.GetKey());
5555 [ + - - + : 38022 : if (!ret) peer.m_addr_known->insert(addr.GetKey());
+ - ]
5556 : 19011 : return ret;
5557 : 3138 : };
5558 : 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),
5559 [ + - ]: 3138 : peer.m_addrs_to_send.end());
5560 : :
5561 : : // No addr messages to send
5562 [ + + ]: 3138 : if (peer.m_addrs_to_send.empty()) return;
5563 : :
5564 [ + + ]: 125 : if (peer.m_wants_addrv2) {
5565 [ + - + - ]: 24 : MakeAndPushMessage(node, NetMsgType::ADDRV2, CAddress::V2_NETWORK(peer.m_addrs_to_send));
5566 : : } else {
5567 [ + - + - ]: 226 : MakeAndPushMessage(node, NetMsgType::ADDR, CAddress::V1_NETWORK(peer.m_addrs_to_send));
5568 : : }
5569 : 125 : peer.m_addrs_to_send.clear();
5570 : :
5571 : : // we only send the big addr message once
5572 [ - + + + ]: 125 : if (peer.m_addrs_to_send.capacity() > 40) {
5573 : 21 : peer.m_addrs_to_send.shrink_to_fit();
5574 : : }
5575 : 428603 : }
5576 : :
5577 : 431044 : void PeerManagerImpl::MaybeSendSendHeaders(CNode& node, Peer& peer)
5578 : : {
5579 : : // Delay sending SENDHEADERS (BIP 130) until we're done with an
5580 : : // initial-headers-sync with this peer. Receiving headers announcements for
5581 : : // new blocks while trying to sync their headers chain is problematic,
5582 : : // because of the state tracking done.
5583 [ + + + - ]: 431044 : if (!peer.m_sent_sendheaders && node.GetCommonVersion() >= SENDHEADERS_VERSION) {
5584 : 173254 : LOCK(cs_main);
5585 : 173254 : CNodeState &state = *State(node.GetId());
5586 [ + + + + ]: 178360 : if (state.pindexBestKnownBlock != nullptr &&
5587 [ + - + - ]: 5106 : state.pindexBestKnownBlock->nChainWork > m_chainman.MinimumChainWork()) {
5588 : : // Tell our peer we prefer to receive headers rather than inv's
5589 : : // We send this to non-NODE NETWORK peers as well, because even
5590 : : // non-NODE NETWORK peers can announce blocks (such as pruning
5591 : : // nodes)
5592 [ + - + - ]: 829 : MakeAndPushMessage(node, NetMsgType::SENDHEADERS);
5593 : 829 : peer.m_sent_sendheaders = true;
5594 : : }
5595 : 173254 : }
5596 : 431044 : }
5597 : :
5598 : 431037 : void PeerManagerImpl::MaybeSendFeefilter(CNode& pto, Peer& peer, std::chrono::microseconds current_time)
5599 : : {
5600 [ + + ]: 431037 : if (m_opts.ignore_incoming_txs) return;
5601 [ + - ]: 430861 : if (pto.GetCommonVersion() < FEEFILTER_VERSION) return;
5602 : : // peers with the forcerelay permission should not filter txs to us
5603 [ + + ]: 430861 : if (pto.HasPermission(NetPermissionFlags::ForceRelay)) return;
5604 : : // Don't send feefilter messages to outbound block-relay-only peers since they should never announce
5605 : : // transactions to us, regardless of feefilter state.
5606 [ + + ]: 430743 : if (pto.IsBlockOnlyConn()) return;
5607 : :
5608 : 429492 : CAmount currentFilter = m_mempool.GetMinFee().GetFeePerK();
5609 : :
5610 [ + + ]: 429492 : if (m_chainman.IsInitialBlockDownload()) {
5611 : : // Received tx-inv messages are discarded when the active
5612 : : // chainstate is in IBD, so tell the peer to not send them.
5613 : : currentFilter = MAX_MONEY;
5614 : : } else {
5615 [ + + + - : 403631 : static const CAmount MAX_FILTER{m_fee_filter_rounder.round(MAX_MONEY)};
+ - ]
5616 [ + + ]: 403631 : if (peer.m_fee_filter_sent == MAX_FILTER) {
5617 : : // Send the current filter if we sent MAX_FILTER previously
5618 : : // and made it out of IBD.
5619 : 231 : peer.m_next_send_feefilter = 0us;
5620 : : }
5621 : : }
5622 [ + + ]: 429492 : if (current_time > peer.m_next_send_feefilter) {
5623 : 2978 : CAmount filterToSend = m_fee_filter_rounder.round(currentFilter);
5624 : : // We always have a fee filter of at least the min relay fee
5625 [ + + ]: 2978 : filterToSend = std::max(filterToSend, m_mempool.m_opts.min_relay_feerate.GetFeePerK());
5626 [ + + ]: 2978 : if (filterToSend != peer.m_fee_filter_sent) {
5627 [ + - ]: 1755 : MakeAndPushMessage(pto, NetMsgType::FEEFILTER, filterToSend);
5628 : 1755 : peer.m_fee_filter_sent = filterToSend;
5629 : : }
5630 : 2978 : peer.m_next_send_feefilter = current_time + m_rng.rand_exp_duration(AVG_FEEFILTER_BROADCAST_INTERVAL);
5631 : : }
5632 : : // If the fee filter has changed substantially and it's still more than MAX_FEEFILTER_CHANGE_DELAY
5633 : : // until scheduled broadcast, then move the broadcast to within MAX_FEEFILTER_CHANGE_DELAY.
5634 [ + + ]: 426514 : else if (current_time + MAX_FEEFILTER_CHANGE_DELAY < peer.m_next_send_feefilter &&
5635 [ + + + + ]: 22735 : (currentFilter < 3 * peer.m_fee_filter_sent / 4 || currentFilter > 4 * peer.m_fee_filter_sent / 3)) {
5636 : 1722 : peer.m_next_send_feefilter = current_time + m_rng.randrange<std::chrono::microseconds>(MAX_FEEFILTER_CHANGE_DELAY);
5637 : : }
5638 : : }
5639 : :
5640 : : namespace {
5641 : : class CompareInvMempoolOrder
5642 : : {
5643 : : const CTxMemPool* m_mempool;
5644 : : public:
5645 : 106492 : explicit CompareInvMempoolOrder(CTxMemPool* mempool) : m_mempool{mempool} {}
5646 : :
5647 : 23415 : bool operator()(std::set<Wtxid>::iterator a, std::set<Wtxid>::iterator b)
5648 : : {
5649 : : /* As std::make_heap produces a max-heap, we want the entries with the
5650 : : * higher mining score to sort later. */
5651 : 23415 : return m_mempool->CompareMiningScoreWithTopology(*b, *a);
5652 : : }
5653 : : };
5654 : : } // namespace
5655 : :
5656 : 27827 : bool PeerManagerImpl::RejectIncomingTxs(const CNode& peer) const
5657 : : {
5658 : : // block-relay-only peers may never send txs to us
5659 [ + + ]: 27827 : if (peer.IsBlockOnlyConn()) return true;
5660 [ + + ]: 27787 : if (peer.IsFeelerConn()) return true;
5661 : : // In -blocksonly mode, peers need the 'relay' permission to send txs to us
5662 [ + + + + ]: 27783 : if (m_opts.ignore_incoming_txs && !peer.HasPermission(NetPermissionFlags::Relay)) return true;
5663 : : return false;
5664 : : }
5665 : :
5666 : 1623 : bool PeerManagerImpl::SetupAddressRelay(const CNode& node, Peer& peer)
5667 : : {
5668 : : // We don't participate in addr relay with outbound block-relay-only
5669 : : // connections to prevent providing adversaries with the additional
5670 : : // information of addr traffic to infer the link.
5671 [ + + ]: 1623 : if (node.IsBlockOnlyConn()) return false;
5672 : :
5673 [ + + ]: 1589 : if (!peer.m_addr_relay_enabled.exchange(true)) {
5674 : : // During version message processing (non-block-relay-only outbound peers)
5675 : : // or on first addr-related message we have received (inbound peers), initialize
5676 : : // m_addr_known.
5677 : 1544 : peer.m_addr_known = std::make_unique<CRollingBloomFilter>(5000, 0.001);
5678 : : }
5679 : :
5680 : : return true;
5681 : : }
5682 : :
5683 : 436572 : bool PeerManagerImpl::SendMessages(CNode* pto)
5684 : : {
5685 : 436572 : AssertLockNotHeld(m_tx_download_mutex);
5686 : 436572 : AssertLockHeld(g_msgproc_mutex);
5687 : :
5688 : 436572 : PeerRef peer = GetPeerRef(pto->GetId());
5689 [ + - ]: 436572 : if (!peer) return false;
5690 : 436572 : const Consensus::Params& consensusParams = m_chainparams.GetConsensus();
5691 : :
5692 : : // We must call MaybeDiscourageAndDisconnect first, to ensure that we'll
5693 : : // disconnect misbehaving peers even before the version handshake is complete.
5694 [ + - + + ]: 436572 : if (MaybeDiscourageAndDisconnect(*pto, *peer)) return true;
5695 : :
5696 : : // Initiate version handshake for outbound connections
5697 [ + + + + ]: 436477 : if (!pto->IsInboundConn() && !peer->m_outbound_version_message_sent) {
5698 [ + - ]: 616 : PushNodeVersion(*pto, *peer);
5699 : 616 : peer->m_outbound_version_message_sent = true;
5700 : : }
5701 : :
5702 : : // Don't send anything until the version handshake is complete
5703 [ + + + + ]: 436477 : if (!pto->fSuccessfullyConnected || pto->fDisconnect)
5704 : 5354 : return true;
5705 : :
5706 : 431123 : const auto current_time{GetTime<std::chrono::microseconds>()};
5707 : :
5708 : : // The logic below does not apply to private broadcast peers, so skip it.
5709 : : // Also in CConnman::PushMessage() we make sure that unwanted messages are
5710 : : // not sent. This here is just an optimization.
5711 [ + + ]: 431123 : if (pto->IsPrivateBroadcastConn()) {
5712 [ - + ]: 77 : if (pto->m_connected + PRIVATE_BROADCAST_MAX_CONNECTION_LIFETIME < current_time) {
5713 [ # # # # ]: 0 : LogInfo("[privatebroadcast] Disconnecting: did not complete the transaction send within %d seconds, peer=%d%s",
5714 : : count_seconds(PRIVATE_BROADCAST_MAX_CONNECTION_LIFETIME), pto->GetId(), pto->LogIP(fLogIPs));
5715 : 0 : pto->fDisconnect = true;
5716 : : }
5717 : 77 : return true;
5718 : : }
5719 : :
5720 [ + + + + ]: 431046 : if (pto->IsAddrFetchConn() && current_time - pto->m_connected > 10 * AVG_ADDRESS_BROADCAST_INTERVAL) {
5721 [ + - + - : 2 : LogDebug(BCLog::NET, "addrfetch connection timeout, %s\n", pto->DisconnectMsg(fLogIPs));
+ - + - ]
5722 : 1 : pto->fDisconnect = true;
5723 : 1 : return true;
5724 : : }
5725 : :
5726 [ + - ]: 431045 : MaybeSendPing(*pto, *peer, current_time);
5727 : :
5728 : : // MaybeSendPing may have marked peer for disconnection
5729 [ + + ]: 431045 : if (pto->fDisconnect) return true;
5730 : :
5731 [ + - ]: 431044 : MaybeSendAddr(*pto, *peer, current_time);
5732 : :
5733 [ + - ]: 431044 : MaybeSendSendHeaders(*pto, *peer);
5734 : :
5735 : 431044 : {
5736 [ + - ]: 431044 : LOCK(cs_main);
5737 : :
5738 : 431044 : CNodeState &state = *State(pto->GetId());
5739 : :
5740 : : // Start block sync
5741 [ - + ]: 431044 : if (m_chainman.m_best_header == nullptr) {
5742 [ # # # # ]: 0 : m_chainman.m_best_header = m_chainman.ActiveChain().Tip();
5743 : : }
5744 : :
5745 : : // Determine whether we might try initial headers sync or parallel
5746 : : // block download from this peer -- this mostly affects behavior while
5747 : : // in IBD (once out of IBD, we sync from all peers).
5748 : 431044 : bool sync_blocks_and_headers_from_peer = false;
5749 [ + + ]: 431044 : if (state.fPreferredDownload) {
5750 : : sync_blocks_and_headers_from_peer = true;
5751 [ + + + + ]: 185893 : } else if (CanServeBlocks(*peer) && !pto->IsAddrFetchConn()) {
5752 : : // Typically this is an inbound peer. If we don't have any outbound
5753 : : // peers, or if we aren't downloading any blocks from such peers,
5754 : : // then allow block downloads from this peer, too.
5755 : : // We prefer downloading blocks from outbound peers to avoid
5756 : : // putting undue load on (say) some home user who is just making
5757 : : // outbound connections to the network, but if our only source of
5758 : : // the latest blocks is from an inbound peer, we have to be sure to
5759 : : // eventually download it (and not just wait indefinitely for an
5760 : : // outbound peer to have it).
5761 [ + + + + ]: 184426 : if (m_num_preferred_download_peers == 0 || mapBlocksInFlight.empty()) {
5762 : : sync_blocks_and_headers_from_peer = true;
5763 : : }
5764 : : }
5765 : :
5766 [ + + + + : 431044 : if (!state.fSyncStarted && CanServeBlocks(*peer) && !m_chainman.m_blockman.LoadingBlocks()) {
+ - ]
5767 : : // Only actively request headers from a single peer, unless we're close to today.
5768 [ + + + + : 7618 : if ((nSyncStarted == 0 && sync_blocks_and_headers_from_peer) || m_chainman.m_best_header->Time() > NodeClock::now() - 24h) {
+ + ]
5769 : 1541 : const CBlockIndex* pindexStart = m_chainman.m_best_header;
5770 : : /* If possible, start at the block preceding the currently
5771 : : best known header. This ensures that we always get a
5772 : : non-empty list of headers back as long as the peer
5773 : : is up-to-date. With a non-empty response, we can initialise
5774 : : the peer's known best block. This wouldn't be possible
5775 : : if we requested starting at m_chainman.m_best_header and
5776 : : got back an empty response. */
5777 [ + + ]: 1541 : if (pindexStart->pprev)
5778 : 1301 : pindexStart = pindexStart->pprev;
5779 [ + - + - : 1541 : if (MaybeSendGetHeaders(*pto, GetLocator(pindexStart), *peer)) {
+ - ]
5780 [ + - + - : 1541 : LogDebug(BCLog::NET, "initial getheaders (%d) to peer=%d (startheight:%d)\n", pindexStart->nHeight, pto->GetId(), peer->m_starting_height);
+ - ]
5781 : :
5782 : 1541 : state.fSyncStarted = true;
5783 : 1541 : peer->m_headers_sync_timeout = current_time + HEADERS_DOWNLOAD_TIMEOUT_BASE +
5784 : : (
5785 : : // Convert HEADERS_DOWNLOAD_TIMEOUT_PER_HEADER to microseconds before scaling
5786 : : // to maintain precision
5787 : 1541 : std::chrono::microseconds{HEADERS_DOWNLOAD_TIMEOUT_PER_HEADER} *
5788 : 1541 : Ticks<std::chrono::seconds>(NodeClock::now() - m_chainman.m_best_header->Time()) / consensusParams.nPowTargetSpacing
5789 : 1541 : );
5790 : 1541 : nSyncStarted++;
5791 : : }
5792 : : }
5793 : : }
5794 : :
5795 : : //
5796 : : // Try sending block announcements via headers
5797 : : //
5798 : 431044 : {
5799 : : // If we have no more than MAX_BLOCKS_TO_ANNOUNCE in our
5800 : : // list of block hashes we're relaying, and our peer wants
5801 : : // headers announcements, then find the first header
5802 : : // not yet known to our peer but would connect, and send.
5803 : : // If no header would connect, or if we have too many
5804 : : // blocks, or if the peer doesn't want headers, just
5805 : : // add all to the inv queue.
5806 [ + - ]: 431044 : LOCK(peer->m_block_inv_mutex);
5807 : 431044 : std::vector<CBlock> vHeaders;
5808 [ + + ]: 431044 : bool fRevertToInv = ((!peer->m_prefers_headers &&
5809 [ + + + + : 431044 : (!state.m_requested_hb_cmpctblocks || peer->m_blocks_for_headers_relay.size() > 1)) ||
- + + - ]
5810 [ - + + + ]: 245605 : peer->m_blocks_for_headers_relay.size() > MAX_BLOCKS_TO_ANNOUNCE);
5811 : 431044 : const CBlockIndex *pBestIndex = nullptr; // last header queued for delivery
5812 [ + - ]: 431044 : ProcessBlockAvailability(pto->GetId()); // ensure pindexBestKnownBlock is up-to-date
5813 : :
5814 [ + + ]: 431044 : if (!fRevertToInv) {
5815 : 245363 : bool fFoundStartingHeader = false;
5816 : : // Try to find first header that our peer doesn't have, and
5817 : : // then send all headers past that one. If we come across any
5818 : : // headers that aren't on m_chainman.ActiveChain(), give up.
5819 [ + + ]: 294885 : for (const uint256& hash : peer->m_blocks_for_headers_relay) {
5820 [ + - ]: 49818 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hash);
5821 [ - + ]: 49818 : assert(pindex);
5822 [ + - + - : 99636 : if (m_chainman.ActiveChain()[pindex->nHeight] != pindex) {
+ + ]
5823 : : // Bail out if we reorged away from this block
5824 : : fRevertToInv = true;
5825 : : break;
5826 : : }
5827 [ + + + - ]: 49814 : if (pBestIndex != nullptr && pindex->pprev != pBestIndex) {
5828 : : // This means that the list of blocks to announce don't
5829 : : // connect to each other.
5830 : : // This shouldn't really be possible to hit during
5831 : : // regular operation (because reorgs should take us to
5832 : : // a chain that has some block not on the prior chain,
5833 : : // which should be caught by the prior check), but one
5834 : : // way this could happen is by using invalidateblock /
5835 : : // reconsiderblock repeatedly on the tip, causing it to
5836 : : // be added multiple times to m_blocks_for_headers_relay.
5837 : : // Robustly deal with this rare situation by reverting
5838 : : // to an inv.
5839 : : fRevertToInv = true;
5840 : : break;
5841 : : }
5842 : 49814 : pBestIndex = pindex;
5843 [ + + ]: 49814 : if (fFoundStartingHeader) {
5844 : : // add this to the headers message
5845 [ + - ]: 974 : vHeaders.emplace_back(pindex->GetBlockHeader());
5846 [ + - + + ]: 48840 : } else if (PeerHasHeader(&state, pindex)) {
5847 : 39112 : continue; // keep looking for the first new block
5848 [ + - + - : 9728 : } else if (pindex->pprev == nullptr || PeerHasHeader(&state, pindex->pprev)) {
+ + ]
5849 : : // Peer doesn't have this header but they do have the prior one.
5850 : : // Start sending headers.
5851 : 9436 : fFoundStartingHeader = true;
5852 [ + - ]: 9436 : vHeaders.emplace_back(pindex->GetBlockHeader());
5853 : : } else {
5854 : : // Peer doesn't have this header or the prior one -- nothing will
5855 : : // connect, so bail out.
5856 : : fRevertToInv = true;
5857 : : break;
5858 : : }
5859 : : }
5860 : : }
5861 [ + + + + ]: 245363 : if (!fRevertToInv && !vHeaders.empty()) {
5862 [ - + + + : 9436 : if (vHeaders.size() == 1 && state.m_requested_hb_cmpctblocks) {
+ + ]
5863 : : // We only send up to 1 block as header-and-ids, as otherwise
5864 : : // probably means we're doing an initial-ish-sync or they're slow
5865 [ + - + - : 11212 : LogDebug(BCLog::NET, "%s sending header-and-ids %s to peer=%d\n", __func__,
+ - + - +
- ]
5866 : : vHeaders.front().GetHash().ToString(), pto->GetId());
5867 : :
5868 : 5606 : std::optional<CSerializedNetMsg> cached_cmpctblock_msg;
5869 : 5606 : {
5870 [ + - ]: 5606 : LOCK(m_most_recent_block_mutex);
5871 [ + + ]: 5606 : if (m_most_recent_block_hash == pBestIndex->GetBlockHash()) {
5872 [ + - + - ]: 134 : cached_cmpctblock_msg = NetMsg::Make(NetMsgType::CMPCTBLOCK, *m_most_recent_compact_block);
5873 : : }
5874 : 0 : }
5875 [ + + ]: 5606 : if (cached_cmpctblock_msg.has_value()) {
5876 [ + - ]: 67 : PushMessage(*pto, std::move(cached_cmpctblock_msg.value()));
5877 : : } else {
5878 : 5539 : CBlock block;
5879 [ + - ]: 5539 : const bool ret{m_chainman.m_blockman.ReadBlock(block, *pBestIndex)};
5880 [ - + ]: 5539 : assert(ret);
5881 [ + - ]: 5539 : CBlockHeaderAndShortTxIDs cmpctblock{block, m_rng.rand64()};
5882 [ + - + - ]: 11078 : MakeAndPushMessage(*pto, NetMsgType::CMPCTBLOCK, cmpctblock);
5883 : 5539 : }
5884 [ + + ]: 5606 : state.pindexBestHeaderSent = pBestIndex;
5885 [ + - ]: 9436 : } else if (peer->m_prefers_headers) {
5886 [ + + ]: 3830 : if (vHeaders.size() > 1) {
5887 [ + - + - : 2025 : LogDebug(BCLog::NET, "%s: %u headers, range (%s, %s), to peer=%d\n", __func__,
+ - + - +
- + - +
- ]
5888 : : vHeaders.size(),
5889 : : vHeaders.front().GetHash().ToString(),
5890 : : vHeaders.back().GetHash().ToString(), pto->GetId());
5891 : : } else {
5892 [ + - + - : 6310 : LogDebug(BCLog::NET, "%s: sending header %s to peer=%d\n", __func__,
+ - + - +
- ]
5893 : : vHeaders.front().GetHash().ToString(), pto->GetId());
5894 : : }
5895 [ + - + - ]: 3830 : MakeAndPushMessage(*pto, NetMsgType::HEADERS, TX_WITH_WITNESS(vHeaders));
5896 : 3830 : state.pindexBestHeaderSent = pBestIndex;
5897 : : } else
5898 : : fRevertToInv = true;
5899 : : }
5900 [ + + ]: 431044 : if (fRevertToInv) {
5901 : : // If falling back to using an inv, just try to inv the tip.
5902 : : // The last entry in m_blocks_for_headers_relay was our tip at some point
5903 : : // in the past.
5904 [ + + ]: 185977 : if (!peer->m_blocks_for_headers_relay.empty()) {
5905 [ + - ]: 25145 : const uint256& hashToAnnounce = peer->m_blocks_for_headers_relay.back();
5906 [ + - ]: 25145 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hashToAnnounce);
5907 [ - + ]: 25145 : assert(pindex);
5908 : :
5909 : : // Warn if we're announcing a block that is not on the main chain.
5910 : : // This should be very rare and could be optimized out.
5911 : : // Just log for now.
5912 [ + - + - : 50290 : if (m_chainman.ActiveChain()[pindex->nHeight] != pindex) {
+ + ]
5913 [ + - + - : 12 : LogDebug(BCLog::NET, "Announcing block %s not on main chain (tip=%s)\n",
+ - - + +
- + - +
- ]
5914 : : hashToAnnounce.ToString(), m_chainman.ActiveChain().Tip()->GetBlockHash().ToString());
5915 : : }
5916 : :
5917 : : // If the peer's chain has this block, don't inv it back.
5918 [ + - + + ]: 25145 : if (!PeerHasHeader(&state, pindex)) {
5919 [ + - ]: 7773 : peer->m_blocks_for_inv_relay.push_back(hashToAnnounce);
5920 [ + - + - : 15546 : LogDebug(BCLog::NET, "%s: sending inv peer=%d hash=%s\n", __func__,
+ - + - ]
5921 : : pto->GetId(), hashToAnnounce.ToString());
5922 : : }
5923 : : }
5924 : : }
5925 [ + + ]: 431044 : peer->m_blocks_for_headers_relay.clear();
5926 [ + - ]: 431044 : }
5927 : :
5928 : : //
5929 : : // Message: inventory
5930 : : //
5931 : 431044 : std::vector<CInv> vInv;
5932 : 431044 : {
5933 [ + - ]: 431044 : LOCK(peer->m_block_inv_mutex);
5934 [ - + - + : 431044 : vInv.reserve(std::max<size_t>(peer->m_blocks_for_inv_relay.size(), INVENTORY_BROADCAST_TARGET));
+ - ]
5935 : :
5936 : : // Add blocks
5937 [ + + ]: 438836 : for (const uint256& hash : peer->m_blocks_for_inv_relay) {
5938 [ + - ]: 7792 : vInv.emplace_back(MSG_BLOCK, hash);
5939 [ - + - + ]: 7792 : if (vInv.size() == MAX_INV_SZ) {
5940 [ # # # # ]: 0 : MakeAndPushMessage(*pto, NetMsgType::INV, vInv);
5941 [ - - ]: 7792 : vInv.clear();
5942 : : }
5943 : : }
5944 [ + + + - ]: 438820 : peer->m_blocks_for_inv_relay.clear();
5945 : 0 : }
5946 : :
5947 [ + - + + ]: 431044 : if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
5948 [ + - ]: 429745 : LOCK(tx_relay->m_tx_inventory_mutex);
5949 : : // Check whether periodic sends should happen
5950 [ + + ]: 429745 : bool fSendTrickle = pto->HasPermission(NetPermissionFlags::NoBan);
5951 [ + + ]: 429745 : if (tx_relay->m_next_inv_send_time < current_time) {
5952 : 7272 : fSendTrickle = true;
5953 [ + + ]: 7272 : if (pto->IsInboundConn()) {
5954 [ + - ]: 3604 : tx_relay->m_next_inv_send_time = NextInvToInbounds(current_time, INBOUND_INVENTORY_BROADCAST_INTERVAL, pto->m_network_key);
5955 : : } else {
5956 : 3668 : tx_relay->m_next_inv_send_time = current_time + m_rng.rand_exp_duration(OUTBOUND_INVENTORY_BROADCAST_INTERVAL);
5957 : : }
5958 : : }
5959 : :
5960 : : // Time to send but the peer has requested we not relay transactions.
5961 [ + + ]: 426141 : if (fSendTrickle) {
5962 [ + - ]: 106492 : LOCK(tx_relay->m_bloom_filter_mutex);
5963 [ + + ]: 106492 : if (!tx_relay->m_relay_txs) tx_relay->m_tx_inventory_to_send.clear();
5964 : 106492 : }
5965 : :
5966 : : // Respond to BIP35 mempool requests
5967 [ + - + + ]: 106492 : if (fSendTrickle && tx_relay->m_send_mempool) {
5968 [ + - ]: 1 : auto vtxinfo = m_mempool.infoAll();
5969 : 1 : tx_relay->m_send_mempool = false;
5970 [ + - ]: 1 : const CFeeRate filterrate{tx_relay->m_fee_filter_received.load()};
5971 : :
5972 [ + - ]: 1 : LOCK(tx_relay->m_bloom_filter_mutex);
5973 : :
5974 [ + + ]: 3 : for (const auto& txinfo : vtxinfo) {
5975 [ + - ]: 2 : const Txid& txid{txinfo.tx->GetHash()};
5976 [ + - ]: 2 : const Wtxid& wtxid{txinfo.tx->GetWitnessHash()};
5977 [ + - ]: 2 : const auto inv = peer->m_wtxid_relay ?
5978 : : CInv{MSG_WTX, wtxid.ToUint256()} :
5979 [ + - - - ]: 2 : CInv{MSG_TX, txid.ToUint256()};
5980 : 2 : tx_relay->m_tx_inventory_to_send.erase(wtxid);
5981 : :
5982 : : // Don't send transactions that peers will not put into their mempool
5983 [ + - - + ]: 2 : if (txinfo.fee < filterrate.GetFee(txinfo.vsize)) {
5984 : 0 : continue;
5985 : : }
5986 [ + - ]: 2 : if (tx_relay->m_bloom_filter) {
5987 [ + - + + ]: 2 : if (!tx_relay->m_bloom_filter->IsRelevantAndUpdate(*txinfo.tx)) continue;
5988 : : }
5989 [ + - ]: 1 : tx_relay->m_tx_inventory_known_filter.insert(inv.hash);
5990 [ + - ]: 1 : vInv.push_back(inv);
5991 [ - + - + ]: 1 : if (vInv.size() == MAX_INV_SZ) {
5992 [ # # # # ]: 0 : MakeAndPushMessage(*pto, NetMsgType::INV, vInv);
5993 [ - - ]: 2 : vInv.clear();
5994 : : }
5995 : : }
5996 : 1 : }
5997 : :
5998 : : // Determine transactions to relay
5999 : 106492 : if (fSendTrickle) {
6000 : : // Produce a vector with all candidates for sending
6001 : 106492 : std::vector<std::set<Wtxid>::iterator> vInvTx;
6002 [ + - ]: 106492 : vInvTx.reserve(tx_relay->m_tx_inventory_to_send.size());
6003 [ + + ]: 126847 : for (std::set<Wtxid>::iterator it = tx_relay->m_tx_inventory_to_send.begin(); it != tx_relay->m_tx_inventory_to_send.end(); it++) {
6004 [ + - ]: 20355 : vInvTx.push_back(it);
6005 : : }
6006 [ + - ]: 106492 : const CFeeRate filterrate{tx_relay->m_fee_filter_received.load()};
6007 : : // Topologically and fee-rate sort the inventory we send for privacy and priority reasons.
6008 : : // A heap is used so that not all items need sorting if only a few are being sent.
6009 : 106492 : CompareInvMempoolOrder compareInvMempoolOrder(&m_mempool);
6010 [ + - ]: 106492 : std::make_heap(vInvTx.begin(), vInvTx.end(), compareInvMempoolOrder);
6011 : : // No reason to drain out at many times the network's capacity,
6012 : : // especially since we have many peers and some will draw much shorter delays.
6013 : 106492 : unsigned int nRelayedTransactions = 0;
6014 [ + - ]: 106492 : LOCK(tx_relay->m_bloom_filter_mutex);
6015 [ - + ]: 106492 : size_t broadcast_max{INVENTORY_BROADCAST_TARGET + (tx_relay->m_tx_inventory_to_send.size()/1000)*5};
6016 [ - + ]: 106492 : broadcast_max = std::min<size_t>(INVENTORY_BROADCAST_MAX, broadcast_max);
6017 [ + + + + ]: 126658 : while (!vInvTx.empty() && nRelayedTransactions < broadcast_max) {
6018 : : // Fetch the top element from the heap
6019 [ + - ]: 20166 : std::pop_heap(vInvTx.begin(), vInvTx.end(), compareInvMempoolOrder);
6020 : 20166 : std::set<Wtxid>::iterator it = vInvTx.back();
6021 : 20166 : vInvTx.pop_back();
6022 : 20166 : auto wtxid = *it;
6023 : : // Remove it from the to-be-sent set
6024 : 20166 : tx_relay->m_tx_inventory_to_send.erase(it);
6025 : : // Not in the mempool anymore? don't bother sending it.
6026 [ + - ]: 20166 : auto txinfo = m_mempool.info(wtxid);
6027 [ + + ]: 20166 : if (!txinfo.tx) {
6028 : 1348 : continue;
6029 : : }
6030 : : // `TxRelay::m_tx_inventory_known_filter` contains either txids or wtxids
6031 : : // depending on whether our peer supports wtxid-relay. Therefore, first
6032 : : // construct the inv and then use its hash for the filter check.
6033 [ + + ]: 18818 : const auto inv = peer->m_wtxid_relay ?
6034 : : CInv{MSG_WTX, wtxid.ToUint256()} :
6035 [ + - + - ]: 18818 : CInv{MSG_TX, txinfo.tx->GetHash().ToUint256()};
6036 : : // Check if not in the filter already
6037 [ + - + + ]: 18818 : if (tx_relay->m_tx_inventory_known_filter.contains(inv.hash)) {
6038 : 1644 : continue;
6039 : : }
6040 : : // Peer told you to not send transactions at that feerate? Don't bother sending it.
6041 [ + - + + ]: 17174 : if (txinfo.fee < filterrate.GetFee(txinfo.vsize)) {
6042 : 18 : continue;
6043 : : }
6044 [ + + + - : 17156 : if (tx_relay->m_bloom_filter && !tx_relay->m_bloom_filter->IsRelevantAndUpdate(*txinfo.tx)) continue;
+ + ]
6045 : : // Send
6046 [ + - ]: 17154 : vInv.push_back(inv);
6047 : 17154 : nRelayedTransactions++;
6048 [ - + - + ]: 17154 : if (vInv.size() == MAX_INV_SZ) {
6049 [ # # # # ]: 0 : MakeAndPushMessage(*pto, NetMsgType::INV, vInv);
6050 [ # # ]: 0 : vInv.clear();
6051 : : }
6052 [ + - ]: 17154 : tx_relay->m_tx_inventory_known_filter.insert(inv.hash);
6053 : 20166 : }
6054 : :
6055 : : // Ensure we'll respond to GETDATA requests for anything we've just announced
6056 [ + - ]: 106492 : LOCK(m_mempool.cs);
6057 [ + - ]: 106492 : tx_relay->m_last_inv_sequence = m_mempool.GetSequence();
6058 [ + - ]: 212984 : }
6059 : 429745 : }
6060 [ + + ]: 431044 : if (!vInv.empty())
6061 [ + - + - ]: 35910 : MakeAndPushMessage(*pto, NetMsgType::INV, vInv);
6062 : :
6063 : : // Detect whether we're stalling
6064 [ + + ]: 431044 : auto stalling_timeout = m_block_stalling_timeout.load();
6065 [ + + + + ]: 431044 : if (state.m_stalling_since.count() && state.m_stalling_since < current_time - stalling_timeout) {
6066 : : // Stalling only triggers when the block download window cannot move. During normal steady state,
6067 : : // the download window should be much larger than the to-be-downloaded set of blocks, so disconnection
6068 : : // should only happen during initial block download.
6069 [ + - + - ]: 6 : LogInfo("Peer is stalling block download, %s\n", pto->DisconnectMsg(fLogIPs));
6070 [ + - ]: 6 : pto->fDisconnect = true;
6071 : : // Increase timeout for the next peer so that we don't disconnect multiple peers if our own
6072 : : // bandwidth is insufficient.
6073 [ + - ]: 6 : const auto new_timeout = std::min(2 * stalling_timeout, BLOCK_STALLING_TIMEOUT_MAX);
6074 [ + - + - ]: 6 : if (stalling_timeout != new_timeout && m_block_stalling_timeout.compare_exchange_strong(stalling_timeout, new_timeout)) {
6075 [ + - + - : 6 : LogDebug(BCLog::NET, "Increased stalling timeout temporarily to %d seconds\n", count_seconds(new_timeout));
+ - ]
6076 : : }
6077 : 6 : return true;
6078 : : }
6079 : : // In case there is a block that has been in flight from this peer for block_interval * (1 + 0.5 * N)
6080 : : // (with N the number of peers from which we're downloading validated blocks), disconnect due to timeout.
6081 : : // We compensate for other peers to prevent killing off peers due to our own downstream link
6082 : : // being saturated. We only count validated in-flight blocks so peers can't advertise non-existing block hashes
6083 : : // to unreasonably increase our timeout.
6084 [ + + ]: 431038 : if (state.vBlocksInFlight.size() > 0) {
6085 : 44919 : QueuedBlock &queuedBlock = state.vBlocksInFlight.front();
6086 : 44919 : int nOtherPeersWithValidatedDownloads = m_peers_downloading_from - 1;
6087 [ - + ]: 44919 : if (current_time > state.m_downloading_since + std::chrono::seconds{consensusParams.nPowTargetSpacing} * (BLOCK_DOWNLOAD_TIMEOUT_BASE + BLOCK_DOWNLOAD_TIMEOUT_PER_PEER * nOtherPeersWithValidatedDownloads)) {
6088 [ # # # # : 0 : LogInfo("Timeout downloading block %s, %s\n", queuedBlock.pindex->GetBlockHash().ToString(), pto->DisconnectMsg(fLogIPs));
# # ]
6089 : 0 : pto->fDisconnect = true;
6090 : 0 : return true;
6091 : : }
6092 : : }
6093 : : // Check for headers sync timeouts
6094 [ + + + + ]: 431038 : if (state.fSyncStarted && peer->m_headers_sync_timeout < std::chrono::microseconds::max()) {
6095 : : // Detect whether this is a stalling initial-headers-sync peer
6096 [ + + ]: 15614 : if (m_chainman.m_best_header->Time() <= NodeClock::now() - 24h) {
6097 [ + + + - : 14183 : if (current_time > peer->m_headers_sync_timeout && nSyncStarted == 1 && (m_num_preferred_download_peers - state.fPreferredDownload >= 1)) {
+ + ]
6098 : : // Disconnect a peer (without NetPermissionFlags::NoBan permission) if it is our only sync peer,
6099 : : // and we have others we could be using instead.
6100 : : // Note: If all our peers are inbound, then we won't
6101 : : // disconnect our sync peer for stalling; we have bigger
6102 : : // problems if we can't get any outbound peers.
6103 [ + + ]: 2 : if (!pto->HasPermission(NetPermissionFlags::NoBan)) {
6104 [ + - + - ]: 1 : LogInfo("Timeout downloading headers, %s\n", pto->DisconnectMsg(fLogIPs));
6105 : 1 : pto->fDisconnect = true;
6106 : 1 : return true;
6107 : : } else {
6108 [ + - + - ]: 1 : LogInfo("Timeout downloading headers from noban peer, not %s\n", pto->DisconnectMsg(fLogIPs));
6109 : : // Reset the headers sync state so that we have a
6110 : : // chance to try downloading from a different peer.
6111 : : // Note: this will also result in at least one more
6112 : : // getheaders message to be sent to
6113 : : // this peer (eventually).
6114 : 1 : state.fSyncStarted = false;
6115 : 1 : nSyncStarted--;
6116 : 1 : peer->m_headers_sync_timeout = 0us;
6117 : : }
6118 : : }
6119 : : } else {
6120 : : // After we've caught up once, reset the timeout so we can't trigger
6121 : : // disconnect later.
6122 : 1431 : peer->m_headers_sync_timeout = std::chrono::microseconds::max();
6123 : : }
6124 : : }
6125 : :
6126 : : // Check that outbound peers have reasonable chains
6127 : : // GetTime() is used by this anti-DoS logic so we can test this using mocktime
6128 [ + - ]: 431037 : ConsiderEviction(*pto, *peer, GetTime<std::chrono::seconds>());
6129 : :
6130 : : //
6131 : : // Message: getdata (blocks)
6132 : : //
6133 : 431037 : std::vector<CInv> vGetData;
6134 [ + + + + : 431037 : if (CanServeBlocks(*peer) && ((sync_blocks_and_headers_from_peer && !IsLimitedPeer(*peer)) || !m_chainman.IsInitialBlockDownload()) && state.vBlocksInFlight.size() < MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
+ + + - +
+ + + ]
6135 : 425653 : std::vector<const CBlockIndex*> vToDownload;
6136 : 425653 : NodeId staller = -1;
6137 : 427351 : auto get_inflight_budget = [&state]() {
6138 : 854702 : return std::max(0, MAX_BLOCKS_IN_TRANSIT_PER_PEER - static_cast<int>(state.vBlocksInFlight.size()));
6139 : 425653 : };
6140 : :
6141 : : // If there are multiple chainstates, download blocks for the
6142 : : // current chainstate first, to prioritize getting to network tip
6143 : : // before downloading historical blocks.
6144 [ - + + - ]: 425653 : FindNextBlocksToDownload(*peer, get_inflight_budget(), vToDownload, staller);
6145 [ + - ]: 425653 : auto historical_blocks{m_chainman.GetHistoricalBlockRange()};
6146 [ + + + - ]: 425653 : if (historical_blocks && !IsLimitedPeer(*peer)) {
6147 : : // If the first needed historical block is not an ancestor of the last,
6148 : : // we need to start requesting blocks from their last common ancestor.
6149 [ + - ]: 1698 : const CBlockIndex* from_tip = LastCommonAncestor(historical_blocks->first, historical_blocks->second);
6150 [ - + ]: 1698 : TryDownloadingHistoricalBlocks(
6151 [ + - ]: 1698 : *peer,
6152 [ + - ]: 1698 : get_inflight_budget(),
6153 [ - + ]: 1698 : vToDownload, from_tip, historical_blocks->second);
6154 : : }
6155 [ + + ]: 463917 : for (const CBlockIndex *pindex : vToDownload) {
6156 : 38264 : uint32_t nFetchFlags = GetFetchFlags(*peer);
6157 [ + - ]: 38264 : vGetData.emplace_back(MSG_BLOCK | nFetchFlags, pindex->GetBlockHash());
6158 [ + - ]: 38264 : BlockRequested(pto->GetId(), *pindex);
6159 [ + - + - : 76528 : LogDebug(BCLog::NET, "Requesting block %s (%d) peer=%d\n", pindex->GetBlockHash().ToString(),
+ - + - ]
6160 : : pindex->nHeight, pto->GetId());
6161 : : }
6162 [ + + + + ]: 425653 : if (state.vBlocksInFlight.empty() && staller != -1) {
6163 [ + + ]: 211 : if (State(staller)->m_stalling_since == 0us) {
6164 : 8 : State(staller)->m_stalling_since = current_time;
6165 [ + - + - : 8 : LogDebug(BCLog::NET, "Stall started peer=%d\n", staller);
+ - ]
6166 : : }
6167 : : }
6168 : 425653 : }
6169 : :
6170 : : //
6171 : : // Message: getdata (transactions)
6172 : : //
6173 : 431037 : {
6174 [ + - ]: 431037 : LOCK(m_tx_download_mutex);
6175 [ + - + + ]: 452909 : for (const GenTxid& gtxid : m_txdownloadman.GetRequestsToSend(pto->GetId(), current_time)) {
6176 [ + + - + : 43744 : vGetData.emplace_back(gtxid.IsWtxid() ? MSG_WTX : (MSG_TX | GetFetchFlags(*peer)), gtxid.ToUint256());
+ + - ]
6177 [ - + + + ]: 21872 : if (vGetData.size() >= MAX_GETDATA_SZ) {
6178 [ + - + - ]: 10 : MakeAndPushMessage(*pto, NetMsgType::GETDATA, vGetData);
6179 [ + - ]: 21882 : vGetData.clear();
6180 : : }
6181 [ + - ]: 431037 : }
6182 : 0 : }
6183 : :
6184 [ + + ]: 431037 : if (!vGetData.empty())
6185 [ + - + - ]: 84840 : MakeAndPushMessage(*pto, NetMsgType::GETDATA, vGetData);
6186 [ + - + - ]: 431051 : } // release cs_main
6187 [ + - ]: 431037 : MaybeSendFeefilter(*pto, *peer, current_time);
6188 : : return true;
6189 : 436572 : }
|
