addrman.cpp raw
1 // Copyright (c) 2012 Pieter Wuille
2 // Copyright (c) 2012-present The Bitcoin Core developers
3 // Distributed under the MIT software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
5
6 #include <bitcoin-build-config.h> // IWYU pragma: keep
7
8 #include <addrman.h>
9 #include <addrman_impl.h>
10
11 #include <hash.h>
12 #include <logging/timer.h>
13 #include <netaddress.h>
14 #include <netgroup.h>
15 #include <protocol.h>
16 #include <random.h>
17 #include <serialize.h>
18 #include <streams.h>
19 #include <tinyformat.h>
20 #include <uint256.h>
21 #include <util/check.h>
22 #include <util/log.h>
23 #include <util/time.h>
24
25 #include <cmath>
26 #include <optional>
27
28
29 int AddrInfo::GetTriedBucket(const uint256& nKey, const NetGroupManager& netgroupman) const
30 {
31 uint64_t hash1 = (HashWriter{} << nKey << GetKey()).GetCheapHash();
32 uint64_t hash2 = (HashWriter{} << nKey << netgroupman.GetGroup(*this) << (hash1 % ADDRMAN_TRIED_BUCKETS_PER_GROUP)).GetCheapHash();
33 return hash2 % ADDRMAN_TRIED_BUCKET_COUNT;
34 }
35
36 int AddrInfo::GetNewBucket(const uint256& nKey, const CNetAddr& src, const NetGroupManager& netgroupman) const
37 {
38 std::vector<unsigned char> vchSourceGroupKey = netgroupman.GetGroup(src);
39 uint64_t hash1 = (HashWriter{} << nKey << netgroupman.GetGroup(*this) << vchSourceGroupKey).GetCheapHash();
40 uint64_t hash2 = (HashWriter{} << nKey << vchSourceGroupKey << (hash1 % ADDRMAN_NEW_BUCKETS_PER_SOURCE_GROUP)).GetCheapHash();
41 return hash2 % ADDRMAN_NEW_BUCKET_COUNT;
42 }
43
44 int AddrInfo::GetBucketPosition(const uint256& nKey, bool fNew, int bucket) const
45 {
46 uint64_t hash1 = (HashWriter{} << nKey << (fNew ? uint8_t{'N'} : uint8_t{'K'}) << bucket << GetKey()).GetCheapHash();
47 return hash1 % ADDRMAN_BUCKET_SIZE;
48 }
49
50 bool AddrInfo::IsTerrible(NodeSeconds now) const
51 {
52 if (now - m_last_try <= 1min) { // never remove things tried in the last minute
53 return false;
54 }
55
56 if (nTime > now + 10min) { // came in a flying DeLorean
57 return true;
58 }
59
60 if (now - nTime > ADDRMAN_HORIZON) { // not seen in recent history
61 return true;
62 }
63
64 if (TicksSinceEpoch<std::chrono::seconds>(m_last_success) == 0 && nAttempts >= ADDRMAN_RETRIES) { // tried N times and never a success
65 return true;
66 }
67
68 if (now - m_last_success > ADDRMAN_MIN_FAIL && nAttempts >= ADDRMAN_MAX_FAILURES) { // N successive failures in the last week
69 return true;
70 }
71
72 return false;
73 }
74
75 double AddrInfo::GetChance(NodeSeconds now) const
76 {
77 double fChance = 1.0;
78
79 // deprioritize very recent attempts away
80 if (now - m_last_try < 10min) {
81 fChance *= 0.01;
82 }
83
84 // deprioritize 66% after each failed attempt, but at most 1/28th to avoid the search taking forever or overly penalizing outages.
85 fChance *= pow(0.66, std::min(nAttempts, 8));
86
87 return fChance;
88 }
89
90 AddrManImpl::AddrManImpl(const NetGroupManager& netgroupman, bool deterministic, int32_t consistency_check_ratio)
91 : insecure_rand{deterministic}
92 , nKey{deterministic ? uint256{1} : insecure_rand.rand256()}
93 , m_consistency_check_ratio{consistency_check_ratio}
94 , m_netgroupman{netgroupman}
95 {
96 for (auto& bucket : vvNew) {
97 for (auto& entry : bucket) {
98 entry = -1;
99 }
100 }
101 for (auto& bucket : vvTried) {
102 for (auto& entry : bucket) {
103 entry = -1;
104 }
105 }
106 }
107
108 AddrManImpl::~AddrManImpl()
109 {
110 nKey.SetNull();
111 }
112
113 template <typename Stream>
114 void AddrManImpl::Serialize(Stream& s_) const
115 {
116 LOCK(cs);
117
118 /**
119 * Serialized format.
120 * * format version byte (@see `Format`)
121 * * lowest compatible format version byte. This is used to help old software decide
122 * whether to parse the file. For example:
123 * * Bitcoin Core version N knows how to parse up to format=3. If a new format=4 is
124 * introduced in version N+1 that is compatible with format=3 and it is known that
125 * version N will be able to parse it, then version N+1 will write
126 * (format=4, lowest_compatible=3) in the first two bytes of the file, and so
127 * version N will still try to parse it.
128 * * Bitcoin Core version N+2 introduces a new incompatible format=5. It will write
129 * (format=5, lowest_compatible=5) and so any versions that do not know how to parse
130 * format=5 will not try to read the file.
131 * * nKey
132 * * nNew
133 * * nTried
134 * * number of "new" buckets XOR 2**30
135 * * all new addresses (total count: nNew)
136 * * all tried addresses (total count: nTried)
137 * * for each new bucket:
138 * * number of elements
139 * * for each element: index in the serialized "all new addresses"
140 * * asmap version
141 *
142 * 2**30 is xorred with the number of buckets to make addrman deserializer v0 detect it
143 * as incompatible. This is necessary because it did not check the version number on
144 * deserialization.
145 *
146 * vvNew, vvTried, mapInfo, mapAddr and vRandom are never encoded explicitly;
147 * they are instead reconstructed from the other information.
148 *
149 * This format is more complex, but significantly smaller (at most 1.5 MiB), and supports
150 * changes to the ADDRMAN_ parameters without breaking the on-disk structure.
151 *
152 * We don't use SERIALIZE_METHODS since the serialization and deserialization code has
153 * very little in common.
154 */
155
156 // Always serialize in the latest version (FILE_FORMAT).
157 ParamsStream s{s_, CAddress::V2_DISK};
158
159 s << static_cast<uint8_t>(FILE_FORMAT);
160
161 // Increment `lowest_compatible` iff a newly introduced format is incompatible with
162 // the previous one.
163 static constexpr uint8_t lowest_compatible = Format::V4_MULTIPORT;
164 s << static_cast<uint8_t>(INCOMPATIBILITY_BASE + lowest_compatible);
165
166 s << nKey;
167 s << nNew;
168 s << nTried;
169
170 int nUBuckets = ADDRMAN_NEW_BUCKET_COUNT ^ (1 << 30);
171 s << nUBuckets;
172 std::unordered_map<nid_type, int> mapUnkIds;
173 int nIds = 0;
174 for (const auto& entry : mapInfo) {
175 mapUnkIds[entry.first] = nIds;
176 const AddrInfo& info = entry.second;
177 if (info.nRefCount) {
178 assert(nIds != nNew); // this means nNew was wrong, oh ow
179 s << info;
180 nIds++;
181 }
182 }
183 nIds = 0;
184 for (const auto& entry : mapInfo) {
185 const AddrInfo& info = entry.second;
186 if (info.fInTried) {
187 assert(nIds != nTried); // this means nTried was wrong, oh ow
188 s << info;
189 nIds++;
190 }
191 }
192 for (int bucket = 0; bucket < ADDRMAN_NEW_BUCKET_COUNT; bucket++) {
193 int nSize = 0;
194 for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
195 if (vvNew[bucket][i] != -1)
196 nSize++;
197 }
198 s << nSize;
199 for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
200 if (vvNew[bucket][i] != -1) {
201 int nIndex = mapUnkIds[vvNew[bucket][i]];
202 s << nIndex;
203 }
204 }
205 }
206 // Store asmap version after bucket entries so that it
207 // can be ignored by older clients for backward compatibility.
208 s << m_netgroupman.GetAsmapVersion();
209 }
210
211 template <typename Stream>
212 void AddrManImpl::Unserialize(Stream& s_)
213 {
214 LOCK(cs);
215
216 assert(vRandom.empty());
217
218 Format format;
219 s_ >> Using<CustomUintFormatter<1>>(format);
220
221 const auto ser_params = (format >= Format::V3_BIP155 ? CAddress::V2_DISK : CAddress::V1_DISK);
222 ParamsStream s{s_, ser_params};
223
224 uint8_t compat;
225 s >> compat;
226 if (compat < INCOMPATIBILITY_BASE) {
227 throw std::ios_base::failure(strprintf(
228 "Corrupted addrman database: The compat value (%u) "
229 "is lower than the expected minimum value %u.",
230 compat, INCOMPATIBILITY_BASE));
231 }
232 const uint8_t lowest_compatible = compat - INCOMPATIBILITY_BASE;
233 if (lowest_compatible > FILE_FORMAT) {
234 throw InvalidAddrManVersionError(strprintf(
235 "Unsupported format of addrman database: %u. It is compatible with formats >=%u, "
236 "but the maximum supported by this version of %s is %u.",
237 uint8_t{format}, lowest_compatible, CLIENT_NAME, uint8_t{FILE_FORMAT}));
238 }
239
240 s >> nKey;
241 s >> nNew;
242 s >> nTried;
243 int nUBuckets = 0;
244 s >> nUBuckets;
245 if (format >= Format::V1_DETERMINISTIC) {
246 nUBuckets ^= (1 << 30);
247 }
248
249 if (nNew > ADDRMAN_NEW_BUCKET_COUNT * ADDRMAN_BUCKET_SIZE || nNew < 0) {
250 throw std::ios_base::failure(
251 strprintf("Corrupt AddrMan serialization: nNew=%d, should be in [0, %d]",
252 nNew,
253 ADDRMAN_NEW_BUCKET_COUNT * ADDRMAN_BUCKET_SIZE));
254 }
255
256 if (nTried > ADDRMAN_TRIED_BUCKET_COUNT * ADDRMAN_BUCKET_SIZE || nTried < 0) {
257 throw std::ios_base::failure(
258 strprintf("Corrupt AddrMan serialization: nTried=%d, should be in [0, %d]",
259 nTried,
260 ADDRMAN_TRIED_BUCKET_COUNT * ADDRMAN_BUCKET_SIZE));
261 }
262
263 // Deserialize entries from the new table.
264 for (int n = 0; n < nNew; n++) {
265 AddrInfo& info = mapInfo[n];
266 s >> info;
267 mapAddr[info] = n;
268 info.nRandomPos = vRandom.size();
269 vRandom.push_back(n);
270 m_network_counts[info.GetNetwork()].n_new++;
271 }
272 nIdCount = nNew;
273
274 // Deserialize entries from the tried table.
275 int nLost = 0;
276 for (int n = 0; n < nTried; n++) {
277 AddrInfo info;
278 s >> info;
279 int nKBucket = info.GetTriedBucket(nKey, m_netgroupman);
280 int nKBucketPos = info.GetBucketPosition(nKey, false, nKBucket);
281 if (info.IsValid()
282 && vvTried[nKBucket][nKBucketPos] == -1) {
283 info.nRandomPos = vRandom.size();
284 info.fInTried = true;
285 vRandom.push_back(nIdCount);
286 mapInfo[nIdCount] = info;
287 mapAddr[info] = nIdCount;
288 vvTried[nKBucket][nKBucketPos] = nIdCount;
289 nIdCount++;
290 m_network_counts[info.GetNetwork()].n_tried++;
291 } else {
292 nLost++;
293 }
294 }
295 nTried -= nLost;
296
297 // Store positions in the new table buckets to apply later (if possible).
298 // An entry may appear in up to ADDRMAN_NEW_BUCKETS_PER_ADDRESS buckets,
299 // so we store all bucket-entry_index pairs to iterate through later.
300 std::vector<std::pair<int, int>> bucket_entries;
301
302 for (int bucket = 0; bucket < nUBuckets; ++bucket) {
303 int num_entries{0};
304 s >> num_entries;
305 for (int n = 0; n < num_entries; ++n) {
306 int entry_index{0};
307 s >> entry_index;
308 if (entry_index >= 0 && entry_index < nNew) {
309 bucket_entries.emplace_back(bucket, entry_index);
310 }
311 }
312 }
313
314 // If the bucket count and asmap version haven't changed, then attempt
315 // to restore the entries to the buckets/positions they were in before
316 // serialization.
317 uint256 supplied_asmap_version{m_netgroupman.GetAsmapVersion()};
318 uint256 serialized_asmap_version;
319 if (format >= Format::V2_ASMAP) {
320 s >> serialized_asmap_version;
321 }
322 const bool restore_bucketing{nUBuckets == ADDRMAN_NEW_BUCKET_COUNT &&
323 serialized_asmap_version == supplied_asmap_version};
324
325 if (!restore_bucketing) {
326 LogDebug(BCLog::ADDRMAN, "Bucketing method was updated, re-bucketing addrman entries from disk\n");
327 }
328
329 for (auto bucket_entry : bucket_entries) {
330 int bucket{bucket_entry.first};
331 const int entry_index{bucket_entry.second};
332 AddrInfo& info = mapInfo[entry_index];
333
334 // Don't store the entry in the new bucket if it's not a valid address for our addrman
335 if (!info.IsValid()) continue;
336
337 // The entry shouldn't appear in more than
338 // ADDRMAN_NEW_BUCKETS_PER_ADDRESS. If it has already, just skip
339 // this bucket_entry.
340 if (info.nRefCount >= ADDRMAN_NEW_BUCKETS_PER_ADDRESS) continue;
341
342 int bucket_position = info.GetBucketPosition(nKey, true, bucket);
343 if (restore_bucketing && vvNew[bucket][bucket_position] == -1) {
344 // Bucketing has not changed, using existing bucket positions for the new table
345 vvNew[bucket][bucket_position] = entry_index;
346 ++info.nRefCount;
347 } else {
348 // In case the new table data cannot be used (bucket count wrong or new asmap),
349 // try to give them a reference based on their primary source address.
350 bucket = info.GetNewBucket(nKey, m_netgroupman);
351 bucket_position = info.GetBucketPosition(nKey, true, bucket);
352 if (vvNew[bucket][bucket_position] == -1) {
353 vvNew[bucket][bucket_position] = entry_index;
354 ++info.nRefCount;
355 }
356 }
357 }
358
359 // Prune new entries with refcount 0 (as a result of collisions or invalid address).
360 int nLostUnk = 0;
361 for (auto it = mapInfo.cbegin(); it != mapInfo.cend(); ) {
362 if (it->second.fInTried == false && it->second.nRefCount == 0) {
363 const auto itCopy = it++;
364 Delete(itCopy->first);
365 ++nLostUnk;
366 } else {
367 ++it;
368 }
369 }
370 if (nLost + nLostUnk > 0) {
371 LogDebug(BCLog::ADDRMAN, "addrman lost %i new and %i tried addresses due to collisions or invalid addresses\n", nLostUnk, nLost);
372 }
373
374 const int check_code{CheckAddrman()};
375 if (check_code != 0) {
376 throw std::ios_base::failure(strprintf(
377 "Corrupt data. Consistency check failed with code %s",
378 check_code));
379 }
380 }
381
382 AddrInfo* AddrManImpl::Find(const CService& addr, nid_type* pnId)
383 {
384 AssertLockHeld(cs);
385
386 const auto it = mapAddr.find(addr);
387 if (it == mapAddr.end())
388 return nullptr;
389 if (pnId)
390 *pnId = (*it).second;
391 const auto it2 = mapInfo.find((*it).second);
392 if (it2 != mapInfo.end())
393 return &(*it2).second;
394 return nullptr;
395 }
396
397 AddrInfo* AddrManImpl::Create(const CAddress& addr, const CNetAddr& addrSource, nid_type* pnId)
398 {
399 AssertLockHeld(cs);
400
401 nid_type nId = nIdCount++;
402 mapInfo[nId] = AddrInfo(addr, addrSource);
403 mapAddr[addr] = nId;
404 mapInfo[nId].nRandomPos = vRandom.size();
405 vRandom.push_back(nId);
406 nNew++;
407 m_network_counts[addr.GetNetwork()].n_new++;
408 if (pnId)
409 *pnId = nId;
410 return &mapInfo[nId];
411 }
412
413 void AddrManImpl::SwapRandom(unsigned int nRndPos1, unsigned int nRndPos2) const
414 {
415 AssertLockHeld(cs);
416
417 if (nRndPos1 == nRndPos2)
418 return;
419
420 assert(nRndPos1 < vRandom.size() && nRndPos2 < vRandom.size());
421
422 nid_type nId1 = vRandom[nRndPos1];
423 nid_type nId2 = vRandom[nRndPos2];
424
425 const auto it_1{mapInfo.find(nId1)};
426 const auto it_2{mapInfo.find(nId2)};
427 assert(it_1 != mapInfo.end());
428 assert(it_2 != mapInfo.end());
429
430 it_1->second.nRandomPos = nRndPos2;
431 it_2->second.nRandomPos = nRndPos1;
432
433 vRandom[nRndPos1] = nId2;
434 vRandom[nRndPos2] = nId1;
435 }
436
437 void AddrManImpl::Delete(nid_type nId)
438 {
439 AssertLockHeld(cs);
440
441 assert(mapInfo.contains(nId));
442 AddrInfo& info = mapInfo[nId];
443 assert(!info.fInTried);
444 assert(info.nRefCount == 0);
445
446 SwapRandom(info.nRandomPos, vRandom.size() - 1);
447 m_network_counts[info.GetNetwork()].n_new--;
448 vRandom.pop_back();
449 mapAddr.erase(info);
450 mapInfo.erase(nId);
451 nNew--;
452 }
453
454 void AddrManImpl::ClearNew(int nUBucket, int nUBucketPos)
455 {
456 AssertLockHeld(cs);
457
458 // if there is an entry in the specified bucket, delete it.
459 if (vvNew[nUBucket][nUBucketPos] != -1) {
460 nid_type nIdDelete = vvNew[nUBucket][nUBucketPos];
461 AddrInfo& infoDelete = mapInfo[nIdDelete];
462 assert(infoDelete.nRefCount > 0);
463 infoDelete.nRefCount--;
464 vvNew[nUBucket][nUBucketPos] = -1;
465 LogDebug(BCLog::ADDRMAN, "Removed %s from new[%i][%i]\n", infoDelete.ToStringAddrPort(), nUBucket, nUBucketPos);
466 if (infoDelete.nRefCount == 0) {
467 Delete(nIdDelete);
468 }
469 }
470 }
471
472 void AddrManImpl::MakeTried(AddrInfo& info, nid_type nId)
473 {
474 AssertLockHeld(cs);
475
476 // remove the entry from all new buckets
477 const int start_bucket{info.GetNewBucket(nKey, m_netgroupman)};
478 for (int n = 0; n < ADDRMAN_NEW_BUCKET_COUNT; ++n) {
479 const int bucket{(start_bucket + n) % ADDRMAN_NEW_BUCKET_COUNT};
480 const int pos{info.GetBucketPosition(nKey, true, bucket)};
481 if (vvNew[bucket][pos] == nId) {
482 vvNew[bucket][pos] = -1;
483 info.nRefCount--;
484 if (info.nRefCount == 0) break;
485 }
486 }
487 nNew--;
488 m_network_counts[info.GetNetwork()].n_new--;
489
490 assert(info.nRefCount == 0);
491
492 // which tried bucket to move the entry to
493 int nKBucket = info.GetTriedBucket(nKey, m_netgroupman);
494 int nKBucketPos = info.GetBucketPosition(nKey, false, nKBucket);
495
496 // first make space to add it (the existing tried entry there is moved to new, deleting whatever is there).
497 if (vvTried[nKBucket][nKBucketPos] != -1) {
498 // find an item to evict
499 nid_type nIdEvict = vvTried[nKBucket][nKBucketPos];
500 assert(mapInfo.contains(nIdEvict));
501 AddrInfo& infoOld = mapInfo[nIdEvict];
502
503 // Remove the to-be-evicted item from the tried set.
504 infoOld.fInTried = false;
505 vvTried[nKBucket][nKBucketPos] = -1;
506 nTried--;
507 m_network_counts[infoOld.GetNetwork()].n_tried--;
508
509 // find which new bucket it belongs to
510 int nUBucket = infoOld.GetNewBucket(nKey, m_netgroupman);
511 int nUBucketPos = infoOld.GetBucketPosition(nKey, true, nUBucket);
512 ClearNew(nUBucket, nUBucketPos);
513 assert(vvNew[nUBucket][nUBucketPos] == -1);
514
515 // Enter it into the new set again.
516 infoOld.nRefCount = 1;
517 vvNew[nUBucket][nUBucketPos] = nIdEvict;
518 nNew++;
519 m_network_counts[infoOld.GetNetwork()].n_new++;
520 LogDebug(BCLog::ADDRMAN, "Moved %s from tried[%i][%i] to new[%i][%i] to make space\n",
521 infoOld.ToStringAddrPort(), nKBucket, nKBucketPos, nUBucket, nUBucketPos);
522 }
523 assert(vvTried[nKBucket][nKBucketPos] == -1);
524
525 vvTried[nKBucket][nKBucketPos] = nId;
526 nTried++;
527 info.fInTried = true;
528 m_network_counts[info.GetNetwork()].n_tried++;
529 }
530
531 bool AddrManImpl::AddSingle(const CAddress& addr, const CNetAddr& source, std::chrono::seconds time_penalty)
532 {
533 AssertLockHeld(cs);
534
535 if (!addr.IsRoutable())
536 return false;
537
538 nid_type nId;
539 AddrInfo* pinfo = Find(addr, &nId);
540
541 // Do not set a penalty for a source's self-announcement
542 if (addr == source) {
543 time_penalty = 0s;
544 }
545
546 if (pinfo) {
547 // periodically update nTime
548 const bool currently_online{NodeClock::now() - addr.nTime < 24h};
549 const auto update_interval{currently_online ? 1h : 24h};
550 if (pinfo->nTime < addr.nTime - update_interval - time_penalty) {
551 pinfo->nTime = std::max(NodeSeconds{0s}, addr.nTime - time_penalty);
552 }
553
554 // add services
555 pinfo->nServices = ServiceFlags(pinfo->nServices | addr.nServices);
556
557 // do not update if no new information is present
558 if (addr.nTime <= pinfo->nTime) {
559 return false;
560 }
561
562 // do not update if the entry was already in the "tried" table
563 if (pinfo->fInTried)
564 return false;
565
566 // do not update if the max reference count is reached
567 if (pinfo->nRefCount == ADDRMAN_NEW_BUCKETS_PER_ADDRESS)
568 return false;
569
570 // stochastic test: previous nRefCount == N: 2^N times harder to increase it
571 if (pinfo->nRefCount > 0) {
572 const int nFactor{1 << pinfo->nRefCount};
573 if (insecure_rand.randrange(nFactor) != 0) return false;
574 }
575 } else {
576 pinfo = Create(addr, source, &nId);
577 pinfo->nTime = std::max(NodeSeconds{0s}, pinfo->nTime - time_penalty);
578 }
579
580 int nUBucket = pinfo->GetNewBucket(nKey, source, m_netgroupman);
581 int nUBucketPos = pinfo->GetBucketPosition(nKey, true, nUBucket);
582 bool fInsert = vvNew[nUBucket][nUBucketPos] == -1;
583 if (vvNew[nUBucket][nUBucketPos] != nId) {
584 if (!fInsert) {
585 AddrInfo& infoExisting = mapInfo[vvNew[nUBucket][nUBucketPos]];
586 if (infoExisting.IsTerrible() || (infoExisting.nRefCount > 1 && pinfo->nRefCount == 0)) {
587 // Overwrite the existing new table entry.
588 fInsert = true;
589 }
590 }
591 if (fInsert) {
592 ClearNew(nUBucket, nUBucketPos);
593 pinfo->nRefCount++;
594 vvNew[nUBucket][nUBucketPos] = nId;
595 const auto mapped_as{m_netgroupman.GetMappedAS(addr)};
596 LogDebug(BCLog::ADDRMAN, "Added %s%s to new[%i][%i]\n",
597 addr.ToStringAddrPort(), (mapped_as ? strprintf(" mapped to AS%i", mapped_as) : ""), nUBucket, nUBucketPos);
598 } else {
599 if (pinfo->nRefCount == 0) {
600 Delete(nId);
601 }
602 }
603 }
604 return fInsert;
605 }
606
607 bool AddrManImpl::Good_(const CService& addr, bool test_before_evict, NodeSeconds time)
608 {
609 AssertLockHeld(cs);
610
611 nid_type nId;
612
613 m_last_good = time;
614
615 AddrInfo* pinfo = Find(addr, &nId);
616
617 // if not found, bail out
618 if (!pinfo) return false;
619
620 AddrInfo& info = *pinfo;
621
622 // update info
623 info.m_last_success = time;
624 info.m_last_try = time;
625 info.nAttempts = 0;
626 // nTime is not updated here, to avoid leaking information about
627 // currently-connected peers.
628
629 // if it is already in the tried set, don't do anything else
630 if (info.fInTried) return false;
631
632 // if it is not in new, something bad happened
633 if (!Assume(info.nRefCount > 0)) return false;
634
635
636 // which tried bucket to move the entry to
637 int tried_bucket = info.GetTriedBucket(nKey, m_netgroupman);
638 int tried_bucket_pos = info.GetBucketPosition(nKey, false, tried_bucket);
639
640 // Will moving this address into tried evict another entry?
641 if (test_before_evict && (vvTried[tried_bucket][tried_bucket_pos] != -1)) {
642 if (m_tried_collisions.size() < ADDRMAN_SET_TRIED_COLLISION_SIZE) {
643 m_tried_collisions.insert(nId);
644 }
645 // Output the entry we'd be colliding with, for debugging purposes
646 auto colliding_entry = mapInfo.find(vvTried[tried_bucket][tried_bucket_pos]);
647 LogDebug(BCLog::ADDRMAN, "Collision with %s while attempting to move %s to tried table. Collisions=%d",
648 colliding_entry != mapInfo.end() ? colliding_entry->second.ToStringAddrPort() : "<unknown-addr>",
649 addr.ToStringAddrPort(),
650 m_tried_collisions.size());
651 return false;
652 } else {
653 // move nId to the tried tables
654 MakeTried(info, nId);
655 const auto mapped_as{m_netgroupman.GetMappedAS(addr)};
656 LogDebug(BCLog::ADDRMAN, "Moved %s%s to tried[%i][%i]\n",
657 addr.ToStringAddrPort(), (mapped_as ? strprintf(" mapped to AS%i", mapped_as) : ""), tried_bucket, tried_bucket_pos);
658 return true;
659 }
660 }
661
662 bool AddrManImpl::Add_(const std::vector<CAddress>& vAddr, const CNetAddr& source, std::chrono::seconds time_penalty)
663 {
664 int added{0};
665 for (std::vector<CAddress>::const_iterator it = vAddr.begin(); it != vAddr.end(); it++) {
666 added += AddSingle(*it, source, time_penalty) ? 1 : 0;
667 }
668 if (added > 0) {
669 LogDebug(BCLog::ADDRMAN, "Added %i addresses (of %i) from %s: %i tried, %i new\n", added, vAddr.size(), source.ToStringAddr(), nTried, nNew);
670 }
671 return added > 0;
672 }
673
674 void AddrManImpl::Attempt_(const CService& addr, bool fCountFailure, NodeSeconds time)
675 {
676 AssertLockHeld(cs);
677
678 AddrInfo* pinfo = Find(addr);
679
680 // if not found, bail out
681 if (!pinfo)
682 return;
683
684 AddrInfo& info = *pinfo;
685
686 // update info
687 info.m_last_try = time;
688 if (fCountFailure && info.m_last_count_attempt < m_last_good) {
689 info.m_last_count_attempt = time;
690 info.nAttempts++;
691 }
692 }
693
694 std::pair<CAddress, NodeSeconds> AddrManImpl::Select_(bool new_only, const std::unordered_set<Network>& networks) const
695 {
696 AssertLockHeld(cs);
697
698 if (vRandom.empty()) return {};
699
700 size_t new_count = nNew;
701 size_t tried_count = nTried;
702
703 if (!networks.empty()) {
704 new_count = 0;
705 tried_count = 0;
706 for (auto& network : networks) {
707 auto it = m_network_counts.find(network);
708 if (it == m_network_counts.end()) {
709 continue;
710 }
711 auto counts = it->second;
712 new_count += counts.n_new;
713 tried_count += counts.n_tried;
714 }
715 }
716
717 if (new_only && new_count == 0) return {};
718 if (new_count + tried_count == 0) return {};
719
720 // Decide if we are going to search the new or tried table
721 // If either option is viable, use a 50% chance to choose
722 bool search_tried;
723 if (new_only || tried_count == 0) {
724 search_tried = false;
725 } else if (new_count == 0) {
726 search_tried = true;
727 } else {
728 search_tried = insecure_rand.randbool();
729 }
730
731 const int bucket_count{search_tried ? ADDRMAN_TRIED_BUCKET_COUNT : ADDRMAN_NEW_BUCKET_COUNT};
732
733 // Loop through the addrman table until we find an appropriate entry
734 double chance_factor = 1.0;
735 while (1) {
736 // Pick a bucket, and an initial position in that bucket.
737 int bucket = insecure_rand.randrange(bucket_count);
738 int initial_position = insecure_rand.randrange(ADDRMAN_BUCKET_SIZE);
739
740 // Iterate over the positions of that bucket, starting at the initial one,
741 // and looping around.
742 int i, position;
743 nid_type node_id;
744 for (i = 0; i < ADDRMAN_BUCKET_SIZE; ++i) {
745 position = (initial_position + i) % ADDRMAN_BUCKET_SIZE;
746 node_id = GetEntry(search_tried, bucket, position);
747 if (node_id != -1) {
748 if (!networks.empty()) {
749 const auto it{mapInfo.find(node_id)};
750 if (Assume(it != mapInfo.end()) && networks.contains(it->second.GetNetwork())) break;
751 } else {
752 break;
753 }
754 }
755 }
756
757 // If the bucket is entirely empty, start over with a (likely) different one.
758 if (i == ADDRMAN_BUCKET_SIZE) continue;
759
760 // Find the entry to return.
761 const auto it_found{mapInfo.find(node_id)};
762 assert(it_found != mapInfo.end());
763 const AddrInfo& info{it_found->second};
764
765 // With probability GetChance() * chance_factor, return the entry.
766 if (insecure_rand.randbits<30>() < chance_factor * info.GetChance() * (1 << 30)) {
767 LogDebug(BCLog::ADDRMAN, "Selected %s from %s\n", info.ToStringAddrPort(), search_tried ? "tried" : "new");
768 return {info, info.m_last_try};
769 }
770
771 // Otherwise start over with a (likely) different bucket, and increased chance factor.
772 chance_factor *= 1.2;
773 }
774 }
775
776 nid_type AddrManImpl::GetEntry(bool use_tried, size_t bucket, size_t position) const
777 {
778 AssertLockHeld(cs);
779
780 if (use_tried) {
781 if (Assume(position < ADDRMAN_BUCKET_SIZE) && Assume(bucket < ADDRMAN_TRIED_BUCKET_COUNT)) {
782 return vvTried[bucket][position];
783 }
784 } else {
785 if (Assume(position < ADDRMAN_BUCKET_SIZE) && Assume(bucket < ADDRMAN_NEW_BUCKET_COUNT)) {
786 return vvNew[bucket][position];
787 }
788 }
789
790 return -1;
791 }
792
793 std::vector<CAddress> AddrManImpl::GetAddr_(size_t max_addresses, size_t max_pct, std::optional<Network> network, const bool filtered) const
794 {
795 AssertLockHeld(cs);
796 Assume(max_pct <= 100);
797
798 size_t nNodes = vRandom.size();
799 if (max_pct != 0) {
800 max_pct = std::min(max_pct, size_t{100});
801 nNodes = max_pct * nNodes / 100;
802 }
803 if (max_addresses != 0) {
804 nNodes = std::min(nNodes, max_addresses);
805 }
806
807 // gather a list of random nodes, skipping those of low quality
808 const auto now{Now<NodeSeconds>()};
809 std::vector<CAddress> addresses;
810 addresses.reserve(nNodes);
811 for (unsigned int n = 0; n < vRandom.size(); n++) {
812 if (addresses.size() >= nNodes)
813 break;
814
815 int nRndPos = insecure_rand.randrange(vRandom.size() - n) + n;
816 SwapRandom(n, nRndPos);
817 const auto it{mapInfo.find(vRandom[n])};
818 assert(it != mapInfo.end());
819
820 const AddrInfo& ai{it->second};
821
822 // Filter by network (optional)
823 if (network != std::nullopt && ai.GetNetClass() != network) continue;
824
825 // Filter for quality
826 if (ai.IsTerrible(now) && filtered) continue;
827
828 addresses.push_back(ai);
829 }
830 LogDebug(BCLog::ADDRMAN, "GetAddr returned %d random addresses\n", addresses.size());
831 return addresses;
832 }
833
834 std::vector<std::pair<AddrInfo, AddressPosition>> AddrManImpl::GetEntries_(bool from_tried) const
835 {
836 AssertLockHeld(cs);
837
838 const int bucket_count = from_tried ? ADDRMAN_TRIED_BUCKET_COUNT : ADDRMAN_NEW_BUCKET_COUNT;
839 std::vector<std::pair<AddrInfo, AddressPosition>> infos;
840 for (int bucket = 0; bucket < bucket_count; ++bucket) {
841 for (int position = 0; position < ADDRMAN_BUCKET_SIZE; ++position) {
842 nid_type id = GetEntry(from_tried, bucket, position);
843 if (id >= 0) {
844 AddrInfo info = mapInfo.at(id);
845 AddressPosition location = AddressPosition(
846 from_tried,
847 /*multiplicity_in=*/from_tried ? 1 : info.nRefCount,
848 bucket,
849 position);
850 infos.emplace_back(info, location);
851 }
852 }
853 }
854
855 return infos;
856 }
857
858 void AddrManImpl::Connected_(const CService& addr, NodeSeconds time)
859 {
860 AssertLockHeld(cs);
861
862 AddrInfo* pinfo = Find(addr);
863
864 // if not found, bail out
865 if (!pinfo)
866 return;
867
868 AddrInfo& info = *pinfo;
869
870 // update info
871 const auto update_interval{20min};
872 if (time - info.nTime > update_interval) {
873 info.nTime = time;
874 }
875 }
876
877 void AddrManImpl::SetServices_(const CService& addr, ServiceFlags nServices)
878 {
879 AssertLockHeld(cs);
880
881 AddrInfo* pinfo = Find(addr);
882
883 // if not found, bail out
884 if (!pinfo)
885 return;
886
887 AddrInfo& info = *pinfo;
888
889 // update info
890 info.nServices = nServices;
891 }
892
893 void AddrManImpl::ResolveCollisions_()
894 {
895 AssertLockHeld(cs);
896
897 for (std::set<nid_type>::iterator it = m_tried_collisions.begin(); it != m_tried_collisions.end();) {
898 nid_type id_new = *it;
899
900 bool erase_collision = false;
901
902 // If id_new not found in mapInfo remove it from m_tried_collisions
903 if (!mapInfo.contains(id_new)) {
904 erase_collision = true;
905 } else {
906 AddrInfo& info_new = mapInfo[id_new];
907
908 // Which tried bucket to move the entry to.
909 int tried_bucket = info_new.GetTriedBucket(nKey, m_netgroupman);
910 int tried_bucket_pos = info_new.GetBucketPosition(nKey, false, tried_bucket);
911 if (!info_new.IsValid()) { // id_new may no longer map to a valid address
912 erase_collision = true;
913 } else if (vvTried[tried_bucket][tried_bucket_pos] != -1) { // The position in the tried bucket is not empty
914
915 // Get the to-be-evicted address that is being tested
916 nid_type id_old = vvTried[tried_bucket][tried_bucket_pos];
917 AddrInfo& info_old = mapInfo[id_old];
918
919 const auto current_time{Now<NodeSeconds>()};
920
921 // Has successfully connected in last X hours
922 if (current_time - info_old.m_last_success < ADDRMAN_REPLACEMENT) {
923 erase_collision = true;
924 } else if (current_time - info_old.m_last_try < ADDRMAN_REPLACEMENT) { // attempted to connect and failed in last X hours
925
926 // Give address at least 60 seconds to successfully connect
927 if (current_time - info_old.m_last_try > 60s) {
928 LogDebug(BCLog::ADDRMAN, "Replacing %s with %s in tried table\n", info_old.ToStringAddrPort(), info_new.ToStringAddrPort());
929
930 // Replaces an existing address already in the tried table with the new address
931 Good_(info_new, false, current_time);
932 erase_collision = true;
933 }
934 } else if (current_time - info_new.m_last_success > ADDRMAN_TEST_WINDOW) {
935 // If the collision hasn't resolved in some reasonable amount of time,
936 // just evict the old entry -- we must not be able to
937 // connect to it for some reason.
938 LogDebug(BCLog::ADDRMAN, "Unable to test; replacing %s with %s in tried table anyway\n", info_old.ToStringAddrPort(), info_new.ToStringAddrPort());
939 Good_(info_new, false, current_time);
940 erase_collision = true;
941 }
942 } else { // Collision is not actually a collision anymore
943 Good_(info_new, false, Now<NodeSeconds>());
944 erase_collision = true;
945 }
946 }
947
948 if (erase_collision) {
949 m_tried_collisions.erase(it++);
950 } else {
951 it++;
952 }
953 }
954 }
955
956 std::pair<CAddress, NodeSeconds> AddrManImpl::SelectTriedCollision_()
957 {
958 AssertLockHeld(cs);
959
960 if (m_tried_collisions.size() == 0) return {};
961
962 std::set<nid_type>::iterator it = m_tried_collisions.begin();
963
964 // Selects a random element from m_tried_collisions
965 std::advance(it, insecure_rand.randrange(m_tried_collisions.size()));
966 nid_type id_new = *it;
967
968 // If id_new not found in mapInfo remove it from m_tried_collisions
969 if (!mapInfo.contains(id_new)) {
970 m_tried_collisions.erase(it);
971 return {};
972 }
973
974 const AddrInfo& newInfo = mapInfo[id_new];
975
976 // which tried bucket to move the entry to
977 int tried_bucket = newInfo.GetTriedBucket(nKey, m_netgroupman);
978 int tried_bucket_pos = newInfo.GetBucketPosition(nKey, false, tried_bucket);
979
980 const AddrInfo& info_old = mapInfo[vvTried[tried_bucket][tried_bucket_pos]];
981 return {info_old, info_old.m_last_try};
982 }
983
984 std::optional<AddressPosition> AddrManImpl::FindAddressEntry_(const CAddress& addr)
985 {
986 AssertLockHeld(cs);
987
988 AddrInfo* addr_info = Find(addr);
989
990 if (!addr_info) return std::nullopt;
991
992 if(addr_info->fInTried) {
993 int bucket{addr_info->GetTriedBucket(nKey, m_netgroupman)};
994 return AddressPosition(/*tried_in=*/true,
995 /*multiplicity_in=*/1,
996 /*bucket_in=*/bucket,
997 /*position_in=*/addr_info->GetBucketPosition(nKey, false, bucket));
998 } else {
999 int bucket{addr_info->GetNewBucket(nKey, m_netgroupman)};
1000 return AddressPosition(/*tried_in=*/false,
1001 /*multiplicity_in=*/addr_info->nRefCount,
1002 /*bucket_in=*/bucket,
1003 /*position_in=*/addr_info->GetBucketPosition(nKey, true, bucket));
1004 }
1005 }
1006
1007 size_t AddrManImpl::Size_(std::optional<Network> net, std::optional<bool> in_new) const
1008 {
1009 AssertLockHeld(cs);
1010
1011 if (!net.has_value()) {
1012 if (in_new.has_value()) {
1013 return *in_new ? nNew : nTried;
1014 } else {
1015 return vRandom.size();
1016 }
1017 }
1018 if (auto it = m_network_counts.find(*net); it != m_network_counts.end()) {
1019 auto net_count = it->second;
1020 if (in_new.has_value()) {
1021 return *in_new ? net_count.n_new : net_count.n_tried;
1022 } else {
1023 return net_count.n_new + net_count.n_tried;
1024 }
1025 }
1026 return 0;
1027 }
1028
1029 void AddrManImpl::Check() const
1030 {
1031 AssertLockHeld(cs);
1032
1033 // Run consistency checks 1 in m_consistency_check_ratio times if enabled
1034 if (m_consistency_check_ratio == 0) return;
1035 if (insecure_rand.randrange(m_consistency_check_ratio) >= 1) return;
1036
1037 const int err{CheckAddrman()};
1038 if (err) {
1039 LogError("ADDRMAN CONSISTENCY CHECK FAILED!!! err=%i", err);
1040 assert(false);
1041 }
1042 }
1043
1044 int AddrManImpl::CheckAddrman() const
1045 {
1046 AssertLockHeld(cs);
1047
1048 LOG_TIME_MILLIS_WITH_CATEGORY_MSG_ONCE(
1049 strprintf("new %i, tried %i, total %u", nNew, nTried, vRandom.size()), BCLog::ADDRMAN);
1050
1051 std::unordered_set<nid_type> setTried;
1052 std::unordered_map<nid_type, int> mapNew;
1053 std::unordered_map<Network, NewTriedCount> local_counts;
1054
1055 if (vRandom.size() != (size_t)(nTried + nNew))
1056 return -7;
1057
1058 for (const auto& entry : mapInfo) {
1059 nid_type n = entry.first;
1060 const AddrInfo& info = entry.second;
1061 if (info.fInTried) {
1062 if (!TicksSinceEpoch<std::chrono::seconds>(info.m_last_success)) {
1063 return -1;
1064 }
1065 if (info.nRefCount)
1066 return -2;
1067 setTried.insert(n);
1068 local_counts[info.GetNetwork()].n_tried++;
1069 } else {
1070 if (info.nRefCount < 0 || info.nRefCount > ADDRMAN_NEW_BUCKETS_PER_ADDRESS)
1071 return -3;
1072 if (!info.nRefCount)
1073 return -4;
1074 mapNew[n] = info.nRefCount;
1075 local_counts[info.GetNetwork()].n_new++;
1076 }
1077 const auto it{mapAddr.find(info)};
1078 if (it == mapAddr.end() || it->second != n) {
1079 return -5;
1080 }
1081 if (info.nRandomPos < 0 || (size_t)info.nRandomPos >= vRandom.size() || vRandom[info.nRandomPos] != n)
1082 return -14;
1083 if (info.m_last_try < NodeSeconds{0s}) {
1084 return -6;
1085 }
1086 if (info.m_last_success < NodeSeconds{0s}) {
1087 return -8;
1088 }
1089 }
1090
1091 if (setTried.size() != (size_t)nTried)
1092 return -9;
1093 if (mapNew.size() != (size_t)nNew)
1094 return -10;
1095
1096 for (int n = 0; n < ADDRMAN_TRIED_BUCKET_COUNT; n++) {
1097 for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
1098 if (vvTried[n][i] != -1) {
1099 if (!setTried.contains(vvTried[n][i]))
1100 return -11;
1101 const auto it{mapInfo.find(vvTried[n][i])};
1102 if (it == mapInfo.end() || it->second.GetTriedBucket(nKey, m_netgroupman) != n) {
1103 return -17;
1104 }
1105 if (it->second.GetBucketPosition(nKey, false, n) != i) {
1106 return -18;
1107 }
1108 setTried.erase(vvTried[n][i]);
1109 }
1110 }
1111 }
1112
1113 for (int n = 0; n < ADDRMAN_NEW_BUCKET_COUNT; n++) {
1114 for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
1115 if (vvNew[n][i] != -1) {
1116 if (!mapNew.contains(vvNew[n][i]))
1117 return -12;
1118 const auto it{mapInfo.find(vvNew[n][i])};
1119 if (it == mapInfo.end() || it->second.GetBucketPosition(nKey, true, n) != i) {
1120 return -19;
1121 }
1122 if (--mapNew[vvNew[n][i]] == 0)
1123 mapNew.erase(vvNew[n][i]);
1124 }
1125 }
1126 }
1127
1128 if (setTried.size())
1129 return -13;
1130 if (mapNew.size())
1131 return -15;
1132 if (nKey.IsNull())
1133 return -16;
1134
1135 // It's possible that m_network_counts may have all-zero entries that local_counts
1136 // doesn't have if addrs from a network were being added and then removed again in the past.
1137 if (m_network_counts.size() < local_counts.size()) {
1138 return -20;
1139 }
1140 for (const auto& [net, count] : m_network_counts) {
1141 if (local_counts[net].n_new != count.n_new || local_counts[net].n_tried != count.n_tried) {
1142 return -21;
1143 }
1144 }
1145
1146 return 0;
1147 }
1148
1149 size_t AddrManImpl::Size(std::optional<Network> net, std::optional<bool> in_new) const
1150 {
1151 LOCK(cs);
1152 Check();
1153 auto ret = Size_(net, in_new);
1154 Check();
1155 return ret;
1156 }
1157
1158 bool AddrManImpl::Add(const std::vector<CAddress>& vAddr, const CNetAddr& source, std::chrono::seconds time_penalty)
1159 {
1160 LOCK(cs);
1161 Check();
1162 auto ret = Add_(vAddr, source, time_penalty);
1163 Check();
1164 return ret;
1165 }
1166
1167 bool AddrManImpl::Good(const CService& addr, NodeSeconds time)
1168 {
1169 LOCK(cs);
1170 Check();
1171 auto ret = Good_(addr, /*test_before_evict=*/true, time);
1172 Check();
1173 return ret;
1174 }
1175
1176 void AddrManImpl::Attempt(const CService& addr, bool fCountFailure, NodeSeconds time)
1177 {
1178 LOCK(cs);
1179 Check();
1180 Attempt_(addr, fCountFailure, time);
1181 Check();
1182 }
1183
1184 void AddrManImpl::ResolveCollisions()
1185 {
1186 LOCK(cs);
1187 Check();
1188 ResolveCollisions_();
1189 Check();
1190 }
1191
1192 std::pair<CAddress, NodeSeconds> AddrManImpl::SelectTriedCollision()
1193 {
1194 LOCK(cs);
1195 Check();
1196 auto ret = SelectTriedCollision_();
1197 Check();
1198 return ret;
1199 }
1200
1201 std::pair<CAddress, NodeSeconds> AddrManImpl::Select(bool new_only, const std::unordered_set<Network>& networks) const
1202 {
1203 LOCK(cs);
1204 Check();
1205 auto addrRet = Select_(new_only, networks);
1206 Check();
1207 return addrRet;
1208 }
1209
1210 std::vector<CAddress> AddrManImpl::GetAddr(size_t max_addresses, size_t max_pct, std::optional<Network> network, const bool filtered) const
1211 {
1212 LOCK(cs);
1213 Check();
1214 auto addresses = GetAddr_(max_addresses, max_pct, network, filtered);
1215 Check();
1216 return addresses;
1217 }
1218
1219 std::vector<std::pair<AddrInfo, AddressPosition>> AddrManImpl::GetEntries(bool from_tried) const
1220 {
1221 LOCK(cs);
1222 Check();
1223 auto addrInfos = GetEntries_(from_tried);
1224 Check();
1225 return addrInfos;
1226 }
1227
1228 void AddrManImpl::Connected(const CService& addr, NodeSeconds time)
1229 {
1230 LOCK(cs);
1231 Check();
1232 Connected_(addr, time);
1233 Check();
1234 }
1235
1236 void AddrManImpl::SetServices(const CService& addr, ServiceFlags nServices)
1237 {
1238 LOCK(cs);
1239 Check();
1240 SetServices_(addr, nServices);
1241 Check();
1242 }
1243
1244 std::optional<AddressPosition> AddrManImpl::FindAddressEntry(const CAddress& addr)
1245 {
1246 LOCK(cs);
1247 Check();
1248 auto entry = FindAddressEntry_(addr);
1249 Check();
1250 return entry;
1251 }
1252
1253 AddrMan::AddrMan(const NetGroupManager& netgroupman, bool deterministic, int32_t consistency_check_ratio)
1254 : m_impl(std::make_unique<AddrManImpl>(netgroupman, deterministic, consistency_check_ratio)) {}
1255
1256 AddrMan::~AddrMan() = default;
1257
1258 template <typename Stream>
1259 void AddrMan::Serialize(Stream& s_) const
1260 {
1261 m_impl->Serialize<Stream>(s_);
1262 }
1263
1264 template <typename Stream>
1265 void AddrMan::Unserialize(Stream& s_)
1266 {
1267 m_impl->Unserialize<Stream>(s_);
1268 }
1269
1270 // explicit instantiation
1271 template void AddrMan::Serialize(HashedSourceWriter<AutoFile>&) const;
1272 template void AddrMan::Serialize(DataStream&) const;
1273 template void AddrMan::Unserialize(AutoFile&);
1274 template void AddrMan::Unserialize(HashVerifier<AutoFile>&);
1275 template void AddrMan::Unserialize(DataStream&);
1276 template void AddrMan::Unserialize(HashVerifier<DataStream>&);
1277
1278 size_t AddrMan::Size(std::optional<Network> net, std::optional<bool> in_new) const
1279 {
1280 return m_impl->Size(net, in_new);
1281 }
1282
1283 bool AddrMan::Add(const std::vector<CAddress>& vAddr, const CNetAddr& source, std::chrono::seconds time_penalty)
1284 {
1285 return m_impl->Add(vAddr, source, time_penalty);
1286 }
1287
1288 bool AddrMan::Good(const CService& addr, NodeSeconds time)
1289 {
1290 return m_impl->Good(addr, time);
1291 }
1292
1293 void AddrMan::Attempt(const CService& addr, bool fCountFailure, NodeSeconds time)
1294 {
1295 m_impl->Attempt(addr, fCountFailure, time);
1296 }
1297
1298 void AddrMan::ResolveCollisions()
1299 {
1300 m_impl->ResolveCollisions();
1301 }
1302
1303 std::pair<CAddress, NodeSeconds> AddrMan::SelectTriedCollision()
1304 {
1305 return m_impl->SelectTriedCollision();
1306 }
1307
1308 std::pair<CAddress, NodeSeconds> AddrMan::Select(bool new_only, const std::unordered_set<Network>& networks) const
1309 {
1310 return m_impl->Select(new_only, networks);
1311 }
1312
1313 std::vector<CAddress> AddrMan::GetAddr(size_t max_addresses, size_t max_pct, std::optional<Network> network, const bool filtered) const
1314 {
1315 return m_impl->GetAddr(max_addresses, max_pct, network, filtered);
1316 }
1317
1318 std::vector<std::pair<AddrInfo, AddressPosition>> AddrMan::GetEntries(bool use_tried) const
1319 {
1320 return m_impl->GetEntries(use_tried);
1321 }
1322
1323 void AddrMan::Connected(const CService& addr, NodeSeconds time)
1324 {
1325 m_impl->Connected(addr, time);
1326 }
1327
1328 void AddrMan::SetServices(const CService& addr, ServiceFlags nServices)
1329 {
1330 m_impl->SetServices(addr, nServices);
1331 }
1332
1333 std::optional<AddressPosition> AddrMan::FindAddressEntry(const CAddress& addr)
1334 {
1335 return m_impl->FindAddressEntry(addr);
1336 }
1337