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