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 <bitcoin-build-config.h> // IWYU pragma: keep
7 : :
8 : : #include <net.h>
9 : :
10 : : #include <addrdb.h>
11 : : #include <addrman.h>
12 : : #include <banman.h>
13 : : #include <clientversion.h>
14 : : #include <common/args.h>
15 : : #include <common/netif.h>
16 : : #include <compat/compat.h>
17 : : #include <consensus/consensus.h>
18 : : #include <crypto/sha256.h>
19 : : #include <i2p.h>
20 : : #include <key.h>
21 : : #include <logging.h>
22 : : #include <memusage.h>
23 : : #include <net_permissions.h>
24 : : #include <netaddress.h>
25 : : #include <netbase.h>
26 : : #include <node/eviction.h>
27 : : #include <node/interface_ui.h>
28 : : #include <protocol.h>
29 : : #include <random.h>
30 : : #include <scheduler.h>
31 : : #include <util/fs.h>
32 : : #include <util/sock.h>
33 : : #include <util/strencodings.h>
34 : : #include <util/thread.h>
35 : : #include <util/threadinterrupt.h>
36 : : #include <util/trace.h>
37 : : #include <util/translation.h>
38 : : #include <util/vector.h>
39 : :
40 : : #ifdef WIN32
41 : : #include <string.h>
42 : : #endif
43 : :
44 : : #if HAVE_DECL_GETIFADDRS && HAVE_DECL_FREEIFADDRS
45 : : #include <ifaddrs.h>
46 : : #endif
47 : :
48 : : #include <algorithm>
49 : : #include <array>
50 : : #include <cmath>
51 : : #include <cstdint>
52 : : #include <functional>
53 : : #include <optional>
54 : : #include <unordered_map>
55 : :
56 : : TRACEPOINT_SEMAPHORE(net, outbound_message);
57 : :
58 : : /** Maximum number of block-relay-only anchor connections */
59 : : static constexpr size_t MAX_BLOCK_RELAY_ONLY_ANCHORS = 2;
60 : : static_assert (MAX_BLOCK_RELAY_ONLY_ANCHORS <= static_cast<size_t>(MAX_BLOCK_RELAY_ONLY_CONNECTIONS), "MAX_BLOCK_RELAY_ONLY_ANCHORS must not exceed MAX_BLOCK_RELAY_ONLY_CONNECTIONS.");
61 : : /** Anchor IP address database file name */
62 : : const char* const ANCHORS_DATABASE_FILENAME = "anchors.dat";
63 : :
64 : : // How often to dump addresses to peers.dat
65 : : static constexpr std::chrono::minutes DUMP_PEERS_INTERVAL{15};
66 : :
67 : : /** Number of DNS seeds to query when the number of connections is low. */
68 : : static constexpr int DNSSEEDS_TO_QUERY_AT_ONCE = 3;
69 : :
70 : : /** Minimum number of outbound connections under which we will keep fetching our address seeds. */
71 : : static constexpr int SEED_OUTBOUND_CONNECTION_THRESHOLD = 2;
72 : :
73 : : /** How long to delay before querying DNS seeds
74 : : *
75 : : * If we have more than THRESHOLD entries in addrman, then it's likely
76 : : * that we got those addresses from having previously connected to the P2P
77 : : * network, and that we'll be able to successfully reconnect to the P2P
78 : : * network via contacting one of them. So if that's the case, spend a
79 : : * little longer trying to connect to known peers before querying the
80 : : * DNS seeds.
81 : : */
82 : : static constexpr std::chrono::seconds DNSSEEDS_DELAY_FEW_PEERS{11};
83 : : static constexpr std::chrono::minutes DNSSEEDS_DELAY_MANY_PEERS{5};
84 : : static constexpr int DNSSEEDS_DELAY_PEER_THRESHOLD = 1000; // "many" vs "few" peers
85 : :
86 : : /** The default timeframe for -maxuploadtarget. 1 day. */
87 : : static constexpr std::chrono::seconds MAX_UPLOAD_TIMEFRAME{60 * 60 * 24};
88 : :
89 : : // A random time period (0 to 1 seconds) is added to feeler connections to prevent synchronization.
90 : : static constexpr auto FEELER_SLEEP_WINDOW{1s};
91 : :
92 : : /** Frequency to attempt extra connections to reachable networks we're not connected to yet **/
93 : : static constexpr auto EXTRA_NETWORK_PEER_INTERVAL{5min};
94 : :
95 : : /** Used to pass flags to the Bind() function */
96 : : enum BindFlags {
97 : : BF_NONE = 0,
98 : : BF_REPORT_ERROR = (1U << 0),
99 : : /**
100 : : * Do not call AddLocal() for our special addresses, e.g., for incoming
101 : : * Tor connections, to prevent gossiping them over the network.
102 : : */
103 : : BF_DONT_ADVERTISE = (1U << 1),
104 : : };
105 : :
106 : : // The set of sockets cannot be modified while waiting
107 : : // The sleep time needs to be small to avoid new sockets stalling
108 : : static const uint64_t SELECT_TIMEOUT_MILLISECONDS = 50;
109 : :
110 : : const std::string NET_MESSAGE_TYPE_OTHER = "*other*";
111 : :
112 : : static const uint64_t RANDOMIZER_ID_NETGROUP = 0x6c0edd8036ef4036ULL; // SHA256("netgroup")[0:8]
113 : : static const uint64_t RANDOMIZER_ID_LOCALHOSTNONCE = 0xd93e69e2bbfa5735ULL; // SHA256("localhostnonce")[0:8]
114 : : static const uint64_t RANDOMIZER_ID_ADDRCACHE = 0x1cf2e4ddd306dda9ULL; // SHA256("addrcache")[0:8]
115 : : //
116 : : // Global state variables
117 : : //
118 : : bool fDiscover = true;
119 : : bool fListen = true;
120 : : GlobalMutex g_maplocalhost_mutex;
121 : : std::map<CNetAddr, LocalServiceInfo> mapLocalHost GUARDED_BY(g_maplocalhost_mutex);
122 : : std::string strSubVersion;
123 : :
124 : 0 : size_t CSerializedNetMsg::GetMemoryUsage() const noexcept
125 : : {
126 [ # # ]: 0 : return sizeof(*this) + memusage::DynamicUsage(m_type) + memusage::DynamicUsage(data);
127 : : }
128 : :
129 : 0 : size_t CNetMessage::GetMemoryUsage() const noexcept
130 : : {
131 : 0 : return sizeof(*this) + memusage::DynamicUsage(m_type) + m_recv.GetMemoryUsage();
132 : : }
133 : :
134 : 0 : void CConnman::AddAddrFetch(const std::string& strDest)
135 : : {
136 : 0 : LOCK(m_addr_fetches_mutex);
137 [ # # ]: 0 : m_addr_fetches.push_back(strDest);
138 : 0 : }
139 : :
140 : 0 : uint16_t GetListenPort()
141 : : {
142 : : // If -bind= is provided with ":port" part, use that (first one if multiple are provided).
143 [ # # # # ]: 0 : for (const std::string& bind_arg : gArgs.GetArgs("-bind")) {
144 : 0 : constexpr uint16_t dummy_port = 0;
145 : :
146 [ # # # # ]: 0 : const std::optional<CService> bind_addr{Lookup(bind_arg, dummy_port, /*fAllowLookup=*/false)};
147 [ # # # # : 0 : if (bind_addr.has_value() && bind_addr->GetPort() != dummy_port) return bind_addr->GetPort();
# # # # ]
148 : 0 : }
149 : :
150 : : // Otherwise, if -whitebind= without NetPermissionFlags::NoBan is provided, use that
151 : : // (-whitebind= is required to have ":port").
152 [ # # # # ]: 0 : for (const std::string& whitebind_arg : gArgs.GetArgs("-whitebind")) {
153 [ # # ]: 0 : NetWhitebindPermissions whitebind;
154 [ # # ]: 0 : bilingual_str error;
155 [ # # # # ]: 0 : if (NetWhitebindPermissions::TryParse(whitebind_arg, whitebind, error)) {
156 [ # # ]: 0 : if (!NetPermissions::HasFlag(whitebind.m_flags, NetPermissionFlags::NoBan)) {
157 [ # # ]: 0 : return whitebind.m_service.GetPort();
158 : : }
159 : : }
160 : 0 : }
161 : :
162 : : // Otherwise, if -port= is provided, use that. Otherwise use the default port.
163 [ # # ]: 0 : return static_cast<uint16_t>(gArgs.GetIntArg("-port", Params().GetDefaultPort()));
164 : : }
165 : :
166 : : // Determine the "best" local address for a particular peer.
167 : 0 : [[nodiscard]] static std::optional<CService> GetLocal(const CNode& peer)
168 : : {
169 [ # # ]: 0 : if (!fListen) return std::nullopt;
170 : :
171 : 0 : std::optional<CService> addr;
172 : 0 : int nBestScore = -1;
173 : 0 : int nBestReachability = -1;
174 : 0 : {
175 [ # # ]: 0 : LOCK(g_maplocalhost_mutex);
176 [ # # # # ]: 0 : for (const auto& [local_addr, local_service_info] : mapLocalHost) {
177 : : // For privacy reasons, don't advertise our privacy-network address
178 : : // to other networks and don't advertise our other-network address
179 : : // to privacy networks.
180 [ # # # # ]: 0 : if (local_addr.GetNetwork() != peer.ConnectedThroughNetwork()
181 [ # # # # : 0 : && (local_addr.IsPrivacyNet() || peer.IsConnectedThroughPrivacyNet())) {
# # ]
182 : 0 : continue;
183 : : }
184 : 0 : const int nScore{local_service_info.nScore};
185 [ # # ]: 0 : const int nReachability{local_addr.GetReachabilityFrom(peer.addr)};
186 [ # # # # ]: 0 : if (nReachability > nBestReachability || (nReachability == nBestReachability && nScore > nBestScore)) {
187 [ # # ]: 0 : addr.emplace(CService{local_addr, local_service_info.nPort});
188 : 0 : nBestReachability = nReachability;
189 : 0 : nBestScore = nScore;
190 : : }
191 : : }
192 : 0 : }
193 [ # # ]: 0 : return addr;
194 : 0 : }
195 : :
196 : : //! Convert the serialized seeds into usable address objects.
197 : 0 : static std::vector<CAddress> ConvertSeeds(const std::vector<uint8_t> &vSeedsIn)
198 : : {
199 : : // It'll only connect to one or two seed nodes because once it connects,
200 : : // it'll get a pile of addresses with newer timestamps.
201 : : // Seed nodes are given a random 'last seen time' of between one and two
202 : : // weeks ago.
203 : 0 : const auto one_week{7 * 24h};
204 : 0 : std::vector<CAddress> vSeedsOut;
205 : 0 : FastRandomContext rng;
206 [ # # ]: 0 : ParamsStream s{DataStream{vSeedsIn}, CAddress::V2_NETWORK};
207 [ # # ]: 0 : while (!s.eof()) {
208 [ # # ]: 0 : CService endpoint;
209 [ # # ]: 0 : s >> endpoint;
210 : 0 : CAddress addr{endpoint, SeedsServiceFlags()};
211 : 0 : addr.nTime = rng.rand_uniform_delay(Now<NodeSeconds>() - one_week, -one_week);
212 [ # # # # : 0 : LogDebug(BCLog::NET, "Added hardcoded seed: %s\n", addr.ToStringAddrPort());
# # # # ]
213 [ # # ]: 0 : vSeedsOut.push_back(addr);
214 : 0 : }
215 : 0 : return vSeedsOut;
216 : 0 : }
217 : :
218 : : // Determine the "best" local address for a particular peer.
219 : : // If none, return the unroutable 0.0.0.0 but filled in with
220 : : // the normal parameters, since the IP may be changed to a useful
221 : : // one by discovery.
222 : 0 : CService GetLocalAddress(const CNode& peer)
223 : : {
224 [ # # # # : 0 : return GetLocal(peer).value_or(CService{CNetAddr(), GetListenPort()});
# # ]
225 : : }
226 : :
227 : 0 : static int GetnScore(const CService& addr)
228 : : {
229 : 0 : LOCK(g_maplocalhost_mutex);
230 [ # # ]: 0 : const auto it = mapLocalHost.find(addr);
231 [ # # # # ]: 0 : return (it != mapLocalHost.end()) ? it->second.nScore : 0;
232 : 0 : }
233 : :
234 : : // Is our peer's addrLocal potentially useful as an external IP source?
235 : 0 : [[nodiscard]] static bool IsPeerAddrLocalGood(CNode *pnode)
236 : : {
237 : 0 : CService addrLocal = pnode->GetAddrLocal();
238 [ # # # # : 0 : return fDiscover && pnode->addr.IsRoutable() && addrLocal.IsRoutable() &&
# # # # #
# # # ]
239 [ # # ]: 0 : g_reachable_nets.Contains(addrLocal);
240 : 0 : }
241 : :
242 : 0 : std::optional<CService> GetLocalAddrForPeer(CNode& node)
243 : : {
244 : 0 : CService addrLocal{GetLocalAddress(node)};
245 : : // If discovery is enabled, sometimes give our peer the address it
246 : : // tells us that it sees us as in case it has a better idea of our
247 : : // address than we do.
248 : 0 : FastRandomContext rng;
249 [ # # # # : 0 : if (IsPeerAddrLocalGood(&node) && (!addrLocal.IsRoutable() ||
# # # # #
# ]
250 [ # # # # ]: 0 : rng.randbits((GetnScore(addrLocal) > LOCAL_MANUAL) ? 3 : 1) == 0))
251 : : {
252 [ # # ]: 0 : if (node.IsInboundConn()) {
253 : : // For inbound connections, assume both the address and the port
254 : : // as seen from the peer.
255 [ # # ]: 0 : addrLocal = CService{node.GetAddrLocal()};
256 : : } else {
257 : : // For outbound connections, assume just the address as seen from
258 : : // the peer and leave the port in `addrLocal` as returned by
259 : : // `GetLocalAddress()` above. The peer has no way to observe our
260 : : // listening port when we have initiated the connection.
261 [ # # # # ]: 0 : addrLocal.SetIP(node.GetAddrLocal());
262 : : }
263 : : }
264 [ # # # # ]: 0 : if (addrLocal.IsRoutable()) {
265 [ # # # # : 0 : LogDebug(BCLog::NET, "Advertising address %s to peer=%d\n", addrLocal.ToStringAddrPort(), node.GetId());
# # # # ]
266 : 0 : return addrLocal;
267 : : }
268 : : // Address is unroutable. Don't advertise.
269 : 0 : return std::nullopt;
270 : 0 : }
271 : :
272 : : // learn a new local address
273 : 0 : bool AddLocal(const CService& addr_, int nScore)
274 : : {
275 : 0 : CService addr{MaybeFlipIPv6toCJDNS(addr_)};
276 : :
277 [ # # # # ]: 0 : if (!addr.IsRoutable())
278 : : return false;
279 : :
280 [ # # # # ]: 0 : if (!fDiscover && nScore < LOCAL_MANUAL)
281 : : return false;
282 : :
283 [ # # # # ]: 0 : if (!g_reachable_nets.Contains(addr))
284 : : return false;
285 : :
286 [ # # # # ]: 0 : LogPrintf("AddLocal(%s,%i)\n", addr.ToStringAddrPort(), nScore);
287 : :
288 : 0 : {
289 [ # # ]: 0 : LOCK(g_maplocalhost_mutex);
290 [ # # # # ]: 0 : const auto [it, is_newly_added] = mapLocalHost.emplace(addr, LocalServiceInfo());
291 [ # # ]: 0 : LocalServiceInfo &info = it->second;
292 [ # # # # ]: 0 : if (is_newly_added || nScore >= info.nScore) {
293 [ # # ]: 0 : info.nScore = nScore + (is_newly_added ? 0 : 1);
294 [ # # ]: 0 : info.nPort = addr.GetPort();
295 : : }
296 : 0 : }
297 : :
298 : 0 : return true;
299 : 0 : }
300 : :
301 : 0 : bool AddLocal(const CNetAddr &addr, int nScore)
302 : : {
303 [ # # ]: 0 : return AddLocal(CService(addr, GetListenPort()), nScore);
304 : : }
305 : :
306 : 0 : void RemoveLocal(const CService& addr)
307 : : {
308 : 0 : LOCK(g_maplocalhost_mutex);
309 [ # # # # ]: 0 : LogPrintf("RemoveLocal(%s)\n", addr.ToStringAddrPort());
310 [ # # # # ]: 0 : mapLocalHost.erase(addr);
311 : 0 : }
312 : :
313 : : /** vote for a local address */
314 : 0 : bool SeenLocal(const CService& addr)
315 : : {
316 : 0 : LOCK(g_maplocalhost_mutex);
317 [ # # ]: 0 : const auto it = mapLocalHost.find(addr);
318 [ # # ]: 0 : if (it == mapLocalHost.end()) return false;
319 : 0 : ++it->second.nScore;
320 : 0 : return true;
321 : 0 : }
322 : :
323 : :
324 : : /** check whether a given address is potentially local */
325 : 0 : bool IsLocal(const CService& addr)
326 : : {
327 : 0 : LOCK(g_maplocalhost_mutex);
328 [ # # # # ]: 0 : return mapLocalHost.count(addr) > 0;
329 : 0 : }
330 : :
331 : 0 : CNode* CConnman::FindNode(const CNetAddr& ip)
332 : : {
333 : 0 : LOCK(m_nodes_mutex);
334 [ # # ]: 0 : for (CNode* pnode : m_nodes) {
335 [ # # # # ]: 0 : if (static_cast<CNetAddr>(pnode->addr) == ip) {
336 : : return pnode;
337 : : }
338 : : }
339 : : return nullptr;
340 : 0 : }
341 : :
342 : 0 : CNode* CConnman::FindNode(const std::string& addrName)
343 : : {
344 : 0 : LOCK(m_nodes_mutex);
345 [ # # ]: 0 : for (CNode* pnode : m_nodes) {
346 [ # # ]: 0 : if (pnode->m_addr_name == addrName) {
347 : : return pnode;
348 : : }
349 : : }
350 : : return nullptr;
351 : 0 : }
352 : :
353 : 0 : CNode* CConnman::FindNode(const CService& addr)
354 : : {
355 : 0 : LOCK(m_nodes_mutex);
356 [ # # ]: 0 : for (CNode* pnode : m_nodes) {
357 [ # # # # ]: 0 : if (static_cast<CService>(pnode->addr) == addr) {
358 : : return pnode;
359 : : }
360 : : }
361 : : return nullptr;
362 : 0 : }
363 : :
364 : 0 : bool CConnman::AlreadyConnectedToAddress(const CAddress& addr)
365 : : {
366 [ # # # # : 0 : return FindNode(static_cast<CNetAddr>(addr)) || FindNode(addr.ToStringAddrPort());
# # # # #
# ]
367 : : }
368 : :
369 : 0 : bool CConnman::CheckIncomingNonce(uint64_t nonce)
370 : : {
371 : 0 : LOCK(m_nodes_mutex);
372 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
373 [ # # # # : 0 : if (!pnode->fSuccessfullyConnected && !pnode->IsInboundConn() && pnode->GetLocalNonce() == nonce)
# # ]
374 : : return false;
375 : : }
376 : : return true;
377 : 0 : }
378 : :
379 : : /** Get the bind address for a socket as CAddress */
380 : 0 : static CAddress GetBindAddress(const Sock& sock)
381 : : {
382 : 0 : CAddress addr_bind;
383 : 0 : struct sockaddr_storage sockaddr_bind;
384 : 0 : socklen_t sockaddr_bind_len = sizeof(sockaddr_bind);
385 [ # # # # ]: 0 : if (!sock.GetSockName((struct sockaddr*)&sockaddr_bind, &sockaddr_bind_len)) {
386 [ # # ]: 0 : addr_bind.SetSockAddr((const struct sockaddr*)&sockaddr_bind);
387 : : } else {
388 [ # # # # : 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Warning, "getsockname failed\n");
# # ]
389 : : }
390 : 0 : return addr_bind;
391 : 0 : }
392 : :
393 : 0 : CNode* CConnman::ConnectNode(CAddress addrConnect, const char *pszDest, bool fCountFailure, ConnectionType conn_type, bool use_v2transport)
394 : : {
395 : 0 : AssertLockNotHeld(m_unused_i2p_sessions_mutex);
396 [ # # ]: 0 : assert(conn_type != ConnectionType::INBOUND);
397 : :
398 [ # # ]: 0 : if (pszDest == nullptr) {
399 [ # # ]: 0 : if (IsLocal(addrConnect))
400 : : return nullptr;
401 : :
402 : : // Look for an existing connection
403 [ # # ]: 0 : CNode* pnode = FindNode(static_cast<CService>(addrConnect));
404 [ # # ]: 0 : if (pnode)
405 : : {
406 : 0 : LogPrintf("Failed to open new connection, already connected\n");
407 : 0 : return nullptr;
408 : : }
409 : : }
410 : :
411 [ # # # # : 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "trying %s connection %s lastseen=%.1fhrs\n",
# # # # #
# ]
412 : : use_v2transport ? "v2" : "v1",
413 : : pszDest ? pszDest : addrConnect.ToStringAddrPort(),
414 : : Ticks<HoursDouble>(pszDest ? 0h : Now<NodeSeconds>() - addrConnect.nTime));
415 : :
416 : : // Resolve
417 [ # # # # ]: 0 : const uint16_t default_port{pszDest != nullptr ? GetDefaultPort(pszDest) :
418 : 0 : m_params.GetDefaultPort()};
419 : :
420 : : // Collection of addresses to try to connect to: either all dns resolved addresses if a domain name (pszDest) is provided, or addrConnect otherwise.
421 : 0 : std::vector<CAddress> connect_to{};
422 [ # # ]: 0 : if (pszDest) {
423 [ # # # # : 0 : std::vector<CService> resolved{Lookup(pszDest, default_port, fNameLookup && !HaveNameProxy(), 256)};
# # # # #
# # # ]
424 [ # # ]: 0 : if (!resolved.empty()) {
425 : 0 : std::shuffle(resolved.begin(), resolved.end(), FastRandomContext());
426 : : // If the connection is made by name, it can be the case that the name resolves to more than one address.
427 : : // We don't want to connect any more of them if we are already connected to one
428 [ # # ]: 0 : for (const auto& r : resolved) {
429 [ # # ]: 0 : addrConnect = CAddress{MaybeFlipIPv6toCJDNS(r), NODE_NONE};
430 [ # # # # ]: 0 : if (!addrConnect.IsValid()) {
431 [ # # # # : 0 : LogDebug(BCLog::NET, "Resolver returned invalid address %s for %s\n", addrConnect.ToStringAddrPort(), pszDest);
# # # # ]
432 : 0 : return nullptr;
433 : : }
434 : : // It is possible that we already have a connection to the IP/port pszDest resolved to.
435 : : // In that case, drop the connection that was just created.
436 [ # # ]: 0 : LOCK(m_nodes_mutex);
437 [ # # ]: 0 : CNode* pnode = FindNode(static_cast<CService>(addrConnect));
438 [ # # ]: 0 : if (pnode) {
439 [ # # # # ]: 0 : LogPrintf("Not opening a connection to %s, already connected to %s\n", pszDest, addrConnect.ToStringAddrPort());
440 [ # # ]: 0 : return nullptr;
441 : : }
442 : : // Add the address to the resolved addresses vector so we can try to connect to it later on
443 [ # # ]: 0 : connect_to.push_back(addrConnect);
444 : 0 : }
445 : : } else {
446 : : // For resolution via proxy
447 [ # # ]: 0 : connect_to.push_back(addrConnect);
448 : : }
449 : 0 : } else {
450 : : // Connect via addrConnect directly
451 [ # # ]: 0 : connect_to.push_back(addrConnect);
452 : : }
453 : :
454 : : // Connect
455 : 0 : std::unique_ptr<Sock> sock;
456 [ # # ]: 0 : Proxy proxy;
457 [ # # ]: 0 : CAddress addr_bind;
458 [ # # # # ]: 0 : assert(!addr_bind.IsValid());
459 : 0 : std::unique_ptr<i2p::sam::Session> i2p_transient_session;
460 : :
461 [ # # ]: 0 : for (auto& target_addr: connect_to) {
462 [ # # # # ]: 0 : if (target_addr.IsValid()) {
463 [ # # # # ]: 0 : const bool use_proxy{GetProxy(target_addr.GetNetwork(), proxy)};
464 : 0 : bool proxyConnectionFailed = false;
465 : :
466 [ # # # # ]: 0 : if (target_addr.IsI2P() && use_proxy) {
467 [ # # ]: 0 : i2p::Connection conn;
468 : 0 : bool connected{false};
469 : :
470 [ # # ]: 0 : if (m_i2p_sam_session) {
471 [ # # ]: 0 : connected = m_i2p_sam_session->Connect(target_addr, conn, proxyConnectionFailed);
472 : : } else {
473 : 0 : {
474 [ # # ]: 0 : LOCK(m_unused_i2p_sessions_mutex);
475 [ # # ]: 0 : if (m_unused_i2p_sessions.empty()) {
476 : 0 : i2p_transient_session =
477 [ # # ]: 0 : std::make_unique<i2p::sam::Session>(proxy, &interruptNet);
478 : : } else {
479 : 0 : i2p_transient_session.swap(m_unused_i2p_sessions.front());
480 : 0 : m_unused_i2p_sessions.pop();
481 : : }
482 : 0 : }
483 [ # # ]: 0 : connected = i2p_transient_session->Connect(target_addr, conn, proxyConnectionFailed);
484 [ # # ]: 0 : if (!connected) {
485 [ # # ]: 0 : LOCK(m_unused_i2p_sessions_mutex);
486 [ # # ]: 0 : if (m_unused_i2p_sessions.size() < MAX_UNUSED_I2P_SESSIONS_SIZE) {
487 [ # # # # ]: 0 : m_unused_i2p_sessions.emplace(i2p_transient_session.release());
488 : : }
489 : 0 : }
490 : : }
491 : :
492 [ # # ]: 0 : if (connected) {
493 : 0 : sock = std::move(conn.sock);
494 : 0 : addr_bind = CAddress{conn.me, NODE_NONE};
495 : : }
496 [ # # ]: 0 : } else if (use_proxy) {
497 [ # # # # : 0 : LogPrintLevel(BCLog::PROXY, BCLog::Level::Debug, "Using proxy: %s to connect to %s\n", proxy.ToString(), target_addr.ToStringAddrPort());
# # # # #
# ]
498 [ # # # # : 0 : sock = ConnectThroughProxy(proxy, target_addr.ToStringAddr(), target_addr.GetPort(), proxyConnectionFailed);
# # ]
499 : : } else {
500 : : // no proxy needed (none set for target network)
501 [ # # ]: 0 : sock = ConnectDirectly(target_addr, conn_type == ConnectionType::MANUAL);
502 : : }
503 [ # # ]: 0 : if (!proxyConnectionFailed) {
504 : : // If a connection to the node was attempted, and failure (if any) is not caused by a problem connecting to
505 : : // the proxy, mark this as an attempt.
506 [ # # ]: 0 : addrman.Attempt(target_addr, fCountFailure);
507 : : }
508 [ # # # # : 0 : } else if (pszDest && GetNameProxy(proxy)) {
# # ]
509 [ # # ]: 0 : std::string host;
510 : 0 : uint16_t port{default_port};
511 [ # # # # ]: 0 : SplitHostPort(std::string(pszDest), port, host);
512 : 0 : bool proxyConnectionFailed;
513 [ # # ]: 0 : sock = ConnectThroughProxy(proxy, host, port, proxyConnectionFailed);
514 : 0 : }
515 : : // Check any other resolved address (if any) if we fail to connect
516 [ # # ]: 0 : if (!sock) {
517 : 0 : continue;
518 : : }
519 : :
520 : 0 : NetPermissionFlags permission_flags = NetPermissionFlags::None;
521 [ # # # # ]: 0 : std::vector<NetWhitelistPermissions> whitelist_permissions = conn_type == ConnectionType::MANUAL ? vWhitelistedRangeOutgoing : std::vector<NetWhitelistPermissions>{};
522 [ # # ]: 0 : AddWhitelistPermissionFlags(permission_flags, target_addr, whitelist_permissions);
523 : :
524 : : // Add node
525 [ # # ]: 0 : NodeId id = GetNewNodeId();
526 [ # # # # : 0 : uint64_t nonce = GetDeterministicRandomizer(RANDOMIZER_ID_LOCALHOSTNONCE).Write(id).Finalize();
# # ]
527 [ # # # # ]: 0 : if (!addr_bind.IsValid()) {
528 [ # # ]: 0 : addr_bind = GetBindAddress(*sock);
529 : : }
530 : 0 : CNode* pnode = new CNode(id,
531 : : std::move(sock),
532 : : target_addr,
533 : : CalculateKeyedNetGroup(target_addr),
534 : : nonce,
535 : : addr_bind,
536 : 0 : pszDest ? pszDest : "",
537 : : conn_type,
538 : : /*inbound_onion=*/false,
539 [ # # ]: 0 : CNodeOptions{
540 : : .permission_flags = permission_flags,
541 : : .i2p_sam_session = std::move(i2p_transient_session),
542 [ # # ]: 0 : .recv_flood_size = nReceiveFloodSize,
543 : : .use_v2transport = use_v2transport,
544 [ # # # # : 0 : });
# # # # #
# # # #
# ]
545 : 0 : pnode->AddRef();
546 : :
547 : : // We're making a new connection, harvest entropy from the time (and our peer count)
548 : 0 : RandAddEvent((uint32_t)id);
549 : :
550 : 0 : return pnode;
551 : 0 : }
552 : :
553 : : return nullptr;
554 : 0 : }
555 : :
556 : 0 : void CNode::CloseSocketDisconnect()
557 : : {
558 : 0 : fDisconnect = true;
559 : 0 : LOCK(m_sock_mutex);
560 [ # # ]: 0 : if (m_sock) {
561 [ # # # # : 0 : LogDebug(BCLog::NET, "disconnecting peer=%d\n", id);
# # ]
562 : 0 : m_sock.reset();
563 : : }
564 [ # # # # ]: 0 : m_i2p_sam_session.reset();
565 : 0 : }
566 : :
567 : 0 : void CConnman::AddWhitelistPermissionFlags(NetPermissionFlags& flags, const CNetAddr &addr, const std::vector<NetWhitelistPermissions>& ranges) const {
568 [ # # ]: 0 : for (const auto& subnet : ranges) {
569 [ # # ]: 0 : if (subnet.m_subnet.Match(addr)) {
570 : 0 : NetPermissions::AddFlag(flags, subnet.m_flags);
571 : : }
572 : : }
573 [ # # ]: 0 : if (NetPermissions::HasFlag(flags, NetPermissionFlags::Implicit)) {
574 [ # # ]: 0 : NetPermissions::ClearFlag(flags, NetPermissionFlags::Implicit);
575 [ # # ]: 0 : if (whitelist_forcerelay) NetPermissions::AddFlag(flags, NetPermissionFlags::ForceRelay);
576 [ # # ]: 0 : if (whitelist_relay) NetPermissions::AddFlag(flags, NetPermissionFlags::Relay);
577 : 0 : NetPermissions::AddFlag(flags, NetPermissionFlags::Mempool);
578 : 0 : NetPermissions::AddFlag(flags, NetPermissionFlags::NoBan);
579 : : }
580 : 0 : }
581 : :
582 : 0 : CService CNode::GetAddrLocal() const
583 : : {
584 : 0 : AssertLockNotHeld(m_addr_local_mutex);
585 : 0 : LOCK(m_addr_local_mutex);
586 [ # # ]: 0 : return m_addr_local;
587 : 0 : }
588 : :
589 : 0 : void CNode::SetAddrLocal(const CService& addrLocalIn) {
590 : 0 : AssertLockNotHeld(m_addr_local_mutex);
591 : 0 : LOCK(m_addr_local_mutex);
592 [ # # # # : 0 : if (Assume(!m_addr_local.IsValid())) { // Addr local can only be set once during version msg processing
# # ]
593 : 0 : m_addr_local = addrLocalIn;
594 : : }
595 : 0 : }
596 : :
597 : 0 : Network CNode::ConnectedThroughNetwork() const
598 : : {
599 [ # # ]: 0 : return m_inbound_onion ? NET_ONION : addr.GetNetClass();
600 : : }
601 : :
602 : 0 : bool CNode::IsConnectedThroughPrivacyNet() const
603 : : {
604 [ # # # # ]: 0 : return m_inbound_onion || addr.IsPrivacyNet();
605 : : }
606 : :
607 : : #undef X
608 : : #define X(name) stats.name = name
609 : 0 : void CNode::CopyStats(CNodeStats& stats)
610 : : {
611 : 0 : stats.nodeid = this->GetId();
612 : 0 : X(addr);
613 : 0 : X(addrBind);
614 : 0 : stats.m_network = ConnectedThroughNetwork();
615 : 0 : X(m_last_send);
616 : 0 : X(m_last_recv);
617 : 0 : X(m_last_tx_time);
618 : 0 : X(m_last_block_time);
619 : 0 : X(m_connected);
620 : 0 : X(m_addr_name);
621 : 0 : X(nVersion);
622 : 0 : {
623 : 0 : LOCK(m_subver_mutex);
624 [ # # # # ]: 0 : X(cleanSubVer);
625 : 0 : }
626 : 0 : stats.fInbound = IsInboundConn();
627 : 0 : X(m_bip152_highbandwidth_to);
628 : 0 : X(m_bip152_highbandwidth_from);
629 : 0 : {
630 : 0 : LOCK(cs_vSend);
631 [ # # ]: 0 : X(mapSendBytesPerMsgType);
632 [ # # ]: 0 : X(nSendBytes);
633 : 0 : }
634 : 0 : {
635 : 0 : LOCK(cs_vRecv);
636 [ # # ]: 0 : X(mapRecvBytesPerMsgType);
637 : 0 : X(nRecvBytes);
638 : 0 : Transport::Info info = m_transport->GetInfo();
639 : 0 : stats.m_transport_type = info.transport_type;
640 [ # # # # ]: 0 : if (info.session_id) stats.m_session_id = HexStr(*info.session_id);
641 : 0 : }
642 : 0 : X(m_permission_flags);
643 : :
644 : 0 : X(m_last_ping_time);
645 : 0 : X(m_min_ping_time);
646 : :
647 : : // Leave string empty if addrLocal invalid (not filled in yet)
648 : 0 : CService addrLocalUnlocked = GetAddrLocal();
649 [ # # # # : 0 : stats.addrLocal = addrLocalUnlocked.IsValid() ? addrLocalUnlocked.ToStringAddrPort() : "";
# # # # ]
650 : :
651 : 0 : X(m_conn_type);
652 : 0 : }
653 : : #undef X
654 : :
655 : 0 : bool CNode::ReceiveMsgBytes(Span<const uint8_t> msg_bytes, bool& complete)
656 : : {
657 : 0 : complete = false;
658 : 0 : const auto time = GetTime<std::chrono::microseconds>();
659 : 0 : LOCK(cs_vRecv);
660 : 0 : m_last_recv = std::chrono::duration_cast<std::chrono::seconds>(time);
661 : 0 : nRecvBytes += msg_bytes.size();
662 [ # # ]: 0 : while (msg_bytes.size() > 0) {
663 : : // absorb network data
664 [ # # # # ]: 0 : if (!m_transport->ReceivedBytes(msg_bytes)) {
665 : : // Serious transport problem, disconnect from the peer.
666 : : return false;
667 : : }
668 : :
669 [ # # # # ]: 0 : if (m_transport->ReceivedMessageComplete()) {
670 : : // decompose a transport agnostic CNetMessage from the deserializer
671 : 0 : bool reject_message{false};
672 [ # # ]: 0 : CNetMessage msg = m_transport->GetReceivedMessage(time, reject_message);
673 [ # # ]: 0 : if (reject_message) {
674 : : // Message deserialization failed. Drop the message but don't disconnect the peer.
675 : : // store the size of the corrupt message
676 [ # # ]: 0 : mapRecvBytesPerMsgType.at(NET_MESSAGE_TYPE_OTHER) += msg.m_raw_message_size;
677 : 0 : continue;
678 : : }
679 : :
680 : : // Store received bytes per message type.
681 : : // To prevent a memory DOS, only allow known message types.
682 : 0 : auto i = mapRecvBytesPerMsgType.find(msg.m_type);
683 [ # # ]: 0 : if (i == mapRecvBytesPerMsgType.end()) {
684 : 0 : i = mapRecvBytesPerMsgType.find(NET_MESSAGE_TYPE_OTHER);
685 : : }
686 [ # # ]: 0 : assert(i != mapRecvBytesPerMsgType.end());
687 [ # # ]: 0 : i->second += msg.m_raw_message_size;
688 : :
689 : : // push the message to the process queue,
690 [ # # ]: 0 : vRecvMsg.push_back(std::move(msg));
691 : :
692 : 0 : complete = true;
693 : 0 : }
694 : : }
695 : :
696 : : return true;
697 : 0 : }
698 : :
699 : 0 : V1Transport::V1Transport(const NodeId node_id) noexcept
700 : 0 : : m_magic_bytes{Params().MessageStart()}, m_node_id{node_id}
701 : : {
702 : 0 : LOCK(m_recv_mutex);
703 [ # # ]: 0 : Reset();
704 : 0 : }
705 : :
706 : 0 : Transport::Info V1Transport::GetInfo() const noexcept
707 : : {
708 : 0 : return {.transport_type = TransportProtocolType::V1, .session_id = {}};
709 : : }
710 : :
711 : 0 : int V1Transport::readHeader(Span<const uint8_t> msg_bytes)
712 : : {
713 : 0 : AssertLockHeld(m_recv_mutex);
714 : : // copy data to temporary parsing buffer
715 : 0 : unsigned int nRemaining = CMessageHeader::HEADER_SIZE - nHdrPos;
716 [ # # ]: 0 : unsigned int nCopy = std::min<unsigned int>(nRemaining, msg_bytes.size());
717 : :
718 [ # # ]: 0 : memcpy(&hdrbuf[nHdrPos], msg_bytes.data(), nCopy);
719 : 0 : nHdrPos += nCopy;
720 : :
721 : : // if header incomplete, exit
722 [ # # ]: 0 : if (nHdrPos < CMessageHeader::HEADER_SIZE)
723 : 0 : return nCopy;
724 : :
725 : : // deserialize to CMessageHeader
726 : 0 : try {
727 [ # # ]: 0 : hdrbuf >> hdr;
728 : : }
729 [ - - ]: 0 : catch (const std::exception&) {
730 [ - - - - : 0 : LogDebug(BCLog::NET, "Header error: Unable to deserialize, peer=%d\n", m_node_id);
- - ]
731 : 0 : return -1;
732 : 0 : }
733 : :
734 : : // Check start string, network magic
735 [ # # ]: 0 : if (hdr.pchMessageStart != m_magic_bytes) {
736 [ # # # # ]: 0 : LogDebug(BCLog::NET, "Header error: Wrong MessageStart %s received, peer=%d\n", HexStr(hdr.pchMessageStart), m_node_id);
737 : 0 : return -1;
738 : : }
739 : :
740 : : // reject messages larger than MAX_SIZE or MAX_PROTOCOL_MESSAGE_LENGTH
741 [ # # ]: 0 : if (hdr.nMessageSize > MAX_SIZE || hdr.nMessageSize > MAX_PROTOCOL_MESSAGE_LENGTH) {
742 [ # # # # : 0 : LogDebug(BCLog::NET, "Header error: Size too large (%s, %u bytes), peer=%d\n", SanitizeString(hdr.GetMessageType()), hdr.nMessageSize, m_node_id);
# # ]
743 : 0 : return -1;
744 : : }
745 : :
746 : : // switch state to reading message data
747 : 0 : in_data = true;
748 : :
749 : 0 : return nCopy;
750 : : }
751 : :
752 : 0 : int V1Transport::readData(Span<const uint8_t> msg_bytes)
753 : : {
754 : 0 : AssertLockHeld(m_recv_mutex);
755 : 0 : unsigned int nRemaining = hdr.nMessageSize - nDataPos;
756 [ # # ]: 0 : unsigned int nCopy = std::min<unsigned int>(nRemaining, msg_bytes.size());
757 : :
758 [ # # ]: 0 : if (vRecv.size() < nDataPos + nCopy) {
759 : : // Allocate up to 256 KiB ahead, but never more than the total message size.
760 [ # # ]: 0 : vRecv.resize(std::min(hdr.nMessageSize, nDataPos + nCopy + 256 * 1024));
761 : : }
762 : :
763 : 0 : hasher.Write(msg_bytes.first(nCopy));
764 : 0 : memcpy(&vRecv[nDataPos], msg_bytes.data(), nCopy);
765 : 0 : nDataPos += nCopy;
766 : :
767 : 0 : return nCopy;
768 : : }
769 : :
770 : 0 : const uint256& V1Transport::GetMessageHash() const
771 : : {
772 : 0 : AssertLockHeld(m_recv_mutex);
773 [ # # # # ]: 0 : assert(CompleteInternal());
774 [ # # ]: 0 : if (data_hash.IsNull())
775 : 0 : hasher.Finalize(data_hash);
776 : 0 : return data_hash;
777 : : }
778 : :
779 : 0 : CNetMessage V1Transport::GetReceivedMessage(const std::chrono::microseconds time, bool& reject_message)
780 : : {
781 : 0 : AssertLockNotHeld(m_recv_mutex);
782 : : // Initialize out parameter
783 : 0 : reject_message = false;
784 : : // decompose a single CNetMessage from the TransportDeserializer
785 : 0 : LOCK(m_recv_mutex);
786 [ # # ]: 0 : CNetMessage msg(std::move(vRecv));
787 : :
788 : : // store message type string, time, and sizes
789 [ # # ]: 0 : msg.m_type = hdr.GetMessageType();
790 : 0 : msg.m_time = time;
791 : 0 : msg.m_message_size = hdr.nMessageSize;
792 : 0 : msg.m_raw_message_size = hdr.nMessageSize + CMessageHeader::HEADER_SIZE;
793 : :
794 [ # # ]: 0 : uint256 hash = GetMessageHash();
795 : :
796 : : // We just received a message off the wire, harvest entropy from the time (and the message checksum)
797 : 0 : RandAddEvent(ReadLE32(hash.begin()));
798 : :
799 : : // Check checksum and header message type string
800 [ # # ]: 0 : if (memcmp(hash.begin(), hdr.pchChecksum, CMessageHeader::CHECKSUM_SIZE) != 0) {
801 [ # # # # : 0 : LogDebug(BCLog::NET, "Header error: Wrong checksum (%s, %u bytes), expected %s was %s, peer=%d\n",
# # # # #
# # # ]
802 : : SanitizeString(msg.m_type), msg.m_message_size,
803 : : HexStr(Span{hash}.first(CMessageHeader::CHECKSUM_SIZE)),
804 : : HexStr(hdr.pchChecksum),
805 : : m_node_id);
806 : 0 : reject_message = true;
807 [ # # # # ]: 0 : } else if (!hdr.IsMessageTypeValid()) {
808 [ # # # # : 0 : LogDebug(BCLog::NET, "Header error: Invalid message type (%s, %u bytes), peer=%d\n",
# # # # #
# ]
809 : : SanitizeString(hdr.GetMessageType()), msg.m_message_size, m_node_id);
810 : 0 : reject_message = true;
811 : : }
812 : :
813 : : // Always reset the network deserializer (prepare for the next message)
814 [ # # ]: 0 : Reset();
815 [ # # ]: 0 : return msg;
816 : 0 : }
817 : :
818 : 0 : bool V1Transport::SetMessageToSend(CSerializedNetMsg& msg) noexcept
819 : : {
820 : 0 : AssertLockNotHeld(m_send_mutex);
821 : : // Determine whether a new message can be set.
822 : 0 : LOCK(m_send_mutex);
823 [ # # # # ]: 0 : if (m_sending_header || m_bytes_sent < m_message_to_send.data.size()) return false;
824 : :
825 : : // create dbl-sha256 checksum
826 : 0 : uint256 hash = Hash(msg.data);
827 : :
828 : : // create header
829 : 0 : CMessageHeader hdr(m_magic_bytes, msg.m_type.c_str(), msg.data.size());
830 [ # # ]: 0 : memcpy(hdr.pchChecksum, hash.begin(), CMessageHeader::CHECKSUM_SIZE);
831 : :
832 : : // serialize header
833 [ # # ]: 0 : m_header_to_send.clear();
834 : 0 : VectorWriter{m_header_to_send, 0, hdr};
835 : :
836 : : // update state
837 : 0 : m_message_to_send = std::move(msg);
838 : 0 : m_sending_header = true;
839 : 0 : m_bytes_sent = 0;
840 : 0 : return true;
841 : 0 : }
842 : :
843 : 0 : Transport::BytesToSend V1Transport::GetBytesToSend(bool have_next_message) const noexcept
844 : : {
845 : 0 : AssertLockNotHeld(m_send_mutex);
846 : 0 : LOCK(m_send_mutex);
847 [ # # ]: 0 : if (m_sending_header) {
848 [ # # ]: 0 : return {Span{m_header_to_send}.subspan(m_bytes_sent),
849 : : // We have more to send after the header if the message has payload, or if there
850 : : // is a next message after that.
851 [ # # # # ]: 0 : have_next_message || !m_message_to_send.data.empty(),
852 : 0 : m_message_to_send.m_type
853 : 0 : };
854 : : } else {
855 : 0 : return {Span{m_message_to_send.data}.subspan(m_bytes_sent),
856 : : // We only have more to send after this message's payload if there is another
857 : : // message.
858 : : have_next_message,
859 : 0 : m_message_to_send.m_type
860 : 0 : };
861 : : }
862 : 0 : }
863 : :
864 : 0 : void V1Transport::MarkBytesSent(size_t bytes_sent) noexcept
865 : : {
866 : 0 : AssertLockNotHeld(m_send_mutex);
867 : 0 : LOCK(m_send_mutex);
868 : 0 : m_bytes_sent += bytes_sent;
869 [ # # # # ]: 0 : if (m_sending_header && m_bytes_sent == m_header_to_send.size()) {
870 : : // We're done sending a message's header. Switch to sending its data bytes.
871 : 0 : m_sending_header = false;
872 : 0 : m_bytes_sent = 0;
873 [ # # # # ]: 0 : } else if (!m_sending_header && m_bytes_sent == m_message_to_send.data.size()) {
874 : : // We're done sending a message's data. Wipe the data vector to reduce memory consumption.
875 : 0 : ClearShrink(m_message_to_send.data);
876 : 0 : m_bytes_sent = 0;
877 : : }
878 : 0 : }
879 : :
880 : 0 : size_t V1Transport::GetSendMemoryUsage() const noexcept
881 : : {
882 : 0 : AssertLockNotHeld(m_send_mutex);
883 : 0 : LOCK(m_send_mutex);
884 : : // Don't count sending-side fields besides m_message_to_send, as they're all small and bounded.
885 [ # # ]: 0 : return m_message_to_send.GetMemoryUsage();
886 : 0 : }
887 : :
888 : : namespace {
889 : :
890 : : /** List of short messages as defined in BIP324, in order.
891 : : *
892 : : * Only message types that are actually implemented in this codebase need to be listed, as other
893 : : * messages get ignored anyway - whether we know how to decode them or not.
894 : : */
895 : : const std::array<std::string, 33> V2_MESSAGE_IDS = {
896 : : "", // 12 bytes follow encoding the message type like in V1
897 : : NetMsgType::ADDR,
898 : : NetMsgType::BLOCK,
899 : : NetMsgType::BLOCKTXN,
900 : : NetMsgType::CMPCTBLOCK,
901 : : NetMsgType::FEEFILTER,
902 : : NetMsgType::FILTERADD,
903 : : NetMsgType::FILTERCLEAR,
904 : : NetMsgType::FILTERLOAD,
905 : : NetMsgType::GETBLOCKS,
906 : : NetMsgType::GETBLOCKTXN,
907 : : NetMsgType::GETDATA,
908 : : NetMsgType::GETHEADERS,
909 : : NetMsgType::HEADERS,
910 : : NetMsgType::INV,
911 : : NetMsgType::MEMPOOL,
912 : : NetMsgType::MERKLEBLOCK,
913 : : NetMsgType::NOTFOUND,
914 : : NetMsgType::PING,
915 : : NetMsgType::PONG,
916 : : NetMsgType::SENDCMPCT,
917 : : NetMsgType::TX,
918 : : NetMsgType::GETCFILTERS,
919 : : NetMsgType::CFILTER,
920 : : NetMsgType::GETCFHEADERS,
921 : : NetMsgType::CFHEADERS,
922 : : NetMsgType::GETCFCHECKPT,
923 : : NetMsgType::CFCHECKPT,
924 : : NetMsgType::ADDRV2,
925 : : // Unimplemented message types that are assigned in BIP324:
926 : : "",
927 : : "",
928 : : "",
929 : : ""
930 : : };
931 : :
932 : : class V2MessageMap
933 : : {
934 : : std::unordered_map<std::string, uint8_t> m_map;
935 : :
936 : : public:
937 : 2 : V2MessageMap() noexcept
938 : 2 : {
939 [ + + ]: 66 : for (size_t i = 1; i < std::size(V2_MESSAGE_IDS); ++i) {
940 : 64 : m_map.emplace(V2_MESSAGE_IDS[i], i);
941 : : }
942 : 2 : }
943 : :
944 : 0 : std::optional<uint8_t> operator()(const std::string& message_name) const noexcept
945 : : {
946 : 0 : auto it = m_map.find(message_name);
947 [ # # ]: 0 : if (it == m_map.end()) return std::nullopt;
948 : 0 : return it->second;
949 : : }
950 : : };
951 : :
952 : : const V2MessageMap V2_MESSAGE_MAP;
953 : :
954 : 0 : std::vector<uint8_t> GenerateRandomGarbage() noexcept
955 : : {
956 : 0 : std::vector<uint8_t> ret;
957 : 0 : FastRandomContext rng;
958 : 0 : ret.resize(rng.randrange(V2Transport::MAX_GARBAGE_LEN + 1));
959 : 0 : rng.fillrand(MakeWritableByteSpan(ret));
960 : 0 : return ret;
961 : 0 : }
962 : :
963 : : } // namespace
964 : :
965 : 0 : void V2Transport::StartSendingHandshake() noexcept
966 : : {
967 : 0 : AssertLockHeld(m_send_mutex);
968 : 0 : Assume(m_send_state == SendState::AWAITING_KEY);
969 : 0 : Assume(m_send_buffer.empty());
970 : : // Initialize the send buffer with ellswift pubkey + provided garbage.
971 : 0 : m_send_buffer.resize(EllSwiftPubKey::size() + m_send_garbage.size());
972 : 0 : std::copy(std::begin(m_cipher.GetOurPubKey()), std::end(m_cipher.GetOurPubKey()), MakeWritableByteSpan(m_send_buffer).begin());
973 : 0 : std::copy(m_send_garbage.begin(), m_send_garbage.end(), m_send_buffer.begin() + EllSwiftPubKey::size());
974 : : // We cannot wipe m_send_garbage as it will still be used as AAD later in the handshake.
975 : 0 : }
976 : :
977 : 0 : V2Transport::V2Transport(NodeId nodeid, bool initiating, const CKey& key, Span<const std::byte> ent32, std::vector<uint8_t> garbage) noexcept
978 : 0 : : m_cipher{key, ent32}, m_initiating{initiating}, m_nodeid{nodeid},
979 : 0 : m_v1_fallback{nodeid},
980 [ # # ]: 0 : m_recv_state{initiating ? RecvState::KEY : RecvState::KEY_MAYBE_V1},
981 : 0 : m_send_garbage{std::move(garbage)},
982 [ # # ]: 0 : m_send_state{initiating ? SendState::AWAITING_KEY : SendState::MAYBE_V1}
983 : : {
984 : 0 : Assume(m_send_garbage.size() <= MAX_GARBAGE_LEN);
985 : : // Start sending immediately if we're the initiator of the connection.
986 [ # # ]: 0 : if (initiating) {
987 : 0 : LOCK(m_send_mutex);
988 [ # # ]: 0 : StartSendingHandshake();
989 : 0 : }
990 : 0 : }
991 : :
992 : 0 : V2Transport::V2Transport(NodeId nodeid, bool initiating) noexcept
993 : 0 : : V2Transport{nodeid, initiating, GenerateRandomKey(),
994 : 0 : MakeByteSpan(GetRandHash()), GenerateRandomGarbage()} {}
995 : :
996 : 0 : void V2Transport::SetReceiveState(RecvState recv_state) noexcept
997 : : {
998 : 0 : AssertLockHeld(m_recv_mutex);
999 : : // Enforce allowed state transitions.
1000 [ # # # # : 0 : switch (m_recv_state) {
# # # # ]
1001 : 0 : case RecvState::KEY_MAYBE_V1:
1002 : 0 : Assume(recv_state == RecvState::KEY || recv_state == RecvState::V1);
1003 : 0 : break;
1004 : 0 : case RecvState::KEY:
1005 : 0 : Assume(recv_state == RecvState::GARB_GARBTERM);
1006 : 0 : break;
1007 : 0 : case RecvState::GARB_GARBTERM:
1008 : 0 : Assume(recv_state == RecvState::VERSION);
1009 : 0 : break;
1010 : 0 : case RecvState::VERSION:
1011 : 0 : Assume(recv_state == RecvState::APP);
1012 : 0 : break;
1013 : 0 : case RecvState::APP:
1014 : 0 : Assume(recv_state == RecvState::APP_READY);
1015 : 0 : break;
1016 : 0 : case RecvState::APP_READY:
1017 : 0 : Assume(recv_state == RecvState::APP);
1018 : 0 : break;
1019 : 0 : case RecvState::V1:
1020 : 0 : Assume(false); // V1 state cannot be left
1021 : 0 : break;
1022 : : }
1023 : : // Change state.
1024 : 0 : m_recv_state = recv_state;
1025 : 0 : }
1026 : :
1027 : 0 : void V2Transport::SetSendState(SendState send_state) noexcept
1028 : : {
1029 : 0 : AssertLockHeld(m_send_mutex);
1030 : : // Enforce allowed state transitions.
1031 [ # # # # ]: 0 : switch (m_send_state) {
1032 : 0 : case SendState::MAYBE_V1:
1033 : 0 : Assume(send_state == SendState::V1 || send_state == SendState::AWAITING_KEY);
1034 : 0 : break;
1035 : 0 : case SendState::AWAITING_KEY:
1036 : 0 : Assume(send_state == SendState::READY);
1037 : 0 : break;
1038 : 0 : case SendState::READY:
1039 : 0 : case SendState::V1:
1040 : 0 : Assume(false); // Final states
1041 : 0 : break;
1042 : : }
1043 : : // Change state.
1044 : 0 : m_send_state = send_state;
1045 : 0 : }
1046 : :
1047 : 0 : bool V2Transport::ReceivedMessageComplete() const noexcept
1048 : : {
1049 : 0 : AssertLockNotHeld(m_recv_mutex);
1050 : 0 : LOCK(m_recv_mutex);
1051 [ # # ]: 0 : if (m_recv_state == RecvState::V1) return m_v1_fallback.ReceivedMessageComplete();
1052 : :
1053 : 0 : return m_recv_state == RecvState::APP_READY;
1054 : 0 : }
1055 : :
1056 : 0 : void V2Transport::ProcessReceivedMaybeV1Bytes() noexcept
1057 : : {
1058 : 0 : AssertLockHeld(m_recv_mutex);
1059 : 0 : AssertLockNotHeld(m_send_mutex);
1060 : 0 : Assume(m_recv_state == RecvState::KEY_MAYBE_V1);
1061 : : // We still have to determine if this is a v1 or v2 connection. The bytes being received could
1062 : : // be the beginning of either a v1 packet (network magic + "version\x00\x00\x00\x00\x00"), or
1063 : : // of a v2 public key. BIP324 specifies that a mismatch with this 16-byte string should trigger
1064 : : // sending of the key.
1065 : 0 : std::array<uint8_t, V1_PREFIX_LEN> v1_prefix = {0, 0, 0, 0, 'v', 'e', 'r', 's', 'i', 'o', 'n', 0, 0, 0, 0, 0};
1066 : 0 : std::copy(std::begin(Params().MessageStart()), std::end(Params().MessageStart()), v1_prefix.begin());
1067 : 0 : Assume(m_recv_buffer.size() <= v1_prefix.size());
1068 [ # # ]: 0 : if (!std::equal(m_recv_buffer.begin(), m_recv_buffer.end(), v1_prefix.begin())) {
1069 : : // Mismatch with v1 prefix, so we can assume a v2 connection.
1070 : 0 : SetReceiveState(RecvState::KEY); // Convert to KEY state, leaving received bytes around.
1071 : : // Transition the sender to AWAITING_KEY state and start sending.
1072 : 0 : LOCK(m_send_mutex);
1073 : 0 : SetSendState(SendState::AWAITING_KEY);
1074 [ # # ]: 0 : StartSendingHandshake();
1075 [ # # ]: 0 : } else if (m_recv_buffer.size() == v1_prefix.size()) {
1076 : : // Full match with the v1 prefix, so fall back to v1 behavior.
1077 : 0 : LOCK(m_send_mutex);
1078 : 0 : Span<const uint8_t> feedback{m_recv_buffer};
1079 : : // Feed already received bytes to v1 transport. It should always accept these, because it's
1080 : : // less than the size of a v1 header, and these are the first bytes fed to m_v1_fallback.
1081 : 0 : bool ret = m_v1_fallback.ReceivedBytes(feedback);
1082 : 0 : Assume(feedback.empty());
1083 : 0 : Assume(ret);
1084 : 0 : SetReceiveState(RecvState::V1);
1085 : 0 : SetSendState(SendState::V1);
1086 : : // Reset v2 transport buffers to save memory.
1087 : 0 : ClearShrink(m_recv_buffer);
1088 [ # # ]: 0 : ClearShrink(m_send_buffer);
1089 : 0 : } else {
1090 : : // We have not received enough to distinguish v1 from v2 yet. Wait until more bytes come.
1091 : : }
1092 : 0 : }
1093 : :
1094 : 0 : bool V2Transport::ProcessReceivedKeyBytes() noexcept
1095 : : {
1096 : 0 : AssertLockHeld(m_recv_mutex);
1097 : 0 : AssertLockNotHeld(m_send_mutex);
1098 : 0 : Assume(m_recv_state == RecvState::KEY);
1099 : 0 : Assume(m_recv_buffer.size() <= EllSwiftPubKey::size());
1100 : :
1101 : : // As a special exception, if bytes 4-16 of the key on a responder connection match the
1102 : : // corresponding bytes of a V1 version message, but bytes 0-4 don't match the network magic
1103 : : // (if they did, we'd have switched to V1 state already), assume this is a peer from
1104 : : // another network, and disconnect them. They will almost certainly disconnect us too when
1105 : : // they receive our uniformly random key and garbage, but detecting this case specially
1106 : : // means we can log it.
1107 : 0 : static constexpr std::array<uint8_t, 12> MATCH = {'v', 'e', 'r', 's', 'i', 'o', 'n', 0, 0, 0, 0, 0};
1108 : 0 : static constexpr size_t OFFSET = std::tuple_size_v<MessageStartChars>;
1109 [ # # # # ]: 0 : if (!m_initiating && m_recv_buffer.size() >= OFFSET + MATCH.size()) {
1110 [ # # ]: 0 : if (std::equal(MATCH.begin(), MATCH.end(), m_recv_buffer.begin() + OFFSET)) {
1111 [ # # ]: 0 : LogDebug(BCLog::NET, "V2 transport error: V1 peer with wrong MessageStart %s\n",
1112 : : HexStr(Span(m_recv_buffer).first(OFFSET)));
1113 : 0 : return false;
1114 : : }
1115 : : }
1116 : :
1117 [ # # ]: 0 : if (m_recv_buffer.size() == EllSwiftPubKey::size()) {
1118 : : // Other side's key has been fully received, and can now be Diffie-Hellman combined with
1119 : : // our key to initialize the encryption ciphers.
1120 : :
1121 : : // Initialize the ciphers.
1122 : 0 : EllSwiftPubKey ellswift(MakeByteSpan(m_recv_buffer));
1123 : 0 : LOCK(m_send_mutex);
1124 : 0 : m_cipher.Initialize(ellswift, m_initiating);
1125 : :
1126 : : // Switch receiver state to GARB_GARBTERM.
1127 : 0 : SetReceiveState(RecvState::GARB_GARBTERM);
1128 [ # # ]: 0 : m_recv_buffer.clear();
1129 : :
1130 : : // Switch sender state to READY.
1131 : 0 : SetSendState(SendState::READY);
1132 : :
1133 : : // Append the garbage terminator to the send buffer.
1134 : 0 : m_send_buffer.resize(m_send_buffer.size() + BIP324Cipher::GARBAGE_TERMINATOR_LEN);
1135 : 0 : std::copy(m_cipher.GetSendGarbageTerminator().begin(),
1136 : 0 : m_cipher.GetSendGarbageTerminator().end(),
1137 : 0 : MakeWritableByteSpan(m_send_buffer).last(BIP324Cipher::GARBAGE_TERMINATOR_LEN).begin());
1138 : :
1139 : : // Construct version packet in the send buffer, with the sent garbage data as AAD.
1140 : 0 : m_send_buffer.resize(m_send_buffer.size() + BIP324Cipher::EXPANSION + VERSION_CONTENTS.size());
1141 : 0 : m_cipher.Encrypt(
1142 : : /*contents=*/VERSION_CONTENTS,
1143 : 0 : /*aad=*/MakeByteSpan(m_send_garbage),
1144 : : /*ignore=*/false,
1145 : 0 : /*output=*/MakeWritableByteSpan(m_send_buffer).last(BIP324Cipher::EXPANSION + VERSION_CONTENTS.size()));
1146 : : // We no longer need the garbage.
1147 [ # # ]: 0 : ClearShrink(m_send_garbage);
1148 : 0 : } else {
1149 : : // We still have to receive more key bytes.
1150 : : }
1151 : : return true;
1152 : : }
1153 : :
1154 : 0 : bool V2Transport::ProcessReceivedGarbageBytes() noexcept
1155 : : {
1156 : 0 : AssertLockHeld(m_recv_mutex);
1157 : 0 : Assume(m_recv_state == RecvState::GARB_GARBTERM);
1158 : 0 : Assume(m_recv_buffer.size() <= MAX_GARBAGE_LEN + BIP324Cipher::GARBAGE_TERMINATOR_LEN);
1159 [ # # ]: 0 : if (m_recv_buffer.size() >= BIP324Cipher::GARBAGE_TERMINATOR_LEN) {
1160 [ # # ]: 0 : if (std::ranges::equal(MakeByteSpan(m_recv_buffer).last(BIP324Cipher::GARBAGE_TERMINATOR_LEN), m_cipher.GetReceiveGarbageTerminator())) {
1161 : : // Garbage terminator received. Store garbage to authenticate it as AAD later.
1162 : 0 : m_recv_aad = std::move(m_recv_buffer);
1163 : 0 : m_recv_aad.resize(m_recv_aad.size() - BIP324Cipher::GARBAGE_TERMINATOR_LEN);
1164 [ # # ]: 0 : m_recv_buffer.clear();
1165 : 0 : SetReceiveState(RecvState::VERSION);
1166 [ # # ]: 0 : } else if (m_recv_buffer.size() == MAX_GARBAGE_LEN + BIP324Cipher::GARBAGE_TERMINATOR_LEN) {
1167 : : // We've reached the maximum length for garbage + garbage terminator, and the
1168 : : // terminator still does not match. Abort.
1169 [ # # ]: 0 : LogDebug(BCLog::NET, "V2 transport error: missing garbage terminator, peer=%d\n", m_nodeid);
1170 : 0 : return false;
1171 : : } else {
1172 : : // We still need to receive more garbage and/or garbage terminator bytes.
1173 : : }
1174 : : } else {
1175 : : // We have less than GARBAGE_TERMINATOR_LEN (16) bytes, so we certainly need to receive
1176 : : // more first.
1177 : : }
1178 : : return true;
1179 : : }
1180 : :
1181 : 0 : bool V2Transport::ProcessReceivedPacketBytes() noexcept
1182 : : {
1183 : 0 : AssertLockHeld(m_recv_mutex);
1184 : 0 : Assume(m_recv_state == RecvState::VERSION || m_recv_state == RecvState::APP);
1185 : :
1186 : : // The maximum permitted contents length for a packet, consisting of:
1187 : : // - 0x00 byte: indicating long message type encoding
1188 : : // - 12 bytes of message type
1189 : : // - payload
1190 : 0 : static constexpr size_t MAX_CONTENTS_LEN =
1191 : : 1 + CMessageHeader::MESSAGE_TYPE_SIZE +
1192 : : std::min<size_t>(MAX_SIZE, MAX_PROTOCOL_MESSAGE_LENGTH);
1193 : :
1194 [ # # ]: 0 : if (m_recv_buffer.size() == BIP324Cipher::LENGTH_LEN) {
1195 : : // Length descriptor received.
1196 : 0 : m_recv_len = m_cipher.DecryptLength(MakeByteSpan(m_recv_buffer));
1197 [ # # ]: 0 : if (m_recv_len > MAX_CONTENTS_LEN) {
1198 [ # # ]: 0 : LogDebug(BCLog::NET, "V2 transport error: packet too large (%u bytes), peer=%d\n", m_recv_len, m_nodeid);
1199 : 0 : return false;
1200 : : }
1201 [ # # # # ]: 0 : } else if (m_recv_buffer.size() > BIP324Cipher::LENGTH_LEN && m_recv_buffer.size() == m_recv_len + BIP324Cipher::EXPANSION) {
1202 : : // Ciphertext received, decrypt it into m_recv_decode_buffer.
1203 : : // Note that it is impossible to reach this branch without hitting the branch above first,
1204 : : // as GetMaxBytesToProcess only allows up to LENGTH_LEN into the buffer before that point.
1205 : 0 : m_recv_decode_buffer.resize(m_recv_len);
1206 : 0 : bool ignore{false};
1207 : 0 : bool ret = m_cipher.Decrypt(
1208 : 0 : /*input=*/MakeByteSpan(m_recv_buffer).subspan(BIP324Cipher::LENGTH_LEN),
1209 : 0 : /*aad=*/MakeByteSpan(m_recv_aad),
1210 : : /*ignore=*/ignore,
1211 : : /*contents=*/MakeWritableByteSpan(m_recv_decode_buffer));
1212 [ # # ]: 0 : if (!ret) {
1213 [ # # ]: 0 : LogDebug(BCLog::NET, "V2 transport error: packet decryption failure (%u bytes), peer=%d\n", m_recv_len, m_nodeid);
1214 : 0 : return false;
1215 : : }
1216 : : // We have decrypted a valid packet with the AAD we expected, so clear the expected AAD.
1217 : 0 : ClearShrink(m_recv_aad);
1218 : : // Feed the last 4 bytes of the Poly1305 authentication tag (and its timing) into our RNG.
1219 : 0 : RandAddEvent(ReadLE32(m_recv_buffer.data() + m_recv_buffer.size() - 4));
1220 : :
1221 : : // At this point we have a valid packet decrypted into m_recv_decode_buffer. If it's not a
1222 : : // decoy, which we simply ignore, use the current state to decide what to do with it.
1223 [ # # ]: 0 : if (!ignore) {
1224 [ # # # ]: 0 : switch (m_recv_state) {
1225 : 0 : case RecvState::VERSION:
1226 : : // Version message received; transition to application phase. The contents is
1227 : : // ignored, but can be used for future extensions.
1228 : 0 : SetReceiveState(RecvState::APP);
1229 : 0 : break;
1230 : 0 : case RecvState::APP:
1231 : : // Application message decrypted correctly. It can be extracted using GetMessage().
1232 : 0 : SetReceiveState(RecvState::APP_READY);
1233 : 0 : break;
1234 : 0 : default:
1235 : : // Any other state is invalid (this function should not have been called).
1236 : 0 : Assume(false);
1237 : : }
1238 : : }
1239 : : // Wipe the receive buffer where the next packet will be received into.
1240 : 0 : ClearShrink(m_recv_buffer);
1241 : : // In all but APP_READY state, we can wipe the decoded contents.
1242 [ # # ]: 0 : if (m_recv_state != RecvState::APP_READY) ClearShrink(m_recv_decode_buffer);
1243 : : } else {
1244 : : // We either have less than 3 bytes, so we don't know the packet's length yet, or more
1245 : : // than 3 bytes but less than the packet's full ciphertext. Wait until those arrive.
1246 : : }
1247 : : return true;
1248 : : }
1249 : :
1250 : 0 : size_t V2Transport::GetMaxBytesToProcess() noexcept
1251 : : {
1252 : 0 : AssertLockHeld(m_recv_mutex);
1253 [ # # # # : 0 : switch (m_recv_state) {
# # # ]
1254 : 0 : case RecvState::KEY_MAYBE_V1:
1255 : : // During the KEY_MAYBE_V1 state we do not allow more than the length of v1 prefix into the
1256 : : // receive buffer.
1257 : 0 : Assume(m_recv_buffer.size() <= V1_PREFIX_LEN);
1258 : : // As long as we're not sure if this is a v1 or v2 connection, don't receive more than what
1259 : : // is strictly necessary to distinguish the two (16 bytes). If we permitted more than
1260 : : // the v1 header size (24 bytes), we may not be able to feed the already-received bytes
1261 : : // back into the m_v1_fallback V1 transport.
1262 : 0 : return V1_PREFIX_LEN - m_recv_buffer.size();
1263 : 0 : case RecvState::KEY:
1264 : : // During the KEY state, we only allow the 64-byte key into the receive buffer.
1265 : 0 : Assume(m_recv_buffer.size() <= EllSwiftPubKey::size());
1266 : : // As long as we have not received the other side's public key, don't receive more than
1267 : : // that (64 bytes), as garbage follows, and locating the garbage terminator requires the
1268 : : // key exchange first.
1269 : 0 : return EllSwiftPubKey::size() - m_recv_buffer.size();
1270 : : case RecvState::GARB_GARBTERM:
1271 : : // Process garbage bytes one by one (because terminator may appear anywhere).
1272 : : return 1;
1273 : 0 : case RecvState::VERSION:
1274 : 0 : case RecvState::APP:
1275 : : // These three states all involve decoding a packet. Process the length descriptor first,
1276 : : // so that we know where the current packet ends (and we don't process bytes from the next
1277 : : // packet or decoy yet). Then, process the ciphertext bytes of the current packet.
1278 [ # # ]: 0 : if (m_recv_buffer.size() < BIP324Cipher::LENGTH_LEN) {
1279 : 0 : return BIP324Cipher::LENGTH_LEN - m_recv_buffer.size();
1280 : : } else {
1281 : : // Note that BIP324Cipher::EXPANSION is the total difference between contents size
1282 : : // and encoded packet size, which includes the 3 bytes due to the packet length.
1283 : : // When transitioning from receiving the packet length to receiving its ciphertext,
1284 : : // the encrypted packet length is left in the receive buffer.
1285 : 0 : return BIP324Cipher::EXPANSION + m_recv_len - m_recv_buffer.size();
1286 : : }
1287 : 0 : case RecvState::APP_READY:
1288 : : // No bytes can be processed until GetMessage() is called.
1289 : 0 : return 0;
1290 : 0 : case RecvState::V1:
1291 : : // Not allowed (must be dealt with by the caller).
1292 : 0 : Assume(false);
1293 : 0 : return 0;
1294 : : }
1295 : 0 : Assume(false); // unreachable
1296 : 0 : return 0;
1297 : : }
1298 : :
1299 : 0 : bool V2Transport::ReceivedBytes(Span<const uint8_t>& msg_bytes) noexcept
1300 : : {
1301 : 0 : AssertLockNotHeld(m_recv_mutex);
1302 : : /** How many bytes to allocate in the receive buffer at most above what is received so far. */
1303 : 0 : static constexpr size_t MAX_RESERVE_AHEAD = 256 * 1024;
1304 : :
1305 : 0 : LOCK(m_recv_mutex);
1306 [ # # ]: 0 : if (m_recv_state == RecvState::V1) return m_v1_fallback.ReceivedBytes(msg_bytes);
1307 : :
1308 : : // Process the provided bytes in msg_bytes in a loop. In each iteration a nonzero number of
1309 : : // bytes (decided by GetMaxBytesToProcess) are taken from the beginning om msg_bytes, and
1310 : : // appended to m_recv_buffer. Then, depending on the receiver state, one of the
1311 : : // ProcessReceived*Bytes functions is called to process the bytes in that buffer.
1312 [ # # ]: 0 : while (!msg_bytes.empty()) {
1313 : : // Decide how many bytes to copy from msg_bytes to m_recv_buffer.
1314 : 0 : size_t max_read = GetMaxBytesToProcess();
1315 : :
1316 : : // Reserve space in the buffer if there is not enough.
1317 [ # # # # ]: 0 : if (m_recv_buffer.size() + std::min(msg_bytes.size(), max_read) > m_recv_buffer.capacity()) {
1318 [ # # # # : 0 : switch (m_recv_state) {
# ]
1319 : 0 : case RecvState::KEY_MAYBE_V1:
1320 : 0 : case RecvState::KEY:
1321 : 0 : case RecvState::GARB_GARBTERM:
1322 : : // During the initial states (key/garbage), allocate once to fit the maximum (4111
1323 : : // bytes).
1324 : 0 : m_recv_buffer.reserve(MAX_GARBAGE_LEN + BIP324Cipher::GARBAGE_TERMINATOR_LEN);
1325 : 0 : break;
1326 : 0 : case RecvState::VERSION:
1327 : 0 : case RecvState::APP: {
1328 : : // During states where a packet is being received, as much as is expected but never
1329 : : // more than MAX_RESERVE_AHEAD bytes in addition to what is received so far.
1330 : : // This means attackers that want to cause us to waste allocated memory are limited
1331 : : // to MAX_RESERVE_AHEAD above the largest allowed message contents size, and to
1332 : : // MAX_RESERVE_AHEAD more than they've actually sent us.
1333 [ # # ]: 0 : size_t alloc_add = std::min(max_read, msg_bytes.size() + MAX_RESERVE_AHEAD);
1334 : 0 : m_recv_buffer.reserve(m_recv_buffer.size() + alloc_add);
1335 : 0 : break;
1336 : : }
1337 : 0 : case RecvState::APP_READY:
1338 : : // The buffer is empty in this state.
1339 : 0 : Assume(m_recv_buffer.empty());
1340 : 0 : break;
1341 : 0 : case RecvState::V1:
1342 : : // Should have bailed out above.
1343 : 0 : Assume(false);
1344 : 0 : break;
1345 : : }
1346 : : }
1347 : :
1348 : : // Can't read more than provided input.
1349 [ # # ]: 0 : max_read = std::min(msg_bytes.size(), max_read);
1350 : : // Copy data to buffer.
1351 : 0 : m_recv_buffer.insert(m_recv_buffer.end(), UCharCast(msg_bytes.data()), UCharCast(msg_bytes.data() + max_read));
1352 [ # # # # : 0 : msg_bytes = msg_bytes.subspan(max_read);
# # # ]
1353 : :
1354 : : // Process data in the buffer.
1355 [ # # # # : 0 : switch (m_recv_state) {
# # # ]
1356 : 0 : case RecvState::KEY_MAYBE_V1:
1357 : 0 : ProcessReceivedMaybeV1Bytes();
1358 [ # # ]: 0 : if (m_recv_state == RecvState::V1) return true;
1359 : : break;
1360 : :
1361 : 0 : case RecvState::KEY:
1362 [ # # ]: 0 : if (!ProcessReceivedKeyBytes()) return false;
1363 : : break;
1364 : :
1365 : 0 : case RecvState::GARB_GARBTERM:
1366 [ # # ]: 0 : if (!ProcessReceivedGarbageBytes()) return false;
1367 : : break;
1368 : :
1369 : 0 : case RecvState::VERSION:
1370 : 0 : case RecvState::APP:
1371 [ # # ]: 0 : if (!ProcessReceivedPacketBytes()) return false;
1372 : : break;
1373 : :
1374 : : case RecvState::APP_READY:
1375 : : return true;
1376 : :
1377 : 0 : case RecvState::V1:
1378 : : // We should have bailed out before.
1379 : 0 : Assume(false);
1380 : 0 : break;
1381 : : }
1382 : : // Make sure we have made progress before continuing.
1383 : 0 : Assume(max_read > 0);
1384 : : }
1385 : :
1386 : : return true;
1387 : 0 : }
1388 : :
1389 : 0 : std::optional<std::string> V2Transport::GetMessageType(Span<const uint8_t>& contents) noexcept
1390 : : {
1391 [ # # ]: 0 : if (contents.size() == 0) return std::nullopt; // Empty contents
1392 [ # # ]: 0 : uint8_t first_byte = contents[0];
1393 [ # # ]: 0 : contents = contents.subspan(1); // Strip first byte.
1394 : :
1395 [ # # ]: 0 : if (first_byte != 0) {
1396 : : // Short (1 byte) encoding.
1397 [ # # ]: 0 : if (first_byte < std::size(V2_MESSAGE_IDS)) {
1398 : : // Valid short message id.
1399 : 0 : return V2_MESSAGE_IDS[first_byte];
1400 : : } else {
1401 : : // Unknown short message id.
1402 : 0 : return std::nullopt;
1403 : : }
1404 : : }
1405 : :
1406 [ # # ]: 0 : if (contents.size() < CMessageHeader::MESSAGE_TYPE_SIZE) {
1407 : 0 : return std::nullopt; // Long encoding needs 12 message type bytes.
1408 : : }
1409 : :
1410 : : size_t msg_type_len{0};
1411 [ # # # # ]: 0 : while (msg_type_len < CMessageHeader::MESSAGE_TYPE_SIZE && contents[msg_type_len] != 0) {
1412 : : // Verify that message type bytes before the first 0x00 are in range.
1413 [ # # # # ]: 0 : if (contents[msg_type_len] < ' ' || contents[msg_type_len] > 0x7F) {
1414 : 0 : return {};
1415 : : }
1416 : 0 : ++msg_type_len;
1417 : : }
1418 : 0 : std::string ret{reinterpret_cast<const char*>(contents.data()), msg_type_len};
1419 [ # # ]: 0 : while (msg_type_len < CMessageHeader::MESSAGE_TYPE_SIZE) {
1420 : : // Verify that message type bytes after the first 0x00 are also 0x00.
1421 [ # # ]: 0 : if (contents[msg_type_len] != 0) return {};
1422 : 0 : ++msg_type_len;
1423 : : }
1424 : : // Strip message type bytes of contents.
1425 : 0 : contents = contents.subspan(CMessageHeader::MESSAGE_TYPE_SIZE);
1426 : 0 : return ret;
1427 : 0 : }
1428 : :
1429 : 0 : CNetMessage V2Transport::GetReceivedMessage(std::chrono::microseconds time, bool& reject_message) noexcept
1430 : : {
1431 : 0 : AssertLockNotHeld(m_recv_mutex);
1432 : 0 : LOCK(m_recv_mutex);
1433 [ # # ]: 0 : if (m_recv_state == RecvState::V1) return m_v1_fallback.GetReceivedMessage(time, reject_message);
1434 : :
1435 : 0 : Assume(m_recv_state == RecvState::APP_READY);
1436 : 0 : Span<const uint8_t> contents{m_recv_decode_buffer};
1437 : 0 : auto msg_type = GetMessageType(contents);
1438 : 0 : CNetMessage msg{DataStream{}};
1439 : : // Note that BIP324Cipher::EXPANSION also includes the length descriptor size.
1440 [ # # ]: 0 : msg.m_raw_message_size = m_recv_decode_buffer.size() + BIP324Cipher::EXPANSION;
1441 [ # # ]: 0 : if (msg_type) {
1442 : 0 : reject_message = false;
1443 : 0 : msg.m_type = std::move(*msg_type);
1444 : 0 : msg.m_time = time;
1445 : 0 : msg.m_message_size = contents.size();
1446 : 0 : msg.m_recv.resize(contents.size());
1447 : 0 : std::copy(contents.begin(), contents.end(), UCharCast(msg.m_recv.data()));
1448 : : } else {
1449 [ # # ]: 0 : LogDebug(BCLog::NET, "V2 transport error: invalid message type (%u bytes contents), peer=%d\n", m_recv_decode_buffer.size(), m_nodeid);
1450 : 0 : reject_message = true;
1451 : : }
1452 : 0 : ClearShrink(m_recv_decode_buffer);
1453 : 0 : SetReceiveState(RecvState::APP);
1454 : :
1455 : 0 : return msg;
1456 : 0 : }
1457 : :
1458 : 0 : bool V2Transport::SetMessageToSend(CSerializedNetMsg& msg) noexcept
1459 : : {
1460 : 0 : AssertLockNotHeld(m_send_mutex);
1461 : 0 : LOCK(m_send_mutex);
1462 [ # # ]: 0 : if (m_send_state == SendState::V1) return m_v1_fallback.SetMessageToSend(msg);
1463 : : // We only allow adding a new message to be sent when in the READY state (so the packet cipher
1464 : : // is available) and the send buffer is empty. This limits the number of messages in the send
1465 : : // buffer to just one, and leaves the responsibility for queueing them up to the caller.
1466 [ # # # # ]: 0 : if (!(m_send_state == SendState::READY && m_send_buffer.empty())) return false;
1467 : : // Construct contents (encoding message type + payload).
1468 : 0 : std::vector<uint8_t> contents;
1469 : 0 : auto short_message_id = V2_MESSAGE_MAP(msg.m_type);
1470 [ # # ]: 0 : if (short_message_id) {
1471 : 0 : contents.resize(1 + msg.data.size());
1472 : 0 : contents[0] = *short_message_id;
1473 : 0 : std::copy(msg.data.begin(), msg.data.end(), contents.begin() + 1);
1474 : : } else {
1475 : : // Initialize with zeroes, and then write the message type string starting at offset 1.
1476 : : // This means contents[0] and the unused positions in contents[1..13] remain 0x00.
1477 : 0 : contents.resize(1 + CMessageHeader::MESSAGE_TYPE_SIZE + msg.data.size(), 0);
1478 : 0 : std::copy(msg.m_type.begin(), msg.m_type.end(), contents.data() + 1);
1479 : 0 : std::copy(msg.data.begin(), msg.data.end(), contents.begin() + 1 + CMessageHeader::MESSAGE_TYPE_SIZE);
1480 : : }
1481 : : // Construct ciphertext in send buffer.
1482 : 0 : m_send_buffer.resize(contents.size() + BIP324Cipher::EXPANSION);
1483 : 0 : m_cipher.Encrypt(MakeByteSpan(contents), {}, false, MakeWritableByteSpan(m_send_buffer));
1484 : 0 : m_send_type = msg.m_type;
1485 : : // Release memory
1486 : 0 : ClearShrink(msg.data);
1487 : 0 : return true;
1488 : 0 : }
1489 : :
1490 : 0 : Transport::BytesToSend V2Transport::GetBytesToSend(bool have_next_message) const noexcept
1491 : : {
1492 : 0 : AssertLockNotHeld(m_send_mutex);
1493 : 0 : LOCK(m_send_mutex);
1494 [ # # ]: 0 : if (m_send_state == SendState::V1) return m_v1_fallback.GetBytesToSend(have_next_message);
1495 : :
1496 [ # # ]: 0 : if (m_send_state == SendState::MAYBE_V1) Assume(m_send_buffer.empty());
1497 : 0 : Assume(m_send_pos <= m_send_buffer.size());
1498 : 0 : return {
1499 [ # # ]: 0 : Span{m_send_buffer}.subspan(m_send_pos),
1500 : : // We only have more to send after the current m_send_buffer if there is a (next)
1501 : : // message to be sent, and we're capable of sending packets. */
1502 [ # # # # ]: 0 : have_next_message && m_send_state == SendState::READY,
1503 : 0 : m_send_type
1504 : 0 : };
1505 : 0 : }
1506 : :
1507 : 0 : void V2Transport::MarkBytesSent(size_t bytes_sent) noexcept
1508 : : {
1509 : 0 : AssertLockNotHeld(m_send_mutex);
1510 : 0 : LOCK(m_send_mutex);
1511 [ # # # # ]: 0 : if (m_send_state == SendState::V1) return m_v1_fallback.MarkBytesSent(bytes_sent);
1512 : :
1513 [ # # # # : 0 : if (m_send_state == SendState::AWAITING_KEY && m_send_pos == 0 && bytes_sent > 0) {
# # ]
1514 [ # # ]: 0 : LogDebug(BCLog::NET, "start sending v2 handshake to peer=%d\n", m_nodeid);
1515 : : }
1516 : :
1517 : 0 : m_send_pos += bytes_sent;
1518 : 0 : Assume(m_send_pos <= m_send_buffer.size());
1519 [ # # ]: 0 : if (m_send_pos >= CMessageHeader::HEADER_SIZE) {
1520 : 0 : m_sent_v1_header_worth = true;
1521 : : }
1522 : : // Wipe the buffer when everything is sent.
1523 [ # # ]: 0 : if (m_send_pos == m_send_buffer.size()) {
1524 : 0 : m_send_pos = 0;
1525 : 0 : ClearShrink(m_send_buffer);
1526 : : }
1527 : 0 : }
1528 : :
1529 : 0 : bool V2Transport::ShouldReconnectV1() const noexcept
1530 : : {
1531 : 0 : AssertLockNotHeld(m_send_mutex);
1532 : 0 : AssertLockNotHeld(m_recv_mutex);
1533 : : // Only outgoing connections need reconnection.
1534 [ # # ]: 0 : if (!m_initiating) return false;
1535 : :
1536 : 0 : LOCK(m_recv_mutex);
1537 : : // We only reconnect in the very first state and when the receive buffer is empty. Together
1538 : : // these conditions imply nothing has been received so far.
1539 [ # # ]: 0 : if (m_recv_state != RecvState::KEY) return false;
1540 [ # # ]: 0 : if (!m_recv_buffer.empty()) return false;
1541 : : // Check if we've sent enough for the other side to disconnect us (if it was V1).
1542 : 0 : LOCK(m_send_mutex);
1543 [ # # ]: 0 : return m_sent_v1_header_worth;
1544 : 0 : }
1545 : :
1546 : 0 : size_t V2Transport::GetSendMemoryUsage() const noexcept
1547 : : {
1548 : 0 : AssertLockNotHeld(m_send_mutex);
1549 : 0 : LOCK(m_send_mutex);
1550 [ # # ]: 0 : if (m_send_state == SendState::V1) return m_v1_fallback.GetSendMemoryUsage();
1551 : :
1552 [ # # ]: 0 : return sizeof(m_send_buffer) + memusage::DynamicUsage(m_send_buffer);
1553 : 0 : }
1554 : :
1555 : 0 : Transport::Info V2Transport::GetInfo() const noexcept
1556 : : {
1557 : 0 : AssertLockNotHeld(m_recv_mutex);
1558 : 0 : LOCK(m_recv_mutex);
1559 [ # # ]: 0 : if (m_recv_state == RecvState::V1) return m_v1_fallback.GetInfo();
1560 : :
1561 [ # # ]: 0 : Transport::Info info;
1562 : :
1563 : : // Do not report v2 and session ID until the version packet has been received
1564 : : // and verified (confirming that the other side very likely has the same keys as us).
1565 [ # # ]: 0 : if (m_recv_state != RecvState::KEY_MAYBE_V1 && m_recv_state != RecvState::KEY &&
1566 : : m_recv_state != RecvState::GARB_GARBTERM && m_recv_state != RecvState::VERSION) {
1567 : 0 : info.transport_type = TransportProtocolType::V2;
1568 : 0 : info.session_id = uint256(MakeUCharSpan(m_cipher.GetSessionID()));
1569 : : } else {
1570 : 0 : info.transport_type = TransportProtocolType::DETECTING;
1571 : : }
1572 : :
1573 : 0 : return info;
1574 : 0 : }
1575 : :
1576 : 0 : std::pair<size_t, bool> CConnman::SocketSendData(CNode& node) const
1577 : : {
1578 : 0 : auto it = node.vSendMsg.begin();
1579 : 0 : size_t nSentSize = 0;
1580 : 0 : bool data_left{false}; //!< second return value (whether unsent data remains)
1581 : 0 : std::optional<bool> expected_more;
1582 : :
1583 : 0 : while (true) {
1584 [ # # ]: 0 : if (it != node.vSendMsg.end()) {
1585 : : // If possible, move one message from the send queue to the transport. This fails when
1586 : : // there is an existing message still being sent, or (for v2 transports) when the
1587 : : // handshake has not yet completed.
1588 : 0 : size_t memusage = it->GetMemoryUsage();
1589 [ # # ]: 0 : if (node.m_transport->SetMessageToSend(*it)) {
1590 : : // Update memory usage of send buffer (as *it will be deleted).
1591 : 0 : node.m_send_memusage -= memusage;
1592 : 0 : ++it;
1593 : : }
1594 : : }
1595 [ # # ]: 0 : const auto& [data, more, msg_type] = node.m_transport->GetBytesToSend(it != node.vSendMsg.end());
1596 : : // We rely on the 'more' value returned by GetBytesToSend to correctly predict whether more
1597 : : // bytes are still to be sent, to correctly set the MSG_MORE flag. As a sanity check,
1598 : : // verify that the previously returned 'more' was correct.
1599 [ # # ]: 0 : if (expected_more.has_value()) Assume(!data.empty() == *expected_more);
1600 [ # # ]: 0 : expected_more = more;
1601 [ # # ]: 0 : data_left = !data.empty(); // will be overwritten on next loop if all of data gets sent
1602 : 0 : int nBytes = 0;
1603 [ # # ]: 0 : if (!data.empty()) {
1604 : 0 : LOCK(node.m_sock_mutex);
1605 : : // There is no socket in case we've already disconnected, or in test cases without
1606 : : // real connections. In these cases, we bail out immediately and just leave things
1607 : : // in the send queue and transport.
1608 [ # # ]: 0 : if (!node.m_sock) {
1609 : : break;
1610 : : }
1611 : 0 : int flags = MSG_NOSIGNAL | MSG_DONTWAIT;
1612 : : #ifdef MSG_MORE
1613 [ # # ]: 0 : if (more) {
1614 : 0 : flags |= MSG_MORE;
1615 : : }
1616 : : #endif
1617 [ # # # # ]: 0 : nBytes = node.m_sock->Send(reinterpret_cast<const char*>(data.data()), data.size(), flags);
1618 : 0 : }
1619 [ # # ]: 0 : if (nBytes > 0) {
1620 : 0 : node.m_last_send = GetTime<std::chrono::seconds>();
1621 : 0 : node.nSendBytes += nBytes;
1622 : : // Notify transport that bytes have been processed.
1623 : 0 : node.m_transport->MarkBytesSent(nBytes);
1624 : : // Update statistics per message type.
1625 [ # # ]: 0 : if (!msg_type.empty()) { // don't report v2 handshake bytes for now
1626 : 0 : node.AccountForSentBytes(msg_type, nBytes);
1627 : : }
1628 : 0 : nSentSize += nBytes;
1629 [ # # ]: 0 : if ((size_t)nBytes != data.size()) {
1630 : : // could not send full message; stop sending more
1631 : : break;
1632 : : }
1633 : : } else {
1634 [ # # ]: 0 : if (nBytes < 0) {
1635 : : // error
1636 : 0 : int nErr = WSAGetLastError();
1637 [ # # # # ]: 0 : if (nErr != WSAEWOULDBLOCK && nErr != WSAEMSGSIZE && nErr != WSAEINTR && nErr != WSAEINPROGRESS) {
1638 [ # # # # ]: 0 : LogDebug(BCLog::NET, "socket send error for peer=%d: %s\n", node.GetId(), NetworkErrorString(nErr));
1639 : 0 : node.CloseSocketDisconnect();
1640 : : }
1641 : : }
1642 : : break;
1643 : : }
1644 : : }
1645 : :
1646 [ # # ]: 0 : node.fPauseSend = node.m_send_memusage + node.m_transport->GetSendMemoryUsage() > nSendBufferMaxSize;
1647 : :
1648 [ # # ]: 0 : if (it == node.vSendMsg.end()) {
1649 [ # # ]: 0 : assert(node.m_send_memusage == 0);
1650 : : }
1651 : 0 : node.vSendMsg.erase(node.vSendMsg.begin(), it);
1652 : 0 : return {nSentSize, data_left};
1653 : : }
1654 : :
1655 : : /** Try to find a connection to evict when the node is full.
1656 : : * Extreme care must be taken to avoid opening the node to attacker
1657 : : * triggered network partitioning.
1658 : : * The strategy used here is to protect a small number of peers
1659 : : * for each of several distinct characteristics which are difficult
1660 : : * to forge. In order to partition a node the attacker must be
1661 : : * simultaneously better at all of them than honest peers.
1662 : : */
1663 : 0 : bool CConnman::AttemptToEvictConnection()
1664 : : {
1665 : 0 : std::vector<NodeEvictionCandidate> vEvictionCandidates;
1666 : 0 : {
1667 : :
1668 [ # # ]: 0 : LOCK(m_nodes_mutex);
1669 [ # # ]: 0 : for (const CNode* node : m_nodes) {
1670 [ # # ]: 0 : if (node->fDisconnect)
1671 : 0 : continue;
1672 : 0 : NodeEvictionCandidate candidate{
1673 : 0 : .id = node->GetId(),
1674 : : .m_connected = node->m_connected,
1675 : 0 : .m_min_ping_time = node->m_min_ping_time,
1676 : 0 : .m_last_block_time = node->m_last_block_time,
1677 : 0 : .m_last_tx_time = node->m_last_tx_time,
1678 [ # # ]: 0 : .fRelevantServices = node->m_has_all_wanted_services,
1679 : 0 : .m_relay_txs = node->m_relays_txs.load(),
1680 : 0 : .fBloomFilter = node->m_bloom_filter_loaded.load(),
1681 : 0 : .nKeyedNetGroup = node->nKeyedNetGroup,
1682 : 0 : .prefer_evict = node->m_prefer_evict,
1683 [ # # ]: 0 : .m_is_local = node->addr.IsLocal(),
1684 : 0 : .m_network = node->ConnectedThroughNetwork(),
1685 : 0 : .m_noban = node->HasPermission(NetPermissionFlags::NoBan),
1686 : 0 : .m_conn_type = node->m_conn_type,
1687 [ # # # # : 0 : };
# # ]
1688 [ # # ]: 0 : vEvictionCandidates.push_back(candidate);
1689 : : }
1690 : 0 : }
1691 [ # # ]: 0 : const std::optional<NodeId> node_id_to_evict = SelectNodeToEvict(std::move(vEvictionCandidates));
1692 [ # # ]: 0 : if (!node_id_to_evict) {
1693 : : return false;
1694 : : }
1695 [ # # ]: 0 : LOCK(m_nodes_mutex);
1696 [ # # ]: 0 : for (CNode* pnode : m_nodes) {
1697 [ # # ]: 0 : if (pnode->GetId() == *node_id_to_evict) {
1698 [ # # # # : 0 : LogDebug(BCLog::NET, "selected %s connection for eviction peer=%d; disconnecting\n", pnode->ConnectionTypeAsString(), pnode->GetId());
# # # # ]
1699 : 0 : pnode->fDisconnect = true;
1700 : 0 : return true;
1701 : : }
1702 : : }
1703 : : return false;
1704 : 0 : }
1705 : :
1706 : 0 : void CConnman::AcceptConnection(const ListenSocket& hListenSocket) {
1707 : 0 : struct sockaddr_storage sockaddr;
1708 : 0 : socklen_t len = sizeof(sockaddr);
1709 : 0 : auto sock = hListenSocket.sock->Accept((struct sockaddr*)&sockaddr, &len);
1710 [ # # ]: 0 : CAddress addr;
1711 : :
1712 [ # # ]: 0 : if (!sock) {
1713 : 0 : const int nErr = WSAGetLastError();
1714 [ # # ]: 0 : if (nErr != WSAEWOULDBLOCK) {
1715 [ # # # # ]: 0 : LogPrintf("socket error accept failed: %s\n", NetworkErrorString(nErr));
1716 : : }
1717 : 0 : return;
1718 : : }
1719 : :
1720 [ # # # # ]: 0 : if (!addr.SetSockAddr((const struct sockaddr*)&sockaddr)) {
1721 [ # # # # : 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Warning, "Unknown socket family\n");
# # ]
1722 : : } else {
1723 [ # # ]: 0 : addr = CAddress{MaybeFlipIPv6toCJDNS(addr), NODE_NONE};
1724 : : }
1725 : :
1726 [ # # # # ]: 0 : const CAddress addr_bind{MaybeFlipIPv6toCJDNS(GetBindAddress(*sock)), NODE_NONE};
1727 : :
1728 : 0 : NetPermissionFlags permission_flags = NetPermissionFlags::None;
1729 [ # # ]: 0 : hListenSocket.AddSocketPermissionFlags(permission_flags);
1730 : :
1731 [ # # ]: 0 : CreateNodeFromAcceptedSocket(std::move(sock), permission_flags, addr_bind, addr);
1732 : 0 : }
1733 : :
1734 : 0 : void CConnman::CreateNodeFromAcceptedSocket(std::unique_ptr<Sock>&& sock,
1735 : : NetPermissionFlags permission_flags,
1736 : : const CAddress& addr_bind,
1737 : : const CAddress& addr)
1738 : : {
1739 : 0 : int nInbound = 0;
1740 : :
1741 : 0 : AddWhitelistPermissionFlags(permission_flags, addr, vWhitelistedRangeIncoming);
1742 : :
1743 : 0 : {
1744 : 0 : LOCK(m_nodes_mutex);
1745 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
1746 [ # # ]: 0 : if (pnode->IsInboundConn()) nInbound++;
1747 : : }
1748 : 0 : }
1749 : :
1750 [ # # ]: 0 : if (!fNetworkActive) {
1751 [ # # # # ]: 0 : LogDebug(BCLog::NET, "connection from %s dropped: not accepting new connections\n", addr.ToStringAddrPort());
1752 : 0 : return;
1753 : : }
1754 : :
1755 [ # # ]: 0 : if (!sock->IsSelectable()) {
1756 [ # # ]: 0 : LogPrintf("connection from %s dropped: non-selectable socket\n", addr.ToStringAddrPort());
1757 : 0 : return;
1758 : : }
1759 : :
1760 : : // According to the internet TCP_NODELAY is not carried into accepted sockets
1761 : : // on all platforms. Set it again here just to be sure.
1762 : 0 : const int on{1};
1763 [ # # ]: 0 : if (sock->SetSockOpt(IPPROTO_TCP, TCP_NODELAY, &on, sizeof(on)) == SOCKET_ERROR) {
1764 [ # # # # ]: 0 : LogDebug(BCLog::NET, "connection from %s: unable to set TCP_NODELAY, continuing anyway\n",
1765 : : addr.ToStringAddrPort());
1766 : : }
1767 : :
1768 : : // Don't accept connections from banned peers.
1769 [ # # # # ]: 0 : bool banned = m_banman && m_banman->IsBanned(addr);
1770 [ # # # # ]: 0 : if (!NetPermissions::HasFlag(permission_flags, NetPermissionFlags::NoBan) && banned)
1771 : : {
1772 [ # # # # ]: 0 : LogDebug(BCLog::NET, "connection from %s dropped (banned)\n", addr.ToStringAddrPort());
1773 : 0 : return;
1774 : : }
1775 : :
1776 : : // Only accept connections from discouraged peers if our inbound slots aren't (almost) full.
1777 [ # # # # ]: 0 : bool discouraged = m_banman && m_banman->IsDiscouraged(addr);
1778 [ # # # # : 0 : if (!NetPermissions::HasFlag(permission_flags, NetPermissionFlags::NoBan) && nInbound + 1 >= m_max_inbound && discouraged)
# # ]
1779 : : {
1780 [ # # # # ]: 0 : LogDebug(BCLog::NET, "connection from %s dropped (discouraged)\n", addr.ToStringAddrPort());
1781 : 0 : return;
1782 : : }
1783 : :
1784 [ # # ]: 0 : if (nInbound >= m_max_inbound)
1785 : : {
1786 [ # # ]: 0 : if (!AttemptToEvictConnection()) {
1787 : : // No connection to evict, disconnect the new connection
1788 [ # # ]: 0 : LogDebug(BCLog::NET, "failed to find an eviction candidate - connection dropped (full)\n");
1789 : 0 : return;
1790 : : }
1791 : : }
1792 : :
1793 : 0 : NodeId id = GetNewNodeId();
1794 : 0 : uint64_t nonce = GetDeterministicRandomizer(RANDOMIZER_ID_LOCALHOSTNONCE).Write(id).Finalize();
1795 : :
1796 : 0 : const bool inbound_onion = std::find(m_onion_binds.begin(), m_onion_binds.end(), addr_bind) != m_onion_binds.end();
1797 : : // The V2Transport transparently falls back to V1 behavior when an incoming V1 connection is
1798 : : // detected, so use it whenever we signal NODE_P2P_V2.
1799 : 0 : ServiceFlags local_services = GetLocalServices();
1800 : 0 : const bool use_v2transport(local_services & NODE_P2P_V2);
1801 : :
1802 : 0 : CNode* pnode = new CNode(id,
1803 : : std::move(sock),
1804 : : addr,
1805 : : CalculateKeyedNetGroup(addr),
1806 : : nonce,
1807 : : addr_bind,
1808 : : /*addrNameIn=*/"",
1809 : : ConnectionType::INBOUND,
1810 : : inbound_onion,
1811 [ # # ]: 0 : CNodeOptions{
1812 : : .permission_flags = permission_flags,
1813 : : .prefer_evict = discouraged,
1814 : 0 : .recv_flood_size = nReceiveFloodSize,
1815 : : .use_v2transport = use_v2transport,
1816 [ # # # # : 0 : });
# # # # #
# ]
1817 : 0 : pnode->AddRef();
1818 : 0 : m_msgproc->InitializeNode(*pnode, local_services);
1819 : 0 : {
1820 : 0 : LOCK(m_nodes_mutex);
1821 [ # # ]: 0 : m_nodes.push_back(pnode);
1822 : 0 : }
1823 [ # # # # ]: 0 : LogDebug(BCLog::NET, "connection from %s accepted\n", addr.ToStringAddrPort());
1824 : :
1825 : : // We received a new connection, harvest entropy from the time (and our peer count)
1826 : 0 : RandAddEvent((uint32_t)id);
1827 : : }
1828 : :
1829 : 0 : bool CConnman::AddConnection(const std::string& address, ConnectionType conn_type, bool use_v2transport = false)
1830 : : {
1831 : 0 : AssertLockNotHeld(m_unused_i2p_sessions_mutex);
1832 : 0 : std::optional<int> max_connections;
1833 [ # # # # ]: 0 : switch (conn_type) {
1834 : : case ConnectionType::INBOUND:
1835 : : case ConnectionType::MANUAL:
1836 : : return false;
1837 : 0 : case ConnectionType::OUTBOUND_FULL_RELAY:
1838 : 0 : max_connections = m_max_outbound_full_relay;
1839 : 0 : break;
1840 : 0 : case ConnectionType::BLOCK_RELAY:
1841 : 0 : max_connections = m_max_outbound_block_relay;
1842 : 0 : break;
1843 : : // no limit for ADDR_FETCH because -seednode has no limit either
1844 : : case ConnectionType::ADDR_FETCH:
1845 : : break;
1846 : : // no limit for FEELER connections since they're short-lived
1847 : : case ConnectionType::FEELER:
1848 : : break;
1849 : : } // no default case, so the compiler can warn about missing cases
1850 : :
1851 : : // Count existing connections
1852 [ # # # # ]: 0 : int existing_connections = WITH_LOCK(m_nodes_mutex,
1853 : : return std::count_if(m_nodes.begin(), m_nodes.end(), [conn_type](CNode* node) { return node->m_conn_type == conn_type; }););
1854 : :
1855 : : // Max connections of specified type already exist
1856 [ # # ]: 0 : if (max_connections != std::nullopt && existing_connections >= max_connections) return false;
1857 : :
1858 : : // Max total outbound connections already exist
1859 : 0 : CSemaphoreGrant grant(*semOutbound, true);
1860 [ # # ]: 0 : if (!grant) return false;
1861 : :
1862 [ # # # # ]: 0 : OpenNetworkConnection(CAddress(), false, std::move(grant), address.c_str(), conn_type, /*use_v2transport=*/use_v2transport);
1863 : 0 : return true;
1864 : : }
1865 : :
1866 : 0 : void CConnman::DisconnectNodes()
1867 : : {
1868 : 0 : AssertLockNotHeld(m_nodes_mutex);
1869 : 0 : AssertLockNotHeld(m_reconnections_mutex);
1870 : :
1871 : : // Use a temporary variable to accumulate desired reconnections, so we don't need
1872 : : // m_reconnections_mutex while holding m_nodes_mutex.
1873 [ # # ]: 0 : decltype(m_reconnections) reconnections_to_add;
1874 : :
1875 : 0 : {
1876 [ # # ]: 0 : LOCK(m_nodes_mutex);
1877 : :
1878 [ # # ]: 0 : if (!fNetworkActive) {
1879 : : // Disconnect any connected nodes
1880 [ # # ]: 0 : for (CNode* pnode : m_nodes) {
1881 [ # # ]: 0 : if (!pnode->fDisconnect) {
1882 [ # # # # : 0 : LogDebug(BCLog::NET, "Network not active, dropping peer=%d\n", pnode->GetId());
# # ]
1883 : 0 : pnode->fDisconnect = true;
1884 : : }
1885 : : }
1886 : : }
1887 : :
1888 : : // Disconnect unused nodes
1889 [ # # ]: 0 : std::vector<CNode*> nodes_copy = m_nodes;
1890 [ # # ]: 0 : for (CNode* pnode : nodes_copy)
1891 : : {
1892 [ # # ]: 0 : if (pnode->fDisconnect)
1893 : : {
1894 : : // remove from m_nodes
1895 : 0 : m_nodes.erase(remove(m_nodes.begin(), m_nodes.end(), pnode), m_nodes.end());
1896 : :
1897 : : // Add to reconnection list if appropriate. We don't reconnect right here, because
1898 : : // the creation of a connection is a blocking operation (up to several seconds),
1899 : : // and we don't want to hold up the socket handler thread for that long.
1900 [ # # ]: 0 : if (pnode->m_transport->ShouldReconnectV1()) {
1901 : 0 : reconnections_to_add.push_back({
1902 : 0 : .addr_connect = pnode->addr,
1903 [ # # ]: 0 : .grant = std::move(pnode->grantOutbound),
1904 : 0 : .destination = pnode->m_dest,
1905 : 0 : .conn_type = pnode->m_conn_type,
1906 : : .use_v2transport = false});
1907 [ # # # # : 0 : LogDebug(BCLog::NET, "retrying with v1 transport protocol for peer=%d\n", pnode->GetId());
# # ]
1908 : : }
1909 : :
1910 : : // release outbound grant (if any)
1911 : 0 : pnode->grantOutbound.Release();
1912 : :
1913 : : // close socket and cleanup
1914 [ # # ]: 0 : pnode->CloseSocketDisconnect();
1915 : :
1916 : : // update connection count by network
1917 [ # # # # ]: 0 : if (pnode->IsManualOrFullOutboundConn()) --m_network_conn_counts[pnode->addr.GetNetwork()];
1918 : :
1919 : : // hold in disconnected pool until all refs are released
1920 [ # # ]: 0 : pnode->Release();
1921 [ # # ]: 0 : m_nodes_disconnected.push_back(pnode);
1922 : : }
1923 : : }
1924 [ # # ]: 0 : }
1925 : 0 : {
1926 : : // Delete disconnected nodes
1927 [ # # ]: 0 : std::list<CNode*> nodes_disconnected_copy = m_nodes_disconnected;
1928 [ # # ]: 0 : for (CNode* pnode : nodes_disconnected_copy)
1929 : : {
1930 : : // Destroy the object only after other threads have stopped using it.
1931 [ # # ]: 0 : if (pnode->GetRefCount() <= 0) {
1932 : 0 : m_nodes_disconnected.remove(pnode);
1933 [ # # ]: 0 : DeleteNode(pnode);
1934 : : }
1935 : : }
1936 : 0 : }
1937 : 0 : {
1938 : : // Move entries from reconnections_to_add to m_reconnections.
1939 [ # # ]: 0 : LOCK(m_reconnections_mutex);
1940 [ # # ]: 0 : m_reconnections.splice(m_reconnections.end(), std::move(reconnections_to_add));
1941 : 0 : }
1942 [ # # # # : 0 : }
# # ]
1943 : :
1944 : 0 : void CConnman::NotifyNumConnectionsChanged()
1945 : : {
1946 : 0 : size_t nodes_size;
1947 : 0 : {
1948 : 0 : LOCK(m_nodes_mutex);
1949 [ # # ]: 0 : nodes_size = m_nodes.size();
1950 : 0 : }
1951 [ # # ]: 0 : if(nodes_size != nPrevNodeCount) {
1952 : 0 : nPrevNodeCount = nodes_size;
1953 [ # # ]: 0 : if (m_client_interface) {
1954 : 0 : m_client_interface->NotifyNumConnectionsChanged(nodes_size);
1955 : : }
1956 : : }
1957 : 0 : }
1958 : :
1959 : 0 : bool CConnman::ShouldRunInactivityChecks(const CNode& node, std::chrono::seconds now) const
1960 : : {
1961 : 0 : return node.m_connected + m_peer_connect_timeout < now;
1962 : : }
1963 : :
1964 : 0 : bool CConnman::InactivityCheck(const CNode& node) const
1965 : : {
1966 : : // Tests that see disconnects after using mocktime can start nodes with a
1967 : : // large timeout. For example, -peertimeout=999999999.
1968 : 0 : const auto now{GetTime<std::chrono::seconds>()};
1969 : 0 : const auto last_send{node.m_last_send.load()};
1970 : 0 : const auto last_recv{node.m_last_recv.load()};
1971 : :
1972 [ # # ]: 0 : if (!ShouldRunInactivityChecks(node, now)) return false;
1973 : :
1974 [ # # # # ]: 0 : if (last_recv.count() == 0 || last_send.count() == 0) {
1975 [ # # ]: 0 : LogDebug(BCLog::NET, "socket no message in first %i seconds, %d %d peer=%d\n", count_seconds(m_peer_connect_timeout), last_recv.count() != 0, last_send.count() != 0, node.GetId());
1976 : 0 : return true;
1977 : : }
1978 : :
1979 [ # # ]: 0 : if (now > last_send + TIMEOUT_INTERVAL) {
1980 [ # # ]: 0 : LogDebug(BCLog::NET, "socket sending timeout: %is peer=%d\n", count_seconds(now - last_send), node.GetId());
1981 : 0 : return true;
1982 : : }
1983 : :
1984 [ # # ]: 0 : if (now > last_recv + TIMEOUT_INTERVAL) {
1985 [ # # ]: 0 : LogDebug(BCLog::NET, "socket receive timeout: %is peer=%d\n", count_seconds(now - last_recv), node.GetId());
1986 : 0 : return true;
1987 : : }
1988 : :
1989 [ # # ]: 0 : if (!node.fSuccessfullyConnected) {
1990 [ # # ]: 0 : if (node.m_transport->GetInfo().transport_type == TransportProtocolType::DETECTING) {
1991 [ # # ]: 0 : LogDebug(BCLog::NET, "V2 handshake timeout peer=%d\n", node.GetId());
1992 : : } else {
1993 [ # # ]: 0 : LogDebug(BCLog::NET, "version handshake timeout peer=%d\n", node.GetId());
1994 : : }
1995 : 0 : return true;
1996 : : }
1997 : :
1998 : : return false;
1999 : : }
2000 : :
2001 : 0 : Sock::EventsPerSock CConnman::GenerateWaitSockets(Span<CNode* const> nodes)
2002 : : {
2003 : 0 : Sock::EventsPerSock events_per_sock;
2004 : :
2005 [ # # ]: 0 : for (const ListenSocket& hListenSocket : vhListenSocket) {
2006 [ # # ]: 0 : events_per_sock.emplace(hListenSocket.sock, Sock::Events{Sock::RECV});
2007 : : }
2008 : :
2009 [ # # ]: 0 : for (CNode* pnode : nodes) {
2010 [ # # ]: 0 : bool select_recv = !pnode->fPauseRecv;
2011 : 0 : bool select_send;
2012 : 0 : {
2013 [ # # ]: 0 : LOCK(pnode->cs_vSend);
2014 : : // Sending is possible if either there are bytes to send right now, or if there will be
2015 : : // once a potential message from vSendMsg is handed to the transport. GetBytesToSend
2016 : : // determines both of these in a single call.
2017 [ # # ]: 0 : const auto& [to_send, more, _msg_type] = pnode->m_transport->GetBytesToSend(!pnode->vSendMsg.empty());
2018 [ # # # # : 0 : select_send = !to_send.empty() || more;
# # ]
2019 : 0 : }
2020 [ # # ]: 0 : if (!select_recv && !select_send) continue;
2021 : :
2022 [ # # ]: 0 : LOCK(pnode->m_sock_mutex);
2023 [ # # ]: 0 : if (pnode->m_sock) {
2024 [ # # # # ]: 0 : Sock::Event event = (select_send ? Sock::SEND : 0) | (select_recv ? Sock::RECV : 0);
2025 [ # # ]: 0 : events_per_sock.emplace(pnode->m_sock, Sock::Events{event});
2026 : : }
2027 : 0 : }
2028 : :
2029 : 0 : return events_per_sock;
2030 : 0 : }
2031 : :
2032 : 0 : void CConnman::SocketHandler()
2033 : : {
2034 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
2035 : :
2036 [ # # ]: 0 : Sock::EventsPerSock events_per_sock;
2037 : :
2038 : 0 : {
2039 [ # # ]: 0 : const NodesSnapshot snap{*this, /*shuffle=*/false};
2040 : :
2041 : 0 : const auto timeout = std::chrono::milliseconds(SELECT_TIMEOUT_MILLISECONDS);
2042 : :
2043 : : // Check for the readiness of the already connected sockets and the
2044 : : // listening sockets in one call ("readiness" as in poll(2) or
2045 : : // select(2)). If none are ready, wait for a short while and return
2046 : : // empty sets.
2047 [ # # ]: 0 : events_per_sock = GenerateWaitSockets(snap.Nodes());
2048 [ # # # # : 0 : if (events_per_sock.empty() || !events_per_sock.begin()->first->WaitMany(timeout, events_per_sock)) {
# # ]
2049 [ # # ]: 0 : interruptNet.sleep_for(timeout);
2050 : : }
2051 : :
2052 : : // Service (send/receive) each of the already connected nodes.
2053 [ # # ]: 0 : SocketHandlerConnected(snap.Nodes(), events_per_sock);
2054 : 0 : }
2055 : :
2056 : : // Accept new connections from listening sockets.
2057 [ # # ]: 0 : SocketHandlerListening(events_per_sock);
2058 : 0 : }
2059 : :
2060 : 0 : void CConnman::SocketHandlerConnected(const std::vector<CNode*>& nodes,
2061 : : const Sock::EventsPerSock& events_per_sock)
2062 : : {
2063 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
2064 : :
2065 [ # # ]: 0 : for (CNode* pnode : nodes) {
2066 [ # # ]: 0 : if (interruptNet)
2067 : : return;
2068 : :
2069 : : //
2070 : : // Receive
2071 : : //
2072 : 0 : bool recvSet = false;
2073 : 0 : bool sendSet = false;
2074 : 0 : bool errorSet = false;
2075 : 0 : {
2076 : 0 : LOCK(pnode->m_sock_mutex);
2077 [ # # ]: 0 : if (!pnode->m_sock) {
2078 [ # # ]: 0 : continue;
2079 : : }
2080 [ # # # # ]: 0 : const auto it = events_per_sock.find(pnode->m_sock);
2081 [ # # ]: 0 : if (it != events_per_sock.end()) {
2082 : 0 : recvSet = it->second.occurred & Sock::RECV;
2083 : 0 : sendSet = it->second.occurred & Sock::SEND;
2084 : 0 : errorSet = it->second.occurred & Sock::ERR;
2085 : : }
2086 : 0 : }
2087 : :
2088 [ # # ]: 0 : if (sendSet) {
2089 : : // Send data
2090 [ # # # # ]: 0 : auto [bytes_sent, data_left] = WITH_LOCK(pnode->cs_vSend, return SocketSendData(*pnode));
2091 [ # # ]: 0 : if (bytes_sent) {
2092 : 0 : RecordBytesSent(bytes_sent);
2093 : :
2094 : : // If both receiving and (non-optimistic) sending were possible, we first attempt
2095 : : // sending. If that succeeds, but does not fully drain the send queue, do not
2096 : : // attempt to receive. This avoids needlessly queueing data if the remote peer
2097 : : // is slow at receiving data, by means of TCP flow control. We only do this when
2098 : : // sending actually succeeded to make sure progress is always made; otherwise a
2099 : : // deadlock would be possible when both sides have data to send, but neither is
2100 : : // receiving.
2101 [ # # ]: 0 : if (data_left) recvSet = false;
2102 : : }
2103 : : }
2104 : :
2105 [ # # ]: 0 : if (recvSet || errorSet)
2106 : : {
2107 : : // typical socket buffer is 8K-64K
2108 : 0 : uint8_t pchBuf[0x10000];
2109 : 0 : int nBytes = 0;
2110 : 0 : {
2111 : 0 : LOCK(pnode->m_sock_mutex);
2112 [ # # ]: 0 : if (!pnode->m_sock) {
2113 [ # # ]: 0 : continue;
2114 : : }
2115 [ # # # # ]: 0 : nBytes = pnode->m_sock->Recv(pchBuf, sizeof(pchBuf), MSG_DONTWAIT);
2116 : 0 : }
2117 [ # # ]: 0 : if (nBytes > 0)
2118 : : {
2119 : 0 : bool notify = false;
2120 [ # # ]: 0 : if (!pnode->ReceiveMsgBytes({pchBuf, (size_t)nBytes}, notify)) {
2121 : 0 : pnode->CloseSocketDisconnect();
2122 : : }
2123 : 0 : RecordBytesRecv(nBytes);
2124 [ # # ]: 0 : if (notify) {
2125 : 0 : pnode->MarkReceivedMsgsForProcessing();
2126 : 0 : WakeMessageHandler();
2127 : : }
2128 : : }
2129 [ # # ]: 0 : else if (nBytes == 0)
2130 : : {
2131 : : // socket closed gracefully
2132 [ # # ]: 0 : if (!pnode->fDisconnect) {
2133 [ # # ]: 0 : LogDebug(BCLog::NET, "socket closed for peer=%d\n", pnode->GetId());
2134 : : }
2135 : 0 : pnode->CloseSocketDisconnect();
2136 : : }
2137 [ # # ]: 0 : else if (nBytes < 0)
2138 : : {
2139 : : // error
2140 : 0 : int nErr = WSAGetLastError();
2141 [ # # # # ]: 0 : if (nErr != WSAEWOULDBLOCK && nErr != WSAEMSGSIZE && nErr != WSAEINTR && nErr != WSAEINPROGRESS)
2142 : : {
2143 [ # # ]: 0 : if (!pnode->fDisconnect) {
2144 [ # # # # ]: 0 : LogDebug(BCLog::NET, "socket recv error for peer=%d: %s\n", pnode->GetId(), NetworkErrorString(nErr));
2145 : : }
2146 : 0 : pnode->CloseSocketDisconnect();
2147 : : }
2148 : : }
2149 : : }
2150 : :
2151 [ # # ]: 0 : if (InactivityCheck(*pnode)) pnode->fDisconnect = true;
2152 : : }
2153 : : }
2154 : :
2155 : 0 : void CConnman::SocketHandlerListening(const Sock::EventsPerSock& events_per_sock)
2156 : : {
2157 [ # # ]: 0 : for (const ListenSocket& listen_socket : vhListenSocket) {
2158 [ # # ]: 0 : if (interruptNet) {
2159 : : return;
2160 : : }
2161 [ # # # # ]: 0 : const auto it = events_per_sock.find(listen_socket.sock);
2162 [ # # # # ]: 0 : if (it != events_per_sock.end() && it->second.occurred & Sock::RECV) {
2163 : 0 : AcceptConnection(listen_socket);
2164 : : }
2165 : : }
2166 : : }
2167 : :
2168 : 0 : void CConnman::ThreadSocketHandler()
2169 : : {
2170 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
2171 : :
2172 [ # # ]: 0 : while (!interruptNet)
2173 : : {
2174 : 0 : DisconnectNodes();
2175 : 0 : NotifyNumConnectionsChanged();
2176 : 0 : SocketHandler();
2177 : : }
2178 : 0 : }
2179 : :
2180 : 0 : void CConnman::WakeMessageHandler()
2181 : : {
2182 : 0 : {
2183 : 0 : LOCK(mutexMsgProc);
2184 [ # # ]: 0 : fMsgProcWake = true;
2185 : 0 : }
2186 : 0 : condMsgProc.notify_one();
2187 : 0 : }
2188 : :
2189 : 0 : void CConnman::ThreadDNSAddressSeed()
2190 : : {
2191 : 0 : int outbound_connection_count = 0;
2192 : :
2193 [ # # # # ]: 0 : if (gArgs.IsArgSet("-seednode")) {
2194 : 0 : auto start = NodeClock::now();
2195 : 0 : constexpr std::chrono::seconds SEEDNODE_TIMEOUT = 30s;
2196 : 0 : LogPrintf("-seednode enabled. Trying the provided seeds for %d seconds before defaulting to the dnsseeds.\n", SEEDNODE_TIMEOUT.count());
2197 [ # # ]: 0 : while (!interruptNet) {
2198 [ # # ]: 0 : if (!interruptNet.sleep_for(std::chrono::milliseconds(500)))
2199 : : return;
2200 : :
2201 : : // Abort if we have spent enough time without reaching our target.
2202 : : // Giving seed nodes 30 seconds so this does not become a race against fixedseeds (which triggers after 1 min)
2203 [ # # ]: 0 : if (NodeClock::now() > start + SEEDNODE_TIMEOUT) {
2204 : 0 : LogPrintf("Couldn't connect to enough peers via seed nodes. Handing fetch logic to the DNS seeds.\n");
2205 : 0 : break;
2206 : : }
2207 : :
2208 : 0 : outbound_connection_count = GetFullOutboundConnCount();
2209 [ # # ]: 0 : if (outbound_connection_count >= SEED_OUTBOUND_CONNECTION_THRESHOLD) {
2210 : 0 : LogPrintf("P2P peers available. Finished fetching data from seed nodes.\n");
2211 : 0 : break;
2212 : : }
2213 : : }
2214 : : }
2215 : :
2216 : 0 : FastRandomContext rng;
2217 [ # # ]: 0 : std::vector<std::string> seeds = m_params.DNSSeeds();
2218 : 0 : std::shuffle(seeds.begin(), seeds.end(), rng);
2219 : 0 : int seeds_right_now = 0; // Number of seeds left before testing if we have enough connections
2220 : :
2221 [ # # # # : 0 : if (gArgs.GetBoolArg("-forcednsseed", DEFAULT_FORCEDNSSEED)) {
# # ]
2222 : : // When -forcednsseed is provided, query all.
2223 : 0 : seeds_right_now = seeds.size();
2224 [ # # # # ]: 0 : } else if (addrman.Size() == 0) {
2225 : : // If we have no known peers, query all.
2226 : : // This will occur on the first run, or if peers.dat has been
2227 : : // deleted.
2228 : 0 : seeds_right_now = seeds.size();
2229 : : }
2230 : :
2231 : : // Proceed with dnsseeds if seednodes hasn't reached the target or if forcednsseed is set
2232 [ # # ]: 0 : if (outbound_connection_count < SEED_OUTBOUND_CONNECTION_THRESHOLD || seeds_right_now) {
2233 : : // goal: only query DNS seed if address need is acute
2234 : : // * If we have a reasonable number of peers in addrman, spend
2235 : : // some time trying them first. This improves user privacy by
2236 : : // creating fewer identifying DNS requests, reduces trust by
2237 : : // giving seeds less influence on the network topology, and
2238 : : // reduces traffic to the seeds.
2239 : : // * When querying DNS seeds query a few at once, this ensures
2240 : : // that we don't give DNS seeds the ability to eclipse nodes
2241 : : // that query them.
2242 : : // * If we continue having problems, eventually query all the
2243 : : // DNS seeds, and if that fails too, also try the fixed seeds.
2244 : : // (done in ThreadOpenConnections)
2245 : 0 : int found = 0;
2246 [ # # # # ]: 0 : const std::chrono::seconds seeds_wait_time = (addrman.Size() >= DNSSEEDS_DELAY_PEER_THRESHOLD ? DNSSEEDS_DELAY_MANY_PEERS : DNSSEEDS_DELAY_FEW_PEERS);
2247 : :
2248 [ # # ]: 0 : for (const std::string& seed : seeds) {
2249 [ # # ]: 0 : if (seeds_right_now == 0) {
2250 : 0 : seeds_right_now += DNSSEEDS_TO_QUERY_AT_ONCE;
2251 : :
2252 [ # # # # ]: 0 : if (addrman.Size() > 0) {
2253 [ # # ]: 0 : LogPrintf("Waiting %d seconds before querying DNS seeds.\n", seeds_wait_time.count());
2254 : 0 : std::chrono::seconds to_wait = seeds_wait_time;
2255 [ # # ]: 0 : while (to_wait.count() > 0) {
2256 : : // if sleeping for the MANY_PEERS interval, wake up
2257 : : // early to see if we have enough peers and can stop
2258 : : // this thread entirely freeing up its resources
2259 : 0 : std::chrono::seconds w = std::min(DNSSEEDS_DELAY_FEW_PEERS, to_wait);
2260 [ # # # # ]: 0 : if (!interruptNet.sleep_for(w)) return;
2261 [ # # ]: 0 : to_wait -= w;
2262 : :
2263 [ # # # # ]: 0 : if (GetFullOutboundConnCount() >= SEED_OUTBOUND_CONNECTION_THRESHOLD) {
2264 [ # # ]: 0 : if (found > 0) {
2265 [ # # ]: 0 : LogPrintf("%d addresses found from DNS seeds\n", found);
2266 [ # # ]: 0 : LogPrintf("P2P peers available. Finished DNS seeding.\n");
2267 : : } else {
2268 [ # # ]: 0 : LogPrintf("P2P peers available. Skipped DNS seeding.\n");
2269 : : }
2270 : 0 : return;
2271 : : }
2272 : : }
2273 : : }
2274 : : }
2275 : :
2276 [ # # # # ]: 0 : if (interruptNet) return;
2277 : :
2278 : : // hold off on querying seeds if P2P network deactivated
2279 [ # # ]: 0 : if (!fNetworkActive) {
2280 [ # # ]: 0 : LogPrintf("Waiting for network to be reactivated before querying DNS seeds.\n");
2281 : 0 : do {
2282 [ # # # # ]: 0 : if (!interruptNet.sleep_for(std::chrono::seconds{1})) return;
2283 [ # # ]: 0 : } while (!fNetworkActive);
2284 : : }
2285 : :
2286 [ # # ]: 0 : LogPrintf("Loading addresses from DNS seed %s\n", seed);
2287 : : // If -proxy is in use, we make an ADDR_FETCH connection to the DNS resolved peer address
2288 : : // for the base dns seed domain in chainparams
2289 [ # # # # ]: 0 : if (HaveNameProxy()) {
2290 [ # # ]: 0 : AddAddrFetch(seed);
2291 : : } else {
2292 : 0 : std::vector<CAddress> vAdd;
2293 : 0 : constexpr ServiceFlags requiredServiceBits{SeedsServiceFlags()};
2294 [ # # ]: 0 : std::string host = strprintf("x%x.%s", requiredServiceBits, seed);
2295 [ # # ]: 0 : CNetAddr resolveSource;
2296 [ # # # # ]: 0 : if (!resolveSource.SetInternal(host)) {
2297 : 0 : continue;
2298 : : }
2299 : : // Limit number of IPs learned from a single DNS seed. This limit exists to prevent the results from
2300 : : // one DNS seed from dominating AddrMan. Note that the number of results from a UDP DNS query is
2301 : : // bounded to 33 already, but it is possible for it to use TCP where a larger number of results can be
2302 : : // returned.
2303 : 0 : unsigned int nMaxIPs = 32;
2304 [ # # # # ]: 0 : const auto addresses{LookupHost(host, nMaxIPs, true)};
2305 [ # # ]: 0 : if (!addresses.empty()) {
2306 [ # # ]: 0 : for (const CNetAddr& ip : addresses) {
2307 [ # # ]: 0 : CAddress addr = CAddress(CService(ip, m_params.GetDefaultPort()), requiredServiceBits);
2308 : 0 : addr.nTime = rng.rand_uniform_delay(Now<NodeSeconds>() - 3 * 24h, -4 * 24h); // use a random age between 3 and 7 days old
2309 [ # # ]: 0 : vAdd.push_back(addr);
2310 : 0 : found++;
2311 : 0 : }
2312 [ # # ]: 0 : addrman.Add(vAdd, resolveSource);
2313 : : } else {
2314 : : // If the seed does not support a subdomain with our desired service bits,
2315 : : // we make an ADDR_FETCH connection to the DNS resolved peer address for the
2316 : : // base dns seed domain in chainparams
2317 [ # # ]: 0 : AddAddrFetch(seed);
2318 : : }
2319 : 0 : }
2320 : 0 : --seeds_right_now;
2321 : : }
2322 [ # # ]: 0 : LogPrintf("%d addresses found from DNS seeds\n", found);
2323 : : } else {
2324 [ # # ]: 0 : LogPrintf("Skipping DNS seeds. Enough peers have been found\n");
2325 : : }
2326 : 0 : }
2327 : :
2328 : 0 : void CConnman::DumpAddresses()
2329 : : {
2330 : 0 : const auto start{SteadyClock::now()};
2331 : :
2332 : 0 : DumpPeerAddresses(::gArgs, addrman);
2333 : :
2334 [ # # ]: 0 : LogDebug(BCLog::NET, "Flushed %d addresses to peers.dat %dms\n",
2335 : : addrman.Size(), Ticks<std::chrono::milliseconds>(SteadyClock::now() - start));
2336 : 0 : }
2337 : :
2338 : 0 : void CConnman::ProcessAddrFetch()
2339 : : {
2340 : 0 : AssertLockNotHeld(m_unused_i2p_sessions_mutex);
2341 [ # # ]: 0 : std::string strDest;
2342 : 0 : {
2343 [ # # ]: 0 : LOCK(m_addr_fetches_mutex);
2344 [ # # ]: 0 : if (m_addr_fetches.empty())
2345 [ # # ]: 0 : return;
2346 [ # # ]: 0 : strDest = m_addr_fetches.front();
2347 [ # # ]: 0 : m_addr_fetches.pop_front();
2348 : 0 : }
2349 : : // Attempt v2 connection if we support v2 - we'll reconnect with v1 if our
2350 : : // peer doesn't support it or immediately disconnects us for another reason.
2351 [ # # ]: 0 : const bool use_v2transport(GetLocalServices() & NODE_P2P_V2);
2352 [ # # ]: 0 : CAddress addr;
2353 : 0 : CSemaphoreGrant grant(*semOutbound, /*fTry=*/true);
2354 [ # # ]: 0 : if (grant) {
2355 [ # # ]: 0 : OpenNetworkConnection(addr, false, std::move(grant), strDest.c_str(), ConnectionType::ADDR_FETCH, use_v2transport);
2356 : : }
2357 : 0 : }
2358 : :
2359 : 0 : bool CConnman::GetTryNewOutboundPeer() const
2360 : : {
2361 : 0 : return m_try_another_outbound_peer;
2362 : : }
2363 : :
2364 : 0 : void CConnman::SetTryNewOutboundPeer(bool flag)
2365 : : {
2366 : 0 : m_try_another_outbound_peer = flag;
2367 [ # # # # ]: 0 : LogDebug(BCLog::NET, "setting try another outbound peer=%s\n", flag ? "true" : "false");
2368 : 0 : }
2369 : :
2370 : 0 : void CConnman::StartExtraBlockRelayPeers()
2371 : : {
2372 [ # # ]: 0 : LogDebug(BCLog::NET, "enabling extra block-relay-only peers\n");
2373 : 0 : m_start_extra_block_relay_peers = true;
2374 : 0 : }
2375 : :
2376 : : // Return the number of outbound connections that are full relay (not blocks only)
2377 : 0 : int CConnman::GetFullOutboundConnCount() const
2378 : : {
2379 : 0 : int nRelevant = 0;
2380 : 0 : {
2381 : 0 : LOCK(m_nodes_mutex);
2382 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
2383 [ # # # # ]: 0 : if (pnode->fSuccessfullyConnected && pnode->IsFullOutboundConn()) ++nRelevant;
2384 : : }
2385 : 0 : }
2386 : 0 : return nRelevant;
2387 : : }
2388 : :
2389 : : // Return the number of peers we have over our outbound connection limit
2390 : : // Exclude peers that are marked for disconnect, or are going to be
2391 : : // disconnected soon (eg ADDR_FETCH and FEELER)
2392 : : // Also exclude peers that haven't finished initial connection handshake yet
2393 : : // (so that we don't decide we're over our desired connection limit, and then
2394 : : // evict some peer that has finished the handshake)
2395 : 0 : int CConnman::GetExtraFullOutboundCount() const
2396 : : {
2397 : 0 : int full_outbound_peers = 0;
2398 : 0 : {
2399 : 0 : LOCK(m_nodes_mutex);
2400 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
2401 [ # # # # : 0 : if (pnode->fSuccessfullyConnected && !pnode->fDisconnect && pnode->IsFullOutboundConn()) {
# # ]
2402 : 0 : ++full_outbound_peers;
2403 : : }
2404 : : }
2405 : 0 : }
2406 [ # # ]: 0 : return std::max(full_outbound_peers - m_max_outbound_full_relay, 0);
2407 : : }
2408 : :
2409 : 0 : int CConnman::GetExtraBlockRelayCount() const
2410 : : {
2411 : 0 : int block_relay_peers = 0;
2412 : 0 : {
2413 : 0 : LOCK(m_nodes_mutex);
2414 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
2415 [ # # # # : 0 : if (pnode->fSuccessfullyConnected && !pnode->fDisconnect && pnode->IsBlockOnlyConn()) {
# # ]
2416 : 0 : ++block_relay_peers;
2417 : : }
2418 : : }
2419 : 0 : }
2420 [ # # ]: 0 : return std::max(block_relay_peers - m_max_outbound_block_relay, 0);
2421 : : }
2422 : :
2423 : 0 : std::unordered_set<Network> CConnman::GetReachableEmptyNetworks() const
2424 : : {
2425 : 0 : std::unordered_set<Network> networks{};
2426 [ # # ]: 0 : for (int n = 0; n < NET_MAX; n++) {
2427 : 0 : enum Network net = (enum Network)n;
2428 [ # # ]: 0 : if (net == NET_UNROUTABLE || net == NET_INTERNAL) continue;
2429 [ # # # # : 0 : if (g_reachable_nets.Contains(net) && addrman.Size(net, std::nullopt) == 0) {
# # # # ]
2430 [ # # ]: 0 : networks.insert(net);
2431 : : }
2432 : : }
2433 : 0 : return networks;
2434 : 0 : }
2435 : :
2436 : 0 : bool CConnman::MultipleManualOrFullOutboundConns(Network net) const
2437 : : {
2438 : 0 : AssertLockHeld(m_nodes_mutex);
2439 : 0 : return m_network_conn_counts[net] > 1;
2440 : : }
2441 : :
2442 : 0 : bool CConnman::MaybePickPreferredNetwork(std::optional<Network>& network)
2443 : : {
2444 : 0 : std::array<Network, 5> nets{NET_IPV4, NET_IPV6, NET_ONION, NET_I2P, NET_CJDNS};
2445 : 0 : std::shuffle(nets.begin(), nets.end(), FastRandomContext());
2446 : :
2447 : 0 : LOCK(m_nodes_mutex);
2448 [ # # ]: 0 : for (const auto net : nets) {
2449 [ # # # # : 0 : if (g_reachable_nets.Contains(net) && m_network_conn_counts[net] == 0 && addrman.Size(net) != 0) {
# # # # #
# ]
2450 : 0 : network = net;
2451 : 0 : return true;
2452 : : }
2453 : : }
2454 : :
2455 : : return false;
2456 : 0 : }
2457 : :
2458 : 0 : void CConnman::ThreadOpenConnections(const std::vector<std::string> connect, Span<const std::string> seed_nodes)
2459 : : {
2460 : 0 : AssertLockNotHeld(m_unused_i2p_sessions_mutex);
2461 : 0 : AssertLockNotHeld(m_reconnections_mutex);
2462 : 0 : FastRandomContext rng;
2463 : : // Connect to specific addresses
2464 [ # # ]: 0 : if (!connect.empty())
2465 : : {
2466 : : // Attempt v2 connection if we support v2 - we'll reconnect with v1 if our
2467 : : // peer doesn't support it or immediately disconnects us for another reason.
2468 [ # # ]: 0 : const bool use_v2transport(GetLocalServices() & NODE_P2P_V2);
2469 : 0 : for (int64_t nLoop = 0;; nLoop++)
2470 : : {
2471 [ # # ]: 0 : for (const std::string& strAddr : connect)
2472 : : {
2473 [ # # ]: 0 : CAddress addr(CService(), NODE_NONE);
2474 [ # # ]: 0 : OpenNetworkConnection(addr, false, {}, strAddr.c_str(), ConnectionType::MANUAL, /*use_v2transport=*/use_v2transport);
2475 [ # # # # ]: 0 : for (int i = 0; i < 10 && i < nLoop; i++)
2476 : : {
2477 [ # # # # ]: 0 : if (!interruptNet.sleep_for(std::chrono::milliseconds(500)))
2478 : 0 : return;
2479 : : }
2480 : 0 : }
2481 [ # # # # ]: 0 : if (!interruptNet.sleep_for(std::chrono::milliseconds(500)))
2482 : : return;
2483 [ # # ]: 0 : PerformReconnections();
2484 : 0 : }
2485 : : }
2486 : :
2487 : : // Initiate network connections
2488 : 0 : auto start = GetTime<std::chrono::microseconds>();
2489 : :
2490 : : // Minimum time before next feeler connection (in microseconds).
2491 : 0 : auto next_feeler = start + rng.rand_exp_duration(FEELER_INTERVAL);
2492 : 0 : auto next_extra_block_relay = start + rng.rand_exp_duration(EXTRA_BLOCK_RELAY_ONLY_PEER_INTERVAL);
2493 [ # # ]: 0 : auto next_extra_network_peer{start + rng.rand_exp_duration(EXTRA_NETWORK_PEER_INTERVAL)};
2494 [ # # # # ]: 0 : const bool dnsseed = gArgs.GetBoolArg("-dnsseed", DEFAULT_DNSSEED);
2495 [ # # # # ]: 0 : bool add_fixed_seeds = gArgs.GetBoolArg("-fixedseeds", DEFAULT_FIXEDSEEDS);
2496 [ # # # # ]: 0 : const bool use_seednodes{gArgs.IsArgSet("-seednode")};
2497 : :
2498 : 0 : auto seed_node_timer = NodeClock::now();
2499 [ # # # # : 0 : bool add_addr_fetch{addrman.Size() == 0 && !seed_nodes.empty()};
# # ]
2500 : 0 : constexpr std::chrono::seconds ADD_NEXT_SEEDNODE = 10s;
2501 : :
2502 [ # # ]: 0 : if (!add_fixed_seeds) {
2503 [ # # ]: 0 : LogPrintf("Fixed seeds are disabled\n");
2504 : : }
2505 : :
2506 [ # # # # ]: 0 : while (!interruptNet)
2507 : : {
2508 [ # # ]: 0 : if (add_addr_fetch) {
2509 : 0 : add_addr_fetch = false;
2510 : 0 : const auto& seed{SpanPopBack(seed_nodes)};
2511 [ # # ]: 0 : AddAddrFetch(seed);
2512 : :
2513 [ # # # # ]: 0 : if (addrman.Size() == 0) {
2514 [ # # ]: 0 : LogInfo("Empty addrman, adding seednode (%s) to addrfetch\n", seed);
2515 : : } else {
2516 [ # # ]: 0 : LogInfo("Couldn't connect to peers from addrman after %d seconds. Adding seednode (%s) to addrfetch\n", ADD_NEXT_SEEDNODE.count(), seed);
2517 : : }
2518 : : }
2519 : :
2520 [ # # ]: 0 : ProcessAddrFetch();
2521 : :
2522 [ # # # # ]: 0 : if (!interruptNet.sleep_for(std::chrono::milliseconds(500)))
2523 : : return;
2524 : :
2525 [ # # ]: 0 : PerformReconnections();
2526 : :
2527 : 0 : CSemaphoreGrant grant(*semOutbound);
2528 [ # # # # ]: 0 : if (interruptNet)
2529 : : return;
2530 : :
2531 [ # # ]: 0 : const std::unordered_set<Network> fixed_seed_networks{GetReachableEmptyNetworks()};
2532 [ # # # # ]: 0 : if (add_fixed_seeds && !fixed_seed_networks.empty()) {
2533 : : // When the node starts with an empty peers.dat, there are a few other sources of peers before
2534 : : // we fallback on to fixed seeds: -dnsseed, -seednode, -addnode
2535 : : // If none of those are available, we fallback on to fixed seeds immediately, else we allow
2536 : : // 60 seconds for any of those sources to populate addrman.
2537 : 0 : bool add_fixed_seeds_now = false;
2538 : : // It is cheapest to check if enough time has passed first.
2539 [ # # ]: 0 : if (GetTime<std::chrono::seconds>() > start + std::chrono::minutes{1}) {
2540 : 0 : add_fixed_seeds_now = true;
2541 [ # # ]: 0 : LogPrintf("Adding fixed seeds as 60 seconds have passed and addrman is empty for at least one reachable network\n");
2542 : : }
2543 : :
2544 : : // Perform cheap checks before locking a mutex.
2545 [ # # ]: 0 : else if (!dnsseed && !use_seednodes) {
2546 [ # # ]: 0 : LOCK(m_added_nodes_mutex);
2547 [ # # ]: 0 : if (m_added_node_params.empty()) {
2548 : 0 : add_fixed_seeds_now = true;
2549 [ # # ]: 0 : LogPrintf("Adding fixed seeds as -dnsseed=0 (or IPv4/IPv6 connections are disabled via -onlynet) and neither -addnode nor -seednode are provided\n");
2550 : : }
2551 : 0 : }
2552 : :
2553 [ # # ]: 0 : if (add_fixed_seeds_now) {
2554 [ # # ]: 0 : std::vector<CAddress> seed_addrs{ConvertSeeds(m_params.FixedSeeds())};
2555 : : // We will not make outgoing connections to peers that are unreachable
2556 : : // (e.g. because of -onlynet configuration).
2557 : : // Therefore, we do not add them to addrman in the first place.
2558 : : // In case previously unreachable networks become reachable
2559 : : // (e.g. in case of -onlynet changes by the user), fixed seeds will
2560 : : // be loaded only for networks for which we have no addresses.
2561 [ # # ]: 0 : seed_addrs.erase(std::remove_if(seed_addrs.begin(), seed_addrs.end(),
2562 : 0 : [&fixed_seed_networks](const CAddress& addr) { return fixed_seed_networks.count(addr.GetNetwork()) == 0; }),
2563 [ # # ]: 0 : seed_addrs.end());
2564 [ # # ]: 0 : CNetAddr local;
2565 [ # # # # ]: 0 : local.SetInternal("fixedseeds");
2566 [ # # ]: 0 : addrman.Add(seed_addrs, local);
2567 : 0 : add_fixed_seeds = false;
2568 [ # # ]: 0 : LogPrintf("Added %d fixed seeds from reachable networks.\n", seed_addrs.size());
2569 : 0 : }
2570 : : }
2571 : :
2572 : : //
2573 : : // Choose an address to connect to based on most recently seen
2574 : : //
2575 [ # # ]: 0 : CAddress addrConnect;
2576 : :
2577 : : // Only connect out to one peer per ipv4/ipv6 network group (/16 for IPv4).
2578 : 0 : int nOutboundFullRelay = 0;
2579 : 0 : int nOutboundBlockRelay = 0;
2580 : 0 : int outbound_privacy_network_peers = 0;
2581 [ # # ]: 0 : std::set<std::vector<unsigned char>> outbound_ipv46_peer_netgroups;
2582 : :
2583 : 0 : {
2584 [ # # ]: 0 : LOCK(m_nodes_mutex);
2585 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
2586 [ # # ]: 0 : if (pnode->IsFullOutboundConn()) nOutboundFullRelay++;
2587 [ # # ]: 0 : if (pnode->IsBlockOnlyConn()) nOutboundBlockRelay++;
2588 : :
2589 : : // Make sure our persistent outbound slots to ipv4/ipv6 peers belong to different netgroups.
2590 [ # # ]: 0 : switch (pnode->m_conn_type) {
2591 : : // We currently don't take inbound connections into account. Since they are
2592 : : // free to make, an attacker could make them to prevent us from connecting to
2593 : : // certain peers.
2594 : : case ConnectionType::INBOUND:
2595 : : // Short-lived outbound connections should not affect how we select outbound
2596 : : // peers from addrman.
2597 : : case ConnectionType::ADDR_FETCH:
2598 : : case ConnectionType::FEELER:
2599 : : break;
2600 : 0 : case ConnectionType::MANUAL:
2601 : 0 : case ConnectionType::OUTBOUND_FULL_RELAY:
2602 : 0 : case ConnectionType::BLOCK_RELAY:
2603 : 0 : const CAddress address{pnode->addr};
2604 [ # # # # : 0 : if (address.IsTor() || address.IsI2P() || address.IsCJDNS()) {
# # ]
2605 : : // Since our addrman-groups for these networks are
2606 : : // random, without relation to the route we
2607 : : // take to connect to these peers or to the
2608 : : // difficulty in obtaining addresses with diverse
2609 : : // groups, we don't worry about diversity with
2610 : : // respect to our addrman groups when connecting to
2611 : : // these networks.
2612 : 0 : ++outbound_privacy_network_peers;
2613 : : } else {
2614 [ # # # # ]: 0 : outbound_ipv46_peer_netgroups.insert(m_netgroupman.GetGroup(address));
2615 : : }
2616 : : } // no default case, so the compiler can warn about missing cases
2617 : : }
2618 : 0 : }
2619 : :
2620 [ # # # # ]: 0 : if (!seed_nodes.empty() && nOutboundFullRelay < SEED_OUTBOUND_CONNECTION_THRESHOLD) {
2621 [ # # ]: 0 : if (NodeClock::now() > seed_node_timer + ADD_NEXT_SEEDNODE) {
2622 : 0 : seed_node_timer = NodeClock::now();
2623 : 0 : add_addr_fetch = true;
2624 : : }
2625 : : }
2626 : :
2627 : 0 : ConnectionType conn_type = ConnectionType::OUTBOUND_FULL_RELAY;
2628 : 0 : auto now = GetTime<std::chrono::microseconds>();
2629 : 0 : bool anchor = false;
2630 : 0 : bool fFeeler = false;
2631 : 0 : std::optional<Network> preferred_net;
2632 : :
2633 : : // Determine what type of connection to open. Opening
2634 : : // BLOCK_RELAY connections to addresses from anchors.dat gets the highest
2635 : : // priority. Then we open OUTBOUND_FULL_RELAY priority until we
2636 : : // meet our full-relay capacity. Then we open BLOCK_RELAY connection
2637 : : // until we hit our block-relay-only peer limit.
2638 : : // GetTryNewOutboundPeer() gets set when a stale tip is detected, so we
2639 : : // try opening an additional OUTBOUND_FULL_RELAY connection. If none of
2640 : : // these conditions are met, check to see if it's time to try an extra
2641 : : // block-relay-only peer (to confirm our tip is current, see below) or the next_feeler
2642 : : // timer to decide if we should open a FEELER.
2643 : :
2644 [ # # # # ]: 0 : if (!m_anchors.empty() && (nOutboundBlockRelay < m_max_outbound_block_relay)) {
2645 : : conn_type = ConnectionType::BLOCK_RELAY;
2646 : : anchor = true;
2647 [ # # ]: 0 : } else if (nOutboundFullRelay < m_max_outbound_full_relay) {
2648 : : // OUTBOUND_FULL_RELAY
2649 [ # # ]: 0 : } else if (nOutboundBlockRelay < m_max_outbound_block_relay) {
2650 : : conn_type = ConnectionType::BLOCK_RELAY;
2651 [ # # # # ]: 0 : } else if (GetTryNewOutboundPeer()) {
2652 : : // OUTBOUND_FULL_RELAY
2653 [ # # # # ]: 0 : } else if (now > next_extra_block_relay && m_start_extra_block_relay_peers) {
2654 : : // Periodically connect to a peer (using regular outbound selection
2655 : : // methodology from addrman) and stay connected long enough to sync
2656 : : // headers, but not much else.
2657 : : //
2658 : : // Then disconnect the peer, if we haven't learned anything new.
2659 : : //
2660 : : // The idea is to make eclipse attacks very difficult to pull off,
2661 : : // because every few minutes we're finding a new peer to learn headers
2662 : : // from.
2663 : : //
2664 : : // This is similar to the logic for trying extra outbound (full-relay)
2665 : : // peers, except:
2666 : : // - we do this all the time on an exponential timer, rather than just when
2667 : : // our tip is stale
2668 : : // - we potentially disconnect our next-youngest block-relay-only peer, if our
2669 : : // newest block-relay-only peer delivers a block more recently.
2670 : : // See the eviction logic in net_processing.cpp.
2671 : : //
2672 : : // Because we can promote these connections to block-relay-only
2673 : : // connections, they do not get their own ConnectionType enum
2674 : : // (similar to how we deal with extra outbound peers).
2675 : 0 : next_extra_block_relay = now + rng.rand_exp_duration(EXTRA_BLOCK_RELAY_ONLY_PEER_INTERVAL);
2676 : 0 : conn_type = ConnectionType::BLOCK_RELAY;
2677 [ # # ]: 0 : } else if (now > next_feeler) {
2678 : 0 : next_feeler = now + rng.rand_exp_duration(FEELER_INTERVAL);
2679 : 0 : conn_type = ConnectionType::FEELER;
2680 : 0 : fFeeler = true;
2681 [ # # ]: 0 : } else if (nOutboundFullRelay == m_max_outbound_full_relay &&
2682 [ # # ]: 0 : m_max_outbound_full_relay == MAX_OUTBOUND_FULL_RELAY_CONNECTIONS &&
2683 [ # # # # : 0 : now > next_extra_network_peer &&
# # ]
2684 [ # # ]: 0 : MaybePickPreferredNetwork(preferred_net)) {
2685 : : // Full outbound connection management: Attempt to get at least one
2686 : : // outbound peer from each reachable network by making extra connections
2687 : : // and then protecting "only" peers from a network during outbound eviction.
2688 : : // This is not attempted if the user changed -maxconnections to a value
2689 : : // so low that less than MAX_OUTBOUND_FULL_RELAY_CONNECTIONS are made,
2690 : : // to prevent interactions with otherwise protected outbound peers.
2691 : 0 : next_extra_network_peer = now + rng.rand_exp_duration(EXTRA_NETWORK_PEER_INTERVAL);
2692 : : } else {
2693 : : // skip to next iteration of while loop
2694 : 0 : continue;
2695 : : }
2696 : :
2697 [ # # ]: 0 : addrman.ResolveCollisions();
2698 : :
2699 : 0 : const auto current_time{NodeClock::now()};
2700 : 0 : int nTries = 0;
2701 [ # # ]: 0 : const auto reachable_nets{g_reachable_nets.All()};
2702 : :
2703 [ # # # # ]: 0 : while (!interruptNet)
2704 : : {
2705 [ # # # # ]: 0 : if (anchor && !m_anchors.empty()) {
2706 : 0 : const CAddress addr = m_anchors.back();
2707 : 0 : m_anchors.pop_back();
2708 [ # # # # : 0 : if (!addr.IsValid() || IsLocal(addr) || !g_reachable_nets.Contains(addr) ||
# # # # #
# # # #
# ]
2709 [ # # # # : 0 : !m_msgproc->HasAllDesirableServiceFlags(addr.nServices) ||
# # ]
2710 [ # # ]: 0 : outbound_ipv46_peer_netgroups.count(m_netgroupman.GetGroup(addr))) continue;
2711 : 0 : addrConnect = addr;
2712 [ # # # # : 0 : LogDebug(BCLog::NET, "Trying to make an anchor connection to %s\n", addrConnect.ToStringAddrPort());
# # # # ]
2713 : 0 : break;
2714 : 0 : }
2715 : :
2716 : : // If we didn't find an appropriate destination after trying 100 addresses fetched from addrman,
2717 : : // stop this loop, and let the outer loop run again (which sleeps, adds seed nodes, recalculates
2718 : : // already-connected network ranges, ...) before trying new addrman addresses.
2719 : 0 : nTries++;
2720 [ # # ]: 0 : if (nTries > 100)
2721 : : break;
2722 : :
2723 [ # # ]: 0 : CAddress addr;
2724 : 0 : NodeSeconds addr_last_try{0s};
2725 : :
2726 [ # # ]: 0 : if (fFeeler) {
2727 : : // First, try to get a tried table collision address. This returns
2728 : : // an empty (invalid) address if there are no collisions to try.
2729 [ # # ]: 0 : std::tie(addr, addr_last_try) = addrman.SelectTriedCollision();
2730 : :
2731 [ # # # # ]: 0 : if (!addr.IsValid()) {
2732 : : // No tried table collisions. Select a new table address
2733 : : // for our feeler.
2734 [ # # ]: 0 : std::tie(addr, addr_last_try) = addrman.Select(true, reachable_nets);
2735 [ # # # # ]: 0 : } else if (AlreadyConnectedToAddress(addr)) {
2736 : : // If test-before-evict logic would have us connect to a
2737 : : // peer that we're already connected to, just mark that
2738 : : // address as Good(). We won't be able to initiate the
2739 : : // connection anyway, so this avoids inadvertently evicting
2740 : : // a currently-connected peer.
2741 [ # # ]: 0 : addrman.Good(addr);
2742 : : // Select a new table address for our feeler instead.
2743 [ # # ]: 0 : std::tie(addr, addr_last_try) = addrman.Select(true, reachable_nets);
2744 : : }
2745 : : } else {
2746 : : // Not a feeler
2747 : : // If preferred_net has a value set, pick an extra outbound
2748 : : // peer from that network. The eviction logic in net_processing
2749 : : // ensures that a peer from another network will be evicted.
2750 [ # # ]: 0 : std::tie(addr, addr_last_try) = preferred_net.has_value()
2751 [ # # # # : 0 : ? addrman.Select(false, {*preferred_net})
# # # # #
# ]
2752 [ # # ]: 0 : : addrman.Select(false, reachable_nets);
2753 : : }
2754 : :
2755 : : // Require outbound IPv4/IPv6 connections, other than feelers, to be to distinct network groups
2756 [ # # # # : 0 : if (!fFeeler && outbound_ipv46_peer_netgroups.count(m_netgroupman.GetGroup(addr))) {
# # # # ]
2757 : 0 : continue;
2758 : : }
2759 : :
2760 : : // if we selected an invalid or local address, restart
2761 [ # # # # : 0 : if (!addr.IsValid() || IsLocal(addr)) {
# # # # ]
2762 : : break;
2763 : : }
2764 : :
2765 [ # # # # ]: 0 : if (!g_reachable_nets.Contains(addr)) {
2766 : 0 : continue;
2767 : : }
2768 : :
2769 : : // only consider very recently tried nodes after 30 failed attempts
2770 [ # # # # ]: 0 : if (current_time - addr_last_try < 10min && nTries < 30) {
2771 : 0 : continue;
2772 : : }
2773 : :
2774 : : // for non-feelers, require all the services we'll want,
2775 : : // for feelers, only require they be a full node (only because most
2776 : : // SPV clients don't have a good address DB available)
2777 [ # # # # : 0 : if (!fFeeler && !m_msgproc->HasAllDesirableServiceFlags(addr.nServices)) {
# # ]
2778 : 0 : continue;
2779 [ # # # # ]: 0 : } else if (fFeeler && !MayHaveUsefulAddressDB(addr.nServices)) {
2780 : 0 : continue;
2781 : : }
2782 : :
2783 : : // Do not connect to bad ports, unless 50 invalid addresses have been selected already.
2784 [ # # # # : 0 : if (nTries < 50 && (addr.IsIPv4() || addr.IsIPv6()) && IsBadPort(addr.GetPort())) {
# # # # #
# # # ]
2785 : 0 : continue;
2786 : : }
2787 : :
2788 : : // Do not make automatic outbound connections to addnode peers, to
2789 : : // not use our limited outbound slots for them and to ensure
2790 : : // addnode connections benefit from their intended protections.
2791 [ # # # # ]: 0 : if (AddedNodesContain(addr)) {
2792 [ # # # # : 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Debug, "Not making automatic %s%s connection to %s peer selected for manual (addnode) connection%s\n",
# # # # #
# # # # #
# # # # #
# # # # #
# # ]
2793 : : preferred_net.has_value() ? "network-specific " : "",
2794 : : ConnectionTypeAsString(conn_type), GetNetworkName(addr.GetNetwork()),
2795 : : fLogIPs ? strprintf(": %s", addr.ToStringAddrPort()) : "");
2796 : 0 : continue;
2797 : : }
2798 : :
2799 : 0 : addrConnect = addr;
2800 : : break;
2801 : 0 : }
2802 : :
2803 [ # # # # ]: 0 : if (addrConnect.IsValid()) {
2804 [ # # ]: 0 : if (fFeeler) {
2805 : : // Add small amount of random noise before connection to avoid synchronization.
2806 [ # # # # ]: 0 : if (!interruptNet.sleep_for(rng.rand_uniform_duration<CThreadInterrupt::Clock>(FEELER_SLEEP_WINDOW))) {
2807 : 0 : return;
2808 : : }
2809 [ # # # # : 0 : LogDebug(BCLog::NET, "Making feeler connection to %s\n", addrConnect.ToStringAddrPort());
# # # # ]
2810 : : }
2811 : :
2812 [ # # # # : 0 : if (preferred_net != std::nullopt) LogDebug(BCLog::NET, "Making network specific connection to %s on %s.\n", addrConnect.ToStringAddrPort(), GetNetworkName(preferred_net.value()));
# # # # #
# # # #
# ]
2813 : :
2814 : : // Record addrman failure attempts when node has at least 2 persistent outbound connections to peers with
2815 : : // different netgroups in ipv4/ipv6 networks + all peers in Tor/I2P/CJDNS networks.
2816 : : // Don't record addrman failure attempts when node is offline. This can be identified since all local
2817 : : // network connections (if any) belong in the same netgroup, and the size of `outbound_ipv46_peer_netgroups` would only be 1.
2818 [ # # ]: 0 : const bool count_failures{((int)outbound_ipv46_peer_netgroups.size() + outbound_privacy_network_peers) >= std::min(m_max_automatic_connections - 1, 2)};
2819 : : // Use BIP324 transport when both us and them have NODE_V2_P2P set.
2820 [ # # ]: 0 : const bool use_v2transport(addrConnect.nServices & GetLocalServices() & NODE_P2P_V2);
2821 [ # # ]: 0 : OpenNetworkConnection(addrConnect, count_failures, std::move(grant), /*strDest=*/nullptr, conn_type, use_v2transport);
2822 : : }
2823 : 0 : }
2824 : 0 : }
2825 : :
2826 : 0 : std::vector<CAddress> CConnman::GetCurrentBlockRelayOnlyConns() const
2827 : : {
2828 : 0 : std::vector<CAddress> ret;
2829 [ # # ]: 0 : LOCK(m_nodes_mutex);
2830 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
2831 [ # # ]: 0 : if (pnode->IsBlockOnlyConn()) {
2832 [ # # ]: 0 : ret.push_back(pnode->addr);
2833 : : }
2834 : : }
2835 : :
2836 [ # # ]: 0 : return ret;
2837 : 0 : }
2838 : :
2839 : 0 : std::vector<AddedNodeInfo> CConnman::GetAddedNodeInfo(bool include_connected) const
2840 : : {
2841 : 0 : std::vector<AddedNodeInfo> ret;
2842 : :
2843 [ # # ]: 0 : std::list<AddedNodeParams> lAddresses(0);
2844 : 0 : {
2845 [ # # ]: 0 : LOCK(m_added_nodes_mutex);
2846 [ # # ]: 0 : ret.reserve(m_added_node_params.size());
2847 [ # # ]: 0 : std::copy(m_added_node_params.cbegin(), m_added_node_params.cend(), std::back_inserter(lAddresses));
2848 : 0 : }
2849 : :
2850 : :
2851 : : // Build a map of all already connected addresses (by IP:port and by name) to inbound/outbound and resolved CService
2852 [ # # ]: 0 : std::map<CService, bool> mapConnected;
2853 : 0 : std::map<std::string, std::pair<bool, CService>> mapConnectedByName;
2854 : 0 : {
2855 [ # # ]: 0 : LOCK(m_nodes_mutex);
2856 [ # # ]: 0 : for (const CNode* pnode : m_nodes) {
2857 [ # # # # ]: 0 : if (pnode->addr.IsValid()) {
2858 [ # # ]: 0 : mapConnected[pnode->addr] = pnode->IsInboundConn();
2859 : : }
2860 [ # # ]: 0 : std::string addrName{pnode->m_addr_name};
2861 [ # # ]: 0 : if (!addrName.empty()) {
2862 [ # # ]: 0 : mapConnectedByName[std::move(addrName)] = std::make_pair(pnode->IsInboundConn(), static_cast<const CService&>(pnode->addr));
2863 : : }
2864 : 0 : }
2865 : 0 : }
2866 : :
2867 [ # # ]: 0 : for (const auto& addr : lAddresses) {
2868 [ # # # # : 0 : CService service{MaybeFlipIPv6toCJDNS(LookupNumeric(addr.m_added_node, GetDefaultPort(addr.m_added_node)))};
# # # # ]
2869 [ # # # # ]: 0 : AddedNodeInfo addedNode{addr, CService(), false, false};
2870 [ # # # # ]: 0 : if (service.IsValid()) {
2871 : : // strAddNode is an IP:port
2872 [ # # ]: 0 : auto it = mapConnected.find(service);
2873 [ # # ]: 0 : if (it != mapConnected.end()) {
2874 [ # # ]: 0 : if (!include_connected) {
2875 : 0 : continue;
2876 : : }
2877 : 0 : addedNode.resolvedAddress = service;
2878 : 0 : addedNode.fConnected = true;
2879 : 0 : addedNode.fInbound = it->second;
2880 : : }
2881 : : } else {
2882 : : // strAddNode is a name
2883 : 0 : auto it = mapConnectedByName.find(addr.m_added_node);
2884 [ # # ]: 0 : if (it != mapConnectedByName.end()) {
2885 [ # # ]: 0 : if (!include_connected) {
2886 : 0 : continue;
2887 : : }
2888 : 0 : addedNode.resolvedAddress = it->second.second;
2889 : 0 : addedNode.fConnected = true;
2890 : 0 : addedNode.fInbound = it->second.first;
2891 : : }
2892 : : }
2893 [ # # ]: 0 : ret.emplace_back(std::move(addedNode));
2894 : 0 : }
2895 : :
2896 : 0 : return ret;
2897 : 0 : }
2898 : :
2899 : 0 : void CConnman::ThreadOpenAddedConnections()
2900 : : {
2901 : 0 : AssertLockNotHeld(m_unused_i2p_sessions_mutex);
2902 : 0 : AssertLockNotHeld(m_reconnections_mutex);
2903 : 0 : while (true)
2904 : : {
2905 : 0 : CSemaphoreGrant grant(*semAddnode);
2906 [ # # ]: 0 : std::vector<AddedNodeInfo> vInfo = GetAddedNodeInfo(/*include_connected=*/false);
2907 : 0 : bool tried = false;
2908 [ # # ]: 0 : for (const AddedNodeInfo& info : vInfo) {
2909 [ # # ]: 0 : if (!grant) {
2910 : : // If we've used up our semaphore and need a new one, let's not wait here since while we are waiting
2911 : : // the addednodeinfo state might change.
2912 : : break;
2913 : : }
2914 : 0 : tried = true;
2915 [ # # ]: 0 : CAddress addr(CService(), NODE_NONE);
2916 [ # # ]: 0 : OpenNetworkConnection(addr, false, std::move(grant), info.m_params.m_added_node.c_str(), ConnectionType::MANUAL, info.m_params.m_use_v2transport);
2917 [ # # # # ]: 0 : if (!interruptNet.sleep_for(std::chrono::milliseconds(500))) return;
2918 : 0 : grant = CSemaphoreGrant(*semAddnode, /*fTry=*/true);
2919 : 0 : }
2920 : : // See if any reconnections are desired.
2921 [ # # ]: 0 : PerformReconnections();
2922 : : // Retry every 60 seconds if a connection was attempted, otherwise two seconds
2923 [ # # # # : 0 : if (!interruptNet.sleep_for(std::chrono::seconds(tried ? 60 : 2)))
# # ]
2924 : : return;
2925 : 0 : }
2926 : : }
2927 : :
2928 : : // if successful, this moves the passed grant to the constructed node
2929 : 0 : void CConnman::OpenNetworkConnection(const CAddress& addrConnect, bool fCountFailure, CSemaphoreGrant&& grant_outbound, const char *pszDest, ConnectionType conn_type, bool use_v2transport)
2930 : : {
2931 : 0 : AssertLockNotHeld(m_unused_i2p_sessions_mutex);
2932 [ # # ]: 0 : assert(conn_type != ConnectionType::INBOUND);
2933 : :
2934 : : //
2935 : : // Initiate outbound network connection
2936 : : //
2937 [ # # ]: 0 : if (interruptNet) {
2938 : : return;
2939 : : }
2940 [ # # ]: 0 : if (!fNetworkActive) {
2941 : : return;
2942 : : }
2943 [ # # ]: 0 : if (!pszDest) {
2944 [ # # # # : 0 : bool banned_or_discouraged = m_banman && (m_banman->IsDiscouraged(addrConnect) || m_banman->IsBanned(addrConnect));
# # ]
2945 [ # # # # : 0 : if (IsLocal(addrConnect) || banned_or_discouraged || AlreadyConnectedToAddress(addrConnect)) {
# # ]
2946 : 0 : return;
2947 : : }
2948 [ # # # # ]: 0 : } else if (FindNode(std::string(pszDest)))
2949 : : return;
2950 : :
2951 [ # # ]: 0 : CNode* pnode = ConnectNode(addrConnect, pszDest, fCountFailure, conn_type, use_v2transport);
2952 : :
2953 [ # # ]: 0 : if (!pnode)
2954 : : return;
2955 : 0 : pnode->grantOutbound = std::move(grant_outbound);
2956 : :
2957 : 0 : m_msgproc->InitializeNode(*pnode, m_local_services);
2958 : 0 : {
2959 : 0 : LOCK(m_nodes_mutex);
2960 [ # # ]: 0 : m_nodes.push_back(pnode);
2961 : :
2962 : : // update connection count by network
2963 [ # # # # ]: 0 : if (pnode->IsManualOrFullOutboundConn()) ++m_network_conn_counts[pnode->addr.GetNetwork()];
2964 : 0 : }
2965 : : }
2966 : :
2967 : : Mutex NetEventsInterface::g_msgproc_mutex;
2968 : :
2969 : 0 : void CConnman::ThreadMessageHandler()
2970 : : {
2971 : 0 : LOCK(NetEventsInterface::g_msgproc_mutex);
2972 : :
2973 [ # # ]: 0 : while (!flagInterruptMsgProc)
2974 : : {
2975 : 0 : bool fMoreWork = false;
2976 : :
2977 : 0 : {
2978 : : // Randomize the order in which we process messages from/to our peers.
2979 : : // This prevents attacks in which an attacker exploits having multiple
2980 : : // consecutive connections in the m_nodes list.
2981 [ # # ]: 0 : const NodesSnapshot snap{*this, /*shuffle=*/true};
2982 : :
2983 [ # # ]: 0 : for (CNode* pnode : snap.Nodes()) {
2984 [ # # ]: 0 : if (pnode->fDisconnect)
2985 : 0 : continue;
2986 : :
2987 : : // Receive messages
2988 [ # # ]: 0 : bool fMoreNodeWork = m_msgproc->ProcessMessages(pnode, flagInterruptMsgProc);
2989 [ # # # # ]: 0 : fMoreWork |= (fMoreNodeWork && !pnode->fPauseSend);
2990 [ # # ]: 0 : if (flagInterruptMsgProc)
2991 : : return;
2992 : : // Send messages
2993 [ # # ]: 0 : m_msgproc->SendMessages(pnode);
2994 : :
2995 [ # # ]: 0 : if (flagInterruptMsgProc)
2996 : : return;
2997 : : }
2998 [ # # ]: 0 : }
2999 : :
3000 [ # # ]: 0 : WAIT_LOCK(mutexMsgProc, lock);
3001 [ # # ]: 0 : if (!fMoreWork) {
3002 [ # # # # ]: 0 : condMsgProc.wait_until(lock, std::chrono::steady_clock::now() + std::chrono::milliseconds(100), [this]() EXCLUSIVE_LOCKS_REQUIRED(mutexMsgProc) { return fMsgProcWake; });
3003 : : }
3004 [ # # ]: 0 : fMsgProcWake = false;
3005 : 0 : }
3006 : 0 : }
3007 : :
3008 : 0 : void CConnman::ThreadI2PAcceptIncoming()
3009 : : {
3010 : 0 : static constexpr auto err_wait_begin = 1s;
3011 : 0 : static constexpr auto err_wait_cap = 5min;
3012 : 0 : auto err_wait = err_wait_begin;
3013 : :
3014 : 0 : bool advertising_listen_addr = false;
3015 : 0 : i2p::Connection conn;
3016 : :
3017 : 0 : auto SleepOnFailure = [&]() {
3018 : 0 : interruptNet.sleep_for(err_wait);
3019 [ # # ]: 0 : if (err_wait < err_wait_cap) {
3020 : 0 : err_wait += 1s;
3021 : : }
3022 : 0 : };
3023 : :
3024 [ # # # # ]: 0 : while (!interruptNet) {
3025 : :
3026 [ # # # # ]: 0 : if (!m_i2p_sam_session->Listen(conn)) {
3027 [ # # # # : 0 : if (advertising_listen_addr && conn.me.IsValid()) {
# # ]
3028 [ # # ]: 0 : RemoveLocal(conn.me);
3029 : : advertising_listen_addr = false;
3030 : : }
3031 [ # # ]: 0 : SleepOnFailure();
3032 : 0 : continue;
3033 : : }
3034 : :
3035 [ # # ]: 0 : if (!advertising_listen_addr) {
3036 [ # # ]: 0 : AddLocal(conn.me, LOCAL_MANUAL);
3037 : : advertising_listen_addr = true;
3038 : : }
3039 : :
3040 [ # # # # ]: 0 : if (!m_i2p_sam_session->Accept(conn)) {
3041 [ # # ]: 0 : SleepOnFailure();
3042 : 0 : continue;
3043 : : }
3044 : :
3045 [ # # ]: 0 : CreateNodeFromAcceptedSocket(std::move(conn.sock), NetPermissionFlags::None,
3046 : 0 : CAddress{conn.me, NODE_NONE}, CAddress{conn.peer, NODE_NONE});
3047 : :
3048 : 0 : err_wait = err_wait_begin;
3049 : : }
3050 : 0 : }
3051 : :
3052 : 0 : bool CConnman::BindListenPort(const CService& addrBind, bilingual_str& strError, NetPermissionFlags permissions)
3053 : : {
3054 : 0 : int nOne = 1;
3055 : :
3056 : : // Create socket for listening for incoming connections
3057 : 0 : struct sockaddr_storage sockaddr;
3058 : 0 : socklen_t len = sizeof(sockaddr);
3059 [ # # ]: 0 : if (!addrBind.GetSockAddr((struct sockaddr*)&sockaddr, &len))
3060 : : {
3061 [ # # # # : 0 : strError = strprintf(Untranslated("Bind address family for %s not supported"), addrBind.ToStringAddrPort());
# # ]
3062 [ # # ]: 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Error, "%s\n", strError.original);
3063 : 0 : return false;
3064 : : }
3065 : :
3066 : 0 : std::unique_ptr<Sock> sock = CreateSock(addrBind.GetSAFamily(), SOCK_STREAM, IPPROTO_TCP);
3067 [ # # ]: 0 : if (!sock) {
3068 [ # # # # : 0 : strError = strprintf(Untranslated("Couldn't open socket for incoming connections (socket returned error %s)"), NetworkErrorString(WSAGetLastError()));
# # # # ]
3069 [ # # # # : 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Error, "%s\n", strError.original);
# # ]
3070 : 0 : return false;
3071 : : }
3072 : :
3073 : : // Allow binding if the port is still in TIME_WAIT state after
3074 : : // the program was closed and restarted.
3075 [ # # # # ]: 0 : if (sock->SetSockOpt(SOL_SOCKET, SO_REUSEADDR, (sockopt_arg_type)&nOne, sizeof(int)) == SOCKET_ERROR) {
3076 [ # # # # : 0 : strError = strprintf(Untranslated("Error setting SO_REUSEADDR on socket: %s, continuing anyway"), NetworkErrorString(WSAGetLastError()));
# # # # ]
3077 [ # # ]: 0 : LogPrintf("%s\n", strError.original);
3078 : : }
3079 : :
3080 : : // some systems don't have IPV6_V6ONLY but are always v6only; others do have the option
3081 : : // and enable it by default or not. Try to enable it, if possible.
3082 [ # # ]: 0 : if (addrBind.IsIPv6()) {
3083 : : #ifdef IPV6_V6ONLY
3084 [ # # # # ]: 0 : if (sock->SetSockOpt(IPPROTO_IPV6, IPV6_V6ONLY, (sockopt_arg_type)&nOne, sizeof(int)) == SOCKET_ERROR) {
3085 [ # # # # : 0 : strError = strprintf(Untranslated("Error setting IPV6_V6ONLY on socket: %s, continuing anyway"), NetworkErrorString(WSAGetLastError()));
# # # # ]
3086 [ # # ]: 0 : LogPrintf("%s\n", strError.original);
3087 : : }
3088 : : #endif
3089 : : #ifdef WIN32
3090 : : int nProtLevel = PROTECTION_LEVEL_UNRESTRICTED;
3091 : : if (sock->SetSockOpt(IPPROTO_IPV6, IPV6_PROTECTION_LEVEL, (const char*)&nProtLevel, sizeof(int)) == SOCKET_ERROR) {
3092 : : strError = strprintf(Untranslated("Error setting IPV6_PROTECTION_LEVEL on socket: %s, continuing anyway"), NetworkErrorString(WSAGetLastError()));
3093 : : LogPrintf("%s\n", strError.original);
3094 : : }
3095 : : #endif
3096 : : }
3097 : :
3098 [ # # # # ]: 0 : if (sock->Bind(reinterpret_cast<struct sockaddr*>(&sockaddr), len) == SOCKET_ERROR) {
3099 : 0 : int nErr = WSAGetLastError();
3100 [ # # ]: 0 : if (nErr == WSAEADDRINUSE)
3101 [ # # # # : 0 : strError = strprintf(_("Unable to bind to %s on this computer. %s is probably already running."), addrBind.ToStringAddrPort(), CLIENT_NAME);
# # ]
3102 : : else
3103 [ # # # # : 0 : strError = strprintf(_("Unable to bind to %s on this computer (bind returned error %s)"), addrBind.ToStringAddrPort(), NetworkErrorString(nErr));
# # # # ]
3104 [ # # # # : 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Error, "%s\n", strError.original);
# # ]
3105 : 0 : return false;
3106 : : }
3107 [ # # # # ]: 0 : LogPrintf("Bound to %s\n", addrBind.ToStringAddrPort());
3108 : :
3109 : : // Listen for incoming connections
3110 [ # # # # ]: 0 : if (sock->Listen(SOMAXCONN) == SOCKET_ERROR)
3111 : : {
3112 [ # # # # : 0 : strError = strprintf(_("Listening for incoming connections failed (listen returned error %s)"), NetworkErrorString(WSAGetLastError()));
# # ]
3113 [ # # # # : 0 : LogPrintLevel(BCLog::NET, BCLog::Level::Error, "%s\n", strError.original);
# # ]
3114 : 0 : return false;
3115 : : }
3116 : :
3117 [ # # ]: 0 : vhListenSocket.emplace_back(std::move(sock), permissions);
3118 : : return true;
3119 : 0 : }
3120 : :
3121 : 0 : void Discover()
3122 : : {
3123 [ # # ]: 0 : if (!fDiscover)
3124 : : return;
3125 : :
3126 [ # # ]: 0 : for (const CNetAddr &addr: GetLocalAddresses()) {
3127 [ # # # # ]: 0 : if (AddLocal(addr, LOCAL_IF))
3128 [ # # # # ]: 0 : LogPrintf("%s: %s\n", __func__, addr.ToStringAddr());
3129 : 0 : }
3130 : : }
3131 : :
3132 : 0 : void CConnman::SetNetworkActive(bool active)
3133 : : {
3134 : 0 : LogPrintf("%s: %s\n", __func__, active);
3135 : :
3136 [ # # ]: 0 : if (fNetworkActive == active) {
3137 : : return;
3138 : : }
3139 : :
3140 [ # # ]: 0 : fNetworkActive = active;
3141 : :
3142 [ # # ]: 0 : if (m_client_interface) {
3143 : 0 : m_client_interface->NotifyNetworkActiveChanged(fNetworkActive);
3144 : : }
3145 : : }
3146 : :
3147 : 0 : CConnman::CConnman(uint64_t nSeed0In, uint64_t nSeed1In, AddrMan& addrman_in,
3148 : 0 : const NetGroupManager& netgroupman, const CChainParams& params, bool network_active)
3149 : 0 : : addrman(addrman_in)
3150 [ # # ]: 0 : , m_netgroupman{netgroupman}
3151 : 0 : , nSeed0(nSeed0In)
3152 : 0 : , nSeed1(nSeed1In)
3153 [ # # # # : 0 : , m_params(params)
# # # # ]
3154 : : {
3155 [ # # ]: 0 : SetTryNewOutboundPeer(false);
3156 : :
3157 : 0 : Options connOptions;
3158 [ # # ]: 0 : Init(connOptions);
3159 [ # # ]: 0 : SetNetworkActive(network_active);
3160 : 0 : }
3161 : :
3162 : 0 : NodeId CConnman::GetNewNodeId()
3163 : : {
3164 : 0 : return nLastNodeId.fetch_add(1, std::memory_order_relaxed);
3165 : : }
3166 : :
3167 : 0 : uint16_t CConnman::GetDefaultPort(Network net) const
3168 : : {
3169 [ # # ]: 0 : return net == NET_I2P ? I2P_SAM31_PORT : m_params.GetDefaultPort();
3170 : : }
3171 : :
3172 : 0 : uint16_t CConnman::GetDefaultPort(const std::string& addr) const
3173 : : {
3174 : 0 : CNetAddr a;
3175 [ # # # # : 0 : return a.SetSpecial(addr) ? GetDefaultPort(a.GetNetwork()) : m_params.GetDefaultPort();
# # # # ]
3176 : 0 : }
3177 : :
3178 : 0 : bool CConnman::Bind(const CService& addr_, unsigned int flags, NetPermissionFlags permissions)
3179 : : {
3180 : 0 : const CService addr{MaybeFlipIPv6toCJDNS(addr_)};
3181 : :
3182 [ # # ]: 0 : bilingual_str strError;
3183 [ # # # # ]: 0 : if (!BindListenPort(addr, strError, permissions)) {
3184 [ # # # # ]: 0 : if ((flags & BF_REPORT_ERROR) && m_client_interface) {
3185 [ # # # # ]: 0 : m_client_interface->ThreadSafeMessageBox(strError, "", CClientUIInterface::MSG_ERROR);
3186 : : }
3187 : 0 : return false;
3188 : : }
3189 : :
3190 [ # # # # : 0 : if (addr.IsRoutable() && fDiscover && !(flags & BF_DONT_ADVERTISE) && !NetPermissions::HasFlag(permissions, NetPermissionFlags::NoBan)) {
# # # # #
# ]
3191 [ # # ]: 0 : AddLocal(addr, LOCAL_BIND);
3192 : : }
3193 : :
3194 : : return true;
3195 : 0 : }
3196 : :
3197 : 0 : bool CConnman::InitBinds(const Options& options)
3198 : : {
3199 [ # # ]: 0 : for (const auto& addrBind : options.vBinds) {
3200 [ # # ]: 0 : if (!Bind(addrBind, BF_REPORT_ERROR, NetPermissionFlags::None)) {
3201 : : return false;
3202 : : }
3203 : : }
3204 [ # # ]: 0 : for (const auto& addrBind : options.vWhiteBinds) {
3205 [ # # ]: 0 : if (!Bind(addrBind.m_service, BF_REPORT_ERROR, addrBind.m_flags)) {
3206 : : return false;
3207 : : }
3208 : : }
3209 [ # # ]: 0 : for (const auto& addr_bind : options.onion_binds) {
3210 [ # # ]: 0 : if (!Bind(addr_bind, BF_REPORT_ERROR | BF_DONT_ADVERTISE, NetPermissionFlags::None)) {
3211 : : return false;
3212 : : }
3213 : : }
3214 [ # # ]: 0 : if (options.bind_on_any) {
3215 : : // Don't consider errors to bind on IPv6 "::" fatal because the host OS
3216 : : // may not have IPv6 support and the user did not explicitly ask us to
3217 : : // bind on that.
3218 : 0 : const CService ipv6_any{in6_addr(IN6ADDR_ANY_INIT), GetListenPort()}; // ::
3219 [ # # ]: 0 : Bind(ipv6_any, BF_NONE, NetPermissionFlags::None);
3220 : :
3221 : 0 : struct in_addr inaddr_any;
3222 : 0 : inaddr_any.s_addr = htonl(INADDR_ANY);
3223 [ # # # # ]: 0 : const CService ipv4_any{inaddr_any, GetListenPort()}; // 0.0.0.0
3224 [ # # # # ]: 0 : if (!Bind(ipv4_any, BF_REPORT_ERROR, NetPermissionFlags::None)) {
3225 : 0 : return false;
3226 : : }
3227 : 0 : }
3228 : : return true;
3229 : : }
3230 : :
3231 : 0 : bool CConnman::Start(CScheduler& scheduler, const Options& connOptions)
3232 : : {
3233 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3234 : 0 : Init(connOptions);
3235 : :
3236 [ # # # # ]: 0 : if (fListen && !InitBinds(connOptions)) {
3237 [ # # ]: 0 : if (m_client_interface) {
3238 [ # # ]: 0 : m_client_interface->ThreadSafeMessageBox(
3239 [ # # ]: 0 : _("Failed to listen on any port. Use -listen=0 if you want this."),
3240 : : "", CClientUIInterface::MSG_ERROR);
3241 : : }
3242 : 0 : return false;
3243 : : }
3244 : :
3245 : 0 : Proxy i2p_sam;
3246 [ # # # # : 0 : if (GetProxy(NET_I2P, i2p_sam) && connOptions.m_i2p_accept_incoming) {
# # ]
3247 [ # # # # ]: 0 : m_i2p_sam_session = std::make_unique<i2p::sam::Session>(gArgs.GetDataDirNet() / "i2p_private_key",
3248 [ # # ]: 0 : i2p_sam, &interruptNet);
3249 : : }
3250 : :
3251 : : // Randomize the order in which we may query seednode to potentially prevent connecting to the same one every restart (and signal that we have restarted)
3252 [ # # ]: 0 : std::vector<std::string> seed_nodes = connOptions.vSeedNodes;
3253 [ # # ]: 0 : if (!seed_nodes.empty()) {
3254 : 0 : std::shuffle(seed_nodes.begin(), seed_nodes.end(), FastRandomContext{});
3255 : : }
3256 : :
3257 [ # # ]: 0 : if (m_use_addrman_outgoing) {
3258 : : // Load addresses from anchors.dat
3259 [ # # # # : 0 : m_anchors = ReadAnchors(gArgs.GetDataDirNet() / ANCHORS_DATABASE_FILENAME);
# # ]
3260 [ # # ]: 0 : if (m_anchors.size() > MAX_BLOCK_RELAY_ONLY_ANCHORS) {
3261 [ # # ]: 0 : m_anchors.resize(MAX_BLOCK_RELAY_ONLY_ANCHORS);
3262 : : }
3263 [ # # ]: 0 : LogPrintf("%i block-relay-only anchors will be tried for connections.\n", m_anchors.size());
3264 : : }
3265 : :
3266 [ # # ]: 0 : if (m_client_interface) {
3267 [ # # # # ]: 0 : m_client_interface->InitMessage(_("Starting network threads…").translated);
3268 : : }
3269 : :
3270 : 0 : fAddressesInitialized = true;
3271 : :
3272 [ # # ]: 0 : if (semOutbound == nullptr) {
3273 : : // initialize semaphore
3274 [ # # # # ]: 0 : semOutbound = std::make_unique<CSemaphore>(std::min(m_max_automatic_outbound, m_max_automatic_connections));
3275 : : }
3276 [ # # ]: 0 : if (semAddnode == nullptr) {
3277 : : // initialize semaphore
3278 [ # # ]: 0 : semAddnode = std::make_unique<CSemaphore>(m_max_addnode);
3279 : : }
3280 : :
3281 : : //
3282 : : // Start threads
3283 : : //
3284 [ # # ]: 0 : assert(m_msgproc);
3285 [ # # ]: 0 : interruptNet.reset();
3286 [ # # ]: 0 : flagInterruptMsgProc = false;
3287 : :
3288 : 0 : {
3289 [ # # ]: 0 : LOCK(mutexMsgProc);
3290 [ # # ]: 0 : fMsgProcWake = false;
3291 : 0 : }
3292 : :
3293 : : // Send and receive from sockets, accept connections
3294 [ # # ]: 0 : threadSocketHandler = std::thread(&util::TraceThread, "net", [this] { ThreadSocketHandler(); });
3295 : :
3296 [ # # # # : 0 : if (!gArgs.GetBoolArg("-dnsseed", DEFAULT_DNSSEED))
# # ]
3297 [ # # ]: 0 : LogPrintf("DNS seeding disabled\n");
3298 : : else
3299 [ # # ]: 0 : threadDNSAddressSeed = std::thread(&util::TraceThread, "dnsseed", [this] { ThreadDNSAddressSeed(); });
3300 : :
3301 : : // Initiate manual connections
3302 [ # # ]: 0 : threadOpenAddedConnections = std::thread(&util::TraceThread, "addcon", [this] { ThreadOpenAddedConnections(); });
3303 : :
3304 [ # # # # ]: 0 : if (connOptions.m_use_addrman_outgoing && !connOptions.m_specified_outgoing.empty()) {
3305 [ # # ]: 0 : if (m_client_interface) {
3306 [ # # # # ]: 0 : m_client_interface->ThreadSafeMessageBox(
3307 [ # # ]: 0 : _("Cannot provide specific connections and have addrman find outgoing connections at the same time."),
3308 : : "", CClientUIInterface::MSG_ERROR);
3309 : : }
3310 : 0 : return false;
3311 : : }
3312 [ # # # # ]: 0 : if (connOptions.m_use_addrman_outgoing || !connOptions.m_specified_outgoing.empty()) {
3313 : 0 : threadOpenConnections = std::thread(
3314 [ # # ]: 0 : &util::TraceThread, "opencon",
3315 [ # # # # : 0 : [this, connect = connOptions.m_specified_outgoing, seed_nodes = std::move(seed_nodes)] { ThreadOpenConnections(connect, seed_nodes); });
# # ]
3316 : : }
3317 : :
3318 : : // Process messages
3319 [ # # ]: 0 : threadMessageHandler = std::thread(&util::TraceThread, "msghand", [this] { ThreadMessageHandler(); });
3320 : :
3321 [ # # ]: 0 : if (m_i2p_sam_session) {
3322 : 0 : threadI2PAcceptIncoming =
3323 [ # # ]: 0 : std::thread(&util::TraceThread, "i2paccept", [this] { ThreadI2PAcceptIncoming(); });
3324 : : }
3325 : :
3326 : : // Dump network addresses
3327 [ # # ]: 0 : scheduler.scheduleEvery([this] { DumpAddresses(); }, DUMP_PEERS_INTERVAL);
3328 : :
3329 : : // Run the ASMap Health check once and then schedule it to run every 24h.
3330 [ # # # # ]: 0 : if (m_netgroupman.UsingASMap()) {
3331 [ # # ]: 0 : ASMapHealthCheck();
3332 [ # # ]: 0 : scheduler.scheduleEvery([this] { ASMapHealthCheck(); }, ASMAP_HEALTH_CHECK_INTERVAL);
3333 : : }
3334 : :
3335 : : return true;
3336 : 0 : }
3337 : :
3338 : : class CNetCleanup
3339 : : {
3340 : : public:
3341 : : CNetCleanup() = default;
3342 : :
3343 : 2 : ~CNetCleanup()
3344 : : {
3345 : : #ifdef WIN32
3346 : : // Shutdown Windows Sockets
3347 : : WSACleanup();
3348 : : #endif
3349 : 2 : }
3350 : : };
3351 : : static CNetCleanup instance_of_cnetcleanup;
3352 : :
3353 : 0 : void CConnman::Interrupt()
3354 : : {
3355 : 0 : {
3356 : 0 : LOCK(mutexMsgProc);
3357 [ # # ]: 0 : flagInterruptMsgProc = true;
3358 : 0 : }
3359 : 0 : condMsgProc.notify_all();
3360 : :
3361 : 0 : interruptNet();
3362 : 0 : g_socks5_interrupt();
3363 : :
3364 [ # # ]: 0 : if (semOutbound) {
3365 [ # # ]: 0 : for (int i=0; i<m_max_automatic_outbound; i++) {
3366 : 0 : semOutbound->post();
3367 : : }
3368 : : }
3369 : :
3370 [ # # ]: 0 : if (semAddnode) {
3371 [ # # ]: 0 : for (int i=0; i<m_max_addnode; i++) {
3372 : 0 : semAddnode->post();
3373 : : }
3374 : : }
3375 : 0 : }
3376 : :
3377 : 0 : void CConnman::StopThreads()
3378 : : {
3379 [ # # ]: 0 : if (threadI2PAcceptIncoming.joinable()) {
3380 : 0 : threadI2PAcceptIncoming.join();
3381 : : }
3382 [ # # ]: 0 : if (threadMessageHandler.joinable())
3383 : 0 : threadMessageHandler.join();
3384 [ # # ]: 0 : if (threadOpenConnections.joinable())
3385 : 0 : threadOpenConnections.join();
3386 [ # # ]: 0 : if (threadOpenAddedConnections.joinable())
3387 : 0 : threadOpenAddedConnections.join();
3388 [ # # ]: 0 : if (threadDNSAddressSeed.joinable())
3389 : 0 : threadDNSAddressSeed.join();
3390 [ # # ]: 0 : if (threadSocketHandler.joinable())
3391 : 0 : threadSocketHandler.join();
3392 : 0 : }
3393 : :
3394 : 0 : void CConnman::StopNodes()
3395 : : {
3396 [ # # ]: 0 : if (fAddressesInitialized) {
3397 : 0 : DumpAddresses();
3398 : 0 : fAddressesInitialized = false;
3399 : :
3400 [ # # ]: 0 : if (m_use_addrman_outgoing) {
3401 : : // Anchor connections are only dumped during clean shutdown.
3402 : 0 : std::vector<CAddress> anchors_to_dump = GetCurrentBlockRelayOnlyConns();
3403 [ # # ]: 0 : if (anchors_to_dump.size() > MAX_BLOCK_RELAY_ONLY_ANCHORS) {
3404 [ # # ]: 0 : anchors_to_dump.resize(MAX_BLOCK_RELAY_ONLY_ANCHORS);
3405 : : }
3406 [ # # # # : 0 : DumpAnchors(gArgs.GetDataDirNet() / ANCHORS_DATABASE_FILENAME, anchors_to_dump);
# # ]
3407 : 0 : }
3408 : : }
3409 : :
3410 : : // Delete peer connections.
3411 : 0 : std::vector<CNode*> nodes;
3412 [ # # # # ]: 0 : WITH_LOCK(m_nodes_mutex, nodes.swap(m_nodes));
3413 [ # # ]: 0 : for (CNode* pnode : nodes) {
3414 [ # # ]: 0 : pnode->CloseSocketDisconnect();
3415 [ # # ]: 0 : DeleteNode(pnode);
3416 : : }
3417 : :
3418 [ # # ]: 0 : for (CNode* pnode : m_nodes_disconnected) {
3419 [ # # ]: 0 : DeleteNode(pnode);
3420 : : }
3421 : 0 : m_nodes_disconnected.clear();
3422 : 0 : vhListenSocket.clear();
3423 [ # # ]: 0 : semOutbound.reset();
3424 [ # # ]: 0 : semAddnode.reset();
3425 : 0 : }
3426 : :
3427 : 0 : void CConnman::DeleteNode(CNode* pnode)
3428 : : {
3429 [ # # ]: 0 : assert(pnode);
3430 : 0 : m_msgproc->FinalizeNode(*pnode);
3431 : 0 : delete pnode;
3432 : 0 : }
3433 : :
3434 : 0 : CConnman::~CConnman()
3435 : : {
3436 : 0 : Interrupt();
3437 : 0 : Stop();
3438 : 0 : }
3439 : :
3440 : 0 : std::vector<CAddress> CConnman::GetAddresses(size_t max_addresses, size_t max_pct, std::optional<Network> network, const bool filtered) const
3441 : : {
3442 : 0 : std::vector<CAddress> addresses = addrman.GetAddr(max_addresses, max_pct, network, filtered);
3443 [ # # ]: 0 : if (m_banman) {
3444 [ # # ]: 0 : addresses.erase(std::remove_if(addresses.begin(), addresses.end(),
3445 [ # # # # ]: 0 : [this](const CAddress& addr){return m_banman->IsDiscouraged(addr) || m_banman->IsBanned(addr);}),
3446 [ # # ]: 0 : addresses.end());
3447 : : }
3448 : 0 : return addresses;
3449 : 0 : }
3450 : :
3451 : 0 : std::vector<CAddress> CConnman::GetAddresses(CNode& requestor, size_t max_addresses, size_t max_pct)
3452 : : {
3453 : 0 : auto local_socket_bytes = requestor.addrBind.GetAddrBytes();
3454 [ # # ]: 0 : uint64_t cache_id = GetDeterministicRandomizer(RANDOMIZER_ID_ADDRCACHE)
3455 [ # # # # : 0 : .Write(requestor.ConnectedThroughNetwork())
# # ]
3456 [ # # # # ]: 0 : .Write(local_socket_bytes)
3457 : : // For outbound connections, the port of the bound address is randomly
3458 : : // assigned by the OS and would therefore not be useful for seeding.
3459 [ # # # # : 0 : .Write(requestor.IsInboundConn() ? requestor.addrBind.GetPort() : 0)
# # ]
3460 [ # # ]: 0 : .Finalize();
3461 : 0 : const auto current_time = GetTime<std::chrono::microseconds>();
3462 [ # # ]: 0 : auto r = m_addr_response_caches.emplace(cache_id, CachedAddrResponse{});
3463 [ # # ]: 0 : CachedAddrResponse& cache_entry = r.first->second;
3464 [ # # ]: 0 : if (cache_entry.m_cache_entry_expiration < current_time) { // If emplace() added new one it has expiration 0.
3465 [ # # ]: 0 : cache_entry.m_addrs_response_cache = GetAddresses(max_addresses, max_pct, /*network=*/std::nullopt);
3466 : : // Choosing a proper cache lifetime is a trade-off between the privacy leak minimization
3467 : : // and the usefulness of ADDR responses to honest users.
3468 : : //
3469 : : // Longer cache lifetime makes it more difficult for an attacker to scrape
3470 : : // enough AddrMan data to maliciously infer something useful.
3471 : : // By the time an attacker scraped enough AddrMan records, most of
3472 : : // the records should be old enough to not leak topology info by
3473 : : // e.g. analyzing real-time changes in timestamps.
3474 : : //
3475 : : // It takes only several hundred requests to scrape everything from an AddrMan containing 100,000 nodes,
3476 : : // so ~24 hours of cache lifetime indeed makes the data less inferable by the time
3477 : : // most of it could be scraped (considering that timestamps are updated via
3478 : : // ADDR self-announcements and when nodes communicate).
3479 : : // We also should be robust to those attacks which may not require scraping *full* victim's AddrMan
3480 : : // (because even several timestamps of the same handful of nodes may leak privacy).
3481 : : //
3482 : : // On the other hand, longer cache lifetime makes ADDR responses
3483 : : // outdated and less useful for an honest requestor, e.g. if most nodes
3484 : : // in the ADDR response are no longer active.
3485 : : //
3486 : : // However, the churn in the network is known to be rather low. Since we consider
3487 : : // nodes to be "terrible" (see IsTerrible()) if the timestamps are older than 30 days,
3488 : : // max. 24 hours of "penalty" due to cache shouldn't make any meaningful difference
3489 : : // in terms of the freshness of the response.
3490 : 0 : cache_entry.m_cache_entry_expiration = current_time +
3491 : 0 : 21h + FastRandomContext().randrange<std::chrono::microseconds>(6h);
3492 : : }
3493 [ # # ]: 0 : return cache_entry.m_addrs_response_cache;
3494 : 0 : }
3495 : :
3496 : 0 : bool CConnman::AddNode(const AddedNodeParams& add)
3497 : : {
3498 [ # # # # ]: 0 : const CService resolved(LookupNumeric(add.m_added_node, GetDefaultPort(add.m_added_node)));
3499 [ # # ]: 0 : const bool resolved_is_valid{resolved.IsValid()};
3500 : :
3501 [ # # ]: 0 : LOCK(m_added_nodes_mutex);
3502 [ # # ]: 0 : for (const auto& it : m_added_node_params) {
3503 [ # # # # : 0 : if (add.m_added_node == it.m_added_node || (resolved_is_valid && resolved == LookupNumeric(it.m_added_node, GetDefaultPort(it.m_added_node)))) return false;
# # # # #
# # # # #
# # # # #
# # # ]
3504 : : }
3505 : :
3506 [ # # ]: 0 : m_added_node_params.push_back(add);
3507 : : return true;
3508 : 0 : }
3509 : :
3510 : 0 : bool CConnman::RemoveAddedNode(const std::string& strNode)
3511 : : {
3512 : 0 : LOCK(m_added_nodes_mutex);
3513 [ # # ]: 0 : for (auto it = m_added_node_params.begin(); it != m_added_node_params.end(); ++it) {
3514 [ # # ]: 0 : if (strNode == it->m_added_node) {
3515 : 0 : m_added_node_params.erase(it);
3516 : 0 : return true;
3517 : : }
3518 : : }
3519 : : return false;
3520 : 0 : }
3521 : :
3522 : 0 : bool CConnman::AddedNodesContain(const CAddress& addr) const
3523 : : {
3524 : 0 : AssertLockNotHeld(m_added_nodes_mutex);
3525 : 0 : const std::string addr_str{addr.ToStringAddr()};
3526 [ # # ]: 0 : const std::string addr_port_str{addr.ToStringAddrPort()};
3527 [ # # ]: 0 : LOCK(m_added_nodes_mutex);
3528 [ # # ]: 0 : return (m_added_node_params.size() < 24 // bound the query to a reasonable limit
3529 [ # # # # ]: 0 : && std::any_of(m_added_node_params.cbegin(), m_added_node_params.cend(),
3530 [ # # # # : 0 : [&](const auto& p) { return p.m_added_node == addr_str || p.m_added_node == addr_port_str; }));
# # ]
3531 : 0 : }
3532 : :
3533 : 0 : size_t CConnman::GetNodeCount(ConnectionDirection flags) const
3534 : : {
3535 : 0 : LOCK(m_nodes_mutex);
3536 [ # # ]: 0 : if (flags == ConnectionDirection::Both) // Shortcut if we want total
3537 : 0 : return m_nodes.size();
3538 : :
3539 : 0 : int nNum = 0;
3540 [ # # ]: 0 : for (const auto& pnode : m_nodes) {
3541 [ # # # # ]: 0 : if (flags & (pnode->IsInboundConn() ? ConnectionDirection::In : ConnectionDirection::Out)) {
3542 : 0 : nNum++;
3543 : : }
3544 : : }
3545 : :
3546 : 0 : return nNum;
3547 : 0 : }
3548 : :
3549 : :
3550 : 0 : std::map<CNetAddr, LocalServiceInfo> CConnman::getNetLocalAddresses() const
3551 : : {
3552 : 0 : LOCK(g_maplocalhost_mutex);
3553 [ # # # # ]: 0 : return mapLocalHost;
3554 : 0 : }
3555 : :
3556 : 0 : uint32_t CConnman::GetMappedAS(const CNetAddr& addr) const
3557 : : {
3558 : 0 : return m_netgroupman.GetMappedAS(addr);
3559 : : }
3560 : :
3561 : 0 : void CConnman::GetNodeStats(std::vector<CNodeStats>& vstats) const
3562 : : {
3563 : 0 : vstats.clear();
3564 : 0 : LOCK(m_nodes_mutex);
3565 [ # # ]: 0 : vstats.reserve(m_nodes.size());
3566 [ # # ]: 0 : for (CNode* pnode : m_nodes) {
3567 [ # # ]: 0 : vstats.emplace_back();
3568 [ # # ]: 0 : pnode->CopyStats(vstats.back());
3569 [ # # ]: 0 : vstats.back().m_mapped_as = GetMappedAS(pnode->addr);
3570 : : }
3571 : 0 : }
3572 : :
3573 : 0 : bool CConnman::DisconnectNode(const std::string& strNode)
3574 : : {
3575 : 0 : LOCK(m_nodes_mutex);
3576 [ # # # # ]: 0 : if (CNode* pnode = FindNode(strNode)) {
3577 [ # # # # : 0 : LogDebug(BCLog::NET, "disconnect by address%s matched peer=%d; disconnecting\n", (fLogIPs ? strprintf("=%s", strNode) : ""), pnode->GetId());
# # # # #
# # # ]
3578 : 0 : pnode->fDisconnect = true;
3579 : 0 : return true;
3580 : : }
3581 : : return false;
3582 : 0 : }
3583 : :
3584 : 0 : bool CConnman::DisconnectNode(const CSubNet& subnet)
3585 : : {
3586 : 0 : bool disconnected = false;
3587 : 0 : LOCK(m_nodes_mutex);
3588 [ # # ]: 0 : for (CNode* pnode : m_nodes) {
3589 [ # # # # ]: 0 : if (subnet.Match(pnode->addr)) {
3590 [ # # # # : 0 : LogDebug(BCLog::NET, "disconnect by subnet%s matched peer=%d; disconnecting\n", (fLogIPs ? strprintf("=%s", subnet.ToString()) : ""), pnode->GetId());
# # # # #
# # # # #
# # # # ]
3591 : 0 : pnode->fDisconnect = true;
3592 : 0 : disconnected = true;
3593 : : }
3594 : : }
3595 [ # # ]: 0 : return disconnected;
3596 : 0 : }
3597 : :
3598 : 0 : bool CConnman::DisconnectNode(const CNetAddr& addr)
3599 : : {
3600 [ # # ]: 0 : return DisconnectNode(CSubNet(addr));
3601 : : }
3602 : :
3603 : 0 : bool CConnman::DisconnectNode(NodeId id)
3604 : : {
3605 : 0 : LOCK(m_nodes_mutex);
3606 [ # # ]: 0 : for(CNode* pnode : m_nodes) {
3607 [ # # ]: 0 : if (id == pnode->GetId()) {
3608 [ # # # # : 0 : LogDebug(BCLog::NET, "disconnect by id peer=%d; disconnecting\n", pnode->GetId());
# # ]
3609 : 0 : pnode->fDisconnect = true;
3610 : 0 : return true;
3611 : : }
3612 : : }
3613 : : return false;
3614 : 0 : }
3615 : :
3616 : 0 : void CConnman::RecordBytesRecv(uint64_t bytes)
3617 : : {
3618 : 0 : nTotalBytesRecv += bytes;
3619 : 0 : }
3620 : :
3621 : 0 : void CConnman::RecordBytesSent(uint64_t bytes)
3622 : : {
3623 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3624 : 0 : LOCK(m_total_bytes_sent_mutex);
3625 : :
3626 : 0 : nTotalBytesSent += bytes;
3627 : :
3628 : 0 : const auto now = GetTime<std::chrono::seconds>();
3629 [ # # ]: 0 : if (nMaxOutboundCycleStartTime + MAX_UPLOAD_TIMEFRAME < now)
3630 : : {
3631 : : // timeframe expired, reset cycle
3632 : 0 : nMaxOutboundCycleStartTime = now;
3633 : 0 : nMaxOutboundTotalBytesSentInCycle = 0;
3634 : : }
3635 : :
3636 [ # # ]: 0 : nMaxOutboundTotalBytesSentInCycle += bytes;
3637 : 0 : }
3638 : :
3639 : 0 : uint64_t CConnman::GetMaxOutboundTarget() const
3640 : : {
3641 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3642 : 0 : LOCK(m_total_bytes_sent_mutex);
3643 [ # # ]: 0 : return nMaxOutboundLimit;
3644 : 0 : }
3645 : :
3646 : 0 : std::chrono::seconds CConnman::GetMaxOutboundTimeframe() const
3647 : : {
3648 : 0 : return MAX_UPLOAD_TIMEFRAME;
3649 : : }
3650 : :
3651 : 0 : std::chrono::seconds CConnman::GetMaxOutboundTimeLeftInCycle() const
3652 : : {
3653 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3654 : 0 : LOCK(m_total_bytes_sent_mutex);
3655 [ # # ]: 0 : return GetMaxOutboundTimeLeftInCycle_();
3656 : 0 : }
3657 : :
3658 : 0 : std::chrono::seconds CConnman::GetMaxOutboundTimeLeftInCycle_() const
3659 : : {
3660 : 0 : AssertLockHeld(m_total_bytes_sent_mutex);
3661 : :
3662 [ # # ]: 0 : if (nMaxOutboundLimit == 0)
3663 : 0 : return 0s;
3664 : :
3665 [ # # ]: 0 : if (nMaxOutboundCycleStartTime.count() == 0)
3666 : 0 : return MAX_UPLOAD_TIMEFRAME;
3667 : :
3668 : 0 : const std::chrono::seconds cycleEndTime = nMaxOutboundCycleStartTime + MAX_UPLOAD_TIMEFRAME;
3669 : 0 : const auto now = GetTime<std::chrono::seconds>();
3670 [ # # ]: 0 : return (cycleEndTime < now) ? 0s : cycleEndTime - now;
3671 : : }
3672 : :
3673 : 0 : bool CConnman::OutboundTargetReached(bool historicalBlockServingLimit) const
3674 : : {
3675 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3676 : 0 : LOCK(m_total_bytes_sent_mutex);
3677 [ # # ]: 0 : if (nMaxOutboundLimit == 0)
3678 : : return false;
3679 : :
3680 [ # # ]: 0 : if (historicalBlockServingLimit)
3681 : : {
3682 : : // keep a large enough buffer to at least relay each block once
3683 [ # # ]: 0 : const std::chrono::seconds timeLeftInCycle = GetMaxOutboundTimeLeftInCycle_();
3684 : 0 : const uint64_t buffer = timeLeftInCycle / std::chrono::minutes{10} * MAX_BLOCK_SERIALIZED_SIZE;
3685 [ # # # # ]: 0 : if (buffer >= nMaxOutboundLimit || nMaxOutboundTotalBytesSentInCycle >= nMaxOutboundLimit - buffer)
3686 : 0 : return true;
3687 : : }
3688 [ # # ]: 0 : else if (nMaxOutboundTotalBytesSentInCycle >= nMaxOutboundLimit)
3689 : 0 : return true;
3690 : :
3691 : : return false;
3692 : 0 : }
3693 : :
3694 : 0 : uint64_t CConnman::GetOutboundTargetBytesLeft() const
3695 : : {
3696 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3697 : 0 : LOCK(m_total_bytes_sent_mutex);
3698 [ # # ]: 0 : if (nMaxOutboundLimit == 0)
3699 : : return 0;
3700 : :
3701 [ # # ]: 0 : return (nMaxOutboundTotalBytesSentInCycle >= nMaxOutboundLimit) ? 0 : nMaxOutboundLimit - nMaxOutboundTotalBytesSentInCycle;
3702 : 0 : }
3703 : :
3704 : 0 : uint64_t CConnman::GetTotalBytesRecv() const
3705 : : {
3706 : 0 : return nTotalBytesRecv;
3707 : : }
3708 : :
3709 : 0 : uint64_t CConnman::GetTotalBytesSent() const
3710 : : {
3711 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3712 : 0 : LOCK(m_total_bytes_sent_mutex);
3713 [ # # ]: 0 : return nTotalBytesSent;
3714 : 0 : }
3715 : :
3716 : 0 : ServiceFlags CConnman::GetLocalServices() const
3717 : : {
3718 : 0 : return m_local_services;
3719 : : }
3720 : :
3721 : 0 : static std::unique_ptr<Transport> MakeTransport(NodeId id, bool use_v2transport, bool inbound) noexcept
3722 : : {
3723 [ # # ]: 0 : if (use_v2transport) {
3724 [ # # ]: 0 : return std::make_unique<V2Transport>(id, /*initiating=*/!inbound);
3725 : : } else {
3726 [ # # ]: 0 : return std::make_unique<V1Transport>(id);
3727 : : }
3728 : : }
3729 : :
3730 : 0 : CNode::CNode(NodeId idIn,
3731 : : std::shared_ptr<Sock> sock,
3732 : : const CAddress& addrIn,
3733 : : uint64_t nKeyedNetGroupIn,
3734 : : uint64_t nLocalHostNonceIn,
3735 : : const CAddress& addrBindIn,
3736 : : const std::string& addrNameIn,
3737 : : ConnectionType conn_type_in,
3738 : : bool inbound_onion,
3739 : 0 : CNodeOptions&& node_opts)
3740 : 0 : : m_transport{MakeTransport(idIn, node_opts.use_v2transport, conn_type_in == ConnectionType::INBOUND)},
3741 : 0 : m_permission_flags{node_opts.permission_flags},
3742 [ # # ]: 0 : m_sock{sock},
3743 : 0 : m_connected{GetTime<std::chrono::seconds>()},
3744 : 0 : addr{addrIn},
3745 : 0 : addrBind{addrBindIn},
3746 [ # # # # : 0 : m_addr_name{addrNameIn.empty() ? addr.ToStringAddrPort() : addrNameIn},
# # ]
3747 [ # # ]: 0 : m_dest(addrNameIn),
3748 : 0 : m_inbound_onion{inbound_onion},
3749 [ # # ]: 0 : m_prefer_evict{node_opts.prefer_evict},
3750 : 0 : nKeyedNetGroup{nKeyedNetGroupIn},
3751 [ # # ]: 0 : m_conn_type{conn_type_in},
3752 : 0 : id{idIn},
3753 : 0 : nLocalHostNonce{nLocalHostNonceIn},
3754 [ # # ]: 0 : m_recv_flood_size{node_opts.recv_flood_size},
3755 [ # # # # : 0 : m_i2p_sam_session{std::move(node_opts.i2p_sam_session)}
# # ]
3756 : : {
3757 [ # # # # ]: 0 : if (inbound_onion) assert(conn_type_in == ConnectionType::INBOUND);
3758 : :
3759 [ # # ]: 0 : for (const auto& msg : ALL_NET_MESSAGE_TYPES) {
3760 [ # # ]: 0 : mapRecvBytesPerMsgType[msg] = 0;
3761 : : }
3762 [ # # ]: 0 : mapRecvBytesPerMsgType[NET_MESSAGE_TYPE_OTHER] = 0;
3763 : :
3764 [ # # ]: 0 : if (fLogIPs) {
3765 [ # # # # : 0 : LogDebug(BCLog::NET, "Added connection to %s peer=%d\n", m_addr_name, id);
# # ]
3766 : : } else {
3767 [ # # # # : 0 : LogDebug(BCLog::NET, "Added connection peer=%d\n", id);
# # ]
3768 : : }
3769 [ # # ]: 0 : }
3770 : :
3771 : 0 : void CNode::MarkReceivedMsgsForProcessing()
3772 : : {
3773 : 0 : AssertLockNotHeld(m_msg_process_queue_mutex);
3774 : :
3775 : 0 : size_t nSizeAdded = 0;
3776 [ # # ]: 0 : for (const auto& msg : vRecvMsg) {
3777 : : // vRecvMsg contains only completed CNetMessage
3778 : : // the single possible partially deserialized message are held by TransportDeserializer
3779 : 0 : nSizeAdded += msg.GetMemoryUsage();
3780 : : }
3781 : :
3782 : 0 : LOCK(m_msg_process_queue_mutex);
3783 : 0 : m_msg_process_queue.splice(m_msg_process_queue.end(), vRecvMsg);
3784 : 0 : m_msg_process_queue_size += nSizeAdded;
3785 [ # # ]: 0 : fPauseRecv = m_msg_process_queue_size > m_recv_flood_size;
3786 : 0 : }
3787 : :
3788 : 0 : std::optional<std::pair<CNetMessage, bool>> CNode::PollMessage()
3789 : : {
3790 : 0 : LOCK(m_msg_process_queue_mutex);
3791 [ # # ]: 0 : if (m_msg_process_queue.empty()) return std::nullopt;
3792 : :
3793 : 0 : std::list<CNetMessage> msgs;
3794 : : // Just take one message
3795 : 0 : msgs.splice(msgs.begin(), m_msg_process_queue, m_msg_process_queue.begin());
3796 : 0 : m_msg_process_queue_size -= msgs.front().GetMemoryUsage();
3797 : 0 : fPauseRecv = m_msg_process_queue_size > m_recv_flood_size;
3798 : :
3799 : 0 : return std::make_pair(std::move(msgs.front()), !m_msg_process_queue.empty());
3800 : 0 : }
3801 : :
3802 : 0 : bool CConnman::NodeFullyConnected(const CNode* pnode)
3803 : : {
3804 [ # # # # : 0 : return pnode && pnode->fSuccessfullyConnected && !pnode->fDisconnect;
# # ]
3805 : : }
3806 : :
3807 : 0 : void CConnman::PushMessage(CNode* pnode, CSerializedNetMsg&& msg)
3808 : : {
3809 : 0 : AssertLockNotHeld(m_total_bytes_sent_mutex);
3810 : 0 : size_t nMessageSize = msg.data.size();
3811 [ # # ]: 0 : LogDebug(BCLog::NET, "sending %s (%d bytes) peer=%d\n", msg.m_type, nMessageSize, pnode->GetId());
3812 [ # # # # ]: 0 : if (gArgs.GetBoolArg("-capturemessages", false)) {
3813 : 0 : CaptureMessage(pnode->addr, msg.m_type, msg.data, /*is_incoming=*/false);
3814 : : }
3815 : :
3816 : : TRACEPOINT(net, outbound_message,
3817 : : pnode->GetId(),
3818 : : pnode->m_addr_name.c_str(),
3819 : : pnode->ConnectionTypeAsString().c_str(),
3820 : : msg.m_type.c_str(),
3821 : : msg.data.size(),
3822 : : msg.data.data()
3823 : 0 : );
3824 : :
3825 : 0 : size_t nBytesSent = 0;
3826 : 0 : {
3827 : 0 : LOCK(pnode->cs_vSend);
3828 : : // Check if the transport still has unsent bytes, and indicate to it that we're about to
3829 : : // give it a message to send.
3830 [ # # ]: 0 : const auto& [to_send, more, _msg_type] =
3831 [ # # ]: 0 : pnode->m_transport->GetBytesToSend(/*have_next_message=*/true);
3832 [ # # # # ]: 0 : const bool queue_was_empty{to_send.empty() && pnode->vSendMsg.empty()};
3833 : :
3834 : : // Update memory usage of send buffer.
3835 : 0 : pnode->m_send_memusage += msg.GetMemoryUsage();
3836 [ # # ]: 0 : if (pnode->m_send_memusage + pnode->m_transport->GetSendMemoryUsage() > nSendBufferMaxSize) pnode->fPauseSend = true;
3837 : : // Move message to vSendMsg queue.
3838 [ # # ]: 0 : pnode->vSendMsg.push_back(std::move(msg));
3839 : :
3840 : : // If there was nothing to send before, and there is now (predicted by the "more" value
3841 : : // returned by the GetBytesToSend call above), attempt "optimistic write":
3842 : : // because the poll/select loop may pause for SELECT_TIMEOUT_MILLISECONDS before actually
3843 : : // doing a send, try sending from the calling thread if the queue was empty before.
3844 : : // With a V1Transport, more will always be true here, because adding a message always
3845 : : // results in sendable bytes there, but with V2Transport this is not the case (it may
3846 : : // still be in the handshake).
3847 [ # # # # ]: 0 : if (queue_was_empty && more) {
3848 [ # # ]: 0 : std::tie(nBytesSent, std::ignore) = SocketSendData(*pnode);
3849 : : }
3850 : 0 : }
3851 [ # # ]: 0 : if (nBytesSent) RecordBytesSent(nBytesSent);
3852 : 0 : }
3853 : :
3854 : 0 : bool CConnman::ForNode(NodeId id, std::function<bool(CNode* pnode)> func)
3855 : : {
3856 : 0 : CNode* found = nullptr;
3857 : 0 : LOCK(m_nodes_mutex);
3858 [ # # ]: 0 : for (auto&& pnode : m_nodes) {
3859 [ # # ]: 0 : if(pnode->GetId() == id) {
3860 : : found = pnode;
3861 : : break;
3862 : : }
3863 : : }
3864 [ # # # # : 0 : return found != nullptr && NodeFullyConnected(found) && func(found);
# # # # #
# # # ]
3865 : 0 : }
3866 : :
3867 : 0 : CSipHasher CConnman::GetDeterministicRandomizer(uint64_t id) const
3868 : : {
3869 : 0 : return CSipHasher(nSeed0, nSeed1).Write(id);
3870 : : }
3871 : :
3872 : 0 : uint64_t CConnman::CalculateKeyedNetGroup(const CAddress& address) const
3873 : : {
3874 : 0 : std::vector<unsigned char> vchNetGroup(m_netgroupman.GetGroup(address));
3875 : :
3876 [ # # # # : 0 : return GetDeterministicRandomizer(RANDOMIZER_ID_NETGROUP).Write(vchNetGroup).Finalize();
# # ]
3877 : 0 : }
3878 : :
3879 : 0 : void CConnman::PerformReconnections()
3880 : : {
3881 : 0 : AssertLockNotHeld(m_reconnections_mutex);
3882 : 0 : AssertLockNotHeld(m_unused_i2p_sessions_mutex);
3883 : 0 : while (true) {
3884 : : // Move first element of m_reconnections to todo (avoiding an allocation inside the lock).
3885 [ # # ]: 0 : decltype(m_reconnections) todo;
3886 : 0 : {
3887 [ # # ]: 0 : LOCK(m_reconnections_mutex);
3888 [ # # ]: 0 : if (m_reconnections.empty()) break;
3889 [ # # ]: 0 : todo.splice(todo.end(), m_reconnections, m_reconnections.begin());
3890 : 0 : }
3891 : :
3892 [ # # ]: 0 : auto& item = *todo.begin();
3893 : 0 : OpenNetworkConnection(item.addr_connect,
3894 : : // We only reconnect if the first attempt to connect succeeded at
3895 : : // connection time, but then failed after the CNode object was
3896 : : // created. Since we already know connecting is possible, do not
3897 : : // count failure to reconnect.
3898 : : /*fCountFailure=*/false,
3899 [ # # ]: 0 : std::move(item.grant),
3900 : 0 : item.destination.empty() ? nullptr : item.destination.c_str(),
3901 : : item.conn_type,
3902 [ # # ]: 0 : item.use_v2transport);
3903 : 0 : }
3904 : 0 : }
3905 : :
3906 : 0 : void CConnman::ASMapHealthCheck()
3907 : : {
3908 : 0 : const std::vector<CAddress> v4_addrs{GetAddresses(/*max_addresses=*/ 0, /*max_pct=*/ 0, Network::NET_IPV4, /*filtered=*/ false)};
3909 [ # # ]: 0 : const std::vector<CAddress> v6_addrs{GetAddresses(/*max_addresses=*/ 0, /*max_pct=*/ 0, Network::NET_IPV6, /*filtered=*/ false)};
3910 : 0 : std::vector<CNetAddr> clearnet_addrs;
3911 [ # # ]: 0 : clearnet_addrs.reserve(v4_addrs.size() + v6_addrs.size());
3912 [ # # ]: 0 : std::transform(v4_addrs.begin(), v4_addrs.end(), std::back_inserter(clearnet_addrs),
3913 [ # # ]: 0 : [](const CAddress& addr) { return static_cast<CNetAddr>(addr); });
3914 [ # # ]: 0 : std::transform(v6_addrs.begin(), v6_addrs.end(), std::back_inserter(clearnet_addrs),
3915 [ # # ]: 0 : [](const CAddress& addr) { return static_cast<CNetAddr>(addr); });
3916 [ # # ]: 0 : m_netgroupman.ASMapHealthCheck(clearnet_addrs);
3917 : 0 : }
3918 : :
3919 : : // Dump binary message to file, with timestamp.
3920 : 0 : static void CaptureMessageToFile(const CAddress& addr,
3921 : : const std::string& msg_type,
3922 : : Span<const unsigned char> data,
3923 : : bool is_incoming)
3924 : : {
3925 : : // Note: This function captures the message at the time of processing,
3926 : : // not at socket receive/send time.
3927 : : // This ensures that the messages are always in order from an application
3928 : : // layer (processing) perspective.
3929 : 0 : auto now = GetTime<std::chrono::microseconds>();
3930 : :
3931 : : // Windows folder names cannot include a colon
3932 : 0 : std::string clean_addr = addr.ToStringAddrPort();
3933 : 0 : std::replace(clean_addr.begin(), clean_addr.end(), ':', '_');
3934 : :
3935 [ # # # # : 0 : fs::path base_path = gArgs.GetDataDirNet() / "message_capture" / fs::u8path(clean_addr);
# # ]
3936 [ # # ]: 0 : fs::create_directories(base_path);
3937 : :
3938 [ # # # # ]: 0 : fs::path path = base_path / (is_incoming ? "msgs_recv.dat" : "msgs_sent.dat");
3939 [ # # # # ]: 0 : AutoFile f{fsbridge::fopen(path, "ab")};
3940 : :
3941 [ # # ]: 0 : ser_writedata64(f, now.count());
3942 [ # # ]: 0 : f << Span{msg_type};
3943 [ # # ]: 0 : for (auto i = msg_type.length(); i < CMessageHeader::MESSAGE_TYPE_SIZE; ++i) {
3944 [ # # ]: 0 : f << uint8_t{'\0'};
3945 : : }
3946 [ # # ]: 0 : uint32_t size = data.size();
3947 [ # # ]: 0 : ser_writedata32(f, size);
3948 [ # # ]: 0 : f << data;
3949 : 0 : }
3950 : :
3951 : : std::function<void(const CAddress& addr,
3952 : : const std::string& msg_type,
3953 : : Span<const unsigned char> data,
3954 : : bool is_incoming)>
3955 : : CaptureMessage = CaptureMessageToFile;
|
