<!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>Crypto++: queue.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="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">Crypto++
 <span id="projectnumber">7.0</span>
</div>
<div id="projectbrief">Free C++ class library of cryptographic schemes</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.14 -->
<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('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">queue.cpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// queue.cpp - originally written and placed in the public domain by Wei Dai</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include "<a class="code" href="pch_8h.html">pch.h</a>"</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> </div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include "<a class="code" href="queue_8h.html">queue.h</a>"</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include "<a class="code" href="filters_8h.html">filters.h</a>"</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</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">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> s_maxAutoNodeSize = 16*1024;</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// this class for use by ByteQueue only</span></div><div class="line"><a name="l00015"></a><span class="lineno"><a class="line" href="class_byte_queue_node.html"> 15</a></span> <span class="keyword">class </span><a class="code" href="class_byte_queue_node.html">ByteQueueNode</a></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> {</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(<span class="keywordtype">size_t</span> maxSize)</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  : buf(maxSize)</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>  m_head = m_tail = 0;</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  next = NULLPTR;</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> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> MaxSize()<span class="keyword"> const </span>{<span class="keywordflow">return</span> buf.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>();}</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> CurrentSize()<span class="keyword"> const</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">return</span> m_tail-m_head;</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  }</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="keyword">inline</span> <span class="keywordtype">bool</span> UsedUp()<span class="keyword"> const</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">return</span> (m_head==MaxSize());</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>  <span class="keyword">inline</span> <span class="keywordtype">void</span> Clear()</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>  m_head = m_tail = 0;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  }</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>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Put(<span class="keyword">const</span> byte *begin, <span class="keywordtype">size_t</span> length)</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>  <span class="comment">// Avoid passing NULL to memcpy</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">if</span> (!begin || !length) <span class="keywordflow">return</span> length;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">size_t</span> l = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(length, MaxSize()-m_tail);</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">if</span> (buf+m_tail != begin)</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  memcpy(buf+m_tail, begin, l);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  m_tail += l;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">return</span> l;</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> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Peek(byte &outByte)<span class="keyword"> const</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (m_tail==m_head)</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  outByte=buf[m_head];</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</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>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Peek(byte *target, <span class="keywordtype">size_t</span> copyMax)<span class="keyword"> const</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">size_t</span> len = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(copyMax, m_tail-m_head);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  memcpy(target, buf+m_head, len);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">return</span> len;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> CopyTo(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, <span class="keyword">const</span> std::string &channel=<a class="code" href="cryptlib_8h.html#a9a69ab5a5e0f58279c43f4f51809c84a">DEFAULT_CHANNEL</a>)<span class="keyword"> const</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordtype">size_t</span> len = m_tail-m_head;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  target.<a class="code" href="class_buffered_transformation.html#a97a60b54fafdb3df59e1457ef629fc5f">ChannelPut</a>(channel, buf+m_head, len);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">return</span> len;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> CopyTo(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, <span class="keywordtype">size_t</span> copyMax, <span class="keyword">const</span> std::string &channel=<a class="code" href="cryptlib_8h.html#a9a69ab5a5e0f58279c43f4f51809c84a">DEFAULT_CHANNEL</a>)<span class="keyword"> const</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordtype">size_t</span> len = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(copyMax, m_tail-m_head);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  target.<a class="code" href="class_buffered_transformation.html#a97a60b54fafdb3df59e1457ef629fc5f">ChannelPut</a>(channel, buf+m_head, len);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">return</span> len;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Get(byte &outByte)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">size_t</span> len = Peek(outByte);</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  m_head += len;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> len;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Get(byte *outString, <span class="keywordtype">size_t</span> getMax)</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">size_t</span> len = Peek(outString, getMax);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  m_head += len;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">return</span> len;</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>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> TransferTo(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, <span class="keyword">const</span> std::string &channel=<a class="code" href="cryptlib_8h.html#a9a69ab5a5e0f58279c43f4f51809c84a">DEFAULT_CHANNEL</a>)</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">size_t</span> len = m_tail-m_head;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  target.<a class="code" href="class_buffered_transformation.html#a3dc27692b14108ed057beb4db67fed2f">ChannelPutModifiable</a>(channel, buf+m_head, len);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  m_head = m_tail;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> len;</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> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> TransferTo(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, lword transferMax, <span class="keyword">const</span> std::string &channel=<a class="code" href="cryptlib_8h.html#a9a69ab5a5e0f58279c43f4f51809c84a">DEFAULT_CHANNEL</a>)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">size_t</span> len = <a class="code" href="misc_8h.html#ac8391e7d9d613a6c401787d2cdab1f51">UnsignedMin</a>(m_tail-m_head, transferMax);</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  target.<a class="code" href="class_buffered_transformation.html#a3dc27692b14108ed057beb4db67fed2f">ChannelPutModifiable</a>(channel, buf+m_head, len);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  m_head += len;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> len;</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> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Skip(<span class="keywordtype">size_t</span> skipMax)</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordtype">size_t</span> len = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(skipMax, m_tail-m_head);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  m_head += len;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">return</span> len;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">inline</span> byte operator[](<span class="keywordtype">size_t</span> i)<span class="keyword"> const</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> buf[m_head+i];</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *next;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> buf;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">size_t</span> m_head, m_tail;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> };</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// ********************************************************</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"><a class="line" href="class_byte_queue.html#a7c8239764938f1bb776280695e62fa0d"> 133</a></span> <a class="code" href="class_byte_queue.html#a7c8239764938f1bb776280695e62fa0d">ByteQueue::ByteQueue</a>(<span class="keywordtype">size_t</span> nodeSize)</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  : <a class="code" href="class_bufferless.html">Bufferless</a><<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a>>(), m_autoNodeSize(!nodeSize), m_nodeSize(nodeSize)</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  , m_head(NULLPTR), m_tail(NULLPTR), m_lazyString(NULLPTR), m_lazyLength(0), m_lazyStringModifiable(false)</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  SetNodeSize(nodeSize);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  m_head = m_tail = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(m_nodeSize);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">void</span> ByteQueue::SetNodeSize(<span class="keywordtype">size_t</span> nodeSize)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  m_autoNodeSize = !nodeSize;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  m_nodeSize = m_autoNodeSize ? 256 : nodeSize;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a0e3ec54d26a5be3b5689ca53a906622f"> 147</a></span> <a class="code" href="class_byte_queue.html#a7c8239764938f1bb776280695e62fa0d">ByteQueue::ByteQueue</a>(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html">ByteQueue</a> &copy)</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  : <a class="code" href="class_bufferless.html">Bufferless</a><<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a>>(copy), m_lazyString(NULLPTR), m_lazyLength(0)</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  CopyFrom(copy);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> }</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="keywordtype">void</span> ByteQueue::CopyFrom(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html">ByteQueue</a> &copy)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> {</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  m_lazyLength = 0;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  m_autoNodeSize = copy.m_autoNodeSize;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  m_nodeSize = copy.m_nodeSize;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  m_head = m_tail = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(*copy.m_head);</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=copy.m_head->next; current; current=current->next)</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  m_tail->next = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(*current);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  m_tail = m_tail->next;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  m_tail->next = NULLPTR;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <a class="code" href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede">Put</a>(copy.m_lazyString, copy.m_lazyLength);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> ByteQueue::~ByteQueue()</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> {</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  Destroy();</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> }</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="keywordtype">void</span> ByteQueue::Destroy()</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> {</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *next, *current=m_head; current; current=next)</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  {</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  next=current->next;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">delete</span> current;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> }</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a7e576bc7629bd0947eb098ad23b0d675"> 185</a></span> <span class="keywordtype">void</span> <a class="code" href="class_byte_queue.html#a7e576bc7629bd0947eb098ad23b0d675">ByteQueue::IsolatedInitialize</a>(<span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html">NameValuePairs</a> &parameters)</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  m_nodeSize = parameters.<a class="code" href="class_name_value_pairs.html#a7ddb654b7afcd1a04422a7b4b01366d9">GetIntValueWithDefault</a>(<span class="stringliteral">"NodeSize"</span>, 256);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  Clear();</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> }</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> lword ByteQueue::CurrentSize()<span class="keyword"> const</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="keyword"></span>{</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  lword size=0;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=m_head; current; current=current->next)</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  size += current->CurrentSize();</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> size + m_lazyLength;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> }</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="keywordtype">bool</span> ByteQueue::IsEmpty()<span class="keyword"> const</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="keyword"></span>{</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">return</span> m_head==m_tail && m_head->CurrentSize()==0 && m_lazyLength==0;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="keywordtype">void</span> ByteQueue::Clear()</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *next, *current=m_head->next; current; current=next)</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  {</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  next=current->next;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">delete</span> current;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  m_tail = m_head;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  m_head->Clear();</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  m_head->next = NULLPTR;</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  m_lazyLength = 0;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a684942d5641278a78e7c237a5bd4c69d"> 220</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a684942d5641278a78e7c237a5bd4c69d">ByteQueue::Put2</a>(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> length, <span class="keywordtype">int</span> messageEnd, <span class="keywordtype">bool</span> blocking)</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> {</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  CRYPTOPP_UNUSED(messageEnd), CRYPTOPP_UNUSED(blocking);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">if</span> (m_lazyLength > 0)</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  FinalizeLazyPut();</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordtype">size_t</span> len;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">while</span> ((len=m_tail->Put(inString, length)) < length)</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  inString += len;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  length -= len;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (m_autoNodeSize && m_nodeSize < s_maxAutoNodeSize)</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">do</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  m_nodeSize *= 2;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">while</span> (m_nodeSize < length && m_nodeSize < s_maxAutoNodeSize);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  m_tail->next = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(<a class="code" href="misc_8h.html#af1490597cb11989e78d5ba5b5f21266b">STDMAX</a>(m_nodeSize, length));</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  m_tail = m_tail->next;</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="keywordtype">void</span> ByteQueue::CleanupUsedNodes()</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// Test for m_head due to Enterprise Anlysis finding</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">while</span> (m_head && m_head != m_tail && m_head->UsedUp())</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  {</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *temp=m_head;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  m_head=m_head->next;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">delete</span> temp;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// Test for m_head due to Enterprise Anlysis finding</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">if</span> (m_head && m_head->CurrentSize() == 0)</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  m_head->Clear();</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="keywordtype">void</span> ByteQueue::LazyPut(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> {</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (m_lazyLength > 0)</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  FinalizeLazyPut();</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> (inString == m_tail->buf+m_tail->m_tail)</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <a class="code" href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede">Put</a>(inString, size);</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  {</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  m_lazyString = <span class="keyword">const_cast<</span>byte *<span class="keyword">></span>(inString);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  m_lazyLength = size;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  m_lazyStringModifiable = <span class="keyword">false</span>;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> }</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> </div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="keywordtype">void</span> ByteQueue::LazyPutModifiable(byte *inString, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> {</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (m_lazyLength > 0)</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  FinalizeLazyPut();</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  m_lazyString = inString;</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  m_lazyLength = size;</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  m_lazyStringModifiable = <span class="keyword">true</span>;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> }</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="keywordtype">void</span> ByteQueue::UndoLazyPut(<span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (m_lazyLength < size)</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html">InvalidArgument</a>(<span class="stringliteral">"ByteQueue: size specified for UndoLazyPut is too large"</span>);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  m_lazyLength -= size;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="keywordtype">void</span> ByteQueue::FinalizeLazyPut()</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> {</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordtype">size_t</span> len = m_lazyLength;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  m_lazyLength = 0;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (len)</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <a class="code" href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede">Put</a>(m_lazyString, len);</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00300"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632"> 300</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632">ByteQueue::Get</a>(byte &outByte)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> {</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">if</span> (m_head->Get(outByte))</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  {</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (m_head->UsedUp())</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  CleanupUsedNodes();</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_lazyLength > 0)</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  outByte = *m_lazyString++;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  m_lazyLength--;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> }</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div><div class="line"><a name="l00318"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a933457ad0a5a34fb5e7dc71b2a92c3a7"> 318</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632">ByteQueue::Get</a>(byte *outString, <span class="keywordtype">size_t</span> getMax)</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <a class="code" href="class_array_sink.html">ArraySink</a> sink(outString, getMax);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#ac31ac5d2da7897fb097086496b85e6f5">TransferTo</a>(sink, getMax);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> }</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a41550f99083f9eff6a30ac2ad604f3ce"> 324</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a41550f99083f9eff6a30ac2ad604f3ce">ByteQueue::Peek</a>(byte &outByte)<span class="keyword"> const</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="keyword"></span>{</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">if</span> (m_head->Peek(outByte))</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_lazyLength > 0)</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  {</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  outByte = *m_lazyString;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> }</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a6e15989ef3b2f97963df4d3b471bfdc6"> 337</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a41550f99083f9eff6a30ac2ad604f3ce">ByteQueue::Peek</a>(byte *outString, <span class="keywordtype">size_t</span> peekMax)<span class="keyword"> const</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="keyword"></span>{</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <a class="code" href="class_array_sink.html">ArraySink</a> sink(outString, peekMax);</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#a7693f056b01bc4feadd8a794fba2d30a">CopyTo</a>(sink, peekMax);</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> }</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="class_byte_queue.html#a9863db3b56bf42fb424f426afb7531cd"> 343</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a9863db3b56bf42fb424f426afb7531cd">ByteQueue::TransferTo2</a>(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, lword &transferBytes, <span class="keyword">const</span> std::string &channel, <span class="keywordtype">bool</span> blocking)</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> {</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">if</span> (blocking)</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  {</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  lword bytesLeft = transferBytes;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=m_head; bytesLeft && current; current=current->next)</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  bytesLeft -= current->TransferTo(target, bytesLeft, channel);</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  CleanupUsedNodes();</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordtype">size_t</span> len = (size_t)<a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(bytesLeft, (lword)m_lazyLength);</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">if</span> (len)</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (m_lazyStringModifiable)</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  target.<a class="code" href="class_buffered_transformation.html#a3dc27692b14108ed057beb4db67fed2f">ChannelPutModifiable</a>(channel, m_lazyString, len);</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  target.<a class="code" href="class_buffered_transformation.html#a97a60b54fafdb3df59e1457ef629fc5f">ChannelPut</a>(channel, m_lazyString, len);</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  m_lazyString += len;</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  m_lazyLength -= len;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  bytesLeft -= len;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  }</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  transferBytes -= bytesLeft;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  {</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="class_byte_queue_1_1_walker.html">Walker</a> walker(*<span class="keyword">this</span>);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordtype">size_t</span> blockedBytes = walker.<a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43">TransferTo2</a>(target, transferBytes, channel, blocking);</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <a class="code" href="class_buffered_transformation.html#a0c25529ded99db20ad35ccef3f7234e6">Skip</a>(transferBytes);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">return</span> blockedBytes;</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> }</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div><div class="line"><a name="l00375"></a><span class="lineno"><a class="line" href="class_byte_queue.html#aeb91427c87efe486fcacb5aa726ef6ed"> 375</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#aeb91427c87efe486fcacb5aa726ef6ed">ByteQueue::CopyRangeTo2</a>(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, lword &begin, lword end, <span class="keyword">const</span> std::string &channel, <span class="keywordtype">bool</span> blocking)<span class="keyword"> const</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="keyword"></span>{</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <a class="code" href="class_byte_queue_1_1_walker.html">Walker</a> walker(*<span class="keyword">this</span>);</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  walker.<a class="code" href="class_buffered_transformation.html#a0c25529ded99db20ad35ccef3f7234e6">Skip</a>(begin);</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  lword transferBytes = end-begin;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordtype">size_t</span> blockedBytes = walker.<a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43">TransferTo2</a>(target, transferBytes, channel, blocking);</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  begin += transferBytes;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">return</span> blockedBytes;</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> }</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="keywordtype">void</span> ByteQueue::Unget(byte inByte)</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  Unget(&inByte, 1);</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> }</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> </div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="keywordtype">void</span> ByteQueue::Unget(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> length)</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordtype">size_t</span> len = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(length, m_head->m_head);</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  length -= len;</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  m_head->m_head -= len;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  memcpy(m_head->buf + m_head->m_head, inString + length, len);</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">if</span> (length > 0)</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *newHead = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(length);</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  newHead->next = m_head;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  m_head = newHead;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  m_head->Put(inString, length);</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="keyword">const</span> byte * ByteQueue::Spy(<span class="keywordtype">size_t</span> &contiguousSize)<span class="keyword"> const</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="keyword"></span>{</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  contiguousSize = m_head->m_tail - m_head->m_head;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (contiguousSize == 0 && m_lazyLength > 0)</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  {</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  contiguousSize = m_lazyLength;</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">return</span> m_lazyString;</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  }</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">return</span> m_head->buf + m_head->m_head;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div><div class="line"><a name="l00418"></a><span class="lineno"><a class="line" href="class_byte_queue.html#ae6b49917c3217c5e3b8dd71d40498e5f"> 418</a></span> byte * <a class="code" href="class_byte_queue.html#ae6b49917c3217c5e3b8dd71d40498e5f">ByteQueue::CreatePutSpace</a>(<span class="keywordtype">size_t</span> &size)</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> {</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">if</span> (m_lazyLength > 0)</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  FinalizeLazyPut();</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">if</span> (m_tail->m_tail == m_tail->MaxSize())</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  m_tail->next = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(<a class="code" href="misc_8h.html#af1490597cb11989e78d5ba5b5f21266b">STDMAX</a>(m_nodeSize, size));</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  m_tail = m_tail->next;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  size = m_tail->MaxSize() - m_tail->m_tail;</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">return</span> m_tail->buf + m_tail->m_tail;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> }</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> </div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <a class="code" href="class_byte_queue.html">ByteQueue</a> & ByteQueue::operator=(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html">ByteQueue</a> &rhs)</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> {</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  Destroy();</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  CopyFrom(rhs);</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> }</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> </div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="keywordtype">bool</span> ByteQueue::operator==(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html">ByteQueue</a> &rhs)<span class="keyword"> const</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="keyword"></span>{</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keyword">const</span> lword currentSize = CurrentSize();</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">if</span> (currentSize != rhs.CurrentSize())</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  Walker walker1(*<span class="keyword">this</span>), walker2(rhs);</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  byte b1, b2;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">while</span> (walker1.Get(b1) && walker2.Get(b2))</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (b1 != b2)</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> }</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> byte ByteQueue::operator[](lword i)<span class="keyword"> const</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="keyword"></span>{</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=m_head; current; current=current->next)</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  {</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span> (i < current->CurrentSize())</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">return</span> (*current)[(size_t)i];</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  i -= current->CurrentSize();</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> </div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(i < m_lazyLength);</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">return</span> m_lazyString[i];</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> }</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="keywordtype">void</span> ByteQueue::swap(<a class="code" href="class_byte_queue.html">ByteQueue</a> &rhs)</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> {</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  std::swap(m_autoNodeSize, rhs.m_autoNodeSize);</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  std::swap(m_nodeSize, rhs.m_nodeSize);</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  std::swap(m_head, rhs.m_head);</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  std::swap(m_tail, rhs.m_tail);</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  std::swap(m_lazyString, rhs.m_lazyString);</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  std::swap(m_lazyLength, rhs.m_lazyLength);</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  std::swap(m_lazyStringModifiable, rhs.m_lazyStringModifiable);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> }</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> </div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> <span class="comment">// ********************************************************</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"><a class="line" href="class_byte_queue_1_1_walker.html#ab74b6b33c01b0221a24e1ba17ac7a374"> 484</a></span> <span class="keywordtype">void</span> <a class="code" href="class_byte_queue_1_1_walker.html#ab74b6b33c01b0221a24e1ba17ac7a374">ByteQueue::Walker::IsolatedInitialize</a>(<span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html">NameValuePairs</a> &parameters)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> {</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  CRYPTOPP_UNUSED(parameters);</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  m_node = m_queue.m_head;</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  m_position = 0;</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  m_offset = 0;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  m_lazyString = m_queue.m_lazyString;</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  m_lazyLength = m_queue.m_lazyLength;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> }</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> </div><div class="line"><a name="l00495"></a><span class="lineno"><a class="line" href="class_byte_queue_1_1_walker.html#a1577996016d4fc5e644b86eb1a4f1660"> 495</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue_1_1_walker.html#a1577996016d4fc5e644b86eb1a4f1660">ByteQueue::Walker::Get</a>(byte &outByte)</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <a class="code" href="class_array_sink.html">ArraySink</a> sink(&outByte, 1);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#ac31ac5d2da7897fb097086496b85e6f5">TransferTo</a>(sink, 1);</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> </div><div class="line"><a name="l00501"></a><span class="lineno"><a class="line" href="class_byte_queue_1_1_walker.html#a940623c7bff90ab48f1534352675f92b"> 501</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue_1_1_walker.html#a1577996016d4fc5e644b86eb1a4f1660">ByteQueue::Walker::Get</a>(byte *outString, <span class="keywordtype">size_t</span> getMax)</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> {</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <a class="code" href="class_array_sink.html">ArraySink</a> sink(outString, getMax);</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#ac31ac5d2da7897fb097086496b85e6f5">TransferTo</a>(sink, getMax);</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> }</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> </div><div class="line"><a name="l00507"></a><span class="lineno"><a class="line" href="class_byte_queue_1_1_walker.html#a7957014044dfccad88074959455e36c1"> 507</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue_1_1_walker.html#a7957014044dfccad88074959455e36c1">ByteQueue::Walker::Peek</a>(byte &outByte)<span class="keyword"> const</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="keyword"></span>{</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <a class="code" href="class_array_sink.html">ArraySink</a> sink(&outByte, 1);</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#a7693f056b01bc4feadd8a794fba2d30a">CopyTo</a>(sink, 1);</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> }</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> </div><div class="line"><a name="l00513"></a><span class="lineno"><a class="line" href="class_byte_queue_1_1_walker.html#a0fbdd794afcbf561526a44a9f8698301"> 513</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue_1_1_walker.html#a7957014044dfccad88074959455e36c1">ByteQueue::Walker::Peek</a>(byte *outString, <span class="keywordtype">size_t</span> peekMax)<span class="keyword"> const</span></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="keyword"></span>{</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <a class="code" href="class_array_sink.html">ArraySink</a> sink(outString, peekMax);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#a7693f056b01bc4feadd8a794fba2d30a">CopyTo</a>(sink, peekMax);</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> }</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div><div class="line"><a name="l00519"></a><span class="lineno"><a class="line" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43"> 519</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43">ByteQueue::Walker::TransferTo2</a>(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, lword &transferBytes, <span class="keyword">const</span> std::string &channel, <span class="keywordtype">bool</span> blocking)</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> {</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  lword bytesLeft = transferBytes;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordtype">size_t</span> blockedBytes = 0;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">while</span> (m_node)</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  {</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordtype">size_t</span> len = (size_t)<a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(bytesLeft, (lword)m_node->CurrentSize()-m_offset);</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  blockedBytes = target.<a class="code" href="class_buffered_transformation.html#ae6b026f47d8a0ea2e35a6cb8d9ec2c97">ChannelPut2</a>(channel, m_node->buf+m_node->m_head+m_offset, len, 0, blocking);</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> </div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">if</span> (blockedBytes)</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">goto</span> done;</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  m_position += len;</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  bytesLeft -= len;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> </div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">if</span> (!bytesLeft)</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  {</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  m_offset += len;</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">goto</span> done;</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  }</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  m_node = m_node->next;</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  m_offset = 0;</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">if</span> (bytesLeft && m_lazyLength)</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  {</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordtype">size_t</span> len = (size_t)<a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(bytesLeft, (lword)m_lazyLength);</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  blockedBytes = target.<a class="code" href="class_buffered_transformation.html#ae6b026f47d8a0ea2e35a6cb8d9ec2c97">ChannelPut2</a>(channel, m_lazyString, len, 0, blocking);</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (blockedBytes)</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">goto</span> done;</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  m_lazyString += len;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  m_lazyLength -= len;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  bytesLeft -= len;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> done:</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  transferBytes -= bytesLeft;</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">return</span> blockedBytes;</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> }</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> </div><div class="line"><a name="l00562"></a><span class="lineno"><a class="line" href="class_byte_queue_1_1_walker.html#a5491cc2e63a737cecbcc2d1e8333ee31"> 562</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue_1_1_walker.html#a5491cc2e63a737cecbcc2d1e8333ee31">ByteQueue::Walker::CopyRangeTo2</a>(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &target, lword &begin, lword end, <span class="keyword">const</span> std::string &channel, <span class="keywordtype">bool</span> blocking)<span class="keyword"> const</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="keyword"></span>{</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <a class="code" href="class_byte_queue_1_1_walker.html">Walker</a> walker(*<span class="keyword">this</span>);</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  walker.<a class="code" href="class_buffered_transformation.html#a0c25529ded99db20ad35ccef3f7234e6">Skip</a>(begin);</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  lword transferBytes = end-begin;</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordtype">size_t</span> blockedBytes = walker.<a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43">TransferTo2</a>(target, transferBytes, channel, blocking);</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  begin += transferBytes;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">return</span> blockedBytes;</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> }</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> </div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> NAMESPACE_END</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> </div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="class_name_value_pairs_html_a7ddb654b7afcd1a04422a7b4b01366d9"><div class="ttname"><a href="class_name_value_pairs.html#a7ddb654b7afcd1a04422a7b4b01366d9">NameValuePairs::GetIntValueWithDefault</a></div><div class="ttdeci">int GetIntValueWithDefault(const char *name, int defaultValue) const</div><div class="ttdoc">Get a named value with type int, with default. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00392">cryptlib.h:392</a></div></div>
<div class="ttc" id="class_invalid_argument_html"><div class="ttname"><a href="class_invalid_argument.html">InvalidArgument</a></div><div class="ttdoc">An invalid argument was detected. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00199">cryptlib.h:199</a></div></div>
<div class="ttc" id="class_byte_queue_1_1_walker_html_a5491cc2e63a737cecbcc2d1e8333ee31"><div class="ttname"><a href="class_byte_queue_1_1_walker.html#a5491cc2e63a737cecbcc2d1e8333ee31">ByteQueue::Walker::CopyRangeTo2</a></div><div class="ttdeci">size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const</div><div class="ttdoc">Copy bytes from this object to another BufferedTransformation. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00562">queue.cpp:562</a></div></div>
<div class="ttc" id="class_byte_queue_html_a7e576bc7629bd0947eb098ad23b0d675"><div class="ttname"><a href="class_byte_queue.html#a7e576bc7629bd0947eb098ad23b0d675">ByteQueue::IsolatedInitialize</a></div><div class="ttdeci">void IsolatedInitialize(const NameValuePairs &parameters)</div><div class="ttdoc">Initialize or reinitialize this object, without signal propagation. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00185">queue.cpp:185</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_a97a60b54fafdb3df59e1457ef629fc5f"><div class="ttname"><a href="class_buffered_transformation.html#a97a60b54fafdb3df59e1457ef629fc5f">BufferedTransformation::ChannelPut</a></div><div class="ttdeci">size_t ChannelPut(const std::string &channel, byte inByte, bool blocking=true)</div><div class="ttdoc">Input a byte for processing on a channel. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l02053">cryptlib.h:2053</a></div></div>
<div class="ttc" id="class_byte_queue_1_1_walker_html_ab74b6b33c01b0221a24e1ba17ac7a374"><div class="ttname"><a href="class_byte_queue_1_1_walker.html#ab74b6b33c01b0221a24e1ba17ac7a374">ByteQueue::Walker::IsolatedInitialize</a></div><div class="ttdeci">void IsolatedInitialize(const NameValuePairs &parameters)</div><div class="ttdoc">Initialize or reinitialize this object, without signal propagation. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00484">queue.cpp:484</a></div></div>
<div class="ttc" id="class_sec_byte_block_html"><div class="ttname"><a href="class_sec_byte_block.html">SecByteBlock</a></div><div class="ttdoc">SecBlock<byte> typedef. </div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00822">secblock.h:822</a></div></div>
<div class="ttc" id="class_buffered_transformation_html"><div class="ttname"><a href="class_buffered_transformation.html">BufferedTransformation</a></div><div class="ttdoc">Interface for buffered transformations. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01545">cryptlib.h:1545</a></div></div>
<div class="ttc" id="class_byte_queue_1_1_walker_html_a1577996016d4fc5e644b86eb1a4f1660"><div class="ttname"><a href="class_byte_queue_1_1_walker.html#a1577996016d4fc5e644b86eb1a4f1660">ByteQueue::Walker::Get</a></div><div class="ttdeci">size_t Get(byte &outByte)</div><div class="ttdoc">Retrieve a 8-bit byte. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00495">queue.cpp:495</a></div></div>
<div class="ttc" id="class_array_sink_html"><div class="ttname"><a href="class_array_sink.html">ArraySink</a></div><div class="ttdoc">Copy input to a memory buffer. </div><div class="ttdef"><b>Definition:</b> <a href="filters_8h_source.html#l01132">filters.h:1132</a></div></div>
<div class="ttc" id="class_byte_queue_html_a9863db3b56bf42fb424f426afb7531cd"><div class="ttname"><a href="class_byte_queue.html#a9863db3b56bf42fb424f426afb7531cd">ByteQueue::TransferTo2</a></div><div class="ttdeci">size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true)</div><div class="ttdoc">Transfer bytes from this object to another BufferedTransformation. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00343">queue.cpp:343</a></div></div>
<div class="ttc" id="queue_8h_html"><div class="ttname"><a href="queue_8h.html">queue.h</a></div><div class="ttdoc">Classes for an unlimited queue to store bytes. </div></div>
<div class="ttc" id="class_buffered_transformation_html_ac31ac5d2da7897fb097086496b85e6f5"><div class="ttname"><a href="class_buffered_transformation.html#ac31ac5d2da7897fb097086496b85e6f5">BufferedTransformation::TransferTo</a></div><div class="ttdeci">lword TransferTo(BufferedTransformation &target, lword transferMax=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL)</div><div class="ttdoc">move transferMax bytes of the buffered output to target as input </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01848">cryptlib.h:1848</a></div></div>
<div class="ttc" id="class_byte_queue_html_a7c8239764938f1bb776280695e62fa0d"><div class="ttname"><a href="class_byte_queue.html#a7c8239764938f1bb776280695e62fa0d">ByteQueue::ByteQueue</a></div><div class="ttdeci">ByteQueue(size_t nodeSize=0)</div><div class="ttdoc">Construct a ByteQueue. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00133">queue.cpp:133</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_ae70658b0d271f8e114ac6c3cc9774ede"><div class="ttname"><a href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede">BufferedTransformation::Put</a></div><div class="ttdeci">size_t Put(byte inByte, bool blocking=true)</div><div class="ttdoc">Input a byte for processing. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01567">cryptlib.h:1567</a></div></div>
<div class="ttc" id="cryptlib_8h_html_a9a69ab5a5e0f58279c43f4f51809c84a"><div class="ttname"><a href="cryptlib_8h.html#a9a69ab5a5e0f58279c43f4f51809c84a">DEFAULT_CHANNEL</a></div><div class="ttdeci">const std::string DEFAULT_CHANNEL</div><div class="ttdoc">Default channel for BufferedTransformation. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00481">cryptlib.h:481</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_a3dc27692b14108ed057beb4db67fed2f"><div class="ttname"><a href="class_buffered_transformation.html#a3dc27692b14108ed057beb4db67fed2f">BufferedTransformation::ChannelPutModifiable</a></div><div class="ttdeci">size_t ChannelPutModifiable(const std::string &channel, byte *inString, size_t length, bool blocking=true)</div><div class="ttdoc">Input multiple bytes that may be modified by callee on a channel. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l02073">cryptlib.h:2073</a></div></div>
<div class="ttc" id="class_byte_queue_html_a41550f99083f9eff6a30ac2ad604f3ce"><div class="ttname"><a href="class_byte_queue.html#a41550f99083f9eff6a30ac2ad604f3ce">ByteQueue::Peek</a></div><div class="ttdeci">size_t Peek(byte &outByte) const</div><div class="ttdoc">Peek a 8-bit byte. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00324">queue.cpp:324</a></div></div>
<div class="ttc" id="pch_8h_html"><div class="ttname"><a href="pch_8h.html">pch.h</a></div><div class="ttdoc">Precompiled header file. </div></div>
<div class="ttc" id="misc_8h_html_ac8391e7d9d613a6c401787d2cdab1f51"><div class="ttname"><a href="misc_8h.html#ac8391e7d9d613a6c401787d2cdab1f51">UnsignedMin</a></div><div class="ttdeci">const T1 UnsignedMin(const T1 &a, const T2 &b)</div><div class="ttdoc">Safe comparison of values that could be neagtive and incorrectly promoted. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00546">misc.h:546</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_ae6b026f47d8a0ea2e35a6cb8d9ec2c97"><div class="ttname"><a href="class_buffered_transformation.html#ae6b026f47d8a0ea2e35a6cb8d9ec2c97">BufferedTransformation::ChannelPut2</a></div><div class="ttdeci">virtual size_t ChannelPut2(const std::string &channel, const byte *inString, size_t length, int messageEnd, bool blocking)</div><div class="ttdoc">Input multiple bytes for processing on a channel. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8cpp_source.html#l00470">cryptlib.cpp:470</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_a0c25529ded99db20ad35ccef3f7234e6"><div class="ttname"><a href="class_buffered_transformation.html#a0c25529ded99db20ad35ccef3f7234e6">BufferedTransformation::Skip</a></div><div class="ttdeci">virtual lword Skip(lword skipMax=LWORD_MAX)</div><div class="ttdoc">Discard skipMax bytes from the output buffer. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8cpp_source.html#l00579">cryptlib.cpp:579</a></div></div>
<div class="ttc" id="misc_8h_html_abe412b0409249cb54899e97bc7d86424"><div class="ttname"><a href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a></div><div class="ttdeci">const T & STDMIN(const T &a, const T &b)</div><div class="ttdoc">Replacement function for std::min. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00507">misc.h:507</a></div></div>
<div class="ttc" id="trap_8h_html_adf3b392588bc94cbeae9f415a78c7b95"><div class="ttname"><a href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a></div><div class="ttdeci">#define CRYPTOPP_ASSERT(exp)</div><div class="ttdoc">Debugging and diagnostic assertion. </div><div class="ttdef"><b>Definition:</b> <a href="trap_8h_source.html#l00060">trap.h:60</a></div></div>
<div class="ttc" id="class_byte_queue_1_1_walker_html_a7957014044dfccad88074959455e36c1"><div class="ttname"><a href="class_byte_queue_1_1_walker.html#a7957014044dfccad88074959455e36c1">ByteQueue::Walker::Peek</a></div><div class="ttdeci">size_t Peek(byte &outByte) const</div><div class="ttdoc">Peek a 8-bit byte. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00507">queue.cpp:507</a></div></div>
<div class="ttc" id="class_byte_queue_html"><div class="ttname"><a href="class_byte_queue.html">ByteQueue</a></div><div class="ttdoc">Data structure used to store byte strings. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00018">queue.h:18</a></div></div>
<div class="ttc" id="filters_8h_html"><div class="ttname"><a href="filters_8h.html">filters.h</a></div><div class="ttdoc">Implementation of BufferedTransformation&#39;s attachment interface. </div></div>
<div class="ttc" id="class_buffered_transformation_html_a7693f056b01bc4feadd8a794fba2d30a"><div class="ttname"><a href="class_buffered_transformation.html#a7693f056b01bc4feadd8a794fba2d30a">BufferedTransformation::CopyTo</a></div><div class="ttdeci">lword CopyTo(BufferedTransformation &target, lword copyMax=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL) const</div><div class="ttdoc">copy copyMax bytes of the buffered output to target as input </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01873">cryptlib.h:1873</a></div></div>
<div class="ttc" id="class_byte_queue_html_ae6b49917c3217c5e3b8dd71d40498e5f"><div class="ttname"><a href="class_byte_queue.html#ae6b49917c3217c5e3b8dd71d40498e5f">ByteQueue::CreatePutSpace</a></div><div class="ttdeci">byte * CreatePutSpace(size_t &size)</div><div class="ttdoc">Request space which can be written into by the caller. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00418">queue.cpp:418</a></div></div>
<div class="ttc" id="class_byte_queue_1_1_walker_html_a47dd1577232b3d6ebd311b5c6d8a1f43"><div class="ttname"><a href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43">ByteQueue::Walker::TransferTo2</a></div><div class="ttdeci">size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true)</div><div class="ttdoc">Transfer bytes from this object to another BufferedTransformation. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00519">queue.cpp:519</a></div></div>
<div class="ttc" id="class_byte_queue_node_html"><div class="ttname"><a href="class_byte_queue_node.html">ByteQueueNode</a></div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00015">queue.cpp:15</a></div></div>
<div class="ttc" id="misc_8h_html_af1490597cb11989e78d5ba5b5f21266b"><div class="ttname"><a href="misc_8h.html#af1490597cb11989e78d5ba5b5f21266b">STDMAX</a></div><div class="ttdeci">const T & STDMAX(const T &a, const T &b)</div><div class="ttdoc">Replacement function for std::max. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00518">misc.h:518</a></div></div>
<div class="ttc" id="namespace_crypto_p_p_html"><div class="ttname"><a href="namespace_crypto_p_p.html">CryptoPP</a></div><div class="ttdoc">Crypto++ library namespace. </div></div>
<div class="ttc" id="class_byte_queue_1_1_walker_html"><div class="ttname"><a href="class_byte_queue_1_1_walker.html">ByteQueue::Walker</a></div><div class="ttdoc">A ByteQueue iterator. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00076">queue.h:76</a></div></div>
<div class="ttc" id="class_byte_queue_html_aeb91427c87efe486fcacb5aa726ef6ed"><div class="ttname"><a href="class_byte_queue.html#aeb91427c87efe486fcacb5aa726ef6ed">ByteQueue::CopyRangeTo2</a></div><div class="ttdeci">size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const</div><div class="ttdoc">Copy bytes from this object to another BufferedTransformation. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00375">queue.cpp:375</a></div></div>
<div class="ttc" id="class_byte_queue_html_a19413e3aa72b749e3771d617e8eca632"><div class="ttname"><a href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632">ByteQueue::Get</a></div><div class="ttdeci">size_t Get(byte &outByte)</div><div class="ttdoc">Retrieve a 8-bit byte. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00300">queue.cpp:300</a></div></div>
<div class="ttc" id="class_byte_queue_html_a684942d5641278a78e7c237a5bd4c69d"><div class="ttname"><a href="class_byte_queue.html#a684942d5641278a78e7c237a5bd4c69d">ByteQueue::Put2</a></div><div class="ttdeci">size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking)</div><div class="ttdoc">Input multiple bytes for processing. </div><div class="ttdef"><b>Definition:</b> <a href="queue_8cpp_source.html#l00220">queue.cpp:220</a></div></div>
<div class="ttc" id="class_sec_block_html_af5999bffe3193e62719cc0792b0282a7"><div class="ttname"><a href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">SecBlock::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdoc">Provides the count of elements in the SecBlock. </div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00561">secblock.h:561</a></div></div>
<div class="ttc" id="class_bufferless_html"><div class="ttname"><a href="class_bufferless.html">Bufferless</a></div><div class="ttdoc">Base class for bufferless filters. </div><div class="ttdef"><b>Definition:</b> <a href="simple_8h_source.html#l00098">simple.h:98</a></div></div>
<div class="ttc" id="class_name_value_pairs_html"><div class="ttname"><a href="class_name_value_pairs.html">NameValuePairs</a></div><div class="ttdoc">Interface for retrieving values given their names. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00290">cryptlib.h:290</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Sun Sep 16 2018 07:58:00 for Crypto++ by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.14
</small></address>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-release
>
by-pkgid
>
0a67b807a02637f2cae68649d519a89d
>
files
>
2512
