mirror of
https://github.com/aaru-dps/libaaruformat.git
synced 2025-12-16 19:24:40 +00:00
430 lines
50 KiB
HTML
430 lines
50 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>libaaruformat: src/compression/cst.c Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<script type="text/javascript" src="clipboard.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript" src="cookie.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectalign">
|
|
<div id="projectname">libaaruformat<span id="projectnumber"> 1.0</span>
|
|
</div>
|
|
<div id="projectbrief">Aaru Data Preservation Suite - Format Library</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
$(function(){initNavTree('cst_8c_source.html','',''); });
|
|
</script>
|
|
<div id="container">
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">cst.c</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="cst_8c.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">/*</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment"> * This file is part of the Aaru Data Preservation Suite.</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment"> * Copyright (c) 2019-2025 Natalia Portillo.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment"> *</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment"> * This library is free software; you can redistribute it and/or modify</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment"> * it under the terms of the GNU Lesser General Public License as</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment"> * published by the Free Software Foundation; either version 2.1 of the</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment"> * License, or (at your option) any later version.</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment"> *</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment"> * This library is distributed in the hope that it will be useful, but</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment"> * WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment"> * Lesser General Public License for more details.</span></div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment"> *</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment"> * You should have received a copy of the GNU Lesser General Public</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment"> * License along with this library; if not, see <http://www.gnu.org/licenses/>.</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment"> */</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <stdint.h></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <stdlib.h></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <string.h></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<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><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>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> uint8_t *r = NULL;</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> uint8_t *s = NULL;</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> uint8_t *t = NULL;</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> uint8_t *u = NULL;</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> uint8_t *v = NULL;</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> uint8_t *w = NULL;</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">size_t</span> q_start = 0;</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">size_t</span> r_start = 0;</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordtype">size_t</span> s_start = 0;</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordtype">size_t</span> t_start = 0;</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordtype">size_t</span> u_start = 0;</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordtype">size_t</span> v_start = 0;</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordtype">size_t</span> w_start = 0;</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordtype">size_t</span> i = 0;</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</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="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> p = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> q = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> r = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> s = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> t = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> u = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> v = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> w = malloc(length / 8);</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</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="l00066" name="l00066"></a><span class="lineno"> 66</span> {</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> free(p);</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> free(q);</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> free(r);</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> free(s);</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> free(t);</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> free(u);</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> free(v);</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> free(w);</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</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="l00076" name="l00076"></a><span class="lineno"> 76</span> }</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> </div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">for</span>(i = 0; i < length; i += 8)</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> {</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> p[i / 8] = (uint8_t)(interleaved[i] & 0x80);</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> p[i / 8] += (interleaved[i + 1] & 0x80) >> 1;</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> p[i / 8] += (interleaved[i + 2] & 0x80) >> 2;</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> p[i / 8] += (interleaved[i + 3] & 0x80) >> 3;</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> p[i / 8] += (interleaved[i + 4] & 0x80) >> 4;</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> p[i / 8] += (interleaved[i + 5] & 0x80) >> 5;</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> p[i / 8] += (interleaved[i + 6] & 0x80) >> 6;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> p[i / 8] += (interleaved[i + 7] & 0x80) >> 7;</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> q[i / 8] = (uint8_t)((interleaved[i] & 0x40) << 1);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> q[i / 8] += interleaved[i + 1] & 0x40;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> q[i / 8] += (interleaved[i + 2] & 0x40) >> 1;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> q[i / 8] += (interleaved[i + 3] & 0x40) >> 2;</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> q[i / 8] += (interleaved[i + 4] & 0x40) >> 3;</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> q[i / 8] += (interleaved[i + 5] & 0x40) >> 4;</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> q[i / 8] += (interleaved[i + 6] & 0x40) >> 5;</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> q[i / 8] += (interleaved[i + 7] & 0x40) >> 6;</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> r[i / 8] = (uint8_t)((interleaved[i] & 0x20) << 2);</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> r[i / 8] += (interleaved[i + 1] & 0x20) << 1;</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> r[i / 8] += interleaved[i + 2] & 0x20;</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> r[i / 8] += (interleaved[i + 3] & 0x20) >> 1;</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> r[i / 8] += (interleaved[i + 4] & 0x20) >> 2;</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> r[i / 8] += (interleaved[i + 5] & 0x20) >> 3;</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> r[i / 8] += (interleaved[i + 6] & 0x20) >> 4;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> r[i / 8] += (interleaved[i + 7] & 0x20) >> 5;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> s[i / 8] = (uint8_t)((interleaved[i] & 0x10) << 3);</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> s[i / 8] += (interleaved[i + 1] & 0x10) << 2;</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> s[i / 8] += (interleaved[i + 2] & 0x10) << 1;</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> s[i / 8] += interleaved[i + 3] & 0x10;</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> s[i / 8] += (interleaved[i + 4] & 0x10) >> 1;</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> s[i / 8] += (interleaved[i + 5] & 0x10) >> 2;</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> s[i / 8] += (interleaved[i + 6] & 0x10) >> 3;</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> s[i / 8] += (interleaved[i + 7] & 0x10) >> 4;</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> t[i / 8] = (uint8_t)((interleaved[i] & 0x08) << 4);</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> t[i / 8] += (interleaved[i + 1] & 0x08) << 3;</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> t[i / 8] += (interleaved[i + 2] & 0x08) << 2;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> t[i / 8] += (interleaved[i + 3] & 0x08) << 1;</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> t[i / 8] += interleaved[i + 4] & 0x08;</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> t[i / 8] += (interleaved[i + 5] & 0x08) >> 1;</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> t[i / 8] += (interleaved[i + 6] & 0x08) >> 2;</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> t[i / 8] += (interleaved[i + 7] & 0x08) >> 3;</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> u[i / 8] = (uint8_t)((interleaved[i] & 0x04) << 5);</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> u[i / 8] += (interleaved[i + 1] & 0x04) << 4;</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> u[i / 8] += (interleaved[i + 2] & 0x04) << 3;</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> u[i / 8] += (interleaved[i + 3] & 0x04) << 2;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> u[i / 8] += (interleaved[i + 4] & 0x04) << 1;</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> u[i / 8] += interleaved[i + 5] & 0x04;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> u[i / 8] += (interleaved[i + 6] & 0x04) >> 1;</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> u[i / 8] += (interleaved[i + 7] & 0x04) >> 2;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> </div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> v[i / 8] = (uint8_t)((interleaved[i] & 0x02) << 6);</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> v[i / 8] += (interleaved[i + 1] & 0x02) << 5;</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> v[i / 8] += (interleaved[i + 2] & 0x02) << 4;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> v[i / 8] += (interleaved[i + 3] & 0x02) << 3;</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> v[i / 8] += (interleaved[i + 4] & 0x02) << 2;</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> v[i / 8] += (interleaved[i + 5] & 0x02) << 1;</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> v[i / 8] += interleaved[i + 6] & 0x02;</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> v[i / 8] += (interleaved[i + 7] & 0x02) >> 1;</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> </div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> w[i / 8] = (uint8_t)((interleaved[i] & 0x01) << 7);</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> w[i / 8] += (interleaved[i + 1] & 0x01) << 6;</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> w[i / 8] += (interleaved[i + 2] & 0x01) << 5;</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> w[i / 8] += (interleaved[i + 3] & 0x01) << 4;</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> w[i / 8] += (interleaved[i + 4] & 0x01) << 3;</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> w[i / 8] += (interleaved[i + 5] & 0x01) << 2;</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> w[i / 8] += (interleaved[i + 6] & 0x01) << 1;</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> w[i / 8] += interleaved[i + 7] & 0x01;</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> }</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> q_start = length / 8 * 1;</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> r_start = length / 8 * 2;</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> s_start = length / 8 * 3;</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> t_start = length / 8 * 4;</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> u_start = length / 8 * 5;</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> v_start = length / 8 * 6;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> w_start = length / 8 * 7;</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordflow">for</span>(i = 0; i < length / 8; i++)</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> {</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> sequential[i] = p[i];</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> sequential[q_start + i] = q[i];</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> sequential[r_start + i] = r[i];</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> sequential[s_start + i] = s[i];</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> sequential[t_start + i] = t[i];</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> sequential[u_start + i] = u[i];</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> sequential[v_start + i] = v[i];</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> sequential[w_start + i] = w[i];</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> }</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> </div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> free(p);</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> free(q);</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> free(r);</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> free(s);</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> free(t);</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> free(u);</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> free(v);</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> free(w);</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</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="l00183" name="l00183"></a><span class="lineno"> 183</span>}</div>
|
|
</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><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>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a href="dir_40ed6a89610fc2370cf3ffcd6469b940.html">compression</a></li><li class="navelem"><a href="cst_8c.html">cst.c</a></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|