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