<!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++: misc.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.6.1 -->
<div class="navigation" id="top">
<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="annotated.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>misc.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#ifndef CRYPTOPP_MISC_H</span>
<a name="l00002"></a>00002 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_MISC_H</span>
<a name="l00003"></a>00003 <span class="preprocessor"></span>
<a name="l00004"></a>00004 <span class="preprocessor">#include "<a class="code" href="cryptlib_8h.html">cryptlib.h</a>"</span>
<a name="l00005"></a>00005 <span class="preprocessor">#include "smartptr.h"</span>
<a name="l00006"></a>00006 <span class="preprocessor">#include <string.h></span> <span class="comment">// for memcpy and memmove</span>
<a name="l00007"></a>00007
<a name="l00008"></a>00008 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00009"></a>00009 <span class="preprocessor"></span><span class="preprocessor"> #include <stdlib.h></span>
<a name="l00010"></a>00010 <span class="preprocessor"> #if _MSC_VER >= 1400</span>
<a name="l00011"></a>00011 <span class="preprocessor"></span> <span class="comment">// VC2005 workaround: disable declarations that conflict with winnt.h</span>
<a name="l00012"></a>00012 <span class="preprocessor"> #define _interlockedbittestandset CRYPTOPP_DISABLED_INTRINSIC_1</span>
<a name="l00013"></a>00013 <span class="preprocessor"></span><span class="preprocessor"> #define _interlockedbittestandreset CRYPTOPP_DISABLED_INTRINSIC_2</span>
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor"> #define _interlockedbittestandset64 CRYPTOPP_DISABLED_INTRINSIC_3</span>
<a name="l00015"></a>00015 <span class="preprocessor"></span><span class="preprocessor"> #define _interlockedbittestandreset64 CRYPTOPP_DISABLED_INTRINSIC_4</span>
<a name="l00016"></a>00016 <span class="preprocessor"></span><span class="preprocessor"> #include <intrin.h></span>
<a name="l00017"></a>00017 <span class="preprocessor"> #undef _interlockedbittestandset</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor"> #undef _interlockedbittestandreset</span>
<a name="l00019"></a>00019 <span class="preprocessor"></span><span class="preprocessor"> #undef _interlockedbittestandset64</span>
<a name="l00020"></a>00020 <span class="preprocessor"></span><span class="preprocessor"> #undef _interlockedbittestandreset64</span>
<a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor"> #define CRYPTOPP_FAST_ROTATE(x) 1</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor"> #elif _MSC_VER >= 1300</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor"> #define CRYPTOPP_FAST_ROTATE(x) ((x) == 32 | (x) == 64)</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor"> #else</span>
<a name="l00025"></a>00025 <span class="preprocessor"></span><span class="preprocessor"> #define CRYPTOPP_FAST_ROTATE(x) ((x) == 32)</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor"> #endif</span>
<a name="l00027"></a>00027 <span class="preprocessor"></span><span class="preprocessor">#elif (defined(__MWERKS__) && TARGET_CPU_PPC) || \</span>
<a name="l00028"></a>00028 <span class="preprocessor"> (defined(__GNUC__) && (defined(_ARCH_PWR2) || defined(_ARCH_PWR) || defined(_ARCH_PPC) || defined(_ARCH_PPC64) || defined(_ARCH_COM)))</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor"> #define CRYPTOPP_FAST_ROTATE(x) ((x) == 32)</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor">#elif defined(__GNUC__) && (CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86) // depend on GCC's peephole optimization to generate rotate instructions</span>
<a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor"> #define CRYPTOPP_FAST_ROTATE(x) 1</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span><span class="preprocessor"> #define CRYPTOPP_FAST_ROTATE(x) 0</span>
<a name="l00034"></a>00034 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00035"></a>00035 <span class="preprocessor"></span>
<a name="l00036"></a>00036 <span class="preprocessor">#ifdef __BORLANDC__</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span><span class="preprocessor">#include <mem.h></span>
<a name="l00038"></a>00038 <span class="preprocessor">#endif</span>
<a name="l00039"></a>00039 <span class="preprocessor"></span>
<a name="l00040"></a>00040 <span class="preprocessor">#if defined(__GNUC__) && defined(__linux__)</span>
<a name="l00041"></a>00041 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BYTESWAP_AVAILABLE</span>
<a name="l00042"></a>00042 <span class="preprocessor"></span><span class="preprocessor">#include <byteswap.h></span>
<a name="l00043"></a>00043 <span class="preprocessor">#endif</span>
<a name="l00044"></a>00044 <span class="preprocessor"></span>
<a name="l00045"></a>00045 NAMESPACE_BEGIN(CryptoPP)
<a name="l00046"></a>00046
<a name="l00047"></a>00047 <span class="comment">// ************** compile-time assertion ***************</span>
<a name="l00048"></a>00048
<a name="l00049"></a>00049 template <<span class="keywordtype">bool</span> b>
<a name="l00050"></a><a class="code" href="struct_compile_assert.html">00050</a> struct <a class="code" href="struct_compile_assert.html">CompileAssert</a>
<a name="l00051"></a>00051 {
<a name="l00052"></a>00052 <span class="keyword">static</span> <span class="keywordtype">char</span> dummy[2*b-1];
<a name="l00053"></a>00053 };
<a name="l00054"></a>00054
<a name="l00055"></a>00055 <span class="preprocessor">#define CRYPTOPP_COMPILE_ASSERT(assertion) CRYPTOPP_COMPILE_ASSERT_INSTANCE(assertion, __LINE__)</span>
<a name="l00056"></a>00056 <span class="preprocessor"></span><span class="preprocessor">#if defined(CRYPTOPP_EXPORTS) || defined(CRYPTOPP_IMPORTS)</span>
<a name="l00057"></a>00057 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_COMPILE_ASSERT_INSTANCE(assertion, instance)</span>
<a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_COMPILE_ASSERT_INSTANCE(assertion, instance) static CompileAssert<(assertion)> CRYPTOPP_ASSERT_JOIN(cryptopp_assert_, instance)</span>
<a name="l00060"></a>00060 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00061"></a>00061 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_ASSERT_JOIN(X, Y) CRYPTOPP_DO_ASSERT_JOIN(X, Y)</span>
<a name="l00062"></a>00062 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_DO_ASSERT_JOIN(X, Y) X##Y</span>
<a name="l00063"></a>00063 <span class="preprocessor"></span>
<a name="l00064"></a>00064 <span class="comment">// ************** misc classes ***************</span>
<a name="l00065"></a>00065
<a name="l00066"></a><a class="code" href="class_empty.html">00066</a> <span class="keyword">class </span>CRYPTOPP_DLL <a class="code" href="class_empty.html">Empty</a>
<a name="l00067"></a>00067 {
<a name="l00068"></a>00068 };
<a name="l00069"></a>00069 <span class="comment"></span>
<a name="l00070"></a>00070 <span class="comment">//! _</span>
<a name="l00071"></a>00071 <span class="comment"></span><span class="keyword">template</span> <<span class="keyword">class</span> BASE1, <span class="keyword">class</span> BASE2>
<a name="l00072"></a><a class="code" href="class_two_bases.html">00072</a> <span class="keyword">class </span>CRYPTOPP_NO_VTABLE <a class="code" href="class_two_bases.html" title="_">TwoBases</a> : <span class="keyword">public</span> BASE1, <span class="keyword">public</span> BASE2
<a name="l00073"></a>00073 {
<a name="l00074"></a>00074 };
<a name="l00075"></a>00075 <span class="comment"></span>
<a name="l00076"></a>00076 <span class="comment">//! _</span>
<a name="l00077"></a>00077 <span class="comment"></span><span class="keyword">template</span> <<span class="keyword">class</span> BASE1, <span class="keyword">class</span> BASE2, <span class="keyword">class</span> BASE3>
<a name="l00078"></a><a class="code" href="class_three_bases.html">00078</a> <span class="keyword">class </span>CRYPTOPP_NO_VTABLE <a class="code" href="class_three_bases.html" title="_">ThreeBases</a> : <span class="keyword">public</span> BASE1, <span class="keyword">public</span> BASE2, <span class="keyword">public</span> BASE3
<a name="l00079"></a>00079 {
<a name="l00080"></a>00080 };
<a name="l00081"></a>00081
<a name="l00082"></a>00082 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00083"></a><a class="code" href="class_object_holder.html">00083</a> <span class="keyword">class </span><a class="code" href="class_object_holder.html">ObjectHolder</a>
<a name="l00084"></a>00084 {
<a name="l00085"></a>00085 <span class="keyword">protected</span>:
<a name="l00086"></a>00086 T m_object;
<a name="l00087"></a>00087 };
<a name="l00088"></a>00088
<a name="l00089"></a><a class="code" href="class_not_copyable.html">00089</a> <span class="keyword">class </span><a class="code" href="class_not_copyable.html">NotCopyable</a>
<a name="l00090"></a>00090 {
<a name="l00091"></a>00091 <span class="keyword">public</span>:
<a name="l00092"></a>00092 <a class="code" href="class_not_copyable.html">NotCopyable</a>() {}
<a name="l00093"></a>00093 <span class="keyword">private</span>:
<a name="l00094"></a>00094 <a class="code" href="class_not_copyable.html">NotCopyable</a>(<span class="keyword">const</span> <a class="code" href="class_not_copyable.html">NotCopyable</a> &);
<a name="l00095"></a>00095 <span class="keywordtype">void</span> operator=(<span class="keyword">const</span> <a class="code" href="class_not_copyable.html">NotCopyable</a> &);
<a name="l00096"></a>00096 };
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00099"></a><a class="code" href="struct_new_object.html">00099</a> <span class="keyword">struct </span><a class="code" href="struct_new_object.html">NewObject</a>
<a name="l00100"></a>00100 {
<a name="l00101"></a>00101 T* operator()()<span class="keyword"> const </span>{<span class="keywordflow">return</span> <span class="keyword">new</span> T;}
<a name="l00102"></a>00102 };
<a name="l00103"></a>00103 <span class="comment"></span>
<a name="l00104"></a>00104 <span class="comment">/*! This function safely initializes a static object in a multithreaded environment without using locks.</span>
<a name="l00105"></a>00105 <span class="comment"> It may leak memory when two threads try to initialize the static object at the same time</span>
<a name="l00106"></a>00106 <span class="comment"> but this should be acceptable since each static object is only initialized once per session.</span>
<a name="l00107"></a>00107 <span class="comment">*/</span>
<a name="l00108"></a>00108 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> F = NewObject<T>, <span class="keywordtype">int</span> instance=0>
<a name="l00109"></a><a class="code" href="class_singleton.html">00109</a> <span class="keyword">class </span><a class="code" href="class_singleton.html">Singleton</a>
<a name="l00110"></a>00110 {
<a name="l00111"></a>00111 <span class="keyword">public</span>:
<a name="l00112"></a>00112 <a class="code" href="class_singleton.html">Singleton</a>(F objectFactory = F()) : m_objectFactory(objectFactory) {}
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="comment">// prevent this function from being inlined</span>
<a name="l00115"></a>00115 CRYPTOPP_NOINLINE <span class="keyword">const</span> T & Ref(CRYPTOPP_NOINLINE_DOTDOTDOT) <span class="keyword">const</span>;
<a name="l00116"></a>00116
<a name="l00117"></a>00117 <span class="keyword">private</span>:
<a name="l00118"></a>00118 F m_objectFactory;
<a name="l00119"></a>00119 };
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> F, <span class="keywordtype">int</span> instance>
<a name="l00122"></a>00122 <span class="keyword">const</span> T & <a class="code" href="class_singleton.html">Singleton<T, F, instance>::Ref</a>(CRYPTOPP_NOINLINE_DOTDOTDOT)<span class="keyword"> const</span>
<a name="l00123"></a>00123 <span class="keyword"></span>{
<a name="l00124"></a>00124 <span class="keyword">static</span> <a class="code" href="classsimple__ptr.html">simple_ptr<T></a> s_pObject;
<a name="l00125"></a>00125 <span class="keyword">static</span> <span class="keyword">volatile</span> <span class="keywordtype">char</span> s_objectState = 0;
<a name="l00126"></a>00126
<a name="l00127"></a>00127 retry:
<a name="l00128"></a>00128 <span class="keywordflow">switch</span> (s_objectState)
<a name="l00129"></a>00129 {
<a name="l00130"></a>00130 <span class="keywordflow">case</span> 0:
<a name="l00131"></a>00131 s_objectState = 1;
<a name="l00132"></a>00132 <span class="keywordflow">try</span>
<a name="l00133"></a>00133 {
<a name="l00134"></a>00134 s_pObject.m_p = m_objectFactory();
<a name="l00135"></a>00135 }
<a name="l00136"></a>00136 <span class="keywordflow">catch</span>(...)
<a name="l00137"></a>00137 {
<a name="l00138"></a>00138 s_objectState = 0;
<a name="l00139"></a>00139 <span class="keywordflow">throw</span>;
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141 s_objectState = 2;
<a name="l00142"></a>00142 <span class="keywordflow">break</span>;
<a name="l00143"></a>00143 <span class="keywordflow">case</span> 1:
<a name="l00144"></a>00144 <span class="keywordflow">goto</span> retry;
<a name="l00145"></a>00145 <span class="keywordflow">default</span>:
<a name="l00146"></a>00146 <span class="keywordflow">break</span>;
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148 <span class="keywordflow">return</span> *s_pObject.m_p;
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="comment">// ************** misc functions ***************</span>
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="preprocessor">#if (!__STDC_WANT_SECURE_LIB__)</span>
<a name="l00154"></a>00154 <span class="preprocessor"></span><span class="keyword">inline</span> <span class="keywordtype">void</span> memcpy_s(<span class="keywordtype">void</span> *dest, <span class="keywordtype">size_t</span> sizeInBytes, <span class="keyword">const</span> <span class="keywordtype">void</span> *src, <span class="keywordtype">size_t</span> count)
<a name="l00155"></a>00155 {
<a name="l00156"></a>00156 <span class="keywordflow">if</span> (count > sizeInBytes)
<a name="l00157"></a>00157 <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html" title="exception thrown when an invalid argument is detected">InvalidArgument</a>(<span class="stringliteral">"memcpy_s: buffer overflow"</span>);
<a name="l00158"></a>00158 memcpy(dest, src, count);
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <span class="keyword">inline</span> <span class="keywordtype">void</span> memmove_s(<span class="keywordtype">void</span> *dest, <span class="keywordtype">size_t</span> sizeInBytes, <span class="keyword">const</span> <span class="keywordtype">void</span> *src, <span class="keywordtype">size_t</span> count)
<a name="l00162"></a>00162 {
<a name="l00163"></a>00163 <span class="keywordflow">if</span> (count > sizeInBytes)
<a name="l00164"></a>00164 <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html" title="exception thrown when an invalid argument is detected">InvalidArgument</a>(<span class="stringliteral">"memmove_s: buffer overflow"</span>);
<a name="l00165"></a>00165 memmove(dest, src, count);
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167 <span class="preprocessor">#endif</span>
<a name="l00168"></a>00168 <span class="preprocessor"></span>
<a name="l00169"></a>00169 <span class="keyword">inline</span> <span class="keywordtype">void</span> * memset_z(<span class="keywordtype">void</span> *ptr, <span class="keywordtype">int</span> value, <span class="keywordtype">size_t</span> num)
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171 <span class="comment">// avoid extranous warning on GCC 4.3.2 Ubuntu 8.10</span>
<a name="l00172"></a>00172 <span class="preprocessor">#if CRYPTOPP_GCC_VERSION >= 30001</span>
<a name="l00173"></a>00173 <span class="preprocessor"></span> <span class="keywordflow">if</span> (__builtin_constant_p(num) && num==0)
<a name="l00174"></a>00174 <span class="keywordflow">return</span> ptr;
<a name="l00175"></a>00175 <span class="preprocessor">#endif</span>
<a name="l00176"></a>00176 <span class="preprocessor"></span> <span class="keywordflow">return</span> memset(ptr, value, num);
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178
<a name="l00179"></a>00179 <span class="comment">// can't use std::min or std::max in MSVC60 or Cygwin 1.1.0</span>
<a name="l00180"></a>00180 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">inline</span> <span class="keyword">const</span> T& STDMIN(<span class="keyword">const</span> T& a, <span class="keyword">const</span> T& b)
<a name="l00181"></a>00181 {
<a name="l00182"></a>00182 <span class="keywordflow">return</span> b < a ? b : a;
<a name="l00183"></a>00183 }
<a name="l00184"></a>00184
<a name="l00185"></a>00185 <span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">inline</span> <span class="keyword">const</span> T1 UnsignedMin(<span class="keyword">const</span> T1& a, <span class="keyword">const</span> T2& b)
<a name="l00186"></a>00186 {
<a name="l00187"></a>00187 CRYPTOPP_COMPILE_ASSERT((<span class="keyword">sizeof</span>(T1)<=<span class="keyword">sizeof</span>(T2) && T2(-1)>0) || (<span class="keyword">sizeof</span>(T1)><span class="keyword">sizeof</span>(T2) && T1(-1)>0));
<a name="l00188"></a>00188 assert(a==0 || a>0); <span class="comment">// GCC workaround: get rid of the warning "comparison is always true due to limited range of data type"</span>
<a name="l00189"></a>00189 assert(b>=0);
<a name="l00190"></a>00190
<a name="l00191"></a>00191 <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T1)<=<span class="keyword">sizeof</span>(T2))
<a name="l00192"></a>00192 <span class="keywordflow">return</span> b < (T2)a ? (T1)b : a;
<a name="l00193"></a>00193 else
<a name="l00194"></a>00194 return (T1)b < a ? (T1)b : a;
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196
<a name="l00197"></a>00197 template <class T> inline const T& STDMAX(const T& a, const T& b)
<a name="l00198"></a>00198 {
<a name="l00199"></a>00199 <span class="keywordflow">return</span> a < b ? b : a;
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="preprocessor">#define RETURN_IF_NONZERO(x) size_t returnedValue = x; if (returnedValue) return returnedValue</span>
<a name="l00203"></a>00203 <span class="preprocessor"></span>
<a name="l00204"></a>00204 <span class="comment">// this version of the macro is fastest on Pentium 3 and Pentium 4 with MSVC 6 SP5 w/ Processor Pack</span>
<a name="l00205"></a>00205 <span class="preprocessor">#define GETBYTE(x, y) (unsigned int)byte((x)>>(8*(y)))</span>
<a name="l00206"></a>00206 <span class="preprocessor"></span><span class="comment">// these may be faster on other CPUs/compilers</span>
<a name="l00207"></a>00207 <span class="comment">// #define GETBYTE(x, y) (unsigned int)(((x)>>(8*(y)))&255)</span>
<a name="l00208"></a>00208 <span class="comment">// #define GETBYTE(x, y) (((byte *)&(x))[y])</span>
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="preprocessor">#define CRYPTOPP_GET_BYTE_AS_BYTE(x, y) byte((x)>>(8*(y)))</span>
<a name="l00211"></a>00211 <span class="preprocessor"></span>
<a name="l00212"></a>00212 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00213"></a>00213 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> Parity(T value)
<a name="l00214"></a>00214 {
<a name="l00215"></a>00215 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=8*<span class="keyword">sizeof</span>(value)/2; i>0; i/=2)
<a name="l00216"></a>00216 value ^= value >> i;
<a name="l00217"></a>00217 <span class="keywordflow">return</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)value&1;
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00221"></a>00221 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> BytePrecision(<span class="keyword">const</span> T &value)
<a name="l00222"></a>00222 {
<a name="l00223"></a>00223 <span class="keywordflow">if</span> (!value)
<a name="l00224"></a>00224 <span class="keywordflow">return</span> 0;
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> l=0, h=8*<span class="keyword">sizeof</span>(value);
<a name="l00227"></a>00227
<a name="l00228"></a>00228 <span class="keywordflow">while</span> (h-l > 8)
<a name="l00229"></a>00229 {
<a name="l00230"></a>00230 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t = (l+h)/2;
<a name="l00231"></a>00231 <span class="keywordflow">if</span> (value >> t)
<a name="l00232"></a>00232 l = t;
<a name="l00233"></a>00233 <span class="keywordflow">else</span>
<a name="l00234"></a>00234 h = t;
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="keywordflow">return</span> h/8;
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00241"></a>00241 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> BitPrecision(<span class="keyword">const</span> T &value)
<a name="l00242"></a>00242 {
<a name="l00243"></a>00243 <span class="keywordflow">if</span> (!value)
<a name="l00244"></a>00244 <span class="keywordflow">return</span> 0;
<a name="l00245"></a>00245
<a name="l00246"></a>00246 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> l=0, h=8*<span class="keyword">sizeof</span>(value);
<a name="l00247"></a>00247
<a name="l00248"></a>00248 <span class="keywordflow">while</span> (h-l > 1)
<a name="l00249"></a>00249 {
<a name="l00250"></a>00250 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t = (l+h)/2;
<a name="l00251"></a>00251 <span class="keywordflow">if</span> (value >> t)
<a name="l00252"></a>00252 l = t;
<a name="l00253"></a>00253 <span class="keywordflow">else</span>
<a name="l00254"></a>00254 h = t;
<a name="l00255"></a>00255 }
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="keywordflow">return</span> h;
<a name="l00258"></a>00258 }
<a name="l00259"></a>00259
<a name="l00260"></a>00260 <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> TrailingZeros(word32 v)
<a name="l00261"></a>00261 {
<a name="l00262"></a>00262 <span class="preprocessor">#if defined(__GNUC__) && CRYPTOPP_GCC_VERSION >= 30400</span>
<a name="l00263"></a>00263 <span class="preprocessor"></span> <span class="keywordflow">return</span> __builtin_ctz(v);
<a name="l00264"></a>00264 <span class="preprocessor">#elif defined(_MSC_VER) && _MSC_VER >= 1400</span>
<a name="l00265"></a>00265 <span class="preprocessor"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> result;
<a name="l00266"></a>00266 _BitScanForward(&result, v);
<a name="l00267"></a>00267 <span class="keywordflow">return</span> result;
<a name="l00268"></a>00268 <span class="preprocessor">#else</span>
<a name="l00269"></a>00269 <span class="preprocessor"></span> <span class="comment">// from http://graphics.stanford.edu/~seander/bithacks.html#ZerosOnRightMultLookup</span>
<a name="l00270"></a>00270 <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> MultiplyDeBruijnBitPosition[32] =
<a name="l00271"></a>00271 {
<a name="l00272"></a>00272 0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
<a name="l00273"></a>00273 31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
<a name="l00274"></a>00274 };
<a name="l00275"></a>00275 <span class="keywordflow">return</span> MultiplyDeBruijnBitPosition[((word32)((v & -v) * 0x077CB531U)) >> 27];
<a name="l00276"></a>00276 <span class="preprocessor">#endif</span>
<a name="l00277"></a>00277 <span class="preprocessor"></span>}
<a name="l00278"></a>00278
<a name="l00279"></a>00279 <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> TrailingZeros(word64 v)
<a name="l00280"></a>00280 {
<a name="l00281"></a>00281 <span class="preprocessor">#if defined(__GNUC__) && CRYPTOPP_GCC_VERSION >= 30400</span>
<a name="l00282"></a>00282 <span class="preprocessor"></span> <span class="keywordflow">return</span> __builtin_ctzll(v);
<a name="l00283"></a>00283 <span class="preprocessor">#elif defined(_MSC_VER) && _MSC_VER >= 1400 && (defined(_M_X64) || defined(_M_IA64))</span>
<a name="l00284"></a>00284 <span class="preprocessor"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> result;
<a name="l00285"></a>00285 _BitScanForward64(&result, v);
<a name="l00286"></a>00286 <span class="keywordflow">return</span> result;
<a name="l00287"></a>00287 <span class="preprocessor">#else</span>
<a name="l00288"></a>00288 <span class="preprocessor"></span> <span class="keywordflow">return</span> word32(v) ? TrailingZeros(word32(v)) : 32 + TrailingZeros(word32(v>>32));
<a name="l00289"></a>00289 <span class="preprocessor">#endif</span>
<a name="l00290"></a>00290 <span class="preprocessor"></span>}
<a name="l00291"></a>00291
<a name="l00292"></a>00292 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00293"></a>00293 <span class="keyword">inline</span> T Crop(T value, <span class="keywordtype">size_t</span> size)
<a name="l00294"></a>00294 {
<a name="l00295"></a>00295 <span class="keywordflow">if</span> (size < 8*<span class="keyword">sizeof</span>(value))
<a name="l00296"></a>00296 <span class="keywordflow">return</span> T(value & ((T(1) << size) - 1));
<a name="l00297"></a>00297 <span class="keywordflow">else</span>
<a name="l00298"></a>00298 <span class="keywordflow">return</span> value;
<a name="l00299"></a>00299 }
<a name="l00300"></a>00300
<a name="l00301"></a>00301 <span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2>
<a name="l00302"></a>00302 <span class="keyword">inline</span> <span class="keywordtype">bool</span> SafeConvert(T1 from, T2 &to)
<a name="l00303"></a>00303 {
<a name="l00304"></a>00304 to = (T2)from;
<a name="l00305"></a>00305 <span class="keywordflow">if</span> (from != to || (from > 0) != (to > 0))
<a name="l00306"></a>00306 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00307"></a>00307 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00308"></a>00308 }
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> BitsToBytes(<span class="keywordtype">size_t</span> bitCount)
<a name="l00311"></a>00311 {
<a name="l00312"></a>00312 <span class="keywordflow">return</span> ((bitCount+7)/(8));
<a name="l00313"></a>00313 }
<a name="l00314"></a>00314
<a name="l00315"></a>00315 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> BytesToWords(<span class="keywordtype">size_t</span> byteCount)
<a name="l00316"></a>00316 {
<a name="l00317"></a>00317 <span class="keywordflow">return</span> ((byteCount+WORD_SIZE-1)/WORD_SIZE);
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319
<a name="l00320"></a>00320 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> BitsToWords(<span class="keywordtype">size_t</span> bitCount)
<a name="l00321"></a>00321 {
<a name="l00322"></a>00322 <span class="keywordflow">return</span> ((bitCount+WORD_BITS-1)/(WORD_BITS));
<a name="l00323"></a>00323 }
<a name="l00324"></a>00324
<a name="l00325"></a>00325 <span class="keyword">inline</span> <span class="keywordtype">size_t</span> BitsToDwords(<span class="keywordtype">size_t</span> bitCount)
<a name="l00326"></a>00326 {
<a name="l00327"></a>00327 <span class="keywordflow">return</span> ((bitCount+2*WORD_BITS-1)/(2*WORD_BITS));
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329
<a name="l00330"></a>00330 CRYPTOPP_DLL <span class="keywordtype">void</span> CRYPTOPP_API xorbuf(byte *buf, <span class="keyword">const</span> byte *mask, <span class="keywordtype">size_t</span> count);
<a name="l00331"></a>00331 CRYPTOPP_DLL <span class="keywordtype">void</span> CRYPTOPP_API xorbuf(byte *output, <span class="keyword">const</span> byte *input, <span class="keyword">const</span> byte *mask, <span class="keywordtype">size_t</span> count);
<a name="l00332"></a>00332
<a name="l00333"></a>00333 CRYPTOPP_DLL <span class="keywordtype">bool</span> CRYPTOPP_API VerifyBufsEqual(<span class="keyword">const</span> byte *buf1, <span class="keyword">const</span> byte *buf2, <span class="keywordtype">size_t</span> count);
<a name="l00334"></a>00334
<a name="l00335"></a>00335 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00336"></a>00336 <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsPowerOf2(<span class="keyword">const</span> T &n)
<a name="l00337"></a>00337 {
<a name="l00338"></a>00338 <span class="keywordflow">return</span> n > 0 && (n & (n-1)) == 0;
<a name="l00339"></a>00339 }
<a name="l00340"></a>00340
<a name="l00341"></a>00341 <span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2>
<a name="l00342"></a>00342 <span class="keyword">inline</span> T2 ModPowerOf2(<span class="keyword">const</span> T1 &a, <span class="keyword">const</span> T2 &b)
<a name="l00343"></a>00343 {
<a name="l00344"></a>00344 assert(IsPowerOf2(b));
<a name="l00345"></a>00345 <span class="keywordflow">return</span> T2(a) & (b-1);
<a name="l00346"></a>00346 }
<a name="l00347"></a>00347
<a name="l00348"></a>00348 <span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2>
<a name="l00349"></a>00349 <span class="keyword">inline</span> T1 RoundDownToMultipleOf(<span class="keyword">const</span> T1 &n, <span class="keyword">const</span> T2 &m)
<a name="l00350"></a>00350 {
<a name="l00351"></a>00351 <span class="keywordflow">if</span> (IsPowerOf2(m))
<a name="l00352"></a>00352 <span class="keywordflow">return</span> n - ModPowerOf2(n, m);
<a name="l00353"></a>00353 <span class="keywordflow">else</span>
<a name="l00354"></a>00354 <span class="keywordflow">return</span> n - n%m;
<a name="l00355"></a>00355 }
<a name="l00356"></a>00356
<a name="l00357"></a>00357 <span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2>
<a name="l00358"></a>00358 <span class="keyword">inline</span> T1 RoundUpToMultipleOf(<span class="keyword">const</span> T1 &n, <span class="keyword">const</span> T2 &m)
<a name="l00359"></a>00359 {
<a name="l00360"></a>00360 <span class="keywordflow">if</span> (n+m-1 < n)
<a name="l00361"></a>00361 <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html" title="exception thrown when an invalid argument is detected">InvalidArgument</a>(<span class="stringliteral">"RoundUpToMultipleOf: integer overflow"</span>);
<a name="l00362"></a>00362 <span class="keywordflow">return</span> RoundDownToMultipleOf(n+m-1, m);
<a name="l00363"></a>00363 }
<a name="l00364"></a>00364
<a name="l00365"></a>00365 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00366"></a>00366 <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> GetAlignmentOf(T *dummy=NULL) <span class="comment">// VC60 workaround</span>
<a name="l00367"></a>00367 {
<a name="l00368"></a>00368 <span class="preprocessor">#ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS</span>
<a name="l00369"></a>00369 <span class="preprocessor"></span> <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T) < 16)
<a name="l00370"></a>00370 <span class="keywordflow">return</span> 1;
<a name="l00371"></a>00371 <span class="preprocessor">#endif</span>
<a name="l00372"></a>00372 <span class="preprocessor"></span>
<a name="l00373"></a>00373 <span class="preprocessor">#if (_MSC_VER >= 1300)</span>
<a name="l00374"></a>00374 <span class="preprocessor"></span> <span class="keywordflow">return</span> __alignof(T);
<a name="l00375"></a>00375 <span class="preprocessor">#elif defined(__GNUC__)</span>
<a name="l00376"></a>00376 <span class="preprocessor"></span> <span class="keywordflow">return</span> __alignof__(T);
<a name="l00377"></a>00377 <span class="preprocessor">#elif CRYPTOPP_BOOL_SLOW_WORD64</span>
<a name="l00378"></a>00378 <span class="preprocessor"></span> <span class="keywordflow">return</span> UnsignedMin(4U, <span class="keyword">sizeof</span>(T));
<a name="l00379"></a>00379 <span class="preprocessor">#else</span>
<a name="l00380"></a>00380 <span class="preprocessor"></span> <span class="keywordflow">return</span> <span class="keyword">sizeof</span>(T);
<a name="l00381"></a>00381 <span class="preprocessor">#endif</span>
<a name="l00382"></a>00382 <span class="preprocessor"></span>}
<a name="l00383"></a>00383
<a name="l00384"></a>00384 <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsAlignedOn(<span class="keyword">const</span> <span class="keywordtype">void</span> *p, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> alignment)
<a name="l00385"></a>00385 {
<a name="l00386"></a>00386 <span class="keywordflow">return</span> alignment==1 || (IsPowerOf2(alignment) ? ModPowerOf2((<span class="keywordtype">size_t</span>)p, alignment) == 0 : (size_t)p % alignment == 0);
<a name="l00387"></a>00387 }
<a name="l00388"></a>00388
<a name="l00389"></a>00389 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00390"></a>00390 <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsAligned(<span class="keyword">const</span> <span class="keywordtype">void</span> *p, T *dummy=NULL) <span class="comment">// VC60 workaround</span>
<a name="l00391"></a>00391 {
<a name="l00392"></a>00392 <span class="keywordflow">return</span> IsAlignedOn(p, GetAlignmentOf<T>());
<a name="l00393"></a>00393 }
<a name="l00394"></a>00394
<a name="l00395"></a>00395 <span class="preprocessor">#ifdef IS_LITTLE_ENDIAN</span>
<a name="l00396"></a>00396 <span class="preprocessor"></span> <span class="keyword">typedef</span> <a class="code" href="struct_enum_to_type.html">LittleEndian</a> <a class="code" href="struct_enum_to_type.html">NativeByteOrder</a>;
<a name="l00397"></a>00397 <span class="preprocessor">#else</span>
<a name="l00398"></a>00398 <span class="preprocessor"></span> <span class="keyword">typedef</span> <a class="code" href="struct_enum_to_type.html">BigEndian</a> NativeByteOrder;
<a name="l00399"></a>00399 <span class="preprocessor">#endif</span>
<a name="l00400"></a>00400 <span class="preprocessor"></span>
<a name="l00401"></a>00401 <span class="keyword">inline</span> ByteOrder GetNativeByteOrder()
<a name="l00402"></a>00402 {
<a name="l00403"></a>00403 <span class="keywordflow">return</span> NativeByteOrder::ToEnum();
<a name="l00404"></a>00404 }
<a name="l00405"></a>00405
<a name="l00406"></a>00406 <span class="keyword">inline</span> <span class="keywordtype">bool</span> NativeByteOrderIs(ByteOrder order)
<a name="l00407"></a>00407 {
<a name="l00408"></a>00408 <span class="keywordflow">return</span> order == GetNativeByteOrder();
<a name="l00409"></a>00409 }
<a name="l00410"></a>00410
<a name="l00411"></a>00411 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00412"></a>00412 std::string IntToString(T a, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> base = 10)
<a name="l00413"></a>00413 {
<a name="l00414"></a>00414 <span class="keywordflow">if</span> (a == 0)
<a name="l00415"></a>00415 <span class="keywordflow">return</span> <span class="stringliteral">"0"</span>;
<a name="l00416"></a>00416 <span class="keywordtype">bool</span> negate = <span class="keyword">false</span>;
<a name="l00417"></a>00417 <span class="keywordflow">if</span> (a < 0)
<a name="l00418"></a>00418 {
<a name="l00419"></a>00419 negate = <span class="keyword">true</span>;
<a name="l00420"></a>00420 a = 0-a; <span class="comment">// VC .NET does not like -a</span>
<a name="l00421"></a>00421 }
<a name="l00422"></a>00422 std::string result;
<a name="l00423"></a>00423 <span class="keywordflow">while</span> (a > 0)
<a name="l00424"></a>00424 {
<a name="l00425"></a>00425 T digit = a % base;
<a name="l00426"></a>00426 result = char((digit < 10 ? <span class="charliteral">'0'</span> : (<span class="charliteral">'a'</span> - 10)) + digit) + result;
<a name="l00427"></a>00427 a /= base;
<a name="l00428"></a>00428 }
<a name="l00429"></a>00429 <span class="keywordflow">if</span> (negate)
<a name="l00430"></a>00430 result = <span class="stringliteral">"-"</span> + result;
<a name="l00431"></a>00431 <span class="keywordflow">return</span> result;
<a name="l00432"></a>00432 }
<a name="l00433"></a>00433
<a name="l00434"></a>00434 <span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2>
<a name="l00435"></a>00435 <span class="keyword">inline</span> T1 SaturatingSubtract(<span class="keyword">const</span> T1 &a, <span class="keyword">const</span> T2 &b)
<a name="l00436"></a>00436 {
<a name="l00437"></a>00437 <span class="keywordflow">return</span> T1((a > b) ? (a - b) : 0);
<a name="l00438"></a>00438 }
<a name="l00439"></a>00439
<a name="l00440"></a>00440 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00441"></a>00441 <span class="keyword">inline</span> <a class="code" href="cryptlib_8h.html#a353ccabf5ddc119a6a33e92f7b9961c7" title="used to specify a direction for a cipher to operate in (encrypt or decrypt)">CipherDir</a> GetCipherDir(<span class="keyword">const</span> T &obj)
<a name="l00442"></a>00442 {
<a name="l00443"></a>00443 <span class="keywordflow">return</span> obj.IsForwardTransformation() ? ENCRYPTION : DECRYPTION;
<a name="l00444"></a>00444 }
<a name="l00445"></a>00445
<a name="l00446"></a>00446 CRYPTOPP_DLL <span class="keywordtype">void</span> CRYPTOPP_API CallNewHandler();
<a name="l00447"></a>00447
<a name="l00448"></a>00448 <span class="keyword">inline</span> <span class="keywordtype">void</span> IncrementCounterByOne(byte *inout, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> s)
<a name="l00449"></a>00449 {
<a name="l00450"></a>00450 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=s-1, carry=1; i>=0 && carry; i--)
<a name="l00451"></a>00451 carry = !++inout[i];
<a name="l00452"></a>00452 }
<a name="l00453"></a>00453
<a name="l00454"></a>00454 <span class="keyword">inline</span> <span class="keywordtype">void</span> IncrementCounterByOne(byte *output, <span class="keyword">const</span> byte *input, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> s)
<a name="l00455"></a>00455 {
<a name="l00456"></a>00456 <span class="keywordtype">int</span> i, carry;
<a name="l00457"></a>00457 <span class="keywordflow">for</span> (i=s-1, carry=1; i>=0 && carry; i--)
<a name="l00458"></a>00458 carry = ((output[i] = input[i]+1) == 0);
<a name="l00459"></a>00459 memcpy_s(output, s, input, i+1);
<a name="l00460"></a>00460 }
<a name="l00461"></a>00461
<a name="l00462"></a>00462 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00463"></a>00463 <span class="keyword">inline</span> <span class="keywordtype">void</span> ConditionalSwap(<span class="keywordtype">bool</span> c, T &a, T &b)
<a name="l00464"></a>00464 {
<a name="l00465"></a>00465 T t = c * (a ^ b);
<a name="l00466"></a>00466 a ^= t;
<a name="l00467"></a>00467 b ^= t;
<a name="l00468"></a>00468 }
<a name="l00469"></a>00469
<a name="l00470"></a>00470 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00471"></a>00471 <span class="keyword">inline</span> <span class="keywordtype">void</span> ConditionalSwapPointers(<span class="keywordtype">bool</span> c, T &a, T &b)
<a name="l00472"></a>00472 {
<a name="l00473"></a>00473 ptrdiff_t t = c * (a - b);
<a name="l00474"></a>00474 a -= t;
<a name="l00475"></a>00475 b += t;
<a name="l00476"></a>00476 }
<a name="l00477"></a>00477
<a name="l00478"></a>00478 <span class="comment">// see http://www.dwheeler.com/secure-programs/Secure-Programs-HOWTO/protect-secrets.html</span>
<a name="l00479"></a>00479 <span class="comment">// and https://www.securecoding.cert.org/confluence/display/cplusplus/MSC06-CPP.+Be+aware+of+compiler+optimization+when+dealing+with+sensitive+data</span>
<a name="l00480"></a>00480 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00481"></a>00481 <span class="keywordtype">void</span> SecureWipeBuffer(T *buf, <span class="keywordtype">size_t</span> n)
<a name="l00482"></a>00482 {
<a name="l00483"></a>00483 <span class="comment">// GCC 4.3.2 on Cygwin optimizes away the first store if this loop is done in the forward direction</span>
<a name="l00484"></a>00484 <span class="keyword">volatile</span> T *p = buf+n;
<a name="l00485"></a>00485 <span class="keywordflow">while</span> (n--)
<a name="l00486"></a>00486 *(--p) = 0;
<a name="l00487"></a>00487 }
<a name="l00488"></a>00488
<a name="l00489"></a>00489 <span class="preprocessor">#if (_MSC_VER >= 1400 || defined(__GNUC__)) && (CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86)</span>
<a name="l00490"></a>00490 <span class="preprocessor"></span>
<a name="l00491"></a>00491 <span class="keyword">template</span><> <span class="keyword">inline</span> <span class="keywordtype">void</span> SecureWipeBuffer(byte *buf, <span class="keywordtype">size_t</span> n)
<a name="l00492"></a>00492 {
<a name="l00493"></a>00493 <span class="keyword">volatile</span> byte *p = buf;
<a name="l00494"></a>00494 <span class="preprocessor">#ifdef __GNUC__</span>
<a name="l00495"></a>00495 <span class="preprocessor"></span> <span class="keyword">asm</span> <span class="keyword">volatile</span>(<span class="stringliteral">"rep stosb"</span> : <span class="stringliteral">"+c"</span>(n), <span class="stringliteral">"+D"</span>(p) : <span class="stringliteral">"a"</span>(0) : <span class="stringliteral">"memory"</span>);
<a name="l00496"></a>00496 <span class="preprocessor">#else</span>
<a name="l00497"></a>00497 <span class="preprocessor"></span> __stosb((byte *)(<span class="keywordtype">size_t</span>)p, 0, n);
<a name="l00498"></a>00498 <span class="preprocessor">#endif</span>
<a name="l00499"></a>00499 <span class="preprocessor"></span>}
<a name="l00500"></a>00500
<a name="l00501"></a>00501 <span class="keyword">template</span><> <span class="keyword">inline</span> <span class="keywordtype">void</span> SecureWipeBuffer(word16 *buf, <span class="keywordtype">size_t</span> n)
<a name="l00502"></a>00502 {
<a name="l00503"></a>00503 <span class="keyword">volatile</span> word16 *p = buf;
<a name="l00504"></a>00504 <span class="preprocessor">#ifdef __GNUC__</span>
<a name="l00505"></a>00505 <span class="preprocessor"></span> <span class="keyword">asm</span> <span class="keyword">volatile</span>(<span class="stringliteral">"rep stosw"</span> : <span class="stringliteral">"+c"</span>(n), <span class="stringliteral">"+D"</span>(p) : <span class="stringliteral">"a"</span>(0) : <span class="stringliteral">"memory"</span>);
<a name="l00506"></a>00506 <span class="preprocessor">#else</span>
<a name="l00507"></a>00507 <span class="preprocessor"></span> __stosw((word16 *)(<span class="keywordtype">size_t</span>)p, 0, n);
<a name="l00508"></a>00508 <span class="preprocessor">#endif</span>
<a name="l00509"></a>00509 <span class="preprocessor"></span>}
<a name="l00510"></a>00510
<a name="l00511"></a>00511 <span class="keyword">template</span><> <span class="keyword">inline</span> <span class="keywordtype">void</span> SecureWipeBuffer(word32 *buf, <span class="keywordtype">size_t</span> n)
<a name="l00512"></a>00512 {
<a name="l00513"></a>00513 <span class="keyword">volatile</span> word32 *p = buf;
<a name="l00514"></a>00514 <span class="preprocessor">#ifdef __GNUC__</span>
<a name="l00515"></a>00515 <span class="preprocessor"></span> <span class="keyword">asm</span> <span class="keyword">volatile</span>(<span class="stringliteral">"rep stosl"</span> : <span class="stringliteral">"+c"</span>(n), <span class="stringliteral">"+D"</span>(p) : <span class="stringliteral">"a"</span>(0) : <span class="stringliteral">"memory"</span>);
<a name="l00516"></a>00516 <span class="preprocessor">#else</span>
<a name="l00517"></a>00517 <span class="preprocessor"></span> __stosd((<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> *)(<span class="keywordtype">size_t</span>)p, 0, n);
<a name="l00518"></a>00518 <span class="preprocessor">#endif</span>
<a name="l00519"></a>00519 <span class="preprocessor"></span>}
<a name="l00520"></a>00520
<a name="l00521"></a>00521 <span class="keyword">template</span><> <span class="keyword">inline</span> <span class="keywordtype">void</span> SecureWipeBuffer(word64 *buf, <span class="keywordtype">size_t</span> n)
<a name="l00522"></a>00522 {
<a name="l00523"></a>00523 <span class="preprocessor">#if CRYPTOPP_BOOL_X64</span>
<a name="l00524"></a>00524 <span class="preprocessor"></span> <span class="keyword">volatile</span> word64 *p = buf;
<a name="l00525"></a>00525 <span class="preprocessor">#ifdef __GNUC__</span>
<a name="l00526"></a>00526 <span class="preprocessor"></span> <span class="keyword">asm</span> <span class="keyword">volatile</span>(<span class="stringliteral">"rep stosq"</span> : <span class="stringliteral">"+c"</span>(n), <span class="stringliteral">"+D"</span>(p) : <span class="stringliteral">"a"</span>(0) : <span class="stringliteral">"memory"</span>);
<a name="l00527"></a>00527 <span class="preprocessor">#else</span>
<a name="l00528"></a>00528 <span class="preprocessor"></span> __stosq((word64 *)(<span class="keywordtype">size_t</span>)p, 0, n);
<a name="l00529"></a>00529 <span class="preprocessor">#endif</span>
<a name="l00530"></a>00530 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00531"></a>00531 <span class="preprocessor"></span> SecureWipeBuffer((word32 *)buf, 2*n);
<a name="l00532"></a>00532 <span class="preprocessor">#endif</span>
<a name="l00533"></a>00533 <span class="preprocessor"></span>}
<a name="l00534"></a>00534
<a name="l00535"></a>00535 <span class="preprocessor">#endif // #if (_MSC_VER >= 1400 || defined(__GNUC__)) && (CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86)</span>
<a name="l00536"></a>00536 <span class="preprocessor"></span>
<a name="l00537"></a>00537 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00538"></a>00538 <span class="keyword">inline</span> <span class="keywordtype">void</span> SecureWipeArray(T *buf, <span class="keywordtype">size_t</span> n)
<a name="l00539"></a>00539 {
<a name="l00540"></a>00540 <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T) % 8 == 0 && GetAlignmentOf<T>() % GetAlignmentOf<word64>() == 0)
<a name="l00541"></a>00541 SecureWipeBuffer((word64 *)buf, n * (<span class="keyword">sizeof</span>(T)/8));
<a name="l00542"></a>00542 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T) % 4 == 0 && GetAlignmentOf<T>() % GetAlignmentOf<word32>() == 0)
<a name="l00543"></a>00543 SecureWipeBuffer((word32 *)buf, n * (<span class="keyword">sizeof</span>(T)/4));
<a name="l00544"></a>00544 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T) % 2 == 0 && GetAlignmentOf<T>() % GetAlignmentOf<word16>() == 0)
<a name="l00545"></a>00545 SecureWipeBuffer((word16 *)buf, n * (<span class="keyword">sizeof</span>(T)/2));
<a name="l00546"></a>00546 <span class="keywordflow">else</span>
<a name="l00547"></a>00547 SecureWipeBuffer((byte *)buf, n * <span class="keyword">sizeof</span>(T));
<a name="l00548"></a>00548 }
<a name="l00549"></a>00549
<a name="l00550"></a>00550 <span class="comment">// this function uses wcstombs(), which assumes that setlocale() has been called</span>
<a name="l00551"></a>00551 <span class="keyword">static</span> std::string StringNarrow(<span class="keyword">const</span> <span class="keywordtype">wchar_t</span> *str, <span class="keywordtype">bool</span> throwOnError = <span class="keyword">true</span>)
<a name="l00552"></a>00552 {
<a name="l00553"></a>00553 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00554"></a>00554 <span class="preprocessor"></span><span class="preprocessor">#pragma warning(push)</span>
<a name="l00555"></a>00555 <span class="preprocessor"></span><span class="preprocessor">#pragma warning(disable: 4996) // 'wcstombs': This function or variable may be unsafe.</span>
<a name="l00556"></a>00556 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00557"></a>00557 <span class="preprocessor"></span> <span class="keywordtype">size_t</span> size = wcstombs(NULL, str, 0);
<a name="l00558"></a>00558 <span class="keywordflow">if</span> (size == -1)
<a name="l00559"></a>00559 {
<a name="l00560"></a>00560 <span class="keywordflow">if</span> (throwOnError)
<a name="l00561"></a>00561 <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html" title="exception thrown when an invalid argument is detected">InvalidArgument</a>(<span class="stringliteral">"StringNarrow: wcstombs() call failed"</span>);
<a name="l00562"></a>00562 <span class="keywordflow">else</span>
<a name="l00563"></a>00563 <span class="keywordflow">return</span> std::string();
<a name="l00564"></a>00564 }
<a name="l00565"></a>00565 std::string result(size, 0);
<a name="l00566"></a>00566 wcstombs(&result[0], str, size);
<a name="l00567"></a>00567 <span class="keywordflow">return</span> result;
<a name="l00568"></a>00568 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00569"></a>00569 <span class="preprocessor"></span><span class="preprocessor">#pragma warning(pop)</span>
<a name="l00570"></a>00570 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00571"></a>00571 <span class="preprocessor"></span>}
<a name="l00572"></a>00572
<a name="l00573"></a>00573 <span class="comment">// ************** rotate functions ***************</span>
<a name="l00574"></a>00574
<a name="l00575"></a>00575 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">inline</span> T rotlFixed(T x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00576"></a>00576 {
<a name="l00577"></a>00577 assert(y < <span class="keyword">sizeof</span>(T)*8);
<a name="l00578"></a>00578 <span class="keywordflow">return</span> T((x<<y) | (x>>(<span class="keyword">sizeof</span>(T)*8-y)));
<a name="l00579"></a>00579 }
<a name="l00580"></a>00580
<a name="l00581"></a>00581 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">inline</span> T rotrFixed(T x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00582"></a>00582 {
<a name="l00583"></a>00583 assert(y < <span class="keyword">sizeof</span>(T)*8);
<a name="l00584"></a>00584 <span class="keywordflow">return</span> T((x>>y) | (x<<(<span class="keyword">sizeof</span>(T)*8-y)));
<a name="l00585"></a>00585 }
<a name="l00586"></a>00586
<a name="l00587"></a>00587 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">inline</span> T rotlVariable(T x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00588"></a>00588 {
<a name="l00589"></a>00589 assert(y < <span class="keyword">sizeof</span>(T)*8);
<a name="l00590"></a>00590 <span class="keywordflow">return</span> T((x<<y) | (x>>(<span class="keyword">sizeof</span>(T)*8-y)));
<a name="l00591"></a>00591 }
<a name="l00592"></a>00592
<a name="l00593"></a>00593 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">inline</span> T rotrVariable(T x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00594"></a>00594 {
<a name="l00595"></a>00595 assert(y < <span class="keyword">sizeof</span>(T)*8);
<a name="l00596"></a>00596 <span class="keywordflow">return</span> T((x>>y) | (x<<(<span class="keyword">sizeof</span>(T)*8-y)));
<a name="l00597"></a>00597 }
<a name="l00598"></a>00598
<a name="l00599"></a>00599 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">inline</span> T rotlMod(T x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00600"></a>00600 {
<a name="l00601"></a>00601 y %= <span class="keyword">sizeof</span>(T)*8;
<a name="l00602"></a>00602 <span class="keywordflow">return</span> T((x<<y) | (x>>(<span class="keyword">sizeof</span>(T)*8-y)));
<a name="l00603"></a>00603 }
<a name="l00604"></a>00604
<a name="l00605"></a>00605 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">inline</span> T rotrMod(T x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00606"></a>00606 {
<a name="l00607"></a>00607 y %= <span class="keyword">sizeof</span>(T)*8;
<a name="l00608"></a>00608 <span class="keywordflow">return</span> T((x>>y) | (x<<(<span class="keyword">sizeof</span>(T)*8-y)));
<a name="l00609"></a>00609 }
<a name="l00610"></a>00610
<a name="l00611"></a>00611 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00612"></a>00612 <span class="preprocessor"></span>
<a name="l00613"></a>00613 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotlFixed<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00614"></a>00614 {
<a name="l00615"></a>00615 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00616"></a>00616 <span class="keywordflow">return</span> y ? _lrotl(x, y) : x;
<a name="l00617"></a>00617 }
<a name="l00618"></a>00618
<a name="l00619"></a>00619 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotrFixed<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00620"></a>00620 {
<a name="l00621"></a>00621 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00622"></a>00622 <span class="keywordflow">return</span> y ? _lrotr(x, y) : x;
<a name="l00623"></a>00623 }
<a name="l00624"></a>00624
<a name="l00625"></a>00625 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotlVariable<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00626"></a>00626 {
<a name="l00627"></a>00627 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00628"></a>00628 <span class="keywordflow">return</span> _lrotl(x, y);
<a name="l00629"></a>00629 }
<a name="l00630"></a>00630
<a name="l00631"></a>00631 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotrVariable<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00632"></a>00632 {
<a name="l00633"></a>00633 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00634"></a>00634 <span class="keywordflow">return</span> _lrotr(x, y);
<a name="l00635"></a>00635 }
<a name="l00636"></a>00636
<a name="l00637"></a>00637 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotlMod<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00638"></a>00638 {
<a name="l00639"></a>00639 <span class="keywordflow">return</span> _lrotl(x, y);
<a name="l00640"></a>00640 }
<a name="l00641"></a>00641
<a name="l00642"></a>00642 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotrMod<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00643"></a>00643 {
<a name="l00644"></a>00644 <span class="keywordflow">return</span> _lrotr(x, y);
<a name="l00645"></a>00645 }
<a name="l00646"></a>00646
<a name="l00647"></a>00647 <span class="preprocessor">#endif // #ifdef _MSC_VER</span>
<a name="l00648"></a>00648 <span class="preprocessor"></span>
<a name="l00649"></a>00649 <span class="preprocessor">#if _MSC_VER >= 1300 && !defined(__INTEL_COMPILER)</span>
<a name="l00650"></a>00650 <span class="preprocessor"></span><span class="comment">// Intel C++ Compiler 10.0 calls a function instead of using the rotate instruction when using these instructions</span>
<a name="l00651"></a>00651
<a name="l00652"></a>00652 <span class="keyword">template</span><> <span class="keyword">inline</span> word64 rotlFixed<word64>(word64 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00653"></a>00653 {
<a name="l00654"></a>00654 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00655"></a>00655 <span class="keywordflow">return</span> y ? _rotl64(x, y) : x;
<a name="l00656"></a>00656 }
<a name="l00657"></a>00657
<a name="l00658"></a>00658 <span class="keyword">template</span><> <span class="keyword">inline</span> word64 rotrFixed<word64>(word64 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00659"></a>00659 {
<a name="l00660"></a>00660 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00661"></a>00661 <span class="keywordflow">return</span> y ? _rotr64(x, y) : x;
<a name="l00662"></a>00662 }
<a name="l00663"></a>00663
<a name="l00664"></a>00664 <span class="keyword">template</span><> <span class="keyword">inline</span> word64 rotlVariable<word64>(word64 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00665"></a>00665 {
<a name="l00666"></a>00666 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00667"></a>00667 <span class="keywordflow">return</span> _rotl64(x, y);
<a name="l00668"></a>00668 }
<a name="l00669"></a>00669
<a name="l00670"></a>00670 <span class="keyword">template</span><> <span class="keyword">inline</span> word64 rotrVariable<word64>(word64 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00671"></a>00671 {
<a name="l00672"></a>00672 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00673"></a>00673 <span class="keywordflow">return</span> _rotr64(x, y);
<a name="l00674"></a>00674 }
<a name="l00675"></a>00675
<a name="l00676"></a>00676 <span class="keyword">template</span><> <span class="keyword">inline</span> word64 rotlMod<word64>(word64 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00677"></a>00677 {
<a name="l00678"></a>00678 <span class="keywordflow">return</span> _rotl64(x, y);
<a name="l00679"></a>00679 }
<a name="l00680"></a>00680
<a name="l00681"></a>00681 <span class="keyword">template</span><> <span class="keyword">inline</span> word64 rotrMod<word64>(word64 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00682"></a>00682 {
<a name="l00683"></a>00683 <span class="keywordflow">return</span> _rotr64(x, y);
<a name="l00684"></a>00684 }
<a name="l00685"></a>00685
<a name="l00686"></a>00686 <span class="preprocessor">#endif // #if _MSC_VER >= 1310</span>
<a name="l00687"></a>00687 <span class="preprocessor"></span>
<a name="l00688"></a>00688 <span class="preprocessor">#if _MSC_VER >= 1400 && !defined(__INTEL_COMPILER)</span>
<a name="l00689"></a>00689 <span class="preprocessor"></span><span class="comment">// Intel C++ Compiler 10.0 gives undefined externals with these</span>
<a name="l00690"></a>00690
<a name="l00691"></a>00691 <span class="keyword">template</span><> <span class="keyword">inline</span> word16 rotlFixed<word16>(word16 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00692"></a>00692 {
<a name="l00693"></a>00693 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00694"></a>00694 <span class="keywordflow">return</span> y ? _rotl16(x, y) : x;
<a name="l00695"></a>00695 }
<a name="l00696"></a>00696
<a name="l00697"></a>00697 <span class="keyword">template</span><> <span class="keyword">inline</span> word16 rotrFixed<word16>(word16 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00698"></a>00698 {
<a name="l00699"></a>00699 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00700"></a>00700 <span class="keywordflow">return</span> y ? _rotr16(x, y) : x;
<a name="l00701"></a>00701 }
<a name="l00702"></a>00702
<a name="l00703"></a>00703 <span class="keyword">template</span><> <span class="keyword">inline</span> word16 rotlVariable<word16>(word16 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00704"></a>00704 {
<a name="l00705"></a>00705 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00706"></a>00706 <span class="keywordflow">return</span> _rotl16(x, y);
<a name="l00707"></a>00707 }
<a name="l00708"></a>00708
<a name="l00709"></a>00709 <span class="keyword">template</span><> <span class="keyword">inline</span> word16 rotrVariable<word16>(word16 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00710"></a>00710 {
<a name="l00711"></a>00711 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00712"></a>00712 <span class="keywordflow">return</span> _rotr16(x, y);
<a name="l00713"></a>00713 }
<a name="l00714"></a>00714
<a name="l00715"></a>00715 <span class="keyword">template</span><> <span class="keyword">inline</span> word16 rotlMod<word16>(word16 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00716"></a>00716 {
<a name="l00717"></a>00717 <span class="keywordflow">return</span> _rotl16(x, y);
<a name="l00718"></a>00718 }
<a name="l00719"></a>00719
<a name="l00720"></a>00720 <span class="keyword">template</span><> <span class="keyword">inline</span> word16 rotrMod<word16>(word16 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00721"></a>00721 {
<a name="l00722"></a>00722 <span class="keywordflow">return</span> _rotr16(x, y);
<a name="l00723"></a>00723 }
<a name="l00724"></a>00724
<a name="l00725"></a>00725 <span class="keyword">template</span><> <span class="keyword">inline</span> byte rotlFixed<byte>(byte x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00726"></a>00726 {
<a name="l00727"></a>00727 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00728"></a>00728 <span class="keywordflow">return</span> y ? _rotl8(x, y) : x;
<a name="l00729"></a>00729 }
<a name="l00730"></a>00730
<a name="l00731"></a>00731 <span class="keyword">template</span><> <span class="keyword">inline</span> byte rotrFixed<byte>(byte x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00732"></a>00732 {
<a name="l00733"></a>00733 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00734"></a>00734 <span class="keywordflow">return</span> y ? _rotr8(x, y) : x;
<a name="l00735"></a>00735 }
<a name="l00736"></a>00736
<a name="l00737"></a>00737 <span class="keyword">template</span><> <span class="keyword">inline</span> byte rotlVariable<byte>(byte x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00738"></a>00738 {
<a name="l00739"></a>00739 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00740"></a>00740 <span class="keywordflow">return</span> _rotl8(x, y);
<a name="l00741"></a>00741 }
<a name="l00742"></a>00742
<a name="l00743"></a>00743 <span class="keyword">template</span><> <span class="keyword">inline</span> byte rotrVariable<byte>(byte x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00744"></a>00744 {
<a name="l00745"></a>00745 assert(y < 8*<span class="keyword">sizeof</span>(x));
<a name="l00746"></a>00746 <span class="keywordflow">return</span> _rotr8(x, y);
<a name="l00747"></a>00747 }
<a name="l00748"></a>00748
<a name="l00749"></a>00749 <span class="keyword">template</span><> <span class="keyword">inline</span> byte rotlMod<byte>(byte x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00750"></a>00750 {
<a name="l00751"></a>00751 <span class="keywordflow">return</span> _rotl8(x, y);
<a name="l00752"></a>00752 }
<a name="l00753"></a>00753
<a name="l00754"></a>00754 <span class="keyword">template</span><> <span class="keyword">inline</span> byte rotrMod<byte>(byte x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00755"></a>00755 {
<a name="l00756"></a>00756 <span class="keywordflow">return</span> _rotr8(x, y);
<a name="l00757"></a>00757 }
<a name="l00758"></a>00758
<a name="l00759"></a>00759 <span class="preprocessor">#endif // #if _MSC_VER >= 1400</span>
<a name="l00760"></a>00760 <span class="preprocessor"></span>
<a name="l00761"></a>00761 <span class="preprocessor">#if (defined(__MWERKS__) && TARGET_CPU_PPC)</span>
<a name="l00762"></a>00762 <span class="preprocessor"></span>
<a name="l00763"></a>00763 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotlFixed<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00764"></a>00764 {
<a name="l00765"></a>00765 assert(y < 32);
<a name="l00766"></a>00766 <span class="keywordflow">return</span> y ? __rlwinm(x,y,0,31) : x;
<a name="l00767"></a>00767 }
<a name="l00768"></a>00768
<a name="l00769"></a>00769 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotrFixed<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00770"></a>00770 {
<a name="l00771"></a>00771 assert(y < 32);
<a name="l00772"></a>00772 <span class="keywordflow">return</span> y ? __rlwinm(x,32-y,0,31) : x;
<a name="l00773"></a>00773 }
<a name="l00774"></a>00774
<a name="l00775"></a>00775 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotlVariable<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00776"></a>00776 {
<a name="l00777"></a>00777 assert(y < 32);
<a name="l00778"></a>00778 <span class="keywordflow">return</span> (__rlwnm(x,y,0,31));
<a name="l00779"></a>00779 }
<a name="l00780"></a>00780
<a name="l00781"></a>00781 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotrVariable<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00782"></a>00782 {
<a name="l00783"></a>00783 assert(y < 32);
<a name="l00784"></a>00784 <span class="keywordflow">return</span> (__rlwnm(x,32-y,0,31));
<a name="l00785"></a>00785 }
<a name="l00786"></a>00786
<a name="l00787"></a>00787 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotlMod<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00788"></a>00788 {
<a name="l00789"></a>00789 <span class="keywordflow">return</span> (__rlwnm(x,y,0,31));
<a name="l00790"></a>00790 }
<a name="l00791"></a>00791
<a name="l00792"></a>00792 <span class="keyword">template</span><> <span class="keyword">inline</span> word32 rotrMod<word32>(word32 x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y)
<a name="l00793"></a>00793 {
<a name="l00794"></a>00794 <span class="keywordflow">return</span> (__rlwnm(x,32-y,0,31));
<a name="l00795"></a>00795 }
<a name="l00796"></a>00796
<a name="l00797"></a>00797 <span class="preprocessor">#endif // #if (defined(__MWERKS__) && TARGET_CPU_PPC)</span>
<a name="l00798"></a>00798 <span class="preprocessor"></span>
<a name="l00799"></a>00799 <span class="comment">// ************** endian reversal ***************</span>
<a name="l00800"></a>00800
<a name="l00801"></a>00801 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00802"></a>00802 <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> GetByte(ByteOrder order, T value, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> index)
<a name="l00803"></a>00803 {
<a name="l00804"></a>00804 <span class="keywordflow">if</span> (order == LITTLE_ENDIAN_ORDER)
<a name="l00805"></a>00805 <span class="keywordflow">return</span> GETBYTE(value, index);
<a name="l00806"></a>00806 <span class="keywordflow">else</span>
<a name="l00807"></a>00807 <span class="keywordflow">return</span> GETBYTE(value, <span class="keyword">sizeof</span>(T)-index-1);
<a name="l00808"></a>00808 }
<a name="l00809"></a>00809
<a name="l00810"></a>00810 <span class="keyword">inline</span> byte ByteReverse(byte value)
<a name="l00811"></a>00811 {
<a name="l00812"></a>00812 <span class="keywordflow">return</span> value;
<a name="l00813"></a>00813 }
<a name="l00814"></a>00814
<a name="l00815"></a>00815 <span class="keyword">inline</span> word16 ByteReverse(word16 value)
<a name="l00816"></a>00816 {
<a name="l00817"></a>00817 <span class="preprocessor">#ifdef CRYPTOPP_BYTESWAP_AVAILABLE</span>
<a name="l00818"></a>00818 <span class="preprocessor"></span> <span class="keywordflow">return</span> bswap_16(value);
<a name="l00819"></a>00819 <span class="preprocessor">#elif defined(_MSC_VER) && _MSC_VER >= 1300</span>
<a name="l00820"></a>00820 <span class="preprocessor"></span> <span class="keywordflow">return</span> _byteswap_ushort(value);
<a name="l00821"></a>00821 <span class="preprocessor">#else</span>
<a name="l00822"></a>00822 <span class="preprocessor"></span> <span class="keywordflow">return</span> rotlFixed(value, 8U);
<a name="l00823"></a>00823 <span class="preprocessor">#endif</span>
<a name="l00824"></a>00824 <span class="preprocessor"></span>}
<a name="l00825"></a>00825
<a name="l00826"></a>00826 <span class="keyword">inline</span> word32 ByteReverse(word32 value)
<a name="l00827"></a>00827 {
<a name="l00828"></a>00828 <span class="preprocessor">#if defined(__GNUC__) && defined(CRYPTOPP_X86_ASM_AVAILABLE)</span>
<a name="l00829"></a>00829 <span class="preprocessor"></span> __asm__ (<span class="stringliteral">"bswap %0"</span> : <span class="stringliteral">"=r"</span> (value) : <span class="stringliteral">"0"</span> (value));
<a name="l00830"></a>00830 <span class="keywordflow">return</span> value;
<a name="l00831"></a>00831 <span class="preprocessor">#elif defined(CRYPTOPP_BYTESWAP_AVAILABLE)</span>
<a name="l00832"></a>00832 <span class="preprocessor"></span> <span class="keywordflow">return</span> bswap_32(value);
<a name="l00833"></a>00833 <span class="preprocessor">#elif defined(__MWERKS__) && TARGET_CPU_PPC</span>
<a name="l00834"></a>00834 <span class="preprocessor"></span> <span class="keywordflow">return</span> (word32)__lwbrx(&value,0);
<a name="l00835"></a>00835 <span class="preprocessor">#elif _MSC_VER >= 1400 || (_MSC_VER >= 1300 && !defined(_DLL))</span>
<a name="l00836"></a>00836 <span class="preprocessor"></span> <span class="keywordflow">return</span> _byteswap_ulong(value);
<a name="l00837"></a>00837 <span class="preprocessor">#elif CRYPTOPP_FAST_ROTATE(32)</span>
<a name="l00838"></a>00838 <span class="preprocessor"></span> <span class="comment">// 5 instructions with rotate instruction, 9 without</span>
<a name="l00839"></a>00839 <span class="keywordflow">return</span> (rotrFixed(value, 8U) & 0xff00ff00) | (rotlFixed(value, 8U) & 0x00ff00ff);
<a name="l00840"></a>00840 <span class="preprocessor">#else</span>
<a name="l00841"></a>00841 <span class="preprocessor"></span> <span class="comment">// 6 instructions with rotate instruction, 8 without</span>
<a name="l00842"></a>00842 value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8);
<a name="l00843"></a>00843 <span class="keywordflow">return</span> rotlFixed(value, 16U);
<a name="l00844"></a>00844 <span class="preprocessor">#endif</span>
<a name="l00845"></a>00845 <span class="preprocessor"></span>}
<a name="l00846"></a>00846
<a name="l00847"></a>00847 <span class="keyword">inline</span> word64 ByteReverse(word64 value)
<a name="l00848"></a>00848 {
<a name="l00849"></a>00849 <span class="preprocessor">#if defined(__GNUC__) && defined(CRYPTOPP_X86_ASM_AVAILABLE) && defined(__x86_64__)</span>
<a name="l00850"></a>00850 <span class="preprocessor"></span> __asm__ (<span class="stringliteral">"bswap %0"</span> : <span class="stringliteral">"=r"</span> (value) : <span class="stringliteral">"0"</span> (value));
<a name="l00851"></a>00851 <span class="keywordflow">return</span> value;
<a name="l00852"></a>00852 <span class="preprocessor">#elif defined(CRYPTOPP_BYTESWAP_AVAILABLE)</span>
<a name="l00853"></a>00853 <span class="preprocessor"></span> <span class="keywordflow">return</span> bswap_64(value);
<a name="l00854"></a>00854 <span class="preprocessor">#elif defined(_MSC_VER) && _MSC_VER >= 1300</span>
<a name="l00855"></a>00855 <span class="preprocessor"></span> <span class="keywordflow">return</span> _byteswap_uint64(value);
<a name="l00856"></a>00856 <span class="preprocessor">#elif CRYPTOPP_BOOL_SLOW_WORD64</span>
<a name="l00857"></a>00857 <span class="preprocessor"></span> <span class="keywordflow">return</span> (word64(ByteReverse(word32(value))) << 32) | ByteReverse(word32(value>>32));
<a name="l00858"></a>00858 <span class="preprocessor">#else</span>
<a name="l00859"></a>00859 <span class="preprocessor"></span> value = ((value & W64LIT(0xFF00FF00FF00FF00)) >> 8) | ((value & W64LIT(0x00FF00FF00FF00FF)) << 8);
<a name="l00860"></a>00860 value = ((value & W64LIT(0xFFFF0000FFFF0000)) >> 16) | ((value & W64LIT(0x0000FFFF0000FFFF)) << 16);
<a name="l00861"></a>00861 <span class="keywordflow">return</span> rotlFixed(value, 32U);
<a name="l00862"></a>00862 <span class="preprocessor">#endif</span>
<a name="l00863"></a>00863 <span class="preprocessor"></span>}
<a name="l00864"></a>00864
<a name="l00865"></a>00865 <span class="keyword">inline</span> byte BitReverse(byte value)
<a name="l00866"></a>00866 {
<a name="l00867"></a>00867 value = ((value & 0xAA) >> 1) | ((value & 0x55) << 1);
<a name="l00868"></a>00868 value = ((value & 0xCC) >> 2) | ((value & 0x33) << 2);
<a name="l00869"></a>00869 <span class="keywordflow">return</span> rotlFixed(value, 4U);
<a name="l00870"></a>00870 }
<a name="l00871"></a>00871
<a name="l00872"></a>00872 <span class="keyword">inline</span> word16 BitReverse(word16 value)
<a name="l00873"></a>00873 {
<a name="l00874"></a>00874 value = ((value & 0xAAAA) >> 1) | ((value & 0x5555) << 1);
<a name="l00875"></a>00875 value = ((value & 0xCCCC) >> 2) | ((value & 0x3333) << 2);
<a name="l00876"></a>00876 value = ((value & 0xF0F0) >> 4) | ((value & 0x0F0F) << 4);
<a name="l00877"></a>00877 <span class="keywordflow">return</span> ByteReverse(value);
<a name="l00878"></a>00878 }
<a name="l00879"></a>00879
<a name="l00880"></a>00880 <span class="keyword">inline</span> word32 BitReverse(word32 value)
<a name="l00881"></a>00881 {
<a name="l00882"></a>00882 value = ((value & 0xAAAAAAAA) >> 1) | ((value & 0x55555555) << 1);
<a name="l00883"></a>00883 value = ((value & 0xCCCCCCCC) >> 2) | ((value & 0x33333333) << 2);
<a name="l00884"></a>00884 value = ((value & 0xF0F0F0F0) >> 4) | ((value & 0x0F0F0F0F) << 4);
<a name="l00885"></a>00885 <span class="keywordflow">return</span> ByteReverse(value);
<a name="l00886"></a>00886 }
<a name="l00887"></a>00887
<a name="l00888"></a>00888 <span class="keyword">inline</span> word64 BitReverse(word64 value)
<a name="l00889"></a>00889 {
<a name="l00890"></a>00890 <span class="preprocessor">#if CRYPTOPP_BOOL_SLOW_WORD64</span>
<a name="l00891"></a>00891 <span class="preprocessor"></span> <span class="keywordflow">return</span> (word64(BitReverse(word32(value))) << 32) | BitReverse(word32(value>>32));
<a name="l00892"></a>00892 <span class="preprocessor">#else</span>
<a name="l00893"></a>00893 <span class="preprocessor"></span> value = ((value & W64LIT(0xAAAAAAAAAAAAAAAA)) >> 1) | ((value & W64LIT(0x5555555555555555)) << 1);
<a name="l00894"></a>00894 value = ((value & W64LIT(0xCCCCCCCCCCCCCCCC)) >> 2) | ((value & W64LIT(0x3333333333333333)) << 2);
<a name="l00895"></a>00895 value = ((value & W64LIT(0xF0F0F0F0F0F0F0F0)) >> 4) | ((value & W64LIT(0x0F0F0F0F0F0F0F0F)) << 4);
<a name="l00896"></a>00896 <span class="keywordflow">return</span> ByteReverse(value);
<a name="l00897"></a>00897 <span class="preprocessor">#endif</span>
<a name="l00898"></a>00898 <span class="preprocessor"></span>}
<a name="l00899"></a>00899
<a name="l00900"></a>00900 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00901"></a>00901 <span class="keyword">inline</span> T BitReverse(T value)
<a name="l00902"></a>00902 {
<a name="l00903"></a>00903 <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T) == 1)
<a name="l00904"></a>00904 <span class="keywordflow">return</span> (T)BitReverse((byte)value);
<a name="l00905"></a>00905 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T) == 2)
<a name="l00906"></a>00906 <span class="keywordflow">return</span> (T)BitReverse((word16)value);
<a name="l00907"></a>00907 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(T) == 4)
<a name="l00908"></a>00908 <span class="keywordflow">return</span> (T)BitReverse((word32)value);
<a name="l00909"></a>00909 <span class="keywordflow">else</span>
<a name="l00910"></a>00910 {
<a name="l00911"></a>00911 assert(<span class="keyword">sizeof</span>(T) == 8);
<a name="l00912"></a>00912 <span class="keywordflow">return</span> (T)BitReverse((word64)value);
<a name="l00913"></a>00913 }
<a name="l00914"></a>00914 }
<a name="l00915"></a>00915
<a name="l00916"></a>00916 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00917"></a>00917 <span class="keyword">inline</span> T ConditionalByteReverse(ByteOrder order, T value)
<a name="l00918"></a>00918 {
<a name="l00919"></a>00919 <span class="keywordflow">return</span> NativeByteOrderIs(order) ? value : ByteReverse(value);
<a name="l00920"></a>00920 }
<a name="l00921"></a>00921
<a name="l00922"></a>00922 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00923"></a>00923 <span class="keywordtype">void</span> ByteReverse(T *out, <span class="keyword">const</span> T *in, <span class="keywordtype">size_t</span> byteCount)
<a name="l00924"></a>00924 {
<a name="l00925"></a>00925 assert(byteCount % <span class="keyword">sizeof</span>(T) == 0);
<a name="l00926"></a>00926 <span class="keywordtype">size_t</span> count = byteCount/<span class="keyword">sizeof</span>(T);
<a name="l00927"></a>00927 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<count; i++)
<a name="l00928"></a>00928 out[i] = ByteReverse(in[i]);
<a name="l00929"></a>00929 }
<a name="l00930"></a>00930
<a name="l00931"></a>00931 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00932"></a>00932 <span class="keyword">inline</span> <span class="keywordtype">void</span> ConditionalByteReverse(ByteOrder order, T *out, <span class="keyword">const</span> T *in, <span class="keywordtype">size_t</span> byteCount)
<a name="l00933"></a>00933 {
<a name="l00934"></a>00934 <span class="keywordflow">if</span> (!NativeByteOrderIs(order))
<a name="l00935"></a>00935 ByteReverse(out, in, byteCount);
<a name="l00936"></a>00936 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (in != out)
<a name="l00937"></a>00937 memcpy_s(out, byteCount, in, byteCount);
<a name="l00938"></a>00938 }
<a name="l00939"></a>00939
<a name="l00940"></a>00940 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00941"></a>00941 <span class="keyword">inline</span> <span class="keywordtype">void</span> GetUserKey(ByteOrder order, T *out, <span class="keywordtype">size_t</span> outlen, <span class="keyword">const</span> byte *in, <span class="keywordtype">size_t</span> inlen)
<a name="l00942"></a>00942 {
<a name="l00943"></a>00943 <span class="keyword">const</span> <span class="keywordtype">size_t</span> U = <span class="keyword">sizeof</span>(T);
<a name="l00944"></a>00944 assert(inlen <= outlen*U);
<a name="l00945"></a>00945 memcpy_s(out, outlen*U, in, inlen);
<a name="l00946"></a>00946 memset_z((byte *)out+inlen, 0, outlen*U-inlen);
<a name="l00947"></a>00947 ConditionalByteReverse(order, out, out, RoundUpToMultipleOf(inlen, U));
<a name="l00948"></a>00948 }
<a name="l00949"></a>00949
<a name="l00950"></a>00950 <span class="preprocessor">#ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS</span>
<a name="l00951"></a>00951 <span class="preprocessor"></span><span class="keyword">inline</span> byte UnalignedGetWordNonTemplate(ByteOrder order, <span class="keyword">const</span> byte *block, <span class="keyword">const</span> byte *)
<a name="l00952"></a>00952 {
<a name="l00953"></a>00953 <span class="keywordflow">return</span> block[0];
<a name="l00954"></a>00954 }
<a name="l00955"></a>00955
<a name="l00956"></a>00956 <span class="keyword">inline</span> word16 UnalignedGetWordNonTemplate(ByteOrder order, <span class="keyword">const</span> byte *block, <span class="keyword">const</span> word16 *)
<a name="l00957"></a>00957 {
<a name="l00958"></a>00958 <span class="keywordflow">return</span> (order == BIG_ENDIAN_ORDER)
<a name="l00959"></a>00959 ? block[1] | (block[0] << 8)
<a name="l00960"></a>00960 : block[0] | (block[1] << 8);
<a name="l00961"></a>00961 }
<a name="l00962"></a>00962
<a name="l00963"></a>00963 <span class="keyword">inline</span> word32 UnalignedGetWordNonTemplate(ByteOrder order, <span class="keyword">const</span> byte *block, <span class="keyword">const</span> word32 *)
<a name="l00964"></a>00964 {
<a name="l00965"></a>00965 <span class="keywordflow">return</span> (order == BIG_ENDIAN_ORDER)
<a name="l00966"></a>00966 ? word32(block[3]) | (word32(block[2]) << 8) | (word32(block[1]) << 16) | (word32(block[0]) << 24)
<a name="l00967"></a>00967 : word32(block[0]) | (word32(block[1]) << 8) | (word32(block[2]) << 16) | (word32(block[3]) << 24);
<a name="l00968"></a>00968 }
<a name="l00969"></a>00969
<a name="l00970"></a>00970 <span class="keyword">inline</span> word64 UnalignedGetWordNonTemplate(ByteOrder order, <span class="keyword">const</span> byte *block, <span class="keyword">const</span> word64 *)
<a name="l00971"></a>00971 {
<a name="l00972"></a>00972 <span class="keywordflow">return</span> (order == BIG_ENDIAN_ORDER)
<a name="l00973"></a>00973 ?
<a name="l00974"></a>00974 (word64(block[7]) |
<a name="l00975"></a>00975 (word64(block[6]) << 8) |
<a name="l00976"></a>00976 (word64(block[5]) << 16) |
<a name="l00977"></a>00977 (word64(block[4]) << 24) |
<a name="l00978"></a>00978 (word64(block[3]) << 32) |
<a name="l00979"></a>00979 (word64(block[2]) << 40) |
<a name="l00980"></a>00980 (word64(block[1]) << 48) |
<a name="l00981"></a>00981 (word64(block[0]) << 56))
<a name="l00982"></a>00982 :
<a name="l00983"></a>00983 (word64(block[0]) |
<a name="l00984"></a>00984 (word64(block[1]) << 8) |
<a name="l00985"></a>00985 (word64(block[2]) << 16) |
<a name="l00986"></a>00986 (word64(block[3]) << 24) |
<a name="l00987"></a>00987 (word64(block[4]) << 32) |
<a name="l00988"></a>00988 (word64(block[5]) << 40) |
<a name="l00989"></a>00989 (word64(block[6]) << 48) |
<a name="l00990"></a>00990 (word64(block[7]) << 56));
<a name="l00991"></a>00991 }
<a name="l00992"></a>00992
<a name="l00993"></a>00993 <span class="keyword">inline</span> <span class="keywordtype">void</span> UnalignedPutWordNonTemplate(ByteOrder order, byte *block, byte value, <span class="keyword">const</span> byte *xorBlock)
<a name="l00994"></a>00994 {
<a name="l00995"></a>00995 block[0] = xorBlock ? (value ^ xorBlock[0]) : value;
<a name="l00996"></a>00996 }
<a name="l00997"></a>00997
<a name="l00998"></a>00998 <span class="keyword">inline</span> <span class="keywordtype">void</span> UnalignedPutWordNonTemplate(ByteOrder order, byte *block, word16 value, <span class="keyword">const</span> byte *xorBlock)
<a name="l00999"></a>00999 {
<a name="l01000"></a>01000 <span class="keywordflow">if</span> (order == BIG_ENDIAN_ORDER)
<a name="l01001"></a>01001 {
<a name="l01002"></a>01002 <span class="keywordflow">if</span> (xorBlock)
<a name="l01003"></a>01003 {
<a name="l01004"></a>01004 block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01005"></a>01005 block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01006"></a>01006 }
<a name="l01007"></a>01007 <span class="keywordflow">else</span>
<a name="l01008"></a>01008 {
<a name="l01009"></a>01009 block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01010"></a>01010 block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01011"></a>01011 }
<a name="l01012"></a>01012 }
<a name="l01013"></a>01013 <span class="keywordflow">else</span>
<a name="l01014"></a>01014 {
<a name="l01015"></a>01015 <span class="keywordflow">if</span> (xorBlock)
<a name="l01016"></a>01016 {
<a name="l01017"></a>01017 block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01018"></a>01018 block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01019"></a>01019 }
<a name="l01020"></a>01020 <span class="keywordflow">else</span>
<a name="l01021"></a>01021 {
<a name="l01022"></a>01022 block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01023"></a>01023 block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01024"></a>01024 }
<a name="l01025"></a>01025 }
<a name="l01026"></a>01026 }
<a name="l01027"></a>01027
<a name="l01028"></a>01028 <span class="keyword">inline</span> <span class="keywordtype">void</span> UnalignedPutWordNonTemplate(ByteOrder order, byte *block, word32 value, <span class="keyword">const</span> byte *xorBlock)
<a name="l01029"></a>01029 {
<a name="l01030"></a>01030 <span class="keywordflow">if</span> (order == BIG_ENDIAN_ORDER)
<a name="l01031"></a>01031 {
<a name="l01032"></a>01032 <span class="keywordflow">if</span> (xorBlock)
<a name="l01033"></a>01033 {
<a name="l01034"></a>01034 block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01035"></a>01035 block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01036"></a>01036 block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01037"></a>01037 block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01038"></a>01038 }
<a name="l01039"></a>01039 <span class="keywordflow">else</span>
<a name="l01040"></a>01040 {
<a name="l01041"></a>01041 block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01042"></a>01042 block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01043"></a>01043 block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01044"></a>01044 block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01045"></a>01045 }
<a name="l01046"></a>01046 }
<a name="l01047"></a>01047 <span class="keywordflow">else</span>
<a name="l01048"></a>01048 {
<a name="l01049"></a>01049 <span class="keywordflow">if</span> (xorBlock)
<a name="l01050"></a>01050 {
<a name="l01051"></a>01051 block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01052"></a>01052 block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01053"></a>01053 block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01054"></a>01054 block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01055"></a>01055 }
<a name="l01056"></a>01056 <span class="keywordflow">else</span>
<a name="l01057"></a>01057 {
<a name="l01058"></a>01058 block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01059"></a>01059 block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01060"></a>01060 block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01061"></a>01061 block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01062"></a>01062 }
<a name="l01063"></a>01063 }
<a name="l01064"></a>01064 }
<a name="l01065"></a>01065
<a name="l01066"></a>01066 <span class="keyword">inline</span> <span class="keywordtype">void</span> UnalignedPutWordNonTemplate(ByteOrder order, byte *block, word64 value, <span class="keyword">const</span> byte *xorBlock)
<a name="l01067"></a>01067 {
<a name="l01068"></a>01068 <span class="keywordflow">if</span> (order == BIG_ENDIAN_ORDER)
<a name="l01069"></a>01069 {
<a name="l01070"></a>01070 <span class="keywordflow">if</span> (xorBlock)
<a name="l01071"></a>01071 {
<a name="l01072"></a>01072 block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 7);
<a name="l01073"></a>01073 block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 6);
<a name="l01074"></a>01074 block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 5);
<a name="l01075"></a>01075 block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 4);
<a name="l01076"></a>01076 block[4] = xorBlock[4] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01077"></a>01077 block[5] = xorBlock[5] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01078"></a>01078 block[6] = xorBlock[6] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01079"></a>01079 block[7] = xorBlock[7] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01080"></a>01080 }
<a name="l01081"></a>01081 <span class="keywordflow">else</span>
<a name="l01082"></a>01082 {
<a name="l01083"></a>01083 block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 7);
<a name="l01084"></a>01084 block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 6);
<a name="l01085"></a>01085 block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 5);
<a name="l01086"></a>01086 block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 4);
<a name="l01087"></a>01087 block[4] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01088"></a>01088 block[5] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01089"></a>01089 block[6] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01090"></a>01090 block[7] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01091"></a>01091 }
<a name="l01092"></a>01092 }
<a name="l01093"></a>01093 <span class="keywordflow">else</span>
<a name="l01094"></a>01094 {
<a name="l01095"></a>01095 <span class="keywordflow">if</span> (xorBlock)
<a name="l01096"></a>01096 {
<a name="l01097"></a>01097 block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01098"></a>01098 block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01099"></a>01099 block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01100"></a>01100 block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01101"></a>01101 block[4] = xorBlock[4] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 4);
<a name="l01102"></a>01102 block[5] = xorBlock[5] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 5);
<a name="l01103"></a>01103 block[6] = xorBlock[6] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 6);
<a name="l01104"></a>01104 block[7] = xorBlock[7] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 7);
<a name="l01105"></a>01105 }
<a name="l01106"></a>01106 <span class="keywordflow">else</span>
<a name="l01107"></a>01107 {
<a name="l01108"></a>01108 block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0);
<a name="l01109"></a>01109 block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1);
<a name="l01110"></a>01110 block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2);
<a name="l01111"></a>01111 block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3);
<a name="l01112"></a>01112 block[4] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 4);
<a name="l01113"></a>01113 block[5] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 5);
<a name="l01114"></a>01114 block[6] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 6);
<a name="l01115"></a>01115 block[7] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 7);
<a name="l01116"></a>01116 }
<a name="l01117"></a>01117 }
<a name="l01118"></a>01118 }
<a name="l01119"></a>01119 <span class="preprocessor">#endif // #ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS</span>
<a name="l01120"></a>01120 <span class="preprocessor"></span>
<a name="l01121"></a>01121 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01122"></a>01122 <span class="keyword">inline</span> T GetWord(<span class="keywordtype">bool</span> assumeAligned, ByteOrder order, <span class="keyword">const</span> byte *block)
<a name="l01123"></a>01123 {
<a name="l01124"></a>01124 <span class="preprocessor">#ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS</span>
<a name="l01125"></a>01125 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!assumeAligned)
<a name="l01126"></a>01126 <span class="keywordflow">return</span> UnalignedGetWordNonTemplate(order, block, (T*)NULL);
<a name="l01127"></a>01127 assert(IsAligned<T>(block));
<a name="l01128"></a>01128 <span class="preprocessor">#endif</span>
<a name="l01129"></a>01129 <span class="preprocessor"></span> <span class="keywordflow">return</span> ConditionalByteReverse(order, *reinterpret_cast<const T *>(block));
<a name="l01130"></a>01130 }
<a name="l01131"></a>01131
<a name="l01132"></a>01132 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01133"></a>01133 <span class="keyword">inline</span> <span class="keywordtype">void</span> GetWord(<span class="keywordtype">bool</span> assumeAligned, ByteOrder order, T &result, <span class="keyword">const</span> byte *block)
<a name="l01134"></a>01134 {
<a name="l01135"></a>01135 result = GetWord<T>(assumeAligned, order, block);
<a name="l01136"></a>01136 }
<a name="l01137"></a>01137
<a name="l01138"></a>01138 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01139"></a>01139 <span class="keyword">inline</span> <span class="keywordtype">void</span> PutWord(<span class="keywordtype">bool</span> assumeAligned, ByteOrder order, byte *block, T value, <span class="keyword">const</span> byte *xorBlock = NULL)
<a name="l01140"></a>01140 {
<a name="l01141"></a>01141 <span class="preprocessor">#ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS</span>
<a name="l01142"></a>01142 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!assumeAligned)
<a name="l01143"></a>01143 <span class="keywordflow">return</span> UnalignedPutWordNonTemplate(order, block, value, xorBlock);
<a name="l01144"></a>01144 assert(IsAligned<T>(block));
<a name="l01145"></a>01145 assert(IsAligned<T>(xorBlock));
<a name="l01146"></a>01146 <span class="preprocessor">#endif</span>
<a name="l01147"></a>01147 <span class="preprocessor"></span> *<span class="keyword">reinterpret_cast<</span>T *<span class="keyword">></span>(block) = ConditionalByteReverse(order, value) ^ (xorBlock ? *<span class="keyword">reinterpret_cast<</span><span class="keyword">const </span>T *<span class="keyword">></span>(xorBlock) : 0);
<a name="l01148"></a>01148 }
<a name="l01149"></a>01149
<a name="l01150"></a>01150 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> B, <span class="keywordtype">bool</span> A=false>
<a name="l01151"></a><a class="code" href="class_get_block.html">01151</a> <span class="keyword">class </span><a class="code" href="class_get_block.html">GetBlock</a>
<a name="l01152"></a>01152 {
<a name="l01153"></a>01153 <span class="keyword">public</span>:
<a name="l01154"></a>01154 <a class="code" href="class_get_block.html">GetBlock</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *block)
<a name="l01155"></a>01155 : m_block((<span class="keyword">const</span> byte *)block) {}
<a name="l01156"></a>01156
<a name="l01157"></a>01157 <span class="keyword">template</span> <<span class="keyword">class</span> U>
<a name="l01158"></a>01158 <span class="keyword">inline</span> <a class="code" href="class_get_block.html">GetBlock<T, B, A></a> & operator()(U &x)
<a name="l01159"></a>01159 {
<a name="l01160"></a>01160 CRYPTOPP_COMPILE_ASSERT(<span class="keyword">sizeof</span>(U) >= <span class="keyword">sizeof</span>(T));
<a name="l01161"></a>01161 x = GetWord<T>(A, B::ToEnum(), m_block);
<a name="l01162"></a>01162 m_block += <span class="keyword">sizeof</span>(T);
<a name="l01163"></a>01163 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01164"></a>01164 }
<a name="l01165"></a>01165
<a name="l01166"></a>01166 <span class="keyword">private</span>:
<a name="l01167"></a>01167 <span class="keyword">const</span> byte *m_block;
<a name="l01168"></a>01168 };
<a name="l01169"></a>01169
<a name="l01170"></a>01170 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> B, <span class="keywordtype">bool</span> A=false>
<a name="l01171"></a><a class="code" href="class_put_block.html">01171</a> <span class="keyword">class </span><a class="code" href="class_put_block.html">PutBlock</a>
<a name="l01172"></a>01172 {
<a name="l01173"></a>01173 <span class="keyword">public</span>:
<a name="l01174"></a>01174 <a class="code" href="class_put_block.html">PutBlock</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *xorBlock, <span class="keywordtype">void</span> *block)
<a name="l01175"></a>01175 : m_xorBlock((<span class="keyword">const</span> byte *)xorBlock), m_block((byte *)block) {}
<a name="l01176"></a>01176
<a name="l01177"></a>01177 <span class="keyword">template</span> <<span class="keyword">class</span> U>
<a name="l01178"></a>01178 <span class="keyword">inline</span> <a class="code" href="class_put_block.html">PutBlock<T, B, A></a> & operator()(U x)
<a name="l01179"></a>01179 {
<a name="l01180"></a>01180 PutWord(A, B::ToEnum(), m_block, (T)x, m_xorBlock);
<a name="l01181"></a>01181 m_block += <span class="keyword">sizeof</span>(T);
<a name="l01182"></a>01182 <span class="keywordflow">if</span> (m_xorBlock)
<a name="l01183"></a>01183 m_xorBlock += <span class="keyword">sizeof</span>(T);
<a name="l01184"></a>01184 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01185"></a>01185 }
<a name="l01186"></a>01186
<a name="l01187"></a>01187 <span class="keyword">private</span>:
<a name="l01188"></a>01188 <span class="keyword">const</span> byte *m_xorBlock;
<a name="l01189"></a>01189 byte *m_block;
<a name="l01190"></a>01190 };
<a name="l01191"></a>01191
<a name="l01192"></a>01192 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> B, <span class="keywordtype">bool</span> GA=false, <span class="keywordtype">bool</span> PA=false>
<a name="l01193"></a><a class="code" href="struct_block_get_and_put.html">01193</a> <span class="keyword">struct </span><a class="code" href="struct_block_get_and_put.html">BlockGetAndPut</a>
<a name="l01194"></a>01194 {
<a name="l01195"></a>01195 <span class="comment">// function needed because of C++ grammatical ambiguity between expression-statements and declarations</span>
<a name="l01196"></a>01196 <span class="keyword">static</span> <span class="keyword">inline</span> <a class="code" href="class_get_block.html">GetBlock<T, B, GA></a> Get(<span class="keyword">const</span> <span class="keywordtype">void</span> *block) {<span class="keywordflow">return</span> <a class="code" href="class_get_block.html">GetBlock<T, B, GA></a>(block);}
<a name="l01197"></a>01197 <span class="keyword">typedef</span> <a class="code" href="class_put_block.html">PutBlock<T, B, PA></a> <a class="code" href="class_put_block.html">Put</a>;
<a name="l01198"></a>01198 };
<a name="l01199"></a>01199
<a name="l01200"></a>01200 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01201"></a>01201 std::string WordToString(T value, ByteOrder order = BIG_ENDIAN_ORDER)
<a name="l01202"></a>01202 {
<a name="l01203"></a>01203 <span class="keywordflow">if</span> (!NativeByteOrderIs(order))
<a name="l01204"></a>01204 value = ByteReverse(value);
<a name="l01205"></a>01205
<a name="l01206"></a>01206 <span class="keywordflow">return</span> std::string((<span class="keywordtype">char</span> *)&value, <span class="keyword">sizeof</span>(value));
<a name="l01207"></a>01207 }
<a name="l01208"></a>01208
<a name="l01209"></a>01209 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01210"></a>01210 T StringToWord(<span class="keyword">const</span> std::string &str, ByteOrder order = BIG_ENDIAN_ORDER)
<a name="l01211"></a>01211 {
<a name="l01212"></a>01212 T value = 0;
<a name="l01213"></a>01213 memcpy_s(&value, <span class="keyword">sizeof</span>(value), str.data(), UnsignedMin(str.size(), <span class="keyword">sizeof</span>(value)));
<a name="l01214"></a>01214 <span class="keywordflow">return</span> NativeByteOrderIs(order) ? value : ByteReverse(value);
<a name="l01215"></a>01215 }
<a name="l01216"></a>01216
<a name="l01217"></a>01217 <span class="comment">// ************** help remove warning on g++ ***************</span>
<a name="l01218"></a>01218
<a name="l01219"></a>01219 <span class="keyword">template</span> <<span class="keywordtype">bool</span> overflow> <span class="keyword">struct </span>SafeShifter;
<a name="l01220"></a>01220
<a name="l01221"></a><a class="code" href="struct_safe_shifter_3_01true_01_4.html">01221</a> <span class="keyword">template</span><> <span class="keyword">struct </span>SafeShifter<true>
<a name="l01222"></a>01222 {
<a name="l01223"></a>01223 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01224"></a>01224 <span class="keyword">static</span> <span class="keyword">inline</span> T RightShift(T value, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bits)
<a name="l01225"></a>01225 {
<a name="l01226"></a>01226 <span class="keywordflow">return</span> 0;
<a name="l01227"></a>01227 }
<a name="l01228"></a>01228
<a name="l01229"></a>01229 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01230"></a>01230 <span class="keyword">static</span> <span class="keyword">inline</span> T LeftShift(T value, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bits)
<a name="l01231"></a>01231 {
<a name="l01232"></a>01232 <span class="keywordflow">return</span> 0;
<a name="l01233"></a>01233 }
<a name="l01234"></a>01234 };
<a name="l01235"></a>01235
<a name="l01236"></a><a class="code" href="struct_safe_shifter_3_01false_01_4.html">01236</a> <span class="keyword">template</span><> <span class="keyword">struct </span>SafeShifter<false>
<a name="l01237"></a>01237 {
<a name="l01238"></a>01238 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01239"></a>01239 <span class="keyword">static</span> <span class="keyword">inline</span> T RightShift(T value, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bits)
<a name="l01240"></a>01240 {
<a name="l01241"></a>01241 <span class="keywordflow">return</span> value >> bits;
<a name="l01242"></a>01242 }
<a name="l01243"></a>01243
<a name="l01244"></a>01244 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l01245"></a>01245 <span class="keyword">static</span> <span class="keyword">inline</span> T LeftShift(T value, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bits)
<a name="l01246"></a>01246 {
<a name="l01247"></a>01247 <span class="keywordflow">return</span> value << bits;
<a name="l01248"></a>01248 }
<a name="l01249"></a>01249 };
<a name="l01250"></a>01250
<a name="l01251"></a>01251 <span class="keyword">template</span> <<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bits, <span class="keyword">class</span> T>
<a name="l01252"></a>01252 <span class="keyword">inline</span> T SafeRightShift(T value)
<a name="l01253"></a>01253 {
<a name="l01254"></a>01254 <span class="keywordflow">return</span> SafeShifter<(bits>=(8*<span class="keyword">sizeof</span>(T)))>::RightShift(value, bits);
<a name="l01255"></a>01255 }
<a name="l01256"></a>01256
<a name="l01257"></a>01257 <span class="keyword">template</span> <<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bits, <span class="keyword">class</span> T>
<a name="l01258"></a>01258 <span class="keyword">inline</span> T SafeLeftShift(T value)
<a name="l01259"></a>01259 {
<a name="l01260"></a>01260 <span class="keywordflow">return</span> SafeShifter<(bits>=(8*<span class="keyword">sizeof</span>(T)))>::LeftShift(value, bits);
<a name="l01261"></a>01261 }
<a name="l01262"></a>01262
<a name="l01263"></a>01263 <span class="comment">// ************** use one buffer for multiple data members ***************</span>
<a name="l01264"></a>01264
<a name="l01265"></a>01265 <span class="preprocessor">#define CRYPTOPP_BLOCK_1(n, t, s) t* m_##n() {return (t *)(m_aggregate+0);} size_t SS1() {return sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01266"></a>01266 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCK_2(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS1());} size_t SS2() {return SS1()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01267"></a>01267 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCK_3(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS2());} size_t SS3() {return SS2()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01268"></a>01268 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCK_4(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS3());} size_t SS4() {return SS3()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01269"></a>01269 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCK_5(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS4());} size_t SS5() {return SS4()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01270"></a>01270 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCK_6(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS5());} size_t SS6() {return SS5()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01271"></a>01271 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCK_7(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS6());} size_t SS7() {return SS6()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01272"></a>01272 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCK_8(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS7());} size_t SS8() {return SS7()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);}</span>
<a name="l01273"></a>01273 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_BLOCKS_END(i) size_t SST() {return SS##i();} void AllocateBlocks() {m_aggregate.New(SST());} AlignedSecByteBlock m_aggregate;</span>
<a name="l01274"></a>01274 <span class="preprocessor"></span>
<a name="l01275"></a>01275 NAMESPACE_END
<a name="l01276"></a>01276
<a name="l01277"></a>01277 <span class="preprocessor">#endif</span>
</pre></div></div>
<hr size="1"/><address style="text-align: right;"><small>Generated on 9 Dec 2009 for Crypto++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
</body>
</html>
distrib
>
Fedora
>
13
>
i386
>
media
>
os
>
by-pkgid
>
07dfcfe50d66c9a48a3c5e6c1693f12a
>
files
>
1839
