📄 integer_8cpp-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: integer.cpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="namespaces.html"><span>Namespaces</span></a></li> <li><a href="classes.html"><span>Classes</span></a></li> <li class="current"><a href="files.html"><span>Files</span></a></li> </ul></div><div class="tabs"> <ul> <li><a href="files.html"><span>File List</span></a></li> <li><a href="globals.html"><span>File Members</span></a></li> </ul></div><h1>integer.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// integer.cpp - written and placed in the public domain by Wei Dai</span><a name="l00002"></a>00002 <span class="comment">// contains public domain code contributed by Alister Lee and Leonard Janke</span><a name="l00003"></a>00003 <a name="l00004"></a>00004 <span class="preprocessor">#include "pch.h"</span><a name="l00005"></a>00005 <a name="l00006"></a>00006 <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span><a name="l00007"></a>00007 <span class="preprocessor"></span><a name="l00008"></a>00008 <span class="preprocessor">#include "<a class="code" href="integer_8h.html">integer.h</a>"</span><a name="l00009"></a>00009 <span class="preprocessor">#include "modarith.h"</span><a name="l00010"></a>00010 <span class="preprocessor">#include "nbtheory.h"</span><a name="l00011"></a>00011 <span class="preprocessor">#include "asn.h"</span><a name="l00012"></a>00012 <span class="preprocessor">#include "oids.h"</span><a name="l00013"></a>00013 <span class="preprocessor">#include "words.h"</span><a name="l00014"></a>00014 <span class="preprocessor">#include "algparam.h"</span><a name="l00015"></a>00015 <span class="preprocessor">#include "<a class="code" href="pubkey_8h.html" title="This file contains helper classes/functions for implementing public key algorithms...">pubkey.h</a>"</span> <span class="comment">// for P1363_KDF2</span><a name="l00016"></a>00016 <span class="preprocessor">#include "sha.h"</span><a name="l00017"></a>00017 <span class="preprocessor">#include "cpu.h"</span><a name="l00018"></a>00018 <a name="l00019"></a>00019 <span class="preprocessor">#include <iostream></span><a name="l00020"></a>00020 <a name="l00021"></a>00021 <span class="preprocessor">#if _MSC_VER >= 1400</span><a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor"> #include <intrin.h></span><a name="l00023"></a>00023 <span class="preprocessor">#endif</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="preprocessor">#ifdef __DECCXX</span><a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor"> #include <c_asm.h></span><a name="l00027"></a>00027 <span class="preprocessor">#endif</span><a name="l00028"></a>00028 <span class="preprocessor"></span><a name="l00029"></a>00029 <span class="preprocessor">#ifdef CRYPTOPP_MSVC6_NO_PP</span><a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor"> #pragma message("You do not seem to have the Visual C++ Processor Pack installed, so use of SSE2 instructions will be disabled.")</span><a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor">#endif</span><a name="l00032"></a>00032 <span class="preprocessor"></span><a name="l00033"></a>00033 <span class="preprocessor">#define CRYPTOPP_INTEGER_SSE2 (CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE && CRYPTOPP_BOOL_X86)</span><a name="l00034"></a>00034 <span class="preprocessor"></span><a name="l00035"></a>00035 NAMESPACE_BEGIN(CryptoPP)<a name="l00036"></a>00036 <a name="l00037"></a>00037 bool AssignIntToInteger(const std::type_info &valueType, <span class="keywordtype">void</span> *pInteger, const <span class="keywordtype">void</span> *pInt)<a name="l00038"></a>00038 {<a name="l00039"></a>00039 <span class="keywordflow">if</span> (valueType != <span class="keyword">typeid</span>(<a class="code" href="class_integer.html" title="multiple precision integer and basic arithmetics">Integer</a>))<a name="l00040"></a>00040 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00041"></a>00041 *<span class="keyword">reinterpret_cast<</span>Integer *<span class="keyword">></span>(pInteger) = *reinterpret_cast<const int *>(pInt);<a name="l00042"></a>00042 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00043"></a>00043 }<a name="l00044"></a>00044 <a name="l00045"></a>00045 <span class="keyword">inline</span> <span class="keyword">static</span> <span class="keywordtype">int</span> Compare(<span class="keyword">const</span> word *A, <span class="keyword">const</span> word *B, <span class="keywordtype">size_t</span> N)<a name="l00046"></a>00046 {<a name="l00047"></a>00047 <span class="keywordflow">while</span> (N--)<a name="l00048"></a>00048 <span class="keywordflow">if</span> (A[N] > B[N])<a name="l00049"></a>00049 <span class="keywordflow">return</span> 1;<a name="l00050"></a>00050 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (A[N] < B[N])<a name="l00051"></a>00051 <span class="keywordflow">return</span> -1;<a name="l00052"></a>00052 <a name="l00053"></a>00053 <span class="keywordflow">return</span> 0;<a name="l00054"></a>00054 }<a name="l00055"></a>00055 <a name="l00056"></a>00056 <span class="keyword">inline</span> <span class="keyword">static</span> <span class="keywordtype">int</span> Increment(word *A, <span class="keywordtype">size_t</span> N, word B=1)<a name="l00057"></a>00057 {<a name="l00058"></a>00058 assert(N);<a name="l00059"></a>00059 word t = A[0];<a name="l00060"></a>00060 A[0] = t+B;<a name="l00061"></a>00061 <span class="keywordflow">if</span> (A[0] >= t)<a name="l00062"></a>00062 <span class="keywordflow">return</span> 0;<a name="l00063"></a>00063 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=1; i<N; i++)<a name="l00064"></a>00064 <span class="keywordflow">if</span> (++A[i])<a name="l00065"></a>00065 <span class="keywordflow">return</span> 0;<a name="l00066"></a>00066 <span class="keywordflow">return</span> 1;<a name="l00067"></a>00067 }<a name="l00068"></a>00068 <a name="l00069"></a>00069 <span class="keyword">inline</span> <span class="keyword">static</span> <span class="keywordtype">int</span> Decrement(word *A, <span class="keywordtype">size_t</span> N, word B=1)<a name="l00070"></a>00070 {<a name="l00071"></a>00071 assert(N);<a name="l00072"></a>00072 word t = A[0];<a name="l00073"></a>00073 A[0] = t-B;<a name="l00074"></a>00074 <span class="keywordflow">if</span> (A[0] <= t)<a name="l00075"></a>00075 <span class="keywordflow">return</span> 0;<a name="l00076"></a>00076 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=1; i<N; i++)<a name="l00077"></a>00077 <span class="keywordflow">if</span> (A[i]--)<a name="l00078"></a>00078 <span class="keywordflow">return</span> 0;<a name="l00079"></a>00079 <span class="keywordflow">return</span> 1;<a name="l00080"></a>00080 }<a name="l00081"></a>00081 <a name="l00082"></a>00082 <span class="keyword">static</span> <span class="keywordtype">void</span> TwosComplement(word *A, <span class="keywordtype">size_t</span> N)<a name="l00083"></a>00083 {<a name="l00084"></a>00084 Decrement(A, N);<a name="l00085"></a>00085 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=0; i<N; i++)<a name="l00086"></a>00086 A[i] = ~A[i];<a name="l00087"></a>00087 }<a name="l00088"></a>00088 <a name="l00089"></a>00089 <span class="keyword">static</span> word AtomicInverseModPower2(word A)<a name="l00090"></a>00090 {<a name="l00091"></a>00091 assert(A%2==1);<a name="l00092"></a>00092 <a name="l00093"></a>00093 word R=A%8;<a name="l00094"></a>00094 <a name="l00095"></a>00095 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=3; i<WORD_BITS; i*=2)<a name="l00096"></a>00096 R = R*(2-R*A);<a name="l00097"></a>00097 <a name="l00098"></a>00098 assert(R*A==1);<a name="l00099"></a>00099 <span class="keywordflow">return</span> R;<a name="l00100"></a>00100 }<a name="l00101"></a>00101 <a name="l00102"></a>00102 <span class="comment">// ********************************************************</span><a name="l00103"></a>00103 <a name="l00104"></a>00104 <span class="preprocessor">#if !defined(CRYPTOPP_NATIVE_DWORD_AVAILABLE) || CRYPTOPP_BOOL_X64</span><a name="l00105"></a>00105 <span class="preprocessor"></span><span class="preprocessor"> #define Declare2Words(x) word x##0, x##1;</span><a name="l00106"></a>00106 <span class="preprocessor"></span><span class="preprocessor"> #define AssignWord(a, b) a##0 = b; a##1 = 0;</span><a name="l00107"></a>00107 <span class="preprocessor"></span><span class="preprocessor"> #define Add2WordsBy1(a, b, c) a##0 = b##0 + c; a##1 = b##1 + (a##0 < c);</span>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -