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