<!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"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.14"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Crypto++: gcm.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Crypto++
 <span id="projectnumber">7.0</span>
</div>
<div id="projectbrief">Free C++ class library of cryptographic schemes</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.14 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">gcm.cpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// gcm.cpp - originally written and placed in the public domain by Wei Dai.</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// ARM and Aarch64 added by Jeffrey Walton. The ARM carryless</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// multiply routines are less efficient because they shadow x86.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// The precomputed key table integration makes it tricky to use the</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// more efficient ARMv8 implementation of the multiply and reduce.</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// use "cl /EP /P /DCRYPTOPP_GENERATE_X64_MASM gcm.cpp" to generate MASM code</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include "<a class="code" href="pch_8h.html">pch.h</a>"</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "<a class="code" href="config_8h.html">config.h</a>"</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#ifndef CRYPTOPP_GENERATE_X64_MASM</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// Clang 3.3 integrated assembler crash on Linux. Other versions produce incorrect results.</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Clang has never handled Intel ASM very well. I wish LLVM would fix it.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#if defined(__clang__)</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor"># undef CRYPTOPP_X86_ASM_AVAILABLE</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor"># undef CRYPTOPP_X32_ASM_AVAILABLE</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor"># undef CRYPTOPP_X64_ASM_AVAILABLE</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor"># undef CRYPTOPP_SSE2_ASM_AVAILABLE</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// SunCC 12.3 - 12.5 crash in GCM_Reduce_CLMUL</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// http://github.com/weidai11/cryptopp/issues/226</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x5140)</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor"># undef CRYPTOPP_CLMUL_AVAILABLE</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#if (CRYPTOPP_SSE2_INTRIN_AVAILABLE)</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor"># include <emmintrin.h></span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="gcm_8h.html">gcm.h</a>"</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="cpu_8h.html">cpu.h</a>"</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#if (CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X32 || CRYPTOPP_BOOL_X64)</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// Different assemblers accept different mnemonics: 'movd eax, xmm0' vs</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// 'movd rax, xmm0' vs 'mov eax, xmm0' vs 'mov rax, xmm0'</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#if (CRYPTOPP_LLVM_CLANG_VERSION >= 30600) || (CRYPTOPP_APPLE_CLANG_VERSION >= 70000) || defined(CRYPTOPP_CLANG_INTEGRATED_ASSEMBLER)</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// 'movd eax, xmm0' only. REG_WORD() macro not used.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor"># define USE_MOVD_REG32 1</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#elif defined(__GNUC__) || defined(_MSC_VER)</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// 'movd eax, xmm0' or 'movd rax, xmm0'. REG_WORD() macro supplies REG32 or REG64.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor"># define USE_MOVD_REG32_OR_REG64 1</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// 'mov eax, xmm0' or 'mov rax, xmm0'. REG_WORD() macro supplies REG32 or REG64.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor"># define USE_MOV_REG32_OR_REG64 1</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#endif // CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X32 || CRYPTOPP_BOOL_X64</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// Clang __m128i casts, http://bugs.llvm.org/show_bug.cgi?id=20670</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#define M128_CAST(x) ((__m128i *)(void *)(x))</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#define CONST_M128_CAST(x) ((const __m128i *)(const void *)(x))</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#if CRYPTOPP_ARM_NEON_AVAILABLE</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">extern</span> <span class="keywordtype">void</span> GCM_Xor16_NEON(byte *a, <span class="keyword">const</span> byte *b, <span class="keyword">const</span> byte *c);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> word16 GCM_Base::s_reductionTable[256];</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">volatile</span> <span class="keywordtype">bool</span> GCM_Base::s_reductionTableInitialized = <span class="keyword">false</span>;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="keywordtype">void</span> GCM_Base::GCTR::IncrementCounterBy256()</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <a class="code" href="misc_8h.html#a44fad9d8c25e8aca3a7ee29345516f0a">IncrementCounterByOne</a>(m_counterArray+<a class="code" href="namespace_name.html#aa93e40d0259a59959d270e6c82a9f1eb">BlockSize</a>()-4, 3);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> }</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Xor16(byte *a, <span class="keyword">const</span> byte *b, <span class="keyword">const</span> byte *c)</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(<a class="code" href="misc_8h.html#a726c3b76265182681f5d5fd173ab5676">IsAlignedOn</a>(a,GetAlignmentOf<word64>()));</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(<a class="code" href="misc_8h.html#a726c3b76265182681f5d5fd173ab5676">IsAlignedOn</a>(b,GetAlignmentOf<word64>()));</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(<a class="code" href="misc_8h.html#a726c3b76265182681f5d5fd173ab5676">IsAlignedOn</a>(c,GetAlignmentOf<word64>()));</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  ((word64 *)(<span class="keywordtype">void</span> *)a)[0] = ((word64 *)(<span class="keywordtype">void</span> *)b)[0] ^ ((word64 *)(<span class="keywordtype">void</span> *)c)[0];</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  ((word64 *)(<span class="keywordtype">void</span> *)a)[1] = ((word64 *)(<span class="keywordtype">void</span> *)b)[1] ^ ((word64 *)(<span class="keywordtype">void</span> *)c)[1];</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor">#if CRYPTOPP_SSE2_INTRIN_AVAILABLE || CRYPTOPP_SSE2_ASM_AVAILABLE</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// SunCC 5.10-5.11 compiler crash. Move GCM_Xor16_SSE2 out-of-line, and place in</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// a source file with a SSE architecture switch. Also see GH #226 and GH #284.</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">extern</span> <span class="keywordtype">void</span> GCM_Xor16_SSE2(byte *a, <span class="keyword">const</span> byte *b, <span class="keyword">const</span> byte *c);</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor">#endif // SSE2</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor">#if CRYPTOPP_CLMUL_AVAILABLE</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">extern</span> <span class="keywordtype">void</span> GCM_SetKeyWithoutResync_CLMUL(<span class="keyword">const</span> byte *hashKey, byte *mulTable, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tableSize);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="keyword">extern</span> <span class="keywordtype">size_t</span> GCM_AuthenticateBlocks_CLMUL(<span class="keyword">const</span> byte *data, <span class="keywordtype">size_t</span> len, <span class="keyword">const</span> byte *mtable, byte *hbuffer);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> s_cltableSizeInBlocks = 8;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">extern</span> <span class="keywordtype">void</span> GCM_ReverseHashBufferIfNeeded_CLMUL(byte *hashBuffer);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="preprocessor">#endif // CRYPTOPP_CLMUL_AVAILABLE</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="preprocessor">#if CRYPTOPP_ARM_PMULL_AVAILABLE</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">extern</span> <span class="keywordtype">void</span> GCM_SetKeyWithoutResync_PMULL(<span class="keyword">const</span> byte *hashKey, byte *mulTable, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tableSize);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">extern</span> <span class="keywordtype">size_t</span> GCM_AuthenticateBlocks_PMULL(<span class="keyword">const</span> byte *data, <span class="keywordtype">size_t</span> len, <span class="keyword">const</span> byte *mtable, byte *hbuffer);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> s_cltableSizeInBlocks = 8;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="keyword">extern</span> <span class="keywordtype">void</span> GCM_ReverseHashBufferIfNeeded_PMULL(byte *hashBuffer);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#endif // CRYPTOPP_ARM_PMULL_AVAILABLE</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="keywordtype">void</span> GCM_Base::SetKeyWithoutResync(<span class="keyword">const</span> byte *userKey, <span class="keywordtype">size_t</span> keylength, <span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html">NameValuePairs</a> &params)</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="class_block_cipher.html">BlockCipher</a> &blockCipher = AccessBlockCipher();</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  blockCipher.<a class="code" href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SetKey</a>(userKey, keylength, params);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// GCM is only defined for 16-byte block ciphers at the moment.</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// However, variable blocksize support means we have to defer</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// blocksize checks to runtime after the key is set. Also see</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// https://github.com/weidai11/cryptopp/issues/408.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> blockSize = blockCipher.<a class="code" href="class_block_transformation.html#adfdb78b033996020435c3dcffdca76ce">BlockSize</a>();</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(blockSize == REQUIRED_BLOCKSIZE);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (blockCipher.<a class="code" href="class_block_transformation.html#adfdb78b033996020435c3dcffdca76ce">BlockSize</a>() != REQUIRED_BLOCKSIZE)</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html">InvalidArgument</a>(<a class="code" href="class_g_c_m___base.html#a0d6236dad4a37fcbf07f4e8d0ab1e913">AlgorithmName</a>() + <span class="stringliteral">": block size of underlying block cipher is not 16"</span>);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordtype">int</span> tableSize, i, j, k;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor">#if CRYPTOPP_CLMUL_AVAILABLE</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a07cfbea5dcfb03d7ede705f71b8e46d7">HasCLMUL</a>())</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  {</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// Avoid "parameter not used" error and suppress Coverity finding</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  (void)params.<a class="code" href="class_name_value_pairs.html#a94e5b19dc54625799797668ff8627c57">GetIntValue</a>(<a class="code" href="namespace_name.html#a8f81826b7a68f1ae9c1cb88d774767ac">Name::TableSize</a>(), tableSize);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  tableSize = s_cltableSizeInBlocks * blockSize;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(tableSize > static_cast<int>(blockSize));</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor">#elif CRYPTOPP_ARM_PMULL_AVAILABLE</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#aaa6a27c8ca66a700ccba214c4b69bcd4">HasPMULL</a>())</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// Avoid "parameter not used" error and suppress Coverity finding</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  (void)params.<a class="code" href="class_name_value_pairs.html#a94e5b19dc54625799797668ff8627c57">GetIntValue</a>(<a class="code" href="namespace_name.html#a8f81826b7a68f1ae9c1cb88d774767ac">Name::TableSize</a>(), tableSize);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  tableSize = s_cltableSizeInBlocks * blockSize;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(tableSize > static_cast<int>(blockSize));</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (params.<a class="code" href="class_name_value_pairs.html#a94e5b19dc54625799797668ff8627c57">GetIntValue</a>(<a class="code" href="namespace_name.html#a8f81826b7a68f1ae9c1cb88d774767ac">Name::TableSize</a>(), tableSize))</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  tableSize = (tableSize >= 64*1024) ? 64*1024 : 2*1024;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  tableSize = (GetTablesOption() == <a class="code" href="gcm_8h.html#a0e626427402436d4e81bd41997072821a8bab074d1f2e3a968428f7e5ab6980f3">GCM_64K_Tables</a>) ? 64*1024 : 2*1024;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">//#if defined(_MSC_VER) && (_MSC_VER < 1400)</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// VC 2003 workaround: compiler generates bad code for 64K tables</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">//tableSize = 2*1024;</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">//#endif</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  m_buffer.resize(3*blockSize + tableSize);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  byte *mulTable = MulTable();</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  byte *hashKey = HashKey();</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  memset(hashKey, 0, REQUIRED_BLOCKSIZE);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  blockCipher.<a class="code" href="class_block_transformation.html#a93b18a5b11cd6f61bf19624192575d1d">ProcessBlock</a>(hashKey);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor">#if CRYPTOPP_CLMUL_AVAILABLE</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a07cfbea5dcfb03d7ede705f71b8e46d7">HasCLMUL</a>())</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  {</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  GCM_SetKeyWithoutResync_CLMUL(hashKey, mulTable, tableSize);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor">#elif CRYPTOPP_ARM_PMULL_AVAILABLE</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#aaa6a27c8ca66a700ccba214c4b69bcd4">HasPMULL</a>())</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  GCM_SetKeyWithoutResync_PMULL(hashKey, mulTable, tableSize);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  word64 V0, V1;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">typedef</span> <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut<word64, BigEndian></a> <a class="code" href="struct_block_get_and_put.html">Block</a>;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  Block::Get(hashKey)(V0)(V1);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">if</span> (tableSize == 64*1024)</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">for</span> (i=0; i<128; i++)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  k = i%8;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="class_put_block.html">Block::Put</a>(NULLPTR, mulTable+(i/8)*256*16+(<span class="keywordtype">size_t</span>(1)<<(11-k)))(V0)(V1);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordtype">int</span> x = (int)V1 & 1;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  V1 = (V1>>1) | (V0<<63);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  V0 = (V0>>1) ^ (x ? W64LIT(0xe1) << 56 : 0);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">for</span> (i=0; i<16; i++)</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  {</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  memset(mulTable+i*256*16, 0, 16);</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="preprocessor">#if CRYPTOPP_SSE2_INTRIN_AVAILABLE || CRYPTOPP_SSE2_ASM_AVAILABLE</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a962fa16f6d3a8a518912b39c3ea84062">HasSSE2</a>())</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">for</span> (j=2; j<=0x80; j*=2)</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">for</span> (k=1; k<j; k++)</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  GCM_Xor16_SSE2(mulTable+i*256*16+(j+k)*16, mulTable+i*256*16+j*16, mulTable+i*256*16+k*16);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="preprocessor">#elif CRYPTOPP_ARM_NEON_AVAILABLE</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a1bc02803e38ce67dd68d23600f59f71f">HasNEON</a>())</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">for</span> (j=2; j<=0x80; j*=2)</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">for</span> (k=1; k<j; k++)</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  GCM_Xor16_NEON(mulTable+i*256*16+(j+k)*16, mulTable+i*256*16+j*16, mulTable+i*256*16+k*16);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">for</span> (j=2; j<=0x80; j*=2)</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (k=1; k<j; k++)</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  Xor16(mulTable+i*256*16+(j+k)*16, mulTable+i*256*16+j*16, mulTable+i*256*16+k*16);</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">if</span> (!s_reductionTableInitialized)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  {</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  s_reductionTable[0] = 0;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  word16 x = 0x01c2;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  s_reductionTable[1] = <a class="code" href="misc_8h.html#a1d8d5adca8384ebedc699760ce217b08">ByteReverse</a>(x);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ii=2; ii<=0x80; ii*=2)</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  {</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  x <<= 1;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  s_reductionTable[ii] = <a class="code" href="misc_8h.html#a1d8d5adca8384ebedc699760ce217b08">ByteReverse</a>(x);</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> jj=1; jj<ii; jj++)</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  s_reductionTable[ii+jj] = s_reductionTable[ii] ^ s_reductionTable[jj];</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  s_reductionTableInitialized = <span class="keyword">true</span>;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">for</span> (i=0; i<128-24; i++)</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  {</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  k = i%32;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (k < 4)</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <a class="code" href="class_put_block.html">Block::Put</a>(NULLPTR, mulTable+1024+(i/32)*256+(<span class="keywordtype">size_t</span>(1)<<(7-k)))(V0)(V1);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (k < 8)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="class_put_block.html">Block::Put</a>(NULLPTR, mulTable+(i/32)*256+(<span class="keywordtype">size_t</span>(1)<<(11-k)))(V0)(V1);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordtype">int</span> x = (int)V1 & 1;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  V1 = (V1>>1) | (V0<<63);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  V0 = (V0>>1) ^ (x ? W64LIT(0xe1) << 56 : 0);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (i=0; i<4; i++)</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  memset(mulTable+i*256, 0, 16);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  memset(mulTable+1024+i*256, 0, 16);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="preprocessor">#if CRYPTOPP_SSE2_INTRIN_AVAILABLE || CRYPTOPP_SSE2_ASM_AVAILABLE</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a962fa16f6d3a8a518912b39c3ea84062">HasSSE2</a>())</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">for</span> (j=2; j<=8; j*=2)</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">for</span> (k=1; k<j; k++)</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  GCM_Xor16_SSE2(mulTable+i*256+(j+k)*16, mulTable+i*256+j*16, mulTable+i*256+k*16);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  GCM_Xor16_SSE2(mulTable+1024+i*256+(j+k)*16, mulTable+1024+i*256+j*16, mulTable+1024+i*256+k*16);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="preprocessor">#elif CRYPTOPP_ARM_NEON_AVAILABLE</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a1bc02803e38ce67dd68d23600f59f71f">HasNEON</a>())</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">for</span> (j=2; j<=8; j*=2)</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">for</span> (k=1; k<j; k++)</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  GCM_Xor16_NEON(mulTable+i*256+(j+k)*16, mulTable+i*256+j*16, mulTable+i*256+k*16);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  GCM_Xor16_NEON(mulTable+1024+i*256+(j+k)*16, mulTable+1024+i*256+j*16, mulTable+1024+i*256+k*16);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">for</span> (j=2; j<=8; j*=2)</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">for</span> (k=1; k<j; k++)</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  {</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  Xor16(mulTable+i*256+(j+k)*16, mulTable+i*256+j*16, mulTable+i*256+k*16);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  Xor16(mulTable+1024+i*256+(j+k)*16, mulTable+1024+i*256+j*16, mulTable+1024+i*256+k*16);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> }</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> </div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> GCM_Base::ReverseHashBufferIfNeeded()</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="preprocessor">#if CRYPTOPP_CLMUL_AVAILABLE</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a07cfbea5dcfb03d7ede705f71b8e46d7">HasCLMUL</a>())</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  {</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  GCM_ReverseHashBufferIfNeeded_CLMUL(HashBuffer());</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="preprocessor">#elif CRYPTOPP_ARM_PMULL_AVAILABLE</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#aaa6a27c8ca66a700ccba214c4b69bcd4">HasPMULL</a>())</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  {</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  GCM_ReverseHashBufferIfNeeded_PMULL(HashBuffer());</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> }</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="keywordtype">void</span> GCM_Base::Resync(<span class="keyword">const</span> byte *iv, <span class="keywordtype">size_t</span> len)</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> {</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="code" href="class_block_cipher.html">BlockCipher</a> &cipher = AccessBlockCipher();</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  byte *hashBuffer = HashBuffer();</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (len == 12)</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  {</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  memcpy(hashBuffer, iv, len);</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  memset(hashBuffer+len, 0, 3);</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  hashBuffer[len+3] = 1;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  {</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordtype">size_t</span> origLen = len;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  memset(hashBuffer, 0, HASH_BLOCKSIZE);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (len >= HASH_BLOCKSIZE)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  len = GCM_Base::AuthenticateBlocks(iv, len);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  iv += (origLen - len);</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> (len > 0)</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  {</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  memcpy(m_buffer, iv, len);</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  memset(m_buffer+len, 0, HASH_BLOCKSIZE-len);</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <a class="code" href="class_put_block.html">PutBlock<word64, BigEndian, true></a>(NULLPTR, m_buffer)(0)(origLen*8);</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  ReverseHashBufferIfNeeded();</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (m_state >= State_IVSet)</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  m_ctr.Resynchronize(hashBuffer, REQUIRED_BLOCKSIZE);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  m_ctr.SetCipherWithIV(cipher, hashBuffer);</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  m_ctr.Seek(HASH_BLOCKSIZE);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  memset(hashBuffer, 0, HASH_BLOCKSIZE);</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> }</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div><div class="line"><a name="l00326"></a><span class="lineno"><a class="line" href="class_g_c_m___base.html#a03138f0888c33eeca40a5ddd9a19898f"> 326</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_g_c_m___base.html#a03138f0888c33eeca40a5ddd9a19898f">GCM_Base::OptimalDataAlignment</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="keyword"></span>{</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">return</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="preprocessor">#if CRYPTOPP_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE)</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="cpu_8h.html#a962fa16f6d3a8a518912b39c3ea84062">HasSSE2</a>() ? 16 :</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="preprocessor">#elif CRYPTOPP_ARM_NEON_AVAILABLE</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <a class="code" href="cpu_8h.html#a1bc02803e38ce67dd68d23600f59f71f">HasNEON</a>() ? 4 :</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  GetBlockCipher().<a class="code" href="class_block_transformation.html#ac4796a7db0ddec123e00fadef4a71a38">OptimalDataAlignment</a>();</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> }</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="preprocessor">#if CRYPTOPP_MSC_VERSION</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="preprocessor"># pragma warning(disable: 4731) // frame pointer register 'ebp' modified by inline assembly code</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="preprocessor">#endif // #ifndef CRYPTOPP_GENERATE_X64_MASM</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="preprocessor">#ifdef CRYPTOPP_X64_MASM_AVAILABLE</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="keyword">extern</span> <span class="stringliteral">"C"</span> {</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="keywordtype">void</span> GCM_AuthenticateBlocks_2K(<span class="keyword">const</span> byte *data, <span class="keywordtype">size_t</span> blocks, word64 *hashBuffer, <span class="keyword">const</span> word16 *reductionTable);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="keywordtype">void</span> GCM_AuthenticateBlocks_64K(<span class="keyword">const</span> byte *data, <span class="keywordtype">size_t</span> blocks, word64 *hashBuffer);</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> </div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="preprocessor">#ifndef CRYPTOPP_GENERATE_X64_MASM</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="keywordtype">size_t</span> GCM_Base::AuthenticateBlocks(<span class="keyword">const</span> byte *data, <span class="keywordtype">size_t</span> len)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="preprocessor">#if CRYPTOPP_CLMUL_AVAILABLE</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#a07cfbea5dcfb03d7ede705f71b8e46d7">HasCLMUL</a>())</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  {</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">return</span> GCM_AuthenticateBlocks_CLMUL(data, len, MulTable(), HashBuffer());</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="preprocessor">#elif CRYPTOPP_ARM_PMULL_AVAILABLE</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">if</span> (<a class="code" href="cpu_8h.html#aaa6a27c8ca66a700ccba214c4b69bcd4">HasPMULL</a>())</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> GCM_AuthenticateBlocks_PMULL(data, len, MulTable(), HashBuffer());</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  }</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">typedef</span> <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut<word64, NativeByteOrder></a> <a class="code" href="struct_block_get_and_put.html">Block</a>;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  word64 *hashBuffer = (word64 *)(<span class="keywordtype">void</span> *)HashBuffer();</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(<a class="code" href="misc_8h.html#a726c3b76265182681f5d5fd173ab5676">IsAlignedOn</a>(hashBuffer,GetAlignmentOf<word64>()));</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">switch</span> (2*(m_buffer.size()>=64*1024)</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> #<span class="keywordflow">if</span> CRYPTOPP_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE)</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  + <a class="code" href="cpu_8h.html#a962fa16f6d3a8a518912b39c3ea84062">HasSSE2</a>()</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment">//#elif CRYPTOPP_ARM_NEON_AVAILABLE</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment">// + HasNEON()</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  )</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  {</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">case</span> 0: <span class="comment">// non-SSE2 and 2K tables</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  {</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  byte *mulTable = MulTable();</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  word64 x0 = hashBuffer[0], x1 = hashBuffer[1];</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">do</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  {</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  word64 y0, y1, a0, a1, b0, b1, c0, c1, d0, d1;</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  Block::Get(data)(y0)(y1);</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  x0 ^= y0;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  x1 ^= y1;</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> </div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  data += HASH_BLOCKSIZE;</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  len -= HASH_BLOCKSIZE;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="preprocessor"> #define READ_TABLE_WORD64_COMMON(a, b, c, d) *(word64 *)(void *)(mulTable+(a*1024)+(b*256)+c+d*8)</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="preprocessor"> #ifdef CRYPTOPP_LITTLE_ENDIAN</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="preprocessor"> #if CRYPTOPP_BOOL_SLOW_WORD64</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  word32 z0 = (word32)x0;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  word32 z1 = (word32)(x0>>32);</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  word32 z2 = (word32)x1;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  word32 z3 = (word32)(x1>>32);</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="preprocessor"> #define READ_TABLE_WORD64(a, b, c, d, e) READ_TABLE_WORD64_COMMON((d%2), c, (d?(z##c>>((d?d-1:0)*4))&0xf0:(z##c&0xf)<<4), e)</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="preprocessor"> #else</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="preprocessor"> #define READ_TABLE_WORD64(a, b, c, d, e) READ_TABLE_WORD64_COMMON((d%2), c, ((d+8*b)?(x##a>>(((d+8*b)?(d+8*b)-1:1)*4))&0xf0:(x##a&0xf)<<4), e)</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="preprocessor"> #endif</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="preprocessor"> #define GF_MOST_SIG_8BITS(a) (a##1 >> 7*8)</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="preprocessor"> #define GF_SHIFT_8(a) a##1 = (a##1 << 8) ^ (a##0 >> 7*8); a##0 <<= 8;</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="preprocessor"> #else</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="preprocessor"> #define READ_TABLE_WORD64(a, b, c, d, e) READ_TABLE_WORD64_COMMON((1-d%2), c, ((15-d-8*b)?(x##a>>(((15-d-8*b)?(15-d-8*b)-1:0)*4))&0xf0:(x##a&0xf)<<4), e)</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="preprocessor"> #define GF_MOST_SIG_8BITS(a) (a##1 & 0xff)</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="preprocessor"> #define GF_SHIFT_8(a) a##1 = (a##1 >> 8) ^ (a##0 << 7*8); a##0 >>= 8;</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="preprocessor"> #endif</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="preprocessor"> #define GF_MUL_32BY128(op, a, b, c) \</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="preprocessor"> a0 op READ_TABLE_WORD64(a, b, c, 0, 0) ^ READ_TABLE_WORD64(a, b, c, 1, 0); \</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="preprocessor"> a1 op READ_TABLE_WORD64(a, b, c, 0, 1) ^ READ_TABLE_WORD64(a, b, c, 1, 1); \</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="preprocessor"> b0 op READ_TABLE_WORD64(a, b, c, 2, 0) ^ READ_TABLE_WORD64(a, b, c, 3, 0); \</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="preprocessor"> b1 op READ_TABLE_WORD64(a, b, c, 2, 1) ^ READ_TABLE_WORD64(a, b, c, 3, 1); \</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="preprocessor"> c0 op READ_TABLE_WORD64(a, b, c, 4, 0) ^ READ_TABLE_WORD64(a, b, c, 5, 0); \</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="preprocessor"> c1 op READ_TABLE_WORD64(a, b, c, 4, 1) ^ READ_TABLE_WORD64(a, b, c, 5, 1); \</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="preprocessor"> d0 op READ_TABLE_WORD64(a, b, c, 6, 0) ^ READ_TABLE_WORD64(a, b, c, 7, 0); \</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="preprocessor"> d1 op READ_TABLE_WORD64(a, b, c, 6, 1) ^ READ_TABLE_WORD64(a, b, c, 7, 1); \</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="preprocessor"></span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  GF_MUL_32BY128(=, 0, 0, 0)</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  GF_MUL_32BY128(^=, 0, 1, 1)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  GF_MUL_32BY128(^=, 1, 0, 2)</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  GF_MUL_32BY128(^=, 1, 1, 3)</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> </div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  word32 r = (word32)s_reductionTable[GF_MOST_SIG_8BITS(d)] << 16;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  GF_SHIFT_8(d)</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  c0 ^= d0; c1 ^= d1;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  r ^= (word32)s_reductionTable[GF_MOST_SIG_8BITS(c)] << 8;</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  GF_SHIFT_8(c)</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  b0 ^= c0; b1 ^= c1;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  r ^= s_reductionTable[GF_MOST_SIG_8BITS(b)];</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  GF_SHIFT_8(b)</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  a0 ^= b0; a1 ^= b1;</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  a0 ^= <a class="code" href="misc_8h.html#a8e499ded4f2e7e7705c3cfd39cdf137f">ConditionalByteReverse</a><word64>(<a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, r);</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  x0 = a0; x1 = a1;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  while (len >= HASH_BLOCKSIZE);</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> </div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  hashBuffer[0] = x0; hashBuffer[1] = x1;</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  return len;</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  }</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> </div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  case 2: <span class="comment">// non-SSE2 and 64K tables</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  {</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  byte *mulTable = MulTable();</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  word64 x0 = hashBuffer[0], x1 = hashBuffer[1];</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">do</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  {</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  word64 y0, y1, a0, a1;</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  Block::Get(data)(y0)(y1);</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  x0 ^= y0;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  x1 ^= y1;</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  data += HASH_BLOCKSIZE;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  len -= HASH_BLOCKSIZE;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="preprocessor"> #undef READ_TABLE_WORD64_COMMON</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="preprocessor"> #undef READ_TABLE_WORD64</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="preprocessor"> #define READ_TABLE_WORD64_COMMON(a, c, d) *(word64 *)(void *)(mulTable+(a)*256*16+(c)+(d)*8)</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="preprocessor"> #ifdef CRYPTOPP_LITTLE_ENDIAN</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="preprocessor"> #if CRYPTOPP_BOOL_SLOW_WORD64</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  word32 z0 = (word32)x0;</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  word32 z1 = (word32)(x0>>32);</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  word32 z2 = (word32)x1;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  word32 z3 = (word32)(x1>>32);</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="preprocessor"> #define READ_TABLE_WORD64(b, c, d, e) READ_TABLE_WORD64_COMMON(c*4+d, (d?(z##c>>((d?d:1)*8-4))&0xff0:(z##c&0xff)<<4), e)</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="preprocessor"> #else</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="preprocessor"> #define READ_TABLE_WORD64(b, c, d, e) READ_TABLE_WORD64_COMMON(c*4+d, ((d+4*(c%2))?(x##b>>(((d+4*(c%2))?(d+4*(c%2)):1)*8-4))&0xff0:(x##b&0xff)<<4), e)</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="preprocessor"> #endif</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="preprocessor"> #else</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="preprocessor"> #define READ_TABLE_WORD64(b, c, d, e) READ_TABLE_WORD64_COMMON(c*4+d, ((7-d-4*(c%2))?(x##b>>(((7-d-4*(c%2))?(7-d-4*(c%2)):1)*8-4))&0xff0:(x##b&0xff)<<4), e)</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="preprocessor"> #endif</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="preprocessor"> #define GF_MUL_8BY128(op, b, c, d) \</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="preprocessor"> a0 op READ_TABLE_WORD64(b, c, d, 0);\</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> <span class="preprocessor"> a1 op READ_TABLE_WORD64(b, c, d, 1);\</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="preprocessor"></span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  GF_MUL_8BY128(=, 0, 0, 0)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  GF_MUL_8BY128(^=, 0, 0, 1)</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  GF_MUL_8BY128(^=, 0, 0, 2)</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  GF_MUL_8BY128(^=, 0, 0, 3)</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  GF_MUL_8BY128(^=, 0, 1, 0)</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  GF_MUL_8BY128(^=, 0, 1, 1)</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  GF_MUL_8BY128(^=, 0, 1, 2)</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  GF_MUL_8BY128(^=, 0, 1, 3)</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  GF_MUL_8BY128(^=, 1, 2, 0)</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  GF_MUL_8BY128(^=, 1, 2, 1)</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  GF_MUL_8BY128(^=, 1, 2, 2)</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  GF_MUL_8BY128(^=, 1, 2, 3)</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  GF_MUL_8BY128(^=, 1, 3, 0)</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  GF_MUL_8BY128(^=, 1, 3, 1)</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  GF_MUL_8BY128(^=, 1, 3, 2)</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  GF_MUL_8BY128(^=, 1, 3, 3)</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> </div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  x0 = a0; x1 = a1;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  while (len >= HASH_BLOCKSIZE);</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  hashBuffer[0] = x0; hashBuffer[1] = x1;</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  return len;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="preprocessor">#endif // #ifndef CRYPTOPP_GENERATE_X64_MASM</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> <span class="preprocessor">#ifdef CRYPTOPP_X64_MASM_AVAILABLE</span></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">case</span> 1: <span class="comment">// SSE2 and 2K tables</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  GCM_AuthenticateBlocks_2K(data, len/16, hashBuffer, s_reductionTable);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">return</span> len % 16;</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">case</span> 3: <span class="comment">// SSE2 and 64K tables</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  GCM_AuthenticateBlocks_64K(data, len/16, hashBuffer);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">return</span> len % 16;</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="preprocessor">#if CRYPTOPP_SSE2_ASM_AVAILABLE</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">case</span> 1: <span class="comment">// SSE2 and 2K tables</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  {</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="preprocessor"> #ifdef __GNUC__</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  __asm__ __volatile__</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  (</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  INTEL_NOPREFIX</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  #elif defined(CRYPTOPP_GENERATE_X64_MASM)</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  ALIGN 8</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  GCM_AuthenticateBlocks_2K PROC FRAME</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  rex_push_reg rsi</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  push_reg rdi</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  push_reg rbx</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  .endprolog</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  mov rsi, r8</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  mov r11, r9</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  #<span class="keywordflow">else</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  AS2( mov WORD_REG(cx), data )</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  AS2( mov WORD_REG(dx), len )</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  AS2( mov WORD_REG(si), hashBuffer )</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  AS2( shr WORD_REG(dx), 4 )</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  #endif</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> </div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  #<span class="keywordflow">if</span> CRYPTOPP_BOOL_X32</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  AS1(push rbx)</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  AS1(push rbp)</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  #<span class="keywordflow">else</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  AS_PUSH_IF86( bx)</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  AS_PUSH_IF86( bp)</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  #endif</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> </div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  #ifdef __GNUC__</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  AS2( mov AS_REG_7, WORD_REG(di))</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  #elif CRYPTOPP_BOOL_X86</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  AS2( lea AS_REG_7, s_reductionTable)</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  #endif</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  AS2( movdqa xmm0, [WORD_REG(si)] )</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  #define MUL_TABLE_0 WORD_REG(si) + 32</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  #define MUL_TABLE_1 WORD_REG(si) + 32 + 1024</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  #define RED_TABLE AS_REG_7</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> </div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  ASL(0)</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  AS2( movdqu xmm4, [WORD_REG(cx)] )</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  AS2( pxor xmm0, xmm4 )</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> </div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  AS2( movd ebx, xmm0 )</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  AS2( mov eax, AS_HEX(f0f0f0f0) )</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  AS2( and eax, ebx )</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  AS2( shl ebx, 4 )</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  AS2( and ebx, AS_HEX(f0f0f0f0) )</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  AS2( movzx edi, ah )</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  AS2( movdqa xmm5, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] )</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  AS2( movzx edi, al )</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  AS2( movdqa xmm4, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] )</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  AS2( shr eax, 16 )</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  AS2( movzx edi, ah )</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  AS2( movdqa xmm3, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] )</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  AS2( movzx edi, al )</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  AS2( movdqa xmm2, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] )</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> </div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  #define SSE2_MUL_32BITS(i) \</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  AS2( psrldq xmm0, 4 )\</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  AS2( movd eax, xmm0 )\</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  AS2( and eax, AS_HEX(f0f0f0f0) )\</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  AS2( movzx edi, bh )\</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  AS2( pxor xmm5, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  AS2( movzx edi, bl )\</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  AS2( pxor xmm4, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  AS2( shr ebx, 16 )\</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  AS2( movzx edi, bh )\</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  AS2( pxor xmm3, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  AS2( movzx edi, bl )\</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  AS2( pxor xmm2, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  AS2( movd ebx, xmm0 )\</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  AS2( shl ebx, 4 )\</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  AS2( and ebx, AS_HEX(f0f0f0f0) )\</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  AS2( movzx edi, ah )\</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  AS2( pxor xmm5, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  AS2( movzx edi, al )\</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  AS2( pxor xmm4, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  AS2( shr eax, 16 )\</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  AS2( movzx edi, ah )\</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  AS2( pxor xmm3, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  AS2( movzx edi, al )\</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  AS2( pxor xmm2, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> </div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  SSE2_MUL_32BITS(1)</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  SSE2_MUL_32BITS(2)</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  SSE2_MUL_32BITS(3)</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> </div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  AS2( movzx edi, bh )</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  AS2( pxor xmm5, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] )</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  AS2( movzx edi, bl )</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  AS2( pxor xmm4, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] )</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  AS2( shr ebx, 16 )</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  AS2( movzx edi, bh )</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  AS2( pxor xmm3, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] )</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  AS2( movzx edi, bl )</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  AS2( pxor xmm2, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] )</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  AS2( movdqa xmm0, xmm3 )</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  AS2( pslldq xmm3, 1 )</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  AS2( pxor xmm2, xmm3 )</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  AS2( movdqa xmm1, xmm2 )</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  AS2( pslldq xmm2, 1 )</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  AS2( pxor xmm5, xmm2 )</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> </div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  AS2( psrldq xmm0, 15 )</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> #<span class="keywordflow">if</span> USE_MOVD_REG32</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  AS2( movd edi, xmm0 )</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> #elif USE_MOV_REG32_OR_REG64</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  AS2( mov WORD_REG(di), xmm0 )</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> #<span class="keywordflow">else</span> <span class="comment">// GNU Assembler</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  AS2( movd WORD_REG(di), xmm0 )</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> #endif</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  AS2( movzx eax, WORD PTR [RED_TABLE + WORD_REG(di)*2] )</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  AS2( shl eax, 8 )</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> </div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  AS2( movdqa xmm0, xmm5 )</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  AS2( pslldq xmm5, 1 )</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  AS2( pxor xmm4, xmm5 )</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> </div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  AS2( psrldq xmm1, 15 )</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> #<span class="keywordflow">if</span> USE_MOVD_REG32</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  AS2( movd edi, xmm1 )</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> #elif USE_MOV_REG32_OR_REG64</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  AS2( mov WORD_REG(di), xmm1 )</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> #<span class="keywordflow">else</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  AS2( movd WORD_REG(di), xmm1 )</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> #endif</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  AS2( xor ax, WORD PTR [RED_TABLE + WORD_REG(di)*2] )</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  AS2( shl eax, 8 )</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> </div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  AS2( psrldq xmm0, 15 )</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> #<span class="keywordflow">if</span> USE_MOVD_REG32</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  AS2( movd edi, xmm0 )</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> #elif USE_MOV_REG32_OR_REG64</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  AS2( mov WORD_REG(di), xmm0 )</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> #<span class="keywordflow">else</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  AS2( movd WORD_REG(di), xmm0 )</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> #endif</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  AS2( xor ax, WORD PTR [RED_TABLE + WORD_REG(di)*2] )</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> </div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  AS2( movd xmm0, eax )</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  AS2( pxor xmm0, xmm4 )</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> </div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  AS2( add WORD_REG(cx), 16 )</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  AS2( sub WORD_REG(dx), 1 )</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  ATT_NOPREFIX</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  ASJ( jnz, 0, b )</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  INTEL_NOPREFIX</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  AS2( movdqa [WORD_REG(si)], xmm0 )</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  #<span class="keywordflow">if</span> CRYPTOPP_BOOL_X32</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  AS1(pop rbp)</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  AS1(pop rbx)</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  #<span class="keywordflow">else</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  AS_POP_IF86( bp)</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  AS_POP_IF86( bx)</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  #endif</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> </div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  #ifdef __GNUC__</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  ATT_PREFIX</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  :</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  : <span class="stringliteral">"c"</span> (data), <span class="stringliteral">"d"</span> (len/16), <span class="stringliteral">"S"</span> (hashBuffer), <span class="stringliteral">"D"</span> (s_reductionTable)</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  : <span class="stringliteral">"memory"</span>, <span class="stringliteral">"cc"</span>, <span class="stringliteral">"%eax"</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  #<span class="keywordflow">if</span> CRYPTOPP_BOOL_X64</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  , <span class="stringliteral">"%ebx"</span>, <span class="stringliteral">"%r11"</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  #endif</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  );</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="preprocessor"> #elif defined(CRYPTOPP_GENERATE_X64_MASM)</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  pop rbx</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  pop rdi</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  pop rsi</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  ret</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  GCM_AuthenticateBlocks_2K ENDP</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> <span class="preprocessor"> #endif</span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> </div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">return</span> len%16;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  }</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keywordflow">case</span> 3: <span class="comment">// SSE2 and 64K tables</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  {</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="preprocessor"> #ifdef __GNUC__</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  __asm__ __volatile__</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  (</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  INTEL_NOPREFIX</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  #elif defined(CRYPTOPP_GENERATE_X64_MASM)</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  ALIGN 8</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  GCM_AuthenticateBlocks_64K PROC FRAME</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  rex_push_reg rsi</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  push_reg rdi</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  .endprolog</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  mov rsi, r8</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  #<span class="keywordflow">else</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  AS2( mov WORD_REG(cx), data )</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  AS2( mov WORD_REG(dx), len )</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  AS2( mov WORD_REG(si), hashBuffer )</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  AS2( shr WORD_REG(dx), 4 )</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  #endif</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  AS2( movdqa xmm0, [WORD_REG(si)] )</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> </div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  #undef MUL_TABLE</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  #define MUL_TABLE(i,j) WORD_REG(si) + 32 + (i*4+j)*256*16</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  ASL(1)</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  AS2( movdqu xmm1, [WORD_REG(cx)] )</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  AS2( pxor xmm1, xmm0 )</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  AS2( pxor xmm0, xmm0 )</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> </div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  #undef SSE2_MUL_32BITS</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  #define SSE2_MUL_32BITS(i) \</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  AS2( movd eax, xmm1 )\</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  AS2( psrldq xmm1, 4 )\</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  AS2( movzx edi, al )\</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  AS2( add WORD_REG(di), WORD_REG(di) )\</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  AS2( pxor xmm0, [MUL_TABLE(i,0) + WORD_REG(di)*8] )\</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  AS2( movzx edi, ah )\</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  AS2( add WORD_REG(di), WORD_REG(di) )\</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  AS2( pxor xmm0, [MUL_TABLE(i,1) + WORD_REG(di)*8] )\</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  AS2( shr eax, 16 )\</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  AS2( movzx edi, al )\</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  AS2( add WORD_REG(di), WORD_REG(di) )\</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  AS2( pxor xmm0, [MUL_TABLE(i,2) + WORD_REG(di)*8] )\</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  AS2( movzx edi, ah )\</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  AS2( add WORD_REG(di), WORD_REG(di) )\</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  AS2( pxor xmm0, [MUL_TABLE(i,3) + WORD_REG(di)*8] )\</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> </div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  SSE2_MUL_32BITS(0)</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  SSE2_MUL_32BITS(1)</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  SSE2_MUL_32BITS(2)</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  SSE2_MUL_32BITS(3)</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> </div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  AS2( add WORD_REG(cx), 16 )</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  AS2( sub WORD_REG(dx), 1 )</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  ATT_NOPREFIX</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  ASJ( jnz, 1, b )</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  INTEL_NOPREFIX</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  AS2( movdqa [WORD_REG(si)], xmm0 )</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> </div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  #ifdef __GNUC__</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  ATT_PREFIX</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  :</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  : <span class="stringliteral">"c"</span> (data), <span class="stringliteral">"d"</span> (len/16), <span class="stringliteral">"S"</span> (hashBuffer)</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  : <span class="stringliteral">"memory"</span>, <span class="stringliteral">"cc"</span>, <span class="stringliteral">"%edi"</span>, <span class="stringliteral">"%eax"</span></div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  );</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="preprocessor"> #elif defined(CRYPTOPP_GENERATE_X64_MASM)</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  pop rdi</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  pop rsi</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  ret</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  GCM_AuthenticateBlocks_64K ENDP</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="preprocessor"> #endif</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">return</span> len%16;</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  }</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> <span class="preprocessor">#ifndef CRYPTOPP_GENERATE_X64_MASM</span></div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> </div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">return</span> len%16;</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> }</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> </div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="keywordtype">void</span> GCM_Base::AuthenticateLastHeaderBlock()</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> {</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">if</span> (m_bufferedDataLength > 0)</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  {</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  memset(m_buffer+m_bufferedDataLength, 0, HASH_BLOCKSIZE-m_bufferedDataLength);</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  m_bufferedDataLength = 0;</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE);</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> }</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span> </div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> <span class="keywordtype">void</span> GCM_Base::AuthenticateLastConfidentialBlock()</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> {</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  GCM_Base::AuthenticateLastHeaderBlock();</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <a class="code" href="class_put_block.html">PutBlock<word64, BigEndian, true></a>(NULLPTR, m_buffer)(m_totalHeaderLength*8)(m_totalMessageLength*8);</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE);</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> }</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> </div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="keywordtype">void</span> GCM_Base::AuthenticateLastFooterBlock(byte *mac, <span class="keywordtype">size_t</span> macSize)</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> {</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  m_ctr.Seek(0);</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  ReverseHashBufferIfNeeded();</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  m_ctr.ProcessData(mac, HashBuffer(), macSize);</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> }</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> </div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> NAMESPACE_END</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> </div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span> <span class="preprocessor">#endif // #ifndef CRYPTOPP_GENERATE_X64_MASM</span></div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="class_invalid_argument_html"><div class="ttname"><a href="class_invalid_argument.html">InvalidArgument</a></div><div class="ttdoc">An invalid argument was detected. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00199">cryptlib.h:199</a></div></div>
<div class="ttc" id="class_simple_keying_interface_html_adf3c29b3ef3af74788a58c7c49887fd7"><div class="ttname"><a href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SimpleKeyingInterface::SetKey</a></div><div class="ttdeci">virtual void SetKey(const byte *key, size_t length, const NameValuePairs &params=g_nullNameValuePairs)</div><div class="ttdoc">Sets or reset the key of this object. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8cpp_source.html#l00064">cryptlib.cpp:64</a></div></div>
<div class="ttc" id="class_g_c_m___base_html_a03138f0888c33eeca40a5ddd9a19898f"><div class="ttname"><a href="class_g_c_m___base.html#a03138f0888c33eeca40a5ddd9a19898f">GCM_Base::OptimalDataAlignment</a></div><div class="ttdeci">unsigned int OptimalDataAlignment() const</div><div class="ttdoc">Provides input and output data alignment for optimal performance. </div><div class="ttdef"><b>Definition:</b> <a href="gcm_8cpp_source.html#l00326">gcm.cpp:326</a></div></div>
<div class="ttc" id="misc_8h_html_a44fad9d8c25e8aca3a7ee29345516f0a"><div class="ttname"><a href="misc_8h.html#a44fad9d8c25e8aca3a7ee29345516f0a">IncrementCounterByOne</a></div><div class="ttdeci">void IncrementCounterByOne(byte *inout, unsigned int size)</div><div class="ttdoc">Performs an addition with carry on a block of bytes. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01108">misc.h:1108</a></div></div>
<div class="ttc" id="config_8h_html"><div class="ttname"><a href="config_8h.html">config.h</a></div><div class="ttdoc">Library configuration file. </div></div>
<div class="ttc" id="struct_block_get_and_put_html"><div class="ttname"><a href="struct_block_get_and_put.html">BlockGetAndPut</a></div><div class="ttdoc">Access a block of memory. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l02402">misc.h:2402</a></div></div>
<div class="ttc" id="class_block_transformation_html_ac4796a7db0ddec123e00fadef4a71a38"><div class="ttname"><a href="class_block_transformation.html#ac4796a7db0ddec123e00fadef4a71a38">BlockTransformation::OptimalDataAlignment</a></div><div class="ttdeci">virtual unsigned int OptimalDataAlignment() const</div><div class="ttdoc">Provides input and output data alignment for optimal performance. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8cpp_source.html#l00196">cryptlib.cpp:196</a></div></div>
<div class="ttc" id="cryptlib_8h_html_aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2"><div class="ttname"><a href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a></div><div class="ttdoc">byte order is little-endian </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00142">cryptlib.h:142</a></div></div>
<div class="ttc" id="class_block_cipher_html"><div class="ttname"><a href="class_block_cipher.html">BlockCipher</a></div><div class="ttdoc">Interface for one direction (encryption or decryption) of a block cipher. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01229">cryptlib.h:1229</a></div></div>
<div class="ttc" id="gcm_8h_html_a0e626427402436d4e81bd41997072821a8bab074d1f2e3a968428f7e5ab6980f3"><div class="ttname"><a href="gcm_8h.html#a0e626427402436d4e81bd41997072821a8bab074d1f2e3a968428f7e5ab6980f3">GCM_64K_Tables</a></div><div class="ttdoc">Use a table with 64K entries. </div><div class="ttdef"><b>Definition:</b> <a href="gcm_8h_source.html#l00021">gcm.h:21</a></div></div>
<div class="ttc" id="class_block_transformation_html_adfdb78b033996020435c3dcffdca76ce"><div class="ttname"><a href="class_block_transformation.html#adfdb78b033996020435c3dcffdca76ce">BlockTransformation::BlockSize</a></div><div class="ttdeci">virtual unsigned int BlockSize() const =0</div><div class="ttdoc">Provides the block size of the cipher. </div></div>
<div class="ttc" id="misc_8h_html_a726c3b76265182681f5d5fd173ab5676"><div class="ttname"><a href="misc_8h.html#a726c3b76265182681f5d5fd173ab5676">IsAlignedOn</a></div><div class="ttdeci">bool IsAlignedOn(const void *ptr, unsigned int alignment)</div><div class="ttdoc">Determines whether ptr is aligned to a minimum value. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01030">misc.h:1030</a></div></div>
<div class="ttc" id="namespace_name_html_a8f81826b7a68f1ae9c1cb88d774767ac"><div class="ttname"><a href="namespace_name.html#a8f81826b7a68f1ae9c1cb88d774767ac">Name::TableSize</a></div><div class="ttdeci">const char * TableSize()</div><div class="ttdoc">int, in bytes </div><div class="ttdef"><b>Definition:</b> <a href="argnames_8h_source.html#l00081">argnames.h:81</a></div></div>
<div class="ttc" id="cpu_8h_html_a07cfbea5dcfb03d7ede705f71b8e46d7"><div class="ttname"><a href="cpu_8h.html#a07cfbea5dcfb03d7ede705f71b8e46d7">HasCLMUL</a></div><div class="ttdeci">bool HasCLMUL()</div><div class="ttdoc">Determines Carryless Multiply availability. </div><div class="ttdef"><b>Definition:</b> <a href="cpu_8h_source.html#l00173">cpu.h:173</a></div></div>
<div class="ttc" id="misc_8h_html_a8e499ded4f2e7e7705c3cfd39cdf137f"><div class="ttname"><a href="misc_8h.html#a8e499ded4f2e7e7705c3cfd39cdf137f">ConditionalByteReverse</a></div><div class="ttdeci">T ConditionalByteReverse(ByteOrder order, T value)</div><div class="ttdoc">Reverses bytes in a value depending upon endianness. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01979">misc.h:1979</a></div></div>
<div class="ttc" id="pch_8h_html"><div class="ttname"><a href="pch_8h.html">pch.h</a></div><div class="ttdoc">Precompiled header file. </div></div>
<div class="ttc" id="class_block_transformation_html_a93b18a5b11cd6f61bf19624192575d1d"><div class="ttname"><a href="class_block_transformation.html#a93b18a5b11cd6f61bf19624192575d1d">BlockTransformation::ProcessBlock</a></div><div class="ttdeci">void ProcessBlock(const byte *inBlock, byte *outBlock) const</div><div class="ttdoc">Encrypt or decrypt a block. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00832">cryptlib.h:832</a></div></div>
<div class="ttc" id="class_g_c_m___base_html_a0d6236dad4a37fcbf07f4e8d0ab1e913"><div class="ttname"><a href="class_g_c_m___base.html#a0d6236dad4a37fcbf07f4e8d0ab1e913">GCM_Base::AlgorithmName</a></div><div class="ttdeci">std::string AlgorithmName() const</div><div class="ttdoc">Provides the name of this algorithm. </div><div class="ttdef"><b>Definition:</b> <a href="gcm_8h_source.html#l00030">gcm.h:30</a></div></div>
<div class="ttc" id="trap_8h_html_adf3b392588bc94cbeae9f415a78c7b95"><div class="ttname"><a href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a></div><div class="ttdeci">#define CRYPTOPP_ASSERT(exp)</div><div class="ttdoc">Debugging and diagnostic assertion. </div><div class="ttdef"><b>Definition:</b> <a href="trap_8h_source.html#l00060">trap.h:60</a></div></div>
<div class="ttc" id="namespace_name_html_aa93e40d0259a59959d270e6c82a9f1eb"><div class="ttname"><a href="namespace_name.html#aa93e40d0259a59959d270e6c82a9f1eb">Name::BlockSize</a></div><div class="ttdeci">const char * BlockSize()</div><div class="ttdoc">int, in bytes </div><div class="ttdef"><b>Definition:</b> <a href="argnames_8h_source.html#l00027">argnames.h:27</a></div></div>
<div class="ttc" id="cpu_8h_html"><div class="ttname"><a href="cpu_8h.html">cpu.h</a></div><div class="ttdoc">Functions for CPU features and intrinsics. </div></div>
<div class="ttc" id="cpu_8h_html_a962fa16f6d3a8a518912b39c3ea84062"><div class="ttname"><a href="cpu_8h.html#a962fa16f6d3a8a518912b39c3ea84062">HasSSE2</a></div><div class="ttdeci">bool HasSSE2()</div><div class="ttdoc">Determines SSE2 availability. </div><div class="ttdef"><b>Definition:</b> <a href="cpu_8h_source.html#l00114">cpu.h:114</a></div></div>
<div class="ttc" id="gcm_8h_html"><div class="ttname"><a href="gcm_8h.html">gcm.h</a></div><div class="ttdoc">GCM block cipher mode of operation. </div></div>
<div class="ttc" id="class_put_block_html"><div class="ttname"><a href="class_put_block.html">PutBlock</a></div><div class="ttdoc">Access a block of memory. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l02365">misc.h:2365</a></div></div>
<div class="ttc" id="namespace_crypto_p_p_html"><div class="ttname"><a href="namespace_crypto_p_p.html">CryptoPP</a></div><div class="ttdoc">Crypto++ library namespace. </div></div>
<div class="ttc" id="class_name_value_pairs_html_a94e5b19dc54625799797668ff8627c57"><div class="ttname"><a href="class_name_value_pairs.html#a94e5b19dc54625799797668ff8627c57">NameValuePairs::GetIntValue</a></div><div class="ttdeci">bool GetIntValue(const char *name, int &value) const</div><div class="ttdoc">Get a named value with type int. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00383">cryptlib.h:383</a></div></div>
<div class="ttc" id="misc_8h_html_a1d8d5adca8384ebedc699760ce217b08"><div class="ttname"><a href="misc_8h.html#a1d8d5adca8384ebedc699760ce217b08">ByteReverse</a></div><div class="ttdeci">byte ByteReverse(byte value)</div><div class="ttdoc">Reverses bytes in a 8-bit value. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01838">misc.h:1838</a></div></div>
<div class="ttc" id="cpu_8h_html_aaa6a27c8ca66a700ccba214c4b69bcd4"><div class="ttname"><a href="cpu_8h.html#aaa6a27c8ca66a700ccba214c4b69bcd4">HasPMULL</a></div><div class="ttdeci">bool HasPMULL()</div><div class="ttdoc">Determine if an ARM processor provides Polynomial Multiplication. </div><div class="ttdef"><b>Definition:</b> <a href="cpu_8h_source.html#l00348">cpu.h:348</a></div></div>
<div class="ttc" id="cpu_8h_html_a1bc02803e38ce67dd68d23600f59f71f"><div class="ttname"><a href="cpu_8h.html#a1bc02803e38ce67dd68d23600f59f71f">HasNEON</a></div><div class="ttdeci">bool HasNEON()</div><div class="ttdoc">Determine if an ARM processor has Advanced SIMD available. </div><div class="ttdef"><b>Definition:</b> <a href="cpu_8h_source.html#l00329">cpu.h:329</a></div></div>
<div class="ttc" id="class_name_value_pairs_html"><div class="ttname"><a href="class_name_value_pairs.html">NameValuePairs</a></div><div class="ttdoc">Interface for retrieving values given their names. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00290">cryptlib.h:290</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Sun Sep 16 2018 07:57:52 for Crypto++ by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.14
</small></address>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-release
>
by-pkgid
>
0a67b807a02637f2cae68649d519a89d
>
files
>
2307
