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