blob: b7df0b7bd7d17eb7e1971d0265ffd36c0e6f38d8 [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/ring-0.16.20/src/limb.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>limb.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="../../ring/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="../../ring/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>
<span id="383">383</span>
<span id="384">384</span>
<span id="385">385</span>
<span id="386">386</span>
<span id="387">387</span>
<span id="388">388</span>
<span id="389">389</span>
<span id="390">390</span>
<span id="391">391</span>
<span id="392">392</span>
<span id="393">393</span>
<span id="394">394</span>
<span id="395">395</span>
<span id="396">396</span>
<span id="397">397</span>
<span id="398">398</span>
<span id="399">399</span>
<span id="400">400</span>
<span id="401">401</span>
<span id="402">402</span>
<span id="403">403</span>
<span id="404">404</span>
<span id="405">405</span>
<span id="406">406</span>
<span id="407">407</span>
<span id="408">408</span>
<span id="409">409</span>
<span id="410">410</span>
<span id="411">411</span>
<span id="412">412</span>
<span id="413">413</span>
<span id="414">414</span>
<span id="415">415</span>
<span id="416">416</span>
<span id="417">417</span>
<span id="418">418</span>
<span id="419">419</span>
<span id="420">420</span>
<span id="421">421</span>
<span id="422">422</span>
<span id="423">423</span>
<span id="424">424</span>
<span id="425">425</span>
<span id="426">426</span>
<span id="427">427</span>
<span id="428">428</span>
<span id="429">429</span>
<span id="430">430</span>
<span id="431">431</span>
<span id="432">432</span>
<span id="433">433</span>
<span id="434">434</span>
<span id="435">435</span>
<span id="436">436</span>
<span id="437">437</span>
<span id="438">438</span>
<span id="439">439</span>
<span id="440">440</span>
<span id="441">441</span>
<span id="442">442</span>
<span id="443">443</span>
<span id="444">444</span>
<span id="445">445</span>
<span id="446">446</span>
<span id="447">447</span>
<span id="448">448</span>
<span id="449">449</span>
<span id="450">450</span>
<span id="451">451</span>
<span id="452">452</span>
<span id="453">453</span>
<span id="454">454</span>
<span id="455">455</span>
<span id="456">456</span>
<span id="457">457</span>
<span id="458">458</span>
<span id="459">459</span>
<span id="460">460</span>
<span id="461">461</span>
<span id="462">462</span>
<span id="463">463</span>
<span id="464">464</span>
<span id="465">465</span>
<span id="466">466</span>
<span id="467">467</span>
<span id="468">468</span>
<span id="469">469</span>
<span id="470">470</span>
<span id="471">471</span>
<span id="472">472</span>
<span id="473">473</span>
<span id="474">474</span>
<span id="475">475</span>
<span id="476">476</span>
<span id="477">477</span>
<span id="478">478</span>
<span id="479">479</span>
<span id="480">480</span>
<span id="481">481</span>
<span id="482">482</span>
<span id="483">483</span>
<span id="484">484</span>
<span id="485">485</span>
<span id="486">486</span>
<span id="487">487</span>
<span id="488">488</span>
<span id="489">489</span>
<span id="490">490</span>
<span id="491">491</span>
<span id="492">492</span>
<span id="493">493</span>
<span id="494">494</span>
<span id="495">495</span>
<span id="496">496</span>
<span id="497">497</span>
<span id="498">498</span>
<span id="499">499</span>
<span id="500">500</span>
<span id="501">501</span>
<span id="502">502</span>
<span id="503">503</span>
<span id="504">504</span>
<span id="505">505</span>
<span id="506">506</span>
<span id="507">507</span>
<span id="508">508</span>
<span id="509">509</span>
<span id="510">510</span>
<span id="511">511</span>
<span id="512">512</span>
<span id="513">513</span>
<span id="514">514</span>
<span id="515">515</span>
<span id="516">516</span>
<span id="517">517</span>
<span id="518">518</span>
<span id="519">519</span>
<span id="520">520</span>
<span id="521">521</span>
<span id="522">522</span>
<span id="523">523</span>
<span id="524">524</span>
<span id="525">525</span>
<span id="526">526</span>
<span id="527">527</span>
<span id="528">528</span>
<span id="529">529</span>
<span id="530">530</span>
<span id="531">531</span>
<span id="532">532</span>
<span id="533">533</span>
<span id="534">534</span>
<span id="535">535</span>
<span id="536">536</span>
<span id="537">537</span>
<span id="538">538</span>
<span id="539">539</span>
<span id="540">540</span>
<span id="541">541</span>
<span id="542">542</span>
<span id="543">543</span>
<span id="544">544</span>
<span id="545">545</span>
<span id="546">546</span>
<span id="547">547</span>
<span id="548">548</span>
<span id="549">549</span>
<span id="550">550</span>
<span id="551">551</span>
<span id="552">552</span>
<span id="553">553</span>
<span id="554">554</span>
<span id="555">555</span>
<span id="556">556</span>
<span id="557">557</span>
<span id="558">558</span>
<span id="559">559</span>
<span id="560">560</span>
<span id="561">561</span>
<span id="562">562</span>
<span id="563">563</span>
<span id="564">564</span>
<span id="565">565</span>
<span id="566">566</span>
<span id="567">567</span>
<span id="568">568</span>
<span id="569">569</span>
<span id="570">570</span>
<span id="571">571</span>
<span id="572">572</span>
<span id="573">573</span>
<span id="574">574</span>
<span id="575">575</span>
<span id="576">576</span>
<span id="577">577</span>
<span id="578">578</span>
<span id="579">579</span>
<span id="580">580</span>
<span id="581">581</span>
<span id="582">582</span>
<span id="583">583</span>
<span id="584">584</span>
<span id="585">585</span>
<span id="586">586</span>
<span id="587">587</span>
<span id="588">588</span>
<span id="589">589</span>
<span id="590">590</span>
<span id="591">591</span>
<span id="592">592</span>
<span id="593">593</span>
<span id="594">594</span>
<span id="595">595</span>
<span id="596">596</span>
<span id="597">597</span>
<span id="598">598</span>
<span id="599">599</span>
<span id="600">600</span>
<span id="601">601</span>
<span id="602">602</span>
<span id="603">603</span>
<span id="604">604</span>
</pre><pre class="rust"><code><span class="comment">// Copyright 2016 David Judd.
// Copyright 2016 Brian Smith.
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED &quot;AS IS&quot; AND THE AUTHORS DISCLAIM ALL WARRANTIES
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
// SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
// OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
// CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
</span><span class="doccomment">//! Unsigned multi-precision integer arithmetic.
//!
//! Limbs ordered least-significant-limb to most-significant-limb. The bits
//! limbs use the native endianness.
</span><span class="kw">use crate</span>::{c, error};
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">use </span><span class="kw">crate</span>::bits;
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">use </span>core::num::Wrapping;
<span class="comment">// XXX: Not correct for x32 ABIs.
</span><span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;64&quot;</span>)]
</span><span class="kw">pub type </span>Limb = u64;
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;32&quot;</span>)]
</span><span class="kw">pub type </span>Limb = u32;
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;64&quot;</span>)]
</span><span class="kw">pub const </span>LIMB_BITS: usize = <span class="number">64</span>;
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;32&quot;</span>)]
</span><span class="kw">pub const </span>LIMB_BITS: usize = <span class="number">32</span>;
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;64&quot;</span>)]
#[derive(Debug, PartialEq)]
#[repr(u64)]
</span><span class="kw">pub enum </span>LimbMask {
True = <span class="number">0xffff_ffff_ffff_ffff</span>,
False = <span class="number">0</span>,
}
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;32&quot;</span>)]
#[derive(Debug, PartialEq)]
#[repr(u32)]
</span><span class="kw">pub enum </span>LimbMask {
True = <span class="number">0xffff_ffff</span>,
False = <span class="number">0</span>,
}
<span class="kw">pub const </span>LIMB_BYTES: usize = (LIMB_BITS + <span class="number">7</span>) / <span class="number">8</span>;
<span class="attribute">#[inline]
</span><span class="kw">pub fn </span>limbs_equal_limbs_consttime(a: <span class="kw-2">&amp;</span>[Limb], b: <span class="kw-2">&amp;</span>[Limb]) -&gt; LimbMask {
<span class="kw">extern </span><span class="string">&quot;C&quot; </span>{
<span class="kw">fn </span>LIMBS_equal(a: <span class="kw-2">*const </span>Limb, b: <span class="kw-2">*const </span>Limb, num_limbs: c::size_t) -&gt; LimbMask;
}
<span class="macro">assert_eq!</span>(a.len(), b.len());
<span class="kw">unsafe </span>{ LIMBS_equal(a.as_ptr(), b.as_ptr(), a.len()) }
}
<span class="attribute">#[inline]
</span><span class="kw">pub fn </span>limbs_less_than_limbs_consttime(a: <span class="kw-2">&amp;</span>[Limb], b: <span class="kw-2">&amp;</span>[Limb]) -&gt; LimbMask {
<span class="macro">assert_eq!</span>(a.len(), b.len());
<span class="kw">unsafe </span>{ LIMBS_less_than(a.as_ptr(), b.as_ptr(), b.len()) }
}
<span class="attribute">#[inline]
</span><span class="kw">pub fn </span>limbs_less_than_limbs_vartime(a: <span class="kw-2">&amp;</span>[Limb], b: <span class="kw-2">&amp;</span>[Limb]) -&gt; bool {
limbs_less_than_limbs_consttime(a, b) == LimbMask::True
}
<span class="attribute">#[inline]
#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">pub fn </span>limbs_less_than_limb_constant_time(a: <span class="kw-2">&amp;</span>[Limb], b: Limb) -&gt; LimbMask {
<span class="kw">unsafe </span>{ LIMBS_less_than_limb(a.as_ptr(), b, a.len()) }
}
<span class="attribute">#[inline]
</span><span class="kw">pub fn </span>limbs_are_zero_constant_time(limbs: <span class="kw-2">&amp;</span>[Limb]) -&gt; LimbMask {
<span class="kw">unsafe </span>{ LIMBS_are_zero(limbs.as_ptr(), limbs.len()) }
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
#[inline]
</span><span class="kw">pub fn </span>limbs_are_even_constant_time(limbs: <span class="kw-2">&amp;</span>[Limb]) -&gt; LimbMask {
<span class="kw">unsafe </span>{ LIMBS_are_even(limbs.as_ptr(), limbs.len()) }
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
#[inline]
</span><span class="kw">pub fn </span>limbs_equal_limb_constant_time(a: <span class="kw-2">&amp;</span>[Limb], b: Limb) -&gt; LimbMask {
<span class="kw">unsafe </span>{ LIMBS_equal_limb(a.as_ptr(), b, a.len()) }
}
<span class="doccomment">/// Returns the number of bits in `a`.
</span><span class="comment">//
// This strives to be constant-time with respect to the values of all bits
// except the most significant bit. This does not attempt to be constant-time
// with respect to `a.len()` or the value of the result or the value of the
// most significant bit (It&#39;s 1, unless the input is zero, in which case it&#39;s
// zero.)
</span><span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">pub fn </span>limbs_minimal_bits(a: <span class="kw-2">&amp;</span>[Limb]) -&gt; bits::BitLength {
<span class="kw">for </span>num_limbs <span class="kw">in </span>(<span class="number">1</span>..=a.len()).rev() {
<span class="kw">let </span>high_limb = a[num_limbs - <span class="number">1</span>];
<span class="comment">// Find the number of set bits in |high_limb| by a linear scan from the
// most significant bit to the least significant bit. This works great
// for the most common inputs because usually the most significant bit
// it set.
</span><span class="kw">for </span>high_limb_num_bits <span class="kw">in </span>(<span class="number">1</span>..=LIMB_BITS).rev() {
<span class="kw">let </span>shifted = <span class="kw">unsafe </span>{ LIMB_shr(high_limb, high_limb_num_bits - <span class="number">1</span>) };
<span class="kw">if </span>shifted != <span class="number">0 </span>{
<span class="kw">return </span>bits::BitLength::from_usize_bits(
((num_limbs - <span class="number">1</span>) * LIMB_BITS) + high_limb_num_bits,
);
}
}
}
<span class="comment">// No bits were set.
</span>bits::BitLength::from_usize_bits(<span class="number">0</span>)
}
<span class="doccomment">/// Equivalent to `if (r &gt;= m) { r -= m; }`
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>limbs_reduce_once_constant_time(r: <span class="kw-2">&amp;mut </span>[Limb], m: <span class="kw-2">&amp;</span>[Limb]) {
<span class="macro">assert_eq!</span>(r.len(), m.len());
<span class="kw">unsafe </span>{ LIMBS_reduce_once(r.as_mut_ptr(), m.as_ptr(), m.len()) };
}
<span class="attribute">#[derive(Clone, Copy, PartialEq)]
</span><span class="kw">pub enum </span>AllowZero {
No,
Yes,
}
<span class="doccomment">/// Parses `input` into `result`, reducing it via conditional subtraction
/// (mod `m`). Assuming 2**((self.num_limbs * LIMB_BITS) - 1) &lt; m and
/// m &lt; 2**(self.num_limbs * LIMB_BITS), the value will be reduced mod `m` in
/// constant time so that the result is in the range [0, m) if `allow_zero` is
/// `AllowZero::Yes`, or [1, m) if `allow_zero` is `AllowZero::No`. `result` is
/// padded with zeros to its length.
</span><span class="kw">pub fn </span>parse_big_endian_in_range_partially_reduced_and_pad_consttime(
input: untrusted::Input,
allow_zero: AllowZero,
m: <span class="kw-2">&amp;</span>[Limb],
result: <span class="kw-2">&amp;mut </span>[Limb],
) -&gt; <span class="prelude-ty">Result</span>&lt;(), error::Unspecified&gt; {
parse_big_endian_and_pad_consttime(input, result)<span class="question-mark">?</span>;
limbs_reduce_once_constant_time(result, m);
<span class="kw">if </span>allow_zero != AllowZero::Yes {
<span class="kw">if </span>limbs_are_zero_constant_time(<span class="kw-2">&amp;</span>result) != LimbMask::False {
<span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified);
}
}
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Parses `input` into `result`, verifies that the value is less than
/// `max_exclusive`, and pads `result` with zeros to its length. If `allow_zero`
/// is not `AllowZero::Yes`, zero values are rejected.
///
/// This attempts to be constant-time with respect to the actual value *only if*
/// the value is actually in range. In other words, this won&#39;t leak anything
/// about a valid value, but it might leak small amounts of information about an
/// invalid value (which constraint it failed).
</span><span class="kw">pub fn </span>parse_big_endian_in_range_and_pad_consttime(
input: untrusted::Input,
allow_zero: AllowZero,
max_exclusive: <span class="kw-2">&amp;</span>[Limb],
result: <span class="kw-2">&amp;mut </span>[Limb],
) -&gt; <span class="prelude-ty">Result</span>&lt;(), error::Unspecified&gt; {
parse_big_endian_and_pad_consttime(input, result)<span class="question-mark">?</span>;
<span class="kw">if </span>limbs_less_than_limbs_consttime(<span class="kw-2">&amp;</span>result, max_exclusive) != LimbMask::True {
<span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified);
}
<span class="kw">if </span>allow_zero != AllowZero::Yes {
<span class="kw">if </span>limbs_are_zero_constant_time(<span class="kw-2">&amp;</span>result) != LimbMask::False {
<span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified);
}
}
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Parses `input` into `result`, padding `result` with zeros to its length.
/// This attempts to be constant-time with respect to the value but not with
/// respect to the length; it is assumed that the length is public knowledge.
</span><span class="kw">pub fn </span>parse_big_endian_and_pad_consttime(
input: untrusted::Input,
result: <span class="kw-2">&amp;mut </span>[Limb],
) -&gt; <span class="prelude-ty">Result</span>&lt;(), error::Unspecified&gt; {
<span class="kw">if </span>input.is_empty() {
<span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified);
}
<span class="comment">// `bytes_in_current_limb` is the number of bytes in the current limb.
// It will be `LIMB_BYTES` for all limbs except maybe the highest-order
// limb.
</span><span class="kw">let </span><span class="kw-2">mut </span>bytes_in_current_limb = input.len() % LIMB_BYTES;
<span class="kw">if </span>bytes_in_current_limb == <span class="number">0 </span>{
bytes_in_current_limb = LIMB_BYTES;
}
<span class="kw">let </span>num_encoded_limbs = (input.len() / LIMB_BYTES)
+ (<span class="kw">if </span>bytes_in_current_limb == LIMB_BYTES {
<span class="number">0
</span>} <span class="kw">else </span>{
<span class="number">1
</span>});
<span class="kw">if </span>num_encoded_limbs &gt; result.len() {
<span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified);
}
<span class="kw">for </span>r <span class="kw">in </span><span class="kw-2">&amp;mut </span>result[..] {
<span class="kw-2">*</span>r = <span class="number">0</span>;
}
<span class="comment">// XXX: Questionable as far as constant-timedness is concerned.
// TODO: Improve this.
</span>input.read_all(error::Unspecified, |input| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..num_encoded_limbs {
<span class="kw">let </span><span class="kw-2">mut </span>limb: Limb = <span class="number">0</span>;
<span class="kw">for _ in </span><span class="number">0</span>..bytes_in_current_limb {
<span class="kw">let </span>b: Limb = input.read_byte()<span class="question-mark">?</span>.into();
limb = (limb &lt;&lt; <span class="number">8</span>) | b;
}
result[num_encoded_limbs - i - <span class="number">1</span>] = limb;
bytes_in_current_limb = LIMB_BYTES;
}
<span class="prelude-val">Ok</span>(())
})
}
<span class="kw">pub fn </span>big_endian_from_limbs(limbs: <span class="kw-2">&amp;</span>[Limb], out: <span class="kw-2">&amp;mut </span>[u8]) {
<span class="kw">let </span>num_limbs = limbs.len();
<span class="kw">let </span>out_len = out.len();
<span class="macro">assert_eq!</span>(out_len, num_limbs * LIMB_BYTES);
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..num_limbs {
<span class="kw">let </span><span class="kw-2">mut </span>limb = limbs[i];
<span class="kw">for </span>j <span class="kw">in </span><span class="number">0</span>..LIMB_BYTES {
out[((num_limbs - i - <span class="number">1</span>) * LIMB_BYTES) + (LIMB_BYTES - j - <span class="number">1</span>)] = (limb &amp; <span class="number">0xff</span>) <span class="kw">as </span>u8;
limb &gt;&gt;= <span class="number">8</span>;
}
}
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">pub type </span>Window = Limb;
<span class="doccomment">/// Processes `limbs` as a sequence of 5-bit windows, folding the windows from
/// most significant to least significant and returning the accumulated result.
/// The first window will be mapped by `init` to produce the initial value for
/// the accumulator. Then `f` will be called to fold the accumulator and the
/// next window until all windows are processed. When the input&#39;s bit length
/// isn&#39;t divisible by 5, the window passed to `init` will be partial; all
/// windows passed to `fold` will be full.
///
/// This is designed to avoid leaking the contents of `limbs` through side
/// channels as long as `init` and `fold` are side-channel free.
///
/// Panics if `limbs` is empty.
</span><span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">pub fn </span>fold_5_bit_windows&lt;R, I: FnOnce(Window) -&gt; R, F: Fn(R, Window) -&gt; R&gt;(
limbs: <span class="kw-2">&amp;</span>[Limb],
init: I,
fold: F,
) -&gt; R {
<span class="attribute">#[derive(Clone, Copy)]
#[repr(transparent)]
</span><span class="kw">struct </span>BitIndex(Wrapping&lt;c::size_t&gt;);
<span class="kw">const </span>WINDOW_BITS: Wrapping&lt;c::size_t&gt; = Wrapping(<span class="number">5</span>);
<span class="kw">extern </span><span class="string">&quot;C&quot; </span>{
<span class="kw">fn </span>LIMBS_window5_split_window(
lower_limb: Limb,
higher_limb: Limb,
index_within_word: BitIndex,
) -&gt; Window;
<span class="kw">fn </span>LIMBS_window5_unsplit_window(limb: Limb, index_within_word: BitIndex) -&gt; Window;
}
<span class="kw">let </span>num_limbs = limbs.len();
<span class="kw">let </span><span class="kw-2">mut </span>window_low_bit = {
<span class="kw">let </span>num_whole_windows = (num_limbs * LIMB_BITS) / <span class="number">5</span>;
<span class="kw">let </span><span class="kw-2">mut </span>leading_bits = (num_limbs * LIMB_BITS) - (num_whole_windows * <span class="number">5</span>);
<span class="kw">if </span>leading_bits == <span class="number">0 </span>{
leading_bits = WINDOW_BITS.<span class="number">0</span>;
}
BitIndex(Wrapping(LIMB_BITS - leading_bits))
};
<span class="kw">let </span>initial_value = {
<span class="kw">let </span>leading_partial_window =
<span class="kw">unsafe </span>{ LIMBS_window5_split_window(<span class="kw-2">*</span>limbs.last().unwrap(), <span class="number">0</span>, window_low_bit) };
window_low_bit.<span class="number">0 </span>-= WINDOW_BITS;
init(leading_partial_window)
};
<span class="kw">let </span><span class="kw-2">mut </span>low_limb = <span class="number">0</span>;
limbs
.iter()
.rev()
.fold(initial_value, |<span class="kw-2">mut </span>acc, current_limb| {
<span class="kw">let </span>higher_limb = low_limb;
low_limb = <span class="kw-2">*</span>current_limb;
<span class="kw">if </span>window_low_bit.<span class="number">0 </span>&gt; Wrapping(LIMB_BITS) - WINDOW_BITS {
<span class="kw">let </span>window =
<span class="kw">unsafe </span>{ LIMBS_window5_split_window(low_limb, higher_limb, window_low_bit) };
window_low_bit.<span class="number">0 </span>-= WINDOW_BITS;
acc = fold(acc, window);
};
<span class="kw">while </span>window_low_bit.<span class="number">0 </span>&lt; Wrapping(LIMB_BITS) {
<span class="kw">let </span>window = <span class="kw">unsafe </span>{ LIMBS_window5_unsplit_window(low_limb, window_low_bit) };
<span class="comment">// The loop exits when this subtraction underflows, causing `window_low_bit` to
// wrap around to a very large value.
</span>window_low_bit.<span class="number">0 </span>-= WINDOW_BITS;
acc = fold(acc, window);
}
window_low_bit.<span class="number">0 </span>+= Wrapping(LIMB_BITS); <span class="comment">// &quot;Fix&quot; the underflow.
</span>acc
})
}
<span class="kw">extern </span><span class="string">&quot;C&quot; </span>{
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">fn </span>LIMB_shr(a: Limb, shift: c::size_t) -&gt; Limb;
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">fn </span>LIMBS_are_even(a: <span class="kw-2">*const </span>Limb, num_limbs: c::size_t) -&gt; LimbMask;
<span class="kw">fn </span>LIMBS_are_zero(a: <span class="kw-2">*const </span>Limb, num_limbs: c::size_t) -&gt; LimbMask;
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">fn </span>LIMBS_equal_limb(a: <span class="kw-2">*const </span>Limb, b: Limb, num_limbs: c::size_t) -&gt; LimbMask;
<span class="kw">fn </span>LIMBS_less_than(a: <span class="kw-2">*const </span>Limb, b: <span class="kw-2">*const </span>Limb, num_limbs: c::size_t) -&gt; LimbMask;
<span class="attribute">#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">fn </span>LIMBS_less_than_limb(a: <span class="kw-2">*const </span>Limb, b: Limb, num_limbs: c::size_t) -&gt; LimbMask;
<span class="kw">fn </span>LIMBS_reduce_once(r: <span class="kw-2">*mut </span>Limb, m: <span class="kw-2">*const </span>Limb, num_limbs: c::size_t);
}
<span class="attribute">#[cfg(test)]
</span><span class="kw">mod </span>tests {
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="kw">const </span>MAX: Limb = LimbMask::True <span class="kw">as </span>Limb;
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_limbs_are_even() {
<span class="kw">static </span>EVENS: <span class="kw-2">&amp;</span>[<span class="kw-2">&amp;</span>[Limb]] = <span class="kw-2">&amp;</span>[
<span class="kw-2">&amp;</span>[],
<span class="kw-2">&amp;</span>[<span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">2</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">2</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">1</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">2</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">3</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, MAX],
];
<span class="kw">for </span>even <span class="kw">in </span>EVENS {
<span class="macro">assert_eq!</span>(limbs_are_even_constant_time(even), LimbMask::True);
}
<span class="kw">static </span>ODDS: <span class="kw-2">&amp;</span>[<span class="kw-2">&amp;</span>[Limb]] = <span class="kw-2">&amp;</span>[
<span class="kw-2">&amp;</span>[<span class="number">1</span>],
<span class="kw-2">&amp;</span>[<span class="number">3</span>],
<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">3</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">1</span>],
<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">2</span>],
<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">3</span>],
<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, MAX],
];
<span class="kw">for </span>odd <span class="kw">in </span>ODDS {
<span class="macro">assert_eq!</span>(limbs_are_even_constant_time(odd), LimbMask::False);
}
}
<span class="kw">static </span>ZEROES: <span class="kw-2">&amp;</span>[<span class="kw-2">&amp;</span>[Limb]] = <span class="kw-2">&amp;</span>[
<span class="kw-2">&amp;</span>[],
<span class="kw-2">&amp;</span>[<span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
];
<span class="kw">static </span>NONZEROES: <span class="kw-2">&amp;</span>[<span class="kw-2">&amp;</span>[Limb]] = <span class="kw-2">&amp;</span>[
<span class="kw-2">&amp;</span>[<span class="number">1</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">1</span>],
<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">1</span>],
<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>, <span class="number">0</span>],
<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>],
];
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_limbs_are_zero() {
<span class="kw">for </span>zero <span class="kw">in </span>ZEROES {
<span class="macro">assert_eq!</span>(limbs_are_zero_constant_time(zero), LimbMask::True);
}
<span class="kw">for </span>nonzero <span class="kw">in </span>NONZEROES {
<span class="macro">assert_eq!</span>(limbs_are_zero_constant_time(nonzero), LimbMask::False);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_limbs_equal_limb() {
<span class="kw">for </span>zero <span class="kw">in </span>ZEROES {
<span class="macro">assert_eq!</span>(limbs_equal_limb_constant_time(zero, <span class="number">0</span>), LimbMask::True);
}
<span class="kw">for </span>nonzero <span class="kw">in </span>NONZEROES {
<span class="macro">assert_eq!</span>(limbs_equal_limb_constant_time(nonzero, <span class="number">0</span>), LimbMask::False);
}
<span class="kw">static </span>EQUAL: <span class="kw-2">&amp;</span>[(<span class="kw-2">&amp;</span>[Limb], Limb)] = <span class="kw-2">&amp;</span>[
(<span class="kw-2">&amp;</span>[<span class="number">1</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[MAX], MAX),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[MAX, <span class="number">0</span>, <span class="number">0</span>], MAX),
(<span class="kw-2">&amp;</span>[<span class="number">0b100</span>], <span class="number">0b100</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0b100</span>, <span class="number">0</span>], <span class="number">0b100</span>),
];
<span class="kw">for </span><span class="kw-2">&amp;</span>(a, b) <span class="kw">in </span>EQUAL {
<span class="macro">assert_eq!</span>(limbs_equal_limb_constant_time(a, b), LimbMask::True);
}
<span class="kw">static </span>UNEQUAL: <span class="kw-2">&amp;</span>[(<span class="kw-2">&amp;</span>[Limb], Limb)] = <span class="kw-2">&amp;</span>[
(<span class="kw-2">&amp;</span>[<span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">2</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">3</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">1</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0b100</span>, <span class="number">0b100</span>], <span class="number">0b100</span>),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>, <span class="number">0b100</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0b100</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[MAX, MAX], MAX),
(<span class="kw-2">&amp;</span>[MAX, <span class="number">1</span>], MAX),
];
<span class="kw">for </span><span class="kw-2">&amp;</span>(a, b) <span class="kw">in </span>UNEQUAL {
<span class="macro">assert_eq!</span>(limbs_equal_limb_constant_time(a, b), LimbMask::False);
}
}
<span class="attribute">#[test]
#[cfg(feature = <span class="string">&quot;alloc&quot;</span>)]
</span><span class="kw">fn </span>test_limbs_less_than_limb_constant_time() {
<span class="kw">static </span>LESSER: <span class="kw-2">&amp;</span>[(<span class="kw-2">&amp;</span>[Limb], Limb)] = <span class="kw-2">&amp;</span>[
(<span class="kw-2">&amp;</span>[<span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>], <span class="number">2</span>),
(<span class="kw-2">&amp;</span>[<span class="number">2</span>, <span class="number">0</span>], <span class="number">3</span>),
(<span class="kw-2">&amp;</span>[<span class="number">2</span>, <span class="number">0</span>], <span class="number">3</span>),
(<span class="kw-2">&amp;</span>[MAX - <span class="number">1</span>], MAX),
(<span class="kw-2">&amp;</span>[MAX - <span class="number">1</span>, <span class="number">0</span>], MAX),
];
<span class="kw">for </span><span class="kw-2">&amp;</span>(a, b) <span class="kw">in </span>LESSER {
<span class="macro">assert_eq!</span>(limbs_less_than_limb_constant_time(a, b), LimbMask::True);
}
<span class="kw">static </span>EQUAL: <span class="kw-2">&amp;</span>[(<span class="kw-2">&amp;</span>[Limb], Limb)] = <span class="kw-2">&amp;</span>[
(<span class="kw-2">&amp;</span>[<span class="number">0</span>], <span class="number">0</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="number">0</span>),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[MAX], MAX),
];
<span class="kw">static </span>GREATER: <span class="kw-2">&amp;</span>[(<span class="kw-2">&amp;</span>[Limb], Limb)] = <span class="kw-2">&amp;</span>[
(<span class="kw-2">&amp;</span>[<span class="number">1</span>], <span class="number">0</span>),
(<span class="kw-2">&amp;</span>[<span class="number">2</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">3</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>, <span class="number">1</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[MAX], MAX - <span class="number">1</span>),
];
<span class="kw">for </span><span class="kw-2">&amp;</span>(a, b) <span class="kw">in </span>EQUAL.iter().chain(GREATER.iter()) {
<span class="macro">assert_eq!</span>(limbs_less_than_limb_constant_time(a, b), LimbMask::False);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_parse_big_endian_and_pad_consttime() {
<span class="kw">const </span>LIMBS: usize = <span class="number">4</span>;
{
<span class="comment">// Empty input.
</span><span class="kw">let </span>inp = untrusted::Input::from(<span class="kw-2">&amp;</span>[]);
<span class="kw">let </span><span class="kw-2">mut </span>result = [<span class="number">0</span>; LIMBS];
<span class="macro">assert!</span>(parse_big_endian_and_pad_consttime(inp, <span class="kw-2">&amp;mut </span>result).is_err());
}
<span class="comment">// The input is longer than will fit in the given number of limbs.
</span>{
<span class="kw">let </span>inp = [<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">8</span>, <span class="number">9</span>];
<span class="kw">let </span>inp = untrusted::Input::from(<span class="kw-2">&amp;</span>inp);
<span class="kw">let </span><span class="kw-2">mut </span>result = [<span class="number">0</span>; <span class="number">8 </span>/ LIMB_BYTES];
<span class="macro">assert!</span>(parse_big_endian_and_pad_consttime(inp, <span class="kw-2">&amp;mut </span>result[..]).is_err());
}
<span class="comment">// Less than a full limb.
</span>{
<span class="kw">let </span>inp = [<span class="number">0xfe</span>];
<span class="kw">let </span>inp = untrusted::Input::from(<span class="kw-2">&amp;</span>inp);
<span class="kw">let </span><span class="kw-2">mut </span>result = [<span class="number">0</span>; LIMBS];
<span class="macro">assert_eq!</span>(
<span class="prelude-val">Ok</span>(()),
parse_big_endian_and_pad_consttime(inp, <span class="kw-2">&amp;mut </span>result[..])
);
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>[<span class="number">0xfe</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="kw-2">&amp;</span>result);
}
<span class="comment">// A whole limb for 32-bit, half a limb for 64-bit.
</span>{
<span class="kw">let </span>inp = [<span class="number">0xbe</span>, <span class="number">0xef</span>, <span class="number">0xf0</span>, <span class="number">0x0d</span>];
<span class="kw">let </span>inp = untrusted::Input::from(<span class="kw-2">&amp;</span>inp);
<span class="kw">let </span><span class="kw-2">mut </span>result = [<span class="number">0</span>; LIMBS];
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(()), parse_big_endian_and_pad_consttime(inp, <span class="kw-2">&amp;mut </span>result));
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>[<span class="number">0xbeeff00d</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="kw-2">&amp;</span>result);
}
<span class="comment">// XXX: This is a weak set of tests. TODO: expand it.
</span>}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_big_endian_from_limbs_same_length() {
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;32&quot;</span>)]
</span><span class="kw">let </span>limbs = [
<span class="number">0xbccddeef</span>, <span class="number">0x89900aab</span>, <span class="number">0x45566778</span>, <span class="number">0x01122334</span>, <span class="number">0xddeeff00</span>, <span class="number">0x99aabbcc</span>, <span class="number">0x55667788</span>,
<span class="number">0x11223344</span>,
];
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;64&quot;</span>)]
</span><span class="kw">let </span>limbs = [
<span class="number">0x8990_0aab_bccd_deef</span>,
<span class="number">0x0112_2334_4556_6778</span>,
<span class="number">0x99aa_bbcc_ddee_ff00</span>,
<span class="number">0x1122_3344_5566_7788</span>,
];
<span class="kw">let </span>expected = [
<span class="number">0x11</span>, <span class="number">0x22</span>, <span class="number">0x33</span>, <span class="number">0x44</span>, <span class="number">0x55</span>, <span class="number">0x66</span>, <span class="number">0x77</span>, <span class="number">0x88</span>, <span class="number">0x99</span>, <span class="number">0xaa</span>, <span class="number">0xbb</span>, <span class="number">0xcc</span>, <span class="number">0xdd</span>, <span class="number">0xee</span>,
<span class="number">0xff</span>, <span class="number">0x00</span>, <span class="number">0x01</span>, <span class="number">0x12</span>, <span class="number">0x23</span>, <span class="number">0x34</span>, <span class="number">0x45</span>, <span class="number">0x56</span>, <span class="number">0x67</span>, <span class="number">0x78</span>, <span class="number">0x89</span>, <span class="number">0x90</span>, <span class="number">0x0a</span>, <span class="number">0xab</span>,
<span class="number">0xbc</span>, <span class="number">0xcd</span>, <span class="number">0xde</span>, <span class="number">0xef</span>,
];
<span class="kw">let </span><span class="kw-2">mut </span>out = [<span class="number">0xabu8</span>; <span class="number">32</span>];
big_endian_from_limbs(<span class="kw-2">&amp;</span>limbs[..], <span class="kw-2">&amp;mut </span>out);
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>out[..], <span class="kw-2">&amp;</span>expected[..]);
}
<span class="attribute">#[should_panic]
#[test]
</span><span class="kw">fn </span>test_big_endian_from_limbs_fewer_limbs() {
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;32&quot;</span>)]
</span><span class="comment">// Two fewer limbs.
</span><span class="kw">let </span>limbs = [
<span class="number">0xbccddeef</span>, <span class="number">0x89900aab</span>, <span class="number">0x45566778</span>, <span class="number">0x01122334</span>, <span class="number">0xddeeff00</span>, <span class="number">0x99aabbcc</span>,
];
<span class="comment">// One fewer limb.
</span><span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;64&quot;</span>)]
</span><span class="kw">let </span>limbs = [
<span class="number">0x8990_0aab_bccd_deef</span>,
<span class="number">0x0112_2334_4556_6778</span>,
<span class="number">0x99aa_bbcc_ddee_ff00</span>,
];
<span class="kw">let </span><span class="kw-2">mut </span>out = [<span class="number">0xabu8</span>; <span class="number">32</span>];
big_endian_from_limbs(<span class="kw-2">&amp;</span>limbs[..], <span class="kw-2">&amp;mut </span>out);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_limbs_minimal_bits() {
<span class="kw">const </span>ALL_ONES: Limb = LimbMask::True <span class="kw">as </span>Limb;
<span class="kw">static </span>CASES: <span class="kw-2">&amp;</span>[(<span class="kw-2">&amp;</span>[Limb], usize)] = <span class="kw-2">&amp;</span>[
(<span class="kw-2">&amp;</span>[], <span class="number">0</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>], <span class="number">0</span>),
(<span class="kw-2">&amp;</span>[ALL_ONES], LIMB_BITS),
(<span class="kw-2">&amp;</span>[ALL_ONES, <span class="number">0</span>], LIMB_BITS),
(<span class="kw-2">&amp;</span>[ALL_ONES, <span class="number">1</span>], LIMB_BITS + <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>], <span class="number">0</span>),
(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">0</span>], <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">1</span>], LIMB_BITS + <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[<span class="number">0</span>, ALL_ONES], <span class="number">2 </span>* LIMB_BITS),
(<span class="kw-2">&amp;</span>[ALL_ONES, ALL_ONES], <span class="number">2 </span>* LIMB_BITS),
(<span class="kw-2">&amp;</span>[ALL_ONES, ALL_ONES &gt;&gt; <span class="number">1</span>], <span class="number">2 </span>* LIMB_BITS - <span class="number">1</span>),
(<span class="kw-2">&amp;</span>[ALL_ONES, <span class="number">0b100_0000</span>], LIMB_BITS + <span class="number">7</span>),
(<span class="kw-2">&amp;</span>[ALL_ONES, <span class="number">0b101_0000</span>], LIMB_BITS + <span class="number">7</span>),
(<span class="kw-2">&amp;</span>[ALL_ONES, ALL_ONES &gt;&gt; <span class="number">1</span>], LIMB_BITS + (LIMB_BITS) - <span class="number">1</span>),
];
<span class="kw">for </span>(limbs, bits) <span class="kw">in </span>CASES {
<span class="macro">assert_eq!</span>(limbs_minimal_bits(limbs).as_usize_bits(), <span class="kw-2">*</span>bits);
}
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="ring" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>