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