<!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"/>
<title>Crypto++: queue.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">Crypto++</div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<div class="title">queue.cpp</div> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// queue.cpp - written and placed in the public domain by Wei Dai</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="preprocessor">#include "pch.h"</span>
<a name="l00004"></a>00004
<a name="l00005"></a>00005 <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span>
<a name="l00006"></a>00006 <span class="preprocessor"></span>
<a name="l00007"></a>00007 <span class="preprocessor">#include "queue.h"</span>
<a name="l00008"></a>00008 <span class="preprocessor">#include "<a class="code" href="filters_8h.html">filters.h</a>"</span>
<a name="l00009"></a>00009
<a name="l00010"></a>00010 NAMESPACE_BEGIN(CryptoPP)
<a name="l00011"></a>00011
<a name="l00012"></a>00012 static const <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> s_maxAutoNodeSize = 16*1024;
<a name="l00013"></a>00013
<a name="l00014"></a>00014 <span class="comment">// this class for use by ByteQueue only</span>
<a name="l00015"></a><a class="code" href="class_byte_queue_node.html">00015</a> class <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>
<a name="l00016"></a>00016 {
<a name="l00017"></a>00017 <span class="keyword">public</span>:
<a name="l00018"></a>00018 ByteQueueNode(<span class="keywordtype">size_t</span> maxSize)
<a name="l00019"></a>00019 : buf(maxSize)
<a name="l00020"></a>00020 {
<a name="l00021"></a>00021 m_head = m_tail = 0;
<a name="l00022"></a>00022 next = 0;
<a name="l00023"></a>00023 }
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> MaxSize()<span class="keyword"> const </span>{<span class="keywordflow">return</span> buf.size();}
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> CurrentSize()<span class="keyword"> const</span>
<a name="l00028"></a>00028 <span class="keyword"> </span>{
<a name="l00029"></a>00029 <span class="keywordflow">return</span> m_tail-m_head;
<a name="l00030"></a>00030 }
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="keyword">inline</span> <span class="keywordtype">bool</span> UsedUp()<span class="keyword"> const</span>
<a name="l00033"></a>00033 <span class="keyword"> </span>{
<a name="l00034"></a>00034 <span class="keywordflow">return</span> (m_head==MaxSize());
<a name="l00035"></a>00035 }
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="keyword">inline</span> <span class="keywordtype">void</span> Clear()
<a name="l00038"></a>00038 {
<a name="l00039"></a>00039 m_head = m_tail = 0;
<a name="l00040"></a>00040 }
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <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)
<a name="l00043"></a>00043 {
<a name="l00044"></a>00044 <span class="keywordtype">size_t</span> l = STDMIN(length, MaxSize()-m_tail);
<a name="l00045"></a>00045 <span class="keywordflow">if</span> (buf+m_tail != begin)
<a name="l00046"></a>00046 memcpy(buf+m_tail, begin, l);
<a name="l00047"></a>00047 m_tail += l;
<a name="l00048"></a>00048 <span class="keywordflow">return</span> l;
<a name="l00049"></a>00049 }
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Peek(byte &outByte)<span class="keyword"> const</span>
<a name="l00052"></a>00052 <span class="keyword"> </span>{
<a name="l00053"></a>00053 <span class="keywordflow">if</span> (m_tail==m_head)
<a name="l00054"></a>00054 <span class="keywordflow">return</span> 0;
<a name="l00055"></a>00055
<a name="l00056"></a>00056 outByte=buf[m_head];
<a name="l00057"></a>00057 <span class="keywordflow">return</span> 1;
<a name="l00058"></a>00058 }
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <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>
<a name="l00061"></a>00061 <span class="keyword"> </span>{
<a name="l00062"></a>00062 <span class="keywordtype">size_t</span> len = STDMIN(copyMax, m_tail-m_head);
<a name="l00063"></a>00063 memcpy(target, buf+m_head, len);
<a name="l00064"></a>00064 <span class="keywordflow">return</span> len;
<a name="l00065"></a>00065 }
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> CopyTo(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &target, <span class="keyword">const</span> std::string &channel=DEFAULT_CHANNEL)<span class="keyword"> const</span>
<a name="l00068"></a>00068 <span class="keyword"> </span>{
<a name="l00069"></a>00069 <span class="keywordtype">size_t</span> len = m_tail-m_head;
<a name="l00070"></a>00070 target.ChannelPut(channel, buf+m_head, len);
<a name="l00071"></a>00071 <span class="keywordflow">return</span> len;
<a name="l00072"></a>00072 }
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> CopyTo(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &target, <span class="keywordtype">size_t</span> copyMax, <span class="keyword">const</span> std::string &channel=DEFAULT_CHANNEL)<span class="keyword"> const</span>
<a name="l00075"></a>00075 <span class="keyword"> </span>{
<a name="l00076"></a>00076 <span class="keywordtype">size_t</span> len = STDMIN(copyMax, m_tail-m_head);
<a name="l00077"></a>00077 target.ChannelPut(channel, buf+m_head, len);
<a name="l00078"></a>00078 <span class="keywordflow">return</span> len;
<a name="l00079"></a>00079 }
<a name="l00080"></a>00080
<a name="l00081"></a>00081 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Get(byte &outByte)
<a name="l00082"></a>00082 {
<a name="l00083"></a>00083 <span class="keywordtype">size_t</span> len = Peek(outByte);
<a name="l00084"></a>00084 m_head += len;
<a name="l00085"></a>00085 <span class="keywordflow">return</span> len;
<a name="l00086"></a>00086 }
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> Get(byte *outString, <span class="keywordtype">size_t</span> getMax)
<a name="l00089"></a>00089 {
<a name="l00090"></a>00090 <span class="keywordtype">size_t</span> len = Peek(outString, getMax);
<a name="l00091"></a>00091 m_head += len;
<a name="l00092"></a>00092 <span class="keywordflow">return</span> len;
<a name="l00093"></a>00093 }
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <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> &target, <span class="keyword">const</span> std::string &channel=DEFAULT_CHANNEL)
<a name="l00096"></a>00096 {
<a name="l00097"></a>00097 <span class="keywordtype">size_t</span> len = m_tail-m_head;
<a name="l00098"></a>00098 target.ChannelPutModifiable(channel, buf+m_head, len);
<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>00103 <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> &target, lword transferMax, <span class="keyword">const</span> std::string &channel=DEFAULT_CHANNEL)
<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.ChannelPutModifiable(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>00111 <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>00118 <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>00123 ByteQueueNode *next;
<a name="l00124"></a>00124
<a name="l00125"></a>00125 <a class="code" href="class_sec_block.html">SecByteBlock</a> buf;
<a name="l00126"></a>00126 <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>00131 ByteQueue::ByteQueue(<span class="keywordtype">size_t</span> nodeSize)
<a name="l00132"></a>00132 : m_lazyString(NULL), m_lazyLength(0)
<a name="l00133"></a>00133 {
<a name="l00134"></a>00134 SetNodeSize(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>00138 <span class="keywordtype">void</span> ByteQueue::SetNodeSize(<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>00144 ByteQueue::ByteQueue(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html" title="Byte Queue.">ByteQueue</a> &copy)
<a name="l00145"></a>00145 : m_lazyString(NULL)
<a name="l00146"></a>00146 {
<a name="l00147"></a>00147 CopyFrom(copy);
<a name="l00148"></a>00148 }
<a name="l00149"></a>00149
<a name="l00150"></a>00150 <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> &copy)
<a name="l00151"></a>00151 {
<a name="l00152"></a>00152 m_lazyLength = 0;
<a name="l00153"></a>00153 m_autoNodeSize = copy.m_autoNodeSize;
<a name="l00154"></a>00154 m_nodeSize = copy.m_nodeSize;
<a name="l00155"></a>00155 m_head = m_tail = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(*copy.m_head);
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <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)
<a name="l00158"></a>00158 {
<a name="l00159"></a>00159 m_tail->next = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(*current);
<a name="l00160"></a>00160 m_tail = m_tail->next;
<a name="l00161"></a>00161 }
<a name="l00162"></a>00162
<a name="l00163"></a>00163 m_tail->next = NULL;
<a name="l00164"></a>00164
<a name="l00165"></a>00165 <a class="code" href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede" title="input a byte for processing">Put</a>(copy.m_lazyString, copy.m_lazyLength);
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167
<a name="l00168"></a>00168 ByteQueue::~ByteQueue()
<a name="l00169"></a>00169 {
<a name="l00170"></a>00170 Destroy();
<a name="l00171"></a>00171 }
<a name="l00172"></a>00172
<a name="l00173"></a>00173 <span class="keywordtype">void</span> ByteQueue::Destroy()
<a name="l00174"></a>00174 {
<a name="l00175"></a>00175 <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="l00176"></a>00176 {
<a name="l00177"></a>00177 next=current->next;
<a name="l00178"></a>00178 <span class="keyword">delete</span> current;
<a name="l00179"></a>00179 }
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordtype">void</span> ByteQueue::IsolatedInitialize(<span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &parameters)
<a name="l00183"></a>00183 {
<a name="l00184"></a>00184 m_nodeSize = parameters.<a class="code" href="class_name_value_pairs.html#ac269314685b737912d3499f4a9399618" title="get a named value with type int, with default">GetIntValueWithDefault</a>(<span class="stringliteral">"NodeSize"</span>, 256);
<a name="l00185"></a>00185 Clear();
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187
<a name="l00188"></a>00188 lword ByteQueue::CurrentSize()<span class="keyword"> const</span>
<a name="l00189"></a>00189 <span class="keyword"></span>{
<a name="l00190"></a>00190 lword size=0;
<a name="l00191"></a>00191
<a name="l00192"></a>00192 <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=m_head; current; current=current->next)
<a name="l00193"></a>00193 size += current->CurrentSize();
<a name="l00194"></a>00194
<a name="l00195"></a>00195 <span class="keywordflow">return</span> size + m_lazyLength;
<a name="l00196"></a>00196 }
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="keywordtype">bool</span> ByteQueue::IsEmpty()<span class="keyword"> const</span>
<a name="l00199"></a>00199 <span class="keyword"></span>{
<a name="l00200"></a>00200 <span class="keywordflow">return</span> m_head==m_tail && m_head->CurrentSize()==0 && m_lazyLength==0;
<a name="l00201"></a>00201 }
<a name="l00202"></a>00202
<a name="l00203"></a>00203 <span class="keywordtype">void</span> ByteQueue::Clear()
<a name="l00204"></a>00204 {
<a name="l00205"></a>00205 <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *next, *current=m_head->next; current; current=next)
<a name="l00206"></a>00206 {
<a name="l00207"></a>00207 next=current->next;
<a name="l00208"></a>00208 <span class="keyword">delete</span> current;
<a name="l00209"></a>00209 }
<a name="l00210"></a>00210
<a name="l00211"></a>00211 m_tail = m_head;
<a name="l00212"></a>00212 m_head->Clear();
<a name="l00213"></a>00213 m_head->next = NULL;
<a name="l00214"></a>00214 m_lazyLength = 0;
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216
<a name="l00217"></a><a class="code" href="class_byte_queue.html#a684942d5641278a78e7c237a5bd4c69d">00217</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a684942d5641278a78e7c237a5bd4c69d" 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="l00218"></a>00218 {
<a name="l00219"></a>00219 <span class="keywordflow">if</span> (m_lazyLength > 0)
<a name="l00220"></a>00220 FinalizeLazyPut();
<a name="l00221"></a>00221
<a name="l00222"></a>00222 <span class="keywordtype">size_t</span> len;
<a name="l00223"></a>00223 <span class="keywordflow">while</span> ((len=m_tail->Put(inString, length)) < length)
<a name="l00224"></a>00224 {
<a name="l00225"></a>00225 inString += len;
<a name="l00226"></a>00226 length -= len;
<a name="l00227"></a>00227 <span class="keywordflow">if</span> (m_autoNodeSize && m_nodeSize < s_maxAutoNodeSize)
<a name="l00228"></a>00228 <span class="keywordflow">do</span>
<a name="l00229"></a>00229 {
<a name="l00230"></a>00230 m_nodeSize *= 2;
<a name="l00231"></a>00231 }
<a name="l00232"></a>00232 <span class="keywordflow">while</span> (m_nodeSize < length && m_nodeSize < s_maxAutoNodeSize);
<a name="l00233"></a>00233 m_tail->next = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(STDMAX(m_nodeSize, length));
<a name="l00234"></a>00234 m_tail = m_tail->next;
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="keywordflow">return</span> 0;
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keywordtype">void</span> ByteQueue::CleanupUsedNodes()
<a name="l00241"></a>00241 {
<a name="l00242"></a>00242 <span class="keywordflow">while</span> (m_head != m_tail && m_head->UsedUp())
<a name="l00243"></a>00243 {
<a name="l00244"></a>00244 <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *temp=m_head;
<a name="l00245"></a>00245 m_head=m_head->next;
<a name="l00246"></a>00246 <span class="keyword">delete</span> temp;
<a name="l00247"></a>00247 }
<a name="l00248"></a>00248
<a name="l00249"></a>00249 <span class="keywordflow">if</span> (m_head->CurrentSize() == 0)
<a name="l00250"></a>00250 m_head->Clear();
<a name="l00251"></a>00251 }
<a name="l00252"></a>00252
<a name="l00253"></a>00253 <span class="keywordtype">void</span> ByteQueue::LazyPut(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> size)
<a name="l00254"></a>00254 {
<a name="l00255"></a>00255 <span class="keywordflow">if</span> (m_lazyLength > 0)
<a name="l00256"></a>00256 FinalizeLazyPut();
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="keywordflow">if</span> (inString == m_tail->buf+m_tail->m_tail)
<a name="l00259"></a>00259 <a class="code" href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede" title="input a byte for processing">Put</a>(inString, size);
<a name="l00260"></a>00260 <span class="keywordflow">else</span>
<a name="l00261"></a>00261 {
<a name="l00262"></a>00262 m_lazyString = <span class="keyword">const_cast<</span>byte *<span class="keyword">></span>(inString);
<a name="l00263"></a>00263 m_lazyLength = size;
<a name="l00264"></a>00264 m_lazyStringModifiable = <span class="keyword">false</span>;
<a name="l00265"></a>00265 }
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="keywordtype">void</span> ByteQueue::LazyPutModifiable(byte *inString, <span class="keywordtype">size_t</span> size)
<a name="l00269"></a>00269 {
<a name="l00270"></a>00270 <span class="keywordflow">if</span> (m_lazyLength > 0)
<a name="l00271"></a>00271 FinalizeLazyPut();
<a name="l00272"></a>00272 m_lazyString = inString;
<a name="l00273"></a>00273 m_lazyLength = size;
<a name="l00274"></a>00274 m_lazyStringModifiable = <span class="keyword">true</span>;
<a name="l00275"></a>00275 }
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="keywordtype">void</span> ByteQueue::UndoLazyPut(<span class="keywordtype">size_t</span> size)
<a name="l00278"></a>00278 {
<a name="l00279"></a>00279 <span class="keywordflow">if</span> (m_lazyLength < size)
<a name="l00280"></a>00280 <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html" title="exception thrown when an invalid argument is detected">InvalidArgument</a>(<span class="stringliteral">"ByteQueue: size specified for UndoLazyPut is too large"</span>);
<a name="l00281"></a>00281
<a name="l00282"></a>00282 m_lazyLength -= size;
<a name="l00283"></a>00283 }
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <span class="keywordtype">void</span> ByteQueue::FinalizeLazyPut()
<a name="l00286"></a>00286 {
<a name="l00287"></a>00287 <span class="keywordtype">size_t</span> len = m_lazyLength;
<a name="l00288"></a>00288 m_lazyLength = 0;
<a name="l00289"></a>00289 <span class="keywordflow">if</span> (len)
<a name="l00290"></a>00290 <a class="code" href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede" title="input a byte for processing">Put</a>(m_lazyString, len);
<a name="l00291"></a>00291 }
<a name="l00292"></a>00292
<a name="l00293"></a><a class="code" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632">00293</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632" title="try to retrieve a single byte">ByteQueue::Get</a>(byte &outByte)
<a name="l00294"></a>00294 {
<a name="l00295"></a>00295 <span class="keywordflow">if</span> (m_head->Get(outByte))
<a name="l00296"></a>00296 {
<a name="l00297"></a>00297 <span class="keywordflow">if</span> (m_head->UsedUp())
<a name="l00298"></a>00298 CleanupUsedNodes();
<a name="l00299"></a>00299 <span class="keywordflow">return</span> 1;
<a name="l00300"></a>00300 }
<a name="l00301"></a>00301 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_lazyLength > 0)
<a name="l00302"></a>00302 {
<a name="l00303"></a>00303 outByte = *m_lazyString++;
<a name="l00304"></a>00304 m_lazyLength--;
<a name="l00305"></a>00305 <span class="keywordflow">return</span> 1;
<a name="l00306"></a>00306 }
<a name="l00307"></a>00307 <span class="keywordflow">else</span>
<a name="l00308"></a>00308 <span class="keywordflow">return</span> 0;
<a name="l00309"></a>00309 }
<a name="l00310"></a>00310
<a name="l00311"></a><a class="code" href="class_byte_queue.html#a933457ad0a5a34fb5e7dc71b2a92c3a7">00311</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632" title="try to retrieve a single byte">ByteQueue::Get</a>(byte *outString, <span class="keywordtype">size_t</span> getMax)
<a name="l00312"></a>00312 {
<a name="l00313"></a>00313 <a class="code" href="class_array_sink.html" title="Copy input to a memory buffer.">ArraySink</a> sink(outString, getMax);
<a name="l00314"></a>00314 <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#ac31ac5d2da7897fb097086496b85e6f5" title="move transferMax bytes of the buffered output to target as input">TransferTo</a>(sink, getMax);
<a name="l00315"></a>00315 }
<a name="l00316"></a>00316
<a name="l00317"></a><a class="code" href="class_byte_queue.html#a67e9cc7f56a2be014ee4c9f033bb2ada">00317</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a67e9cc7f56a2be014ee4c9f033bb2ada" title="peek at the next byte without removing it from the output buffer">ByteQueue::Peek</a>(byte &outByte)<span class="keyword"> const</span>
<a name="l00318"></a>00318 <span class="keyword"></span>{
<a name="l00319"></a>00319 <span class="keywordflow">if</span> (m_head->Peek(outByte))
<a name="l00320"></a>00320 <span class="keywordflow">return</span> 1;
<a name="l00321"></a>00321 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_lazyLength > 0)
<a name="l00322"></a>00322 {
<a name="l00323"></a>00323 outByte = *m_lazyString;
<a name="l00324"></a>00324 <span class="keywordflow">return</span> 1;
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326 <span class="keywordflow">else</span>
<a name="l00327"></a>00327 <span class="keywordflow">return</span> 0;
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329
<a name="l00330"></a><a class="code" href="class_byte_queue.html#ab18a5abc1d881c014705a7ea0c467d81">00330</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a67e9cc7f56a2be014ee4c9f033bb2ada" title="peek at the next byte without removing it from the output buffer">ByteQueue::Peek</a>(byte *outString, <span class="keywordtype">size_t</span> peekMax)<span class="keyword"> const</span>
<a name="l00331"></a>00331 <span class="keyword"></span>{
<a name="l00332"></a>00332 <a class="code" href="class_array_sink.html" title="Copy input to a memory buffer.">ArraySink</a> sink(outString, peekMax);
<a name="l00333"></a>00333 <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#a5253b8693ac9932f3862b71c9960903c" title="copy copyMax bytes of the buffered output to target as input">CopyTo</a>(sink, peekMax);
<a name="l00334"></a>00334 }
<a name="l00335"></a>00335
<a name="l00336"></a><a class="code" href="class_byte_queue.html#a9863db3b56bf42fb424f426afb7531cd">00336</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a9863db3b56bf42fb424f426afb7531cd" title="upon return, byteCount contains number of bytes that have finished being transfered, and returns the number of bytes left in the current transfer block">ByteQueue::TransferTo2</a>(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &target, lword &transferBytes, <span class="keyword">const</span> std::string &channel, <span class="keywordtype">bool</span> blocking)
<a name="l00337"></a>00337 {
<a name="l00338"></a>00338 <span class="keywordflow">if</span> (blocking)
<a name="l00339"></a>00339 {
<a name="l00340"></a>00340 lword bytesLeft = transferBytes;
<a name="l00341"></a>00341 <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=m_head; bytesLeft && current; current=current->next)
<a name="l00342"></a>00342 bytesLeft -= current->TransferTo(target, bytesLeft, channel);
<a name="l00343"></a>00343 CleanupUsedNodes();
<a name="l00344"></a>00344
<a name="l00345"></a>00345 <span class="keywordtype">size_t</span> len = (size_t)STDMIN(bytesLeft, (lword)m_lazyLength);
<a name="l00346"></a>00346 <span class="keywordflow">if</span> (len)
<a name="l00347"></a>00347 {
<a name="l00348"></a>00348 <span class="keywordflow">if</span> (m_lazyStringModifiable)
<a name="l00349"></a>00349 target.ChannelPutModifiable(channel, m_lazyString, len);
<a name="l00350"></a>00350 <span class="keywordflow">else</span>
<a name="l00351"></a>00351 target.ChannelPut(channel, m_lazyString, len);
<a name="l00352"></a>00352 m_lazyString += len;
<a name="l00353"></a>00353 m_lazyLength -= len;
<a name="l00354"></a>00354 bytesLeft -= len;
<a name="l00355"></a>00355 }
<a name="l00356"></a>00356 transferBytes -= bytesLeft;
<a name="l00357"></a>00357 <span class="keywordflow">return</span> 0;
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359 <span class="keywordflow">else</span>
<a name="l00360"></a>00360 {
<a name="l00361"></a>00361 <a class="code" href="class_byte_queue_1_1_walker.html">Walker</a> walker(*<span class="keyword">this</span>);
<a name="l00362"></a>00362 <span class="keywordtype">size_t</span> blockedBytes = walker.<a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43" title="upon return, byteCount contains number of bytes that have finished being transfered, and returns the number of bytes left in the current transfer block">TransferTo2</a>(target, transferBytes, channel, blocking);
<a name="l00363"></a>00363 <a class="code" href="class_buffered_transformation.html#a0c25529ded99db20ad35ccef3f7234e6" title="discard skipMax bytes from the output buffer">Skip</a>(transferBytes);
<a name="l00364"></a>00364 <span class="keywordflow">return</span> blockedBytes;
<a name="l00365"></a>00365 }
<a name="l00366"></a>00366 }
<a name="l00367"></a>00367
<a name="l00368"></a><a class="code" href="class_byte_queue.html#a9a389914e2003ebb26516e4a6ad27c2c">00368</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a9a389914e2003ebb26516e4a6ad27c2c" title="upon return, begin contains the start position of data yet to be finished copying, and returns the number of bytes left in the current transfer block">ByteQueue::CopyRangeTo2</a>(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">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>
<a name="l00369"></a>00369 <span class="keyword"></span>{
<a name="l00370"></a>00370 <a class="code" href="class_byte_queue_1_1_walker.html">Walker</a> walker(*<span class="keyword">this</span>);
<a name="l00371"></a>00371 walker.<a class="code" href="class_buffered_transformation.html#a0c25529ded99db20ad35ccef3f7234e6" title="discard skipMax bytes from the output buffer">Skip</a>(begin);
<a name="l00372"></a>00372 lword transferBytes = end-begin;
<a name="l00373"></a>00373 <span class="keywordtype">size_t</span> blockedBytes = walker.<a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43" title="upon return, byteCount contains number of bytes that have finished being transfered, and returns the number of bytes left in the current transfer block">TransferTo2</a>(target, transferBytes, channel, blocking);
<a name="l00374"></a>00374 begin += transferBytes;
<a name="l00375"></a>00375 <span class="keywordflow">return</span> blockedBytes;
<a name="l00376"></a>00376 }
<a name="l00377"></a>00377
<a name="l00378"></a>00378 <span class="keywordtype">void</span> ByteQueue::Unget(byte inByte)
<a name="l00379"></a>00379 {
<a name="l00380"></a>00380 Unget(&inByte, 1);
<a name="l00381"></a>00381 }
<a name="l00382"></a>00382
<a name="l00383"></a>00383 <span class="keywordtype">void</span> ByteQueue::Unget(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> length)
<a name="l00384"></a>00384 {
<a name="l00385"></a>00385 <span class="keywordtype">size_t</span> len = STDMIN(length, m_head->m_head);
<a name="l00386"></a>00386 length -= len;
<a name="l00387"></a>00387 m_head->m_head -= len;
<a name="l00388"></a>00388 memcpy(m_head->buf + m_head->m_head, inString + length, len);
<a name="l00389"></a>00389
<a name="l00390"></a>00390 <span class="keywordflow">if</span> (length > 0)
<a name="l00391"></a>00391 {
<a name="l00392"></a>00392 <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);
<a name="l00393"></a>00393 newHead->next = m_head;
<a name="l00394"></a>00394 m_head = newHead;
<a name="l00395"></a>00395 m_head->Put(inString, length);
<a name="l00396"></a>00396 }
<a name="l00397"></a>00397 }
<a name="l00398"></a>00398
<a name="l00399"></a>00399 <span class="keyword">const</span> byte * ByteQueue::Spy(<span class="keywordtype">size_t</span> &contiguousSize)<span class="keyword"> const</span>
<a name="l00400"></a>00400 <span class="keyword"></span>{
<a name="l00401"></a>00401 contiguousSize = m_head->m_tail - m_head->m_head;
<a name="l00402"></a>00402 <span class="keywordflow">if</span> (contiguousSize == 0 && m_lazyLength > 0)
<a name="l00403"></a>00403 {
<a name="l00404"></a>00404 contiguousSize = m_lazyLength;
<a name="l00405"></a>00405 <span class="keywordflow">return</span> m_lazyString;
<a name="l00406"></a>00406 }
<a name="l00407"></a>00407 <span class="keywordflow">else</span>
<a name="l00408"></a>00408 <span class="keywordflow">return</span> m_head->buf + m_head->m_head;
<a name="l00409"></a>00409 }
<a name="l00410"></a>00410
<a name="l00411"></a><a class="code" href="class_byte_queue.html#ae6b49917c3217c5e3b8dd71d40498e5f">00411</a> byte * <a class="code" href="class_byte_queue.html#ae6b49917c3217c5e3b8dd71d40498e5f" title="request space which can be written into by the caller, and then used as input to Put()">ByteQueue::CreatePutSpace</a>(<span class="keywordtype">size_t</span> &size)
<a name="l00412"></a>00412 {
<a name="l00413"></a>00413 <span class="keywordflow">if</span> (m_lazyLength > 0)
<a name="l00414"></a>00414 FinalizeLazyPut();
<a name="l00415"></a>00415
<a name="l00416"></a>00416 <span class="keywordflow">if</span> (m_tail->m_tail == m_tail->MaxSize())
<a name="l00417"></a>00417 {
<a name="l00418"></a>00418 m_tail->next = <span class="keyword">new</span> <a class="code" href="class_byte_queue_node.html">ByteQueueNode</a>(STDMAX(m_nodeSize, size));
<a name="l00419"></a>00419 m_tail = m_tail->next;
<a name="l00420"></a>00420 }
<a name="l00421"></a>00421
<a name="l00422"></a>00422 size = m_tail->MaxSize() - m_tail->m_tail;
<a name="l00423"></a>00423 <span class="keywordflow">return</span> m_tail->buf + m_tail->m_tail;
<a name="l00424"></a>00424 }
<a name="l00425"></a>00425
<a name="l00426"></a>00426 <a class="code" href="class_byte_queue.html" title="Byte Queue.">ByteQueue</a> & ByteQueue::operator=(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html" title="Byte Queue.">ByteQueue</a> &rhs)
<a name="l00427"></a>00427 {
<a name="l00428"></a>00428 Destroy();
<a name="l00429"></a>00429 CopyFrom(rhs);
<a name="l00430"></a>00430 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00431"></a>00431 }
<a name="l00432"></a>00432
<a name="l00433"></a>00433 <span class="keywordtype">bool</span> ByteQueue::operator==(<span class="keyword">const</span> <a class="code" href="class_byte_queue.html" title="Byte Queue.">ByteQueue</a> &rhs)<span class="keyword"> const</span>
<a name="l00434"></a>00434 <span class="keyword"></span>{
<a name="l00435"></a>00435 <span class="keyword">const</span> lword currentSize = CurrentSize();
<a name="l00436"></a>00436
<a name="l00437"></a>00437 <span class="keywordflow">if</span> (currentSize != rhs.CurrentSize())
<a name="l00438"></a>00438 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00439"></a>00439
<a name="l00440"></a>00440 Walker walker1(*<span class="keyword">this</span>), walker2(rhs);
<a name="l00441"></a>00441 byte b1, b2;
<a name="l00442"></a>00442
<a name="l00443"></a>00443 <span class="keywordflow">while</span> (walker1.Get(b1) && walker2.Get(b2))
<a name="l00444"></a>00444 <span class="keywordflow">if</span> (b1 != b2)
<a name="l00445"></a>00445 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00446"></a>00446
<a name="l00447"></a>00447 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00448"></a>00448 }
<a name="l00449"></a>00449
<a name="l00450"></a>00450 byte ByteQueue::operator[](lword i)<span class="keyword"> const</span>
<a name="l00451"></a>00451 <span class="keyword"></span>{
<a name="l00452"></a>00452 <span class="keywordflow">for</span> (<a class="code" href="class_byte_queue_node.html">ByteQueueNode</a> *current=m_head; current; current=current->next)
<a name="l00453"></a>00453 {
<a name="l00454"></a>00454 <span class="keywordflow">if</span> (i < current->CurrentSize())
<a name="l00455"></a>00455 <span class="keywordflow">return</span> (*current)[(size_t)i];
<a name="l00456"></a>00456
<a name="l00457"></a>00457 i -= current->CurrentSize();
<a name="l00458"></a>00458 }
<a name="l00459"></a>00459
<a name="l00460"></a>00460 assert(i < m_lazyLength);
<a name="l00461"></a>00461 <span class="keywordflow">return</span> m_lazyString[i];
<a name="l00462"></a>00462 }
<a name="l00463"></a>00463
<a name="l00464"></a>00464 <span class="keywordtype">void</span> ByteQueue::swap(<a class="code" href="class_byte_queue.html" title="Byte Queue.">ByteQueue</a> &rhs)
<a name="l00465"></a>00465 {
<a name="l00466"></a>00466 std::swap(m_autoNodeSize, rhs.m_autoNodeSize);
<a name="l00467"></a>00467 std::swap(m_nodeSize, rhs.m_nodeSize);
<a name="l00468"></a>00468 std::swap(m_head, rhs.m_head);
<a name="l00469"></a>00469 std::swap(m_tail, rhs.m_tail);
<a name="l00470"></a>00470 std::swap(m_lazyString, rhs.m_lazyString);
<a name="l00471"></a>00471 std::swap(m_lazyLength, rhs.m_lazyLength);
<a name="l00472"></a>00472 std::swap(m_lazyStringModifiable, rhs.m_lazyStringModifiable);
<a name="l00473"></a>00473 }
<a name="l00474"></a>00474
<a name="l00475"></a>00475 <span class="comment">// ********************************************************</span>
<a name="l00476"></a>00476
<a name="l00477"></a>00477 <span class="keywordtype">void</span> ByteQueue::Walker::IsolatedInitialize(<span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &parameters)
<a name="l00478"></a>00478 {
<a name="l00479"></a>00479 m_node = m_queue.m_head;
<a name="l00480"></a>00480 m_position = 0;
<a name="l00481"></a>00481 m_offset = 0;
<a name="l00482"></a>00482 m_lazyString = m_queue.m_lazyString;
<a name="l00483"></a>00483 m_lazyLength = m_queue.m_lazyLength;
<a name="l00484"></a>00484 }
<a name="l00485"></a>00485
<a name="l00486"></a><a class="code" href="class_byte_queue_1_1_walker.html#a1577996016d4fc5e644b86eb1a4f1660">00486</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632" title="try to retrieve a single byte">ByteQueue::Walker::Get</a>(byte &outByte)
<a name="l00487"></a>00487 {
<a name="l00488"></a>00488 <a class="code" href="class_array_sink.html" title="Copy input to a memory buffer.">ArraySink</a> sink(&outByte, 1);
<a name="l00489"></a>00489 <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#ac31ac5d2da7897fb097086496b85e6f5" title="move transferMax bytes of the buffered output to target as input">TransferTo</a>(sink, 1);
<a name="l00490"></a>00490 }
<a name="l00491"></a>00491
<a name="l00492"></a><a class="code" href="class_byte_queue_1_1_walker.html#a940623c7bff90ab48f1534352675f92b">00492</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a19413e3aa72b749e3771d617e8eca632" title="try to retrieve a single byte">ByteQueue::Walker::Get</a>(byte *outString, <span class="keywordtype">size_t</span> getMax)
<a name="l00493"></a>00493 {
<a name="l00494"></a>00494 <a class="code" href="class_array_sink.html" title="Copy input to a memory buffer.">ArraySink</a> sink(outString, getMax);
<a name="l00495"></a>00495 <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#ac31ac5d2da7897fb097086496b85e6f5" title="move transferMax bytes of the buffered output to target as input">TransferTo</a>(sink, getMax);
<a name="l00496"></a>00496 }
<a name="l00497"></a>00497
<a name="l00498"></a><a class="code" href="class_byte_queue_1_1_walker.html#af2c8cbc9323d5844d3080fd29e7cf308">00498</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a67e9cc7f56a2be014ee4c9f033bb2ada" title="peek at the next byte without removing it from the output buffer">ByteQueue::Walker::Peek</a>(byte &outByte)<span class="keyword"> const</span>
<a name="l00499"></a>00499 <span class="keyword"></span>{
<a name="l00500"></a>00500 <a class="code" href="class_array_sink.html" title="Copy input to a memory buffer.">ArraySink</a> sink(&outByte, 1);
<a name="l00501"></a>00501 <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#a5253b8693ac9932f3862b71c9960903c" title="copy copyMax bytes of the buffered output to target as input">CopyTo</a>(sink, 1);
<a name="l00502"></a>00502 }
<a name="l00503"></a>00503
<a name="l00504"></a><a class="code" href="class_byte_queue_1_1_walker.html#a9f72a866515e0c7a155654d5bd1c427d">00504</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a67e9cc7f56a2be014ee4c9f033bb2ada" title="peek at the next byte without removing it from the output buffer">ByteQueue::Walker::Peek</a>(byte *outString, <span class="keywordtype">size_t</span> peekMax)<span class="keyword"> const</span>
<a name="l00505"></a>00505 <span class="keyword"></span>{
<a name="l00506"></a>00506 <a class="code" href="class_array_sink.html" title="Copy input to a memory buffer.">ArraySink</a> sink(outString, peekMax);
<a name="l00507"></a>00507 <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)<a class="code" href="class_buffered_transformation.html#a5253b8693ac9932f3862b71c9960903c" title="copy copyMax bytes of the buffered output to target as input">CopyTo</a>(sink, peekMax);
<a name="l00508"></a>00508 }
<a name="l00509"></a>00509
<a name="l00510"></a><a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43">00510</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a9863db3b56bf42fb424f426afb7531cd" title="upon return, byteCount contains number of bytes that have finished being transfered, and returns the number of bytes left in the current transfer block">ByteQueue::Walker::TransferTo2</a>(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &target, lword &transferBytes, <span class="keyword">const</span> std::string &channel, <span class="keywordtype">bool</span> blocking)
<a name="l00511"></a>00511 {
<a name="l00512"></a>00512 lword bytesLeft = transferBytes;
<a name="l00513"></a>00513 <span class="keywordtype">size_t</span> blockedBytes = 0;
<a name="l00514"></a>00514
<a name="l00515"></a>00515 <span class="keywordflow">while</span> (m_node)
<a name="l00516"></a>00516 {
<a name="l00517"></a>00517 <span class="keywordtype">size_t</span> len = (size_t)STDMIN(bytesLeft, (lword)m_node->CurrentSize()-m_offset);
<a name="l00518"></a>00518 blockedBytes = target.ChannelPut2(channel, m_node->buf+m_node->m_head+m_offset, len, 0, blocking);
<a name="l00519"></a>00519
<a name="l00520"></a>00520 <span class="keywordflow">if</span> (blockedBytes)
<a name="l00521"></a>00521 <span class="keywordflow">goto</span> done;
<a name="l00522"></a>00522
<a name="l00523"></a>00523 m_position += len;
<a name="l00524"></a>00524 bytesLeft -= len;
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="keywordflow">if</span> (!bytesLeft)
<a name="l00527"></a>00527 {
<a name="l00528"></a>00528 m_offset += len;
<a name="l00529"></a>00529 <span class="keywordflow">goto</span> done;
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531
<a name="l00532"></a>00532 m_node = m_node->next;
<a name="l00533"></a>00533 m_offset = 0;
<a name="l00534"></a>00534 }
<a name="l00535"></a>00535
<a name="l00536"></a>00536 <span class="keywordflow">if</span> (bytesLeft && m_lazyLength)
<a name="l00537"></a>00537 {
<a name="l00538"></a>00538 <span class="keywordtype">size_t</span> len = (size_t)STDMIN(bytesLeft, (lword)m_lazyLength);
<a name="l00539"></a>00539 blockedBytes = target.ChannelPut2(channel, m_lazyString, len, 0, blocking);
<a name="l00540"></a>00540 <span class="keywordflow">if</span> (blockedBytes)
<a name="l00541"></a>00541 <span class="keywordflow">goto</span> done;
<a name="l00542"></a>00542
<a name="l00543"></a>00543 m_lazyString += len;
<a name="l00544"></a>00544 m_lazyLength -= len;
<a name="l00545"></a>00545 bytesLeft -= len;
<a name="l00546"></a>00546 }
<a name="l00547"></a>00547
<a name="l00548"></a>00548 done:
<a name="l00549"></a>00549 transferBytes -= bytesLeft;
<a name="l00550"></a>00550 <span class="keywordflow">return</span> blockedBytes;
<a name="l00551"></a>00551 }
<a name="l00552"></a>00552
<a name="l00553"></a><a class="code" href="class_byte_queue_1_1_walker.html#afd93fd488861bc8bc14c4620be327cc1">00553</a> <span class="keywordtype">size_t</span> <a class="code" href="class_byte_queue.html#a9a389914e2003ebb26516e4a6ad27c2c" title="upon return, begin contains the start position of data yet to be finished copying, and returns the number of bytes left in the current transfer block">ByteQueue::Walker::CopyRangeTo2</a>(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">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>
<a name="l00554"></a>00554 <span class="keyword"></span>{
<a name="l00555"></a>00555 <a class="code" href="class_byte_queue_1_1_walker.html">Walker</a> walker(*<span class="keyword">this</span>);
<a name="l00556"></a>00556 walker.<a class="code" href="class_buffered_transformation.html#a0c25529ded99db20ad35ccef3f7234e6" title="discard skipMax bytes from the output buffer">Skip</a>(begin);
<a name="l00557"></a>00557 lword transferBytes = end-begin;
<a name="l00558"></a>00558 <span class="keywordtype">size_t</span> blockedBytes = walker.<a class="code" href="class_byte_queue_1_1_walker.html#a47dd1577232b3d6ebd311b5c6d8a1f43" title="upon return, byteCount contains number of bytes that have finished being transfered, and returns the number of bytes left in the current transfer block">TransferTo2</a>(target, transferBytes, channel, blocking);
<a name="l00559"></a>00559 begin += transferBytes;
<a name="l00560"></a>00560 <span class="keywordflow">return</span> blockedBytes;
<a name="l00561"></a>00561 }
<a name="l00562"></a>00562
<a name="l00563"></a>00563 NAMESPACE_END
<a name="l00564"></a>00564
<a name="l00565"></a>00565 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Sun Oct 16 2011 for Crypto++ by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>
