ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2026-02-01 04:25:30 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
gh-pages
rippled/SHAMapSync_8cpp_source.html
bthomee 9368c0d563 deploy: 5f638f5553
2026-01-28 10:13:01 -08:00

1002 lines
172 KiB
HTML
Raw Permalink Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>rippled: SHAMapSync.cpp Source File</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="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 id="projectrow">
<td id="projectalign">
<div id="projectname">rippled
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function() { init_codefold(0); });
/* @license-end */
</script>
<!-- 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">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_90ffdbabf412cfdffe6b2193e0ce938a.html">libxrpl</a></li><li class="navelem"><a class="el" href="dir_1cf8fc3bc79b026bd5b725d287fb7808.html">shamap</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle"><div class="title">SHAMapSync.cpp</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="preprocessor">#include &lt;xrpl/basics/random.h&gt;</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="preprocessor">#include &lt;xrpl/shamap/SHAMap.h&gt;</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="preprocessor">#include &lt;xrpl/shamap/SHAMapLeafNode.h&gt;</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="preprocessor">#include &lt;xrpl/shamap/SHAMapSyncFilter.h&gt;</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span> </div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacexrpl.html">xrpl</a> {</div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span> </div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00009" data-start="{" data-end="}">
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a8e42b528b1da5c330135ef3f8317b744"> 9</a></span><a class="code hl_function" href="classxrpl_1_1SHAMap.html#a8e42b528b1da5c330135ef3f8317b744">SHAMap::visitLeaves</a>(<a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;<span class="keywordtype">void</span>(boost::intrusive_ptr&lt;SHAMapItem const&gt; <span class="keyword">const</span>&amp; item)&gt; <span class="keyword">const</span>&amp; leafFunction)<span class="keyword"> const</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span> <a class="code hl_function" href="classxrpl_1_1SHAMap.html#ae77b2bfe9265c7f23e0183052d160555">visitNodes</a>([&amp;leafFunction](<a class="code hl_class" href="classxrpl_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>&amp; node) {</div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span> <span class="keywordflow">if</span> (!node.<a class="code hl_function" href="classxrpl_1_1SHAMapTreeNode.html#a93d8db911ff2d7039a2062e29044b953">isInner</a>())</div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> leafFunction(<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>&amp;<span class="keyword">&gt;</span>(node).<a class="code hl_function" href="classxrpl_1_1SHAMap.html#a2d82da83b63cf3cfed3e854eac5f9c8a">peekItem</a>());</div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> });</div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span>}</div>
</div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span> </div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00019" data-start="{" data-end="}">
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#ae77b2bfe9265c7f23e0183052d160555"> 19</a></span><a class="code hl_function" href="classxrpl_1_1SHAMap.html#ae77b2bfe9265c7f23e0183052d160555">SHAMap::visitNodes</a>(<a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;<span class="keywordtype">bool</span>(<a class="code hl_class" href="classxrpl_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>&amp;)&gt; <span class="keyword">const</span>&amp; function)<span class="keyword"> const</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>)</div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> function(*<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>);</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>-&gt;isInner())</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> </div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">using </span>StackEntry = <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, intr_ptr::SharedPtr&lt;SHAMapInnerNode&gt;</a>&gt;;</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;StackEntry, std::vector&lt;StackEntry&gt;</a>&gt; stack;</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> </div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">auto</span> node = intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>);</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keywordtype">int</span> pos = 0;</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> </div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>)</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> {</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keywordflow">while</span> (pos &lt; 16)</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(pos))</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> {</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <a class="code hl_class" href="classxrpl_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a> child = <a class="code hl_function" href="classxrpl_1_1SHAMap.html#ad1c975472f811fd67098c7088f1626d6">descendNoStore</a>(*node, pos);</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">if</span> (!function(*child))</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">if</span> (child-&gt;isLeaf())</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> ++pos;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> {</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// If there are no more children, don&#39;t push this node</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">while</span> ((pos != 15) &amp;&amp; (node-&gt;isEmptyBranch(pos + 1)))</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> ++pos;</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keywordflow">if</span> (pos != 15)</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> {</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// save next position to resume at</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(pos + 1, std::move(node)));</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> }</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// descend to the child&#39;s first position</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> node = intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(child);</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> pos = 0;</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> }</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> {</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> ++pos; <span class="comment">// move to next position</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">if</span> (stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(pos, node) = stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> }</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span>}</div>
</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> </div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a3d2393c957f8c1df98b9c6f2dc14e4c2"> 79</a></span><a class="code hl_function" href="classxrpl_1_1SHAMap.html#a3d2393c957f8c1df98b9c6f2dc14e4c2">SHAMap::visitDifferences</a>(<a class="code hl_class" href="classxrpl_1_1SHAMap.html">SHAMap</a> <span class="keyword">const</span>* have, <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;<span class="keywordtype">bool</span>(<a class="code hl_class" href="classxrpl_1_1SHAMapTreeNode.html">SHAMapTreeNode</a> <span class="keyword">const</span>&amp;)&gt; <span class="keyword">const</span>&amp; function)<span class="keyword"> const</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// Visit every node in this SHAMap that is not present</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// in the specified SHAMap</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>)</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> </div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>-&gt;getHash().isZero())</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordflow">if</span> (have &amp;&amp; (<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>-&gt;getHash() == have-&gt;<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>-&gt;getHash()))</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>-&gt;isLeaf())</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">auto</span> leaf = intr_ptr::static_pointer_cast&lt;SHAMapLeafNode&gt;(<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>);</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">if</span> (!have || !have-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMap.html#aa2870b69e7014aec13042fcd457adb67">hasLeafNode</a>(leaf-&gt;peekItem()-&gt;key(), leaf-&gt;getHash()))</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> function(*<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>);</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> }</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// contains unexplored non-matching inner node entries</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">using </span>StackEntry = <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;SHAMapInnerNode*, SHAMapNodeID&gt;</a>;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;StackEntry, std::vector&lt;StackEntry&gt;</a>&gt; stack;</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>.get()), <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a>{}});</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">while</span> (!stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> {</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">auto</span> <span class="keyword">const</span> [node, nodeID] = stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> </div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// 1) Add this node to the pack</span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordflow">if</span> (!function(*node))</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// 2) push non-matching child inner nodes</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> {</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; childHash = node-&gt;getChildHash(i);</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> childID = nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">getChildNodeID</a>(i);</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">auto</span> next = <a class="code hl_function" href="classxrpl_1_1SHAMap.html#aecc016f73624ae0984cb81df5ffb7f31">descendThrow</a>(node, i);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> </div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordflow">if</span> (next-&gt;isInner())</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> {</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (!have || !have-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMap.html#a5a435e741305244231c0e6645ef167c6">hasInnerNode</a>(childID, childHash))</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(next), childID});</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!have || !have-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMap.html#aa2870b69e7014aec13042fcd457adb67">hasLeafNode</a>(<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(next)-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapLeafNode.html#ad4443852b178a711d40c14f2267e475f">peekItem</a>()-&gt;key(), childHash))</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> {</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">if</span> (!function(*next))</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> }</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> }</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span>}</div>
</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> </div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="comment">// Starting at the position referred to by the specfied</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span><span class="comment">// StackEntry, process that node and its first resident</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">// children, descending the SHAMap until we complete the</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment">// processing of a node.</span></div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00143" data-start="{" data-end="}">
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a6ffb9b31ce3735954a1a6d9708282670"> 143</a></span><a class="code hl_function" href="classxrpl_1_1SHAMap.html#a6ffb9b31ce3735954a1a6d9708282670">SHAMap::gmn_ProcessNodes</a>(<a class="code hl_struct" href="structxrpl_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a>&amp; mn, <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">MissingNodes::StackEntry</a>&amp; se)</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span>{</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*&amp; node = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;0&gt;</a>(se);</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a>&amp; nodeID = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;1&gt;</a>(se);</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordtype">int</span>&amp; firstChild = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;2&gt;</a>(se);</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordtype">int</span>&amp; currentChild = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;3&gt;</a>(se);</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keywordtype">bool</span>&amp; fullBelow = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;4&gt;</a>(se);</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordflow">while</span> (currentChild &lt; 16)</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> {</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordtype">int</span> branch = (firstChild + currentChild++) % 16;</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">if</span> (node-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapInnerNode.html#afee06ff7efb7862b5463d4e752027958">isEmptyBranch</a>(branch))</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; childHash = node-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapInnerNode.html#a4738160a51edf90c206b948c6d19da79">getChildHash</a>(branch);</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a628459fdb83572eb82989495229c6ea3">missingHashes_</a>.count(childHash) != 0)</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> {</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// we already know this child node is missing</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> fullBelow = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> }</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#a82196cdec47759dedf4cf2b47fe648a2">backed_</a> || !<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#a28ad752ef558a0e15853521c5782529b">f_</a>.<a class="code hl_function" href="classxrpl_1_1Family.html#adf51da6d90e28abd47f917536b23c537">getFullBelowCache</a>()-&gt;touch_if_exists(childHash.as_uint256()))</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> {</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordtype">bool</span> <a class="code hl_enumvalue" href="namespacexrpl.html#a46feb2a3d6afe415003984673a6a8648a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a> = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="keyword">auto</span> d = <a class="code hl_function" href="classxrpl_1_1SHAMap.html#a20d520cb79eeaf502edc67b7fd749b40">descendAsync</a>(</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> node,</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> branch,</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a9d3008bf85f494c902b7e510438dee03">filter_</a>,</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <a class="code hl_enumvalue" href="namespacexrpl.html#a46feb2a3d6afe415003984673a6a8648a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a>,</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> [node, nodeID, branch, &amp;mn](<a class="code hl_class" href="classxrpl_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a> found, <a class="code hl_class" href="classxrpl_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp;) {</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// a read completed asynchronously</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> std::unique_lock&lt;std::mutex&gt; lock{mn.deferLock_};</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a44cd711639cd7e61604dce1c8cc98200">finishedReads_</a>.emplace_back(node, nodeID, branch, std::move(found));</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a2053ebe5b21d9060ca3618039f0dd8a3">deferCondVar_</a>.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html">notify_one</a>();</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> });</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">if</span> (<a class="code hl_enumvalue" href="namespacexrpl.html#a46feb2a3d6afe415003984673a6a8648a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a>)</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> {</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> fullBelow = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> ++mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a1183af239d5703bfc4c7d78942b16fb9">deferred_</a>;</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> }</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!d)</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> {</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// node is not in database</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> </div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> fullBelow = <span class="keyword">false</span>; <span class="comment">// for now, not known full below</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a628459fdb83572eb82989495229c6ea3">missingHashes_</a>.insert(childHash);</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a771de7b91dd6a6d13de3fb82e34bbbde">missingNodes_</a>.emplace_back(nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">getChildNodeID</a>(branch), childHash.as_uint256());</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> </div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="keywordflow">if</span> (--mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a32a19042bfe8e4d982b9a498394730a7">max_</a> &lt;= 0)</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> }</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d-&gt;isInner() &amp;&amp; !<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(d)-&gt;isFullBelow(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#aa19ca834836b5ce90ac5cf9dc8c34e5d">generation_</a>))</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> {</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.push(se);</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// Switch to processing the child node</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> node = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(d);</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> nodeID = nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">getChildNodeID</a>(branch);</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> firstChild = <a class="code hl_function" href="namespacexrpl.html#a5d82510b4e4c4daeab7f65d5c8805702">rand_int</a>(255);</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> currentChild = 0;</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> fullBelow = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> }</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> }</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> </div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// We have finished processing an inner node</span></div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// and thus (for now) all its children</span></div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordflow">if</span> (fullBelow)</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> { <span class="comment">// No partial node encountered below this node</span></div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> node-&gt;setFullBelowGen(mn.generation_);</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">if</span> (backed_)</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> {</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> f_.getFullBelowCache()-&gt;insert(node-&gt;getHash().as_uint256());</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> }</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> }</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> </div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> node = <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span>}</div>
</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> </div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span><span class="comment">// Wait for deferred reads to finish and</span></div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span><span class="comment">// process their results</span></div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00227" data-start="{" data-end="}">
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#abdc8a73038f2e2e3fa5d0fa102fcea1c"> 227</a></span>SHAMap::gmn_ProcessDeferredReads(<a class="code hl_struct" href="structxrpl_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a>&amp; mn)</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span>{</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// Process all deferred reads</span></div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordtype">int</span> complete = 0;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordflow">while</span> (complete != mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a1183af239d5703bfc4c7d78942b16fb9">deferred_</a>)</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> {</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple&lt;SHAMapInnerNode*, SHAMapNodeID, int, intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a>&gt; deferredNode;</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> {</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/thread/unique_lock.html">std::unique_lock&lt;std::mutex&gt;</a> lock{mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a4131606c3642599cfde7249aaa3c8e3c">deferLock_</a>};</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordflow">while</span> (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a44cd711639cd7e61604dce1c8cc98200">finishedReads_</a>.size() &lt;= complete)</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a2053ebe5b21d9060ca3618039f0dd8a3">deferCondVar_</a>.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html">wait</a>(lock);</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> deferredNode = std::move(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a44cd711639cd7e61604dce1c8cc98200">finishedReads_</a>[complete++]);</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keyword">auto</span> parent = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;0&gt;</a>(deferredNode);</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; parentID = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;1&gt;</a>(deferredNode);</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keyword">auto</span> branch = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;2&gt;</a>(deferredNode);</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="keyword">auto</span> nodePtr = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;3&gt;</a>(deferredNode);</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; nodeHash = parent-&gt;getChildHash(branch);</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> </div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">if</span> (nodePtr)</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> { <span class="comment">// Got the node</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> nodePtr = parent-&gt;canonicalizeChild(branch, std::move(nodePtr));</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> </div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="comment">// When we finish this stack, we need to restart</span></div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="comment">// with the parent of this node</span></div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a25ab03f046237635510a3875f4d268bc">resumes_</a>[parent] = parentID;</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a32a19042bfe8e4d982b9a498394730a7">max_</a> &gt; 0) &amp;&amp; (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a628459fdb83572eb82989495229c6ea3">missingHashes_</a>.insert(nodeHash).second))</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> {</div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a771de7b91dd6a6d13de3fb82e34bbbde">missingNodes_</a>.emplace_back(parentID.getChildNodeID(branch), nodeHash.as_uint256());</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> --mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a32a19042bfe8e4d982b9a498394730a7">max_</a>;</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> }</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a44cd711639cd7e61604dce1c8cc98200">finishedReads_</a>.clear();</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a44cd711639cd7e61604dce1c8cc98200">finishedReads_</a>.reserve(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a57565a4d0be35b7c3f0bdde9e72f9547">maxDefer_</a>);</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a1183af239d5703bfc4c7d78942b16fb9">deferred_</a> = 0;</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span>}</div>
</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> </div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span><a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;SHAMapNodeID, uint256&gt;</a>&gt;</div>
<div class="foldopen" id="foldopen00273" data-start="{" data-end="}">
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a72c0b8e625bf87d836c51e5d1a7846eb"> 273</a></span>SHAMap::getMissingNodes(<span class="keywordtype">int</span> max, <a class="code hl_class" href="classxrpl_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span>{</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> XRPL_ASSERT(root_-&gt;getHash().isNonZero(), <span class="stringliteral">&quot;xrpl::SHAMap::getMissingNodes : nonzero root hash&quot;</span>);</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> XRPL_ASSERT(max &gt; 0, <span class="stringliteral">&quot;xrpl::SHAMap::getMissingNodes : valid max input&quot;</span>);</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> </div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <a class="code hl_struct" href="structxrpl_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a> mn(</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> max,</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> filter,</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> 512, <span class="comment">// number of async reads per pass</span></div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> f_.getFullBelowCache()-&gt;getGeneration());</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> </div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="keywordflow">if</span> (!root_-&gt;isInner() || intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_)-&gt;isFullBelow(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#aa19ca834836b5ce90ac5cf9dc8c34e5d">generation_</a>))</div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> {</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> clearSynching();</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">return</span> std::move(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a771de7b91dd6a6d13de3fb82e34bbbde">missingNodes_</a>);</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> }</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> </div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">// Start at the root.</span></div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// The firstChild value is selected randomly so if multiple threads</span></div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// are traversing the map, each thread will start at a different</span></div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// (randomly selected) inner node. This increases the likelihood</span></div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// that the two threads will produce different request sets (which is</span></div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// more efficient than sending identical requests).</span></div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">MissingNodes::StackEntry</a> pos{<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(root_.get()), <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a>(), <a class="code hl_function" href="namespacexrpl.html#ac7c4d7a762799eea33eb4e94e8132392">rand_int</a>(255), 0, <span class="keyword">true</span>};</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keyword">auto</span>&amp; node = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;0&gt;</a>(pos);</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keyword">auto</span>&amp; nextChild = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;3&gt;</a>(pos);</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keyword">auto</span>&amp; fullBelow = <a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/types/is_same.html">std::get&lt;4&gt;</a>(pos);</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> </div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="comment">// Traverse the map without blocking</span></div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="keywordflow">do</span></div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> {</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keywordflow">while</span> ((node != <span class="keyword">nullptr</span>) &amp;&amp; (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a1183af239d5703bfc4c7d78942b16fb9">deferred_</a> &lt;= mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a57565a4d0be35b7c3f0bdde9e72f9547">maxDefer_</a>))</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> {</div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> gmn_ProcessNodes(mn, pos);</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> </div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a32a19042bfe8e4d982b9a498394730a7">max_</a> &lt;= 0)</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> </div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keywordflow">if</span> ((node == <span class="keyword">nullptr</span>) &amp;&amp; !mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.empty())</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> {</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// Pick up where we left off with this node&#39;s parent</span></div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="keywordtype">bool</span> was = fullBelow; <span class="comment">// was full below</span></div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> </div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> pos = mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.top();</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.pop();</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="keywordflow">if</span> (nextChild == 0)</div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> {</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <span class="comment">// This is a node we are processing for the first time</span></div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> fullBelow = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> }</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> {</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// This is a node we are continuing to process</span></div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> fullBelow = fullBelow &amp;&amp; was; <span class="comment">// was and still is</span></div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> }</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> XRPL_ASSERT(node, <span class="stringliteral">&quot;xrpl::SHAMap::getMissingNodes : first non-null node&quot;</span>);</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> }</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> }</div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> </div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="comment">// We have either emptied the stack or</span></div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="comment">// posted as many deferred reads as we can</span></div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a1183af239d5703bfc4c7d78942b16fb9">deferred_</a>)</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> gmn_ProcessDeferredReads(mn);</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> </div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a32a19042bfe8e4d982b9a498394730a7">max_</a> &lt;= 0)</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="keywordflow">return</span> std::move(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a771de7b91dd6a6d13de3fb82e34bbbde">missingNodes_</a>);</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> </div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="keywordflow">if</span> (node == <span class="keyword">nullptr</span>)</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> { <span class="comment">// We weren&#39;t in the middle of processing a node</span></div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> </div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.empty() &amp;&amp; !mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a25ab03f046237635510a3875f4d268bc">resumes_</a>.empty())</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> {</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="comment">// Recheck nodes we could not finish before</span></div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; [<a class="code hl_enumvalue" href="namespacexrpl.html#ac599741e6d4066bada11df4c7e8ad30aad9a09590da318a86ba2bd64b374c2d77">innerNode</a>, nodeId] : mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a25ab03f046237635510a3875f4d268bc">resumes_</a>)</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="keywordflow">if</span> (!<a class="code hl_enumvalue" href="namespacexrpl.html#ac599741e6d4066bada11df4c7e8ad30aad9a09590da318a86ba2bd64b374c2d77">innerNode</a>-&gt;isFullBelow(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#aa19ca834836b5ce90ac5cf9dc8c34e5d">generation_</a>))</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.push(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a>(<a class="code hl_enumvalue" href="namespacexrpl.html#ac599741e6d4066bada11df4c7e8ad30aad9a09590da318a86ba2bd64b374c2d77">innerNode</a>, nodeId, <a class="code hl_function" href="namespacexrpl.html#ac7c4d7a762799eea33eb4e94e8132392">rand_int</a>(255), 0, <span class="keyword">true</span>));</div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> </div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a25ab03f046237635510a3875f4d268bc">resumes_</a>.clear();</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> }</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keywordflow">if</span> (!mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.empty())</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> {</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="comment">// Resume at the top of the stack</span></div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> pos = mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.top();</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">stack_</a>.pop();</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> XRPL_ASSERT(node, <span class="stringliteral">&quot;xrpl::SHAMap::getMissingNodes : second non-null node&quot;</span>);</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> }</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> }</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> </div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="comment">// node will only still be nullptr if</span></div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="comment">// we finished the current node, the stack is empty</span></div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="comment">// and we have no nodes to resume</span></div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> </div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> } <span class="keywordflow">while</span> (node != <span class="keyword">nullptr</span>);</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> </div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a771de7b91dd6a6d13de3fb82e34bbbde">missingNodes_</a>.empty())</div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> clearSynching();</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> </div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="keywordflow">return</span> std::move(mn.<a class="code hl_variable" href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a771de7b91dd6a6d13de3fb82e34bbbde">missingNodes_</a>);</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span>}</div>
</div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> </div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00375" data-start="{" data-end="}">
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#aa7c78433e29f2644bd779c05813b0213"> 375</a></span>SHAMap::getNodeFat(</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; wanted,</div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;SHAMapNodeID, Blob&gt;</a>&gt;&amp; data,</div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <span class="keywordtype">bool</span> fatLeaves,</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> depth)<span class="keyword"> const</span></div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="comment">// Gets a node and some of its children</span></div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// to a specified depth</span></div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> </div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> </div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keywordflow">while</span> (node &amp;&amp; node-&gt;isInner() &amp;&amp; (nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>() &lt; wanted.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>()))</div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> {</div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <span class="keywordtype">int</span> branch = <a class="code hl_function" href="namespacexrpl.html#a7e985cb507210c46de8574b5e3687b85">selectBranch</a>(nodeID, wanted.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a01fa14c8a16cab54332ad1f89a9c7b88">getNodeID</a>());</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> node = descendThrow(inner, branch);</div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> nodeID = nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">getChildNodeID</a>(branch);</div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> }</div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> </div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="keywordflow">if</span> (node == <span class="keyword">nullptr</span> || wanted != nodeID)</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> {</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot;peer requested node that is not in the map: &quot;</span> &lt;&lt; wanted &lt;&lt; <span class="stringliteral">&quot; but found &quot;</span> &lt;&lt; nodeID;</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> }</div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> </div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <span class="keywordflow">if</span> (node-&gt;isInner() &amp;&amp; <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node)-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapInnerNode.html#a3f4faa4cac57f0ebe267c4c8e6dac8f9">isEmpty</a>())</div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> {</div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;peer requests empty node&quot;</span>;</div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> }</div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> </div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;std::tuple&lt;SHAMapTreeNode*, SHAMapNodeID, int&gt;</a>&gt; stack;</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/emplace.html">emplace</a>(node, nodeID, depth);</div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> </div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <a class="code hl_class" href="classxrpl_1_1Serializer.html">Serializer</a> s(8192);</div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> </div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <span class="keywordflow">while</span> (!stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> {</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(node, nodeID, depth) = stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> </div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="comment">// Add this node to the reply</span></div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> s.<a class="code hl_function" href="classxrpl_1_1Serializer.html#a3b7908f846865ee59a2264243b478621">erase</a>();</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> node-&gt;serializeForWire(s);</div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> data.emplace_back(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(nodeID, s.<a class="code hl_function" href="classxrpl_1_1Serializer.html#ab848522b2fccfdc2bcb211aecc9a2671">getData</a>()));</div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> </div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> {</div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="comment">// We descend inner nodes with only a single child</span></div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// without decrementing the depth</span></div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <span class="keywordtype">int</span> bc = inner-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapInnerNode.html#a6de15ed7d4abc299b2499e37c2257fb6">getBranchCount</a>();</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> </div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="keywordflow">if</span> ((depth &gt; 0) || (bc == 1))</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> {</div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="comment">// We need to process this node&#39;s children</span></div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> {</div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="keywordflow">if</span> (!inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> {</div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="keyword">auto</span> <span class="keyword">const</span> childNode = descendThrow(inner, i);</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keyword">auto</span> <span class="keyword">const</span> childID = nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">getChildNodeID</a>(i);</div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> </div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <span class="keywordflow">if</span> (childNode-&gt;isInner() &amp;&amp; ((depth &gt; 1) || (bc == 1)))</div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> {</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="comment">// If there&#39;s more than one child, reduce the depth</span></div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <span class="comment">// If only one child, follow the chain</span></div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/emplace.html">emplace</a>(childNode, childID, (bc &gt; 1) ? (depth - 1) : depth);</div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> }</div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (childNode-&gt;isInner() || fatLeaves)</div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> {</div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// Just include this node</span></div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> s.<a class="code hl_function" href="classxrpl_1_1Serializer.html#a3b7908f846865ee59a2264243b478621">erase</a>();</div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> childNode-&gt;serializeForWire(s);</div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> data.emplace_back(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(childID, s.<a class="code hl_function" href="classxrpl_1_1Serializer.html#ab848522b2fccfdc2bcb211aecc9a2671">getData</a>()));</div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> }</div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> }</div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> }</div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> }</div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> }</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> }</div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> </div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span>}</div>
</div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> </div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00464" data-start="{" data-end="}">
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a7c37c5b031ed19779e1e0d3c6ede353e"> 464</a></span>SHAMap::serializeRoot(<a class="code hl_class" href="classxrpl_1_1Serializer.html">Serializer</a>&amp; s)<span class="keyword"> const</span></div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> root_-&gt;serializeForWire(s);</div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span>}</div>
</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> </div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span><a class="code hl_class" href="classxrpl_1_1SHAMapAddNode.html">SHAMapAddNode</a></div>
<div class="foldopen" id="foldopen00470" data-start="{" data-end="}">
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a7debf45e1d4f2f7ec10c44bbe43662c1"> 470</a></span>SHAMap::addRootNode(<a class="code hl_class" href="classxrpl_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; hash, <a class="code hl_class" href="classxrpl_1_1Slice.html">Slice</a> <span class="keyword">const</span>&amp; rootNode, <a class="code hl_class" href="classxrpl_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span>{</div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="comment">// we already have a root_ node</span></div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="keywordflow">if</span> (root_-&gt;getHash().isNonZero())</div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> {</div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;got root node, already have one&quot;</span>;</div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> XRPL_ASSERT(root_-&gt;getHash() == hash, <span class="stringliteral">&quot;xrpl::SHAMap::addRootNode : valid hash input&quot;</span>);</div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> }</div>
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> </div>
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> XRPL_ASSERT(cowid_ &gt;= 1, <span class="stringliteral">&quot;xrpl::SHAMap::addRootNode : valid cowid&quot;</span>);</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <span class="keyword">auto</span> node = SHAMapTreeNode::makeFromWire(rootNode);</div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="keywordflow">if</span> (!node || node-&gt;getHash() != hash)</div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> </div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="keywordflow">if</span> (backed_)</div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> canonicalize(hash, node);</div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> </div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> root_ = node;</div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> </div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="keywordflow">if</span> (root_-&gt;isLeaf())</div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> clearSynching();</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> </div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="keywordflow">if</span> (filter)</div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> {</div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <a class="code hl_class" href="classxrpl_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> root_-&gt;serializeWithPrefix(s);</div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> filter-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapSyncFilter.html#ab18df4c6bafa4ab1299a37adf0c28bc0">gotNode</a>(<span class="keyword">false</span>, root_-&gt;getHash(), ledgerSeq_, std::move(s.<a class="code hl_function" href="classxrpl_1_1Serializer.html#a338b6404dea8910c32ce93642eac6718">modData</a>()), root_-&gt;getType());</div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> }</div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> </div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span>}</div>
</div>
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> </div>
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span><a class="code hl_class" href="classxrpl_1_1SHAMapAddNode.html">SHAMapAddNode</a></div>
<div class="foldopen" id="foldopen00504" data-start="{" data-end="}">
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#adfb7755d40a66f5ee273652e12abbc68"> 504</a></span>SHAMap::addKnownNode(<a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; node, <a class="code hl_class" href="classxrpl_1_1Slice.html">Slice</a> <span class="keyword">const</span>&amp; rawNode, <a class="code hl_class" href="classxrpl_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</div>
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span>{</div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> XRPL_ASSERT(!node.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#aec3564de3829d1039344dcbdb5c30102">isRoot</a>(), <span class="stringliteral">&quot;xrpl::SHAMap::addKnownNode : valid node input&quot;</span>);</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> </div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> <span class="keywordflow">if</span> (!isSynching())</div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> {</div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;AddKnownNode while not synching&quot;</span>;</div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> }</div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> </div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="keyword">auto</span> <span class="keyword">const</span> generation = f_.getFullBelowCache()-&gt;getGeneration();</div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> currNodeID;</div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keyword">auto</span> currNode = root_.get();</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> </div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> <span class="keywordflow">while</span> (currNode-&gt;isInner() &amp;&amp; !<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(currNode)-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapInnerNode.html#a2c7a8e4965c601650272534756a993ac">isFullBelow</a>(generation) &amp;&amp;</div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> (currNodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>() &lt; node.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>()))</div>
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> {</div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> <span class="keywordtype">int</span> <span class="keyword">const</span> branch = <a class="code hl_function" href="namespacexrpl.html#a7e985cb507210c46de8574b5e3687b85">selectBranch</a>(currNodeID, node.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a01fa14c8a16cab54332ad1f89a9c7b88">getNodeID</a>());</div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> XRPL_ASSERT(branch &gt;= 0, <span class="stringliteral">&quot;xrpl::SHAMap::addKnownNode : valid branch&quot;</span>);</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(currNode);</div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> {</div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;Add known node for empty branch&quot;</span> &lt;&lt; node;</div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> }</div>
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> </div>
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <span class="keyword">auto</span> childHash = inner-&gt;getChildHash(branch);</div>
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="keywordflow">if</span> (f_.getFullBelowCache()-&gt;touch_if_exists(childHash.as_uint256()))</div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> {</div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> }</div>
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> </div>
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keyword">auto</span> prevNode = inner;</div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(currNode, currNodeID) = descend(inner, currNodeID, branch, filter);</div>
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> </div>
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <span class="keywordflow">if</span> (currNode != <span class="keyword">nullptr</span>)</div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> </div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> <span class="keyword">auto</span> newNode = SHAMapTreeNode::makeFromWire(rawNode);</div>
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> </div>
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> <span class="keywordflow">if</span> (!newNode || childHash != newNode-&gt;getHash())</div>
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> {</div>
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;Corrupt node received&quot;</span>;</div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> }</div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> </div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> <span class="comment">// In rare cases, a node can still be corrupt even after hash</span></div>
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <span class="comment">// validation. For leaf nodes, we perform an additional check to</span></div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> <span class="comment">// ensure the node&#39;s position in the tree is consistent with its</span></div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="comment">// content to prevent inconsistencies that could</span></div>
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> <span class="comment">// propagate further down the line.</span></div>
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> <span class="keywordflow">if</span> (newNode-&gt;isLeaf())</div>
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> {</div>
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; actualKey = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapLeafNode.html">SHAMapLeafNode</a> const*<span class="keyword">&gt;</span>(newNode.get())-&gt;peekItem()-&gt;key();</div>
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> </div>
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="comment">// Validate that this leaf belongs at the target position</span></div>
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> <span class="keyword">auto</span> <span class="keyword">const</span> expectedNodeID = SHAMapNodeID::createID(node.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>(), actualKey);</div>
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="keywordflow">if</span> (expectedNodeID.getNodeID() != node.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a01fa14c8a16cab54332ad1f89a9c7b88">getNodeID</a>())</div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> {</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;Leaf node position mismatch: &quot;</span></div>
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> &lt;&lt; <span class="stringliteral">&quot;expected=&quot;</span> &lt;&lt; expectedNodeID.getNodeID() &lt;&lt; <span class="stringliteral">&quot;, actual=&quot;</span> &lt;&lt; node.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a01fa14c8a16cab54332ad1f89a9c7b88">getNodeID</a>();</div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> }</div>
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> }</div>
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> </div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> <span class="comment">// Inner nodes must be at a level strictly less than 64</span></div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> <span class="comment">// but leaf nodes (while notionally at level 64) can be</span></div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="comment">// at any depth up to and including 64:</span></div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> <span class="keywordflow">if</span> ((currNodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>() &gt; leafDepth) || (newNode-&gt;isInner() &amp;&amp; currNodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>() == leafDepth))</div>
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> {</div>
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> <span class="comment">// Map is provably invalid</span></div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> state_ = SHAMapState::Invalid;</div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> }</div>
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> </div>
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> <span class="keywordflow">if</span> (currNodeID != node)</div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> {</div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> <span class="comment">// Either this node is broken or we didn&#39;t request it (yet)</span></div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;unable to hook node &quot;</span> &lt;&lt; node;</div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot; stuck at &quot;</span> &lt;&lt; currNodeID;</div>
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot;got depth=&quot;</span> &lt;&lt; node.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>() &lt;&lt; <span class="stringliteral">&quot;, walked to= &quot;</span> &lt;&lt; currNodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>();</div>
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> }</div>
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> </div>
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> <span class="keywordflow">if</span> (backed_)</div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> canonicalize(childHash, newNode);</div>
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> </div>
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> newNode = prevNode-&gt;canonicalizeChild(branch, std::move(newNode));</div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> </div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> <span class="keywordflow">if</span> (filter)</div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> {</div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> <a class="code hl_class" href="classxrpl_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> newNode-&gt;serializeWithPrefix(s);</div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> filter-&gt;<a class="code hl_function" href="classxrpl_1_1SHAMapSyncFilter.html#ab18df4c6bafa4ab1299a37adf0c28bc0">gotNode</a>(<span class="keyword">false</span>, childHash, ledgerSeq_, std::move(s.<a class="code hl_function" href="classxrpl_1_1Serializer.html#a338b6404dea8910c32ce93642eac6718">modData</a>()), newNode-&gt;getType());</div>
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> }</div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> </div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> }</div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> </div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;got node, already had it (late)&quot;</span>;</div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span>}</div>
</div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> </div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00608" data-start="{" data-end="}">
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a61e009c0c559342ac2682b605cb67fb3"> 608</a></span>SHAMap::deepCompare(<a class="code hl_class" href="classxrpl_1_1SHAMap.html">SHAMap</a>&amp; other)<span class="keyword"> const</span></div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> <span class="comment">// Intended for debug/test only</span></div>
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;std::pair&lt;SHAMapTreeNode*, SHAMapTreeNode*&gt;</a>&gt; stack;</div>
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> </div>
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({root_.get(), other.<a class="code hl_variable" href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">root_</a>.get()});</div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> </div>
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> <span class="keywordflow">while</span> (!stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> {</div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <span class="keyword">auto</span> <span class="keyword">const</span> [node, otherNode] = stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> </div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> <span class="keywordflow">if</span> (!node || !otherNode)</div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> {</div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot;unable to fetch node&quot;</span>;</div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> }</div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (otherNode-&gt;getHash() != node-&gt;getHash())</div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> {</div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;node hash mismatch&quot;</span>;</div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> }</div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> </div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="keywordflow">if</span> (node-&gt;isLeaf())</div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> {</div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <span class="keywordflow">if</span> (!otherNode-&gt;isLeaf())</div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> <span class="keyword">auto</span>&amp; nodePeek = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(node)-&gt;peekItem();</div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> <span class="keyword">auto</span>&amp; otherNodePeek = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode)-&gt;peekItem();</div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <span class="keywordflow">if</span> (nodePeek-&gt;key() != otherNodePeek-&gt;key())</div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> <span class="keywordflow">if</span> (nodePeek-&gt;slice() != otherNodePeek-&gt;slice())</div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> }</div>
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> {</div>
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> <span class="keywordflow">if</span> (!otherNode-&gt;isInner())</div>
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> <span class="keyword">auto</span> node_inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> <span class="keyword">auto</span> other_inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> {</div>
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> <span class="keywordflow">if</span> (node_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> {</div>
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> <span class="keywordflow">if</span> (!other_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> }</div>
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> {</div>
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> <span class="keywordflow">if</span> (other_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> </div>
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> <span class="keyword">auto</span> next = descend(node_inner, i);</div>
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="keyword">auto</span> otherNext = other.<a class="code hl_function" href="classxrpl_1_1SHAMap.html#a02f6e528a9a1446c38a8b252b5de88a4">descend</a>(other_inner, i);</div>
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> <span class="keywordflow">if</span> (!next || !otherNext)</div>
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> {</div>
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;unable to fetch inner node&quot;</span>;</div>
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> }</div>
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({next, otherNext});</div>
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> }</div>
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> }</div>
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> }</div>
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> }</div>
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> </div>
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span>}</div>
</div>
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> </div>
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00679" data-start="{" data-end="}">
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a5a435e741305244231c0e6645ef167c6"> 679</a></span>SHAMap::hasInnerNode(<a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; targetNodeID, <a class="code hl_class" href="classxrpl_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; targetNodeHash)<span class="keyword"> const</span></div>
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> </div>
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <span class="keywordflow">while</span> (node-&gt;isInner() &amp;&amp; (nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>() &lt; targetNodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">getDepth</a>()))</div>
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> {</div>
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> <span class="keywordtype">int</span> branch = <a class="code hl_function" href="namespacexrpl.html#a7e985cb507210c46de8574b5e3687b85">selectBranch</a>(nodeID, targetNodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a01fa14c8a16cab54332ad1f89a9c7b88">getNodeID</a>());</div>
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> </div>
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> node = descendThrow(inner, branch);</div>
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> nodeID = nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">getChildNodeID</a>(branch);</div>
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> }</div>
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> </div>
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <span class="keywordflow">return</span> (node-&gt;isInner()) &amp;&amp; (node-&gt;getHash() == targetNodeHash);</div>
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span>}</div>
</div>
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> </div>
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00701" data-start="{" data-end="}">
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#aa2870b69e7014aec13042fcd457adb67"> 701</a></span>SHAMap::hasLeafNode(<a class="code hl_class" href="classxrpl_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; tag, <a class="code hl_class" href="classxrpl_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; targetNodeHash)<span class="keyword"> const</span></div>
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> <a class="code hl_class" href="classxrpl_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> </div>
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> <span class="keywordflow">if</span> (!node-&gt;isInner()) <span class="comment">// only one leaf node in the tree</span></div>
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> <span class="keywordflow">return</span> node-&gt;getHash() == targetNodeHash;</div>
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> </div>
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> <span class="keywordflow">do</span></div>
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> {</div>
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <span class="keywordtype">int</span> branch = <a class="code hl_function" href="namespacexrpl.html#a7e985cb507210c46de8574b5e3687b85">selectBranch</a>(nodeID, tag);</div>
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// Dead end, node must not be here</span></div>
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> </div>
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> <span class="keywordflow">if</span> (inner-&gt;getChildHash(branch) == targetNodeHash) <span class="comment">// Matching leaf, no need to retrieve it</span></div>
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> </div>
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> node = descendThrow(inner, branch);</div>
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> nodeID = nodeID.<a class="code hl_function" href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">getChildNodeID</a>(branch);</div>
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> } <span class="keywordflow">while</span> (node-&gt;isInner());</div>
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> </div>
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// If this was a matching leaf, we would have caught it</span></div>
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> <span class="comment">// already</span></div>
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span>}</div>
</div>
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> </div>
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span><a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/optional.html">std::optional&lt;std::vector&lt;Blob&gt;</a>&gt;</div>
<div class="foldopen" id="foldopen00728" data-start="{" data-end="}">
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a1a1b6a877f325a6ae08686ed2b0e0d76"> 728</a></span>SHAMap::getProofPath(<a class="code hl_class" href="classxrpl_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; key)<span class="keyword"> const</span></div>
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">SharedPtrNodeStack</a> stack;</div>
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> walkTowardsKey(key, &amp;stack);</div>
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> </div>
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> <span class="keywordflow">if</span> (stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> {</div>
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> }</div>
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> </div>
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> <span class="keywordflow">if</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; node = stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>().<a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">first</a>;</div>
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> !node || node-&gt;isInner() || intr_ptr::static_pointer_cast&lt;SHAMapLeafNode&gt;(node)-&gt;peekItem()-&gt;key() != key)</div>
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> {</div>
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> }</div>
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> </div>
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Blob&gt;</a> path;</div>
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/size.html">size</a>());</div>
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> <span class="keywordflow">while</span> (!stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> {</div>
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> <a class="code hl_class" href="classxrpl_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>().<a class="code hl_variableRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">first</a>-&gt;serializeForWire(s);</div>
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(std::move(s.<a class="code hl_function" href="classxrpl_1_1Serializer.html#a338b6404dea8910c32ce93642eac6718">modData</a>()));</div>
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> }</div>
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> </div>
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;getPath for key &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot;, path length &quot;</span> &lt;&lt; path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <span class="keywordflow">return</span> path;</div>
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span>}</div>
</div>
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> </div>
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00761" data-start="{" data-end="}">
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"><a class="line" href="classxrpl_1_1SHAMap.html#a0ce0f1b944a3358163deb469e8ee4cb4"> 761</a></span>SHAMap::verifyProofPath(<a class="code hl_class" href="classxrpl_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; rootHash, <a class="code hl_class" href="classxrpl_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; key, <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Blob&gt;</a> <span class="keyword">const</span>&amp; path)</div>
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span>{</div>
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> <span class="keywordflow">if</span> (path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>() || path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &gt; 65)</div>
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> </div>
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> <a class="code hl_class" href="classxrpl_1_1SHAMapHash.html">SHAMapHash</a> hash{rootHash};</div>
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> <span class="keywordflow">try</span></div>
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> {</div>
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> rit = path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/rbegin.html">rbegin</a>(); rit != path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/rend.html">rend</a>(); ++rit)</div>
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> {</div>
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; blob = *rit;</div>
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">auto</span> node = SHAMapTreeNode::makeFromWire(<a class="code hl_function" href="namespacexrpl.html#ade06aea604ced5ef1fd3c94ab573b646">makeSlice</a>(blob));</div>
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> <span class="keywordflow">if</span> (!node)</div>
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> node-&gt;updateHash();</div>
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> <span class="keywordflow">if</span> (node-&gt;getHash() != hash)</div>
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> </div>
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> <span class="keyword">auto</span> depth = <a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/rbegin.html">rbegin</a>(), rit);</div>
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> {</div>
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> <span class="keyword">auto</span> nodeId = SHAMapNodeID::createID(depth, key);</div>
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> hash = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classxrpl_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node.get())-&gt;getChildHash(<a class="code hl_function" href="namespacexrpl.html#a7e985cb507210c46de8574b5e3687b85">selectBranch</a>(nodeId, key));</div>
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> }</div>
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> {</div>
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> <span class="comment">// should exhaust all the blobs now</span></div>
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> <span class="keywordflow">return</span> depth + 1 == path.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> }</div>
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> }</div>
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> }</div>
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> <span class="keywordflow">catch</span> (<a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/error/exception.html">std::exception</a> <span class="keyword">const</span>&amp;)</div>
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> {</div>
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> <span class="comment">// the data in the path may come from the network,</span></div>
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> <span class="comment">// exception could be thrown when parsing the data</span></div>
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> }</div>
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span>}</div>
</div>
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> </div>
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span>} <span class="comment">// namespace xrpl</span></div>
<div class="ttc" id="aclassxrpl_1_1Family_html_adf51da6d90e28abd47f917536b23c537"><div class="ttname"><a href="classxrpl_1_1Family.html#adf51da6d90e28abd47f917536b23c537">xrpl::Family::getFullBelowCache</a></div><div class="ttdeci">virtual std::shared_ptr&lt; FullBelowCache &gt; getFullBelowCache()=0</div><div class="ttdoc">Return a pointer to the Family Full Below Cache.</div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapAddNode_html"><div class="ttname"><a href="classxrpl_1_1SHAMapAddNode.html">xrpl::SHAMapAddNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapAddNode_8h_source.html#l00009">SHAMapAddNode.h:10</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapHash_html"><div class="ttname"><a href="classxrpl_1_1SHAMapHash.html">xrpl::SHAMapHash</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapHash_8h_source.html#l00014">SHAMapHash.h:15</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapInnerNode_html"><div class="ttname"><a href="classxrpl_1_1SHAMapInnerNode.html">xrpl::SHAMapInnerNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00015">SHAMapInnerNode.h:16</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapInnerNode_html_a2c7a8e4965c601650272534756a993ac"><div class="ttname"><a href="classxrpl_1_1SHAMapInnerNode.html#a2c7a8e4965c601650272534756a993ac">xrpl::SHAMapInnerNode::isFullBelow</a></div><div class="ttdeci">bool isFullBelow(std::uint32_t generation) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00191">SHAMapInnerNode.h:191</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapInnerNode_html_a3f4faa4cac57f0ebe267c4c8e6dac8f9"><div class="ttname"><a href="classxrpl_1_1SHAMapInnerNode.html#a3f4faa4cac57f0ebe267c4c8e6dac8f9">xrpl::SHAMapInnerNode::isEmpty</a></div><div class="ttdeci">bool isEmpty() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00173">SHAMapInnerNode.h:173</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapInnerNode_html_a4738160a51edf90c206b948c6d19da79"><div class="ttname"><a href="classxrpl_1_1SHAMapInnerNode.html#a4738160a51edf90c206b948c6d19da79">xrpl::SHAMapInnerNode::getChildHash</a></div><div class="ttdeci">SHAMapHash const &amp; getChildHash(int m) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8cpp_source.html#l00316">SHAMapInnerNode.cpp:316</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapInnerNode_html_a6de15ed7d4abc299b2499e37c2257fb6"><div class="ttname"><a href="classxrpl_1_1SHAMapInnerNode.html#a6de15ed7d4abc299b2499e37c2257fb6">xrpl::SHAMapInnerNode::getBranchCount</a></div><div class="ttdeci">int getBranchCount() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00185">SHAMapInnerNode.h:185</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapInnerNode_html_afee06ff7efb7862b5463d4e752027958"><div class="ttname"><a href="classxrpl_1_1SHAMapInnerNode.html#afee06ff7efb7862b5463d4e752027958">xrpl::SHAMapInnerNode::isEmptyBranch</a></div><div class="ttdeci">bool isEmptyBranch(int m) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00179">SHAMapInnerNode.h:179</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapLeafNode_html"><div class="ttname"><a href="classxrpl_1_1SHAMapLeafNode.html">xrpl::SHAMapLeafNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapLeafNode_8h_source.html#l00011">SHAMapLeafNode.h:12</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapLeafNode_html_ad4443852b178a711d40c14f2267e475f"><div class="ttname"><a href="classxrpl_1_1SHAMapLeafNode.html#ad4443852b178a711d40c14f2267e475f">xrpl::SHAMapLeafNode::peekItem</a></div><div class="ttdeci">boost::intrusive_ptr&lt; SHAMapItem const &gt; const &amp; peekItem() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapLeafNode_8cpp_source.html#l00025">SHAMapLeafNode.cpp:25</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapNodeID_html"><div class="ttname"><a href="classxrpl_1_1SHAMapNodeID.html">xrpl::SHAMapNodeID</a></div><div class="ttdoc">Identifies a node inside a SHAMap.</div><div class="ttdef"><b>Definition</b> <a href="SHAMapNodeID_8h_source.html#l00014">SHAMapNodeID.h:15</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapNodeID_html_a01fa14c8a16cab54332ad1f89a9c7b88"><div class="ttname"><a href="classxrpl_1_1SHAMapNodeID.html#a01fa14c8a16cab54332ad1f89a9c7b88">xrpl::SHAMapNodeID::getNodeID</a></div><div class="ttdeci">uint256 const &amp; getNodeID() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapNodeID_8h_source.html#l00045">SHAMapNodeID.h:45</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapNodeID_html_a284639381be220933751275b56c2e532"><div class="ttname"><a href="classxrpl_1_1SHAMapNodeID.html#a284639381be220933751275b56c2e532">xrpl::SHAMapNodeID::getChildNodeID</a></div><div class="ttdeci">SHAMapNodeID getChildNodeID(unsigned int m) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapNodeID_8cpp_source.html#l00053">SHAMapNodeID.cpp:53</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapNodeID_html_a9acf485681f4b15e166825cfba0a0ac7"><div class="ttname"><a href="classxrpl_1_1SHAMapNodeID.html#a9acf485681f4b15e166825cfba0a0ac7">xrpl::SHAMapNodeID::getDepth</a></div><div class="ttdeci">unsigned int getDepth() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapNodeID_8h_source.html#l00039">SHAMapNodeID.h:39</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapNodeID_html_aec3564de3829d1039344dcbdb5c30102"><div class="ttname"><a href="classxrpl_1_1SHAMapNodeID.html#aec3564de3829d1039344dcbdb5c30102">xrpl::SHAMapNodeID::isRoot</a></div><div class="ttdeci">bool isRoot() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapNodeID_8h_source.html#l00029">SHAMapNodeID.h:29</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapSyncFilter_html"><div class="ttname"><a href="classxrpl_1_1SHAMapSyncFilter.html">xrpl::SHAMapSyncFilter</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapSyncFilter_8h_source.html#l00011">SHAMapSyncFilter.h:12</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapSyncFilter_html_ab18df4c6bafa4ab1299a37adf0c28bc0"><div class="ttname"><a href="classxrpl_1_1SHAMapSyncFilter.html#ab18df4c6bafa4ab1299a37adf0c28bc0">xrpl::SHAMapSyncFilter::gotNode</a></div><div class="ttdeci">virtual void gotNode(bool fromFilter, SHAMapHash const &amp;nodeHash, std::uint32_t ledgerSeq, Blob &amp;&amp;nodeData, SHAMapNodeType type) const =0</div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapTreeNode_html"><div class="ttname"><a href="classxrpl_1_1SHAMapTreeNode.html">xrpl::SHAMapTreeNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapTreeNode_8h_source.html#l00031">SHAMapTreeNode.h:32</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMapTreeNode_html_a93d8db911ff2d7039a2062e29044b953"><div class="ttname"><a href="classxrpl_1_1SHAMapTreeNode.html#a93d8db911ff2d7039a2062e29044b953">xrpl::SHAMapTreeNode::isInner</a></div><div class="ttdeci">virtual bool isInner() const =0</div><div class="ttdoc">Determines if this is an inner node.</div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html"><div class="ttname"><a href="classxrpl_1_1SHAMap.html">xrpl::SHAMap</a></div><div class="ttdoc">A SHAMap is both a radix tree with a fan-out of 16 and a Merkle tree.</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00077">SHAMap.h:78</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a02f6e528a9a1446c38a8b252b5de88a4"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a02f6e528a9a1446c38a8b252b5de88a4">xrpl::SHAMap::descend</a></div><div class="ttdeci">SHAMapTreeNode * descend(SHAMapInnerNode *, int branch) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00269">SHAMap.cpp:269</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a20d520cb79eeaf502edc67b7fd749b40"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a20d520cb79eeaf502edc67b7fd749b40">xrpl::SHAMap::descendAsync</a></div><div class="ttdeci">SHAMapTreeNode * descendAsync(SHAMapInnerNode *parent, int branch, SHAMapSyncFilter *filter, bool &amp;pending, descendCallback &amp;&amp;) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00334">SHAMap.cpp:334</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a28ad752ef558a0e15853521c5782529b"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a28ad752ef558a0e15853521c5782529b">xrpl::SHAMap::f_</a></div><div class="ttdeci">Family &amp; f_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00080">SHAMap.h:80</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a2d82da83b63cf3cfed3e854eac5f9c8a"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a2d82da83b63cf3cfed3e854eac5f9c8a">xrpl::SHAMap::peekItem</a></div><div class="ttdeci">boost::intrusive_ptr&lt; SHAMapItem const &gt; const &amp; peekItem(uint256 const &amp;id) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00534">SHAMap.cpp:534</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a3d2393c957f8c1df98b9c6f2dc14e4c2"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a3d2393c957f8c1df98b9c6f2dc14e4c2">xrpl::SHAMap::visitDifferences</a></div><div class="ttdeci">void visitDifferences(SHAMap const *have, std::function&lt; bool(SHAMapTreeNode const &amp;)&gt; const &amp;) const</div><div class="ttdoc">Visit every node in this SHAMap that is not present in the specified SHAMap.</div><div class="ttdef"><b>Definition</b> <a href="SHAMapSync_8cpp_source.html#l00079">SHAMapSync.cpp:79</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a5a435e741305244231c0e6645ef167c6"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a5a435e741305244231c0e6645ef167c6">xrpl::SHAMap::hasInnerNode</a></div><div class="ttdeci">bool hasInnerNode(SHAMapNodeID const &amp;nodeID, SHAMapHash const &amp;hash) const</div><div class="ttdoc">Does this map have this inner node?</div><div class="ttdef"><b>Definition</b> <a href="SHAMapSync_8cpp_source.html#l00679">SHAMapSync.cpp:679</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a6ffb9b31ce3735954a1a6d9708282670"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a6ffb9b31ce3735954a1a6d9708282670">xrpl::SHAMap::gmn_ProcessNodes</a></div><div class="ttdeci">void gmn_ProcessNodes(MissingNodes &amp;, MissingNodes::StackEntry &amp;node)</div><div class="ttdef"><b>Definition</b> <a href="SHAMapSync_8cpp_source.html#l00143">SHAMapSync.cpp:143</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a82196cdec47759dedf4cf2b47fe648a2"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a82196cdec47759dedf4cf2b47fe648a2">xrpl::SHAMap::backed_</a></div><div class="ttdeci">bool backed_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00092">SHAMap.h:92</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_a8e42b528b1da5c330135ef3f8317b744"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#a8e42b528b1da5c330135ef3f8317b744">xrpl::SHAMap::visitLeaves</a></div><div class="ttdeci">void visitLeaves(std::function&lt; void(boost::intrusive_ptr&lt; SHAMapItem const &gt; const &amp;)&gt; const &amp;) const</div><div class="ttdoc">Visit every leaf node in this SHAMap.</div><div class="ttdef"><b>Definition</b> <a href="SHAMapSync_8cpp_source.html#l00009">SHAMapSync.cpp:9</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_aa2870b69e7014aec13042fcd457adb67"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#aa2870b69e7014aec13042fcd457adb67">xrpl::SHAMap::hasLeafNode</a></div><div class="ttdeci">bool hasLeafNode(uint256 const &amp;tag, SHAMapHash const &amp;hash) const</div><div class="ttdoc">Does this map have this leaf node?</div><div class="ttdef"><b>Definition</b> <a href="SHAMapSync_8cpp_source.html#l00701">SHAMapSync.cpp:701</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_ad1c975472f811fd67098c7088f1626d6"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#ad1c975472f811fd67098c7088f1626d6">xrpl::SHAMap::descendNoStore</a></div><div class="ttdeci">intr_ptr::SharedPtr&lt; SHAMapTreeNode &gt; descendNoStore(SHAMapInnerNode &amp;, int branch) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00301">SHAMap.cpp:301</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_ae77b2bfe9265c7f23e0183052d160555"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#ae77b2bfe9265c7f23e0183052d160555">xrpl::SHAMap::visitNodes</a></div><div class="ttdeci">void visitNodes(std::function&lt; bool(SHAMapTreeNode &amp;)&gt; const &amp;function) const</div><div class="ttdoc">Visit every node in this SHAMap.</div><div class="ttdef"><b>Definition</b> <a href="SHAMapSync_8cpp_source.html#l00019">SHAMapSync.cpp:19</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_aecc016f73624ae0984cb81df5ffb7f31"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#aecc016f73624ae0984cb81df5ffb7f31">xrpl::SHAMap::descendThrow</a></div><div class="ttdeci">SHAMapTreeNode * descendThrow(SHAMapInnerNode *, int branch) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00247">SHAMap.cpp:247</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SHAMap_html_aed59b9eeacde088b490c7bc9cedb7e44"><div class="ttname"><a href="classxrpl_1_1SHAMap.html#aed59b9eeacde088b490c7bc9cedb7e44">xrpl::SHAMap::root_</a></div><div class="ttdeci">intr_ptr::SharedPtr&lt; SHAMapTreeNode &gt; root_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00089">SHAMap.h:89</a></div></div>
<div class="ttc" id="aclassxrpl_1_1Serializer_html"><div class="ttname"><a href="classxrpl_1_1Serializer.html">xrpl::Serializer</a></div><div class="ttdef"><b>Definition</b> <a href="Serializer_8h_source.html#l00021">Serializer.h:22</a></div></div>
<div class="ttc" id="aclassxrpl_1_1Serializer_html_a338b6404dea8910c32ce93642eac6718"><div class="ttname"><a href="classxrpl_1_1Serializer.html#a338b6404dea8910c32ce93642eac6718">xrpl::Serializer::modData</a></div><div class="ttdeci">Blob &amp; modData()</div><div class="ttdef"><b>Definition</b> <a href="Serializer_8h_source.html#l00187">Serializer.h:187</a></div></div>
<div class="ttc" id="aclassxrpl_1_1Serializer_html_a3b7908f846865ee59a2264243b478621"><div class="ttname"><a href="classxrpl_1_1Serializer.html#a3b7908f846865ee59a2264243b478621">xrpl::Serializer::erase</a></div><div class="ttdeci">void erase()</div><div class="ttdef"><b>Definition</b> <a href="Serializer_8h_source.html#l00218">Serializer.h:218</a></div></div>
<div class="ttc" id="aclassxrpl_1_1Serializer_html_ab848522b2fccfdc2bcb211aecc9a2671"><div class="ttname"><a href="classxrpl_1_1Serializer.html#ab848522b2fccfdc2bcb211aecc9a2671">xrpl::Serializer::getData</a></div><div class="ttdeci">Blob getData() const</div><div class="ttdef"><b>Definition</b> <a href="Serializer_8h_source.html#l00182">Serializer.h:182</a></div></div>
<div class="ttc" id="aclassxrpl_1_1SharedIntrusive_html"><div class="ttname"><a href="classxrpl_1_1SharedIntrusive.html">xrpl::SharedIntrusive</a></div><div class="ttdoc">A shared intrusive pointer class that supports weak pointers.</div><div class="ttdef"><b>Definition</b> <a href="IntrusivePointer_8h_source.html#l00068">IntrusivePointer.h:69</a></div></div>
<div class="ttc" id="aclassxrpl_1_1Slice_html"><div class="ttname"><a href="classxrpl_1_1Slice.html">xrpl::Slice</a></div><div class="ttdoc">An immutable linear range of bytes.</div><div class="ttdef"><b>Definition</b> <a href="Slice_8h_source.html#l00026">Slice.h:27</a></div></div>
<div class="ttc" id="aclassxrpl_1_1base__uint_html"><div class="ttname"><a href="classxrpl_1_1base__uint.html">xrpl::base_uint&lt; 256 &gt;</a></div></div>
<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</div></div>
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/emplace.html">std::stack::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/empty.html">std::stack::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="aexception_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception.html">std::exception</a></div></div>
<div class="ttc" id="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div>
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></div></div>
<div class="ttc" id="ais_same_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_same.html">std::is_same_v</a></div><div class="ttdeci">T is_same_v</div></div>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
<div class="ttc" id="amake_tuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a></div><div class="ttdeci">T make_tuple(T... args)</div></div>
<div class="ttc" id="anamespacexrpl_html"><div class="ttname"><a href="namespacexrpl.html">xrpl</a></div><div class="ttdoc">Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.</div><div class="ttdef"><b>Definition</b> <a href="algorithm_8h_source.html#l00006">algorithm.h:6</a></div></div>
<div class="ttc" id="anamespacexrpl_html_a46feb2a3d6afe415003984673a6a8648a7c6c2e5d48ab37a007cbf70d3ea25fa4"><div class="ttname"><a href="namespacexrpl.html#a46feb2a3d6afe415003984673a6a8648a7c6c2e5d48ab37a007cbf70d3ea25fa4">xrpl::ListDisposition::pending</a></div><div class="ttdeci">@ pending</div><div class="ttdoc">List will be valid in the future.</div></div>
<div class="ttc" id="anamespacexrpl_html_a5d82510b4e4c4daeab7f65d5c8805702"><div class="ttname"><a href="namespacexrpl.html#a5d82510b4e4c4daeab7f65d5c8805702">xrpl::rand_int</a></div><div class="ttdeci">std::enable_if_t&lt; std::is_integral&lt; Integral &gt;::value, Integral &gt; rand_int()</div><div class="ttdef"><b>Definition</b> <a href="include_2xrpl_2basics_2random_8h_source.html#l00133">include/xrpl/basics/random.h:133</a></div></div>
<div class="ttc" id="anamespacexrpl_html_a7e985cb507210c46de8574b5e3687b85"><div class="ttname"><a href="namespacexrpl.html#a7e985cb507210c46de8574b5e3687b85">xrpl::selectBranch</a></div><div class="ttdeci">unsigned int selectBranch(SHAMapNodeID const &amp;id, uint256 const &amp;hash)</div><div class="ttdoc">Returns the branch that would contain the given hash.</div><div class="ttdef"><b>Definition</b> <a href="SHAMapNodeID_8cpp_source.html#l00099">SHAMapNodeID.cpp:99</a></div></div>
<div class="ttc" id="anamespacexrpl_html_ac599741e6d4066bada11df4c7e8ad30aad9a09590da318a86ba2bd64b374c2d77"><div class="ttname"><a href="namespacexrpl.html#ac599741e6d4066bada11df4c7e8ad30aad9a09590da318a86ba2bd64b374c2d77">xrpl::HashPrefix::innerNode</a></div><div class="ttdeci">@ innerNode</div><div class="ttdoc">inner node in V1 tree</div></div>
<div class="ttc" id="anamespacexrpl_html_ac7c4d7a762799eea33eb4e94e8132392"><div class="ttname"><a href="namespacexrpl.html#ac7c4d7a762799eea33eb4e94e8132392">xrpl::rand_int</a></div><div class="ttdeci">std::enable_if_t&lt; std::is_integral&lt; Integral &gt;::value &amp;&amp;detail::is_engine&lt; Engine &gt;::value, Integral &gt; rand_int(Engine &amp;engine, Integral min, Integral max)</div><div class="ttdoc">Return a uniformly distributed random integer.</div><div class="ttdef"><b>Definition</b> <a href="include_2xrpl_2basics_2random_8h_source.html#l00093">include/xrpl/basics/random.h:93</a></div></div>
<div class="ttc" id="anamespacexrpl_html_ade06aea604ced5ef1fd3c94ab573b646"><div class="ttname"><a href="namespacexrpl.html#ade06aea604ced5ef1fd3c94ab573b646">xrpl::makeSlice</a></div><div class="ttdeci">std::enable_if_t&lt; std::is_same&lt; T, char &gt;::value||std::is_same&lt; T, unsigned char &gt;::value, Slice &gt; makeSlice(std::array&lt; T, N &gt; const &amp;a)</div><div class="ttdef"><b>Definition</b> <a href="Slice_8h_source.html#l00214">Slice.h:214</a></div></div>
<div class="ttc" id="anotify_one_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html">std::condition_variable::notify_one</a></div><div class="ttdeci">T notify_one(T... args)</div></div>
<div class="ttc" id="aoptional_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/optional.html">std::optional</a></div></div>
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/pop.html">std::stack::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/push.html">std::stack::push</a></div><div class="ttdeci">T push(T... args)</div></div>
<div class="ttc" id="arbegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/rbegin.html">std::vector::rbegin</a></div><div class="ttdeci">T rbegin(T... args)</div></div>
<div class="ttc" id="arend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/rend.html">std::vector::rend</a></div><div class="ttdeci">T rend(T... args)</div></div>
<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/size.html">std::stack::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html">xrpl::SHAMap::MissingNodes</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00444">SHAMap.h:445</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a1183af239d5703bfc4c7d78942b16fb9"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a1183af239d5703bfc4c7d78942b16fb9">xrpl::SHAMap::MissingNodes::deferred_</a></div><div class="ttdeci">int deferred_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00483">SHAMap.h:483</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a2053ebe5b21d9060ca3618039f0dd8a3"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a2053ebe5b21d9060ca3618039f0dd8a3">xrpl::SHAMap::MissingNodes::deferCondVar_</a></div><div class="ttdeci">std::condition_variable deferCondVar_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00485">SHAMap.h:485</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a25ab03f046237635510a3875f4d268bc"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a25ab03f046237635510a3875f4d268bc">xrpl::SHAMap::MissingNodes::resumes_</a></div><div class="ttdeci">std::map&lt; SHAMapInnerNode *, SHAMapNodeID &gt; resumes_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00490">SHAMap.h:490</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a32a19042bfe8e4d982b9a498394730a7"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a32a19042bfe8e4d982b9a498394730a7">xrpl::SHAMap::MissingNodes::max_</a></div><div class="ttdeci">int max_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00452">SHAMap.h:452</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a4131606c3642599cfde7249aaa3c8e3c"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a4131606c3642599cfde7249aaa3c8e3c">xrpl::SHAMap::MissingNodes::deferLock_</a></div><div class="ttdeci">std::mutex deferLock_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00484">SHAMap.h:484</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a44cd711639cd7e61604dce1c8cc98200"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a44cd711639cd7e61604dce1c8cc98200">xrpl::SHAMap::MissingNodes::finishedReads_</a></div><div class="ttdeci">std::vector&lt; DeferredNode &gt; finishedReads_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00486">SHAMap.h:486</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a57565a4d0be35b7c3f0bdde9e72f9547"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a57565a4d0be35b7c3f0bdde9e72f9547">xrpl::SHAMap::MissingNodes::maxDefer_</a></div><div class="ttdeci">int const maxDefer_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00454">SHAMap.h:454</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a628459fdb83572eb82989495229c6ea3"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a628459fdb83572eb82989495229c6ea3">xrpl::SHAMap::MissingNodes::missingHashes_</a></div><div class="ttdeci">std::set&lt; SHAMapHash &gt; missingHashes_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00459">SHAMap.h:459</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a771de7b91dd6a6d13de3fb82e34bbbde"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a771de7b91dd6a6d13de3fb82e34bbbde">xrpl::SHAMap::MissingNodes::missingNodes_</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; SHAMapNodeID, uint256 &gt; &gt; missingNodes_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00458">SHAMap.h:458</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a8f679243ac44f91d15c74093d89a1eae"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a8f679243ac44f91d15c74093d89a1eae">xrpl::SHAMap::MissingNodes::stack_</a></div><div class="ttdeci">std::stack&lt; StackEntry, std::deque&lt; StackEntry &gt; &gt; stack_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00474">SHAMap.h:474</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_a9d3008bf85f494c902b7e510438dee03"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#a9d3008bf85f494c902b7e510438dee03">xrpl::SHAMap::MissingNodes::filter_</a></div><div class="ttdeci">SHAMapSyncFilter * filter_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00453">SHAMap.h:453</a></div></div>
<div class="ttc" id="astructxrpl_1_1SHAMap_1_1MissingNodes_html_aa19ca834836b5ce90ac5cf9dc8c34e5d"><div class="ttname"><a href="structxrpl_1_1SHAMap_1_1MissingNodes.html#aa19ca834836b5ce90ac5cf9dc8c34e5d">xrpl::SHAMap::MissingNodes::generation_</a></div><div class="ttdeci">std::uint32_t generation_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00455">SHAMap.h:455</a></div></div>
<div class="ttc" id="atie_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a></div><div class="ttdeci">T tie(T... args)</div></div>
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
<div class="ttc" id="atuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a></div></div>
<div class="ttc" id="aunique_lock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/unique_lock.html">std::unique_lock</a></div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
<div class="ttc" id="await_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html">std::condition_variable::wait</a></div><div class="ttdeci">T wait(T... args)</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8
</small></address>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink