basecode_8cpp-source.html

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

<a name="l00113"></a>00113 
<a name="l00114"></a>00114         m_bytePos = m_bitPos = 0;
<a name="l00115"></a>00115 
<a name="l00116"></a>00116         <span class="keywordtype">int</span> i = m_bitsPerChar;
<a name="l00117"></a>00117         <span class="keywordflow">while</span> (i%8 != 0)
<a name="l00118"></a>00118                 i += m_bitsPerChar;
<a name="l00119"></a>00119         m_outputBlockSize = i/8;
<a name="l00120"></a>00120 
<a name="l00121"></a>00121         m_outBuf.<a class="code" href="class_sec_block.html#90d46e577c951d81a2d25a4742a3e979" title="change size, without preserving contents">New</a>(m_outputBlockSize);
<a name="l00122"></a>00122 }
<a name="l00123"></a>00123 
<a name="l00124"></a><a class="code" href="class_base_n___decoder.html#56c46bd846fca139874903d26df4385f">00124</a> <span class="keywordtype">size_t</span> <a class="code" href="class_base_n___decoder.html#56c46bd846fca139874903d26df4385f" title="input multiple bytes for blocking or non-blocking processing">BaseN_Decoder::Put2</a>(<span class="keyword">const</span> byte *begin, <span class="keywordtype">size_t</span> length, <span class="keywordtype">int</span> messageEnd, <span class="keywordtype">bool</span> blocking)
<a name="l00125"></a>00125 {
<a name="l00126"></a>00126         FILTER_BEGIN;
<a name="l00127"></a>00127         <span class="keywordflow">while</span> (<a class="code" href="class_filter.html#5efea4f6caff4dca805c831a911eb1db">m_inputPosition</a> &lt; length)
<a name="l00128"></a>00128         {
<a name="l00129"></a>00129                 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> value;
<a name="l00130"></a>00130                 value = m_lookup[begin[<a class="code" href="class_filter.html#5efea4f6caff4dca805c831a911eb1db">m_inputPosition</a>++]];
<a name="l00131"></a>00131                 <span class="keywordflow">if</span> (value &gt;= 256)
<a name="l00132"></a>00132                         <span class="keywordflow">continue</span>;
<a name="l00133"></a>00133 
<a name="l00134"></a>00134                 <span class="keywordflow">if</span> (m_bytePos == 0 &amp;&amp; m_bitPos == 0)
<a name="l00135"></a>00135                         memset(m_outBuf, 0, m_outputBlockSize);
<a name="l00136"></a>00136 
<a name="l00137"></a>00137                 {
<a name="l00138"></a>00138                         <span class="keywordtype">int</span> newBitPos = m_bitPos + m_bitsPerChar;
<a name="l00139"></a>00139                         <span class="keywordflow">if</span> (newBitPos &lt;= 8)
<a name="l00140"></a>00140                                 m_outBuf[m_bytePos] |= value &lt;&lt; (8-newBitPos);
<a name="l00141"></a>00141                         <span class="keywordflow">else</span>
<a name="l00142"></a>00142                         {
<a name="l00143"></a>00143                                 m_outBuf[m_bytePos] |= value &gt;&gt; (newBitPos-8);
<a name="l00144"></a>00144                                 m_outBuf[m_bytePos+1] |= value &lt;&lt; (16-newBitPos);
<a name="l00145"></a>00145                         }
<a name="l00146"></a>00146 
<a name="l00147"></a>00147                         m_bitPos = newBitPos;
<a name="l00148"></a>00148                         <span class="keywordflow">while</span> (m_bitPos &gt;= 8)
<a name="l00149"></a>00149                         {
<a name="l00150"></a>00150                                 m_bitPos -= 8;
<a name="l00151"></a>00151                                 ++m_bytePos;
<a name="l00152"></a>00152                         }
<a name="l00153"></a>00153                 }
<a name="l00154"></a>00154 
<a name="l00155"></a>00155                 <span class="keywordflow">if</span> (m_bytePos == m_outputBlockSize)
<a name="l00156"></a>00156                 {
<a name="l00157"></a>00157                         FILTER_OUTPUT(1, m_outBuf, m_outputBlockSize, 0);
<a name="l00158"></a>00158                         m_bytePos = m_bitPos = 0;
<a name="l00159"></a>00159                 }
<a name="l00160"></a>00160         }
<a name="l00161"></a>00161         <span class="keywordflow">if</span> (messageEnd)
<a name="l00162"></a>00162         {
<a name="l00163"></a>00163                 FILTER_OUTPUT(2, m_outBuf, m_bytePos, messageEnd);
<a name="l00164"></a>00164                 m_bytePos = m_bitPos = 0;
<a name="l00165"></a>00165         }
<a name="l00166"></a>00166         FILTER_END_NO_MESSAGE_END;
<a name="l00167"></a>00167 }
<a name="l00168"></a>00168 
<a name="l00169"></a><a class="code" href="class_base_n___decoder.html#a71d01a986edd08447afe2d906d35283">00169</a> <span class="keywordtype">void</span> <a class="code" href="class_base_n___decoder.html#a71d01a986edd08447afe2d906d35283">BaseN_Decoder::InitializeDecodingLookupArray</a>(<span class="keywordtype">int</span> *lookup, <span class="keyword">const</span> byte *alphabet, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> base, <span class="keywordtype">bool</span> caseInsensitive)
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171         std::fill(lookup, lookup+256, -1);
<a name="l00172"></a>00172 
<a name="l00173"></a>00173         <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i&lt;base; i++)
<a name="l00174"></a>00174         {
<a name="l00175"></a>00175                 <span class="keywordflow">if</span> (caseInsensitive &amp;&amp; isalpha(alphabet[i]))
<a name="l00176"></a>00176                 {
<a name="l00177"></a>00177                         assert(lookup[toupper(alphabet[i])] == -1);
<a name="l00178"></a>00178                         lookup[toupper(alphabet[i])] = i;
<a name="l00179"></a>00179                         assert(lookup[tolower(alphabet[i])] == -1);
<a name="l00180"></a>00180                         lookup[tolower(alphabet[i])] = i;
<a name="l00181"></a>00181                 }
<a name="l00182"></a>00182                 <span class="keywordflow">else</span>
<a name="l00183"></a>00183                 {
<a name="l00184"></a>00184                         assert(lookup[alphabet[i]] == -1);
<a name="l00185"></a>00185                         lookup[alphabet[i]] = i;
<a name="l00186"></a>00186                 }
<a name="l00187"></a>00187         }
<a name="l00188"></a>00188 }
<a name="l00189"></a>00189 
<a name="l00190"></a><a class="code" href="class_grouper.html#f44beea74b2140892d24aa635a7f3dcd">00190</a> <span class="keywordtype">void</span> <a class="code" href="class_grouper.html#f44beea74b2140892d24aa635a7f3dcd">Grouper::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="l00191"></a>00191 {
<a name="l00192"></a>00192         m_groupSize = parameters.<a class="code" href="class_name_value_pairs.html#7ddb654b7afcd1a04422a7b4b01366d9" title="get a named value with type int, with default">GetIntValueWithDefault</a>(<a class="code" href="namespace_name.html#7f4ebc815a21415c8887db5386683e6d">Name::GroupSize</a>(), 0);
<a name="l00193"></a>00193         <a class="code" href="class_const_byte_array_parameter.html" title="used to pass byte array input as part of a NameValuePairs object">ConstByteArrayParameter</a> separator, terminator;
<a name="l00194"></a>00194         <span class="keywordflow">if</span> (m_groupSize)
<a name="l00195"></a>00195                 parameters.<a class="code" href="class_name_value_pairs.html#c66048d3bc2a741712486d02e1f75d78">GetRequiredParameter</a>(<span class="stringliteral">"Grouper"</span>, <a class="code" href="namespace_name.html#e643e94c7650c4954138160967a1a336">Name::Separator</a>(), separator);
<a name="l00196"></a>00196         <span class="keywordflow">else</span>
<a name="l00197"></a>00197                 parameters.<a class="code" href="class_name_value_pairs.html#96686e9f8d6ce3ab870e516fb72b608e" title="get a named value, returns true if the name exists">GetValue</a>(<a class="code" href="namespace_name.html#e643e94c7650c4954138160967a1a336">Name::Separator</a>(), separator);
<a name="l00198"></a>00198         parameters.<a class="code" href="class_name_value_pairs.html#96686e9f8d6ce3ab870e516fb72b608e" title="get a named value, returns true if the name exists">GetValue</a>(<a class="code" href="namespace_name.html#874ade26c7b181c3272a1c89deb0f8bf">Name::Terminator</a>(), terminator);
<a name="l00199"></a>00199 
<a name="l00200"></a>00200         m_separator.<a class="code" href="class_sec_block.html#2cf5dc5e31c63eb927f935af6104f36a" title="set contents and size">Assign</a>(separator.<a class="code" href="class_const_byte_array_parameter.html#b89acc8dae383f2663dd3864651e8ef1">begin</a>(), separator.<a class="code" href="class_const_byte_array_parameter.html#b83dbf7e4d80c0304917a3cc1d3cf144">size</a>());
<a name="l00201"></a>00201         m_terminator.<a class="code" href="class_sec_block.html#2cf5dc5e31c63eb927f935af6104f36a" title="set contents and size">Assign</a>(terminator.<a class="code" href="class_const_byte_array_parameter.html#b89acc8dae383f2663dd3864651e8ef1">begin</a>(), terminator.<a class="code" href="class_const_byte_array_parameter.html#b83dbf7e4d80c0304917a3cc1d3cf144">size</a>());
<a name="l00202"></a>00202         m_counter = 0;
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204 
<a name="l00205"></a><a class="code" href="class_grouper.html#21cb0add26fcf2607329927714f4e3bb">00205</a> <span class="keywordtype">size_t</span> <a class="code" href="class_grouper.html#21cb0add26fcf2607329927714f4e3bb" title="input multiple bytes for blocking or non-blocking processing">Grouper::Put2</a>(<span class="keyword">const</span> byte *begin, <span class="keywordtype">size_t</span> length, <span class="keywordtype">int</span> messageEnd, <span class="keywordtype">bool</span> blocking)
<a name="l00206"></a>00206 {
<a name="l00207"></a>00207         FILTER_BEGIN;
<a name="l00208"></a>00208         <span class="keywordflow">if</span> (m_groupSize)
<a name="l00209"></a>00209         {
<a name="l00210"></a>00210                 <span class="keywordflow">while</span> (<a class="code" href="class_filter.html#5efea4f6caff4dca805c831a911eb1db">m_inputPosition</a> &lt; length)
<a name="l00211"></a>00211                 {
<a name="l00212"></a>00212                         <span class="keywordflow">if</span> (m_counter == m_groupSize)
<a name="l00213"></a>00213                         {
<a name="l00214"></a>00214                                 FILTER_OUTPUT(1, m_separator, m_separator.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>(), 0);
<a name="l00215"></a>00215                                 m_counter = 0;
<a name="l00216"></a>00216                         }
<a name="l00217"></a>00217 
<a name="l00218"></a>00218                         <span class="keywordtype">size_t</span> len;
<a name="l00219"></a>00219                         FILTER_OUTPUT2(2, len = STDMIN(length-<a class="code" href="class_filter.html#5efea4f6caff4dca805c831a911eb1db">m_inputPosition</a>, m_groupSize-m_counter),
<a name="l00220"></a>00220                                 begin+<a class="code" href="class_filter.html#5efea4f6caff4dca805c831a911eb1db">m_inputPosition</a>, len, 0);
<a name="l00221"></a>00221                         <a class="code" href="class_filter.html#5efea4f6caff4dca805c831a911eb1db">m_inputPosition</a> += len;
<a name="l00222"></a>00222                         m_counter += len;
<a name="l00223"></a>00223                 }
<a name="l00224"></a>00224         }
<a name="l00225"></a>00225         <span class="keywordflow">else</span>
<a name="l00226"></a>00226                 FILTER_OUTPUT(3, begin, length, 0);
<a name="l00227"></a>00227 
<a name="l00228"></a>00228         <span class="keywordflow">if</span> (messageEnd)
<a name="l00229"></a>00229         {
<a name="l00230"></a>00230                 FILTER_OUTPUT(4, m_terminator, m_terminator.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>(), messageEnd);
<a name="l00231"></a>00231                 m_counter = 0;
<a name="l00232"></a>00232         }
<a name="l00233"></a>00233         FILTER_END_NO_MESSAGE_END
<a name="l00234"></a>00234 }
<a name="l00235"></a>00235 
<a name="l00236"></a>00236 NAMESPACE_END
<a name="l00237"></a>00237 
<a name="l00238"></a>00238 <span class="preprocessor">#endif</span>
</pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:19 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>