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