mirror of
https://github.com/seigler/dash-docs
synced 2025-07-27 17:56:16 +00:00
135 lines
45 KiB
HTML
135 lines
45 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.14"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Dash Core: src/merkleblock.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="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="bitcoin_logo_doxygen.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Dash Core
|
|
 <span id="projectnumber">0.12.2.1</span>
|
|
</div>
|
|
<div id="projectbrief">P2P Digital Currency</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.14 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&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&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('merkleblock_8cpp_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">merkleblock.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="merkleblock_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright (c) 2009-2010 Satoshi Nakamoto</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Copyright (c) 2009-2015 The Bitcoin Core developers</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Distributed under the MIT software license, see the accompanying</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// file COPYING or http://www.opensource.org/licenses/mit-license.php.</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> </div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#include "<a class="code" href="merkleblock_8h.html">merkleblock.h</a>"</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include "<a class="code" href="hash_8h.html">hash.h</a>"</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include "<a class="code" href="consensus_8h.html">consensus/consensus.h</a>"</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "<a class="code" href="utilstrencodings_8h.html">utilstrencodings.h</a>"</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="keyword">using namespace </span><a class="code" href="namespacestd.html">std</a>;</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"><a class="line" href="classCMerkleBlock.html#a5d08ce7034216ca25b0f9eab6bf8c389"> 14</a></span> <a class="code" href="classCMerkleBlock.html#a0f02da9fc9fda85f7f292f2c2874ed39">CMerkleBlock::CMerkleBlock</a>(<span class="keyword">const</span> <a class="code" href="classCBlock.html">CBlock</a>& block, <a class="code" href="classCBloomFilter.html">CBloomFilter</a>& filter)</div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> {</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  header = block.<a class="code" href="classCBlock.html#a7c8d280db581c02f49a66a5cdef2eded">GetBlockHeader</a>();</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  vector<bool> vMatch;</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  vector<uint256> vHashes;</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  vMatch.reserve(block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>.size());</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  vHashes.reserve(block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>.size());</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>.size(); i++)</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  {</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keyword">const</span> <a class="code" href="classuint256.html">uint256</a>& hash = block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>[i].GetHash();</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keywordflow">if</span> (filter.<a class="code" href="classCBloomFilter.html#aec420a9b66ab133090c2b4b8ed286f79">IsRelevantAndUpdate</a>(block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>[i]))</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  vMatch.push_back(<span class="keyword">true</span>);</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  vMatchedTxn.push_back(make_pair(i, hash));</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  }</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  vMatch.push_back(<span class="keyword">false</span>);</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  vHashes.push_back(hash);</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  }</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  txn = <a class="code" href="classCPartialMerkleTree.html">CPartialMerkleTree</a>(vHashes, vMatch);</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> }</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="classCMerkleBlock.html#a720f9e78e80b415cf6b607b189eec31b"> 40</a></span> <a class="code" href="classCMerkleBlock.html#a0f02da9fc9fda85f7f292f2c2874ed39">CMerkleBlock::CMerkleBlock</a>(<span class="keyword">const</span> <a class="code" href="classCBlock.html">CBlock</a>& block, <span class="keyword">const</span> std::set<uint256>& txids)</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  header = block.<a class="code" href="classCBlock.html#a7c8d280db581c02f49a66a5cdef2eded">GetBlockHeader</a>();</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  vector<bool> vMatch;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  vector<uint256> vHashes;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  vMatch.reserve(block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>.size());</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  vHashes.reserve(block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>.size());</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>.size(); i++)</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <a class="code" href="classuint256.html">uint256</a>& hash = block.<a class="code" href="classCBlock.html#a9b6508d662722775f3029b980b382b66">vtx</a>[i].GetHash();</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (txids.count(hash))</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  vMatch.push_back(<span class="keyword">true</span>);</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  vMatch.push_back(<span class="keyword">false</span>);</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  vHashes.push_back(hash);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  txn = <a class="code" href="classCPartialMerkleTree.html">CPartialMerkleTree</a>(vHashes, vMatch);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="classCPartialMerkleTree.html#a69e7771f95c498f6a340dcc227abcde4"> 63</a></span> <a class="code" href="classuint256.html">uint256</a> <a class="code" href="classCPartialMerkleTree.html#a69e7771f95c498f6a340dcc227abcde4">CPartialMerkleTree::CalcHash</a>(<span class="keywordtype">int</span> height, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos, <span class="keyword">const</span> std::vector<uint256> &vTxid) {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">if</span> (height == 0) {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// hash at height 0 is the txids themself</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">return</span> vTxid[pos];</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// calculate left hash</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="classuint256.html">uint256</a> left = CalcHash(height-1, pos*2, vTxid), right;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// calculate right hash if not beyond the end of the array - copy left hash otherwise1</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (pos*2+1 < CalcTreeWidth(height-1))</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  right = CalcHash(height-1, pos*2+1, vTxid);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  right = left;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// combine subhashes</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">return</span> <a class="code" href="hash_8h.html#ab3f6c437460137530d86e09c2c102e99">Hash</a>(<a class="code" href="utilstrencodings_8h.html#a5f5e63e2c340bc52049e38c09b37e6e1">BEGIN</a>(left), <a class="code" href="utilstrencodings_8h.html#ac32457d3f041434e57a2924847796fda">END</a>(left), <a class="code" href="utilstrencodings_8h.html#a5f5e63e2c340bc52049e38c09b37e6e1">BEGIN</a>(right), <a class="code" href="utilstrencodings_8h.html#ac32457d3f041434e57a2924847796fda">END</a>(right));</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="classCPartialMerkleTree.html#a62bdcaf5b5ee6c6327ef67fb027a5fef"> 80</a></span> <span class="keywordtype">void</span> <a class="code" href="classCPartialMerkleTree.html#a62bdcaf5b5ee6c6327ef67fb027a5fef">CPartialMerkleTree::TraverseAndBuild</a>(<span class="keywordtype">int</span> height, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos, <span class="keyword">const</span> std::vector<uint256> &vTxid, <span class="keyword">const</span> std::vector<bool> &vMatch) {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// determine whether this node is the parent of at least one matched txid</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">bool</span> fParentOfMatch = <span class="keyword">false</span>;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="namespacerpc-tests.html#a5634cc986fc764eff8c617f53bf2e8dc">p</a> = pos << height; <a class="code" href="namespacerpc-tests.html#a5634cc986fc764eff8c617f53bf2e8dc">p</a> < (pos+1) << height && <a class="code" href="namespacerpc-tests.html#a5634cc986fc764eff8c617f53bf2e8dc">p</a> < nTransactions; <a class="code" href="namespacerpc-tests.html#a5634cc986fc764eff8c617f53bf2e8dc">p</a>++)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  fParentOfMatch |= vMatch[<a class="code" href="namespacerpc-tests.html#a5634cc986fc764eff8c617f53bf2e8dc">p</a>];</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// store as flag bit</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  vBits.push_back(fParentOfMatch);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (height==0 || !fParentOfMatch) {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// if at height 0, or nothing interesting below, store hash and stop</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  vHash.push_back(CalcHash(height, pos, vTxid));</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// otherwise, don't store any hash, but descend into the subtrees</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  TraverseAndBuild(height-1, pos*2, vTxid, vMatch);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (pos*2+1 < CalcTreeWidth(height-1))</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  TraverseAndBuild(height-1, pos*2+1, vTxid, vMatch);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="classCPartialMerkleTree.html#a3ddbe75a92d93059c30f6e60bacc7054"> 98</a></span> <a class="code" href="classuint256.html">uint256</a> <a class="code" href="classCPartialMerkleTree.html#a3ddbe75a92d93059c30f6e60bacc7054">CPartialMerkleTree::TraverseAndExtract</a>(<span class="keywordtype">int</span> height, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> &nBitsUsed, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> &nHashUsed, std::vector<uint256> &vMatch) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (nBitsUsed >= vBits.size()) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// overflowed the bits array - failure</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  fBad = <span class="keyword">true</span>;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordtype">bool</span> fParentOfMatch = vBits[nBitsUsed++];</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">if</span> (height==0 || !fParentOfMatch) {</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// if at height 0, or nothing interesting below, use stored hash and do not descend</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (nHashUsed >= vHash.size()) {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// overflowed the hash array - failure</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  fBad = <span class="keyword">true</span>;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <a class="code" href="classuint256.html">uint256</a> &hash = vHash[nHashUsed++];</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">if</span> (height==0 && fParentOfMatch) <span class="comment">// in case of height 0, we have a matched txid</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  vMatch.push_back(hash);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">return</span> hash;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// otherwise, descend into the subtrees to extract matched txids and hashes</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="classuint256.html">uint256</a> left = TraverseAndExtract(height-1, pos*2, nBitsUsed, nHashUsed, vMatch), right;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (pos*2+1 < CalcTreeWidth(height-1)) {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  right = TraverseAndExtract(height-1, pos*2+1, nBitsUsed, nHashUsed, vMatch);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">if</span> (right == left) {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// The left and right branches should never be identical, as the transaction</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// hashes covered by them must each be unique.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  fBad = <span class="keyword">true</span>;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  right = left;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// and combine them before returning</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> <a class="code" href="hash_8h.html#ab3f6c437460137530d86e09c2c102e99">Hash</a>(<a class="code" href="utilstrencodings_8h.html#a5f5e63e2c340bc52049e38c09b37e6e1">BEGIN</a>(left), <a class="code" href="utilstrencodings_8h.html#ac32457d3f041434e57a2924847796fda">END</a>(left), <a class="code" href="utilstrencodings_8h.html#a5f5e63e2c340bc52049e38c09b37e6e1">BEGIN</a>(right), <a class="code" href="utilstrencodings_8h.html#ac32457d3f041434e57a2924847796fda">END</a>(right));</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="classCPartialMerkleTree.html#a0656767dc0d8f3d603c54e5be21d3890"> 134</a></span> <a class="code" href="classCPartialMerkleTree.html#aad4948ace869c92614310846f9d9980d">CPartialMerkleTree::CPartialMerkleTree</a>(<span class="keyword">const</span> std::vector<uint256> &vTxid, <span class="keyword">const</span> std::vector<bool> &vMatch) : nTransactions(vTxid.size()), fBad(false) {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// reset state</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="classCPartialMerkleTree.html#a22a522d1fb8d449f4c91b65283339e7d">vBits</a>.clear();</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="classCPartialMerkleTree.html#a863cf9024be1b8fa97db08dfd6dbd687">vHash</a>.clear();</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// calculate height of tree</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">int</span> nHeight = 0;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">while</span> (<a class="code" href="classCPartialMerkleTree.html#a7dd0288d62321fb5aa2c27a3372ee8fe">CalcTreeWidth</a>(nHeight) > 1)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  nHeight++;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// traverse the partial tree</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <a class="code" href="classCPartialMerkleTree.html#a62bdcaf5b5ee6c6327ef67fb027a5fef">TraverseAndBuild</a>(nHeight, 0, vTxid, vMatch);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="classCPartialMerkleTree.html#aad4948ace869c92614310846f9d9980d"> 148</a></span> <a class="code" href="classCPartialMerkleTree.html#aad4948ace869c92614310846f9d9980d">CPartialMerkleTree::CPartialMerkleTree</a>() : nTransactions(0), fBad(true) {}</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="classCPartialMerkleTree.html#a28c3456d1159b33b6c2689ac88eb56ad"> 150</a></span> <a class="code" href="classuint256.html">uint256</a> <a class="code" href="classCPartialMerkleTree.html#a28c3456d1159b33b6c2689ac88eb56ad">CPartialMerkleTree::ExtractMatches</a>(std::vector<uint256> &vMatch) {</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  vMatch.clear();</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// An empty set will not work</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (<a class="code" href="classCPartialMerkleTree.html#a0d3bd530f19f2c75c140a05c6f99782a">nTransactions</a> == 0)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// check for excessively high numbers of transactions</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (<a class="code" href="classCPartialMerkleTree.html#a0d3bd530f19f2c75c140a05c6f99782a">nTransactions</a> > <a class="code" href="consensus_8h.html#aa372df0d6494f4aaca5ecf5a5a9d4406">MaxBlockSize</a>(<span class="keyword">true</span>) / 60) <span class="comment">// 60 is the lower bound for the size of a serialized CTransaction</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// there can never be more hashes provided than one for every txid</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (<a class="code" href="classCPartialMerkleTree.html#a863cf9024be1b8fa97db08dfd6dbd687">vHash</a>.size() > <a class="code" href="classCPartialMerkleTree.html#a0d3bd530f19f2c75c140a05c6f99782a">nTransactions</a>)</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// there must be at least one bit per node in the partial tree, and at least one node per hash</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">if</span> (<a class="code" href="classCPartialMerkleTree.html#a22a522d1fb8d449f4c91b65283339e7d">vBits</a>.size() < <a class="code" href="classCPartialMerkleTree.html#a863cf9024be1b8fa97db08dfd6dbd687">vHash</a>.size())</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// calculate height of tree</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordtype">int</span> nHeight = 0;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">while</span> (<a class="code" href="classCPartialMerkleTree.html#a7dd0288d62321fb5aa2c27a3372ee8fe">CalcTreeWidth</a>(nHeight) > 1)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  nHeight++;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// traverse the partial tree</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> nBitsUsed = 0, nHashUsed = 0;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <a class="code" href="classuint256.html">uint256</a> hashMerkleRoot = <a class="code" href="classCPartialMerkleTree.html#a3ddbe75a92d93059c30f6e60bacc7054">TraverseAndExtract</a>(nHeight, 0, nBitsUsed, nHashUsed, vMatch);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// verify that no problems occurred during the tree traversal</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">if</span> (<a class="code" href="classCPartialMerkleTree.html#a24bb0d9d17d6001dcfbca4d550c64ba3">fBad</a>)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// verify that all bits were consumed (except for the padding caused by serializing it as a byte sequence)</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> ((nBitsUsed+7)/8 != (<a class="code" href="classCPartialMerkleTree.html#a22a522d1fb8d449f4c91b65283339e7d">vBits</a>.size()+7)/8)</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// verify that all hashes were consumed</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">if</span> (nHashUsed != <a class="code" href="classCPartialMerkleTree.html#a863cf9024be1b8fa97db08dfd6dbd687">vHash</a>.size())</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">return</span> <a class="code" href="classuint256.html">uint256</a>();</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> hashMerkleRoot;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> }</div><div class="ttc" id="consensus_8h_html_aa372df0d6494f4aaca5ecf5a5a9d4406"><div class="ttname"><a href="consensus_8h.html#aa372df0d6494f4aaca5ecf5a5a9d4406">MaxBlockSize</a></div><div class="ttdeci">unsigned int MaxBlockSize(bool fDIP0001Active)</div><div class="ttdef"><b>Definition:</b> <a href="consensus_8h_source.html#l00012">consensus.h:12</a></div></div>
|
|
<div class="ttc" id="hash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.h</a></div></div>
|
|
<div class="ttc" id="namespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a28c3456d1159b33b6c2689ac88eb56ad"><div class="ttname"><a href="classCPartialMerkleTree.html#a28c3456d1159b33b6c2689ac88eb56ad">CPartialMerkleTree::ExtractMatches</a></div><div class="ttdeci">uint256 ExtractMatches(std::vector< uint256 > &vMatch)</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8cpp_source.html#l00150">merkleblock.cpp:150</a></div></div>
|
|
<div class="ttc" id="classCMerkleBlock_html_a0f02da9fc9fda85f7f292f2c2874ed39"><div class="ttname"><a href="classCMerkleBlock.html#a0f02da9fc9fda85f7f292f2c2874ed39">CMerkleBlock::CMerkleBlock</a></div><div class="ttdeci">CMerkleBlock()</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8h_source.html#l00145">merkleblock.h:145</a></div></div>
|
|
<div class="ttc" id="classCBlock_html_a9b6508d662722775f3029b980b382b66"><div class="ttname"><a href="classCBlock.html#a9b6508d662722775f3029b980b382b66">CBlock::vtx</a></div><div class="ttdeci">std::vector< CTransaction > vtx</div><div class="ttdef"><b>Definition:</b> <a href="block_8h_source.html#l00077">block.h:77</a></div></div>
|
|
<div class="ttc" id="utilstrencodings_8h_html_a5f5e63e2c340bc52049e38c09b37e6e1"><div class="ttname"><a href="utilstrencodings_8h.html#a5f5e63e2c340bc52049e38c09b37e6e1">BEGIN</a></div><div class="ttdeci">#define BEGIN(a)</div><div class="ttdef"><b>Definition:</b> <a href="utilstrencodings_8h_source.html#l00016">utilstrencodings.h:16</a></div></div>
|
|
<div class="ttc" id="utilstrencodings_8h_html"><div class="ttname"><a href="utilstrencodings_8h.html">utilstrencodings.h</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a7dd0288d62321fb5aa2c27a3372ee8fe"><div class="ttname"><a href="classCPartialMerkleTree.html#a7dd0288d62321fb5aa2c27a3372ee8fe">CPartialMerkleTree::CalcTreeWidth</a></div><div class="ttdeci">unsigned int CalcTreeWidth(int height)</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8h_source.html#l00066">merkleblock.h:66</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html"><div class="ttname"><a href="classCPartialMerkleTree.html">CPartialMerkleTree</a></div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8h_source.html#l00050">merkleblock.h:50</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_aad4948ace869c92614310846f9d9980d"><div class="ttname"><a href="classCPartialMerkleTree.html#aad4948ace869c92614310846f9d9980d">CPartialMerkleTree::CPartialMerkleTree</a></div><div class="ttdeci">CPartialMerkleTree()</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8cpp_source.html#l00148">merkleblock.cpp:148</a></div></div>
|
|
<div class="ttc" id="utilstrencodings_8h_html_ac32457d3f041434e57a2924847796fda"><div class="ttname"><a href="utilstrencodings_8h.html#ac32457d3f041434e57a2924847796fda">END</a></div><div class="ttdeci">#define END(a)</div><div class="ttdef"><b>Definition:</b> <a href="utilstrencodings_8h_source.html#l00017">utilstrencodings.h:17</a></div></div>
|
|
<div class="ttc" id="hash_8h_html_ab3f6c437460137530d86e09c2c102e99"><div class="ttname"><a href="hash_8h.html#ab3f6c437460137530d86e09c2c102e99">Hash</a></div><div class="ttdeci">uint256 Hash(const T1 pbegin, const T1 pend)</div><div class="ttdef"><b>Definition:</b> <a href="hash_8h_source.html#l00123">hash.h:123</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a0d3bd530f19f2c75c140a05c6f99782a"><div class="ttname"><a href="classCPartialMerkleTree.html#a0d3bd530f19f2c75c140a05c6f99782a">CPartialMerkleTree::nTransactions</a></div><div class="ttdeci">unsigned int nTransactions</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8h_source.html#l00054">merkleblock.h:54</a></div></div>
|
|
<div class="ttc" id="classCBloomFilter_html"><div class="ttname"><a href="classCBloomFilter.html">CBloomFilter</a></div><div class="ttdef"><b>Definition:</b> <a href="bloom_8h_source.html#l00044">bloom.h:44</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a863cf9024be1b8fa97db08dfd6dbd687"><div class="ttname"><a href="classCPartialMerkleTree.html#a863cf9024be1b8fa97db08dfd6dbd687">CPartialMerkleTree::vHash</a></div><div class="ttdeci">std::vector< uint256 > vHash</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8h_source.html#l00060">merkleblock.h:60</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a62bdcaf5b5ee6c6327ef67fb027a5fef"><div class="ttname"><a href="classCPartialMerkleTree.html#a62bdcaf5b5ee6c6327ef67fb027a5fef">CPartialMerkleTree::TraverseAndBuild</a></div><div class="ttdeci">void TraverseAndBuild(int height, unsigned int pos, const std::vector< uint256 > &vTxid, const std::vector< bool > &vMatch)</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8cpp_source.html#l00080">merkleblock.cpp:80</a></div></div>
|
|
<div class="ttc" id="classuint256_html"><div class="ttname"><a href="classuint256.html">uint256</a></div><div class="ttdef"><b>Definition:</b> <a href="uint256_8h_source.html#l00114">uint256.h:114</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a3ddbe75a92d93059c30f6e60bacc7054"><div class="ttname"><a href="classCPartialMerkleTree.html#a3ddbe75a92d93059c30f6e60bacc7054">CPartialMerkleTree::TraverseAndExtract</a></div><div class="ttdeci">uint256 TraverseAndExtract(int height, unsigned int pos, unsigned int &nBitsUsed, unsigned int &nHashUsed, std::vector< uint256 > &vMatch)</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8cpp_source.html#l00098">merkleblock.cpp:98</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a22a522d1fb8d449f4c91b65283339e7d"><div class="ttname"><a href="classCPartialMerkleTree.html#a22a522d1fb8d449f4c91b65283339e7d">CPartialMerkleTree::vBits</a></div><div class="ttdeci">std::vector< bool > vBits</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8h_source.html#l00057">merkleblock.h:57</a></div></div>
|
|
<div class="ttc" id="classCBloomFilter_html_aec420a9b66ab133090c2b4b8ed286f79"><div class="ttname"><a href="classCBloomFilter.html#aec420a9b66ab133090c2b4b8ed286f79">CBloomFilter::IsRelevantAndUpdate</a></div><div class="ttdeci">bool IsRelevantAndUpdate(const CTransaction &tx)</div><div class="ttdoc">Also adds any outputs which match the filter to the filter (to match their spending txes) ...</div><div class="ttdef"><b>Definition:</b> <a href="bloom_8cpp_source.html#l00136">bloom.cpp:136</a></div></div>
|
|
<div class="ttc" id="consensus_8h_html"><div class="ttname"><a href="consensus_8h.html">consensus.h</a></div></div>
|
|
<div class="ttc" id="namespacerpc-tests_html_a5634cc986fc764eff8c617f53bf2e8dc"><div class="ttname"><a href="namespacerpc-tests.html#a5634cc986fc764eff8c617f53bf2e8dc">rpc-tests.p</a></div><div class="ttdeci">p</div><div class="ttdef"><b>Definition:</b> <a href="rpc-tests_8py_source.html#l00049">rpc-tests.py:49</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a24bb0d9d17d6001dcfbca4d550c64ba3"><div class="ttname"><a href="classCPartialMerkleTree.html#a24bb0d9d17d6001dcfbca4d550c64ba3">CPartialMerkleTree::fBad</a></div><div class="ttdeci">bool fBad</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8h_source.html#l00063">merkleblock.h:63</a></div></div>
|
|
<div class="ttc" id="classCBlock_html_a7c8d280db581c02f49a66a5cdef2eded"><div class="ttname"><a href="classCBlock.html#a7c8d280db581c02f49a66a5cdef2eded">CBlock::GetBlockHeader</a></div><div class="ttdeci">CBlockHeader GetBlockHeader() const</div><div class="ttdef"><b>Definition:</b> <a href="block_8h_source.html#l00112">block.h:112</a></div></div>
|
|
<div class="ttc" id="merkleblock_8h_html"><div class="ttname"><a href="merkleblock_8h.html">merkleblock.h</a></div></div>
|
|
<div class="ttc" id="classCBlock_html"><div class="ttname"><a href="classCBlock.html">CBlock</a></div><div class="ttdef"><b>Definition:</b> <a href="block_8h_source.html#l00073">block.h:73</a></div></div>
|
|
<div class="ttc" id="classCPartialMerkleTree_html_a69e7771f95c498f6a340dcc227abcde4"><div class="ttname"><a href="classCPartialMerkleTree.html#a69e7771f95c498f6a340dcc227abcde4">CPartialMerkleTree::CalcHash</a></div><div class="ttdeci">uint256 CalcHash(int height, unsigned int pos, const std::vector< uint256 > &vTxid)</div><div class="ttdef"><b>Definition:</b> <a href="merkleblock_8cpp_source.html#l00063">merkleblock.cpp:63</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="merkleblock_8cpp.html">merkleblock.cpp</a></li>
|
|
<li class="footer">Generated on Thu Dec 14 2017 13:15:03 for Dash Core by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|