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