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