blob: a0a53ad790b34d60de6cf59e7f070379c9684f42 [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/signal-hook-registry-1.4.1/src/half_lock.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>half_lock.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="../../signal_hook_registry/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="../../signal_hook_registry/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>
</pre><pre class="rust"><code><span class="doccomment">//! The half-lock structure
//!
//! We need a way to protect the structure with configured hooks ‒ a signal may happen in arbitrary
//! thread and needs to read them while another thread might be manipulating the structure.
//!
//! Under ordinary circumstances we would be happy to just use `Mutex&lt;HashMap&lt;c_int, _&gt;&gt;`. However,
//! as we use it in the signal handler, we are severely limited in what we can or can&#39;t use. So we
//! choose to implement kind of spin-look thing with atomics.
//!
//! In the reader it is always simply locked and then unlocked, making sure it doesn&#39;t disappear
//! while in use.
//!
//! The writer has a separate mutex (that prevents other writers; this is used outside of the
//! signal handler), makes a copy of the data and swaps an atomic pointer to the data structure.
//! But it waits until everything is unlocked (no signal handler has the old data) for dropping the
//! old instance. There&#39;s a generation trick to make sure that new signal locks another instance.
//!
//! The downside is, this is an active spin lock at the writer end. However, we assume than:
//!
//! * Signals are one time setup before we actually have threads. We just need to make *sure* we
//! are safe even if this is not true.
//! * Signals are rare, happening at the same time as the write even rarer.
//! * Signals are short, as there is mostly nothing allowed inside them anyway.
//! * Our tool box is severely limited.
//!
//! Therefore this is hopefully reasonable trade-off.
//!
//! # Atomic orderings
//!
//! The whole code uses SeqCst conservatively. Atomics are not used because of performance here and
//! are the minor price around signals anyway. But the comments state which orderings should be
//! enough in practice in case someone wants to get inspired (but do make your own check through
//! them anyway).
</span><span class="kw">use </span>std::isize;
<span class="kw">use </span>std::marker::PhantomData;
<span class="kw">use </span>std::ops::Deref;
<span class="kw">use </span>std::sync::atomic::{<span class="self">self</span>, AtomicPtr, AtomicUsize, Ordering};
<span class="kw">use </span>std::sync::{Mutex, MutexGuard, PoisonError};
<span class="kw">use </span>std::thread;
<span class="kw">use </span>libc;
<span class="kw">const </span>YIELD_EVERY: usize = <span class="number">16</span>;
<span class="kw">const </span>MAX_GUARDS: usize = (isize::MAX) <span class="kw">as </span>usize;
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">struct </span>ReadGuard&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; {
data: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T,
lock: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>AtomicUsize,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Deref <span class="kw">for </span>ReadGuard&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Target = T;
<span class="kw">fn </span>deref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>T {
<span class="self">self</span>.data
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Drop <span class="kw">for </span>ReadGuard&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="comment">// We effectively unlock; Release would be enough.
</span><span class="self">self</span>.lock.fetch_sub(<span class="number">1</span>, Ordering::SeqCst);
}
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">struct </span>WriteGuard&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; {
_guard: MutexGuard&lt;<span class="lifetime">&#39;a</span>, ()&gt;,
lock: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HalfLock&lt;T&gt;,
data: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; WriteGuard&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>store(<span class="kw-2">&amp;mut </span><span class="self">self</span>, val: T) {
<span class="comment">// Move to the heap and convert to raw pointer for AtomicPtr.
</span><span class="kw">let </span>new = Box::into_raw(Box::new(val));
<span class="self">self</span>.data = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span>new };
<span class="comment">// We can just put the new value in here safely, we worry only about dropping the old one.
// Release might (?) be enough, to &quot;upload&quot; the data.
</span><span class="kw">let </span>old = <span class="self">self</span>.lock.data.swap(new, Ordering::SeqCst);
<span class="comment">// Now we make sure there&#39;s no reader having the old data.
</span><span class="self">self</span>.lock.write_barrier();
drop(<span class="kw">unsafe </span>{ Box::from_raw(old) });
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Deref <span class="kw">for </span>WriteGuard&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Target = T;
<span class="kw">fn </span>deref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>T {
<span class="comment">// Protected by that mutex
</span><span class="self">self</span>.data
}
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">struct </span>HalfLock&lt;T&gt; {
<span class="comment">// We conceptually contain an instance of T
</span>_t: PhantomData&lt;T&gt;,
<span class="comment">// The actual data as a pointer.
</span>data: AtomicPtr&lt;T&gt;,
<span class="comment">// The generation of the data. Influences which slot of the lock counter we use.
</span>generation: AtomicUsize,
<span class="comment">// How many active locks are there?
</span>lock: [AtomicUsize; <span class="number">2</span>],
<span class="comment">// Mutex for the writers; only one writer.
</span>write_mutex: Mutex&lt;()&gt;,
}
<span class="kw">impl</span>&lt;T&gt; HalfLock&lt;T&gt; {
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>new(data: T) -&gt; <span class="self">Self </span>{
<span class="comment">// Move to the heap so we can safely point there. Then convert to raw pointer as AtomicPtr
// operates on raw pointers. The AtomicPtr effectively acts like Box for us semantically.
</span><span class="kw">let </span>ptr = Box::into_raw(Box::new(data));
<span class="self">Self </span>{
_t: PhantomData,
data: AtomicPtr::new(ptr),
generation: AtomicUsize::new(<span class="number">0</span>),
lock: [AtomicUsize::new(<span class="number">0</span>), AtomicUsize::new(<span class="number">0</span>)],
write_mutex: Mutex::new(()),
}
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>read(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; ReadGuard&lt;T&gt; {
<span class="comment">// Relaxed should be enough; we only pick one or the other slot and the writer observes
// that both were 0 at some time. So the actual value doesn&#39;t really matter for safety,
// only the changing improves the performance.
</span><span class="kw">let </span>gen = <span class="self">self</span>.generation.load(Ordering::SeqCst);
<span class="kw">let </span>lock = <span class="kw-2">&amp;</span><span class="self">self</span>.lock[gen % <span class="number">2</span>];
<span class="comment">// Effectively locking something, acquire should be enough.
</span><span class="kw">let </span>guard_cnt = lock.fetch_add(<span class="number">1</span>, Ordering::SeqCst);
<span class="comment">// This is to prevent overflowing the counter in some degenerate cases, which could lead to
// UB (freeing data while still in use). However, as this data structure is used only
// internally and it&#39;s not possible to leak the guard and the guard itself takes some
// memory, it should be really impossible to trigger this case. Still, we include it from
// abundance of caution.
//
// This technically is not fully correct as enough threads being in between here and the
// abort below could still overflow it and it could get freed for some *other* thread, but
// that would mean having too many active threads to fit into RAM too and is even more
// absurd corner case than the above.
</span><span class="kw">if </span>guard_cnt &gt; MAX_GUARDS {
<span class="kw">unsafe </span>{ libc::abort() };
}
<span class="comment">// Acquire should be enough; we need to &quot;download&quot; the data, paired with the swap on the
// same pointer.
</span><span class="kw">let </span>data = <span class="self">self</span>.data.load(Ordering::SeqCst);
<span class="comment">// Safe:
// * It did point to valid data when put in.
// * Protected by lock, so still valid.
</span><span class="kw">let </span>data = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span>data };
ReadGuard { data, lock }
}
<span class="kw">fn </span>update_seen(<span class="kw-2">&amp;</span><span class="self">self</span>, seen_zero: <span class="kw-2">&amp;mut </span>[bool; <span class="number">2</span>]) {
<span class="kw">for </span>(seen, slot) <span class="kw">in </span>seen_zero.iter_mut().zip(<span class="kw-2">&amp;</span><span class="self">self</span>.lock) {
<span class="kw-2">*</span>seen = <span class="kw-2">*</span>seen || slot.load(Ordering::SeqCst) == <span class="number">0</span>;
}
}
<span class="kw">fn </span>write_barrier(<span class="kw-2">&amp;</span><span class="self">self</span>) {
<span class="comment">// Do a first check of seeing zeroes before we switch the generation. At least one of them
// should be zero by now, due to having drained the generation before leaving the previous
// writer.
</span><span class="kw">let </span><span class="kw-2">mut </span>seen_zero = [<span class="bool-val">false</span>; <span class="number">2</span>];
<span class="self">self</span>.update_seen(<span class="kw-2">&amp;mut </span>seen_zero);
<span class="comment">// By switching the generation to the other slot, we make sure the currently active starts
// draining while the other will start filling up.
</span><span class="self">self</span>.generation.fetch_add(<span class="number">1</span>, Ordering::SeqCst); <span class="comment">// Overflow is fine.
</span><span class="kw">let </span><span class="kw-2">mut </span>iter = <span class="number">0usize</span>;
<span class="kw">while </span>!seen_zero.iter().all(|s| <span class="kw-2">*</span>s) {
iter = iter.wrapping_add(<span class="number">1</span>);
<span class="comment">// Be somewhat less aggressive while looping, switch to the other threads if possible.
</span><span class="kw">if </span><span class="macro">cfg!</span>(not(miri)) {
<span class="kw">if </span>iter % YIELD_EVERY == <span class="number">0 </span>{
thread::yield_now();
} <span class="kw">else </span>{
<span class="comment">// Replaced by hint::spin_loop, but we want to support older compiler
</span><span class="attribute">#[allow(deprecated)]
</span>atomic::spin_loop_hint();
}
}
<span class="self">self</span>.update_seen(<span class="kw-2">&amp;mut </span>seen_zero);
}
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>write(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; WriteGuard&lt;T&gt; {
<span class="comment">// While it&#39;s possible the user code panics, our code in store doesn&#39;t and the data gets
// swapped atomically. So if it panics, nothing gets changed, therefore poisons are of no
// interest here.
</span><span class="kw">let </span>guard = <span class="self">self
</span>.write_mutex
.lock()
.unwrap_or_else(PoisonError::into_inner);
<span class="comment">// Relaxed should be enough, as we are under the same mutex that was used to get the data
// in.
</span><span class="kw">let </span>data = <span class="self">self</span>.data.load(Ordering::SeqCst);
<span class="comment">// Safe:
// * Stored as valid data
// * Only this method, protected by mutex, can change the pointer, so it didn&#39;t go away.
</span><span class="kw">let </span>data = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span>data };
WriteGuard {
data,
_guard: guard,
lock: <span class="self">self</span>,
}
}
}
<span class="kw">impl</span>&lt;T&gt; Drop <span class="kw">for </span>HalfLock&lt;T&gt; {
<span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="comment">// During drop we are sure there are no other borrows of the data so we are free to just
// drop it. Also, the drop impl won&#39;t be called in practice in our case, as it is used
// solely as a global variable, but we provide it for completeness and tests anyway.
//
// unsafe: the pointer in there is always valid, we just take the last instance out.
</span><span class="kw">unsafe </span>{
<span class="comment">// Acquire should be enough.
</span><span class="kw">let </span>data = Box::from_raw(<span class="self">self</span>.data.load(Ordering::SeqCst));
drop(data);
}
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="signal_hook_registry" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>