| <!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/miniz_oxide-0.7.1/src/inflate/core.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>core.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="../../../miniz_oxide/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="../../../miniz_oxide/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> |
| <span id="894">894</span> |
| <span id="895">895</span> |
| <span id="896">896</span> |
| <span id="897">897</span> |
| <span id="898">898</span> |
| <span id="899">899</span> |
| <span id="900">900</span> |
| <span id="901">901</span> |
| <span id="902">902</span> |
| <span id="903">903</span> |
| <span id="904">904</span> |
| <span id="905">905</span> |
| <span id="906">906</span> |
| <span id="907">907</span> |
| <span id="908">908</span> |
| <span id="909">909</span> |
| <span id="910">910</span> |
| <span id="911">911</span> |
| <span id="912">912</span> |
| <span id="913">913</span> |
| <span id="914">914</span> |
| <span id="915">915</span> |
| <span id="916">916</span> |
| <span id="917">917</span> |
| <span id="918">918</span> |
| <span id="919">919</span> |
| <span id="920">920</span> |
| <span id="921">921</span> |
| <span id="922">922</span> |
| <span id="923">923</span> |
| <span id="924">924</span> |
| <span id="925">925</span> |
| <span id="926">926</span> |
| <span id="927">927</span> |
| <span id="928">928</span> |
| <span id="929">929</span> |
| <span id="930">930</span> |
| <span id="931">931</span> |
| <span id="932">932</span> |
| <span id="933">933</span> |
| <span id="934">934</span> |
| <span id="935">935</span> |
| <span id="936">936</span> |
| <span id="937">937</span> |
| <span id="938">938</span> |
| <span id="939">939</span> |
| <span id="940">940</span> |
| <span id="941">941</span> |
| <span id="942">942</span> |
| <span id="943">943</span> |
| <span id="944">944</span> |
| <span id="945">945</span> |
| <span id="946">946</span> |
| <span id="947">947</span> |
| <span id="948">948</span> |
| <span id="949">949</span> |
| <span id="950">950</span> |
| <span id="951">951</span> |
| <span id="952">952</span> |
| <span id="953">953</span> |
| <span id="954">954</span> |
| <span id="955">955</span> |
| <span id="956">956</span> |
| <span id="957">957</span> |
| <span id="958">958</span> |
| <span id="959">959</span> |
| <span id="960">960</span> |
| <span id="961">961</span> |
| <span id="962">962</span> |
| <span id="963">963</span> |
| <span id="964">964</span> |
| <span id="965">965</span> |
| <span id="966">966</span> |
| <span id="967">967</span> |
| <span id="968">968</span> |
| <span id="969">969</span> |
| <span id="970">970</span> |
| <span id="971">971</span> |
| <span id="972">972</span> |
| <span id="973">973</span> |
| <span id="974">974</span> |
| <span id="975">975</span> |
| <span id="976">976</span> |
| <span id="977">977</span> |
| <span id="978">978</span> |
| <span id="979">979</span> |
| <span id="980">980</span> |
| <span id="981">981</span> |
| <span id="982">982</span> |
| <span id="983">983</span> |
| <span id="984">984</span> |
| <span id="985">985</span> |
| <span id="986">986</span> |
| <span id="987">987</span> |
| <span id="988">988</span> |
| <span id="989">989</span> |
| <span id="990">990</span> |
| <span id="991">991</span> |
| <span id="992">992</span> |
| <span id="993">993</span> |
| <span id="994">994</span> |
| <span id="995">995</span> |
| <span id="996">996</span> |
| <span id="997">997</span> |
| <span id="998">998</span> |
| <span id="999">999</span> |
| <span id="1000">1000</span> |
| <span id="1001">1001</span> |
| <span id="1002">1002</span> |
| <span id="1003">1003</span> |
| <span id="1004">1004</span> |
| <span id="1005">1005</span> |
| <span id="1006">1006</span> |
| <span id="1007">1007</span> |
| <span id="1008">1008</span> |
| <span id="1009">1009</span> |
| <span id="1010">1010</span> |
| <span id="1011">1011</span> |
| <span id="1012">1012</span> |
| <span id="1013">1013</span> |
| <span id="1014">1014</span> |
| <span id="1015">1015</span> |
| <span id="1016">1016</span> |
| <span id="1017">1017</span> |
| <span id="1018">1018</span> |
| <span id="1019">1019</span> |
| <span id="1020">1020</span> |
| <span id="1021">1021</span> |
| <span id="1022">1022</span> |
| <span id="1023">1023</span> |
| <span id="1024">1024</span> |
| <span id="1025">1025</span> |
| <span id="1026">1026</span> |
| <span id="1027">1027</span> |
| <span id="1028">1028</span> |
| <span id="1029">1029</span> |
| <span id="1030">1030</span> |
| <span id="1031">1031</span> |
| <span id="1032">1032</span> |
| <span id="1033">1033</span> |
| <span id="1034">1034</span> |
| <span id="1035">1035</span> |
| <span id="1036">1036</span> |
| <span id="1037">1037</span> |
| <span id="1038">1038</span> |
| <span id="1039">1039</span> |
| <span id="1040">1040</span> |
| <span id="1041">1041</span> |
| <span id="1042">1042</span> |
| <span id="1043">1043</span> |
| <span id="1044">1044</span> |
| <span id="1045">1045</span> |
| <span id="1046">1046</span> |
| <span id="1047">1047</span> |
| <span id="1048">1048</span> |
| <span id="1049">1049</span> |
| <span id="1050">1050</span> |
| <span id="1051">1051</span> |
| <span id="1052">1052</span> |
| <span id="1053">1053</span> |
| <span id="1054">1054</span> |
| <span id="1055">1055</span> |
| <span id="1056">1056</span> |
| <span id="1057">1057</span> |
| <span id="1058">1058</span> |
| <span id="1059">1059</span> |
| <span id="1060">1060</span> |
| <span id="1061">1061</span> |
| <span id="1062">1062</span> |
| <span id="1063">1063</span> |
| <span id="1064">1064</span> |
| <span id="1065">1065</span> |
| <span id="1066">1066</span> |
| <span id="1067">1067</span> |
| <span id="1068">1068</span> |
| <span id="1069">1069</span> |
| <span id="1070">1070</span> |
| <span id="1071">1071</span> |
| <span id="1072">1072</span> |
| <span id="1073">1073</span> |
| <span id="1074">1074</span> |
| <span id="1075">1075</span> |
| <span id="1076">1076</span> |
| <span id="1077">1077</span> |
| <span id="1078">1078</span> |
| <span id="1079">1079</span> |
| <span id="1080">1080</span> |
| <span id="1081">1081</span> |
| <span id="1082">1082</span> |
| <span id="1083">1083</span> |
| <span id="1084">1084</span> |
| <span id="1085">1085</span> |
| <span id="1086">1086</span> |
| <span id="1087">1087</span> |
| <span id="1088">1088</span> |
| <span id="1089">1089</span> |
| <span id="1090">1090</span> |
| <span id="1091">1091</span> |
| <span id="1092">1092</span> |
| <span id="1093">1093</span> |
| <span id="1094">1094</span> |
| <span id="1095">1095</span> |
| <span id="1096">1096</span> |
| <span id="1097">1097</span> |
| <span id="1098">1098</span> |
| <span id="1099">1099</span> |
| <span id="1100">1100</span> |
| <span id="1101">1101</span> |
| <span id="1102">1102</span> |
| <span id="1103">1103</span> |
| <span id="1104">1104</span> |
| <span id="1105">1105</span> |
| <span id="1106">1106</span> |
| <span id="1107">1107</span> |
| <span id="1108">1108</span> |
| <span id="1109">1109</span> |
| <span id="1110">1110</span> |
| <span id="1111">1111</span> |
| <span id="1112">1112</span> |
| <span id="1113">1113</span> |
| <span id="1114">1114</span> |
| <span id="1115">1115</span> |
| <span id="1116">1116</span> |
| <span id="1117">1117</span> |
| <span id="1118">1118</span> |
| <span id="1119">1119</span> |
| <span id="1120">1120</span> |
| <span id="1121">1121</span> |
| <span id="1122">1122</span> |
| <span id="1123">1123</span> |
| <span id="1124">1124</span> |
| <span id="1125">1125</span> |
| <span id="1126">1126</span> |
| <span id="1127">1127</span> |
| <span id="1128">1128</span> |
| <span id="1129">1129</span> |
| <span id="1130">1130</span> |
| <span id="1131">1131</span> |
| <span id="1132">1132</span> |
| <span id="1133">1133</span> |
| <span id="1134">1134</span> |
| <span id="1135">1135</span> |
| <span id="1136">1136</span> |
| <span id="1137">1137</span> |
| <span id="1138">1138</span> |
| <span id="1139">1139</span> |
| <span id="1140">1140</span> |
| <span id="1141">1141</span> |
| <span id="1142">1142</span> |
| <span id="1143">1143</span> |
| <span id="1144">1144</span> |
| <span id="1145">1145</span> |
| <span id="1146">1146</span> |
| <span id="1147">1147</span> |
| <span id="1148">1148</span> |
| <span id="1149">1149</span> |
| <span id="1150">1150</span> |
| <span id="1151">1151</span> |
| <span id="1152">1152</span> |
| <span id="1153">1153</span> |
| <span id="1154">1154</span> |
| <span id="1155">1155</span> |
| <span id="1156">1156</span> |
| <span id="1157">1157</span> |
| <span id="1158">1158</span> |
| <span id="1159">1159</span> |
| <span id="1160">1160</span> |
| <span id="1161">1161</span> |
| <span id="1162">1162</span> |
| <span id="1163">1163</span> |
| <span id="1164">1164</span> |
| <span id="1165">1165</span> |
| <span id="1166">1166</span> |
| <span id="1167">1167</span> |
| <span id="1168">1168</span> |
| <span id="1169">1169</span> |
| <span id="1170">1170</span> |
| <span id="1171">1171</span> |
| <span id="1172">1172</span> |
| <span id="1173">1173</span> |
| <span id="1174">1174</span> |
| <span id="1175">1175</span> |
| <span id="1176">1176</span> |
| <span id="1177">1177</span> |
| <span id="1178">1178</span> |
| <span id="1179">1179</span> |
| <span id="1180">1180</span> |
| <span id="1181">1181</span> |
| <span id="1182">1182</span> |
| <span id="1183">1183</span> |
| <span id="1184">1184</span> |
| <span id="1185">1185</span> |
| <span id="1186">1186</span> |
| <span id="1187">1187</span> |
| <span id="1188">1188</span> |
| <span id="1189">1189</span> |
| <span id="1190">1190</span> |
| <span id="1191">1191</span> |
| <span id="1192">1192</span> |
| <span id="1193">1193</span> |
| <span id="1194">1194</span> |
| <span id="1195">1195</span> |
| <span id="1196">1196</span> |
| <span id="1197">1197</span> |
| <span id="1198">1198</span> |
| <span id="1199">1199</span> |
| <span id="1200">1200</span> |
| <span id="1201">1201</span> |
| <span id="1202">1202</span> |
| <span id="1203">1203</span> |
| <span id="1204">1204</span> |
| <span id="1205">1205</span> |
| <span id="1206">1206</span> |
| <span id="1207">1207</span> |
| <span id="1208">1208</span> |
| <span id="1209">1209</span> |
| <span id="1210">1210</span> |
| <span id="1211">1211</span> |
| <span id="1212">1212</span> |
| <span id="1213">1213</span> |
| <span id="1214">1214</span> |
| <span id="1215">1215</span> |
| <span id="1216">1216</span> |
| <span id="1217">1217</span> |
| <span id="1218">1218</span> |
| <span id="1219">1219</span> |
| <span id="1220">1220</span> |
| <span id="1221">1221</span> |
| <span id="1222">1222</span> |
| <span id="1223">1223</span> |
| <span id="1224">1224</span> |
| <span id="1225">1225</span> |
| <span id="1226">1226</span> |
| <span id="1227">1227</span> |
| <span id="1228">1228</span> |
| <span id="1229">1229</span> |
| <span id="1230">1230</span> |
| <span id="1231">1231</span> |
| <span id="1232">1232</span> |
| <span id="1233">1233</span> |
| <span id="1234">1234</span> |
| <span id="1235">1235</span> |
| <span id="1236">1236</span> |
| <span id="1237">1237</span> |
| <span id="1238">1238</span> |
| <span id="1239">1239</span> |
| <span id="1240">1240</span> |
| <span id="1241">1241</span> |
| <span id="1242">1242</span> |
| <span id="1243">1243</span> |
| <span id="1244">1244</span> |
| <span id="1245">1245</span> |
| <span id="1246">1246</span> |
| <span id="1247">1247</span> |
| <span id="1248">1248</span> |
| <span id="1249">1249</span> |
| <span id="1250">1250</span> |
| <span id="1251">1251</span> |
| <span id="1252">1252</span> |
| <span id="1253">1253</span> |
| <span id="1254">1254</span> |
| <span id="1255">1255</span> |
| <span id="1256">1256</span> |
| <span id="1257">1257</span> |
| <span id="1258">1258</span> |
| <span id="1259">1259</span> |
| <span id="1260">1260</span> |
| <span id="1261">1261</span> |
| <span id="1262">1262</span> |
| <span id="1263">1263</span> |
| <span id="1264">1264</span> |
| <span id="1265">1265</span> |
| <span id="1266">1266</span> |
| <span id="1267">1267</span> |
| <span id="1268">1268</span> |
| <span id="1269">1269</span> |
| <span id="1270">1270</span> |
| <span id="1271">1271</span> |
| <span id="1272">1272</span> |
| <span id="1273">1273</span> |
| <span id="1274">1274</span> |
| <span id="1275">1275</span> |
| <span id="1276">1276</span> |
| <span id="1277">1277</span> |
| <span id="1278">1278</span> |
| <span id="1279">1279</span> |
| <span id="1280">1280</span> |
| <span id="1281">1281</span> |
| <span id="1282">1282</span> |
| <span id="1283">1283</span> |
| <span id="1284">1284</span> |
| <span id="1285">1285</span> |
| <span id="1286">1286</span> |
| <span id="1287">1287</span> |
| <span id="1288">1288</span> |
| <span id="1289">1289</span> |
| <span id="1290">1290</span> |
| <span id="1291">1291</span> |
| <span id="1292">1292</span> |
| <span id="1293">1293</span> |
| <span id="1294">1294</span> |
| <span id="1295">1295</span> |
| <span id="1296">1296</span> |
| <span id="1297">1297</span> |
| <span id="1298">1298</span> |
| <span id="1299">1299</span> |
| <span id="1300">1300</span> |
| <span id="1301">1301</span> |
| <span id="1302">1302</span> |
| <span id="1303">1303</span> |
| <span id="1304">1304</span> |
| <span id="1305">1305</span> |
| <span id="1306">1306</span> |
| <span id="1307">1307</span> |
| <span id="1308">1308</span> |
| <span id="1309">1309</span> |
| <span id="1310">1310</span> |
| <span id="1311">1311</span> |
| <span id="1312">1312</span> |
| <span id="1313">1313</span> |
| <span id="1314">1314</span> |
| <span id="1315">1315</span> |
| <span id="1316">1316</span> |
| <span id="1317">1317</span> |
| <span id="1318">1318</span> |
| <span id="1319">1319</span> |
| <span id="1320">1320</span> |
| <span id="1321">1321</span> |
| <span id="1322">1322</span> |
| <span id="1323">1323</span> |
| <span id="1324">1324</span> |
| <span id="1325">1325</span> |
| <span id="1326">1326</span> |
| <span id="1327">1327</span> |
| <span id="1328">1328</span> |
| <span id="1329">1329</span> |
| <span id="1330">1330</span> |
| <span id="1331">1331</span> |
| <span id="1332">1332</span> |
| <span id="1333">1333</span> |
| <span id="1334">1334</span> |
| <span id="1335">1335</span> |
| <span id="1336">1336</span> |
| <span id="1337">1337</span> |
| <span id="1338">1338</span> |
| <span id="1339">1339</span> |
| <span id="1340">1340</span> |
| <span id="1341">1341</span> |
| <span id="1342">1342</span> |
| <span id="1343">1343</span> |
| <span id="1344">1344</span> |
| <span id="1345">1345</span> |
| <span id="1346">1346</span> |
| <span id="1347">1347</span> |
| <span id="1348">1348</span> |
| <span id="1349">1349</span> |
| <span id="1350">1350</span> |
| <span id="1351">1351</span> |
| <span id="1352">1352</span> |
| <span id="1353">1353</span> |
| <span id="1354">1354</span> |
| <span id="1355">1355</span> |
| <span id="1356">1356</span> |
| <span id="1357">1357</span> |
| <span id="1358">1358</span> |
| <span id="1359">1359</span> |
| <span id="1360">1360</span> |
| <span id="1361">1361</span> |
| <span id="1362">1362</span> |
| <span id="1363">1363</span> |
| <span id="1364">1364</span> |
| <span id="1365">1365</span> |
| <span id="1366">1366</span> |
| <span id="1367">1367</span> |
| <span id="1368">1368</span> |
| <span id="1369">1369</span> |
| <span id="1370">1370</span> |
| <span id="1371">1371</span> |
| <span id="1372">1372</span> |
| <span id="1373">1373</span> |
| <span id="1374">1374</span> |
| <span id="1375">1375</span> |
| <span id="1376">1376</span> |
| <span id="1377">1377</span> |
| <span id="1378">1378</span> |
| <span id="1379">1379</span> |
| <span id="1380">1380</span> |
| <span id="1381">1381</span> |
| <span id="1382">1382</span> |
| <span id="1383">1383</span> |
| <span id="1384">1384</span> |
| <span id="1385">1385</span> |
| <span id="1386">1386</span> |
| <span id="1387">1387</span> |
| <span id="1388">1388</span> |
| <span id="1389">1389</span> |
| <span id="1390">1390</span> |
| <span id="1391">1391</span> |
| <span id="1392">1392</span> |
| <span id="1393">1393</span> |
| <span id="1394">1394</span> |
| <span id="1395">1395</span> |
| <span id="1396">1396</span> |
| <span id="1397">1397</span> |
| <span id="1398">1398</span> |
| <span id="1399">1399</span> |
| <span id="1400">1400</span> |
| <span id="1401">1401</span> |
| <span id="1402">1402</span> |
| <span id="1403">1403</span> |
| <span id="1404">1404</span> |
| <span id="1405">1405</span> |
| <span id="1406">1406</span> |
| <span id="1407">1407</span> |
| <span id="1408">1408</span> |
| <span id="1409">1409</span> |
| <span id="1410">1410</span> |
| <span id="1411">1411</span> |
| <span id="1412">1412</span> |
| <span id="1413">1413</span> |
| <span id="1414">1414</span> |
| <span id="1415">1415</span> |
| <span id="1416">1416</span> |
| <span id="1417">1417</span> |
| <span id="1418">1418</span> |
| <span id="1419">1419</span> |
| <span id="1420">1420</span> |
| <span id="1421">1421</span> |
| <span id="1422">1422</span> |
| <span id="1423">1423</span> |
| <span id="1424">1424</span> |
| <span id="1425">1425</span> |
| <span id="1426">1426</span> |
| <span id="1427">1427</span> |
| <span id="1428">1428</span> |
| <span id="1429">1429</span> |
| <span id="1430">1430</span> |
| <span id="1431">1431</span> |
| <span id="1432">1432</span> |
| <span id="1433">1433</span> |
| <span id="1434">1434</span> |
| <span id="1435">1435</span> |
| <span id="1436">1436</span> |
| <span id="1437">1437</span> |
| <span id="1438">1438</span> |
| <span id="1439">1439</span> |
| <span id="1440">1440</span> |
| <span id="1441">1441</span> |
| <span id="1442">1442</span> |
| <span id="1443">1443</span> |
| <span id="1444">1444</span> |
| <span id="1445">1445</span> |
| <span id="1446">1446</span> |
| <span id="1447">1447</span> |
| <span id="1448">1448</span> |
| <span id="1449">1449</span> |
| <span id="1450">1450</span> |
| <span id="1451">1451</span> |
| <span id="1452">1452</span> |
| <span id="1453">1453</span> |
| <span id="1454">1454</span> |
| <span id="1455">1455</span> |
| <span id="1456">1456</span> |
| <span id="1457">1457</span> |
| <span id="1458">1458</span> |
| <span id="1459">1459</span> |
| <span id="1460">1460</span> |
| <span id="1461">1461</span> |
| <span id="1462">1462</span> |
| <span id="1463">1463</span> |
| <span id="1464">1464</span> |
| <span id="1465">1465</span> |
| <span id="1466">1466</span> |
| <span id="1467">1467</span> |
| <span id="1468">1468</span> |
| <span id="1469">1469</span> |
| <span id="1470">1470</span> |
| <span id="1471">1471</span> |
| <span id="1472">1472</span> |
| <span id="1473">1473</span> |
| <span id="1474">1474</span> |
| <span id="1475">1475</span> |
| <span id="1476">1476</span> |
| <span id="1477">1477</span> |
| <span id="1478">1478</span> |
| <span id="1479">1479</span> |
| <span id="1480">1480</span> |
| <span id="1481">1481</span> |
| <span id="1482">1482</span> |
| <span id="1483">1483</span> |
| <span id="1484">1484</span> |
| <span id="1485">1485</span> |
| <span id="1486">1486</span> |
| <span id="1487">1487</span> |
| <span id="1488">1488</span> |
| <span id="1489">1489</span> |
| <span id="1490">1490</span> |
| <span id="1491">1491</span> |
| <span id="1492">1492</span> |
| <span id="1493">1493</span> |
| <span id="1494">1494</span> |
| <span id="1495">1495</span> |
| <span id="1496">1496</span> |
| <span id="1497">1497</span> |
| <span id="1498">1498</span> |
| <span id="1499">1499</span> |
| <span id="1500">1500</span> |
| <span id="1501">1501</span> |
| <span id="1502">1502</span> |
| <span id="1503">1503</span> |
| <span id="1504">1504</span> |
| <span id="1505">1505</span> |
| <span id="1506">1506</span> |
| <span id="1507">1507</span> |
| <span id="1508">1508</span> |
| <span id="1509">1509</span> |
| <span id="1510">1510</span> |
| <span id="1511">1511</span> |
| <span id="1512">1512</span> |
| <span id="1513">1513</span> |
| <span id="1514">1514</span> |
| <span id="1515">1515</span> |
| <span id="1516">1516</span> |
| <span id="1517">1517</span> |
| <span id="1518">1518</span> |
| <span id="1519">1519</span> |
| <span id="1520">1520</span> |
| <span id="1521">1521</span> |
| <span id="1522">1522</span> |
| <span id="1523">1523</span> |
| <span id="1524">1524</span> |
| <span id="1525">1525</span> |
| <span id="1526">1526</span> |
| <span id="1527">1527</span> |
| <span id="1528">1528</span> |
| <span id="1529">1529</span> |
| <span id="1530">1530</span> |
| <span id="1531">1531</span> |
| <span id="1532">1532</span> |
| <span id="1533">1533</span> |
| <span id="1534">1534</span> |
| <span id="1535">1535</span> |
| <span id="1536">1536</span> |
| <span id="1537">1537</span> |
| <span id="1538">1538</span> |
| <span id="1539">1539</span> |
| <span id="1540">1540</span> |
| <span id="1541">1541</span> |
| <span id="1542">1542</span> |
| <span id="1543">1543</span> |
| <span id="1544">1544</span> |
| <span id="1545">1545</span> |
| <span id="1546">1546</span> |
| <span id="1547">1547</span> |
| <span id="1548">1548</span> |
| <span id="1549">1549</span> |
| <span id="1550">1550</span> |
| <span id="1551">1551</span> |
| <span id="1552">1552</span> |
| <span id="1553">1553</span> |
| <span id="1554">1554</span> |
| <span id="1555">1555</span> |
| <span id="1556">1556</span> |
| <span id="1557">1557</span> |
| <span id="1558">1558</span> |
| <span id="1559">1559</span> |
| <span id="1560">1560</span> |
| <span id="1561">1561</span> |
| <span id="1562">1562</span> |
| <span id="1563">1563</span> |
| <span id="1564">1564</span> |
| <span id="1565">1565</span> |
| <span id="1566">1566</span> |
| <span id="1567">1567</span> |
| <span id="1568">1568</span> |
| <span id="1569">1569</span> |
| <span id="1570">1570</span> |
| <span id="1571">1571</span> |
| <span id="1572">1572</span> |
| <span id="1573">1573</span> |
| <span id="1574">1574</span> |
| <span id="1575">1575</span> |
| <span id="1576">1576</span> |
| <span id="1577">1577</span> |
| <span id="1578">1578</span> |
| <span id="1579">1579</span> |
| <span id="1580">1580</span> |
| <span id="1581">1581</span> |
| <span id="1582">1582</span> |
| <span id="1583">1583</span> |
| <span id="1584">1584</span> |
| <span id="1585">1585</span> |
| <span id="1586">1586</span> |
| <span id="1587">1587</span> |
| <span id="1588">1588</span> |
| <span id="1589">1589</span> |
| <span id="1590">1590</span> |
| <span id="1591">1591</span> |
| <span id="1592">1592</span> |
| <span id="1593">1593</span> |
| <span id="1594">1594</span> |
| <span id="1595">1595</span> |
| <span id="1596">1596</span> |
| <span id="1597">1597</span> |
| <span id="1598">1598</span> |
| <span id="1599">1599</span> |
| <span id="1600">1600</span> |
| <span id="1601">1601</span> |
| <span id="1602">1602</span> |
| <span id="1603">1603</span> |
| <span id="1604">1604</span> |
| <span id="1605">1605</span> |
| <span id="1606">1606</span> |
| <span id="1607">1607</span> |
| <span id="1608">1608</span> |
| <span id="1609">1609</span> |
| <span id="1610">1610</span> |
| <span id="1611">1611</span> |
| <span id="1612">1612</span> |
| <span id="1613">1613</span> |
| <span id="1614">1614</span> |
| <span id="1615">1615</span> |
| <span id="1616">1616</span> |
| <span id="1617">1617</span> |
| <span id="1618">1618</span> |
| <span id="1619">1619</span> |
| <span id="1620">1620</span> |
| <span id="1621">1621</span> |
| <span id="1622">1622</span> |
| <span id="1623">1623</span> |
| <span id="1624">1624</span> |
| <span id="1625">1625</span> |
| <span id="1626">1626</span> |
| <span id="1627">1627</span> |
| <span id="1628">1628</span> |
| <span id="1629">1629</span> |
| <span id="1630">1630</span> |
| <span id="1631">1631</span> |
| <span id="1632">1632</span> |
| <span id="1633">1633</span> |
| <span id="1634">1634</span> |
| <span id="1635">1635</span> |
| <span id="1636">1636</span> |
| <span id="1637">1637</span> |
| <span id="1638">1638</span> |
| <span id="1639">1639</span> |
| <span id="1640">1640</span> |
| <span id="1641">1641</span> |
| <span id="1642">1642</span> |
| <span id="1643">1643</span> |
| <span id="1644">1644</span> |
| <span id="1645">1645</span> |
| <span id="1646">1646</span> |
| <span id="1647">1647</span> |
| <span id="1648">1648</span> |
| <span id="1649">1649</span> |
| <span id="1650">1650</span> |
| <span id="1651">1651</span> |
| <span id="1652">1652</span> |
| <span id="1653">1653</span> |
| <span id="1654">1654</span> |
| <span id="1655">1655</span> |
| <span id="1656">1656</span> |
| <span id="1657">1657</span> |
| <span id="1658">1658</span> |
| <span id="1659">1659</span> |
| <span id="1660">1660</span> |
| <span id="1661">1661</span> |
| <span id="1662">1662</span> |
| <span id="1663">1663</span> |
| <span id="1664">1664</span> |
| <span id="1665">1665</span> |
| <span id="1666">1666</span> |
| <span id="1667">1667</span> |
| <span id="1668">1668</span> |
| <span id="1669">1669</span> |
| <span id="1670">1670</span> |
| <span id="1671">1671</span> |
| <span id="1672">1672</span> |
| <span id="1673">1673</span> |
| <span id="1674">1674</span> |
| <span id="1675">1675</span> |
| <span id="1676">1676</span> |
| <span id="1677">1677</span> |
| <span id="1678">1678</span> |
| <span id="1679">1679</span> |
| <span id="1680">1680</span> |
| <span id="1681">1681</span> |
| <span id="1682">1682</span> |
| <span id="1683">1683</span> |
| <span id="1684">1684</span> |
| <span id="1685">1685</span> |
| <span id="1686">1686</span> |
| <span id="1687">1687</span> |
| <span id="1688">1688</span> |
| <span id="1689">1689</span> |
| <span id="1690">1690</span> |
| <span id="1691">1691</span> |
| <span id="1692">1692</span> |
| <span id="1693">1693</span> |
| <span id="1694">1694</span> |
| <span id="1695">1695</span> |
| <span id="1696">1696</span> |
| <span id="1697">1697</span> |
| <span id="1698">1698</span> |
| <span id="1699">1699</span> |
| <span id="1700">1700</span> |
| <span id="1701">1701</span> |
| <span id="1702">1702</span> |
| <span id="1703">1703</span> |
| <span id="1704">1704</span> |
| <span id="1705">1705</span> |
| <span id="1706">1706</span> |
| <span id="1707">1707</span> |
| <span id="1708">1708</span> |
| <span id="1709">1709</span> |
| <span id="1710">1710</span> |
| <span id="1711">1711</span> |
| <span id="1712">1712</span> |
| <span id="1713">1713</span> |
| <span id="1714">1714</span> |
| <span id="1715">1715</span> |
| <span id="1716">1716</span> |
| <span id="1717">1717</span> |
| <span id="1718">1718</span> |
| <span id="1719">1719</span> |
| <span id="1720">1720</span> |
| <span id="1721">1721</span> |
| <span id="1722">1722</span> |
| <span id="1723">1723</span> |
| <span id="1724">1724</span> |
| <span id="1725">1725</span> |
| <span id="1726">1726</span> |
| <span id="1727">1727</span> |
| <span id="1728">1728</span> |
| <span id="1729">1729</span> |
| <span id="1730">1730</span> |
| <span id="1731">1731</span> |
| <span id="1732">1732</span> |
| <span id="1733">1733</span> |
| <span id="1734">1734</span> |
| <span id="1735">1735</span> |
| <span id="1736">1736</span> |
| <span id="1737">1737</span> |
| <span id="1738">1738</span> |
| <span id="1739">1739</span> |
| <span id="1740">1740</span> |
| <span id="1741">1741</span> |
| <span id="1742">1742</span> |
| <span id="1743">1743</span> |
| <span id="1744">1744</span> |
| <span id="1745">1745</span> |
| <span id="1746">1746</span> |
| <span id="1747">1747</span> |
| <span id="1748">1748</span> |
| <span id="1749">1749</span> |
| <span id="1750">1750</span> |
| <span id="1751">1751</span> |
| <span id="1752">1752</span> |
| <span id="1753">1753</span> |
| <span id="1754">1754</span> |
| <span id="1755">1755</span> |
| <span id="1756">1756</span> |
| <span id="1757">1757</span> |
| <span id="1758">1758</span> |
| <span id="1759">1759</span> |
| <span id="1760">1760</span> |
| <span id="1761">1761</span> |
| <span id="1762">1762</span> |
| <span id="1763">1763</span> |
| <span id="1764">1764</span> |
| <span id="1765">1765</span> |
| <span id="1766">1766</span> |
| <span id="1767">1767</span> |
| <span id="1768">1768</span> |
| <span id="1769">1769</span> |
| <span id="1770">1770</span> |
| <span id="1771">1771</span> |
| <span id="1772">1772</span> |
| <span id="1773">1773</span> |
| <span id="1774">1774</span> |
| <span id="1775">1775</span> |
| <span id="1776">1776</span> |
| <span id="1777">1777</span> |
| <span id="1778">1778</span> |
| <span id="1779">1779</span> |
| <span id="1780">1780</span> |
| <span id="1781">1781</span> |
| <span id="1782">1782</span> |
| <span id="1783">1783</span> |
| <span id="1784">1784</span> |
| <span id="1785">1785</span> |
| <span id="1786">1786</span> |
| <span id="1787">1787</span> |
| <span id="1788">1788</span> |
| <span id="1789">1789</span> |
| <span id="1790">1790</span> |
| <span id="1791">1791</span> |
| <span id="1792">1792</span> |
| <span id="1793">1793</span> |
| <span id="1794">1794</span> |
| <span id="1795">1795</span> |
| <span id="1796">1796</span> |
| <span id="1797">1797</span> |
| <span id="1798">1798</span> |
| <span id="1799">1799</span> |
| <span id="1800">1800</span> |
| <span id="1801">1801</span> |
| <span id="1802">1802</span> |
| <span id="1803">1803</span> |
| <span id="1804">1804</span> |
| <span id="1805">1805</span> |
| <span id="1806">1806</span> |
| <span id="1807">1807</span> |
| <span id="1808">1808</span> |
| <span id="1809">1809</span> |
| <span id="1810">1810</span> |
| <span id="1811">1811</span> |
| <span id="1812">1812</span> |
| <span id="1813">1813</span> |
| <span id="1814">1814</span> |
| <span id="1815">1815</span> |
| <span id="1816">1816</span> |
| <span id="1817">1817</span> |
| <span id="1818">1818</span> |
| <span id="1819">1819</span> |
| <span id="1820">1820</span> |
| <span id="1821">1821</span> |
| <span id="1822">1822</span> |
| <span id="1823">1823</span> |
| <span id="1824">1824</span> |
| <span id="1825">1825</span> |
| <span id="1826">1826</span> |
| <span id="1827">1827</span> |
| <span id="1828">1828</span> |
| <span id="1829">1829</span> |
| <span id="1830">1830</span> |
| <span id="1831">1831</span> |
| <span id="1832">1832</span> |
| <span id="1833">1833</span> |
| <span id="1834">1834</span> |
| <span id="1835">1835</span> |
| <span id="1836">1836</span> |
| <span id="1837">1837</span> |
| <span id="1838">1838</span> |
| <span id="1839">1839</span> |
| <span id="1840">1840</span> |
| <span id="1841">1841</span> |
| <span id="1842">1842</span> |
| <span id="1843">1843</span> |
| <span id="1844">1844</span> |
| <span id="1845">1845</span> |
| <span id="1846">1846</span> |
| <span id="1847">1847</span> |
| <span id="1848">1848</span> |
| <span id="1849">1849</span> |
| <span id="1850">1850</span> |
| <span id="1851">1851</span> |
| <span id="1852">1852</span> |
| <span id="1853">1853</span> |
| <span id="1854">1854</span> |
| <span id="1855">1855</span> |
| <span id="1856">1856</span> |
| <span id="1857">1857</span> |
| <span id="1858">1858</span> |
| <span id="1859">1859</span> |
| <span id="1860">1860</span> |
| <span id="1861">1861</span> |
| <span id="1862">1862</span> |
| <span id="1863">1863</span> |
| <span id="1864">1864</span> |
| <span id="1865">1865</span> |
| <span id="1866">1866</span> |
| <span id="1867">1867</span> |
| <span id="1868">1868</span> |
| <span id="1869">1869</span> |
| <span id="1870">1870</span> |
| <span id="1871">1871</span> |
| <span id="1872">1872</span> |
| <span id="1873">1873</span> |
| <span id="1874">1874</span> |
| <span id="1875">1875</span> |
| <span id="1876">1876</span> |
| <span id="1877">1877</span> |
| <span id="1878">1878</span> |
| <span id="1879">1879</span> |
| <span id="1880">1880</span> |
| <span id="1881">1881</span> |
| <span id="1882">1882</span> |
| <span id="1883">1883</span> |
| <span id="1884">1884</span> |
| <span id="1885">1885</span> |
| <span id="1886">1886</span> |
| <span id="1887">1887</span> |
| <span id="1888">1888</span> |
| <span id="1889">1889</span> |
| <span id="1890">1890</span> |
| <span id="1891">1891</span> |
| <span id="1892">1892</span> |
| <span id="1893">1893</span> |
| <span id="1894">1894</span> |
| <span id="1895">1895</span> |
| <span id="1896">1896</span> |
| <span id="1897">1897</span> |
| <span id="1898">1898</span> |
| <span id="1899">1899</span> |
| <span id="1900">1900</span> |
| <span id="1901">1901</span> |
| <span id="1902">1902</span> |
| <span id="1903">1903</span> |
| <span id="1904">1904</span> |
| <span id="1905">1905</span> |
| <span id="1906">1906</span> |
| <span id="1907">1907</span> |
| <span id="1908">1908</span> |
| <span id="1909">1909</span> |
| <span id="1910">1910</span> |
| <span id="1911">1911</span> |
| <span id="1912">1912</span> |
| <span id="1913">1913</span> |
| <span id="1914">1914</span> |
| <span id="1915">1915</span> |
| <span id="1916">1916</span> |
| <span id="1917">1917</span> |
| <span id="1918">1918</span> |
| <span id="1919">1919</span> |
| <span id="1920">1920</span> |
| <span id="1921">1921</span> |
| <span id="1922">1922</span> |
| <span id="1923">1923</span> |
| <span id="1924">1924</span> |
| <span id="1925">1925</span> |
| <span id="1926">1926</span> |
| <span id="1927">1927</span> |
| <span id="1928">1928</span> |
| <span id="1929">1929</span> |
| <span id="1930">1930</span> |
| <span id="1931">1931</span> |
| <span id="1932">1932</span> |
| <span id="1933">1933</span> |
| <span id="1934">1934</span> |
| <span id="1935">1935</span> |
| <span id="1936">1936</span> |
| <span id="1937">1937</span> |
| <span id="1938">1938</span> |
| <span id="1939">1939</span> |
| <span id="1940">1940</span> |
| <span id="1941">1941</span> |
| <span id="1942">1942</span> |
| <span id="1943">1943</span> |
| <span id="1944">1944</span> |
| <span id="1945">1945</span> |
| <span id="1946">1946</span> |
| <span id="1947">1947</span> |
| <span id="1948">1948</span> |
| <span id="1949">1949</span> |
| <span id="1950">1950</span> |
| <span id="1951">1951</span> |
| <span id="1952">1952</span> |
| <span id="1953">1953</span> |
| <span id="1954">1954</span> |
| <span id="1955">1955</span> |
| <span id="1956">1956</span> |
| <span id="1957">1957</span> |
| <span id="1958">1958</span> |
| <span id="1959">1959</span> |
| <span id="1960">1960</span> |
| <span id="1961">1961</span> |
| <span id="1962">1962</span> |
| <span id="1963">1963</span> |
| <span id="1964">1964</span> |
| <span id="1965">1965</span> |
| <span id="1966">1966</span> |
| <span id="1967">1967</span> |
| <span id="1968">1968</span> |
| <span id="1969">1969</span> |
| <span id="1970">1970</span> |
| <span id="1971">1971</span> |
| <span id="1972">1972</span> |
| <span id="1973">1973</span> |
| <span id="1974">1974</span> |
| <span id="1975">1975</span> |
| <span id="1976">1976</span> |
| <span id="1977">1977</span> |
| <span id="1978">1978</span> |
| <span id="1979">1979</span> |
| <span id="1980">1980</span> |
| <span id="1981">1981</span> |
| <span id="1982">1982</span> |
| <span id="1983">1983</span> |
| <span id="1984">1984</span> |
| <span id="1985">1985</span> |
| <span id="1986">1986</span> |
| <span id="1987">1987</span> |
| <span id="1988">1988</span> |
| <span id="1989">1989</span> |
| <span id="1990">1990</span> |
| <span id="1991">1991</span> |
| <span id="1992">1992</span> |
| </pre><pre class="rust"><code><span class="doccomment">//! Streaming decompression functionality. |
| |
| </span><span class="kw">use super</span>::<span class="kw-2">*</span>; |
| <span class="kw">use </span><span class="kw">crate</span>::shared::{update_adler32, HUFFMAN_LENGTH_ORDER}; |
| |
| <span class="kw">use </span>::core::convert::TryInto; |
| <span class="kw">use </span>::core::{cmp, slice}; |
| |
| <span class="kw">use </span><span class="self">self</span>::output_buffer::OutputBuffer; |
| |
| <span class="kw">pub const </span>TINFL_LZ_DICT_SIZE: usize = <span class="number">32_768</span>; |
| |
| <span class="doccomment">/// A struct containing huffman code lengths and the huffman code tree used by the decompressor. |
| </span><span class="kw">struct </span>HuffmanTable { |
| <span class="doccomment">/// Length of the code at each index. |
| </span><span class="kw">pub </span>code_size: [u8; MAX_HUFF_SYMBOLS_0], |
| <span class="doccomment">/// Fast lookup table for shorter huffman codes. |
| /// |
| /// See `HuffmanTable::fast_lookup`. |
| </span><span class="kw">pub </span>look_up: [i16; FAST_LOOKUP_SIZE <span class="kw">as </span>usize], |
| <span class="doccomment">/// Full huffman tree. |
| /// |
| /// Positive values are edge nodes/symbols, negative values are |
| /// parent nodes/references to other nodes. |
| </span><span class="kw">pub </span>tree: [i16; MAX_HUFF_TREE_SIZE], |
| } |
| |
| <span class="kw">impl </span>HuffmanTable { |
| <span class="kw">const fn </span>new() -> HuffmanTable { |
| HuffmanTable { |
| code_size: [<span class="number">0</span>; MAX_HUFF_SYMBOLS_0], |
| look_up: [<span class="number">0</span>; FAST_LOOKUP_SIZE <span class="kw">as </span>usize], |
| tree: [<span class="number">0</span>; MAX_HUFF_TREE_SIZE], |
| } |
| } |
| |
| <span class="doccomment">/// Look for a symbol in the fast lookup table. |
| /// The symbol is stored in the lower 9 bits, the length in the next 6. |
| /// If the returned value is negative, the code wasn't found in the |
| /// fast lookup table and the full tree has to be traversed to find the code. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">fn </span>fast_lookup(<span class="kw-2">&</span><span class="self">self</span>, bit_buf: BitBuffer) -> i16 { |
| <span class="self">self</span>.look_up[(bit_buf & BitBuffer::from(FAST_LOOKUP_SIZE - <span class="number">1</span>)) <span class="kw">as </span>usize] |
| } |
| |
| <span class="doccomment">/// Get the symbol and the code length from the huffman tree. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">fn </span>tree_lookup(<span class="kw-2">&</span><span class="self">self</span>, fast_symbol: i32, bit_buf: BitBuffer, <span class="kw-2">mut </span>code_len: u32) -> (i32, u32) { |
| <span class="kw">let </span><span class="kw-2">mut </span>symbol = fast_symbol; |
| <span class="comment">// We step through the tree until we encounter a positive value, which indicates a |
| // symbol. |
| </span><span class="kw">loop </span>{ |
| <span class="comment">// symbol here indicates the position of the left (0) node, if the next bit is 1 |
| // we add 1 to the lookup position to get the right node. |
| </span>symbol = i32::from(<span class="self">self</span>.tree[(!symbol + ((bit_buf >> code_len) & <span class="number">1</span>) <span class="kw">as </span>i32) <span class="kw">as </span>usize]); |
| code_len += <span class="number">1</span>; |
| <span class="kw">if </span>symbol >= <span class="number">0 </span>{ |
| <span class="kw">break</span>; |
| } |
| } |
| (symbol, code_len) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="doccomment">/// Look up a symbol and code length from the bits in the provided bit buffer. |
| /// |
| /// Returns Some(symbol, length) on success, |
| /// None if the length is 0. |
| /// |
| /// It's possible we could avoid checking for 0 if we can guarantee a sane table. |
| /// TODO: Check if a smaller type for code_len helps performance. |
| </span><span class="kw">fn </span>lookup(<span class="kw-2">&</span><span class="self">self</span>, bit_buf: BitBuffer) -> <span class="prelude-ty">Option</span><(i32, u32)> { |
| <span class="kw">let </span>symbol = <span class="self">self</span>.fast_lookup(bit_buf).into(); |
| <span class="kw">if </span>symbol >= <span class="number">0 </span>{ |
| <span class="kw">if </span>(symbol >> <span class="number">9</span>) <span class="kw">as </span>u32 != <span class="number">0 </span>{ |
| <span class="prelude-val">Some</span>((symbol, (symbol >> <span class="number">9</span>) <span class="kw">as </span>u32)) |
| } <span class="kw">else </span>{ |
| <span class="comment">// Zero-length code. |
| </span><span class="prelude-val">None |
| </span>} |
| } <span class="kw">else </span>{ |
| <span class="comment">// We didn't get a symbol from the fast lookup table, so check the tree instead. |
| </span><span class="prelude-val">Some</span>(<span class="self">self</span>.tree_lookup(symbol, bit_buf, FAST_LOOKUP_BITS.into())) |
| } |
| } |
| } |
| |
| <span class="doccomment">/// The number of huffman tables used. |
| </span><span class="kw">const </span>MAX_HUFF_TABLES: usize = <span class="number">3</span>; |
| <span class="doccomment">/// The length of the first (literal/length) huffman table. |
| </span><span class="kw">const </span>MAX_HUFF_SYMBOLS_0: usize = <span class="number">288</span>; |
| <span class="doccomment">/// The length of the second (distance) huffman table. |
| </span><span class="kw">const </span>MAX_HUFF_SYMBOLS_1: usize = <span class="number">32</span>; |
| <span class="doccomment">/// The length of the last (huffman code length) huffman table. |
| </span><span class="kw">const </span>_MAX_HUFF_SYMBOLS_2: usize = <span class="number">19</span>; |
| <span class="doccomment">/// The maximum length of a code that can be looked up in the fast lookup table. |
| </span><span class="kw">const </span>FAST_LOOKUP_BITS: u8 = <span class="number">10</span>; |
| <span class="doccomment">/// The size of the fast lookup table. |
| </span><span class="kw">const </span>FAST_LOOKUP_SIZE: u32 = <span class="number">1 </span><< FAST_LOOKUP_BITS; |
| <span class="kw">const </span>MAX_HUFF_TREE_SIZE: usize = MAX_HUFF_SYMBOLS_0 * <span class="number">2</span>; |
| <span class="kw">const </span>LITLEN_TABLE: usize = <span class="number">0</span>; |
| <span class="kw">const </span>DIST_TABLE: usize = <span class="number">1</span>; |
| <span class="kw">const </span>HUFFLEN_TABLE: usize = <span class="number">2</span>; |
| |
| <span class="doccomment">/// Flags to [`decompress()`] to control how inflation works. |
| /// |
| /// These define bits for a bitmask argument. |
| </span><span class="kw">pub mod </span>inflate_flags { |
| <span class="doccomment">/// Should we try to parse a zlib header? |
| /// |
| /// If unset, the function will expect an RFC1951 deflate stream. If set, it will expect a |
| /// RFC1950 zlib wrapper around the deflate stream. |
| </span><span class="kw">pub const </span>TINFL_FLAG_PARSE_ZLIB_HEADER: u32 = <span class="number">1</span>; |
| |
| <span class="doccomment">/// There will be more input that hasn't been given to the decompressor yet. |
| /// |
| /// This is useful when you want to decompress what you have so far, |
| /// even if you know there is probably more input that hasn't gotten here yet (_e.g._, over a |
| /// network connection). When [`decompress()`][super::decompress] reaches the end of the input |
| /// without finding the end of the compressed stream, it will return |
| /// [`TINFLStatus::NeedsMoreInput`][super::TINFLStatus::NeedsMoreInput] if this is set, |
| /// indicating that you should get more data before calling again. If not set, it will return |
| /// [`TINFLStatus::FailedCannotMakeProgress`][super::TINFLStatus::FailedCannotMakeProgress] |
| /// suggesting the stream is corrupt, since you claimed it was all there. |
| </span><span class="kw">pub const </span>TINFL_FLAG_HAS_MORE_INPUT: u32 = <span class="number">2</span>; |
| |
| <span class="doccomment">/// The output buffer should not wrap around. |
| </span><span class="kw">pub const </span>TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF: u32 = <span class="number">4</span>; |
| |
| <span class="doccomment">/// Calculate the adler32 checksum of the output data even if we're not inflating a zlib stream. |
| /// |
| /// If [`TINFL_FLAG_IGNORE_ADLER32`] is specified, it will override this. |
| /// |
| /// NOTE: Enabling/disabling this between calls to decompress will result in an incorrect |
| /// checksum. |
| </span><span class="kw">pub const </span>TINFL_FLAG_COMPUTE_ADLER32: u32 = <span class="number">8</span>; |
| |
| <span class="doccomment">/// Ignore adler32 checksum even if we are inflating a zlib stream. |
| /// |
| /// Overrides [`TINFL_FLAG_COMPUTE_ADLER32`] if both are enabled. |
| /// |
| /// NOTE: This flag does not exist in miniz as it does not support this and is a |
| /// custom addition for miniz_oxide. |
| /// |
| /// NOTE: Should not be changed from enabled to disabled after decompression has started, |
| /// this will result in checksum failure (outside the unlikely event where the checksum happens |
| /// to match anyway). |
| </span><span class="kw">pub const </span>TINFL_FLAG_IGNORE_ADLER32: u32 = <span class="number">64</span>; |
| } |
| |
| <span class="kw">use </span><span class="self">self</span>::inflate_flags::<span class="kw-2">*</span>; |
| |
| <span class="kw">const </span>MIN_TABLE_SIZES: [u16; <span class="number">3</span>] = [<span class="number">257</span>, <span class="number">1</span>, <span class="number">4</span>]; |
| |
| <span class="attribute">#[cfg(target_pointer_width = <span class="string">"64"</span>)] |
| </span><span class="kw">type </span>BitBuffer = u64; |
| |
| <span class="attribute">#[cfg(not(target_pointer_width = <span class="string">"64"</span>))] |
| </span><span class="kw">type </span>BitBuffer = u32; |
| |
| <span class="doccomment">/// Main decompression struct. |
| /// |
| </span><span class="kw">pub struct </span>DecompressorOxide { |
| <span class="doccomment">/// Current state of the decompressor. |
| </span>state: core::State, |
| <span class="doccomment">/// Number of bits in the bit buffer. |
| </span>num_bits: u32, |
| <span class="doccomment">/// Zlib CMF |
| </span>z_header0: u32, |
| <span class="doccomment">/// Zlib FLG |
| </span>z_header1: u32, |
| <span class="doccomment">/// Adler32 checksum from the zlib header. |
| </span>z_adler32: u32, |
| <span class="doccomment">/// 1 if the current block is the last block, 0 otherwise. |
| </span>finish: u32, |
| <span class="doccomment">/// The type of the current block. |
| </span>block_type: u32, |
| <span class="doccomment">/// 1 if the adler32 value should be checked. |
| </span>check_adler32: u32, |
| <span class="doccomment">/// Last match distance. |
| </span>dist: u32, |
| <span class="doccomment">/// Variable used for match length, symbols, and a number of other things. |
| </span>counter: u32, |
| <span class="doccomment">/// Number of extra bits for the last length or distance code. |
| </span>num_extra: u32, |
| <span class="doccomment">/// Number of entries in each huffman table. |
| </span>table_sizes: [u32; MAX_HUFF_TABLES], |
| <span class="doccomment">/// Buffer of input data. |
| </span>bit_buf: BitBuffer, |
| <span class="doccomment">/// Huffman tables. |
| </span>tables: [HuffmanTable; MAX_HUFF_TABLES], |
| <span class="doccomment">/// Raw block header. |
| </span>raw_header: [u8; <span class="number">4</span>], |
| <span class="doccomment">/// Huffman length codes. |
| </span>len_codes: [u8; MAX_HUFF_SYMBOLS_0 + MAX_HUFF_SYMBOLS_1 + <span class="number">137</span>], |
| } |
| |
| <span class="kw">impl </span>DecompressorOxide { |
| <span class="doccomment">/// Create a new tinfl_decompressor with all fields set to 0. |
| </span><span class="kw">pub fn </span>new() -> DecompressorOxide { |
| DecompressorOxide::default() |
| } |
| |
| <span class="doccomment">/// Set the current state to `Start`. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>init(<span class="kw-2">&mut </span><span class="self">self</span>) { |
| <span class="comment">// The rest of the data is reset or overwritten when used. |
| </span><span class="self">self</span>.state = core::State::Start; |
| } |
| |
| <span class="doccomment">/// Returns the adler32 checksum of the currently decompressed data. |
| /// Note: Will return Some(1) if decompressing zlib but ignoring adler32. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>adler32(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><u32> { |
| <span class="kw">if </span><span class="self">self</span>.state != State::Start && !<span class="self">self</span>.state.is_failure() && <span class="self">self</span>.z_header0 != <span class="number">0 </span>{ |
| <span class="prelude-val">Some</span>(<span class="self">self</span>.check_adler32) |
| } <span class="kw">else </span>{ |
| <span class="prelude-val">None |
| </span>} |
| } |
| |
| <span class="doccomment">/// Returns the adler32 that was read from the zlib header if it exists. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>adler32_header(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><u32> { |
| <span class="kw">if </span><span class="self">self</span>.state != State::Start && <span class="self">self</span>.state != State::BadZlibHeader && <span class="self">self</span>.z_header0 != <span class="number">0 </span>{ |
| <span class="prelude-val">Some</span>(<span class="self">self</span>.z_adler32) |
| } <span class="kw">else </span>{ |
| <span class="prelude-val">None |
| </span>} |
| } |
| } |
| |
| <span class="kw">impl </span>Default <span class="kw">for </span>DecompressorOxide { |
| <span class="doccomment">/// Create a new tinfl_decompressor with all fields set to 0. |
| </span><span class="attribute">#[inline(always)] |
| </span><span class="kw">fn </span>default() -> <span class="self">Self </span>{ |
| DecompressorOxide { |
| state: core::State::Start, |
| num_bits: <span class="number">0</span>, |
| z_header0: <span class="number">0</span>, |
| z_header1: <span class="number">0</span>, |
| z_adler32: <span class="number">0</span>, |
| finish: <span class="number">0</span>, |
| block_type: <span class="number">0</span>, |
| check_adler32: <span class="number">0</span>, |
| dist: <span class="number">0</span>, |
| counter: <span class="number">0</span>, |
| num_extra: <span class="number">0</span>, |
| table_sizes: [<span class="number">0</span>; MAX_HUFF_TABLES], |
| bit_buf: <span class="number">0</span>, |
| <span class="comment">// TODO:(oyvindln) Check that copies here are optimized out in release mode. |
| </span>tables: [ |
| HuffmanTable::new(), |
| HuffmanTable::new(), |
| HuffmanTable::new(), |
| ], |
| raw_header: [<span class="number">0</span>; <span class="number">4</span>], |
| len_codes: [<span class="number">0</span>; MAX_HUFF_SYMBOLS_0 + MAX_HUFF_SYMBOLS_1 + <span class="number">137</span>], |
| } |
| } |
| } |
| |
| <span class="attribute">#[derive(Copy, Clone, PartialEq, Eq, Debug)] |
| #[non_exhaustive] |
| </span><span class="kw">enum </span>State { |
| Start = <span class="number">0</span>, |
| ReadZlibCmf, |
| ReadZlibFlg, |
| ReadBlockHeader, |
| BlockTypeNoCompression, |
| RawHeader, |
| RawMemcpy1, |
| RawMemcpy2, |
| ReadTableSizes, |
| ReadHufflenTableCodeSize, |
| ReadLitlenDistTablesCodeSize, |
| ReadExtraBitsCodeSize, |
| DecodeLitlen, |
| WriteSymbol, |
| ReadExtraBitsLitlen, |
| DecodeDistance, |
| ReadExtraBitsDistance, |
| RawReadFirstByte, |
| RawStoreFirstByte, |
| WriteLenBytesToEnd, |
| BlockDone, |
| HuffDecodeOuterLoop1, |
| HuffDecodeOuterLoop2, |
| ReadAdler32, |
| |
| DoneForever, |
| |
| <span class="comment">// Failure states. |
| </span>BlockTypeUnexpected, |
| BadCodeSizeSum, |
| BadDistOrLiteralTableLength, |
| BadTotalSymbols, |
| BadZlibHeader, |
| DistanceOutOfBounds, |
| BadRawLength, |
| BadCodeSizeDistPrevLookup, |
| InvalidLitlen, |
| InvalidDist, |
| InvalidCodeLen, |
| } |
| |
| <span class="kw">impl </span>State { |
| <span class="kw">fn </span>is_failure(<span class="self">self</span>) -> bool { |
| <span class="kw">match </span><span class="self">self </span>{ |
| BlockTypeUnexpected => <span class="bool-val">true</span>, |
| BadCodeSizeSum => <span class="bool-val">true</span>, |
| BadDistOrLiteralTableLength => <span class="bool-val">true</span>, |
| BadTotalSymbols => <span class="bool-val">true</span>, |
| BadZlibHeader => <span class="bool-val">true</span>, |
| DistanceOutOfBounds => <span class="bool-val">true</span>, |
| BadRawLength => <span class="bool-val">true</span>, |
| BadCodeSizeDistPrevLookup => <span class="bool-val">true</span>, |
| InvalidLitlen => <span class="bool-val">true</span>, |
| InvalidDist => <span class="bool-val">true</span>, |
| <span class="kw">_ </span>=> <span class="bool-val">false</span>, |
| } |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>begin(<span class="kw-2">&mut </span><span class="self">self</span>, new_state: State) { |
| <span class="kw-2">*</span><span class="self">self </span>= new_state; |
| } |
| } |
| |
| <span class="kw">use </span><span class="self">self</span>::State::<span class="kw-2">*</span>; |
| |
| <span class="comment">// Not sure why miniz uses 32-bit values for these, maybe alignment/cache again? |
| // # Optimization |
| // We add a extra value at the end and make the tables 32 elements long |
| // so we can use a mask to avoid bounds checks. |
| // The invalid values are set to something high enough to avoid underflowing |
| // the match length. |
| </span><span class="doccomment">/// Base length for each length code. |
| /// |
| /// The base is used together with the value of the extra bits to decode the actual |
| /// length/distance values in a match. |
| </span><span class="attribute">#[rustfmt::skip] |
| </span><span class="kw">const </span>LENGTH_BASE: [u16; <span class="number">32</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="number">10</span>, <span class="number">11</span>, <span class="number">13</span>, <span class="number">15</span>, <span class="number">17</span>, <span class="number">19</span>, <span class="number">23</span>, <span class="number">27</span>, <span class="number">31</span>, |
| <span class="number">35</span>, <span class="number">43</span>, <span class="number">51</span>, <span class="number">59</span>, <span class="number">67</span>, <span class="number">83</span>, <span class="number">99</span>, <span class="number">115</span>, <span class="number">131</span>, <span class="number">163</span>, <span class="number">195</span>, <span class="number">227</span>, <span class="number">258</span>, <span class="number">512</span>, <span class="number">512</span>, <span class="number">512 |
| </span>]; |
| |
| <span class="doccomment">/// Number of extra bits for each length code. |
| </span><span class="attribute">#[rustfmt::skip] |
| </span><span class="kw">const </span>LENGTH_EXTRA: [u8; <span class="number">32</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">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">2</span>, <span class="number">2</span>, <span class="number">2</span>, <span class="number">2</span>, |
| <span class="number">3</span>, <span class="number">3</span>, <span class="number">3</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">4</span>, <span class="number">4</span>, <span class="number">4</span>, <span class="number">5</span>, <span class="number">5</span>, <span class="number">5</span>, <span class="number">5</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0 |
| </span>]; |
| |
| <span class="doccomment">/// Base length for each distance code. |
| </span><span class="attribute">#[rustfmt::skip] |
| </span><span class="kw">const </span>DIST_BASE: [u16; <span class="number">32</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">7</span>, <span class="number">9</span>, <span class="number">13</span>, <span class="number">17</span>, <span class="number">25</span>, <span class="number">33</span>, |
| <span class="number">49</span>, <span class="number">65</span>, <span class="number">97</span>, <span class="number">129</span>, <span class="number">193</span>, <span class="number">257</span>, <span class="number">385</span>, <span class="number">513</span>, <span class="number">769</span>, <span class="number">1025</span>, <span class="number">1537</span>, |
| <span class="number">2049</span>, <span class="number">3073</span>, <span class="number">4097</span>, <span class="number">6145</span>, <span class="number">8193</span>, <span class="number">12_289</span>, <span class="number">16_385</span>, <span class="number">24_577</span>, <span class="number">32_768</span>, <span class="number">32_768 |
| </span>]; |
| |
| <span class="doccomment">/// Number of extra bits for each distance code. |
| </span><span class="attribute">#[rustfmt::skip] |
| </span><span class="kw">const </span>DIST_EXTRA: [u8; <span class="number">32</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="number">1</span>, <span class="number">2</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">4</span>, <span class="number">5</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">6</span>, |
| <span class="number">7</span>, <span class="number">7</span>, <span class="number">8</span>, <span class="number">8</span>, <span class="number">9</span>, <span class="number">9</span>, <span class="number">10</span>, <span class="number">10</span>, <span class="number">11</span>, <span class="number">11</span>, <span class="number">12</span>, <span class="number">12</span>, <span class="number">13</span>, <span class="number">13</span>, <span class="number">13</span>, <span class="number">13 |
| </span>]; |
| |
| <span class="doccomment">/// The mask used when indexing the base/extra arrays. |
| </span><span class="kw">const </span>BASE_EXTRA_MASK: usize = <span class="number">32 </span>- <span class="number">1</span>; |
| |
| <span class="doccomment">/// Sets the value of all the elements of the slice to `val`. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">fn </span>memset<T: Copy>(slice: <span class="kw-2">&mut </span>[T], val: T) { |
| <span class="kw">for </span>x <span class="kw">in </span>slice { |
| <span class="kw-2">*</span>x = val |
| } |
| } |
| |
| <span class="doccomment">/// Read an le u16 value from the slice iterator. |
| /// |
| /// # Panics |
| /// Panics if there are less than two bytes left. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">fn </span>read_u16_le(iter: <span class="kw-2">&mut </span>slice::Iter<u8>) -> u16 { |
| <span class="kw">let </span>ret = { |
| <span class="kw">let </span>two_bytes = iter.as_ref()[..<span class="number">2</span>].try_into().unwrap(); |
| u16::from_le_bytes(two_bytes) |
| }; |
| iter.nth(<span class="number">1</span>); |
| ret |
| } |
| |
| <span class="doccomment">/// Read an le u32 value from the slice iterator. |
| /// |
| /// # Panics |
| /// Panics if there are less than four bytes left. |
| </span><span class="attribute">#[inline(always)] |
| #[cfg(target_pointer_width = <span class="string">"64"</span>)] |
| </span><span class="kw">fn </span>read_u32_le(iter: <span class="kw-2">&mut </span>slice::Iter<u8>) -> u32 { |
| <span class="kw">let </span>ret = { |
| <span class="kw">let </span>four_bytes: [u8; <span class="number">4</span>] = iter.as_ref()[..<span class="number">4</span>].try_into().unwrap(); |
| u32::from_le_bytes(four_bytes) |
| }; |
| iter.nth(<span class="number">3</span>); |
| ret |
| } |
| |
| <span class="doccomment">/// Ensure that there is data in the bit buffer. |
| /// |
| /// On 64-bit platform, we use a 64-bit value so this will |
| /// result in there being at least 32 bits in the bit buffer. |
| /// This function assumes that there is at least 4 bytes left in the input buffer. |
| </span><span class="attribute">#[inline(always)] |
| #[cfg(target_pointer_width = <span class="string">"64"</span>)] |
| </span><span class="kw">fn </span>fill_bit_buffer(l: <span class="kw-2">&mut </span>LocalVars, in_iter: <span class="kw-2">&mut </span>slice::Iter<u8>) { |
| <span class="comment">// Read four bytes into the buffer at once. |
| </span><span class="kw">if </span>l.num_bits < <span class="number">30 </span>{ |
| l.bit_buf |= BitBuffer::from(read_u32_le(in_iter)) << l.num_bits; |
| l.num_bits += <span class="number">32</span>; |
| } |
| } |
| |
| <span class="doccomment">/// Same as previous, but for non-64-bit platforms. |
| /// Ensures at least 16 bits are present, requires at least 2 bytes in the in buffer. |
| </span><span class="attribute">#[inline(always)] |
| #[cfg(not(target_pointer_width = <span class="string">"64"</span>))] |
| </span><span class="kw">fn </span>fill_bit_buffer(l: <span class="kw-2">&mut </span>LocalVars, in_iter: <span class="kw-2">&mut </span>slice::Iter<u8>) { |
| <span class="comment">// If the buffer is 32-bit wide, read 2 bytes instead. |
| </span><span class="kw">if </span>l.num_bits < <span class="number">15 </span>{ |
| l.bit_buf |= BitBuffer::from(read_u16_le(in_iter)) << l.num_bits; |
| l.num_bits += <span class="number">16</span>; |
| } |
| } |
| |
| <span class="doccomment">/// Check that the zlib header is correct and that there is enough space in the buffer |
| /// for the window size specified in the header. |
| /// |
| /// See https://tools.ietf.org/html/rfc1950 |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">fn </span>validate_zlib_header(cmf: u32, flg: u32, flags: u32, mask: usize) -> Action { |
| <span class="kw">let </span><span class="kw-2">mut </span>failed = |
| <span class="comment">// cmf + flg should be divisible by 31. |
| </span>(((cmf * <span class="number">256</span>) + flg) % <span class="number">31 </span>!= <span class="number">0</span>) || |
| <span class="comment">// If this flag is set, a dictionary was used for this zlib compressed data. |
| // This is currently not supported by miniz or miniz-oxide |
| </span>((flg & <span class="number">0b0010_0000</span>) != <span class="number">0</span>) || |
| <span class="comment">// Compression method. Only 8(DEFLATE) is defined by the standard. |
| </span>((cmf & <span class="number">15</span>) != <span class="number">8</span>); |
| |
| <span class="kw">let </span>window_size = <span class="number">1 </span><< ((cmf >> <span class="number">4</span>) + <span class="number">8</span>); |
| <span class="kw">if </span>(flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF) == <span class="number">0 </span>{ |
| <span class="comment">// Bail if the buffer is wrapping and the window size is larger than the buffer. |
| </span>failed |= (mask + <span class="number">1</span>) < window_size; |
| } |
| |
| <span class="comment">// Zlib doesn't allow window sizes above 32 * 1024. |
| </span>failed |= window_size > <span class="number">32_768</span>; |
| |
| <span class="kw">if </span>failed { |
| Action::Jump(BadZlibHeader) |
| } <span class="kw">else </span>{ |
| Action::Jump(ReadBlockHeader) |
| } |
| } |
| |
| <span class="kw">enum </span>Action { |
| <span class="prelude-val">None</span>, |
| Jump(State), |
| End(TINFLStatus), |
| } |
| |
| <span class="doccomment">/// Try to decode the next huffman code, and puts it in the counter field of the decompressor |
| /// if successful. |
| /// |
| /// # Returns |
| /// The specified action returned from `f` on success, |
| /// `Action::End` if there are not enough data left to decode a symbol. |
| </span><span class="kw">fn </span>decode_huffman_code<F>( |
| r: <span class="kw-2">&mut </span>DecompressorOxide, |
| l: <span class="kw-2">&mut </span>LocalVars, |
| table: usize, |
| flags: u32, |
| in_iter: <span class="kw-2">&mut </span>slice::Iter<u8>, |
| f: F, |
| ) -> Action |
| <span class="kw">where |
| </span>F: FnOnce(<span class="kw-2">&mut </span>DecompressorOxide, <span class="kw-2">&mut </span>LocalVars, i32) -> Action, |
| { |
| <span class="comment">// As the huffman codes can be up to 15 bits long we need at least 15 bits |
| // ready in the bit buffer to start decoding the next huffman code. |
| </span><span class="kw">if </span>l.num_bits < <span class="number">15 </span>{ |
| <span class="comment">// First, make sure there is enough data in the bit buffer to decode a huffman code. |
| </span><span class="kw">if </span>in_iter.len() < <span class="number">2 </span>{ |
| <span class="comment">// If there is less than 2 bytes left in the input buffer, we try to look up |
| // the huffman code with what's available, and return if that doesn't succeed. |
| // Original explanation in miniz: |
| // /* TINFL_HUFF_BITBUF_FILL() is only used rarely, when the number of bytes |
| // * remaining in the input buffer falls below 2. */ |
| // /* It reads just enough bytes from the input stream that are needed to decode |
| // * the next Huffman code (and absolutely no more). It works by trying to fully |
| // * decode a */ |
| // /* Huffman code by using whatever bits are currently present in the bit buffer. |
| // * If this fails, it reads another byte, and tries again until it succeeds or |
| // * until the */ |
| // /* bit buffer contains >=15 bits (deflate's max. Huffman code size). */ |
| </span><span class="kw">loop </span>{ |
| <span class="kw">let </span><span class="kw-2">mut </span>temp = i32::from(r.tables[table].fast_lookup(l.bit_buf)); |
| |
| <span class="kw">if </span>temp >= <span class="number">0 </span>{ |
| <span class="kw">let </span>code_len = (temp >> <span class="number">9</span>) <span class="kw">as </span>u32; |
| <span class="kw">if </span>(code_len != <span class="number">0</span>) && (l.num_bits >= code_len) { |
| <span class="kw">break</span>; |
| } |
| } <span class="kw">else if </span>l.num_bits > FAST_LOOKUP_BITS.into() { |
| <span class="kw">let </span><span class="kw-2">mut </span>code_len = u32::from(FAST_LOOKUP_BITS); |
| <span class="kw">loop </span>{ |
| temp = i32::from( |
| r.tables[table].tree |
| [(!temp + ((l.bit_buf >> code_len) & <span class="number">1</span>) <span class="kw">as </span>i32) <span class="kw">as </span>usize], |
| ); |
| code_len += <span class="number">1</span>; |
| <span class="kw">if </span>temp >= <span class="number">0 </span>|| l.num_bits < code_len + <span class="number">1 </span>{ |
| <span class="kw">break</span>; |
| } |
| } |
| <span class="kw">if </span>temp >= <span class="number">0 </span>{ |
| <span class="kw">break</span>; |
| } |
| } |
| |
| <span class="comment">// TODO: miniz jumps straight to here after getting here again after failing to read |
| // a byte. |
| // Doing that lets miniz avoid re-doing the lookup that that was done in the |
| // previous call. |
| </span><span class="kw">let </span><span class="kw-2">mut </span>byte = <span class="number">0</span>; |
| <span class="kw">if let </span>a @ Action::End(<span class="kw">_</span>) = read_byte(in_iter, flags, |b| { |
| byte = b; |
| Action::None |
| }) { |
| <span class="kw">return </span>a; |
| }; |
| |
| <span class="comment">// Do this outside closure for now to avoid borrowing r. |
| </span>l.bit_buf |= BitBuffer::from(byte) << l.num_bits; |
| l.num_bits += <span class="number">8</span>; |
| |
| <span class="kw">if </span>l.num_bits >= <span class="number">15 </span>{ |
| <span class="kw">break</span>; |
| } |
| } |
| } <span class="kw">else </span>{ |
| <span class="comment">// There is enough data in the input buffer, so read the next two bytes |
| // and add them to the bit buffer. |
| // Unwrapping here is fine since we just checked that there are at least two |
| // bytes left. |
| </span>l.bit_buf |= BitBuffer::from(read_u16_le(in_iter)) << l.num_bits; |
| l.num_bits += <span class="number">16</span>; |
| } |
| } |
| |
| <span class="comment">// We now have at least 15 bits in the input buffer. |
| </span><span class="kw">let </span><span class="kw-2">mut </span>symbol = i32::from(r.tables[table].fast_lookup(l.bit_buf)); |
| <span class="kw">let </span>code_len; |
| <span class="comment">// If the symbol was found in the fast lookup table. |
| </span><span class="kw">if </span>symbol >= <span class="number">0 </span>{ |
| <span class="comment">// Get the length value from the top bits. |
| // As we shift down the sign bit, converting to an unsigned value |
| // shouldn't overflow. |
| </span>code_len = (symbol >> <span class="number">9</span>) <span class="kw">as </span>u32; |
| <span class="comment">// Mask out the length value. |
| </span>symbol &= <span class="number">511</span>; |
| } <span class="kw">else </span>{ |
| <span class="kw">let </span>res = r.tables[table].tree_lookup(symbol, l.bit_buf, u32::from(FAST_LOOKUP_BITS)); |
| symbol = res.<span class="number">0</span>; |
| code_len = res.<span class="number">1 </span><span class="kw">as </span>u32; |
| }; |
| |
| <span class="kw">if </span>code_len == <span class="number">0 </span>{ |
| <span class="kw">return </span>Action::Jump(InvalidCodeLen); |
| } |
| |
| l.bit_buf >>= code_len <span class="kw">as </span>u32; |
| l.num_bits -= code_len; |
| f(r, l, symbol) |
| } |
| |
| <span class="doccomment">/// Try to read one byte from `in_iter` and call `f` with the read byte as an argument, |
| /// returning the result. |
| /// If reading fails, `Action::End is returned` |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">fn </span>read_byte<F>(in_iter: <span class="kw-2">&mut </span>slice::Iter<u8>, flags: u32, f: F) -> Action |
| <span class="kw">where |
| </span>F: FnOnce(u8) -> Action, |
| { |
| <span class="kw">match </span>in_iter.next() { |
| <span class="prelude-val">None </span>=> end_of_input(flags), |
| <span class="prelude-val">Some</span>(<span class="kw-2">&</span>byte) => f(byte), |
| } |
| } |
| |
| <span class="comment">// TODO: `l: &mut LocalVars` may be slow similar to decompress_fast (even with inline(always)) |
| </span><span class="doccomment">/// Try to read `amount` number of bits from `in_iter` and call the function `f` with the bits as an |
| /// an argument after reading, returning the result of that function, or `Action::End` if there are |
| /// not enough bytes left. |
| </span><span class="attribute">#[inline] |
| #[allow(clippy::while_immutable_condition)] |
| </span><span class="kw">fn </span>read_bits<F>( |
| l: <span class="kw-2">&mut </span>LocalVars, |
| amount: u32, |
| in_iter: <span class="kw-2">&mut </span>slice::Iter<u8>, |
| flags: u32, |
| f: F, |
| ) -> Action |
| <span class="kw">where |
| </span>F: FnOnce(<span class="kw-2">&mut </span>LocalVars, BitBuffer) -> Action, |
| { |
| <span class="comment">// Clippy gives a false positive warning here due to the closure. |
| // Read enough bytes from the input iterator to cover the number of bits we want. |
| </span><span class="kw">while </span>l.num_bits < amount { |
| <span class="kw">match </span>read_byte(in_iter, flags, |byte| { |
| l.bit_buf |= BitBuffer::from(byte) << l.num_bits; |
| l.num_bits += <span class="number">8</span>; |
| Action::None |
| }) { |
| Action::None => (), |
| <span class="comment">// If there are not enough bytes in the input iterator, return and signal that we need |
| // more. |
| </span>action => <span class="kw">return </span>action, |
| } |
| } |
| |
| <span class="kw">let </span>bits = l.bit_buf & ((<span class="number">1 </span><< amount) - <span class="number">1</span>); |
| l.bit_buf >>= amount; |
| l.num_bits -= amount; |
| f(l, bits) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>pad_to_bytes<F>(l: <span class="kw-2">&mut </span>LocalVars, in_iter: <span class="kw-2">&mut </span>slice::Iter<u8>, flags: u32, f: F) -> Action |
| <span class="kw">where |
| </span>F: FnOnce(<span class="kw-2">&mut </span>LocalVars) -> Action, |
| { |
| <span class="kw">let </span>num_bits = l.num_bits & <span class="number">7</span>; |
| read_bits(l, num_bits, in_iter, flags, |l, <span class="kw">_</span>| f(l)) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>end_of_input(flags: u32) -> Action { |
| Action::End(<span class="kw">if </span>flags & TINFL_FLAG_HAS_MORE_INPUT != <span class="number">0 </span>{ |
| TINFLStatus::NeedsMoreInput |
| } <span class="kw">else </span>{ |
| TINFLStatus::FailedCannotMakeProgress |
| }) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>undo_bytes(l: <span class="kw-2">&mut </span>LocalVars, max: u32) -> u32 { |
| <span class="kw">let </span>res = cmp::min(l.num_bits >> <span class="number">3</span>, max); |
| l.num_bits -= res << <span class="number">3</span>; |
| res |
| } |
| |
| <span class="kw">fn </span>start_static_table(r: <span class="kw-2">&mut </span>DecompressorOxide) { |
| r.table_sizes[LITLEN_TABLE] = <span class="number">288</span>; |
| r.table_sizes[DIST_TABLE] = <span class="number">32</span>; |
| memset(<span class="kw-2">&mut </span>r.tables[LITLEN_TABLE].code_size[<span class="number">0</span>..<span class="number">144</span>], <span class="number">8</span>); |
| memset(<span class="kw-2">&mut </span>r.tables[LITLEN_TABLE].code_size[<span class="number">144</span>..<span class="number">256</span>], <span class="number">9</span>); |
| memset(<span class="kw-2">&mut </span>r.tables[LITLEN_TABLE].code_size[<span class="number">256</span>..<span class="number">280</span>], <span class="number">7</span>); |
| memset(<span class="kw-2">&mut </span>r.tables[LITLEN_TABLE].code_size[<span class="number">280</span>..<span class="number">288</span>], <span class="number">8</span>); |
| memset(<span class="kw-2">&mut </span>r.tables[DIST_TABLE].code_size[<span class="number">0</span>..<span class="number">32</span>], <span class="number">5</span>); |
| } |
| |
| <span class="kw">static </span>REVERSED_BITS_LOOKUP: [u32; <span class="number">1024</span>] = { |
| <span class="kw">let </span><span class="kw-2">mut </span>table = [<span class="number">0</span>; <span class="number">1024</span>]; |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>; |
| <span class="kw">while </span>i < <span class="number">1024 </span>{ |
| table[i] = (i <span class="kw">as </span>u32).reverse_bits(); |
| i += <span class="number">1</span>; |
| } |
| |
| table |
| }; |
| |
| <span class="kw">fn </span>init_tree(r: <span class="kw-2">&mut </span>DecompressorOxide, l: <span class="kw-2">&mut </span>LocalVars) -> Action { |
| <span class="kw">loop </span>{ |
| <span class="kw">let </span>table = <span class="kw-2">&mut </span>r.tables[r.block_type <span class="kw">as </span>usize]; |
| <span class="kw">let </span>table_size = r.table_sizes[r.block_type <span class="kw">as </span>usize] <span class="kw">as </span>usize; |
| <span class="kw">let </span><span class="kw-2">mut </span>total_symbols = [<span class="number">0u32</span>; <span class="number">16</span>]; |
| <span class="kw">let </span><span class="kw-2">mut </span>next_code = [<span class="number">0u32</span>; <span class="number">17</span>]; |
| memset(<span class="kw-2">&mut </span>table.look_up[..], <span class="number">0</span>); |
| memset(<span class="kw-2">&mut </span>table.tree[..], <span class="number">0</span>); |
| |
| <span class="kw">for </span><span class="kw-2">&</span>code_size <span class="kw">in </span><span class="kw-2">&</span>table.code_size[..table_size] { |
| total_symbols[code_size <span class="kw">as </span>usize] += <span class="number">1</span>; |
| } |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>used_symbols = <span class="number">0</span>; |
| <span class="kw">let </span><span class="kw-2">mut </span>total = <span class="number">0</span>; |
| <span class="kw">for </span>i <span class="kw">in </span><span class="number">1</span>..<span class="number">16 </span>{ |
| used_symbols += total_symbols[i]; |
| total += total_symbols[i]; |
| total <<= <span class="number">1</span>; |
| next_code[i + <span class="number">1</span>] = total; |
| } |
| |
| <span class="kw">if </span>total != <span class="number">65_536 </span>&& used_symbols > <span class="number">1 </span>{ |
| <span class="kw">return </span>Action::Jump(BadTotalSymbols); |
| } |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>tree_next = -<span class="number">1</span>; |
| <span class="kw">for </span>symbol_index <span class="kw">in </span><span class="number">0</span>..table_size { |
| <span class="kw">let </span><span class="kw-2">mut </span>rev_code = <span class="number">0</span>; |
| <span class="kw">let </span>code_size = table.code_size[symbol_index]; |
| <span class="kw">if </span>code_size == <span class="number">0 </span>{ |
| <span class="kw">continue</span>; |
| } |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>cur_code = next_code[code_size <span class="kw">as </span>usize]; |
| next_code[code_size <span class="kw">as </span>usize] += <span class="number">1</span>; |
| |
| <span class="kw">let </span>n = cur_code & (u32::MAX >> (<span class="number">32 </span>- code_size)); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>rev_code = <span class="kw">if </span>n < <span class="number">1024 </span>{ |
| REVERSED_BITS_LOOKUP[n <span class="kw">as </span>usize] >> (<span class="number">32 </span>- code_size) |
| } <span class="kw">else </span>{ |
| <span class="kw">for _ in </span><span class="number">0</span>..code_size { |
| rev_code = (rev_code << <span class="number">1</span>) | (cur_code & <span class="number">1</span>); |
| cur_code >>= <span class="number">1</span>; |
| } |
| rev_code |
| }; |
| |
| <span class="kw">if </span>code_size <= FAST_LOOKUP_BITS { |
| <span class="kw">let </span>k = (i16::from(code_size) << <span class="number">9</span>) | symbol_index <span class="kw">as </span>i16; |
| <span class="kw">while </span>rev_code < FAST_LOOKUP_SIZE { |
| table.look_up[rev_code <span class="kw">as </span>usize] = k; |
| rev_code += <span class="number">1 </span><< code_size; |
| } |
| <span class="kw">continue</span>; |
| } |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>tree_cur = table.look_up[(rev_code & (FAST_LOOKUP_SIZE - <span class="number">1</span>)) <span class="kw">as </span>usize]; |
| <span class="kw">if </span>tree_cur == <span class="number">0 </span>{ |
| table.look_up[(rev_code & (FAST_LOOKUP_SIZE - <span class="number">1</span>)) <span class="kw">as </span>usize] = tree_next <span class="kw">as </span>i16; |
| tree_cur = tree_next; |
| tree_next -= <span class="number">2</span>; |
| } |
| |
| rev_code >>= FAST_LOOKUP_BITS - <span class="number">1</span>; |
| <span class="kw">for _ in </span>FAST_LOOKUP_BITS + <span class="number">1</span>..code_size { |
| rev_code >>= <span class="number">1</span>; |
| tree_cur -= (rev_code & <span class="number">1</span>) <span class="kw">as </span>i16; |
| <span class="kw">if </span>table.tree[(-tree_cur - <span class="number">1</span>) <span class="kw">as </span>usize] == <span class="number">0 </span>{ |
| table.tree[(-tree_cur - <span class="number">1</span>) <span class="kw">as </span>usize] = tree_next <span class="kw">as </span>i16; |
| tree_cur = tree_next; |
| tree_next -= <span class="number">2</span>; |
| } <span class="kw">else </span>{ |
| tree_cur = table.tree[(-tree_cur - <span class="number">1</span>) <span class="kw">as </span>usize]; |
| } |
| } |
| |
| rev_code >>= <span class="number">1</span>; |
| tree_cur -= (rev_code & <span class="number">1</span>) <span class="kw">as </span>i16; |
| table.tree[(-tree_cur - <span class="number">1</span>) <span class="kw">as </span>usize] = symbol_index <span class="kw">as </span>i16; |
| } |
| |
| <span class="kw">if </span>r.block_type == <span class="number">2 </span>{ |
| l.counter = <span class="number">0</span>; |
| <span class="kw">return </span>Action::Jump(ReadLitlenDistTablesCodeSize); |
| } |
| |
| <span class="kw">if </span>r.block_type == <span class="number">0 </span>{ |
| <span class="kw">break</span>; |
| } |
| r.block_type -= <span class="number">1</span>; |
| } |
| |
| l.counter = <span class="number">0</span>; |
| Action::Jump(DecodeLitlen) |
| } |
| |
| <span class="comment">// A helper macro for generating the state machine. |
| // |
| // As Rust doesn't have fallthrough on matches, we have to return to the match statement |
| // and jump for each state change. (Which would ideally be optimized away, but often isn't.) |
| </span><span class="macro">macro_rules! </span>generate_state { |
| (<span class="macro-nonterminal">$state</span>: ident, <span class="macro-nonterminal">$state_machine</span>: tt, <span class="macro-nonterminal">$f</span>: expr) => { |
| <span class="kw">loop </span>{ |
| <span class="kw">match </span><span class="macro-nonterminal">$f </span>{ |
| Action::None => <span class="kw">continue</span>, |
| Action::Jump(new_state) => { |
| <span class="macro-nonterminal">$state </span>= new_state; |
| <span class="kw">continue </span><span class="macro-nonterminal">$state_machine</span>; |
| }, |
| Action::End(result) => <span class="kw">break </span><span class="macro-nonterminal">$state_machine </span>result, |
| } |
| } |
| }; |
| } |
| |
| <span class="attribute">#[derive(Copy, Clone)] |
| </span><span class="kw">struct </span>LocalVars { |
| <span class="kw">pub </span>bit_buf: BitBuffer, |
| <span class="kw">pub </span>num_bits: u32, |
| <span class="kw">pub </span>dist: u32, |
| <span class="kw">pub </span>counter: u32, |
| <span class="kw">pub </span>num_extra: u32, |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>transfer( |
| out_slice: <span class="kw-2">&mut </span>[u8], |
| <span class="kw-2">mut </span>source_pos: usize, |
| <span class="kw-2">mut </span>out_pos: usize, |
| match_len: usize, |
| out_buf_size_mask: usize, |
| ) { |
| <span class="comment">// special case that comes up surprisingly often. in the case that `source_pos` |
| // is 1 less than `out_pos`, we can say that the entire range will be the same |
| // value and optimize this to be a simple `memset` |
| </span><span class="kw">let </span>source_diff = <span class="kw">if </span>source_pos > out_pos { |
| source_pos - out_pos |
| } <span class="kw">else </span>{ |
| out_pos - source_pos |
| }; |
| <span class="kw">if </span>out_buf_size_mask == usize::MAX && source_diff == <span class="number">1 </span>&& out_pos > source_pos { |
| <span class="kw">let </span>init = out_slice[out_pos - <span class="number">1</span>]; |
| <span class="kw">let </span>end = (match_len >> <span class="number">2</span>) * <span class="number">4 </span>+ out_pos; |
| |
| out_slice[out_pos..end].fill(init); |
| out_pos = end; |
| source_pos = end - <span class="number">1</span>; |
| <span class="comment">// if the difference between `source_pos` and `out_pos` is greater than 3, we |
| // can do slightly better than the naive case by copying everything at once |
| </span>} <span class="kw">else if </span>out_buf_size_mask == usize::MAX && source_diff >= <span class="number">4 </span>&& out_pos > source_pos { |
| <span class="kw">for _ in </span><span class="number">0</span>..match_len >> <span class="number">2 </span>{ |
| out_slice.copy_within(source_pos..=source_pos + <span class="number">3</span>, out_pos); |
| source_pos += <span class="number">4</span>; |
| out_pos += <span class="number">4</span>; |
| } |
| } <span class="kw">else </span>{ |
| <span class="kw">for _ in </span><span class="number">0</span>..match_len >> <span class="number">2 </span>{ |
| out_slice[out_pos] = out_slice[source_pos & out_buf_size_mask]; |
| out_slice[out_pos + <span class="number">1</span>] = out_slice[(source_pos + <span class="number">1</span>) & out_buf_size_mask]; |
| out_slice[out_pos + <span class="number">2</span>] = out_slice[(source_pos + <span class="number">2</span>) & out_buf_size_mask]; |
| out_slice[out_pos + <span class="number">3</span>] = out_slice[(source_pos + <span class="number">3</span>) & out_buf_size_mask]; |
| source_pos += <span class="number">4</span>; |
| out_pos += <span class="number">4</span>; |
| } |
| } |
| |
| <span class="kw">match </span>match_len & <span class="number">3 </span>{ |
| <span class="number">0 </span>=> (), |
| <span class="number">1 </span>=> out_slice[out_pos] = out_slice[source_pos & out_buf_size_mask], |
| <span class="number">2 </span>=> { |
| out_slice[out_pos] = out_slice[source_pos & out_buf_size_mask]; |
| out_slice[out_pos + <span class="number">1</span>] = out_slice[(source_pos + <span class="number">1</span>) & out_buf_size_mask]; |
| } |
| <span class="number">3 </span>=> { |
| out_slice[out_pos] = out_slice[source_pos & out_buf_size_mask]; |
| out_slice[out_pos + <span class="number">1</span>] = out_slice[(source_pos + <span class="number">1</span>) & out_buf_size_mask]; |
| out_slice[out_pos + <span class="number">2</span>] = out_slice[(source_pos + <span class="number">2</span>) & out_buf_size_mask]; |
| } |
| <span class="kw">_ </span>=> <span class="macro">unreachable!</span>(), |
| } |
| } |
| |
| <span class="doccomment">/// Presumes that there is at least match_len bytes in output left. |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">fn </span>apply_match( |
| out_slice: <span class="kw-2">&mut </span>[u8], |
| out_pos: usize, |
| dist: usize, |
| match_len: usize, |
| out_buf_size_mask: usize, |
| ) { |
| <span class="macro">debug_assert!</span>(out_pos + match_len <= out_slice.len()); |
| |
| <span class="kw">let </span>source_pos = out_pos.wrapping_sub(dist) & out_buf_size_mask; |
| |
| <span class="kw">if </span>match_len == <span class="number">3 </span>{ |
| <span class="comment">// Fast path for match len 3. |
| </span>out_slice[out_pos] = out_slice[source_pos]; |
| out_slice[out_pos + <span class="number">1</span>] = out_slice[(source_pos + <span class="number">1</span>) & out_buf_size_mask]; |
| out_slice[out_pos + <span class="number">2</span>] = out_slice[(source_pos + <span class="number">2</span>) & out_buf_size_mask]; |
| <span class="kw">return</span>; |
| } |
| |
| <span class="kw">if </span><span class="macro">cfg!</span>(not(any(target_arch = <span class="string">"x86"</span>, target_arch = <span class="string">"x86_64"</span>))) { |
| <span class="comment">// We are not on x86 so copy manually. |
| </span>transfer(out_slice, source_pos, out_pos, match_len, out_buf_size_mask); |
| <span class="kw">return</span>; |
| } |
| |
| <span class="kw">if </span>source_pos >= out_pos && (source_pos - out_pos) < match_len { |
| transfer(out_slice, source_pos, out_pos, match_len, out_buf_size_mask); |
| } <span class="kw">else if </span>match_len <= dist && source_pos + match_len < out_slice.len() { |
| <span class="comment">// Destination and source segments does not intersect and source does not wrap. |
| </span><span class="kw">if </span>source_pos < out_pos { |
| <span class="kw">let </span>(from_slice, to_slice) = out_slice.split_at_mut(out_pos); |
| to_slice[..match_len].copy_from_slice(<span class="kw-2">&</span>from_slice[source_pos..source_pos + match_len]); |
| } <span class="kw">else </span>{ |
| <span class="kw">let </span>(to_slice, from_slice) = out_slice.split_at_mut(source_pos); |
| to_slice[out_pos..out_pos + match_len].copy_from_slice(<span class="kw-2">&</span>from_slice[..match_len]); |
| } |
| } <span class="kw">else </span>{ |
| transfer(out_slice, source_pos, out_pos, match_len, out_buf_size_mask); |
| } |
| } |
| |
| <span class="doccomment">/// Fast inner decompression loop which is run while there is at least |
| /// 259 bytes left in the output buffer, and at least 6 bytes left in the input buffer |
| /// (The maximum one match would need + 1). |
| /// |
| /// This was inspired by a similar optimization in zlib, which uses this info to do |
| /// faster unchecked copies of multiple bytes at a time. |
| /// Currently we don't do this here, but this function does avoid having to jump through the |
| /// big match loop on each state change(as rust does not have fallthrough or gotos at the moment), |
| /// and already improves decompression speed a fair bit. |
| </span><span class="kw">fn </span>decompress_fast( |
| r: <span class="kw-2">&mut </span>DecompressorOxide, |
| in_iter: <span class="kw-2">&mut </span>slice::Iter<u8>, |
| out_buf: <span class="kw-2">&mut </span>OutputBuffer, |
| flags: u32, |
| local_vars: <span class="kw-2">&mut </span>LocalVars, |
| out_buf_size_mask: usize, |
| ) -> (TINFLStatus, State) { |
| <span class="comment">// Make a local copy of the most used variables, to avoid having to update and read from values |
| // in a random memory location and to encourage more register use. |
| </span><span class="kw">let </span><span class="kw-2">mut </span>l = <span class="kw-2">*</span>local_vars; |
| <span class="kw">let </span><span class="kw-2">mut </span>state; |
| |
| <span class="kw">let </span>status: TINFLStatus = <span class="lifetime">'o</span>: <span class="kw">loop </span>{ |
| state = State::DecodeLitlen; |
| <span class="kw">loop </span>{ |
| <span class="comment">// This function assumes that there is at least 259 bytes left in the output buffer, |
| // and that there is at least 14 bytes left in the input buffer. 14 input bytes: |
| // 15 (prev lit) + 15 (length) + 5 (length extra) + 15 (dist) |
| // + 29 + 32 (left in bit buf, including last 13 dist extra) = 111 bits < 14 bytes |
| // We need the one extra byte as we may write one length and one full match |
| // before checking again. |
| </span><span class="kw">if </span>out_buf.bytes_left() < <span class="number">259 </span>|| in_iter.len() < <span class="number">14 </span>{ |
| state = State::DecodeLitlen; |
| <span class="kw">break </span><span class="lifetime">'o </span>TINFLStatus::Done; |
| } |
| |
| fill_bit_buffer(<span class="kw-2">&mut </span>l, in_iter); |
| |
| <span class="kw">if let </span><span class="prelude-val">Some</span>((symbol, code_len)) = r.tables[LITLEN_TABLE].lookup(l.bit_buf) { |
| l.counter = symbol <span class="kw">as </span>u32; |
| l.bit_buf >>= code_len; |
| l.num_bits -= code_len; |
| |
| <span class="kw">if </span>(l.counter & <span class="number">256</span>) != <span class="number">0 </span>{ |
| <span class="comment">// The symbol is not a literal. |
| </span><span class="kw">break</span>; |
| } <span class="kw">else </span>{ |
| <span class="comment">// If we have a 32-bit buffer we need to read another two bytes now |
| // to have enough bits to keep going. |
| </span><span class="kw">if </span><span class="macro">cfg!</span>(not(target_pointer_width = <span class="string">"64"</span>)) { |
| fill_bit_buffer(<span class="kw-2">&mut </span>l, in_iter); |
| } |
| |
| <span class="kw">if let </span><span class="prelude-val">Some</span>((symbol, code_len)) = r.tables[LITLEN_TABLE].lookup(l.bit_buf) { |
| l.bit_buf >>= code_len; |
| l.num_bits -= code_len; |
| <span class="comment">// The previous symbol was a literal, so write it directly and check |
| // the next one. |
| </span>out_buf.write_byte(l.counter <span class="kw">as </span>u8); |
| <span class="kw">if </span>(symbol & <span class="number">256</span>) != <span class="number">0 </span>{ |
| l.counter = symbol <span class="kw">as </span>u32; |
| <span class="comment">// The symbol is a length value. |
| </span><span class="kw">break</span>; |
| } <span class="kw">else </span>{ |
| <span class="comment">// The symbol is a literal, so write it directly and continue. |
| </span>out_buf.write_byte(symbol <span class="kw">as </span>u8); |
| } |
| } <span class="kw">else </span>{ |
| state.begin(InvalidCodeLen); |
| <span class="kw">break </span><span class="lifetime">'o </span>TINFLStatus::Failed; |
| } |
| } |
| } <span class="kw">else </span>{ |
| state.begin(InvalidCodeLen); |
| <span class="kw">break </span><span class="lifetime">'o </span>TINFLStatus::Failed; |
| } |
| } |
| |
| <span class="comment">// Mask the top bits since they may contain length info. |
| </span>l.counter &= <span class="number">511</span>; |
| <span class="kw">if </span>l.counter == <span class="number">256 </span>{ |
| <span class="comment">// We hit the end of block symbol. |
| </span>state.begin(BlockDone); |
| <span class="kw">break </span><span class="lifetime">'o </span>TINFLStatus::Done; |
| } <span class="kw">else if </span>l.counter > <span class="number">285 </span>{ |
| <span class="comment">// Invalid code. |
| // We already verified earlier that the code is > 256. |
| </span>state.begin(InvalidLitlen); |
| <span class="kw">break </span><span class="lifetime">'o </span>TINFLStatus::Failed; |
| } <span class="kw">else </span>{ |
| <span class="comment">// The symbol was a length code. |
| // # Optimization |
| // Mask the value to avoid bounds checks |
| // We could use get_unchecked later if can statically verify that |
| // this will never go out of bounds. |
| </span>l.num_extra = u32::from(LENGTH_EXTRA[(l.counter - <span class="number">257</span>) <span class="kw">as </span>usize & BASE_EXTRA_MASK]); |
| l.counter = u32::from(LENGTH_BASE[(l.counter - <span class="number">257</span>) <span class="kw">as </span>usize & BASE_EXTRA_MASK]); |
| <span class="comment">// Length and distance codes have a number of extra bits depending on |
| // the base, which together with the base gives us the exact value. |
| |
| </span>fill_bit_buffer(<span class="kw-2">&mut </span>l, in_iter); |
| <span class="kw">if </span>l.num_extra != <span class="number">0 </span>{ |
| <span class="kw">let </span>extra_bits = l.bit_buf & ((<span class="number">1 </span><< l.num_extra) - <span class="number">1</span>); |
| l.bit_buf >>= l.num_extra; |
| l.num_bits -= l.num_extra; |
| l.counter += extra_bits <span class="kw">as </span>u32; |
| } |
| |
| <span class="comment">// We found a length code, so a distance code should follow. |
| |
| </span><span class="kw">if </span><span class="macro">cfg!</span>(not(target_pointer_width = <span class="string">"64"</span>)) { |
| fill_bit_buffer(<span class="kw-2">&mut </span>l, in_iter); |
| } |
| |
| <span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw-2">mut </span>symbol, code_len)) = r.tables[DIST_TABLE].lookup(l.bit_buf) { |
| symbol &= <span class="number">511</span>; |
| l.bit_buf >>= code_len; |
| l.num_bits -= code_len; |
| <span class="kw">if </span>symbol > <span class="number">29 </span>{ |
| state.begin(InvalidDist); |
| <span class="kw">break </span><span class="lifetime">'o </span>TINFLStatus::Failed; |
| } |
| |
| l.num_extra = u32::from(DIST_EXTRA[symbol <span class="kw">as </span>usize]); |
| l.dist = u32::from(DIST_BASE[symbol <span class="kw">as </span>usize]); |
| } <span class="kw">else </span>{ |
| state.begin(InvalidCodeLen); |
| <span class="kw">break </span><span class="lifetime">'o </span>TINFLStatus::Failed; |
| } |
| |
| <span class="kw">if </span>l.num_extra != <span class="number">0 </span>{ |
| fill_bit_buffer(<span class="kw-2">&mut </span>l, in_iter); |
| <span class="kw">let </span>extra_bits = l.bit_buf & ((<span class="number">1 </span><< l.num_extra) - <span class="number">1</span>); |
| l.bit_buf >>= l.num_extra; |
| l.num_bits -= l.num_extra; |
| l.dist += extra_bits <span class="kw">as </span>u32; |
| } |
| |
| <span class="kw">let </span>position = out_buf.position(); |
| <span class="kw">if </span>l.dist <span class="kw">as </span>usize > out_buf.position() |
| && (flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF != <span class="number">0</span>) |
| { |
| <span class="comment">// We encountered a distance that refers a position before |
| // the start of the decoded data, so we can't continue. |
| </span>state.begin(DistanceOutOfBounds); |
| <span class="kw">break </span>TINFLStatus::Failed; |
| } |
| |
| apply_match( |
| out_buf.get_mut(), |
| position, |
| l.dist <span class="kw">as </span>usize, |
| l.counter <span class="kw">as </span>usize, |
| out_buf_size_mask, |
| ); |
| |
| out_buf.set_position(position + l.counter <span class="kw">as </span>usize); |
| } |
| }; |
| |
| <span class="kw-2">*</span>local_vars = l; |
| (status, state) |
| } |
| |
| <span class="doccomment">/// Main decompression function. Keeps decompressing data from `in_buf` until the `in_buf` is |
| /// empty, `out` is full, the end of the deflate stream is hit, or there is an error in the |
| /// deflate stream. |
| /// |
| /// # Arguments |
| /// |
| /// `r` is a [`DecompressorOxide`] struct with the state of this stream. |
| /// |
| /// `in_buf` is a reference to the compressed data that is to be decompressed. The decompressor will |
| /// start at the first byte of this buffer. |
| /// |
| /// `out` is a reference to the buffer that will store the decompressed data, and that |
| /// stores previously decompressed data if any. |
| /// |
| /// * The offset given by `out_pos` indicates where in the output buffer slice writing should start. |
| /// * If [`TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF`] is not set, the output buffer is used in a |
| /// wrapping manner, and it's size is required to be a power of 2. |
| /// * The decompression function normally needs access to 32KiB of the previously decompressed data |
| ///(or to the beginning of the decompressed data if less than 32KiB has been decompressed.) |
| /// - If this data is not available, decompression may fail. |
| /// - Some deflate compressors allow specifying a window size which limits match distances to |
| /// less than this, or alternatively an RLE mode where matches will only refer to the previous byte |
| /// and thus allows a smaller output buffer. The window size can be specified in the zlib |
| /// header structure, however, the header data should not be relied on to be correct. |
| /// |
| /// `flags` indicates settings and status to the decompression function. |
| /// * The [`TINFL_FLAG_HAS_MORE_INPUT`] has to be specified if more compressed data is to be provided |
| /// in a subsequent call to this function. |
| /// * See the the [`inflate_flags`] module for details on other flags. |
| /// |
| /// # Returns |
| /// |
| /// Returns a tuple containing the status of the compressor, the number of input bytes read, and the |
| /// number of bytes output to `out`. |
| /// |
| /// This function shouldn't panic pending any bugs. |
| </span><span class="kw">pub fn </span>decompress( |
| r: <span class="kw-2">&mut </span>DecompressorOxide, |
| in_buf: <span class="kw-2">&</span>[u8], |
| out: <span class="kw-2">&mut </span>[u8], |
| out_pos: usize, |
| flags: u32, |
| ) -> (TINFLStatus, usize, usize) { |
| <span class="kw">let </span>out_buf_size_mask = <span class="kw">if </span>flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF != <span class="number">0 </span>{ |
| usize::max_value() |
| } <span class="kw">else </span>{ |
| <span class="comment">// In the case of zero len, any attempt to write would produce HasMoreOutput, |
| // so to gracefully process the case of there really being no output, |
| // set the mask to all zeros. |
| </span>out.len().saturating_sub(<span class="number">1</span>) |
| }; |
| |
| <span class="comment">// Ensure the output buffer's size is a power of 2, unless the output buffer |
| // is large enough to hold the entire output file (in which case it doesn't |
| // matter). |
| // Also make sure that the output buffer position is not past the end of the output buffer. |
| </span><span class="kw">if </span>(out_buf_size_mask.wrapping_add(<span class="number">1</span>) & out_buf_size_mask) != <span class="number">0 </span>|| out_pos > out.len() { |
| <span class="kw">return </span>(TINFLStatus::BadParam, <span class="number">0</span>, <span class="number">0</span>); |
| } |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>in_iter = in_buf.iter(); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>state = r.state; |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>out_buf = OutputBuffer::from_slice_and_pos(out, out_pos); |
| |
| <span class="comment">// Make a local copy of the important variables here so we can work with them on the stack. |
| </span><span class="kw">let </span><span class="kw-2">mut </span>l = LocalVars { |
| bit_buf: r.bit_buf, |
| num_bits: r.num_bits, |
| dist: r.dist, |
| counter: r.counter, |
| num_extra: r.num_extra, |
| }; |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>status = <span class="lifetime">'state_machine</span>: <span class="kw">loop </span>{ |
| <span class="kw">match </span>state { |
| Start => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| l.bit_buf = <span class="number">0</span>; |
| l.num_bits = <span class="number">0</span>; |
| l.dist = <span class="number">0</span>; |
| l.counter = <span class="number">0</span>; |
| l.num_extra = <span class="number">0</span>; |
| r.z_header0 = <span class="number">0</span>; |
| r.z_header1 = <span class="number">0</span>; |
| r.z_adler32 = <span class="number">1</span>; |
| r.check_adler32 = <span class="number">1</span>; |
| <span class="kw">if </span>flags & TINFL_FLAG_PARSE_ZLIB_HEADER != <span class="number">0 </span>{ |
| Action::Jump(State::ReadZlibCmf) |
| } <span class="kw">else </span>{ |
| Action::Jump(State::ReadBlockHeader) |
| } |
| }), |
| |
| ReadZlibCmf => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| read_byte(<span class="kw-2">&mut </span>in_iter, flags, |cmf| { |
| r.z_header0 = u32::from(cmf); |
| Action::Jump(State::ReadZlibFlg) |
| }) |
| }), |
| |
| ReadZlibFlg => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| read_byte(<span class="kw-2">&mut </span>in_iter, flags, |flg| { |
| r.z_header1 = u32::from(flg); |
| validate_zlib_header(r.z_header0, r.z_header1, flags, out_buf_size_mask) |
| }) |
| }), |
| |
| <span class="comment">// Read the block header and jump to the relevant section depending on the block type. |
| </span>ReadBlockHeader => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| read_bits(<span class="kw-2">&mut </span>l, <span class="number">3</span>, <span class="kw-2">&mut </span>in_iter, flags, |l, bits| { |
| r.finish = (bits & <span class="number">1</span>) <span class="kw">as </span>u32; |
| r.block_type = (bits >> <span class="number">1</span>) <span class="kw">as </span>u32 & <span class="number">3</span>; |
| <span class="kw">match </span>r.block_type { |
| <span class="number">0 </span>=> Action::Jump(BlockTypeNoCompression), |
| <span class="number">1 </span>=> { |
| start_static_table(r); |
| init_tree(r, l) |
| }, |
| <span class="number">2 </span>=> { |
| l.counter = <span class="number">0</span>; |
| Action::Jump(ReadTableSizes) |
| }, |
| <span class="number">3 </span>=> Action::Jump(BlockTypeUnexpected), |
| <span class="kw">_ </span>=> <span class="macro">unreachable!</span>() |
| } |
| }) |
| }), |
| |
| <span class="comment">// Raw/Stored/uncompressed block. |
| </span>BlockTypeNoCompression => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| pad_to_bytes(<span class="kw-2">&mut </span>l, <span class="kw-2">&mut </span>in_iter, flags, |l| { |
| l.counter = <span class="number">0</span>; |
| Action::Jump(RawHeader) |
| }) |
| }), |
| |
| <span class="comment">// Check that the raw block header is correct. |
| </span>RawHeader => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.counter < <span class="number">4 </span>{ |
| <span class="comment">// Read block length and block length check. |
| </span><span class="kw">if </span>l.num_bits != <span class="number">0 </span>{ |
| read_bits(<span class="kw-2">&mut </span>l, <span class="number">8</span>, <span class="kw-2">&mut </span>in_iter, flags, |l, bits| { |
| r.raw_header[l.counter <span class="kw">as </span>usize] = bits <span class="kw">as </span>u8; |
| l.counter += <span class="number">1</span>; |
| Action::None |
| }) |
| } <span class="kw">else </span>{ |
| read_byte(<span class="kw-2">&mut </span>in_iter, flags, |byte| { |
| r.raw_header[l.counter <span class="kw">as </span>usize] = byte; |
| l.counter += <span class="number">1</span>; |
| Action::None |
| }) |
| } |
| } <span class="kw">else </span>{ |
| <span class="comment">// Check if the length value of a raw block is correct. |
| // The 2 first (2-byte) words in a raw header are the length and the |
| // ones complement of the length. |
| </span><span class="kw">let </span>length = u16::from(r.raw_header[<span class="number">0</span>]) | (u16::from(r.raw_header[<span class="number">1</span>]) << <span class="number">8</span>); |
| <span class="kw">let </span>check = u16::from(r.raw_header[<span class="number">2</span>]) | (u16::from(r.raw_header[<span class="number">3</span>]) << <span class="number">8</span>); |
| <span class="kw">let </span>valid = length == !check; |
| l.counter = length.into(); |
| |
| <span class="kw">if </span>!valid { |
| Action::Jump(BadRawLength) |
| } <span class="kw">else if </span>l.counter == <span class="number">0 </span>{ |
| <span class="comment">// Empty raw block. Sometimes used for synchronization. |
| </span>Action::Jump(BlockDone) |
| } <span class="kw">else if </span>l.num_bits != <span class="number">0 </span>{ |
| <span class="comment">// There is some data in the bit buffer, so we need to write that first. |
| </span>Action::Jump(RawReadFirstByte) |
| } <span class="kw">else </span>{ |
| <span class="comment">// The bit buffer is empty, so memcpy the rest of the uncompressed data from |
| // the block. |
| </span>Action::Jump(RawMemcpy1) |
| } |
| } |
| }), |
| |
| <span class="comment">// Read the byte from the bit buffer. |
| </span>RawReadFirstByte => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| read_bits(<span class="kw-2">&mut </span>l, <span class="number">8</span>, <span class="kw-2">&mut </span>in_iter, flags, |l, bits| { |
| l.dist = bits <span class="kw">as </span>u32; |
| Action::Jump(RawStoreFirstByte) |
| }) |
| }), |
| |
| <span class="comment">// Write the byte we just read to the output buffer. |
| </span>RawStoreFirstByte => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>out_buf.bytes_left() == <span class="number">0 </span>{ |
| Action::End(TINFLStatus::HasMoreOutput) |
| } <span class="kw">else </span>{ |
| out_buf.write_byte(l.dist <span class="kw">as </span>u8); |
| l.counter -= <span class="number">1</span>; |
| <span class="kw">if </span>l.counter == <span class="number">0 </span>|| l.num_bits == <span class="number">0 </span>{ |
| Action::Jump(RawMemcpy1) |
| } <span class="kw">else </span>{ |
| <span class="comment">// There is still some data left in the bit buffer that needs to be output. |
| // TODO: Changed this to jump to `RawReadfirstbyte` rather than |
| // `RawStoreFirstByte` as that seemed to be the correct path, but this |
| // needs testing. |
| </span>Action::Jump(RawReadFirstByte) |
| } |
| } |
| }), |
| |
| RawMemcpy1 => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.counter == <span class="number">0 </span>{ |
| Action::Jump(BlockDone) |
| } <span class="kw">else if </span>out_buf.bytes_left() == <span class="number">0 </span>{ |
| Action::End(TINFLStatus::HasMoreOutput) |
| } <span class="kw">else </span>{ |
| Action::Jump(RawMemcpy2) |
| } |
| }), |
| |
| RawMemcpy2 => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>in_iter.len() > <span class="number">0 </span>{ |
| <span class="comment">// Copy as many raw bytes as possible from the input to the output using memcpy. |
| // Raw block lengths are limited to 64 * 1024, so casting through usize and u32 |
| // is not an issue. |
| </span><span class="kw">let </span>space_left = out_buf.bytes_left(); |
| <span class="kw">let </span>bytes_to_copy = cmp::min(cmp::min( |
| space_left, |
| in_iter.len()), |
| l.counter <span class="kw">as </span>usize |
| ); |
| |
| out_buf.write_slice(<span class="kw-2">&</span>in_iter.as_slice()[..bytes_to_copy]); |
| |
| (<span class="kw-2">&mut </span>in_iter).nth(bytes_to_copy - <span class="number">1</span>); |
| l.counter -= bytes_to_copy <span class="kw">as </span>u32; |
| Action::Jump(RawMemcpy1) |
| } <span class="kw">else </span>{ |
| end_of_input(flags) |
| } |
| }), |
| |
| <span class="comment">// Read how many huffman codes/symbols are used for each table. |
| </span>ReadTableSizes => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.counter < <span class="number">3 </span>{ |
| <span class="kw">let </span>num_bits = [<span class="number">5</span>, <span class="number">5</span>, <span class="number">4</span>][l.counter <span class="kw">as </span>usize]; |
| read_bits(<span class="kw-2">&mut </span>l, num_bits, <span class="kw-2">&mut </span>in_iter, flags, |l, bits| { |
| r.table_sizes[l.counter <span class="kw">as </span>usize] = |
| bits <span class="kw">as </span>u32 + u32::from(MIN_TABLE_SIZES[l.counter <span class="kw">as </span>usize]); |
| l.counter += <span class="number">1</span>; |
| Action::None |
| }) |
| } <span class="kw">else </span>{ |
| memset(<span class="kw-2">&mut </span>r.tables[HUFFLEN_TABLE].code_size[..], <span class="number">0</span>); |
| l.counter = <span class="number">0</span>; |
| <span class="comment">// Check that the litlen and distance are within spec. |
| // litlen table should be <=286 acc to the RFC and |
| // additionally zlib rejects dist table sizes larger than 30. |
| // NOTE this the final sizes after adding back predefined values, not |
| // raw value in the data. |
| // See miniz_oxide issue #130 and https://github.com/madler/zlib/issues/82. |
| </span><span class="kw">if </span>r.table_sizes[LITLEN_TABLE] <= <span class="number">286 </span>&& r.table_sizes[DIST_TABLE] <= <span class="number">30 </span>{ |
| Action::Jump(ReadHufflenTableCodeSize) |
| } |
| <span class="kw">else </span>{ |
| Action::Jump(BadDistOrLiteralTableLength) |
| } |
| } |
| }), |
| |
| <span class="comment">// Read the 3-bit lengths of the huffman codes describing the huffman code lengths used |
| // to decode the lengths of the main tables. |
| </span>ReadHufflenTableCodeSize => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.counter < r.table_sizes[HUFFLEN_TABLE] { |
| read_bits(<span class="kw-2">&mut </span>l, <span class="number">3</span>, <span class="kw-2">&mut </span>in_iter, flags, |l, bits| { |
| <span class="comment">// These lengths are not stored in a normal ascending order, but rather one |
| // specified by the deflate specification intended to put the most used |
| // values at the front as trailing zero lengths do not have to be stored. |
| </span>r.tables[HUFFLEN_TABLE] |
| .code_size[HUFFMAN_LENGTH_ORDER[l.counter <span class="kw">as </span>usize] <span class="kw">as </span>usize] = |
| bits <span class="kw">as </span>u8; |
| l.counter += <span class="number">1</span>; |
| Action::None |
| }) |
| } <span class="kw">else </span>{ |
| r.table_sizes[HUFFLEN_TABLE] = <span class="number">19</span>; |
| init_tree(r, <span class="kw-2">&mut </span>l) |
| } |
| }), |
| |
| ReadLitlenDistTablesCodeSize => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.counter < r.table_sizes[LITLEN_TABLE] + r.table_sizes[DIST_TABLE] { |
| decode_huffman_code( |
| r, <span class="kw-2">&mut </span>l, HUFFLEN_TABLE, |
| flags, <span class="kw-2">&mut </span>in_iter, |r, l, symbol| { |
| l.dist = symbol <span class="kw">as </span>u32; |
| <span class="kw">if </span>l.dist < <span class="number">16 </span>{ |
| r.len_codes[l.counter <span class="kw">as </span>usize] = l.dist <span class="kw">as </span>u8; |
| l.counter += <span class="number">1</span>; |
| Action::None |
| } <span class="kw">else if </span>l.dist == <span class="number">16 </span>&& l.counter == <span class="number">0 </span>{ |
| Action::Jump(BadCodeSizeDistPrevLookup) |
| } <span class="kw">else </span>{ |
| l.num_extra = [<span class="number">2</span>, <span class="number">3</span>, <span class="number">7</span>][l.dist <span class="kw">as </span>usize - <span class="number">16</span>]; |
| Action::Jump(ReadExtraBitsCodeSize) |
| } |
| } |
| ) |
| } <span class="kw">else if </span>l.counter != r.table_sizes[LITLEN_TABLE] + r.table_sizes[DIST_TABLE] { |
| Action::Jump(BadCodeSizeSum) |
| } <span class="kw">else </span>{ |
| r.tables[LITLEN_TABLE].code_size[..r.table_sizes[LITLEN_TABLE] <span class="kw">as </span>usize] |
| .copy_from_slice(<span class="kw-2">&</span>r.len_codes[..r.table_sizes[LITLEN_TABLE] <span class="kw">as </span>usize]); |
| |
| <span class="kw">let </span>dist_table_start = r.table_sizes[LITLEN_TABLE] <span class="kw">as </span>usize; |
| <span class="kw">let </span>dist_table_end = (r.table_sizes[LITLEN_TABLE] + |
| r.table_sizes[DIST_TABLE]) <span class="kw">as </span>usize; |
| r.tables[DIST_TABLE].code_size[..r.table_sizes[DIST_TABLE] <span class="kw">as </span>usize] |
| .copy_from_slice(<span class="kw-2">&</span>r.len_codes[dist_table_start..dist_table_end]); |
| |
| r.block_type -= <span class="number">1</span>; |
| init_tree(r, <span class="kw-2">&mut </span>l) |
| } |
| }), |
| |
| ReadExtraBitsCodeSize => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">let </span>num_extra = l.num_extra; |
| read_bits(<span class="kw-2">&mut </span>l, num_extra, <span class="kw-2">&mut </span>in_iter, flags, |l, <span class="kw-2">mut </span>extra_bits| { |
| <span class="comment">// Mask to avoid a bounds check. |
| </span>extra_bits += [<span class="number">3</span>, <span class="number">3</span>, <span class="number">11</span>][(l.dist <span class="kw">as </span>usize - <span class="number">16</span>) & <span class="number">3</span>]; |
| <span class="kw">let </span>val = <span class="kw">if </span>l.dist == <span class="number">16 </span>{ |
| r.len_codes[l.counter <span class="kw">as </span>usize - <span class="number">1</span>] |
| } <span class="kw">else </span>{ |
| <span class="number">0 |
| </span>}; |
| |
| memset( |
| <span class="kw-2">&mut </span>r.len_codes[ |
| l.counter <span class="kw">as </span>usize..l.counter <span class="kw">as </span>usize + extra_bits <span class="kw">as </span>usize |
| ], |
| val, |
| ); |
| l.counter += extra_bits <span class="kw">as </span>u32; |
| Action::Jump(ReadLitlenDistTablesCodeSize) |
| }) |
| }), |
| |
| DecodeLitlen => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>in_iter.len() < <span class="number">4 </span>|| out_buf.bytes_left() < <span class="number">2 </span>{ |
| <span class="comment">// See if we can decode a literal with the data we have left. |
| // Jumps to next state (WriteSymbol) if successful. |
| </span>decode_huffman_code( |
| r, |
| <span class="kw-2">&mut </span>l, |
| LITLEN_TABLE, |
| flags, |
| <span class="kw-2">&mut </span>in_iter, |
| |_r, l, symbol| { |
| l.counter = symbol <span class="kw">as </span>u32; |
| Action::Jump(WriteSymbol) |
| }, |
| ) |
| } <span class="kw">else if |
| </span><span class="comment">// If there is enough space, use the fast inner decompression |
| // function. |
| </span>out_buf.bytes_left() >= <span class="number">259 </span>&& |
| in_iter.len() >= <span class="number">14 |
| </span>{ |
| <span class="kw">let </span>(status, new_state) = decompress_fast( |
| r, |
| <span class="kw-2">&mut </span>in_iter, |
| <span class="kw-2">&mut </span>out_buf, |
| flags, |
| <span class="kw-2">&mut </span>l, |
| out_buf_size_mask, |
| ); |
| |
| state = new_state; |
| <span class="kw">if </span>status == TINFLStatus::Done { |
| Action::Jump(new_state) |
| } <span class="kw">else </span>{ |
| Action::End(status) |
| } |
| } <span class="kw">else </span>{ |
| fill_bit_buffer(<span class="kw-2">&mut </span>l, <span class="kw-2">&mut </span>in_iter); |
| |
| <span class="kw">if let </span><span class="prelude-val">Some</span>((symbol, code_len)) = r.tables[LITLEN_TABLE].lookup(l.bit_buf) { |
| |
| l.counter = symbol <span class="kw">as </span>u32; |
| l.bit_buf >>= code_len; |
| l.num_bits -= code_len; |
| |
| <span class="kw">if </span>(l.counter & <span class="number">256</span>) != <span class="number">0 </span>{ |
| <span class="comment">// The symbol is not a literal. |
| </span>Action::Jump(HuffDecodeOuterLoop1) |
| } <span class="kw">else </span>{ |
| <span class="comment">// If we have a 32-bit buffer we need to read another two bytes now |
| // to have enough bits to keep going. |
| </span><span class="kw">if </span><span class="macro">cfg!</span>(not(target_pointer_width = <span class="string">"64"</span>)) { |
| fill_bit_buffer(<span class="kw-2">&mut </span>l, <span class="kw-2">&mut </span>in_iter); |
| } |
| |
| <span class="kw">if let </span><span class="prelude-val">Some</span>((symbol, code_len)) = r.tables[LITLEN_TABLE].lookup(l.bit_buf) { |
| |
| l.bit_buf >>= code_len; |
| l.num_bits -= code_len; |
| <span class="comment">// The previous symbol was a literal, so write it directly and check |
| // the next one. |
| </span>out_buf.write_byte(l.counter <span class="kw">as </span>u8); |
| <span class="kw">if </span>(symbol & <span class="number">256</span>) != <span class="number">0 </span>{ |
| l.counter = symbol <span class="kw">as </span>u32; |
| <span class="comment">// The symbol is a length value. |
| </span>Action::Jump(HuffDecodeOuterLoop1) |
| } <span class="kw">else </span>{ |
| <span class="comment">// The symbol is a literal, so write it directly and continue. |
| </span>out_buf.write_byte(symbol <span class="kw">as </span>u8); |
| Action::None |
| } |
| } <span class="kw">else </span>{ |
| Action::Jump(InvalidCodeLen) |
| } |
| } |
| } <span class="kw">else </span>{ |
| Action::Jump(InvalidCodeLen) |
| } |
| } |
| }), |
| |
| WriteSymbol => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.counter >= <span class="number">256 </span>{ |
| Action::Jump(HuffDecodeOuterLoop1) |
| } <span class="kw">else if </span>out_buf.bytes_left() > <span class="number">0 </span>{ |
| out_buf.write_byte(l.counter <span class="kw">as </span>u8); |
| Action::Jump(DecodeLitlen) |
| } <span class="kw">else </span>{ |
| Action::End(TINFLStatus::HasMoreOutput) |
| } |
| }), |
| |
| HuffDecodeOuterLoop1 => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="comment">// Mask the top bits since they may contain length info. |
| </span>l.counter &= <span class="number">511</span>; |
| |
| <span class="kw">if </span>l.counter |
| == <span class="number">256 </span>{ |
| <span class="comment">// We hit the end of block symbol. |
| </span>Action::Jump(BlockDone) |
| } <span class="kw">else if </span>l.counter > <span class="number">285 </span>{ |
| <span class="comment">// Invalid code. |
| // We already verified earlier that the code is > 256. |
| </span>Action::Jump(InvalidLitlen) |
| } <span class="kw">else </span>{ |
| <span class="comment">// # Optimization |
| // Mask the value to avoid bounds checks |
| // We could use get_unchecked later if can statically verify that |
| // this will never go out of bounds. |
| </span>l.num_extra = |
| u32::from(LENGTH_EXTRA[(l.counter - <span class="number">257</span>) <span class="kw">as </span>usize & BASE_EXTRA_MASK]); |
| l.counter = u32::from(LENGTH_BASE[(l.counter - <span class="number">257</span>) <span class="kw">as </span>usize & BASE_EXTRA_MASK]); |
| <span class="comment">// Length and distance codes have a number of extra bits depending on |
| // the base, which together with the base gives us the exact value. |
| </span><span class="kw">if </span>l.num_extra != <span class="number">0 </span>{ |
| Action::Jump(ReadExtraBitsLitlen) |
| } <span class="kw">else </span>{ |
| Action::Jump(DecodeDistance) |
| } |
| } |
| }), |
| |
| ReadExtraBitsLitlen => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">let </span>num_extra = l.num_extra; |
| read_bits(<span class="kw-2">&mut </span>l, num_extra, <span class="kw-2">&mut </span>in_iter, flags, |l, extra_bits| { |
| l.counter += extra_bits <span class="kw">as </span>u32; |
| Action::Jump(DecodeDistance) |
| }) |
| }), |
| |
| DecodeDistance => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="comment">// Try to read a huffman code from the input buffer and look up what |
| // length code the decoded symbol refers to. |
| </span>decode_huffman_code(r, <span class="kw-2">&mut </span>l, DIST_TABLE, flags, <span class="kw-2">&mut </span>in_iter, |_r, l, symbol| { |
| <span class="kw">if </span>symbol > <span class="number">29 </span>{ |
| <span class="comment">// Invalid distance code. |
| </span><span class="kw">return </span>Action::Jump(InvalidDist) |
| } |
| <span class="comment">// # Optimization |
| // Mask the value to avoid bounds checks |
| // We could use get_unchecked later if can statically verify that |
| // this will never go out of bounds. |
| </span>l.num_extra = u32::from(DIST_EXTRA[symbol <span class="kw">as </span>usize & BASE_EXTRA_MASK]); |
| l.dist = u32::from(DIST_BASE[symbol <span class="kw">as </span>usize & BASE_EXTRA_MASK]); |
| <span class="kw">if </span>l.num_extra != <span class="number">0 </span>{ |
| <span class="comment">// ReadEXTRA_BITS_DISTACNE |
| </span>Action::Jump(ReadExtraBitsDistance) |
| } <span class="kw">else </span>{ |
| Action::Jump(HuffDecodeOuterLoop2) |
| } |
| }) |
| }), |
| |
| ReadExtraBitsDistance => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">let </span>num_extra = l.num_extra; |
| read_bits(<span class="kw-2">&mut </span>l, num_extra, <span class="kw-2">&mut </span>in_iter, flags, |l, extra_bits| { |
| l.dist += extra_bits <span class="kw">as </span>u32; |
| Action::Jump(HuffDecodeOuterLoop2) |
| }) |
| }), |
| |
| HuffDecodeOuterLoop2 => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.dist <span class="kw">as </span>usize > out_buf.position() && |
| (flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF != <span class="number">0</span>) |
| { |
| <span class="comment">// We encountered a distance that refers a position before |
| // the start of the decoded data, so we can't continue. |
| </span>Action::Jump(DistanceOutOfBounds) |
| } <span class="kw">else </span>{ |
| <span class="kw">let </span>out_pos = out_buf.position(); |
| <span class="kw">let </span>source_pos = out_buf.position() |
| .wrapping_sub(l.dist <span class="kw">as </span>usize) & out_buf_size_mask; |
| |
| <span class="kw">let </span>out_len = out_buf.get_ref().len() <span class="kw">as </span>usize; |
| <span class="kw">let </span>match_end_pos = out_buf.position() + l.counter <span class="kw">as </span>usize; |
| |
| <span class="kw">if </span>match_end_pos > out_len || |
| <span class="comment">// miniz doesn't do this check here. Not sure how it makes sure |
| // that this case doesn't happen. |
| </span>(source_pos >= out_pos && (source_pos - out_pos) < l.counter <span class="kw">as </span>usize) |
| { |
| <span class="comment">// Not enough space for all of the data in the output buffer, |
| // so copy what we have space for. |
| </span><span class="kw">if </span>l.counter == <span class="number">0 </span>{ |
| Action::Jump(DecodeLitlen) |
| } <span class="kw">else </span>{ |
| Action::Jump(WriteLenBytesToEnd) |
| } |
| } <span class="kw">else </span>{ |
| apply_match( |
| out_buf.get_mut(), |
| out_pos, |
| l.dist <span class="kw">as </span>usize, |
| l.counter <span class="kw">as </span>usize, |
| out_buf_size_mask |
| ); |
| out_buf.set_position(out_pos + l.counter <span class="kw">as </span>usize); |
| Action::Jump(DecodeLitlen) |
| } |
| } |
| }), |
| |
| WriteLenBytesToEnd => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>out_buf.bytes_left() > <span class="number">0 </span>{ |
| <span class="kw">let </span>out_pos = out_buf.position(); |
| <span class="kw">let </span>source_pos = out_buf.position() |
| .wrapping_sub(l.dist <span class="kw">as </span>usize) & out_buf_size_mask; |
| |
| |
| <span class="kw">let </span>len = cmp::min(out_buf.bytes_left(), l.counter <span class="kw">as </span>usize); |
| |
| transfer(out_buf.get_mut(), source_pos, out_pos, len, out_buf_size_mask); |
| |
| out_buf.set_position(out_pos + len); |
| l.counter -= len <span class="kw">as </span>u32; |
| <span class="kw">if </span>l.counter == <span class="number">0 </span>{ |
| Action::Jump(DecodeLitlen) |
| } <span class="kw">else </span>{ |
| Action::None |
| } |
| } <span class="kw">else </span>{ |
| Action::End(TINFLStatus::HasMoreOutput) |
| } |
| }), |
| |
| BlockDone => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="comment">// End once we've read the last block. |
| </span><span class="kw">if </span>r.finish != <span class="number">0 </span>{ |
| pad_to_bytes(<span class="kw-2">&mut </span>l, <span class="kw-2">&mut </span>in_iter, flags, |<span class="kw">_</span>| Action::None); |
| |
| <span class="kw">let </span>in_consumed = in_buf.len() - in_iter.len(); |
| <span class="kw">let </span>undo = undo_bytes(<span class="kw-2">&mut </span>l, in_consumed <span class="kw">as </span>u32) <span class="kw">as </span>usize; |
| in_iter = in_buf[in_consumed - undo..].iter(); |
| |
| l.bit_buf &= ((<span class="number">1 </span><span class="kw">as </span>BitBuffer) << l.num_bits) - <span class="number">1</span>; |
| <span class="macro">debug_assert_eq!</span>(l.num_bits, <span class="number">0</span>); |
| |
| <span class="kw">if </span>flags & TINFL_FLAG_PARSE_ZLIB_HEADER != <span class="number">0 </span>{ |
| l.counter = <span class="number">0</span>; |
| Action::Jump(ReadAdler32) |
| } <span class="kw">else </span>{ |
| Action::Jump(DoneForever) |
| } |
| } <span class="kw">else </span>{ |
| Action::Jump(ReadBlockHeader) |
| } |
| }), |
| |
| ReadAdler32 => <span class="macro">generate_state!</span>(state, <span class="lifetime">'state_machine</span>, { |
| <span class="kw">if </span>l.counter < <span class="number">4 </span>{ |
| <span class="kw">if </span>l.num_bits != <span class="number">0 </span>{ |
| read_bits(<span class="kw-2">&mut </span>l, <span class="number">8</span>, <span class="kw-2">&mut </span>in_iter, flags, |l, bits| { |
| r.z_adler32 <<= <span class="number">8</span>; |
| r.z_adler32 |= bits <span class="kw">as </span>u32; |
| l.counter += <span class="number">1</span>; |
| Action::None |
| }) |
| } <span class="kw">else </span>{ |
| read_byte(<span class="kw-2">&mut </span>in_iter, flags, |byte| { |
| r.z_adler32 <<= <span class="number">8</span>; |
| r.z_adler32 |= u32::from(byte); |
| l.counter += <span class="number">1</span>; |
| Action::None |
| }) |
| } |
| } <span class="kw">else </span>{ |
| Action::Jump(DoneForever) |
| } |
| }), |
| |
| <span class="comment">// We are done. |
| </span>DoneForever => <span class="kw">break </span>TINFLStatus::Done, |
| |
| <span class="comment">// Anything else indicates failure. |
| // BadZlibHeader | BadRawLength | BadDistOrLiteralTableLength | BlockTypeUnexpected | |
| // DistanceOutOfBounds | |
| // BadTotalSymbols | BadCodeSizeDistPrevLookup | BadCodeSizeSum | InvalidLitlen | |
| // InvalidDist | InvalidCodeLen |
| </span><span class="kw">_ </span>=> <span class="kw">break </span>TINFLStatus::Failed, |
| }; |
| }; |
| |
| <span class="kw">let </span>in_undo = <span class="kw">if </span>status != TINFLStatus::NeedsMoreInput |
| && status != TINFLStatus::FailedCannotMakeProgress |
| { |
| undo_bytes(<span class="kw-2">&mut </span>l, (in_buf.len() - in_iter.len()) <span class="kw">as </span>u32) <span class="kw">as </span>usize |
| } <span class="kw">else </span>{ |
| <span class="number">0 |
| </span>}; |
| |
| <span class="comment">// Make sure HasMoreOutput overrides NeedsMoreInput if the output buffer is full. |
| // (Unless the missing input is the adler32 value in which case we don't need to write anything.) |
| // TODO: May want to see if we can do this in a better way. |
| </span><span class="kw">if </span>status == TINFLStatus::NeedsMoreInput |
| && out_buf.bytes_left() == <span class="number">0 |
| </span>&& state != State::ReadAdler32 |
| { |
| status = TINFLStatus::HasMoreOutput |
| } |
| |
| r.state = state; |
| r.bit_buf = l.bit_buf; |
| r.num_bits = l.num_bits; |
| r.dist = l.dist; |
| r.counter = l.counter; |
| r.num_extra = l.num_extra; |
| |
| r.bit_buf &= ((<span class="number">1 </span><span class="kw">as </span>BitBuffer) << r.num_bits) - <span class="number">1</span>; |
| |
| <span class="comment">// If this is a zlib stream, and update the adler32 checksum with the decompressed bytes if |
| // requested. |
| </span><span class="kw">let </span>need_adler = <span class="kw">if </span>(flags & TINFL_FLAG_IGNORE_ADLER32) == <span class="number">0 </span>{ |
| flags & (TINFL_FLAG_PARSE_ZLIB_HEADER | TINFL_FLAG_COMPUTE_ADLER32) != <span class="number">0 |
| </span>} <span class="kw">else </span>{ |
| <span class="comment">// If TINFL_FLAG_IGNORE_ADLER32 is enabled, ignore the checksum. |
| </span><span class="bool-val">false |
| </span>}; |
| <span class="kw">if </span>need_adler && status <span class="kw">as </span>i32 >= <span class="number">0 </span>{ |
| <span class="kw">let </span>out_buf_pos = out_buf.position(); |
| r.check_adler32 = update_adler32(r.check_adler32, <span class="kw-2">&</span>out_buf.get_ref()[out_pos..out_buf_pos]); |
| |
| <span class="comment">// disabled so that random input from fuzzer would not be rejected early, |
| // before it has a chance to reach interesting parts of code |
| </span><span class="kw">if </span>!<span class="macro">cfg!</span>(fuzzing) { |
| <span class="comment">// Once we are done, check if the checksum matches with the one provided in the zlib header. |
| </span><span class="kw">if </span>status == TINFLStatus::Done |
| && flags & TINFL_FLAG_PARSE_ZLIB_HEADER != <span class="number">0 |
| </span>&& r.check_adler32 != r.z_adler32 |
| { |
| status = TINFLStatus::Adler32Mismatch; |
| } |
| } |
| } |
| |
| ( |
| status, |
| in_buf.len() - in_iter.len() - in_undo, |
| out_buf.position() - out_pos, |
| ) |
| } |
| |
| <span class="attribute">#[cfg(test)] |
| </span><span class="kw">mod </span>test { |
| <span class="kw">use super</span>::<span class="kw-2">*</span>; |
| |
| <span class="comment">//TODO: Fix these. |
| |
| </span><span class="kw">fn </span>tinfl_decompress_oxide<<span class="lifetime">'i</span>>( |
| r: <span class="kw-2">&mut </span>DecompressorOxide, |
| input_buffer: <span class="kw-2">&</span><span class="lifetime">'i </span>[u8], |
| output_buffer: <span class="kw-2">&mut </span>[u8], |
| flags: u32, |
| ) -> (TINFLStatus, <span class="kw-2">&</span><span class="lifetime">'i </span>[u8], usize) { |
| <span class="kw">let </span>(status, in_pos, out_pos) = decompress(r, input_buffer, output_buffer, <span class="number">0</span>, flags); |
| (status, <span class="kw-2">&</span>input_buffer[in_pos..], out_pos) |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>decompress_zlib() { |
| <span class="kw">let </span>encoded = [ |
| <span class="number">120</span>, <span class="number">156</span>, <span class="number">243</span>, <span class="number">72</span>, <span class="number">205</span>, <span class="number">201</span>, <span class="number">201</span>, <span class="number">215</span>, <span class="number">81</span>, <span class="number">168</span>, <span class="number">202</span>, <span class="number">201</span>, <span class="number">76</span>, <span class="number">82</span>, <span class="number">4</span>, <span class="number">0</span>, <span class="number">27</span>, <span class="number">101</span>, <span class="number">4</span>, <span class="number">19</span>, |
| ]; |
| <span class="kw">let </span>flags = TINFL_FLAG_COMPUTE_ADLER32 | TINFL_FLAG_PARSE_ZLIB_HEADER; |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>b = DecompressorOxide::new(); |
| <span class="kw">const </span>LEN: usize = <span class="number">32</span>; |
| <span class="kw">let </span><span class="kw-2">mut </span>b_buf = <span class="macro">vec!</span>[<span class="number">0</span>; LEN]; |
| |
| <span class="comment">// This should fail with the out buffer being to small. |
| </span><span class="kw">let </span>b_status = tinfl_decompress_oxide(<span class="kw-2">&mut </span>b, <span class="kw-2">&</span>encoded[..], b_buf.as_mut_slice(), flags); |
| |
| <span class="macro">assert_eq!</span>(b_status.<span class="number">0</span>, TINFLStatus::Failed); |
| |
| <span class="kw">let </span>flags = flags | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF; |
| |
| b = DecompressorOxide::new(); |
| |
| <span class="comment">// With TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF set this should no longer fail. |
| </span><span class="kw">let </span>b_status = tinfl_decompress_oxide(<span class="kw-2">&mut </span>b, <span class="kw-2">&</span>encoded[..], b_buf.as_mut_slice(), flags); |
| |
| <span class="macro">assert_eq!</span>(b_buf[..b_status.<span class="number">2</span>], <span class="string">b"Hello, zlib!"</span>[..]); |
| <span class="macro">assert_eq!</span>(b_status.<span class="number">0</span>, TINFLStatus::Done); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>raw_block() { |
| <span class="kw">const </span>LEN: usize = <span class="number">64</span>; |
| |
| <span class="kw">let </span>text = <span class="string">b"Hello, zlib!"</span>; |
| <span class="kw">let </span>encoded = { |
| <span class="kw">let </span>len = text.len(); |
| <span class="kw">let </span>notlen = !len; |
| <span class="kw">let </span><span class="kw-2">mut </span>encoded = <span class="macro">vec!</span>[ |
| <span class="number">1</span>, |
| len <span class="kw">as </span>u8, |
| (len >> <span class="number">8</span>) <span class="kw">as </span>u8, |
| notlen <span class="kw">as </span>u8, |
| (notlen >> <span class="number">8</span>) <span class="kw">as </span>u8, |
| ]; |
| encoded.extend_from_slice(<span class="kw-2">&</span>text[..]); |
| encoded |
| }; |
| |
| <span class="comment">//let flags = TINFL_FLAG_COMPUTE_ADLER32 | TINFL_FLAG_PARSE_ZLIB_HEADER | |
| </span><span class="kw">let </span>flags = TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF; |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>b = DecompressorOxide::new(); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>b_buf = <span class="macro">vec!</span>[<span class="number">0</span>; LEN]; |
| |
| <span class="kw">let </span>b_status = tinfl_decompress_oxide(<span class="kw-2">&mut </span>b, <span class="kw-2">&</span>encoded[..], b_buf.as_mut_slice(), flags); |
| <span class="macro">assert_eq!</span>(b_buf[..b_status.<span class="number">2</span>], text[..]); |
| <span class="macro">assert_eq!</span>(b_status.<span class="number">0</span>, TINFLStatus::Done); |
| } |
| |
| <span class="kw">fn </span>masked_lookup(table: <span class="kw-2">&</span>HuffmanTable, bit_buf: BitBuffer) -> (i32, u32) { |
| <span class="kw">let </span>ret = table.lookup(bit_buf).unwrap(); |
| (ret.<span class="number">0 </span>& <span class="number">511</span>, ret.<span class="number">1</span>) |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>fixed_table_lookup() { |
| <span class="kw">let </span><span class="kw-2">mut </span>d = DecompressorOxide::new(); |
| d.block_type = <span class="number">1</span>; |
| start_static_table(<span class="kw-2">&mut </span>d); |
| <span class="kw">let </span><span class="kw-2">mut </span>l = LocalVars { |
| bit_buf: d.bit_buf, |
| num_bits: d.num_bits, |
| dist: d.dist, |
| counter: d.counter, |
| num_extra: d.num_extra, |
| }; |
| init_tree(<span class="kw-2">&mut </span>d, <span class="kw-2">&mut </span>l); |
| <span class="kw">let </span>llt = <span class="kw-2">&</span>d.tables[LITLEN_TABLE]; |
| <span class="kw">let </span>dt = <span class="kw-2">&</span>d.tables[DIST_TABLE]; |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b00001100</span>), (<span class="number">0</span>, <span class="number">8</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b00011110</span>), (<span class="number">72</span>, <span class="number">8</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b01011110</span>), (<span class="number">74</span>, <span class="number">8</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b11111101</span>), (<span class="number">143</span>, <span class="number">8</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b000010011</span>), (<span class="number">144</span>, <span class="number">9</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b111111111</span>), (<span class="number">255</span>, <span class="number">9</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b00000000</span>), (<span class="number">256</span>, <span class="number">7</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b1110100</span>), (<span class="number">279</span>, <span class="number">7</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b00000011</span>), (<span class="number">280</span>, <span class="number">8</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(llt, <span class="number">0b11100011</span>), (<span class="number">287</span>, <span class="number">8</span>)); |
| |
| <span class="macro">assert_eq!</span>(masked_lookup(dt, <span class="number">0</span>), (<span class="number">0</span>, <span class="number">5</span>)); |
| <span class="macro">assert_eq!</span>(masked_lookup(dt, <span class="number">20</span>), (<span class="number">5</span>, <span class="number">5</span>)); |
| } |
| |
| <span class="kw">fn </span>check_result(input: <span class="kw-2">&</span>[u8], expected_status: TINFLStatus, expected_state: State, zlib: bool) { |
| <span class="kw">let </span><span class="kw-2">mut </span>r = DecompressorOxide::default(); |
| <span class="kw">let </span><span class="kw-2">mut </span>output_buf = <span class="macro">vec!</span>[<span class="number">0</span>; <span class="number">1024 </span>* <span class="number">32</span>]; |
| <span class="kw">let </span>flags = <span class="kw">if </span>zlib { |
| inflate_flags::TINFL_FLAG_PARSE_ZLIB_HEADER |
| } <span class="kw">else </span>{ |
| <span class="number">0 |
| </span>} | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF |
| | TINFL_FLAG_HAS_MORE_INPUT; |
| <span class="kw">let </span>(d_status, _in_bytes, _out_bytes) = |
| decompress(<span class="kw-2">&mut </span>r, input, <span class="kw-2">&mut </span>output_buf, <span class="number">0</span>, flags); |
| <span class="macro">assert_eq!</span>(expected_status, d_status); |
| <span class="macro">assert_eq!</span>(expected_state, r.state); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>bogus_input() { |
| <span class="kw">use </span><span class="self">self</span>::check_result <span class="kw">as </span>cr; |
| <span class="kw">const </span>F: TINFLStatus = TINFLStatus::Failed; |
| <span class="kw">const </span>OK: TINFLStatus = TINFLStatus::Done; |
| <span class="comment">// Bad CM. |
| </span>cr(<span class="kw-2">&</span>[<span class="number">0x77</span>, <span class="number">0x85</span>], F, State::BadZlibHeader, <span class="bool-val">true</span>); |
| <span class="comment">// Bad window size (but check is correct). |
| </span>cr(<span class="kw-2">&</span>[<span class="number">0x88</span>, <span class="number">0x98</span>], F, State::BadZlibHeader, <span class="bool-val">true</span>); |
| <span class="comment">// Bad check bits. |
| </span>cr(<span class="kw-2">&</span>[<span class="number">0x78</span>, <span class="number">0x98</span>], F, State::BadZlibHeader, <span class="bool-val">true</span>); |
| |
| <span class="comment">// Too many code lengths. (From inflate library issues) |
| </span>cr( |
| <span class="string">b"M\xff\xffM*\xad\xad\xad\xad\xad\xad\xad\xcd\xcd\xcdM"</span>, |
| F, |
| State::BadDistOrLiteralTableLength, |
| <span class="bool-val">false</span>, |
| ); |
| |
| <span class="comment">// Bad CLEN (also from inflate library issues) |
| </span>cr( |
| <span class="string">b"\xdd\xff\xff*M\x94ffffffffff"</span>, |
| F, |
| State::BadDistOrLiteralTableLength, |
| <span class="bool-val">false</span>, |
| ); |
| |
| <span class="comment">// Port of inflate coverage tests from zlib-ng |
| // https://github.com/Dead2/zlib-ng/blob/develop/test/infcover.c |
| </span><span class="kw">let </span>c = |a, b, c| cr(a, b, c, <span class="bool-val">false</span>); |
| |
| <span class="comment">// Invalid uncompressed/raw block length. |
| </span>c(<span class="kw-2">&</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>], F, State::BadRawLength); |
| <span class="comment">// Ok empty uncompressed block. |
| </span>c(<span class="kw-2">&</span>[<span class="number">3</span>, <span class="number">0</span>], OK, State::DoneForever); |
| <span class="comment">// Invalid block type. |
| </span>c(<span class="kw-2">&</span>[<span class="number">6</span>], F, State::BlockTypeUnexpected); |
| <span class="comment">// Ok uncompressed block. |
| </span>c(<span class="kw-2">&</span>[<span class="number">1</span>, <span class="number">1</span>, <span class="number">0</span>, <span class="number">0xfe</span>, <span class="number">0xff</span>, <span class="number">0</span>], OK, State::DoneForever); |
| <span class="comment">// Too many litlens, we handle this later than zlib, so this test won't |
| // give the same result. |
| // c(&[0xfc, 0, 0], F, State::BadTotalSymbols); |
| // Invalid set of code lengths - TODO Check if this is the correct error for this. |
| </span>c(<span class="kw-2">&</span>[<span class="number">4</span>, <span class="number">0</span>, <span class="number">0xfe</span>, <span class="number">0xff</span>], F, State::BadTotalSymbols); |
| <span class="comment">// Invalid repeat in list of code lengths. |
| // (Try to repeat a non-existent code.) |
| </span>c(<span class="kw-2">&</span>[<span class="number">4</span>, <span class="number">0</span>, <span class="number">0x24</span>, <span class="number">0x49</span>, <span class="number">0</span>], F, State::BadCodeSizeDistPrevLookup); |
| <span class="comment">// Missing end of block code (should we have a separate error for this?) - fails on further input |
| // c(&[4, 0, 0x24, 0xe9, 0xff, 0x6d], F, State::BadTotalSymbols); |
| // Invalid set of literals/lengths |
| </span>c( |
| <span class="kw-2">&</span>[ |
| <span class="number">4</span>, <span class="number">0x80</span>, <span class="number">0x49</span>, <span class="number">0x92</span>, <span class="number">0x24</span>, <span class="number">0x49</span>, <span class="number">0x92</span>, <span class="number">0x24</span>, <span class="number">0x71</span>, <span class="number">0xff</span>, <span class="number">0xff</span>, <span class="number">0x93</span>, <span class="number">0x11</span>, <span class="number">0</span>, |
| ], |
| F, |
| State::BadTotalSymbols, |
| ); |
| <span class="comment">// Invalid set of distances _ needsmoreinput |
| // c(&[4, 0x80, 0x49, 0x92, 0x24, 0x49, 0x92, 0x24, 0x0f, 0xb4, 0xff, 0xff, 0xc3, 0x84], F, State::BadTotalSymbols); |
| // Invalid distance code |
| </span>c(<span class="kw-2">&</span>[<span class="number">2</span>, <span class="number">0x7e</span>, <span class="number">0xff</span>, <span class="number">0xff</span>], F, State::InvalidDist); |
| |
| <span class="comment">// Distance refers to position before the start |
| </span>c( |
| <span class="kw-2">&</span>[<span class="number">0x0c</span>, <span class="number">0xc0</span>, <span class="number">0x81</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">0x90</span>, <span class="number">0xff</span>, <span class="number">0x6b</span>, <span class="number">0x4</span>, <span class="number">0</span>], |
| F, |
| State::DistanceOutOfBounds, |
| ); |
| |
| <span class="comment">// Trailer |
| // Bad gzip trailer checksum GZip header not handled by miniz_oxide |
| //cr(&[0x1f, 0x8b, 0x08 ,0 ,0 ,0 ,0 ,0 ,0 ,0 ,0x03, 0, 0, 0, 0, 0x01], F, State::BadCRC, false) |
| // Bad gzip trailer length |
| //cr(&[0x1f, 0x8b, 0x08 ,0 ,0 ,0 ,0 ,0 ,0 ,0 ,0x03, 0, 0, 0, 0, 0, 0, 0, 0, 0x01], F, State::BadCRC, false) |
| </span>} |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>empty_output_buffer_non_wrapping() { |
| <span class="kw">let </span>encoded = [ |
| <span class="number">120</span>, <span class="number">156</span>, <span class="number">243</span>, <span class="number">72</span>, <span class="number">205</span>, <span class="number">201</span>, <span class="number">201</span>, <span class="number">215</span>, <span class="number">81</span>, <span class="number">168</span>, <span class="number">202</span>, <span class="number">201</span>, <span class="number">76</span>, <span class="number">82</span>, <span class="number">4</span>, <span class="number">0</span>, <span class="number">27</span>, <span class="number">101</span>, <span class="number">4</span>, <span class="number">19</span>, |
| ]; |
| <span class="kw">let </span>flags = TINFL_FLAG_COMPUTE_ADLER32 |
| | TINFL_FLAG_PARSE_ZLIB_HEADER |
| | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF; |
| <span class="kw">let </span><span class="kw-2">mut </span>r = DecompressorOxide::new(); |
| <span class="kw">let </span><span class="kw-2">mut </span>output_buf = <span class="macro">vec!</span>[]; |
| <span class="comment">// Check that we handle an empty buffer properly and not panicking. |
| // https://github.com/Frommi/miniz_oxide/issues/23 |
| </span><span class="kw">let </span>res = decompress(<span class="kw-2">&mut </span>r, <span class="kw-2">&</span>encoded, <span class="kw-2">&mut </span>output_buf, <span class="number">0</span>, flags); |
| <span class="macro">assert_eq!</span>(res, (TINFLStatus::HasMoreOutput, <span class="number">4</span>, <span class="number">0</span>)); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>empty_output_buffer_wrapping() { |
| <span class="kw">let </span>encoded = [ |
| <span class="number">0x73</span>, <span class="number">0x49</span>, <span class="number">0x4d</span>, <span class="number">0xcb</span>, <span class="number">0x49</span>, <span class="number">0x2c</span>, <span class="number">0x49</span>, <span class="number">0x55</span>, <span class="number">0x00</span>, <span class="number">0x11</span>, <span class="number">0x00</span>, |
| ]; |
| <span class="kw">let </span>flags = TINFL_FLAG_COMPUTE_ADLER32; |
| <span class="kw">let </span><span class="kw-2">mut </span>r = DecompressorOxide::new(); |
| <span class="kw">let </span><span class="kw-2">mut </span>output_buf = <span class="macro">vec!</span>[]; |
| <span class="comment">// Check that we handle an empty buffer properly and not panicking. |
| // https://github.com/Frommi/miniz_oxide/issues/23 |
| </span><span class="kw">let </span>res = decompress(<span class="kw-2">&mut </span>r, <span class="kw-2">&</span>encoded, <span class="kw-2">&mut </span>output_buf, <span class="number">0</span>, flags); |
| <span class="macro">assert_eq!</span>(res, (TINFLStatus::HasMoreOutput, <span class="number">2</span>, <span class="number">0</span>)); |
| } |
| } |
| </code></pre></div> |
| </section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-current-crate="miniz_oxide" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html> |
