ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-21 19:45:53 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
ef77e7e117c3b8db01904ab632310e17a6d5ec20
rippled/SHAMapSync_8cpp_source.html
seelabs ef77e7e117 deploy: f0c237e001
2021-11-19 13:45:43 +00:00

1026 lines
167 KiB
HTML
Raw 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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.17"/>
<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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">rippled
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_df9c78dcf3f59a33b12284f95992a64b.html">ripple</a></li><li class="navelem"><a class="el" href="dir_380eda8174f5eb060d37b8b034a94866.html">shamap</a></li><li class="navelem"><a class="el" href="dir_105cccbbf432365df53e381b580b4a54.html">impl</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 name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">//------------------------------------------------------------------------------</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment"> This file is part of rippled: https://github.com/ripple/rippled</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment"> Copyright (c) 2012, 2013 Ripple Labs Inc.</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment"> Permission to use, copy, modify, and/or distribute this software for any</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment"> purpose with or without fee is hereby granted, provided that the above</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment"> copyright notice and this permission notice appear in all copies.</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="comment"> THE SOFTWARE IS PROVIDED &quot;AS IS&quot; AND THE AUTHOR DISCLAIMS ALL WARRANTIES</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="comment"> WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<span class="comment"> MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<span class="comment"> ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment"> WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment"> ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment"> OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">*/</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">//==============================================================================</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160; </div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &lt;ripple/basics/random.h&gt;</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &lt;ripple/shamap/SHAMap.h&gt;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &lt;ripple/shamap/SHAMapSyncFilter.h&gt;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; </div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceripple.html">ripple</a> {</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; </div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a483e3bb899522c7abfbf8218c5b21946"> 27</a></span>&#160;<a class="code" href="classripple_1_1SHAMap.html#a483e3bb899522c7abfbf8218c5b21946">SHAMap::visitLeaves</a>(</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;<span class="keywordtype">void</span>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a> <span class="keyword">const</span>&amp; item)&gt; <span class="keyword">const</span>&amp;</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; leafFunction)<span class="keyword"> const</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; <a class="code" href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4">visitNodes</a>([&amp;leafFunction](<a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>&amp; node) {</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; <span class="keywordflow">if</span> (!node.<a class="code" href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">isInner</a>())</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; leafFunction(<span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>&amp;<span class="keyword">&gt;</span>(node).<a class="code" href="classripple_1_1SHAMap.html#a122cf539ce917e7a322cfb41c8db3f57">peekItem</a>());</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; });</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;}</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4"> 39</a></span>&#160;<a class="code" href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4">SHAMap::visitNodes</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;<span class="keywordtype">bool</span>(<a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>&amp;)&gt; <span class="keyword">const</span>&amp; <span class="keyword">function</span>)<span class="keyword"> const</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keywordflow">if</span> (!<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>)</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; </div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="keyword">function</span>(*root_);</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; </div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordflow">if</span> (!<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>-&gt;isInner())</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; </div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, std::shared_ptr&lt;SHAMapInnerNode&gt;</a>&gt;;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <a class="codeRef" 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 name="l00051"></a><span class="lineno"> 51</span>&#160; </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keyword">auto</span> node = std::static_pointer_cast&lt;SHAMapInnerNode&gt;(<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>);</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordtype">int</span> pos = 0;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; </div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keywordflow">while</span> (1)</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; {</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">while</span> (pos &lt; 16)</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(pos))</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; {</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> child =</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <a class="code" href="classripple_1_1SHAMap.html#aa3221154f0a1742601dba0160b900ae1">descendNoStore</a>(node, pos);</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">if</span> (!<span class="keyword">function</span>(*child))</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="keywordflow">if</span> (child-&gt;isLeaf())</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; ++pos;</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; {</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="comment">// If there are no more children, don&#39;t push this node</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="keywordflow">while</span> ((pos != 15) &amp;&amp; (node-&gt;isEmptyBranch(pos + 1)))</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; ++pos;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; </div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">if</span> (pos != 15)</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; {</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="comment">// save next position to resume at</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(<a class="codeRef" 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 name="l00078"></a><span class="lineno"> 78</span>&#160; }</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="comment">// descend to the child&#39;s first position</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; node = std::static_pointer_cast&lt;SHAMapInnerNode&gt;(child);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; pos = 0;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; }</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; }</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; {</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; ++pos; <span class="comment">// move to next position</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; }</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; }</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; </div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keywordflow">if</span> (stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; </div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(pos, node) = stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;}</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; </div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a033dc682ae2682f64b8e8973ae7bdc2b"> 100</a></span>&#160;<a class="code" href="classripple_1_1SHAMap.html#a033dc682ae2682f64b8e8973ae7bdc2b">SHAMap::visitDifferences</a>(</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <a class="code" href="classripple_1_1SHAMap.html">SHAMap</a> <span class="keyword">const</span>* have,</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;<span class="keywordtype">bool</span>(<a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a> <span class="keyword">const</span>&amp;)&gt; <span class="keyword">function</span>)<span class="keyword"> const</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <span class="comment">// Visit every node in this SHAMap that is not present</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="comment">// in the specified SHAMap</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordflow">if</span> (!<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>)</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; </div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>-&gt;getHash().isZero())</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; </div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">if</span> (have &amp;&amp; (<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>-&gt;getHash() == have-&gt;<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>-&gt;getHash()))</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; </div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>-&gt;isLeaf())</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; {</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="keyword">auto</span> leaf = std::static_pointer_cast&lt;SHAMapLeafNode&gt;(<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>);</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <span class="keywordflow">if</span> (!have ||</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; !have-&gt;<a class="code" href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e">hasLeafNode</a>(leaf-&gt;peekItem()-&gt;key(), leaf-&gt;getHash()))</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keyword">function</span>(*root_);</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; }</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="comment">// contains unexplored non-matching inner node entries</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;SHAMapInnerNode*, SHAMapNodeID&gt;</a>;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; <a class="codeRef" 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 name="l00126"></a><span class="lineno"> 126</span>&#160; </div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({<span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>.get()), <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>{}});</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; </div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="keywordflow">while</span> (!stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; {</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> [node, nodeID] = stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; </div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="comment">// 1) Add this node to the pack</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">if</span> (!<span class="keyword">function</span>(*node))</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; </div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <span class="comment">// 2) push non-matching child inner nodes</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; {</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; {</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span>&amp; childHash = node-&gt;getChildHash(i);</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> childID = nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(i);</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="keyword">auto</span> next = <a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(node, i);</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; </div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="keywordflow">if</span> (next-&gt;isInner())</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; {</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; <span class="keywordflow">if</span> (!have || !have-&gt;<a class="code" href="classripple_1_1SHAMap.html#a8a20e910f929701bee2a43d408dd7afa">hasInnerNode</a>(childID, childHash))</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; {<span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(next), childID});</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; }</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; !have ||</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; !have-&gt;<a class="code" href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e">hasLeafNode</a>(</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(next)-&gt;<a class="code" href="classripple_1_1SHAMapLeafNode.html#a1b82b561c8fe9afc2a4a281dbb3e833c">peekItem</a>()-&gt;key(),</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; childHash))</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; {</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordflow">if</span> (!<span class="keyword">function</span>(*next))</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; }</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; }</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; }</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; }</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160;}</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160;<span class="comment">// Starting at the position referred to by the specfied</span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160;<span class="comment">// StackEntry, process that node and its first resident</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160;<span class="comment">// children, descending the SHAMap until we complete the</span></div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160;<span class="comment">// processing of a node.</span></div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a241e6dd6c3be3fd11429a39c6e54111d"> 172</a></span>&#160;<a class="code" href="classripple_1_1SHAMap.html#a241e6dd6c3be3fd11429a39c6e54111d">SHAMap::gmn_ProcessNodes</a>(<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a>&amp; mn, <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">MissingNodes::StackEntry</a>&amp; se)</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160;{</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*&amp; node = std::get&lt;0&gt;(se);</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>&amp; nodeID = std::get&lt;1&gt;(se);</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; <span class="keywordtype">int</span>&amp; firstChild = std::get&lt;2&gt;(se);</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <span class="keywordtype">int</span>&amp; currentChild = std::get&lt;3&gt;(se);</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <span class="keywordtype">bool</span>&amp; fullBelow = std::get&lt;4&gt;(se);</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; </div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; <span class="keywordflow">while</span> (currentChild &lt; 16)</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; {</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; <span class="keywordtype">int</span> branch = (firstChild + currentChild++) % 16;</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; <span class="keywordflow">if</span> (node-&gt;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">isEmptyBranch</a>(branch))</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; </div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span>&amp; childHash = node-&gt;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a8932a6ff79c447556da4b17e908bd008">getChildHash</a>(branch);</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; </div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <span class="keywordflow">if</span> (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">missingHashes_</a>.count(childHash) != 0)</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; {</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="comment">// we already know this child node is missing</span></div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; fullBelow = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; }</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; !<a class="code" href="classripple_1_1SHAMap.html#a0b1d68d0723680664e14401c86625b9f">backed_</a> ||</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; !<a class="code" href="classripple_1_1SHAMap.html#a5268c936212da93659dd05be9304e0bb">f_</a>.<a class="code" href="classripple_1_1Family.html#ac16fa71cf792d5716da74e9164707769">getFullBelowCache</a>(<a class="code" href="classripple_1_1SHAMap.html#acbedaf0be7acd2816e01be821fdc4697">ledgerSeq_</a>)</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; -&gt;touch_if_exists(childHash.as_uint256()))</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; {</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keywordtype">bool</span> <a class="code" href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a> = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keyword">auto</span> d = <a class="code" href="classripple_1_1SHAMap.html#a07ce8e5379558b4c0e256cbbf2636cb7">descendAsync</a>(</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; node,</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; branch,</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad9c9b5733c3b993c3d4e46b0695ae116">filter_</a>,</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; <a class="code" href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a>,</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; [node, nodeID, branch, &amp;mn](</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> found, <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp;) {</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="comment">// a read completed asynchronously</span></div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; std::unique_lock&lt;std::mutex&gt; lock{mn.deferLock_};</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>.emplace_back(</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; node, nodeID, branch, std::move(found));</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2bb0e112bf72fe63d733867f480d11b7">deferCondVar_</a>.<a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html">notify_one</a>();</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; });</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; </div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">pending</a>)</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; {</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; fullBelow = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; ++mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a>;</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; }</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!d)</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; {</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; <span class="comment">// node is not in database</span></div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; </div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; fullBelow = <span class="keyword">false</span>; <span class="comment">// for now, not known full below</span></div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">missingHashes_</a>.insert(childHash);</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>.emplace_back(</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch), childHash.as_uint256());</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; </div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <span class="keywordflow">if</span> (--mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &lt;= 0)</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; }</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; d-&gt;isInner() &amp;&amp;</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; !<span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(d)-&gt;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a597b4db5c84297776d2e8ebdbe9e1b6f">isFullBelow</a>(mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">generation_</a>))</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; {</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.push(se);</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; </div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; <span class="comment">// Switch to processing the child node</span></div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; node = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(d);</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; nodeID = nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; firstChild = <a class="code" href="namespaceripple.html#a71a6227fec78db0b06595d62c06b25dc">rand_int</a>(255);</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; currentChild = 0;</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; fullBelow = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; }</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; }</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; }</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; </div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; <span class="comment">// We have finished processing an inner node</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; <span class="comment">// and thus (for now) all its children</span></div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; </div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; <span class="keywordflow">if</span> (fullBelow)</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; { <span class="comment">// No partial node encountered below this node</span></div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; node-&gt;setFullBelowGen(mn.generation_);</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <span class="keywordflow">if</span> (backed_)</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; {</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; f_.getFullBelowCache(ledgerSeq_)</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; -&gt;insert(node-&gt;getHash().as_uint256());</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; }</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; }</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; </div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; node = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160;}</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; </div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160;<span class="comment">// Wait for deferred reads to finish and</span></div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160;<span class="comment">// process their results</span></div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a984f9b7723353ed3083a8513f9088662"> 265</a></span>&#160;SHAMap::gmn_ProcessDeferredReads(<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a>&amp; mn)</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160;{</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="comment">// Process all deferred reads</span></div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <span class="keywordtype">int</span> <a class="code" href="namespaceripple.html#a63a883cebf81b764433e67d90d4470d9ad9a22d7a8178d5b42a8750123cbfe5b1">complete</a> = 0;</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <span class="keywordflow">while</span> (<a class="code" href="namespaceripple.html#a63a883cebf81b764433e67d90d4470d9ad9a22d7a8178d5b42a8750123cbfe5b1">complete</a> != mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a>)</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; {</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a>&lt;</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*,</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>,</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; int,</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a>&gt;</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; deferredNode;</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; {</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/unique_lock.html">std::unique_lock&lt;std::mutex&gt;</a> lock{mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2ed60db474e8c9072068402313d16d0d">deferLock_</a>};</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; </div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; <span class="keywordflow">while</span> (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>.size() &lt;= <a class="code" href="namespaceripple.html#a63a883cebf81b764433e67d90d4470d9ad9a22d7a8178d5b42a8750123cbfe5b1">complete</a>)</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2bb0e112bf72fe63d733867f480d11b7">deferCondVar_</a>.<a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html">wait</a>(lock);</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; deferredNode = std::move(mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>[<a class="code" href="namespaceripple.html#a63a883cebf81b764433e67d90d4470d9ad9a22d7a8178d5b42a8750123cbfe5b1">complete</a>++]);</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; }</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; </div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; <span class="keyword">auto</span> parent = std::get&lt;0&gt;(deferredNode);</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span>&amp; parentID = std::get&lt;1&gt;(deferredNode);</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; <span class="keyword">auto</span> branch = std::get&lt;2&gt;(deferredNode);</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; <span class="keyword">auto</span> nodePtr = std::get&lt;3&gt;(deferredNode);</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span>&amp; nodeHash = parent-&gt;getChildHash(branch);</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; </div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; <span class="keywordflow">if</span> (nodePtr)</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; { <span class="comment">// Got the node</span></div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; nodePtr = parent-&gt;canonicalizeChild(branch, std::move(nodePtr));</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; </div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <span class="comment">// When we finish this stack, we need to restart</span></div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; <span class="comment">// with the parent of this node</span></div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>[parent] = parentID;</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160; }</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &gt; 0) &amp;&amp; (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">missingHashes_</a>.insert(nodeHash).second))</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160; {</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>.emplace_back(</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>&#160; parentID.getChildNodeID(branch), nodeHash.as_uint256());</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>&#160; --mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a>;</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160; }</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160; }</div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160; </div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">finishedReads_</a>.clear();</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a> = 0;</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160;}</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160; </div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;SHAMapNodeID, uint256&gt;</a>&gt;</div>
<div class="line"><a name="l00316"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#aa5a110117bc3ae3de8a49ba06c21fa04"> 316</a></span>&#160;SHAMap::getMissingNodes(<span class="keywordtype">int</span> max, <a class="code" href="classripple_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160;{</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160; assert(root_-&gt;getHash().isNonZero());</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160; assert(max &gt; 0);</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160; </div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>&#160; <a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html">MissingNodes</a> mn(</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160; max,</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; filter,</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160; 4096, <span class="comment">// number of async reads per pass</span></div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160; f_.getFullBelowCache(ledgerSeq_)-&gt;getGeneration());</div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160; </div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160; <span class="keywordflow">if</span> (!root_-&gt;isInner() ||</div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160; std::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_)-&gt;isFullBelow(</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">generation_</a>))</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160; {</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160; clearSynching();</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160; <span class="keywordflow">return</span> std::move(mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>);</div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>&#160; }</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160; </div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160; <span class="comment">// Start at the root.</span></div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160; <span class="comment">// The firstChild value is selected randomly so if multiple threads</span></div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160; <span class="comment">// are traversing the map, each thread will start at a different</span></div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160; <span class="comment">// (randomly selected) inner node. This increases the likelihood</span></div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>&#160; <span class="comment">// that the two threads will produce different request sets (which is</span></div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>&#160; <span class="comment">// more efficient than sending identical requests).</span></div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple.html">MissingNodes::StackEntry</a> pos{</div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>&#160; <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(root_.get()),</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>(),</div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>&#160; <a class="code" href="namespaceripple.html#a71a6227fec78db0b06595d62c06b25dc">rand_int</a>(255),</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>&#160; 0,</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160; <span class="keyword">true</span>};</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160; <span class="keyword">auto</span>&amp; node = std::get&lt;0&gt;(pos);</div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160; <span class="keyword">auto</span>&amp; nextChild = std::get&lt;3&gt;(pos);</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>&#160; <span class="keyword">auto</span>&amp; fullBelow = std::get&lt;4&gt;(pos);</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>&#160; </div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>&#160; <span class="comment">// Traverse the map without blocking</span></div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>&#160; <span class="keywordflow">do</span></div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>&#160; {</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>&#160; <span class="keywordflow">while</span> ((node != <span class="keyword">nullptr</span>) &amp;&amp; (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a> &lt;= mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ac6ae00f4088ecc66b71cf9c69b2e7afe">maxDefer_</a>))</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>&#160; {</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>&#160; gmn_ProcessNodes(mn, pos);</div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>&#160; </div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160; <span class="keywordflow">if</span> (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &lt;= 0)</div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>&#160; </div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>&#160; <span class="keywordflow">if</span> ((node == <span class="keyword">nullptr</span>) &amp;&amp; !mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.empty())</div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>&#160; {</div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>&#160; <span class="comment">// Pick up where we left off with this node&#39;s parent</span></div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>&#160; <span class="keywordtype">bool</span> was = fullBelow; <span class="comment">// was full below</span></div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>&#160; </div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>&#160; pos = mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.top();</div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.pop();</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>&#160; <span class="keywordflow">if</span> (nextChild == 0)</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>&#160; {</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>&#160; <span class="comment">// This is a node we are processing for the first time</span></div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>&#160; fullBelow = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>&#160; }</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>&#160; {</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>&#160; <span class="comment">// This is a node we are continuing to process</span></div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>&#160; fullBelow = fullBelow &amp;&amp; was; <span class="comment">// was and still is</span></div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>&#160; }</div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>&#160; assert(node);</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>&#160; }</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>&#160; }</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>&#160; </div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>&#160; <span class="comment">// We have either emptied the stack or</span></div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>&#160; <span class="comment">// posted as many deferred reads as we can</span></div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>&#160; <span class="keywordflow">if</span> (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">deferred_</a>)</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>&#160; gmn_ProcessDeferredReads(mn);</div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>&#160; </div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>&#160; <span class="keywordflow">if</span> (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">max_</a> &lt;= 0)</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>&#160; <span class="keywordflow">return</span> std::move(mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>);</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>&#160; </div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>&#160; <span class="keywordflow">if</span> (node == <span class="keyword">nullptr</span>)</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>&#160; { <span class="comment">// We weren&#39;t in the middle of processing a node</span></div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>&#160; </div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>&#160; <span class="keywordflow">if</span> (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.empty() &amp;&amp; !mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>.empty())</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>&#160; {</div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>&#160; <span class="comment">// Recheck nodes we could not finish before</span></div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; [<a class="code" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">innerNode</a>, nodeId] : mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>)</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>&#160; <span class="keywordflow">if</span> (!<a class="code" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">innerNode</a>-&gt;isFullBelow(mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">generation_</a>))</div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.push(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a>(</div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>&#160; <a class="code" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">innerNode</a>, nodeId, <a class="code" href="namespaceripple.html#a71a6227fec78db0b06595d62c06b25dc">rand_int</a>(255), 0, <span class="keyword">true</span>));</div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>&#160; </div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">resumes_</a>.clear();</div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>&#160; }</div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>&#160; </div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>&#160; <span class="keywordflow">if</span> (!mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.empty())</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>&#160; {</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>&#160; <span class="comment">// Resume at the top of the stack</span></div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160; pos = mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.top();</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160; mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">stack_</a>.pop();</div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160; assert(node != <span class="keyword">nullptr</span>);</div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>&#160; }</div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>&#160; }</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>&#160; </div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>&#160; <span class="comment">// node will only still be nullptr if</span></div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>&#160; <span class="comment">// we finished the current node, the stack is empty</span></div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>&#160; <span class="comment">// and we have no nodes to resume</span></div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>&#160; </div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>&#160; } <span class="keywordflow">while</span> (node != <span class="keyword">nullptr</span>);</div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>&#160; </div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>&#160; <span class="keywordflow">if</span> (mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>.empty())</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; clearSynching();</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>&#160; </div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>&#160; <span class="keywordflow">return</span> std::move(mn.<a class="code" href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">missingNodes_</a>);</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>&#160;}</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>&#160; </div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00426"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a82934b5efbae6aaebd17f74cad86c1f7"> 426</a></span>&#160;SHAMap::getNodeFat(</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; wanted,</div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;SHAMapNodeID&gt;</a>&amp; nodeIDs,</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Blob&gt;</a>&amp; rawNodes,</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>&#160; <span class="keywordtype">bool</span> fatLeaves,</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>&#160; <a class="codeRef" 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 name="l00432"></a><span class="lineno"> 432</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>&#160; <span class="comment">// Gets a node and some of its children</span></div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>&#160; <span class="comment">// to a specified depth</span></div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>&#160; </div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>&#160; <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>&#160; </div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>&#160; <span class="keywordflow">while</span> (node &amp;&amp; node-&gt;isInner() &amp;&amp; (nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &lt; wanted.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()))</div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>&#160; {</div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>&#160; <span class="keywordtype">int</span> branch = <a class="code" href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">selectBranch</a>(nodeID, wanted.<a class="code" href="classripple_1_1SHAMapNodeID.html#a01edaf807dbd6e2671e90b16a10a7e5a">getNodeID</a>());</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>&#160; <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>&#160; <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>&#160; </div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>&#160; node = descendThrow(inner, branch);</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>&#160; nodeID = nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>&#160; }</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>&#160; </div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>&#160; <span class="keywordflow">if</span> (node == <span class="keyword">nullptr</span> || wanted != nodeID)</div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>&#160; {</div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>&#160; JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;peer requested node that is not in the map:\n&quot;</span></div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>&#160; &lt;&lt; wanted &lt;&lt; <span class="stringliteral">&quot; but found\n&quot;</span></div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>&#160; &lt;&lt; nodeID;</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>&#160; }</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>&#160; </div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>&#160; <span class="keywordflow">if</span> (node-&gt;isInner() &amp;&amp; <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node)-&gt;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">isEmpty</a>())</div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>&#160; {</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>&#160; JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;peer requests empty node&quot;</span>;</div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>&#160; }</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>&#160; </div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>&#160; <a class="codeRef" 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 name="l00465"></a><span class="lineno"> 465</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/emplace.html">emplace</a>(node, nodeID, depth);</div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>&#160; </div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>&#160; <span class="keywordflow">while</span> (!stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>&#160; {</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(node, nodeID, depth) = stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>&#160; </div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>&#160; {</div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>&#160; <span class="comment">// Add this node to the reply</span></div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>&#160; node-&gt;serializeForWire(s);</div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>&#160; nodeIDs.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(nodeID);</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>&#160; rawNodes.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(std::move(s.<a class="code" href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">modData</a>()));</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>&#160; }</div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>&#160; </div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>&#160; <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>&#160; {</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>&#160; <span class="comment">// We descend inner nodes with only a single child</span></div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>&#160; <span class="comment">// without decrementing the depth</span></div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>&#160; <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>&#160; <span class="keywordtype">int</span> bc = inner-&gt;<a class="code" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">getBranchCount</a>();</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>&#160; <span class="keywordflow">if</span> ((depth &gt; 0) || (bc == 1))</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>&#160; {</div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>&#160; <span class="comment">// We need to process this node&#39;s children</span></div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>&#160; {</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>&#160; <span class="keywordflow">if</span> (!inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>&#160; {</div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> childNode = descendThrow(inner, i);</div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span> childID = nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(i);</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>&#160; </div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>&#160; <span class="keywordflow">if</span> (childNode-&gt;isInner() &amp;&amp; ((depth &gt; 1) || (bc == 1)))</div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>&#160; {</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>&#160; <span class="comment">// If there&#39;s more than one child, reduce the depth</span></div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>&#160; <span class="comment">// If only one child, follow the chain</span></div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/emplace.html">emplace</a>(</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>&#160; childNode,</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>&#160; childID,</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>&#160; (bc &gt; 1) ? (depth - 1) : depth);</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>&#160; }</div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (childNode-&gt;isInner() || fatLeaves)</div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>&#160; {</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>&#160; <span class="comment">// Just include this node</span></div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> ns;</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>&#160; childNode-&gt;serializeForWire(ns);</div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>&#160; nodeIDs.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(childID);</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>&#160; rawNodes.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(std::move(ns.<a class="code" href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">modData</a>()));</div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>&#160; }</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>&#160; }</div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>&#160; }</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>&#160; }</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>&#160; }</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>&#160; }</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>&#160; </div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>&#160;}</div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>&#160; </div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00523"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a73d3eb716abe882fd5ea183d6d13a7e3"> 523</a></span>&#160;SHAMap::serializeRoot(<a class="code" href="classripple_1_1Serializer.html">Serializer</a>&amp; s)<span class="keyword"> const</span></div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>&#160; root_-&gt;serializeForWire(s);</div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>&#160;}</div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>&#160; </div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>&#160;<a class="code" href="classripple_1_1SHAMapAddNode.html">SHAMapAddNode</a></div>
<div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a64ade0336e5125b3ae011da2a97a453d"> 529</a></span>&#160;SHAMap::addRootNode(</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>&#160; <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; hash,</div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>&#160; <a class="code" href="classripple_1_1Slice.html">Slice</a> <span class="keyword">const</span>&amp; rootNode,</div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>&#160; <a class="code" href="classripple_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>&#160;{</div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>&#160; <span class="comment">// we already have a root_ node</span></div>
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>&#160; <span class="keywordflow">if</span> (root_-&gt;getHash().isNonZero())</div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>&#160; {</div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>&#160; JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;got root node, already have one&quot;</span>;</div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>&#160; assert(root_-&gt;getHash() == hash);</div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>&#160; }</div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>&#160; </div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>&#160; assert(cowid_ &gt;= 1);</div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>&#160; <span class="keyword">auto</span> node = SHAMapTreeNode::makeFromWire(rootNode);</div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>&#160; <span class="keywordflow">if</span> (!node || node-&gt;getHash() != hash)</div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>&#160; </div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>&#160; <span class="keywordflow">if</span> (backed_)</div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>&#160; canonicalize(hash, node);</div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>&#160; </div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>&#160; root_ = node;</div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>&#160; </div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>&#160; <span class="keywordflow">if</span> (root_-&gt;isLeaf())</div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>&#160; clearSynching();</div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>&#160; </div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>&#160; <span class="keywordflow">if</span> (filter)</div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>&#160; {</div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>&#160; root_-&gt;serializeWithPrefix(s);</div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>&#160; filter-&gt;<a class="code" href="classripple_1_1SHAMapSyncFilter.html#a52d6a1cab3037707977a764d146d939f">gotNode</a>(</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>&#160; <span class="keyword">false</span>,</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>&#160; root_-&gt;getHash(),</div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>&#160; ledgerSeq_,</div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>&#160; std::move(s.<a class="code" href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">modData</a>()),</div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>&#160; root_-&gt;getType());</div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>&#160; }</div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>&#160; </div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>&#160;}</div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>&#160; </div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>&#160;<a class="code" href="classripple_1_1SHAMapAddNode.html">SHAMapAddNode</a></div>
<div class="line"><a name="l00571"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a5c78c5b45614fa7b5f7ecebbc7185944"> 571</a></span>&#160;SHAMap::addKnownNode(</div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>&#160; <span class="keyword">const</span> <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>&amp; node,</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>&#160; <a class="code" href="classripple_1_1Slice.html">Slice</a> <span class="keyword">const</span>&amp; rawNode,</div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>&#160; <a class="code" href="classripple_1_1SHAMapSyncFilter.html">SHAMapSyncFilter</a>* filter)</div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>&#160;{</div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>&#160; assert(!node.<a class="code" href="classripple_1_1SHAMapNodeID.html#a205ce1fb183881d67a7b171533141c6b">isRoot</a>());</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>&#160; </div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>&#160; <span class="keywordflow">if</span> (!isSynching())</div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>&#160; {</div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>&#160; JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;AddKnownNode while not synching&quot;</span>;</div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>&#160; }</div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>&#160; </div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> generation = f_.getFullBelowCache(ledgerSeq_)-&gt;getGeneration();</div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>&#160; <span class="keyword">auto</span> newNode = SHAMapTreeNode::makeFromWire(rawNode);</div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> iNodeID;</div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>&#160; <span class="keyword">auto</span> iNode = root_.get();</div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>&#160; </div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>&#160; <span class="keywordflow">while</span> (iNode-&gt;isInner() &amp;&amp;</div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>&#160; !<span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(iNode)-&gt;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a597b4db5c84297776d2e8ebdbe9e1b6f">isFullBelow</a>(generation) &amp;&amp;</div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>&#160; (iNodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &lt; node.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()))</div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>&#160; {</div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>&#160; <span class="keywordtype">int</span> branch = <a class="code" href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">selectBranch</a>(iNodeID, node.<a class="code" href="classripple_1_1SHAMapNodeID.html#a01edaf807dbd6e2671e90b16a10a7e5a">getNodeID</a>());</div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>&#160; assert(branch &gt;= 0);</div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>&#160; <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(iNode);</div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>&#160; <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>&#160; {</div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>&#160; 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 name="l00599"></a><span class="lineno"> 599</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>&#160; }</div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>&#160; </div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>&#160; <span class="keyword">auto</span> childHash = inner-&gt;getChildHash(branch);</div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>&#160; <span class="keywordflow">if</span> (f_.getFullBelowCache(ledgerSeq_)</div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>&#160; -&gt;touch_if_exists(childHash.as_uint256()))</div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>&#160; {</div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>&#160; }</div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>&#160; </div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>&#160; <span class="keyword">auto</span> prevNode = inner;</div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(iNode, iNodeID) = descend(inner, iNodeID, branch, filter);</div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>&#160; </div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>&#160; <span class="keywordflow">if</span> (iNode == <span class="keyword">nullptr</span>)</div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>&#160; {</div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>&#160; <span class="keywordflow">if</span> (!newNode || childHash != newNode-&gt;getHash())</div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>&#160; {</div>
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>&#160; JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;Corrupt node received&quot;</span>;</div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::invalid();</div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>&#160; }</div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>&#160; </div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>&#160; <span class="comment">// Inner nodes must be at a level strictly less than 64</span></div>
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>&#160; <span class="comment">// but leaf nodes (while notionally at level 64) can be</span></div>
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>&#160; <span class="comment">// at any depth up to and including 64:</span></div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>&#160; <span class="keywordflow">if</span> ((iNodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &gt; leafDepth) ||</div>
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>&#160; (newNode-&gt;isInner() &amp;&amp; iNodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() == leafDepth))</div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>&#160; {</div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>&#160; <span class="comment">// Map is provably invalid</span></div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>&#160; state_ = SHAMapState::Invalid;</div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>&#160; }</div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>&#160; </div>
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>&#160; <span class="keywordflow">if</span> (iNodeID != node)</div>
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>&#160; {</div>
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>&#160; <span class="comment">// Either this node is broken or we didn&#39;t request it (yet)</span></div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>&#160; JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;unable to hook node &quot;</span> &lt;&lt; node;</div>
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>&#160; JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot; stuck at &quot;</span> &lt;&lt; iNodeID;</div>
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>&#160; JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot;got depth=&quot;</span> &lt;&lt; node.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()</div>
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>&#160; &lt;&lt; <span class="stringliteral">&quot;, walked to= &quot;</span> &lt;&lt; iNodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>();</div>
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>&#160; }</div>
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>&#160; </div>
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>&#160; <span class="keywordflow">if</span> (backed_)</div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>&#160; canonicalize(childHash, newNode);</div>
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>&#160; </div>
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>&#160; newNode = prevNode-&gt;canonicalizeChild(branch, std::move(newNode));</div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>&#160; </div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>&#160; <span class="keywordflow">if</span> (filter)</div>
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>&#160; {</div>
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>&#160; newNode-&gt;serializeWithPrefix(s);</div>
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>&#160; filter-&gt;<a class="code" href="classripple_1_1SHAMapSyncFilter.html#a52d6a1cab3037707977a764d146d939f">gotNode</a>(</div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>&#160; <span class="keyword">false</span>,</div>
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>&#160; childHash,</div>
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>&#160; ledgerSeq_,</div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>&#160; std::move(s.<a class="code" href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">modData</a>()),</div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>&#160; newNode-&gt;getType());</div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>&#160; }</div>
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>&#160; </div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::useful();</div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>&#160; }</div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>&#160; }</div>
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>&#160; </div>
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>&#160; JLOG(journal_.trace()) &lt;&lt; <span class="stringliteral">&quot;got node, already had it (late)&quot;</span>;</div>
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>&#160; <span class="keywordflow">return</span> SHAMapAddNode::duplicate();</div>
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>&#160;}</div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>&#160; </div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00667"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#af0792d9d5d0e62b966754dcdee79e1ea"> 667</a></span>&#160;SHAMap::deepCompare(<a class="code" href="classripple_1_1SHAMap.html">SHAMap</a>&amp; other)<span class="keyword"> const</span></div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>&#160; <span class="comment">// Intended for debug/test only</span></div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>&#160; <a class="codeRef" 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 name="l00671"></a><span class="lineno"> 671</span>&#160; </div>
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({root_.get(), other.<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>.get()});</div>
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>&#160; </div>
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>&#160; <span class="keywordflow">while</span> (!stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>&#160; {</div>
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> [node, otherNode] = stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>&#160; </div>
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>&#160; <span class="keywordflow">if</span> (!node || !otherNode)</div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>&#160; {</div>
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>&#160; JLOG(journal_.info()) &lt;&lt; <span class="stringliteral">&quot;unable to fetch node&quot;</span>;</div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>&#160; }</div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (otherNode-&gt;getHash() != node-&gt;getHash())</div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>&#160; {</div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>&#160; JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;node hash mismatch&quot;</span>;</div>
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>&#160; }</div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>&#160; </div>
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>&#160; <span class="keywordflow">if</span> (node-&gt;isLeaf())</div>
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>&#160; {</div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>&#160; <span class="keywordflow">if</span> (!otherNode-&gt;isLeaf())</div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>&#160; <span class="keyword">auto</span>&amp; nodePeek = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(node)-&gt;peekItem();</div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>&#160; <span class="keyword">auto</span>&amp; otherNodePeek =</div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>&#160; <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode)-&gt;peekItem();</div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>&#160; <span class="keywordflow">if</span> (nodePeek-&gt;key() != otherNodePeek-&gt;key())</div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>&#160; <span class="keywordflow">if</span> (nodePeek-&gt;slice() != otherNodePeek-&gt;slice())</div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>&#160; }</div>
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>&#160; {</div>
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>&#160; <span class="keywordflow">if</span> (!otherNode-&gt;isInner())</div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>&#160; <span class="keyword">auto</span> node_inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>&#160; <span class="keyword">auto</span> other_inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>&#160; {</div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>&#160; <span class="keywordflow">if</span> (node_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>&#160; {</div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>&#160; <span class="keywordflow">if</span> (!other_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>&#160; }</div>
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>&#160; {</div>
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>&#160; <span class="keywordflow">if</span> (other_inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>&#160; </div>
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>&#160; <span class="keyword">auto</span> next = descend(node_inner, i);</div>
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>&#160; <span class="keyword">auto</span> otherNext = other.<a class="code" href="classripple_1_1SHAMap.html#a586781012c019333e8286bf824310fd2">descend</a>(other_inner, i);</div>
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>&#160; <span class="keywordflow">if</span> (!next || !otherNext)</div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>&#160; {</div>
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>&#160; JLOG(journal_.warn()) &lt;&lt; <span class="stringliteral">&quot;unable to fetch inner node&quot;</span>;</div>
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>&#160; }</div>
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({next, otherNext});</div>
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>&#160; }</div>
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>&#160; }</div>
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>&#160; }</div>
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>&#160; }</div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>&#160; </div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>&#160;}</div>
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>&#160; </div>
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00739"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a8a20e910f929701bee2a43d408dd7afa"> 739</a></span>&#160;SHAMap::hasInnerNode(</div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> <span class="keyword">const</span>&amp; targetNodeID,</div>
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>&#160; <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; targetNodeHash)<span class="keyword"> const</span></div>
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>&#160; <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>&#160; </div>
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>&#160; <span class="keywordflow">while</span> (node-&gt;isInner() &amp;&amp; (nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>() &lt; targetNodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">getDepth</a>()))</div>
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>&#160; {</div>
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>&#160; <span class="keywordtype">int</span> branch = <a class="code" href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">selectBranch</a>(nodeID, targetNodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a01edaf807dbd6e2671e90b16a10a7e5a">getNodeID</a>());</div>
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>&#160; <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>&#160; <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>&#160; </div>
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>&#160; node = descendThrow(inner, branch);</div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>&#160; nodeID = nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</div>
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>&#160; }</div>
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>&#160; </div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>&#160; <span class="keywordflow">return</span> (node-&gt;isInner()) &amp;&amp; (node-&gt;getHash() == targetNodeHash);</div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>&#160;}</div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>&#160; </div>
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00763"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e"> 763</a></span>&#160;SHAMap::hasLeafNode(<a class="code" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; tag, <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; targetNodeHash)<span class="keyword"> const</span></div>
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>&#160; <span class="keyword">auto</span> node = root_.get();</div>
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>&#160; <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a> nodeID;</div>
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>&#160; </div>
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>&#160; <span class="keywordflow">if</span> (!node-&gt;isInner()) <span class="comment">// only one leaf node in the tree</span></div>
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>&#160; <span class="keywordflow">return</span> node-&gt;getHash() == targetNodeHash;</div>
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>&#160; </div>
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>&#160; <span class="keywordflow">do</span></div>
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>&#160; {</div>
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>&#160; <span class="keywordtype">int</span> branch = <a class="code" href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">selectBranch</a>(nodeID, tag);</div>
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>&#160; <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>&#160; <span class="keywordflow">if</span> (inner-&gt;isEmptyBranch(branch))</div>
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>&#160; <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 name="l00777"></a><span class="lineno"> 777</span>&#160; </div>
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>&#160; <span class="keywordflow">if</span> (inner-&gt;getChildHash(branch) ==</div>
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>&#160; targetNodeHash) <span class="comment">// Matching leaf, no need to retrieve it</span></div>
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>&#160; </div>
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>&#160; node = descendThrow(inner, branch);</div>
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>&#160; nodeID = nodeID.<a class="code" href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">getChildNodeID</a>(branch);</div>
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>&#160; } <span class="keywordflow">while</span> (node-&gt;isInner());</div>
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>&#160; </div>
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>&#160; <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 name="l00787"></a><span class="lineno"> 787</span>&#160; <span class="comment">// already</span></div>
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>&#160;}</div>
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>&#160; </div>
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/optional.html">std::optional&lt;std::vector&lt;Blob&gt;</a>&gt;</div>
<div class="line"><a name="l00791"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#afcf889076d5459b52eb9eb8248344f5c"> 791</a></span>&#160;SHAMap::getProofPath(<a class="code" 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 name="l00792"></a><span class="lineno"> 792</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">SharedPtrNodeStack</a> stack;</div>
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>&#160; walkTowardsKey(key, &amp;stack);</div>
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>&#160; </div>
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>&#160; <span class="keywordflow">if</span> (stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>&#160; {</div>
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>&#160; JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>&#160; <span class="keywordflow">return</span> {};</div>
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>&#160; }</div>
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>&#160; </div>
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>&#160; <span class="keywordflow">if</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; node = stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>().<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">first</a>; !node || node-&gt;isInner() ||</div>
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>&#160; std::static_pointer_cast&lt;SHAMapLeafNode&gt;(node)-&gt;peekItem()-&gt;key() !=</div>
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>&#160; key)</div>
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>&#160; {</div>
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>&#160; JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>&#160; <span class="keywordflow">return</span> {};</div>
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>&#160; }</div>
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>&#160; </div>
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Blob&gt;</a> path;</div>
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>&#160; path.reserve(stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/size.html">size</a>());</div>
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>&#160; <span class="keywordflow">while</span> (!stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>&#160; {</div>
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>().<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">first</a>-&gt;serializeForWire(s);</div>
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>&#160; path.emplace_back(std::move(s.<a class="code" href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">modData</a>()));</div>
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>&#160; }</div>
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>&#160; </div>
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>&#160; 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 name="l00821"></a><span class="lineno"> 821</span>&#160; &lt;&lt; path.size();</div>
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>&#160; <span class="keywordflow">return</span> path;</div>
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>&#160;}</div>
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>&#160; </div>
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00826"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#af382ac10dccf3f4b82c64548cd05a677"> 826</a></span>&#160;SHAMap::verifyProofPath(</div>
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>&#160; <a class="code" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; rootHash,</div>
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>&#160; <a class="code" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; key,</div>
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>&#160; <a class="codeRef" 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 name="l00830"></a><span class="lineno"> 830</span>&#160;{</div>
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>&#160; <span class="keywordflow">if</span> (path.empty() || path.size() &gt; 65)</div>
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>&#160; </div>
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>&#160; <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> hash{rootHash};</div>
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>&#160; <span class="keywordflow">try</span></div>
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>&#160; {</div>
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> rit = path.rbegin(); rit != path.rend(); ++rit)</div>
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>&#160; {</div>
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span>&amp; blob = *rit;</div>
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>&#160; <span class="keyword">auto</span> node = SHAMapTreeNode::makeFromWire(<a class="code" href="namespaceripple.html#aabe37451093c21757855542d68fba3ce">makeSlice</a>(blob));</div>
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>&#160; <span class="keywordflow">if</span> (!node)</div>
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>&#160; node-&gt;updateHash();</div>
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>&#160; <span class="keywordflow">if</span> (node-&gt;getHash() != hash)</div>
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>&#160; </div>
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>&#160; <span class="keyword">auto</span> depth = <a class="codeRef" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(path.rbegin(), rit);</div>
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>&#160; <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>&#160; {</div>
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>&#160; <span class="keyword">auto</span> nodeId = SHAMapNodeID::createID(depth, key);</div>
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>&#160; hash = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node.get())</div>
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>&#160; -&gt;getChildHash(<a class="code" href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">selectBranch</a>(nodeId, key));</div>
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>&#160; }</div>
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>&#160; {</div>
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>&#160; <span class="comment">// should exhaust all the blobs now</span></div>
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>&#160; <span class="keywordflow">return</span> depth + 1 == path.size();</div>
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>&#160; }</div>
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>&#160; }</div>
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>&#160; }</div>
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>&#160; <span class="keywordflow">catch</span> (<a class="codeRef" href="http://en.cppreference.com/w/cpp/error/exception.html">std::exception</a> <span class="keyword">const</span>&amp;)</div>
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>&#160; {</div>
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>&#160; <span class="comment">// the data in the path may come from the network,</span></div>
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>&#160; <span class="comment">// exception could be thrown when parsing the data</span></div>
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>&#160; }</div>
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>&#160;}</div>
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>&#160; </div>
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>&#160;} <span class="comment">// namespace ripple</span></div>
</div><!-- fragment --></div><!-- contents -->
<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#l00465">SHAMap.h:465</a></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#l00028">SHAMapAddNode.h:28</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a033dc682ae2682f64b8e8973ae7bdc2b"><div class="ttname"><a href="classripple_1_1SHAMap.html#a033dc682ae2682f64b8e8973ae7bdc2b">ripple::SHAMap::visitDifferences</a></div><div class="ttdeci">void visitDifferences(SHAMap const *have, std::function&lt; bool(SHAMapTreeNode const &amp;)&gt;) 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#l00100">SHAMapSync.cpp:100</a></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="aclassripple_1_1SHAMap_html_aa3221154f0a1742601dba0160b900ae1"><div class="ttname"><a href="classripple_1_1SHAMap.html#aa3221154f0a1742601dba0160b900ae1">ripple::SHAMap::descendNoStore</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapTreeNode &gt; descendNoStore(std::shared_ptr&lt; SHAMapInnerNode &gt; const &amp;, int branch) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8cpp_source.html#l00340">SHAMap.cpp:340</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_aabe37451093c21757855542d68fba3ce"><div class="ttname"><a href="namespaceripple.html#aabe37451093c21757855542d68fba3ce">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#l00240">Slice.h:240</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#l00074">SHAMapNodeID.cpp:74</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#l00505">SHAMap.h:505</a></div></div>
<div class="ttc" id="anamespaceripple_html_a63a883cebf81b764433e67d90d4470d9ad9a22d7a8178d5b42a8750123cbfe5b1"><div class="ttname"><a href="namespaceripple.html#a63a883cebf81b764433e67d90d4470d9ad9a22d7a8178d5b42a8750123cbfe5b1">ripple::ShardState::complete</a></div><div class="ttdeci">@ complete</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</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#l00110">SHAMap.h:110</a></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 class="ttdoc">STL class.</div></div>
<div class="ttc" id="anamespaceripple_html_a179c66641961c1b976e7c050860064a3"><div class="ttname"><a href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">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#l00121">SHAMapNodeID.cpp:121</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#l00495">SHAMap.h:495</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#l00739">SHAMapSync.cpp:739</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#l00504">SHAMap.h:504</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_a6d7436e5990cb278bd924cef9396df3c"><div class="ttname"><a href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">ripple::Serializer::modData</a></div><div class="ttdeci">Blob &amp; modData()</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8h_source.html#l00178">Serializer.h:178</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#l00044">Slice.h:44</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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</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="astructripple_1_1SHAMap_1_1MissingNodes_html_ac6ae00f4088ecc66b71cf9c69b2e7afe"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ac6ae00f4088ecc66b71cf9c69b2e7afe">ripple::SHAMap::MissingNodes::maxDefer_</a></div><div class="ttdeci">const int maxDefer_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00475">SHAMap.h:475</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#l00476">SHAMap.h:476</a></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 class="ttdoc">STL class.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a122cf539ce917e7a322cfb41c8db3f57"><div class="ttname"><a href="classripple_1_1SHAMap.html#a122cf539ce917e7a322cfb41c8db3f57">ripple::SHAMap::peekItem</a></div><div class="ttdeci">std::shared_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#l00561">SHAMap.cpp:561</a></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="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="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="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#l00507">SHAMap.h:507</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="aclassripple_1_1Family_html_ac16fa71cf792d5716da74e9164707769"><div class="ttname"><a href="classripple_1_1Family.html#ac16fa71cf792d5716da74e9164707769">ripple::Family::getFullBelowCache</a></div><div class="ttdeci">virtual std::shared_ptr&lt; FullBelowCache &gt; getFullBelowCache(std::uint32_t ledgerSeq)=0</div><div class="ttdoc">Return a pointer to the Family Full Below Cache.</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#l00033">SHAMapNodeID.h:33</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#l00474">SHAMap.h:474</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_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#l00172">SHAMapSync.cpp:172</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#l00032">SHAMapLeafNode.h:32</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#l00032">SHAMapHash.h:32</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#l00098">SHAMap.h:98</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="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</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#l00195">SHAMapInnerNode.h:195</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="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#l00511">SHAMap.h:511</a></div></div>
<div class="ttc" id="anamespaceripple_html_a71a6227fec78db0b06595d62c06b25dc"><div class="ttname"><a href="namespaceripple.html#a71a6227fec78db0b06595d62c06b25dc">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="ripple_2basics_2random_8h_source.html#l00115">ripple/basics/random.h:115</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="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#l00353">SHAMapInnerNode.cpp:353</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#l00763">SHAMapSync.cpp:763</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#l00039">SHAMapInnerNode.h:39</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#l00473">SHAMap.h:473</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a483e3bb899522c7abfbf8218c5b21946"><div class="ttname"><a href="classripple_1_1SHAMap.html#a483e3bb899522c7abfbf8218c5b21946">ripple::SHAMap::visitLeaves</a></div><div class="ttdeci">void visitLeaves(std::function&lt; void(std::shared_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#l00027">SHAMapSync.cpp:27</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#l00201">SHAMapInnerNode.h:201</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="aunique_lock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/unique_lock.html">std::unique_lock</a></div><div class="ttdoc">STL class.</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#l00095">SHAMap.h:95</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="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="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#l00053">SHAMapTreeNode.h:53</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#l00283">SHAMap.cpp:283</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#l00480">SHAMap.h:480</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#l00058">SHAMapNodeID.h:58</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_8cpp_source.html#l00264">SHAMapInnerNode.cpp:264</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="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 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="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#l00039">Serializer.h:39</a></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="RCLCensorshipDetector_8h_source.html#l00029">RCLCensorshipDetector.h:29</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#l00506">SHAMap.h:506</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#l00380">SHAMap.cpp:380</a></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="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="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#l00039">SHAMapSync.cpp:39</a></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="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="aclassripple_1_1SHAMapNodeID_html_a01edaf807dbd6e2671e90b16a10a7e5a"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a01edaf807dbd6e2671e90b16a10a7e5a">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#l00064">SHAMapNodeID.h:64</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_8cpp_source.html#l00258">SHAMapInnerNode.cpp:258</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapLeafNode_html_a1b82b561c8fe9afc2a4a281dbb3e833c"><div class="ttname"><a href="classripple_1_1SHAMapLeafNode.html#a1b82b561c8fe9afc2a4a281dbb3e833c">ripple::SHAMapLeafNode::peekItem</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapItem const &gt; const &amp; peekItem() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapLeafNode_8cpp_source.html#l00044">SHAMapLeafNode.cpp:44</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#l00306">SHAMap.cpp:306</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_acbedaf0be7acd2816e01be821fdc4697"><div class="ttname"><a href="classripple_1_1SHAMap.html#acbedaf0be7acd2816e01be821fdc4697">ripple::SHAMap::ledgerSeq_</a></div><div class="ttdeci">std::uint32_t ledgerSeq_</div><div class="ttdoc">The sequence of the ledger that this map references, if any.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00105">SHAMap.h:105</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#l00030">SHAMapSyncFilter.h:30</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#l00479">SHAMap.h:479</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#l00048">SHAMapNodeID.h:48</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a5b5f477358f0d5ce1b24d0888ffefb1d"><div class="ttname"><a href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">ripple::SHAMap::root_</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapTreeNode &gt; root_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00107">SHAMap.h:107</a></div></div>
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.17
</small></address>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink