<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <title>Crypto++: words.h Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <link href="doxygen.css" rel="stylesheet" type="text/css"/> </head> <body> <!-- Generated by Doxygen 1.7.3 --> <div id="top"> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td style="padding-left: 0.5em;"> <div id="projectname">Crypto++</div> </td> </tr> </tbody> </table> </div> <div id="navrow1" class="tabs"> <ul class="tablist"> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="namespaces.html"><span>Namespaces</span></a></li> <li><a href="annotated.html"><span>Classes</span></a></li> <li class="current"><a href="files.html"><span>Files</span></a></li> </ul> </div> <div id="navrow2" class="tabs2"> <ul class="tablist"> <li><a href="files.html"><span>File List</span></a></li> <li><a href="globals.html"><span>File Members</span></a></li> </ul> </div> <div class="header"> <div class="headertitle"> <h1>words.h</h1> </div> </div> <div class="contents"> <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 <span class="keywordflow">if</span> (r != a) <a name="l00024"></a>00024 memcpy(r, a, n*WORD_SIZE); <a name="l00025"></a>00025 } <a name="l00026"></a>00026 <a name="l00027"></a>00027 <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="l00028"></a>00028 { <a name="l00029"></a>00029 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++) <a name="l00030"></a>00030 r[i] = a[i] ^ b[i]; <a name="l00031"></a>00031 } <a name="l00032"></a>00032 <a name="l00033"></a>00033 <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="l00034"></a>00034 { <a name="l00035"></a>00035 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++) <a name="l00036"></a>00036 r[i] ^= a[i]; <a name="l00037"></a>00037 } <a name="l00038"></a>00038 <a name="l00039"></a>00039 <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="l00040"></a>00040 { <a name="l00041"></a>00041 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++) <a name="l00042"></a>00042 r[i] = a[i] & b[i]; <a name="l00043"></a>00043 } <a name="l00044"></a>00044 <a name="l00045"></a>00045 <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="l00046"></a>00046 { <a name="l00047"></a>00047 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++) <a name="l00048"></a>00048 r[i] &= a[i]; <a name="l00049"></a>00049 } <a name="l00050"></a>00050 <a name="l00051"></a>00051 <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="l00052"></a>00052 { <a name="l00053"></a>00053 assert (shiftBits<WORD_BITS); <a name="l00054"></a>00054 word u, carry=0; <a name="l00055"></a>00055 <span class="keywordflow">if</span> (shiftBits) <a name="l00056"></a>00056 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; i++) <a name="l00057"></a>00057 { <a name="l00058"></a>00058 u = r[i]; <a name="l00059"></a>00059 r[i] = (u << shiftBits) | carry; <a name="l00060"></a>00060 carry = u >> (WORD_BITS-shiftBits); <a name="l00061"></a>00061 } <a name="l00062"></a>00062 <span class="keywordflow">return</span> carry; <a name="l00063"></a>00063 } <a name="l00064"></a>00064 <a name="l00065"></a>00065 <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="l00066"></a>00066 { <a name="l00067"></a>00067 assert (shiftBits<WORD_BITS); <a name="l00068"></a>00068 word u, carry=0; <a name="l00069"></a>00069 <span class="keywordflow">if</span> (shiftBits) <a name="l00070"></a>00070 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=n; i>0; i--) <a name="l00071"></a>00071 { <a name="l00072"></a>00072 u = r[i-1]; <a name="l00073"></a>00073 r[i-1] = (u >> shiftBits) | carry; <a name="l00074"></a>00074 carry = u << (WORD_BITS-shiftBits); <a name="l00075"></a>00075 } <a name="l00076"></a>00076 <span class="keywordflow">return</span> carry; <a name="l00077"></a>00077 } <a name="l00078"></a>00078 <a name="l00079"></a>00079 <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="l00080"></a>00080 { <a name="l00081"></a>00081 shiftWords = STDMIN(shiftWords, n); <a name="l00082"></a>00082 <span class="keywordflow">if</span> (shiftWords) <a name="l00083"></a>00083 { <a name="l00084"></a>00084 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=n-1; i>=shiftWords; i--) <a name="l00085"></a>00085 r[i] = r[i-shiftWords]; <a name="l00086"></a>00086 SetWords(r, 0, shiftWords); <a name="l00087"></a>00087 } <a name="l00088"></a>00088 } <a name="l00089"></a>00089 <a name="l00090"></a>00090 <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="l00091"></a>00091 { <a name="l00092"></a>00092 shiftWords = STDMIN(shiftWords, n); <a name="l00093"></a>00093 <span class="keywordflow">if</span> (shiftWords) <a name="l00094"></a>00094 { <a name="l00095"></a>00095 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i+shiftWords<n; i++) <a name="l00096"></a>00096 r[i] = r[i+shiftWords]; <a name="l00097"></a>00097 SetWords(r+n-shiftWords, 0, shiftWords); <a name="l00098"></a>00098 } <a name="l00099"></a>00099 } <a name="l00100"></a>00100 <a name="l00101"></a>00101 NAMESPACE_END <a name="l00102"></a>00102 <a name="l00103"></a>00103 <span class="preprocessor">#endif</span> </pre></div></div> </div> <hr class="footer"/><address class="footer"><small>Generated on Tue Feb 8 2011 for Crypto++ by  <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </small></address> </body> </html>