dash-docs/en/doxygen/html/addrman_8h.html

435 lines
26 KiB
HTML

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.14"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Dash Core: src/addrman.h File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="bitcoin_logo_doxygen.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Dash Core
&#160;<span id="projectnumber">0.12.2.1</span>
</div>
<div id="projectbrief">P2P Digital Currency</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.14 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('addrman_8h.html','');});
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#define-members">Macros</a> </div>
<div class="headertitle">
<div class="title">addrman.h File Reference</div> </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><code>#include &quot;<a class="el" href="netaddress_8h_source.html">netaddress.h</a>&quot;</code><br />
<code>#include &quot;<a class="el" href="protocol_8h_source.html">protocol.h</a>&quot;</code><br />
<code>#include &quot;<a class="el" href="random_8h_source.html">random.h</a>&quot;</code><br />
<code>#include &quot;<a class="el" href="sync_8h_source.html">sync.h</a>&quot;</code><br />
<code>#include &quot;<a class="el" href="timedata_8h_source.html">timedata.h</a>&quot;</code><br />
<code>#include &quot;<a class="el" href="util_8h_source.html">util.h</a>&quot;</code><br />
<code>#include &lt;map&gt;</code><br />
<code>#include &lt;set&gt;</code><br />
<code>#include &lt;stdint.h&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div>
<p><a href="addrman_8h_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classCAddrInfo.html">CAddrInfo</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classCAddrMan.html">CAddrMan</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:ab09df186aa818ce7b9e7c86446511cf1"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#ab09df186aa818ce7b9e7c86446511cf1">ADDRMAN_TRIED_BUCKET_COUNT</a>&#160;&#160;&#160;256</td></tr>
<tr class="memdesc:ab09df186aa818ce7b9e7c86446511cf1"><td class="mdescLeft">&#160;</td><td class="mdescRight">total number of buckets for tried addresses <a href="#ab09df186aa818ce7b9e7c86446511cf1">More...</a><br /></td></tr>
<tr class="separator:ab09df186aa818ce7b9e7c86446511cf1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a74a626eb1dbb8e307a413e86493cd510"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a74a626eb1dbb8e307a413e86493cd510">ADDRMAN_NEW_BUCKET_COUNT</a>&#160;&#160;&#160;1024</td></tr>
<tr class="memdesc:a74a626eb1dbb8e307a413e86493cd510"><td class="mdescLeft">&#160;</td><td class="mdescRight">total number of buckets for new addresses <a href="#a74a626eb1dbb8e307a413e86493cd510">More...</a><br /></td></tr>
<tr class="separator:a74a626eb1dbb8e307a413e86493cd510"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3499731a6c89e164cf74b68be2be0a84"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a3499731a6c89e164cf74b68be2be0a84">ADDRMAN_BUCKET_SIZE</a>&#160;&#160;&#160;64</td></tr>
<tr class="memdesc:a3499731a6c89e164cf74b68be2be0a84"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum allowed number of entries in buckets for new and tried addresses <a href="#a3499731a6c89e164cf74b68be2be0a84">More...</a><br /></td></tr>
<tr class="separator:a3499731a6c89e164cf74b68be2be0a84"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a87c7c90e3631bf1a4475cabdded61f6f"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a87c7c90e3631bf1a4475cabdded61f6f">ADDRMAN_TRIED_BUCKETS_PER_GROUP</a>&#160;&#160;&#160;8</td></tr>
<tr class="memdesc:a87c7c90e3631bf1a4475cabdded61f6f"><td class="mdescLeft">&#160;</td><td class="mdescRight">over how many buckets entries with tried addresses from a single group (/16 for IPv4) are spread <a href="#a87c7c90e3631bf1a4475cabdded61f6f">More...</a><br /></td></tr>
<tr class="separator:a87c7c90e3631bf1a4475cabdded61f6f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a09c090218fd02375aa57eb7e8eb1c013"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a09c090218fd02375aa57eb7e8eb1c013">ADDRMAN_NEW_BUCKETS_PER_SOURCE_GROUP</a>&#160;&#160;&#160;64</td></tr>
<tr class="memdesc:a09c090218fd02375aa57eb7e8eb1c013"><td class="mdescLeft">&#160;</td><td class="mdescRight">over how many buckets entries with new addresses originating from a single group are spread <a href="#a09c090218fd02375aa57eb7e8eb1c013">More...</a><br /></td></tr>
<tr class="separator:a09c090218fd02375aa57eb7e8eb1c013"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a230e30813119d10bdba59c1f8cc789cd"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a230e30813119d10bdba59c1f8cc789cd">ADDRMAN_NEW_BUCKETS_PER_ADDRESS</a>&#160;&#160;&#160;8</td></tr>
<tr class="memdesc:a230e30813119d10bdba59c1f8cc789cd"><td class="mdescLeft">&#160;</td><td class="mdescRight">in how many buckets for entries with new addresses a single address may occur <a href="#a230e30813119d10bdba59c1f8cc789cd">More...</a><br /></td></tr>
<tr class="separator:a230e30813119d10bdba59c1f8cc789cd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a86698b159625d84b47a2ffddc76ebc99"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a86698b159625d84b47a2ffddc76ebc99">ADDRMAN_HORIZON_DAYS</a>&#160;&#160;&#160;30</td></tr>
<tr class="memdesc:a86698b159625d84b47a2ffddc76ebc99"><td class="mdescLeft">&#160;</td><td class="mdescRight">how old addresses can maximally be <a href="#a86698b159625d84b47a2ffddc76ebc99">More...</a><br /></td></tr>
<tr class="separator:a86698b159625d84b47a2ffddc76ebc99"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a771c05a7a20d9a35f4546e1e333c48c4"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a771c05a7a20d9a35f4546e1e333c48c4">ADDRMAN_RETRIES</a>&#160;&#160;&#160;3</td></tr>
<tr class="memdesc:a771c05a7a20d9a35f4546e1e333c48c4"><td class="mdescLeft">&#160;</td><td class="mdescRight">after how many failed attempts we give up on a new node <a href="#a771c05a7a20d9a35f4546e1e333c48c4">More...</a><br /></td></tr>
<tr class="separator:a771c05a7a20d9a35f4546e1e333c48c4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a26430e6e9a3ef9f4fc54491330b7e611"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a26430e6e9a3ef9f4fc54491330b7e611">ADDRMAN_MAX_FAILURES</a>&#160;&#160;&#160;10</td></tr>
<tr class="memdesc:a26430e6e9a3ef9f4fc54491330b7e611"><td class="mdescLeft">&#160;</td><td class="mdescRight">how many successive failures are allowed ... <a href="#a26430e6e9a3ef9f4fc54491330b7e611">More...</a><br /></td></tr>
<tr class="separator:a26430e6e9a3ef9f4fc54491330b7e611"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7dcc28590c48ca382d26c4f37fda4e3d"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a7dcc28590c48ca382d26c4f37fda4e3d">ADDRMAN_MIN_FAIL_DAYS</a>&#160;&#160;&#160;7</td></tr>
<tr class="memdesc:a7dcc28590c48ca382d26c4f37fda4e3d"><td class="mdescLeft">&#160;</td><td class="mdescRight">... in at least this many days <a href="#a7dcc28590c48ca382d26c4f37fda4e3d">More...</a><br /></td></tr>
<tr class="separator:a7dcc28590c48ca382d26c4f37fda4e3d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a06edfd03ad361fbc74794e1c533d1bc5"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#a06edfd03ad361fbc74794e1c533d1bc5">ADDRMAN_GETADDR_MAX_PCT</a>&#160;&#160;&#160;23</td></tr>
<tr class="memdesc:a06edfd03ad361fbc74794e1c533d1bc5"><td class="mdescLeft">&#160;</td><td class="mdescRight">the maximum percentage of nodes to return in a getaddr call <a href="#a06edfd03ad361fbc74794e1c533d1bc5">More...</a><br /></td></tr>
<tr class="separator:a06edfd03ad361fbc74794e1c533d1bc5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad10877f29a66224fce5c20d33e26448a"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="addrman_8h.html#ad10877f29a66224fce5c20d33e26448a">ADDRMAN_GETADDR_MAX</a>&#160;&#160;&#160;2500</td></tr>
<tr class="memdesc:ad10877f29a66224fce5c20d33e26448a"><td class="mdescLeft">&#160;</td><td class="mdescRight">the maximum number of nodes to return in a getaddr call <a href="#ad10877f29a66224fce5c20d33e26448a">More...</a><br /></td></tr>
<tr class="separator:ad10877f29a66224fce5c20d33e26448a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">Macro Definition Documentation</h2>
<a id="a3499731a6c89e164cf74b68be2be0a84"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3499731a6c89e164cf74b68be2be0a84">&#9670;&nbsp;</a></span>ADDRMAN_BUCKET_SIZE</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_BUCKET_SIZE&#160;&#160;&#160;64</td>
</tr>
</table>
</div><div class="memdoc">
<p>maximum allowed number of entries in buckets for new and tried addresses </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00140">140</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8h_source.html#l00437">CAddrMan::Clear()</a>, <a class="el" href="addrman_8cpp_source.html#l00026">CAddrInfo::GetBucketPosition()</a>, <a class="el" href="addrman_8cpp_source.html#l00332">CAddrMan::Select_()</a>, and <a class="el" href="addrman_8h_source.html#l00285">CAddrMan::Serialize()</a>.</p>
</div>
</div>
<a id="ad10877f29a66224fce5c20d33e26448a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad10877f29a66224fce5c20d33e26448a">&#9670;&nbsp;</a></span>ADDRMAN_GETADDR_MAX</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_GETADDR_MAX&#160;&#160;&#160;2500</td>
</tr>
</table>
</div><div class="memdoc">
<p>the maximum number of nodes to return in a getaddr call </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00167">167</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00457">CAddrMan::GetAddr_()</a>.</p>
</div>
</div>
<a id="a06edfd03ad361fbc74794e1c533d1bc5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a06edfd03ad361fbc74794e1c533d1bc5">&#9670;&nbsp;</a></span>ADDRMAN_GETADDR_MAX_PCT</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_GETADDR_MAX_PCT&#160;&#160;&#160;23</td>
</tr>
</table>
</div><div class="memdoc">
<p>the maximum percentage of nodes to return in a getaddr call </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00164">164</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00457">CAddrMan::GetAddr_()</a>.</p>
</div>
</div>
<a id="a86698b159625d84b47a2ffddc76ebc99"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a86698b159625d84b47a2ffddc76ebc99">&#9670;&nbsp;</a></span>ADDRMAN_HORIZON_DAYS</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_HORIZON_DAYS&#160;&#160;&#160;30</td>
</tr>
</table>
</div><div class="memdoc">
<p>how old addresses can maximally be </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00152">152</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00032">CAddrInfo::IsTerrible()</a>.</p>
</div>
</div>
<a id="a26430e6e9a3ef9f4fc54491330b7e611"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a26430e6e9a3ef9f4fc54491330b7e611">&#9670;&nbsp;</a></span>ADDRMAN_MAX_FAILURES</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_MAX_FAILURES&#160;&#160;&#160;10</td>
</tr>
</table>
</div><div class="memdoc">
<p>how many successive failures are allowed ... </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00158">158</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00032">CAddrInfo::IsTerrible()</a>.</p>
</div>
</div>
<a id="a7dcc28590c48ca382d26c4f37fda4e3d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7dcc28590c48ca382d26c4f37fda4e3d">&#9670;&nbsp;</a></span>ADDRMAN_MIN_FAIL_DAYS</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_MIN_FAIL_DAYS&#160;&#160;&#160;7</td>
</tr>
</table>
</div><div class="memdoc">
<p>... in at least this many days </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00161">161</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00032">CAddrInfo::IsTerrible()</a>.</p>
</div>
</div>
<a id="a74a626eb1dbb8e307a413e86493cd510"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a74a626eb1dbb8e307a413e86493cd510">&#9670;&nbsp;</a></span>ADDRMAN_NEW_BUCKET_COUNT</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_NEW_BUCKET_COUNT&#160;&#160;&#160;1024</td>
</tr>
</table>
</div><div class="memdoc">
<p>total number of buckets for new addresses </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00137">137</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8h_source.html#l00437">CAddrMan::Clear()</a>, <a class="el" href="addrman_8cpp_source.html#l00018">CAddrInfo::GetNewBucket()</a>, <a class="el" href="addrman_8cpp_source.html#l00196">CAddrMan::Good_()</a>, <a class="el" href="addrman_8cpp_source.html#l00148">CAddrMan::MakeTried()</a>, <a class="el" href="addrman_8cpp_source.html#l00332">CAddrMan::Select_()</a>, <a class="el" href="addrman_8h_source.html#l00285">CAddrMan::Serialize()</a>, and <a class="el" href="addrman_8h_source.html#l00335">CAddrMan::Unserialize()</a>.</p>
</div>
</div>
<a id="a230e30813119d10bdba59c1f8cc789cd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a230e30813119d10bdba59c1f8cc789cd">&#9670;&nbsp;</a></span>ADDRMAN_NEW_BUCKETS_PER_ADDRESS</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_NEW_BUCKETS_PER_ADDRESS&#160;&#160;&#160;8</td>
</tr>
</table>
</div><div class="memdoc">
<p>in how many buckets for entries with new addresses a single address may occur </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00149">149</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00245">CAddrMan::Add_()</a>, and <a class="el" href="addrman_8h_source.html#l00335">CAddrMan::Unserialize()</a>.</p>
</div>
</div>
<a id="a09c090218fd02375aa57eb7e8eb1c013"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a09c090218fd02375aa57eb7e8eb1c013">&#9670;&nbsp;</a></span>ADDRMAN_NEW_BUCKETS_PER_SOURCE_GROUP</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_NEW_BUCKETS_PER_SOURCE_GROUP&#160;&#160;&#160;64</td>
</tr>
</table>
</div><div class="memdoc">
<p>over how many buckets entries with new addresses originating from a single group are spread </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00146">146</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00018">CAddrInfo::GetNewBucket()</a>.</p>
</div>
</div>
<a id="a771c05a7a20d9a35f4546e1e333c48c4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a771c05a7a20d9a35f4546e1e333c48c4">&#9670;&nbsp;</a></span>ADDRMAN_RETRIES</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_RETRIES&#160;&#160;&#160;3</td>
</tr>
</table>
</div><div class="memdoc">
<p>after how many failed attempts we give up on a new node </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00155">155</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00032">CAddrInfo::IsTerrible()</a>.</p>
</div>
</div>
<a id="ab09df186aa818ce7b9e7c86446511cf1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab09df186aa818ce7b9e7c86446511cf1">&#9670;&nbsp;</a></span>ADDRMAN_TRIED_BUCKET_COUNT</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_TRIED_BUCKET_COUNT&#160;&#160;&#160;256</td>
</tr>
</table>
</div><div class="memdoc">
<p>total number of buckets for tried addresses </p>
<p>Stochastic address manager</p>
<p>Design goals:</p><ul>
<li>Keep the address tables in-memory, and asynchronously dump the entire table to peers.dat.</li>
<li>Make sure no (localized) attacker can fill the entire table with his nodes/addresses.</li>
</ul>
<p>To that end:</p><ul>
<li>Addresses are organized into buckets.<ul>
<li>Addresses that have not yet been tried go into 1024 "new" buckets.<ul>
<li>Based on the address range (/16 for IPv4) of the source of information, 64 buckets are selected at random.</li>
<li>The actual bucket is chosen from one of these, based on the range in which the address itself is located.</li>
<li>One single address can occur in up to 8 different buckets to increase selection chances for addresses that are seen frequently. The chance for increasing this multiplicity decreases exponentially.</li>
<li>When adding a new address to a full bucket, a randomly chosen entry (with a bias favoring less recently seen ones) is removed from it first.</li>
</ul>
</li>
<li>Addresses of nodes that are known to be accessible go into 256 "tried" buckets.<ul>
<li>Each address range selects at random 8 of these buckets.</li>
<li>The actual bucket is chosen from one of these, based on the full address.</li>
<li>When adding a new good address to a full bucket, a randomly chosen entry (with a bias favoring less recently tried ones) is evicted from it, back to the "new" buckets.</li>
</ul>
</li>
<li>Bucket selection is based on cryptographic hashing, using a randomly-generated 256-bit key, which should not be observable by adversaries.</li>
<li>Several indexes are kept for high performance. Defining DEBUG_ADDRMAN will introduce frequent (and expensive) consistency checks for the entire data structure. </li>
</ul>
</li>
</ul>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00134">134</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8h_source.html#l00437">CAddrMan::Clear()</a>, <a class="el" href="addrman_8cpp_source.html#l00011">CAddrInfo::GetTriedBucket()</a>, and <a class="el" href="addrman_8cpp_source.html#l00332">CAddrMan::Select_()</a>.</p>
</div>
</div>
<a id="a87c7c90e3631bf1a4475cabdded61f6f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a87c7c90e3631bf1a4475cabdded61f6f">&#9670;&nbsp;</a></span>ADDRMAN_TRIED_BUCKETS_PER_GROUP</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define ADDRMAN_TRIED_BUCKETS_PER_GROUP&#160;&#160;&#160;8</td>
</tr>
</table>
</div><div class="memdoc">
<p>over how many buckets entries with tried addresses from a single group (/16 for IPv4) are spread </p>
<p class="definition">Definition at line <a class="el" href="addrman_8h_source.html#l00143">143</a> of file <a class="el" href="addrman_8h_source.html">addrman.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="addrman_8cpp_source.html#l00011">CAddrInfo::GetTriedBucket()</a>.</p>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="addrman_8h.html">addrman.h</a></li>
<li class="footer">Generated on Thu Dec 14 2017 13:15:10 for Dash Core by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
</ul>
</div>
</body>
</html>