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