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