blob: 6b4b29786410c7abb499a6b80c7a864212119e43 [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/tokio-1.28.2/src/sync/task/atomic_waker.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>atomic_waker.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="alternate icon" type="image/png" href="../../../../favicon-16x16.png"><link rel="alternate icon" type="image/png" href="../../../../favicon-32x32.png"><link rel="icon" type="image/svg+xml" href="../../../../favicon.svg"></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="../../../../tokio/index.html"><div class="logo-container"><img class="rust-logo" src="../../../../rust-logo.svg" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../../tokio/index.html"><img class="rust-logo" src="../../../../rust-logo.svg" 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>
</pre><pre class="rust"><code><span class="attribute">#![cfg_attr(any(loom, not(feature = <span class="string">&quot;sync&quot;</span>)), allow(dead_code, unreachable_pub))]
</span><span class="kw">use </span><span class="kw">crate</span>::loom::cell::UnsafeCell;
<span class="kw">use </span><span class="kw">crate</span>::loom::hint;
<span class="kw">use </span><span class="kw">crate</span>::loom::sync::atomic::AtomicUsize;
<span class="kw">use </span>std::fmt;
<span class="kw">use </span>std::panic::{resume_unwind, AssertUnwindSafe, RefUnwindSafe, UnwindSafe};
<span class="kw">use </span>std::sync::atomic::Ordering::{AcqRel, Acquire, Release};
<span class="kw">use </span>std::task::Waker;
<span class="doccomment">/// A synchronization primitive for task waking.
///
/// `AtomicWaker` will coordinate concurrent wakes with the consumer
/// potentially &quot;waking&quot; the underlying task. This is useful in scenarios
/// where a computation completes in another thread and wants to wake the
/// consumer, but the consumer is in the process of being migrated to a new
/// logical task.
///
/// Consumers should call `register` before checking the result of a computation
/// and producers should call `wake` after producing the computation (this
/// differs from the usual `thread::park` pattern). It is also permitted for
/// `wake` to be called **before** `register`. This results in a no-op.
///
/// A single `AtomicWaker` may be reused for any number of calls to `register` or
/// `wake`.
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">struct </span>AtomicWaker {
state: AtomicUsize,
waker: UnsafeCell&lt;<span class="prelude-ty">Option</span>&lt;Waker&gt;&gt;,
}
<span class="kw">impl </span>RefUnwindSafe <span class="kw">for </span>AtomicWaker {}
<span class="kw">impl </span>UnwindSafe <span class="kw">for </span>AtomicWaker {}
<span class="comment">// `AtomicWaker` is a multi-consumer, single-producer transfer cell. The cell
// stores a `Waker` value produced by calls to `register` and many threads can
// race to take the waker by calling `wake`.
//
// If a new `Waker` instance is produced by calling `register` before an existing
// one is consumed, then the existing one is overwritten.
//
// While `AtomicWaker` is single-producer, the implementation ensures memory
// safety. In the event of concurrent calls to `register`, there will be a
// single winner whose waker will get stored in the cell. The losers will not
// have their tasks woken. As such, callers should ensure to add synchronization
// to calls to `register`.
//
// The implementation uses a single `AtomicUsize` value to coordinate access to
// the `Waker` cell. There are two bits that are operated on independently. These
// are represented by `REGISTERING` and `WAKING`.
//
// The `REGISTERING` bit is set when a producer enters the critical section. The
// `WAKING` bit is set when a consumer enters the critical section. Neither
// bit being set is represented by `WAITING`.
//
// A thread obtains an exclusive lock on the waker cell by transitioning the
// state from `WAITING` to `REGISTERING` or `WAKING`, depending on the
// operation the thread wishes to perform. When this transition is made, it is
// guaranteed that no other thread will access the waker cell.
//
// # Registering
//
// On a call to `register`, an attempt to transition the state from WAITING to
// REGISTERING is made. On success, the caller obtains a lock on the waker cell.
//
// If the lock is obtained, then the thread sets the waker cell to the waker
// provided as an argument. Then it attempts to transition the state back from
// `REGISTERING` -&gt; `WAITING`.
//
// If this transition is successful, then the registering process is complete
// and the next call to `wake` will observe the waker.
//
// If the transition fails, then there was a concurrent call to `wake` that
// was unable to access the waker cell (due to the registering thread holding the
// lock). To handle this, the registering thread removes the waker it just set
// from the cell and calls `wake` on it. This call to wake represents the
// attempt to wake by the other thread (that set the `WAKING` bit). The
// state is then transitioned from `REGISTERING | WAKING` back to `WAITING`.
// This transition must succeed because, at this point, the state cannot be
// transitioned by another thread.
//
// # Waking
//
// On a call to `wake`, an attempt to transition the state from `WAITING` to
// `WAKING` is made. On success, the caller obtains a lock on the waker cell.
//
// If the lock is obtained, then the thread takes ownership of the current value
// in the waker cell, and calls `wake` on it. The state is then transitioned
// back to `WAITING`. This transition must succeed as, at this point, the state
// cannot be transitioned by another thread.
//
// If the thread is unable to obtain the lock, the `WAKING` bit is still set.
// This is because it has either been set by the current thread but the previous
// value included the `REGISTERING` bit **or** a concurrent thread is in the
// `WAKING` critical section. Either way, no action must be taken.
//
// If the current thread is the only concurrent call to `wake` and another
// thread is in the `register` critical section, when the other thread **exits**
// the `register` critical section, it will observe the `WAKING` bit and
// handle the waker itself.
//
// If another thread is in the `waker` critical section, then it will handle
// waking the caller task.
//
// # A potential race (is safely handled).
//
// Imagine the following situation:
//
// * Thread A obtains the `wake` lock and wakes a task.
//
// * Before thread A releases the `wake` lock, the woken task is scheduled.
//
// * Thread B attempts to wake the task. In theory this should result in the
// task being woken, but it cannot because thread A still holds the wake
// lock.
//
// This case is handled by requiring users of `AtomicWaker` to call `register`
// **before** attempting to observe the application state change that resulted
// in the task being woken. The wakers also change the application state
// before calling wake.
//
// Because of this, the task will do one of two things.
//
// 1) Observe the application state change that Thread B is waking on. In
// this case, it is OK for Thread B&#39;s wake to be lost.
//
// 2) Call register before attempting to observe the application state. Since
// Thread A still holds the `wake` lock, the call to `register` will result
// in the task waking itself and get scheduled again.
</span><span class="doccomment">/// Idle state.
</span><span class="kw">const </span>WAITING: usize = <span class="number">0</span>;
<span class="doccomment">/// A new waker value is being registered with the `AtomicWaker` cell.
</span><span class="kw">const </span>REGISTERING: usize = <span class="number">0b01</span>;
<span class="doccomment">/// The task currently registered with the `AtomicWaker` cell is being woken.
</span><span class="kw">const </span>WAKING: usize = <span class="number">0b10</span>;
<span class="kw">impl </span>AtomicWaker {
<span class="doccomment">/// Create an `AtomicWaker`
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>new() -&gt; AtomicWaker {
AtomicWaker {
state: AtomicUsize::new(WAITING),
waker: UnsafeCell::new(<span class="prelude-val">None</span>),
}
}
<span class="comment">/*
/// Registers the current waker to be notified on calls to `wake`.
pub(crate) fn register(&amp;self, waker: Waker) {
self.do_register(waker);
}
*/
</span><span class="doccomment">/// Registers the provided waker to be notified on calls to `wake`.
///
/// The new waker will take place of any previous wakers that were registered
/// by previous calls to `register`. Any calls to `wake` that happen after
/// a call to `register` (as defined by the memory ordering rules), will
/// wake the `register` caller&#39;s task.
///
/// It is safe to call `register` with multiple other threads concurrently
/// calling `wake`. This will result in the `register` caller&#39;s current
/// task being woken once.
///
/// This function is safe to call concurrently, but this is generally a bad
/// idea. Concurrent calls to `register` will attempt to register different
/// tasks to be woken. One of the callers will win and have its task set,
/// but there is no guarantee as to which caller will succeed.
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>register_by_ref(<span class="kw-2">&amp;</span><span class="self">self</span>, waker: <span class="kw-2">&amp;</span>Waker) {
<span class="self">self</span>.do_register(waker);
}
<span class="kw">fn </span>do_register&lt;W&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, waker: W)
<span class="kw">where
</span>W: WakerRef,
{
<span class="kw">fn </span>catch_unwind&lt;F: FnOnce() -&gt; R, R&gt;(f: F) -&gt; std::thread::Result&lt;R&gt; {
std::panic::catch_unwind(AssertUnwindSafe(f))
}
<span class="kw">match </span><span class="self">self
</span>.state
.compare_exchange(WAITING, REGISTERING, Acquire, Acquire)
.unwrap_or_else(|x| x)
{
WAITING =&gt; {
<span class="kw">unsafe </span>{
<span class="comment">// If `into_waker` panics (because it&#39;s code outside of
// AtomicWaker) we need to prime a guard that is called on
// unwind to restore the waker to a WAITING state. Otherwise
// any future calls to register will incorrectly be stuck
// believing it&#39;s being updated by someone else.
</span><span class="kw">let </span>new_waker_or_panic = catch_unwind(<span class="kw">move </span>|| waker.into_waker());
<span class="comment">// Set the field to contain the new waker, or if
// `into_waker` panicked, leave the old value.
</span><span class="kw">let </span><span class="kw-2">mut </span>maybe_panic = <span class="prelude-val">None</span>;
<span class="kw">let </span><span class="kw-2">mut </span>old_waker = <span class="prelude-val">None</span>;
<span class="kw">match </span>new_waker_or_panic {
<span class="prelude-val">Ok</span>(new_waker) =&gt; {
old_waker = <span class="self">self</span>.waker.with_mut(|t| (<span class="kw-2">*</span>t).take());
<span class="self">self</span>.waker.with_mut(|t| <span class="kw-2">*</span>t = <span class="prelude-val">Some</span>(new_waker));
}
<span class="prelude-val">Err</span>(panic) =&gt; maybe_panic = <span class="prelude-val">Some</span>(panic),
}
<span class="comment">// Release the lock. If the state transitioned to include
// the `WAKING` bit, this means that a wake has been
// called concurrently, so we have to remove the waker and
// wake it.`
//
// Start by assuming that the state is `REGISTERING` as this
// is what we jut set it to.
</span><span class="kw">let </span>res = <span class="self">self
</span>.state
.compare_exchange(REGISTERING, WAITING, AcqRel, Acquire);
<span class="kw">match </span>res {
<span class="prelude-val">Ok</span>(<span class="kw">_</span>) =&gt; {
<span class="comment">// We don&#39;t want to give the caller the panic if it
// was someone else who put in that waker.
</span><span class="kw">let _ </span>= catch_unwind(<span class="kw">move </span>|| {
drop(old_waker);
});
}
<span class="prelude-val">Err</span>(actual) =&gt; {
<span class="comment">// This branch can only be reached if a
// concurrent thread called `wake`. In this
// case, `actual` **must** be `REGISTERING |
// WAKING`.
</span><span class="macro">debug_assert_eq!</span>(actual, REGISTERING | WAKING);
<span class="comment">// Take the waker to wake once the atomic operation has
// completed.
</span><span class="kw">let </span><span class="kw-2">mut </span>waker = <span class="self">self</span>.waker.with_mut(|t| (<span class="kw-2">*</span>t).take());
<span class="comment">// Just swap, because no one could change state
// while state == `Registering | `Waking`
</span><span class="self">self</span>.state.swap(WAITING, AcqRel);
<span class="comment">// If `into_waker` panicked, then the waker in the
// waker slot is actually the old waker.
</span><span class="kw">if </span>maybe_panic.is_some() {
old_waker = waker.take();
}
<span class="comment">// We don&#39;t want to give the caller the panic if it
// was someone else who put in that waker.
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(old_waker) = old_waker {
<span class="kw">let _ </span>= catch_unwind(<span class="kw">move </span>|| {
old_waker.wake();
});
}
<span class="comment">// The atomic swap was complete, now wake the waker
// and return.
//
// If this panics, we end up in a consumed state and
// return the panic to the caller.
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(waker) = waker {
<span class="macro">debug_assert!</span>(maybe_panic.is_none());
waker.wake();
}
}
}
<span class="kw">if let </span><span class="prelude-val">Some</span>(panic) = maybe_panic {
<span class="comment">// If `into_waker` panicked, return the panic to the caller.
</span>resume_unwind(panic);
}
}
}
WAKING =&gt; {
<span class="comment">// Currently in the process of waking the task, i.e.,
// `wake` is currently being called on the old waker.
// So, we call wake on the new waker.
//
// If this panics, someone else is responsible for restoring the
// state of the waker.
</span>waker.wake();
<span class="comment">// This is equivalent to a spin lock, so use a spin hint.
</span>hint::spin_loop();
}
state =&gt; {
<span class="comment">// In this case, a concurrent thread is holding the
// &quot;registering&quot; lock. This probably indicates a bug in the
// caller&#39;s code as racing to call `register` doesn&#39;t make much
// sense.
//
// We just want to maintain memory safety. It is ok to drop the
// call to `register`.
</span><span class="macro">debug_assert!</span>(state == REGISTERING || state == REGISTERING | WAKING);
}
}
}
<span class="doccomment">/// Wakes the task that last called `register`.
///
/// If `register` has not been called yet, then this does nothing.
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>wake(<span class="kw-2">&amp;</span><span class="self">self</span>) {
<span class="kw">if let </span><span class="prelude-val">Some</span>(waker) = <span class="self">self</span>.take_waker() {
<span class="comment">// If wake panics, we&#39;ve consumed the waker which is a legitimate
// outcome.
</span>waker.wake();
}
}
<span class="doccomment">/// Attempts to take the `Waker` value out of the `AtomicWaker` with the
/// intention that the caller will wake the task later.
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>take_waker(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Waker&gt; {
<span class="comment">// AcqRel ordering is used in order to acquire the value of the `waker`
// cell as well as to establish a `release` ordering with whatever
// memory the `AtomicWaker` is associated with.
</span><span class="kw">match </span><span class="self">self</span>.state.fetch_or(WAKING, AcqRel) {
WAITING =&gt; {
<span class="comment">// The waking lock has been acquired.
</span><span class="kw">let </span>waker = <span class="kw">unsafe </span>{ <span class="self">self</span>.waker.with_mut(|t| (<span class="kw-2">*</span>t).take()) };
<span class="comment">// Release the lock
</span><span class="self">self</span>.state.fetch_and(!WAKING, Release);
waker
}
state =&gt; {
<span class="comment">// There is a concurrent thread currently updating the
// associated waker.
//
// Nothing more to do as the `WAKING` bit has been set. It
// doesn&#39;t matter if there are concurrent registering threads or
// not.
//
</span><span class="macro">debug_assert!</span>(
state == REGISTERING || state == REGISTERING | WAKING || state == WAKING
);
<span class="prelude-val">None
</span>}
}
}
}
<span class="kw">impl </span>Default <span class="kw">for </span>AtomicWaker {
<span class="kw">fn </span>default() -&gt; <span class="self">Self </span>{
AtomicWaker::new()
}
}
<span class="kw">impl </span>fmt::Debug <span class="kw">for </span>AtomicWaker {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, fmt: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
<span class="macro">write!</span>(fmt, <span class="string">&quot;AtomicWaker&quot;</span>)
}
}
<span class="kw">unsafe impl </span>Send <span class="kw">for </span>AtomicWaker {}
<span class="kw">unsafe impl </span>Sync <span class="kw">for </span>AtomicWaker {}
<span class="kw">trait </span>WakerRef {
<span class="kw">fn </span>wake(<span class="self">self</span>);
<span class="kw">fn </span>into_waker(<span class="self">self</span>) -&gt; Waker;
}
<span class="kw">impl </span>WakerRef <span class="kw">for </span>Waker {
<span class="kw">fn </span>wake(<span class="self">self</span>) {
<span class="self">self</span>.wake()
}
<span class="kw">fn </span>into_waker(<span class="self">self</span>) -&gt; Waker {
<span class="self">self
</span>}
}
<span class="kw">impl </span>WakerRef <span class="kw">for </span><span class="kw-2">&amp;</span>Waker {
<span class="kw">fn </span>wake(<span class="self">self</span>) {
<span class="self">self</span>.wake_by_ref()
}
<span class="kw">fn </span>into_waker(<span class="self">self</span>) -&gt; Waker {
<span class="self">self</span>.clone()
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../../../" data-current-crate="tokio" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>