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