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

📄 filters_8cpp-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 5 页
字号:
<a name="l00319"></a>00319                 <span class="keywordflow">throw</span> BlockingInputOnly(<span class="stringliteral">"FilterWithBufferedInput"</span>);<a name="l00320"></a>00320         <a name="l00321"></a>00321         <span class="keywordflow">if</span> (hardFlush)<a name="l00322"></a>00322                 <a class="code" href="class_filter_with_buffered_input.html#fa0096257c94f94c3a5938a0e826c46f">ForceNextPut</a>();<a name="l00323"></a>00323         <a class="code" href="class_filter_with_buffered_input.html#36d688fc691d1c5f2b62cfa2139145bb">FlushDerived</a>();<a name="l00324"></a>00324         <a name="l00325"></a>00325         <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00326"></a>00326 }<a name="l00327"></a>00327 <a name="l00328"></a>00328 <span class="keywordtype">size_t</span> FilterWithBufferedInput::PutMaybeModifiable(byte *inString, <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="l00329"></a>00329 {<a name="l00330"></a>00330         <span class="keywordflow">if</span> (!blocking)<a name="l00331"></a>00331                 <span class="keywordflow">throw</span> BlockingInputOnly(<span class="stringliteral">"FilterWithBufferedInput"</span>);<a name="l00332"></a>00332 <a name="l00333"></a>00333         <span class="keywordflow">if</span> (length != 0)<a name="l00334"></a>00334         {<a name="l00335"></a>00335                 <span class="keywordtype">size_t</span> newLength = m_queue.CurrentSize() + length;<a name="l00336"></a>00336 <a name="l00337"></a>00337                 <span class="keywordflow">if</span> (!m_firstInputDone &amp;&amp; newLength &gt;= m_firstSize)<a name="l00338"></a>00338                 {<a name="l00339"></a>00339                         <span class="keywordtype">size_t</span> len = m_firstSize - m_queue.CurrentSize();<a name="l00340"></a>00340                         m_queue.Put(inString, len);<a name="l00341"></a>00341                         FirstPut(m_queue.GetContigousBlocks(m_firstSize));<a name="l00342"></a>00342                         assert(m_queue.CurrentSize() == 0);<a name="l00343"></a>00343                         m_queue.ResetQueue(m_blockSize, (2*m_blockSize+m_lastSize-2)/m_blockSize);<a name="l00344"></a>00344 <a name="l00345"></a>00345                         inString += len;<a name="l00346"></a>00346                         newLength -= m_firstSize;<a name="l00347"></a>00347                         m_firstInputDone = <span class="keyword">true</span>;<a name="l00348"></a>00348                 }<a name="l00349"></a>00349 <a name="l00350"></a>00350                 <span class="keywordflow">if</span> (m_firstInputDone)<a name="l00351"></a>00351                 {<a name="l00352"></a>00352                         <span class="keywordflow">if</span> (m_blockSize == 1)<a name="l00353"></a>00353                         {<a name="l00354"></a>00354                                 <span class="keywordflow">while</span> (newLength &gt; m_lastSize &amp;&amp; m_queue.CurrentSize() &gt; 0)<a name="l00355"></a>00355                                 {<a name="l00356"></a>00356                                         <span class="keywordtype">size_t</span> len = newLength - m_lastSize;<a name="l00357"></a>00357                                         byte *ptr = m_queue.GetContigousBlocks(len);<a name="l00358"></a>00358                                         <a class="code" href="class_filter_with_buffered_input.html#3176a4422a073fa15ed7807f781704b4">NextPutModifiable</a>(ptr, len);<a name="l00359"></a>00359                                         newLength -= len;<a name="l00360"></a>00360                                 }<a name="l00361"></a>00361 <a name="l00362"></a>00362                                 <span class="keywordflow">if</span> (newLength &gt; m_lastSize)<a name="l00363"></a>00363                                 {<a name="l00364"></a>00364                                         <span class="keywordtype">size_t</span> len = newLength - m_lastSize;<a name="l00365"></a>00365                                         NextPutMaybeModifiable(inString, len, modifiable);<a name="l00366"></a>00366                                         inString += len;<a name="l00367"></a>00367                                         newLength -= len;<a name="l00368"></a>00368                                 }<a name="l00369"></a>00369                         }<a name="l00370"></a>00370                         <span class="keywordflow">else</span><a name="l00371"></a>00371                         {<a name="l00372"></a>00372                                 <span class="keywordflow">while</span> (newLength &gt;= m_blockSize + m_lastSize &amp;&amp; m_queue.CurrentSize() &gt;= m_blockSize)<a name="l00373"></a>00373                                 {<a name="l00374"></a>00374                                         <a class="code" href="class_filter_with_buffered_input.html#3176a4422a073fa15ed7807f781704b4">NextPutModifiable</a>(m_queue.GetBlock(), m_blockSize);<a name="l00375"></a>00375                                         newLength -= m_blockSize;<a name="l00376"></a>00376                                 }<a name="l00377"></a>00377 <a name="l00378"></a>00378                                 <span class="keywordflow">if</span> (newLength &gt;= m_blockSize + m_lastSize &amp;&amp; m_queue.CurrentSize() &gt; 0)<a name="l00379"></a>00379                                 {<a name="l00380"></a>00380                                         assert(m_queue.CurrentSize() &lt; m_blockSize);<a name="l00381"></a>00381                                         <span class="keywordtype">size_t</span> len = m_blockSize - m_queue.CurrentSize();<a name="l00382"></a>00382                                         m_queue.Put(inString, len);<a name="l00383"></a>00383                                         inString += len;<a name="l00384"></a>00384                                         <a class="code" href="class_filter_with_buffered_input.html#3176a4422a073fa15ed7807f781704b4">NextPutModifiable</a>(m_queue.GetBlock(), m_blockSize);<a name="l00385"></a>00385                                         newLength -= m_blockSize;<a name="l00386"></a>00386                                 }<a name="l00387"></a>00387 <a name="l00388"></a>00388                                 <span class="keywordflow">if</span> (newLength &gt;= m_blockSize + m_lastSize)<a name="l00389"></a>00389                                 {<a name="l00390"></a>00390                                         <span class="keywordtype">size_t</span> len = RoundDownToMultipleOf(newLength - m_lastSize, m_blockSize);<a name="l00391"></a>00391                                         NextPutMaybeModifiable(inString, len, modifiable);<a name="l00392"></a>00392                                         inString += len;<a name="l00393"></a>00393                                         newLength -= len;<a name="l00394"></a>00394                                 }<a name="l00395"></a>00395                         }<a name="l00396"></a>00396                 }<a name="l00397"></a>00397 <a name="l00398"></a>00398                 m_queue.Put(inString, newLength - m_queue.CurrentSize());<a name="l00399"></a>00399         }<a name="l00400"></a>00400 <a name="l00401"></a>00401         <span class="keywordflow">if</span> (messageEnd)<a name="l00402"></a>00402         {<a name="l00403"></a>00403                 <span class="keywordflow">if</span> (!m_firstInputDone &amp;&amp; m_firstSize==0)<a name="l00404"></a>00404                         FirstPut(NULL);<a name="l00405"></a>00405 <a name="l00406"></a>00406                 <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> temp(m_queue.CurrentSize());<a name="l00407"></a>00407                 m_queue.GetAll(temp);<a name="l00408"></a>00408                 LastPut(temp, temp.size());<a name="l00409"></a>00409 <a name="l00410"></a>00410                 m_firstInputDone = <span class="keyword">false</span>;<a name="l00411"></a>00411                 m_queue.ResetQueue(1, m_firstSize);<a name="l00412"></a>00412 <a name="l00413"></a>00413                 <a class="code" href="class_filter.html#a05cdcaa161f2131cf4d5dcb8903e11f">Output</a>(1, NULL, 0, messageEnd, blocking);<a name="l00414"></a>00414         }<a name="l00415"></a>00415         <span class="keywordflow">return</span> 0;<a name="l00416"></a>00416 }<a name="l00417"></a>00417 <a name="l00418"></a><a class="code" href="class_filter_with_buffered_input.html#fa0096257c94f94c3a5938a0e826c46f">00418</a> <span class="keywordtype">void</span> <a class="code" href="class_filter_with_buffered_input.html#fa0096257c94f94c3a5938a0e826c46f">FilterWithBufferedInput::ForceNextPut</a>()<a name="l00419"></a>00419 {<a name="l00420"></a>00420         <span class="keywordflow">if</span> (!m_firstInputDone)<a name="l00421"></a>00421                 <span class="keywordflow">return</span>;<a name="l00422"></a>00422         <a name="l00423"></a>00423         <span class="keywordflow">if</span> (m_blockSize &gt; 1)<a name="l00424"></a>00424         {<a name="l00425"></a>00425                 <span class="keywordflow">while</span> (m_queue.CurrentSize() &gt;= m_blockSize)<a name="l00426"></a>00426                         <a class="code" href="class_filter_with_buffered_input.html#3176a4422a073fa15ed7807f781704b4">NextPutModifiable</a>(m_queue.GetBlock(), m_blockSize);<a name="l00427"></a>00427         }<a name="l00428"></a>00428         <span class="keywordflow">else</span><a name="l00429"></a>00429         {<a name="l00430"></a>00430                 <span class="keywordtype">size_t</span> len;<a name="l00431"></a>00431                 <span class="keywordflow">while</span> ((len = m_queue.CurrentSize()) &gt; 0)

⌨️ 快捷键说明

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