mirror of
https://github.com/aaru-dps/libaaruformat.git
synced 2025-12-16 19:24:40 +00:00
Update doxygen documentation.
This commit is contained in:
@@ -117,7 +117,7 @@ $(function(){initNavTree('cst_8c_source.html','',''); });
|
||||
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "<a class="code" href="aaruformat_8h.html">aaruformat.h</a>"</span></div>
|
||||
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span></div>
|
||||
<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="decls_8h.html#a0b29337ce6fedc79bf7d1a84d92173d6"> 35</a></span>int32_t <a class="code hl_function" href="cst_8c.html#aabb2d2d40402e948ccf5411d04a0d2f9">aaruf_cst_transform</a>(<span class="keyword">const</span> uint8_t *interleaved, uint8_t *sequential, <span class="keyword">const</span> <span class="keywordtype">size_t</span> length)</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="decls_8h.html#a0b29337ce6fedc79bf7d1a84d92173d6"> 35</a></span><a class="code hl_define" href="decls_8h.html#a9001412c35f3c92d3a9320d27b0d97f9">AARU_EXPORT</a> int32_t <a class="code hl_define" href="decls_8h.html#a018e0da1c1f7e4f6187a982c0e40e056">AARU_CALL</a> <a class="code hl_function" href="cst_8c.html#aabb2d2d40402e948ccf5411d04a0d2f9">aaruf_cst_transform</a>(<span class="keyword">const</span> uint8_t *interleaved, uint8_t *sequential, <span class="keyword">const</span> <span class="keywordtype">size_t</span> length)</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span>{</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> uint8_t *p = NULL;</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> uint8_t *q = NULL;</div>
|
||||
@@ -269,146 +269,149 @@ $(function(){initNavTree('cst_8c_source.html','',''); });
|
||||
</div>
|
||||
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span></div>
|
||||
<div class="foldopen" id="foldopen00193" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"><a class="line" href="decls_8h.html#adee4702d830dc13b78e0a6803658c40e"> 193</a></span>int32_t <a class="code hl_function" href="cst_8c.html#a1a547b6235034537a0564d1f46f4cbad">aaruf_cst_untransform</a>(<span class="keyword">const</span> uint8_t *sequential, uint8_t *interleaved, <span class="keyword">const</span> <span class="keywordtype">size_t</span> length)</div>
|
||||
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span>{</div>
|
||||
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordtype">size_t</span> i;</div>
|
||||
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
|
||||
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keywordflow">if</span>(interleaved == NULL || sequential == NULL) <span class="keywordflow">return</span> <a class="code hl_define" href="errors_8h.html#ae7eea5936a22100db46aac3e4312cdae">AARUF_ERROR_BUFFER_TOO_SMALL</a>;</div>
|
||||
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div>
|
||||
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> uint8_t *p = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> uint8_t *q = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> uint8_t *r = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> uint8_t *s = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> uint8_t *t = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> uint8_t *u = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> uint8_t *v = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> uint8_t *w = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> </div>
|
||||
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keywordflow">if</span>(p == NULL || q == NULL || r == NULL || s == NULL || t == NULL || u == NULL || v == NULL || w == NULL)</div>
|
||||
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> {</div>
|
||||
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> free(p);</div>
|
||||
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> free(q);</div>
|
||||
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> free(r);</div>
|
||||
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> free(s);</div>
|
||||
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> free(t);</div>
|
||||
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> free(u);</div>
|
||||
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> free(v);</div>
|
||||
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> free(w);</div>
|
||||
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="keywordflow">return</span> <a class="code hl_define" href="errors_8h.html#a35a771e3648bf971a004d4b2be9b5ec4">AARUF_ERROR_NOT_ENOUGH_MEMORY</a>;</div>
|
||||
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> }</div>
|
||||
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> </div>
|
||||
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keywordtype">size_t</span> q_start = length / 8 * 1;</div>
|
||||
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordtype">size_t</span> r_start = length / 8 * 2;</div>
|
||||
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordtype">size_t</span> s_start = length / 8 * 3;</div>
|
||||
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordtype">size_t</span> t_start = length / 8 * 4;</div>
|
||||
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">size_t</span> u_start = length / 8 * 5;</div>
|
||||
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordtype">size_t</span> v_start = length / 8 * 6;</div>
|
||||
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordtype">size_t</span> w_start = length / 8 * 7;</div>
|
||||
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
||||
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordflow">for</span>(i = 0; i < length / 8; i++)</div>
|
||||
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> {</div>
|
||||
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> p[i] = sequential[i];</div>
|
||||
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> q[i] = sequential[q_start + i];</div>
|
||||
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> r[i] = sequential[r_start + i];</div>
|
||||
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> s[i] = sequential[s_start + i];</div>
|
||||
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> t[i] = sequential[t_start + i];</div>
|
||||
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> u[i] = sequential[u_start + i];</div>
|
||||
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> v[i] = sequential[v_start + i];</div>
|
||||
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> w[i] = sequential[w_start + i];</div>
|
||||
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> }</div>
|
||||
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> </div>
|
||||
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> memset(interleaved, 0, length);</div>
|
||||
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> </div>
|
||||
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordflow">for</span>(i = 0; i < length; i += 8)</div>
|
||||
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> {</div>
|
||||
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> interleaved[i] += (p[i / 8] & 0x80) == 0x80 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> interleaved[i + 1] += (p[i / 8] & 0x40) == 0x40 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> interleaved[i + 2] += (p[i / 8] & 0x20) == 0x20 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> interleaved[i + 3] += (p[i / 8] & 0x10) == 0x10 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> interleaved[i + 4] += (p[i / 8] & 0x08) == 0x08 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> interleaved[i + 5] += (p[i / 8] & 0x04) == 0x04 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> interleaved[i + 6] += (p[i / 8] & 0x02) == 0x02 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> interleaved[i + 7] += (p[i / 8] & 0x01) == 0x01 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> </div>
|
||||
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> interleaved[i] += (q[i / 8] & 0x80) == 0x80 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> interleaved[i + 1] += (q[i / 8] & 0x40) == 0x40 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> interleaved[i + 2] += (q[i / 8] & 0x20) == 0x20 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> interleaved[i + 3] += (q[i / 8] & 0x10) == 0x10 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> interleaved[i + 4] += (q[i / 8] & 0x08) == 0x08 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> interleaved[i + 5] += (q[i / 8] & 0x04) == 0x04 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> interleaved[i + 6] += (q[i / 8] & 0x02) == 0x02 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> interleaved[i + 7] += (q[i / 8] & 0x01) == 0x01 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
|
||||
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> interleaved[i] += (r[i / 8] & 0x80) == 0x80 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> interleaved[i + 1] += (r[i / 8] & 0x40) == 0x40 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> interleaved[i + 2] += (r[i / 8] & 0x20) == 0x20 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> interleaved[i + 3] += (r[i / 8] & 0x10) == 0x10 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> interleaved[i + 4] += (r[i / 8] & 0x08) == 0x08 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> interleaved[i + 5] += (r[i / 8] & 0x04) == 0x04 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> interleaved[i + 6] += (r[i / 8] & 0x02) == 0x02 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> interleaved[i + 7] += (r[i / 8] & 0x01) == 0x01 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> </div>
|
||||
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> interleaved[i] += (s[i / 8] & 0x80) == 0x80 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> interleaved[i + 1] += (s[i / 8] & 0x40) == 0x40 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> interleaved[i + 2] += (s[i / 8] & 0x20) == 0x20 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> interleaved[i + 3] += (s[i / 8] & 0x10) == 0x10 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> interleaved[i + 4] += (s[i / 8] & 0x08) == 0x08 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> interleaved[i + 5] += (s[i / 8] & 0x04) == 0x04 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> interleaved[i + 6] += (s[i / 8] & 0x02) == 0x02 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> interleaved[i + 7] += (s[i / 8] & 0x01) == 0x01 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> </div>
|
||||
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> interleaved[i] += (t[i / 8] & 0x80) == 0x80 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> interleaved[i + 1] += (t[i / 8] & 0x40) == 0x40 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> interleaved[i + 2] += (t[i / 8] & 0x20) == 0x20 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> interleaved[i + 3] += (t[i / 8] & 0x10) == 0x10 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> interleaved[i + 4] += (t[i / 8] & 0x08) == 0x08 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> interleaved[i + 5] += (t[i / 8] & 0x04) == 0x04 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> interleaved[i + 6] += (t[i / 8] & 0x02) == 0x02 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> interleaved[i + 7] += (t[i / 8] & 0x01) == 0x01 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> </div>
|
||||
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> interleaved[i] += (u[i / 8] & 0x80) == 0x80 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> interleaved[i + 1] += (u[i / 8] & 0x40) == 0x40 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> interleaved[i + 2] += (u[i / 8] & 0x20) == 0x20 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> interleaved[i + 3] += (u[i / 8] & 0x10) == 0x10 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> interleaved[i + 4] += (u[i / 8] & 0x08) == 0x08 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> interleaved[i + 5] += (u[i / 8] & 0x04) == 0x04 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> interleaved[i + 6] += (u[i / 8] & 0x02) == 0x02 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> interleaved[i + 7] += (u[i / 8] & 0x01) == 0x01 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> </div>
|
||||
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> interleaved[i] += (v[i / 8] & 0x80) == 0x80 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> interleaved[i + 1] += (v[i / 8] & 0x40) == 0x40 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> interleaved[i + 2] += (v[i / 8] & 0x20) == 0x20 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> interleaved[i + 3] += (v[i / 8] & 0x10) == 0x10 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> interleaved[i + 4] += (v[i / 8] & 0x08) == 0x08 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> interleaved[i + 5] += (v[i / 8] & 0x04) == 0x04 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> interleaved[i + 6] += (v[i / 8] & 0x02) == 0x02 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> interleaved[i + 7] += (v[i / 8] & 0x01) == 0x01 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> </div>
|
||||
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> interleaved[i] += (w[i / 8] & 0x80) == 0x80 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> interleaved[i + 1] += (w[i / 8] & 0x40) == 0x40 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> interleaved[i + 2] += (w[i / 8] & 0x20) == 0x20 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> interleaved[i + 3] += (w[i / 8] & 0x10) == 0x10 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> interleaved[i + 4] += (w[i / 8] & 0x08) == 0x08 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> interleaved[i + 5] += (w[i / 8] & 0x04) == 0x04 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> interleaved[i + 6] += (w[i / 8] & 0x02) == 0x02 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> interleaved[i + 7] += (w[i / 8] & 0x01) == 0x01 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> }</div>
|
||||
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> </div>
|
||||
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> free(p);</div>
|
||||
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> free(q);</div>
|
||||
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> free(r);</div>
|
||||
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> free(s);</div>
|
||||
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> free(t);</div>
|
||||
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> free(u);</div>
|
||||
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> free(v);</div>
|
||||
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> free(w);</div>
|
||||
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> </div>
|
||||
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="keywordflow">return</span> <a class="code hl_define" href="errors_8h.html#a1d6e49f7e8a1fa489efa0a582e90b5de">AARUF_STATUS_OK</a>;</div>
|
||||
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span>}</div>
|
||||
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"><a class="line" href="decls_8h.html#adee4702d830dc13b78e0a6803658c40e"> 193</a></span><a class="code hl_define" href="decls_8h.html#a9001412c35f3c92d3a9320d27b0d97f9">AARU_EXPORT</a> int32_t <a class="code hl_define" href="decls_8h.html#a018e0da1c1f7e4f6187a982c0e40e056">AARU_CALL</a> <a class="code hl_function" href="cst_8c.html#a1a547b6235034537a0564d1f46f4cbad">aaruf_cst_untransform</a>(<span class="keyword">const</span> uint8_t *sequential, uint8_t *interleaved,</div>
|
||||
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> length)</div>
|
||||
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span>{</div>
|
||||
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordtype">size_t</span> i;</div>
|
||||
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> </div>
|
||||
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordflow">if</span>(interleaved == NULL || sequential == NULL) <span class="keywordflow">return</span> <a class="code hl_define" href="errors_8h.html#ae7eea5936a22100db46aac3e4312cdae">AARUF_ERROR_BUFFER_TOO_SMALL</a>;</div>
|
||||
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> </div>
|
||||
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> uint8_t *p = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> uint8_t *q = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> uint8_t *r = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> uint8_t *s = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> uint8_t *t = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> uint8_t *u = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> uint8_t *v = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> uint8_t *w = malloc(length / 8);</div>
|
||||
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> </div>
|
||||
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="keywordflow">if</span>(p == NULL || q == NULL || r == NULL || s == NULL || t == NULL || u == NULL || v == NULL || w == NULL)</div>
|
||||
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> {</div>
|
||||
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> free(p);</div>
|
||||
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> free(q);</div>
|
||||
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> free(r);</div>
|
||||
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> free(s);</div>
|
||||
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> free(t);</div>
|
||||
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> free(u);</div>
|
||||
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> free(v);</div>
|
||||
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> free(w);</div>
|
||||
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keywordflow">return</span> <a class="code hl_define" href="errors_8h.html#a35a771e3648bf971a004d4b2be9b5ec4">AARUF_ERROR_NOT_ENOUGH_MEMORY</a>;</div>
|
||||
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> }</div>
|
||||
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> </div>
|
||||
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordtype">size_t</span> q_start = length / 8 * 1;</div>
|
||||
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordtype">size_t</span> r_start = length / 8 * 2;</div>
|
||||
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordtype">size_t</span> s_start = length / 8 * 3;</div>
|
||||
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">size_t</span> t_start = length / 8 * 4;</div>
|
||||
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordtype">size_t</span> u_start = length / 8 * 5;</div>
|
||||
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordtype">size_t</span> v_start = length / 8 * 6;</div>
|
||||
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keywordtype">size_t</span> w_start = length / 8 * 7;</div>
|
||||
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> </div>
|
||||
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">for</span>(i = 0; i < length / 8; i++)</div>
|
||||
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> {</div>
|
||||
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> p[i] = sequential[i];</div>
|
||||
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> q[i] = sequential[q_start + i];</div>
|
||||
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> r[i] = sequential[r_start + i];</div>
|
||||
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> s[i] = sequential[s_start + i];</div>
|
||||
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> t[i] = sequential[t_start + i];</div>
|
||||
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> u[i] = sequential[u_start + i];</div>
|
||||
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> v[i] = sequential[v_start + i];</div>
|
||||
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> w[i] = sequential[w_start + i];</div>
|
||||
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
|
||||
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
|
||||
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> memset(interleaved, 0, length);</div>
|
||||
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
|
||||
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keywordflow">for</span>(i = 0; i < length; i += 8)</div>
|
||||
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> {</div>
|
||||
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> interleaved[i] += (p[i / 8] & 0x80) == 0x80 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> interleaved[i + 1] += (p[i / 8] & 0x40) == 0x40 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> interleaved[i + 2] += (p[i / 8] & 0x20) == 0x20 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> interleaved[i + 3] += (p[i / 8] & 0x10) == 0x10 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> interleaved[i + 4] += (p[i / 8] & 0x08) == 0x08 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> interleaved[i + 5] += (p[i / 8] & 0x04) == 0x04 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> interleaved[i + 6] += (p[i / 8] & 0x02) == 0x02 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> interleaved[i + 7] += (p[i / 8] & 0x01) == 0x01 ? 0x80 : 0;</div>
|
||||
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> </div>
|
||||
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> interleaved[i] += (q[i / 8] & 0x80) == 0x80 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> interleaved[i + 1] += (q[i / 8] & 0x40) == 0x40 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> interleaved[i + 2] += (q[i / 8] & 0x20) == 0x20 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> interleaved[i + 3] += (q[i / 8] & 0x10) == 0x10 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> interleaved[i + 4] += (q[i / 8] & 0x08) == 0x08 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> interleaved[i + 5] += (q[i / 8] & 0x04) == 0x04 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> interleaved[i + 6] += (q[i / 8] & 0x02) == 0x02 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> interleaved[i + 7] += (q[i / 8] & 0x01) == 0x01 ? 0x40 : 0;</div>
|
||||
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> </div>
|
||||
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> interleaved[i] += (r[i / 8] & 0x80) == 0x80 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> interleaved[i + 1] += (r[i / 8] & 0x40) == 0x40 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> interleaved[i + 2] += (r[i / 8] & 0x20) == 0x20 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> interleaved[i + 3] += (r[i / 8] & 0x10) == 0x10 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> interleaved[i + 4] += (r[i / 8] & 0x08) == 0x08 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> interleaved[i + 5] += (r[i / 8] & 0x04) == 0x04 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> interleaved[i + 6] += (r[i / 8] & 0x02) == 0x02 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> interleaved[i + 7] += (r[i / 8] & 0x01) == 0x01 ? 0x20 : 0;</div>
|
||||
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> </div>
|
||||
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> interleaved[i] += (s[i / 8] & 0x80) == 0x80 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> interleaved[i + 1] += (s[i / 8] & 0x40) == 0x40 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> interleaved[i + 2] += (s[i / 8] & 0x20) == 0x20 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> interleaved[i + 3] += (s[i / 8] & 0x10) == 0x10 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> interleaved[i + 4] += (s[i / 8] & 0x08) == 0x08 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> interleaved[i + 5] += (s[i / 8] & 0x04) == 0x04 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> interleaved[i + 6] += (s[i / 8] & 0x02) == 0x02 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> interleaved[i + 7] += (s[i / 8] & 0x01) == 0x01 ? 0x10 : 0;</div>
|
||||
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
||||
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> interleaved[i] += (t[i / 8] & 0x80) == 0x80 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> interleaved[i + 1] += (t[i / 8] & 0x40) == 0x40 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> interleaved[i + 2] += (t[i / 8] & 0x20) == 0x20 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> interleaved[i + 3] += (t[i / 8] & 0x10) == 0x10 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> interleaved[i + 4] += (t[i / 8] & 0x08) == 0x08 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> interleaved[i + 5] += (t[i / 8] & 0x04) == 0x04 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> interleaved[i + 6] += (t[i / 8] & 0x02) == 0x02 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> interleaved[i + 7] += (t[i / 8] & 0x01) == 0x01 ? 0x08 : 0;</div>
|
||||
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> </div>
|
||||
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> interleaved[i] += (u[i / 8] & 0x80) == 0x80 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> interleaved[i + 1] += (u[i / 8] & 0x40) == 0x40 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> interleaved[i + 2] += (u[i / 8] & 0x20) == 0x20 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> interleaved[i + 3] += (u[i / 8] & 0x10) == 0x10 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> interleaved[i + 4] += (u[i / 8] & 0x08) == 0x08 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> interleaved[i + 5] += (u[i / 8] & 0x04) == 0x04 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> interleaved[i + 6] += (u[i / 8] & 0x02) == 0x02 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> interleaved[i + 7] += (u[i / 8] & 0x01) == 0x01 ? 0x04 : 0;</div>
|
||||
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> </div>
|
||||
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> interleaved[i] += (v[i / 8] & 0x80) == 0x80 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> interleaved[i + 1] += (v[i / 8] & 0x40) == 0x40 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> interleaved[i + 2] += (v[i / 8] & 0x20) == 0x20 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> interleaved[i + 3] += (v[i / 8] & 0x10) == 0x10 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> interleaved[i + 4] += (v[i / 8] & 0x08) == 0x08 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> interleaved[i + 5] += (v[i / 8] & 0x04) == 0x04 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> interleaved[i + 6] += (v[i / 8] & 0x02) == 0x02 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> interleaved[i + 7] += (v[i / 8] & 0x01) == 0x01 ? 0x02 : 0;</div>
|
||||
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> </div>
|
||||
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> interleaved[i] += (w[i / 8] & 0x80) == 0x80 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> interleaved[i + 1] += (w[i / 8] & 0x40) == 0x40 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> interleaved[i + 2] += (w[i / 8] & 0x20) == 0x20 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> interleaved[i + 3] += (w[i / 8] & 0x10) == 0x10 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> interleaved[i + 4] += (w[i / 8] & 0x08) == 0x08 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> interleaved[i + 5] += (w[i / 8] & 0x04) == 0x04 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> interleaved[i + 6] += (w[i / 8] & 0x02) == 0x02 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> interleaved[i + 7] += (w[i / 8] & 0x01) == 0x01 ? 0x01 : 0;</div>
|
||||
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> }</div>
|
||||
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> </div>
|
||||
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> free(p);</div>
|
||||
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> free(q);</div>
|
||||
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> free(r);</div>
|
||||
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> free(s);</div>
|
||||
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> free(t);</div>
|
||||
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> free(u);</div>
|
||||
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> free(v);</div>
|
||||
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> free(w);</div>
|
||||
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> </div>
|
||||
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <span class="keywordflow">return</span> <a class="code hl_define" href="errors_8h.html#a1d6e49f7e8a1fa489efa0a582e90b5de">AARUF_STATUS_OK</a>;</div>
|
||||
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span>}</div>
|
||||
</div>
|
||||
<div class="ttc" id="aaaruformat_8h_html"><div class="ttname"><a href="aaruformat_8h.html">aaruformat.h</a></div></div>
|
||||
<div class="ttc" id="acst_8c_html_a1a547b6235034537a0564d1f46f4cbad"><div class="ttname"><a href="cst_8c.html#a1a547b6235034537a0564d1f46f4cbad">aaruf_cst_untransform</a></div><div class="ttdeci">int32_t aaruf_cst_untransform(const uint8_t *sequential, uint8_t *interleaved, const size_t length)</div><div class="ttdoc">Reverses the CST (Claunia's Subchannel Transform) transformation from sequential to interleaved data.</div><div class="ttdef"><b>Definition</b> <a href="#l00193">cst.c:193</a></div></div>
|
||||
<div class="ttc" id="acst_8c_html_aabb2d2d40402e948ccf5411d04a0d2f9"><div class="ttname"><a href="cst_8c.html#aabb2d2d40402e948ccf5411d04a0d2f9">aaruf_cst_transform</a></div><div class="ttdeci">int32_t aaruf_cst_transform(const uint8_t *interleaved, uint8_t *sequential, const size_t length)</div><div class="ttdoc">Transforms interleaved subchannel data to sequential format.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">cst.c:35</a></div></div>
|
||||
<div class="ttc" id="adecls_8h_html_a018e0da1c1f7e4f6187a982c0e40e056"><div class="ttname"><a href="decls_8h.html#a018e0da1c1f7e4f6187a982c0e40e056">AARU_CALL</a></div><div class="ttdeci">#define AARU_CALL</div><div class="ttdef"><b>Definition</b> <a href="decls_8h_source.html#l00045">decls.h:45</a></div></div>
|
||||
<div class="ttc" id="adecls_8h_html_a9001412c35f3c92d3a9320d27b0d97f9"><div class="ttname"><a href="decls_8h.html#a9001412c35f3c92d3a9320d27b0d97f9">AARU_EXPORT</a></div><div class="ttdeci">#define AARU_EXPORT</div><div class="ttdef"><b>Definition</b> <a href="decls_8h_source.html#l00054">decls.h:54</a></div></div>
|
||||
<div class="ttc" id="aerrors_8h_html_a1d6e49f7e8a1fa489efa0a582e90b5de"><div class="ttname"><a href="errors_8h.html#a1d6e49f7e8a1fa489efa0a582e90b5de">AARUF_STATUS_OK</a></div><div class="ttdeci">#define AARUF_STATUS_OK</div><div class="ttdoc">Sector present and read without uncorrectable errors.</div><div class="ttdef"><b>Definition</b> <a href="errors_8h_source.html#l00075">errors.h:75</a></div></div>
|
||||
<div class="ttc" id="aerrors_8h_html_a35a771e3648bf971a004d4b2be9b5ec4"><div class="ttname"><a href="errors_8h.html#a35a771e3648bf971a004d4b2be9b5ec4">AARUF_ERROR_NOT_ENOUGH_MEMORY</a></div><div class="ttdeci">#define AARUF_ERROR_NOT_ENOUGH_MEMORY</div><div class="ttdoc">Memory allocation failure (critical).</div><div class="ttdef"><b>Definition</b> <a href="errors_8h_source.html#l00048">errors.h:48</a></div></div>
|
||||
<div class="ttc" id="aerrors_8h_html_ae7eea5936a22100db46aac3e4312cdae"><div class="ttname"><a href="errors_8h.html#ae7eea5936a22100db46aac3e4312cdae">AARUF_ERROR_BUFFER_TOO_SMALL</a></div><div class="ttdeci">#define AARUF_ERROR_BUFFER_TOO_SMALL</div><div class="ttdoc">Caller-supplied buffer insufficient for data.</div><div class="ttdef"><b>Definition</b> <a href="errors_8h_source.html#l00049">errors.h:49</a></div></div>
|
||||
|
||||
Reference in New Issue
Block a user