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