📄 words_8h-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: words.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="namespaces.html"><span>Namespaces</span></a></li> <li><a href="classes.html"><span>Classes</span></a></li> <li class="current"><a href="files.html"><span>Files</span></a></li> </ul></div><div class="tabs"> <ul> <li><a href="files.html"><span>File List</span></a></li> <li><a href="globals.html"><span>File Members</span></a></li> </ul></div><h1>words.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#ifndef CRYPTOPP_WORDS_H</span><a name="l00002"></a>00002 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_WORDS_H</span><a name="l00003"></a>00003 <span class="preprocessor"></span><a name="l00004"></a>00004 <span class="preprocessor">#include "misc.h"</span><a name="l00005"></a>00005 <a name="l00006"></a>00006 NAMESPACE_BEGIN(CryptoPP)<a name="l00007"></a>00007 <a name="l00008"></a>00008 inline <span class="keywordtype">size_t</span> CountWords(const word *X, <span class="keywordtype">size_t</span> N)<a name="l00009"></a>00009 {<a name="l00010"></a>00010 <span class="keywordflow">while</span> (N && X[N-1]==0)<a name="l00011"></a>00011 N--;<a name="l00012"></a>00012 <span class="keywordflow">return</span> N;<a name="l00013"></a>00013 }<a name="l00014"></a>00014 <a name="l00015"></a>00015 <span class="keyword">inline</span> <span class="keywordtype">void</span> SetWords(word *r, word a, <span class="keywordtype">size_t</span> n)<a name="l00016"></a>00016 {<a name="l00017"></a>00017 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++)<a name="l00018"></a>00018 r[i] = a;<a name="l00019"></a>00019 }<a name="l00020"></a>00020 <a name="l00021"></a>00021 <span class="keyword">inline</span> <span class="keywordtype">void</span> CopyWords(word *r, <span class="keyword">const</span> word *a, <span class="keywordtype">size_t</span> n)<a name="l00022"></a>00022 {<a name="l00023"></a>00023 memcpy(r, a, n*WORD_SIZE);<a name="l00024"></a>00024 }<a name="l00025"></a>00025 <a name="l00026"></a>00026 <span class="keyword">inline</span> <span class="keywordtype">void</span> XorWords(word *r, <span class="keyword">const</span> word *a, <span class="keyword">const</span> word *b, <span class="keywordtype">size_t</span> n)<a name="l00027"></a>00027 {<a name="l00028"></a>00028 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++)<a name="l00029"></a>00029 r[i] = a[i] ^ b[i];<a name="l00030"></a>00030 }<a name="l00031"></a>00031 <a name="l00032"></a>00032 <span class="keyword">inline</span> <span class="keywordtype">void</span> XorWords(word *r, <span class="keyword">const</span> word *a, <span class="keywordtype">size_t</span> n)<a name="l00033"></a>00033 {<a name="l00034"></a>00034 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++)<a name="l00035"></a>00035 r[i] ^= a[i];<a name="l00036"></a>00036 }<a name="l00037"></a>00037 <a name="l00038"></a>00038 <span class="keyword">inline</span> <span class="keywordtype">void</span> AndWords(word *r, <span class="keyword">const</span> word *a, <span class="keyword">const</span> word *b, <span class="keywordtype">size_t</span> n)<a name="l00039"></a>00039 {<a name="l00040"></a>00040 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++)<a name="l00041"></a>00041 r[i] = a[i] & b[i];<a name="l00042"></a>00042 }<a name="l00043"></a>00043 <a name="l00044"></a>00044 <span class="keyword">inline</span> <span class="keywordtype">void</span> AndWords(word *r, <span class="keyword">const</span> word *a, <span class="keywordtype">size_t</span> n)<a name="l00045"></a>00045 {<a name="l00046"></a>00046 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++)<a name="l00047"></a>00047 r[i] &= a[i];<a name="l00048"></a>00048 }<a name="l00049"></a>00049 <a name="l00050"></a>00050 <span class="keyword">inline</span> word ShiftWordsLeftByBits(word *r, <span class="keywordtype">size_t</span> n, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shiftBits)<a name="l00051"></a>00051 {<a name="l00052"></a>00052 assert (shiftBits<WORD_BITS);<a name="l00053"></a>00053 word u, carry=0;<a name="l00054"></a>00054 <span class="keywordflow">if</span> (shiftBits)<a name="l00055"></a>00055 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++)<a name="l00056"></a>00056 {<a name="l00057"></a>00057 u = r[i];<a name="l00058"></a>00058 r[i] = (u << shiftBits) | carry;<a name="l00059"></a>00059 carry = u >> (WORD_BITS-shiftBits);<a name="l00060"></a>00060 }<a name="l00061"></a>00061 <span class="keywordflow">return</span> carry;<a name="l00062"></a>00062 }<a name="l00063"></a>00063 <a name="l00064"></a>00064 <span class="keyword">inline</span> word ShiftWordsRightByBits(word *r, <span class="keywordtype">size_t</span> n, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shiftBits)<a name="l00065"></a>00065 {<a name="l00066"></a>00066 assert (shiftBits<WORD_BITS);<a name="l00067"></a>00067 word u, carry=0;<a name="l00068"></a>00068 <span class="keywordflow">if</span> (shiftBits)<a name="l00069"></a>00069 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=n; i>0; i--)<a name="l00070"></a>00070 {<a name="l00071"></a>00071 u = r[i-1];<a name="l00072"></a>00072 r[i-1] = (u >> shiftBits) | carry;<a name="l00073"></a>00073 carry = u << (WORD_BITS-shiftBits);<a name="l00074"></a>00074 }<a name="l00075"></a>00075 <span class="keywordflow">return</span> carry;<a name="l00076"></a>00076 }<a name="l00077"></a>00077 <a name="l00078"></a>00078 <span class="keyword">inline</span> <span class="keywordtype">void</span> ShiftWordsLeftByWords(word *r, <span class="keywordtype">size_t</span> n, <span class="keywordtype">size_t</span> shiftWords)<a name="l00079"></a>00079 {<a name="l00080"></a>00080 shiftWords = STDMIN(shiftWords, n);<a name="l00081"></a>00081 <span class="keywordflow">if</span> (shiftWords)<a name="l00082"></a>00082 {<a name="l00083"></a>00083 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=n-1; i>=shiftWords; i--)<a name="l00084"></a>00084 r[i] = r[i-shiftWords];<a name="l00085"></a>00085 SetWords(r, 0, shiftWords);<a name="l00086"></a>00086 }<a name="l00087"></a>00087 }<a name="l00088"></a>00088 <a name="l00089"></a>00089 <span class="keyword">inline</span> <span class="keywordtype">void</span> ShiftWordsRightByWords(word *r, <span class="keywordtype">size_t</span> n, <span class="keywordtype">size_t</span> shiftWords)<a name="l00090"></a>00090 {<a name="l00091"></a>00091 shiftWords = STDMIN(shiftWords, n);<a name="l00092"></a>00092 <span class="keywordflow">if</span> (shiftWords)<a name="l00093"></a>00093 {<a name="l00094"></a>00094 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i+shiftWords<n; i++)<a name="l00095"></a>00095 r[i] = r[i+shiftWords];<a name="l00096"></a>00096 SetWords(r+n-shiftWords, 0, shiftWords);<a name="l00097"></a>00097 }<a name="l00098"></a>00098 }<a name="l00099"></a>00099 <a name="l00100"></a>00100 NAMESPACE_END<a name="l00101"></a>00101 <a name="l00102"></a>00102 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:26 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 + -