blob: b6db303c2a20ebcfdd548e5684a07ed0e547d03d [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/base64-0.13.1/src/decode.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>decode.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="../../base64/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="../../base64/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>
<span id="605">605</span>
<span id="606">606</span>
<span id="607">607</span>
<span id="608">608</span>
<span id="609">609</span>
<span id="610">610</span>
<span id="611">611</span>
<span id="612">612</span>
<span id="613">613</span>
<span id="614">614</span>
<span id="615">615</span>
<span id="616">616</span>
<span id="617">617</span>
<span id="618">618</span>
<span id="619">619</span>
<span id="620">620</span>
<span id="621">621</span>
<span id="622">622</span>
<span id="623">623</span>
<span id="624">624</span>
<span id="625">625</span>
<span id="626">626</span>
<span id="627">627</span>
<span id="628">628</span>
<span id="629">629</span>
<span id="630">630</span>
<span id="631">631</span>
<span id="632">632</span>
<span id="633">633</span>
<span id="634">634</span>
<span id="635">635</span>
<span id="636">636</span>
<span id="637">637</span>
<span id="638">638</span>
<span id="639">639</span>
<span id="640">640</span>
<span id="641">641</span>
<span id="642">642</span>
<span id="643">643</span>
<span id="644">644</span>
<span id="645">645</span>
<span id="646">646</span>
<span id="647">647</span>
<span id="648">648</span>
<span id="649">649</span>
<span id="650">650</span>
<span id="651">651</span>
<span id="652">652</span>
<span id="653">653</span>
<span id="654">654</span>
<span id="655">655</span>
<span id="656">656</span>
<span id="657">657</span>
<span id="658">658</span>
<span id="659">659</span>
<span id="660">660</span>
<span id="661">661</span>
<span id="662">662</span>
<span id="663">663</span>
<span id="664">664</span>
<span id="665">665</span>
<span id="666">666</span>
<span id="667">667</span>
<span id="668">668</span>
<span id="669">669</span>
<span id="670">670</span>
<span id="671">671</span>
<span id="672">672</span>
<span id="673">673</span>
<span id="674">674</span>
<span id="675">675</span>
<span id="676">676</span>
<span id="677">677</span>
<span id="678">678</span>
<span id="679">679</span>
<span id="680">680</span>
<span id="681">681</span>
<span id="682">682</span>
<span id="683">683</span>
<span id="684">684</span>
<span id="685">685</span>
<span id="686">686</span>
<span id="687">687</span>
<span id="688">688</span>
<span id="689">689</span>
<span id="690">690</span>
<span id="691">691</span>
<span id="692">692</span>
<span id="693">693</span>
<span id="694">694</span>
<span id="695">695</span>
<span id="696">696</span>
<span id="697">697</span>
<span id="698">698</span>
<span id="699">699</span>
<span id="700">700</span>
<span id="701">701</span>
<span id="702">702</span>
<span id="703">703</span>
<span id="704">704</span>
<span id="705">705</span>
<span id="706">706</span>
<span id="707">707</span>
<span id="708">708</span>
<span id="709">709</span>
<span id="710">710</span>
<span id="711">711</span>
<span id="712">712</span>
<span id="713">713</span>
<span id="714">714</span>
<span id="715">715</span>
<span id="716">716</span>
<span id="717">717</span>
<span id="718">718</span>
<span id="719">719</span>
<span id="720">720</span>
<span id="721">721</span>
<span id="722">722</span>
<span id="723">723</span>
<span id="724">724</span>
<span id="725">725</span>
<span id="726">726</span>
<span id="727">727</span>
<span id="728">728</span>
<span id="729">729</span>
<span id="730">730</span>
<span id="731">731</span>
<span id="732">732</span>
<span id="733">733</span>
<span id="734">734</span>
<span id="735">735</span>
<span id="736">736</span>
<span id="737">737</span>
<span id="738">738</span>
<span id="739">739</span>
<span id="740">740</span>
<span id="741">741</span>
<span id="742">742</span>
<span id="743">743</span>
<span id="744">744</span>
<span id="745">745</span>
<span id="746">746</span>
<span id="747">747</span>
<span id="748">748</span>
<span id="749">749</span>
<span id="750">750</span>
<span id="751">751</span>
<span id="752">752</span>
<span id="753">753</span>
<span id="754">754</span>
<span id="755">755</span>
<span id="756">756</span>
<span id="757">757</span>
<span id="758">758</span>
<span id="759">759</span>
<span id="760">760</span>
<span id="761">761</span>
<span id="762">762</span>
<span id="763">763</span>
<span id="764">764</span>
<span id="765">765</span>
<span id="766">766</span>
<span id="767">767</span>
<span id="768">768</span>
<span id="769">769</span>
<span id="770">770</span>
<span id="771">771</span>
<span id="772">772</span>
<span id="773">773</span>
<span id="774">774</span>
<span id="775">775</span>
<span id="776">776</span>
<span id="777">777</span>
<span id="778">778</span>
<span id="779">779</span>
<span id="780">780</span>
<span id="781">781</span>
<span id="782">782</span>
<span id="783">783</span>
<span id="784">784</span>
<span id="785">785</span>
<span id="786">786</span>
<span id="787">787</span>
<span id="788">788</span>
<span id="789">789</span>
<span id="790">790</span>
<span id="791">791</span>
<span id="792">792</span>
<span id="793">793</span>
<span id="794">794</span>
<span id="795">795</span>
<span id="796">796</span>
<span id="797">797</span>
<span id="798">798</span>
<span id="799">799</span>
<span id="800">800</span>
<span id="801">801</span>
<span id="802">802</span>
<span id="803">803</span>
<span id="804">804</span>
<span id="805">805</span>
<span id="806">806</span>
<span id="807">807</span>
<span id="808">808</span>
<span id="809">809</span>
<span id="810">810</span>
<span id="811">811</span>
<span id="812">812</span>
<span id="813">813</span>
<span id="814">814</span>
<span id="815">815</span>
<span id="816">816</span>
<span id="817">817</span>
<span id="818">818</span>
<span id="819">819</span>
<span id="820">820</span>
<span id="821">821</span>
<span id="822">822</span>
<span id="823">823</span>
<span id="824">824</span>
<span id="825">825</span>
<span id="826">826</span>
<span id="827">827</span>
<span id="828">828</span>
<span id="829">829</span>
<span id="830">830</span>
<span id="831">831</span>
<span id="832">832</span>
<span id="833">833</span>
<span id="834">834</span>
<span id="835">835</span>
<span id="836">836</span>
<span id="837">837</span>
<span id="838">838</span>
<span id="839">839</span>
<span id="840">840</span>
<span id="841">841</span>
<span id="842">842</span>
<span id="843">843</span>
<span id="844">844</span>
<span id="845">845</span>
<span id="846">846</span>
<span id="847">847</span>
<span id="848">848</span>
<span id="849">849</span>
<span id="850">850</span>
<span id="851">851</span>
<span id="852">852</span>
<span id="853">853</span>
<span id="854">854</span>
<span id="855">855</span>
<span id="856">856</span>
<span id="857">857</span>
<span id="858">858</span>
<span id="859">859</span>
<span id="860">860</span>
<span id="861">861</span>
<span id="862">862</span>
<span id="863">863</span>
<span id="864">864</span>
<span id="865">865</span>
<span id="866">866</span>
<span id="867">867</span>
<span id="868">868</span>
<span id="869">869</span>
<span id="870">870</span>
<span id="871">871</span>
<span id="872">872</span>
<span id="873">873</span>
<span id="874">874</span>
<span id="875">875</span>
<span id="876">876</span>
<span id="877">877</span>
<span id="878">878</span>
<span id="879">879</span>
<span id="880">880</span>
<span id="881">881</span>
<span id="882">882</span>
<span id="883">883</span>
<span id="884">884</span>
<span id="885">885</span>
<span id="886">886</span>
<span id="887">887</span>
<span id="888">888</span>
<span id="889">889</span>
<span id="890">890</span>
<span id="891">891</span>
<span id="892">892</span>
<span id="893">893</span>
</pre><pre class="rust"><code><span class="kw">use crate</span>::{tables, Config, PAD_BYTE};
<span class="attribute">#[cfg(any(feature = <span class="string">&quot;alloc&quot;</span>, feature = <span class="string">&quot;std&quot;</span>, test))]
</span><span class="kw">use </span><span class="kw">crate</span>::STANDARD;
<span class="attribute">#[cfg(any(feature = <span class="string">&quot;alloc&quot;</span>, feature = <span class="string">&quot;std&quot;</span>, test))]
</span><span class="kw">use </span>alloc::vec::Vec;
<span class="kw">use </span>core::fmt;
<span class="attribute">#[cfg(any(feature = <span class="string">&quot;std&quot;</span>, test))]
</span><span class="kw">use </span>std::error;
<span class="comment">// decode logic operates on chunks of 8 input bytes without padding
</span><span class="kw">const </span>INPUT_CHUNK_LEN: usize = <span class="number">8</span>;
<span class="kw">const </span>DECODED_CHUNK_LEN: usize = <span class="number">6</span>;
<span class="comment">// we read a u64 and write a u64, but a u64 of input only yields 6 bytes of output, so the last
// 2 bytes of any output u64 should not be counted as written to (but must be available in a
// slice).
</span><span class="kw">const </span>DECODED_CHUNK_SUFFIX: usize = <span class="number">2</span>;
<span class="comment">// how many u64&#39;s of input to handle at a time
</span><span class="kw">const </span>CHUNKS_PER_FAST_LOOP_BLOCK: usize = <span class="number">4</span>;
<span class="kw">const </span>INPUT_BLOCK_LEN: usize = CHUNKS_PER_FAST_LOOP_BLOCK * INPUT_CHUNK_LEN;
<span class="comment">// includes the trailing 2 bytes for the final u64 write
</span><span class="kw">const </span>DECODED_BLOCK_LEN: usize =
CHUNKS_PER_FAST_LOOP_BLOCK * DECODED_CHUNK_LEN + DECODED_CHUNK_SUFFIX;
<span class="doccomment">/// Errors that can occur while decoding.
</span><span class="attribute">#[derive(Clone, Debug, PartialEq, Eq)]
</span><span class="kw">pub enum </span>DecodeError {
<span class="doccomment">/// An invalid byte was found in the input. The offset and offending byte are provided.
</span>InvalidByte(usize, u8),
<span class="doccomment">/// The length of the input is invalid.
/// A typical cause of this is stray trailing whitespace or other separator bytes.
/// In the case where excess trailing bytes have produced an invalid length *and* the last byte
/// is also an invalid base64 symbol (as would be the case for whitespace, etc), `InvalidByte`
/// will be emitted instead of `InvalidLength` to make the issue easier to debug.
</span>InvalidLength,
<span class="doccomment">/// The last non-padding input symbol&#39;s encoded 6 bits have nonzero bits that will be discarded.
/// This is indicative of corrupted or truncated Base64.
/// Unlike InvalidByte, which reports symbols that aren&#39;t in the alphabet, this error is for
/// symbols that are in the alphabet but represent nonsensical encodings.
</span>InvalidLastSymbol(usize, u8),
}
<span class="kw">impl </span>fmt::Display <span class="kw">for </span>DecodeError {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter) -&gt; fmt::Result {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
DecodeError::InvalidByte(index, byte) =&gt; {
<span class="macro">write!</span>(f, <span class="string">&quot;Invalid byte {}, offset {}.&quot;</span>, byte, index)
}
DecodeError::InvalidLength =&gt; <span class="macro">write!</span>(f, <span class="string">&quot;Encoded text cannot have a 6-bit remainder.&quot;</span>),
DecodeError::InvalidLastSymbol(index, byte) =&gt; {
<span class="macro">write!</span>(f, <span class="string">&quot;Invalid last symbol {}, offset {}.&quot;</span>, byte, index)
}
}
}
}
<span class="attribute">#[cfg(any(feature = <span class="string">&quot;std&quot;</span>, test))]
</span><span class="kw">impl </span>error::Error <span class="kw">for </span>DecodeError {
<span class="kw">fn </span>description(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>str {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
DecodeError::InvalidByte(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; <span class="string">&quot;invalid byte&quot;</span>,
DecodeError::InvalidLength =&gt; <span class="string">&quot;invalid length&quot;</span>,
DecodeError::InvalidLastSymbol(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; <span class="string">&quot;invalid last symbol&quot;</span>,
}
}
<span class="kw">fn </span>cause(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="kw">dyn </span>error::Error&gt; {
<span class="prelude-val">None
</span>}
}
<span class="doccomment">///Decode from string reference as octets.
///Returns a Result containing a Vec&lt;u8&gt;.
///Convenience `decode_config(input, base64::STANDARD);`.
///
///# Example
///
///```rust
///extern crate base64;
///
///fn main() {
/// let bytes = base64::decode(&quot;aGVsbG8gd29ybGQ=&quot;).unwrap();
/// println!(&quot;{:?}&quot;, bytes);
///}
///```
</span><span class="attribute">#[cfg(any(feature = <span class="string">&quot;alloc&quot;</span>, feature = <span class="string">&quot;std&quot;</span>, test))]
</span><span class="kw">pub fn </span>decode&lt;T: AsRef&lt;[u8]&gt;&gt;(input: T) -&gt; <span class="prelude-ty">Result</span>&lt;Vec&lt;u8&gt;, DecodeError&gt; {
decode_config(input, STANDARD)
}
<span class="doccomment">///Decode from string reference as octets.
///Returns a Result containing a Vec&lt;u8&gt;.
///
///# Example
///
///```rust
///extern crate base64;
///
///fn main() {
/// let bytes = base64::decode_config(&quot;aGVsbG8gd29ybGR+Cg==&quot;, base64::STANDARD).unwrap();
/// println!(&quot;{:?}&quot;, bytes);
///
/// let bytes_url = base64::decode_config(&quot;aGVsbG8gaW50ZXJuZXR-Cg==&quot;, base64::URL_SAFE).unwrap();
/// println!(&quot;{:?}&quot;, bytes_url);
///}
///```
</span><span class="attribute">#[cfg(any(feature = <span class="string">&quot;alloc&quot;</span>, feature = <span class="string">&quot;std&quot;</span>, test))]
</span><span class="kw">pub fn </span>decode_config&lt;T: AsRef&lt;[u8]&gt;&gt;(input: T, config: Config) -&gt; <span class="prelude-ty">Result</span>&lt;Vec&lt;u8&gt;, DecodeError&gt; {
<span class="kw">let </span>decoded_length_estimate = (input
.as_ref()
.len()
.checked_add(<span class="number">3</span>)
.expect(<span class="string">&quot;decoded length calculation overflow&quot;</span>))
/ <span class="number">4
</span>* <span class="number">3</span>;
<span class="kw">let </span><span class="kw-2">mut </span>buffer = Vec::&lt;u8&gt;::with_capacity(decoded_length_estimate);
decode_config_buf(input, config, <span class="kw-2">&amp;mut </span>buffer).map(|<span class="kw">_</span>| buffer)
}
<span class="doccomment">///Decode from string reference as octets.
///Writes into the supplied buffer to avoid allocation.
///Returns a Result containing an empty tuple, aka ().
///
///# Example
///
///```rust
///extern crate base64;
///
///fn main() {
/// let mut buffer = Vec::&lt;u8&gt;::new();
/// base64::decode_config_buf(&quot;aGVsbG8gd29ybGR+Cg==&quot;, base64::STANDARD, &amp;mut buffer).unwrap();
/// println!(&quot;{:?}&quot;, buffer);
///
/// buffer.clear();
///
/// base64::decode_config_buf(&quot;aGVsbG8gaW50ZXJuZXR-Cg==&quot;, base64::URL_SAFE, &amp;mut buffer)
/// .unwrap();
/// println!(&quot;{:?}&quot;, buffer);
///}
///```
</span><span class="attribute">#[cfg(any(feature = <span class="string">&quot;alloc&quot;</span>, feature = <span class="string">&quot;std&quot;</span>, test))]
</span><span class="kw">pub fn </span>decode_config_buf&lt;T: AsRef&lt;[u8]&gt;&gt;(
input: T,
config: Config,
buffer: <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;,
) -&gt; <span class="prelude-ty">Result</span>&lt;(), DecodeError&gt; {
<span class="kw">let </span>input_bytes = input.as_ref();
<span class="kw">let </span>starting_output_len = buffer.len();
<span class="kw">let </span>num_chunks = num_chunks(input_bytes);
<span class="kw">let </span>decoded_len_estimate = num_chunks
.checked_mul(DECODED_CHUNK_LEN)
.and_then(|p| p.checked_add(starting_output_len))
.expect(<span class="string">&quot;Overflow when calculating output buffer length&quot;</span>);
buffer.resize(decoded_len_estimate, <span class="number">0</span>);
<span class="kw">let </span>bytes_written;
{
<span class="kw">let </span>buffer_slice = <span class="kw-2">&amp;mut </span>buffer.as_mut_slice()[starting_output_len..];
bytes_written = decode_helper(input_bytes, num_chunks, config, buffer_slice)<span class="question-mark">?</span>;
}
buffer.truncate(starting_output_len + bytes_written);
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Decode the input into the provided output slice.
///
/// This will not write any bytes past exactly what is decoded (no stray garbage bytes at the end).
///
/// If you don&#39;t know ahead of time what the decoded length should be, size your buffer with a
/// conservative estimate for the decoded length of an input: 3 bytes of output for every 4 bytes of
/// input, rounded up, or in other words `(input_len + 3) / 4 * 3`.
///
/// If the slice is not large enough, this will panic.
</span><span class="kw">pub fn </span>decode_config_slice&lt;T: AsRef&lt;[u8]&gt;&gt;(
input: T,
config: Config,
output: <span class="kw-2">&amp;mut </span>[u8],
) -&gt; <span class="prelude-ty">Result</span>&lt;usize, DecodeError&gt; {
<span class="kw">let </span>input_bytes = input.as_ref();
decode_helper(input_bytes, num_chunks(input_bytes), config, output)
}
<span class="doccomment">/// Return the number of input chunks (including a possibly partial final chunk) in the input
</span><span class="kw">fn </span>num_chunks(input: <span class="kw-2">&amp;</span>[u8]) -&gt; usize {
input
.len()
.checked_add(INPUT_CHUNK_LEN - <span class="number">1</span>)
.expect(<span class="string">&quot;Overflow when calculating number of chunks in input&quot;</span>)
/ INPUT_CHUNK_LEN
}
<span class="doccomment">/// Helper to avoid duplicating num_chunks calculation, which is costly on short inputs.
/// Returns the number of bytes written, or an error.
</span><span class="comment">// We&#39;re on the fragile edge of compiler heuristics here. If this is not inlined, slow. If this is
// inlined(always), a different slow. plain ol&#39; inline makes the benchmarks happiest at the moment,
// but this is fragile and the best setting changes with only minor code modifications.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>decode_helper(
input: <span class="kw-2">&amp;</span>[u8],
num_chunks: usize,
config: Config,
output: <span class="kw-2">&amp;mut </span>[u8],
) -&gt; <span class="prelude-ty">Result</span>&lt;usize, DecodeError&gt; {
<span class="kw">let </span>char_set = config.char_set;
<span class="kw">let </span>decode_table = char_set.decode_table();
<span class="kw">let </span>remainder_len = input.len() % INPUT_CHUNK_LEN;
<span class="comment">// Because the fast decode loop writes in groups of 8 bytes (unrolled to
// CHUNKS_PER_FAST_LOOP_BLOCK times 8 bytes, where possible) and outputs 8 bytes at a time (of
// which only 6 are valid data), we need to be sure that we stop using the fast decode loop
// soon enough that there will always be 2 more bytes of valid data written after that loop.
</span><span class="kw">let </span>trailing_bytes_to_skip = <span class="kw">match </span>remainder_len {
<span class="comment">// if input is a multiple of the chunk size, ignore the last chunk as it may have padding,
// and the fast decode logic cannot handle padding
</span><span class="number">0 </span>=&gt; INPUT_CHUNK_LEN,
<span class="comment">// 1 and 5 trailing bytes are illegal: can&#39;t decode 6 bits of input into a byte
</span><span class="number">1 </span>| <span class="number">5 </span>=&gt; {
<span class="comment">// trailing whitespace is so common that it&#39;s worth it to check the last byte to
// possibly return a better error message
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(b) = input.last() {
<span class="kw">if </span><span class="kw-2">*</span>b != PAD_BYTE &amp;&amp; decode_table[<span class="kw-2">*</span>b <span class="kw">as </span>usize] == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(input.len() - <span class="number">1</span>, <span class="kw-2">*</span>b));
}
}
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidLength);
}
<span class="comment">// This will decode to one output byte, which isn&#39;t enough to overwrite the 2 extra bytes
// written by the fast decode loop. So, we have to ignore both these 2 bytes and the
// previous chunk.
</span><span class="number">2 </span>=&gt; INPUT_CHUNK_LEN + <span class="number">2</span>,
<span class="comment">// If this is 3 unpadded chars, then it would actually decode to 2 bytes. However, if this
// is an erroneous 2 chars + 1 pad char that would decode to 1 byte, then it should fail
// with an error, not panic from going past the bounds of the output slice, so we let it
// use stage 3 + 4.
</span><span class="number">3 </span>=&gt; INPUT_CHUNK_LEN + <span class="number">3</span>,
<span class="comment">// This can also decode to one output byte because it may be 2 input chars + 2 padding
// chars, which would decode to 1 byte.
</span><span class="number">4 </span>=&gt; INPUT_CHUNK_LEN + <span class="number">4</span>,
<span class="comment">// Everything else is a legal decode len (given that we don&#39;t require padding), and will
// decode to at least 2 bytes of output.
</span><span class="kw">_ </span>=&gt; remainder_len,
};
<span class="comment">// rounded up to include partial chunks
</span><span class="kw">let </span><span class="kw-2">mut </span>remaining_chunks = num_chunks;
<span class="kw">let </span><span class="kw-2">mut </span>input_index = <span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>output_index = <span class="number">0</span>;
{
<span class="kw">let </span>length_of_fast_decode_chunks = input.len().saturating_sub(trailing_bytes_to_skip);
<span class="comment">// Fast loop, stage 1
// manual unroll to CHUNKS_PER_FAST_LOOP_BLOCK of u64s to amortize slice bounds checks
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(max_start_index) = length_of_fast_decode_chunks.checked_sub(INPUT_BLOCK_LEN) {
<span class="kw">while </span>input_index &lt;= max_start_index {
<span class="kw">let </span>input_slice = <span class="kw-2">&amp;</span>input[input_index..(input_index + INPUT_BLOCK_LEN)];
<span class="kw">let </span>output_slice = <span class="kw-2">&amp;mut </span>output[output_index..(output_index + DECODED_BLOCK_LEN)];
decode_chunk(
<span class="kw-2">&amp;</span>input_slice[<span class="number">0</span>..],
input_index,
decode_table,
<span class="kw-2">&amp;mut </span>output_slice[<span class="number">0</span>..],
)<span class="question-mark">?</span>;
decode_chunk(
<span class="kw-2">&amp;</span>input_slice[<span class="number">8</span>..],
input_index + <span class="number">8</span>,
decode_table,
<span class="kw-2">&amp;mut </span>output_slice[<span class="number">6</span>..],
)<span class="question-mark">?</span>;
decode_chunk(
<span class="kw-2">&amp;</span>input_slice[<span class="number">16</span>..],
input_index + <span class="number">16</span>,
decode_table,
<span class="kw-2">&amp;mut </span>output_slice[<span class="number">12</span>..],
)<span class="question-mark">?</span>;
decode_chunk(
<span class="kw-2">&amp;</span>input_slice[<span class="number">24</span>..],
input_index + <span class="number">24</span>,
decode_table,
<span class="kw-2">&amp;mut </span>output_slice[<span class="number">18</span>..],
)<span class="question-mark">?</span>;
input_index += INPUT_BLOCK_LEN;
output_index += DECODED_BLOCK_LEN - DECODED_CHUNK_SUFFIX;
remaining_chunks -= CHUNKS_PER_FAST_LOOP_BLOCK;
}
}
<span class="comment">// Fast loop, stage 2 (aka still pretty fast loop)
// 8 bytes at a time for whatever we didn&#39;t do in stage 1.
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(max_start_index) = length_of_fast_decode_chunks.checked_sub(INPUT_CHUNK_LEN) {
<span class="kw">while </span>input_index &lt; max_start_index {
decode_chunk(
<span class="kw-2">&amp;</span>input[input_index..(input_index + INPUT_CHUNK_LEN)],
input_index,
decode_table,
<span class="kw-2">&amp;mut </span>output
[output_index..(output_index + DECODED_CHUNK_LEN + DECODED_CHUNK_SUFFIX)],
)<span class="question-mark">?</span>;
output_index += DECODED_CHUNK_LEN;
input_index += INPUT_CHUNK_LEN;
remaining_chunks -= <span class="number">1</span>;
}
}
}
<span class="comment">// Stage 3
// If input length was such that a chunk had to be deferred until after the fast loop
// because decoding it would have produced 2 trailing bytes that wouldn&#39;t then be
// overwritten, we decode that chunk here. This way is slower but doesn&#39;t write the 2
// trailing bytes.
// However, we still need to avoid the last chunk (partial or complete) because it could
// have padding, so we always do 1 fewer to avoid the last chunk.
</span><span class="kw">for _ in </span><span class="number">1</span>..remaining_chunks {
decode_chunk_precise(
<span class="kw-2">&amp;</span>input[input_index..],
input_index,
decode_table,
<span class="kw-2">&amp;mut </span>output[output_index..(output_index + DECODED_CHUNK_LEN)],
)<span class="question-mark">?</span>;
input_index += INPUT_CHUNK_LEN;
output_index += DECODED_CHUNK_LEN;
}
<span class="comment">// always have one more (possibly partial) block of 8 input
</span><span class="macro">debug_assert!</span>(input.len() - input_index &gt; <span class="number">1 </span>|| input.is_empty());
<span class="macro">debug_assert!</span>(input.len() - input_index &lt;= <span class="number">8</span>);
<span class="comment">// Stage 4
// Finally, decode any leftovers that aren&#39;t a complete input block of 8 bytes.
// Use a u64 as a stack-resident 8 byte buffer.
</span><span class="kw">let </span><span class="kw-2">mut </span>leftover_bits: u64 = <span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>morsels_in_leftover = <span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>padding_bytes = <span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>first_padding_index: usize = <span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>last_symbol = <span class="number">0_u8</span>;
<span class="kw">let </span>start_of_leftovers = input_index;
<span class="kw">for </span>(i, b) <span class="kw">in </span>input[start_of_leftovers..].iter().enumerate() {
<span class="comment">// &#39;=&#39; padding
</span><span class="kw">if </span><span class="kw-2">*</span>b == PAD_BYTE {
<span class="comment">// There can be bad padding in a few ways:
// 1 - Padding with non-padding characters after it
// 2 - Padding after zero or one non-padding characters before it
// in the current quad.
// 3 - More than two characters of padding. If 3 or 4 padding chars
// are in the same quad, that implies it will be caught by #2.
// If it spreads from one quad to another, it will be caught by
// #2 in the second quad.
</span><span class="kw">if </span>i % <span class="number">4 </span>&lt; <span class="number">2 </span>{
<span class="comment">// Check for case #2.
</span><span class="kw">let </span>bad_padding_index = start_of_leftovers
+ <span class="kw">if </span>padding_bytes &gt; <span class="number">0 </span>{
<span class="comment">// If we&#39;ve already seen padding, report the first padding index.
// This is to be consistent with the faster logic above: it will report an
// error on the first padding character (since it doesn&#39;t expect to see
// anything but actual encoded data).
</span>first_padding_index
} <span class="kw">else </span>{
<span class="comment">// haven&#39;t seen padding before, just use where we are now
</span>i
};
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(bad_padding_index, <span class="kw-2">*</span>b));
}
<span class="kw">if </span>padding_bytes == <span class="number">0 </span>{
first_padding_index = i;
}
padding_bytes += <span class="number">1</span>;
<span class="kw">continue</span>;
}
<span class="comment">// Check for case #1.
// To make &#39;=&#39; handling consistent with the main loop, don&#39;t allow
// non-suffix &#39;=&#39; in trailing chunk either. Report error as first
// erroneous padding.
</span><span class="kw">if </span>padding_bytes &gt; <span class="number">0 </span>{
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
start_of_leftovers + first_padding_index,
PAD_BYTE,
));
}
last_symbol = <span class="kw-2">*</span>b;
<span class="comment">// can use up to 8 * 6 = 48 bits of the u64, if last chunk has no padding.
// To minimize shifts, pack the leftovers from left to right.
</span><span class="kw">let </span>shift = <span class="number">64 </span>- (morsels_in_leftover + <span class="number">1</span>) * <span class="number">6</span>;
<span class="comment">// tables are all 256 elements, lookup with a u8 index always succeeds
</span><span class="kw">let </span>morsel = decode_table[<span class="kw-2">*</span>b <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(start_of_leftovers + i, <span class="kw-2">*</span>b));
}
leftover_bits |= (morsel <span class="kw">as </span>u64) &lt;&lt; shift;
morsels_in_leftover += <span class="number">1</span>;
}
<span class="kw">let </span>leftover_bits_ready_to_append = <span class="kw">match </span>morsels_in_leftover {
<span class="number">0 </span>=&gt; <span class="number">0</span>,
<span class="number">2 </span>=&gt; <span class="number">8</span>,
<span class="number">3 </span>=&gt; <span class="number">16</span>,
<span class="number">4 </span>=&gt; <span class="number">24</span>,
<span class="number">6 </span>=&gt; <span class="number">32</span>,
<span class="number">7 </span>=&gt; <span class="number">40</span>,
<span class="number">8 </span>=&gt; <span class="number">48</span>,
<span class="kw">_ </span>=&gt; <span class="macro">unreachable!</span>(
<span class="string">&quot;Impossible: must only have 0 to 8 input bytes in last chunk, with no invalid lengths&quot;
</span>),
};
<span class="comment">// if there are bits set outside the bits we care about, last symbol encodes trailing bits that
// will not be included in the output
</span><span class="kw">let </span>mask = !<span class="number">0 </span>&gt;&gt; leftover_bits_ready_to_append;
<span class="kw">if </span>!config.decode_allow_trailing_bits &amp;&amp; (leftover_bits &amp; mask) != <span class="number">0 </span>{
<span class="comment">// last morsel is at `morsels_in_leftover` - 1
</span><span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(
start_of_leftovers + morsels_in_leftover - <span class="number">1</span>,
last_symbol,
));
}
<span class="kw">let </span><span class="kw-2">mut </span>leftover_bits_appended_to_buf = <span class="number">0</span>;
<span class="kw">while </span>leftover_bits_appended_to_buf &lt; leftover_bits_ready_to_append {
<span class="comment">// `as` simply truncates the higher bits, which is what we want here
</span><span class="kw">let </span>selected_bits = (leftover_bits &gt;&gt; (<span class="number">56 </span>- leftover_bits_appended_to_buf)) <span class="kw">as </span>u8;
output[output_index] = selected_bits;
output_index += <span class="number">1</span>;
leftover_bits_appended_to_buf += <span class="number">8</span>;
}
<span class="prelude-val">Ok</span>(output_index)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>write_u64(output: <span class="kw-2">&amp;mut </span>[u8], value: u64) {
output[..<span class="number">8</span>].copy_from_slice(<span class="kw-2">&amp;</span>value.to_be_bytes());
}
<span class="doccomment">/// Decode 8 bytes of input into 6 bytes of output. 8 bytes of output will be written, but only the
/// first 6 of those contain meaningful data.
///
/// `input` is the bytes to decode, of which the first 8 bytes will be processed.
/// `index_at_start_of_input` is the offset in the overall input (used for reporting errors
/// accurately)
/// `decode_table` is the lookup table for the particular base64 alphabet.
/// `output` will have its first 8 bytes overwritten, of which only the first 6 are valid decoded
/// data.
</span><span class="comment">// yes, really inline (worth 30-50% speedup)
</span><span class="attribute">#[inline(always)]
</span><span class="kw">fn </span>decode_chunk(
input: <span class="kw-2">&amp;</span>[u8],
index_at_start_of_input: usize,
decode_table: <span class="kw-2">&amp;</span>[u8; <span class="number">256</span>],
output: <span class="kw-2">&amp;mut </span>[u8],
) -&gt; <span class="prelude-ty">Result</span>&lt;(), DecodeError&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>accum: u64;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">0</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(index_at_start_of_input, input[<span class="number">0</span>]));
}
accum = (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">58</span>;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">1</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
index_at_start_of_input + <span class="number">1</span>,
input[<span class="number">1</span>],
));
}
accum |= (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">52</span>;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">2</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
index_at_start_of_input + <span class="number">2</span>,
input[<span class="number">2</span>],
));
}
accum |= (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">46</span>;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">3</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
index_at_start_of_input + <span class="number">3</span>,
input[<span class="number">3</span>],
));
}
accum |= (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">40</span>;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">4</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
index_at_start_of_input + <span class="number">4</span>,
input[<span class="number">4</span>],
));
}
accum |= (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">34</span>;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">5</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
index_at_start_of_input + <span class="number">5</span>,
input[<span class="number">5</span>],
));
}
accum |= (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">28</span>;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">6</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
index_at_start_of_input + <span class="number">6</span>,
input[<span class="number">6</span>],
));
}
accum |= (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">22</span>;
<span class="kw">let </span>morsel = decode_table[input[<span class="number">7</span>] <span class="kw">as </span>usize];
<span class="kw">if </span>morsel == tables::INVALID_VALUE {
<span class="kw">return </span><span class="prelude-val">Err</span>(DecodeError::InvalidByte(
index_at_start_of_input + <span class="number">7</span>,
input[<span class="number">7</span>],
));
}
accum |= (morsel <span class="kw">as </span>u64) &lt;&lt; <span class="number">16</span>;
write_u64(output, accum);
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Decode an 8-byte chunk, but only write the 6 bytes actually decoded instead of including 2
/// trailing garbage bytes.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>decode_chunk_precise(
input: <span class="kw-2">&amp;</span>[u8],
index_at_start_of_input: usize,
decode_table: <span class="kw-2">&amp;</span>[u8; <span class="number">256</span>],
output: <span class="kw-2">&amp;mut </span>[u8],
) -&gt; <span class="prelude-ty">Result</span>&lt;(), DecodeError&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>tmp_buf = [<span class="number">0_u8</span>; <span class="number">8</span>];
decode_chunk(
input,
index_at_start_of_input,
decode_table,
<span class="kw-2">&amp;mut </span>tmp_buf[..],
)<span class="question-mark">?</span>;
output[<span class="number">0</span>..<span class="number">6</span>].copy_from_slice(<span class="kw-2">&amp;</span>tmp_buf[<span class="number">0</span>..<span class="number">6</span>]);
<span class="prelude-val">Ok</span>(())
}
<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">use crate</span>::{
encode::encode_config_buf,
encode::encode_config_slice,
tests::{assert_encode_sanity, random_config},
};
<span class="kw">use </span>rand::{
distributions::{Distribution, Uniform},
FromEntropy, Rng,
};
<span class="attribute">#[test]
</span><span class="kw">fn </span>decode_chunk_precise_writes_only_6_bytes() {
<span class="kw">let </span>input = <span class="string">b&quot;Zm9vYmFy&quot;</span>; <span class="comment">// &quot;foobar&quot;
</span><span class="kw">let </span><span class="kw-2">mut </span>output = [<span class="number">0_u8</span>, <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>];
decode_chunk_precise(<span class="kw-2">&amp;</span>input[..], <span class="number">0</span>, tables::STANDARD_DECODE, <span class="kw-2">&amp;mut </span>output).unwrap();
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span><span class="macro">vec!</span>[<span class="string">b&#39;f&#39;</span>, <span class="string">b&#39;o&#39;</span>, <span class="string">b&#39;o&#39;</span>, <span class="string">b&#39;b&#39;</span>, <span class="string">b&#39;a&#39;</span>, <span class="string">b&#39;r&#39;</span>, <span class="number">6</span>, <span class="number">7</span>], <span class="kw-2">&amp;</span>output);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>decode_chunk_writes_8_bytes() {
<span class="kw">let </span>input = <span class="string">b&quot;Zm9vYmFy&quot;</span>; <span class="comment">// &quot;foobar&quot;
</span><span class="kw">let </span><span class="kw-2">mut </span>output = [<span class="number">0_u8</span>, <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>];
decode_chunk(<span class="kw-2">&amp;</span>input[..], <span class="number">0</span>, tables::STANDARD_DECODE, <span class="kw-2">&amp;mut </span>output).unwrap();
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span><span class="macro">vec!</span>[<span class="string">b&#39;f&#39;</span>, <span class="string">b&#39;o&#39;</span>, <span class="string">b&#39;o&#39;</span>, <span class="string">b&#39;b&#39;</span>, <span class="string">b&#39;a&#39;</span>, <span class="string">b&#39;r&#39;</span>, <span class="number">0</span>, <span class="number">0</span>], <span class="kw-2">&amp;</span>output);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>decode_into_nonempty_vec_doesnt_clobber_existing_prefix() {
<span class="kw">let </span><span class="kw-2">mut </span>orig_data = Vec::new();
<span class="kw">let </span><span class="kw-2">mut </span>encoded_data = String::new();
<span class="kw">let </span><span class="kw-2">mut </span>decoded_with_prefix = Vec::new();
<span class="kw">let </span><span class="kw-2">mut </span>decoded_without_prefix = Vec::new();
<span class="kw">let </span><span class="kw-2">mut </span>prefix = Vec::new();
<span class="kw">let </span>prefix_len_range = Uniform::new(<span class="number">0</span>, <span class="number">1000</span>);
<span class="kw">let </span>input_len_range = Uniform::new(<span class="number">0</span>, <span class="number">1000</span>);
<span class="kw">let </span><span class="kw-2">mut </span>rng = rand::rngs::SmallRng::from_entropy();
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">10_000 </span>{
orig_data.clear();
encoded_data.clear();
decoded_with_prefix.clear();
decoded_without_prefix.clear();
prefix.clear();
<span class="kw">let </span>input_len = input_len_range.sample(<span class="kw-2">&amp;mut </span>rng);
<span class="kw">for _ in </span><span class="number">0</span>..input_len {
orig_data.push(rng.gen());
}
<span class="kw">let </span>config = random_config(<span class="kw-2">&amp;mut </span>rng);
encode_config_buf(<span class="kw-2">&amp;</span>orig_data, config, <span class="kw-2">&amp;mut </span>encoded_data);
assert_encode_sanity(<span class="kw-2">&amp;</span>encoded_data, config, input_len);
<span class="kw">let </span>prefix_len = prefix_len_range.sample(<span class="kw-2">&amp;mut </span>rng);
<span class="comment">// fill the buf with a prefix
</span><span class="kw">for _ in </span><span class="number">0</span>..prefix_len {
prefix.push(rng.gen());
}
decoded_with_prefix.resize(prefix_len, <span class="number">0</span>);
decoded_with_prefix.copy_from_slice(<span class="kw-2">&amp;</span>prefix);
<span class="comment">// decode into the non-empty buf
</span>decode_config_buf(<span class="kw-2">&amp;</span>encoded_data, config, <span class="kw-2">&amp;mut </span>decoded_with_prefix).unwrap();
<span class="comment">// also decode into the empty buf
</span>decode_config_buf(<span class="kw-2">&amp;</span>encoded_data, config, <span class="kw-2">&amp;mut </span>decoded_without_prefix).unwrap();
<span class="macro">assert_eq!</span>(
prefix_len + decoded_without_prefix.len(),
decoded_with_prefix.len()
);
<span class="macro">assert_eq!</span>(orig_data, decoded_without_prefix);
<span class="comment">// append plain decode onto prefix
</span>prefix.append(<span class="kw-2">&amp;mut </span>decoded_without_prefix);
<span class="macro">assert_eq!</span>(prefix, decoded_with_prefix);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>decode_into_slice_doesnt_clobber_existing_prefix_or_suffix() {
<span class="kw">let </span><span class="kw-2">mut </span>orig_data = Vec::new();
<span class="kw">let </span><span class="kw-2">mut </span>encoded_data = String::new();
<span class="kw">let </span><span class="kw-2">mut </span>decode_buf = Vec::new();
<span class="kw">let </span><span class="kw-2">mut </span>decode_buf_copy: Vec&lt;u8&gt; = Vec::new();
<span class="kw">let </span>input_len_range = Uniform::new(<span class="number">0</span>, <span class="number">1000</span>);
<span class="kw">let </span><span class="kw-2">mut </span>rng = rand::rngs::SmallRng::from_entropy();
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">10_000 </span>{
orig_data.clear();
encoded_data.clear();
decode_buf.clear();
decode_buf_copy.clear();
<span class="kw">let </span>input_len = input_len_range.sample(<span class="kw-2">&amp;mut </span>rng);
<span class="kw">for _ in </span><span class="number">0</span>..input_len {
orig_data.push(rng.gen());
}
<span class="kw">let </span>config = random_config(<span class="kw-2">&amp;mut </span>rng);
encode_config_buf(<span class="kw-2">&amp;</span>orig_data, config, <span class="kw-2">&amp;mut </span>encoded_data);
assert_encode_sanity(<span class="kw-2">&amp;</span>encoded_data, config, input_len);
<span class="comment">// fill the buffer with random garbage, long enough to have some room before and after
</span><span class="kw">for _ in </span><span class="number">0</span>..<span class="number">5000 </span>{
decode_buf.push(rng.gen());
}
<span class="comment">// keep a copy for later comparison
</span>decode_buf_copy.extend(decode_buf.iter());
<span class="kw">let </span>offset = <span class="number">1000</span>;
<span class="comment">// decode into the non-empty buf
</span><span class="kw">let </span>decode_bytes_written =
decode_config_slice(<span class="kw-2">&amp;</span>encoded_data, config, <span class="kw-2">&amp;mut </span>decode_buf[offset..]).unwrap();
<span class="macro">assert_eq!</span>(orig_data.len(), decode_bytes_written);
<span class="macro">assert_eq!</span>(
orig_data,
<span class="kw-2">&amp;</span>decode_buf[offset..(offset + decode_bytes_written)]
);
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>decode_buf_copy[<span class="number">0</span>..offset], <span class="kw-2">&amp;</span>decode_buf[<span class="number">0</span>..offset]);
<span class="macro">assert_eq!</span>(
<span class="kw-2">&amp;</span>decode_buf_copy[offset + decode_bytes_written..],
<span class="kw-2">&amp;</span>decode_buf[offset + decode_bytes_written..]
);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>decode_into_slice_fits_in_precisely_sized_slice() {
<span class="kw">let </span><span class="kw-2">mut </span>orig_data = Vec::new();
<span class="kw">let </span><span class="kw-2">mut </span>encoded_data = String::new();
<span class="kw">let </span><span class="kw-2">mut </span>decode_buf = Vec::new();
<span class="kw">let </span>input_len_range = Uniform::new(<span class="number">0</span>, <span class="number">1000</span>);
<span class="kw">let </span><span class="kw-2">mut </span>rng = rand::rngs::SmallRng::from_entropy();
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">10_000 </span>{
orig_data.clear();
encoded_data.clear();
decode_buf.clear();
<span class="kw">let </span>input_len = input_len_range.sample(<span class="kw-2">&amp;mut </span>rng);
<span class="kw">for _ in </span><span class="number">0</span>..input_len {
orig_data.push(rng.gen());
}
<span class="kw">let </span>config = random_config(<span class="kw-2">&amp;mut </span>rng);
encode_config_buf(<span class="kw-2">&amp;</span>orig_data, config, <span class="kw-2">&amp;mut </span>encoded_data);
assert_encode_sanity(<span class="kw-2">&amp;</span>encoded_data, config, input_len);
decode_buf.resize(input_len, <span class="number">0</span>);
<span class="comment">// decode into the non-empty buf
</span><span class="kw">let </span>decode_bytes_written =
decode_config_slice(<span class="kw-2">&amp;</span>encoded_data, config, <span class="kw-2">&amp;mut </span>decode_buf[..]).unwrap();
<span class="macro">assert_eq!</span>(orig_data.len(), decode_bytes_written);
<span class="macro">assert_eq!</span>(orig_data, decode_buf);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>detect_invalid_last_symbol_two_bytes() {
<span class="kw">let </span>decode =
|input, forgiving| decode_config(input, STANDARD.decode_allow_trailing_bits(forgiving));
<span class="comment">// example from https://github.com/marshallpierce/rust-base64/issues/75
</span><span class="macro">assert!</span>(decode(<span class="string">&quot;iYU=&quot;</span>, <span class="bool-val">false</span>).is_ok());
<span class="comment">// trailing 01
</span><span class="macro">assert_eq!</span>(
<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">2</span>, <span class="string">b&#39;V&#39;</span>)),
decode(<span class="string">&quot;iYV=&quot;</span>, <span class="bool-val">false</span>)
);
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(<span class="macro">vec!</span>[<span class="number">137</span>, <span class="number">133</span>]), decode(<span class="string">&quot;iYV=&quot;</span>, <span class="bool-val">true</span>));
<span class="comment">// trailing 10
</span><span class="macro">assert_eq!</span>(
<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">2</span>, <span class="string">b&#39;W&#39;</span>)),
decode(<span class="string">&quot;iYW=&quot;</span>, <span class="bool-val">false</span>)
);
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(<span class="macro">vec!</span>[<span class="number">137</span>, <span class="number">133</span>]), decode(<span class="string">&quot;iYV=&quot;</span>, <span class="bool-val">true</span>));
<span class="comment">// trailing 11
</span><span class="macro">assert_eq!</span>(
<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">2</span>, <span class="string">b&#39;X&#39;</span>)),
decode(<span class="string">&quot;iYX=&quot;</span>, <span class="bool-val">false</span>)
);
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(<span class="macro">vec!</span>[<span class="number">137</span>, <span class="number">133</span>]), decode(<span class="string">&quot;iYV=&quot;</span>, <span class="bool-val">true</span>));
<span class="comment">// also works when there are 2 quads in the last block
</span><span class="macro">assert_eq!</span>(
<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">6</span>, <span class="string">b&#39;X&#39;</span>)),
decode(<span class="string">&quot;AAAAiYX=&quot;</span>, <span class="bool-val">false</span>)
);
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(<span class="macro">vec!</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">137</span>, <span class="number">133</span>]), decode(<span class="string">&quot;AAAAiYX=&quot;</span>, <span class="bool-val">true</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>detect_invalid_last_symbol_one_byte() {
<span class="comment">// 0xFF -&gt; &quot;/w==&quot;, so all letters &gt; w, 0-9, and &#39;+&#39;, &#39;/&#39; should get InvalidLastSymbol
</span><span class="macro">assert!</span>(decode(<span class="string">&quot;/w==&quot;</span>).is_ok());
<span class="comment">// trailing 01
</span><span class="macro">assert_eq!</span>(<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">1</span>, <span class="string">b&#39;x&#39;</span>)), decode(<span class="string">&quot;/x==&quot;</span>));
<span class="macro">assert_eq!</span>(<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">1</span>, <span class="string">b&#39;z&#39;</span>)), decode(<span class="string">&quot;/z==&quot;</span>));
<span class="macro">assert_eq!</span>(<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">1</span>, <span class="string">b&#39;0&#39;</span>)), decode(<span class="string">&quot;/0==&quot;</span>));
<span class="macro">assert_eq!</span>(<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">1</span>, <span class="string">b&#39;9&#39;</span>)), decode(<span class="string">&quot;/9==&quot;</span>));
<span class="macro">assert_eq!</span>(<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">1</span>, <span class="string">b&#39;+&#39;</span>)), decode(<span class="string">&quot;/+==&quot;</span>));
<span class="macro">assert_eq!</span>(<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">1</span>, <span class="string">b&#39;/&#39;</span>)), decode(<span class="string">&quot;//==&quot;</span>));
<span class="comment">// also works when there are 2 quads in the last block
</span><span class="macro">assert_eq!</span>(
<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">5</span>, <span class="string">b&#39;x&#39;</span>)),
decode(<span class="string">&quot;AAAA/x==&quot;</span>)
);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>detect_invalid_last_symbol_every_possible_three_symbols() {
<span class="kw">let </span><span class="kw-2">mut </span>base64_to_bytes = ::std::collections::HashMap::new();
<span class="kw">let </span><span class="kw-2">mut </span>bytes = [<span class="number">0_u8</span>; <span class="number">2</span>];
<span class="kw">for </span>b1 <span class="kw">in </span><span class="number">0_u16</span>..<span class="number">256 </span>{
bytes[<span class="number">0</span>] = b1 <span class="kw">as </span>u8;
<span class="kw">for </span>b2 <span class="kw">in </span><span class="number">0_u16</span>..<span class="number">256 </span>{
bytes[<span class="number">1</span>] = b2 <span class="kw">as </span>u8;
<span class="kw">let </span><span class="kw-2">mut </span>b64 = <span class="macro">vec!</span>[<span class="number">0_u8</span>; <span class="number">4</span>];
<span class="macro">assert_eq!</span>(<span class="number">4</span>, encode_config_slice(<span class="kw-2">&amp;</span>bytes, STANDARD, <span class="kw-2">&amp;mut </span>b64[..]));
<span class="kw">let </span><span class="kw-2">mut </span>v = ::std::vec::Vec::with_capacity(<span class="number">2</span>);
v.extend_from_slice(<span class="kw-2">&amp;</span>bytes[..]);
<span class="macro">assert!</span>(base64_to_bytes.insert(b64, v).is_none());
}
}
<span class="comment">// every possible combination of symbols must either decode to 2 bytes or get InvalidLastSymbol
</span><span class="kw">let </span><span class="kw-2">mut </span>symbols = [<span class="number">0_u8</span>; <span class="number">4</span>];
<span class="kw">for </span><span class="kw-2">&amp;</span>s1 <span class="kw">in </span>STANDARD.char_set.encode_table().iter() {
symbols[<span class="number">0</span>] = s1;
<span class="kw">for </span><span class="kw-2">&amp;</span>s2 <span class="kw">in </span>STANDARD.char_set.encode_table().iter() {
symbols[<span class="number">1</span>] = s2;
<span class="kw">for </span><span class="kw-2">&amp;</span>s3 <span class="kw">in </span>STANDARD.char_set.encode_table().iter() {
symbols[<span class="number">2</span>] = s3;
symbols[<span class="number">3</span>] = PAD_BYTE;
<span class="kw">match </span>base64_to_bytes.get(<span class="kw-2">&amp;</span>symbols[..]) {
<span class="prelude-val">Some</span>(bytes) =&gt; {
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(bytes.to_vec()), decode_config(<span class="kw-2">&amp;</span>symbols, STANDARD))
}
<span class="prelude-val">None </span>=&gt; <span class="macro">assert_eq!</span>(
<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">2</span>, s3)),
decode_config(<span class="kw-2">&amp;</span>symbols[..], STANDARD)
),
}
}
}
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>detect_invalid_last_symbol_every_possible_two_symbols() {
<span class="kw">let </span><span class="kw-2">mut </span>base64_to_bytes = ::std::collections::HashMap::new();
<span class="kw">for </span>b <span class="kw">in </span><span class="number">0_u16</span>..<span class="number">256 </span>{
<span class="kw">let </span><span class="kw-2">mut </span>b64 = <span class="macro">vec!</span>[<span class="number">0_u8</span>; <span class="number">4</span>];
<span class="macro">assert_eq!</span>(<span class="number">4</span>, encode_config_slice(<span class="kw-2">&amp;</span>[b <span class="kw">as </span>u8], STANDARD, <span class="kw-2">&amp;mut </span>b64[..]));
<span class="kw">let </span><span class="kw-2">mut </span>v = ::std::vec::Vec::with_capacity(<span class="number">1</span>);
v.push(b <span class="kw">as </span>u8);
<span class="macro">assert!</span>(base64_to_bytes.insert(b64, v).is_none());
}
<span class="comment">// every possible combination of symbols must either decode to 1 byte or get InvalidLastSymbol
</span><span class="kw">let </span><span class="kw-2">mut </span>symbols = [<span class="number">0_u8</span>; <span class="number">4</span>];
<span class="kw">for </span><span class="kw-2">&amp;</span>s1 <span class="kw">in </span>STANDARD.char_set.encode_table().iter() {
symbols[<span class="number">0</span>] = s1;
<span class="kw">for </span><span class="kw-2">&amp;</span>s2 <span class="kw">in </span>STANDARD.char_set.encode_table().iter() {
symbols[<span class="number">1</span>] = s2;
symbols[<span class="number">2</span>] = PAD_BYTE;
symbols[<span class="number">3</span>] = PAD_BYTE;
<span class="kw">match </span>base64_to_bytes.get(<span class="kw-2">&amp;</span>symbols[..]) {
<span class="prelude-val">Some</span>(bytes) =&gt; {
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(bytes.to_vec()), decode_config(<span class="kw-2">&amp;</span>symbols, STANDARD))
}
<span class="prelude-val">None </span>=&gt; <span class="macro">assert_eq!</span>(
<span class="prelude-val">Err</span>(DecodeError::InvalidLastSymbol(<span class="number">1</span>, s2)),
decode_config(<span class="kw-2">&amp;</span>symbols[..], STANDARD)
),
}
}
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>decode_config_estimation_works_for_various_lengths() {
<span class="kw">for </span>num_prefix_quads <span class="kw">in </span><span class="number">0</span>..<span class="number">100 </span>{
<span class="kw">for </span>suffix <span class="kw">in </span><span class="kw-2">&amp;</span>[<span class="string">&quot;AA&quot;</span>, <span class="string">&quot;AAA&quot;</span>, <span class="string">&quot;AAAA&quot;</span>] {
<span class="kw">let </span><span class="kw-2">mut </span>prefix = <span class="string">&quot;AAAA&quot;</span>.repeat(num_prefix_quads);
prefix.push_str(suffix);
<span class="comment">// make sure no overflow (and thus a panic) occurs
</span><span class="kw">let </span>res = decode_config(prefix, STANDARD);
<span class="macro">assert!</span>(res.is_ok());
}
}
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="base64" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>