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