blob: b36ec4e11a108a473ba83e1bbb661d227b42ad02 [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/rand-0.8.5/src/rngs/adapter/reseeding.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>reseeding.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../../../normalize.css"><link rel="stylesheet" href="../../../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../../../ayu.css" disabled><link rel="stylesheet" href="../../../../dark.css" disabled><link rel="stylesheet" href="../../../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../../../storage.js"></script><script defer src="../../../../source-script.js"></script><script defer src="../../../../source-files.js"></script><script defer src="../../../../main.js"></script><noscript><link rel="stylesheet" href="../../../../noscript.css"></noscript><link rel="icon" href="https://www.rust-lang.org/favicon.ico"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../../../rand/index.html"><div class="logo-container">
<img src="https://www.rust-lang.org/logos/rust-logo-128x128-blk.png" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../../rand/index.html">
<img src="https://www.rust-lang.org/logos/rust-logo-128x128-blk.png" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span>
<span id="2">2</span>
<span id="3">3</span>
<span id="4">4</span>
<span id="5">5</span>
<span id="6">6</span>
<span id="7">7</span>
<span id="8">8</span>
<span id="9">9</span>
<span id="10">10</span>
<span id="11">11</span>
<span id="12">12</span>
<span id="13">13</span>
<span id="14">14</span>
<span id="15">15</span>
<span id="16">16</span>
<span id="17">17</span>
<span id="18">18</span>
<span id="19">19</span>
<span id="20">20</span>
<span id="21">21</span>
<span id="22">22</span>
<span id="23">23</span>
<span id="24">24</span>
<span id="25">25</span>
<span id="26">26</span>
<span id="27">27</span>
<span id="28">28</span>
<span id="29">29</span>
<span id="30">30</span>
<span id="31">31</span>
<span id="32">32</span>
<span id="33">33</span>
<span id="34">34</span>
<span id="35">35</span>
<span id="36">36</span>
<span id="37">37</span>
<span id="38">38</span>
<span id="39">39</span>
<span id="40">40</span>
<span id="41">41</span>
<span id="42">42</span>
<span id="43">43</span>
<span id="44">44</span>
<span id="45">45</span>
<span id="46">46</span>
<span id="47">47</span>
<span id="48">48</span>
<span id="49">49</span>
<span id="50">50</span>
<span id="51">51</span>
<span id="52">52</span>
<span id="53">53</span>
<span id="54">54</span>
<span id="55">55</span>
<span id="56">56</span>
<span id="57">57</span>
<span id="58">58</span>
<span id="59">59</span>
<span id="60">60</span>
<span id="61">61</span>
<span id="62">62</span>
<span id="63">63</span>
<span id="64">64</span>
<span id="65">65</span>
<span id="66">66</span>
<span id="67">67</span>
<span id="68">68</span>
<span id="69">69</span>
<span id="70">70</span>
<span id="71">71</span>
<span id="72">72</span>
<span id="73">73</span>
<span id="74">74</span>
<span id="75">75</span>
<span id="76">76</span>
<span id="77">77</span>
<span id="78">78</span>
<span id="79">79</span>
<span id="80">80</span>
<span id="81">81</span>
<span id="82">82</span>
<span id="83">83</span>
<span id="84">84</span>
<span id="85">85</span>
<span id="86">86</span>
<span id="87">87</span>
<span id="88">88</span>
<span id="89">89</span>
<span id="90">90</span>
<span id="91">91</span>
<span id="92">92</span>
<span id="93">93</span>
<span id="94">94</span>
<span id="95">95</span>
<span id="96">96</span>
<span id="97">97</span>
<span id="98">98</span>
<span id="99">99</span>
<span id="100">100</span>
<span id="101">101</span>
<span id="102">102</span>
<span id="103">103</span>
<span id="104">104</span>
<span id="105">105</span>
<span id="106">106</span>
<span id="107">107</span>
<span id="108">108</span>
<span id="109">109</span>
<span id="110">110</span>
<span id="111">111</span>
<span id="112">112</span>
<span id="113">113</span>
<span id="114">114</span>
<span id="115">115</span>
<span id="116">116</span>
<span id="117">117</span>
<span id="118">118</span>
<span id="119">119</span>
<span id="120">120</span>
<span id="121">121</span>
<span id="122">122</span>
<span id="123">123</span>
<span id="124">124</span>
<span id="125">125</span>
<span id="126">126</span>
<span id="127">127</span>
<span id="128">128</span>
<span id="129">129</span>
<span id="130">130</span>
<span id="131">131</span>
<span id="132">132</span>
<span id="133">133</span>
<span id="134">134</span>
<span id="135">135</span>
<span id="136">136</span>
<span id="137">137</span>
<span id="138">138</span>
<span id="139">139</span>
<span id="140">140</span>
<span id="141">141</span>
<span id="142">142</span>
<span id="143">143</span>
<span id="144">144</span>
<span id="145">145</span>
<span id="146">146</span>
<span id="147">147</span>
<span id="148">148</span>
<span id="149">149</span>
<span id="150">150</span>
<span id="151">151</span>
<span id="152">152</span>
<span id="153">153</span>
<span id="154">154</span>
<span id="155">155</span>
<span id="156">156</span>
<span id="157">157</span>
<span id="158">158</span>
<span id="159">159</span>
<span id="160">160</span>
<span id="161">161</span>
<span id="162">162</span>
<span id="163">163</span>
<span id="164">164</span>
<span id="165">165</span>
<span id="166">166</span>
<span id="167">167</span>
<span id="168">168</span>
<span id="169">169</span>
<span id="170">170</span>
<span id="171">171</span>
<span id="172">172</span>
<span id="173">173</span>
<span id="174">174</span>
<span id="175">175</span>
<span id="176">176</span>
<span id="177">177</span>
<span id="178">178</span>
<span id="179">179</span>
<span id="180">180</span>
<span id="181">181</span>
<span id="182">182</span>
<span id="183">183</span>
<span id="184">184</span>
<span id="185">185</span>
<span id="186">186</span>
<span id="187">187</span>
<span id="188">188</span>
<span id="189">189</span>
<span id="190">190</span>
<span id="191">191</span>
<span id="192">192</span>
<span id="193">193</span>
<span id="194">194</span>
<span id="195">195</span>
<span id="196">196</span>
<span id="197">197</span>
<span id="198">198</span>
<span id="199">199</span>
<span id="200">200</span>
<span id="201">201</span>
<span id="202">202</span>
<span id="203">203</span>
<span id="204">204</span>
<span id="205">205</span>
<span id="206">206</span>
<span id="207">207</span>
<span id="208">208</span>
<span id="209">209</span>
<span id="210">210</span>
<span id="211">211</span>
<span id="212">212</span>
<span id="213">213</span>
<span id="214">214</span>
<span id="215">215</span>
<span id="216">216</span>
<span id="217">217</span>
<span id="218">218</span>
<span id="219">219</span>
<span id="220">220</span>
<span id="221">221</span>
<span id="222">222</span>
<span id="223">223</span>
<span id="224">224</span>
<span id="225">225</span>
<span id="226">226</span>
<span id="227">227</span>
<span id="228">228</span>
<span id="229">229</span>
<span id="230">230</span>
<span id="231">231</span>
<span id="232">232</span>
<span id="233">233</span>
<span id="234">234</span>
<span id="235">235</span>
<span id="236">236</span>
<span id="237">237</span>
<span id="238">238</span>
<span id="239">239</span>
<span id="240">240</span>
<span id="241">241</span>
<span id="242">242</span>
<span id="243">243</span>
<span id="244">244</span>
<span id="245">245</span>
<span id="246">246</span>
<span id="247">247</span>
<span id="248">248</span>
<span id="249">249</span>
<span id="250">250</span>
<span id="251">251</span>
<span id="252">252</span>
<span id="253">253</span>
<span id="254">254</span>
<span id="255">255</span>
<span id="256">256</span>
<span id="257">257</span>
<span id="258">258</span>
<span id="259">259</span>
<span id="260">260</span>
<span id="261">261</span>
<span id="262">262</span>
<span id="263">263</span>
<span id="264">264</span>
<span id="265">265</span>
<span id="266">266</span>
<span id="267">267</span>
<span id="268">268</span>
<span id="269">269</span>
<span id="270">270</span>
<span id="271">271</span>
<span id="272">272</span>
<span id="273">273</span>
<span id="274">274</span>
<span id="275">275</span>
<span id="276">276</span>
<span id="277">277</span>
<span id="278">278</span>
<span id="279">279</span>
<span id="280">280</span>
<span id="281">281</span>
<span id="282">282</span>
<span id="283">283</span>
<span id="284">284</span>
<span id="285">285</span>
<span id="286">286</span>
<span id="287">287</span>
<span id="288">288</span>
<span id="289">289</span>
<span id="290">290</span>
<span id="291">291</span>
<span id="292">292</span>
<span id="293">293</span>
<span id="294">294</span>
<span id="295">295</span>
<span id="296">296</span>
<span id="297">297</span>
<span id="298">298</span>
<span id="299">299</span>
<span id="300">300</span>
<span id="301">301</span>
<span id="302">302</span>
<span id="303">303</span>
<span id="304">304</span>
<span id="305">305</span>
<span id="306">306</span>
<span id="307">307</span>
<span id="308">308</span>
<span id="309">309</span>
<span id="310">310</span>
<span id="311">311</span>
<span id="312">312</span>
<span id="313">313</span>
<span id="314">314</span>
<span id="315">315</span>
<span id="316">316</span>
<span id="317">317</span>
<span id="318">318</span>
<span id="319">319</span>
<span id="320">320</span>
<span id="321">321</span>
<span id="322">322</span>
<span id="323">323</span>
<span id="324">324</span>
<span id="325">325</span>
<span id="326">326</span>
<span id="327">327</span>
<span id="328">328</span>
<span id="329">329</span>
<span id="330">330</span>
<span id="331">331</span>
<span id="332">332</span>
<span id="333">333</span>
<span id="334">334</span>
<span id="335">335</span>
<span id="336">336</span>
<span id="337">337</span>
<span id="338">338</span>
<span id="339">339</span>
<span id="340">340</span>
<span id="341">341</span>
<span id="342">342</span>
<span id="343">343</span>
<span id="344">344</span>
<span id="345">345</span>
<span id="346">346</span>
<span id="347">347</span>
<span id="348">348</span>
<span id="349">349</span>
<span id="350">350</span>
<span id="351">351</span>
<span id="352">352</span>
<span id="353">353</span>
<span id="354">354</span>
<span id="355">355</span>
<span id="356">356</span>
<span id="357">357</span>
<span id="358">358</span>
<span id="359">359</span>
<span id="360">360</span>
<span id="361">361</span>
<span id="362">362</span>
<span id="363">363</span>
<span id="364">364</span>
<span id="365">365</span>
<span id="366">366</span>
<span id="367">367</span>
<span id="368">368</span>
<span id="369">369</span>
<span id="370">370</span>
<span id="371">371</span>
<span id="372">372</span>
<span id="373">373</span>
<span id="374">374</span>
<span id="375">375</span>
<span id="376">376</span>
<span id="377">377</span>
<span id="378">378</span>
<span id="379">379</span>
<span id="380">380</span>
<span id="381">381</span>
<span id="382">382</span>
<span id="383">383</span>
<span id="384">384</span>
<span id="385">385</span>
<span id="386">386</span>
</pre><pre class="rust"><code><span class="comment">// Copyright 2018 Developers of the Rand project.
// Copyright 2013 The Rust Project Developers.
//
// Licensed under the Apache License, Version 2.0 &lt;LICENSE-APACHE or
// https://www.apache.org/licenses/LICENSE-2.0&gt; or the MIT license
// &lt;LICENSE-MIT or https://opensource.org/licenses/MIT&gt;, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
</span><span class="doccomment">//! A wrapper around another PRNG that reseeds it after it
//! generates a certain number of random bytes.
</span><span class="kw">use </span>core::mem::size_of;
<span class="kw">use </span>rand_core::block::{BlockRng, BlockRngCore};
<span class="kw">use </span>rand_core::{CryptoRng, Error, RngCore, SeedableRng};
<span class="doccomment">/// A wrapper around any PRNG that implements [`BlockRngCore`], that adds the
/// ability to reseed it.
///
/// `ReseedingRng` reseeds the underlying PRNG in the following cases:
///
/// - On a manual call to [`reseed()`].
/// - After `clone()`, the clone will be reseeded on first use.
/// - When a process is forked on UNIX, the RNGs in both the parent and child
/// processes will be reseeded just before the next call to
/// [`BlockRngCore::generate`], i.e. &quot;soon&quot;. For ChaCha and Hc128 this is a
/// maximum of fifteen `u32` values before reseeding.
/// - After the PRNG has generated a configurable number of random bytes.
///
/// # When should reseeding after a fixed number of generated bytes be used?
///
/// Reseeding after a fixed number of generated bytes is never strictly
/// *necessary*. Cryptographic PRNGs don&#39;t have a limited number of bytes they
/// can output, or at least not a limit reachable in any practical way. There is
/// no such thing as &#39;running out of entropy&#39;.
///
/// Occasionally reseeding can be seen as some form of &#39;security in depth&#39;. Even
/// if in the future a cryptographic weakness is found in the CSPRNG being used,
/// or a flaw in the implementation, occasionally reseeding should make
/// exploiting it much more difficult or even impossible.
///
/// Use [`ReseedingRng::new`] with a `threshold` of `0` to disable reseeding
/// after a fixed number of generated bytes.
///
/// # Limitations
///
/// It is recommended that a `ReseedingRng` (including `ThreadRng`) not be used
/// from a fork handler.
/// Use `OsRng` or `getrandom`, or defer your use of the RNG until later.
///
/// # Error handling
///
/// Although unlikely, reseeding the wrapped PRNG can fail. `ReseedingRng` will
/// never panic but try to handle the error intelligently through some
/// combination of retrying and delaying reseeding until later.
/// If handling the source error fails `ReseedingRng` will continue generating
/// data from the wrapped PRNG without reseeding.
///
/// Manually calling [`reseed()`] will not have this retry or delay logic, but
/// reports the error.
///
/// # Example
///
/// ```
/// use rand::prelude::*;
/// use rand_chacha::ChaCha20Core; // Internal part of ChaChaRng that
/// // implements BlockRngCore
/// use rand::rngs::OsRng;
/// use rand::rngs::adapter::ReseedingRng;
///
/// let prng = ChaCha20Core::from_entropy();
/// let mut reseeding_rng = ReseedingRng::new(prng, 0, OsRng);
///
/// println!(&quot;{}&quot;, reseeding_rng.gen::&lt;u64&gt;());
///
/// let mut cloned_rng = reseeding_rng.clone();
/// assert!(reseeding_rng.gen::&lt;u64&gt;() != cloned_rng.gen::&lt;u64&gt;());
/// ```
///
/// [`BlockRngCore`]: rand_core::block::BlockRngCore
/// [`ReseedingRng::new`]: ReseedingRng::new
/// [`reseed()`]: ReseedingRng::reseed
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>ReseedingRng&lt;R, Rsdr&gt;(BlockRng&lt;ReseedingCore&lt;R, Rsdr&gt;&gt;)
<span class="kw">where
</span>R: BlockRngCore + SeedableRng,
Rsdr: RngCore;
<span class="kw">impl</span>&lt;R, Rsdr&gt; ReseedingRng&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore + SeedableRng,
Rsdr: RngCore,
{
<span class="doccomment">/// Create a new `ReseedingRng` from an existing PRNG, combined with a RNG
/// to use as reseeder.
///
/// `threshold` sets the number of generated bytes after which to reseed the
/// PRNG. Set it to zero to never reseed based on the number of generated
/// values.
</span><span class="kw">pub fn </span>new(rng: R, threshold: u64, reseeder: Rsdr) -&gt; <span class="self">Self </span>{
ReseedingRng(BlockRng::new(ReseedingCore::new(rng, threshold, reseeder)))
}
<span class="doccomment">/// Reseed the internal PRNG.
</span><span class="kw">pub fn </span>reseed(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), Error&gt; {
<span class="self">self</span>.<span class="number">0</span>.core.reseed()
}
}
<span class="comment">// TODO: this should be implemented for any type where the inner type
// implements RngCore, but we can&#39;t specify that because ReseedingCore is private
</span><span class="kw">impl</span>&lt;R, Rsdr: RngCore&gt; RngCore <span class="kw">for </span>ReseedingRng&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore&lt;Item = u32&gt; + SeedableRng,
&lt;R <span class="kw">as </span>BlockRngCore&gt;::Results: AsRef&lt;[u32]&gt; + AsMut&lt;[u32]&gt;,
{
<span class="attribute">#[inline(always)]
</span><span class="kw">fn </span>next_u32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u32 {
<span class="self">self</span>.<span class="number">0</span>.next_u32()
}
<span class="attribute">#[inline(always)]
</span><span class="kw">fn </span>next_u64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u64 {
<span class="self">self</span>.<span class="number">0</span>.next_u64()
}
<span class="kw">fn </span>fill_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, dest: <span class="kw-2">&amp;mut </span>[u8]) {
<span class="self">self</span>.<span class="number">0</span>.fill_bytes(dest)
}
<span class="kw">fn </span>try_fill_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, dest: <span class="kw-2">&amp;mut </span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;(), Error&gt; {
<span class="self">self</span>.<span class="number">0</span>.try_fill_bytes(dest)
}
}
<span class="kw">impl</span>&lt;R, Rsdr&gt; Clone <span class="kw">for </span>ReseedingRng&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore + SeedableRng + Clone,
Rsdr: RngCore + Clone,
{
<span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; ReseedingRng&lt;R, Rsdr&gt; {
<span class="comment">// Recreating `BlockRng` seems easier than cloning it and resetting
// the index.
</span>ReseedingRng(BlockRng::new(<span class="self">self</span>.<span class="number">0</span>.core.clone()))
}
}
<span class="kw">impl</span>&lt;R, Rsdr&gt; CryptoRng <span class="kw">for </span>ReseedingRng&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore + SeedableRng + CryptoRng,
Rsdr: RngCore + CryptoRng,
{
}
<span class="attribute">#[derive(Debug)]
</span><span class="kw">struct </span>ReseedingCore&lt;R, Rsdr&gt; {
inner: R,
reseeder: Rsdr,
threshold: i64,
bytes_until_reseed: i64,
fork_counter: usize,
}
<span class="kw">impl</span>&lt;R, Rsdr&gt; BlockRngCore <span class="kw">for </span>ReseedingCore&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore + SeedableRng,
Rsdr: RngCore,
{
<span class="kw">type </span>Item = &lt;R <span class="kw">as </span>BlockRngCore&gt;::Item;
<span class="kw">type </span>Results = &lt;R <span class="kw">as </span>BlockRngCore&gt;::Results;
<span class="kw">fn </span>generate(<span class="kw-2">&amp;mut </span><span class="self">self</span>, results: <span class="kw-2">&amp;mut </span><span class="self">Self</span>::Results) {
<span class="kw">let </span>global_fork_counter = fork::get_fork_counter();
<span class="kw">if </span><span class="self">self</span>.bytes_until_reseed &lt;= <span class="number">0 </span>|| <span class="self">self</span>.is_forked(global_fork_counter) {
<span class="comment">// We get better performance by not calling only `reseed` here
// and continuing with the rest of the function, but by directly
// returning from a non-inlined function.
</span><span class="kw">return </span><span class="self">self</span>.reseed_and_generate(results, global_fork_counter);
}
<span class="kw">let </span>num_bytes = results.as_ref().len() * size_of::&lt;<span class="self">Self</span>::Item&gt;();
<span class="self">self</span>.bytes_until_reseed -= num_bytes <span class="kw">as </span>i64;
<span class="self">self</span>.inner.generate(results);
}
}
<span class="kw">impl</span>&lt;R, Rsdr&gt; ReseedingCore&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore + SeedableRng,
Rsdr: RngCore,
{
<span class="doccomment">/// Create a new `ReseedingCore`.
</span><span class="kw">fn </span>new(rng: R, threshold: u64, reseeder: Rsdr) -&gt; <span class="self">Self </span>{
<span class="kw">use </span>::core::i64::MAX;
fork::register_fork_handler();
<span class="comment">// Because generating more values than `i64::MAX` takes centuries on
// current hardware, we just clamp to that value.
// Also we set a threshold of 0, which indicates no limit, to that
// value.
</span><span class="kw">let </span>threshold = <span class="kw">if </span>threshold == <span class="number">0 </span>{
MAX
} <span class="kw">else if </span>threshold &lt;= MAX <span class="kw">as </span>u64 {
threshold <span class="kw">as </span>i64
} <span class="kw">else </span>{
MAX
};
ReseedingCore {
inner: rng,
reseeder,
threshold: threshold <span class="kw">as </span>i64,
bytes_until_reseed: threshold <span class="kw">as </span>i64,
fork_counter: <span class="number">0</span>,
}
}
<span class="doccomment">/// Reseed the internal PRNG.
</span><span class="kw">fn </span>reseed(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), Error&gt; {
R::from_rng(<span class="kw-2">&amp;mut </span><span class="self">self</span>.reseeder).map(|result| {
<span class="self">self</span>.bytes_until_reseed = <span class="self">self</span>.threshold;
<span class="self">self</span>.inner = result
})
}
<span class="kw">fn </span>is_forked(<span class="kw-2">&amp;</span><span class="self">self</span>, global_fork_counter: usize) -&gt; bool {
<span class="comment">// In theory, on 32-bit platforms, it is possible for
// `global_fork_counter` to wrap around after ~4e9 forks.
//
// This check will detect a fork in the normal case where
// `fork_counter &lt; global_fork_counter`, and also when the difference
// between both is greater than `isize::MAX` (wrapped around).
//
// It will still fail to detect a fork if there have been more than
// `isize::MAX` forks, without any reseed in between. Seems unlikely
// enough.
</span>(<span class="self">self</span>.fork_counter.wrapping_sub(global_fork_counter) <span class="kw">as </span>isize) &lt; <span class="number">0
</span>}
<span class="attribute">#[inline(never)]
</span><span class="kw">fn </span>reseed_and_generate(
<span class="kw-2">&amp;mut </span><span class="self">self</span>, results: <span class="kw-2">&amp;mut </span>&lt;<span class="self">Self </span><span class="kw">as </span>BlockRngCore&gt;::Results, global_fork_counter: usize,
) {
<span class="attribute">#![allow(clippy::if_same_then_else)] </span><span class="comment">// false positive
</span><span class="kw">if </span><span class="self">self</span>.is_forked(global_fork_counter) {
<span class="macro">info!</span>(<span class="string">&quot;Fork detected, reseeding RNG&quot;</span>);
} <span class="kw">else </span>{
<span class="macro">trace!</span>(<span class="string">&quot;Reseeding RNG (periodic reseed)&quot;</span>);
}
<span class="kw">let </span>num_bytes = results.as_ref().len() * size_of::&lt;&lt;R <span class="kw">as </span>BlockRngCore&gt;::Item&gt;();
<span class="kw">if let </span><span class="prelude-val">Err</span>(e) = <span class="self">self</span>.reseed() {
<span class="macro">warn!</span>(<span class="string">&quot;Reseeding RNG failed: {}&quot;</span>, e);
<span class="kw">let _ </span>= e;
}
<span class="self">self</span>.fork_counter = global_fork_counter;
<span class="self">self</span>.bytes_until_reseed = <span class="self">self</span>.threshold - num_bytes <span class="kw">as </span>i64;
<span class="self">self</span>.inner.generate(results);
}
}
<span class="kw">impl</span>&lt;R, Rsdr&gt; Clone <span class="kw">for </span>ReseedingCore&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore + SeedableRng + Clone,
Rsdr: RngCore + Clone,
{
<span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; ReseedingCore&lt;R, Rsdr&gt; {
ReseedingCore {
inner: <span class="self">self</span>.inner.clone(),
reseeder: <span class="self">self</span>.reseeder.clone(),
threshold: <span class="self">self</span>.threshold,
bytes_until_reseed: <span class="number">0</span>, <span class="comment">// reseed clone on first use
</span>fork_counter: <span class="self">self</span>.fork_counter,
}
}
}
<span class="kw">impl</span>&lt;R, Rsdr&gt; CryptoRng <span class="kw">for </span>ReseedingCore&lt;R, Rsdr&gt;
<span class="kw">where
</span>R: BlockRngCore + SeedableRng + CryptoRng,
Rsdr: RngCore + CryptoRng,
{
}
<span class="attribute">#[cfg(all(unix, not(target_os = <span class="string">&quot;emscripten&quot;</span>)))]
</span><span class="kw">mod </span>fork {
<span class="kw">use </span>core::sync::atomic::{AtomicUsize, Ordering};
<span class="kw">use </span>std::sync::Once;
<span class="comment">// Fork protection
//
// We implement fork protection on Unix using `pthread_atfork`.
// When the process is forked, we increment `RESEEDING_RNG_FORK_COUNTER`.
// Every `ReseedingRng` stores the last known value of the static in
// `fork_counter`. If the cached `fork_counter` is less than
// `RESEEDING_RNG_FORK_COUNTER`, it is time to reseed this RNG.
//
// If reseeding fails, we don&#39;t deal with this by setting a delay, but just
// don&#39;t update `fork_counter`, so a reseed is attempted as soon as
// possible.
</span><span class="kw">static </span>RESEEDING_RNG_FORK_COUNTER: AtomicUsize = AtomicUsize::new(<span class="number">0</span>);
<span class="kw">pub fn </span>get_fork_counter() -&gt; usize {
RESEEDING_RNG_FORK_COUNTER.load(Ordering::Relaxed)
}
<span class="kw">extern </span><span class="string">&quot;C&quot; </span><span class="kw">fn </span>fork_handler() {
<span class="comment">// Note: fetch_add is defined to wrap on overflow
// (which is what we want).
</span>RESEEDING_RNG_FORK_COUNTER.fetch_add(<span class="number">1</span>, Ordering::Relaxed);
}
<span class="kw">pub fn </span>register_fork_handler() {
<span class="kw">static </span>REGISTER: Once = Once::new();
REGISTER.call_once(|| {
<span class="comment">// Bump the counter before and after forking (see #1169):
</span><span class="kw">let </span>ret = <span class="kw">unsafe </span>{ libc::pthread_atfork(
<span class="prelude-val">Some</span>(fork_handler),
<span class="prelude-val">Some</span>(fork_handler),
<span class="prelude-val">Some</span>(fork_handler),
) };
<span class="kw">if </span>ret != <span class="number">0 </span>{
<span class="macro">panic!</span>(<span class="string">&quot;libc::pthread_atfork failed with code {}&quot;</span>, ret);
}
});
}
}
<span class="attribute">#[cfg(not(all(unix, not(target_os = <span class="string">&quot;emscripten&quot;</span>))))]
</span><span class="kw">mod </span>fork {
<span class="kw">pub fn </span>get_fork_counter() -&gt; usize {
<span class="number">0
</span>}
<span class="kw">pub fn </span>register_fork_handler() {}
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;std_rng&quot;</span>)]
#[cfg(test)]
</span><span class="kw">mod </span>test {
<span class="kw">use </span><span class="kw">super</span>::ReseedingRng;
<span class="kw">use </span><span class="kw">crate</span>::rngs::mock::StepRng;
<span class="kw">use </span><span class="kw">crate</span>::rngs::std::Core;
<span class="kw">use crate</span>::{Rng, SeedableRng};
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_reseeding() {
<span class="kw">let </span><span class="kw-2">mut </span>zero = StepRng::new(<span class="number">0</span>, <span class="number">0</span>);
<span class="kw">let </span>rng = Core::from_rng(<span class="kw-2">&amp;mut </span>zero).unwrap();
<span class="kw">let </span>thresh = <span class="number">1</span>; <span class="comment">// reseed every time the buffer is exhausted
</span><span class="kw">let </span><span class="kw-2">mut </span>reseeding = ReseedingRng::new(rng, thresh, zero);
<span class="comment">// RNG buffer size is [u32; 64]
// Debug is only implemented up to length 32 so use two arrays
</span><span class="kw">let </span><span class="kw-2">mut </span>buf = ([<span class="number">0u32</span>; <span class="number">32</span>], [<span class="number">0u32</span>; <span class="number">32</span>]);
reseeding.fill(<span class="kw-2">&amp;mut </span>buf.<span class="number">0</span>);
reseeding.fill(<span class="kw-2">&amp;mut </span>buf.<span class="number">1</span>);
<span class="kw">let </span>seq = buf;
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">10 </span>{
reseeding.fill(<span class="kw-2">&amp;mut </span>buf.<span class="number">0</span>);
reseeding.fill(<span class="kw-2">&amp;mut </span>buf.<span class="number">1</span>);
<span class="macro">assert_eq!</span>(buf, seq);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_clone_reseeding() {
<span class="attribute">#![allow(clippy::redundant_clone)]
</span><span class="kw">let </span><span class="kw-2">mut </span>zero = StepRng::new(<span class="number">0</span>, <span class="number">0</span>);
<span class="kw">let </span>rng = Core::from_rng(<span class="kw-2">&amp;mut </span>zero).unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>rng1 = ReseedingRng::new(rng, <span class="number">32 </span>* <span class="number">4</span>, zero);
<span class="kw">let </span>first: u32 = rng1.gen();
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">10 </span>{
<span class="kw">let _ </span>= rng1.gen::&lt;u32&gt;();
}
<span class="kw">let </span><span class="kw-2">mut </span>rng2 = rng1.clone();
<span class="macro">assert_eq!</span>(first, rng2.gen::&lt;u32&gt;());
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../../../" data-current-crate="rand" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>