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

📄 mqueue_8cpp-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<a name="l00081"></a>00081                 <span class="keywordflow">return</span> 2;<a name="l00082"></a>00082 }<a name="l00083"></a>00083 <a name="l00084"></a><a class="code" href="class_equality_comparison_filter.html#f6f119a0a2e8a91c46676fc4f1eeeddc">00084</a> <span class="keywordtype">size_t</span> <a class="code" href="class_equality_comparison_filter.html#f6f119a0a2e8a91c46676fc4f1eeeddc">EqualityComparisonFilter::ChannelPut2</a>(<span class="keyword">const</span> std::string &amp;channel, <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="l00085"></a>00085 {<a name="l00086"></a>00086         <span class="keywordflow">if</span> (!blocking)<a name="l00087"></a>00087                 <span class="keywordflow">throw</span> BlockingInputOnly(<span class="stringliteral">"EqualityComparisonFilter"</span>);<a name="l00088"></a>00088 <a name="l00089"></a>00089         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = MapChannel(channel);<a name="l00090"></a>00090 <a name="l00091"></a>00091         <span class="keywordflow">if</span> (i == 2)<a name="l00092"></a>00092                 <span class="keywordflow">return</span> <a class="code" href="class_filter.html#a05cdcaa161f2131cf4d5dcb8903e11f">Output</a>(3, inString, length, messageEnd, blocking, channel);<a name="l00093"></a>00093         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_mismatchDetected)<a name="l00094"></a>00094                 <span class="keywordflow">return</span> 0;<a name="l00095"></a>00095         <span class="keywordflow">else</span><a name="l00096"></a>00096         {<a name="l00097"></a>00097                 <a class="code" href="class_message_queue.html" title="Message Queue.">MessageQueue</a> &amp;q1 = m_q[i], &amp;q2 = m_q[1-i];<a name="l00098"></a>00098 <a name="l00099"></a>00099                 <span class="keywordflow">if</span> (q2.AnyMessages() &amp;&amp; q2.MaxRetrievable() &lt; length)<a name="l00100"></a>00100                         <span class="keywordflow">goto</span> mismatch;<a name="l00101"></a>00101 <a name="l00102"></a>00102                 <span class="keywordflow">while</span> (length &gt; 0 &amp;&amp; q2.AnyRetrievable())<a name="l00103"></a>00103                 {<a name="l00104"></a>00104                         <span class="keywordtype">size_t</span> len = length;<a name="l00105"></a>00105                         <span class="keyword">const</span> byte *data = q2.Spy(len);<a name="l00106"></a>00106                         len = STDMIN(len, length);<a name="l00107"></a>00107                         <span class="keywordflow">if</span> (memcmp(inString, data, len) != 0)<a name="l00108"></a>00108                                 <span class="keywordflow">goto</span> mismatch;<a name="l00109"></a>00109                         inString += len;<a name="l00110"></a>00110                         length -= len;<a name="l00111"></a>00111                         q2.Skip(len);<a name="l00112"></a>00112                 }<a name="l00113"></a>00113 <a name="l00114"></a>00114                 q1.<a class="code" href="class_buffered_transformation.html#e70658b0d271f8e114ac6c3cc9774ede" title="input a byte for processing">Put</a>(inString, length);<a name="l00115"></a>00115 <a name="l00116"></a>00116                 <span class="keywordflow">if</span> (messageEnd)<a name="l00117"></a>00117                 {<a name="l00118"></a>00118                         <span class="keywordflow">if</span> (q2.AnyRetrievable())<a name="l00119"></a>00119                                 <span class="keywordflow">goto</span> mismatch;<a name="l00120"></a>00120                         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (q2.AnyMessages())<a name="l00121"></a>00121                                 q2.GetNextMessage();<a name="l00122"></a>00122                         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (q2.NumberOfMessageSeries() &gt; 0)<a name="l00123"></a>00123                                 <span class="keywordflow">goto</span> mismatch;<a name="l00124"></a>00124                         <span class="keywordflow">else</span><a name="l00125"></a>00125                                 q1.<a class="code" href="class_buffered_transformation.html#20ae0ef2e4ff338b43849e541e9b940f">MessageEnd</a>();<a name="l00126"></a>00126                 }<a name="l00127"></a>00127 <a name="l00128"></a>00128                 <span class="keywordflow">return</span> 0;<a name="l00129"></a>00129 <a name="l00130"></a>00130 mismatch:<a name="l00131"></a>00131                 <span class="keywordflow">return</span> HandleMismatchDetected(blocking);<a name="l00132"></a>00132         }<a name="l00133"></a>00133 }<a name="l00134"></a>00134 <a name="l00135"></a><a class="code" href="class_equality_comparison_filter.html#97d5eb6fd119c9bdbee7d08b98450667">00135</a> <span class="keywordtype">bool</span> <a class="code" href="class_equality_comparison_filter.html#97d5eb6fd119c9bdbee7d08b98450667">EqualityComparisonFilter::ChannelMessageSeriesEnd</a>(<span class="keyword">const</span> std::string &amp;channel, <span class="keywordtype">int</span> propagation, <span class="keywordtype">bool</span> blocking)<a name="l00136"></a>00136 {<a name="l00137"></a>00137         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = MapChannel(channel);<a name="l00138"></a>00138 <a name="l00139"></a>00139         <span class="keywordflow">if</span> (i == 2)<a name="l00140"></a>00140         {<a name="l00141"></a>00141                 <a class="code" href="class_filter.html#255f83eaddd679a61326ce05c487fd2e">OutputMessageSeriesEnd</a>(4, propagation, blocking, channel);<a name="l00142"></a>00142                 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00143"></a>00143         }<a name="l00144"></a>00144         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_mismatchDetected)<a name="l00145"></a>00145                 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00146"></a>00146         <span class="keywordflow">else</span><a name="l00147"></a>00147         {<a name="l00148"></a>00148                 <a class="code" href="class_message_queue.html" title="Message Queue.">MessageQueue</a> &amp;q1 = m_q[i], &amp;q2 = m_q[1-i];<a name="l00149"></a>00149 <a name="l00150"></a>00150                 <span class="keywordflow">if</span> (q2.AnyRetrievable() || q2.AnyMessages())<a name="l00151"></a>00151                         <span class="keywordflow">goto</span> mismatch;<a name="l00152"></a>00152                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (q2.NumberOfMessageSeries() &gt; 0)<a name="l00153"></a>00153                         <span class="keywordflow">return</span> <a class="code" href="class_filter.html#a05cdcaa161f2131cf4d5dcb8903e11f">Output</a>(2, (<span class="keyword">const</span> byte *)<span class="stringliteral">"\1"</span>, 1, 0, blocking) != 0;<a name="l00154"></a>00154                 <span class="keywordflow">else</span><a name="l00155"></a>00155                         q1.<a class="code" href="class_buffered_transformation.html#ae4c5ae024419e31bfa0c24eb35b24c2" title="mark end of a series of messages">MessageSeriesEnd</a>();<a name="l00156"></a>00156 <a name="l00157"></a>00157                 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00158"></a>00158 <a name="l00159"></a>00159 mismatch:<a name="l00160"></a>00160                 <span class="keywordflow">return</span> HandleMismatchDetected(blocking);<a name="l00161"></a>00161         }<a name="l00162"></a>00162 }<a name="l00163"></a>00163 <a name="l00164"></a>00164 <span class="keywordtype">bool</span> EqualityComparisonFilter::HandleMismatchDetected(<span class="keywordtype">bool</span> blocking)<a name="l00165"></a>00165 {<a name="l00166"></a>00166         m_mismatchDetected = <span class="keyword">true</span>;<a name="l00167"></a>00167         <span class="keywordflow">if</span> (m_throwIfNotEqual)<a name="l00168"></a>00168                 <span class="keywordflow">throw</span> MismatchDetected();<a name="l00169"></a>00169         <span class="keywordflow">return</span> <a class="code" href="class_filter.html#a05cdcaa161f2131cf4d5dcb8903e11f">Output</a>(1, (<span class="keyword">const</span> byte *)<span class="stringliteral">"\0"</span>, 1, 0, blocking) != 0;<a name="l00170"></a>00170 }<a name="l00171"></a>00171 <a name="l00172"></a>00172 NAMESPACE_END<a name="l00173"></a>00173 <a name="l00174"></a>00174 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:22 2007 for Crypto++ by&nbsp;<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.2 </small></address></body></html>

⌨️ 快捷键说明

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