📄 iterhash_8cpp-source.html
字号:
<a name="l00069"></a>00069 <a name="l00070"></a>00070 memcpy(data, input, len);<a name="l00071"></a>00071 }<a name="l00072"></a>00072 <a name="l00073"></a><a class="code" href="class_iterated_hash_base.html#816fce9e3cab60c1c4ecef77a321be96">00073</a> <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> BASE> byte * <a class="code" href="class_iterated_hash_base.html#816fce9e3cab60c1c4ecef77a321be96">IteratedHashBase<T, BASE>::CreateUpdateSpace</a>(<span class="keywordtype">size_t</span> &size)<a name="l00074"></a>00074 {<a name="l00075"></a>00075 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> blockSize = this->BlockSize();<a name="l00076"></a>00076 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num = ModPowerOf2(m_countLo, blockSize);<a name="l00077"></a>00077 size = blockSize - num;<a name="l00078"></a>00078 <span class="keywordflow">return</span> (byte *)DataBuf() + num;<a name="l00079"></a>00079 }<a name="l00080"></a>00080 <a name="l00081"></a><a class="code" href="class_iterated_hash_base.html#8127a31f5c7700602a34e78285f53e57">00081</a> <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> BASE> <span class="keywordtype">size_t</span> <a class="code" href="class_iterated_hash_base.html#8127a31f5c7700602a34e78285f53e57">IteratedHashBase<T, BASE>::HashMultipleBlocks</a>(<span class="keyword">const</span> T *input, <span class="keywordtype">size_t</span> length)<a name="l00082"></a>00082 {<a name="l00083"></a>00083 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> blockSize = this->BlockSize();<a name="l00084"></a>00084 <span class="keywordtype">bool</span> noReverse = NativeByteOrderIs(this->GetByteOrder());<a name="l00085"></a>00085 T* dataBuf = this->DataBuf();<a name="l00086"></a>00086 <span class="keywordflow">do</span><a name="l00087"></a>00087 {<a name="l00088"></a>00088 <span class="keywordflow">if</span> (noReverse)<a name="l00089"></a>00089 this->HashEndianCorrectedBlock(input);<a name="l00090"></a>00090 <span class="keywordflow">else</span><a name="l00091"></a>00091 {<a name="l00092"></a>00092 ByteReverse(dataBuf, input, this->BlockSize());<a name="l00093"></a>00093 this->HashEndianCorrectedBlock(dataBuf);<a name="l00094"></a>00094 }<a name="l00095"></a>00095 <a name="l00096"></a>00096 input += blockSize/<span class="keyword">sizeof</span>(T);<a name="l00097"></a>00097 length -= blockSize;<a name="l00098"></a>00098 }<a name="l00099"></a>00099 <span class="keywordflow">while</span> (length >= blockSize);<a name="l00100"></a>00100 <span class="keywordflow">return</span> length;<a name="l00101"></a>00101 }<a name="l00102"></a>00102 <a name="l00103"></a><a class="code" href="class_iterated_hash_base.html#01f39339fa69510303ad401245df1037">00103</a> <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> BASE> <span class="keywordtype">void</span> <a class="code" href="class_iterated_hash_base.html#01f39339fa69510303ad401245df1037">IteratedHashBase<T, BASE>::PadLastBlock</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> lastBlockSize, byte padFirst)<a name="l00104"></a>00104 {<a name="l00105"></a>00105 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> blockSize = this->BlockSize();<a name="l00106"></a>00106 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num = ModPowerOf2(m_countLo, blockSize);<a name="l00107"></a>00107 T* dataBuf = this->DataBuf();<a name="l00108"></a>00108 byte* data = (byte *)dataBuf;<a name="l00109"></a>00109 data[num++] = padFirst;<a name="l00110"></a>00110 <span class="keywordflow">if</span> (num <= lastBlockSize)<a name="l00111"></a>00111 memset(data+num, 0, lastBlockSize-num);<a name="l00112"></a>00112 <span class="keywordflow">else</span><a name="l00113"></a>00113 {<a name="l00114"></a>00114 memset(data+num, 0, blockSize-num);<a name="l00115"></a>00115 <a class="code" href="class_iterated_hash_base.html#f4f5349f8ebacfde64bb24f2ce758775">HashBlock</a>(dataBuf);<a name="l00116"></a>00116 memset(data, 0, lastBlockSize);<a name="l00117"></a>00117 }<a name="l00118"></a>00118 }<a name="l00119"></a>00119 <a name="l00120"></a><a class="code" href="class_iterated_hash_base.html#d53da712634ea213ad047b2a68b0fe70">00120</a> <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> BASE> <span class="keywordtype">void</span> <a class="code" href="class_iterated_hash_base.html#d53da712634ea213ad047b2a68b0fe70">IteratedHashBase<T, BASE>::Restart</a>()<a name="l00121"></a>00121 {<a name="l00122"></a>00122 m_countLo = m_countHi = 0;<a name="l00123"></a>00123 Init();<a name="l00124"></a>00124 }<a name="l00125"></a>00125 <a name="l00126"></a><a class="code" href="class_iterated_hash_base.html#2fb87191e0a4359fb9e81c71f99db600">00126</a> <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> BASE> <span class="keywordtype">void</span> <a class="code" href="class_iterated_hash_base.html#2fb87191e0a4359fb9e81c71f99db600">IteratedHashBase<T, BASE>::TruncatedFinal</a>(byte *digest, <span class="keywordtype">size_t</span> size)<a name="l00127"></a>00127 {<a name="l00128"></a>00128 this->ThrowIfInvalidTruncatedSize(size);<a name="l00129"></a>00129 <a name="l00130"></a>00130 T* dataBuf = this->DataBuf();<a name="l00131"></a>00131 T* stateBuf = this->StateBuf();<a name="l00132"></a>00132 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> blockSize = this->BlockSize();<a name="l00133"></a>00133 <a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142b">ByteOrder</a> order = this->GetByteOrder();<a name="l00134"></a>00134 <a name="l00135"></a>00135 <a class="code" href="class_iterated_hash_base.html#01f39339fa69510303ad401245df1037">PadLastBlock</a>(blockSize - 2*<span class="keyword">sizeof</span>(<a class="code" href="class_iterated_hash_base.html#4316d6e7e38a407d5a71f95de2b112e1">HashWordType</a>));<a name="l00136"></a>00136 ConditionalByteReverse<HashWordType>(order, dataBuf, dataBuf, blockSize - 2*<span class="keyword">sizeof</span>(HashWordType));<a name="l00137"></a>00137 <a name="l00138"></a>00138 dataBuf[blockSize/<span class="keyword">sizeof</span>(T)-2] = order ? this->GetBitCountHi() : this-><a class="code" href="class_iterated_hash_base.html#a2dadd15d5ef537cf6e0286f42ab62c8">GetBitCountLo</a>();<a name="l00139"></a>00139 dataBuf[blockSize/<span class="keyword">sizeof</span>(T)-1] = order ? this->GetBitCountLo() : this-><a class="code" href="class_iterated_hash_base.html#db8961e69e48b194b83815d5466f8e7d">GetBitCountHi</a>();<a name="l00140"></a>00140 <a name="l00141"></a>00141 HashEndianCorrectedBlock(dataBuf);<a name="l00142"></a>00142 ConditionalByteReverse<HashWordType>(order, stateBuf, stateBuf, this->DigestSize());<a name="l00143"></a>00143 memcpy(digest, stateBuf, size);<a name="l00144"></a>00144 <a name="l00145"></a>00145 this-><a class="code" href="class_iterated_hash_base.html#d53da712634ea213ad047b2a68b0fe70">Restart</a>(); <span class="comment">// reinit for next use</span><a name="l00146"></a>00146 }<a name="l00147"></a>00147 <a name="l00148"></a>00148 NAMESPACE_END<a name="l00149"></a>00149 <a name="l00150"></a>00150 <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 <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 + -