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