ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-21 03:26:01 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
gh-pages
rippled/SHAMapSync_8cpp_source.html
bthomee 33451fdc96 deploy: 1d42c4f6de
2025-11-04 00:36:48 -08:00

1084 lines
180 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="namespaceripple.html">ripple</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="classripple_1_1SHAMap.html#adb6fc2f28765c0df0c93065d52a3a988"> 9</a></span><a class="code hl_function" href="classripple_1_1SHAMap.html#adb6fc2f28765c0df0c93065d52a3a988">SHAMap::visitLeaves</a>(</div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span> <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;</div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span> item)&gt; <span class="keyword">const</span>&amp; leafFunction)<span class="keyword"> const</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> <a class="code hl_function" href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4">visitNodes</a>([&amp;leafFunction](<a class="code hl_class" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>&amp; node) {</div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span> <span class="keywordflow">if</span> (!node.<a class="code hl_function" href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">isInner</a>())</div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> leafFunction(<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>&amp;<span class="keyword">&gt;</span>(node).<a class="code hl_function" href="classripple_1_1SHAMap.html#a381ecaa70bcce3f24bac35b7fed16985">peekItem</a>());</div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>}</div>
</div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00021" data-start="{" data-end="}">
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4"> 21</a></span><a class="code hl_function" href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4">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="classripple_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="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>)</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> <span class="keywordflow">return</span>;</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> function(*<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>);</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>-&gt;isInner())</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> </div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</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="l00032" name="l00032"></a><span class="lineno"> 32</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="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">auto</span> node = intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>);</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordtype">int</span> pos = 0;</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> (<span class="keyword">true</span>)</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">while</span> (pos &lt; 16)</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> <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(pos))</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> {</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_class" href="classripple_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a> child =</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_function" href="classripple_1_1SHAMap.html#ac5fd4779ce479a1a40f23e738c1a026d">descendNoStore</a>(*node, pos);</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">if</span> (!function(*child))</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">if</span> (child-&gt;isLeaf())</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> ++pos;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// If there are no more children, don&#39;t push this node</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keywordflow">while</span> ((pos != 15) &amp;&amp; (node-&gt;isEmptyBranch(pos + 1)))</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> ++pos;</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">if</span> (pos != 15)</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> <span class="comment">// save next position to resume at</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</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="l00060" name="l00060"></a><span class="lineno"> 60</span> }</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// descend to the child&#39;s first position</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> node =</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(child);</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> pos = 0;</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</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> <span class="keywordflow">else</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> ++pos; <span class="comment">// move to next position</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</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> </div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</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="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</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="l00078" name="l00078"></a><span class="lineno"> 78</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="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>}</div>
</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#adb124506e012e85f807355a5a58c0ce7"> 83</a></span><a class="code hl_function" href="classripple_1_1SHAMap.html#adb124506e012e85f807355a5a58c0ce7">SHAMap::visitDifferences</a>(</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <a class="code hl_class" href="classripple_1_1SHAMap.html">SHAMap</a> <span class="keyword">const</span>* have,</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <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="classripple_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="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// Visit every node in this SHAMap that is not present</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// in the specified SHAMap</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>)</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="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>-&gt;getHash().isZero())</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">if</span> (have &amp;&amp; (<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>-&gt;getHash() == have-&gt;<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>-&gt;getHash()))</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>-&gt;isLeaf())</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> {</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">auto</span> leaf = intr_ptr::static_pointer_cast&lt;SHAMapLeafNode&gt;(<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>);</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">if</span> (!have ||</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> !have-&gt;<a class="code hl_function" href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e">hasLeafNode</a>(leaf-&gt;peekItem()-&gt;key(), leaf-&gt;getHash()))</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> function(*<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>);</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> }</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// contains unexplored non-matching inner node entries</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</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="l00108" name="l00108"></a><span class="lineno"> 108</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="l00109" name="l00109"></a><span class="lineno"> 109</span> </div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</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="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>.get()), <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>{}});</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> </div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</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="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="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="l00115" name="l00115"></a><span class="lineno"> 115</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="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="comment">// 1) Add this node to the pack</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">if</span> (!function(*node))</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// 2) push non-matching child inner nodes</span></div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> {</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> {</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; childHash = node-&gt;getChildHash(i);</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> childID = nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(i);</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keyword">auto</span> next = <a class="code hl_function" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(node, i);</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> (next-&gt;isInner())</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> {</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">if</span> (!have || !have-&gt;<a class="code hl_function" href="classripple_1_1SHAMap.html#a8a20e910f929701bee2a43d408dd7afa">hasInnerNode</a>(childID, childHash))</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> {<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(next), childID});</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> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> !have ||</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> !have-&gt;<a class="code hl_function" href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e">hasLeafNode</a>(</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(next)-&gt;<a class="code hl_function" href="classripple_1_1SHAMapLeafNode.html#afee48bd94530b5ad6dfe4a403d8455c4">peekItem</a>()-&gt;key(),</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> childHash))</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> {</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordflow">if</span> (!function(*next))</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keywordflow">return</span>;</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> }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> }</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span>}</div>
</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> </div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="comment">// Starting at the position referred to by the specfied</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment">// StackEntry, process that node and its first resident</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span><span class="comment">// children, descending the SHAMap until we complete the</span></div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span><span class="comment">// processing of a node.</span></div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a241e6dd6c3be3fd11429a39c6e54111d"> 155</a></span><a class="code hl_function" href="classripple_1_1SHAMap.html#a241e6dd6c3be3fd11429a39c6e54111d">SHAMap::gmn_ProcessNodes</a>(<a class="code hl_struct" href="structripple_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="l00156" name="l00156"></a><span class="lineno"> 156</span>{</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_class" href="classripple_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="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_class" href="classripple_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="l00159" name="l00159"></a><span class="lineno"> 159</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="l00160" name="l00160"></a><span class="lineno"> 160</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="l00161" name="l00161"></a><span class="lineno"> 161</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="l00162" name="l00162"></a><span class="lineno"> 162</span> </div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">while</span> (currentChild &lt; 16)</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> {</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="keywordtype">int</span> branch = (firstChild + currentChild++) % 16;</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordflow">if</span> (node-&gt;<a class="code hl_function" href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">isEmptyBranch</a>(branch))</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> </div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; childHash = node-&gt;<a class="code hl_function" href="classripple_1_1SHAMapInnerNode.html#a8932a6ff79c447556da4b17e908bd008">getChildHash</a>(branch);</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">missingHashes_</a>.count(childHash) != 0)</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> {</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// we already know this child node is missing</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> fullBelow = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> }</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> !<a class="code hl_variable" href="classripple_1_1SHAMap.html#a0b1d68d0723680664e14401c86625b9f">backed_</a> ||</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> !<a class="code hl_variable" href="classripple_1_1SHAMap.html#a5268c936212da93659dd05be9304e0bb">f_</a>.<a class="code hl_function" href="classripple_1_1Family.html#a3fc38122142593c76c2a28070607c3f9">getFullBelowCache</a>()-&gt;touch_if_exists(childHash.as_uint256()))</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> {</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordtype">bool</span> <a class="code hl_enumvalue" href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a> = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keyword">auto</span> d = <a class="code hl_function" href="classripple_1_1SHAMap.html#a07ce8e5379558b4c0e256cbbf2636cb7">descendAsync</a>(</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> node,</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> branch,</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad9c9b5733c3b993c3d4e46b0695ae116">filter_</a>,</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <a class="code hl_enumvalue" href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a>,</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> [node, nodeID, branch, &amp;mn](</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <a class="code hl_class" href="classripple_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a> found,</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <a class="code hl_class" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp;) {</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// a read completed asynchronously</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> std::unique_lock&lt;std::mutex&gt; lock{mn.deferLock_};</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>.emplace_back(</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> node, nodeID, branch, std::move(found));</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2bb0e112bf72fe63d733867f480d11b7">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="l00194" name="l00194"></a><span class="lineno"> 194</span> });</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> </div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordflow">if</span> (<a class="code hl_enumvalue" href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a>)</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> {</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> fullBelow = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> ++mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a>;</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> }</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!d)</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> {</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// node is not in database</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> fullBelow = <span class="keyword">false</span>; <span class="comment">// for now, not known full below</span></div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">missingHashes_</a>.insert(childHash);</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>.emplace_back(</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch), childHash.as_uint256());</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="keywordflow">if</span> (--mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &lt;= 0)</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> }</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> d-&gt;isInner() &amp;&amp;</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> !<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(d)-&gt;isFullBelow(mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">generation_</a>))</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> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.push(se);</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> <span class="comment">// Switch to processing the child node</span></div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> node = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(d);</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> nodeID = nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> firstChild = <a class="code hl_function" href="namespaceripple.html#a1747b036b81bd3769995670092912976">rand_int</a>(255);</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> currentChild = 0;</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> fullBelow = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> }</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> }</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</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">// We have finished processing an inner node</span></div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="comment">// and thus (for now) all its children</span></div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keywordflow">if</span> (fullBelow)</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> { <span class="comment">// No partial node encountered below this node</span></div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> node-&gt;setFullBelowGen(mn.generation_);</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordflow">if</span> (backed_)</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> f_.getFullBelowCache()-&gt;insert(node-&gt;getHash().as_uint256());</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> }</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> }</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> node = <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span>}</div>
</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span><span class="comment">// Wait for deferred reads to finish and</span></div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span><span class="comment">// process their results</span></div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00247" data-start="{" data-end="}">
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a984f9b7723353ed3083a8513f9088662"> 247</a></span>SHAMap::gmn_ProcessDeferredReads(<a class="code hl_struct" href="structripple_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a>&amp; mn)</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span>{</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// Process all deferred reads</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keywordtype">int</span> complete = 0;</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordflow">while</span> (complete != mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a>)</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> {</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a>&lt;</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*,</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>,</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> int,</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <a class="code hl_class" href="classripple_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a>&gt;</div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> deferredNode;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> {</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</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="structripple_1_1SHAMap_1_1MissingNodes.html#a2ed60db474e8c9072068402313d16d0d">deferLock_</a>};</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> <span class="keywordflow">while</span> (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>.size() &lt;= complete)</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2bb0e112bf72fe63d733867f480d11b7">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="l00264" name="l00264"></a><span class="lineno"> 264</span> deferredNode = std::move(mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>[complete++]);</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> }</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> </div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</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="l00268" name="l00268"></a><span class="lineno"> 268</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="l00269" name="l00269"></a><span class="lineno"> 269</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="l00270" name="l00270"></a><span class="lineno"> 270</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="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; nodeHash = parent-&gt;getChildHash(branch);</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> </div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keywordflow">if</span> (nodePtr)</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> { <span class="comment">// Got the node</span></div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> nodePtr = parent-&gt;canonicalizeChild(branch, std::move(nodePtr));</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> </div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// When we finish this stack, we need to restart</span></div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// with the parent of this node</span></div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>[parent] = parentID;</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> }</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &gt; 0) &amp;&amp; (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">missingHashes_</a>.insert(nodeHash).second))</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> {</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>.emplace_back(</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> parentID.getChildNodeID(branch), nodeHash.as_uint256());</div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> --mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a>;</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> }</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> }</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> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>.clear();</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>.reserve(mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ac28d9d435ad4005d2e01ee1b9a509b73">maxDefer_</a>);</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a> = 0;</div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span>}</div>
</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> </div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</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="foldopen00299" data-start="{" data-end="}">
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#aa5a110117bc3ae3de8a49ba06c21fa04"> 299</a></span>SHAMap::getMissingNodes(<span class="keywordtype">int</span> max, <a class="code hl_class" href="classripple_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</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> XRPL_ASSERT(</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> root_-&gt;getHash().isNonZero(),</div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="stringliteral">&quot;ripple::SHAMap::getMissingNodes : nonzero root hash&quot;</span>);</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> XRPL_ASSERT(max &gt; 0, <span class="stringliteral">&quot;ripple::SHAMap::getMissingNodes : valid max input&quot;</span>);</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> <a class="code hl_struct" href="structripple_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a> mn(</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> max,</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> filter,</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> 512, <span class="comment">// number of async reads per pass</span></div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> f_.getFullBelowCache()-&gt;getGeneration());</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> </div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keywordflow">if</span> (!root_-&gt;isInner() ||</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_)-&gt;isFullBelow(</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">generation_</a>))</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> clearSynching();</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="keywordflow">return</span> std::move(mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>);</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> }</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">// Start at the root.</span></div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="comment">// The firstChild value is selected randomly so if multiple threads</span></div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="comment">// are traversing the map, each thread will start at a different</span></div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="comment">// (randomly selected) inner node. This increases the likelihood</span></div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="comment">// that the two threads will produce different request sets (which is</span></div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// more efficient than sending identical requests).</span></div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">MissingNodes::StackEntry</a> pos{</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(root_.get()),</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>(),</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <a class="code hl_function" href="namespaceripple.html#a7e8c5e8439747ed61273789c9940d5b7">rand_int</a>(255),</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> 0,</div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <span class="keyword">true</span>};</div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</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="l00333" name="l00333"></a><span class="lineno"> 333</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="l00334" name="l00334"></a><span class="lineno"> 334</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="l00335" name="l00335"></a><span class="lineno"> 335</span> </div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="comment">// Traverse the map without blocking</span></div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="keywordflow">do</span></div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> {</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="keywordflow">while</span> ((node != <span class="keyword">nullptr</span>) &amp;&amp; (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a> &lt;= mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ac28d9d435ad4005d2e01ee1b9a509b73">maxDefer_</a>))</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> {</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> gmn_ProcessNodes(mn, pos);</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="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &lt;= 0)</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> </div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keywordflow">if</span> ((node == <span class="keyword">nullptr</span>) &amp;&amp; !mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.empty())</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> {</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="comment">// Pick up where we left off with this node&#39;s parent</span></div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordtype">bool</span> was = fullBelow; <span class="comment">// was full below</span></div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> </div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> pos = mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.top();</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.pop();</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keywordflow">if</span> (nextChild == 0)</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">// This is a node we are processing for the first time</span></div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> fullBelow = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> }</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keywordflow">else</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> <span class="comment">// This is a node we are continuing to process</span></div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> fullBelow = fullBelow &amp;&amp; was; <span class="comment">// was and still is</span></div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> }</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> XRPL_ASSERT(</div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> node,</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="stringliteral">&quot;ripple::SHAMap::getMissingNodes : first non-null node&quot;</span>);</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</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> </div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> <span class="comment">// We have either emptied the stack or</span></div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// posted as many deferred reads as we can</span></div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a>)</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> gmn_ProcessDeferredReads(mn);</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="keywordflow">if</span> (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &lt;= 0)</div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">return</span> std::move(mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>);</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> </div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <span class="keywordflow">if</span> (node == <span class="keyword">nullptr</span>)</div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> { <span class="comment">// We weren&#39;t in the middle of processing a node</span></div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> </div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.empty() &amp;&amp; !mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>.empty())</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> {</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// Recheck nodes we could not finish before</span></div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; [<a class="code hl_enumvalue" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">innerNode</a>, nodeId] : mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>)</div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="keywordflow">if</span> (!<a class="code hl_enumvalue" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">innerNode</a>-&gt;isFullBelow(mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">generation_</a>))</div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.push(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a>(</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <a class="code hl_enumvalue" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">innerNode</a>, nodeId, <a class="code hl_function" href="namespaceripple.html#a7e8c5e8439747ed61273789c9940d5b7">rand_int</a>(255), 0, <span class="keyword">true</span>));</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> </div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>.clear();</div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> }</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> </div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keywordflow">if</span> (!mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.empty())</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> {</div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="comment">// Resume at the top of the stack</span></div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> pos = mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.top();</div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.pop();</div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> XRPL_ASSERT(</div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> node,</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="stringliteral">&quot;ripple::SHAMap::getMissingNodes : second non-null node&quot;</span>);</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> }</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</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> <span class="comment">// node will only still be nullptr if</span></div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <span class="comment">// we finished the current node, the stack is empty</span></div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="comment">// and we have no nodes to resume</span></div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> </div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> } <span class="keywordflow">while</span> (node != <span class="keyword">nullptr</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> <span class="keywordflow">if</span> (mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>.empty())</div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> clearSynching();</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> </div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="keywordflow">return</span> std::move(mn.<a class="code hl_variable" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>);</div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span>}</div>
</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="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00415" data-start="{" data-end="}">
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a55538cab9a46adb5c5acb39616439ef4"> 415</a></span>SHAMap::getNodeFat(</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; wanted,</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</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="l00418" name="l00418"></a><span class="lineno"> 418</span> <span class="keywordtype">bool</span> fatLeaves,</div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</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="l00420" name="l00420"></a><span class="lineno"> 420</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="comment">// Gets a node and some of its children</span></div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// to a specified depth</span></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="keyword">auto</span> node = root_.get();</div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> </div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="keywordflow">while</span> (node &amp;&amp; node-&gt;isInner() &amp;&amp; (nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &lt; wanted.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()))</div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> {</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <span class="keywordtype">int</span> branch = <a class="code hl_function" href="namespaceripple.html#abab985fadeb4b5746ed662c2540f4da5">selectBranch</a>(nodeID, wanted.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a1b49f13ef901549ef1d5bceb94ed4753">getNodeID</a>());</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> node = descendThrow(inner, branch);</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> nodeID = nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</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> </div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="keywordflow">if</span> (node == <span class="keyword">nullptr</span> || wanted != nodeID)</div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> {</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> JLOG(journal_.info())</div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> &lt;&lt; <span class="stringliteral">&quot;peer requested node that is not in the map: &quot;</span> &lt;&lt; wanted</div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> &lt;&lt; <span class="stringliteral">&quot; but found &quot;</span> &lt;&lt; nodeID;</div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> }</div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> </div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="keywordflow">if</span> (node-&gt;isInner() &amp;&amp; <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node)-&gt;<a class="code hl_function" href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">isEmpty</a>())</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> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;peer requests empty node&quot;</span>;</div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> }</div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> </div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</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="l00452" name="l00452"></a><span class="lineno"> 452</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="l00453" name="l00453"></a><span class="lineno"> 453</span> </div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> <a class="code hl_class" href="classripple_1_1Serializer.html">Serializer</a> s(8192);</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> <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="l00457" name="l00457"></a><span class="lineno"> 457</span> {</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</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="l00459" name="l00459"></a><span class="lineno"> 459</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="l00460" name="l00460"></a><span class="lineno"> 460</span> </div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <span class="comment">// Add this node to the reply</span></div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> s.<a class="code hl_function" href="classripple_1_1Serializer.html#a0b9f56cab2021e47d45e4cd287f4b425">erase</a>();</div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> node-&gt;serializeForWire(s);</div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</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="classripple_1_1Serializer.html#a4f42b878a90a9d5818a4d598ec038d4d">getData</a>()));</div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> </div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> {</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> <span class="comment">// We descend inner nodes with only a single child</span></div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="comment">// without decrementing the depth</span></div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <span class="keywordtype">int</span> bc = inner-&gt;<a class="code hl_function" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">getBranchCount</a>();</div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> </div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="keywordflow">if</span> ((depth &gt; 0) || (bc == 1))</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> <span class="comment">// We need to process this node&#39;s children</span></div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> {</div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="keywordflow">if</span> (!inner-&gt;isEmptyBranch(i))</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> <span class="keyword">auto</span> <span class="keyword">const</span> childNode = descendThrow(inner, i);</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <span class="keyword">auto</span> <span class="keyword">const</span> childID = nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(i);</div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> </div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="keywordflow">if</span> (childNode-&gt;isInner() &amp;&amp; ((depth &gt; 1) || (bc == 1)))</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="comment">// If there&#39;s more than one child, reduce the depth</span></div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// If only one child, follow the chain</span></div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> stack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/emplace.html">emplace</a>(</div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> childNode,</div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> childID,</div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> (bc &gt; 1) ? (depth - 1) : depth);</div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> }</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (childNode-&gt;isInner() || fatLeaves)</div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> {</div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="comment">// Just include this node</span></div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> s.<a class="code hl_function" href="classripple_1_1Serializer.html#a0b9f56cab2021e47d45e4cd287f4b425">erase</a>();</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> childNode-&gt;serializeForWire(s);</div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> data.emplace_back(</div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <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="classripple_1_1Serializer.html#a4f42b878a90a9d5818a4d598ec038d4d">getData</a>()));</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> }</div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> }</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> }</div>
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> }</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> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span>}</div>
</div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> </div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00510" data-start="{" data-end="}">
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a73d3eb716abe882fd5ea183d6d13a7e3"> 510</a></span>SHAMap::serializeRoot(<a class="code hl_class" href="classripple_1_1Serializer.html">Serializer</a>&amp; s)<span class="keyword"> const</span></div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> root_-&gt;serializeForWire(s);</div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span>}</div>
</div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> </div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span><a class="code hl_class" href="classripple_1_1SHAMapAddNode.html">SHAMapAddNode</a></div>
<div class="foldopen" id="foldopen00516" data-start="{" data-end="}">
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a64ade0336e5125b3ae011da2a97a453d"> 516</a></span>SHAMap::addRootNode(</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <a class="code hl_class" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; hash,</div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> <a class="code hl_class" href="classripple_1_1Slice.html">Slice</a> <span class="keyword">const</span>&amp; rootNode,</div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <a class="code hl_class" href="classripple_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</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="comment">// we already have a root_ node</span></div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <span class="keywordflow">if</span> (root_-&gt;getHash().isNonZero())</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> {</div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;got root node, already have one&quot;</span>;</div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> XRPL_ASSERT(</div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> root_-&gt;getHash() == hash,</div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> <span class="stringliteral">&quot;ripple::SHAMap::addRootNode : valid hash input&quot;</span>);</div>
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</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> </div>
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> XRPL_ASSERT(cowid_ &gt;= 1, <span class="stringliteral">&quot;ripple::SHAMap::addRootNode : valid cowid&quot;</span>);</div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="keyword">auto</span> node = SHAMapTreeNode::makeFromWire(rootNode);</div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="keywordflow">if</span> (!node || node-&gt;getHash() != hash)</div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</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="keywordflow">if</span> (backed_)</div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> canonicalize(hash, node);</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> root_ = node;</div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> </div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> <span class="keywordflow">if</span> (root_-&gt;isLeaf())</div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> clearSynching();</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> (filter)</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> <a class="code hl_class" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> root_-&gt;serializeWithPrefix(s);</div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> filter-&gt;<a class="code hl_function" href="classripple_1_1SHAMapSyncFilter.html#a52d6a1cab3037707977a764d146d939f">gotNode</a>(</div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <span class="keyword">false</span>,</div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> root_-&gt;getHash(),</div>
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> ledgerSeq_,</div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> std::move(s.<a class="code hl_function" href="classripple_1_1Serializer.html#af7dfa25960c307bb59cbbf00fb5e519d">modData</a>()),</div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> root_-&gt;getType());</div>
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> }</div>
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> </div>
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span>}</div>
</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><a class="code hl_class" href="classripple_1_1SHAMapAddNode.html">SHAMapAddNode</a></div>
<div class="foldopen" id="foldopen00560" data-start="{" data-end="}">
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a5c78c5b45614fa7b5f7ecebbc7185944"> 560</a></span>SHAMap::addKnownNode(</div>
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; node,</div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> <a class="code hl_class" href="classripple_1_1Slice.html">Slice</a> <span class="keyword">const</span>&amp; rawNode,</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <a class="code hl_class" href="classripple_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</div>
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span>{</div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> XRPL_ASSERT(</div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> !node.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a205ce1fb183881d67a7b171533141c6b">isRoot</a>(), <span class="stringliteral">&quot;ripple::SHAMap::addKnownNode : valid node input&quot;</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> <span class="keywordflow">if</span> (!isSynching())</div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> {</div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;AddKnownNode while not synching&quot;</span>;</div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> }</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="keyword">auto</span> <span class="keyword">const</span> generation = f_.getFullBelowCache()-&gt;getGeneration();</div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> currNodeID;</div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="keyword">auto</span> currNode = root_.get();</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> <span class="keywordflow">while</span> (currNode-&gt;isInner() &amp;&amp;</div>
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> !<span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(currNode)-&gt;<a class="code hl_function" href="classripple_1_1SHAMapInnerNode.html#a597b4db5c84297776d2e8ebdbe9e1b6f">isFullBelow</a>(generation) &amp;&amp;</div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> (currNodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &lt; node.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()))</div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> {</div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> <span class="keywordtype">int</span> <span class="keyword">const</span> branch = <a class="code hl_function" href="namespaceripple.html#abab985fadeb4b5746ed662c2540f4da5">selectBranch</a>(currNodeID, node.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a1b49f13ef901549ef1d5bceb94ed4753">getNodeID</a>());</div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> XRPL_ASSERT(branch &gt;= 0, <span class="stringliteral">&quot;ripple::SHAMap::addKnownNode : valid branch&quot;</span>);</div>
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(currNode);</div>
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</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> 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="l00588" name="l00588"></a><span class="lineno"> 588</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> }</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> <span class="keyword">auto</span> childHash = inner-&gt;getChildHash(branch);</div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="keywordflow">if</span> (f_.getFullBelowCache()-&gt;touch_if_exists(childHash.as_uint256()))</div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> {</div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> }</div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> </div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="keyword">auto</span> prevNode = inner;</div>
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> <a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(currNode, currNodeID) =</div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> descend(inner, currNodeID, branch, filter);</div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> </div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <span class="keywordflow">if</span> (currNode != <span class="keyword">nullptr</span>)</div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> </div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> <span class="keyword">auto</span> newNode = SHAMapTreeNode::makeFromWire(rawNode);</div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> </div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> <span class="keywordflow">if</span> (!newNode || childHash != newNode-&gt;getHash())</div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> {</div>
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;Corrupt node received&quot;</span>;</div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> }</div>
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> </div>
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <span class="comment">// In rare cases, a node can still be corrupt even after hash</span></div>
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> <span class="comment">// validation. For leaf nodes, we perform an additional check to</span></div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="comment">// ensure the node&#39;s position in the tree is consistent with its</span></div>
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> <span class="comment">// content to prevent inconsistencies that could</span></div>
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <span class="comment">// propagate further down the line.</span></div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <span class="keywordflow">if</span> (newNode-&gt;isLeaf())</div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> {</div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; actualKey =</div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a> const*<span class="keyword">&gt;</span>(newNode.get())</div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> -&gt;peekItem()</div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> -&gt;key();</div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> </div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> <span class="comment">// Validate that this leaf belongs at the target position</span></div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> <span class="keyword">auto</span> <span class="keyword">const</span> expectedNodeID =</div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> SHAMapNodeID::createID(node.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>(), actualKey);</div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> <span class="keywordflow">if</span> (expectedNodeID.getNodeID() != node.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a1b49f13ef901549ef1d5bceb94ed4753">getNodeID</a>())</div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> {</div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> JLOG(journal_.debug())</div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> &lt;&lt; <span class="stringliteral">&quot;Leaf node position mismatch: &quot;</span></div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> &lt;&lt; <span class="stringliteral">&quot;expected=&quot;</span> &lt;&lt; expectedNodeID.getNodeID()</div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> &lt;&lt; <span class="stringliteral">&quot;, actual=&quot;</span> &lt;&lt; node.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a1b49f13ef901549ef1d5bceb94ed4753">getNodeID</a>();</div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> }</div>
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> }</div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> </div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <span class="comment">// Inner nodes must be at a level strictly less than 64</span></div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <span class="comment">// but leaf nodes (while notionally at level 64) can be</span></div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> <span class="comment">// at any depth up to and including 64:</span></div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> <span class="keywordflow">if</span> ((currNodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &gt; leafDepth) ||</div>
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> (newNode-&gt;isInner() &amp;&amp; currNodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() == leafDepth))</div>
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> {</div>
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> <span class="comment">// Map is provably invalid</span></div>
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> state_ = SHAMapState::Invalid;</div>
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> }</div>
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> </div>
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="keywordflow">if</span> (currNodeID != node)</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="comment">// Either this node is broken or we didn&#39;t request it (yet)</span></div>
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</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="l00652" name="l00652"></a><span class="lineno"> 652</span> JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot; stuck at &quot;</span> &lt;&lt; currNodeID;</div>
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot;got depth=&quot;</span> &lt;&lt; node.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()</div>
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> &lt;&lt; <span class="stringliteral">&quot;, walked to= &quot;</span> &lt;&lt; currNodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>();</div>
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</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> </div>
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> <span class="keywordflow">if</span> (backed_)</div>
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> canonicalize(childHash, newNode);</div>
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> </div>
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> newNode = prevNode-&gt;canonicalizeChild(branch, std::move(newNode));</div>
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> </div>
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <span class="keywordflow">if</span> (filter)</div>
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> {</div>
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <a class="code hl_class" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> newNode-&gt;serializeWithPrefix(s);</div>
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> filter-&gt;<a class="code hl_function" href="classripple_1_1SHAMapSyncFilter.html#a52d6a1cab3037707977a764d146d939f">gotNode</a>(</div>
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <span class="keyword">false</span>,</div>
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> childHash,</div>
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> ledgerSeq_,</div>
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> std::move(s.<a class="code hl_function" href="classripple_1_1Serializer.html#af7dfa25960c307bb59cbbf00fb5e519d">modData</a>()),</div>
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> newNode-&gt;getType());</div>
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> }</div>
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> </div>
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> }</div>
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> </div>
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;got node, already had it (late)&quot;</span>;</div>
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span>}</div>
</div>
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> </div>
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00683" data-start="{" data-end="}">
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#af0792d9d5d0e62b966754dcdee79e1ea"> 683</a></span>SHAMap::deepCompare(<a class="code hl_class" href="classripple_1_1SHAMap.html">SHAMap</a>&amp; other)<span class="keyword"> const</span></div>
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <span class="comment">// Intended for debug/test only</span></div>
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</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="l00687" name="l00687"></a><span class="lineno"> 687</span> </div>
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</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="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>.get()});</div>
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> </div>
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</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="l00691" name="l00691"></a><span class="lineno"> 691</span> {</div>
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</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="l00693" name="l00693"></a><span class="lineno"> 693</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="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">if</span> (!node || !otherNode)</div>
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> {</div>
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot;unable to fetch node&quot;</span>;</div>
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> }</div>
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (otherNode-&gt;getHash() != node-&gt;getHash())</div>
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> {</div>
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;node hash mismatch&quot;</span>;</div>
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> }</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;isLeaf())</div>
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> {</div>
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> <span class="keywordflow">if</span> (!otherNode-&gt;isLeaf())</div>
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> <span class="keyword">auto</span>&amp; nodePeek = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(node)-&gt;peekItem();</div>
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <span class="keyword">auto</span>&amp; otherNodePeek =</div>
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode)-&gt;peekItem();</div>
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <span class="keywordflow">if</span> (nodePeek-&gt;key() != otherNodePeek-&gt;key())</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>;</div>
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> <span class="keywordflow">if</span> (nodePeek-&gt;slice() != otherNodePeek-&gt;slice())</div>
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> }</div>
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> {</div>
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> <span class="keywordflow">if</span> (!otherNode-&gt;isInner())</div>
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> <span class="keyword">auto</span> node_inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> <span class="keyword">auto</span> other_inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> {</div>
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> <span class="keywordflow">if</span> (node_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> {</div>
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> <span class="keywordflow">if</span> (!other_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> }</div>
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> <span class="keywordflow">else</span></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> (other_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> </div>
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="keyword">auto</span> next = descend(node_inner, i);</div>
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <span class="keyword">auto</span> otherNext = other.<a class="code hl_function" href="classripple_1_1SHAMap.html#a586781012c019333e8286bf824310fd2">descend</a>(other_inner, i);</div>
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <span class="keywordflow">if</span> (!next || !otherNext)</div>
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> {</div>
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;unable to fetch inner node&quot;</span>;</div>
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> }</div>
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</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="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> }</div>
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> }</div>
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> </div>
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span>}</div>
</div>
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> </div>
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00755" data-start="{" data-end="}">
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a8a20e910f929701bee2a43d408dd7afa"> 755</a></span>SHAMap::hasInnerNode(</div>
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; targetNodeID,</div>
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <a class="code hl_class" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; targetNodeHash)<span class="keyword"> const</span></div>
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span> </div>
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> <span class="keywordflow">while</span> (node-&gt;isInner() &amp;&amp; (nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &lt; targetNodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()))</div>
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> {</div>
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> <span class="keywordtype">int</span> branch = <a class="code hl_function" href="namespaceripple.html#abab985fadeb4b5746ed662c2540f4da5">selectBranch</a>(nodeID, targetNodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a1b49f13ef901549ef1d5bceb94ed4753">getNodeID</a>());</div>
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> <span class="keywordflow">return</span> <span class="keyword">false</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> node = descendThrow(inner, branch);</div>
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> nodeID = nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</div>
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> }</div>
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> </div>
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> <span class="keywordflow">return</span> (node-&gt;isInner()) &amp;&amp; (node-&gt;getHash() == targetNodeHash);</div>
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span>}</div>
</div>
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> </div>
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00779" data-start="{" data-end="}">
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e"> 779</a></span>SHAMap::hasLeafNode(<a class="code hl_class" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; tag, <a class="code hl_class" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; targetNodeHash)<span class="keyword"> const</span></div>
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> <a class="code hl_class" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> </div>
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</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="l00785" name="l00785"></a><span class="lineno"> 785</span> <span class="keywordflow">return</span> node-&gt;getHash() == targetNodeHash;</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="keywordflow">do</span></div>
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> {</div>
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> <span class="keywordtype">int</span> branch = <a class="code hl_function" href="namespaceripple.html#abab985fadeb4b5746ed662c2540f4da5">selectBranch</a>(nodeID, tag);</div>
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</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="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="keywordflow">if</span> (inner-&gt;getChildHash(branch) ==</div>
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> targetNodeHash) <span class="comment">// Matching leaf, no need to retrieve it</span></div>
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> <span class="keywordflow">return</span> <span class="keyword">true</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> node = descendThrow(inner, branch);</div>
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> nodeID = nodeID.<a class="code hl_function" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</div>
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> } <span class="keywordflow">while</span> (node-&gt;isInner());</div>
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> </div>
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</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="l00803" name="l00803"></a><span class="lineno"> 803</span> <span class="comment">// already</span></div>
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span>}</div>
</div>
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> </div>
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</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="foldopen00807" data-start="{" data-end="}">
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#afcf889076d5459b52eb9eb8248344f5c"> 807</a></span>SHAMap::getProofPath(<a class="code hl_class" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; key)<span class="keyword"> const</span></div>
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</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="l00810" name="l00810"></a><span class="lineno"> 810</span> walkTowardsKey(key, &amp;stack);</div>
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> </div>
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</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="l00813" name="l00813"></a><span class="lineno"> 813</span> {</div>
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> }</div>
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> </div>
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</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>; !node || node-&gt;isInner() ||</div>
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> intr_ptr::static_pointer_cast&lt;SHAMapLeafNode&gt;(node)</div>
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> -&gt;peekItem()</div>
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> -&gt;key() != key)</div>
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> {</div>
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> }</div>
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> </div>
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</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="l00828" name="l00828"></a><span class="lineno"> 828</span> path.reserve(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="l00829" name="l00829"></a><span class="lineno"> 829</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="l00830" name="l00830"></a><span class="lineno"> 830</span> {</div>
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> <a class="code hl_class" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</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="l00833" name="l00833"></a><span class="lineno"> 833</span> path.emplace_back(std::move(s.<a class="code hl_function" href="classripple_1_1Serializer.html#af7dfa25960c307bb59cbbf00fb5e519d">modData</a>()));</div>
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</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="l00835" name="l00835"></a><span class="lineno"> 835</span> }</div>
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> </div>
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</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></div>
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> &lt;&lt; path.size();</div>
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> <span class="keywordflow">return</span> path;</div>
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span>}</div>
</div>
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> </div>
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00843" data-start="{" data-end="}">
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#af382ac10dccf3f4b82c64548cd05a677"> 843</a></span>SHAMap::verifyProofPath(</div>
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> <a class="code hl_class" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; rootHash,</div>
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> <a class="code hl_class" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; key,</div>
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> <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="l00847" name="l00847"></a><span class="lineno"> 847</span>{</div>
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> <span class="keywordflow">if</span> (path.empty() || path.size() &gt; 65)</div>
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> </div>
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> <a class="code hl_class" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> hash{rootHash};</div>
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> <span class="keywordflow">try</span></div>
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> {</div>
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> rit = path.rbegin(); rit != path.rend(); ++rit)</div>
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> {</div>
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; blob = *rit;</div>
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> <span class="keyword">auto</span> node = SHAMapTreeNode::makeFromWire(<a class="code hl_function" href="namespaceripple.html#a93f2333b362ee67694b78f55eadf7805">makeSlice</a>(blob));</div>
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> <span class="keywordflow">if</span> (!node)</div>
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> node-&gt;updateHash();</div>
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> <span class="keywordflow">if</span> (node-&gt;getHash() != hash)</div>
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> </div>
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</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.rbegin(), rit);</div>
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> {</div>
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> <span class="keyword">auto</span> nodeId = SHAMapNodeID::createID(depth, key);</div>
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> hash = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node.get())</div>
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> -&gt;getChildHash(<a class="code hl_function" href="namespaceripple.html#abab985fadeb4b5746ed662c2540f4da5">selectBranch</a>(nodeId, key));</div>
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> }</div>
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> {</div>
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> <span class="comment">// should exhaust all the blobs now</span></div>
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> <span class="keywordflow">return</span> depth + 1 == path.size();</div>
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> }</div>
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> }</div>
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> }</div>
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</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="l00879" name="l00879"></a><span class="lineno"> 879</span> {</div>
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> <span class="comment">// the data in the path may come from the network,</span></div>
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span> <span class="comment">// exception could be thrown when parsing the data</span></div>
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span> }</div>
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span>}</div>
</div>
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> </div>
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span>} <span class="comment">// namespace ripple</span></div>
<div class="ttc" id="aclassripple_1_1Family_html_a3fc38122142593c76c2a28070607c3f9"><div class="ttname"><a href="classripple_1_1Family.html#a3fc38122142593c76c2a28070607c3f9">ripple::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="aclassripple_1_1SHAMapAddNode_html"><div class="ttname"><a href="classripple_1_1SHAMapAddNode.html">ripple::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="aclassripple_1_1SHAMapHash_html"><div class="ttname"><a href="classripple_1_1SHAMapHash.html">ripple::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="aclassripple_1_1SHAMapInnerNode_html"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html">ripple::SHAMapInnerNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00015">SHAMapInnerNode.h:17</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a13fcdfee8199a8e54429edf6b9085ae0"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">ripple::SHAMapInnerNode::isEmpty</a></div><div class="ttdeci">bool isEmpty() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00176">SHAMapInnerNode.h:176</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a597b4db5c84297776d2e8ebdbe9e1b6f"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a597b4db5c84297776d2e8ebdbe9e1b6f">ripple::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#l00194">SHAMapInnerNode.h:194</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a5b4f103d62324f6efb4e21a8a6404c27"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">ripple::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#l00182">SHAMapInnerNode.h:182</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a8932a6ff79c447556da4b17e908bd008"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a8932a6ff79c447556da4b17e908bd008">ripple::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#l00361">SHAMapInnerNode.cpp:361</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_aec522cbc8cfb50ed87ebf8c634a40276"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">ripple::SHAMapInnerNode::getBranchCount</a></div><div class="ttdeci">int getBranchCount() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00188">SHAMapInnerNode.h:188</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapLeafNode_html"><div class="ttname"><a href="classripple_1_1SHAMapLeafNode.html">ripple::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="aclassripple_1_1SHAMapLeafNode_html_afee48bd94530b5ad6dfe4a403d8455c4"><div class="ttname"><a href="classripple_1_1SHAMapLeafNode.html#afee48bd94530b5ad6dfe4a403d8455c4">ripple::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#l00030">SHAMapLeafNode.cpp:30</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapNodeID_html"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html">ripple::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="aclassripple_1_1SHAMapNodeID_html_a17a2bccfba4ea39ba3c92570511a4d55"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">ripple::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="aclassripple_1_1SHAMapNodeID_html_a1b49f13ef901549ef1d5bceb94ed4753"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a1b49f13ef901549ef1d5bceb94ed4753">ripple::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="aclassripple_1_1SHAMapNodeID_html_a205ce1fb183881d67a7b171533141c6b"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a205ce1fb183881d67a7b171533141c6b">ripple::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="aclassripple_1_1SHAMapNodeID_html_a23e606ffcd8a863d0f678f040001aedf"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">ripple::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#l00058">SHAMapNodeID.cpp:58</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapSyncFilter_html"><div class="ttname"><a href="classripple_1_1SHAMapSyncFilter.html">ripple::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="aclassripple_1_1SHAMapSyncFilter_html_a52d6a1cab3037707977a764d146d939f"><div class="ttname"><a href="classripple_1_1SHAMapSyncFilter.html#a52d6a1cab3037707977a764d146d939f">ripple::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="aclassripple_1_1SHAMapTreeNode_html"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html">ripple::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="aclassripple_1_1SHAMapTreeNode_html_a7aff7622ccd8ffd0be9367518b39436e"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">ripple::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="aclassripple_1_1SHAMap_html"><div class="ttname"><a href="classripple_1_1SHAMap.html">ripple::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="aclassripple_1_1SHAMap_html_a07ce8e5379558b4c0e256cbbf2636cb7"><div class="ttname"><a href="classripple_1_1SHAMap.html#a07ce8e5379558b4c0e256cbbf2636cb7">ripple::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#l00374">SHAMap.cpp:374</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a0b1d68d0723680664e14401c86625b9f"><div class="ttname"><a href="classripple_1_1SHAMap.html#a0b1d68d0723680664e14401c86625b9f">ripple::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="aclassripple_1_1SHAMap_html_a241e6dd6c3be3fd11429a39c6e54111d"><div class="ttname"><a href="classripple_1_1SHAMap.html#a241e6dd6c3be3fd11429a39c6e54111d">ripple::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#l00155">SHAMapSync.cpp:155</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a26f587d4b772fd02113deb67ff052e20"><div class="ttname"><a href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">ripple::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#l00276">SHAMap.cpp:276</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a2ef0103bef7aefba0219c40368fd3688"><div class="ttname"><a href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">ripple::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="aclassripple_1_1SHAMap_html_a381ecaa70bcce3f24bac35b7fed16985"><div class="ttname"><a href="classripple_1_1SHAMap.html#a381ecaa70bcce3f24bac35b7fed16985">ripple::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#l00598">SHAMap.cpp:598</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a5268c936212da93659dd05be9304e0bb"><div class="ttname"><a href="classripple_1_1SHAMap.html#a5268c936212da93659dd05be9304e0bb">ripple::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="aclassripple_1_1SHAMap_html_a586781012c019333e8286bf824310fd2"><div class="ttname"><a href="classripple_1_1SHAMap.html#a586781012c019333e8286bf824310fd2">ripple::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#l00298">SHAMap.cpp:298</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a8a20e910f929701bee2a43d408dd7afa"><div class="ttname"><a href="classripple_1_1SHAMap.html#a8a20e910f929701bee2a43d408dd7afa">ripple::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#l00755">SHAMapSync.cpp:755</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_ab1253302364db2ba0314e437075ef9d4"><div class="ttname"><a href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4">ripple::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#l00021">SHAMapSync.cpp:21</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_ab1c8e6f8066b79c3d025e6609e20918e"><div class="ttname"><a href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e">ripple::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#l00779">SHAMapSync.cpp:779</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_ac5fd4779ce479a1a40f23e738c1a026d"><div class="ttname"><a href="classripple_1_1SHAMap.html#ac5fd4779ce479a1a40f23e738c1a026d">ripple::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#l00331">SHAMap.cpp:331</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_adb124506e012e85f807355a5a58c0ce7"><div class="ttname"><a href="classripple_1_1SHAMap.html#adb124506e012e85f807355a5a58c0ce7">ripple::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#l00083">SHAMapSync.cpp:83</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_adb6fc2f28765c0df0c93065d52a3a988"><div class="ttname"><a href="classripple_1_1SHAMap.html#adb6fc2f28765c0df0c93065d52a3a988">ripple::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="aclassripple_1_1Serializer_html"><div class="ttname"><a href="classripple_1_1Serializer.html">ripple::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="aclassripple_1_1Serializer_html_a0b9f56cab2021e47d45e4cd287f4b425"><div class="ttname"><a href="classripple_1_1Serializer.html#a0b9f56cab2021e47d45e4cd287f4b425">ripple::Serializer::erase</a></div><div class="ttdeci">void erase()</div><div class="ttdef"><b>Definition</b> <a href="Serializer_8h_source.html#l00224">Serializer.h:224</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_a4f42b878a90a9d5818a4d598ec038d4d"><div class="ttname"><a href="classripple_1_1Serializer.html#a4f42b878a90a9d5818a4d598ec038d4d">ripple::Serializer::getData</a></div><div class="ttdeci">Blob getData() const</div><div class="ttdef"><b>Definition</b> <a href="Serializer_8h_source.html#l00188">Serializer.h:188</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_af7dfa25960c307bb59cbbf00fb5e519d"><div class="ttname"><a href="classripple_1_1Serializer.html#af7dfa25960c307bb59cbbf00fb5e519d">ripple::Serializer::modData</a></div><div class="ttdeci">Blob &amp; modData()</div><div class="ttdef"><b>Definition</b> <a href="Serializer_8h_source.html#l00193">Serializer.h:193</a></div></div>
<div class="ttc" id="aclassripple_1_1SharedIntrusive_html"><div class="ttname"><a href="classripple_1_1SharedIntrusive.html">ripple::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="aclassripple_1_1Slice_html"><div class="ttname"><a href="classripple_1_1Slice.html">ripple::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="aclassripple_1_1base__uint_html"><div class="ttname"><a href="classripple_1_1base__uint.html">ripple::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_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="anamespaceripple_html"><div class="ttname"><a href="namespaceripple.html">ripple</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="anamespaceripple_html_a1747b036b81bd3769995670092912976"><div class="ttname"><a href="namespaceripple.html#a1747b036b81bd3769995670092912976">ripple::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#l00140">include/xrpl/basics/random.h:140</a></div></div>
<div class="ttc" id="anamespaceripple_html_a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4"><div class="ttname"><a href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">ripple::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="anamespaceripple_html_a7e8c5e8439747ed61273789c9940d5b7"><div class="ttname"><a href="namespaceripple.html#a7e8c5e8439747ed61273789c9940d5b7">ripple::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#l00096">include/xrpl/basics/random.h:96</a></div></div>
<div class="ttc" id="anamespaceripple_html_a93f2333b362ee67694b78f55eadf7805"><div class="ttname"><a href="namespaceripple.html#a93f2333b362ee67694b78f55eadf7805">ripple::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#l00225">Slice.h:225</a></div></div>
<div class="ttc" id="anamespaceripple_html_abab985fadeb4b5746ed662c2540f4da5"><div class="ttname"><a href="namespaceripple.html#abab985fadeb4b5746ed662c2540f4da5">ripple::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#l00109">SHAMapNodeID.cpp:109</a></div></div>
<div class="ttc" id="anamespaceripple_html_ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77"><div class="ttname"><a href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">ripple::HashPrefix::innerNode</a></div><div class="ttdeci">@ innerNode</div><div class="ttdoc">inner node in V1 tree</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="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="astructripple_1_1SHAMap_1_1MissingNodes_html"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html">ripple::SHAMap::MissingNodes</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00493">SHAMap.h:494</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a0962b01670b88cd6de600fe072a2a860"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">ripple::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#l00508">SHAMap.h:508</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a1053cf953a1f9d97319bd05fd1ee7510"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">ripple::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#l00523">SHAMap.h:523</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2a4e6a108abbbee0b809c01349de9dbc"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">ripple::SHAMap::MissingNodes::deferred_</a></div><div class="ttdeci">int deferred_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00532">SHAMap.h:532</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2bb0e112bf72fe63d733867f480d11b7"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2bb0e112bf72fe63d733867f480d11b7">ripple::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#l00534">SHAMap.h:534</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2ed60db474e8c9072068402313d16d0d"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2ed60db474e8c9072068402313d16d0d">ripple::SHAMap::MissingNodes::deferLock_</a></div><div class="ttdeci">std::mutex deferLock_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00533">SHAMap.h:533</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a55ea2bafa18548792a05de96107370de"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">ripple::SHAMap::MissingNodes::max_</a></div><div class="ttdeci">int max_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00501">SHAMap.h:501</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a6394397a34fe323b6ef27b77c21d38d5"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">ripple::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#l00504">SHAMap.h:504</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a64493410dec801e06486468f8ed5b4d0"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">ripple::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#l00507">SHAMap.h:507</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ac28d9d435ad4005d2e01ee1b9a509b73"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ac28d9d435ad4005d2e01ee1b9a509b73">ripple::SHAMap::MissingNodes::maxDefer_</a></div><div class="ttdeci">int const maxDefer_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00503">SHAMap.h:503</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ad412b8d16396e0c89bcf9b7673f0f450"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">ripple::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#l00539">SHAMap.h:539</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ad9c9b5733c3b993c3d4e46b0695ae116"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ad9c9b5733c3b993c3d4e46b0695ae116">ripple::SHAMap::MissingNodes::filter_</a></div><div class="ttdeci">SHAMapSyncFilter * filter_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00502">SHAMap.h:502</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ade7ed01ff01b6207f63f5d7919c3f987"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">ripple::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#l00535">SHAMap.h:535</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