⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 filters_8h-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 5 页
字号:
<a name="l00158"></a>00158         {<a name="l00159"></a>00159                 <span class="keywordflow">return</span> PutMaybeModifiable(inString, length, messageEnd, blocking, <span class="keyword">true</span>);<a name="l00160"></a>00160         }<span class="comment"></span><a name="l00161"></a>00161 <span class="comment">        /*! calls ForceNextPut() if hardFlush is true */</span><a name="l00162"></a>00162         <span class="keywordtype">bool</span> IsolatedFlush(<span class="keywordtype">bool</span> hardFlush, <span class="keywordtype">bool</span> blocking);<a name="l00163"></a>00163 <span class="comment"></span><a name="l00164"></a>00164 <span class="comment">        /*! The input buffer may contain more than blockSize bytes if lastSize != 0.</span><a name="l00165"></a>00165 <span class="comment">                ForceNextPut() forces a call to NextPut() if this is the case.</span><a name="l00166"></a>00166 <span class="comment">        */</span><a name="l00167"></a>00167         <span class="keywordtype">void</span> ForceNextPut();<a name="l00168"></a>00168 <a name="l00169"></a>00169 <span class="keyword">protected</span>:<a name="l00170"></a><a class="code" href="class_filter_with_buffered_input.html#9021ea73725cb33497a754d758c888c7">00170</a>         <span class="keywordtype">bool</span> DidFirstPut() {<span class="keywordflow">return</span> m_firstInputDone;}<a name="l00171"></a>00171 <a name="l00172"></a><a class="code" href="class_filter_with_buffered_input.html#5fba4d91d6349ecf1036c1aeb21d5e96">00172</a>         <span class="keyword">virtual</span> <span class="keywordtype">void</span> InitializeDerivedAndReturnNewSizes(<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, <span class="keywordtype">size_t</span> &amp;firstSize, <span class="keywordtype">size_t</span> &amp;blockSize, <span class="keywordtype">size_t</span> &amp;lastSize)<a name="l00173"></a>00173                 {InitializeDerived(parameters);}<a name="l00174"></a><a class="code" href="class_filter_with_buffered_input.html#3ec70bc40d20c59bf2e9e48f426cea9c">00174</a>         <span class="keyword">virtual</span> <span class="keywordtype">void</span> InitializeDerived(<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="l00175"></a>00175         <span class="comment">// FirstPut() is called if (firstSize != 0 and totalLength &gt;= firstSize)</span><a name="l00176"></a>00176         <span class="comment">// or (firstSize == 0 and (totalLength &gt; 0 or a MessageEnd() is received))</span><a name="l00177"></a>00177         <span class="keyword">virtual</span> <span class="keywordtype">void</span> FirstPut(<span class="keyword">const</span> byte *inString) =0;<a name="l00178"></a>00178         <span class="comment">// NextPut() is called if totalLength &gt;= firstSize+blockSize+lastSize</span><a name="l00179"></a><a class="code" href="class_filter_with_buffered_input.html#ea864f9148947328c18fab2e17603d61">00179</a>         <span class="keyword">virtual</span> <span class="keywordtype">void</span> NextPutSingle(<span class="keyword">const</span> byte *inString) {assert(<span class="keyword">false</span>);}<a name="l00180"></a>00180         <span class="comment">// Same as NextPut() except length can be a multiple of blockSize</span><a name="l00181"></a>00181         <span class="comment">// Either NextPut() or NextPutMultiple() must be overriden</span><a name="l00182"></a>00182         <span class="keyword">virtual</span> <span class="keywordtype">void</span> NextPutMultiple(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> length);<a name="l00183"></a>00183         <span class="comment">// Same as NextPutMultiple(), but inString can be modified</span><a name="l00184"></a><a class="code" href="class_filter_with_buffered_input.html#3176a4422a073fa15ed7807f781704b4">00184</a>         <span class="keyword">virtual</span> <span class="keywordtype">void</span> NextPutModifiable(byte *inString, <span class="keywordtype">size_t</span> length)<a name="l00185"></a>00185                 {NextPutMultiple(inString, length);}<a name="l00186"></a>00186         <span class="comment">// LastPut() is always called</span><a name="l00187"></a>00187         <span class="comment">// if totalLength &lt; firstSize then length == totalLength</span><a name="l00188"></a>00188         <span class="comment">// else if totalLength &lt;= firstSize+lastSize then length == totalLength-firstSize</span><a name="l00189"></a>00189         <span class="comment">// else lastSize &lt;= length &lt; lastSize+blockSize</span><a name="l00190"></a>00190         <span class="keyword">virtual</span> <span class="keywordtype">void</span> LastPut(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> length) =0;<a name="l00191"></a><a class="code" href="class_filter_with_buffered_input.html#36d688fc691d1c5f2b62cfa2139145bb">00191</a>         <span class="keyword">virtual</span> <span class="keywordtype">void</span> FlushDerived() {}<a name="l00192"></a>00192 <a name="l00193"></a>00193 <span class="keyword">private</span>:<a name="l00194"></a>00194         <span class="keywordtype">size_t</span> PutMaybeModifiable(byte *begin, <span class="keywordtype">size_t</span> length, <span class="keywordtype">int</span> messageEnd, <span class="keywordtype">bool</span> blocking, <span class="keywordtype">bool</span> modifiable);<a name="l00195"></a>00195         <span class="keywordtype">void</span> NextPutMaybeModifiable(byte *inString, <span class="keywordtype">size_t</span> length, <span class="keywordtype">bool</span> modifiable)<a name="l00196"></a>00196         {<a name="l00197"></a>00197                 <span class="keywordflow">if</span> (modifiable) NextPutModifiable(inString, length);<a name="l00198"></a>00198                 <span class="keywordflow">else</span> NextPutMultiple(inString, length);<a name="l00199"></a>00199         }<a name="l00200"></a>00200 <a name="l00201"></a>00201         <span class="comment">// This function should no longer be used, put this here to cause a compiler error</span><a name="l00202"></a>00202         <span class="comment">// if someone tries to override NextPut().</span><a name="l00203"></a>00203         <span class="keyword">virtual</span> <span class="keywordtype">int</span> NextPut(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> length) {assert(<span class="keyword">false</span>); <span class="keywordflow">return</span> 0;}<a name="l00204"></a>00204 <a name="l00205"></a>00205         <span class="keyword">class </span>BlockQueue<a name="l00206"></a>00206         {<a name="l00207"></a>00207         <span class="keyword">public</span>:<a name="l00208"></a>00208                 <span class="keywordtype">void</span> ResetQueue(<span class="keywordtype">size_t</span> blockSize, <span class="keywordtype">size_t</span> maxBlocks);<a name="l00209"></a>00209                 byte *<a class="code" href="class_get_block.html">GetBlock</a>();<a name="l00210"></a>00210                 byte *GetContigousBlocks(<span class="keywordtype">size_t</span> &amp;numberOfBytes);<a name="l00211"></a>00211                 <span class="keywordtype">size_t</span> GetAll(byte *outString);<a name="l00212"></a>00212                 <span class="keywordtype">void</span> Put(<span class="keyword">const</span> byte *inString, <span class="keywordtype">size_t</span> length);<a name="l00213"></a>00213                 <span class="keywordtype">size_t</span> CurrentSize()<span class="keyword"> const </span>{<span class="keywordflow">return</span> m_size;}<a name="l00214"></a>00214                 <span class="keywordtype">size_t</span> MaxSize()<span class="keyword"> const </span>{<span class="keywordflow">return</span> m_buffer.size();}<a name="l00215"></a>00215 <a name="l00216"></a>00216         <span class="keyword">private</span>:<a name="l00217"></a>00217                 <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> m_buffer;<a name="l00218"></a>00218                 <span class="keywordtype">size_t</span> m_blockSize, m_maxBlocks, m_size;<a name="l00219"></a>00219                 byte *m_begin;<a name="l00220"></a>00220         };<a name="l00221"></a>00221 <a name="l00222"></a>00222         <span class="keywordtype">size_t</span> m_firstSize, m_blockSize, m_lastSize;<a name="l00223"></a>00223         <span class="keywordtype">bool</span> m_firstInputDone;<a name="l00224"></a>00224         BlockQueue m_queue;<a name="l00225"></a>00225 };<a name="l00226"></a>00226 <span class="comment"></span><a name="l00227"></a>00227 <span class="comment">//! _</span><a name="l00228"></a><a class="code" href="class_filter_with_input_queue.html">00228</a> <span class="comment"></span><span class="keyword">class </span>CRYPTOPP_DLL FilterWithInputQueue : <span class="keyword">public</span> <a class="code" href="class_filter.html" title="provides an implementation of BufferedTransformation's attachment interface">Filter</a><a name="l00229"></a>00229 {<a name="l00230"></a>00230 <span class="keyword">public</span>:<a name="l00231"></a><a class="code" href="class_filter_with_input_queue.html#4cbafb997e9f2a310ed490eea49fb1ab">00231</a>         FilterWithInputQueue(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> *attachment=NULL) : <a class="code" href="class_filter.html" title="provides an implementation of BufferedTransformation's attachment interface">Filter</a>(attachment) {}<a name="l00232"></a>00232 <a name="l00233"></a><a class="code" href="class_filter_with_input_queue.html#91c11ca74a8ba2350da6ad6ca8d721a0">00233</a>         <span class="keywordtype">size_t</span> <a class="code" href="class_buffered_transformation.html#d396dcb42260f23125a35ec0e5d17d55" title="input multiple bytes for blocking or non-blocking processing">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="l00234"></a>00234         {<a name="l00235"></a>00235                 <span class="keywordflow">if</span> (!blocking)<a name="l00236"></a>00236                         <span class="keywordflow">throw</span> BlockingInputOnly(<span class="stringliteral">"FilterWithInputQueue"</span>);<a name="l00237"></a>00237                 <a name="l00238"></a>00238                 m_inQueue.Put(inString, length);<a name="l00239"></a>00239                 <span class="keywordflow">if</span> (messageEnd)<a name="l00240"></a>00240                 {<a name="l00241"></a>00241                         IsolatedMessageEnd(blocking);<a name="l00242"></a>00242                         <a class="code" href="class_filter.html#a05cdcaa161f2131cf4d5dcb8903e11f">Output</a>(0, NULL, 0, messageEnd, blocking);<a name="l00243"></a>00243                 }<a name="l00244"></a>00244                 <span class="keywordflow">return</span> 0;<a name="l00245"></a>00245         }<a name="l00246"></a>00246 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -