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