queue_8cpp-source.html

著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。

<a name="l00099"></a>00099                 m_head = m_tail;
<a name="l00100"></a>00100                 <span class="keywordflow">return</span> len;
<a name="l00101"></a>00101         }
<a name="l00102"></a>00102 
<a name="l00103"></a><a class="code" href="class_byte_queue_node.html#7b94e53f4a3ec0b8e070fa7d1cf168c2">00103</a>         <span class="keyword">inline</span> <span class="keywordtype">size_t</span> TransferTo(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &amp;target, lword transferMax, <span class="keyword">const</span> std::string &amp;channel=<a class="code" href="class_buffered_transformation.html#5e938c68f2a5e32a03440b1dc2bdc74a">BufferedTransformation::NULL_CHANNEL</a>)
<a name="l00104"></a>00104         {
<a name="l00105"></a>00105                 <span class="keywordtype">size_t</span> len = UnsignedMin(m_tail-m_head, transferMax);
<a name="l00106"></a>00106                 target.<a class="code" href="class_buffered_transformation.html#3dc27692b14108ed057beb4db67fed2f">ChannelPutModifiable</a>(channel, buf+m_head, len);
<a name="l00107"></a>00107                 m_head += len;
<a name="l00108"></a>00108                 <span class="keywordflow">return</span> len;
<a name="l00109"></a>00109         }
<a name="l00110"></a>00110 
<a name="l00111"></a><a class="code" href="class_byte_queue_node.html#9b27fc68dce4a7dae7cc96029118f71c">00111</a>         <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Skip(<span class="keywordtype">size_t</span> skipMax)
<a name="l00112"></a>00112         {
<a name="l00113"></a>00113                 <span class="keywordtype">size_t</span> len = STDMIN(skipMax, m_tail-m_head);
<a name="l00114"></a>00114                 m_head += len;
<a name="l00115"></a>00115                 <span class="keywordflow">return</span> len;
<a name="l00116"></a>00116         }
<a name="l00117"></a>00117 
<a name="l00118"></a><a class="code" href="class_byte_queue_node.html#84e37d168f9820eaa37bbea6ffc27c2f">00118</a>         <span class="keyword">inline</span> byte operator[](<span class="keywordtype">size_t</span> i)<span class="keyword"> const</span>
<a name="l00119"></a>00119 <span class="keyword">        </span>{
<a name="l00120"></a>00120                 <span class="keywordflow">return</span> buf[m_head+i];
<a name="l00121"></a>00121         }
<a name="l00122"></a>00122 
<a name="l00123"></a><a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">00123</a>         ByteQueueNode *next;
<a name="l00124"></a>00124 
<a name="l00125"></a><a class="code" href="class_byte_queue_node.html#1872d9ce267ef28d540e3353d0bf6ce9">00125</a>         <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> buf;
<a name="l00126"></a><a class="code" href="class_byte_queue_node.html#fac0e8466bd492fb761f3cd6409c9077">00126</a>         <span class="keywordtype">size_t</span> m_head, m_tail;
<a name="l00127"></a>00127 };
<a name="l00128"></a>00128 
<a name="l00129"></a>00129 <span class="comment">// ********************************************************</span>
<a name="l00130"></a>00130 
<a name="l00131"></a><a class="code" href="class_byte_queue.html#7c8239764938f1bb776280695e62fa0d">00131</a> <a class="code" href="class_byte_queue.html#7c8239764938f1bb776280695e62fa0d">ByteQueue::ByteQueue</a>(<span class="keywordtype">size_t</span> nodeSize)
<a name="l00132"></a>00132         : m_lazyLength(0)
<a name="l00133"></a>00133 {
<a name="l00134"></a>00134         <a class="code" href="class_byte_queue.html#2e4f3d3759cf2ce54cbd1a193b1cefb6">SetNodeSize</a>(nodeSize);
<a name="l00135"></a>00135         m_head = m_tail = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(m_nodeSize);
<a name="l00136"></a>00136 }
<a name="l00137"></a>00137 
<a name="l00138"></a><a class="code" href="class_byte_queue.html#2e4f3d3759cf2ce54cbd1a193b1cefb6">00138</a> <span class="keywordtype">void</span> <a class="code" href="class_byte_queue.html#2e4f3d3759cf2ce54cbd1a193b1cefb6">ByteQueue::SetNodeSize</a>(<span class="keywordtype">size_t</span> nodeSize)
<a name="l00139"></a>00139 {
<a name="l00140"></a>00140         m_autoNodeSize = !nodeSize;
<a name="l00141"></a>00141         m_nodeSize = m_autoNodeSize ? 256 : nodeSize;
<a name="l00142"></a>00142 }
<a name="l00143"></a>00143 
<a name="l00144"></a><a class="code" href="class_byte_queue.html#0e3ec54d26a5be3b5689ca53a906622f">00144</a> <a class="code" href="class_byte_queue.html#7c8239764938f1bb776280695e62fa0d">ByteQueue::ByteQueue</a>(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html" title="Byte Queue.">ByteQueue</a> &amp;copy)
<a name="l00145"></a>00145 {
<a name="l00146"></a>00146         CopyFrom(copy);
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148 
<a name="l00149"></a>00149 <span class="keywordtype">void</span> ByteQueue::CopyFrom(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html" title="Byte Queue.">ByteQueue</a> &amp;copy)
<a name="l00150"></a>00150 {
<a name="l00151"></a>00151         m_lazyLength = 0;
<a name="l00152"></a>00152         m_autoNodeSize = copy.<a class="code" href="class_byte_queue.html#1d1d2b609e6ea78e420f691ff36da398">m_autoNodeSize</a>;
<a name="l00153"></a>00153         m_nodeSize = copy.<a class="code" href="class_byte_queue.html#81f36e1aedf7399bc12f3d0721c46af7">m_nodeSize</a>;
<a name="l00154"></a>00154         m_head = m_tail = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(*copy.<a class="code" href="class_byte_queue.html#68f138d2d77361886c6a1c3b094890bf">m_head</a>);
<a name="l00155"></a>00155 
<a name="l00156"></a>00156         <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=copy.<a class="code" href="class_byte_queue.html#68f138d2d77361886c6a1c3b094890bf">m_head</a>-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a>; current; current=current-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a>)
<a name="l00157"></a>00157         {
<a name="l00158"></a>00158                 m_tail-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a> = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(*current);
<a name="l00159"></a>00159                 m_tail = m_tail-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a>;
<a name="l00160"></a>00160         }
<a name="l00161"></a>00161 
<a name="l00162"></a>00162         m_tail-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a> = NULL;
<a name="l00163"></a>00163 
<a name="l00164"></a>00164         <a class="code" href="class_buffered_transformation.html#e70658b0d271f8e114ac6c3cc9774ede" title="input a byte for processing">Put</a>(copy.<a class="code" href="class_byte_queue.html#c5dacd704039c50007791db1a7727a3f">m_lazyString</a>, copy.<a class="code" href="class_byte_queue.html#5d9df76de6604b236e19d7e4e52122a0">m_lazyLength</a>);
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166 
<a name="l00167"></a><a class="code" href="class_byte_queue.html#0c6dce34c8c4c7838f94917ed8911df6">00167</a> <a class="code" href="class_byte_queue.html#0c6dce34c8c4c7838f94917ed8911df6">ByteQueue::~ByteQueue</a>()
<a name="l00168"></a>00168 {
<a name="l00169"></a>00169         Destroy();
<a name="l00170"></a>00170 }
<a name="l00171"></a>00171 
<a name="l00172"></a>00172 <span class="keywordtype">void</span> ByteQueue::Destroy()
<a name="l00173"></a>00173 {
<a name="l00174"></a>00174         <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *next, *current=m_head; current; current=next)
<a name="l00175"></a>00175         {
<a name="l00176"></a>00176                 next=current-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a>;
<a name="l00177"></a>00177                 <span class="keyword">delete</span> current;
<a name="l00178"></a>00178         }
<a name="l00179"></a>00179 }
<a name="l00180"></a>00180 
<a name="l00181"></a><a class="code" href="class_byte_queue.html#7e576bc7629bd0947eb098ad23b0d675">00181</a> <span class="keywordtype">void</span> <a class="code" href="class_byte_queue.html#7e576bc7629bd0947eb098ad23b0d675">ByteQueue::IsolatedInitialize</a>(<span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &amp;parameters)
<a name="l00182"></a>00182 {
<a name="l00183"></a>00183         m_nodeSize = parameters.<a class="code" href="class_name_value_pairs.html#7ddb654b7afcd1a04422a7b4b01366d9" title="get a named value with type int, with default">GetIntValueWithDefault</a>(<span class="stringliteral">"NodeSize"</span>, 256);
<a name="l00184"></a>00184         <a class="code" href="class_byte_queue.html#2c305604a71571438aeb4c4e5e567c45">Clear</a>();
<a name="l00185"></a>00185 }
<a name="l00186"></a>00186 
<a name="l00187"></a><a class="code" href="class_byte_queue.html#003ce4b0f9525589327800d0a14b455f">00187</a> lword <a class="code" href="class_byte_queue.html#003ce4b0f9525589327800d0a14b455f">ByteQueue::CurrentSize</a>()<span class="keyword"> const</span>
<a name="l00188"></a>00188 <span class="keyword"></span>{
<a name="l00189"></a>00189         lword size=0;
<a name="l00190"></a>00190 
<a name="l00191"></a>00191         <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=m_head; current; current=current-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a>)
<a name="l00192"></a>00192                 size += current-&gt;CurrentSize();
<a name="l00193"></a>00193 
<a name="l00194"></a>00194         <span class="keywordflow">return</span> size + m_lazyLength;
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196 
<a name="l00197"></a><a class="code" href="class_byte_queue.html#c218d4b07fe058306a00475222869aaa">00197</a> <span class="keywordtype">bool</span> <a class="code" href="class_byte_queue.html#c218d4b07fe058306a00475222869aaa">ByteQueue::IsEmpty</a>()<span class="keyword"> const</span>
<a name="l00198"></a>00198 <span class="keyword"></span>{
<a name="l00199"></a>00199         <span class="keywordflow">return</span> m_head==m_tail &amp;&amp; m_head-&gt;<a class="code" href="class_byte_queue_node.html#82470c9722f07c056ed0b8c095daa340">CurrentSize</a>()==0 &amp;&amp; m_lazyLength==0;
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201 
<a name="l00202"></a><a class="code" href="class_byte_queue.html#2c305604a71571438aeb4c4e5e567c45">00202</a> <span class="keywordtype">void</span> <a class="code" href="class_byte_queue.html#2c305604a71571438aeb4c4e5e567c45">ByteQueue::Clear</a>()
<a name="l00203"></a>00203 {
<a name="l00204"></a>00204         <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *next, *current=m_head-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a>; current; current=next)
<a name="l00205"></a>00205         {
<a name="l00206"></a>00206                 next=current-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a>;
<a name="l00207"></a>00207                 <span class="keyword">delete</span> current;
<a name="l00208"></a>00208         }
<a name="l00209"></a>00209 
<a name="l00210"></a>00210         m_tail = m_head;
<a name="l00211"></a>00211         m_head-&gt;<a class="code" href="class_byte_queue_node.html#33a21b84db215ff511912f77e8389f53">Clear</a>();
<a name="l00212"></a>00212         m_head-&gt;<a class="code" href="class_byte_queue_node.html#ee1bdb525b2dd8c5d98de76949a85b1a">next</a> = NULL;
<a name="l00213"></a>00213         m_lazyLength = 0;
<a name="l00214"></a>00214 }
<a name="l00215"></a>00215 
<a name="l00216"></a><a class="code" href="class_byte_queue.html#684942d5641278a78e7c237a5bd4c69d">00216</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#684942d5641278a78e7c237a5bd4c69d" title="input multiple bytes for blocking or non-blocking processing">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)
<a name="l00217"></a>00217 {