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