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