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