⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 secblock_8h-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 5 页
字号:
<a name="l00166"></a>00166 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_allocator_with_cleanup.html">AllocatorWithCleanup&lt;byte&gt;</a>;<a name="l00167"></a>00167 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_allocator_with_cleanup.html">AllocatorWithCleanup&lt;word16&gt;</a>;<a name="l00168"></a>00168 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_allocator_with_cleanup.html">AllocatorWithCleanup&lt;word32&gt;</a>;<a name="l00169"></a>00169 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_allocator_with_cleanup.html">AllocatorWithCleanup&lt;word64&gt;</a>;<a name="l00170"></a>00170 <span class="preprocessor">#if CRYPTOPP_BOOL_X86</span><a name="l00171"></a>00171 <span class="preprocessor"></span>CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_allocator_with_cleanup.html">AllocatorWithCleanup&lt;word, true&gt;</a>;   <span class="comment">// for Integer</span><a name="l00172"></a>00172 <span class="preprocessor">#endif</span><a name="l00173"></a>00173 <span class="preprocessor"></span><a name="l00174"></a>00174 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;<a name="l00175"></a><a class="code" href="class_null_allocator.html">00175</a> <span class="keyword">class </span><a class="code" href="class_null_allocator.html">NullAllocator</a> : <span class="keyword">public</span> <a class="code" href="class_allocator_base.html">AllocatorBase</a>&lt;T&gt;<a name="l00176"></a>00176 {<a name="l00177"></a>00177 <span class="keyword">public</span>:<a name="l00178"></a><a class="code" href="class_null_allocator.html#637fc6a7a50772aef6d92fac378f19b7">00178</a>         CRYPTOPP_INHERIT_ALLOCATOR_TYPES<a name="l00179"></a>00179 <a name="l00180"></a><a class="code" href="class_null_allocator.html#b9a7660ea1479a0a239a5b06b82d3fa2">00180</a>         <a class="code" href="class_null_allocator.html#1e5175d69540f3834bbe60962425068e">pointer</a> <a class="code" href="class_null_allocator.html#b9a7660ea1479a0a239a5b06b82d3fa2">allocate</a>(<a class="code" href="class_null_allocator.html#df18d5e5728d4220e424cde203dad003">size_type</a> n, <span class="keyword">const</span> <span class="keywordtype">void</span> * = NULL)<a name="l00181"></a>00181         {<a name="l00182"></a>00182                 assert(<span class="keyword">false</span>);<a name="l00183"></a>00183                 <span class="keywordflow">return</span> NULL;<a name="l00184"></a>00184         }<a name="l00185"></a>00185 <a name="l00186"></a><a class="code" href="class_null_allocator.html#f113adba543499994900b3e4ce729aa7">00186</a>         <span class="keywordtype">void</span> <a class="code" href="class_null_allocator.html#f113adba543499994900b3e4ce729aa7">deallocate</a>(<span class="keywordtype">void</span> *p, <a class="code" href="class_null_allocator.html#df18d5e5728d4220e424cde203dad003">size_type</a> n)<a name="l00187"></a>00187         {<a name="l00188"></a>00188                 assert(<span class="keyword">false</span>);<a name="l00189"></a>00189         }<a name="l00190"></a>00190 <a name="l00191"></a><a class="code" href="class_null_allocator.html#3d83278b7072c6c626a44bffe371eb0d">00191</a>         <a class="code" href="class_null_allocator.html#df18d5e5728d4220e424cde203dad003">size_type</a> <a class="code" href="class_null_allocator.html#3d83278b7072c6c626a44bffe371eb0d">max_size</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> 0;}<a name="l00192"></a>00192 };<a name="l00193"></a>00193 <a name="l00194"></a>00194 <span class="comment">// This allocator can't be used with standard collections because</span><a name="l00195"></a>00195 <span class="comment">// they require that all objects of the same allocator type are equivalent.</span><a name="l00196"></a>00196 <span class="comment">// So this is for use with SecBlock only.</span><a name="l00197"></a>00197 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T, <span class="keywordtype">size_t</span> S, <span class="keyword">class</span> A = NullAllocator&lt;T&gt;, <span class="keywordtype">bool</span> T_Align16 = false&gt;<a name="l00198"></a><a class="code" href="class_fixed_size_allocator_with_cleanup.html">00198</a> <span class="keyword">class </span><a class="code" href="class_fixed_size_allocator_with_cleanup.html">FixedSizeAllocatorWithCleanup</a> : <span class="keyword">public</span> <a class="code" href="class_allocator_base.html">AllocatorBase</a>&lt;T&gt;<a name="l00199"></a>00199 {<a name="l00200"></a>00200 <span class="keyword">public</span>:<a name="l00201"></a><a class="code" href="class_fixed_size_allocator_with_cleanup.html#b83b67f27d7d9a024090fca6a955581f">00201</a>         CRYPTOPP_INHERIT_ALLOCATOR_TYPES<a name="l00202"></a>00202 <a name="l00203"></a><a class="code" href="class_fixed_size_allocator_with_cleanup.html#a8ce1fc8c74012dccf3add4e60b2636b">00203</a>         <a class="code" href="class_fixed_size_allocator_with_cleanup.html#a8ce1fc8c74012dccf3add4e60b2636b">FixedSizeAllocatorWithCleanup</a>() : m_allocated(false) {}<a name="l00204"></a>00204 <a name="l00205"></a><a class="code" href="class_fixed_size_allocator_with_cleanup.html#53845df92db620ab0ae7ee5bc3d8b132">00205</a>         <a class="code" href="class_fixed_size_allocator_with_cleanup.html#e3253e1533a1405e93aef8af443e9c16">pointer</a> <a class="code" href="class_fixed_size_allocator_with_cleanup.html#53845df92db620ab0ae7ee5bc3d8b132">allocate</a>(<a class="code" href="class_fixed_size_allocator_with_cleanup.html#bcc016350706c04d7a2660659a3d19f0">size_type</a> n)<a name="l00206"></a>00206         {<a name="l00207"></a>00207                 assert(IsAlignedOn(m_array, 8));<a name="l00208"></a>00208 <a name="l00209"></a>00209                 <span class="keywordflow">if</span> (n &lt;= S &amp;&amp; !m_allocated)<a name="l00210"></a>00210                 {<a name="l00211"></a>00211                         m_allocated = <span class="keyword">true</span>;<a name="l00212"></a>00212                         <span class="keywordflow">return</span> GetAlignedArray();<a name="l00213"></a>00213                 }<a name="l00214"></a>00214                 <span class="keywordflow">else</span><a name="l00215"></a>00215                         <span class="keywordflow">return</span> m_fallbackAllocator.allocate(n);<a name="l00216"></a>00216         }<a name="l00217"></a>00217 <a name="l00218"></a><a class="code" href="class_fixed_size_allocator_with_cleanup.html#e7428063aa172483e630bc370a0188e5">00218</a>         <a class="code" href="class_fixed_size_allocator_with_cleanup.html#e3253e1533a1405e93aef8af443e9c16">pointer</a> <a class="code" href="class_fixed_size_allocator_with_cleanup.html#53845df92db620ab0ae7ee5bc3d8b132">allocate</a>(<a class="code" href="class_fixed_size_allocator_with_cleanup.html#bcc016350706c04d7a2660659a3d19f0">size_type</a> n, <span class="keyword">const</span> <span class="keywordtype">void</span> *hint)<a name="l00219"></a>00219         {<a name="l00220"></a>00220                 <span class="keywordflow">if</span> (n &lt;= S &amp;&amp; !m_allocated)<a name="l00221"></a>00221                 {<a name="l00222"></a>00222                         m_allocated = <span class="keyword">true</span>;<a name="l00223"></a>00223                         <span class="keywordflow">return</span> GetAlignedArray();<a name="l00224"></a>00224                 }<a name="l00225"></a>00225                 <span class="keywordflow">else</span><a name="l00226"></a>00226                         <span class="keywordflow">return</span> m_fallbackAllocator.allocate(n, hint);<a name="l00227"></a>00227         }<a name="l00228"></a>00228 <a name="l00229"></a><a class="code" href="class_fixed_size_allocator_with_cleanup.html#0d2ebc799d0efcb6d45c3cefc55a524f">00229</a>         <span class="keywordtype">void</span> <a class="code" href="class_fixed_size_allocator_with_cleanup.html#0d2ebc799d0efcb6d45c3cefc55a524f">deallocate</a>(<span class="keywordtype">void</span> *p, <a class="code" href="class_fixed_size_allocator_with_cleanup.html#bcc016350706c04d7a2660659a3d19f0">size_type</a> n)<a name="l00230"></a>00230         {<a name="l00231"></a>00231                 <span class="keywordflow">if</span> (p == GetAlignedArray())<a name="l00232"></a>00232                 {<a name="l00233"></a>00233                         assert(n &lt;= S);<a name="l00234"></a>00234                         assert(m_allocated);<a name="l00235"></a>00235                         m_allocated = <span class="keyword">false</span>;<a name="l00236"></a>00236                         memset(p, 0, n*<span class="keyword">sizeof</span>(T));<a name="l00237"></a>00237                 }<a name="l00238"></a>00238                 <span class="keywordflow">else</span><a name="l00239"></a>00239                         m_fallbackAllocator.deallocate(p, n);<a name="l00240"></a>00240         }<a name="l00241"></a>00241 <a name="l00242"></a><a class="code" href="class_fixed_size_allocator_with_cleanup.html#9068b6b8abec42a6c02f6fb7db5d3a03">00242</a>         <a class="code" href="class_fixed_size_allocator_with_cleanup.html#e3253e1533a1405e93aef8af443e9c16">pointer</a> <a class="code" href="class_fixed_size_allocator_with_cleanup.html#9068b6b8abec42a6c02f6fb7db5d3a03">reallocate</a>(<a class="code" href="class_fixed_size_allocator_with_cleanup.html#e3253e1533a1405e93aef8af443e9c16">pointer</a> p, <a class="code" href="class_fixed_size_allocator_with_cleanup.html#bcc016350706c04d7a2660659a3d19f0">size_type</a> oldSize, <a class="code" href="class_fixed_size_allocator_with_cleanup.html#bcc016350706c04d7a2660659a3d19f0">size_type</a> newSize, <span class="keywordtype">bool</span> preserve)<a name="l00243"></a>00243         {<a name="l00244"></a>00244                 <span class="keywordflow">if</span> (p == GetAlignedArray() &amp;&amp; newSize &lt;= S)<a name="l00245"></a>00245                 {<a name="l00246"></a>00246                         assert(oldSize &lt;= S);<a name="l00247"></a>00247                         <span class="keywordflow">if</span> (oldSize &gt; newSize)<a name="l00248"></a>00248                                 memset(p + newSize, 0, (oldSize-newSize)*<span class="keyword">sizeof</span>(T));<a name="l00249"></a>00249                         <span class="keywordflow">return</span> p;<a name="l00250"></a>00250                 }<a name="l00251"></a>00251 <a name="l00252"></a>00252                 <a class="code" href="class_fixed_size_allocator_with_cleanup.html#e3253e1533a1405e93aef8af443e9c16">pointer</a> newPointer = <a class="code" href="class_fixed_size_allocator_with_cleanup.html#53845df92db620ab0ae7ee5bc3d8b132">allocate</a>(newSize, NULL);<a name="l00253"></a>00253                 <span class="keywordflow">if</span> (preserve)<a name="l00254"></a>00254                         memcpy(newPointer, p, <span class="keyword">sizeof</span>(T)*STDMIN(oldSize, newSize));<a name="l00255"></a>00255                 <a class="code" href="class_fixed_size_allocator_with_cleanup.html#0d2ebc799d0efcb6d45c3cefc55a524f">deallocate</a>(p, oldSize);<a name="l00256"></a>00256                 <span class="keywordflow">return</span> newPointer;<a name="l00257"></a>00257         }<a name="l00258"></a>00258 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -