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 : 6506 : 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 : 18339 : TxRelay* SetTxRelay() EXCLUSIVE_LOCKS_REQUIRED(!m_tx_relay_mutex)
328 : : {
329 : 18339 : LOCK(m_tx_relay_mutex);
330 [ - + ]: 18339 : Assume(!m_tx_relay);
331 [ + - ]: 18339 : m_tx_relay = std::make_unique<Peer::TxRelay>();
332 [ + - ]: 18339 : return m_tx_relay.get();
333 : 18339 : };
334 : :
335 : 2661229 : TxRelay* GetTxRelay() EXCLUSIVE_LOCKS_REQUIRED(!m_tx_relay_mutex)
336 : : {
337 [ + - + - ]: 2681338 : 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 : 30376 : explicit Peer(NodeId id, ServiceFlags our_services, bool is_inbound)
421 : 30376 : : m_id{id}
422 : 30376 : , m_our_services{our_services}
423 [ + - ]: 30376 : , m_is_inbound{is_inbound}
424 : 30376 : {}
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 : 30376 : 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 : 27400 : InvToSendBucket(unsigned int rate, double mult)
531 : 27400 : : count_floor{-1.0 * rate * count_seconds(INBOUND_INVENTORY_BROADCAST_INTERVAL)},
532 : 27400 : size_bucket(/*rate=*/SIZE_REFILL * mult, /*value=*/SIZE_INIT, /*cap=*/SIZE_CAP),
533 : 27400 : count_bucket(/*rate=*/rate * mult, /*value=*/rate * INBOUND_COUNT_SECONDS, /*cap=*/rate * INBOUND_COUNT_SECONDS)
534 : : {
535 : 27400 : }
536 : :
537 : 55982 : bool avail() const
538 : : {
539 [ + + + - : 55982 : return !backlog.empty() && size_bucket.value() > 0 && count_bucket.value() > 0;
- + ]
540 : : }
541 : :
542 : 55982 : void increment(NodeClock::time_point now)
543 : : {
544 : 55982 : size_bucket.increment(now);
545 : 55982 : count_bucket.increment(now);
546 : 55982 : }
547 : :
548 : : std::vector<Wtxid> TakeForProcessing(CTxMemPool& mempool) EXCLUSIVE_LOCKS_REQUIRED(mempool.cs);
549 : :
550 : 30096 : bool decrement(double size)
551 : : {
552 : 30096 : bool size_ok = size_bucket.decrement(size, /*floor=*/-50e3);
553 : 30096 : bool count_ok = count_bucket.decrement(1, /*floor=*/count_floor);
554 [ - + ]: 30096 : return size_ok && count_ok;
555 : : }
556 : :
557 : 6 : PeerManagerInfo::InvBucketInfo info() const
558 : : {
559 : 6 : return {
560 : 9 : .backlog_count = backlog.size(),
561 : 6 : .count_bucket = count_bucket.value(),
562 : 6 : .size_bucket = size_bucket.value(),
563 [ - + + - ]: 3 : };
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 : 650 : void SetBestBlock(int height, std::chrono::seconds time) override
611 : : {
612 : 650 : m_best_height = height;
613 : 650 : m_best_block_time = time;
614 : 650 : };
615 [ # # # # ]: 0 : 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 : 1761 : 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, Peer& peer, 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 [ + - ]: 6 : void PushMessage(CNode& node, CSerializedNetMsg&& msg) const { m_connman.PushMessage(&node, std::move(msg)); }
803 : : template <typename... Args>
804 : 227305 : void MakeAndPushMessage(CNode& node, std::string msg_type, Args&&... args) const
805 : : {
806 [ + - + - ]: 454610 : m_connman.PushMessage(&node, NetMsg::Make(std::move(msg_type), std::forward<Args>(args)...));
807 : 227305 : }
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 : 6387256 : const CNodeState* PeerManagerImpl::State(NodeId pnode) const
1201 : : {
1202 : 6387256 : std::map<NodeId, CNodeState>::const_iterator it = m_node_states.find(pnode);
1203 [ + - ]: 6387256 : if (it == m_node_states.end())
1204 : : return nullptr;
1205 : 6387256 : return &it->second;
1206 : : }
1207 : :
1208 : 6367147 : CNodeState* PeerManagerImpl::State(NodeId pnode)
1209 : : {
1210 : 6367147 : 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 : 3503 : static bool IsAddrCompatible(const Peer& peer, const CAddress& addr)
1219 : : {
1220 [ + + + + ]: 3503 : return peer.m_wants_addrv2 || addr.IsAddrV1Compatible();
1221 : : }
1222 : :
1223 : 445936 : void PeerManagerImpl::AddAddressKnown(Peer& peer, const CAddress& addr)
1224 : : {
1225 [ - + ]: 445936 : assert(peer.m_addr_known);
1226 [ - + + - ]: 445936 : peer.m_addr_known->insert(addr.GetKey());
1227 : 445936 : }
1228 : :
1229 : 4991 : 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 [ - + ]: 4991 : assert(peer.m_addr_known);
1235 : 9982 : if (addr.IsValid() && !peer.m_addr_known->contains(addr.GetKey()) && IsAddrCompatible(peer, addr)) {
[ + - - +
+ - + + +
- + + +
+ ]
1236 [ - + - + ]: 1985 : 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 : 1985 : peer.m_addrs_to_send.push_back(addr);
1240 : : }
1241 : : }
1242 : 4991 : }
1243 : :
1244 : 89291 : static void AddKnownTx(Peer& peer, const uint256& hash)
1245 : : {
1246 : 89291 : auto tx_relay = peer.GetTxRelay();
1247 [ + + ]: 89291 : if (!tx_relay) return;
1248 : :
1249 : 88106 : LOCK(tx_relay->m_tx_inventory_mutex);
1250 [ + - ]: 88106 : tx_relay->m_tx_inventory_known_filter.insert(hash);
1251 : 88106 : }
1252 : :
1253 : : /** Whether this peer can serve us blocks. */
1254 : 3003992 : static bool CanServeBlocks(const Peer& peer)
1255 : : {
1256 : 3003992 : 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 : 975111 : static bool IsLimitedPeer(const Peer& peer)
1262 : : {
1263 [ + + - + ]: 975111 : return (!(peer.m_their_services & NODE_NETWORK) &&
1264 [ - + ]: 704705 : (peer.m_their_services & NODE_NETWORK_LIMITED));
1265 : : }
1266 : :
1267 : : /** Whether this peer can serve us witness data */
1268 : 91053 : static bool CanServeWitnesses(const Peer& peer)
1269 : : {
1270 : 91053 : return peer.m_their_services & NODE_WITNESS;
1271 : : }
1272 : :
1273 : 8456 : std::chrono::microseconds PeerManagerImpl::NextInvToInbounds(std::chrono::microseconds now,
1274 : : std::chrono::seconds average_interval,
1275 : : uint64_t network_key)
1276 : : {
1277 [ + + ]: 8456 : auto [it, inserted] = m_next_inv_to_inbounds_per_network_key.try_emplace(network_key, 0us);
1278 [ + + ]: 8456 : auto& timer{it->second};
1279 [ + + ]: 8456 : if (timer < now) {
1280 : 7462 : timer = now + m_rng.rand_exp_duration(average_interval);
1281 : : }
1282 : 8456 : return timer;
1283 : : }
1284 : :
1285 : 115671 : bool PeerManagerImpl::IsBlockRequested(const uint256& hash)
1286 : : {
1287 : 115671 : return mapBlocksInFlight.contains(hash);
1288 : : }
1289 : :
1290 : 0 : bool PeerManagerImpl::IsBlockRequestedFromOutbound(const uint256& hash)
1291 : : {
1292 [ # # ]: 0 : for (auto range = mapBlocksInFlight.equal_range(hash); range.first != range.second; range.first++) {
1293 : 0 : auto [nodeid, block_it] = range.first->second;
1294 : 0 : PeerRef peer{GetPeerRef(nodeid)};
1295 [ # # # # : 0 : if (peer && !peer->m_is_inbound) return true;
# # ]
1296 : 0 : }
1297 : :
1298 : : return false;
1299 : : }
1300 : :
1301 : 22999 : void PeerManagerImpl::RemoveBlockRequest(const uint256& hash, std::optional<NodeId> from_peer)
1302 : : {
1303 : 22999 : auto range = mapBlocksInFlight.equal_range(hash);
1304 [ + + ]: 22999 : 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 [ - + ]: 763 : Assume(mapBlocksInFlight.count(hash) <= MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK);
1311 : :
1312 [ + + ]: 1526 : while (range.first != range.second) {
1313 [ + - ]: 763 : const auto& [node_id, list_it]{range.first->second};
1314 : :
1315 [ + - - + ]: 763 : if (from_peer && *from_peer != node_id) {
1316 : 0 : range.first++;
1317 : 0 : continue;
1318 : : }
1319 : :
1320 [ - + ]: 763 : CNodeState& state = *Assert(State(node_id));
1321 : :
1322 [ + + ]: 763 : if (state.vBlocksInFlight.begin() == list_it) {
1323 : : // First block on the queue was received, update the start download time for the next one
1324 : 576 : state.m_downloading_since = std::max(state.m_downloading_since, GetTime<std::chrono::microseconds>());
1325 : : }
1326 : 763 : state.vBlocksInFlight.erase(list_it);
1327 : :
1328 [ + + ]: 763 : if (state.vBlocksInFlight.empty()) {
1329 : : // Last validated block on the queue for this peer was received.
1330 : 246 : m_peers_downloading_from--;
1331 : : }
1332 : 763 : state.m_stalling_since = 0us;
1333 : :
1334 : 763 : range.first = mapBlocksInFlight.erase(range.first);
1335 : : }
1336 : : }
1337 : :
1338 : 8764 : bool PeerManagerImpl::BlockRequested(NodeId nodeid, const CBlockIndex& block, std::list<QueuedBlock>::iterator** pit)
1339 : : {
1340 : 8764 : const uint256& hash{block.GetBlockHash()};
1341 : :
1342 : 8764 : CNodeState *state = State(nodeid);
1343 [ - + ]: 8764 : assert(state != nullptr);
1344 : :
1345 [ - + ]: 8764 : Assume(mapBlocksInFlight.count(hash) <= MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK);
1346 : :
1347 : : // Short-circuit most stuff in case it is from the same node
1348 [ + + ]: 8764 : for (auto range = mapBlocksInFlight.equal_range(hash); range.first != range.second; range.first++) {
1349 [ + - ]: 5511 : if (range.first->second.first == nodeid) {
1350 [ + - ]: 5511 : if (pit) {
1351 : 5511 : *pit = &range.first->second.second;
1352 : : }
1353 : 5511 : return false;
1354 : : }
1355 : : }
1356 : :
1357 : : // Make sure it's not being fetched already from same peer.
1358 : 3253 : RemoveBlockRequest(hash, nodeid);
1359 : :
1360 : 3253 : std::list<QueuedBlock>::iterator it = state->vBlocksInFlight.insert(state->vBlocksInFlight.end(),
1361 : 5 : {&block, std::unique_ptr<PartiallyDownloadedBlock>(pit ? new PartiallyDownloadedBlock(&m_mempool) : nullptr)});
1362 [ + + ]: 3253 : if (state->vBlocksInFlight.size() == 1) {
1363 : : // We're starting a block download (batch) from this peer.
1364 : 1203 : state->m_downloading_since = GetTime<std::chrono::microseconds>();
1365 : 1203 : m_peers_downloading_from++;
1366 : : }
1367 : 3253 : auto itInFlight = mapBlocksInFlight.insert(std::make_pair(hash, std::make_pair(nodeid, it)));
1368 [ + + ]: 3253 : if (pit) {
1369 : 5 : *pit = &itInFlight->second.second;
1370 : : }
1371 : : return true;
1372 [ + + + - ]: 3258 : }
1373 : :
1374 : 49 : void PeerManagerImpl::MaybeSetPeerAsAnnouncingHeaderAndIDs(NodeId nodeid)
1375 : : {
1376 : 49 : 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 [ + - ]: 49 : if (m_opts.ignore_incoming_txs) return;
1382 : :
1383 : 49 : CNodeState* nodestate = State(nodeid);
1384 : 49 : PeerRef peer{GetPeerRef(nodeid)};
1385 [ + - + - ]: 49 : if (!nodestate || !nodestate->m_provides_cmpctblocks) {
1386 : : // Don't request compact blocks if the peer has not signalled support
1387 : : return;
1388 : : }
1389 : :
1390 : 49 : int num_outbound_hb_peers = 0;
1391 [ + + ]: 49 : for (std::list<NodeId>::iterator it = lNodesAnnouncingHeaderAndIDs.begin(); it != lNodesAnnouncingHeaderAndIDs.end(); it++) {
1392 [ + - ]: 2 : if (*it == nodeid) {
1393 : 2 : lNodesAnnouncingHeaderAndIDs.erase(it);
1394 [ + - ]: 2 : lNodesAnnouncingHeaderAndIDs.push_back(nodeid);
1395 : : return;
1396 : : }
1397 [ # # ]: 0 : PeerRef peer_ref{GetPeerRef(*it)};
1398 [ # # # # ]: 0 : if (peer_ref && !peer_ref->m_is_inbound) ++num_outbound_hb_peers;
1399 : 0 : }
1400 [ + - + + ]: 47 : 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 [ - + - - ]: 10 : if (lNodesAnnouncingHeaderAndIDs.size() >= 3 && num_outbound_hb_peers == 1) {
1404 [ # # ]: 0 : PeerRef remove_peer{GetPeerRef(lNodesAnnouncingHeaderAndIDs.front())};
1405 [ # # # # ]: 0 : 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 : 0 : std::swap(lNodesAnnouncingHeaderAndIDs.front(), *std::next(lNodesAnnouncingHeaderAndIDs.begin()));
1409 : : }
1410 : 0 : }
1411 : : }
1412 [ + - ]: 47 : const bool nodeid_was_appended{m_connman.ForNode(nodeid, [this](CNode* pfrom) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
1413 : 47 : AssertLockHeld(::cs_main);
1414 [ + - ]: 47 : MakeAndPushMessage(*pfrom, NetMsgType::SENDCMPCT, /*high_bandwidth=*/true, /*version=*/CMPCTBLOCKS_VERSION);
1415 : : // save BIP152 bandwidth state: we select peer to be high-bandwidth
1416 : 47 : pfrom->m_bip152_highbandwidth_to = true;
1417 : 47 : lNodesAnnouncingHeaderAndIDs.push_back(pfrom->GetId());
1418 : 47 : return true;
1419 : : })};
1420 [ + - - + ]: 47 : 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 [ # # ]: 0 : m_connman.ForNode(lNodesAnnouncingHeaderAndIDs.front(), [this](CNode* pnodeStop) {
1424 [ # # ]: 0 : MakeAndPushMessage(*pnodeStop, NetMsgType::SENDCMPCT, /*high_bandwidth=*/false, /*version=*/CMPCTBLOCKS_VERSION);
1425 : : // save BIP152 bandwidth state: we select peer to be low-bandwidth
1426 : 0 : pnodeStop->m_bip152_highbandwidth_to = false;
1427 : 0 : return true;
1428 : : });
1429 : 0 : lNodesAnnouncingHeaderAndIDs.pop_front();
1430 : : }
1431 : 49 : }
1432 : :
1433 : 0 : bool PeerManagerImpl::TipMayBeStale()
1434 : : {
1435 : 0 : AssertLockHeld(cs_main);
1436 : 0 : const Consensus::Params& consensusParams = m_chainparams.GetConsensus();
1437 [ # # ]: 0 : if (m_last_tip_update.load() == 0s) {
1438 : 0 : m_last_tip_update = GetTime<std::chrono::seconds>();
1439 : : }
1440 [ # # # # ]: 0 : return m_last_tip_update.load() < GetTime<std::chrono::seconds>() - std::chrono::seconds{consensusParams.nPowTargetSpacing * 3} && mapBlocksInFlight.empty();
1441 : : }
1442 : :
1443 : 4933 : int64_t PeerManagerImpl::ApproximateBestBlockDepth() const
1444 : : {
1445 : 4933 : return (GetTime<std::chrono::seconds>() - m_best_block_time.load()).count() / m_chainparams.GetConsensus().nPowTargetSpacing;
1446 : : }
1447 : :
1448 : 36819 : bool PeerManagerImpl::CanDirectFetch()
1449 : : {
1450 [ - + ]: 73638 : return m_chainman.ActiveChain().Tip()->Time() > NodeClock::now() - m_chainparams.GetConsensus().PowTargetSpacing() * 20;
1451 : : }
1452 : :
1453 : 2114 : static bool PeerHasHeader(CNodeState *state, const CBlockIndex *pindex) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
1454 : : {
1455 [ + + + + ]: 2114 : if (state->pindexBestKnownBlock && pindex == state->pindexBestKnownBlock->GetAncestor(pindex->nHeight))
1456 : : return true;
1457 [ + + + + ]: 901 : if (state->pindexBestHeaderSent && pindex == state->pindexBestHeaderSent->GetAncestor(pindex->nHeight))
1458 : 26 : return true;
1459 : : return false;
1460 : : }
1461 : :
1462 : 1773228 : void PeerManagerImpl::ProcessBlockAvailability(NodeId nodeid) {
1463 : 1773228 : CNodeState *state = State(nodeid);
1464 [ - + ]: 1773228 : assert(state != nullptr);
1465 : :
1466 [ + + ]: 3546456 : if (!state->hashLastUnknownBlock.IsNull()) {
1467 : 112718 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(state->hashLastUnknownBlock);
1468 [ + + + - ]: 112718 : if (pindex && pindex->nChainWork > 0) {
1469 [ + + + + ]: 15 : if (state->pindexBestKnownBlock == nullptr || pindex->nChainWork >= state->pindexBestKnownBlock->nChainWork) {
1470 : 14 : state->pindexBestKnownBlock = pindex;
1471 : : }
1472 : 15 : state->hashLastUnknownBlock.SetNull();
1473 : : }
1474 : : }
1475 : 1773228 : }
1476 : :
1477 : 93743 : void PeerManagerImpl::UpdateBlockAvailability(NodeId nodeid, const uint256 &hash) {
1478 : 93743 : CNodeState *state = State(nodeid);
1479 [ - + ]: 93743 : assert(state != nullptr);
1480 : :
1481 : 93743 : ProcessBlockAvailability(nodeid);
1482 : :
1483 : 93743 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hash);
1484 [ + + + - ]: 93743 : if (pindex && pindex->nChainWork > 0) {
1485 : : // An actually better block was announced.
1486 [ + + + + ]: 75322 : if (state->pindexBestKnownBlock == nullptr || pindex->nChainWork >= state->pindexBestKnownBlock->nChainWork) {
1487 : 63714 : state->pindexBestKnownBlock = pindex;
1488 : : }
1489 : : } else {
1490 : : // An unknown block was announced; just assume that the latest one is the best one.
1491 : 18421 : state->hashLastUnknownBlock = hash;
1492 : : }
1493 : 93743 : }
1494 : :
1495 : : // Logic for calculating which blocks to download from a given peer, given our current tip.
1496 : 275282 : void PeerManagerImpl::FindNextBlocksToDownload(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, NodeId& nodeStaller)
1497 : : {
1498 [ + - ]: 275282 : if (count == 0)
1499 : : return;
1500 : :
1501 [ - + ]: 275282 : vBlocks.reserve(vBlocks.size() + count);
1502 : 275282 : CNodeState *state = State(peer.m_id);
1503 [ - + ]: 275282 : assert(state != nullptr);
1504 : :
1505 : : // Make sure pindexBestKnownBlock is up to date, we'll need it.
1506 : 275282 : ProcessBlockAvailability(peer.m_id);
1507 : :
1508 [ + + - + : 368483 : 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 : 184207 : 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 : 91075 : const CBlockIndex* snap_base{m_chainman.CurrentChainstate().SnapshotBase()};
1518 [ - + - - : 91075 : if (snap_base && m_chainman.CurrentChainstate().m_assumeutxo == Assumeutxo::UNVALIDATED &&
- - ]
1519 : 0 : 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 : 91075 : auto fork_point = LastCommonAncestor(state->pindexBestKnownBlock, m_chainman.ActiveTip());
1529 [ + + ]: 90267 : if (state->pindexLastCommonBlock == nullptr ||
1530 [ + + ]: 91075 : fork_point->nChainWork > state->pindexLastCommonBlock->nChainWork ||
1531 [ + + ]: 89773 : state->pindexBestKnownBlock->GetAncestor(state->pindexLastCommonBlock->nHeight) != state->pindexLastCommonBlock) {
1532 : 1531 : state->pindexLastCommonBlock = fork_point;
1533 : : }
1534 [ + + ]: 91075 : if (state->pindexLastCommonBlock == state->pindexBestKnownBlock)
1535 : : return;
1536 : :
1537 : 73184 : 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 : 73184 : int nWindowEnd = state->pindexLastCommonBlock->nHeight + BLOCK_DOWNLOAD_WINDOW;
1542 : :
1543 : 73184 : FindNextBlocks(vBlocks, peer, state, pindexWalk, count, nWindowEnd, &m_chainman.ActiveChain(), &nodeStaller);
1544 : : }
1545 : :
1546 : 0 : void PeerManagerImpl::TryDownloadingHistoricalBlocks(const Peer& peer, unsigned int count, std::vector<const CBlockIndex*>& vBlocks, const CBlockIndex *from_tip, const CBlockIndex* target_block)
1547 : : {
1548 [ # # ]: 0 : Assert(from_tip);
1549 [ # # ]: 0 : Assert(target_block);
1550 : :
1551 [ # # # # ]: 0 : if (vBlocks.size() >= count) {
1552 : : return;
1553 : : }
1554 : :
1555 : 0 : vBlocks.reserve(count);
1556 [ # # ]: 0 : CNodeState *state = Assert(State(peer.m_id));
1557 : :
1558 [ # # # # ]: 0 : 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 : 0 : return;
1570 : : }
1571 : :
1572 [ # # ]: 0 : FindNextBlocks(vBlocks, peer, state, from_tip, count, std::min<int>(from_tip->nHeight + BLOCK_DOWNLOAD_WINDOW, target_block->nHeight));
1573 : : }
1574 : :
1575 : 73184 : 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 : 73184 : std::vector<const CBlockIndex*> vToFetch;
1578 [ + - ]: 73184 : int nMaxHeight = std::min<int>(state->pindexBestKnownBlock->nHeight, nWindowEnd + 1);
1579 : 73184 : bool is_limited_peer = IsLimitedPeer(peer);
1580 : 73184 : NodeId waitingfor = -1;
1581 [ + + ]: 215697 : 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 [ - + + - : 146368 : int nToFetch = std::min(nMaxHeight - pindexWalk->nHeight, std::max<int>(count - vBlocks.size(), 128));
- + ]
1586 [ + - ]: 73184 : vToFetch.resize(nToFetch);
1587 [ + - ]: 73184 : pindexWalk = state->pindexBestKnownBlock->GetAncestor(pindexWalk->nHeight + nToFetch);
1588 : 73184 : vToFetch[nToFetch - 1] = pindexWalk;
1589 [ + + ]: 74622 : for (unsigned int i = nToFetch - 1; i > 0; i--) {
1590 : 1438 : 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 [ + + ]: 143949 : for (const CBlockIndex* pindex : vToFetch) {
1598 [ + + + - ]: 77567 : if (!pindex->IsValid(BLOCK_VALID_TREE)) {
1599 : : // We consider the chain that this peer is on invalid.
1600 : : return;
1601 : : }
1602 : :
1603 [ + + - + ]: 73712 : 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 [ + + + - : 70776 : if (pindex->nStatus & BLOCK_HAVE_DATA || (activeChain && activeChain->Contains(*pindex))) {
- + ]
1609 [ + - - + ]: 350 : if (activeChain && pindex->HaveNumChainTxs()) {
1610 : 0 : state->pindexLastCommonBlock = pindex;
1611 : : }
1612 : 350 : continue;
1613 : : }
1614 : :
1615 : : // Is block in-flight?
1616 [ + + ]: 70426 : if (IsBlockRequested(pindex->GetBlockHash())) {
1617 [ + + ]: 69619 : if (waitingfor == -1) {
1618 : : // This is the first already-in-flight block.
1619 : 68604 : waitingfor = mapBlocksInFlight.lower_bound(pindex->GetBlockHash())->second.first;
1620 : : }
1621 : 69619 : continue;
1622 : : }
1623 : :
1624 : : // The block is not already downloaded, and not yet in flight.
1625 [ - + ]: 807 : if (pindex->nHeight > nWindowEnd) {
1626 : : // We reached the end of the window.
1627 [ # # # # : 0 : 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 [ # # ]: 0 : if (nodeStaller) *nodeStaller = waitingfor;
1630 : : }
1631 : 0 : return;
1632 : : }
1633 : :
1634 : : // Don't request blocks that go further than what limited peers can provide
1635 [ + + - + ]: 807 : 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 : 0 : continue;
1637 : : }
1638 : :
1639 [ + - ]: 807 : vBlocks.push_back(pindex);
1640 [ - + + + ]: 807 : if (vBlocks.size() == count) {
1641 : : return;
1642 : : }
1643 : : }
1644 : : }
1645 : 73184 : }
1646 : :
1647 : : } // namespace
1648 : :
1649 : 28329 : void PeerManagerImpl::PushNodeVersion(CNode& pnode, const Peer& peer)
1650 : : {
1651 : 28329 : uint64_t my_services;
1652 : 28329 : int64_t my_time;
1653 : 28329 : uint64_t your_services;
1654 : 28329 : CService your_addr;
1655 [ + + ]: 28329 : std::string my_user_agent;
1656 : 28329 : int my_height;
1657 : 28329 : bool my_tx_relay;
1658 [ + + ]: 28329 : if (pnode.IsPrivateBroadcastConn()) {
1659 : 1088 : my_services = NODE_NONE;
1660 : 1088 : my_time = 0;
1661 : 1088 : your_services = NODE_NONE;
1662 [ + - ]: 2176 : your_addr = CService{};
1663 [ + - ]: 1088 : 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 : 1088 : my_height = 0;
1665 : 1088 : my_tx_relay = false;
1666 : : } else {
1667 : 27241 : const CAddress& addr{pnode.addr};
1668 : 27241 : my_services = peer.m_our_services;
1669 : 27241 : my_time = TicksSinceEpoch<std::chrono::seconds>(NodeClock::now());
1670 : 27241 : your_services = addr.nServices;
1671 : 54482 : your_addr = addr.IsRoutable() && !IsProxy(addr) && addr.IsAddrV1Compatible() ? CService{addr} : CService{};
[ + - + +
+ - + - +
- + + +
- ]
1672 [ + - ]: 27241 : my_user_agent = strSubVersion;
1673 : 27241 : my_height = m_best_height;
1674 : 27241 : my_tx_relay = !RejectIncomingTxs(pnode);
1675 : : }
1676 : :
1677 [ + - + - ]: 56658 : MakeAndPushMessage(
1678 : : pnode,
1679 : 28329 : NetMsgType::VERSION,
1680 [ + - ]: 28329 : 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 : 28329 : your_services, CNetAddr::V1(your_addr),
1685 : : // same, for a dummy address
1686 [ + + ]: 28329 : my_services, CNetAddr::V1(CService{}),
1687 [ + - ]: 28329 : pnode.GetLocalNonce(),
1688 : : my_user_agent,
1689 : : my_height,
1690 : : my_tx_relay);
1691 : :
1692 : 28329 : 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 : 28329 : }
1698 : :
1699 : 0 : void PeerManagerImpl::UpdateLastBlockAnnounceTime(NodeId node, int64_t time_in_seconds)
1700 : : {
1701 : 0 : LOCK(cs_main);
1702 : 0 : CNodeState *state = State(node);
1703 [ # # ]: 0 : if (state) state->m_last_block_announcement = time_in_seconds;
1704 : 0 : }
1705 : :
1706 : 30376 : void PeerManagerImpl::InitializeNode(const CNode& node, ServiceFlags our_services)
1707 : : {
1708 : 30376 : NodeId nodeid = node.GetId();
1709 : 30376 : {
1710 : 30376 : LOCK(cs_main); // For m_node_states
1711 [ + - ]: 30376 : m_node_states.try_emplace(m_node_states.end(), nodeid);
1712 : 0 : }
1713 [ + - ]: 91128 : WITH_LOCK(m_tx_download_mutex, m_txdownloadman.CheckIsEmpty(nodeid));
1714 : :
1715 [ + + ]: 30376 : if (NetPermissions::HasFlag(node.m_permission_flags, NetPermissionFlags::BloomFilter)) {
1716 : 6933 : our_services = static_cast<ServiceFlags>(our_services | NODE_BLOOM);
1717 : : }
1718 : :
1719 : 30376 : PeerRef peer = std::make_shared<Peer>(nodeid, our_services, node.IsInboundConn());
1720 : 30376 : {
1721 [ + - ]: 30376 : LOCK(m_peer_mutex);
1722 [ + - + - ]: 30376 : m_peer_map.emplace_hint(m_peer_map.end(), nodeid, peer);
1723 [ + - ]: 30376 : }
1724 : 30376 : }
1725 : :
1726 : 0 : void PeerManagerImpl::ReattemptInitialBroadcast(CScheduler& scheduler)
1727 : : {
1728 : 0 : std::set<Txid> unbroadcast_txids = m_mempool.GetUnbroadcastTxs();
1729 : :
1730 [ # # ]: 0 : for (const auto& txid : unbroadcast_txids) {
1731 [ # # ]: 0 : CTransactionRef tx = m_mempool.get(txid);
1732 : :
1733 [ # # ]: 0 : if (tx != nullptr) {
1734 [ # # ]: 0 : InitiateTxBroadcastToAll(tx->GetWitnessHash());
1735 : : } else {
1736 [ # # ]: 0 : m_mempool.RemoveUnbroadcastTx(txid, true);
1737 : : }
1738 : 0 : }
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 : 0 : const auto delta = 10min + FastRandomContext().randrange<std::chrono::milliseconds>(5min);
1743 [ # # ]: 0 : scheduler.scheduleFromNow([&] { ReattemptInitialBroadcast(scheduler); }, delta);
1744 : 0 : }
1745 : :
1746 : 0 : 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 : 0 : size_t num_for_rebroadcast{0};
1751 : 0 : const auto stale_txs = m_tx_for_private_broadcast.GetStale();
1752 [ # # ]: 0 : if (!stale_txs.empty()) {
1753 [ # # ]: 0 : for (const auto& stale_tx : stale_txs) {
1754 : : // Only hold lock per single submission
1755 [ # # ]: 0 : LOCK(cs_main);
1756 [ # # ]: 0 : auto mempool_acceptable = m_chainman.ProcessTransaction(stale_tx, /*test_accept=*/true);
1757 [ # # ]: 0 : if (mempool_acceptable.m_result_type == MempoolAcceptResult::ResultType::VALID) {
1758 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST,
# # # # #
# ]
1759 : : "Reattempting broadcast of stale txid=%s wtxid=%s",
1760 : : stale_tx->GetHash().ToString(), stale_tx->GetWitnessHash().ToString());
1761 : 0 : ++num_for_rebroadcast;
1762 : : } else {
1763 : 0 : 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 [ # # ]: 0 : m_tx_for_private_broadcast.Remove(stale_tx);
1767 : : }
1768 [ # # ]: 0 : }
1769 : :
1770 : : // This could overshoot, but that is ok - we will open some private connections in vain.
1771 [ # # ]: 0 : m_connman.m_private_broadcast.NumToOpenAdd(num_for_rebroadcast);
1772 : : }
1773 : :
1774 : 0 : const auto delta{2min + FastRandomContext().randrange<std::chrono::milliseconds>(1min)};
1775 [ # # ]: 0 : scheduler.scheduleFromNow([&] { ReattemptPrivateBroadcast(scheduler); }, delta);
1776 : 0 : }
1777 : :
1778 : 30376 : void PeerManagerImpl::FinalizeNode(const CNode& node)
1779 : : {
1780 : 30376 : NodeId nodeid = node.GetId();
1781 : 30376 : {
1782 : 30376 : LOCK(cs_main);
1783 : 30376 : {
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 [ + - ]: 30376 : PeerRef peer = RemovePeer(nodeid);
1790 [ - + ]: 30376 : assert(peer != nullptr);
1791 [ - + ]: 30376 : m_wtxid_relay_peers -= peer->m_wtxid_relay;
1792 [ - + ]: 30376 : assert(m_wtxid_relay_peers >= 0);
1793 : 30376 : }
1794 : 30376 : CNodeState *state = State(nodeid);
1795 [ - + ]: 30376 : assert(state != nullptr);
1796 : :
1797 [ + + ]: 30376 : if (state->fSyncStarted)
1798 : 7598 : nSyncStarted--;
1799 : :
1800 [ + + ]: 32866 : for (const QueuedBlock& entry : state->vBlocksInFlight) {
1801 : 2490 : auto range = mapBlocksInFlight.equal_range(entry.pindex->GetBlockHash());
1802 [ + + ]: 4980 : while (range.first != range.second) {
1803 [ - + ]: 2490 : auto [node_id, list_it] = range.first->second;
1804 [ - + ]: 2490 : if (node_id != nodeid) {
1805 : 0 : range.first++;
1806 : : } else {
1807 : 2490 : range.first = mapBlocksInFlight.erase(range.first);
1808 : : }
1809 : : }
1810 : : }
1811 : 30376 : {
1812 [ + - ]: 30376 : LOCK(m_tx_download_mutex);
1813 [ + - ]: 30376 : m_txdownloadman.DisconnectedPeer(nodeid);
1814 : 0 : }
1815 [ + + + - ]: 30376 : if (m_txreconciliation) m_txreconciliation->ForgetPeer(nodeid);
1816 : 30376 : m_num_preferred_download_peers -= state->fPreferredDownload;
1817 [ - + ]: 30376 : m_peers_downloading_from -= (!state->vBlocksInFlight.empty());
1818 [ - + ]: 30376 : assert(m_peers_downloading_from >= 0);
1819 : 30376 : m_outbound_peers_with_protect_from_disconnect -= state->m_chain_sync.m_protect;
1820 [ - + ]: 30376 : assert(m_outbound_peers_with_protect_from_disconnect >= 0);
1821 : :
1822 : 30376 : m_node_states.erase(nodeid);
1823 : :
1824 [ + + ]: 30376 : if (m_node_states.empty()) {
1825 : : // Do a consistency check after the last peer is removed.
1826 [ - + ]: 14529 : assert(mapBlocksInFlight.empty());
1827 [ - + ]: 14529 : assert(m_num_preferred_download_peers == 0);
1828 [ - + ]: 14529 : assert(m_peers_downloading_from == 0);
1829 [ - + ]: 14529 : assert(m_outbound_peers_with_protect_from_disconnect == 0);
1830 [ - + ]: 14529 : assert(m_wtxid_relay_peers == 0);
1831 [ + - + - ]: 43587 : WITH_LOCK(m_tx_download_mutex, m_txdownloadman.CheckIsEmpty());
1832 : : }
1833 : 30376 : } // cs_main
1834 [ + + ]: 30376 : if (node.fSuccessfullyConnected &&
1835 [ + + + + : 30376 : !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 : 9044 : m_addrman.Connected(node.addr);
1841 : : }
1842 : 30376 : {
1843 : 30376 : LOCK(m_headers_presync_mutex);
1844 [ + - ]: 30376 : m_headers_presync_stats.erase(nodeid);
1845 : 30376 : }
1846 [ + + + - ]: 31508 : if (node.IsPrivateBroadcastConn() &&
1847 [ + + - + ]: 31508 : !m_tx_for_private_broadcast.DidNodeConfirmReception(nodeid) &&
1848 : 1132 : m_tx_for_private_broadcast.HavePendingTransactions()) {
1849 : :
1850 : 0 : m_connman.m_private_broadcast.NumToOpenAdd(1);
1851 : : }
1852 [ - + ]: 30376 : LogDebug(BCLog::NET, "Cleared nodestate for peer=%d\n", nodeid);
1853 : 30376 : }
1854 : :
1855 : 101980 : bool PeerManagerImpl::HasAllDesirableServiceFlags(ServiceFlags services) const
1856 : : {
1857 : : // Shortcut for (services & GetDesirableServiceFlags(services)) == GetDesirableServiceFlags(services)
1858 : 101980 : return !(GetDesirableServiceFlags(services) & (~services));
1859 : : }
1860 : :
1861 : 101980 : ServiceFlags PeerManagerImpl::GetDesirableServiceFlags(ServiceFlags services) const
1862 : : {
1863 [ + + ]: 101980 : if (services & NODE_NETWORK_LIMITED) {
1864 : : // Limited peers are desirable when we are close to the tip.
1865 [ - + ]: 4933 : if (ApproximateBestBlockDepth() < NODE_NETWORK_LIMITED_ALLOW_CONN_BLOCKS) {
1866 : 0 : return ServiceFlags(NODE_NETWORK_LIMITED | NODE_WITNESS);
1867 : : }
1868 : : }
1869 : : return ServiceFlags(NODE_NETWORK | NODE_WITNESS);
1870 : : }
1871 : :
1872 : 3170804 : PeerRef PeerManagerImpl::GetPeerRef(NodeId id) const
1873 : : {
1874 : 3170804 : LOCK(m_peer_mutex);
1875 : 3170804 : auto it = m_peer_map.find(id);
1876 [ + - + - : 6341608 : return it != m_peer_map.end() ? it->second : nullptr;
+ - ]
1877 : 3170804 : }
1878 : :
1879 : 30376 : PeerRef PeerManagerImpl::RemovePeer(NodeId id)
1880 : : {
1881 : 30376 : PeerRef ret;
1882 [ + - ]: 30376 : LOCK(m_peer_mutex);
1883 : 30376 : auto it = m_peer_map.find(id);
1884 [ + - ]: 30376 : if (it != m_peer_map.end()) {
1885 : 30376 : ret = std::move(it->second);
1886 : 30376 : m_peer_map.erase(it);
1887 : : }
1888 [ + - ]: 30376 : return ret;
1889 : 30376 : }
1890 : :
1891 : 15048 : std::vector<PeerRef> PeerManagerImpl::GetAllPeers() const
1892 : : {
1893 : 15048 : std::vector<PeerRef> peers;
1894 [ + - ]: 15048 : LOCK(m_peer_mutex);
1895 [ + - ]: 15048 : peers.reserve(m_peer_map.size());
1896 [ + - + + ]: 75240 : for (const auto& [_, peer] : m_peer_map) {
1897 [ + - ]: 60192 : peers.push_back(peer);
1898 : : }
1899 [ + - ]: 15048 : return peers;
1900 : 15048 : }
1901 : :
1902 : 20109 : bool PeerManagerImpl::GetNodeStateStats(NodeId nodeid, CNodeStateStats& stats) const
1903 : : {
1904 : 20109 : {
1905 : 20109 : LOCK(cs_main);
1906 : 20109 : const CNodeState* state = State(nodeid);
1907 [ - + ]: 20109 : if (state == nullptr)
1908 [ # # ]: 0 : return false;
1909 [ - + ]: 20109 : stats.nSyncHeight = state->pindexBestKnownBlock ? state->pindexBestKnownBlock->nHeight : -1;
1910 [ - + ]: 20109 : stats.nCommonHeight = state->pindexLastCommonBlock ? state->pindexLastCommonBlock->nHeight : -1;
1911 [ - + ]: 20109 : for (const QueuedBlock& queue : state->vBlocksInFlight) {
1912 [ # # ]: 0 : if (queue.pindex)
1913 [ # # ]: 0 : stats.vHeightInFlight.push_back(queue.pindex->nHeight);
1914 : : }
1915 : 0 : }
1916 : :
1917 : 20109 : PeerRef peer = GetPeerRef(nodeid);
1918 [ + - ]: 20109 : if (peer == nullptr) return false;
1919 [ - + ]: 20109 : 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 : 20109 : NodeClock::duration ping_wait{0us};
1927 [ - + - - ]: 20109 : if ((0 != peer->m_ping_nonce_sent) && (peer->m_ping_start.load() > NodeClock::epoch)) {
1928 : 0 : ping_wait = NodeClock::now() - peer->m_ping_start.load();
1929 : : }
1930 : :
1931 [ + - + + ]: 20109 : if (auto tx_relay = peer->GetTxRelay(); tx_relay != nullptr) {
1932 [ + - + - ]: 35002 : stats.m_relay_txs = WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs);
1933 [ + - ]: 17501 : stats.m_fee_filter_received = tx_relay->m_fee_filter_received.load();
1934 [ + - ]: 17501 : LOCK(tx_relay->m_tx_inventory_mutex);
1935 : 17501 : stats.m_last_inv_seq = tx_relay->m_last_inv_sequence;
1936 [ - + + - ]: 17501 : stats.m_inv_to_send = tx_relay->m_tx_inventory_to_send.size();
1937 : 17501 : } else {
1938 : 2608 : stats.m_relay_txs = false;
1939 : 2608 : stats.m_fee_filter_received = 0;
1940 : 2608 : stats.m_inv_to_send = 0;
1941 : : }
1942 : :
1943 : 20109 : stats.m_ping_wait = ping_wait;
1944 [ + - ]: 20109 : stats.m_addr_processed = peer->m_addr_processed.load();
1945 : 20109 : stats.m_addr_rate_limited = peer->m_addr_rate_limited.load();
1946 [ + - ]: 20109 : stats.m_addr_relay_enabled = peer->m_addr_relay_enabled.load();
1947 : 20109 : {
1948 [ + - ]: 20109 : LOCK(peer->m_headers_sync_mutex);
1949 [ - + ]: 20109 : if (peer->m_headers_sync) {
1950 : 0 : stats.presync_height = peer->m_headers_sync->GetPresyncHeight();
1951 : : }
1952 : 20109 : }
1953 : 20109 : stats.time_offset = peer->m_time_offset;
1954 : :
1955 : 20109 : return true;
1956 : 20109 : }
1957 : :
1958 : 11 : std::vector<node::TxOrphanage::OrphanInfo> PeerManagerImpl::GetOrphanTransactions()
1959 : : {
1960 : 11 : LOCK(m_tx_download_mutex);
1961 [ + - ]: 11 : return m_txdownloadman.GetOrphanTransactions();
1962 : 11 : }
1963 : :
1964 : 3 : PeerManagerInfo PeerManagerImpl::GetInfo() const
1965 : : {
1966 : 3 : LOCK(m_inv_to_send_mutex);
1967 : 3 : return PeerManagerInfo{
1968 : 3 : .median_outbound_time_offset = m_outbound_time_offsets.Median(),
1969 : 3 : .ignores_incoming_txs = m_opts.ignore_incoming_txs,
1970 : 3 : .private_broadcast = m_opts.private_broadcast,
1971 : 3 : .tx_send_rate = m_opts.tx_send_rate,
1972 : 6 : .inbound_bucket = m_inbound_inv_bucket.info(),
1973 [ - + + - ]: 3 : .outbound_bucket = m_outbound_inv_bucket.info(),
1974 [ + - - + ]: 3 : };
1975 : 3 : }
1976 : :
1977 : 0 : std::vector<PrivateBroadcast::TxBroadcastInfo> PeerManagerImpl::GetPrivateBroadcastInfo() const
1978 : : {
1979 : 0 : return m_tx_for_private_broadcast.GetBroadcastInfo();
1980 : : }
1981 : :
1982 : 0 : std::vector<CTransactionRef> PeerManagerImpl::AbortPrivateBroadcast(const uint256& id)
1983 : : {
1984 : 0 : const auto snapshot{m_tx_for_private_broadcast.GetBroadcastInfo()};
1985 : 0 : std::vector<CTransactionRef> removed_txs;
1986 : :
1987 : 0 : size_t connections_cancelled{0};
1988 [ # # ]: 0 : for (const auto& tx_info : snapshot) {
1989 : 0 : const CTransactionRef& tx{tx_info.tx};
1990 [ # # # # ]: 0 : if (tx->GetHash().ToUint256() != id && tx->GetWitnessHash().ToUint256() != id) continue;
1991 [ # # # # ]: 0 : if (const auto peer_acks{m_tx_for_private_broadcast.Remove(tx)}) {
1992 [ # # ]: 0 : removed_txs.push_back(tx);
1993 [ # # ]: 0 : if (NUM_PRIVATE_BROADCAST_PER_TX > *peer_acks) {
1994 : 0 : connections_cancelled += (NUM_PRIVATE_BROADCAST_PER_TX - *peer_acks);
1995 : : }
1996 : : }
1997 : : }
1998 [ # # ]: 0 : m_connman.m_private_broadcast.NumToOpenSub(connections_cancelled);
1999 : :
2000 : 0 : return removed_txs;
2001 : 0 : }
2002 : :
2003 : 9877 : void PeerManagerImpl::AddToCompactExtraTransactions(const CTransactionRef& tx)
2004 : : {
2005 [ + - ]: 9877 : if (m_opts.max_extra_txs == 0) return;
2006 [ - + + - ]: 9877 : if (vExtraTxnForCompact.size() < m_opts.max_extra_txs) {
2007 [ + + ]: 9877 : if (vExtraTxnForCompact.empty()) vExtraTxnForCompact.reserve(m_opts.max_extra_txs);
2008 : 9877 : vExtraTxnForCompact.emplace_back(tx->GetWitnessHash(), tx);
2009 : : } else {
2010 [ # # ]: 0 : vExtraTxnForCompact[vExtraTxnForCompactIt] = std::make_pair(tx->GetWitnessHash(), tx);
2011 : : }
2012 : 9877 : vExtraTxnForCompactIt = (vExtraTxnForCompactIt + 1) % m_opts.max_extra_txs;
2013 : : }
2014 : :
2015 : 48217 : void PeerManagerImpl::Misbehaving(Peer& peer, const std::string& message)
2016 : : {
2017 : 48217 : LOCK(peer.m_misbehavior_mutex);
2018 : :
2019 [ + + + - : 48217 : const std::string message_prefixed = message.empty() ? "" : (": " + message);
+ - ]
2020 : 48217 : peer.m_should_discourage = true;
2021 [ + - - + : 48217 : 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 : 48217 : );
2026 [ + - ]: 96434 : }
2027 : :
2028 : 75551 : void PeerManagerImpl::MaybePunishNodeForBlock(NodeId nodeid, const BlockValidationState& state,
2029 : : bool via_compact_block, const std::string& message)
2030 : : {
2031 : 75551 : PeerRef peer{GetPeerRef(nodeid)};
2032 [ + + + + : 75551 : 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 : 1044 : case BlockValidationResult::BLOCK_CONSENSUS:
2041 : 1044 : case BlockValidationResult::BLOCK_MUTATED:
2042 [ + + ]: 1044 : if (!via_compact_block) {
2043 [ + - + - ]: 995 : if (peer) Misbehaving(*peer, message);
2044 : 995 : return;
2045 : : }
2046 : : break;
2047 : 2418 : case BlockValidationResult::BLOCK_CACHED_INVALID:
2048 : 2418 : {
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 [ + - + + : 2418 : if (peer && !via_compact_block && !peer->m_is_inbound) {
+ + ]
2052 [ + - ]: 772 : if (peer) Misbehaving(*peer, message);
2053 : : return;
2054 : : }
2055 : : break;
2056 : : }
2057 : 43266 : case BlockValidationResult::BLOCK_INVALID_HEADER:
2058 : 43266 : case BlockValidationResult::BLOCK_INVALID_PREV:
2059 [ + - + - ]: 43266 : if (peer) Misbehaving(*peer, message);
2060 : : return;
2061 : : // Conflicting (but not necessarily invalid) data or different policy:
2062 : 46 : case BlockValidationResult::BLOCK_MISSING_PREV:
2063 [ + - + - ]: 46 : if (peer) Misbehaving(*peer, message);
2064 : : return;
2065 : : case BlockValidationResult::BLOCK_TIME_FUTURE:
2066 : : break;
2067 : : }
2068 [ + + ]: 30472 : if (message != "") {
2069 [ + - - + : 30472 : LogDebug(BCLog::NET, "peer=%d: %s\n", nodeid, message);
- - + - ]
2070 : : }
2071 : 75551 : }
2072 : :
2073 : 5362 : bool PeerManagerImpl::BlockRequestAllowed(const CBlockIndex& block_index)
2074 : : {
2075 : 5362 : AssertLockHeld(cs_main);
2076 [ - + ]: 5362 : if (m_chainman.ActiveChain().Contains(block_index)) return true;
2077 [ # # # # : 0 : return block_index.IsValid(BLOCK_VALID_SCRIPTS) && (m_chainman.m_best_header != nullptr) &&
# # ]
2078 [ # # # # : 0 : (m_chainman.m_best_header->GetBlockTime() - block_index.GetBlockTime() < STALE_RELAY_AGE_LIMIT) &&
# # ]
2079 : 0 : (GetBlockProofEquivalentTime(*m_chainman.m_best_header, block_index, *m_chainman.m_best_header, m_chainparams.GetConsensus()) < STALE_RELAY_AGE_LIMIT);
2080 : : }
2081 : :
2082 : 0 : util::Expected<void, std::string> PeerManagerImpl::FetchBlock(NodeId peer_id, const CBlockIndex& block_index)
2083 : : {
2084 [ # # ]: 0 : 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 : 0 : LOCK(cs_main);
2091 : :
2092 : : // Ensure this peer exists and hasn't been disconnected
2093 [ # # ]: 0 : PeerRef peer = GetPeerRef(peer_id);
2094 [ # # # # ]: 0 : if (peer == nullptr) return util::Unexpected{"Peer does not exist"};
2095 : :
2096 : : // Ignore pre-segwit peers
2097 [ # # # # ]: 0 : if (!CanServeWitnesses(*peer)) return util::Unexpected{"Pre-SegWit peer"};
2098 : :
2099 : : // Forget about all prior requests
2100 [ # # ]: 0 : RemoveBlockRequest(block_index.GetBlockHash(), std::nullopt);
2101 : :
2102 : : // Mark block as in-flight
2103 [ # # # # : 0 : if (!BlockRequested(peer_id, block_index)) return util::Unexpected{"Already requested from this peer"};
# # ]
2104 : :
2105 : : // Construct message to request the block
2106 : 0 : const uint256& hash{block_index.GetBlockHash()};
2107 [ # # # # ]: 0 : std::vector<CInv> invs{CInv(MSG_BLOCK | MSG_WITNESS_FLAG, hash)};
2108 : :
2109 : : // Send block request message to the peer
2110 [ # # ]: 0 : bool success = m_connman.ForNode(peer_id, [this, &invs](CNode* node) {
2111 [ # # ]: 0 : this->MakeAndPushMessage(*node, NetMsgType::GETDATA, invs);
2112 : 0 : return true;
2113 : : });
2114 : :
2115 [ # # # # ]: 0 : if (!success) return util::Unexpected{"Peer not fully connected"};
2116 : :
2117 [ # # # # : 0 : LogDebug(BCLog::NET, "Requesting block %s from peer=%d\n",
# # # # ]
2118 : : hash.ToString(), peer_id);
2119 : 0 : return {};
2120 [ # # ]: 0 : }
2121 : :
2122 : 13700 : 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 [ - + ]: 13700 : return std::make_unique<PeerManagerImpl>(connman, addrman, banman, chainman, pool, warnings, opts);
2127 : : }
2128 : :
2129 : 13700 : PeerManagerImpl::PeerManagerImpl(CConnman& connman, AddrMan& addrman,
2130 : : BanMan* banman, ChainstateManager& chainman,
2131 : 13700 : CTxMemPool& pool, node::Warnings& warnings, Options opts)
2132 : 13700 : : m_rng{opts.deterministic_rng},
2133 [ + - ]: 13700 : m_fee_filter_rounder{CFeeRate{DEFAULT_MIN_RELAY_TX_FEE}, m_rng},
2134 : 13700 : m_chainparams(chainman.GetParams()),
2135 : 13700 : m_connman(connman),
2136 : 13700 : m_addrman(addrman),
2137 : 13700 : m_banman(banman),
2138 : 13700 : m_chainman(chainman),
2139 : 13700 : m_mempool(pool),
2140 [ + - ]: 13700 : m_txdownloadman(node::TxDownloadOptions{pool, m_rng, opts.deterministic_rng}),
2141 [ + - ]: 13700 : m_warnings{warnings},
2142 : 13700 : m_opts{opts},
2143 : 13700 : m_inbound_inv_bucket(/*rate=*/m_opts.tx_send_rate, /*mult=*/1.0),
2144 [ + - + - : 27400 : 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 [ + + ]: 13700 : if (opts.reconcile_txs) {
2149 [ + - ]: 10849 : m_txreconciliation = std::make_unique<TxReconciliationTracker>(TXRECONCILIATION_VERSION);
2150 : : }
2151 [ - - - - ]: 13700 : }
2152 : :
2153 : 0 : 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 : 0 : static_assert(EXTRA_PEER_CHECK_INTERVAL < STALE_CHECK_INTERVAL, "peer eviction timer should be less than stale tip check timer");
2160 [ # # ]: 0 : 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 : 0 : const auto delta = 10min + FastRandomContext().randrange<std::chrono::milliseconds>(5min);
2164 [ # # ]: 0 : scheduler.scheduleFromNow([&] { ReattemptInitialBroadcast(scheduler); }, delta);
2165 : :
2166 [ # # ]: 0 : if (m_opts.private_broadcast) {
2167 [ # # ]: 0 : scheduler.scheduleFromNow([&] { ReattemptPrivateBroadcast(scheduler); }, 0min);
2168 : : }
2169 : 0 : }
2170 : :
2171 : 692 : 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 : 692 : AssertLockNotHeld(m_mempool.cs);
2176 : 692 : AssertLockNotHeld(m_tx_download_mutex);
2177 : :
2178 [ + + ]: 692 : if (!is_ibd) {
2179 : 658 : 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 [ + - ]: 658 : m_txdownloadman.ActiveTipChange();
2184 : 658 : }
2185 : 692 : }
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 : 650 : 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 : 650 : 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 [ - + ]: 650 : auto stalling_timeout = m_block_stalling_timeout.load();
2204 [ - + ]: 650 : Assume(stalling_timeout >= BLOCK_STALLING_TIMEOUT_DEFAULT);
2205 [ - + ]: 650 : if (stalling_timeout != BLOCK_STALLING_TIMEOUT_DEFAULT) {
2206 : 0 : const auto new_timeout = std::max(std::chrono::duration_cast<std::chrono::seconds>(stalling_timeout * 0.85), BLOCK_STALLING_TIMEOUT_DEFAULT);
2207 [ # # ]: 0 : if (m_block_stalling_timeout.compare_exchange_strong(stalling_timeout, new_timeout)) {
2208 [ # # ]: 0 : 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 [ + - + + ]: 650 : if (!role.historical && !m_chainman.IsInitialBlockDownload()) {
2216 : 644 : LOCK(m_tx_download_mutex);
2217 [ + - ]: 644 : m_txdownloadman.BlockConnected(pblock);
2218 : 644 : }
2219 : 650 : }
2220 : :
2221 : 0 : void PeerManagerImpl::BlockDisconnected(const std::shared_ptr<const CBlock> &block, const CBlockIndex* pindex)
2222 : : {
2223 : 0 : LOCK(m_tx_download_mutex);
2224 [ # # ]: 0 : m_txdownloadman.BlockDisconnected();
2225 : 0 : }
2226 : :
2227 : : /**
2228 : : * Maintain state about the best-seen block and fast-announce a compact block
2229 : : * to compatible peers.
2230 : : */
2231 : 97 : void PeerManagerImpl::NewPoWValidBlock(const CBlockIndex *pindex, const std::shared_ptr<const CBlock>& pblock)
2232 : : {
2233 [ + - ]: 97 : auto pcmpctblock = std::make_shared<const CBlockHeaderAndShortTxIDs>(*pblock, FastRandomContext().rand64());
2234 : :
2235 [ + - ]: 97 : LOCK(cs_main);
2236 : :
2237 [ + + ]: 97 : if (pindex->nHeight <= m_highest_fast_announce)
2238 : : return;
2239 : 96 : m_highest_fast_announce = pindex->nHeight;
2240 : :
2241 [ + - ]: 96 : if (!DeploymentActiveAt(*pindex, m_chainman, Consensus::DEPLOYMENT_SEGWIT)) return;
2242 : :
2243 [ + - ]: 96 : uint256 hashBlock(pblock->GetHash());
2244 : 96 : const std::shared_future<CSerializedNetMsg> lazy_ser{
2245 [ + - + - : 162 : std::async(std::launch::deferred, [&] { return NetMsg::Make(NetMsgType::CMPCTBLOCK, *pcmpctblock); })};
+ - ]
2246 : :
2247 : 96 : {
2248 [ + - ]: 96 : auto most_recent_block_txs = std::make_unique<std::map<GenTxid, CTransactionRef>>();
2249 [ + + ]: 241 : for (const auto& tx : pblock->vtx) {
2250 [ + - ]: 145 : most_recent_block_txs->emplace(tx->GetHash(), tx);
2251 [ + - ]: 145 : most_recent_block_txs->emplace(tx->GetWitnessHash(), tx);
2252 : : }
2253 : :
2254 [ + - ]: 96 : LOCK(m_most_recent_block_mutex);
2255 : 96 : m_most_recent_block_hash = hashBlock;
2256 : 96 : m_most_recent_block = pblock;
2257 : 96 : m_most_recent_compact_block = pcmpctblock;
2258 [ + - ]: 96 : m_most_recent_block_txs = std::move(most_recent_block_txs);
2259 : 96 : }
2260 : :
2261 [ + - + - : 192 : m_connman.ForEachNode([this, pindex, &lazy_ser, &hashBlock](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
+ - ]
2262 : 357 : AssertLockHeld(::cs_main);
2263 : :
2264 [ + + - + ]: 357 : if (pnode->GetCommonVersion() < INVALID_CB_NO_BAN_VERSION || pnode->fDisconnect)
2265 : 2 : return;
2266 : 355 : ProcessBlockAvailability(pnode->GetId());
2267 : 355 : 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 [ + + + + : 355 : if (state.m_requested_hb_cmpctblocks && !PeerHasHeader(&state, pindex) && PeerHasHeader(&state, pindex->pprev)) {
+ + ]
2271 : :
2272 [ - + - - ]: 38 : LogDebug(BCLog::NET, "%s sending header-and-ids %s to peer=%d\n", "PeerManager::NewPoWValidBlock",
2273 : : hashBlock.ToString(), pnode->GetId());
2274 : :
2275 : 38 : const CSerializedNetMsg& ser_cmpctblock{lazy_ser.get()};
2276 [ + - ]: 38 : PushMessage(*pnode, ser_cmpctblock.Copy());
2277 : 38 : state.pindexBestHeaderSent = pindex;
2278 : : }
2279 : : });
2280 [ + - + - : 290 : }
+ - ]
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 : 650 : void PeerManagerImpl::UpdatedBlockTip(const CBlockIndex *pindexNew, const CBlockIndex *pindexFork, bool fInitialDownload)
2287 : : {
2288 : 650 : SetBestBlock(pindexNew->nHeight, std::chrono::seconds{pindexNew->GetBlockTime()});
2289 : :
2290 : : // Don't relay inventory during initial block download.
2291 [ + + ]: 650 : if (fInitialDownload) return;
2292 : :
2293 : : // Find the hashes of all blocks that weren't previously in the best chain.
2294 : 644 : std::vector<uint256> vHashes;
2295 : 644 : const CBlockIndex *pindexToAnnounce = pindexNew;
2296 [ + + ]: 1288 : while (pindexToAnnounce != pindexFork) {
2297 [ + - ]: 644 : vHashes.push_back(pindexToAnnounce->GetBlockHash());
2298 : 644 : pindexToAnnounce = pindexToAnnounce->pprev;
2299 [ - + + - ]: 644 : 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 : 644 : {
2307 [ + - ]: 644 : LOCK(m_peer_mutex);
2308 [ + + ]: 3220 : for (auto& it : m_peer_map) {
2309 [ + - ]: 2576 : Peer& peer = *it.second;
2310 [ + - ]: 2576 : LOCK(peer.m_block_inv_mutex);
2311 [ + + ]: 5152 : for (const uint256& hash : vHashes | std::views::reverse) {
2312 [ + - ]: 2576 : peer.m_blocks_for_headers_relay.push_back(hash);
2313 : : }
2314 : 2576 : }
2315 : 0 : }
2316 : :
2317 [ + - ]: 644 : m_connman.WakeMessageHandler();
2318 : 644 : }
2319 : :
2320 : : /**
2321 : : * Handle invalid block rejection and consequent peer discouragement, maintain which
2322 : : * peers announce compact blocks.
2323 : : */
2324 : 2411 : void PeerManagerImpl::BlockChecked(const std::shared_ptr<const CBlock>& block, const BlockValidationState& state)
2325 : : {
2326 : 2411 : LOCK(cs_main);
2327 : :
2328 [ + - ]: 2411 : const uint256 hash(block->GetHash());
2329 : 2411 : 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 [ + + + - ]: 2411 : if (state.IsInvalid() &&
2334 [ + + + - : 4172 : it != mapBlockSource.end() &&
+ - ]
2335 : 1761 : State(it->second.first)) {
2336 [ + - + - ]: 1761 : 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 [ + + ]: 650 : else if (state.IsValid() &&
2345 [ + - + + ]: 735 : !m_chainman.IsInitialBlockDownload() &&
2346 [ + + ]: 85 : mapBlocksInFlight.count(hash) == mapBlocksInFlight.size()) {
2347 [ + - ]: 49 : if (it != mapBlockSource.end()) {
2348 [ + - ]: 49 : MaybeSetPeerAsAnnouncingHeaderAndIDs(it->second.first);
2349 : : }
2350 : : }
2351 [ + - ]: 2411 : if (it != mapBlockSource.end())
2352 : 2411 : mapBlockSource.erase(it);
2353 : 2411 : }
2354 : :
2355 : : //////////////////////////////////////////////////////////////////////////////
2356 : : //
2357 : : // Messages
2358 : : //
2359 : :
2360 : 6693 : bool PeerManagerImpl::AlreadyHaveBlock(const uint256& block_hash)
2361 : : {
2362 : 6693 : return m_chainman.m_blockman.LookupBlockIndex(block_hash) != nullptr;
2363 : : }
2364 : :
2365 : 2 : void PeerManagerImpl::SendPings()
2366 : : {
2367 : 2 : LOCK(m_peer_mutex);
2368 [ - + ]: 2 : for(auto& it : m_peer_map) it.second->m_ping_queued = true;
2369 : 2 : }
2370 : :
2371 : 30096 : std::vector<Wtxid> InvToSendBucket::TakeForProcessing(CTxMemPool& mempool)
2372 : : {
2373 : 30096 : AssertLockHeld(mempool.cs);
2374 : :
2375 [ + - ]: 30096 : size_t n_to_take = static_cast<size_t>(std::max<double>(count_bucket.value() - count_floor, 0));
2376 : :
2377 : 30096 : std::vector<Wtxid> best;
2378 : :
2379 [ + - ]: 30096 : auto itervec = mempool.ExtractBestByMiningScoreWithTopology(backlog, n_to_take);
2380 : 30096 : bool tokens_left = true;
2381 [ + + ]: 60192 : for (auto txiter : itervec) {
2382 [ + - ]: 30096 : auto& wtxid = txiter->GetTx().GetWitnessHash();
2383 [ + - ]: 30096 : if (tokens_left) {
2384 [ + - ]: 30096 : best.push_back(wtxid);
2385 [ + - - + ]: 30096 : if (!decrement(txiter->GetTx().ComputeTotalSize())) {
2386 : 0 : tokens_left = false;
2387 : : }
2388 : : } else {
2389 [ # # ]: 0 : backlog.push_back(wtxid);
2390 : : }
2391 : : }
2392 : :
2393 : : // if the backlog is now empty, consider shrinking it if it's oversized
2394 [ + - - + : 30096 : if (backlog.empty() && backlog.capacity() > INVENTORY_BUCKET_BACKLOG_CAPACITY) {
- + ]
2395 : 0 : std::vector<Wtxid> dummy;
2396 [ # # ]: 0 : dummy.reserve(INVENTORY_BUCKET_BACKLOG_CAPACITY);
2397 : 0 : dummy.swap(backlog);
2398 : 0 : }
2399 : :
2400 : 30096 : return best;
2401 : 30096 : }
2402 : :
2403 : 1418896 : 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 [ + + + + ]: 1418896 : if (!backlog_bumped && now <= m_next_inv_bucket_check.load()) return;
2408 : 27991 : m_next_inv_bucket_check = now + INVENTORY_BUCKET_CHECK_DELAY;
2409 : :
2410 : 27991 : LOCK(m_inv_to_send_mutex);
2411 : 27991 : m_inbound_inv_bucket.increment(now);
2412 : 27991 : m_outbound_inv_bucket.increment(now);
2413 : :
2414 : : // Regular heartbeat logging when there's a backlog
2415 [ + - ]: 27991 : if (!m_next_inv_bucket_heartbeat.has_value()) {
2416 [ - + + - : 27991 : if (m_inbound_inv_bucket.backlog.size() >= INVENTORY_BUCKET_BACKLOG_HEARTBEAT_MIN || m_outbound_inv_bucket.backlog.size() >= INVENTORY_BUCKET_BACKLOG_HEARTBEAT_MIN) {
- + - + ]
2417 : 0 : m_next_inv_bucket_heartbeat = now;
2418 : : }
2419 : : }
2420 [ - + - - ]: 27991 : if (m_next_inv_bucket_heartbeat.has_value() && now >= *m_next_inv_bucket_heartbeat) {
2421 [ # # # # : 0 : 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 [ # # # # ]: 0 : if (m_inbound_inv_bucket.backlog.empty() && m_outbound_inv_bucket.backlog.empty()) {
2429 [ # # ]: 0 : m_next_inv_bucket_heartbeat = std::nullopt;
2430 : : } else {
2431 [ # # ]: 0 : m_next_inv_bucket_heartbeat = now + INVENTORY_BUCKET_BACKLOG_HEARTBEAT;
2432 : : }
2433 : : }
2434 : :
2435 : : // Early exit to skip pointlessly touching mempool lock
2436 : 27991 : bool in_avail = m_inbound_inv_bucket.avail();
2437 : 27991 : bool out_avail = m_outbound_inv_bucket.avail();
2438 [ + + + - ]: 27991 : if (!in_avail && !out_avail) return;
2439 : :
2440 : 15048 : std::vector<Wtxid> for_inbound;
2441 : 15048 : std::vector<Wtxid> for_outbound;
2442 : :
2443 : 15048 : {
2444 [ + - ]: 15048 : LOCK(m_mempool.cs);
2445 [ + - + - ]: 30096 : if (in_avail) for_inbound = m_inbound_inv_bucket.TakeForProcessing(m_mempool);
2446 [ + - + - ]: 30096 : if (out_avail) for_outbound = m_outbound_inv_bucket.TakeForProcessing(m_mempool);
2447 : 0 : }
2448 : :
2449 [ - + - - ]: 15048 : if (!for_inbound.empty() || !for_outbound.empty()) {
2450 : 15048 : bool any_inbound_connected = false;
2451 : 15048 : bool any_outbound_connected = false;
2452 [ + - + + ]: 75240 : for (const PeerRef& peer_ref : GetAllPeers()) {
2453 [ - + ]: 60192 : if (!peer_ref) continue;
2454 [ + - ]: 60192 : Peer& peer{*peer_ref};
2455 [ + - ]: 60192 : auto tx_relay = peer.GetTxRelay();
2456 [ + + ]: 60192 : if (!tx_relay) continue;
2457 : :
2458 [ + - ]: 59951 : 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 [ + + + - ]: 59951 : if (tx_relay->m_next_inv_send_time == 0s) continue;
2465 [ + + ]: 45210 : if (peer.m_is_inbound) {
2466 : : any_inbound_connected = true;
2467 : : } else {
2468 : 30343 : any_outbound_connected = true;
2469 : : }
2470 [ + + + + ]: 90420 : for (auto& i : (peer.m_is_inbound ? for_inbound : for_outbound)) {
2471 [ + - ]: 45210 : tx_relay->m_tx_inventory_to_send.push_back(i);
2472 : : }
2473 : 74999 : }
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 [ + + - + ]: 15048 : if (!any_inbound_connected) m_inbound_inv_bucket.backlog.clear();
2479 [ + + - + ]: 15048 : if (!any_outbound_connected) m_outbound_inv_bucket.backlog.clear();
2480 : : }
2481 [ + - ]: 43039 : }
2482 : :
2483 : 15048 : void PeerManagerImpl::InitiateTxBroadcastToAll(const Wtxid& wtxid)
2484 : : {
2485 : 15048 : {
2486 : 15048 : LOCK(m_inv_to_send_mutex);
2487 [ + - ]: 15048 : m_inbound_inv_bucket.backlog.push_back(wtxid);
2488 [ + - ]: 15048 : m_outbound_inv_bucket.backlog.push_back(wtxid);
2489 : 15048 : }
2490 : 15048 : ProcessInvBacklog(NodeClock::now(), /*backlog_bumped=*/true);
2491 : 15048 : }
2492 : :
2493 : 0 : node::TransactionError PeerManagerImpl::InitiateTxBroadcastPrivate(const CTransactionRef& tx)
2494 : : {
2495 [ # # # # ]: 0 : const auto txstr{strprintf("txid=%s, wtxid=%s", tx->GetHash().ToString(), tx->GetWitnessHash().ToString())};
2496 [ # # # # : 0 : switch (m_tx_for_private_broadcast.Add(tx)) {
# # ]
2497 : 0 : case PrivateBroadcast::AddResult::Added:
2498 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Requesting %d new connections due to %s", NUM_PRIVATE_BROADCAST_PER_TX, txstr);
# # ]
2499 [ # # ]: 0 : m_connman.m_private_broadcast.NumToOpenAdd(NUM_PRIVATE_BROADCAST_PER_TX);
2500 : : return node::TransactionError::OK;
2501 : 0 : case PrivateBroadcast::AddResult::AlreadyPresent:
2502 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Ignoring unnecessary request to schedule an already scheduled transaction: %s", txstr);
# # ]
2503 : : return node::TransactionError::OK;
2504 : 0 : case PrivateBroadcast::AddResult::QueueFull:
2505 [ # # # # : 0 : 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 : 0 : }
2510 : :
2511 : 1128 : 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 [ - + - - ]: 1128 : 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 : 1128 : const uint64_t hash_addr{CServiceHash(0, 0)(addr)};
2527 : 1128 : const auto current_time{GetTime<std::chrono::seconds>()};
2528 : : // Adding address hash makes exact rotation time different per address, while preserving periodicity.
2529 : 1128 : const uint64_t time_addr{(static_cast<uint64_t>(count_seconds(current_time)) + hash_addr) / count_seconds(ROTATE_ADDR_RELAY_DEST_INTERVAL)};
2530 : 1128 : const CSipHasher hasher{m_connman.GetDeterministicRandomizer(RANDOMIZER_ID_ADDRESS_RELAY)
2531 : 1128 : .Write(hash_addr)
2532 : 1128 : .Write(time_addr)};
2533 : :
2534 : : // Relay reachable addresses to 2 peers. Unreachable addresses are relayed randomly to 1 or 2 peers.
2535 [ - + - - ]: 1128 : unsigned int nRelayNodes = (fReachable || (hasher.Finalize() & 1)) ? 2 : 1;
2536 : :
2537 : 1128 : std::array<std::pair<uint64_t, Peer*>, 2> best{{{0, nullptr}, {0, nullptr}}};
2538 [ - + ]: 1128 : assert(nRelayNodes <= best.size());
2539 : :
2540 : 1128 : LOCK(m_peer_mutex);
2541 : :
2542 [ + + + + ]: 4349 : for (auto& [id, peer] : m_peer_map) {
2543 [ + + + + : 3221 : if (peer->m_addr_relay_enabled && id != originator && IsAddrCompatible(*peer, addr)) {
+ - + - ]
2544 [ + - + - ]: 1517 : uint64_t hashKey = CSipHasher(hasher).Write(id).Finalize();
2545 [ + - ]: 1727 : for (unsigned int i = 0; i < nRelayNodes; i++) {
2546 [ + + ]: 1727 : if (hashKey > best[i].first) {
2547 : 1517 : std::copy(best.begin() + i, best.begin() + nRelayNodes - 1, best.begin() + i + 1);
2548 : 1517 : best[i] = std::make_pair(hashKey, peer.get());
2549 : 1517 : break;
2550 : : }
2551 : : }
2552 : : }
2553 : : };
2554 : :
2555 [ + + + + ]: 2645 : for (unsigned int i = 0; i < nRelayNodes && best[i].first != 0; i++) {
2556 [ + - ]: 1517 : PushAddress(*best[i].second, addr);
2557 : : }
2558 : 1128 : }
2559 : :
2560 : 21253 : 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 [ + + + + ]: 21253 : if (inv.IsMsgFilteredBlk() && !(peer.m_our_services & NODE_BLOOM)) {
2565 [ - + - - ]: 316 : LogDebug(BCLog::NET, "filtered block request received when NODE_BLOOM service disabled, %s", pfrom.DisconnectMsg());
2566 : 316 : pfrom.fDisconnect = true;
2567 : 316 : return;
2568 : : }
2569 : :
2570 : 20937 : std::shared_ptr<const CBlock> a_recent_block;
2571 : 20937 : std::shared_ptr<const CBlockHeaderAndShortTxIDs> a_recent_compact_block;
2572 : 20937 : {
2573 [ + - ]: 20937 : LOCK(m_most_recent_block_mutex);
2574 : 20937 : a_recent_block = m_most_recent_block;
2575 [ + - ]: 20937 : a_recent_compact_block = m_most_recent_compact_block;
2576 : 20937 : }
2577 : :
2578 : 20937 : bool need_activate_chain = false;
2579 : 20937 : {
2580 [ + - ]: 20937 : LOCK(cs_main);
2581 [ + - ]: 20937 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(inv.hash);
2582 [ + + ]: 20937 : if (pindex) {
2583 [ + - + + : 10534 : if (pindex->HaveNumChainTxs() && !pindex->IsValid(BLOCK_VALID_SCRIPTS) &&
+ - ]
2584 [ - + + - ]: 20937 : 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 [ + + ]: 20937 : if (need_activate_chain) {
2595 [ + - ]: 5034 : BlockValidationState state;
2596 [ + - - + : 5034 : if (!m_chainman.ActiveChainstate().ActivateBestChain(state, a_recent_block)) {
+ - - + -
+ ]
2597 [ # # # # : 0 : LogDebug(BCLog::NET, "failed to activate chain (%s)\n", state.ToString());
# # # # ]
2598 : : }
2599 : 5034 : }
2600 : :
2601 : 20937 : const CBlockIndex* pindex{nullptr};
2602 : 20937 : const CBlockIndex* tip{nullptr};
2603 : 20937 : bool can_direct_fetch{false};
2604 : 20937 : FlatFilePos block_pos{};
2605 : 20937 : {
2606 [ + - ]: 20937 : LOCK(cs_main);
2607 [ + - ]: 20937 : pindex = m_chainman.m_blockman.LookupBlockIndex(inv.hash);
2608 [ + + ]: 20937 : if (!pindex) {
2609 : : return;
2610 : : }
2611 [ + - - + ]: 5267 : if (!BlockRequestAllowed(*pindex)) {
2612 [ # # # # : 0 : LogDebug(BCLog::NET, "%s: ignoring request from peer=%i for old block that isn't in the main chain\n", __func__, pfrom.GetId());
# # ]
2613 : 0 : return;
2614 : : }
2615 : : // disconnect node in case we have reached the outbound limit for serving historical blocks
2616 [ + - ]: 5267 : if (m_connman.OutboundTargetReached(true) &&
2617 [ - + - - : 5267 : (((m_chainman.m_best_header != nullptr) && (m_chainman.m_best_header->GetBlockTime() - pindex->GetBlockTime() > HISTORICAL_BLOCK_AGE)) || inv.IsMsgFilteredBlk()) &&
- - - - ]
2618 [ # # ]: 0 : !pfrom.HasPermission(NetPermissionFlags::Download) // nodes with the download permission may exceed target
2619 : : ) {
2620 [ # # # # : 0 : LogDebug(BCLog::NET, "historical block serving limit reached, %s", pfrom.DisconnectMsg());
# # # # ]
2621 : 0 : pfrom.fDisconnect = true;
2622 : 0 : return;
2623 : : }
2624 [ + - - + ]: 5267 : tip = m_chainman.ActiveChain().Tip();
2625 : : // Avoid leaking prune-height by never sending blocks below the NODE_NETWORK_LIMITED threshold
2626 [ + + ]: 5267 : if (!pfrom.HasPermission(NetPermissionFlags::NoBan) && (
2627 [ + + + + : 3178 : (((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 [ # # # # : 0 : 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 : 0 : pfrom.fDisconnect = true;
2632 : 0 : return;
2633 : : }
2634 : : // Pruned nodes may have deleted the block, so check whether
2635 : : // it's available before trying to send.
2636 [ + - ]: 5267 : if (!(pindex->nStatus & BLOCK_HAVE_DATA)) {
2637 : : return;
2638 : : }
2639 [ + - ]: 5267 : can_direct_fetch = CanDirectFetch();
2640 [ + - ]: 5267 : block_pos = pindex->GetBlockPos();
2641 : 15670 : }
2642 : :
2643 : 5267 : std::shared_ptr<const CBlock> pblock;
2644 [ - + - - : 5267 : if (a_recent_block && a_recent_block->GetHash() == inv.hash) {
- - ]
2645 : 0 : pblock = a_recent_block;
2646 [ + + ]: 5267 : } 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 [ + - + - ]: 102 : if (const auto block_data{m_chainman.m_blockman.ReadRawBlock(block_pos)}) {
2650 [ - + + - : 204 : 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 : 102 : }
2660 : : // Don't set pblock as we've sent the block
2661 : : } else {
2662 : : // Send block from disk
2663 [ + - ]: 5165 : std::shared_ptr<CBlock> pblockRead = std::make_shared<CBlock>();
2664 [ + - - + ]: 5165 : 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 [ + - ]: 5165 : pblock = pblockRead;
2674 : 5165 : }
2675 [ + + ]: 5267 : if (pblock) {
2676 [ + + ]: 5165 : if (inv.IsMsgBlk()) {
2677 [ + - + - ]: 7536 : MakeAndPushMessage(pfrom, NetMsgType::BLOCK, TX_NO_WITNESS(*pblock));
2678 [ - + ]: 1397 : } else if (inv.IsMsgWitnessBlk()) {
2679 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::BLOCK, TX_WITH_WITNESS(*pblock));
2680 [ + + ]: 1397 : } else if (inv.IsMsgFilteredBlk()) {
2681 : 1139 : bool sendMerkleBlock = false;
2682 [ + - ]: 1139 : CMerkleBlock merkleBlock;
2683 [ + - + + ]: 1139 : if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
2684 [ + - ]: 1133 : LOCK(tx_relay->m_bloom_filter_mutex);
2685 [ + + ]: 1133 : if (tx_relay->m_bloom_filter) {
2686 : 1026 : sendMerkleBlock = true;
2687 [ + - ]: 1026 : merkleBlock = CMerkleBlock(*pblock, *tx_relay->m_bloom_filter);
2688 : : }
2689 : 0 : }
2690 [ + + ]: 1133 : if (sendMerkleBlock) {
2691 [ + - + - ]: 1026 : 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 [ + - + + ]: 1884 : for (const auto& [tx_idx, _] : merkleBlock.vMatchedTxn)
2699 [ + - + - ]: 1716 : MakeAndPushMessage(pfrom, NetMsgType::TX, TX_NO_WITNESS(*pblock->vtx[tx_idx]));
2700 : : }
2701 : : // else
2702 : : // no response
2703 [ + - ]: 1397 : } 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 [ + + + + ]: 258 : if (can_direct_fetch && pindex->nHeight >= tip->nHeight - MAX_CMPCTBLOCK_DEPTH) {
2709 [ - + - - : 91 : if (a_recent_compact_block && a_recent_compact_block->header.GetHash() == inv.hash) {
- - ]
2710 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::CMPCTBLOCK, *a_recent_compact_block);
2711 : : } else {
2712 [ + - ]: 91 : CBlockHeaderAndShortTxIDs cmpctblock{*pblock, m_rng.rand64()};
2713 [ + - + - ]: 182 : MakeAndPushMessage(pfrom, NetMsgType::CMPCTBLOCK, cmpctblock);
2714 : 91 : }
2715 : : } else {
2716 [ + - + - ]: 334 : MakeAndPushMessage(pfrom, NetMsgType::BLOCK, TX_WITH_WITNESS(*pblock));
2717 : : }
2718 : : }
2719 : : }
2720 : :
2721 : 5267 : {
2722 [ + - ]: 5267 : LOCK(peer.m_block_inv_mutex);
2723 : : // Trigger the peer node to send a getblocks request for the next batch of inventory
2724 [ - + ]: 5267 : 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 [ + + ]: 5267 : }
2734 [ - + - + : 20937 : }
- + ]
2735 : :
2736 : 76858 : 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 : 76858 : auto txinfo{std::visit(
2740 : 153716 : [&](const auto& id) {
2741 [ + - ]: 153716 : return m_mempool.info_for_relay(id, WITH_LOCK(tx_relay.m_tx_inventory_mutex, return tx_relay.m_last_inv_sequence));
2742 : : },
2743 : 76858 : gtxid)};
2744 [ - + ]: 76858 : if (txinfo.tx) {
2745 : 0 : return std::move(txinfo.tx);
2746 : : }
2747 : :
2748 : : // Or it might be from the most recent block
2749 : 76858 : {
2750 [ + - ]: 76858 : LOCK(m_most_recent_block_mutex);
2751 [ - + ]: 76858 : if (m_most_recent_block_txs != nullptr) {
2752 : 0 : auto it = m_most_recent_block_txs->find(gtxid);
2753 [ # # # # : 0 : if (it != m_most_recent_block_txs->end()) return it->second;
# # ]
2754 : : }
2755 : 0 : }
2756 : :
2757 : 76858 : return {};
2758 : 76858 : }
2759 : :
2760 : 1055142 : void PeerManagerImpl::ProcessGetData(CNode& pfrom, Peer& peer, const std::atomic<bool>& interruptMsgProc)
2761 : : {
2762 : 1055142 : AssertLockNotHeld(cs_main);
2763 : :
2764 : 1055142 : auto tx_relay = peer.GetTxRelay();
2765 : :
2766 : 1055142 : std::deque<CInv>::iterator it = peer.m_getdata_requests.begin();
2767 : 1055142 : 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 [ + + + + ]: 1135086 : while (it != peer.m_getdata_requests.end() && it->IsGenTxMsg()) {
2773 [ - + ]: 79944 : 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 [ + - ]: 79944 : if (pfrom.fPauseSend) break;
2777 : :
2778 : 79944 : const CInv &inv = *it++;
2779 : :
2780 [ + + ]: 79944 : 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 : 3086 : continue;
2784 : : }
2785 : :
2786 [ + - + - : 76858 : if (auto tx{FindTxForGetData(*tx_relay, ToGenTxid(inv))}) {
- + ]
2787 : : // WTX and WITNESS_TX imply we serialize with witness
2788 [ # # ]: 0 : const auto maybe_with_witness = (inv.IsMsgTx() ? TX_NO_WITNESS : TX_WITH_WITNESS);
2789 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::TX, maybe_with_witness(*tx));
2790 [ # # ]: 0 : m_mempool.RemoveUnbroadcastTx(tx->GetHash());
2791 : : } else {
2792 [ + - ]: 76858 : vNotFound.push_back(inv);
2793 : 76858 : }
2794 : : }
2795 : :
2796 : : // Only process one BLOCK item per call, since they're uncommon and can be
2797 : : // expensive to process.
2798 [ + + + - ]: 1055142 : if (it != peer.m_getdata_requests.end() && !pfrom.fPauseSend) {
2799 : 1054707 : const CInv &inv = *it++;
2800 [ + + ]: 1054707 : if (inv.IsGenBlkMsg()) {
2801 [ + - ]: 21253 : 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 : 1055142 : peer.m_getdata_requests.erase(peer.m_getdata_requests.begin(), it);
2811 : :
2812 [ + + ]: 1055142 : 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 [ + - + - ]: 49262 : MakeAndPushMessage(pfrom, NetMsgType::NOTFOUND, vNotFound);
2828 : : }
2829 : 1055142 : }
2830 : :
2831 : 10669 : uint32_t PeerManagerImpl::GetFetchFlags(const Peer& peer) const
2832 : : {
2833 : 10669 : uint32_t nFetchFlags = 0;
2834 [ + + ]: 10669 : if (CanServeWitnesses(peer)) {
2835 : 10407 : nFetchFlags |= MSG_WITNESS_FLAG;
2836 : : }
2837 : 10669 : return nFetchFlags;
2838 : : }
2839 : :
2840 : 46 : void PeerManagerImpl::SendBlockTransactions(CNode& pfrom, Peer& peer, const CBlock& block, const BlockTransactionsRequest& req)
2841 : : {
2842 : 46 : BlockTransactions resp(req);
2843 [ - + + + ]: 82 : for (size_t i = 0; i < req.indexes.size(); i++) {
2844 [ - + + + ]: 71 : if (req.indexes[i] >= block.vtx.size()) {
2845 [ + - + - ]: 35 : Misbehaving(peer, "getblocktxn with out-of-bounds tx indices");
2846 : 35 : return;
2847 : : }
2848 : 36 : resp.txn[i] = block.vtx[req.indexes[i]];
2849 : : }
2850 : :
2851 [ + - - + ]: 11 : if (util::log::ShouldDebugLog(BCLog::CMPCTBLOCK)) {
2852 : 0 : uint32_t tx_requested_size{0};
2853 [ # # # # ]: 0 : for (const auto& tx : resp.txn) tx_requested_size += tx->ComputeTotalSize();
2854 : 0 : LogDebug(BCLog::CMPCTBLOCK, "%s sent us a GETBLOCKTXN for block %s, sending a BLOCKTXN with %u txns. (%u bytes)", pfrom.LogPeer(), block.GetHash().ToString(), resp.txn.size(), tx_requested_size);
[ # # # #
# # # # #
# # # #
# ]
2855 : : }
2856 [ + - + - ]: 22 : MakeAndPushMessage(pfrom, NetMsgType::BLOCKTXN, resp);
2857 : 46 : }
2858 : :
2859 : 98810 : bool PeerManagerImpl::CheckHeadersPoW(const std::vector<CBlockHeader>& headers, Peer& peer)
2860 : : {
2861 : : // Do these headers have proof-of-work matching what's claimed?
2862 [ - + + + ]: 98810 : if (!HasValidProofOfWork(headers, m_chainparams.GetConsensus())) {
2863 [ + - ]: 824 : Misbehaving(peer, "header with invalid proof of work");
2864 : 824 : return false;
2865 : : }
2866 : :
2867 : : // Are these headers connected to each other?
2868 [ + + ]: 97986 : if (!CheckHeadersAreContinuous(headers)) {
2869 [ + - ]: 120 : Misbehaving(peer, "non-continuous headers sequence");
2870 : 120 : return false;
2871 : : }
2872 : : return true;
2873 : : }
2874 : :
2875 : 123678 : arith_uint256 PeerManagerImpl::GetAntiDoSWorkThreshold()
2876 : : {
2877 : 123678 : arith_uint256 near_chaintip_work = 0;
2878 : 123678 : LOCK(cs_main);
2879 [ + - - + : 247356 : if (m_chainman.ActiveChain().Tip() != nullptr) {
+ - ]
2880 [ + - - + ]: 123678 : 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 [ + - + - : 123678 : near_chaintip_work = tip->nChainWork - std::min<arith_uint256>(144*GetBlockProof(*tip), tip->nChainWork);
+ - ]
2884 : : }
2885 [ + - + - : 123678 : return std::max(near_chaintip_work, m_chainman.MinimumChainWork());
+ - ]
2886 : 123678 : }
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 : 13126 : void PeerManagerImpl::HandleUnconnectingHeaders(CNode& pfrom, Peer& peer,
2895 : : const std::vector<CBlockHeader>& headers)
2896 : : {
2897 : : // Try to fill in the missing headers.
2898 [ + - ]: 26252 : const CBlockIndex* best_header{WITH_LOCK(cs_main, return m_chainman.m_best_header)};
2899 [ + - + + ]: 13126 : if (MaybeSendGetHeaders(pfrom, GetLocator(best_header), peer)) {
2900 [ - + - - : 1341 : 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 [ + - + - ]: 39378 : WITH_LOCK(cs_main, UpdateBlockAvailability(pfrom.GetId(), headers.back().GetHash()));
2911 : 13126 : }
2912 : :
2913 : 97986 : bool PeerManagerImpl::CheckHeadersAreContinuous(const std::vector<CBlockHeader>& headers) const
2914 : : {
2915 : 97986 : uint256 hashLastBlock;
2916 [ + + ]: 391564 : for (const CBlockHeader& header : headers) {
2917 [ + + + + ]: 293698 : if (!hashLastBlock.IsNull() && header.hashPrevBlock != hashLastBlock) {
2918 : : return false;
2919 : : }
2920 : 293578 : hashLastBlock = header.GetHash();
2921 : : }
2922 : : return true;
2923 : : }
2924 : :
2925 : 98538 : bool PeerManagerImpl::IsContinuationOfLowWorkHeadersSync(Peer& peer, CNode& pfrom, std::vector<CBlockHeader>& headers)
2926 : : {
2927 [ + + ]: 98538 : if (peer.m_headers_sync) {
2928 [ - + ]: 6930 : 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 [ + + ]: 6930 : if (result.success) peer.m_last_getheaders_timestamp = {};
2931 [ + + ]: 6930 : if (result.request_more) {
2932 [ + - ]: 6361 : auto locator = peer.m_headers_sync->NextHeadersRequestLocator();
2933 : : // If we were instructed to ask for a locator, it should not be empty.
2934 [ - + ]: 6361 : Assume(!locator.vHave.empty());
2935 : : // We can only be instructed to request more if processing was successful.
2936 [ - + ]: 6361 : Assume(result.success);
2937 [ + - ]: 6361 : 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 [ + - ]: 6361 : bool sent_getheaders = MaybeSendGetHeaders(pfrom, locator, peer);
2941 [ - + ]: 6361 : Assume(sent_getheaders);
2942 [ + - - + : 6361 : LogDebug(BCLog::NET, "more getheaders (from %s) to peer=%d\n",
- - - - ]
2943 : : locator.vHave.front().ToString(), pfrom.GetId());
2944 : : }
2945 : 6361 : }
2946 : :
2947 [ + + ]: 6930 : if (peer.m_headers_sync->GetState() == HeadersSyncState::State::FINAL) {
2948 [ + - ]: 569 : 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 [ + - ]: 569 : LOCK(m_headers_presync_mutex);
2954 [ + - ]: 569 : m_headers_presync_stats.erase(pfrom.GetId());
2955 : 569 : } else {
2956 : : // Build statistics for this peer's sync.
2957 : 6361 : HeadersPresyncStats stats;
2958 [ + - ]: 6361 : stats.first = peer.m_headers_sync->GetPresyncWork();
2959 [ + - ]: 6361 : if (peer.m_headers_sync->GetState() == HeadersSyncState::State::PRESYNC) {
2960 : 6361 : stats.second = {peer.m_headers_sync->GetPresyncHeight(),
2961 : 6361 : peer.m_headers_sync->GetPresyncTime()};
2962 : : }
2963 : :
2964 : : // Update statistics in stats.
2965 [ + - ]: 6361 : LOCK(m_headers_presync_mutex);
2966 [ + - ]: 6361 : m_headers_presync_stats[pfrom.GetId()] = stats;
2967 : 6361 : auto best_it = m_headers_presync_stats.find(m_headers_presync_bestpeer);
2968 : 6361 : bool best_updated = false;
2969 [ + + ]: 6361 : 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 : 312 : NodeId peer_best{-1};
2973 : 312 : const HeadersPresyncStats* stat_best{nullptr};
2974 [ - + + + ]: 624 : for (const auto& [peer, stat] : m_headers_presync_stats) {
2975 [ - + - - : 312 : if (!stat_best || stat > *stat_best) {
- - ]
2976 : 312 : peer_best = peer;
2977 : 312 : stat_best = &stat;
2978 : : }
2979 : : }
2980 : 312 : m_headers_presync_bestpeer = peer_best;
2981 [ + - ]: 312 : best_updated = (peer_best == pfrom.GetId());
2982 [ - + - - : 6049 : } 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 : 6049 : m_headers_presync_bestpeer = pfrom.GetId();
2985 : 6049 : best_updated = true;
2986 : : }
2987 [ + - + - ]: 6361 : if (best_updated && stats.second.has_value()) {
2988 : : // If the best peer updated, and it is in its first phase, signal.
2989 : 6361 : m_headers_presync_should_signal = true;
2990 : : }
2991 : 6361 : }
2992 : :
2993 [ + + ]: 6930 : if (result.success) {
2994 : : // We only overwrite the headers passed in if processing was
2995 : : // successful.
2996 : 6361 : headers.swap(result.pow_validated_headers);
2997 : : }
2998 : :
2999 : 6930 : return result.success;
3000 : 6930 : }
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 : 44644 : 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 [ - + ]: 44644 : 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 : 44644 : 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 [ + + ]: 44644 : 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 [ - + + + ]: 940 : 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 : 672 : LOCK(peer.m_headers_sync_mutex);
3033 [ + - - + ]: 672 : peer.m_headers_sync.reset(new HeadersSyncState(peer.m_id, m_chainparams.GetConsensus(),
3034 [ + - + - ]: 672 : 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 [ + - ]: 672 : (void)IsContinuationOfLowWorkHeadersSync(peer, pfrom, headers);
3040 : 672 : } else {
3041 [ - + - - ]: 268 : 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 : 940 : headers = {};
3047 : 940 : return true;
3048 : : }
3049 : :
3050 : : return false;
3051 : : }
3052 : :
3053 : 78691 : bool PeerManagerImpl::IsAncestorOfBestHeaderOrTip(const CBlockIndex* header)
3054 : : {
3055 [ + + ]: 78691 : if (header == nullptr) {
3056 : : return false;
3057 [ + - + + ]: 28926 : } else if (m_chainman.m_best_header != nullptr && header == m_chainman.m_best_header->GetAncestor(header->nHeight)) {
3058 : : return true;
3059 [ + + ]: 10840 : } else if (m_chainman.ActiveChain().Contains(*header)) {
3060 : 706 : return true;
3061 : : }
3062 : : return false;
3063 : : }
3064 : :
3065 : 31709 : bool PeerManagerImpl::MaybeSendGetHeaders(CNode& pfrom, const CBlockLocator& locator, Peer& peer)
3066 : : {
3067 : 31709 : 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 [ + + ]: 31709 : if (current_time - peer.m_last_getheaders_timestamp > HEADERS_RESPONSE_TIME) {
3072 [ + - ]: 15746 : MakeAndPushMessage(pfrom, NetMsgType::GETHEADERS, locator, uint256());
3073 : 15746 : peer.m_last_getheaders_timestamp = current_time;
3074 : 15746 : 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 : 31546 : void PeerManagerImpl::HeadersDirectFetchBlocks(CNode& pfrom, const Peer& peer, const CBlockIndex& last_header)
3085 : : {
3086 : 31546 : LOCK(cs_main);
3087 : 31546 : CNodeState *nodestate = State(pfrom.GetId());
3088 : :
3089 : 109313 : if (CanDirectFetch() && last_header.IsValid(BLOCK_VALID_TREE) && m_chainman.ActiveChain().Tip()->nChainWork <= last_header.nChainWork) {
[ + - + +
+ - + - -
+ + - + +
+ - ]
3090 : 25687 : std::vector<const CBlockIndex*> vToFetch;
3091 : 25687 : const CBlockIndex* pindexWalk{&last_header};
3092 : : // Calculate all the blocks we'd need to switch to last_header, up to a limit.
3093 [ + - + - : 69895 : while (pindexWalk && !m_chainman.ActiveChain().Contains(*pindexWalk) && vToFetch.size() <= MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
+ + - + ]
3094 [ + + ]: 21884 : if (!(pindexWalk->nStatus & BLOCK_HAVE_DATA) &&
3095 [ + - + + ]: 28776 : !IsBlockRequested(pindexWalk->GetBlockHash()) &&
3096 [ + + ]: 13344 : (!DeploymentActiveAt(*pindexWalk, m_chainman, Consensus::DEPLOYMENT_SEGWIT) || CanServeWitnesses(peer))) {
3097 : : // We don't have this block, and it's not yet in flight.
3098 [ + - ]: 2878 : vToFetch.push_back(pindexWalk);
3099 : : }
3100 : 22104 : 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 [ + - - + : 25687 : if (!m_chainman.ActiveChain().Contains(*Assert(pindexWalk))) {
- + ]
3108 [ # # # # : 0 : 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 : 25687 : std::vector<CInv> vGetData;
3113 : : // Download as much as possible, from earliest to latest.
3114 [ + + ]: 28128 : for (const CBlockIndex* pindex : vToFetch | std::views::reverse) {
3115 [ + + ]: 2869 : if (nodestate->vBlocksInFlight.size() >= MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
3116 : : // Can't download any more from this peer
3117 : : break;
3118 : : }
3119 : 2441 : uint32_t nFetchFlags = GetFetchFlags(peer);
3120 [ + - ]: 2441 : vGetData.emplace_back(MSG_BLOCK | nFetchFlags, pindex->GetBlockHash());
3121 [ + - ]: 2441 : BlockRequested(pfrom.GetId(), *pindex);
3122 [ + - - + : 2441 : LogDebug(BCLog::NET, "Requesting block %s from peer=%d",
- - - - ]
3123 : : pindex->GetBlockHash().ToString(), pfrom.GetId());
3124 : : }
3125 [ - + + + ]: 25687 : if (vGetData.size() > 1) {
3126 [ + - - + : 4 : LogDebug(BCLog::NET, "Downloading blocks toward %s (%d) via headers direct fetch\n",
- - - - ]
3127 : : last_header.GetBlockHash().ToString(),
3128 : : last_header.nHeight);
3129 : : }
3130 [ - + + + ]: 25687 : if (vGetData.size() > 0) {
3131 : 4874 : if (!m_opts.ignore_incoming_txs &&
3132 [ + + ]: 2437 : nodestate->m_provides_cmpctblocks &&
3133 [ + + + + ]: 1710 : vGetData.size() == 1 &&
3134 [ + - + + ]: 4143 : mapBlocksInFlight.size() == 1 &&
3135 [ + - + + ]: 71 : last_header.pprev->IsValid(BLOCK_VALID_CHAIN)) {
3136 : : // In any case, we want to download using a compact block, not a regular one
3137 [ + - ]: 70 : vGetData[0] = CInv(MSG_CMPCT_BLOCK, vGetData[0].hash);
3138 : : }
3139 [ + - + - ]: 4874 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vGetData);
3140 : : }
3141 : 25687 : }
3142 : 25687 : }
3143 : 31546 : }
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 : 31546 : void PeerManagerImpl::UpdatePeerStateForReceivedHeaders(CNode& pfrom, Peer& peer,
3151 : : const CBlockIndex& last_header, bool received_new_header, bool may_have_more_headers)
3152 : : {
3153 : 31546 : LOCK(cs_main);
3154 : 31546 : CNodeState *nodestate = State(pfrom.GetId());
3155 : :
3156 [ + - ]: 31546 : 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 [ + + + - : 35836 : if (received_new_header && last_header.nChainWork > m_chainman.ActiveChain().Tip()->nChainWork) {
- + + - +
+ ]
3163 [ + - ]: 3007 : 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 [ + + + - ]: 31546 : 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 [ + - + - : 16787 : 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 [ # # ]: 0 : 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 [ + - + + : 31546 : if (!pfrom.fDisconnect && pfrom.IsFullOutboundConn() && nodestate->pindexBestKnownBlock != nullptr) {
+ - ]
3193 : 1864 : 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 [ + - - + : 67 : LogDebug(BCLog::NET, "Protecting outbound peer=%d from eviction\n", pfrom.GetId());
- - ]
3195 : 67 : nodestate->m_chain_sync.m_protect = true;
3196 : 67 : ++m_outbound_peers_with_protect_from_disconnect;
3197 : : }
3198 : : }
3199 : 31546 : }
3200 : :
3201 : 98997 : void PeerManagerImpl::ProcessHeadersMessage(CNode& pfrom, Peer& peer,
3202 : : std::vector<CBlockHeader>&& headers,
3203 : : bool via_compact_block)
3204 : : {
3205 [ - + ]: 98997 : size_t nCount = headers.size();
3206 : :
3207 [ + + ]: 98997 : 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 : 187 : LOCK(peer.m_headers_sync_mutex);
3213 [ - + ]: 187 : 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 : 187 : peer.m_last_getheaders_timestamp = {};
3221 [ + - ]: 187 : return;
3222 : 187 : }
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 [ + + ]: 98810 : 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 : 97866 : 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 : 97866 : bool already_validated_work = false;
3244 : :
3245 : : // If we're in the middle of headers sync, let it do its magic.
3246 : 97866 : bool have_headers_sync = false;
3247 : 97866 : {
3248 : 97866 : LOCK(peer.m_headers_sync_mutex);
3249 : :
3250 [ + - ]: 97866 : 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 [ + + ]: 97866 : if (headers.empty()) {
3263 [ + - ]: 6049 : return;
3264 : : }
3265 : :
3266 [ + - ]: 91817 : have_headers_sync = !!peer.m_headers_sync;
3267 : 6049 : }
3268 : :
3269 : : // Do these headers connect to something in our block index?
3270 [ + - + - ]: 275451 : const CBlockIndex *chain_start_header{WITH_LOCK(::cs_main, return m_chainman.m_blockman.LookupBlockIndex(headers[0].hashPrevBlock))};
3271 : 91817 : bool headers_connect_blockindex{chain_start_header != nullptr};
3272 : :
3273 [ + + ]: 91817 : 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 : 13126 : HandleUnconnectingHeaders(pfrom, peer, headers);
3278 : 13126 : 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 : 78691 : 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 : 78691 : const CBlockIndex *last_received_header{nullptr};
3291 : 78691 : {
3292 : 78691 : LOCK(cs_main);
3293 [ + - + - ]: 78691 : last_received_header = m_chainman.m_blockman.LookupBlockIndex(headers.back().GetHash());
3294 [ + - + - : 97483 : 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 [ + + ]: 78691 : 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 [ + + + + ]: 62051 : 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 [ - + ]: 940 : Assume(headers.empty());
3312 : 940 : 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 : 77751 : bool received_new_header{last_received_header == nullptr};
3321 : :
3322 : : // Now process all the headers.
3323 [ - + ]: 77751 : BlockValidationState state;
3324 [ - + + - ]: 77751 : const bool processed{m_chainman.ProcessNewBlockHeaders(headers,
3325 : : /*min_pow_checked=*/true,
3326 : : state, &pindexLast)};
3327 [ + + ]: 77751 : if (!processed) {
3328 [ + - ]: 46205 : if (state.IsInvalid()) {
3329 [ + + + + ]: 46205 : 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 [ - + + - ]: 1544 : 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 [ + - + - ]: 46205 : MaybePunishNodeForBlock(pfrom.GetId(), state, via_compact_block, "invalid header received");
3337 : 46205 : return;
3338 : : }
3339 : : }
3340 [ - + ]: 31546 : assert(pindexLast);
3341 : :
3342 [ + + ]: 31546 : if (processed && received_new_header) {
3343 [ + - ]: 4290 : LogBlockHeader(*pindexLast, pfrom, /*via_compact_block=*/false);
3344 : : }
3345 : :
3346 : : // Consider fetching more headers if we are not using our headers-sync mechanism.
3347 [ - + - - ]: 31546 : if (nCount == m_opts.max_headers_result && !have_headers_sync) {
3348 : : // Headers message had its maximum size; the peer may have more headers.
3349 [ # # # # : 0 : if (MaybeSendGetHeaders(pfrom, GetLocator(pindexLast), peer)) {
# # ]
3350 [ # # # # : 0 : LogDebug(BCLog::NET, "more getheaders (%d) to end to peer=%d", pindexLast->nHeight, pfrom.GetId());
# # ]
3351 : : }
3352 : : }
3353 : :
3354 [ + - ]: 31546 : UpdatePeerStateForReceivedHeaders(pfrom, peer, *pindexLast, received_new_header, nCount == m_opts.max_headers_result);
3355 : :
3356 : : // Consider immediately downloading blocks.
3357 [ + - ]: 31546 : HeadersDirectFetchBlocks(pfrom, peer, *pindexLast);
3358 : :
3359 : : return;
3360 : 77751 : }
3361 : :
3362 : 10090 : std::optional<node::PackageToValidate> PeerManagerImpl::ProcessInvalidTx(NodeId nodeid, const CTransactionRef& ptx, const TxValidationState& state,
3363 : : bool first_time_failure)
3364 : : {
3365 : 10090 : AssertLockNotHeld(m_peer_mutex);
3366 : 10090 : AssertLockHeld(g_msgproc_mutex);
3367 : 10090 : AssertLockHeld(m_tx_download_mutex);
3368 : :
3369 : 10090 : PeerRef peer{GetPeerRef(nodeid)};
3370 : :
3371 : 10090 : 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 [ + - ]: 10090 : const auto& [add_extra_compact_tx, unique_parents, package_to_validate] = m_txdownloadman.MempoolRejectedTx(ptx, state, nodeid, first_time_failure);
3378 : :
3379 [ + + + - ]: 10090 : if (add_extra_compact_tx && RecursiveDynamicUsage(*ptx) < 100000) {
3380 [ + - ]: 9877 : AddToCompactExtraTransactions(ptx);
3381 : : }
3382 [ + + ]: 14955 : for (const Txid& parent_txid : unique_parents) {
3383 [ + - + - ]: 4865 : if (peer) AddKnownTx(*peer, parent_txid.ToUint256());
3384 : : }
3385 : :
3386 [ + - ]: 10090 : return package_to_validate;
3387 [ + - ]: 20180 : }
3388 : :
3389 : 5026 : void PeerManagerImpl::ProcessValidTx(NodeId nodeid, const CTransactionRef& tx, const std::list<CTransactionRef>& replaced_transactions)
3390 : : {
3391 : 5026 : AssertLockNotHeld(m_peer_mutex);
3392 : 5026 : AssertLockHeld(g_msgproc_mutex);
3393 : 5026 : AssertLockHeld(m_tx_download_mutex);
3394 : :
3395 : 5026 : m_txdownloadman.MempoolAcceptedTx(tx);
3396 : :
3397 [ - + - - : 5026 : 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 : 5026 : InitiateTxBroadcastToAll(tx->GetWitnessHash());
3404 : :
3405 [ - + ]: 5026 : for (const CTransactionRef& removedTx : replaced_transactions) {
3406 : 0 : AddToCompactExtraTransactions(removedTx);
3407 : : }
3408 : 5026 : }
3409 : :
3410 : 83 : void PeerManagerImpl::ProcessPackageResult(const node::PackageToValidate& package_to_validate, const PackageMempoolAcceptResult& package_result)
3411 : : {
3412 : 83 : AssertLockNotHeld(m_peer_mutex);
3413 : 83 : AssertLockHeld(g_msgproc_mutex);
3414 : 83 : AssertLockHeld(m_tx_download_mutex);
3415 : :
3416 : 83 : const auto& package = package_to_validate.m_txns;
3417 : 83 : const auto& senders = package_to_validate.m_senders;
3418 : :
3419 [ + + ]: 83 : if (package_result.m_state.IsInvalid()) {
3420 : 78 : m_txdownloadman.MempoolRejectedPackage(package);
3421 : : }
3422 : : // We currently only expect to process 1-parent-1-child packages. Remove if this changes.
3423 [ - + + - ]: 83 : 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 : 83 : auto package_iter = package.rbegin();
3428 : 83 : auto senders_iter = senders.rbegin();
3429 [ + + ]: 249 : while (package_iter != package.rend()) {
3430 : 166 : const auto& tx = *package_iter;
3431 : 166 : const NodeId nodeid = *senders_iter;
3432 : 166 : 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 [ + - ]: 166 : if (it_result != package_result.m_tx_results.end()) {
3436 [ + + - - ]: 166 : const auto& tx_result = it_result->second;
3437 [ + + - - ]: 166 : switch (tx_result.m_result_type) {
3438 : 10 : case MempoolAcceptResult::ResultType::VALID:
3439 : 10 : {
3440 : 10 : ProcessValidTx(nodeid, tx, tx_result.m_replaced_transactions);
3441 : 10 : break;
3442 : : }
3443 : 156 : case MempoolAcceptResult::ResultType::INVALID:
3444 : 156 : case MempoolAcceptResult::ResultType::DIFFERENT_WITNESS:
3445 : 156 : {
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 [ - + ]: 156 : ProcessInvalidTx(nodeid, tx, tx_result.m_state, /*first_time_failure=*/false);
3451 : 156 : 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 : 166 : package_iter++;
3462 : 166 : 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 : 1517487 : bool PeerManagerImpl::ProcessOrphanTx(Peer& peer)
3469 : : {
3470 : 1517487 : AssertLockHeld(g_msgproc_mutex);
3471 [ + - ]: 1517487 : LOCK2(::cs_main, m_tx_download_mutex);
3472 : :
3473 : 1517487 : CTransactionRef porphanTx = nullptr;
3474 : :
3475 [ + - + + : 1517497 : while (CTransactionRef porphanTx = m_txdownloadman.GetTxToReconsider(peer.m_id)) {
+ - ]
3476 [ + - ]: 140 : const MempoolAcceptResult result = m_chainman.ProcessTransaction(porphanTx);
3477 : 140 : const TxValidationState& state = result.m_state;
3478 [ + + ]: 140 : const Txid& orphanHash = porphanTx->GetHash();
3479 [ + + ]: 140 : const Wtxid& orphan_wtxid = porphanTx->GetWitnessHash();
3480 : :
3481 [ + + ]: 140 : if (result.m_result_type == MempoolAcceptResult::ResultType::VALID) {
3482 [ + - - + : 78 : LogDebug(BCLog::TXPACKAGES, " accepted orphan tx %s (wtxid=%s)\n", orphanHash.ToString(), orphan_wtxid.ToString());
- - - - -
- ]
3483 [ + - ]: 78 : ProcessValidTx(peer.m_id, porphanTx, result.m_replaced_transactions);
3484 : : return true;
3485 [ + + ]: 62 : } else if (state.GetResult() != TxValidationResult::TX_MISSING_INPUTS) {
3486 : 57 : LogDebug(BCLog::TXPACKAGES, " invalid orphan tx %s (wtxid=%s) from peer=%d. %s\n",
[ + - - +
- - - - -
- - - ]
3487 : : orphanHash.ToString(),
3488 : : orphan_wtxid.ToString(),
3489 : : peer.m_id,
3490 : : state.ToString());
3491 : :
3492 [ + - + - : 57 : if (Assume(state.IsInvalid() &&
+ - - + +
- ]
3493 : : state.GetResult() != TxValidationResult::TX_UNKNOWN &&
3494 : : state.GetResult() != TxValidationResult::TX_NO_MEMPOOL &&
3495 : : state.GetResult() != TxValidationResult::TX_RESULT_UNSET)) {
3496 [ + - ]: 114 : ProcessInvalidTx(peer.m_id, porphanTx, state, /*first_time_failure=*/false);
3497 : : }
3498 : 57 : return true;
3499 : : }
3500 [ + - ]: 280 : }
3501 : :
3502 : 1517352 : return false;
3503 [ + - + - : 4552461 : }
- - ]
3504 : :
3505 : 72 : bool PeerManagerImpl::PrepareBlockFilterRequest(CNode& node, Peer& peer,
3506 : : BlockFilterType filter_type, uint32_t start_height,
3507 : : const uint256& stop_hash, uint32_t max_height_diff,
3508 : : const CBlockIndex*& stop_index,
3509 : : BlockFilterIndex*& filter_index)
3510 : : {
3511 : 144 : const bool supported_filter_type =
3512 [ + + ]: 72 : (filter_type == BlockFilterType::BASIC &&
3513 [ + + ]: 51 : (peer.m_our_services & NODE_COMPACT_FILTERS));
3514 : 72 : if (!supported_filter_type) {
3515 [ - + - - ]: 45 : LogDebug(BCLog::NET, "peer requested unsupported block filter type: %d, %s",
3516 : : static_cast<uint8_t>(filter_type), node.DisconnectMsg());
3517 : 45 : node.fDisconnect = true;
3518 : 45 : return false;
3519 : : }
3520 : :
3521 : 27 : {
3522 : 27 : LOCK(cs_main);
3523 [ + - ]: 27 : stop_index = m_chainman.m_blockman.LookupBlockIndex(stop_hash);
3524 : :
3525 : : // Check that the stop block exists and the peer would be allowed to fetch it.
3526 [ + + + - : 27 : if (!stop_index || !BlockRequestAllowed(*stop_index)) {
+ - ]
3527 [ + - - + : 25 : LogDebug(BCLog::NET, "peer requested invalid block hash: %s, %s",
- - - - -
- ]
3528 : : stop_hash.ToString(), node.DisconnectMsg());
3529 [ + - ]: 25 : node.fDisconnect = true;
3530 [ + - ]: 25 : return false;
3531 : : }
3532 : 25 : }
3533 : :
3534 : 2 : uint32_t stop_height = stop_index->nHeight;
3535 [ + + ]: 2 : if (start_height > stop_height) {
3536 [ - + - - ]: 1 : LogDebug(BCLog::NET, "peer sent invalid getcfilters/getcfheaders with "
3537 : : "start height %d and stop height %d, %s",
3538 : : start_height, stop_height, node.DisconnectMsg());
3539 : 1 : node.fDisconnect = true;
3540 : 1 : return false;
3541 : : }
3542 [ - + ]: 1 : if (stop_height - start_height >= max_height_diff) {
3543 [ # # # # ]: 0 : LogDebug(BCLog::NET, "peer requested too many cfilters/cfheaders: %d / %d, %s",
3544 : : stop_height - start_height + 1, max_height_diff, node.DisconnectMsg());
3545 : 0 : node.fDisconnect = true;
3546 : 0 : return false;
3547 : : }
3548 : :
3549 : 1 : filter_index = GetBlockFilterIndex(filter_type);
3550 [ + - ]: 1 : if (!filter_index) {
3551 [ - + ]: 1 : LogDebug(BCLog::NET, "Filter index for supported type %s not found\n", BlockFilterTypeName(filter_type));
3552 : 1 : return false;
3553 : : }
3554 : :
3555 : : return true;
3556 : : }
3557 : :
3558 : 103 : void PeerManagerImpl::ProcessGetCFilters(CNode& node, Peer& peer, DataStream& vRecv)
3559 : : {
3560 : 103 : uint8_t filter_type_ser;
3561 : 103 : uint32_t start_height;
3562 : 103 : uint256 stop_hash;
3563 : :
3564 : 103 : vRecv >> filter_type_ser >> start_height >> stop_hash;
3565 : :
3566 : 36 : const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
3567 : :
3568 : 36 : const CBlockIndex* stop_index;
3569 : 36 : BlockFilterIndex* filter_index;
3570 [ - + ]: 36 : if (!PrepareBlockFilterRequest(node, peer, filter_type, start_height, stop_hash,
3571 : : MAX_GETCFILTERS_SIZE, stop_index, filter_index)) {
3572 : : return;
3573 : : }
3574 : :
3575 : 0 : std::vector<BlockFilter> filters;
3576 [ # # # # ]: 0 : if (!filter_index->LookupFilterRange(start_height, stop_index, filters)) {
3577 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter in index: filter_type=%s, start_height=%d, stop_hash=%s\n",
# # # # #
# ]
3578 : : BlockFilterTypeName(filter_type), start_height, stop_hash.ToString());
3579 : 0 : return;
3580 : : }
3581 : :
3582 [ # # ]: 0 : for (const auto& filter : filters) {
3583 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::CFILTER, filter);
3584 : : }
3585 : 0 : }
3586 : :
3587 : 106 : void PeerManagerImpl::ProcessGetCFHeaders(CNode& node, Peer& peer, DataStream& vRecv)
3588 : : {
3589 : 106 : uint8_t filter_type_ser;
3590 : 106 : uint32_t start_height;
3591 : 106 : uint256 stop_hash;
3592 : :
3593 : 106 : vRecv >> filter_type_ser >> start_height >> stop_hash;
3594 : :
3595 : 23 : const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
3596 : :
3597 : 23 : const CBlockIndex* stop_index;
3598 : 23 : BlockFilterIndex* filter_index;
3599 [ - + ]: 23 : if (!PrepareBlockFilterRequest(node, peer, filter_type, start_height, stop_hash,
3600 : : MAX_GETCFHEADERS_SIZE, stop_index, filter_index)) {
3601 : : return;
3602 : : }
3603 : :
3604 : 0 : uint256 prev_header;
3605 [ # # ]: 0 : if (start_height > 0) {
3606 : 0 : const CBlockIndex* const prev_block =
3607 : 0 : stop_index->GetAncestor(static_cast<int>(start_height - 1));
3608 [ # # ]: 0 : if (!filter_index->LookupFilterHeader(prev_block, prev_header)) {
3609 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter header in index: filter_type=%s, block_hash=%s\n",
# # ]
3610 : : BlockFilterTypeName(filter_type), prev_block->GetBlockHash().ToString());
3611 : 0 : return;
3612 : : }
3613 : : }
3614 : :
3615 : 0 : std::vector<uint256> filter_hashes;
3616 [ # # # # ]: 0 : if (!filter_index->LookupFilterHashRange(start_height, stop_index, filter_hashes)) {
3617 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter hashes in index: filter_type=%s, start_height=%d, stop_hash=%s\n",
# # # # #
# ]
3618 : : BlockFilterTypeName(filter_type), start_height, stop_hash.ToString());
3619 : 0 : return;
3620 : : }
3621 : :
3622 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::CFHEADERS,
3623 : : filter_type_ser,
3624 : 0 : stop_index->GetBlockHash(),
3625 : : prev_header,
3626 : : filter_hashes);
3627 : 0 : }
3628 : :
3629 : 87 : void PeerManagerImpl::ProcessGetCFCheckPt(CNode& node, Peer& peer, DataStream& vRecv)
3630 : : {
3631 : 87 : uint8_t filter_type_ser;
3632 : 87 : uint256 stop_hash;
3633 : :
3634 : 87 : vRecv >> filter_type_ser >> stop_hash;
3635 : :
3636 : 13 : const BlockFilterType filter_type = static_cast<BlockFilterType>(filter_type_ser);
3637 : :
3638 : 13 : const CBlockIndex* stop_index;
3639 : 13 : BlockFilterIndex* filter_index;
3640 [ - + ]: 13 : if (!PrepareBlockFilterRequest(node, peer, filter_type, /*start_height=*/0, stop_hash,
3641 : : /*max_height_diff=*/std::numeric_limits<uint32_t>::max(),
3642 : : stop_index, filter_index)) {
3643 : : return;
3644 : : }
3645 : :
3646 : 0 : std::vector<uint256> headers(stop_index->nHeight / CFCHECKPT_INTERVAL);
3647 : :
3648 : : // Populate headers.
3649 : 0 : const CBlockIndex* block_index = stop_index;
3650 [ # # # # ]: 0 : for (int i = headers.size() - 1; i >= 0; i--) {
3651 : 0 : int height = (i + 1) * CFCHECKPT_INTERVAL;
3652 [ # # ]: 0 : block_index = block_index->GetAncestor(height);
3653 : :
3654 [ # # # # ]: 0 : if (!filter_index->LookupFilterHeader(block_index, headers[i])) {
3655 [ # # # # : 0 : LogDebug(BCLog::NET, "Failed to find block filter header in index: filter_type=%s, block_hash=%s\n",
# # # # #
# ]
3656 : : BlockFilterTypeName(filter_type), block_index->GetBlockHash().ToString());
3657 : 0 : return;
3658 : : }
3659 : : }
3660 : :
3661 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::CFCHECKPT,
3662 : : filter_type_ser,
3663 : 0 : stop_index->GetBlockHash(),
3664 : : headers);
3665 : 0 : }
3666 : :
3667 : 18787 : void PeerManagerImpl::ProcessBlock(CNode& node, const std::shared_ptr<const CBlock>& block, bool force_processing, bool min_pow_checked)
3668 : : {
3669 : 18787 : bool new_block{false};
3670 : 18787 : m_chainman.ProcessNewBlock(block, force_processing, min_pow_checked, &new_block);
3671 [ + + ]: 18787 : if (new_block) {
3672 : 714 : node.m_last_block_time = GetTime<std::chrono::seconds>();
3673 : : // In case this block came from a different peer than we requested
3674 : : // from, we can erase the block request now anyway (as we just stored
3675 : : // this block to disk).
3676 : 714 : LOCK(cs_main);
3677 [ + - + - ]: 714 : RemoveBlockRequest(block->GetHash(), std::nullopt);
3678 : 714 : } else {
3679 : 18073 : LOCK(cs_main);
3680 [ + - + - ]: 36146 : mapBlockSource.erase(block->GetHash());
3681 : 18073 : }
3682 : 18787 : }
3683 : :
3684 : 5018 : void PeerManagerImpl::ProcessCompactBlockTxns(CNode& pfrom, Peer& peer, const BlockTransactions& block_transactions)
3685 : : {
3686 : 5018 : std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
3687 : 5018 : bool fBlockRead{false};
3688 : 5018 : {
3689 [ + - ]: 5018 : LOCK(cs_main);
3690 : :
3691 : 5018 : auto range_flight = mapBlocksInFlight.equal_range(block_transactions.blockhash);
3692 : 5018 : size_t already_in_flight = std::distance(range_flight.first, range_flight.second);
3693 : 5018 : bool requested_block_from_this_peer{false};
3694 : :
3695 : : // Multimap ensures ordering of outstanding requests. It's either empty or first in line.
3696 [ + + + + ]: 5018 : bool first_in_flight = already_in_flight == 0 || (range_flight.first->second.first == pfrom.GetId());
3697 : :
3698 [ + + ]: 5996 : while (range_flight.first != range_flight.second) {
3699 [ + + ]: 1744 : auto [node_id, block_it] = range_flight.first->second;
3700 [ + + + + ]: 1744 : if (node_id == pfrom.GetId() && block_it->partialBlock) {
3701 : : requested_block_from_this_peer = true;
3702 : : break;
3703 : : }
3704 : 978 : range_flight.first++;
3705 : : }
3706 : :
3707 [ + + ]: 5018 : if (!requested_block_from_this_peer) {
3708 [ + - - + : 4252 : LogDebug(BCLog::NET, "Peer %d sent us block transactions for block we weren't expecting\n", pfrom.GetId());
- - ]
3709 : 4252 : return;
3710 : : }
3711 : :
3712 [ + + ]: 766 : PartiallyDownloadedBlock& partialBlock = *range_flight.first->second.second->partialBlock;
3713 : :
3714 [ + + ]: 766 : if (partialBlock.header.IsNull()) {
3715 : : // It is possible for the header to be empty if a previous call to FillBlock wiped the header, but left
3716 : : // the PartiallyDownloadedBlock pointer around (i.e. did not call RemoveBlockRequest). In this case, we
3717 : : // should not call LookupBlockIndex below.
3718 [ + - ]: 1 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId());
3719 [ + - + - ]: 1 : Misbehaving(peer, "previous compact block reconstruction attempt failed");
3720 [ + - - + : 1 : LogDebug(BCLog::NET, "Peer %d sent compact block transactions multiple times", pfrom.GetId());
- - ]
3721 : 1 : return;
3722 : : }
3723 : :
3724 : : // We should not have gotten this far in compact block processing unless it's attached to a known header
3725 [ + - - + ]: 765 : const CBlockIndex* prev_block{Assume(m_chainman.m_blockman.LookupBlockIndex(partialBlock.header.hashPrevBlock))};
3726 [ + - ]: 765 : ReadStatus status = partialBlock.FillBlock(*pblock, block_transactions.txn,
3727 : 765 : /*segwit_active=*/DeploymentActiveAfter(prev_block, m_chainman, Consensus::DEPLOYMENT_SEGWIT));
3728 [ + + ]: 765 : if (status == READ_STATUS_INVALID) {
3729 [ + - ]: 41 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId()); // Reset in-flight state in case Misbehaving does not result in a disconnect
3730 [ + - + - ]: 41 : Misbehaving(peer, "invalid compact block/non-matching block transactions");
3731 : 41 : return;
3732 [ + + ]: 724 : } else if (status == READ_STATUS_FAILED) {
3733 [ + - ]: 3 : if (first_in_flight) {
3734 : : // Might have collided, fall back to getdata now :(
3735 : : // We keep the failed partialBlock to disallow processing another compact block announcement from the same
3736 : : // peer for the same block. We let the full block download below continue under the same m_downloading_since
3737 : : // timer.
3738 : 3 : std::vector<CInv> invs;
3739 [ + - ]: 3 : invs.emplace_back(MSG_BLOCK | GetFetchFlags(peer), block_transactions.blockhash);
3740 [ + - + - ]: 6 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, invs);
3741 : 3 : } else {
3742 [ # # ]: 0 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId());
3743 [ # # # # : 0 : LogDebug(BCLog::NET, "Peer %d sent us a compact block but it failed to reconstruct, waiting on first download to complete\n", pfrom.GetId());
# # ]
3744 : 0 : return;
3745 : : }
3746 : : } else {
3747 : : // Block is okay for further processing
3748 [ + - ]: 721 : RemoveBlockRequest(block_transactions.blockhash, pfrom.GetId()); // it is now an empty pointer
3749 : 721 : fBlockRead = true;
3750 : : // mapBlockSource is used for potentially punishing peers and
3751 : : // updating which peers send us compact blocks, so the race
3752 : : // between here and cs_main in ProcessNewBlock is fine.
3753 : : // BIP 152 permits peers to relay compact blocks after validating
3754 : : // the header only; we should not punish peers if the block turns
3755 : : // out to be invalid.
3756 [ + - ]: 721 : mapBlockSource.emplace(block_transactions.blockhash, std::make_pair(pfrom.GetId(), false));
3757 : : }
3758 : 4294 : } // Don't hold cs_main when we call into ProcessNewBlock
3759 [ + + ]: 724 : if (fBlockRead) {
3760 : : // Since we requested this block (it was in mapBlocksInFlight), force it to be processed,
3761 : : // even if it would not be a candidate for new tip (missing previous block, chain not long enough, etc)
3762 : : // This bypasses some anti-DoS logic in AcceptBlock (eg to prevent
3763 : : // disk-space attacks), but this should be safe due to the
3764 : : // protections in the compact block handler -- see related comment
3765 : : // in compact block optimistic reconstruction handling.
3766 [ + - + - ]: 2163 : ProcessBlock(pfrom, pblock, /*force_processing=*/true, /*min_pow_checked=*/true);
3767 : : }
3768 : : return;
3769 : 5018 : }
3770 : :
3771 : 5047 : void PeerManagerImpl::LogBlockHeader(const CBlockIndex& index, const CNode& peer, bool via_compact_block) {
3772 : : // To prevent log spam, this function should only be called after it was determined that a
3773 : : // header is both new and valid.
3774 : : //
3775 : : // These messages are valuable for detecting potential selfish mining behavior;
3776 : : // if multiple displacing headers are seen near simultaneously across many
3777 : : // nodes in the network, this might be an indication of selfish mining.
3778 : : // In addition it can be used to identify peers which send us a header, but
3779 : : // don't followup with a complete and valid (compact) block.
3780 : : // Having this log by default when not in IBD ensures broad availability of
3781 : : // this data in case investigation is merited.
3782 : 5047 : const auto msg = strprintf(
3783 : : "Saw new %sheader hash=%s height=%d %s",
3784 [ + + ]: 5047 : via_compact_block ? "cmpctblock " : "",
3785 [ + - ]: 10094 : index.GetBlockHash().ToString(),
3786 : 5047 : index.nHeight,
3787 : 5047 : peer.LogPeer()
3788 [ + - ]: 5047 : );
3789 [ + + ]: 5047 : if (m_chainman.IsInitialBlockDownload()) {
3790 [ + - - + : 3461 : LogDebug(BCLog::VALIDATION, "%s", msg);
- - ]
3791 : : } else {
3792 [ + - ]: 5047 : LogInfo("%s", msg);
3793 : : }
3794 : 5047 : }
3795 : :
3796 : 100 : void PeerManagerImpl::PushPrivateBroadcastTx(CNode& node)
3797 : : {
3798 [ - + ]: 100 : Assume(node.IsPrivateBroadcastConn());
3799 : :
3800 [ + - ]: 100 : const auto opt_tx{m_tx_for_private_broadcast.PickTxForSend(node.GetId(), CService{node.addr})};
3801 [ + - ]: 100 : if (!opt_tx) {
3802 [ + - - + : 100 : LogDebug(BCLog::PRIVBROADCAST, "Disconnecting: no more transactions for private broadcast (connected in vain), %s", node.LogPeer());
- - - - ]
3803 : 100 : node.fDisconnect = true;
3804 : 100 : return;
3805 : : }
3806 [ # # ]: 0 : const CTransactionRef& tx{*opt_tx};
3807 : :
3808 : 0 : LogDebug(BCLog::PRIVBROADCAST, "P2P handshake completed, sending INV for txid=%s%s, %s",
[ # # # #
# # # # #
# # # # #
# # # # #
# # # ]
3809 : : tx->GetHash().ToString(), tx->HasWitness() ? strprintf(", wtxid=%s", tx->GetWitnessHash().ToString()) : "",
3810 : : node.LogPeer());
3811 : :
3812 [ # # # # : 0 : MakeAndPushMessage(node, NetMsgType::INV, std::vector<CInv>{{CInv{MSG_TX, tx->GetHash().ToUint256()}}});
# # # # ]
3813 : 100 : }
3814 : :
3815 : 413675 : void PeerManagerImpl::ProcessMessage(Peer& peer, CNode& pfrom, const std::string& msg_type, DataStream& vRecv,
3816 : : const NodeClock::time_point time_received,
3817 : : const std::atomic<bool>& interruptMsgProc)
3818 : : {
3819 : 413675 : AssertLockHeld(g_msgproc_mutex);
3820 : :
3821 [ - + - - : 413675 : LogDebug(BCLog::NET, "received: %s (%u bytes) peer=%d\n", SanitizeString(msg_type), vRecv.size(), pfrom.GetId());
- - - - ]
3822 : :
3823 : :
3824 [ + + ]: 413675 : if (msg_type == NetMsgType::VERSION) {
3825 [ + + ]: 28101 : if (pfrom.nVersion != 0) {
3826 [ - + ]: 294 : LogDebug(BCLog::NET, "redundant version message from peer=%d\n", pfrom.GetId());
3827 : 294 : return;
3828 : : }
3829 : :
3830 : 27807 : int64_t nTime;
3831 : 27807 : CService addrMe;
3832 : 27807 : uint64_t nNonce = 1;
3833 : 27807 : ServiceFlags nServices;
3834 : 27807 : int nVersion;
3835 [ + + ]: 27807 : std::string cleanSubVer;
3836 : 27807 : int starting_height = -1;
3837 : 27807 : bool fRelay = true;
3838 : :
3839 [ + + + + : 27807 : vRecv >> nVersion >> Using<CustomUintFormatter<8>>(nServices) >> nTime;
+ + ]
3840 [ + + ]: 27538 : if (nTime < 0) {
3841 : 399 : nTime = 0;
3842 : : }
3843 [ + + ]: 27538 : vRecv.ignore(8); // Ignore the addrMe service bits sent by the peer
3844 [ + + ]: 27523 : vRecv >> CNetAddr::V1(addrMe);
3845 [ + + + + ]: 27455 : if (!pfrom.IsInboundConn() && !pfrom.IsPrivateBroadcastConn())
3846 : : {
3847 : : // Overwrites potentially existing services. In contrast to this,
3848 : : // unvalidated services received via gossip relay in ADDR/ADDRV2
3849 : : // messages are only ever added but cannot replace existing ones.
3850 [ + - ]: 14651 : m_addrman.SetServices(pfrom.addr, nServices);
3851 : : }
3852 [ + + + + ]: 27455 : if (pfrom.ExpectServicesFromConn() && !HasAllDesirableServiceFlags(nServices))
3853 : : {
3854 [ + - - + : 2698 : LogDebug(BCLog::NET, "peer does not offer the expected services (%08x offered, %08x expected), %s",
- - - - ]
3855 : : nServices,
3856 : : GetDesirableServiceFlags(nServices),
3857 : : pfrom.DisconnectMsg());
3858 : 2698 : pfrom.fDisconnect = true;
3859 : 2698 : return;
3860 : : }
3861 : :
3862 [ + + ]: 24757 : if (nVersion < MIN_PEER_PROTO_VERSION) {
3863 : : // disconnect from peers older than this proto version
3864 [ + - - + : 6 : LogDebug(BCLog::NET, "peer using obsolete version %i, %s", nVersion, pfrom.DisconnectMsg());
- - - - ]
3865 : 6 : pfrom.fDisconnect = true;
3866 : 6 : return;
3867 : : }
3868 : :
3869 [ - + + + ]: 24751 : if (!vRecv.empty()) {
3870 : : // The version message includes information about the sending node which we don't use:
3871 : : // - 8 bytes (service bits)
3872 : : // - 16 bytes (ipv6 address)
3873 : : // - 2 bytes (port)
3874 [ + + ]: 24235 : vRecv.ignore(26);
3875 [ + + ]: 24099 : vRecv >> nNonce;
3876 : : }
3877 [ - + + + ]: 24604 : if (!vRecv.empty()) {
3878 [ + + ]: 24061 : std::string strSubVer;
3879 [ + + ]: 24061 : vRecv >> LIMITED_STRING(strSubVer, MAX_SUBVERSION_LENGTH);
3880 [ - + + - ]: 23709 : cleanSubVer = SanitizeString(strSubVer);
3881 : 24061 : }
3882 [ - + + + ]: 24252 : if (!vRecv.empty()) {
3883 [ + + ]: 23694 : vRecv >> starting_height;
3884 : : }
3885 [ - + + + ]: 24166 : if (!vRecv.empty())
3886 [ + - ]: 23600 : vRecv >> fRelay;
3887 : : // Disconnect if we connected to ourself
3888 [ + + + - : 24166 : if (pfrom.IsInboundConn() && !m_connman.CheckIncomingNonce(nNonce))
+ + ]
3889 : : {
3890 [ + - + - ]: 314 : LogInfo("connected to self at %s, disconnecting\n", pfrom.addr.ToStringAddrPort());
3891 : 314 : pfrom.fDisconnect = true;
3892 : 314 : return;
3893 : : }
3894 : :
3895 [ + + + - : 23852 : if (pfrom.IsInboundConn() && addrMe.IsRoutable())
+ + ]
3896 : : {
3897 [ + - ]: 236 : SeenLocal(addrMe);
3898 : : }
3899 : :
3900 : : // Inbound peers send us their version message when they connect.
3901 : : // We send our version message in response.
3902 [ + + ]: 23852 : if (pfrom.IsInboundConn()) {
3903 [ + - ]: 11379 : PushNodeVersion(pfrom, peer);
3904 : : }
3905 : :
3906 : : // Change version
3907 [ + + + + ]: 47529 : const int greatest_common_version = std::min(nVersion, pfrom.AdvertisedVersion());
3908 [ + - ]: 23852 : pfrom.SetCommonVersion(greatest_common_version);
3909 : 23852 : pfrom.nVersion = nVersion;
3910 : :
3911 [ + - ]: 23852 : pfrom.m_has_all_wanted_services = HasAllDesirableServiceFlags(nServices);
3912 [ + - ]: 23852 : peer.m_their_services = nServices;
3913 [ + - ]: 23852 : pfrom.SetAddrLocal(addrMe);
3914 : 23852 : {
3915 [ + - ]: 23852 : LOCK(pfrom.m_subver_mutex);
3916 [ + - + - ]: 47704 : pfrom.cleanSubVer = cleanSubVer;
3917 : 0 : }
3918 : :
3919 : : // Only initialize the Peer::TxRelay m_relay_txs data structure if:
3920 : : // - this isn't an outbound block-relay-only connection, and
3921 : : // - this isn't an outbound feeler connection, and
3922 : : // - fRelay=true (the peer wishes to receive transaction announcements)
3923 : : // or we're offering NODE_BLOOM to this peer. NODE_BLOOM means that
3924 : : // the peer may turn on transaction relay later.
3925 [ + + ]: 23852 : if (!pfrom.IsBlockOnlyConn() &&
3926 [ + + + + : 23852 : !pfrom.IsFeelerConn() &&
+ + ]
3927 [ + + ]: 6107 : (fRelay || (peer.m_our_services & NODE_BLOOM))) {
3928 [ + - ]: 18339 : auto* const tx_relay = peer.SetTxRelay();
3929 : 18339 : {
3930 [ + - ]: 18339 : LOCK(tx_relay->m_bloom_filter_mutex);
3931 [ + - ]: 18339 : tx_relay->m_relay_txs = fRelay; // set to true after we get the first filter* message
3932 : 18339 : }
3933 [ + + ]: 18339 : if (fRelay) pfrom.m_relays_txs = true;
3934 : : }
3935 : :
3936 [ + - ]: 23852 : const auto mapped_as{m_connman.GetMappedAS(pfrom.addr)};
3937 : 23852 : LogDebug(BCLog::NET, "receive version message: %s: version %d, blocks=%d, us=%s, txrelay=%d, %s%s",
[ + - - +
- - - - -
- - - - -
- - - - -
- ]
3938 : : cleanSubVer.empty() ? "<no user agent>" : cleanSubVer, pfrom.nVersion,
3939 : : starting_height, addrMe.ToStringAddrPort(), fRelay, pfrom.LogPeer(),
3940 : : (mapped_as ? strprintf(", mapped_as=%d", mapped_as) : ""));
3941 : :
3942 [ + + ]: 23852 : if (pfrom.IsPrivateBroadcastConn()) {
3943 [ + + ]: 175 : if (fRelay) {
3944 [ + - + - ]: 278 : MakeAndPushMessage(pfrom, NetMsgType::VERACK);
3945 : : } else {
3946 [ + - - + : 36 : LogDebug(BCLog::PRIVBROADCAST, "Disconnecting: does not support transaction relay (connected in vain), %s",
- - - - ]
3947 : : pfrom.LogPeer());
3948 : 36 : pfrom.fDisconnect = true;
3949 : : }
3950 : 175 : return;
3951 : : }
3952 : :
3953 [ + + ]: 23677 : if (greatest_common_version >= WTXID_RELAY_VERSION) {
3954 [ + - + - ]: 20478 : MakeAndPushMessage(pfrom, NetMsgType::WTXIDRELAY);
3955 : : }
3956 : :
3957 : : // Signal ADDRv2 support (BIP155).
3958 : 20478 : if (greatest_common_version >= 70016) {
3959 : : // BIP155 defines addrv2 and sendaddrv2 for all protocol versions, but some
3960 : : // implementations reject messages they don't know. As a courtesy, don't send
3961 : : // it to nodes with a version before 70016, as no software is known to support
3962 : : // BIP155 that doesn't announce at least that protocol version number.
3963 [ + - + - ]: 20478 : MakeAndPushMessage(pfrom, NetMsgType::SENDADDRV2);
3964 : : }
3965 : :
3966 [ + + ]: 20478 : if (greatest_common_version >= WTXID_RELAY_VERSION && m_txreconciliation) {
3967 : : // Per BIP-330, we announce txreconciliation support if:
3968 : : // - protocol version per the peer's VERSION message supports WTXID_RELAY;
3969 : : // - transaction relay is supported per the peer's VERSION message
3970 : : // - this is not a block-relay-only connection and not a feeler
3971 : : // - this is not an addr fetch connection;
3972 : : // - we are not in -blocksonly mode.
3973 [ + - ]: 9876 : const auto* tx_relay = peer.GetTxRelay();
3974 [ + - + + : 16344 : if (tx_relay && WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs) &&
+ - ]
3975 [ + + + + : 16802 : !pfrom.IsAddrFetchConn() && !m_opts.ignore_incoming_txs) {
+ - ]
3976 [ + - ]: 6766 : const uint64_t recon_salt = m_txreconciliation->PreRegisterPeer(pfrom.GetId());
3977 [ + - + - ]: 13532 : MakeAndPushMessage(pfrom, NetMsgType::SENDTXRCNCL,
3978 : : TXRECONCILIATION_VERSION, recon_salt);
3979 : : }
3980 : : }
3981 : :
3982 : 23677 : if (greatest_common_version >= FEATURE_VERSION) {
3983 : : // announce supported features
3984 : : // MakeAndPushFeature(pfrom, NetMsgFeature::FOO, uint32_t{1});
3985 : : }
3986 : :
3987 : : // If we have too many tx-relaying inbound peers, attempt to evict an existing one.
3988 : : // Only if this fails, disconnect this peer.
3989 [ + - + - ]: 23677 : if (MaybeDisconnectForTxRelayCapacity(pfrom, msg_type, /*protect_peer=*/pfrom.GetId())) return;
3990 [ + - + - ]: 23677 : MakeAndPushMessage(pfrom, NetMsgType::VERACK);
3991 : :
3992 : : // Potentially mark this peer as a preferred download peer.
3993 : 23677 : {
3994 [ + - ]: 23677 : LOCK(cs_main);
3995 : 23677 : CNodeState* state = State(pfrom.GetId());
3996 [ + + + + : 23677 : state->fPreferredDownload = (!pfrom.IsInboundConn() || pfrom.HasPermission(NetPermissionFlags::NoBan)) && !pfrom.IsAddrFetchConn() && CanServeBlocks(peer);
+ + + + ]
3997 [ + - ]: 23677 : m_num_preferred_download_peers += state->fPreferredDownload;
3998 : 23677 : }
3999 : :
4000 : : // Attempt to initialize address relay for outbound peers and use result
4001 : : // to decide whether to send GETADDR, so that we don't send it to
4002 : : // inbound, feelers, or outbound block-relay-only peers.
4003 : 23677 : bool send_getaddr{false};
4004 [ + + ]: 23677 : if (!pfrom.IsInboundConn()) {
4005 [ + - ]: 12298 : send_getaddr = SetupAddressRelay(pfrom, peer);
4006 : : }
4007 [ + + ]: 12298 : if (send_getaddr) {
4008 : : // Do a one-time address fetch to help populate/update our addrman.
4009 : : // If we're starting up for the first time, our addrman may be pretty
4010 : : // empty, so this mechanism is important to help us connect to the network.
4011 : : // We skip this for block-relay-only peers. We want to avoid
4012 : : // potentially leaking addr information and we do not want to
4013 : : // indicate to the peer that we will participate in addr relay.
4014 [ + - + - ]: 10169 : MakeAndPushMessage(pfrom, NetMsgType::GETADDR);
4015 : 10169 : peer.m_getaddr_sent = true;
4016 : : // When requesting a getaddr, accept an additional MAX_ADDR_TO_SEND addresses in response
4017 : : // (bypassing the MAX_ADDR_PROCESSING_TOKEN_BUCKET limit).
4018 : 10169 : peer.m_addr_token_bucket += MAX_ADDR_TO_SEND;
4019 : : }
4020 : :
4021 [ + + ]: 23677 : if (!pfrom.IsInboundConn()) {
4022 : : // For non-inbound connections, we update the addrman to record
4023 : : // connection success so that addrman will have an up-to-date
4024 : : // notion of which peers are online and available.
4025 : : //
4026 : : // While we strive to not leak information about block-relay-only
4027 : : // connections via the addrman, not moving an address to the tried
4028 : : // table is also potentially detrimental because new-table entries
4029 : : // are subject to eviction in the event of addrman collisions. We
4030 : : // mitigate the information-leak by never calling
4031 : : // AddrMan::Connected() on block-relay-only peers; see
4032 : : // FinalizeNode().
4033 : : //
4034 : : // This moves an address from New to Tried table in Addrman,
4035 : : // resolves tried-table collisions, etc.
4036 [ + - ]: 12298 : m_addrman.Good(pfrom.addr);
4037 : : }
4038 : :
4039 : 23677 : peer.m_time_offset = NodeSeconds{std::chrono::seconds{nTime}} - Now<NodeSeconds>();
4040 [ + + ]: 23677 : if (!pfrom.IsInboundConn()) {
4041 : : // Don't use timedata samples from inbound peers to make it
4042 : : // harder for others to create false warnings about our clock being out of sync.
4043 [ + - ]: 12298 : m_outbound_time_offsets.Add(peer.m_time_offset);
4044 [ + - ]: 12298 : m_outbound_time_offsets.WarnIfOutOfSync();
4045 : : }
4046 : :
4047 : : // If the peer is old enough to have the old alert system, send it the final alert.
4048 [ + + ]: 23677 : if (greatest_common_version <= 70012) {
4049 : 3189 : constexpr auto finalAlert{"60010000000000000000000000ffffff7f00000000ffffff7ffeffff7f01ffffff7f00000000ffffff7f00ffffff7f002f555247454e543a20416c657274206b657920636f6d70726f6d697365642c2075706772616465207265717569726564004630440220653febd6410f470f6bae11cad19c48413becb1ac2c17f908fd0fd53bdc3abd5202206d0e9c96fe88d4a0f01ed9dedae2b6f9e00da94cad0fecaae66ecf689bf71b50"_hex};
4050 [ + - + - ]: 6378 : MakeAndPushMessage(pfrom, "alert", finalAlert);
4051 : : }
4052 : :
4053 : : // Feeler connections exist only to verify if address is online.
4054 [ + + ]: 23677 : if (pfrom.IsFeelerConn()) {
4055 [ + - - + : 902 : LogDebug(BCLog::NET, "feeler connection completed, %s", pfrom.DisconnectMsg());
- - - - ]
4056 : 902 : pfrom.fDisconnect = true;
4057 : : }
4058 : 23677 : return;
4059 : 28744 : }
4060 : :
4061 [ + + ]: 385574 : if (pfrom.nVersion == 0) {
4062 : : // Must have a version message before anything else
4063 [ - + - - : 18112 : LogDebug(BCLog::NET, "non-version message before version handshake. Message \"%s\" from peer=%d\n", SanitizeString(msg_type), pfrom.GetId());
- - ]
4064 : 18112 : return;
4065 : : }
4066 : :
4067 [ + + ]: 367462 : if (msg_type == NetMsgType::VERACK) {
4068 [ + + ]: 20871 : if (pfrom.fSuccessfullyConnected) {
4069 [ - + ]: 1733 : LogDebug(BCLog::NET, "ignoring redundant verack message from peer=%d\n", pfrom.GetId());
4070 : 1733 : return;
4071 : : }
4072 : :
4073 : 29469 : auto new_peer_msg = [&]() {
4074 : 10331 : const auto mapped_as{m_connman.GetMappedAS(pfrom.addr)};
4075 : 10331 : return strprintf("New %s peer connected: transport: %s, version: %d, %s%s",
4076 [ + - ]: 20662 : pfrom.ConnectionTypeAsString(),
4077 [ + - ]: 20662 : TransportTypeAsString(pfrom.m_transport->GetInfo().transport_type),
4078 [ + - ]: 20662 : pfrom.nVersion.load(), pfrom.LogPeer(),
4079 [ - + + - ]: 30993 : (mapped_as ? strprintf(", mapped_as=%d", mapped_as) : ""));
4080 : 19138 : };
4081 : :
4082 : : // Log successful connections unconditionally for outbound, but not for inbound as those
4083 : : // can be triggered by an attacker at high rate.
4084 [ + + ]: 19138 : if (pfrom.IsInboundConn()) {
4085 [ - + - - ]: 8807 : LogDebug(BCLog::NET, "%s", new_peer_msg());
4086 : : } else {
4087 [ + - ]: 10331 : LogInfo("%s", new_peer_msg());
4088 : : }
4089 : :
4090 [ + + ]: 19138 : if (auto tx_relay = peer.GetTxRelay()) {
4091 : : // `TxRelay::m_tx_inventory_to_send` must be empty before the
4092 : : // version handshake is completed as
4093 : : // `TxRelay::m_next_inv_send_time` is first initialised in
4094 : : // `SendMessages` after the verack is received. Any transactions
4095 : : // received during the version handshake would otherwise
4096 : : // immediately be advertised without random delay, potentially
4097 : : // leaking the time of arrival to a spy.
4098 [ - + + - : 33224 : Assume(WITH_LOCK(
- + + - ]
4099 : : tx_relay->m_tx_inventory_mutex,
4100 : : return tx_relay->m_tx_inventory_to_send.empty() &&
4101 : : tx_relay->m_next_inv_send_time == 0s));
4102 : : }
4103 : :
4104 [ + + ]: 19138 : if (pfrom.IsPrivateBroadcastConn()) {
4105 : 100 : pfrom.fSuccessfullyConnected = true;
4106 : : // The peer may intend to later send us NetMsgType::FEEFILTER limiting
4107 : : // cheap transactions, but we don't wait for that and thus we may send
4108 : : // them a transaction below their threshold. This is ok because this
4109 : : // relay logic is designed to work even in cases when the peer drops
4110 : : // the transaction (due to it being too cheap, or for other reasons).
4111 : 100 : PushPrivateBroadcastTx(pfrom);
4112 : 100 : return;
4113 : : }
4114 : :
4115 [ + + ]: 19038 : if (pfrom.GetCommonVersion() >= SHORT_IDS_BLOCKS_VERSION) {
4116 : : // Tell our peer we are willing to provide version 2 cmpctblocks.
4117 : : // However, we do not request new block announcements using
4118 : : // cmpctblock messages.
4119 : : // We send this to non-NODE NETWORK peers as well, because
4120 : : // they may wish to request compact blocks from us
4121 [ + - ]: 35796 : MakeAndPushMessage(pfrom, NetMsgType::SENDCMPCT, /*high_bandwidth=*/false, /*version=*/CMPCTBLOCKS_VERSION);
4122 : : }
4123 : :
4124 [ + + ]: 19038 : if (m_txreconciliation) {
4125 [ + + + + ]: 9351 : if (!peer.m_wtxid_relay || !m_txreconciliation->IsPeerRegistered(pfrom.GetId())) {
4126 : : // We could have optimistically pre-registered/registered the peer. In that case,
4127 : : // we should forget about the reconciliation state here if this wasn't followed
4128 : : // by WTXIDRELAY (since WTXIDRELAY can't be announced later).
4129 : 9331 : m_txreconciliation->ForgetPeer(pfrom.GetId());
4130 : : }
4131 : : }
4132 : :
4133 : 19038 : {
4134 [ + - ]: 19038 : LOCK2(::cs_main, m_tx_download_mutex);
4135 : 19038 : const CNodeState* state = State(pfrom.GetId());
4136 : 19038 : m_txdownloadman.ConnectedPeer(pfrom.GetId(), node::TxDownloadConnectionInfo {
4137 [ + - ]: 19038 : .m_preferred = state->fPreferredDownload,
4138 : 19038 : .m_relay_permissions = pfrom.HasPermission(NetPermissionFlags::Relay),
4139 [ + - ]: 19038 : .m_wtxid_relay = peer.m_wtxid_relay,
4140 : : });
4141 [ + - ]: 19038 : }
4142 : :
4143 : 19038 : pfrom.fSuccessfullyConnected = true;
4144 : 19038 : return;
4145 : : }
4146 : :
4147 [ + + ]: 346591 : if (msg_type == NetMsgType::SENDHEADERS) {
4148 : 242 : peer.m_prefers_headers = true;
4149 : 242 : return;
4150 : : }
4151 : :
4152 [ + + ]: 346349 : if (msg_type == NetMsgType::SENDCMPCT) {
4153 : 25013 : uint8_t sendcmpct_hb{0};
4154 : 25013 : uint64_t sendcmpct_version{0};
4155 : 25013 : vRecv >> sendcmpct_hb >> sendcmpct_version;
4156 : :
4157 : : // BIP152: the first integer is interpreted as a boolean and MUST have a
4158 : : // value of either 1 or 0.
4159 [ + + ]: 24621 : if (sendcmpct_hb > 1) {
4160 [ + - ]: 1340 : Misbehaving(peer, "invalid sendcmpct announce field");
4161 : 1340 : return;
4162 : : }
4163 : :
4164 : : // Only support compact block relay with witnesses
4165 [ + + ]: 23281 : if (sendcmpct_version != CMPCTBLOCKS_VERSION) return;
4166 : :
4167 : 22824 : LOCK(cs_main);
4168 : 22824 : CNodeState* nodestate = State(pfrom.GetId());
4169 : 22824 : nodestate->m_provides_cmpctblocks = true;
4170 : 22824 : nodestate->m_requested_hb_cmpctblocks = sendcmpct_hb;
4171 : : // save whether peer selects us as BIP152 high-bandwidth peer
4172 : : // (receiving sendcmpct(1) signals high-bandwidth, sendcmpct(0) low-bandwidth)
4173 [ + - ]: 22824 : pfrom.m_bip152_highbandwidth_from = sendcmpct_hb;
4174 [ + - ]: 22824 : return;
4175 : 22824 : }
4176 : :
4177 : : // BIP339 defines feature negotiation of wtxidrelay, which must happen between
4178 : : // VERSION and VERACK to avoid relay problems from switching after a connection is up.
4179 [ + + ]: 321336 : if (msg_type == NetMsgType::WTXIDRELAY) {
4180 [ + + ]: 668 : if (pfrom.fSuccessfullyConnected) {
4181 : : // Disconnect peers that send a wtxidrelay message after VERACK.
4182 [ - + - - ]: 33 : LogDebug(BCLog::NET, "wtxidrelay received after verack, %s", pfrom.DisconnectMsg());
4183 : 33 : pfrom.fDisconnect = true;
4184 : 33 : return;
4185 : : }
4186 [ + + ]: 635 : if (pfrom.GetCommonVersion() >= WTXID_RELAY_VERSION) {
4187 [ + + ]: 485 : if (!peer.m_wtxid_relay) {
4188 : 282 : peer.m_wtxid_relay = true;
4189 : 282 : m_wtxid_relay_peers++;
4190 : : } else {
4191 [ - + ]: 203 : LogDebug(BCLog::NET, "ignoring duplicate wtxidrelay from peer=%d\n", pfrom.GetId());
4192 : : }
4193 : : } else {
4194 [ - + ]: 150 : LogDebug(BCLog::NET, "ignoring wtxidrelay due to old common version=%d from peer=%d\n", pfrom.GetCommonVersion(), pfrom.GetId());
4195 : : }
4196 : 635 : return;
4197 : : }
4198 : :
4199 : : // BIP155 defines feature negotiation of addrv2 and sendaddrv2, which must happen
4200 : : // between VERSION and VERACK.
4201 [ + + ]: 320668 : if (msg_type == NetMsgType::SENDADDRV2) {
4202 [ + + ]: 241 : if (pfrom.fSuccessfullyConnected) {
4203 : : // Disconnect peers that send a SENDADDRV2 message after VERACK.
4204 [ - + - - ]: 35 : LogDebug(BCLog::NET, "sendaddrv2 received after verack, %s", pfrom.DisconnectMsg());
4205 : 35 : pfrom.fDisconnect = true;
4206 : 35 : return;
4207 : : }
4208 : 206 : peer.m_wants_addrv2 = true;
4209 : 206 : return;
4210 : : }
4211 : :
4212 [ + + ]: 320427 : if (msg_type == NetMsgType::FEATURE) {
4213 [ + + ]: 184 : if (pfrom.fSuccessfullyConnected) {
4214 : : // Disconnect peers that send a FEATURE message after VERACK.
4215 [ - + - - ]: 8 : LogDebug(BCLog::NET, "feature received after verack, %s", pfrom.DisconnectMsg());
4216 : 8 : pfrom.fDisconnect = true;
4217 : 8 : return;
4218 [ + + ]: 176 : } else if (pfrom.GetCommonVersion() < FEATURE_VERSION) {
4219 : : // Disconnect peers that send a FEATURE message without valid version negotiation.
4220 [ - + - - ]: 23 : LogDebug(BCLog::NET, "feature received with incompatible version %d, %s", pfrom.GetCommonVersion(), pfrom.DisconnectMsg());
4221 : 23 : pfrom.fDisconnect = true;
4222 : 23 : return;
4223 : : }
4224 : :
4225 [ + + ]: 153 : std::string feature_id;
4226 : 153 : DataStream feature_data;
4227 : 153 : try {
4228 [ + + ]: 153 : vRecv >> LIMITED_STRING(feature_id, MAX_FEATUREID_LENGTH);
4229 : 121 : std::vector<unsigned char> feature_data_vec;
4230 [ + + ]: 121 : vRecv >> LIMITED_VECTOR(feature_data_vec, MAX_FEATUREDATA_LENGTH);
4231 [ - + + - ]: 158 : feature_data = DataStream(feature_data_vec);
4232 [ - + ]: 153 : } catch (const std::exception&) {
4233 : 74 : feature_id.clear(); // use empty feature_id as error indicator
4234 : 74 : }
4235 [ - + + + : 220 : if (feature_id.size() < 4 || !vRecv.empty()) {
+ + ]
4236 [ + - - + : 101 : LogDebug(BCLog::NET, "invalid feature payload, %s", pfrom.DisconnectMsg());
- - - - ]
4237 : 101 : pfrom.fDisconnect = true;
4238 : 101 : return;
4239 : : }
4240 : :
4241 : : // if (feature_id == NetMsgFeature::FOO) {
4242 : : // ...
4243 : : // return;
4244 : : // }
4245 : :
4246 : : // ignore unknown feature_id
4247 [ + - - + : 52 : LogDebug(BCLog::NET, "unknown feature advertised: %s", SanitizeString(feature_id));
- - - - -
- ]
4248 : 52 : return;
4249 : 153 : }
4250 : :
4251 : : // Received from a peer demonstrating readiness to announce transactions via reconciliations.
4252 : : // This feature negotiation must happen between VERSION and VERACK to avoid relay problems
4253 : : // from switching announcement protocols after the connection is up.
4254 [ + + ]: 320243 : if (msg_type == NetMsgType::SENDTXRCNCL) {
4255 [ - + ]: 440 : if (!m_txreconciliation) {
4256 [ # # ]: 0 : LogDebug(BCLog::NET, "sendtxrcncl from peer=%d ignored, as our node does not have txreconciliation enabled\n", pfrom.GetId());
4257 : 0 : return;
4258 : : }
4259 : :
4260 [ + + ]: 440 : if (pfrom.fSuccessfullyConnected) {
4261 [ - + - - ]: 33 : LogDebug(BCLog::NET, "sendtxrcncl received after verack, %s", pfrom.DisconnectMsg());
4262 : 33 : pfrom.fDisconnect = true;
4263 : 33 : return;
4264 : : }
4265 : :
4266 : : // Peer must not offer us reconciliations if we specified no tx relay support in VERSION.
4267 [ + + ]: 407 : if (RejectIncomingTxs(pfrom)) {
4268 [ - + - - ]: 9 : LogDebug(BCLog::NET, "sendtxrcncl received to which we indicated no tx relay, %s", pfrom.DisconnectMsg());
4269 : 9 : pfrom.fDisconnect = true;
4270 : 9 : return;
4271 : : }
4272 : :
4273 : : // Peer must not offer us reconciliations if they specified no tx relay support in VERSION.
4274 : : // This flag might also be false in other cases, but the RejectIncomingTxs check above
4275 : : // eliminates them, so that this flag fully represents what we are looking for.
4276 : 398 : const auto* tx_relay = peer.GetTxRelay();
4277 [ + + + + : 782 : if (!tx_relay || !WITH_LOCK(tx_relay->m_bloom_filter_mutex, return tx_relay->m_relay_txs)) {
+ - ]
4278 [ - + - - ]: 27 : LogDebug(BCLog::NET, "sendtxrcncl received which indicated no tx relay to us, %s", pfrom.DisconnectMsg());
4279 : 27 : pfrom.fDisconnect = true;
4280 : 27 : return;
4281 : : }
4282 : :
4283 : 371 : uint32_t peer_txreconcl_version;
4284 : 371 : uint64_t remote_salt;
4285 : 371 : vRecv >> peer_txreconcl_version >> remote_salt;
4286 : :
4287 : 313 : const ReconciliationRegisterResult result = m_txreconciliation->RegisterPeer(pfrom.GetId(), pfrom.IsInboundConn(),
4288 : : peer_txreconcl_version, remote_salt);
4289 [ + + + + ]: 313 : switch (result) {
4290 : 243 : case ReconciliationRegisterResult::NOT_FOUND:
4291 [ - + ]: 243 : LogDebug(BCLog::NET, "Ignore unexpected txreconciliation signal from peer=%d\n", pfrom.GetId());
4292 : : break;
4293 : : case ReconciliationRegisterResult::SUCCESS:
4294 : : break;
4295 : 13 : case ReconciliationRegisterResult::ALREADY_REGISTERED:
4296 [ - + - - ]: 13 : LogDebug(BCLog::NET, "txreconciliation protocol violation (sendtxrcncl received from already registered peer), %s", pfrom.DisconnectMsg());
4297 : 13 : pfrom.fDisconnect = true;
4298 : 13 : return;
4299 : 8 : case ReconciliationRegisterResult::PROTOCOL_VIOLATION:
4300 [ - + - - ]: 8 : LogDebug(BCLog::NET, "txreconciliation protocol violation, %s", pfrom.DisconnectMsg());
4301 : 8 : pfrom.fDisconnect = true;
4302 : 8 : return;
4303 : : }
4304 : 292 : return;
4305 : : }
4306 : :
4307 [ + + ]: 319803 : if (!pfrom.fSuccessfullyConnected) {
4308 [ - + - - : 4507 : LogDebug(BCLog::NET, "Unsupported message \"%s\" prior to verack from peer=%d\n", SanitizeString(msg_type), pfrom.GetId());
- - ]
4309 : 4507 : return;
4310 : : }
4311 : :
4312 [ - + ]: 315296 : if (pfrom.IsPrivateBroadcastConn()) {
4313 [ # # # # ]: 0 : if (msg_type != NetMsgType::PONG && msg_type != NetMsgType::GETDATA) {
4314 [ # # # # ]: 0 : LogDebug(BCLog::PRIVBROADCAST, "Ignoring incoming message '%s', %s", msg_type, pfrom.LogPeer());
4315 : 0 : return;
4316 : : }
4317 : : }
4318 : :
4319 [ + + + + ]: 315296 : if (msg_type == NetMsgType::ADDR || msg_type == NetMsgType::ADDRV2) {
4320 : 11636 : const auto ser_params{
4321 [ + + ]: 11636 : msg_type == NetMsgType::ADDRV2 ?
4322 : : // Set V2 param so that the CNetAddr and CAddress
4323 : : // unserialize methods know that an address in v2 format is coming.
4324 : : CAddress::V2_NETWORK :
4325 : : CAddress::V1_NETWORK,
4326 : : };
4327 : :
4328 : 11636 : std::vector<CAddress> vAddr;
4329 [ + + ]: 11636 : vRecv >> ser_params(vAddr);
4330 [ - + + - ]: 5997 : ProcessAddrs(msg_type, pfrom, peer, std::move(vAddr), interruptMsgProc);
4331 : 5997 : return;
4332 : 11636 : }
4333 : :
4334 [ + + ]: 303660 : if (msg_type == NetMsgType::INV) {
4335 : 2809 : std::vector<CInv> vInv;
4336 [ + + ]: 2809 : vRecv >> vInv;
4337 [ - + - + ]: 2222 : if (vInv.size() > MAX_INV_SZ)
4338 : : {
4339 [ # # # # ]: 0 : Misbehaving(peer, strprintf("inv message size = %u", vInv.size()));
4340 : 0 : return;
4341 : : }
4342 : :
4343 : 2222 : const bool reject_tx_invs{RejectIncomingTxs(pfrom)};
4344 [ + - + - ]: 4444 : std::unordered_set<uint256, SaltedUint256Hasher> seen_txids{0, m_txhash_hasher};
4345 [ + - + - ]: 4444 : std::unordered_set<uint256, SaltedUint256Hasher> seen_wtxids{0, m_txhash_hasher};
4346 : :
4347 [ + - + - ]: 2222 : LOCK2(cs_main, m_tx_download_mutex);
4348 : :
4349 : 2222 : const auto current_time{GetTime<std::chrono::microseconds>()};
4350 : 2222 : uint256* best_block{nullptr};
4351 : :
4352 [ + + ]: 427501 : for (CInv& inv : vInv) {
4353 [ + - ]: 425285 : if (interruptMsgProc) return;
4354 : :
4355 : : // Ignore INVs that don't match wtxidrelay setting.
4356 : : // Note that orphan parent fetching always uses MSG_TX GETDATAs regardless of the wtxidrelay setting.
4357 : : // This is fine as no INV messages are involved in that process.
4358 [ + + ]: 425285 : if (peer.m_wtxid_relay) {
4359 [ + + ]: 3994 : if (inv.IsMsgTx()) continue;
4360 : : } else {
4361 [ + + ]: 421291 : if (inv.IsMsgWtx()) continue;
4362 : : }
4363 : :
4364 [ + + ]: 419576 : if (inv.IsMsgBlk()) {
4365 [ + - ]: 6693 : const bool fAlreadyHave = AlreadyHaveBlock(inv.hash);
4366 [ + - - + : 6693 : LogDebug(BCLog::NET, "got inv: %s %s peer=%d", inv.ToString(), fAlreadyHave ? "have" : "new", pfrom.GetId());
- - - - -
- ]
4367 : :
4368 [ + - ]: 6693 : UpdateBlockAvailability(pfrom.GetId(), inv.hash);
4369 [ + + + - : 6693 : if (!fAlreadyHave && !m_chainman.m_blockman.LoadingBlocks() && !IsBlockRequested(inv.hash)) {
- + ]
4370 : : // Headers-first is the primary method of announcement on
4371 : : // the network. If a node fell back to sending blocks by
4372 : : // inv, it may be for a re-org, or because we haven't
4373 : : // completed initial headers sync. The final block hash
4374 : : // provided should be the highest, so send a getheaders and
4375 : : // then fetch the blocks we need to catch up.
4376 : : best_block = &inv.hash;
4377 : : }
4378 [ + + ]: 412883 : } else if (inv.IsGenTxMsg()) {
4379 [ + + ]: 23801 : if (reject_tx_invs) {
4380 [ + - - + : 6 : LogDebug(BCLog::NET, "transaction (%s) inv sent in violation of protocol, %s", inv.hash.ToString(), pfrom.DisconnectMsg());
- - - - -
- ]
4381 : 6 : pfrom.fDisconnect = true;
4382 : 6 : return;
4383 : : }
4384 : : // MSG_WITNESS_TX is treated as a txid, despite only being specified for getdata.
4385 [ + + ]: 23795 : auto& seen_hashes{inv.IsMsgWtx() ? seen_wtxids : seen_txids};
4386 [ + - + + ]: 23795 : if (!seen_hashes.insert(inv.hash).second) continue;
4387 [ + - ]: 20779 : const GenTxid gtxid = ToGenTxid(inv);
4388 [ + - ]: 20779 : AddKnownTx(peer, inv.hash);
4389 : :
4390 [ - + ]: 20779 : if (!m_chainman.IsInitialBlockDownload()) {
4391 [ # # ]: 0 : const bool fAlreadyHave{m_txdownloadman.AddTxAnnouncement(pfrom.GetId(), gtxid, current_time)};
4392 [ # # # # : 0 : LogDebug(BCLog::NET, "got inv: %s %s peer=%d", inv.ToString(), fAlreadyHave ? "have" : "new", pfrom.GetId());
# # # # #
# ]
4393 : : }
4394 : : } else {
4395 [ + - - + : 425279 : LogDebug(BCLog::NET, "Unknown inv type \"%s\" received from peer=%d\n", inv.ToString(), pfrom.GetId());
- - - - ]
4396 : : }
4397 : : }
4398 : :
4399 [ + + ]: 2216 : if (best_block != nullptr) {
4400 : : // If we haven't started initial headers-sync with this peer, then
4401 : : // consider sending a getheaders now. On initial startup, there's a
4402 : : // reliability vs bandwidth tradeoff, where we are only trying to do
4403 : : // initial headers sync with one peer at a time, with a long
4404 : : // timeout (at which point, if the sync hasn't completed, we will
4405 : : // disconnect the peer and then choose another). In the meantime,
4406 : : // as new blocks are found, we are willing to add one new peer per
4407 : : // block to sync with as well, to sync quicker in the case where
4408 : : // our initial peer is unresponsive (but less bandwidth than we'd
4409 : : // use if we turned on sync with all peers).
4410 [ - + ]: 1298 : CNodeState& state{*Assert(State(pfrom.GetId()))};
4411 [ + + + + : 1298 : if (state.fSyncStarted || (!peer.m_inv_triggered_getheaders_before_sync && *best_block != m_last_block_inv_triggering_headers_sync)) {
+ + ]
4412 [ + - + - : 958 : if (MaybeSendGetHeaders(pfrom, GetLocator(m_chainman.m_best_header), peer)) {
+ + ]
4413 [ + - - + : 243 : LogDebug(BCLog::NET, "getheaders (%d) %s to peer=%d\n",
- - - - ]
4414 : : m_chainman.m_best_header->nHeight, best_block->ToString(),
4415 : : pfrom.GetId());
4416 : : }
4417 [ + + ]: 958 : if (!state.fSyncStarted) {
4418 : 171 : peer.m_inv_triggered_getheaders_before_sync = true;
4419 : : // Update the last block hash that triggered a new headers
4420 : : // sync, so that we don't turn on headers sync with more
4421 : : // than 1 new peer every new block.
4422 : 171 : m_last_block_inv_triggering_headers_sync = *best_block;
4423 : : }
4424 : : }
4425 : : }
4426 : :
4427 : 2216 : return;
4428 [ + - ]: 7253 : }
4429 : :
4430 [ + + ]: 300851 : if (msg_type == NetMsgType::GETDATA) {
4431 : 5727 : std::vector<CInv> vInv;
4432 [ + + ]: 5727 : vRecv >> vInv;
4433 [ - + - + ]: 5047 : if (vInv.size() > MAX_INV_SZ)
4434 : : {
4435 [ # # # # ]: 0 : Misbehaving(peer, strprintf("getdata message size = %u", vInv.size()));
4436 : 0 : return;
4437 : : }
4438 : :
4439 [ + - - + : 5047 : LogDebug(BCLog::NET, "received getdata (%u invsz) peer=%d\n", vInv.size(), pfrom.GetId());
- - - - ]
4440 : :
4441 [ - + + + ]: 5047 : if (vInv.size() > 0) {
4442 [ + - - + : 4936 : LogDebug(BCLog::NET, "received getdata for: %s peer=%d\n", vInv[0].ToString(), pfrom.GetId());
- - - - ]
4443 : : }
4444 : :
4445 [ - + ]: 5047 : if (pfrom.IsPrivateBroadcastConn()) {
4446 [ # # ]: 0 : const auto pushed_tx_opt{m_tx_for_private_broadcast.GetTxForNode(pfrom.GetId())};
4447 [ # # ]: 0 : if (!pushed_tx_opt) {
4448 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Disconnecting: got GETDATA without sending an INV, %s",
# # # # ]
4449 : : pfrom.LogPeer());
4450 : 0 : pfrom.fDisconnect = true;
4451 : 0 : return;
4452 : : }
4453 : :
4454 [ # # ]: 0 : const CTransactionRef& pushed_tx{*pushed_tx_opt};
4455 : :
4456 : : // The GETDATA request must contain exactly one inv and it must be for the transaction
4457 : : // that we INVed to the peer earlier.
4458 [ # # # # : 0 : if (vInv.size() == 1 && vInv[0].IsMsgTx() && vInv[0].hash == pushed_tx->GetHash().ToUint256()) {
# # # # ]
4459 : :
4460 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::TX, TX_WITH_WITNESS(*pushed_tx));
4461 : :
4462 : 0 : peer.m_ping_queued = true; // Ensure a ping will be sent: mimic a request via RPC.
4463 [ # # ]: 0 : MaybeSendPing(pfrom, peer, NodeClock::now());
4464 : : } else {
4465 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Disconnecting: got an unexpected GETDATA message, %s",
# # # # ]
4466 : : pfrom.LogPeer());
4467 : 0 : pfrom.fDisconnect = true;
4468 : : }
4469 : 0 : return;
4470 : 0 : }
4471 : :
4472 : 5047 : {
4473 [ + - ]: 5047 : LOCK(peer.m_getdata_requests_mutex);
4474 [ + - ]: 5047 : peer.m_getdata_requests.insert(peer.m_getdata_requests.end(), vInv.begin(), vInv.end());
4475 [ + - ]: 5047 : ProcessGetData(pfrom, peer, interruptMsgProc);
4476 : 0 : }
4477 : :
4478 : 5047 : return;
4479 : 5727 : }
4480 : :
4481 [ + + ]: 295124 : if (msg_type == NetMsgType::GETBLOCKS) {
4482 : 775 : CBlockLocator locator;
4483 : 775 : uint256 hashStop;
4484 [ + + + + ]: 775 : vRecv >> locator >> hashStop;
4485 : :
4486 [ - + + + ]: 490 : if (locator.vHave.size() > MAX_LOCATOR_SZ) {
4487 [ + - - + : 13 : LogDebug(BCLog::NET, "getblocks locator size %lld > %d, %s", locator.vHave.size(), MAX_LOCATOR_SZ, pfrom.DisconnectMsg());
- - - - ]
4488 : 13 : pfrom.fDisconnect = true;
4489 : 13 : return;
4490 : : }
4491 : :
4492 : : // We might have announced the currently-being-connected tip using a
4493 : : // compact block, which resulted in the peer sending a getblocks
4494 : : // request, which we would otherwise respond to without the new block.
4495 : : // To avoid this situation we simply verify that we are on our best
4496 : : // known chain now. This is super overkill, but we handle it better
4497 : : // for getheaders requests, and there are no known nodes which support
4498 : : // compact blocks but still use getblocks to request blocks.
4499 : 477 : {
4500 : 477 : std::shared_ptr<const CBlock> a_recent_block;
4501 : 477 : {
4502 [ + - ]: 477 : LOCK(m_most_recent_block_mutex);
4503 [ + - ]: 477 : a_recent_block = m_most_recent_block;
4504 : 477 : }
4505 [ + - ]: 477 : BlockValidationState state;
4506 [ + - - + : 477 : if (!m_chainman.ActiveChainstate().ActivateBestChain(state, a_recent_block)) {
+ - - + -
+ ]
4507 [ # # # # : 0 : LogDebug(BCLog::NET, "failed to activate chain (%s)\n", state.ToString());
# # # # ]
4508 : : }
4509 [ - + ]: 477 : }
4510 : :
4511 [ + - ]: 477 : LOCK(cs_main);
4512 : :
4513 : : // Find the last block the caller has in the main chain
4514 [ + - + - ]: 477 : const CBlockIndex* pindex = m_chainman.ActiveChainstate().FindForkInGlobalIndex(locator);
4515 : :
4516 : : // Send the rest of the chain
4517 [ + - ]: 477 : if (pindex)
4518 [ + - ]: 477 : pindex = m_chainman.ActiveChain().Next(*pindex);
4519 : 477 : int nLimit = 500;
4520 : 477 : 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());
[ + - - +
- - - - -
- - - -
- ]
4521 [ + - + + ]: 85390 : for (; pindex; pindex = m_chainman.ActiveChain().Next(*pindex))
4522 : : {
4523 [ + + ]: 84979 : if (pindex->GetBlockHash() == hashStop)
4524 : : {
4525 [ + - - + : 66 : LogDebug(BCLog::NET, " getblocks stopping at %d %s", pindex->nHeight, pindex->GetBlockHash().ToString());
- - - - ]
4526 : : break;
4527 : : }
4528 : : // If pruning, don't inv blocks unless we have on disk and are likely to still have
4529 : : // for some reasonable time window (1 hour) that block relay might require.
4530 : 84913 : const int nPrunedBlocksLikelyToHave = MIN_BLOCKS_TO_KEEP - 3600 / m_chainparams.GetConsensus().nPowTargetSpacing;
4531 [ - + - - : 84913 : if (m_chainman.m_blockman.IsPruneMode() && (!(pindex->nStatus & BLOCK_HAVE_DATA) || pindex->nHeight <= m_chainman.ActiveChain().Tip()->nHeight - nPrunedBlocksLikelyToHave)) {
- - - - -
- ]
4532 [ # # # # : 0 : LogDebug(BCLog::NET, " getblocks stopping, pruned or too old block at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
# # # # ]
4533 : : break;
4534 : : }
4535 [ + - + - : 254739 : WITH_LOCK(peer.m_block_inv_mutex, peer.m_blocks_for_inv_relay.push_back(pindex->GetBlockHash()));
+ - ]
4536 [ - + ]: 84913 : if (--nLimit <= 0) {
4537 : : // When this block is requested, we'll send an inv that'll
4538 : : // trigger the peer to getblocks the next batch of inventory.
4539 [ # # # # : 0 : LogDebug(BCLog::NET, " getblocks stopping at limit %d %s", pindex->nHeight, pindex->GetBlockHash().ToString());
# # # # ]
4540 [ # # # # ]: 0 : WITH_LOCK(peer.m_block_inv_mutex, {peer.m_continuation_block = pindex->GetBlockHash();});
4541 : : break;
4542 : : }
4543 : : }
4544 [ + - ]: 477 : return;
4545 : 1252 : }
4546 : :
4547 [ + + ]: 294349 : if (msg_type == NetMsgType::GETBLOCKTXN) {
4548 : 849 : BlockTransactionsRequest req;
4549 [ + + ]: 849 : vRecv >> req;
4550 : :
4551 : : // No legitimate reason to send indexes empty
4552 [ + + ]: 399 : if (req.indexes.empty()) {
4553 [ + - - + : 83 : LogDebug(BCLog::NET, "getblocktxn received with no transaction indexes, %s", pfrom.DisconnectMsg());
- - - - ]
4554 : 83 : pfrom.fDisconnect = true;
4555 : 83 : return;
4556 : : }
4557 : :
4558 : : // Verify differential encoding invariant: indexes must be strictly increasing
4559 : : // DifferenceFormatter should guarantee this property during deserialization
4560 [ - + + + ]: 4997 : for (size_t i = 1; i < req.indexes.size(); ++i) {
4561 [ - + ]: 4681 : Assume(req.indexes[i] > req.indexes[i-1]);
4562 : : }
4563 : :
4564 : 316 : std::shared_ptr<const CBlock> recent_block;
4565 : 316 : {
4566 [ + - ]: 316 : LOCK(m_most_recent_block_mutex);
4567 [ + + ]: 316 : if (m_most_recent_block_hash == req.blockhash)
4568 : 2 : recent_block = m_most_recent_block;
4569 : : // Unlock m_most_recent_block_mutex to avoid cs_main lock inversion
4570 : 316 : }
4571 [ - + ]: 316 : if (recent_block) {
4572 [ # # ]: 0 : SendBlockTransactions(pfrom, peer, *recent_block, req);
4573 : : return;
4574 : : }
4575 : :
4576 : 316 : FlatFilePos block_pos{};
4577 : 316 : {
4578 [ + - ]: 316 : LOCK(cs_main);
4579 : :
4580 [ + - ]: 316 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(req.blockhash);
4581 [ + + - + ]: 316 : if (!pindex || !(pindex->nStatus & BLOCK_HAVE_DATA)) {
4582 [ + - - + : 222 : LogDebug(BCLog::NET, "Peer %d sent us a getblocktxn for a block we don't have\n", pfrom.GetId());
- - ]
4583 [ + - ]: 222 : return;
4584 : : }
4585 : :
4586 [ + - - + : 94 : if (pindex->nHeight >= m_chainman.ActiveChain().Height() - MAX_BLOCKTXN_DEPTH) {
+ + ]
4587 : 46 : block_pos = pindex->GetBlockPos();
4588 : : }
4589 : 222 : }
4590 : :
4591 [ + + ]: 94 : if (!block_pos.IsNull()) {
4592 : 46 : CBlock block;
4593 [ + - ]: 46 : const bool ret{m_chainman.m_blockman.ReadBlock(block, block_pos, req.blockhash)};
4594 : : // If height is above MAX_BLOCKTXN_DEPTH then this block cannot get
4595 : : // pruned after we release cs_main above, so this read should never fail.
4596 [ - + ]: 46 : assert(ret);
4597 : :
4598 [ + - ]: 46 : SendBlockTransactions(pfrom, peer, block, req);
4599 : 46 : return;
4600 : 46 : }
4601 : :
4602 : : // If an older block is requested (should never happen in practice,
4603 : : // but can happen in tests) send a block response instead of a
4604 : : // blocktxn response. Sending a full block response instead of a
4605 : : // small blocktxn response is preferable in the case where a peer
4606 : : // might maliciously send lots of getblocktxn requests to trigger
4607 : : // expensive disk reads, because it will require the peer to
4608 : : // actually receive all the data read from disk over the network.
4609 [ + - - + : 48 : LogDebug(BCLog::NET, "Peer %d sent us a getblocktxn for a block > %i deep\n", pfrom.GetId(), MAX_BLOCKTXN_DEPTH);
- - ]
4610 [ + - ]: 48 : CInv inv{MSG_WITNESS_BLOCK, req.blockhash};
4611 [ + - + - ]: 144 : WITH_LOCK(peer.m_getdata_requests_mutex, peer.m_getdata_requests.push_back(inv));
4612 : : // The message processing loop will go around again (without pausing) and we'll respond then
4613 : : return;
4614 : 1165 : }
4615 : :
4616 [ + + ]: 293500 : if (msg_type == NetMsgType::GETHEADERS) {
4617 : 1364 : CBlockLocator locator;
4618 : 1364 : uint256 hashStop;
4619 [ + + + + ]: 1364 : vRecv >> locator >> hashStop;
4620 : :
4621 [ - + + + ]: 1045 : if (locator.vHave.size() > MAX_LOCATOR_SZ) {
4622 [ + - - + : 16 : LogDebug(BCLog::NET, "getheaders locator size %lld > %d, %s", locator.vHave.size(), MAX_LOCATOR_SZ, pfrom.DisconnectMsg());
- - - - ]
4623 : 16 : pfrom.fDisconnect = true;
4624 : 16 : return;
4625 : : }
4626 : :
4627 [ - + ]: 1029 : if (m_chainman.m_blockman.LoadingBlocks()) {
4628 [ # # # # : 0 : LogDebug(BCLog::NET, "Ignoring getheaders from peer=%d while importing/reindexing\n", pfrom.GetId());
# # ]
4629 : 0 : return;
4630 : : }
4631 : :
4632 [ + - ]: 1029 : LOCK(cs_main);
4633 : :
4634 : : // Don't serve headers from our active chain until our chainwork is at least
4635 : : // the minimum chain work. This prevents us from starting a low-work headers
4636 : : // sync that will inevitably be aborted by our peer.
4637 [ + - + - : 2058 : if (m_chainman.ActiveTip() == nullptr ||
- + ]
4638 [ + - + - : 1029 : (m_chainman.ActiveTip()->nChainWork < m_chainman.MinimumChainWork() && !pfrom.HasPermission(NetPermissionFlags::Download))) {
+ - - - ]
4639 [ # # # # : 0 : LogDebug(BCLog::NET, "Ignoring getheaders from peer=%d because active chain has too little work; sending empty response\n", pfrom.GetId());
# # ]
4640 : : // Just respond with an empty headers message, to tell the peer to
4641 : : // go away but not treat us as unresponsive.
4642 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::HEADERS, std::vector<CBlockHeader>());
4643 : 0 : return;
4644 : : }
4645 : :
4646 : 1029 : CNodeState *nodestate = State(pfrom.GetId());
4647 : 1029 : const CBlockIndex* pindex = nullptr;
4648 [ + + ]: 1029 : if (locator.IsNull())
4649 : : {
4650 : : // If locator is null, return the hashStop block
4651 [ + - ]: 204 : pindex = m_chainman.m_blockman.LookupBlockIndex(hashStop);
4652 [ + + ]: 204 : if (!pindex) {
4653 : : return;
4654 : : }
4655 [ + - - + ]: 93 : if (!BlockRequestAllowed(*pindex)) {
4656 [ # # # # : 0 : LogDebug(BCLog::NET, "%s: ignoring request from peer=%i for old block header that isn't in the main chain\n", __func__, pfrom.GetId());
# # ]
4657 : 0 : return;
4658 : : }
4659 : : }
4660 : : else
4661 : : {
4662 : : // Find the last block the caller has in the main chain
4663 [ + - + - ]: 825 : pindex = m_chainman.ActiveChainstate().FindForkInGlobalIndex(locator);
4664 [ + - ]: 825 : if (pindex)
4665 [ + - ]: 825 : pindex = m_chainman.ActiveChain().Next(*pindex);
4666 : : }
4667 : :
4668 : : // we must use CBlocks, as CBlockHeaders won't include the 0x00 nTx count at the end
4669 : 918 : std::vector<CBlock> vHeaders;
4670 : 918 : int nLimit = m_opts.max_headers_result;
4671 : 918 : LogDebug(BCLog::NET, "getheaders %d to %s from peer=%d\n", (pindex ? pindex->nHeight : -1), hashStop.IsNull() ? "end" : hashStop.ToString(), pfrom.GetId());
[ + - - +
- - - - -
- - - -
- ]
4672 [ + - + + ]: 151432 : for (; pindex; pindex = m_chainman.ActiveChain().Next(*pindex))
4673 : : {
4674 [ + - ]: 150661 : vHeaders.emplace_back(pindex->GetBlockHeader());
4675 [ + - + + ]: 150661 : if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
4676 : : break;
4677 : : }
4678 : : // pindex can be nullptr either if we sent m_chainman.ActiveChain().Tip() OR
4679 : : // if our peer has m_chainman.ActiveChain().Tip() (and thus we are sending an empty
4680 : : // headers message). In both cases it's safe to update
4681 : : // pindexBestHeaderSent to be our tip.
4682 : : //
4683 : : // It is important that we simply reset the BestHeaderSent value here,
4684 : : // and not max(BestHeaderSent, newHeaderSent). We might have announced
4685 : : // the currently-being-connected tip using a compact block, which
4686 : : // resulted in the peer sending a headers request, which we respond to
4687 : : // without the new block. By resetting the BestHeaderSent, we ensure we
4688 : : // will re-announce the new block via headers (or compact blocks again)
4689 : : // in the SendMessages logic.
4690 [ + + + - : 918 : nodestate->pindexBestHeaderSent = pindex ? pindex : m_chainman.ActiveChain().Tip();
- + ]
4691 [ + - + - ]: 918 : MakeAndPushMessage(pfrom, NetMsgType::HEADERS, TX_WITH_WITNESS(vHeaders));
4692 : 918 : return;
4693 : 3311 : }
4694 : :
4695 [ + + ]: 292136 : if (msg_type == NetMsgType::TX) {
4696 [ + + ]: 69192 : if (RejectIncomingTxs(pfrom)) {
4697 [ - + - - ]: 12 : LogDebug(BCLog::NET, "transaction sent in violation of protocol, %s", pfrom.DisconnectMsg());
4698 : 12 : pfrom.fDisconnect = true;
4699 : 12 : return;
4700 : : }
4701 : :
4702 : : // Stop processing the transaction early if we are still in IBD since we don't
4703 : : // have enough information to validate it yet. Sending unsolicited transactions
4704 : : // is not considered a protocol violation, so don't punish the peer.
4705 [ + + ]: 69180 : if (m_chainman.IsInitialBlockDownload()) return;
4706 : :
4707 : 63647 : CTransactionRef ptx;
4708 [ + - ]: 63647 : vRecv >> TX_WITH_WITNESS(ptx);
4709 : :
4710 [ - + ]: 63647 : const Txid& txid = ptx->GetHash();
4711 [ - + ]: 63647 : const Wtxid& wtxid = ptx->GetWitnessHash();
4712 : :
4713 [ - + ]: 63647 : const uint256& hash = peer.m_wtxid_relay ? wtxid.ToUint256() : txid.ToUint256();
4714 [ + - ]: 63647 : AddKnownTx(peer, hash);
4715 : :
4716 [ + - - + ]: 63647 : if (const auto num_broadcasted{m_tx_for_private_broadcast.Remove(ptx)}) {
4717 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Received our privately broadcast transaction (txid=%s) from the "
# # # # ]
4718 : : "network from %s; stopping private broadcast attempts",
4719 : : txid.ToString(), pfrom.LogPeer());
4720 [ # # ]: 0 : if (NUM_PRIVATE_BROADCAST_PER_TX > num_broadcasted.value()) {
4721 : : // Not all of the initial NUM_PRIVATE_BROADCAST_PER_TX connections were needed.
4722 : : // Tell CConnman it does not need to start the remaining ones.
4723 [ # # ]: 0 : m_connman.m_private_broadcast.NumToOpenSub(NUM_PRIVATE_BROADCAST_PER_TX - num_broadcasted.value());
4724 : : }
4725 : : }
4726 : :
4727 [ + - + - ]: 63647 : LOCK2(cs_main, m_tx_download_mutex);
4728 : :
4729 [ + - + + ]: 63647 : const auto& [should_validate, package_to_validate] = m_txdownloadman.ReceivedTx(pfrom.GetId(), ptx);
4730 [ + + ]: 63647 : if (!should_validate) {
4731 [ + + ]: 48832 : if (pfrom.HasPermission(NetPermissionFlags::ForceRelay)) {
4732 : : // Always relay transactions received from peers with forcerelay
4733 : : // permission, even if they were already in the mempool, allowing
4734 : : // the node to function as a gateway for nodes hidden behind it.
4735 [ + - + + ]: 23368 : if (!m_mempool.exists(txid)) {
4736 [ + - + - : 13346 : LogInfo("Not relaying non-mempool transaction %s (wtxid=%s) from forcerelay peer=%d\n",
+ - ]
4737 : : txid.ToString(), wtxid.ToString(), pfrom.GetId());
4738 : : } else {
4739 [ + - + - : 10022 : LogInfo("Force relaying tx %s (wtxid=%s) from peer=%d\n",
+ - ]
4740 : : txid.ToString(), wtxid.ToString(), pfrom.GetId());
4741 [ + - ]: 10022 : InitiateTxBroadcastToAll(wtxid);
4742 : : }
4743 : : }
4744 : :
4745 [ + + ]: 48832 : if (package_to_validate) {
4746 [ + - + - ]: 64 : const auto package_result{ProcessNewPackage(m_chainman.ActiveChainstate(), m_mempool, package_to_validate->m_txns, /*test_accept=*/false, /*client_maxfeerate=*/std::nullopt)};
4747 [ + - - + : 64 : LogDebug(BCLog::TXPACKAGES, "package evaluation for %s: %s\n", package_to_validate->ToString(),
- - - - -
- ]
4748 : : package_result.m_state.IsValid() ? "package accepted" : "package rejected");
4749 [ + - + - ]: 64 : ProcessPackageResult(package_to_validate.value(), package_result);
4750 : 64 : }
4751 : 48832 : return;
4752 : : }
4753 : :
4754 : : // ReceivedTx should not be telling us to validate the tx and a package.
4755 [ - + ]: 14815 : Assume(!package_to_validate.has_value());
4756 : :
4757 [ + - ]: 14815 : const MempoolAcceptResult result = m_chainman.ProcessTransaction(ptx);
4758 : 14815 : const TxValidationState& state = result.m_state;
4759 : :
4760 [ + + ]: 14815 : if (result.m_result_type == MempoolAcceptResult::ResultType::VALID) {
4761 [ + - ]: 4938 : ProcessValidTx(pfrom.GetId(), ptx, result.m_replaced_transactions);
4762 : 4938 : pfrom.m_last_tx_time = GetTime<std::chrono::seconds>();
4763 : : }
4764 [ + + ]: 14815 : if (state.IsInvalid()) {
4765 [ + - + + ]: 9877 : if (auto package_to_validate{ProcessInvalidTx(pfrom.GetId(), ptx, state, /*first_time_failure=*/true)}) {
4766 [ + - + - ]: 19 : const auto package_result{ProcessNewPackage(m_chainman.ActiveChainstate(), m_mempool, package_to_validate->m_txns, /*test_accept=*/false, /*client_maxfeerate=*/std::nullopt)};
4767 [ + - - + : 19 : LogDebug(BCLog::TXPACKAGES, "package evaluation for %s: %s\n", package_to_validate->ToString(),
- - - - -
- ]
4768 : : package_result.m_state.IsValid() ? "package accepted" : "package rejected");
4769 [ + - + - ]: 19 : ProcessPackageResult(package_to_validate.value(), package_result);
4770 : 9896 : }
4771 : : }
4772 : :
4773 : 14815 : return;
4774 [ + - + - : 269403 : }
+ - ]
4775 : :
4776 [ + + ]: 222944 : if (msg_type == NetMsgType::CMPCTBLOCK)
4777 : : {
4778 : : // Ignore cmpctblock received while importing
4779 [ - + ]: 88774 : if (m_chainman.m_blockman.LoadingBlocks()) {
4780 [ # # # # ]: 0 : LogDebug(BCLog::CMPCTBLOCK, "%s sent us a compact block even though we are still loading blocks!", pfrom.LogPeer());
4781 : 0 : return;
4782 [ + + ]: 88774 : } else if (m_opts.ignore_incoming_txs) {
4783 [ - + - - ]: 5808 : LogDebug(BCLog::CMPCTBLOCK, "%s sent us a compact block even though we are blocksonly!", pfrom.LogPeer());
4784 : 5808 : return;
4785 : : }
4786 : :
4787 : 82966 : {
4788 : 82966 : LOCK(cs_main);
4789 : 82966 : const CNodeState *nodestate = State(pfrom.GetId());
4790 [ + + ]: 82966 : if (!nodestate->m_provides_cmpctblocks) {
4791 [ + - - + : 11856 : LogDebug(BCLog::CMPCTBLOCK, "%s sent us a compact block despite never having sent us a SENDCMPCT!", pfrom.LogPeer());
- - - - ]
4792 [ + - ]: 11856 : return;
4793 : : }
4794 : 11856 : }
4795 : :
4796 : 71110 : CBlockHeaderAndShortTxIDs cmpctblock;
4797 [ + + ]: 71110 : vRecv >> cmpctblock;
4798 : :
4799 : 70973 : bool received_new_header = false;
4800 [ + - ]: 70973 : const auto blockhash = cmpctblock.header.GetHash();
4801 : :
4802 : 70973 : {
4803 [ + - ]: 70973 : LOCK(cs_main);
4804 : :
4805 [ + - ]: 70973 : const CBlockIndex* prev_block = m_chainman.m_blockman.LookupBlockIndex(cmpctblock.header.hashPrevBlock);
4806 [ + + ]: 70973 : if (!prev_block) {
4807 : : // Doesn't connect (or is genesis), instead of DoSing in AcceptBlockHeader, request deeper headers
4808 [ + + ]: 992 : if (!m_chainman.IsInitialBlockDownload()) {
4809 [ + - + - ]: 672 : MaybeSendGetHeaders(pfrom, GetLocator(m_chainman.m_best_header), peer);
4810 : : }
4811 : 992 : return;
4812 [ + - + - : 139962 : } else if (prev_block->nChainWork + GetBlockProof(cmpctblock.header) < GetAntiDoSWorkThreshold()) {
+ + ]
4813 : : // If we get a low-work header in a compact block, we can ignore it.
4814 [ + - - + : 18 : LogDebug(BCLog::NET, "Ignoring low-work compact block from peer %d\n", pfrom.GetId());
- - ]
4815 : 18 : return;
4816 : : }
4817 : :
4818 [ + - + + ]: 69963 : if (!m_chainman.m_blockman.LookupBlockIndex(blockhash)) {
4819 : 27594 : received_new_header = true;
4820 : : }
4821 : 1010 : }
4822 : :
4823 : 69963 : const CBlockIndex *pindex = nullptr;
4824 [ + - ]: 69963 : BlockValidationState state;
4825 [ + - + + ]: 69963 : if (!m_chainman.ProcessNewBlockHeaders({{cmpctblock.header}}, /*min_pow_checked=*/true, state, &pindex)) {
4826 [ + - ]: 27585 : if (state.IsInvalid()) {
4827 [ + - + - ]: 27585 : MaybePunishNodeForBlock(pfrom.GetId(), state, /*via_compact_block=*/true, "invalid header via cmpctblock");
4828 : 27585 : return;
4829 : : }
4830 : : }
4831 : :
4832 : : // If AcceptBlockHeader returned true, it set pindex
4833 [ - + ]: 42378 : Assert(pindex);
4834 [ + + ]: 42378 : if (received_new_header) {
4835 [ + - ]: 757 : LogBlockHeader(*pindex, pfrom, /*via_compact_block=*/true);
4836 : : }
4837 : :
4838 : 42378 : bool fProcessBLOCKTXN = false;
4839 : :
4840 : : // If we end up treating this as a plain headers message, call that as well
4841 : : // without cs_main.
4842 : 42378 : bool fRevertToHeaderProcessing = false;
4843 : :
4844 : : // Keep a CBlock for "optimistic" compactblock reconstructions (see
4845 : : // below)
4846 [ + - ]: 42378 : std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
4847 : 42378 : bool fBlockReconstructed = false;
4848 : :
4849 : 42378 : {
4850 [ + - ]: 42378 : LOCK(cs_main);
4851 [ + - ]: 42378 : UpdateBlockAvailability(pfrom.GetId(), pindex->GetBlockHash());
4852 : :
4853 : 42378 : CNodeState *nodestate = State(pfrom.GetId());
4854 : :
4855 : : // If this was a new header with more work than our tip, update the
4856 : : // peer's last block announcement time
4857 [ + + + - : 43135 : if (received_new_header && pindex->nChainWork > m_chainman.ActiveChain().Tip()->nChainWork) {
- + + - +
+ ]
4858 [ + - ]: 559 : nodestate->m_last_block_announcement = GetTime();
4859 : : }
4860 : :
4861 [ + + ]: 42378 : if (pindex->nStatus & BLOCK_HAVE_DATA) // Nothing to do here
4862 : : return;
4863 : :
4864 : 34202 : auto range_flight = mapBlocksInFlight.equal_range(pindex->GetBlockHash());
4865 : 34202 : size_t already_in_flight = std::distance(range_flight.first, range_flight.second);
4866 : 34202 : bool requested_block_from_this_peer{false};
4867 : :
4868 : : // Multimap ensures ordering of outstanding requests. It's either empty or first in line.
4869 [ + + + + ]: 34202 : bool first_in_flight = already_in_flight == 0 || (range_flight.first->second.first == pfrom.GetId());
4870 : :
4871 [ + + ]: 53444 : while (range_flight.first != range_flight.second) {
4872 [ + + ]: 28974 : if (range_flight.first->second.first == pfrom.GetId()) {
4873 : : requested_block_from_this_peer = true;
4874 : : break;
4875 : : }
4876 : 19242 : range_flight.first++;
4877 : : }
4878 : :
4879 [ + + + + ]: 34202 : if (!requested_block_from_this_peer && !pfrom.m_bip152_highbandwidth_to) {
4880 [ + - - + : 24173 : LogDebug(BCLog::CMPCTBLOCK, "%s, not marked as high-bandwidth, sent us an unsolicited compact block!", pfrom.LogPeer());
- - - - ]
4881 : 24173 : return;
4882 : : }
4883 : :
4884 [ + - - + : 20058 : if (pindex->nChainWork <= m_chainman.ActiveChain().Tip()->nChainWork || // We know something better
+ - + + ]
4885 [ + - ]: 5539 : pindex->nTx != 0) { // We had this block at some point, but pruned it
4886 [ + + ]: 4490 : if (requested_block_from_this_peer) {
4887 : : // We requested this block for some reason, but our mempool will probably be useless
4888 : : // so we just grab the block via normal getdata
4889 [ + - ]: 4199 : std::vector<CInv> vInv(1);
4890 [ + - ]: 4199 : vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(peer), blockhash);
4891 [ + - + - ]: 8398 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vInv);
4892 : 4199 : }
4893 : 4490 : return;
4894 : : }
4895 : :
4896 : : // If we're not close to tip yet, give up and let parallel block fetch work its magic
4897 [ + + + - : 5539 : if (!already_in_flight && !CanDirectFetch()) {
+ + ]
4898 : : return;
4899 : : }
4900 : :
4901 : : // We want to be a bit conservative just to be extra careful about DoS
4902 : : // possibilities in compact block processing...
4903 [ + - - + : 5538 : if (pindex->nHeight <= m_chainman.ActiveChain().Height() + 2) {
+ + ]
4904 [ + - + + : 5516 : if ((already_in_flight < MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK && nodestate->vBlocksInFlight.size() < MAX_BLOCKS_IN_TRANSIT_PER_PEER) ||
- + ]
4905 : : requested_block_from_this_peer) {
4906 : 5516 : std::list<QueuedBlock>::iterator* queuedBlockIt = nullptr;
4907 [ + - + + ]: 5516 : if (!BlockRequested(pfrom.GetId(), *pindex, &queuedBlockIt)) {
4908 [ + + ]: 5511 : if (!(*queuedBlockIt)->partialBlock)
4909 [ + - - + ]: 1054 : (*queuedBlockIt)->partialBlock.reset(new PartiallyDownloadedBlock(&m_mempool));
4910 : : else {
4911 : : // The block was already in flight using compact blocks from the same peer
4912 [ + - - + : 4457 : LogDebug(BCLog::NET, "Peer sent us compact block we were already syncing!\n");
- - ]
4913 : 4457 : return;
4914 : : }
4915 : : }
4916 : :
4917 [ + - ]: 1059 : PartiallyDownloadedBlock& partialBlock = *(*queuedBlockIt)->partialBlock;
4918 [ + - ]: 1059 : ReadStatus status = partialBlock.InitData(cmpctblock, vExtraTxnForCompact);
4919 [ - + ]: 1059 : if (status == READ_STATUS_INVALID) {
4920 [ # # ]: 0 : RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId()); // Reset in-flight state in case Misbehaving does not result in a disconnect
4921 [ # # # # ]: 0 : Misbehaving(peer, "invalid compact block");
4922 : 0 : return;
4923 [ + + ]: 1059 : } else if (status == READ_STATUS_FAILED) {
4924 [ + - ]: 155 : if (first_in_flight) {
4925 : : // Duplicate txindexes, the block is now in-flight, so just request it
4926 [ + - ]: 155 : std::vector<CInv> vInv(1);
4927 [ + - ]: 155 : vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(peer), blockhash);
4928 [ + - + - ]: 310 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vInv);
4929 : 155 : } else {
4930 : : // Give up for this peer and wait for other peer(s)
4931 [ # # ]: 0 : RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId());
4932 : : }
4933 : 155 : return;
4934 : : }
4935 : :
4936 : 904 : BlockTransactionsRequest req;
4937 [ - + + + ]: 5250 : for (size_t i = 0; i < cmpctblock.BlockTxCount(); i++) {
4938 [ + - + + ]: 1721 : if (!partialBlock.IsTxAvailable(i))
4939 [ + - ]: 1721 : req.indexes.push_back(i);
4940 : : }
4941 [ + + ]: 904 : if (req.indexes.empty()) {
4942 : : fProcessBLOCKTXN = true;
4943 [ + - ]: 205 : } else if (first_in_flight) {
4944 : : // We will try to round-trip any compact blocks we get on failure,
4945 : : // as long as it's first...
4946 : 205 : req.blockhash = pindex->GetBlockHash();
4947 [ + - + - ]: 410 : MakeAndPushMessage(pfrom, NetMsgType::GETBLOCKTXN, req);
4948 [ # # ]: 0 : } else if (pfrom.m_bip152_highbandwidth_to &&
4949 [ # # # # ]: 0 : (!pfrom.IsInboundConn() ||
4950 [ # # # # ]: 0 : IsBlockRequestedFromOutbound(blockhash) ||
4951 : : already_in_flight < MAX_CMPCTBLOCKS_INFLIGHT_PER_BLOCK - 1)) {
4952 : : // ... or it's a hb relay peer and:
4953 : : // - peer is outbound, or
4954 : : // - we already have an outbound attempt in flight(so we'll take what we can get), or
4955 : : // - it's not the final parallel download slot (which we may reserve for first outbound)
4956 : 0 : req.blockhash = pindex->GetBlockHash();
4957 [ # # # # ]: 0 : MakeAndPushMessage(pfrom, NetMsgType::GETBLOCKTXN, req);
4958 : : } else {
4959 : : // Give up for this peer and wait for other peer(s)
4960 [ # # ]: 0 : RemoveBlockRequest(pindex->GetBlockHash(), pfrom.GetId());
4961 : : }
4962 : 904 : } else {
4963 : : // This block is either already in flight from a different
4964 : : // peer, or this peer has too many blocks outstanding to
4965 : : // download from.
4966 : : // Optimistically try to reconstruct anyway since we might be
4967 : : // able to without any round trips.
4968 : 0 : PartiallyDownloadedBlock tempBlock(&m_mempool);
4969 [ # # ]: 0 : ReadStatus status = tempBlock.InitData(cmpctblock, vExtraTxnForCompact);
4970 [ # # ]: 0 : if (status != READ_STATUS_OK) {
4971 : : // TODO: don't ignore failures
4972 : 0 : return;
4973 : : }
4974 : 0 : std::vector<CTransactionRef> dummy;
4975 [ # # # # ]: 0 : const CBlockIndex* prev_block{Assume(m_chainman.m_blockman.LookupBlockIndex(cmpctblock.header.hashPrevBlock))};
4976 [ # # ]: 0 : status = tempBlock.FillBlock(*pblock, dummy,
4977 : 0 : /*segwit_active=*/DeploymentActiveAfter(prev_block, m_chainman, Consensus::DEPLOYMENT_SEGWIT));
4978 [ # # ]: 0 : if (status == READ_STATUS_OK) {
4979 : 0 : fBlockReconstructed = true;
4980 : : }
4981 : 0 : }
4982 : : } else {
4983 [ + - ]: 22 : if (requested_block_from_this_peer) {
4984 : : // We requested this block, but its far into the future, so our
4985 : : // mempool will probably be useless - request the block normally
4986 [ + - ]: 22 : std::vector<CInv> vInv(1);
4987 [ + - ]: 22 : vInv[0] = CInv(MSG_BLOCK | GetFetchFlags(peer), blockhash);
4988 [ + - + - ]: 22 : MakeAndPushMessage(pfrom, NetMsgType::GETDATA, vInv);
4989 : 22 : return;
4990 : 22 : } else {
4991 : : // If this was an announce-cmpctblock, we want the same treatment as a header message
4992 : : fRevertToHeaderProcessing = true;
4993 : : }
4994 : : }
4995 : 41474 : } // cs_main
4996 : :
4997 [ + + ]: 904 : if (fProcessBLOCKTXN) {
4998 : 699 : BlockTransactions txn;
4999 : 699 : txn.blockhash = blockhash;
5000 [ + - ]: 699 : return ProcessCompactBlockTxns(pfrom, peer, txn);
5001 : 699 : }
5002 : :
5003 [ - + ]: 205 : if (fRevertToHeaderProcessing) {
5004 : : // Headers received from HB compact block peers are permitted to be
5005 : : // relayed before full validation (see BIP 152), so we don't want to disconnect
5006 : : // the peer if the header turns out to be for an invalid block.
5007 : : // Note that if a peer tries to build on an invalid chain, that
5008 : : // will be detected and the peer will be disconnected/discouraged.
5009 [ # # # # ]: 0 : return ProcessHeadersMessage(pfrom, peer, {cmpctblock.header}, /*via_compact_block=*/true);
5010 : : }
5011 : :
5012 [ - + ]: 205 : if (fBlockReconstructed) {
5013 : : // If we got here, we were able to optimistically reconstruct a
5014 : : // block that is in flight from some other peer.
5015 : 0 : {
5016 [ # # ]: 0 : LOCK(cs_main);
5017 [ # # # # ]: 0 : mapBlockSource.emplace(pblock->GetHash(), std::make_pair(pfrom.GetId(), false));
5018 : 0 : }
5019 : : // Setting force_processing to true means that we bypass some of
5020 : : // our anti-DoS protections in AcceptBlock, which filters
5021 : : // unrequested blocks that might be trying to waste our resources
5022 : : // (eg disk space). Because we only try to reconstruct blocks when
5023 : : // we're close to caught up (via the CanDirectFetch() requirement
5024 : : // above, combined with the behavior of not requesting blocks until
5025 : : // we have a chain with at least the minimum chain work), and we ignore
5026 : : // compact blocks with less work than our tip, it is safe to treat
5027 : : // reconstructed compact blocks as having been requested.
5028 [ # # # # ]: 0 : ProcessBlock(pfrom, pblock, /*force_processing=*/true, /*min_pow_checked=*/true);
5029 [ # # ]: 0 : LOCK(cs_main); // hold cs_main for CBlockIndex::IsValid()
5030 [ # # # # : 0 : if (pindex->IsValid(BLOCK_VALID_TRANSACTIONS)) {
# # ]
5031 : : // Clear download state for this block, which is in
5032 : : // process from some other peer. We do this after calling
5033 : : // ProcessNewBlock so that a malleated cmpctblock announcement
5034 : : // can't be used to interfere with block relay.
5035 [ # # # # ]: 0 : RemoveBlockRequest(pblock->GetHash(), std::nullopt);
5036 : : }
5037 : 0 : }
5038 : 205 : return;
5039 : 183451 : }
5040 : :
5041 [ + + ]: 134170 : if (msg_type == NetMsgType::BLOCKTXN)
5042 : : {
5043 : : // Ignore blocktxn received while importing
5044 [ - + ]: 5102 : if (m_chainman.m_blockman.LoadingBlocks()) {
5045 [ # # ]: 0 : LogDebug(BCLog::NET, "Unexpected blocktxn message received from peer %d\n", pfrom.GetId());
5046 : 0 : return;
5047 : : }
5048 : :
5049 : 5102 : BlockTransactions resp;
5050 [ + + ]: 5102 : vRecv >> resp;
5051 : :
5052 [ + - ]: 4319 : return ProcessCompactBlockTxns(pfrom, peer, resp);
5053 : 5102 : }
5054 : :
5055 [ + + ]: 129068 : if (msg_type == NetMsgType::HEADERS)
5056 : : {
5057 : : // Ignore headers received while importing
5058 [ - + ]: 100196 : if (m_chainman.m_blockman.LoadingBlocks()) {
5059 [ # # ]: 0 : LogDebug(BCLog::NET, "Unexpected headers message received from peer %d\n", pfrom.GetId());
5060 : 0 : return;
5061 : : }
5062 : :
5063 : 100196 : std::vector<CBlockHeader> headers;
5064 : :
5065 : : // Bypass the normal CBlock deserialization, as we don't want to risk deserializing 2000 full blocks.
5066 [ + + ]: 100196 : unsigned int nCount = ReadCompactSize(vRecv);
5067 [ + + ]: 100031 : if (nCount > m_opts.max_headers_result) {
5068 [ + - + - ]: 229 : Misbehaving(peer, strprintf("headers message size = %u", nCount));
5069 : 229 : return;
5070 : : }
5071 [ + - ]: 99802 : headers.resize(nCount);
5072 [ + + ]: 398214 : for (unsigned int n = 0; n < nCount; n++) {
5073 [ + + ]: 299217 : vRecv >> headers[n];
5074 [ + + ]: 298520 : ReadCompactSize(vRecv); // ignore tx count; assume it is 0.
5075 : : }
5076 : :
5077 [ + - ]: 98997 : ProcessHeadersMessage(pfrom, peer, std::move(headers), /*via_compact_block=*/false);
5078 : :
5079 : : // Check if the headers presync progress needs to be reported to validation.
5080 : : // This needs to be done without holding the m_headers_presync_mutex lock.
5081 [ + + ]: 98997 : if (m_headers_presync_should_signal.exchange(false)) {
5082 : 6361 : HeadersPresyncStats stats;
5083 : 6361 : {
5084 [ + - ]: 6361 : LOCK(m_headers_presync_mutex);
5085 : 6361 : auto it = m_headers_presync_stats.find(m_headers_presync_bestpeer);
5086 [ + - ]: 6361 : if (it != m_headers_presync_stats.end()) stats = it->second;
5087 : 6361 : }
5088 [ + - ]: 6361 : if (stats.second) {
5089 [ + - ]: 6361 : m_chainman.ReportHeadersPresync(stats.second->first, stats.second->second);
5090 : : }
5091 : : }
5092 : :
5093 : 98997 : return;
5094 : 100196 : }
5095 : :
5096 [ + + ]: 28872 : if (msg_type == NetMsgType::BLOCK)
5097 : : {
5098 : : // Ignore block received while importing
5099 [ - + ]: 19055 : if (m_chainman.m_blockman.LoadingBlocks()) {
5100 [ # # ]: 0 : LogDebug(BCLog::NET, "Unexpected block message received from peer %d\n", pfrom.GetId());
5101 : 0 : return;
5102 : : }
5103 : :
5104 : 19055 : std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
5105 [ + + ]: 19055 : vRecv >> TX_WITH_WITNESS(*pblock);
5106 : :
5107 [ + - - + : 18269 : LogDebug(BCLog::NET, "received block %s peer=%d\n", pblock->GetHash().ToString(), pfrom.GetId());
- - - - -
- ]
5108 : :
5109 [ + - + - : 54807 : const CBlockIndex* prev_block{WITH_LOCK(m_chainman.GetMutex(), return m_chainman.m_blockman.LookupBlockIndex(pblock->hashPrevBlock))};
+ - ]
5110 : :
5111 : : // Check for possible mutation if it connects to something we know so we can check for DEPLOYMENT_SEGWIT being active
5112 [ + + + - : 27525 : if (prev_block && IsBlockMutated(/*block=*/*pblock,
+ + ]
5113 : 9256 : /*check_witness_root=*/DeploymentActiveAfter(prev_block, m_chainman, Consensus::DEPLOYMENT_SEGWIT))) {
5114 [ + - - + : 203 : LogDebug(BCLog::NET, "Received mutated block from peer=%d\n", peer.m_id);
- - ]
5115 [ + - + - ]: 203 : Misbehaving(peer, "mutated block");
5116 [ + - + - : 609 : WITH_LOCK(cs_main, RemoveBlockRequest(pblock->GetHash(), peer.m_id));
+ - ]
5117 : : return;
5118 : : }
5119 : :
5120 : 18066 : bool forceProcessing = false;
5121 [ + - ]: 18066 : const uint256 hash(pblock->GetHash());
5122 : 18066 : bool min_pow_checked = false;
5123 : 18066 : {
5124 [ + - ]: 18066 : LOCK(cs_main);
5125 : : // Always process the block if we requested it, since we may
5126 : : // need it even when it's not a candidate for a new best tip.
5127 : 18066 : forceProcessing = IsBlockRequested(hash);
5128 [ + - ]: 18066 : RemoveBlockRequest(hash, pfrom.GetId());
5129 : : // mapBlockSource is only used for punishing peers and setting
5130 : : // which peers send us compact blocks, so the race between here and
5131 : : // cs_main in ProcessNewBlock is fine.
5132 [ + - ]: 18066 : mapBlockSource.emplace(hash, std::make_pair(pfrom.GetId(), true));
5133 : :
5134 : : // Check claimed work on this block against our anti-dos thresholds.
5135 [ + + + - : 18066 : if (prev_block && prev_block->nChainWork + GetBlockProof(*pblock) >= GetAntiDoSWorkThreshold()) {
+ - + - +
+ ]
5136 : : min_pow_checked = true;
5137 : : }
5138 : 0 : }
5139 [ + - + - ]: 36132 : ProcessBlock(pfrom, pblock, forceProcessing, min_pow_checked);
5140 : 18066 : return;
5141 : 19055 : }
5142 : :
5143 [ + + ]: 9817 : if (msg_type == NetMsgType::GETADDR) {
5144 : : // This asymmetric behavior for inbound and outbound connections was introduced
5145 : : // to prevent a fingerprinting attack: an attacker can send specific fake addresses
5146 : : // to users' AddrMan and later request them by sending getaddr messages.
5147 : : // Making nodes which are behind NAT and can only make outgoing connections ignore
5148 : : // the getaddr message mitigates the attack.
5149 [ + + ]: 569 : if (!pfrom.IsInboundConn()) {
5150 [ - + - - ]: 134 : LogDebug(BCLog::NET, "Ignoring \"getaddr\" from %s connection. peer=%d\n", pfrom.ConnectionTypeAsString(), pfrom.GetId());
5151 : 134 : return;
5152 : : }
5153 : :
5154 : : // Since this must be an inbound connection, SetupAddressRelay will
5155 : : // never fail.
5156 [ - + ]: 435 : Assume(SetupAddressRelay(pfrom, peer));
5157 : :
5158 : : // Only send one GetAddr response per connection to reduce resource waste
5159 : : // and discourage addr stamping of INV announcements.
5160 [ + + ]: 435 : if (peer.m_getaddr_recvd) {
5161 [ - + ]: 136 : LogDebug(BCLog::NET, "Ignoring repeated \"getaddr\". peer=%d\n", pfrom.GetId());
5162 : 136 : return;
5163 : : }
5164 : 299 : peer.m_getaddr_recvd = true;
5165 : :
5166 : 299 : peer.m_addrs_to_send.clear();
5167 : 299 : std::vector<CAddress> vAddr;
5168 [ + + ]: 299 : if (pfrom.HasPermission(NetPermissionFlags::Addr)) {
5169 [ + - ]: 138 : vAddr = m_connman.GetAddressesUnsafe(MAX_ADDR_TO_SEND, MAX_PCT_ADDR_TO_SEND, /*network=*/std::nullopt);
5170 : : } else {
5171 [ + - ]: 460 : vAddr = m_connman.GetAddresses(pfrom, MAX_ADDR_TO_SEND, MAX_PCT_ADDR_TO_SEND);
5172 : : }
5173 [ + + ]: 3773 : for (const CAddress &addr : vAddr) {
5174 [ + - ]: 3474 : PushAddress(peer, addr);
5175 : : }
5176 : 299 : return;
5177 : 299 : }
5178 : :
5179 [ + + ]: 9248 : if (msg_type == NetMsgType::MEMPOOL) {
5180 : : // Only process received mempool messages if we advertise NODE_BLOOM
5181 : : // or if the peer has mempool permissions.
5182 [ + + + + ]: 402 : if (!(peer.m_our_services & NODE_BLOOM) && !pfrom.HasPermission(NetPermissionFlags::Mempool))
5183 : : {
5184 [ + + ]: 121 : if (!pfrom.HasPermission(NetPermissionFlags::NoBan))
5185 : : {
5186 [ - + - - ]: 9 : LogDebug(BCLog::NET, "mempool request with bloom filters disabled, %s", pfrom.DisconnectMsg());
5187 : 9 : pfrom.fDisconnect = true;
5188 : : }
5189 : 121 : return;
5190 : : }
5191 : :
5192 [ - + - - ]: 281 : if (m_connman.OutboundTargetReached(false) && !pfrom.HasPermission(NetPermissionFlags::Mempool))
5193 : : {
5194 [ # # ]: 0 : if (!pfrom.HasPermission(NetPermissionFlags::NoBan))
5195 : : {
5196 [ # # # # ]: 0 : LogDebug(BCLog::NET, "mempool request with bandwidth limit reached, %s", pfrom.DisconnectMsg());
5197 : 0 : pfrom.fDisconnect = true;
5198 : : }
5199 : 0 : return;
5200 : : }
5201 : :
5202 [ + + ]: 281 : if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
5203 : 183 : LOCK(tx_relay->m_tx_inventory_mutex);
5204 [ + - ]: 183 : tx_relay->m_send_mempool = true;
5205 : 183 : }
5206 : 281 : return;
5207 : : }
5208 : :
5209 [ + + ]: 8846 : if (msg_type == NetMsgType::PING) {
5210 [ + + ]: 289 : if (pfrom.GetCommonVersion() > BIP0031_VERSION) {
5211 : 179 : uint64_t nonce = 0;
5212 : 179 : vRecv >> nonce;
5213 : : // Echo the message back with the nonce. This allows for two useful features:
5214 : : //
5215 : : // 1) A remote node can quickly check if the connection is operational
5216 : : // 2) Remote nodes can measure the latency of the network thread. If this node
5217 : : // is overloaded it won't respond to pings quickly and the remote node can
5218 : : // avoid sending us more work, like chain download requests.
5219 : : //
5220 : : // The nonce stops the remote getting confused between different pings: without
5221 : : // it, if the remote node sends a ping once per second and this node takes 5
5222 : : // seconds to respond to each, the 5th ping the remote sends would appear to
5223 : : // return very quickly.
5224 [ + - ]: 284 : MakeAndPushMessage(pfrom, NetMsgType::PONG, nonce);
5225 : : }
5226 : 252 : return;
5227 : : }
5228 : :
5229 [ + + ]: 8557 : if (msg_type == NetMsgType::PONG) {
5230 : 468 : ProcessPong(pfrom, peer, /*ping_end=*/time_received, vRecv);
5231 : 468 : return;
5232 : : }
5233 : :
5234 [ + + ]: 8089 : if (msg_type == NetMsgType::FILTERLOAD) {
5235 [ + + ]: 1242 : if (!(peer.m_our_services & NODE_BLOOM)) {
5236 [ - + - - ]: 19 : LogDebug(BCLog::NET, "filterload received despite not offering bloom services, %s", pfrom.DisconnectMsg());
5237 : 19 : pfrom.fDisconnect = true;
5238 : 19 : return;
5239 : : }
5240 [ + + ]: 1223 : CBloomFilter filter;
5241 [ + + ]: 1223 : vRecv >> filter;
5242 : :
5243 [ + - + + ]: 934 : if (!filter.IsWithinSizeConstraints())
5244 : : {
5245 : : // There is no excuse for sending a too-large filter
5246 [ + - + - ]: 252 : Misbehaving(peer, "too-large bloom filter");
5247 [ + - + + ]: 808 : } else if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
5248 : 717 : {
5249 [ + - ]: 717 : LOCK(tx_relay->m_bloom_filter_mutex);
5250 [ + - + - : 717 : tx_relay->m_bloom_filter.reset(new CBloomFilter(filter));
+ + ]
5251 [ + - ]: 717 : tx_relay->m_relay_txs = true;
5252 : 0 : }
5253 [ + - ]: 717 : pfrom.m_bloom_filter_loaded = true;
5254 : 717 : pfrom.m_relays_txs = true;
5255 [ + - ]: 717 : MaybeDisconnectForTxRelayCapacity(pfrom, msg_type);
5256 : : }
5257 : 934 : return;
5258 : 1223 : }
5259 : :
5260 [ + + ]: 6847 : if (msg_type == NetMsgType::FILTERADD) {
5261 [ + + ]: 882 : if (!(peer.m_our_services & NODE_BLOOM)) {
5262 [ - + - - ]: 21 : LogDebug(BCLog::NET, "filteradd received despite not offering bloom services, %s", pfrom.DisconnectMsg());
5263 : 21 : pfrom.fDisconnect = true;
5264 : 21 : return;
5265 : : }
5266 : 861 : std::vector<unsigned char> vData;
5267 [ + + ]: 861 : vRecv >> vData;
5268 : :
5269 : : // Nodes must NEVER send a data item > MAX_SCRIPT_ELEMENT_SIZE bytes (the max size for a script data object,
5270 : : // and thus, the maximum size any matched object can have) in a filteradd message
5271 : 569 : bool bad = false;
5272 [ - + + + ]: 569 : if (vData.size() > MAX_SCRIPT_ELEMENT_SIZE) {
5273 : : bad = true;
5274 [ + - + + ]: 513 : } else if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
5275 [ + - ]: 433 : LOCK(tx_relay->m_bloom_filter_mutex);
5276 [ + + ]: 433 : if (tx_relay->m_bloom_filter) {
5277 [ - + + - ]: 311 : tx_relay->m_bloom_filter->insert(vData);
5278 : : } else {
5279 : : bad = true;
5280 : : }
5281 : 0 : }
5282 [ + + ]: 433 : if (bad) {
5283 [ + - + - ]: 356 : Misbehaving(peer, "bad filteradd message");
5284 : : }
5285 : 569 : return;
5286 : 861 : }
5287 : :
5288 [ + + ]: 5965 : if (msg_type == NetMsgType::FILTERCLEAR) {
5289 [ + + ]: 329 : if (!(peer.m_our_services & NODE_BLOOM)) {
5290 [ - + - - ]: 24 : LogDebug(BCLog::NET, "filterclear received despite not offering bloom services, %s", pfrom.DisconnectMsg());
5291 : 24 : pfrom.fDisconnect = true;
5292 : 24 : return;
5293 : : }
5294 : 305 : auto tx_relay = peer.GetTxRelay();
5295 [ + + ]: 305 : if (!tx_relay) return;
5296 : :
5297 : 199 : {
5298 : 199 : LOCK(tx_relay->m_bloom_filter_mutex);
5299 [ + + ]: 199 : tx_relay->m_bloom_filter = nullptr;
5300 [ + - ]: 199 : tx_relay->m_relay_txs = true;
5301 : 199 : }
5302 : 199 : pfrom.m_bloom_filter_loaded = false;
5303 : 199 : pfrom.m_relays_txs = true;
5304 : 199 : MaybeDisconnectForTxRelayCapacity(pfrom, msg_type);
5305 : 199 : return;
5306 : : }
5307 : :
5308 [ + + ]: 5636 : if (msg_type == NetMsgType::FEEFILTER) {
5309 : 417 : CAmount newFeeFilter = 0;
5310 : 417 : vRecv >> newFeeFilter;
5311 [ + + ]: 388 : if (MoneyRange(newFeeFilter)) {
5312 [ + + ]: 189 : if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
5313 : 117 : tx_relay->m_fee_filter_received = newFeeFilter;
5314 : : }
5315 [ - + - - ]: 189 : LogDebug(BCLog::NET, "received: feefilter of %s from peer=%d\n", CFeeRate(newFeeFilter).ToString(), pfrom.GetId());
5316 : : }
5317 : 388 : return;
5318 : : }
5319 : :
5320 [ + + ]: 5219 : if (msg_type == NetMsgType::GETCFILTERS) {
5321 : 103 : ProcessGetCFilters(pfrom, peer, vRecv);
5322 : 103 : return;
5323 : : }
5324 : :
5325 [ + + ]: 5116 : if (msg_type == NetMsgType::GETCFHEADERS) {
5326 : 106 : ProcessGetCFHeaders(pfrom, peer, vRecv);
5327 : 106 : return;
5328 : : }
5329 : :
5330 [ + + ]: 5010 : if (msg_type == NetMsgType::GETCFCHECKPT) {
5331 : 87 : ProcessGetCFCheckPt(pfrom, peer, vRecv);
5332 : 87 : return;
5333 : : }
5334 : :
5335 [ + + ]: 4923 : if (msg_type == NetMsgType::NOTFOUND) {
5336 : 781 : std::vector<CInv> vInv;
5337 [ + + ]: 781 : vRecv >> vInv;
5338 : 470 : std::vector<GenTxid> tx_invs;
5339 [ - + + + ]: 470 : if (vInv.size() <= node::MAX_PEER_TX_ANNOUNCEMENTS + MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
5340 [ + + ]: 22602 : for (CInv &inv : vInv) {
5341 [ + + ]: 44268 : if (inv.IsGenTxMsg()) {
5342 [ + - + - ]: 5029 : tx_invs.emplace_back(ToGenTxid(inv));
5343 : : }
5344 : : }
5345 : : }
5346 [ + - ]: 470 : LOCK(m_tx_download_mutex);
5347 [ + - ]: 470 : m_txdownloadman.ReceivedNotFound(pfrom.GetId(), tx_invs);
5348 [ + - ]: 470 : return;
5349 : 781 : }
5350 : :
5351 : : // Ignore unknown message types for extensibility
5352 [ - + - - : 4142 : LogDebug(BCLog::NET, "Unknown message type \"%s\" from peer=%d", SanitizeString(msg_type), pfrom.GetId());
- - ]
5353 : : return;
5354 : : }
5355 : :
5356 : 1545862 : bool PeerManagerImpl::MaybeDiscourageAndDisconnect(CNode& pnode, Peer& peer)
5357 : : {
5358 : 1545862 : {
5359 : 1545862 : LOCK(peer.m_misbehavior_mutex);
5360 : :
5361 : : // There's nothing to do if the m_should_discourage flag isn't set
5362 [ + + + - ]: 1545862 : if (!peer.m_should_discourage) return false;
5363 : :
5364 [ + - ]: 48217 : peer.m_should_discourage = false;
5365 : 1497645 : } // peer.m_misbehavior_mutex
5366 : :
5367 [ + + ]: 48217 : if (pnode.HasPermission(NetPermissionFlags::NoBan)) {
5368 : : // We never disconnect or discourage peers for bad behavior if they have NetPermissionFlags::NoBan permission
5369 : 8057 : LogWarning("Not punishing noban peer %d!", peer.m_id);
5370 : 8057 : return false;
5371 : : }
5372 : :
5373 [ + + ]: 40160 : if (pnode.IsManualConn()) {
5374 : : // We never disconnect or discourage manual peers for bad behavior
5375 : 33459 : LogWarning("Not punishing manually connected peer %d!", peer.m_id);
5376 : 33459 : return false;
5377 : : }
5378 : :
5379 [ + + ]: 6701 : if (pnode.addr.IsLocal()) {
5380 : : // We disconnect local peers for bad behavior but don't discourage (since that would discourage
5381 : : // all peers on the same local address)
5382 [ - + - - ]: 41 : LogDebug(BCLog::NET, "Warning: disconnecting but not discouraging %s peer %d!\n",
5383 : : pnode.m_inbound_onion ? "inbound onion" : "local", peer.m_id);
5384 : 41 : pnode.fDisconnect = true;
5385 : 41 : return true;
5386 : : }
5387 : :
5388 : : // Normal case: Disconnect the peer and discourage all nodes sharing the address
5389 [ - + ]: 6660 : LogDebug(BCLog::NET, "Disconnecting and discouraging peer %d!\n", peer.m_id);
5390 [ - + ]: 6660 : if (m_banman) m_banman->Discourage(pnode.addr);
5391 : 6660 : m_connman.DisconnectNode(pnode.addr);
5392 : 6660 : return true;
5393 : : }
5394 : :
5395 : 24593 : bool PeerManagerImpl::MaybeDisconnectForTxRelayCapacity(CNode& node, const std::string& msg_type, std::optional<NodeId> protect_peer)
5396 : : {
5397 [ + + + + ]: 24593 : if (!node.IsInboundConn() || !node.m_relays_txs) return false;
5398 [ - + ]: 8154 : if (m_connman.EvictTxPeerIfFull(protect_peer)) return false;
5399 : :
5400 [ # # ]: 0 : LogDebug(BCLog::NET, "failed to find a tx-relaying eviction candidate - connection dropped after %s message, peer=%d\n", msg_type, node.GetId());
5401 : 0 : node.fDisconnect = true;
5402 : 0 : return true;
5403 : : }
5404 : :
5405 : 1519143 : bool PeerManagerImpl::ProcessMessages(CNode& node, std::atomic<bool>& interruptMsgProc)
5406 : : {
5407 : 1519143 : AssertLockNotHeld(m_tx_download_mutex);
5408 : 1519143 : AssertLockHeld(g_msgproc_mutex);
5409 : :
5410 : 1519143 : PeerRef maybe_peer{GetPeerRef(node.GetId())};
5411 [ + - ]: 1519143 : if (maybe_peer == nullptr) return false;
5412 [ + + ]: 1519143 : Peer& peer{*maybe_peer};
5413 : :
5414 : : // For outbound connections, ensure that the initial VERSION message
5415 : : // has been sent first before processing any incoming messages
5416 [ + + + + ]: 1519143 : if (!node.IsInboundConn() && !peer.m_outbound_version_message_sent) return false;
5417 : :
5418 : 1517487 : {
5419 [ + - ]: 1517487 : LOCK(peer.m_getdata_requests_mutex);
5420 [ + + ]: 1517487 : if (!peer.m_getdata_requests.empty()) {
5421 [ + - ]: 1050095 : ProcessGetData(node, peer, interruptMsgProc);
5422 : : }
5423 : 0 : }
5424 : :
5425 [ + - ]: 1517487 : const bool processed_orphan = ProcessOrphanTx(peer);
5426 : :
5427 [ + + ]: 1517487 : if (node.fDisconnect)
5428 : : return false;
5429 : :
5430 [ + + ]: 1470813 : if (processed_orphan) return true;
5431 : :
5432 : : // this maintains the order of responses
5433 : : // and prevents m_getdata_requests to grow unbounded
5434 : 1470681 : {
5435 [ + - ]: 1470681 : LOCK(peer.m_getdata_requests_mutex);
5436 [ + + + - ]: 1470681 : if (!peer.m_getdata_requests.empty()) return true;
5437 : 1047905 : }
5438 : :
5439 : : // Don't bother if send buffer is too full to respond anyway
5440 [ + + ]: 422776 : if (node.fPauseSend) return false;
5441 : :
5442 [ + - ]: 422440 : auto poll_result{node.PollMessage()};
5443 [ + + ]: 422440 : if (!poll_result) {
5444 : : // No message to process
5445 : : return false;
5446 : : }
5447 : :
5448 [ - + ]: 413675 : CNetMessage& msg{poll_result->first};
5449 : 413675 : bool fMoreWork = poll_result->second;
5450 : :
5451 : : TRACEPOINT(net, inbound_message,
5452 : : node.GetId(),
5453 : : node.m_addr_name.c_str(),
5454 : : node.ConnectionTypeAsString().c_str(),
5455 : : msg.m_type.c_str(),
5456 : : msg.m_recv.size(),
5457 : : msg.m_recv.data()
5458 : 413675 : );
5459 : :
5460 [ - + ]: 413675 : if (m_opts.capture_messages) {
5461 [ # # ]: 0 : CaptureMessage(node.addr, msg.m_type, MakeUCharSpan(msg.m_recv), /*is_incoming=*/true);
5462 : : }
5463 : :
5464 : 413675 : try {
5465 [ + + ]: 413675 : ProcessMessage(peer, node, msg.m_type, msg.m_recv, msg.m_time, interruptMsgProc);
5466 [ + - ]: 400470 : if (interruptMsgProc) return false;
5467 : 400470 : {
5468 [ + - ]: 400470 : LOCK(peer.m_getdata_requests_mutex);
5469 [ + + ]: 400470 : if (!peer.m_getdata_requests.empty()) fMoreWork = true;
5470 : 400470 : }
5471 : : // Does this peer have an orphan ready to reconsider?
5472 : : // (Note: we may have provided a parent for an orphan provided
5473 : : // by another peer that was already processed; in that case,
5474 : : // the extra work may not be noticed, possibly resulting in an
5475 : : // unnecessary 100ms delay)
5476 [ + - ]: 400470 : LOCK(m_tx_download_mutex);
5477 [ + - + + ]: 400470 : if (m_txdownloadman.HaveMoreWork(peer.m_id)) fMoreWork = true;
5478 [ + - ]: 413675 : } catch (const std::exception& e) {
5479 : 13205 : 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());
[ + - - +
- - - - -
- - - ]
5480 : 13205 : } catch (...) {
5481 [ - - - - : 0 : LogDebug(BCLog::NET, "%s(%s, %u bytes): Unknown exception caught\n", __func__, SanitizeString(msg.m_type), msg.m_message_size);
- - - - -
- ]
5482 [ - - ]: 0 : }
5483 : :
5484 : : return fMoreWork;
5485 : 1941583 : }
5486 : :
5487 : 1403542 : void PeerManagerImpl::ConsiderEviction(CNode& pto, Peer& peer, std::chrono::seconds time_in_seconds)
5488 : : {
5489 : 1403542 : AssertLockHeld(cs_main);
5490 : :
5491 : 1403542 : CNodeState &state = *State(pto.GetId());
5492 : :
5493 [ + + + + : 1403542 : if (!state.m_chain_sync.m_protect && pto.IsOutboundOrBlockRelayConn() && state.fSyncStarted) {
+ + ]
5494 : : // This is an outbound peer subject to disconnection if they don't
5495 : : // announce a block with as much work as the current tip within
5496 : : // CHAIN_SYNC_TIMEOUT + HEADERS_RESPONSE_TIME seconds (note: if
5497 : : // their chain has more work than ours, we should sync to it,
5498 : : // unless it's invalid, in which case we should find that out and
5499 : : // disconnect from them elsewhere).
5500 [ + + - + : 42295 : if (state.pindexBestKnownBlock != nullptr && state.pindexBestKnownBlock->nChainWork >= m_chainman.ActiveChain().Tip()->nChainWork) {
+ + ]
5501 : : // 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
5502 [ + + ]: 928 : if (state.m_chain_sync.m_timeout != 0s) {
5503 : 33 : state.m_chain_sync.m_timeout = 0s;
5504 : 33 : state.m_chain_sync.m_work_header = nullptr;
5505 : 33 : state.m_chain_sync.m_sent_getheaders = false;
5506 : : }
5507 [ + + + - : 39189 : } 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)) {
+ + - + ]
5508 : : // 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
5509 : : // AND
5510 : : // we are noticing this for the first time (m_timeout is 0)
5511 : : // OR we noticed this at some point within the last CHAIN_SYNC_TIMEOUT + HEADERS_RESPONSE_TIME seconds and set a timeout
5512 : : // 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).
5513 : : // Either way, set a new timeout based on our current tip.
5514 : 2405 : state.m_chain_sync.m_timeout = time_in_seconds + CHAIN_SYNC_TIMEOUT;
5515 [ - + ]: 2405 : state.m_chain_sync.m_work_header = m_chainman.ActiveChain().Tip();
5516 : 2405 : state.m_chain_sync.m_sent_getheaders = false;
5517 [ + - + + ]: 36784 : } else if (state.m_chain_sync.m_timeout > 0s && time_in_seconds > state.m_chain_sync.m_timeout) {
5518 : : // No evidence yet that our peer has synced to a chain with work equal to that
5519 : : // of our tip, when we first detected it was behind. Send a single getheaders
5520 : : // message to give the peer a chance to update us.
5521 [ + + ]: 128 : if (state.m_chain_sync.m_sent_getheaders) {
5522 : : // They've run out of time to catch up!
5523 [ + + + - : 11 : LogInfo("Outbound peer has old chain, best known block = %s, %s", state.pindexBestKnownBlock != nullptr ? state.pindexBestKnownBlock->GetBlockHash().ToString() : "<none>", pto.DisconnectMsg());
+ - + - ]
5524 : 11 : pto.fDisconnect = true;
5525 : : } else {
5526 [ - + ]: 117 : assert(state.m_chain_sync.m_work_header);
5527 : : // Here, we assume that the getheaders message goes out,
5528 : : // because it'll either go out or be skipped because of a
5529 : : // getheaders in-flight already, in which case the peer should
5530 : : // still respond to us with a sufficiently high work chain tip.
5531 [ + - ]: 117 : MaybeSendGetHeaders(pto,
5532 : 117 : GetLocator(state.m_chain_sync.m_work_header->pprev),
5533 : : peer);
5534 [ - + - - : 117 : 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());
- - - - -
- ]
5535 : 117 : state.m_chain_sync.m_sent_getheaders = true;
5536 : : // Bump the timeout to allow a response, which could clear the timeout
5537 : : // (if the response shows the peer has synced), reset the timeout (if
5538 : : // the peer syncs to the required work but not to our tip), or result
5539 : : // in disconnect (if we advance to the timeout and pindexBestKnownBlock
5540 : : // has not sufficiently progressed)
5541 : 117 : state.m_chain_sync.m_timeout = time_in_seconds + HEADERS_RESPONSE_TIME;
5542 : : }
5543 : : }
5544 : : }
5545 : 1403542 : }
5546 : :
5547 : 0 : void PeerManagerImpl::EvictExtraOutboundPeers(NodeClock::time_point now)
5548 : : {
5549 : : // If we have any extra block-relay-only peers, disconnect the youngest unless
5550 : : // it's given us a block -- in which case, compare with the second-youngest, and
5551 : : // out of those two, disconnect the peer who least recently gave us a block.
5552 : : // The youngest block-relay-only peer would be the extra peer we connected
5553 : : // to temporarily in order to sync our tip; see net.cpp.
5554 : : // Note that we use higher nodeid as a measure for most recent connection.
5555 [ # # ]: 0 : if (m_connman.GetExtraBlockRelayCount() > 0) {
5556 : 0 : std::pair<NodeId, std::chrono::seconds> youngest_peer{-1, 0}, next_youngest_peer{-1, 0};
5557 : :
5558 [ # # ]: 0 : m_connman.ForEachNode([&](CNode* pnode) {
5559 [ # # # # ]: 0 : if (!pnode->IsBlockOnlyConn() || pnode->fDisconnect) return;
5560 [ # # ]: 0 : if (pnode->GetId() > youngest_peer.first) {
5561 : 0 : next_youngest_peer = youngest_peer;
5562 : 0 : youngest_peer.first = pnode->GetId();
5563 : 0 : youngest_peer.second = pnode->m_last_block_time;
5564 : : }
5565 : : });
5566 : 0 : NodeId to_disconnect = youngest_peer.first;
5567 [ # # ]: 0 : if (youngest_peer.second > next_youngest_peer.second) {
5568 : : // Our newest block-relay-only peer gave us a block more recently;
5569 : : // disconnect our second youngest.
5570 : 0 : to_disconnect = next_youngest_peer.first;
5571 : : }
5572 [ # # ]: 0 : m_connman.ForNode(to_disconnect, [&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
5573 : 0 : AssertLockHeld(::cs_main);
5574 : : // Make sure we're not getting a block right now, and that
5575 : : // we've been connected long enough for this eviction to happen
5576 : : // at all.
5577 : : // Note that we only request blocks from a peer if we learn of a
5578 : : // valid headers chain with at least as much work as our tip.
5579 : 0 : CNodeState *node_state = State(pnode->GetId());
5580 [ # # # # ]: 0 : if (node_state == nullptr ||
5581 [ # # ]: 0 : (now - pnode->m_connected >= MINIMUM_CONNECT_TIME && node_state->vBlocksInFlight.empty())) {
5582 : 0 : pnode->fDisconnect = true;
5583 [ # # ]: 0 : LogDebug(BCLog::NET, "disconnecting extra block-relay-only peer=%d (last block received at time %d)\n",
5584 : : pnode->GetId(), count_seconds(pnode->m_last_block_time));
5585 : 0 : return true;
5586 : : } else {
5587 [ # # ]: 0 : LogDebug(BCLog::NET, "keeping block-relay-only peer=%d chosen for eviction (connect time: %d, blocks_in_flight: %d)\n",
5588 : : pnode->GetId(), TicksSinceEpoch<std::chrono::seconds>(pnode->m_connected), node_state->vBlocksInFlight.size());
5589 : : }
5590 : : return false;
5591 : : });
5592 : : }
5593 : :
5594 : : // Check whether we have too many outbound-full-relay peers
5595 [ # # ]: 0 : if (m_connman.GetExtraFullOutboundCount() > 0) {
5596 : : // If we have more outbound-full-relay peers than we target, disconnect one.
5597 : : // Pick the outbound-full-relay peer that least recently announced
5598 : : // us a new block, with ties broken by choosing the more recent
5599 : : // connection (higher node id)
5600 : : // Protect peers from eviction if we don't have another connection
5601 : : // to their network, counting both outbound-full-relay and manual peers.
5602 : 0 : NodeId worst_peer = -1;
5603 : 0 : int64_t oldest_block_announcement = std::numeric_limits<int64_t>::max();
5604 : :
5605 [ # # ]: 0 : m_connman.ForEachNode([&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main, m_connman.GetNodesMutex()) {
5606 : 0 : AssertLockHeld(::cs_main);
5607 : :
5608 : : // Only consider outbound-full-relay peers that are not already
5609 : : // marked for disconnection
5610 [ # # # # ]: 0 : if (!pnode->IsFullOutboundConn() || pnode->fDisconnect) return;
5611 : 0 : CNodeState *state = State(pnode->GetId());
5612 [ # # ]: 0 : if (state == nullptr) return; // shouldn't be possible, but just in case
5613 : : // Don't evict our protected peers
5614 [ # # ]: 0 : if (state->m_chain_sync.m_protect) return;
5615 : : // If this is the only connection on a particular network that is
5616 : : // OUTBOUND_FULL_RELAY or MANUAL, protect it.
5617 [ # # ]: 0 : if (!m_connman.MultipleManualOrFullOutboundConns(pnode->addr.GetNetwork())) return;
5618 [ # # # # : 0 : if (state->m_last_block_announcement < oldest_block_announcement || (state->m_last_block_announcement == oldest_block_announcement && pnode->GetId() > worst_peer)) {
# # ]
5619 : 0 : worst_peer = pnode->GetId();
5620 : 0 : oldest_block_announcement = state->m_last_block_announcement;
5621 : : }
5622 : : });
5623 [ # # ]: 0 : if (worst_peer != -1) {
5624 [ # # ]: 0 : bool disconnected = m_connman.ForNode(worst_peer, [&](CNode* pnode) EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
5625 : 0 : AssertLockHeld(::cs_main);
5626 : :
5627 : : // Only disconnect a peer that has been connected to us for
5628 : : // some reasonable fraction of our check-frequency, to give
5629 : : // it time for new information to have arrived.
5630 : : // Also don't disconnect any peer we're trying to download a
5631 : : // block from.
5632 : 0 : CNodeState &state = *State(pnode->GetId());
5633 [ # # # # ]: 0 : if (now - pnode->m_connected > MINIMUM_CONNECT_TIME && state.vBlocksInFlight.empty()) {
5634 [ # # ]: 0 : LogDebug(BCLog::NET, "disconnecting extra outbound peer=%d (last block announcement received at time %d)\n", pnode->GetId(), oldest_block_announcement);
5635 : 0 : pnode->fDisconnect = true;
5636 : 0 : return true;
5637 : : } else {
5638 [ # # ]: 0 : LogDebug(BCLog::NET, "keeping outbound peer=%d chosen for eviction (connect time: %d, blocks_in_flight: %d)\n",
5639 : : pnode->GetId(), TicksSinceEpoch<std::chrono::seconds>(pnode->m_connected), state.vBlocksInFlight.size());
5640 : 0 : return false;
5641 : : }
5642 : : });
5643 [ # # ]: 0 : if (disconnected) {
5644 : : // If we disconnected an extra peer, that means we successfully
5645 : : // connected to at least one peer after the last time we
5646 : : // detected a stale tip. Don't try any more extra peers until
5647 : : // we next detect a stale tip, to limit the load we put on the
5648 : : // network from these extra connections.
5649 : 0 : m_connman.SetTryNewOutboundPeer(false);
5650 : : }
5651 : : }
5652 : : }
5653 : 0 : }
5654 : :
5655 : 0 : void PeerManagerImpl::CheckForStaleTipAndEvictPeers()
5656 : : {
5657 : 0 : LOCK(cs_main);
5658 : :
5659 : 0 : const auto current_time{NodeClock::now()};
5660 : 0 : auto now{GetTime<std::chrono::seconds>()};
5661 : :
5662 [ # # ]: 0 : EvictExtraOutboundPeers(current_time);
5663 : :
5664 [ # # ]: 0 : if (now > m_stale_tip_check_time) {
5665 : : // Check whether our tip is stale, and if so, allow using an extra
5666 : : // outbound peer
5667 [ # # # # : 0 : if (!m_chainman.m_blockman.LoadingBlocks() && m_connman.GetNetworkActive() && m_connman.GetUseAddrmanOutgoing() && TipMayBeStale()) {
# # # # ]
5668 [ # # ]: 0 : LogInfo("Potential stale tip detected, will try using extra outbound peer (last tip update: %d seconds ago)\n",
5669 : : count_seconds(now - m_last_tip_update.load()));
5670 [ # # ]: 0 : m_connman.SetTryNewOutboundPeer(true);
5671 [ # # # # ]: 0 : } else if (m_connman.GetTryNewOutboundPeer()) {
5672 [ # # ]: 0 : m_connman.SetTryNewOutboundPeer(false);
5673 : : }
5674 : 0 : m_stale_tip_check_time = now + STALE_CHECK_INTERVAL;
5675 : : }
5676 : :
5677 [ # # # # : 0 : if (!m_initial_sync_finished && CanDirectFetch()) {
# # ]
5678 [ # # ]: 0 : m_connman.StartExtraBlockRelayPeers();
5679 : 0 : m_initial_sync_finished = true;
5680 : : }
5681 : 0 : }
5682 : :
5683 : 1407780 : void PeerManagerImpl::MaybeSendPing(CNode& node_to, Peer& peer, NodeClock::time_point now)
5684 : : {
5685 [ + + ]: 1505466 : if (m_connman.ShouldRunInactivityChecks(node_to, now) &&
5686 [ + + + + : 1455439 : peer.m_ping_nonce_sent &&
+ + ]
5687 [ + + ]: 47659 : now > peer.m_ping_start.load() + TIMEOUT_INTERVAL)
5688 : : {
5689 : : // The ping timeout is using mocktime. To disable the check during
5690 : : // testing, increase -peertimeout.
5691 [ - + - - ]: 3742 : LogDebug(BCLog::NET, "ping timeout: %fs, %s", Ticks<SecondsDouble>(now - peer.m_ping_start.load()), node_to.DisconnectMsg());
5692 : 3742 : node_to.fDisconnect = true;
5693 : 3742 : return;
5694 : : }
5695 : :
5696 : 1404038 : bool pingSend = false;
5697 : :
5698 [ - + ]: 1404038 : if (peer.m_ping_queued) {
5699 : : // RPC ping request by user
5700 : 0 : pingSend = true;
5701 : : }
5702 : :
5703 [ + + + + ]: 1404038 : if (peer.m_ping_nonce_sent == 0 && now > peer.m_ping_start.load() + PING_INTERVAL) {
5704 : : // Ping automatically sent as a latency probe & keepalive.
5705 : : pingSend = true;
5706 : : }
5707 : :
5708 [ + + ]: 1404038 : if (pingSend) {
5709 : 19759 : uint64_t nonce;
5710 : 19759 : do {
5711 : 19759 : nonce = FastRandomContext().rand64();
5712 [ - + ]: 19759 : } while (nonce == 0);
5713 : 19759 : peer.m_ping_queued = false;
5714 : 19759 : peer.m_ping_start = now;
5715 [ + + ]: 19759 : if (node_to.GetCommonVersion() > BIP0031_VERSION) {
5716 : 17775 : peer.m_ping_nonce_sent = nonce;
5717 [ + - ]: 35550 : MakeAndPushMessage(node_to, NetMsgType::PING, nonce);
5718 : : } else {
5719 : : // Peer is too old to support ping message type with nonce, pong will never arrive.
5720 : 1984 : peer.m_ping_nonce_sent = 0;
5721 [ + - ]: 3968 : MakeAndPushMessage(node_to, NetMsgType::PING);
5722 : : }
5723 : : }
5724 : : }
5725 : :
5726 : 1403848 : void PeerManagerImpl::MaybeSendAddr(CNode& node, Peer& peer, std::chrono::microseconds current_time)
5727 : : {
5728 : : // Nothing to do for non-address-relay peers
5729 [ + + ]: 1403848 : if (!peer.m_addr_relay_enabled) return;
5730 : :
5731 : 327999 : LOCK(peer.m_addr_send_times_mutex);
5732 : : // Periodically advertise our local address to the peer.
5733 [ + - + + : 327999 : if (fListen && !m_chainman.IsInitialBlockDownload() &&
+ + ]
5734 [ + + ]: 109598 : peer.m_next_local_addr_send < current_time) {
5735 : : // If we've sent before, clear the bloom filter for the peer, so that our
5736 : : // self-announcement will actually go out.
5737 : : // This might be unnecessary if the bloom filter has already rolled
5738 : : // over since our last self-announcement, but there is only a small
5739 : : // bandwidth cost that we can incur by doing this (which happens
5740 : : // once a day on average).
5741 [ + + ]: 1531 : if (peer.m_next_local_addr_send != 0us) {
5742 [ + - ]: 374 : peer.m_addr_known->reset();
5743 : : }
5744 [ + - - + ]: 1531 : if (std::optional<CService> local_service = GetLocalAddrForPeer(node)) {
5745 : 0 : CAddress local_addr{*local_service, peer.m_our_services, Now<NodeSeconds>()};
5746 [ # # ]: 0 : if (peer.m_next_local_addr_send == 0us) {
5747 : : // Send the initial self-announcement in its own message. This makes sure
5748 : : // rate-limiting with limited start-tokens doesn't ignore it if the first
5749 : : // message ends up containing multiple addresses.
5750 [ # # # # ]: 0 : if (IsAddrCompatible(peer, local_addr)) {
5751 [ # # # # : 0 : std::vector<CAddress> self_announcement{local_addr};
# # ]
5752 [ # # ]: 0 : if (peer.m_wants_addrv2) {
5753 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::ADDRV2, CAddress::V2_NETWORK(self_announcement));
5754 : : } else {
5755 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::ADDR, CAddress::V1_NETWORK(self_announcement));
5756 : : }
5757 : 0 : }
5758 : : } else {
5759 : : // All later self-announcements are sent together with the other addresses.
5760 [ # # ]: 0 : PushAddress(peer, local_addr);
5761 : : }
5762 : 0 : }
5763 : 1531 : peer.m_next_local_addr_send = current_time + m_rng.rand_exp_duration(AVG_LOCAL_ADDRESS_BROADCAST_INTERVAL);
5764 : : }
5765 : :
5766 : : // We sent an `addr` message to this peer recently. Nothing more to do.
5767 [ + + ]: 327999 : if (current_time <= peer.m_next_addr_send) return;
5768 : :
5769 [ - + ]: 10528 : peer.m_next_addr_send = current_time + m_rng.rand_exp_duration(AVG_ADDRESS_BROADCAST_INTERVAL);
5770 : :
5771 [ - + - + ]: 10528 : if (!Assume(peer.m_addrs_to_send.size() <= MAX_ADDR_TO_SEND)) {
5772 : : // Should be impossible since we always check size before adding to
5773 : : // m_addrs_to_send. Recover by trimming the vector.
5774 [ # # ]: 0 : peer.m_addrs_to_send.resize(MAX_ADDR_TO_SEND);
5775 : : }
5776 : :
5777 : : // Remove addr records that the peer already knows about, and add new
5778 : : // addrs to the m_addr_known filter on the same pass.
5779 : 11466 : auto addr_already_known = [&peer](const CAddress& addr) EXCLUSIVE_LOCKS_REQUIRED(g_msgproc_mutex) {
5780 [ - + + - ]: 938 : bool ret = peer.m_addr_known->contains(addr.GetKey());
5781 [ + + - + : 1670 : if (!ret) peer.m_addr_known->insert(addr.GetKey());
+ - ]
5782 : 938 : return ret;
5783 : 10528 : };
5784 : 10528 : peer.m_addrs_to_send.erase(std::remove_if(peer.m_addrs_to_send.begin(), peer.m_addrs_to_send.end(), addr_already_known),
5785 [ + - ]: 10528 : peer.m_addrs_to_send.end());
5786 : :
5787 : : // No addr messages to send
5788 [ + + ]: 10528 : if (peer.m_addrs_to_send.empty()) return;
5789 : :
5790 [ + + ]: 90 : if (peer.m_wants_addrv2) {
5791 [ + - + - ]: 42 : MakeAndPushMessage(node, NetMsgType::ADDRV2, CAddress::V2_NETWORK(peer.m_addrs_to_send));
5792 : : } else {
5793 [ + - + - ]: 138 : MakeAndPushMessage(node, NetMsgType::ADDR, CAddress::V1_NETWORK(peer.m_addrs_to_send));
5794 : : }
5795 : 90 : peer.m_addrs_to_send.clear();
5796 : :
5797 : : // we only send the big addr message once
5798 [ - + + + ]: 90 : if (peer.m_addrs_to_send.capacity() > 40) {
5799 : 5 : peer.m_addrs_to_send.shrink_to_fit();
5800 : : }
5801 : 327999 : }
5802 : :
5803 : 1403848 : void PeerManagerImpl::MaybeSendSendHeaders(CNode& node, Peer& peer)
5804 : : {
5805 : : // Delay sending SENDHEADERS (BIP 130) until we're done with an
5806 : : // initial-headers-sync with this peer. Receiving headers announcements for
5807 : : // new blocks while trying to sync their headers chain is problematic,
5808 : : // because of the state tracking done.
5809 [ + + + + ]: 1403848 : if (!peer.m_sent_sendheaders && node.GetCommonVersion() >= SENDHEADERS_VERSION) {
5810 : 1119134 : LOCK(cs_main);
5811 : 1119134 : CNodeState &state = *State(node.GetId());
5812 [ + + + - ]: 1121727 : if (state.pindexBestKnownBlock != nullptr &&
5813 [ + - + - ]: 2593 : state.pindexBestKnownBlock->nChainWork > m_chainman.MinimumChainWork()) {
5814 : : // Tell our peer we prefer to receive headers rather than inv's
5815 : : // We send this to non-NODE NETWORK peers as well, because even
5816 : : // non-NODE NETWORK peers can announce blocks (such as pruning
5817 : : // nodes)
5818 [ + - + - ]: 2593 : MakeAndPushMessage(node, NetMsgType::SENDHEADERS);
5819 : 2593 : peer.m_sent_sendheaders = true;
5820 : : }
5821 : 1119134 : }
5822 : 1403848 : }
5823 : :
5824 : 1403542 : void PeerManagerImpl::MaybeSendFeefilter(CNode& pto, Peer& peer, std::chrono::microseconds current_time)
5825 : : {
5826 [ + + ]: 1403542 : if (m_opts.ignore_incoming_txs) return;
5827 [ + + ]: 1365788 : if (pto.GetCommonVersion() < FEEFILTER_VERSION) return;
5828 : : // peers with the forcerelay permission should not filter txs to us
5829 [ + + ]: 1302028 : if (pto.HasPermission(NetPermissionFlags::ForceRelay)) return;
5830 : : // Don't send feefilter messages to outbound block-relay-only peers since they should never announce
5831 : : // transactions to us, regardless of feefilter state.
5832 [ + + ]: 1106794 : if (pto.IsBlockOnlyConn()) return;
5833 : :
5834 : 1099071 : CAmount currentFilter = m_mempool.GetMinFee().GetFeePerK();
5835 : :
5836 [ + + ]: 1099071 : if (m_chainman.IsInitialBlockDownload()) {
5837 : : // Received tx-inv messages are discarded when the active
5838 : : // chainstate is in IBD, so tell the peer to not send them.
5839 : : currentFilter = MAX_MONEY;
5840 : : } else {
5841 [ + + + - : 109222 : static const CAmount MAX_FILTER{m_fee_filter_rounder.round(MAX_MONEY)};
+ - ]
5842 [ + + ]: 109222 : if (peer.m_fee_filter_sent == MAX_FILTER) {
5843 : : // Send the current filter if we sent MAX_FILTER previously
5844 : : // and made it out of IBD.
5845 : 1235 : peer.m_next_send_feefilter = 0us;
5846 : : }
5847 : : }
5848 [ + + ]: 1099071 : if (current_time > peer.m_next_send_feefilter) {
5849 : 16609 : CAmount filterToSend = m_fee_filter_rounder.round(currentFilter);
5850 : : // We always have a fee filter of at least the min relay fee
5851 [ + + ]: 16609 : filterToSend = std::max(filterToSend, m_mempool.m_opts.min_relay_feerate.GetFeePerK());
5852 [ + + ]: 16609 : if (filterToSend != peer.m_fee_filter_sent) {
5853 [ + - ]: 13314 : MakeAndPushMessage(pto, NetMsgType::FEEFILTER, filterToSend);
5854 : 13314 : peer.m_fee_filter_sent = filterToSend;
5855 : : }
5856 : 16609 : peer.m_next_send_feefilter = current_time + m_rng.rand_exp_duration(AVG_FEEFILTER_BROADCAST_INTERVAL);
5857 : : }
5858 : : // If the fee filter has changed substantially and it's still more than MAX_FEEFILTER_CHANGE_DELAY
5859 : : // until scheduled broadcast, then move the broadcast to within MAX_FEEFILTER_CHANGE_DELAY.
5860 [ + + ]: 1082462 : else if (current_time + MAX_FEEFILTER_CHANGE_DELAY < peer.m_next_send_feefilter &&
5861 [ + + + - ]: 10963 : (currentFilter < 3 * peer.m_fee_filter_sent / 4 || currentFilter > 4 * peer.m_fee_filter_sent / 3)) {
5862 : 10963 : peer.m_next_send_feefilter = current_time + m_rng.randrange<std::chrono::microseconds>(MAX_FEEFILTER_CHANGE_DELAY);
5863 : : }
5864 : : }
5865 : :
5866 : 99062 : bool PeerManagerImpl::RejectIncomingTxs(const CNode& peer) const
5867 : : {
5868 : : // block-relay-only peers may never send txs to us
5869 [ + + ]: 99062 : if (peer.IsBlockOnlyConn()) return true;
5870 [ + + ]: 97002 : if (peer.IsFeelerConn()) return true;
5871 : : // In -blocksonly mode, peers need the 'relay' permission to send txs to us
5872 [ + + + - ]: 95778 : if (m_opts.ignore_incoming_txs && !peer.HasPermission(NetPermissionFlags::Relay)) return true;
5873 : : return false;
5874 : : }
5875 : :
5876 : 468 : void PeerManagerImpl::ProcessPong(CNode& pfrom, Peer& peer, const NodeClock::time_point ping_end, DataStream& vRecv)
5877 : : {
5878 : 468 : uint64_t nonce = 0;
5879 [ - + ]: 468 : const size_t nAvail{vRecv.size()};
5880 : 468 : bool bPingFinished = false;
5881 [ + + ]: 468 : std::string sProblem;
5882 : :
5883 [ + + ]: 468 : if (nAvail >= sizeof(nonce)) {
5884 [ + - ]: 326 : vRecv >> nonce;
5885 : :
5886 : : // Only process pong message if there is an outstanding ping (old ping without nonce should never pong)
5887 [ + + ]: 326 : if (peer.m_ping_nonce_sent != 0) {
5888 [ - + ]: 223 : if (nonce == peer.m_ping_nonce_sent) {
5889 : : // Matching pong received, this ping is no longer outstanding
5890 : 0 : bPingFinished = true;
5891 [ # # ]: 0 : const auto ping_time = ping_end - peer.m_ping_start.load();
5892 [ # # ]: 0 : if (ping_time.count() >= 0) {
5893 : : // Let connman know about this successful ping-pong
5894 : 0 : pfrom.PongReceived(ping_time);
5895 [ # # ]: 0 : if (pfrom.IsPrivateBroadcastConn()) {
5896 [ # # ]: 0 : m_tx_for_private_broadcast.NodeConfirmedReception(pfrom.GetId());
5897 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Got a PONG (the transaction will probably reach the network), marking for disconnect, %s",
# # # # ]
5898 : : pfrom.LogPeer());
5899 : 0 : pfrom.fDisconnect = true;
5900 : : }
5901 : : } else {
5902 : : // This should never happen
5903 [ # # ]: 0 : sProblem = "Timing mishap";
5904 : : }
5905 : : } else {
5906 : : // Nonce mismatches are normal when pings are overlapping
5907 [ + - ]: 223 : sProblem = "Nonce mismatch";
5908 [ + + ]: 223 : if (nonce == 0) {
5909 : : // This is most likely a bug in another implementation somewhere; cancel this ping
5910 : 57 : bPingFinished = true;
5911 [ + - ]: 57 : sProblem = "Nonce zero";
5912 : : }
5913 : : }
5914 : : } else {
5915 [ + - ]: 103 : sProblem = "Unsolicited pong without ping";
5916 : : }
5917 : : } else {
5918 : : // This is most likely a bug in another implementation somewhere; cancel this ping
5919 : 142 : bPingFinished = true;
5920 [ + - ]: 142 : sProblem = "Short payload";
5921 : : }
5922 : :
5923 [ + - ]: 468 : if (!(sProblem.empty())) {
5924 [ + - - + : 468 : LogDebug(BCLog::NET, "pong peer=%d: %s, %x expected, %x received, %u bytes\n",
- - ]
5925 : : pfrom.GetId(),
5926 : : sProblem,
5927 : : peer.m_ping_nonce_sent,
5928 : : nonce,
5929 : : nAvail);
5930 : : }
5931 [ + + ]: 468 : if (bPingFinished) {
5932 : 199 : peer.m_ping_nonce_sent = 0;
5933 : : }
5934 : 468 : }
5935 : :
5936 : 18730 : bool PeerManagerImpl::SetupAddressRelay(const CNode& node, Peer& peer)
5937 : : {
5938 : : // We don't participate in addr relay with outbound block-relay-only
5939 : : // connections to prevent providing adversaries with the additional
5940 : : // information of addr traffic to infer the link.
5941 [ + + ]: 18730 : if (node.IsBlockOnlyConn()) return false;
5942 : :
5943 : : // We don't participate in addr relay with feeler connections because
5944 : : // they are disconnected shortly after the handshake completes,
5945 : : // before the node will receive the addr response.
5946 [ + + ]: 17384 : if (node.IsFeelerConn()) return false;
5947 : :
5948 [ + + ]: 16482 : if (!peer.m_addr_relay_enabled.exchange(true)) {
5949 : : // During version message processing (non-block-relay-only outbound peers)
5950 : : // or on first addr-related message we have received (inbound peers), initialize
5951 : : // m_addr_known.
5952 : 12001 : peer.m_addr_known = std::make_unique<CRollingBloomFilter>(5000, 0.001);
5953 : : }
5954 : :
5955 : : return true;
5956 : : }
5957 : :
5958 : 5997 : void PeerManagerImpl::ProcessAddrs(std::string_view msg_type, CNode& pfrom, Peer& peer, std::vector<CAddress>&& vAddr, const std::atomic<bool>& interruptMsgProc)
5959 : : {
5960 : 5997 : AssertLockNotHeld(m_peer_mutex);
5961 : 5997 : AssertLockHeld(g_msgproc_mutex);
5962 : :
5963 [ + + ]: 5997 : if (!SetupAddressRelay(pfrom, peer)) {
5964 [ - + - - ]: 119 : LogDebug(BCLog::NET, "ignoring %s message from %s peer=%d\n", msg_type, pfrom.ConnectionTypeAsString(), pfrom.GetId());
5965 : 119 : return;
5966 : : }
5967 : :
5968 [ - + + + ]: 5878 : if (vAddr.size() > MAX_ADDR_TO_SEND)
5969 : : {
5970 [ + - ]: 41 : Misbehaving(peer, strprintf("%s message size = %u", msg_type, vAddr.size()));
5971 : 41 : return;
5972 : : }
5973 : :
5974 : : // Store the new addresses
5975 : 5837 : std::vector<CAddress> vAddrOk;
5976 : :
5977 : : // Update/increment addr rate limiting bucket.
5978 : 5837 : const auto current_time{NodeClock::now()};
5979 [ + + ]: 5837 : if (peer.m_addr_token_bucket < MAX_ADDR_PROCESSING_TOKEN_BUCKET) {
5980 : : // Don't increment bucket if it's already full
5981 : 4742 : const auto time_diff{current_time - peer.m_addr_token_timestamp};
5982 [ + + ]: 4742 : const double increment{std::max(Ticks<SecondsDouble>(time_diff), 0.0) * MAX_ADDR_RATE_PER_SECOND};
5983 [ + + ]: 7905 : peer.m_addr_token_bucket = std::min<double>(peer.m_addr_token_bucket + increment, MAX_ADDR_PROCESSING_TOKEN_BUCKET);
5984 : : }
5985 : 5837 : peer.m_addr_token_timestamp = current_time;
5986 : :
5987 : 5837 : const bool rate_limited = !pfrom.HasPermission(NetPermissionFlags::Addr);
5988 : 5837 : uint64_t num_proc = 0;
5989 : 5837 : uint64_t num_rate_limit = 0;
5990 : 5837 : std::shuffle(vAddr.begin(), vAddr.end(), m_rng);
5991 [ + + ]: 652965 : for (CAddress& addr : vAddr)
5992 : : {
5993 [ - + ]: 647128 : if (interruptMsgProc)
5994 : 0 : return;
5995 : :
5996 : : // Apply rate limiting.
5997 [ + + ]: 647128 : if (peer.m_addr_token_bucket < 1.0) {
5998 [ + + ]: 297559 : if (rate_limited) {
5999 : 129098 : ++num_rate_limit;
6000 : 129098 : continue;
6001 : : }
6002 : : } else {
6003 : 349569 : peer.m_addr_token_bucket -= 1.0;
6004 : : }
6005 : : // We only bother storing full nodes, though this may include
6006 : : // things which we would not make an outbound connection to, in
6007 : : // part because we may make feeler connections to them.
6008 [ + + - + ]: 590124 : if (!MayHaveUsefulAddressDB(addr.nServices) && !HasAllDesirableServiceFlags(addr.nServices))
6009 : 72094 : continue;
6010 : :
6011 [ + + + + ]: 445936 : if (addr.nTime <= NodeSeconds{100000000s} || addr.nTime > current_time + 10min) {
6012 : 284820 : addr.nTime = std::chrono::time_point_cast<std::chrono::seconds>(current_time - 5 * 24h);
6013 : : }
6014 [ + - ]: 445936 : AddAddressKnown(peer, addr);
6015 [ - + - - : 445936 : if (m_banman && (m_banman->IsDiscouraged(addr) || m_banman->IsBanned(addr))) {
- - - - -
- ]
6016 : : // Do not process banned/discouraged addresses beyond remembering we received them
6017 : 0 : continue;
6018 : : }
6019 : 445936 : ++num_proc;
6020 [ + - ]: 445936 : const bool reachable{g_reachable_nets.Contains(addr)};
6021 [ + + + + : 449071 : if (addr.nTime > current_time - 10min && !peer.m_getaddr_sent && vAddr.size() <= 10 && addr.IsRoutable()) {
+ + + - +
+ ]
6022 : : // Relay to a limited number of other nodes
6023 [ + - ]: 1128 : RelayAddress(pfrom.GetId(), addr, reachable);
6024 : : }
6025 : : // Do not store addresses outside our network
6026 [ + - ]: 445936 : if (reachable) {
6027 [ + - ]: 445936 : vAddrOk.push_back(addr);
6028 : : }
6029 : : }
6030 [ + - ]: 5837 : peer.m_addr_processed += num_proc;
6031 : 5837 : peer.m_addr_rate_limited += num_rate_limit;
6032 [ + - - + : 5837 : LogDebug(BCLog::NET, "Received addr: %u addresses (%u processed, %u rate-limited) from peer=%d\n",
- - - - ]
6033 : : vAddr.size(), num_proc, num_rate_limit, pfrom.GetId());
6034 : :
6035 [ + - ]: 5837 : m_addrman.Add(vAddrOk, pfrom.addr, /*time_penalty=*/2h);
6036 [ - + + + ]: 5837 : if (vAddr.size() < 1000) peer.m_getaddr_sent = false;
6037 : :
6038 : : // AddrFetch: Require multiple addresses to avoid disconnecting on self-announcements
6039 [ + + + + ]: 6002 : if (pfrom.IsAddrFetchConn() && vAddr.size() > 1) {
6040 [ + - - + : 38 : LogDebug(BCLog::NET, "addrfetch connection completed, %s", pfrom.DisconnectMsg());
- - - - ]
6041 : 38 : pfrom.fDisconnect = true;
6042 : : }
6043 : 5837 : }
6044 : :
6045 : 1545862 : bool PeerManagerImpl::SendMessages(CNode& node)
6046 : : {
6047 : 1545862 : AssertLockNotHeld(m_tx_download_mutex);
6048 : 1545862 : AssertLockHeld(g_msgproc_mutex);
6049 : :
6050 : 1545862 : PeerRef maybe_peer{GetPeerRef(node.GetId())};
6051 [ + - ]: 1545862 : if (!maybe_peer) return false;
6052 [ + - ]: 1545862 : Peer& peer{*maybe_peer};
6053 : 1545862 : const Consensus::Params& consensusParams = m_chainparams.GetConsensus();
6054 : :
6055 : : // We must call MaybeDiscourageAndDisconnect first, to ensure that we'll
6056 : : // disconnect misbehaving peers even before the version handshake is complete.
6057 [ + - + + ]: 1545862 : if (MaybeDiscourageAndDisconnect(node, peer)) return true;
6058 : :
6059 : : // Initiate version handshake for outbound connections
6060 [ + + + + ]: 1539161 : if (!node.IsInboundConn() && !peer.m_outbound_version_message_sent) {
6061 [ + - ]: 16950 : PushNodeVersion(node, peer);
6062 : 16950 : peer.m_outbound_version_message_sent = true;
6063 : : }
6064 : :
6065 : : // Don't send anything until the version handshake is complete
6066 [ + + + + ]: 1539161 : if (!node.fSuccessfullyConnected || node.fDisconnect)
6067 : 131317 : return true;
6068 : :
6069 : 1407844 : const auto now{NodeClock::now()};
6070 : 1407844 : const auto current_time{GetTime<std::chrono::microseconds>()};
6071 : :
6072 : : // The logic below does not apply to private broadcast peers, so skip it.
6073 : : // Also in CConnman::PushMessage() we make sure that unwanted messages are
6074 : : // not sent. This here is just an optimization.
6075 [ - + ]: 1407844 : if (node.IsPrivateBroadcastConn()) {
6076 [ # # ]: 0 : if (node.m_connected + PRIVATE_BROADCAST_MAX_CONNECTION_LIFETIME < now) {
6077 [ # # # # : 0 : LogDebug(BCLog::PRIVBROADCAST, "Disconnecting: did not complete the transaction send within %d seconds, %s",
# # # # ]
6078 : : count_seconds(PRIVATE_BROADCAST_MAX_CONNECTION_LIFETIME), node.LogPeer());
6079 : 0 : node.fDisconnect = true;
6080 : : }
6081 : 0 : return true;
6082 : : }
6083 : :
6084 [ + + + + ]: 1407844 : if (node.IsAddrFetchConn() && now - node.m_connected > 10 * AVG_ADDRESS_BROADCAST_INTERVAL) {
6085 [ + - - + : 64 : LogDebug(BCLog::NET, "addrfetch connection timeout, %s", node.DisconnectMsg());
- - - - ]
6086 : 64 : node.fDisconnect = true;
6087 : 64 : return true;
6088 : : }
6089 : :
6090 [ + - ]: 1407780 : MaybeSendPing(node, peer, now);
6091 : :
6092 : : // MaybeSendPing may have marked peer for disconnection
6093 [ + + ]: 1407780 : if (node.fDisconnect) return true;
6094 : :
6095 [ + - ]: 1403848 : MaybeSendAddr(node, peer, current_time);
6096 : :
6097 [ + - ]: 1403848 : MaybeSendSendHeaders(node, peer);
6098 : :
6099 [ + - ]: 1403848 : ProcessInvBacklog(now);
6100 : :
6101 : 1403848 : {
6102 [ + - ]: 1403848 : LOCK(cs_main);
6103 : :
6104 : 1403848 : CNodeState &state = *State(node.GetId());
6105 : :
6106 : : // Start block sync
6107 [ - + ]: 1403848 : if (m_chainman.m_best_header == nullptr) {
6108 [ # # # # ]: 0 : m_chainman.m_best_header = m_chainman.ActiveChain().Tip();
6109 : : }
6110 : :
6111 : : // Determine whether we might try initial headers sync or parallel
6112 : : // block download from this peer -- this mostly affects behavior while
6113 : : // in IBD (once out of IBD, we sync from all peers).
6114 : 1403848 : bool sync_blocks_and_headers_from_peer = false;
6115 [ + + ]: 1403848 : if (state.fPreferredDownload) {
6116 : : sync_blocks_and_headers_from_peer = true;
6117 [ + + + + ]: 1077937 : } else if (CanServeBlocks(peer) && !node.IsAddrFetchConn()) {
6118 : : // Typically this is an inbound peer. If we don't have any outbound
6119 : : // peers, or if we aren't downloading any blocks from such peers,
6120 : : // then allow block downloads from this peer, too.
6121 : : // We prefer downloading blocks from outbound peers to avoid
6122 : : // putting undue load on (say) some home user who is just making
6123 : : // outbound connections to the network, but if our only source of
6124 : : // the latest blocks is from an inbound peer, we have to be sure to
6125 : : // eventually download it (and not just wait indefinitely for an
6126 : : // outbound peer to have it).
6127 [ + + + + ]: 576846 : if (m_num_preferred_download_peers == 0 || mapBlocksInFlight.empty()) {
6128 : : sync_blocks_and_headers_from_peer = true;
6129 : : }
6130 : : }
6131 : :
6132 [ + + + + : 1403848 : if (!state.fSyncStarted && CanServeBlocks(peer) && !m_chainman.m_blockman.LoadingBlocks()) {
+ - ]
6133 : : // Only actively request headers from a single peer, unless we're close to today.
6134 [ + + + + : 17250 : if ((nSyncStarted == 0 && sync_blocks_and_headers_from_peer) || m_chainman.m_best_header->Time() > NodeClock::now() - 24h) {
+ + ]
6135 : 10811 : const CBlockIndex* pindexStart = m_chainman.m_best_header;
6136 : : /* If possible, start at the block preceding the currently
6137 : : best known header. This ensures that we always get a
6138 : : non-empty list of headers back as long as the peer
6139 : : is up-to-date. With a non-empty response, we can initialise
6140 : : the peer's known best block. This wouldn't be possible
6141 : : if we requested starting at m_chainman.m_best_header and
6142 : : got back an empty response. */
6143 [ + + ]: 10811 : if (pindexStart->pprev)
6144 : 8136 : pindexStart = pindexStart->pprev;
6145 [ + - + - : 10811 : if (MaybeSendGetHeaders(node, GetLocator(pindexStart), peer)) {
+ + ]
6146 [ + - - + : 7657 : LogDebug(BCLog::NET, "initial getheaders (%d) to peer=%d", pindexStart->nHeight, node.GetId());
- - ]
6147 : :
6148 : 7657 : state.fSyncStarted = true;
6149 : 7657 : peer.m_headers_sync_timeout = current_time + HEADERS_DOWNLOAD_TIMEOUT_BASE +
6150 : : (
6151 : : // Convert HEADERS_DOWNLOAD_TIMEOUT_PER_HEADER to microseconds before scaling
6152 : : // to maintain precision
6153 : 7657 : std::chrono::microseconds{HEADERS_DOWNLOAD_TIMEOUT_PER_HEADER} *
6154 : 7657 : Ticks<std::chrono::seconds>(NodeClock::now() - m_chainman.m_best_header->Time()) / consensusParams.nPowTargetSpacing
6155 : 7657 : );
6156 : 7657 : nSyncStarted++;
6157 : : }
6158 : : }
6159 : : }
6160 : :
6161 : : //
6162 : : // Try sending block announcements via headers
6163 : : //
6164 : 1403848 : {
6165 : : // If we have no more than MAX_BLOCKS_TO_ANNOUNCE in our
6166 : : // list of block hashes we're relaying, and our peer wants
6167 : : // headers announcements, then find the first header
6168 : : // not yet known to our peer but would connect, and send.
6169 : : // If no header would connect, or if we have too many
6170 : : // blocks, or if the peer doesn't want headers, just
6171 : : // add all to the inv queue.
6172 [ + - ]: 1403848 : LOCK(peer.m_block_inv_mutex);
6173 : 1403848 : std::vector<CBlock> vHeaders;
6174 : 2804837 : bool fRevertToInv = ((!peer.m_prefers_headers &&
6175 [ + + + + : 1403848 : (!state.m_requested_hb_cmpctblocks || peer.m_blocks_for_headers_relay.size() > 1)) ||
- + + + ]
6176 [ - + - + ]: 191951 : peer.m_blocks_for_headers_relay.size() > MAX_BLOCKS_TO_ANNOUNCE);
6177 : 1403848 : const CBlockIndex *pBestIndex = nullptr; // last header queued for delivery
6178 [ + - ]: 1403848 : ProcessBlockAvailability(node.GetId()); // ensure pindexBestKnownBlock is up-to-date
6179 : :
6180 [ + + ]: 1403848 : if (!fRevertToInv) {
6181 : 191951 : bool fFoundStartingHeader = false;
6182 : : // Try to find first header that our peer doesn't have, and
6183 : : // then send all headers past that one. If we come across any
6184 : : // headers that aren't on m_chainman.ActiveChain(), give up.
6185 [ + + ]: 192751 : for (const uint256& hash : peer.m_blocks_for_headers_relay) {
6186 [ + - ]: 816 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hash);
6187 [ - + ]: 816 : assert(pindex);
6188 [ + - + - : 1632 : if (m_chainman.ActiveChain()[pindex->nHeight] != pindex) {
+ - ]
6189 : : // Bail out if we reorged away from this block
6190 : : fRevertToInv = true;
6191 : : break;
6192 : : }
6193 [ - + - - ]: 816 : if (pBestIndex != nullptr && pindex->pprev != pBestIndex) {
6194 : : // This means that the list of blocks to announce don't
6195 : : // connect to each other.
6196 : : // This shouldn't really be possible to hit during
6197 : : // regular operation (because reorgs should take us to
6198 : : // a chain that has some block not on the prior chain,
6199 : : // which should be caught by the prior check), but one
6200 : : // way this could happen is by using invalidateblock /
6201 : : // reconsiderblock repeatedly on the tip, causing it to
6202 : : // be added multiple times to m_blocks_for_headers_relay.
6203 : : // Robustly deal with this rare situation by reverting
6204 : : // to an inv.
6205 : : fRevertToInv = true;
6206 : : break;
6207 : : }
6208 : 816 : pBestIndex = pindex;
6209 [ - + ]: 816 : if (fFoundStartingHeader) {
6210 : : // add this to the headers message
6211 [ # # ]: 0 : vHeaders.emplace_back(pindex->GetBlockHeader());
6212 [ + - + + ]: 816 : } else if (PeerHasHeader(&state, pindex)) {
6213 : 764 : continue; // keep looking for the first new block
6214 [ + - + - : 52 : } else if (pindex->pprev == nullptr || PeerHasHeader(&state, pindex->pprev)) {
+ + ]
6215 : : // Peer doesn't have this header but they do have the prior one.
6216 : : // Start sending headers.
6217 : 36 : fFoundStartingHeader = true;
6218 [ + - ]: 36 : vHeaders.emplace_back(pindex->GetBlockHeader());
6219 : : } else {
6220 : : // Peer doesn't have this header or the prior one -- nothing will
6221 : : // connect, so bail out.
6222 : : fRevertToInv = true;
6223 : : break;
6224 : : }
6225 : : }
6226 : : }
6227 [ + + + + ]: 191951 : if (!fRevertToInv && !vHeaders.empty()) {
6228 [ - + + - : 36 : if (vHeaders.size() == 1 && state.m_requested_hb_cmpctblocks) {
- + ]
6229 : : // We only send up to 1 block as header-and-ids, as otherwise
6230 : : // probably means we're doing an initial-ish-sync or they're slow
6231 [ + - - + : 36 : LogDebug(BCLog::NET, "%s sending header-and-ids %s to peer=%d\n", __func__,
- - - - -
- ]
6232 : : vHeaders.front().GetHash().ToString(), node.GetId());
6233 : :
6234 : 36 : std::optional<CSerializedNetMsg> cached_cmpctblock_msg;
6235 : 36 : {
6236 [ + - ]: 36 : LOCK(m_most_recent_block_mutex);
6237 [ + + ]: 36 : if (m_most_recent_block_hash == pBestIndex->GetBlockHash()) {
6238 [ + - + - ]: 12 : cached_cmpctblock_msg = NetMsg::Make(NetMsgType::CMPCTBLOCK, *m_most_recent_compact_block);
6239 : : }
6240 : 0 : }
6241 [ + + ]: 36 : if (cached_cmpctblock_msg.has_value()) {
6242 [ + - ]: 6 : PushMessage(node, std::move(cached_cmpctblock_msg.value()));
6243 : : } else {
6244 : 30 : CBlock block;
6245 [ + - ]: 30 : const bool ret{m_chainman.m_blockman.ReadBlock(block, *pBestIndex)};
6246 [ - + ]: 30 : assert(ret);
6247 [ + - ]: 30 : CBlockHeaderAndShortTxIDs cmpctblock{block, m_rng.rand64()};
6248 [ + - + - ]: 60 : MakeAndPushMessage(node, NetMsgType::CMPCTBLOCK, cmpctblock);
6249 : 30 : }
6250 [ + + ]: 36 : state.pindexBestHeaderSent = pBestIndex;
6251 [ - - ]: 36 : } else if (peer.m_prefers_headers) {
6252 [ # # ]: 0 : if (vHeaders.size() > 1) {
6253 : 0 : LogDebug(BCLog::NET, "%s: %u headers, range (%s, %s), to peer=%d\n", __func__,
[ # # # #
# # # # #
# # # #
# ]
6254 : : vHeaders.size(),
6255 : : vHeaders.front().GetHash().ToString(),
6256 : : vHeaders.back().GetHash().ToString(), node.GetId());
6257 : : } else {
6258 [ # # # # : 0 : LogDebug(BCLog::NET, "%s: sending header %s to peer=%d\n", __func__,
# # # # #
# ]
6259 : : vHeaders.front().GetHash().ToString(), node.GetId());
6260 : : }
6261 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::HEADERS, TX_WITH_WITNESS(vHeaders));
6262 : 0 : state.pindexBestHeaderSent = pBestIndex;
6263 : : } else
6264 : : fRevertToInv = true;
6265 : : }
6266 [ + + ]: 1403848 : if (fRevertToInv) {
6267 : : // If falling back to using an inv, just try to inv the tip.
6268 : : // The last entry in m_blocks_for_headers_relay was our tip at some point
6269 : : // in the past.
6270 [ + + ]: 1211913 : if (!peer.m_blocks_for_headers_relay.empty()) {
6271 : 1024 : const uint256& hashToAnnounce = peer.m_blocks_for_headers_relay.back();
6272 [ + - ]: 1024 : const CBlockIndex* pindex = m_chainman.m_blockman.LookupBlockIndex(hashToAnnounce);
6273 [ - + ]: 1024 : assert(pindex);
6274 : :
6275 : : // Warn if we're announcing a block that is not on the main chain.
6276 : : // This should be very rare and could be optimized out.
6277 : : // Just log for now.
6278 [ + - + - : 2048 : if (m_chainman.ActiveChain()[pindex->nHeight] != pindex) {
- + ]
6279 : 0 : LogDebug(BCLog::NET, "Announcing block %s not on main chain (tip=%s)\n",
[ # # # #
# # # # #
# # # #
# ]
6280 : : hashToAnnounce.ToString(), m_chainman.ActiveChain().Tip()->GetBlockHash().ToString());
6281 : : }
6282 : :
6283 : : // If the peer's chain has this block, don't inv it back.
6284 [ + - + + ]: 1024 : if (!PeerHasHeader(&state, pindex)) {
6285 [ + - ]: 733 : peer.m_blocks_for_inv_relay.push_back(hashToAnnounce);
6286 [ + - - + : 733 : LogDebug(BCLog::NET, "%s: sending inv peer=%d hash=%s\n", __func__,
- - - - ]
6287 : : node.GetId(), hashToAnnounce.ToString());
6288 : : }
6289 : : }
6290 : : }
6291 [ + + ]: 1403848 : peer.m_blocks_for_headers_relay.clear();
6292 [ + - ]: 1403848 : }
6293 : :
6294 : : //
6295 : : // Message: inventory
6296 : : //
6297 : 1403848 : std::vector<CInv> vInv;
6298 : 1403848 : {
6299 [ + - ]: 1403848 : LOCK(peer.m_block_inv_mutex);
6300 [ - + + - ]: 1403848 : vInv.reserve(peer.m_blocks_for_inv_relay.size());
6301 : :
6302 : : // Add blocks
6303 [ + + ]: 1486447 : for (const uint256& hash : peer.m_blocks_for_inv_relay) {
6304 [ + - ]: 82599 : vInv.emplace_back(MSG_BLOCK, hash);
6305 [ - + - + ]: 82599 : if (vInv.size() == MAX_INV_SZ) {
6306 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::INV, vInv);
6307 [ - - ]: 82599 : vInv.clear();
6308 : : }
6309 : : }
6310 [ + + + - ]: 1405023 : peer.m_blocks_for_inv_relay.clear();
6311 : 0 : }
6312 : :
6313 [ + - + + ]: 1403848 : if (auto tx_relay = peer.GetTxRelay(); tx_relay != nullptr) {
6314 [ + - ]: 1280124 : LOCK(tx_relay->m_tx_inventory_mutex);
6315 : : // Check whether periodic sends should happen
6316 [ + + ]: 1280124 : bool fSendTrickle = node.HasPermission(NetPermissionFlags::NoBan);
6317 [ + + ]: 1280124 : if (tx_relay->m_next_inv_send_time < current_time) {
6318 : 17175 : fSendTrickle = true;
6319 [ + + ]: 17175 : if (node.IsInboundConn()) {
6320 [ + - ]: 8456 : tx_relay->m_next_inv_send_time = NextInvToInbounds(current_time, INBOUND_INVENTORY_BROADCAST_INTERVAL, node.m_network_key);
6321 : : } else {
6322 : 8719 : tx_relay->m_next_inv_send_time = current_time + m_rng.rand_exp_duration(OUTBOUND_INVENTORY_BROADCAST_INTERVAL);
6323 : : }
6324 : : }
6325 : :
6326 : : // Time to send but the peer has requested we not relay transactions.
6327 [ + + ]: 1271668 : if (fSendTrickle) {
6328 [ + - ]: 256639 : LOCK(tx_relay->m_bloom_filter_mutex);
6329 [ + + + + : 256682 : if (!tx_relay->m_relay_txs) tx_relay->m_tx_inventory_to_send.clear();
+ - ]
6330 : 256639 : }
6331 : :
6332 : : // Respond to BIP35 mempool requests
6333 [ + - + + ]: 256639 : if (fSendTrickle && tx_relay->m_send_mempool) {
6334 [ + - ]: 145 : auto vtxinfo = m_mempool.infoAll();
6335 : :
6336 : : // Ensure we'll respond to GETDATA requests for anything we're about to announce
6337 [ + - + - ]: 290 : tx_relay->m_last_inv_sequence = WITH_LOCK(m_mempool.cs, return m_mempool.GetSequence());
6338 : :
6339 : 145 : tx_relay->m_send_mempool = false;
6340 [ - + ]: 145 : const CFeeRate filterrate{tx_relay->m_fee_filter_received.load()};
6341 : :
6342 : : // we'll send everything in the mempool momentarily, so this is redundant
6343 [ - + ]: 145 : tx_relay->m_tx_inventory_to_send.clear();
6344 : :
6345 [ + - ]: 145 : LOCK(tx_relay->m_bloom_filter_mutex);
6346 : :
6347 [ - + ]: 145 : for (const auto& txinfo : vtxinfo) {
6348 [ # # ]: 0 : const Txid& txid{txinfo.tx->GetHash()};
6349 [ # # ]: 0 : const Wtxid& wtxid{txinfo.tx->GetWitnessHash()};
6350 [ # # ]: 0 : const auto inv = peer.m_wtxid_relay ?
6351 : : CInv{MSG_WTX, wtxid.ToUint256()} :
6352 [ # # # # ]: 0 : CInv{MSG_TX, txid.ToUint256()};
6353 : :
6354 : : // Don't send transactions that peers will not put into their mempool
6355 [ # # # # ]: 0 : if (txinfo.fee < filterrate.GetFee(txinfo.vsize)) {
6356 : 0 : continue;
6357 : : }
6358 [ # # ]: 0 : if (tx_relay->m_bloom_filter) {
6359 [ # # # # ]: 0 : if (!tx_relay->m_bloom_filter->IsRelevantAndUpdate(*txinfo.tx)) continue;
6360 : : }
6361 [ # # ]: 0 : tx_relay->m_tx_inventory_known_filter.insert(inv.hash);
6362 [ # # ]: 0 : vInv.push_back(inv);
6363 [ # # # # ]: 0 : if (vInv.size() == MAX_INV_SZ) {
6364 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::INV, vInv);
6365 [ # # ]: 0 : vInv.clear();
6366 : : }
6367 : : }
6368 : 145 : }
6369 : :
6370 : : // Determine transactions to relay
6371 : 256639 : if (fSendTrickle) {
6372 : : // Topologically and fee-rate sort the inventory we send for privacy and priority reasons.
6373 : : // (sorted from higher priority to lowest, skipping low fee)
6374 [ + - ]: 256639 : const CFeeRate filterrate{tx_relay->m_fee_filter_received.load()};
6375 : :
6376 : 513278 : auto inv_tx = [&]() EXCLUSIVE_LOCKS_REQUIRED(tx_relay->m_tx_inventory_mutex) {
6377 : 256639 : auto& invs = tx_relay->m_tx_inventory_to_send;
6378 : 256639 : std::vector<CTransactionRef> res;
6379 : :
6380 [ - + + + ]: 256639 : if (invs.size() == 0) return res;
6381 : :
6382 : : // if previous allocations were excessive, shrink to the current size
6383 [ - + + + ]: 13847 : if (invs.capacity() > 2 * invs.size()) invs.shrink_to_fit();
6384 : :
6385 [ + - ]: 13847 : LOCK(m_mempool.cs);
6386 [ - + + - ]: 13847 : auto txiters = m_mempool.ExtractBestByMiningScoreWithTopology(invs, invs.size());
6387 [ - + + - ]: 13847 : res.reserve(txiters.size());
6388 [ + + ]: 28586 : for (auto txiter : txiters) {
6389 [ + - + - : 14739 : if (txiter->GetFee() < filterrate.GetFee(txiter->GetTxSize())) {
- + ]
6390 : 0 : continue; // higher feerate CPFP txs may follow, so just skip, don't stop
6391 : : }
6392 [ + - + - : 29478 : res.push_back(txiter->GetSharedTx());
- + ]
6393 : : }
6394 : : // Ensure we'll respond to GETDATA requests for anything we're about to announce
6395 : 13847 : tx_relay->m_last_inv_sequence = m_mempool.GetSequence();
6396 : 13847 : return res;
6397 [ + - + - ]: 284333 : }();
6398 : :
6399 [ + - ]: 256639 : LOCK(tx_relay->m_bloom_filter_mutex);
6400 [ - + - + : 256639 : vInv.reserve(std::min<size_t>(MAX_INV_SZ, vInv.size() + inv_tx.size()));
- + + - ]
6401 [ + + ]: 271378 : for (auto& tx : inv_tx) {
6402 : : // `TxRelay::m_tx_inventory_known_filter` contains either txids or wtxids
6403 : : // depending on whether our peer supports wtxid-relay. Therefore, first
6404 : : // construct the inv and then use its hash for the filter check.
6405 [ - + ]: 14739 : const auto inv = peer.m_wtxid_relay ?
6406 [ # # ]: 0 : CInv{MSG_WTX, tx->GetWitnessHash().ToUint256()} :
6407 [ - - + - ]: 14739 : CInv{MSG_TX, tx->GetHash().ToUint256()};
6408 : : // Check if not in the filter already
6409 [ + - + + ]: 14739 : if (tx_relay->m_tx_inventory_known_filter.contains(inv.hash)) {
6410 : 12965 : continue;
6411 : : }
6412 [ - + - - : 1774 : if (tx_relay->m_bloom_filter && !tx_relay->m_bloom_filter->IsRelevantAndUpdate(*tx)) continue;
- - ]
6413 : : // Send
6414 [ + - ]: 1774 : vInv.push_back(inv);
6415 [ - + - + ]: 1774 : if (vInv.size() == MAX_INV_SZ) {
6416 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::INV, vInv);
6417 [ # # ]: 0 : vInv.clear();
6418 : : }
6419 [ + - ]: 1774 : tx_relay->m_tx_inventory_known_filter.insert(inv.hash);
6420 : : }
6421 : 256639 : }
6422 : 1280124 : }
6423 [ + + ]: 1403848 : if (!vInv.empty())
6424 [ + - + - ]: 4436 : MakeAndPushMessage(node, NetMsgType::INV, vInv);
6425 : :
6426 : : // Detect whether we're stalling
6427 [ - + ]: 1403848 : auto stalling_timeout = m_block_stalling_timeout.load();
6428 [ - + - - ]: 1403848 : if (state.m_stalling_since.count() && state.m_stalling_since < current_time - stalling_timeout) {
6429 : : // Stalling only triggers when the block download window cannot move. During normal steady state,
6430 : : // the download window should be much larger than the to-be-downloaded set of blocks, so disconnection
6431 : : // should only happen during initial block download.
6432 [ # # # # ]: 0 : LogInfo("Peer is stalling block download, %s", node.DisconnectMsg());
6433 [ # # ]: 0 : node.fDisconnect = true;
6434 : : // Increase timeout for the next peer so that we don't disconnect multiple peers if our own
6435 : : // bandwidth is insufficient.
6436 [ # # ]: 0 : const auto new_timeout = std::min(2 * stalling_timeout, BLOCK_STALLING_TIMEOUT_MAX);
6437 [ # # # # ]: 0 : if (stalling_timeout != new_timeout && m_block_stalling_timeout.compare_exchange_strong(stalling_timeout, new_timeout)) {
6438 [ # # # # : 0 : LogDebug(BCLog::NET, "Increased stalling timeout temporarily to %d seconds\n", count_seconds(new_timeout));
# # ]
6439 : : }
6440 : 0 : return true;
6441 : : }
6442 : : // In case there is a block that has been in flight from this peer for block_interval * (1 + 0.5 * N)
6443 : : // (with N the number of peers from which we're downloading validated blocks), disconnect due to timeout.
6444 : : // We compensate for other peers to prevent killing off peers due to our own downstream link
6445 : : // being saturated. We only count validated in-flight blocks so peers can't advertise non-existing block hashes
6446 : : // to unreasonably increase our timeout.
6447 [ + + ]: 1403848 : if (state.vBlocksInFlight.size() > 0) {
6448 : 147709 : QueuedBlock &queuedBlock = state.vBlocksInFlight.front();
6449 : 147709 : int nOtherPeersWithValidatedDownloads = m_peers_downloading_from - 1;
6450 [ + + ]: 147709 : if (current_time > state.m_downloading_since + std::chrono::seconds{consensusParams.nPowTargetSpacing} * (BLOCK_DOWNLOAD_TIMEOUT_BASE + BLOCK_DOWNLOAD_TIMEOUT_PER_PEER * nOtherPeersWithValidatedDownloads)) {
6451 [ + - + - : 302 : LogInfo("Timeout downloading block %s, %s", queuedBlock.pindex->GetBlockHash().ToString(), node.DisconnectMsg());
+ - ]
6452 : 302 : node.fDisconnect = true;
6453 : 302 : return true;
6454 : : }
6455 : : }
6456 : : // Check for headers sync timeouts
6457 [ + + + + ]: 1403546 : if (state.fSyncStarted && peer.m_headers_sync_timeout < std::chrono::microseconds::max()) {
6458 : : // Detect whether this is a stalling initial-headers-sync peer
6459 [ + + ]: 722808 : if (m_chainman.m_best_header->Time() <= NodeClock::now() - 24h) {
6460 [ + + + + : 717900 : if (current_time > peer.m_headers_sync_timeout && nSyncStarted == 1 && (m_num_preferred_download_peers - state.fPreferredDownload >= 1)) {
+ + ]
6461 : : // Disconnect a peer (without NetPermissionFlags::NoBan permission) if it is our only sync peer,
6462 : : // and we have others we could be using instead.
6463 : : // Note: If all our peers are inbound, then we won't
6464 : : // disconnect our sync peer for stalling; we have bigger
6465 : : // problems if we can't get any outbound peers.
6466 [ + + ]: 63 : if (!node.HasPermission(NetPermissionFlags::NoBan)) {
6467 [ + - + - ]: 4 : LogInfo("Timeout downloading headers, %s", node.DisconnectMsg());
6468 : 4 : node.fDisconnect = true;
6469 : 4 : return true;
6470 : : } else {
6471 [ + - + - ]: 59 : LogInfo("Timeout downloading headers from noban peer, not %s", node.DisconnectMsg());
6472 : : // Reset the headers sync state so that we have a
6473 : : // chance to try downloading from a different peer.
6474 : : // Note: this will also result in at least one more
6475 : : // getheaders message to be sent to
6476 : : // this peer (eventually).
6477 : 59 : state.fSyncStarted = false;
6478 : 59 : nSyncStarted--;
6479 : 59 : peer.m_headers_sync_timeout = 0us;
6480 : : }
6481 : : }
6482 : : } else {
6483 : : // After we've caught up once, reset the timeout so we can't trigger
6484 : : // disconnect later.
6485 : 4908 : peer.m_headers_sync_timeout = std::chrono::microseconds::max();
6486 : : }
6487 : : }
6488 : :
6489 : : // Check that outbound peers have reasonable chains
6490 : : // GetTime() is used by this anti-DoS logic so we can test this using mocktime
6491 [ + - ]: 1403542 : ConsiderEviction(node, peer, GetTime<std::chrono::seconds>());
6492 : :
6493 : : //
6494 : : // Message: getdata (blocks)
6495 : : //
6496 : 1403542 : std::vector<CInv> vGetData;
6497 [ + + + + : 1403542 : if (CanServeBlocks(peer) && ((sync_blocks_and_headers_from_peer && !IsLimitedPeer(peer)) || !m_chainman.IsInitialBlockDownload()) && state.vBlocksInFlight.size() < MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
+ + + + +
+ ]
6498 : 275282 : std::vector<const CBlockIndex*> vToDownload;
6499 : 275282 : NodeId staller = -1;
6500 : 275282 : auto get_inflight_budget = [&state]() {
6501 : 550564 : return std::max(0, MAX_BLOCKS_IN_TRANSIT_PER_PEER - static_cast<int>(state.vBlocksInFlight.size()));
6502 : 275282 : };
6503 : :
6504 : : // If there are multiple chainstates, download blocks for the
6505 : : // current chainstate first, to prioritize getting to network tip
6506 : : // before downloading historical blocks.
6507 [ - + + - ]: 275282 : FindNextBlocksToDownload(peer, get_inflight_budget(), vToDownload, staller);
6508 [ + - ]: 275282 : auto historical_blocks{m_chainman.GetHistoricalBlockRange()};
6509 [ - + - - ]: 275282 : if (historical_blocks && !IsLimitedPeer(peer)) {
6510 : : // If the first needed historical block is not an ancestor of the last,
6511 : : // we need to start requesting blocks from their last common ancestor.
6512 [ # # ]: 0 : const CBlockIndex* from_tip = LastCommonAncestor(historical_blocks->first, historical_blocks->second);
6513 [ # # ]: 0 : TryDownloadingHistoricalBlocks(
6514 : : peer,
6515 [ # # ]: 0 : get_inflight_budget(),
6516 [ # # ]: 0 : vToDownload, from_tip, historical_blocks->second);
6517 : : }
6518 [ + + ]: 276089 : for (const CBlockIndex *pindex : vToDownload) {
6519 : 807 : uint32_t nFetchFlags = GetFetchFlags(peer);
6520 [ + - ]: 807 : vGetData.emplace_back(MSG_BLOCK | nFetchFlags, pindex->GetBlockHash());
6521 [ + - ]: 807 : BlockRequested(node.GetId(), *pindex);
6522 [ + - - + : 807 : LogDebug(BCLog::NET, "Requesting block %s (%d) peer=%d\n", pindex->GetBlockHash().ToString(),
- - - - ]
6523 : : pindex->nHeight, node.GetId());
6524 : : }
6525 [ + + - + ]: 275282 : if (state.vBlocksInFlight.empty() && staller != -1) {
6526 [ # # ]: 0 : if (State(staller)->m_stalling_since == 0us) {
6527 : 0 : State(staller)->m_stalling_since = current_time;
6528 [ - - - - : 275282 : LogDebug(BCLog::NET, "Stall started peer=%d\n", staller);
- - ]
6529 : : }
6530 : : }
6531 : 275282 : }
6532 : :
6533 : : //
6534 : : // Message: getdata (transactions)
6535 : : //
6536 : 1403542 : {
6537 [ + - ]: 1403542 : LOCK(m_tx_download_mutex);
6538 [ + - + + ]: 1406584 : for (const GenTxid& gtxid : m_txdownloadman.GetRequestsToSend(node.GetId(), current_time)) {
6539 [ + - - + : 6084 : vGetData.emplace_back(gtxid.IsWtxid() ? MSG_WTX : (MSG_TX | GetFetchFlags(peer)), gtxid.ToUint256());
- + - ]
6540 [ - + - + ]: 3042 : if (vGetData.size() >= MAX_GETDATA_SZ) {
6541 [ # # # # ]: 0 : MakeAndPushMessage(node, NetMsgType::GETDATA, vGetData);
6542 [ - - ]: 3042 : vGetData.clear();
6543 : : }
6544 [ + - ]: 1403542 : }
6545 : 0 : }
6546 : :
6547 [ + + ]: 1403542 : if (!vGetData.empty())
6548 [ + - + - ]: 7300 : MakeAndPushMessage(node, NetMsgType::GETDATA, vGetData);
6549 [ + - + - ]: 1404154 : } // release cs_main
6550 [ + - ]: 1403542 : MaybeSendFeefilter(node, peer, current_time);
6551 : : return true;
6552 : 1545862 : }
|
